Update some benchmarks to be ractor compatible

Ex: ./run_benchmarks sudoku --harness=ractor

Author: luke-gruber

benchmarks.yml

@@ -34,6 +34,7 @@ mail:
 psych-load:
   desc: psych-load repeatedly loads a small selection of YAML files taken from various OSS projects.
   category: headline
+  ractor: true
 railsbench:
   desc: railsbench is a read-only tiny SQLite-backed Rails app, querying a small selection of .html.erb routes and JSON routes.
   category: headline
@@ -52,6 +53,7 @@ sequel:
 #
 binarytrees:
   desc: binarytrees from the Computer Language Benchmarks Game.
+  ractor: true
 erubi:
   desc: erubi compiles a simple Erb template into a method with erubi, then times evaluating that method.
 etanni:
@@ -62,18 +64,21 @@ fluentd:
   desc: fluentd is a log collector, which parses logs in a server and forwards them to various destinations.
 graphql:
   desc: GraphQL gem parsing a large file, uses Racc which has some Ruby->native->Ruby calls
+  ractor: true
 graphql-native:
   desc: GraphQL gem parsing a large file, but using a native parser
 lee:
   desc: lee is a circuit-board layout solver, deployed in a plausibly reality-like way
 nbody:
   desc: nbody from the Computer Language Benchmarks Game.
+  ractor: true
 optcarrot:
   desc: optcarrot is a functional headless NES emulator, run on a specific game cartridge for a specific number of frames.
 rack:
   desc: test the performance of the Rack framework with barely any routing.
 ruby-json:
   desc: an optimized version of the json_pure gem's pure Ruby JSON parser.
+  ractor: true
 rubyboy:
   desc: Rubyboy is a functional headless GameBoy emulator, run on a specific game cartridge for a specific number of frames.
 rubykon:
@@ -82,12 +87,16 @@ tinygql:
   desc: TinyGQL gem parsing a large file in pure Ruby
 nqueens:
   desc: solver for the N-Queens problem
+  ractor: true
 sudoku:
   desc: sudoku solver
+  ractor: true
 matmul:
   desc: matrix multiplication benchmark
+  ractor: true
 blurhash:
   desc: blurhash (blurred preview image) calculation
+  ractor: true
 protoboeuf:
   desc: protoboeuf (pure-Ruby protobuf) message decoding
 protoboeuf-encode:
@@ -100,6 +109,7 @@ protoboeuf-encode:
   desc: 30k_ifelse tests thousands of nested methods containing simple if/else statements.
   category: micro
   single_file: true
+  ractor: true
 30k_methods:
   desc: 30k_methods tests thousands of nested method calls that mostly just call out to other single-call methods.
   category: micro
@@ -108,14 +118,17 @@ cfunc_itself:
   desc: cfunc_itself just calls the 'itself' method many, many times.
   category: micro
   single_file: true
+  ractor: true
 fib:
   desc: Fib is a simple exponential-time recursive Fibonacci number generator.
   category: micro
   single_file: true
+  ractor: true
 getivar:
   desc: getivar tests the performance of getting instance variable values.
   category: micro
   single_file: true
+  ractor: true
 attr_accessor:
   desc: attr_accessor tests the performance of getting instance variable values via an attr_accessor imemo.
   category: micro
@@ -124,14 +137,17 @@ keyword_args:
   desc: keyword_args tests the performance of method calls with keyword arguments.
   category: micro
   single_file: true
+  ractor: true
 respond_to:
   desc: respond_to tests the performance of the respond_to? method.
   category: micro
   single_file: true
+  ractor: true
 object-new:
   desc: instantiate a new object in a loop to test allocation performance
   category: micro
   single_file: true
+  ractor: true
 setivar:
   desc: setivar tests the performance of setting instance variable values.
   category: micro
@@ -144,19 +160,24 @@ setivar_young:
   desc: setivar_object tests the performance of setting instance variables to an object, to test write barrier speed on young objects.
   category: micro
   single_file: true
+  ractor: true
 str_concat:
   desc: str_concat tests the performance of string concatenation in multiple different encodings.
   category: micro
   single_file: true
