Commit ed52affe by Richard Guenther Committed by Richard Biener

re PR middle-end/27136 (Compile failure with -O -ffast-math)

2006-05-07  Richard Guenther  <rguenther@suse.de>

	PR tree-optimization/27136
	* tree-ssa-loop-niter.c (get_val_for): Correct function
	comment, assert requirements.
	(loop_niter_by_eval): Stop processing if the iterated
	value did not simplify.

	* gcc.dg/torture/pr27136.c: New testcase.

From-SVN: r113601
parent ef5d0a89
2006-05-07 Richard Guenther <rguenther@suse.de>
PR tree-optimization/27136
* tree-ssa-loop-niter.c (get_val_for): Correct function
comment, assert requirements.
(loop_niter_by_eval): Stop processing if the iterated
value did not simplify.
2006-05-07 Mircea Namolaru <namolaru@il.ibm.com> 2006-05-07 Mircea Namolaru <namolaru@il.ibm.com>
* opts.c (flag_see): remove its setting at -O3. * opts.c (flag_see): remove its setting at -O3.
......
2006-05-07 Richard Guenther <rguenther@suse.de>
PR tree-optimization/27136
* gcc.dg/torture/pr27136.c: New testcase.
2006-05-07 Paul Thomas <pault@gcc.gnu.org> 2006-05-07 Paul Thomas <pault@gcc.gnu.org>
PR fortran/24813 PR fortran/24813
/* { dg-do compile } */
/* { dg-options "-ffast-math" } */
void foo()
{
double x;
for (x = 2; x < 10; x *= x)
;
}
...@@ -1301,7 +1301,7 @@ get_base_for (struct loop *loop, tree x) ...@@ -1301,7 +1301,7 @@ get_base_for (struct loop *loop, tree x)
/* Given an expression X, then /* Given an expression X, then
* if BASE is NULL_TREE, X must be a constant and we return X. * if X is NULL_TREE, we return the constant BASE.
* otherwise X is a SSA name, whose value in the considered loop is derived * otherwise X is a SSA name, whose value in the considered loop is derived
by a chain of operations with constant from a result of a phi node in by a chain of operations with constant from a result of a phi node in
the header of the loop. Then we return value of X when the value of the the header of the loop. Then we return value of X when the value of the
...@@ -1314,6 +1314,8 @@ get_val_for (tree x, tree base) ...@@ -1314,6 +1314,8 @@ get_val_for (tree x, tree base)
use_operand_p op; use_operand_p op;
ssa_op_iter iter; ssa_op_iter iter;
gcc_assert (is_gimple_min_invariant (base));
if (!x) if (!x)
return base; return base;
...@@ -1414,7 +1416,11 @@ loop_niter_by_eval (struct loop *loop, edge exit) ...@@ -1414,7 +1416,11 @@ loop_niter_by_eval (struct loop *loop, edge exit)
} }
for (j = 0; j < 2; j++) for (j = 0; j < 2; j++)
val[j] = get_val_for (next[j], val[j]); {
val[j] = get_val_for (next[j], val[j]);
if (!is_gimple_min_invariant (val[j]))
return chrec_dont_know;
}
} }
return chrec_dont_know; return chrec_dont_know;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment