3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
+ |
|
7 |
|
/* |
8 |
< |
* A simple test program. Feel free to play. |
8 |
> |
* Simple benchmark comparing various locking techniques. |
9 |
|
*/ |
10 |
|
|
11 |
|
import java.util.*; |
92 |
|
Thread.sleep(10); |
93 |
|
|
94 |
|
if (print) |
95 |
+ |
System.out.print("ReentrantReadLock "); |
96 |
+ |
new ReentrantReadLockLoop().test(v, nthreads, iters); |
97 |
+ |
Thread.sleep(10); |
98 |
+ |
|
99 |
+ |
if (print) |
100 |
|
System.out.print("ReentrantReadWriteLock"); |
101 |
|
new ReentrantReadWriteLockLoop().test(v, nthreads, iters); |
102 |
|
Thread.sleep(10); |
143 |
|
System.out.print("StampedLockRead "); |
144 |
|
new StampedLockReadLoop().test(v, nthreads, iters); |
145 |
|
Thread.sleep(10); |
146 |
+ |
|
147 |
+ |
if (print) |
148 |
+ |
System.out.print("StampedLockOptRead"); |
149 |
+ |
new StampedLockOptimisticReadLoop().test(v, nthreads, iters); |
150 |
+ |
Thread.sleep(10); |
151 |
+ |
|
152 |
+ |
if (print) |
153 |
+ |
System.out.print("StampedLockReadWrite"); |
154 |
+ |
new StampedLockReadWriteLoop().test(v, nthreads, iters); |
155 |
+ |
Thread.sleep(10); |
156 |
|
} |
157 |
|
} |
158 |
|
|
289 |
|
} |
290 |
|
} |
291 |
|
|
292 |
+ |
private static class ReentrantReadLockLoop extends LockLoop { |
293 |
+ |
private final Lock lock = new ReentrantReadWriteLock().readLock(); |
294 |
+ |
final int loop(int n) { |
295 |
+ |
int sum = 0; |
296 |
+ |
while (n-- > 0) { |
297 |
+ |
lock.lock(); |
298 |
+ |
try { |
299 |
+ |
v = LoopHelpers.compute1(v); |
300 |
+ |
} |
301 |
+ |
finally { |
302 |
+ |
lock.unlock(); |
303 |
+ |
} |
304 |
+ |
sum += LoopHelpers.compute2(v); |
305 |
+ |
} |
306 |
+ |
return sum; |
307 |
+ |
} |
308 |
+ |
} |
309 |
+ |
|
310 |
|
private static class ReentrantReadWriteLockLoop extends LockLoop { |
311 |
|
private final ReentrantReadWriteLock lock = new ReentrantReadWriteLock(); |
312 |
|
final int loop(int n) { |
455 |
|
} |
456 |
|
sum += LoopHelpers.compute2(v); |
457 |
|
} |
458 |
+ |
return sum; |
459 |
+ |
} |
460 |
+ |
} |
461 |
+ |
|
462 |
+ |
private static class StampedLockOptimisticReadLoop extends LockLoop { |
463 |
+ |
private final StampedLock lock = new StampedLock(); |
464 |
+ |
final int loop(int n) { |
465 |
+ |
int sum = 0; |
466 |
+ |
while (n-- > 0) { |
467 |
+ |
long stamp; |
468 |
+ |
do { |
469 |
+ |
stamp = lock.tryOptimisticRead(); |
470 |
+ |
v = LoopHelpers.compute1(v); |
471 |
+ |
} while (!lock.validate(stamp)); |
472 |
+ |
sum += LoopHelpers.compute2(v); |
473 |
+ |
} |
474 |
+ |
return sum; |
475 |
+ |
} |
476 |
+ |
} |
477 |
+ |
|
478 |
+ |
private static class StampedLockReadWriteLoop extends LockLoop { |
479 |
+ |
private final StampedLock lock = new StampedLock(); |
480 |
+ |
final int loop(int n) { |
481 |
+ |
int sum = 0; |
482 |
+ |
while (n-- > 0) { |
483 |
+ |
int x; |
484 |
+ |
long stamp = lock.readLock(); |
485 |
+ |
try { |
486 |
+ |
x = LoopHelpers.compute1(v); |
487 |
+ |
} |
488 |
+ |
finally { |
489 |
+ |
lock.unlockRead(stamp); |
490 |
+ |
} |
491 |
+ |
stamp = lock.writeLock(); |
492 |
+ |
try { |
493 |
+ |
v = x; |
494 |
+ |
} finally { |
495 |
+ |
lock.unlockWrite(stamp); |
496 |
+ |
} |
497 |
+ |
sum += LoopHelpers.compute2(v); |
498 |
+ |
} |
499 |
|
return sum; |
500 |
|
} |
501 |
|
} |