add simple loop bench

fiddled with run numbers a bit
recording times with noop removed
results slightly worse than hoped

test/bench/results.md

@@ -1,11 +1,13 @@
 # Benchmarks
 
 hello - output hello world to measure kernel calls
-add   - run integer adds by linear fibonacci of 20
+add   - run integer adds by linear fibonacci of 40
 call  - exercise calling by recursive fibonacci of 20
 noop  - a baseline that does nothing
+loop  -  just counts down, from 1M
 
-Hello and add run 100k times, calls 1k, to minimize startup impact.
+Loop, Hello, add and call run 1M , 50k, 10k and 100 respectively,
+to minimize startup impact.
 
 C was linked statically as dynamic linked influences times.
 Output was sent to /dev/null, so as to measure the calling and not the terminal.
@@ -14,16 +16,15 @@ Also output was unbuffered, because that is what rubyx implements.
 # Results
 
 Results were measured by a ruby script. Mean and variance was measured until variance was low,
-always under one percent. Noop showed that program startup is a factor, so all programs loop
-to 100k.
+always under one percent. Noop showed that program startup is a factor, so all programs loop from 10 to 50k.
 
 The machine was a virtual arm (qemu) run on a acer swift 5 (i5 8265 3.9GHz), performance roughly equivalent to a raspberry pi.
 Results (in ms) should be seen as relative, not absolute.
 
 
-language  |  noop   |  hello   |  add   |  call        
-c         |    45   |  3480    |  150   |  1400
-go        |    53   |  4000    |   64   |   740
-rubyx     |    43   |  1560    | 1800   | 16500
-ruby      |  1570   |  8240    | 2290   | 17800
-mruby     |    86   | 11210    | 1580   | 26500
+language  |  noop   |  hello   |  add   |  call | loop        
+c         |    55   |   380    |   88   |   135 |    6
+go        |    52   |   450    |    9   |    77 |    2
+rubyx     |    42   |   200    | 1700   |  1700 |  480
+ruby      |  1570   |   650    | 1090   |  1500 |  180
+mruby     |    86   |  1200    | 1370   |  2700 |  300