This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: cgraph based inlining heuristics
- From: Richard Guenther <rguenth at tat dot physik dot uni-tuebingen dot de>
- To: Jan Hubicka <jh at suse dot cz>
- Cc: gcc-patches at gcc dot gnu dot org
- Date: Wed, 2 Jul 2003 16:38:04 +0200 (CEST)
- Subject: Re: cgraph based inlining heuristics
On Wed, 2 Jul 2003, Richard Guenther wrote:
> On Wed, 2 Jul 2003, Jan Hubicka wrote:
>
> > > Hi,
> > >
> > > thanks for your continued work on improving gcc3.4 inlining!
> > >
> > > Did you check any of the POOMA testcases with the new heuristics yet?
> > > I realize these could be only compile-time tests, but I'd be interested
> > > especially in the tramp3d numbers.
> >
> > I am really curious about your results!
>
> Ok, here they go. I tested four different setups:
>
> (0) gcc3.4
> (1) gcc3.4 with __attribute__((leafify)) patch
I forgot to mention that this patch for leaf functions disables the
artificial inlining limit in inlinable_function_p, does your new
heuristics call this functions with nolimit parameter set all the time?
Richard.
--
Richard Guenther <richard dot guenther at uni-tuebingen dot de>
WWW: http://www.tat.physik.uni-tuebingen.de/~rguenth/