bench9000 0.1

data/benchmarks/classic/fannkuch-redux.rb

@@ -0,0 +1,111 @@
+# Copyright © 2004-2013 Brent Fulgham
+#
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are met:
+#
+#   * Redistributions of source code must retain the above copyright notice,
+#     this list of conditions and the following disclaimer.
+#
+#   * Redistributions in binary form must reproduce the above copyright notice,
+#     this list of conditions and the following disclaimer in the documentation
+#     and/or other materials provided with the distribution.
+#
+#   * Neither the name of "The Computer Language Benchmarks Game" nor the name
+#     of "The Computer Language Shootout Benchmarks" nor the names of its
+#     contributors may be used to endorse or promote products derived from this
+#     software without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+# The Computer Language Benchmarks Game
+
+# http://benchmarksgame.alioth.debian.org/
+
+# Contributed by Wesley Moxam
+
+# Modified by Sokolov Yura aka funny_falcon
+
+# http://benchmarksgame.alioth.debian.org/u64q/program.php?test=fannkuchredux&lang=yarv&id=1
+
+def fannkuch(n)
+  p = (0..n).to_a
+  s = p.dup
+  q = p.dup
+  sign = 1
+  sum = maxflips = 0
+  while(true)
+    # flip.
+
+    if (q1 = p[1]) != 1
+      q[0..-1] = p
+      flips = 1
+      until (qq = q[q1]) == 1
+        q[q1] = q1
+        if q1 >= 4
+          i, j = 2, q1 - 1
+          while i < j
+            q[i], q[j] = q[j], q[i]
+            i += 1
+            j -= 1
+          end
+        end
+        q1 = qq
+        flips += 1
+      end
+      sum += sign * flips
+      maxflips = flips if flips > maxflips # New maximum?
+
+    end
+    # Permute.
+
+    if sign == 1
+      # Rotate 1<-2.
+
+      p[1], p[2] = p[2], p[1]
+      sign = -1
+    else
+      # Rotate 1<-2 and 1<-2<-3.
+
+      p[2], p[3] = p[3], p[2]
+      sign = 1
+      i = 3
+      while i <= n && s[i] == 1
+        #return [sum, maxflips] if i == n     # Out of permutations.
+        return sum if i == n
+
+        s[i] = i
+        # Rotate 1<-...<-i+1.
+
+        t = p.delete_at(1)
+        i += 1
+        p.insert(i, t)
+      end
+      s[i] -= 1  if i <= n
+    end
+  end
+end
+
+def harness_input
+  9
+end
+
+def harness_sample(input)
+  fannkuch(input)
+end
+
+def harness_verify(output)
+  output == 8629
+end
+
+require 'bench9000/harness'

data/benchmarks/classic/fasta-string.rb

@@ -0,0 +1,71 @@
+# Copyright © 2004-2008 Brent Fulgham, 2005-2015 Isaac Gouy
+#
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are met:
+#
+#   * Redistributions of source code must retain the above copyright notice,
+#     this list of conditions and the following disclaimer.
+#
+#   * Redistributions in binary form must reproduce the above copyright notice,
+#     this list of conditions and the following disclaimer in the documentation
+#     and/or other materials provided with the distribution.
+#
+#   * Neither the name of "The Computer Language Benchmarks Game" nor the name
+#     of "The Computer Language Shootout Benchmarks" nor the names of its
+#     contributors may be used to endorse or promote products derived from this
+#     software without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+# The Computer Language Benchmarks Game
+
+# http://benchmarksgame.alioth.debian.org/
+
+# Contributed by Sokolov Yura
+
+# Modified by Joseph LaFata
+
+# http://benchmarksgame.alioth.debian.org/u32/program.php?test=fasta&lang=yarv&id=2
+
+ALU =
+   "GGCCGGGCGCGGTGGCTCACGCCTGTAATCCCAGCACTTTGG"+
+   "GAGGCCGAGGCGGGCGGATCACCTGAGGTCAGGAGTTCGAGA"+
+   "CCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACTAAAAAT"+
+   "ACAAAAATTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCA"+
+   "GCTACTCGGGAGGCTGAGGCAGGAGAATCGCTTGAACCCGGG"+
+   "AGGCGGAGGTTGCAGTGAGCCGAGATCGCGCCACTGCACTCC"+
+   "AGCCTGGGCGACAGAGCGAGACTCCGTCTCAAAAA"
+
+def make_repeat_fasta(src, n)
+    l = src.length
+    s = src * ((n / l) + 1)
+    s.slice!(n, l)
+    output = ''
+    0.step(s.length-1,60) {|x| output << s[x,60]; output << "\n"}
+    output
+end
+
+def harness_input
+  100_000_000
+end
+
+def harness_sample(input)
+  make_repeat_fasta(ALU, input)
+end
+
+def harness_verify(output)
+  output.length == 101666667
+end
+
+require 'bench9000/harness'

data/benchmarks/classic/mandelbrot.rb

