I've just tried:

$ cat bm.rb
def m
  yield
end

i = 0
1000000.times do
  i = m { m{ i } + 1}
end

puts i
$ time ruby bm.rb
1000000

real    0m11.721s
user    0m9.927s
sys     0m0.081s
$ time ruby.yarv bm.rb
1000000

real    0m2.376s
user    0m2.275s
sys     0m0.026s


It's silly example, but it looks very impressive anyway.

Kent.

On 2/12/06, stijn <stijndesaeger / gmail.com> wrote:
> Not to hijack the OP's thread, but a follow-up question:
>
> what speed-up can realistically be expected? I 've seen Koichi's slides
> and they look impressive but if I am not mistaken the optimizations
> looked to be concerned with basic math operations and so on. what about
> function calls / blocks / object instantiations / hash and array
> implementation / .... ? Is YARV going to muscle those around as well,
> or not really?
> if so (or if not), what performance improvements would be within reach?
>
>
> thanks,
> stijn
>
>
>