On Fri, Apr 01, 2005 at 06:48:56PM +0200, Stefan Strasser wrote: > Andrew Haley schrieb: > >Sam Lauber writes: > > > I know that Bohem's GC is used in the Java runtime for GCC. > > > However, the compiler proper itself can _really_ cramp people's > > > avalible RAM (for those who don't belive me and have Windows w/ > > > DJGPP, change all the memory controls from `auto' to the highest > > > value and just try to compile libiberty/regex.c), so my suggestion > > > is usage of Bohem's GC in the compiler proper itself. > > > >Do you have any reason to believe that such a change would reduce > >memory consumption? > > > > I have reason to believe that it would increase performance on low > memory systems/large translation units: it seems that current gcc gc > performs a full memory scan on each collection, right? at least if gcc > uses more memory than physically available it spends a _very_ long time > swapping during collections. > boehm gc could help here since it is a generational collector.
There are other ways to solve this problem, including creating a generational collector using our existing accurate GC. I've been working on this on-and-off (mostly off at the moment, though). -- Daniel Jacobowitz CodeSourcery, LLC
