Change bits of benchs to account for Xadd default behaviour

chutian52 · May 30, 2020 · c0b570d · c0b570d
1 parent 77f8c87
commit c0b570d
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 4 deletions.
diff --git a/jctools-benchmarks/src/main/java/org/jctools/jmh/latency/MpqBurstCost.java b/jctools-benchmarks/src/main/java/org/jctools/jmh/latency/MpqBurstCost.java
@@ -61,11 +61,12 @@ public void setupQueueAndConsumers()
             final Event event = new Event();
 
             // stretch the queue to the limit, working through resizing and full
-            for (int i = 0; i < 128 + 100; i++)
+            // 128 * 2 account for the xadd qs that pool by default 2 chunks
+            for (int i = 0; i < ((128 * 2) + 100); i++)
             {
                 q.offer(event);
             }
-            for (int i = 0; i < 128 + 100; i++)
+            for (int i = 0; i < ((128 * 2) + 100); i++)
             {
                 q.poll();
             }

diff --git a/jctools-benchmarks/src/main/java/org/jctools/jmh/latency/QueueBurstCost.java b/jctools-benchmarks/src/main/java/org/jctools/jmh/latency/QueueBurstCost.java
@@ -61,11 +61,12 @@ public void setupQueueAndConsumers()
             final Event event = new Event();
 
             // stretch the queue to the limit, working through resizing and full
-            for (int i = 0; i < 128 + 100; i++)
+            // 128 * 2 account for the xadd qs that pool by default 2 chunks
+            for (int i = 0; i < ((128 * 2) + 100); i++)
             {
                 q.offer(event);
             }
-            for (int i = 0; i < 128 + 100; i++)
+            for (int i = 0; i < ((128 * 2) + 100); i++)
             {
                 q.poll();
             }