Bench queues and stacks with heap allocated blocks

Queues and stacks were previously benchmarked with immediate values only, which
unfortunately partially hides the potential cost of write barriers related to
setting and clearing elements.

Author: polytypic

bench/bench_bounded_q.ml

@@ -81,7 +81,7 @@ let run_one_domain ~budgetf ?(n_msgs = 50 * Util.iter_factor) () =
   let t = Bounded_q.create () in
 
   let op push =
-    if push then Bounded_q.push t 101 else Bounded_q.pop_opt t |> ignore
+    if push then Bounded_q.push t (ref push) else Bounded_q.pop_opt t |> ignore
   in
 
   let init _ =
@@ -113,7 +113,7 @@ let run_one ~budgetf ~n_adders ~n_takers ?(n_msgs = 50 * Util.iter_factor) () =
         let n = Countdown.alloc n_msgs_to_add ~domain_index ~batch:100 in
         if 0 < n then begin
           for i = 1 to n do
-            Bounded_q.push t i
+            Bounded_q.push t (ref i)
           done;
           work ()
         end

bench/bench_queue.ml

@@ -4,7 +4,9 @@ module Queue = Stdlib.Queue
 let run_one_domain ~budgetf ?(n_msgs = 50 * Util.iter_factor) () =
   let t = Queue.create () in
 
-  let op push = if push then Queue.push 101 t else Queue.take_opt t |> ignore in
+  let op push =
+    if push then Queue.push (ref push) t else Queue.take_opt t |> ignore
+  in
 
   let init _ =
     assert (Queue.is_empty t);

bench/bench_stack.ml

@@ -4,7 +4,9 @@ module Stack = Stdlib.Stack
 let run_one_domain ~budgetf ?(n_msgs = 50 * Util.iter_factor) () =
   let t = Stack.create () in
 
-  let op push = if push then Stack.push 101 t else Stack.pop_opt t |> ignore in
+  let op push =
+    if push then Stack.push (ref push) t else Stack.pop_opt t |> ignore
+  in
 
   let init _ =
     assert (Stack.is_empty t);