mirrors/gcc
1
0
Fork 0
mirror of https://gcc.gnu.org/git/gcc.git synced 2024-11-23 19:03:59 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

tree-optimization/102943 - avoid (re-)computing dominance bitmap

Browse Source 
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.
This commit is contained in:
Richard Biener 2022-03-10 12:40:02 +01:00
parent cfaa2fac42
commit 83bc478d3b
1 changed files with 36 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

60
gcc/tree-ssa-dom.cc
View File

@ -1025,12 +1025,13 @@ dom_valueize (tree t)
additional equivalences that are valid on edge E. */
static void
back_propagate_equivalences (tree lhs, edge e,
class const_and_copies *const_and_copies)
class const_and_copies *const_and_copies,
bitmap *domby)
{
use_operand_p use_p;
imm_use_iterator iter;
bitmap domby = NULL;
basic_block dest = e->dest;
bool domok = (dom_info_state (CDI_DOMINATORS) == DOM_OK);
/* Iterate over the uses of LHS to see if any dominate E->dest.
If so, they may create useful equivalences too.
@ -1053,27 +1054,38 @@ back_propagate_equivalences (tree lhs, edge e,
if (!lhs2 || TREE_CODE (lhs2) != SSA_NAME)
continue;
/* Profiling has shown the domination tests here can be fairly
expensive. We get significant improvements by building the
set of blocks that dominate BB. We can then just test
for set membership below.
We also initialize the set lazily since often the only uses
are going to be in the same block as DEST. */
if (!domby)
if (domok)
{
domby = BITMAP_ALLOC (NULL);
basic_block bb = get_immediate_dominator (CDI_DOMINATORS, dest);
while (bb)
{
bitmap_set_bit (domby, bb->index);
bb = get_immediate_dominator (CDI_DOMINATORS, bb);
}
if (!dominated_by_p (CDI_DOMINATORS, dest, gimple_bb (use_stmt)))
continue;
}
else
{
/* Profiling has shown the domination tests here can be fairly
expensive when the fast indexes are not computed.
We get significant improvements by building the
set of blocks that dominate BB. We can then just test
for set membership below.
/* This tests if USE_STMT does not dominate DEST. */
if (!bitmap_bit_p (domby, gimple_bb (use_stmt)->index))
continue;
We also initialize the set lazily since often the only uses
are going to be in the same block as DEST. */
if (!*domby)
{
*domby = BITMAP_ALLOC (NULL);
bitmap_tree_view (*domby);
basic_block bb = get_immediate_dominator (CDI_DOMINATORS, dest);
while (bb)
{
bitmap_set_bit (*domby, bb->index);
bb = get_immediate_dominator (CDI_DOMINATORS, bb);
}
}
/* This tests if USE_STMT does not dominate DEST. */
if (!bitmap_bit_p (*domby, gimple_bb (use_stmt)->index))
continue;
}
/* At this point USE_STMT dominates DEST and may result in a
useful equivalence. Try to simplify its RHS to a constant
@ -1083,9 +1095,6 @@ back_propagate_equivalences (tree lhs, edge e,
if (res && (TREE_CODE (res) == SSA_NAME || is_gimple_min_invariant (res)))
record_equality (lhs2, res, const_and_copies);
}
if (domby)
BITMAP_FREE (domby);
}
/* Record into CONST_AND_COPIES and AVAIL_EXPRS_STACK any equivalences implied
@ -1110,6 +1119,7 @@ record_temporary_equivalences (edge e,
for (i = 0; edge_info->cond_equivalences.iterate (i, &eq); ++i)
avail_exprs_stack->record_cond (eq);
bitmap domby = NULL;
edge_info::equiv_pair *seq;
for (i = 0; edge_info->simple_equivalences.iterate (i, &seq); ++i)
{
@ -1146,8 +1156,10 @@ record_temporary_equivalences (edge e,
/* Any equivalence found for LHS may result in additional
equivalences for other uses of LHS that we have already
processed. */
back_propagate_equivalences (lhs, e, const_and_copies);
back_propagate_equivalences (lhs, e, const_and_copies, &domby);
}
if (domby)
BITMAP_FREE (domby);
}
}