This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug optimization/13430] New: [3.4 regression] infinite(?) loop in bb-reorder
- From: "steven at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 18 Dec 2003 09:04:07 -0000
- Subject: [Bug optimization/13430] New: [3.4 regression] infinite(?) loop in bb-reorder
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
The test case for PR12322 is not spending most of its time in GCSE. In fact
GCSE is _faster_ than 3.3. The problem is that we enter a very long (and I
suspect in fact an infinite) loop in bb-reorder.
In particular, bb-reorder.c:714:
if ((e->src != ENTRY_BLOCK_PTR && bbd[e->src->index].end_of_trace >= 0)
Honza, bb-reorder is yours, can you give this a look?
--
Summary: [3.4 regression] infinite(?) loop in bb-reorder
Product: gcc
Version: 3.4.0
Status: UNCONFIRMED
Keywords: compile-time-hog
Severity: critical
Priority: P1
Component: optimization
AssignedTo: hubicka at gcc dot gnu dot org
ReportedBy: steven at gcc dot gnu dot org
CC: gcc-bugs at gcc dot gnu dot org
GCC build triplet: i686-pc-linux-gnu
GCC host triplet: i686-pc-linux-gnu
GCC target triplet: i686-pc-linux-gnu
OtherBugsDependingO 12322
nThis:
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=13430