------- Comment #7 from law at redhat dot com 2006-04-20 03:28 -------
Subject: Re: Inordinate compile times on
large routines
On Thu, 2006-04-20 at 03:18 +0000, lucier at math dot purdue dot edu
wrote:
>
> ------- Comment #6 from lucier at math dot purdue dot edu 2006-04-20 03:18
> -------
> Subject: Re: Inordinate compile times on large routines
>
> Thanks a lot. Here are the timing statistics (with --disable-
> checking) after your patch.
>
> PS: I'm sorry it took 9 hours to compile on your box.
No worries. I've got several boxes and having one busy overnight
isn't that big of a deal.
Clearly there's something different between PPC and x86 for
your testcase as you're not getting hit in bb-reorder or
expand.
Operand scanning is clearly the #1 issue when run on PPC (> 50% of
compile time, OUCH). This may actually be an indication of a pass
going nuts and marking too many things for rescanning though.
You'll likely get radically different pain points with mainline
as well. The RTL loop invariant code goes crazy memory-wise
for me, tree PRE and FRE also suck up large amounts of time.
Jeff
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26854
