--- Comment #11 from ian at airs dot com 2007-04-17 19:08 ---
Fixed on mainline.
--
ian at airs dot com changed:
What|Removed |Added
Status|NEW
--- Comment #10 from ian at gcc dot gnu dot org 2007-04-17 06:33 ---
Subject: Bug 31522
Author: ian
Date: Tue Apr 17 06:33:38 2007
New Revision: 123908
URL: http://gcc.gnu.org/viewcvs?root=gcc&view=rev&rev=123908
Log:
./:
PR tree-optimization/31522
* tree-vrp.c (vr_phi_
--- Comment #9 from rguenth at gcc dot gnu dot org 2007-04-11 09:14 ---
That looks reasonable.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=31522
--- Comment #8 from ian at airs dot com 2007-04-11 08:04 ---
That's not an infinite loop, it's just a loop with 2^31 iterations.
This patch takes a rather different approach.
Index: tree-vrp.c
===
--- tree-vrp.c (revision
--- Comment #7 from pinskia at gcc dot gnu dot org 2007-04-11 07:38 ---
> What do you think of this patch?
This patch makes cc1 go into an infinite loop for the following code (which you
semi already said why you needed the phi merge to do this):
int f(void)
{
int i, bits = 0;
for (
--- Comment #6 from ian at airs dot com 2007-04-11 07:15 ---
When we pick a new range to avoid an infinite iteration, we have to pick an
overflow range. This is what catches overflows like
for (i = 1; i > 0; ++i) ++bits;
I've experimented with only doing this in a loop, but it didn
--- Comment #5 from pinskia at gcc dot gnu dot org 2007-04-11 06:34 ---
It turns out you have to add -Wstrict-overflow to get the warning but this is
still a false warning.
--
pinskia at gcc dot gnu dot org changed:
What|Removed |Added
