diff options
author | Richard Biener <rguenther@suse.de> | 2022-03-10 12:40:02 +0100 |
---|---|---|
committer | Richard Biener <rguenther@suse.de> | 2022-03-10 13:40:25 +0100 |
commit | 83bc478d3ba6a40fe3cec72dc9057ceca4dc9137 (patch) | |
tree | 38eca9bcd873f5336ccebe2e2f08ca757f9a1edf /gcc/fortran | |
parent | cfaa2fac42f6f4bddb197dc1fc601f2ba136f9f0 (diff) | |
download | gcc-83bc478d3ba6a40fe3cec72dc9057ceca4dc9137.zip gcc-83bc478d3ba6a40fe3cec72dc9057ceca4dc9137.tar.gz gcc-83bc478d3ba6a40fe3cec72dc9057ceca4dc9137.tar.bz2 |
tree-optimization/102943 - avoid (re-)computing dominance bitmap
Currently back_propagate_equivalences tries to optimize dominance
queries in a smart way but it fails to notice that when fast indexes
are available the dominance query is fast (when called from DOM).
It also re-computes the dominance bitmap for each equivalence recorded
on an edge, which for FP are usually several. Finally it fails to
use the tree bitmap view for efficiency. Overall this cuts 7
seconds of compile-time from originally 77 in the slowest LTRANS
unit when building 521.wrf_r.
2022-03-10 Richard Biener <rguenther@suse.de>
PR tree-optimization/102943
* tree-ssa-dom.cc (back_propagate_equivalences): Only
populate the dominance bitmap if fast queries are not
available. Use a tree view bitmap.
(record_temporary_equivalences): Cache the dominance bitmap
across all equivalences on the edge.
Diffstat (limited to 'gcc/fortran')
0 files changed, 0 insertions, 0 deletions