+  ractor: true
 throw:
   desc: microbenchmark for the throw instruction and stack unwinding.
   category: micro
   single_file: true
+  ractor: true
 ruby-xor:
   desc: pure-Ruby string XOR microbenchmark, analogous to xorcist C extension.
   category: micro
   single_file: true
+  ractor: true
 loops-times:
   desc: nested loop Integer#times and array access microbenchmark
   category: micro
   single_file: true
+  ractor: true

benchmarks/30k_ifelse.rb

@@ -1,3 +1,11 @@
+require_relative '../harness/loader'
+if ENV["YJIT_BENCH_RACTOR_HARNESS"]
+  eval_recv = Object.new
+  eval_meth = :instance_eval
+else
+  eval_recv = nil
+end
+
 def fun_l0_n0(x)
   if (x < 1)
     fun_l1_n310(x)
@@ -239998,23 +240006,29 @@ def fun_l29_n999(x)
   end
 end
 
-@a = 0
-@b = 0
-@c = 0
-@d = 0
-
-@count = 0
 def inc(x)
   @count += 1
 end
 
-@x = 0
-
-require_relative '../harness/loader'
-
 INTERNAL_ITRS = Integer(ENV.fetch("INTERNAL_ITRS", 200))
 
-run_benchmark(30) do
+main_obj = ENV["YJIT_BENCH_RACTOR_HARNESS"] ? eval_recv : nil
+run_benchmark(30, ractor_args: [main_obj]) do |num_rs,  selv|
+  if selv
+    recv = selv
+    recv_meth = :instance_eval
+  else
+    recv = 1
+    recv_meth = :times
+  end
+  recv.send(recv_meth) do
+  @a = 0
+  @b = 0
+  @c = 0
+  @d = 0
+
+  @count = 0
+  @x = 0
   INTERNAL_ITRS.times do
     @x = (@x < 1)? 1:0
     fun_l0_n0(@x)
@@ -241017,5 +241031,6 @@ def inc(x)
     fun_l0_n997(@x)
     fun_l0_n998(@x)
     fun_l0_n999(@x)
+    end
   end
 end

benchmarks/binarytrees/benchmark.rb

@@ -16,15 +16,18 @@ def bottom_up_tree(depth)
   [bottom_up_tree(depth), bottom_up_tree(depth)]
 end
 
-max_depth = 14
-min_depth = 4
+MAX_DEPTH = 14
+MIN_DEPTH = 4
 
-max_depth = min_depth + 2 if min_depth + 2 > max_depth
-stretch_depth = max_depth + 1
+MAX_DEPTH = MIN_DEPTH + 2 if MIN_DEPTH + 2 > MAX_DEPTH
+STRETCH_DEPTH = MAX_DEPTH + 1
 
 require_relative '../../harness/loader'
 
 run_benchmark(60) do
+  max_depth = MAX_DEPTH
+  min_depth = MIN_DEPTH
+  stretch_depth = STRETCH_DEPTH
   stretch_tree = bottom_up_tree(stretch_depth)
   stretch_tree = nil
 

benchmarks/blurhash/benchmark.rb

@@ -46,7 +46,7 @@ def [](from, len)
       end
     end
 
-    CHARACTERS = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz#$%*+,-.:;=?@[]^_{|}~".bytes
+    CHARACTERS = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz#$%*+,-.:;=?@[]^_{|}~".bytes.freeze
 
     def self.sRGBToLinear(value)
       v = value.to_f / 255
@@ -176,8 +176,8 @@ def blurHashForPixels(xComponents, yComponents, width, height, rgb, bytesPerRow)
 
 FILE = File.join(__dir__, "test.bin")
 
-array = File.read(FILE).bytes
+Ractor.make_shareable(ARRAY = File.read(FILE).bytes)
 
 run_benchmark(10) do
-  Blurhash.encode_rb(204, 204, array)
+  Blurhash.encode_rb(204, 204, ARRAY)
 end

benchmarks/getivar.rb

@@ -32,8 +32,8 @@ def get_value_loop
   end
 end
 
