Take the following code:
int f ()
{ int j0, j1, j2, j3, j4, j5, j6, j7, j8, j9, a;
a = 0;
for (j0 = 0; j0 < 2; j0 ++)
for (j1 = j0; j1 < 2; j1 ++)
for (j2 = j1; j2 < 2; j2 ++)
for (j3 = j2; j3 < 2; j3 ++)
for (j4 = j3; j4 < 2; j4 ++)
for (j5 = j4; j5 < 2; j5 ++)
for (j6 = j5; j6 < 2; j6 ++)
for (j7 = j6; j7 < 2; j7 ++)
for (j8 = j7; j8 < 2; j8 ++)
for (j9 = j8; j9 < 2; j9 ++)
a += j0 + j1 + j2 + j3 + j4 + j5 + j6 + j7 + j8 + j9;
return a;
}
---
Right now we ICE:
t.c:2: internal compiler error: in aff_combination_to_tree, at
tree-ssa-loop-ivopts.c:2948
Please submit a full bug report,
with preprocessed source if appropriate.
See <URL:http://gcc.gnu.org/bugs.html> for instructions.
This was generated with the awk script from PR 18595.
--
Summary: [4.1 Regression] ICE in ivopts
Product: gcc
Version: 4.1.0
Status: UNCONFIRMED
Keywords: ice-on-valid-code
Severity: critical
Priority: P2
Component: tree-optimization
AssignedTo: unassigned at gcc dot gnu dot org
ReportedBy: pinskia at gcc dot gnu dot org
GCC target triplet: x86_64-linux-gnu
OtherBugsDependingO 18595
nThis:
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=24483
