diff options
| author | Zdenek Dvorak <ook@ucw.cz> | 2008-11-20 09:05:12 +0100 |
|---|---|---|
| committer | Zdenek Dvorak <rakdver@gcc.gnu.org> | 2008-11-20 08:05:12 +0000 |
| commit | dc5b3407f2997631c15eebccd8c9260e186f3e0a (patch) | |
| tree | 049852a66bb3c2b176b99851ac916058e794f7d0 /gcc/tree-ssa-loop-niter.c | |
| parent | f9487002a446cc5f4c777a77afe7c6eaecfec4d0 (diff) | |
| download | gcc-dc5b3407f2997631c15eebccd8c9260e186f3e0a.zip gcc-dc5b3407f2997631c15eebccd8c9260e186f3e0a.tar.gz gcc-dc5b3407f2997631c15eebccd8c9260e186f3e0a.tar.bz2 | |
re PR rtl-optimization/32283 (Missed induction variable optimization)
PR rtl-optimization/32283
* tree-ssa-loop-niter.c (scev_probably_wraps_p): Use type of the base
of the induction variable to decide whether it may wrap.
* tree-ssa-loop-ivopts.c (rewrite_use_compare): Emit the initialization
of the bound before the loop.
* simplify-rtx.c (simplify_binary_operation_1): Add two simplifications
regarding AND.
(simplify_plus_minus): Only fail if no simplification is possible.
* loop-iv.c (simple_rhs_p): Consider reg + reg and reg << cst simple.
From-SVN: r142035
Diffstat (limited to 'gcc/tree-ssa-loop-niter.c')
| -rw-r--r-- | gcc/tree-ssa-loop-niter.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/tree-ssa-loop-niter.c b/gcc/tree-ssa-loop-niter.c index 33aacae..13b10c9 100644 --- a/gcc/tree-ssa-loop-niter.c +++ b/gcc/tree-ssa-loop-niter.c @@ -3053,7 +3053,7 @@ scev_probably_wraps_p (tree base, tree step, /* If we can use the fact that signed and pointer arithmetics does not wrap, we are done. */ - if (use_overflow_semantics && nowrap_type_p (type)) + if (use_overflow_semantics && nowrap_type_p (TREE_TYPE (base))) return false; /* To be able to use estimates on number of iterations of the loop, |