This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [RFC/patch] Callgraph based inlining heuristics
- From: Richard Guenther <rguenth at tat dot physik dot uni-tuebingen dot de>
- To: Steven Bosscher <s dot bosscher at student dot tudelft dot nl>
- Cc: Jan Hubicka <jh at suse dot cz>, <gcc at gcc dot gnu dot org>
- Date: Mon, 23 Jun 2003 16:53:02 +0200 (CEST)
- Subject: Re: [RFC/patch] Callgraph based inlining heuristics
Steven Bosscher wrote:
> Jan Hubicka wrote:
> >(that is not the case of attribute leafify proposed - doing the
> >datastructure
> >in full generality allowing each particular walk in the callgraph to
be
> >either
> >collapsed or not is probably too expensive so attribute leafify can be
> >implemented as a special case).
>
>Assuming we really want such an attribute...
Yes, we really want such an attribute. There are cases where you benefit
very much from cse/gcse if you remove all calls inside a loop by
leafifying it for my scientific C++ application (POOMA based). Also
the loop optimizer could probably do better in this case (it doesnt, but
thats another problem). And I never want the compiler to do so much
inlining without telling it explicitly (of course some profile feedback
on the resulting asm code speed/size would really cut it).
Richard.
--
Richard Guenther <richard dot guenther at uni-tuebingen dot de>
WWW: http://www.tat.physik.uni-tuebingen.de/~rguenth/