OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

re PR tree-optimization/32949 (suboptimal address generation for int indices on 64-bit targets) 

2007-08-22  Zdenek Dvorak  <ook@ucw.cz>

	PR tree-optimization/32949
	* tree-ssa-loop-niter.c (scev_probably_wraps_p): Test nowrap_type_p
	before failing for ivs with non-constant step.

From-SVN: r127720
This commit is contained in:
Zdenek Dvorak 2007-08-23 01:05:05 +02:00 committed by Zdenek Dvorak
parent aa2f6edbf7
commit 24938ce920
2 changed files with 12 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/ChangeLog
View File

@ -1,3 +1,9 @@
2007-08-22 Zdenek Dvorak <ook@ucw.cz>
PR tree-optimization/32949
* tree-ssa-loop-niter.c (scev_probably_wraps_p): Test nowrap_type_p
before failing for ivs with non-constant step.
2007-08-22 Hans-Peter Nilsson <hp@axis.com>
* doc/md.texi (Iterators): Renamed from Macros. All contents

8
gcc/tree-ssa-loop-niter.c
View File

@ -2969,8 +2969,7 @@ scev_probably_wraps_p (tree base, tree step,
2032, 2040, 0, 8, ..., but the code is still legal. */
if (chrec_contains_undetermined (base)
|| chrec_contains_undetermined (step)
|| TREE_CODE (step) != INTEGER_CST)
|| chrec_contains_undetermined (step))
return true;
if (integer_zerop (step))
@ -2981,6 +2980,11 @@ scev_probably_wraps_p (tree base, tree step,
if (use_overflow_semantics && nowrap_type_p (type))
return false;
/* To be able to use estimates on number of iterations of the loop,
we must have an upper bound on the absolute value of the step. */
if (TREE_CODE (step) != INTEGER_CST)
return true;
/* Don't issue signed overflow warnings. */
fold_defer_overflow_warnings ();