On Wed, Nov 17, 2004 at 10:03:14PM +0100, Leopold Toetsch wrote: > Dan Sugalski wrote: > > As already stated, I don't consider these as either light-weight nor > faster. Here is a benchmark. > > Below are 2 version of a recursive factorial program. fact(100) is > calculated 1000 times: > > PIR 1.1 s > bsr/ret 2.4 s > PIR/tailcall 0.2s > > Unoptimized Parrot, default i.e. slow run core.
BTW, it may be very possible for me to write the p6ge generator so that it can be switched between the PIR and bsr/ret calling conventions, so we don't need to resolve this entirely now. And we could then benchmark the two against each other. Pm
