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.*; |
18 |
|
int maxStages = 8; |
19 |
|
int items = 1000000; |
20 |
|
|
21 |
< |
Class klass = null; |
21 |
> |
Class<?> klass = null; |
22 |
|
if (args.length > 0) { |
23 |
|
try { |
24 |
|
klass = Class.forName(args[0]); |
25 |
< |
} catch(ClassNotFoundException e) { |
25 |
> |
} catch (ClassNotFoundException e) { |
26 |
|
throw new RuntimeException("Class " + args[0] + " not found."); |
27 |
|
} |
28 |
|
} |
29 |
< |
else |
29 |
> |
else |
30 |
|
throw new Error(); |
31 |
|
|
32 |
< |
if (args.length > 1) |
32 |
> |
if (args.length > 1) |
33 |
|
maxStages = Integer.parseInt(args[1]); |
34 |
|
|
35 |
|
System.out.print("Class: " + klass.getName()); |
43 |
|
Thread.sleep(100); |
44 |
|
print = true; |
45 |
|
|
46 |
< |
int k = 1; |
47 |
< |
for (int i = 1; i <= maxStages;) { |
46 |
> |
for (int k = 1, i = 1; i <= maxStages;) { |
47 |
|
oneRun(klass, i, items); |
48 |
|
if (i == k) { |
49 |
|
k = i << 1; |
50 |
|
i = i + (i >>> 1); |
51 |
< |
} |
52 |
< |
else |
51 |
> |
} |
52 |
> |
else |
53 |
|
i = k; |
54 |
|
} |
55 |
|
pool.shutdown(); |
56 |
< |
} |
56 |
> |
} |
57 |
|
|
58 |
|
static class Stage implements Callable<Integer> { |
59 |
|
final Deque<Integer> queue; |
60 |
|
final CyclicBarrier barrier; |
61 |
|
final LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom(); |
62 |
|
int items; |
63 |
< |
Stage (Deque<Integer> q, CyclicBarrier b, int items) { |
64 |
< |
queue = q; |
63 |
> |
Stage(Deque<Integer> q, CyclicBarrier b, int items) { |
64 |
> |
queue = q; |
65 |
|
barrier = b; |
66 |
|
this.items = items; |
67 |
|
} |
71 |
|
// transform it, and put back in. |
72 |
|
try { |
73 |
|
barrier.await(); |
74 |
< |
int l = (int)System.nanoTime(); |
74 |
> |
int l = (int) System.nanoTime(); |
75 |
|
int takes = 0; |
76 |
|
for (;;) { |
77 |
|
Integer item; |
99 |
|
else |
100 |
|
queue.addLast(res); |
101 |
|
} |
102 |
< |
else { // spinwait |
102 |
> |
else { // spinwait |
103 |
|
for (int k = 1 + (l & 15); k != 0; --k) |
104 |
|
l = LoopHelpers.compute1(LoopHelpers.compute2(l)); |
105 |
|
if ((l & 3) == 3) { |
109 |
|
} |
110 |
|
return new Integer(l); |
111 |
|
} |
112 |
< |
catch (Exception ie) { |
112 |
> |
catch (Exception ie) { |
113 |
|
ie.printStackTrace(); |
114 |
|
throw new Error("Call loop failed"); |
115 |
|
} |
116 |
|
} |
117 |
|
} |
118 |
|
|
119 |
< |
static void oneRun(Class klass, int n, int items) throws Exception { |
120 |
< |
Deque<Integer> q = (Deque<Integer>)klass.newInstance(); |
119 |
> |
static void oneRun(Class<?> klass, int n, int items) throws Exception { |
120 |
> |
Deque<Integer> q = |
121 |
> |
(Deque<Integer>) klass.getConstructor().newInstance(); |
122 |
|
LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer(); |
123 |
|
CyclicBarrier barrier = new CyclicBarrier(n + 1, timer); |
124 |
|
totalItems = new AtomicInteger(n * items); |
125 |
|
ArrayList<Future<Integer>> results = new ArrayList<Future<Integer>>(n); |
126 |
< |
for (int i = 0; i < n; ++i) |
126 |
> |
for (int i = 0; i < n; ++i) |
127 |
|
results.add(pool.submit(new Stage(q, barrier, items))); |
128 |
|
|
129 |
|
if (print) |
141 |
|
System.out.println(LoopHelpers.rightJustify(time / (items * n)) + " ns per item"); |
142 |
|
if (total == 0) // avoid overoptimization |
143 |
|
System.out.println("useless result: " + total); |
144 |
– |
|
144 |
|
} |
145 |
|
} |