This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: Whole program optimization and functions-only-called-once.
- From: Jan Hubicka <hubicka at ucw dot cz>
- To: Richard Guenther <richard dot guenther at gmail dot com>
- Cc: Jan Hubicka <hubicka at ucw dot cz>, Toon Moene <toon at moene dot org>, Jan Hubicka <jh at suse dot cz>, gcc-patches at gcc dot gnu dot org
- Date: Mon, 16 Nov 2009 15:27:10 +0100
- Subject: Re: Whole program optimization and functions-only-called-once.
- References: <4AF1D3C2.3000001@moene.org> <84fc9c000911041126x14ce9226w9dfb781ea284de6b@mail.gmail.com> <20091112161638.GC11341@atrey.karlin.mff.cuni.cz> <4AFEA884.9030003@moene.org> <20091116095435.GU24874@kam.mff.cuni.cz> <84fc9c000911160623g7282b228h55058e78285aa1f7@mail.gmail.com>
>
> I think we shouldn't bypass large-function-growth. We might want to scale
> it somewhat for hot callgraph edges (and at the same time avoid inlining
> once-called cold functions). Or even better sort the fibheap according to
> the callgraph edge frequency, not only according to sizes.
We do that for a while. The fibheap is sorted by benefit that is pretty much
estimated speedup divided by estimated size cost. Speedups are scaled by counts
with profile info and frequencies without it. (I even had it on slides last week ;))
Honza
>
> Richard.