This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/26854] Inordinate compile times on large routines
- From: "amacleod at redhat dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 10 Jan 2007 19:47:59 -0000
- Subject: [Bug tree-optimization/26854] Inordinate compile times on large routines
- References: <bug-26854-271@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #25 from amacleod at redhat dot com 2007-01-10 19:47 -------
There were numerous factors in the mainline speedup of SSA->normal, including a
massive rewrite, but there are a couple of big wins that are backportable, and
were in fact considered. It was just that they were too late in stage 3 at the
time:
I don't remember which one(s) affected this test case the most.
live range speedup:
http://gcc.gnu.org/ml/gcc-patches/2006-08/msg00895.html
TER speedup
http://gcc.gnu.org/ml/gcc-patches/2006-08/msg00896.html
this one was applied later, and may or may not make any difference whatsoever.
I changes the coalesce list from a linked list to a hash table. I seem to
recall only one test case it affected.
http://gcc.gnu.org/ml/gcc-patches/2006-11/msg01515.html
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26854