rubyx/test/bench/c/calls.c

#include<stdio.h>

int fibo_r(int n)
{
   if ( n <  2 )
      return n;
   else
      return ( fibo_r(n-1) + fibo_r(n-2) );
}

int main(void)
{
	int counter = 100;
	int fib ;
	while(counter--) {
		fib += fibo_r(20);
	}
}
thats most of the benchmarking strange about the puts in soml, hard to see where a factor of 10 would come from 2015-11-20 22:51:58 +01:00			`#include<stdio.h>`

			`int fibo_r(int n)`
			`{`
			`if ( n < 2 )`
			`return n;`
			`else`
			`return ( fibo_r(n-1) + fibo_r(n-2) );`
			`}`

			`int main(void)`
			`{`
add simple loop bench fiddled with run numbers a bit recording times with noop removed results slightly worse than hoped 2019-07-31 20:18:03 +02:00			`int counter = 100;`
thats most of the benchmarking strange about the puts in soml, hard to see where a factor of 10 would come from 2015-11-20 22:51:58 +01:00			`int fib ;`
			`while(counter--) {`
fix benchmarks up to 20 recursive fibo had mixed add and calls for rubyx 2019-07-30 20:16:24 +02:00			`fib += fibo_r(20);`
thats most of the benchmarking strange about the puts in soml, hard to see where a factor of 10 would come from 2015-11-20 22:51:58 +01:00			`}`
			`}`