This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/65875] [5/6 Regression] ICE: Segmentation fault
- From: "jakub at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Tue, 28 Apr 2015 08:28:40 +0000
- Subject: [Bug tree-optimization/65875] [5/6 Regression] ICE: Segmentation fault
- Auto-submitted: auto-generated
- References: <bug-65875-4 at http dot gcc dot gnu dot org/bugzilla/>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=65875
--- Comment #10 from Jakub Jelinek <jakub at gcc dot gnu.org> ---
I meant in the first loop.
But we handle:
int b, c, e;
long
foo (int x, int y)
{
long h = 0;
for (b = 0; b < x; b++)
for (c = 0; c < y; c++)
if (e)
h = 1;
return h + 4;
}
correctly, it is only as soon as one of those loops turns into endless loop:
int b, c, e;
long
foo (int x, int y)
{
long h = 0;
for (b = 0; b < x; b++)
for (c = 0; c < y;)
if (e)
h = 1;
return h + 4;
}
that we lose track. But, if it is only for endless loops, probably nothing to
worry about, the finite loops are much more important.