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.concurrent.*; |
17 |
|
|
18 |
|
public static void main(String[] args) throws Exception { |
19 |
|
int maxThreads = 100; |
20 |
< |
if (args.length > 0) |
20 |
> |
if (args.length > 0) |
21 |
|
maxThreads = Integer.parseInt(args[0]); |
22 |
|
|
23 |
|
new ReentrantLockLoop(1).test(); |
32 |
|
if (i == k) { |
33 |
|
k = i << 1; |
34 |
|
i = i + (i >>> 1); |
35 |
< |
} |
36 |
< |
else |
35 |
> |
} |
36 |
> |
else |
37 |
|
i = k; |
38 |
|
} |
39 |
|
pool.shutdown(); |
52 |
|
} |
53 |
|
|
54 |
|
final void test() throws Exception { |
55 |
< |
for (int i = 0; i < nthreads; ++i) |
55 |
> |
for (int i = 0; i < nthreads; ++i) |
56 |
|
pool.execute(this); |
57 |
|
barrier.await(); |
58 |
|
barrier.await(); |
59 |
|
if (print) { |
60 |
|
long time = timer.getTime(); |
61 |
< |
long tpi = time / ((long)iters * nthreads); |
61 |
> |
long tpi = time / ((long) iters * nthreads); |
62 |
|
System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per lock"); |
63 |
< |
double secs = (double)(time) / 1000000000.0; |
63 |
> |
double secs = (double) time / 1000000000.0; |
64 |
|
System.out.println("\t " + secs + "s run time"); |
65 |
|
} |
66 |
|
|
71 |
|
|
72 |
|
public final void run() { |
73 |
|
try { |
74 |
< |
barrier.await(); |
74 |
> |
barrier.await(); |
75 |
|
int sum = v + 1; |
76 |
|
int x = sum + 1; |
77 |
|
int n = iters; |
85 |
|
barrier.await(); |
86 |
|
result += sum; |
87 |
|
} |
88 |
< |
catch (Exception ie) { |
89 |
< |
return; |
88 |
> |
catch (Exception ie) { |
89 |
> |
return; |
90 |
|
} |
91 |
|
} |
92 |
|
} |
93 |
|
|
94 |
|
} |
95 |
– |
|