On Friday 13 March 2009 20:40:10 Mikkel Fahnøe Jørgensen wrote:
> 2009/3/13 Jon Harrop <jon@ffconsultancy.com>:
> > On Sunday 08 March 2009 01:19:20 Jon Harrop wrote:
> >> Well, I have my first working GC running in HLVM now! Woohoo!
> >
> > I have just updated HLVM's GC to use a hash table instead of a linear
> > search of the allocated list. This brings GC time down from O(n^2) to
> > amortized O(n). In practice, the benchmarks are up to 100x faster than
> > they were and, in the worst case, HLVM is now only 5x slower than OCaml.
>
> Keep up the good work.
>
> I'm still a bit worried about that 60MB runtime though ...

I was wrong about that actually. It was only 60Mb because I had compiled LLVM 
with debugging on. Now that I have LLVM 2.5 compiled for release my HLVM 
executable is under 10Mb. Still large but I'm happy with that.

> Are you looking into trace trees for JIT?

You mean for the code fed into HLVM? No, not yet. We need more code to feed 
into it before that will become interesting!

-- 
Dr Jon Harrop, Flying Frog Consultancy Ltd.
http://www.ffconsultancy.com/?e