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.*; |
34 |
|
static final int POOL_MASK = POOL_SIZE-1; |
35 |
|
static final Integer[] intPool = new Integer[POOL_SIZE]; |
36 |
|
static { |
37 |
< |
for (int i = 0; i < POOL_SIZE; ++i) |
37 |
> |
for (int i = 0; i < POOL_SIZE; ++i) |
38 |
|
intPool[i] = Integer.valueOf(i); |
39 |
|
} |
40 |
|
|
41 |
|
// Number of puts by producers or takes by consumers |
42 |
|
static final int ITERS = 1 << 20; |
43 |
|
|
44 |
< |
// max lag between a producer and consumer to avoid |
44 |
> |
// max lag between a producer and consumer to avoid |
45 |
|
// this becoming a GC test rather than queue test. |
46 |
|
// Used only per-pair to lessen impact on queue sync |
47 |
|
static final int LAG_MASK = (1 << 12) - 1; |
49 |
|
public static void main(String[] args) throws Exception { |
50 |
|
int maxPairs = NCPUS * 3 / 2; |
51 |
|
|
52 |
< |
if (args.length > 0) |
52 |
> |
if (args.length > 0) |
53 |
|
maxPairs = Integer.parseInt(args[0]); |
54 |
|
|
55 |
|
warmup(); |
56 |
|
print = true; |
57 |
< |
int k = 1; |
58 |
< |
for (int i = 1; i <= maxPairs;) { |
57 |
> |
for (int k = 1, i = 1; i <= maxPairs;) { |
58 |
|
System.out.println("Pairs:" + i); |
59 |
|
oneTest(i, ITERS); |
60 |
|
if (i == k) { |
61 |
|
k = i << 1; |
62 |
|
i = i + (i >>> 1); |
63 |
< |
} |
64 |
< |
else |
63 |
> |
} |
64 |
> |
else |
65 |
|
i = k; |
66 |
|
} |
67 |
|
pool.shutdown(); |
72 |
|
System.out.print("Warmup "); |
73 |
|
int it = 2000; |
74 |
|
for (int j = 5; j > 0; --j) { |
75 |
< |
oneTest(j, it); |
75 |
> |
oneTest(j, it); |
76 |
|
System.out.print("."); |
77 |
|
it += 1000; |
78 |
|
} |
79 |
|
System.gc(); |
80 |
|
it = 20000; |
81 |
|
for (int j = 5; j > 0; --j) { |
82 |
< |
oneTest(j, it); |
82 |
> |
oneTest(j, it); |
83 |
|
System.out.print("."); |
84 |
|
it += 10000; |
85 |
|
} |
109 |
|
if (print) |
110 |
|
System.out.print("LinkedBlockingDeque "); |
111 |
|
oneRun(new LinkedBlockingDeque<Integer>(), n, iters); |
112 |
< |
|
112 |
> |
|
113 |
|
Thread.sleep(100); // System.gc(); |
114 |
|
if (print) |
115 |
|
System.out.print("ArrayBlockingQueue "); |
120 |
|
System.out.print("SynchronousQueue "); |
121 |
|
oneRun(new SynchronousQueue<Integer>(), n, iters); |
122 |
|
|
124 |
– |
|
123 |
|
Thread.sleep(100); // System.gc(); |
124 |
|
if (print) |
125 |
|
System.out.print("SynchronousQueue(fair) "); |
134 |
|
if (print) |
135 |
|
System.out.print("LinkedTransferQueue(half)"); |
136 |
|
oneRun(new HalfSyncLTQ<Integer>(), n, iters); |
137 |
< |
|
137 |
> |
|
138 |
|
Thread.sleep(100); // System.gc(); |
139 |
|
if (print) |
140 |
|
System.out.print("PriorityBlockingQueue "); |
146 |
|
oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE, true), n, fairIters); |
147 |
|
|
148 |
|
} |
149 |
< |
|
150 |
< |
static abstract class Stage implements Runnable { |
149 |
> |
|
150 |
> |
abstract static class Stage implements Runnable { |
151 |
|
final int iters; |
152 |
|
final BlockingQueue<Integer> queue; |
153 |
|
final CyclicBarrier barrier; |
154 |
|
final Phaser lagPhaser; |
155 |
< |
Stage (BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, |
156 |
< |
int iters) { |
159 |
< |
queue = q; |
155 |
> |
Stage(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, int iters) { |
156 |
> |
queue = q; |
157 |
|
barrier = b; |
158 |
|
lagPhaser = s; |
159 |
|
this.iters = iters; |
183 |
|
addProducerSum(ps); |
184 |
|
barrier.await(); |
185 |
|
} |
186 |
< |
catch (Exception ie) { |
187 |
< |
ie.printStackTrace(); |
188 |
< |
return; |
186 |
> |
catch (Exception ie) { |
187 |
> |
ie.printStackTrace(); |
188 |
> |
return; |
189 |
|
} |
190 |
|
} |
191 |
|
} |
192 |
|
|
193 |
|
static class Consumer extends Stage { |
194 |
|
Consumer(BlockingQueue<Integer> q, CyclicBarrier b, Phaser s, |
195 |
< |
int iters) { |
195 |
> |
int iters) { |
196 |
|
super(q, b, s, iters); |
197 |
|
} |
198 |
|
|
210 |
|
addConsumerSum(cs); |
211 |
|
barrier.await(); |
212 |
|
} |
213 |
< |
catch (Exception ie) { |
214 |
< |
ie.printStackTrace(); |
215 |
< |
return; |
213 |
> |
catch (Exception ie) { |
214 |
> |
ie.printStackTrace(); |
215 |
> |
return; |
216 |
|
} |
217 |
|
} |
218 |
|
|
237 |
|
static final class LTQasSQ<T> extends LinkedTransferQueue<T> { |
238 |
|
LTQasSQ() { super(); } |
239 |
|
public void put(T x) { |
240 |
< |
try { super.transfer(x); |
240 |
> |
try { super.transfer(x); |
241 |
|
} catch (InterruptedException ex) { throw new Error(); } |
242 |
|
} |
243 |
|
} |
249 |
|
if ((++calls & 1) == 0) |
250 |
|
super.put(x); |
251 |
|
else { |
252 |
< |
try { super.transfer(x); |
253 |
< |
} catch (InterruptedException ex) { |
254 |
< |
throw new Error(); |
252 |
> |
try { super.transfer(x); |
253 |
> |
} catch (InterruptedException ex) { |
254 |
> |
throw new Error(); |
255 |
|
} |
256 |
|
} |
257 |
|
} |