-obj = TheClass.new
+OBJ = TheClass.new.freeze
 
 run_benchmark(850) do
-  obj.get_value_loop
+ OBJ.get_value_loop
 end

benchmarks/hexapdf/benchmark.rb

@@ -18,7 +18,14 @@
 
 Dir["/tmp/hexapdf-result*.pdf"].each { |file| FileUtils.rm file }
 
-index = 0
+if ENV["YJIT_BENCH_RACTOR_HARNESS"]
+  Ractor.make_shareable(HexaPDF::DefaultDocumentConfiguration)
+  Ractor.make_shareable(HexaPDF::GlobalConfiguration)
+  # TODO... still doesn't work
+end
+
+iter = 0
+
 run_benchmark(10) do
   ## TTF benchmark (v. slow)
   #HexaPDF::Composer.create(OUT_FILENAME, page_size: [0, 0, WIDTH, HEIGHT], margin: 0) do |pdf|
@@ -28,8 +35,8 @@
   #end
 
   # Non-TTF benchmark
-  index += 1
-  out_filename = "/tmp/hexapdf-result-#{ "%03d" % index }.pdf"
+  iter += 1
+  out_filename = "/tmp/hexapdf-result-#{ "%03d" % iter }.pdf"
 
 
   composer = HexaPDF::Composer.new(page_size: [0, 0, WIDTH, HEIGHT], margin: 0)

benchmarks/loops-times.rb

@@ -1,20 +1,20 @@
 require_relative '../harness/loader'
 
 # Fix these values for determinism
-u = 5
-r = 7
+U = 5
+R = 7
 
 run_benchmark(10) do
   a = Array.new(10000, 0)
 
   4_000.times do |i|
     4_000.times do |j|
-      a[i] += j % u
+      a[i] += J % U
     end
-    a[i] += r
+    a[i] += R
   end
 
-  result = a[r]
+  result = a[R]
   if result != 8007
     raise "incorrect result"
   end

benchmarks/matmul.rb

@@ -37,10 +37,11 @@ def matmul(a, b)
   n = ARGV[0].to_i
 end
 n = n / 2 * 2
+N = n
 
 run_benchmark(20) do
-  a = matgen(n)
-  b = matgen(n)
+  a = matgen(N)
+  b = matgen(N)
   c = matmul(a, b)
   # puts c[n / 2][n / 2]
 end

benchmarks/nbody/benchmark.rb

@@ -5,6 +5,8 @@
 # modified by Jesse Millikan
 # modified by Yusuke Endoh 
 
+require_relative '../../harness/loader'
+
 SOLAR_MASS = 4 * Math::PI**2
 DAYS_PER_YEAR = 365.24
 
@@ -129,18 +131,27 @@ def offset_momentum(bodies)
 
 offset_momentum(BODIES)
 
-n = 20000
-nbodies = BODIES.size
-dt = 0.01
-
-require_relative '../../harness/loader'
+N = 20000
+NBODIES = BODIES.size
+if ENV["YJIT_BENCH_RACTOR_HARNESS"]
+  Ractor.make_shareable(BODIES)
+end
+DT = 0.01
 
 run_benchmark(200) do
+  nbodies = NBODIES
+  n = N
+  dt = DT
+  if ENV["YJIT_BENCH_RACTOR_HARNESS"]
+    bodies = ractor_deep_dup(BODIES)
+  else
+    bodies = BODIES
+  end
   n.times do
     i = 0
     while i < nbodies
-      b = BODIES[i]
-      b.move_from_i(BODIES, nbodies, dt, i + 1)
+      b = bodies[i]
+      b.move_from_i(bodies, nbodies, dt, i + 1)
       i += 1
     end
   end

benchmarks/nqueens.rb

@@ -36,13 +36,13 @@ def nq_solve(n)
   m
 end
 
-n = 10
+N = 10
 if ARGV.length > 0
-  n = ARGV[0].to_i
+  N = ARGV[0].to_i
 end
 
 run_benchmark(40) do
   10.times do
-    nq_solve(n)
+    nq_solve(N)
   end
 end