From mboxrd@z Thu Jan  1 00:00:00 1970
From: Gabriel Dos Reis <gdr@codesourcery.com>
To: Joe Buck <jbuck@synopsys.com>
Cc: pfeifer@dbai.tuwien.ac dot@(Gerald Pfeifer), mark@codesourcery.com (Mark Mitchell), gcc@gcc.gnu.org (gcc@gcc.gnu.org)
Subject: Re: C++ compile-time regressions (was: GCC 3.0.1 Status Report)
Date: Tue, 24 Jul 2001 10:19:00 -0000
Message-id: <flwv4yb5yu.fsf@sel.cmla.ens-cachan.fr>
References: <200107241708.KAA08101@atrus.synopsys.com>
X-SW-Source: 2001-07/msg01583.html

Joe Buck <jbuck@synopsys.COM> writes:

| > I'm rather sure, though, that g++ is not generating efficient code for
| > complicated, nested STL and STL-like structures in the presence of
| > libstdc++-v3 (iterators are now classes instead of pointers).
| 
| But the classes have one member, so we should still be getting equivalent
| code, provided that we get ADDRESSOF working as well as it did in 2.95.x.

Now that we have a branch for doing tree-based optimization, what do
you think about trying to implement "scalar replacement of aggregates"
optimization and see how good we can do with STL-like structures?

-- Gaby
CodeSourcery, LLC                       http://www.codesourcery.com