diff options
| author | Steve Ellcey <sje@cup.hp.com> | 2001-07-16 16:48:31 +0000 |
|---|---|---|
| committer | Jeff Law <law@gcc.gnu.org> | 2001-07-16 10:48:31 -0600 |
| commit | 94fc7deae27a373460b7b2c6c1995f0de21c3bec (patch) | |
| tree | 21d75907d7beed2a70361b937b14212f359fb723 /gcc/dominance.c | |
| parent | 978cf2fcf5d4858bb326ad7d8e84be1d51c2a593 (diff) | |
| download | gcc-94fc7deae27a373460b7b2c6c1995f0de21c3bec.tar.gz | |
dominance.c (calc_dfs_tree_nonrec): Reverse order of tests in if statement so we don't access undefined memory.
* dominance.c (calc_dfs_tree_nonrec): Reverse order of tests
in if statement so we don't access undefined memory.
From-SVN: r44043
Diffstat (limited to 'gcc/dominance.c')
| -rw-r--r-- | gcc/dominance.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/dominance.c b/gcc/dominance.c index 66ff11e2bae..8f5e0d370a0 100644 --- a/gcc/dominance.c +++ b/gcc/dominance.c @@ -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; |