This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [RFC] Merge criteria for tree-ssa
- From: Jan Hubicka <hubicka at ucw dot cz>
- To: Diego Novillo <dnovillo at redhat dot com>
- Cc: "gcc at gcc dot gnu dot org" <gcc at gcc dot gnu dot org>
- Date: Fri, 6 Feb 2004 00:24:02 +0100
- Subject: Re: [RFC] Merge criteria for tree-ssa
- References: <1075901410.3834.32.camel@localhost.localdomain>
> Compile Time Performance
> ------------------------
>
> - Bootstrap times within 1-5% of mainline.
>
> - POOMA, DLV and MICO compile times within 1-5% of mainline.
>
> - Memory consumption within 1-5% of mainline (POOMA, DLV and
> MICO seem good tests).
All these tests hits inline limits. For instance the tree-ssa estimate
gerald's testcase to 160000 instruction, while mainline to 140000
instructions. THat means that tree-ssa happens to inline fewer
functions so you get kind of apples-to-orranges comparsion.
(we probably can try to increase inlining limits on tree-ssa and see
what it does to code quality)
What about using tests that does not hit -Winline limits and/or
doing the tests with -fno-inline?
I would expect that elliminating the inlining factor would make it
easier to get more comparable results and the goal also more
meaningfull. Retunning inlining limits can be done later and especially
if i manage to get to my plans to optimization before inlining it will
be much easier to do less inlining with better code quality.
Honza