diff options
| author | Richard Guenther <rguenther@suse.de> | 2005-11-09 18:00:59 +0000 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2005-11-09 18:00:59 +0000 |
| commit | 874caa00190d34b659f1d67723a6406cd546f0c8 (patch) | |
| tree | bd637c182f6beea4adc189814ea2b0e1bc0f9dd0 /gcc/tree-scalar-evolution.c | |
| parent | b8176fe4bbaaf5e00f13aa6ce8003ff69ccd9380 (diff) | |
| download | gcc-874caa00190d34b659f1d67723a6406cd546f0c8.zip gcc-874caa00190d34b659f1d67723a6406cd546f0c8.tar.gz gcc-874caa00190d34b659f1d67723a6406cd546f0c8.tar.bz2 | |
re PR tree-optimization/24716 (Wrong code generated when optimising)
2005-11-09 Richard Guenther <rguenther@suse.de>
PR tree-optimization/24716
* tree-scalar-evolution.c (analyze_evolution_in_loop): Use
t_bool to track results from follow_ssa_edge.
* gcc.c-torture/execute/pr24716.c: New testcase.
From-SVN: r106700
Diffstat (limited to 'gcc/tree-scalar-evolution.c')
| -rw-r--r-- | gcc/tree-scalar-evolution.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/tree-scalar-evolution.c b/gcc/tree-scalar-evolution.c index 104445a..c2fa2ef 100644 --- a/gcc/tree-scalar-evolution.c +++ b/gcc/tree-scalar-evolution.c @@ -1503,7 +1503,7 @@ analyze_evolution_in_loop (tree loop_phi_node, { tree arg = PHI_ARG_DEF (loop_phi_node, i); tree ssa_chain, ev_fn; - bool res; + t_bool res; /* Select the edges that enter the loop body. */ bb = PHI_ARG_EDGE (loop_phi_node, i)->src; @@ -1519,7 +1519,7 @@ analyze_evolution_in_loop (tree loop_phi_node, res = follow_ssa_edge (loop, ssa_chain, loop_phi_node, &ev_fn, 0); } else - res = false; + res = t_false; /* When it is impossible to go back on the same loop_phi_node by following the ssa edges, the @@ -1527,7 +1527,7 @@ analyze_evolution_in_loop (tree loop_phi_node, first iteration, EV_FN has the value INIT_COND, then all the other iterations it has the value of ARG. For the moment, PEELED_CHREC nodes are not built. */ - if (!res) + if (res != t_true) ev_fn = chrec_dont_know; /* When there are multiple back edges of the loop (which in fact never |