jruby · Oct 17, 2014 · Oct 17, 2014 · Oct 17, 2014 · Oct 17, 2014 · Oct 18, 2014
diff --git a/bench/truffle/.gitignore b/bench/truffle/.gitignore
@@ -0,0 +1 @@
+reference.data
diff --git a/bench/truffle/binary-trees.rb b/bench/truffle/binary-trees.rb
@@ -0,0 +1,100 @@
+# 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 Jesse Millikan
+# Modified by Wesley Moxam
+
+# http://benchmarksgame.alioth.debian.org/u64q/program.php?test=binarytrees&lang=yarv&id=1
+
+def item_check(left, item, right)
+  return item if left.nil?
+  item + item_check(*left) - item_check(*right)
+end
+
+def bottom_up_tree(item, depth)
+  return [nil, item, nil] unless depth > 0
+  item_item = 2 * item
+  depth -= 1
+  [bottom_up_tree(item_item - 1, depth), item, bottom_up_tree(item_item, depth)]
+end
+
+def binary_trees(max_depth)
+  sum = 0
+
+  min_depth = 4
+
+  max_depth = min_depth + 2 if min_depth + 2 > max_depth
+
+  stretch_depth = max_depth + 1
+  stretch_tree = bottom_up_tree(0, stretch_depth)
+
+  sum += item_check(*stretch_tree)
+  stretch_tree = nil
+
+  long_lived_tree = bottom_up_tree(0, max_depth)
+
+  min_depth.step(max_depth + 1, 2) do |depth|
+    iterations = 2**(max_depth - depth + min_depth)
+
+    check = 0
+
+    for i in 1..iterations
+      temp_tree = bottom_up_tree(i, depth)
+      check += item_check(*temp_tree)
+
+      temp_tree = bottom_up_tree(-i, depth)
+      check += item_check(*temp_tree)
+    end
+
+    sum += depth
+    sum += check
+  end
+
+  sum += item_check(*long_lived_tree)
+
+  sum
+end
+
+def warmup
+  1000.times do
+    binary_trees(10)
+  end
+end
+
+def sample
+  binary_trees(15) == -87308
+end
+
+def name
+  return "shootout-binary-trees"
+end
diff --git a/bench/truffle/c/Makefile b/bench/truffle/c/Makefile
@@ -0,0 +1,2 @@
+mandelbrot: mandelbrot.c
+	$(CC) -std=c99 -O3 -o $@ $^
diff --git a/bench/truffle/c/mandelbrot.c b/bench/truffle/c/mandelbrot.c
@@ -0,0 +1,151 @@
+// 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
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <sys/time.h>
+
+int mandelbrot(double size) {
+ int sum = 0;
+
+ int byte_acc = 0;
+ int bit_num = 0;
+
+ int y = 0;
+ while (y < size) {
+   double ci = (2.0*y/size)-1.0;
+
+   int x = 0;
+   while (x < size) {
+     double zr = 0.0;
+     double zrzr = zr;
+     double zi = 0.0;
+     double zizi = zi;
+     double cr = (2.0*x/size)-1.5;
+     int escape = 1;
+
+     int z = 0;
+     while (z < 50) {
+       double tr = zrzr - zizi + cr;
+       double ti = 2.0*zr*zi + ci;
+       zr = tr;
+       zi = ti;
+       // preserve recalculation
+       zrzr = zr*zr;
+       zizi = zi*zi;
+       if (zrzr+zizi > 4.0) {
+         escape = 0;
+         break;
+       }
+       z += 1;
+     }
+
+     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;
+     } else if (x == size - 1) {
+       byte_acc <<= (8 - bit_num);
+       //print byte_acc.chr
+       sum ^= byte_acc;
+       byte_acc = 0;
+       bit_num = 0;
+     }
+     x += 1;
+   }
+   y += 1;
+ }
+
+ return sum;
+}
+
+void warmup() {
+  for (int n = 0; n < 10000; n++) {
+     mandelbrot(10);
+  }
+}
+
+int sample() {
+  return mandelbrot(750) == 192;
+}
+
+double secondtime();
+
+int main(int argc, char** argv) {
+  int budget = atoi(argv[0]);
+
+  warmup();
+
+  int iterations = 0;
+
+  double start = secondtime();
+  double elapsed;
+
+  while (1) {
+     if (!sample()) {
+        abort();
+     }
+
+     iterations++;
+
+     elapsed = secondtime() - start;
+
+     if (elapsed > budget)
+        break;
+  }
+
+  double score = iterations / elapsed * 1000.0;
+
+  printf("%f\n", score);
+}
+
+double secondtime() {
+  // Not monotonic
+  struct timeval t;
+  gettimeofday(&t, NULL);
+  return t.tv_sec + t.tv_usec / 1e6;
+}
diff --git a/bench/truffle/compare.rb b/bench/truffle/compare.rb
@@ -0,0 +1,137 @@
+# Copyright (c) 2013, 2014 Oracle and/or its affiliates. All rights reserved. This
+# code is released under a tri EPL/GPL/LGPL license. You can use it,
+# redistribute it and/or modify it under the terms of the:
+#
+# Eclipse Public License version 1.0
+# GNU General Public License version 2
+# GNU Lesser General Public License version 2.1
+
+time_budget = nil
+reference = false
+verbose = false
+
+args = ARGV.dup
+
+while not args.empty?
+  arg = args.shift
+
+  case arg
+  when "--reference"
+    reference = true
+  when "-s"
+    time_budget = args.shift.to_i
+  when "-m"
+    time_budget = args.shift.to_i * 60
+  when "-h"
+    time_budget = args.shift.to_i * 60 * 60
+  when "-v"
+    verbose = true
+  when "--help", "-help", "-h"
+    puts "Note: use a system Ruby to run this script, not the development JRuby, as that seems to sometimes get in a twist"
+    puts
+    puts "Set a reference point, running for 5 minutes:"
+    puts "    JAVACMD=... ruby benchmark-compare.rb --reference -m 5"
+    puts
+    puts "Compare against that reference point:"
+    puts "    JAVACMD=... ruby benchmark-compare.rb"
+    puts
+    puts "  -s n  run for n seconds (default 60)"
+    puts "  -m n  run for n minutes"
+    puts "  -h n  run for n hours"
+    puts
+    puts "  -v    show all output"
+    exit
+  else
+    puts "unknown argument " + arg
+    exit
+  end
+end
+
+if reference
+  if time_budget.nil?
+    time_budget = 60
+  end
+else
+  reference_scores = {}
+
+  if not time_budget.nil?
+    puts "can't specify budget unless --reference"
+    exit
+  end
+
+  File.open("reference.data").each do |line|
+    key, value = line.split
+    if key == "-s"
+      time_budget = value.to_i
+    else
+      reference_scores[key] = value.to_f
+    end
+  end
+end
+
+if ENV["JAVACMD"].nil? or not File.exist? File.expand_path(ENV["JAVACMD"])
+  puts "warning: couldn't find $JAVACMD - set this to the path of the Java command in graalvm-jdk1.8.0 or a build of the Graal repo"
+end
+
+benchmarks = [
+  "binary-trees",
+  "fannkuch-redux",
+  "mandelbrot",
+  "n-body",
+  "pidigits",
+  "spectral-norm",
+  "neural-net",
+  "richards",
+  #"deltablue"
+]
+
+disable_splitting = [
+  "spectral-norm",
+  "neural-net"
+]
+
+time_budget_per_run = time_budget / benchmarks.length
+puts time_budget_per_run.to_s + "s for each benchmark" if reference
+
+scores = {}
+
+benchmarks.each do |benchmark|
+  if disable_splitting.include? benchmark
+    splitting = "-J-G:-TruffleSplitting"
+  else
+    splitting = ""
+  end
+
+  output = `../../bin/jruby -J-server #{splitting} -X+T harness.rb -s #{time_budget_per_run} #{benchmark}.rb`
+  score_match = /[a-z\-]+: (\d+\.\d+)/.match(output)
+  if score_match.nil?
+    score = 0
+    puts benchmark + " error"
+    puts output
+  else
+    if verbose
+      puts output
+    end
+
+    score = score_match[1].to_f
+    puts benchmark + " " + score.to_s
+  end
+  scores[benchmark] = score
+end
+
+if reference
+  File.open("reference.data", "w") do |file|
+    file.write("-s #{time_budget}\n")
+
+    benchmarks.each do |benchmark|
+      file.write("#{benchmark} #{scores[benchmark]}\n")
+    end
+  end
+else
+  puts "-------"
+  benchmarks.each do |benchmark|
+    increase = scores[benchmark] - reference_scores[benchmark]
+    increase_percentage = increase / reference_scores[benchmark] * 100
+    puts "#{benchmark.ljust(15)} #{increase_percentage.round(2).to_s.rjust(6)}%"
+  end
+end
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,2 @@
		mandelbrot: mandelbrot.c
		$(CC) -std=c99 -O3 -o $@ $^