[Bug tree-optimization/26854] [4.3/4.4 Regression] Inordinate compile times on large routines

[lucier at math dot purdue dot edu]

------- Comment #89 from lucier at math dot purdue dot edu  2009-02-13 17:30 -------
Subject: Re:  [4.3/4.4 Regression] Inordinate
 compile times on large routines

On Fri, 2009-02-13 at 17:06 +0000, jakub at gcc dot gnu dot org wrote:
> 
> 
> ------- Comment #88 from jakub at gcc dot gnu dot org  2009-02-13 17:06 -------
> The patch in PR39157 is IMHO finished and has been bootstrapped/regtested on
> x86_64-linux and i686-linux.  I haven't posted it looked like Richard, Zdenek
> and Steven prefer some other solution for it.  If this isn't solved for 4.4
> soon, I'm going to post that patch.

I have to leave town within the hour and I may not be able to look at
this properly until Wednesday or so, but it would be interesting to me
to know how large (how many nodes?) are the 139 loops in _num.i referred
to in

http://gcc.gnu.org/bugzilla/show_bug.cgi?id=39157#c19

This information may suggest how large the default parameters should be
for -O1 and -O2.  (For example, if all the non-whole-function loops have
< 2000 instructions, then 5000 might be a reasonable limit for -O1
loops.)


-- 


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=26854