1 |
|
/* |
2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
< |
* http://creativecommons.org/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
|
import java.util.*; |
61 |
|
final CyclicBarrier barrier; |
62 |
|
final LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom(); |
63 |
|
int items; |
64 |
< |
Stage (Deque<Integer> q, CyclicBarrier b, int items) { |
64 |
> |
Stage(Deque<Integer> q, CyclicBarrier b, int items) { |
65 |
|
queue = q; |
66 |
|
barrier = b; |
67 |
|
this.items = items; |
72 |
|
// transform it, and put back in. |
73 |
|
try { |
74 |
|
barrier.await(); |
75 |
< |
int l = (int)System.nanoTime(); |
75 |
> |
int l = (int) System.nanoTime(); |
76 |
|
int takes = 0; |
77 |
|
for (;;) { |
78 |
|
Integer item; |
118 |
|
} |
119 |
|
|
120 |
|
static void oneRun(Class klass, int n, int items) throws Exception { |
121 |
< |
Deque<Integer> q = (Deque<Integer>)klass.newInstance(); |
121 |
> |
Deque<Integer> q = (Deque<Integer>) klass.newInstance(); |
122 |
|
LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer(); |
123 |
|
CyclicBarrier barrier = new CyclicBarrier(n + 1, timer); |
124 |
|
totalItems = new AtomicInteger(n * items); |