This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/45427] Number of iteration analysis bogus
- From: "rguenth at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 27 Aug 2010 17:27:41 -0000
- Subject: [Bug tree-optimization/45427] Number of iteration analysis bogus
- References: <bug-45427-10053@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #7 from rguenth at gcc dot gnu dot org 2010-08-27 17:27 -------
Or in the cddce1 dump:
Analyzing # of iterations of loop 1
exit condition [p_4(D), + , 1](no_overflow) != 0B
bounds on difference of bases: -18446744073709551615 ... 0
result:
# of iterations -(long unsigned int) p_4(D), bounded by 0
Found loop 1 to be finite: iterating -(long unsigned int) p_4(D) times
where we might be able to construct a testcase with an infinite loop and
no side-effects that CDCE will then remove.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=45427