This is the mail archive of the
mailing list for the GCC project.
Re: Faster compilation speed
- From: Nix <nix at esperi dot demon dot co dot uk>
- To: Jamie Lokier <egcs at tantalophile dot demon dot co dot uk>
- Cc: David Edelsohn <dje at watson dot ibm dot com>, Andreas Schwab <schwab at suse dot de>, Richard Henderson <rth at redhat dot com>, "David S. Miller" <davem at redhat dot com>, gcc at gcc dot gnu dot org
- Date: 14 Aug 2002 23:55:40 +0100
- Subject: Re: Faster compilation speed
- References: <firstname.lastname@example.org> <200208141907.PAA25748@makai.watson.ibm.com><20020814212022.I26404@kushida.apsleyroad.org>
On Wed, 14 Aug 2002, Jamie Lokier muttered drunkenly:
> David Edelsohn wrote:
>> I thought that obstacks are created dynamically, not statically.
>> One does not want to ever copy or grow the array.
> Obstacks use chunks of memory to hold many contiguous objects, so they
> offer fairly good spatial locality. But then, so do many decent GC
> allocators (not ones using free lists, though).
Also, surely one does not *often* want to grow or copy the array: the
occasional copy isn't a problem (but you initialize it quite large
so the resizing isn't required often).
`Mips are real and bitrate earnest, shifting spam is not our goal;
silicon to sand returnest, was not spoken of the soul.'
--- _Eventful History: Version 1.x_, John M. Ford