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 |
5 |
+ |
*/ |
6 |
+ |
/* |
7 |
|
* @test |
8 |
|
* @summary basic safety and liveness of ReentrantLocks, and other locks based on them |
9 |
|
*/ |
21 |
|
int maxThreads = 100; |
22 |
|
int iters = 10000000; |
23 |
|
|
24 |
< |
if (args.length > 0) |
24 |
> |
if (args.length > 0) |
25 |
|
maxThreads = Integer.parseInt(args[0]); |
26 |
|
|
27 |
|
rng.setSeed(3122688L); |
53 |
|
} |
54 |
|
|
55 |
|
static void oneTest(int nthreads, int iters) throws Exception { |
56 |
< |
int fairIters = (nthreads <= 1)? iters : iters/20; |
56 |
> |
int fairIters = (nthreads <= 1) ? iters : iters/20; |
57 |
|
int v = rng.next(); |
58 |
|
|
59 |
|
if (print) |
60 |
|
System.out.print("NoLock (1 thread) "); |
61 |
|
new NoLockLoop().test(v, 1, iters * nthreads); |
62 |
|
Thread.sleep(10); |
63 |
< |
|
63 |
> |
|
64 |
|
if (print) |
65 |
|
System.out.print("ReentrantLock "); |
66 |
|
new ReentrantLockLoop().test(v, nthreads, iters); |
93 |
|
System.out.print("Semaphore "); |
94 |
|
new SemaphoreLoop().test(v, nthreads, iters); |
95 |
|
Thread.sleep(10); |
96 |
< |
|
96 |
> |
|
97 |
|
if (print) |
98 |
|
System.out.print("FairSemaphore "); |
99 |
|
new FairSemaphoreLoop().test(v, nthreads, fairIters); |
108 |
|
System.out.print("FairRWriteLock "); |
109 |
|
new FairReentrantWriteLockLoop().test(v, nthreads, fairIters); |
110 |
|
Thread.sleep(10); |
111 |
< |
|
111 |
> |
|
112 |
|
if (print) |
113 |
|
System.out.print("ReentrantReadWriteLock"); |
114 |
|
new ReentrantReadWriteLockLoop().test(v, nthreads, iters); |
115 |
|
Thread.sleep(10); |
116 |
< |
|
116 |
> |
|
117 |
|
if (print) |
118 |
|
System.out.print("FairRReadWriteLock "); |
119 |
|
new FairReentrantReadWriteLockLoop().test(v, nthreads, fairIters); |
138 |
|
|
139 |
|
final int getValue() { |
140 |
|
int v = value; |
141 |
< |
if (checkValue != ~(v ^ 0xAAAAAAAA)) |
141 |
> |
if (checkValue != ~(v ^ 0xAAAAAAAA)) |
142 |
|
++failures; |
143 |
|
return v; |
144 |
|
} |
147 |
|
setValue(initialValue); |
148 |
|
this.iters = iters; |
149 |
|
barrier = new CyclicBarrier(nthreads+1, timer); |
150 |
< |
for (int i = 0; i < nthreads; ++i) |
150 |
> |
for (int i = 0; i < nthreads; ++i) |
151 |
|
new Thread(this).start(); |
152 |
|
barrier.await(); |
153 |
|
barrier.await(); |
168 |
|
abstract int loop(int n); |
169 |
|
public final void run() { |
170 |
|
try { |
171 |
< |
barrier.await(); |
171 |
> |
barrier.await(); |
172 |
|
result += loop(iters); |
173 |
|
barrier.await(); |
174 |
|
} |
175 |
< |
catch (Exception ie) { |
176 |
< |
return; |
175 |
> |
catch (Exception ie) { |
176 |
> |
return; |
177 |
|
} |
178 |
|
} |
179 |
|
|
183 |
|
private volatile int readBarrier; |
184 |
|
final int loop(int n) { |
185 |
|
int sum = 0; |
186 |
< |
int x = 0;; |
186 |
> |
int x = 0; |
187 |
|
while (n-- > 0) { |
188 |
|
int r1 = readBarrier; |
189 |
|
x = setValue(LoopHelpers.compute1(getValue())); |
199 |
|
private static class BuiltinLockLoop extends LockLoop { |
200 |
|
final int loop(int n) { |
201 |
|
int sum = 0; |
202 |
< |
int x = 0;; |
202 |
> |
int x = 0; |
203 |
|
while (n-- > 0) { |
204 |
|
synchronized(this) { |
205 |
|
x = setValue(LoopHelpers.compute1(getValue())); |