http://gcc.gnu.org/bugzilla/show_bug.cgi?id=46675
Richard Guenther <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Keywords| |wrong-code
CC| |rakdver at gcc dot gnu.org
--- Comment #10 from Richard Guenther <rguenth at gcc dot gnu.org> 2010-11-27
20:19:40 UTC ---
With the testcase we again see
Analyzing # of iterations of loop 1
exit condition [1, + , 1](no_overflow) < n_3(D) - -2147483648
bounds on difference of bases: 0 ... -2
result:
# of iterations (unsigned int) n_3(D) + 2147483647, bounded by 0
Statement (exit)if (i_7 < npairs_4)
is executed at most (unsigned int) n_3(D) + 2147483647 (bounded by 0) + 1
times in loop 1.
where the bound is bogus - it should be bounded by 2147483647.
