1 |
dl |
1.1 |
/* |
2 |
|
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
dl |
1.3 |
* Expert Group and released to the public domain, as explained at |
4 |
jsr166 |
1.6 |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
dl |
1.1 |
*/ |
6 |
|
|
|
7 |
jsr166 |
1.9 |
import java.util.concurrent.CyclicBarrier; |
8 |
|
|
import java.util.concurrent.ExecutorService; |
9 |
|
|
import java.util.concurrent.Executors; |
10 |
|
|
import java.util.concurrent.locks.ReentrantLock; |
11 |
dl |
1.1 |
|
12 |
|
|
public final class SimpleFairReentrantLockLoops { |
13 |
|
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
14 |
|
|
static final LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom(); |
15 |
|
|
static boolean print = false; |
16 |
|
|
static int iters = 2000000; |
17 |
|
|
|
18 |
|
|
public static void main(String[] args) throws Exception { |
19 |
|
|
int maxThreads = 100; |
20 |
jsr166 |
1.4 |
if (args.length > 0) |
21 |
dl |
1.1 |
maxThreads = Integer.parseInt(args[0]); |
22 |
|
|
|
23 |
|
|
new ReentrantLockLoop(1).test(); |
24 |
|
|
new ReentrantLockLoop(1).test(); |
25 |
|
|
print = true; |
26 |
|
|
|
27 |
jsr166 |
1.7 |
for (int k = 1, i = 1; i <= maxThreads;) { |
28 |
dl |
1.1 |
System.out.print("Threads: " + i); |
29 |
|
|
new ReentrantLockLoop(i).test(); |
30 |
|
|
Thread.sleep(100); |
31 |
|
|
if (i == k) { |
32 |
|
|
k = i << 1; |
33 |
|
|
i = i + (i >>> 1); |
34 |
jsr166 |
1.4 |
} |
35 |
|
|
else |
36 |
dl |
1.1 |
i = k; |
37 |
|
|
} |
38 |
|
|
pool.shutdown(); |
39 |
|
|
} |
40 |
|
|
|
41 |
|
|
static final class ReentrantLockLoop implements Runnable { |
42 |
|
|
private int v = rng.next(); |
43 |
|
|
private volatile int result = 17; |
44 |
|
|
private final ReentrantLock lock = new ReentrantLock(true); |
45 |
|
|
private final LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer(); |
46 |
|
|
private final CyclicBarrier barrier; |
47 |
|
|
private final int nthreads; |
48 |
|
|
private volatile int readBarrier; |
49 |
|
|
ReentrantLockLoop(int nthreads) { |
50 |
|
|
this.nthreads = nthreads; |
51 |
|
|
barrier = new CyclicBarrier(nthreads+1, timer); |
52 |
|
|
} |
53 |
|
|
|
54 |
|
|
final void test() throws Exception { |
55 |
jsr166 |
1.4 |
for (int i = 0; i < nthreads; ++i) |
56 |
dl |
1.1 |
pool.execute(this); |
57 |
|
|
barrier.await(); |
58 |
|
|
barrier.await(); |
59 |
|
|
if (print) { |
60 |
|
|
long time = timer.getTime(); |
61 |
jsr166 |
1.5 |
long tpi = time / ((long) iters * nthreads); |
62 |
dl |
1.1 |
System.out.print("\t" + LoopHelpers.rightJustify(tpi) + " ns per lock"); |
63 |
jsr166 |
1.5 |
double secs = (double) time / 1000000000.0; |
64 |
dl |
1.1 |
System.out.println("\t " + secs + "s run time"); |
65 |
|
|
} |
66 |
|
|
|
67 |
|
|
int r = result; |
68 |
|
|
if (r == 0) // avoid overoptimization |
69 |
|
|
System.out.println("useless result: " + r); |
70 |
|
|
} |
71 |
|
|
|
72 |
|
|
public final void run() { |
73 |
|
|
final ReentrantLock lock = this.lock; |
74 |
|
|
try { |
75 |
jsr166 |
1.4 |
barrier.await(); |
76 |
dl |
1.1 |
int sum = v + 1; |
77 |
|
|
int x = 0; |
78 |
|
|
int n = iters; |
79 |
|
|
while (n-- > 0) { |
80 |
|
|
lock.lock(); |
81 |
|
|
int k = (sum & 3); |
82 |
|
|
if (k > 0) { |
83 |
|
|
x = v; |
84 |
|
|
while (k-- > 0) |
85 |
dl |
1.2 |
x = LoopHelpers.compute6(x); |
86 |
dl |
1.1 |
v = x; |
87 |
|
|
} |
88 |
|
|
else x = sum + 1; |
89 |
|
|
lock.unlock(); |
90 |
|
|
if ((x += readBarrier) == 0) |
91 |
|
|
++readBarrier; |
92 |
|
|
for (int l = x & 7; l > 0; --l) |
93 |
dl |
1.2 |
sum += LoopHelpers.compute6(sum); |
94 |
jsr166 |
1.4 |
} |
95 |
dl |
1.1 |
barrier.await(); |
96 |
|
|
result += sum; |
97 |
|
|
} |
98 |
jsr166 |
1.4 |
catch (Exception ie) { |
99 |
|
|
return; |
100 |
dl |
1.1 |
} |
101 |
|
|
} |
102 |
|
|
} |
103 |
|
|
|
104 |
|
|
} |