@@ -0,0 +1,112 @@
+# Copyright © 2004-2013 Brent Fulgham
+#
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are met:
+#
+#   * Redistributions of source code must retain the above copyright notice,
+#     this list of conditions and the following disclaimer.
+#
+#   * Redistributions in binary form must reproduce the above copyright notice,
+#     this list of conditions and the following disclaimer in the documentation
+#     and/or other materials provided with the distribution.
+#
+#   * Neither the name of "The Computer Language Benchmarks Game" nor the name
+#     of "The Computer Language Shootout Benchmarks" nor the names of its
+#     contributors may be used to endorse or promote products derived from this
+#     software without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+# The Computer Language Benchmarks Game
+# http://benchmarksgame.alioth.debian.org
+#
+#  contributed by Karl von Laudermann
+#  modified by Jeremy Echols
+#  modified by Detlef Reichl
+#  modified by Joseph LaFata
+#  modified by Peter Zotov
+
+# http://benchmarksgame.alioth.debian.org/u64q/program.php?test=mandelbrot&lang=yarv&id=3
+
+def mandelbrot(size)
+  sum = 0
+
+  byte_acc = 0
+  bit_num = 0
+
+  y = 0
+  while y < size
+    ci = (2.0*y/size)-1.0
+
+    x = 0
+    while x < size
+      zrzr = zr = 0.0
+      zizi = zi = 0.0
+      cr = (2.0*x/size)-1.5
+      escape = 0b1
+
+      z = 0
+      while z < 50
+        tr = zrzr - zizi + cr
+        ti = 2.0*zr*zi + ci
+        zr = tr
+        zi = ti
+        # preserve recalculation
+        zrzr = zr*zr
+        zizi = zi*zi
+        if zrzr+zizi > 4.0
+          escape = 0b0
+          break
+        end
+        z += 1
+      end
+
+      byte_acc = (byte_acc << 1) | escape
+      bit_num += 1
+
+      # Code is very similar for these cases, but using separate blocks
+      # ensures we skip the shifting when it's unnecessary, which is most cases.
+      if (bit_num == 8)
+        #print byte_acc.chr
+        sum ^= byte_acc
+        byte_acc = 0
+        bit_num = 0
+      elsif (x == size - 1)
+        byte_acc <<= (8 - bit_num)
+        #print byte_acc.chr
+        sum ^= byte_acc
+        byte_acc = 0
+        bit_num = 0
+      end
+      x += 1
+    end
+    y += 1
+  end
+
+  sum
+end
+
+def harness_input
+  750
+end
+
+def harness_sample(input)
+  mandelbrot(input)
+end
+
+def harness_verify(output)
+  output == 192
+end
+
+require 'bench9000/harness'

data/benchmarks/classic/matrix-multiply.rb

@@ -0,0 +1,78 @@
+#!/usr/bin/ruby
+# -*- mode: ruby -*-
+# $Id: matrix.ruby,v 1.2 2005-03-23 06:11:41 bfulgham Exp $
+# http://shootout.alioth.debian.org/
+#
+# Contributed by Christopher Williams
+#
+# Extracted and modified from https://github.com/jruby/jruby/blob/1.7.16.1/bench/shootout/matrix.ruby
+#
+# The modifications made are mostly cosmetic. The internal looping was removed since the benchmark system handles
+# that.  Matrix creation was dumbed down to work better with nascent Ruby implementations.
+
+SIZE = 175
+
+def mkmatrix(rows, cols)
+  count = 0
+
+  matrix = []
+
+  rows.times do
+    row = []
+
+    cols.times do
+      row << (count += 1)
+    end
+
+    matrix << row
+  end
+
+  matrix
+end
+
+def mmult(rows, cols, m1, m2)
+  m3 = []
+  for i in 0 .. (rows - 1)
+    row = []
+    for j in 0 .. (cols - 1)
+      val = 0
+      for k in 0 .. (cols - 1)
+        val += m1[i][k] * m2[k][j]
+      end
+      row << val
+    end
+    m3 << row
+  end
+  m3
+end
+
+
+def harness_input
+  m1 = mkmatrix(SIZE, SIZE)
+  m2 = mkmatrix(SIZE, SIZE)
+
+  [m1, m2]
+end
+
+def harness_sample(input)
+  m1, m2 = *input
+
+  mm = mmult(SIZE, SIZE, m1, m2)
+
+  [m1, m2, mm]
+end
+
+def harness_verify(output)
+  m1, m2, mm = *output
+
+  mm_row_count = mm.size
+  mm_col_count = mm.first.size
+
+  m1_row_count = m1.size
+  m2_col_count = m2.first.size
+
+  # Verify the dimensionality of the product matrix is correct.
+  mm_row_count == m1_row_count && mm_col_count == m2_col_count
+end
+
+require 'bench9000/harness'

data/benchmarks/classic/n-body.rb

