6 |
|
|
7 |
|
import java.util.*; |
8 |
|
import java.util.concurrent.*; |
9 |
– |
import java.util.concurrent.locks.*; |
9 |
|
import java.util.concurrent.atomic.*; |
10 |
+ |
import java.util.concurrent.locks.*; |
11 |
|
|
12 |
|
public class ConcurrentQueueLoops { |
13 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
21 |
|
public static void main(String[] args) throws Exception { |
22 |
|
int maxStages = 100; |
23 |
|
int work = 1024; |
24 |
< |
Class klass = null; |
24 |
> |
Class<?> klass = null; |
25 |
|
if (args.length > 0) { |
26 |
|
try { |
27 |
|
klass = Class.forName(args[0]); |
50 |
|
Thread.sleep(100); |
51 |
|
print = true; |
52 |
|
|
53 |
< |
int k = 1; |
54 |
< |
for (int i = 1; i <= maxStages;) { |
53 |
> |
for (int k = 1, i = 1; i <= maxStages;) { |
54 |
|
oneRun(klass, i); |
55 |
|
if (i == k) { |
56 |
|
k = i << 1; |
75 |
|
static int compute(int l) { |
76 |
|
if (l == 0) |
77 |
|
return (int) System.nanoTime(); |
78 |
< |
int nn = (l >>> 7) & workMask; |
78 |
> |
int nn = (l >>> 7) & workMask; |
79 |
|
while (nn-- > 0) |
80 |
|
l = LoopHelpers.compute6(l); |
81 |
|
return l; |
116 |
|
} |
117 |
|
} |
118 |
|
|
119 |
< |
static void oneRun(Class klass, int n) throws Exception { |
120 |
< |
Queue<Integer> q = (Queue<Integer>) klass.newInstance(); |
119 |
> |
static void oneRun(Class<?> klass, int n) throws Exception { |
120 |
> |
Queue<Integer> q = |
121 |
> |
(Queue<Integer>) klass.getConstructor().newInstance(); |
122 |
|
LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer(); |
123 |
|
CyclicBarrier barrier = new CyclicBarrier(n + 1, timer); |
124 |
|
ArrayList<Future<Integer>> results = new ArrayList<Future<Integer>>(n); |