This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: totally folding string operations
- From: "Giovanni Bajo" <giovannibajo at libero dot it>
- To: "Paolo Carlini" <pcarlini at suse dot de>
- Cc: <libstdc++ at gcc dot gnu dot org>
- Date: Thu, 7 Oct 2004 13:32:34 +0200
- Subject: Re: totally folding string operations
- References: <cjfs3j$7da$1@sea.gmane.org> <415BF2BC.7040102@suse.de>
Paolo Carlini wrote:
>> ... An
>> idea here would be to construct a new optimizer pass which
>> transforms closed pairs of new/delete calls of constant size into
>> alloca().
>>
>> Comments?
>>
> For now, only a very quick comment (I'm rather sure to say something
> sensible
> at least about this :) I don't think this specific idea would work
> often, for
> the simple reason that typically (by default in mainline, f.i.) we us
> pool allocation and no actual new/delete pairs are involved for short
> string...
That is great to hear. Is it the same, for, eg., small vectors of PODs?
Giovanni Bajo