@@ -0,0 +1,188 @@
+# Copyright © 2004-2013 Brent Fulgham
+#
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are met:
+#
+#   * Redistributions of source code must retain the above copyright notice,
+#     this list of conditions and the following disclaimer.
+#
+#   * Redistributions in binary form must reproduce the above copyright notice,
+#     this list of conditions and the following disclaimer in the documentation
+#     and/or other materials provided with the distribution.
+#
+#   * Neither the name of "The Computer Language Benchmarks Game" nor the name
+#     of "The Computer Language Shootout Benchmarks" nor the names of its
+#     contributors may be used to endorse or promote products derived from this
+#     software without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+# The Computer Language Benchmarks Game
+# http://benchmarksgame.alioth.debian.org
+#
+# Optimized for Ruby by Jesse Millikan
+# From version ported by Michael Neumann from the C gcc version,
+# which was written by Christoph Bauer.
+
+# http://benchmarksgame.alioth.debian.org/u64q/program.php?test=nbody&lang=yarv&id=2
+
+SOLAR_MASS = 4 * Math::PI**2
+DAYS_PER_YEAR = 365.24
+
+class Planet
+ attr_accessor :x, :y, :z, :vx, :vy, :vz, :mass
+
+ def initialize(x, y, z, vx, vy, vz, mass)
+  @x, @y, @z = x, y, z
+  @vx, @vy, @vz = vx * DAYS_PER_YEAR, vy * DAYS_PER_YEAR, vz * DAYS_PER_YEAR
+  @mass = mass * SOLAR_MASS
+ end
+
+ def move_from_i(bodies, nbodies, dt, i)
+  while i < nbodies
+   b2 = bodies[i]
+   dx = @x - b2.x
+   dy = @y - b2.y
+   dz = @z - b2.z
+
+   distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
+   mag = dt / (distance * distance * distance)
+   b_mass_mag, b2_mass_mag = @mass * mag, b2.mass * mag
+
+   @vx -= dx * b2_mass_mag
+   @vy -= dy * b2_mass_mag
+   @vz -= dz * b2_mass_mag
+   b2.vx += dx * b_mass_mag
+   b2.vy += dy * b_mass_mag
+   b2.vz += dz * b_mass_mag
+   i += 1
+  end
+
+  @x += dt * @vx
+  @y += dt * @vy
+  @z += dt * @vz
+ end
+end
+
+def energy(bodies)
+  e = 0.0
+  nbodies = bodies.size
+
+  for i in 0 ... nbodies
+    b = bodies[i]
+    e += 0.5 * b.mass * (b.vx * b.vx + b.vy * b.vy + b.vz * b.vz)
+    for j in (i + 1) ... nbodies
+      b2 = bodies[j]
+      dx = b.x - b2.x
+      dy = b.y - b2.y
+      dz = b.z - b2.z
+      distance = Math.sqrt(dx * dx + dy * dy + dz * dz)
+      e -= (b.mass * b2.mass) / distance
+    end
+  end
+  e
+end
+
+def offset_momentum(bodies)
+  px, py, pz = 0.0, 0.0, 0.0
+
+  for b in bodies
+    m = b.mass
+    px += b.vx * m
+    py += b.vy * m
+    pz += b.vz * m
+  end
+
+  b = bodies[0]
+  b.vx = - px / SOLAR_MASS
+  b.vy = - py / SOLAR_MASS
+  b.vz = - pz / SOLAR_MASS
+end
+
+def run(n)
+  bodies = [
+    # sun
+    Planet.new(0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0),
+
+    # jupiter
+    Planet.new(
+      4.84143144246472090e+00,
+      -1.16032004402742839e+00,
+      -1.03622044471123109e-01,
+      1.66007664274403694e-03,
+      7.69901118419740425e-03,
+      -6.90460016972063023e-05,
+      9.54791938424326609e-04),
+
+    # saturn
+    Planet.new(
+      8.34336671824457987e+00,
+      4.12479856412430479e+00,
+      -4.03523417114321381e-01,
+      -2.76742510726862411e-03,
+      4.99852801234917238e-03,
+      2.30417297573763929e-05,
+      2.85885980666130812e-04),
+
+    # uranus
+    Planet.new(
+      1.28943695621391310e+01,
+      -1.51111514016986312e+01,
+      -2.23307578892655734e-01,
+      2.96460137564761618e-03,
+      2.37847173959480950e-03,
+      -2.96589568540237556e-05,
+      4.36624404335156298e-05),
+
+    # neptune
+    Planet.new(
+      1.53796971148509165e+01,
+      -2.59193146099879641e+01,
+      1.79258772950371181e-01,
+      2.68067772490389322e-03,
+      1.62824170038242295e-03,
+      -9.51592254519715870e-05,
+      5.15138902046611451e-05)
+  ]
+
+  offset_momentum(bodies)
+
+  nbodies = bodies.size
+  dt = 0.01
+
+  n.times do
+    i = 0
+    while i < nbodies
+      b = bodies[i]
+      b.move_from_i(bodies, nbodies, dt, i + 1)
+      i += 1
+    end
+  end
+
+  energy(bodies)
+end
+
+def harness_input
+  100000
+end
+
+def harness_sample(input)
+  run(input)
+end
+
+def harness_verify(output)
+  (output - -0.1690798593916805).abs < 0.000001
+end
+
+require 'bench9000/harness'