This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: 3.0 -finline-limit and c++
- To: Gerald Pfeifer <pfeifer at dbai dot tuwien dot ac dot at>
- Subject: Re: 3.0 -finline-limit and c++
- From: Nathan Sidwell <nathan at codesourcery dot com>
- Date: Thu, 31 May 2001 09:02:51 +0100
- CC: gcc <gcc at gcc dot gnu dot org>, Mark Mitchell <mark at codesourcery dot com>, tot <tot at trema dot com>
- Organization: Codesourcery LLC
- References: <Pine.BSF.4.33.0105310706110.74745-100000@deneb.dbai.tuwien.ac.at>
Gerald Pfeifer wrote:
> > The current tree-based inlining heuristics are not ideal -- but they
> > do go a long ways towards making sure that we have non-infinite
> > compile-times.
>
> One thing I suggested to Mark is performing the inlining (resp. breaking
> of inline chains) bottom-up instead of top-down in the tree, which might
> help performance in some cases.
Yes, this idea has occurred to me, and I've scribbled down some pseudo
code on how to DTRT. I'd like to implement that, because I believe
it will give better run-time & run-space optimization at the expense
of compiler memory usage. Naturally I don't
have time right now, and even if I did it's far to late for 3.0
I'll probably bash on it after 3.0.
nathan
--
Dr Nathan Sidwell :: http://www.codesourcery.com :: CodeSourcery LLC
'But that's a lie.' - 'Yes it is. What's your point?'
nathan@codesourcery.com : http://www.cs.bris.ac.uk/~nathan/ : nathan@acm.org