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: Jan Hubicka <jh at suse dot cz>
- To: Richard Guenther <rguenth at tat dot physik dot uni-tuebingen dot de>
- Cc: Jan Hubicka <jh at suse dot cz>,Steven Bosscher <s dot bosscher at student dot tudelft dot nl>, gcc at gcc dot gnu dot org
- Date: Mon, 23 Jun 2003 18:32:52 +0200
- Subject: Re: [RFC/patch] Callgraph based inlining heuristics
- References: <20030623160423.GK2327@kam.mff.cuni.cz> <Pine.LNX.4.44.0306231814180.582-100000@goofy>
> Btw. - are you currently maintaining an explicit callgraph, so we can
> stick notes to its edges?
Yes.
>
> Just thinking about how to re-invent leafify for unit-at-a-time ;)
:) It should not be too dificult to reinvent, just bit tricky because
it breaks the transitivity rule :( - you need to add a flag about
whether function should be leafized, add a falg to the node saying
whether it will be inlined into some leafized function and modify the
analysis accordingly.
Honza
>
> Richard.
>