This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/18792] ICE with -O1 -ftree-loop-linear on small test case
- From: "rakdver at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 7 Dec 2004 22:50:04 -0000
- Subject: [Bug tree-optimization/18792] ICE with -O1 -ftree-loop-linear on small test case
- References: <20041202193143.18792.fjahanian@apple.com>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From rakdver at gcc dot gnu dot org 2004-12-07 22:50 -------
There are basically two ways how to fix this: either make the code
that changes the order of loops in the nests to also renumber the loops
(which would in turn invalidate all scev caches, that would need to be
flushed). Or fix the code that assumes the ordering of the loops.
I would prefer the later solution (it seems simpler). I think only scev/data
dependency routines use it. Maybe we somewhere use the ordering of loops to
iterate from innermost ones to the outer ones by simply passing over loops->parray,
but I cannot find any such code just now, and it is of course trivial to avoid.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18792