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 jsr166y.*; |
15 |
|
|
16 |
|
public static void main(String[] args) throws Exception { |
17 |
|
int maxThreads = NCPUS * 3 / 2; // 100; |
18 |
< |
if (args.length > 0) |
18 |
> |
if (args.length > 0) |
19 |
|
maxThreads = Integer.parseInt(args[0]); |
20 |
|
|
21 |
|
System.out.print("Warmup:"); |
22 |
|
for (int j = 0; j < 1; ++j) { |
23 |
< |
int k = 1; |
24 |
< |
for (int i = 1; i <= maxThreads;) { |
23 |
> |
for (int k = 1, i = 1; i <= maxThreads;) { |
24 |
|
System.out.print(" " + i); |
25 |
|
oneTest(i, 10000, false); |
26 |
|
Thread.sleep(100); |
27 |
|
if (i == k) { |
28 |
|
k = i << 1; |
29 |
|
i = i + (i >>> 1); |
30 |
< |
} |
31 |
< |
else |
30 |
> |
} |
31 |
> |
else |
32 |
|
i = k; |
33 |
|
} |
34 |
|
} |
35 |
|
System.out.println(); |
36 |
|
|
37 |
< |
int k = 1; |
39 |
< |
for (int i = 1; i <= maxThreads;) { |
37 |
> |
for (int k = 1, i = 1; i <= maxThreads;) { |
38 |
|
System.out.println("Threads:" + i); |
39 |
|
oneTest(i, maxIters, true); |
40 |
|
Thread.sleep(100); |
41 |
|
if (i == k) { |
42 |
|
k = i << 1; |
43 |
|
i = i + (i >>> 1); |
44 |
< |
} |
45 |
< |
else |
44 |
> |
} |
45 |
> |
else |
46 |
|
i = k; |
47 |
|
} |
48 |
< |
} |
48 |
> |
} |
49 |
|
|
50 |
|
static void oneTest(int nThreads, int iters, boolean print) throws Exception { |
51 |
|
Thread.sleep(100); // System.gc(); |
81 |
|
static final class Task implements Runnable { |
82 |
|
final ThreadPoolExecutor pool; |
83 |
|
final CountDownLatch done; |
84 |
< |
Task(ThreadPoolExecutor p, CountDownLatch d) { |
85 |
< |
pool = p; |
84 |
> |
Task(ThreadPoolExecutor p, CountDownLatch d) { |
85 |
> |
pool = p; |
86 |
|
done = d; |
87 |
|
} |
88 |
|
public void run() { |
90 |
|
remaining.incrementAndGet(); |
91 |
|
int n; |
92 |
|
while (!Thread.interrupted() && |
93 |
< |
(n = remaining.get()) > 0 && |
93 |
> |
(n = remaining.get()) > 0 && |
94 |
|
done.getCount() > 0) { |
95 |
|
if (remaining.compareAndSet(n, n-1)) { |
96 |
|
try { |
105 |
|
} |
106 |
|
} |
107 |
|
} |
108 |
< |
|
108 |
> |
|
109 |
|
static void oneRun(BlockingQueue<Runnable> q, int nThreads, int iters, boolean print) throws Exception { |
110 |
< |
|
111 |
< |
ThreadPoolExecutor pool = |
110 |
> |
|
111 |
> |
ThreadPoolExecutor pool = |
112 |
|
new ThreadPoolExecutor(nThreads+1, Integer.MAX_VALUE, |
113 |
|
1L, TimeUnit.SECONDS, q); |
114 |
|
|
132 |
|
static final class LTQasSQ<T> extends LinkedTransferQueue<T> { |
133 |
|
LTQasSQ() { super(); } |
134 |
|
public void put(T x) { |
135 |
< |
try { super.transfer(x); |
135 |
> |
try { super.transfer(x); |
136 |
|
} catch (InterruptedException ex) { throw new Error(); } |
137 |
|
} |
138 |
|
} |
144 |
|
if ((++calls & 1) == 0) |
145 |
|
super.put(x); |
146 |
|
else { |
147 |
< |
try { super.transfer(x); |
148 |
< |
} catch (InterruptedException ex) { |
149 |
< |
throw new Error(); |
147 |
> |
try { super.transfer(x); |
148 |
> |
} catch (InterruptedException ex) { |
149 |
> |
throw new Error(); |
150 |
|
} |
151 |
|
} |
152 |
|
} |