From: Jiri S. <jir...@bl...> - 2008-07-13 20:07:26
|
Albert Graef wrote: > > Ok, I've done that now, putting the pure_listl and pure_tuplel runtime > routines to good use there. Besides the code to generate the element > expressions, a list or tuple expression now needs just three additional > runtime calls, with a flat call graph. That speeds up the JIT > considerably. I'm down to some 0.8 secs for compiling the 'let' > statement at the beginning of the test015 module now, and there doesn't > seem to be any way to make the code still more "digestable". > Hello Albert, The code compiles much faster now. However, your latest changes made the execution memory eager and my favourite test 'set (1..1000000)' caused my PC swap to death. It seems the code isn't tail recursive anymore. Jiri |