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 |
|
* @test |
8 |
|
* @summary basic safety and liveness of ReentrantLocks, and other locks based on them |
9 |
|
*/ |
10 |
|
|
11 |
< |
import java.util.concurrent.*; |
12 |
< |
import java.util.concurrent.locks.*; |
13 |
< |
import java.util.*; |
11 |
> |
import java.util.concurrent.Callable; |
12 |
> |
import java.util.concurrent.CyclicBarrier; |
13 |
> |
import java.util.concurrent.ExecutorService; |
14 |
> |
import java.util.concurrent.Executors; |
15 |
> |
import java.util.concurrent.Semaphore; |
16 |
> |
import java.util.concurrent.locks.Lock; |
17 |
> |
import java.util.concurrent.locks.ReentrantLock; |
18 |
> |
import java.util.concurrent.locks.ReentrantReadWriteLock; |
19 |
|
|
20 |
|
public final class CheckedLockLoops { |
21 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
36 |
|
|
37 |
|
static void runTest(int maxThreads, int iters) throws Exception { |
38 |
|
print = true; |
39 |
< |
int k = 1; |
35 |
< |
for (int i = 1; i <= maxThreads;) { |
39 |
> |
for (int k = 1, i = 1; i <= maxThreads;) { |
40 |
|
System.out.println("Threads:" + i); |
41 |
|
oneTest(i, iters / i); |
42 |
|
if (i == k) { |
56 |
|
} |
57 |
|
|
58 |
|
static void oneTest(int nthreads, int iters) throws Exception { |
59 |
< |
int fairIters = (nthreads <= 1)? iters : iters/20; |
59 |
> |
int fairIters = (nthreads <= 1) ? iters : iters/20; |
60 |
|
int v = rng.next(); |
61 |
|
|
62 |
|
if (print) |
122 |
|
Thread.sleep(10); |
123 |
|
} |
124 |
|
|
125 |
< |
static abstract class LockLoop implements Runnable { |
125 |
> |
abstract static class LockLoop implements Runnable { |
126 |
|
int value; |
127 |
|
int checkValue; |
128 |
|
int iters; |
201 |
|
int sum = 0; |
202 |
|
int x = 0; |
203 |
|
while (n-- > 0) { |
204 |
< |
synchronized(this) { |
204 |
> |
synchronized (this) { |
205 |
|
x = setValue(LoopHelpers.compute1(getValue())); |
206 |
|
} |
207 |
|
sum += LoopHelpers.compute2(x); |
211 |
|
} |
212 |
|
|
213 |
|
private static class ReentrantLockLoop extends LockLoop { |
214 |
< |
final private ReentrantLock lock = new ReentrantLock(); |
214 |
> |
private final ReentrantLock lock = new ReentrantLock(); |
215 |
|
final int loop(int n) { |
216 |
|
final ReentrantLock lock = this.lock; |
217 |
|
int sum = 0; |
231 |
|
} |
232 |
|
|
233 |
|
private static class MutexLoop extends LockLoop { |
234 |
< |
final private Mutex lock = new Mutex(); |
234 |
> |
private final Mutex lock = new Mutex(); |
235 |
|
final int loop(int n) { |
236 |
|
final Mutex lock = this.lock; |
237 |
|
int sum = 0; |
251 |
|
} |
252 |
|
|
253 |
|
private static class LongMutexLoop extends LockLoop { |
254 |
< |
final private LongMutex lock = new LongMutex(); |
254 |
> |
private final LongMutex lock = new LongMutex(); |
255 |
|
final int loop(int n) { |
256 |
|
final LongMutex lock = this.lock; |
257 |
|
int sum = 0; |
271 |
|
} |
272 |
|
|
273 |
|
private static class FairReentrantLockLoop extends LockLoop { |
274 |
< |
final private ReentrantLock lock = new ReentrantLock(true); |
274 |
> |
private final ReentrantLock lock = new ReentrantLock(true); |
275 |
|
final int loop(int n) { |
276 |
|
final ReentrantLock lock = this.lock; |
277 |
|
int sum = 0; |
291 |
|
} |
292 |
|
|
293 |
|
private static class ReentrantWriteLockLoop extends LockLoop { |
294 |
< |
final private Lock lock = new ReentrantReadWriteLock().writeLock(); |
294 |
> |
private final Lock lock = new ReentrantReadWriteLock().writeLock(); |
295 |
|
final int loop(int n) { |
296 |
|
final Lock lock = this.lock; |
297 |
|
int sum = 0; |
331 |
|
} |
332 |
|
|
333 |
|
private static class SemaphoreLoop extends LockLoop { |
334 |
< |
final private Semaphore sem = new Semaphore(1, false); |
334 |
> |
private final Semaphore sem = new Semaphore(1, false); |
335 |
|
final int loop(int n) { |
336 |
|
final Semaphore sem = this.sem; |
337 |
|
int sum = 0; |
350 |
|
} |
351 |
|
} |
352 |
|
private static class FairSemaphoreLoop extends LockLoop { |
353 |
< |
final private Semaphore sem = new Semaphore(1, true); |
353 |
> |
private final Semaphore sem = new Semaphore(1, true); |
354 |
|
final int loop(int n) { |
355 |
|
final Semaphore sem = this.sem; |
356 |
|
int sum = 0; |
370 |
|
} |
371 |
|
|
372 |
|
private static class ReentrantReadWriteLockLoop extends LockLoop { |
373 |
< |
final private ReentrantReadWriteLock lock = new ReentrantReadWriteLock(); |
373 |
> |
private final ReentrantReadWriteLock lock = new ReentrantReadWriteLock(); |
374 |
|
final int loop(int n) { |
375 |
|
final Lock rlock = lock.readLock(); |
376 |
|
final Lock wlock = lock.writeLock(); |
403 |
|
|
404 |
|
} |
405 |
|
|
402 |
– |
|
406 |
|
private static class FairReentrantReadWriteLockLoop extends LockLoop { |
407 |
< |
final private ReentrantReadWriteLock lock = new ReentrantReadWriteLock(true); |
407 |
> |
private final ReentrantReadWriteLock lock = new ReentrantReadWriteLock(true); |
408 |
|
final int loop(int n) { |
409 |
|
final Lock rlock = lock.readLock(); |
410 |
|
final Lock wlock = lock.writeLock(); |