aboutsummaryrefslogtreecommitdiff
path: root/libgcc/config/s390/libgcc-glibc.ver
diff options
context:
space:
mode:
authorRichard Biener <rguenther@suse.de>2025-08-20 11:06:53 +0200
committerRichard Biener <rguenth@gcc.gnu.org>2025-08-20 13:34:11 +0200
commitfc23b539caa16a108bd16bcfcb86fe261a9aa174 (patch)
tree0826f1878c492b16fd9021df0a4dd145effaae0c /libgcc/config/s390/libgcc-glibc.ver
parent0f15ff7b511493e9197e6153b794081c1557ba02 (diff)
downloadgcc-master.zip
gcc-master.tar.gz
gcc-master.tar.bz2
tree-optimization/114480 - speedup IDF computeHEADtrunkmaster
The testcase in the PR shows that it's worth splitting the processing of the initial workset, which is def_blocks from the main iteration. This reduces SSA incremental update time from 44.7s to 32.9s. Further changing the workset bitmap of the main iteration to a vector speeds up things further to 23.5s for an overall nearly halving of the SSA incremental update compile-time and an overall 12% compile-time saving at -O1. Using bitmap_ior in the first loop or avoiding (immediate) re-processing of blocks in def_blocks does not make a measurable difference for the testcase so I left this as-is. PR tree-optimization/114480 * cfganal.cc (compute_idf): Split processing of the initial workset from the main iteration. Use a vector for the workset of the main iteration.
Diffstat (limited to 'libgcc/config/s390/libgcc-glibc.ver')
0 files changed, 0 insertions, 0 deletions