procyberian/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

dominance.c (calc_dfs_tree_nonrec): Reverse order of tests in if statement so we don't access undefined memory.

Browse source 
* dominance.c (calc_dfs_tree_nonrec): Reverse order of tests
        in if statement so we don't access undefined memory.

From-SVN: r44043
This commit is contained in:
Steve Ellcey 2001-07-16 16:48:31 +00:00 • committed by Jeff Law
parent 978cf2fcf5
commit 94fc7deae2
2 changed files with 7 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
gcc/ChangeLog
View file

@ -1,3 +1,8 @@
2001-07-16 Steve Ellcey <sje@cup.hp.com>
* dominance.c (calc_dfs_tree_nonrec): Reverse order of tests
in if statement so we don't access undefined memory.
2001-07-16 Daniel Berlin <dan@cgsoftware.com>
* ssa-ccp.c: (optimize_unexecutable_edges): Add note about removal

4
gcc/dominance.c
View file

@ -242,7 +242,7 @@ calc_dfs_tree_nonrec (di, bb, reverse)
/* If the next node BN is either already visited or a border
block the current edge is useless, and simply overwritten
with the next edge out of the current node. */
if (di->dfs_order[bn->index] || bn == ex_block)
if (bn == ex_block || di->dfs_order[bn->index])
{
e = e->pred_next;
continue;
@ -253,7 +253,7 @@ calc_dfs_tree_nonrec (di, bb, reverse)
else
{
bn = e->dest;
if (di->dfs_order[bn->index] || bn == ex_block)
if (bn == ex_block || di->dfs_order[bn->index])
{
e = e->succ_next;
continue;