Re: Very large runtime overhead for prototyped functions

2003-12-27 Thread Joe Wilson
That's okay - I've also considered and discarded Parrot. ;-) Good luck with Parrot guys. I will check out either Mono or Lua's VM for my purposes. Thanks. --- Dan Sugalski <[EMAIL PROTECTED]> wrote: > At 2:34 PM -0800 12/27/03, Joe Wilson wrote: > >I get consistantly much better timings when argu

Re: Very large runtime overhead for prototyped functions

2003-12-27 Thread Dan Sugalski
At 2:34 PM -0800 12/27/03, Joe Wilson wrote: I get consistantly much better timings when arguments of prototyped functions (regardless of type, number of arguments, or whether it is a vararg function) are simply all passed in a single PMC array unconditionally. Please consider it. Considered, but a

Re: Very large runtime overhead for prototyped functions

2003-12-27 Thread Joe Wilson
--- Luke Palmer <[EMAIL PROTECTED]> wrote: > The overhead you're seeing comes from many things. First, using > prototyped (or unprototyped) functions from in imcc follows the parrot > calling conventions. That is, it uses continuation-passing instead of > bsr, sets a few int registers on the run

Re: Very large runtime overhead for prototyped functions

2003-12-27 Thread Luke Palmer
Joe Wilson writes: > Using a recursive version of the fibonacci function (with > the integer 32 as an argument) to test function call overhead > I get these timings for various languages and configurations: > > perl 5.6.1fib.pl 10.93 seconds > python 2.2.2 fib.py6.76 seconds >