+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>
* 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>
PR fortran/24813
/* 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
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
use_operand_p op;
ssa_op_iter iter;
+ gcc_assert (is_gimple_min_invariant (base));
+
if (!x)
return base;
}
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;