A smaller GC benchmark

[bearophile]

Robert Fraser:
> I've been wanting for a while to implement a different GC for D taking 
> into account some of the stuff talked about in a few papers I read on 
> non-moving GCs. IMO, D's GCs (Tango & Phobos) are pretty basic, they 
> don't do any sort of sexy trickery.

I can see people in this newsgroup don't like to try to adapt already written code. Is this some bad from of NIH (Not Invented Here) syndrome? Maybe you can just take a 5-10-years old GC and adapt it, so we can avoid other 10 years of development and have a better GC soon (from your and other's comments I presume the Java GC can't be adapted to D, but other GCs may be found).

Note that ShedSkin uses the Bohem GC:
http://www.hpl.hp.com/personal/Hans_Boehm/gc/
>From various tests it seems faster than the Phobos GC. Can't it be copied inside Phobos? It's well refined, well debugged, it doesn't leak, it has something like ten years of development, articles written on it, it's used often, etc. And it can be used from C too.

Bye,
bearophile