From 0f23be3dc25611168ba9eb884997f23a340a5084 Mon Sep 17 00:00:00 2001
From: Simon Cruanes <simon.cruanes.2007@m4x.org>
Date: Sat, 19 Mar 2022 23:42:48 -0400
Subject: [PATCH] bench for lfqueue

---
 benchs/dune          |  3 +-
 benchs/run_benchs.ml | 91 ++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 93 insertions(+), 1 deletion(-)

diff --git a/benchs/dune b/benchs/dune
index c8430fc7..36d34d56 100644
--- a/benchs/dune
+++ b/benchs/dune
@@ -1,6 +1,7 @@
  (executables
   (names run_benchs run_bench_hash run_objsize)
-  (libraries containers containers-data
+  (libraries containers containers-data threads
+             containers.lfqueue
              containers-thread benchmark gen iter qcheck oseq
              batteries base sek)
   (flags :standard -warn-error -3-5 -safe-string -color always -open CCShims_)
diff --git a/benchs/run_benchs.ml b/benchs/run_benchs.ml
index d8a10b83..fd5082a1 100644
--- a/benchs/run_benchs.ml
+++ b/benchs/run_benchs.ml
@@ -12,6 +12,11 @@ module Int_map = Map.Make(CCInt)
 
 let app_int f n = string_of_int n @> lazy (f n)
 let app_ints f l = B.Tree.concat (List.map (app_int f) l)
+let app_ints2 f l1 l2 =
+  B.Tree.concat @@
+  List.concat @@
+  List.map (fun n1 ->
+      List.map (fun n2 -> Printf.sprintf "%d/%d" n1 n2 @> lazy (f n1 n2)) l2) l1
 
 (* for benchmark *)
 let repeat = 3
@@ -1209,6 +1214,92 @@ module Deque = struct
   )
 end
 
+module Sync_queue = struct
+  module type S = sig
+    type 'a t
+    val create : dummy:'a -> unit -> 'a t
+    val push : 'a t -> 'a -> unit
+    val pop_nonblock : 'a t -> 'a option
+  end
+
+  module Mutex_queue : S = struct
+    type 'a t = {
+      q: 'a Queue.t;
+      m: Mutex.t;
+      cond: Condition.t;
+    }
+
+    let create ~dummy:_ () = {
+      q=Queue.create();
+      m=Mutex.create();
+      cond=Condition.create()
+    }
+
+    let push self x =
+      Mutex.lock self.m;
+      Queue.push x self.q;
+      Condition.signal self.cond;
+      Mutex.unlock self.m
+
+    let pop_nonblock self =
+      Mutex.lock self.m;
+      let r = try Some (Queue.pop self.q) with _ -> None in
+      Mutex.unlock self.m;
+      r
+  end
+
+  module Blocking_queue : S = struct
+    include CCBlockingQueue
+
+    let create ~dummy:_ () = create max_int
+    let pop_nonblock = try_take
+  end
+
+  let mutex_queue = (module Mutex_queue : S)
+  let blocking_queue = (module Blocking_queue : S)
+  let lfqueue = (module Containers_lfqueue : S)
+
+  let bench1 n_th n =
+    let make (module Q : S) () =
+      let q = Q.create ~dummy:0 () in
+      let write () =
+        for i = 1 to n do
+          Q.push q i
+        done
+      and read () =
+        let missing = ref n in
+        while !missing > 0 do
+          match Q.pop_nonblock q with
+            | None -> Thread.yield();
+            | Some _ -> decr missing
+        done
+      in
+      let writers = Array.init n_th (fun _ -> Thread.create write ()) in
+      let readers = Array.init n_th (fun _ -> Thread.create read ()) in
+      Array.iter Thread.join writers;
+      Array.iter Thread.join readers;
+      ()
+    in
+    B.throughputN 3 ~repeat
+      [ "mutex_queue", make mutex_queue, ()
+      ; "blocking_queue", make blocking_queue, ()
+      ; "lfqueue", make lfqueue, ()
+      ]
+
+  let () = B.Tree.register (
+    "sync_queue" @>>> [
+      "b1" @>> app_ints2 bench1 [2;3;4] [100_000; 1_000_000];
+      (*
+      "iter" @>> app_ints bench_iter [100; 1_000; 100_000];
+      "push_front" @>> app_ints bench_push_front [100; 1_000; 100_000];
+      "push_back" @>> app_ints bench_push_back [100; 1_000; 100_000];
+      "append_back" @>> app_ints bench_append [100; 1_000; 100_000];
+      "length" @>> app_ints bench_length [100; 1_000];
+         *)
+
+    ])
+end
+
 module Graph = struct
   (* divisors graph *)
   let div_children_ i =