1 |
dl |
1.1 |
/* |
2 |
dl |
1.12 |
* 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 |
jsr166 |
1.39 |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
jsr166 |
1.26 |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
|
|
* Pat Fisher, Mike Judd. |
7 |
dl |
1.1 |
*/ |
8 |
|
|
|
9 |
jsr166 |
1.54 |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
10 |
|
|
|
11 |
jsr166 |
1.67 |
import java.util.ArrayList; |
12 |
jsr166 |
1.54 |
import java.util.Arrays; |
13 |
|
|
import java.util.Collection; |
14 |
|
|
import java.util.HashSet; |
15 |
jsr166 |
1.70 |
import java.util.concurrent.Callable; |
16 |
jsr166 |
1.54 |
import java.util.concurrent.CountDownLatch; |
17 |
|
|
import java.util.concurrent.CyclicBarrier; |
18 |
jsr166 |
1.67 |
import java.util.concurrent.ThreadLocalRandom; |
19 |
jsr166 |
1.70 |
import java.util.concurrent.atomic.AtomicBoolean; |
20 |
jsr166 |
1.50 |
import java.util.concurrent.locks.Condition; |
21 |
jsr166 |
1.70 |
import java.util.concurrent.locks.Lock; |
22 |
jsr166 |
1.50 |
import java.util.concurrent.locks.ReentrantLock; |
23 |
jsr166 |
1.54 |
|
24 |
|
|
import junit.framework.Test; |
25 |
|
|
import junit.framework.TestSuite; |
26 |
dl |
1.1 |
|
27 |
jsr166 |
1.66 |
@SuppressWarnings("WaitNotInLoop") // we implement spurious-wakeup freedom |
28 |
dl |
1.4 |
public class ReentrantLockTest extends JSR166TestCase { |
29 |
dl |
1.1 |
public static void main(String[] args) { |
30 |
jsr166 |
1.58 |
main(suite(), args); |
31 |
dl |
1.1 |
} |
32 |
|
|
public static Test suite() { |
33 |
jsr166 |
1.30 |
return new TestSuite(ReentrantLockTest.class); |
34 |
dl |
1.1 |
} |
35 |
|
|
|
36 |
dl |
1.6 |
/** |
37 |
jsr166 |
1.56 |
* A checked runnable calling lockInterruptibly |
38 |
dl |
1.6 |
*/ |
39 |
jsr166 |
1.29 |
class InterruptibleLockRunnable extends CheckedRunnable { |
40 |
dl |
1.5 |
final ReentrantLock lock; |
41 |
jsr166 |
1.56 |
InterruptibleLockRunnable(ReentrantLock lock) { this.lock = lock; } |
42 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
43 |
|
|
lock.lockInterruptibly(); |
44 |
dl |
1.5 |
} |
45 |
|
|
} |
46 |
|
|
|
47 |
dl |
1.6 |
/** |
48 |
jsr166 |
1.56 |
* A checked runnable calling lockInterruptibly that expects to be |
49 |
dl |
1.6 |
* interrupted |
50 |
|
|
*/ |
51 |
jsr166 |
1.29 |
class InterruptedLockRunnable extends CheckedInterruptedRunnable { |
52 |
dl |
1.5 |
final ReentrantLock lock; |
53 |
jsr166 |
1.56 |
InterruptedLockRunnable(ReentrantLock lock) { this.lock = lock; } |
54 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
55 |
|
|
lock.lockInterruptibly(); |
56 |
dl |
1.5 |
} |
57 |
|
|
} |
58 |
|
|
|
59 |
|
|
/** |
60 |
dl |
1.6 |
* Subclass to expose protected methods |
61 |
dl |
1.5 |
*/ |
62 |
dl |
1.6 |
static class PublicReentrantLock extends ReentrantLock { |
63 |
|
|
PublicReentrantLock() { super(); } |
64 |
jsr166 |
1.45 |
PublicReentrantLock(boolean fair) { super(fair); } |
65 |
|
|
public Thread getOwner() { |
66 |
|
|
return super.getOwner(); |
67 |
|
|
} |
68 |
jsr166 |
1.26 |
public Collection<Thread> getQueuedThreads() { |
69 |
|
|
return super.getQueuedThreads(); |
70 |
dl |
1.5 |
} |
71 |
jsr166 |
1.26 |
public Collection<Thread> getWaitingThreads(Condition c) { |
72 |
|
|
return super.getWaitingThreads(c); |
73 |
dl |
1.13 |
} |
74 |
dl |
1.5 |
} |
75 |
|
|
|
76 |
dl |
1.8 |
/** |
77 |
jsr166 |
1.45 |
* Releases write lock, checking that it had a hold count of 1. |
78 |
|
|
*/ |
79 |
|
|
void releaseLock(PublicReentrantLock lock) { |
80 |
jsr166 |
1.46 |
assertLockedByMoi(lock); |
81 |
jsr166 |
1.45 |
lock.unlock(); |
82 |
|
|
assertFalse(lock.isHeldByCurrentThread()); |
83 |
|
|
assertNotLocked(lock); |
84 |
|
|
} |
85 |
|
|
|
86 |
|
|
/** |
87 |
|
|
* Spin-waits until lock.hasQueuedThread(t) becomes true. |
88 |
|
|
*/ |
89 |
|
|
void waitForQueuedThread(PublicReentrantLock lock, Thread t) { |
90 |
|
|
long startTime = System.nanoTime(); |
91 |
|
|
while (!lock.hasQueuedThread(t)) { |
92 |
|
|
if (millisElapsedSince(startTime) > LONG_DELAY_MS) |
93 |
jsr166 |
1.68 |
throw new AssertionError("timed out"); |
94 |
jsr166 |
1.45 |
Thread.yield(); |
95 |
|
|
} |
96 |
|
|
assertTrue(t.isAlive()); |
97 |
jsr166 |
1.52 |
assertNotSame(t, lock.getOwner()); |
98 |
jsr166 |
1.45 |
} |
99 |
|
|
|
100 |
|
|
/** |
101 |
|
|
* Checks that lock is not locked. |
102 |
|
|
*/ |
103 |
|
|
void assertNotLocked(PublicReentrantLock lock) { |
104 |
|
|
assertFalse(lock.isLocked()); |
105 |
|
|
assertFalse(lock.isHeldByCurrentThread()); |
106 |
|
|
assertNull(lock.getOwner()); |
107 |
|
|
assertEquals(0, lock.getHoldCount()); |
108 |
|
|
} |
109 |
|
|
|
110 |
|
|
/** |
111 |
|
|
* Checks that lock is locked by the given thread. |
112 |
|
|
*/ |
113 |
|
|
void assertLockedBy(PublicReentrantLock lock, Thread t) { |
114 |
|
|
assertTrue(lock.isLocked()); |
115 |
|
|
assertSame(t, lock.getOwner()); |
116 |
|
|
assertEquals(t == Thread.currentThread(), |
117 |
|
|
lock.isHeldByCurrentThread()); |
118 |
|
|
assertEquals(t == Thread.currentThread(), |
119 |
|
|
lock.getHoldCount() > 0); |
120 |
|
|
} |
121 |
|
|
|
122 |
|
|
/** |
123 |
jsr166 |
1.46 |
* Checks that lock is locked by the current thread. |
124 |
|
|
*/ |
125 |
|
|
void assertLockedByMoi(PublicReentrantLock lock) { |
126 |
|
|
assertLockedBy(lock, Thread.currentThread()); |
127 |
|
|
} |
128 |
|
|
|
129 |
|
|
/** |
130 |
jsr166 |
1.43 |
* Checks that condition c has no waiters. |
131 |
|
|
*/ |
132 |
|
|
void assertHasNoWaiters(PublicReentrantLock lock, Condition c) { |
133 |
|
|
assertHasWaiters(lock, c, new Thread[] {}); |
134 |
|
|
} |
135 |
|
|
|
136 |
|
|
/** |
137 |
|
|
* Checks that condition c has exactly the given waiter threads. |
138 |
|
|
*/ |
139 |
|
|
void assertHasWaiters(PublicReentrantLock lock, Condition c, |
140 |
|
|
Thread... threads) { |
141 |
|
|
lock.lock(); |
142 |
|
|
assertEquals(threads.length > 0, lock.hasWaiters(c)); |
143 |
|
|
assertEquals(threads.length, lock.getWaitQueueLength(c)); |
144 |
|
|
assertEquals(threads.length == 0, lock.getWaitingThreads(c).isEmpty()); |
145 |
|
|
assertEquals(threads.length, lock.getWaitingThreads(c).size()); |
146 |
|
|
assertEquals(new HashSet<Thread>(lock.getWaitingThreads(c)), |
147 |
|
|
new HashSet<Thread>(Arrays.asList(threads))); |
148 |
|
|
lock.unlock(); |
149 |
|
|
} |
150 |
|
|
|
151 |
jsr166 |
1.53 |
enum AwaitMethod { await, awaitTimed, awaitNanos, awaitUntil } |
152 |
jsr166 |
1.46 |
|
153 |
jsr166 |
1.67 |
static AwaitMethod randomAwaitMethod() { |
154 |
|
|
AwaitMethod[] awaitMethods = AwaitMethod.values(); |
155 |
|
|
return awaitMethods[ThreadLocalRandom.current().nextInt(awaitMethods.length)]; |
156 |
|
|
} |
157 |
|
|
|
158 |
jsr166 |
1.46 |
/** |
159 |
jsr166 |
1.60 |
* Awaits condition "indefinitely" using the specified AwaitMethod. |
160 |
jsr166 |
1.46 |
*/ |
161 |
|
|
void await(Condition c, AwaitMethod awaitMethod) |
162 |
|
|
throws InterruptedException { |
163 |
jsr166 |
1.48 |
long timeoutMillis = 2 * LONG_DELAY_MS; |
164 |
jsr166 |
1.46 |
switch (awaitMethod) { |
165 |
|
|
case await: |
166 |
|
|
c.await(); |
167 |
|
|
break; |
168 |
jsr166 |
1.48 |
case awaitTimed: |
169 |
|
|
assertTrue(c.await(timeoutMillis, MILLISECONDS)); |
170 |
|
|
break; |
171 |
jsr166 |
1.46 |
case awaitNanos: |
172 |
jsr166 |
1.60 |
long timeoutNanos = MILLISECONDS.toNanos(timeoutMillis); |
173 |
|
|
long nanosRemaining = c.awaitNanos(timeoutNanos); |
174 |
jsr166 |
1.61 |
assertTrue(nanosRemaining > timeoutNanos / 2); |
175 |
jsr166 |
1.60 |
assertTrue(nanosRemaining <= timeoutNanos); |
176 |
jsr166 |
1.46 |
break; |
177 |
|
|
case awaitUntil: |
178 |
jsr166 |
1.48 |
assertTrue(c.awaitUntil(delayedDate(timeoutMillis))); |
179 |
jsr166 |
1.46 |
break; |
180 |
jsr166 |
1.55 |
default: |
181 |
|
|
throw new AssertionError(); |
182 |
jsr166 |
1.46 |
} |
183 |
|
|
} |
184 |
|
|
|
185 |
jsr166 |
1.43 |
/** |
186 |
jsr166 |
1.45 |
* Constructor sets given fairness, and is in unlocked state |
187 |
dl |
1.9 |
*/ |
188 |
jsr166 |
1.26 |
public void testConstructor() { |
189 |
jsr166 |
1.45 |
PublicReentrantLock lock; |
190 |
|
|
|
191 |
|
|
lock = new PublicReentrantLock(); |
192 |
|
|
assertFalse(lock.isFair()); |
193 |
|
|
assertNotLocked(lock); |
194 |
|
|
|
195 |
|
|
lock = new PublicReentrantLock(true); |
196 |
|
|
assertTrue(lock.isFair()); |
197 |
|
|
assertNotLocked(lock); |
198 |
|
|
|
199 |
|
|
lock = new PublicReentrantLock(false); |
200 |
|
|
assertFalse(lock.isFair()); |
201 |
|
|
assertNotLocked(lock); |
202 |
dl |
1.9 |
} |
203 |
|
|
|
204 |
|
|
/** |
205 |
dl |
1.6 |
* locking an unlocked lock succeeds |
206 |
|
|
*/ |
207 |
jsr166 |
1.46 |
public void testLock() { testLock(false); } |
208 |
|
|
public void testLock_fair() { testLock(true); } |
209 |
|
|
public void testLock(boolean fair) { |
210 |
|
|
PublicReentrantLock lock = new PublicReentrantLock(fair); |
211 |
jsr166 |
1.45 |
lock.lock(); |
212 |
jsr166 |
1.46 |
assertLockedByMoi(lock); |
213 |
jsr166 |
1.45 |
releaseLock(lock); |
214 |
dl |
1.6 |
} |
215 |
|
|
|
216 |
dl |
1.8 |
/** |
217 |
dl |
1.5 |
* Unlocking an unlocked lock throws IllegalMonitorStateException |
218 |
dl |
1.1 |
*/ |
219 |
jsr166 |
1.46 |
public void testUnlock_IMSE() { testUnlock_IMSE(false); } |
220 |
|
|
public void testUnlock_IMSE_fair() { testUnlock_IMSE(true); } |
221 |
|
|
public void testUnlock_IMSE(boolean fair) { |
222 |
jsr166 |
1.64 |
final ReentrantLock lock = new ReentrantLock(fair); |
223 |
jsr166 |
1.30 |
try { |
224 |
jsr166 |
1.45 |
lock.unlock(); |
225 |
jsr166 |
1.30 |
shouldThrow(); |
226 |
|
|
} catch (IllegalMonitorStateException success) {} |
227 |
dl |
1.5 |
} |
228 |
dl |
1.1 |
|
229 |
dl |
1.8 |
/** |
230 |
dl |
1.15 |
* tryLock on an unlocked lock succeeds |
231 |
dl |
1.1 |
*/ |
232 |
jsr166 |
1.46 |
public void testTryLock() { testTryLock(false); } |
233 |
|
|
public void testTryLock_fair() { testTryLock(true); } |
234 |
|
|
public void testTryLock(boolean fair) { |
235 |
|
|
PublicReentrantLock lock = new PublicReentrantLock(fair); |
236 |
|
|
assertTrue(lock.tryLock()); |
237 |
|
|
assertLockedByMoi(lock); |
238 |
jsr166 |
1.45 |
assertTrue(lock.tryLock()); |
239 |
jsr166 |
1.46 |
assertLockedByMoi(lock); |
240 |
|
|
lock.unlock(); |
241 |
jsr166 |
1.45 |
releaseLock(lock); |
242 |
dl |
1.6 |
} |
243 |
|
|
|
244 |
dl |
1.8 |
/** |
245 |
dl |
1.13 |
* hasQueuedThreads reports whether there are waiting threads |
246 |
|
|
*/ |
247 |
jsr166 |
1.46 |
public void testHasQueuedThreads() { testHasQueuedThreads(false); } |
248 |
|
|
public void testHasQueuedThreads_fair() { testHasQueuedThreads(true); } |
249 |
|
|
public void testHasQueuedThreads(boolean fair) { |
250 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
251 |
dl |
1.13 |
Thread t1 = new Thread(new InterruptedLockRunnable(lock)); |
252 |
|
|
Thread t2 = new Thread(new InterruptibleLockRunnable(lock)); |
253 |
jsr166 |
1.29 |
assertFalse(lock.hasQueuedThreads()); |
254 |
|
|
lock.lock(); |
255 |
jsr166 |
1.45 |
assertFalse(lock.hasQueuedThreads()); |
256 |
jsr166 |
1.29 |
t1.start(); |
257 |
jsr166 |
1.45 |
waitForQueuedThread(lock, t1); |
258 |
jsr166 |
1.29 |
assertTrue(lock.hasQueuedThreads()); |
259 |
|
|
t2.start(); |
260 |
jsr166 |
1.45 |
waitForQueuedThread(lock, t2); |
261 |
jsr166 |
1.29 |
assertTrue(lock.hasQueuedThreads()); |
262 |
|
|
t1.interrupt(); |
263 |
jsr166 |
1.45 |
awaitTermination(t1); |
264 |
jsr166 |
1.29 |
assertTrue(lock.hasQueuedThreads()); |
265 |
|
|
lock.unlock(); |
266 |
jsr166 |
1.45 |
awaitTermination(t2); |
267 |
jsr166 |
1.29 |
assertFalse(lock.hasQueuedThreads()); |
268 |
jsr166 |
1.26 |
} |
269 |
dl |
1.13 |
|
270 |
|
|
/** |
271 |
dl |
1.7 |
* getQueueLength reports number of waiting threads |
272 |
dl |
1.1 |
*/ |
273 |
jsr166 |
1.46 |
public void testGetQueueLength() { testGetQueueLength(false); } |
274 |
|
|
public void testGetQueueLength_fair() { testGetQueueLength(true); } |
275 |
|
|
public void testGetQueueLength(boolean fair) { |
276 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
277 |
dl |
1.16 |
Thread t1 = new Thread(new InterruptedLockRunnable(lock)); |
278 |
|
|
Thread t2 = new Thread(new InterruptibleLockRunnable(lock)); |
279 |
jsr166 |
1.29 |
assertEquals(0, lock.getQueueLength()); |
280 |
|
|
lock.lock(); |
281 |
|
|
t1.start(); |
282 |
jsr166 |
1.45 |
waitForQueuedThread(lock, t1); |
283 |
jsr166 |
1.29 |
assertEquals(1, lock.getQueueLength()); |
284 |
|
|
t2.start(); |
285 |
jsr166 |
1.45 |
waitForQueuedThread(lock, t2); |
286 |
jsr166 |
1.29 |
assertEquals(2, lock.getQueueLength()); |
287 |
|
|
t1.interrupt(); |
288 |
jsr166 |
1.45 |
awaitTermination(t1); |
289 |
jsr166 |
1.29 |
assertEquals(1, lock.getQueueLength()); |
290 |
|
|
lock.unlock(); |
291 |
jsr166 |
1.45 |
awaitTermination(t2); |
292 |
jsr166 |
1.29 |
assertEquals(0, lock.getQueueLength()); |
293 |
jsr166 |
1.26 |
} |
294 |
dl |
1.16 |
|
295 |
|
|
/** |
296 |
dl |
1.19 |
* hasQueuedThread(null) throws NPE |
297 |
|
|
*/ |
298 |
jsr166 |
1.46 |
public void testHasQueuedThreadNPE() { testHasQueuedThreadNPE(false); } |
299 |
|
|
public void testHasQueuedThreadNPE_fair() { testHasQueuedThreadNPE(true); } |
300 |
|
|
public void testHasQueuedThreadNPE(boolean fair) { |
301 |
|
|
final ReentrantLock lock = new ReentrantLock(fair); |
302 |
dl |
1.19 |
try { |
303 |
jsr166 |
1.45 |
lock.hasQueuedThread(null); |
304 |
dl |
1.19 |
shouldThrow(); |
305 |
jsr166 |
1.29 |
} catch (NullPointerException success) {} |
306 |
dl |
1.19 |
} |
307 |
|
|
|
308 |
|
|
/** |
309 |
jsr166 |
1.49 |
* hasQueuedThread reports whether a thread is queued |
310 |
dl |
1.19 |
*/ |
311 |
jsr166 |
1.46 |
public void testHasQueuedThread() { testHasQueuedThread(false); } |
312 |
|
|
public void testHasQueuedThread_fair() { testHasQueuedThread(true); } |
313 |
|
|
public void testHasQueuedThread(boolean fair) { |
314 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
315 |
jsr166 |
1.45 |
Thread t1 = new Thread(new InterruptedLockRunnable(lock)); |
316 |
|
|
Thread t2 = new Thread(new InterruptibleLockRunnable(lock)); |
317 |
|
|
assertFalse(lock.hasQueuedThread(t1)); |
318 |
|
|
assertFalse(lock.hasQueuedThread(t2)); |
319 |
|
|
lock.lock(); |
320 |
jsr166 |
1.29 |
t1.start(); |
321 |
jsr166 |
1.45 |
waitForQueuedThread(lock, t1); |
322 |
|
|
assertTrue(lock.hasQueuedThread(t1)); |
323 |
|
|
assertFalse(lock.hasQueuedThread(t2)); |
324 |
jsr166 |
1.29 |
t2.start(); |
325 |
jsr166 |
1.45 |
waitForQueuedThread(lock, t2); |
326 |
|
|
assertTrue(lock.hasQueuedThread(t1)); |
327 |
|
|
assertTrue(lock.hasQueuedThread(t2)); |
328 |
jsr166 |
1.29 |
t1.interrupt(); |
329 |
jsr166 |
1.42 |
awaitTermination(t1); |
330 |
jsr166 |
1.45 |
assertFalse(lock.hasQueuedThread(t1)); |
331 |
|
|
assertTrue(lock.hasQueuedThread(t2)); |
332 |
|
|
lock.unlock(); |
333 |
jsr166 |
1.42 |
awaitTermination(t2); |
334 |
jsr166 |
1.45 |
assertFalse(lock.hasQueuedThread(t1)); |
335 |
|
|
assertFalse(lock.hasQueuedThread(t2)); |
336 |
jsr166 |
1.26 |
} |
337 |
dl |
1.19 |
|
338 |
|
|
/** |
339 |
dl |
1.5 |
* getQueuedThreads includes waiting threads |
340 |
|
|
*/ |
341 |
jsr166 |
1.46 |
public void testGetQueuedThreads() { testGetQueuedThreads(false); } |
342 |
|
|
public void testGetQueuedThreads_fair() { testGetQueuedThreads(true); } |
343 |
|
|
public void testGetQueuedThreads(boolean fair) { |
344 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
345 |
dl |
1.5 |
Thread t1 = new Thread(new InterruptedLockRunnable(lock)); |
346 |
|
|
Thread t2 = new Thread(new InterruptibleLockRunnable(lock)); |
347 |
jsr166 |
1.29 |
assertTrue(lock.getQueuedThreads().isEmpty()); |
348 |
|
|
lock.lock(); |
349 |
|
|
assertTrue(lock.getQueuedThreads().isEmpty()); |
350 |
|
|
t1.start(); |
351 |
jsr166 |
1.45 |
waitForQueuedThread(lock, t1); |
352 |
|
|
assertEquals(1, lock.getQueuedThreads().size()); |
353 |
jsr166 |
1.29 |
assertTrue(lock.getQueuedThreads().contains(t1)); |
354 |
|
|
t2.start(); |
355 |
jsr166 |
1.45 |
waitForQueuedThread(lock, t2); |
356 |
|
|
assertEquals(2, lock.getQueuedThreads().size()); |
357 |
jsr166 |
1.29 |
assertTrue(lock.getQueuedThreads().contains(t1)); |
358 |
|
|
assertTrue(lock.getQueuedThreads().contains(t2)); |
359 |
|
|
t1.interrupt(); |
360 |
jsr166 |
1.45 |
awaitTermination(t1); |
361 |
jsr166 |
1.29 |
assertFalse(lock.getQueuedThreads().contains(t1)); |
362 |
|
|
assertTrue(lock.getQueuedThreads().contains(t2)); |
363 |
jsr166 |
1.45 |
assertEquals(1, lock.getQueuedThreads().size()); |
364 |
jsr166 |
1.29 |
lock.unlock(); |
365 |
jsr166 |
1.45 |
awaitTermination(t2); |
366 |
jsr166 |
1.29 |
assertTrue(lock.getQueuedThreads().isEmpty()); |
367 |
jsr166 |
1.26 |
} |
368 |
dl |
1.5 |
|
369 |
dl |
1.8 |
/** |
370 |
jsr166 |
1.49 |
* timed tryLock is interruptible |
371 |
dl |
1.5 |
*/ |
372 |
jsr166 |
1.46 |
public void testTryLock_Interruptible() { testTryLock_Interruptible(false); } |
373 |
|
|
public void testTryLock_Interruptible_fair() { testTryLock_Interruptible(true); } |
374 |
|
|
public void testTryLock_Interruptible(boolean fair) { |
375 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
376 |
jsr166 |
1.30 |
lock.lock(); |
377 |
jsr166 |
1.41 |
Thread t = newStartedThread(new CheckedInterruptedRunnable() { |
378 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
379 |
jsr166 |
1.45 |
lock.tryLock(2 * LONG_DELAY_MS, MILLISECONDS); |
380 |
jsr166 |
1.29 |
}}); |
381 |
|
|
|
382 |
jsr166 |
1.45 |
waitForQueuedThread(lock, t); |
383 |
jsr166 |
1.29 |
t.interrupt(); |
384 |
jsr166 |
1.42 |
awaitTermination(t); |
385 |
jsr166 |
1.45 |
releaseLock(lock); |
386 |
dl |
1.1 |
} |
387 |
|
|
|
388 |
dl |
1.5 |
/** |
389 |
jsr166 |
1.45 |
* tryLock on a locked lock fails |
390 |
dl |
1.5 |
*/ |
391 |
jsr166 |
1.46 |
public void testTryLockWhenLocked() { testTryLockWhenLocked(false); } |
392 |
|
|
public void testTryLockWhenLocked_fair() { testTryLockWhenLocked(true); } |
393 |
|
|
public void testTryLockWhenLocked(boolean fair) { |
394 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
395 |
jsr166 |
1.30 |
lock.lock(); |
396 |
jsr166 |
1.41 |
Thread t = newStartedThread(new CheckedRunnable() { |
397 |
jsr166 |
1.29 |
public void realRun() { |
398 |
jsr166 |
1.37 |
assertFalse(lock.tryLock()); |
399 |
jsr166 |
1.29 |
}}); |
400 |
|
|
|
401 |
jsr166 |
1.42 |
awaitTermination(t); |
402 |
jsr166 |
1.45 |
releaseLock(lock); |
403 |
jsr166 |
1.26 |
} |
404 |
dl |
1.3 |
|
405 |
dl |
1.5 |
/** |
406 |
dl |
1.15 |
* Timed tryLock on a locked lock times out |
407 |
dl |
1.5 |
*/ |
408 |
jsr166 |
1.46 |
public void testTryLock_Timeout() { testTryLock_Timeout(false); } |
409 |
|
|
public void testTryLock_Timeout_fair() { testTryLock_Timeout(true); } |
410 |
|
|
public void testTryLock_Timeout(boolean fair) { |
411 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
412 |
jsr166 |
1.64 |
final long timeoutMillis = timeoutMillis(); |
413 |
jsr166 |
1.30 |
lock.lock(); |
414 |
jsr166 |
1.41 |
Thread t = newStartedThread(new CheckedRunnable() { |
415 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
416 |
jsr166 |
1.45 |
long startTime = System.nanoTime(); |
417 |
|
|
assertFalse(lock.tryLock(timeoutMillis, MILLISECONDS)); |
418 |
|
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
419 |
jsr166 |
1.29 |
}}); |
420 |
|
|
|
421 |
jsr166 |
1.42 |
awaitTermination(t); |
422 |
jsr166 |
1.45 |
releaseLock(lock); |
423 |
jsr166 |
1.26 |
} |
424 |
|
|
|
425 |
dl |
1.5 |
/** |
426 |
|
|
* getHoldCount returns number of recursive holds |
427 |
|
|
*/ |
428 |
jsr166 |
1.46 |
public void testGetHoldCount() { testGetHoldCount(false); } |
429 |
|
|
public void testGetHoldCount_fair() { testGetHoldCount(true); } |
430 |
|
|
public void testGetHoldCount(boolean fair) { |
431 |
jsr166 |
1.64 |
final ReentrantLock lock = new ReentrantLock(fair); |
432 |
jsr166 |
1.30 |
for (int i = 1; i <= SIZE; i++) { |
433 |
|
|
lock.lock(); |
434 |
|
|
assertEquals(i, lock.getHoldCount()); |
435 |
|
|
} |
436 |
|
|
for (int i = SIZE; i > 0; i--) { |
437 |
|
|
lock.unlock(); |
438 |
jsr166 |
1.59 |
assertEquals(i - 1, lock.getHoldCount()); |
439 |
jsr166 |
1.30 |
} |
440 |
dl |
1.1 |
} |
441 |
jsr166 |
1.26 |
|
442 |
dl |
1.5 |
/** |
443 |
|
|
* isLocked is true when locked and false when not |
444 |
|
|
*/ |
445 |
jsr166 |
1.46 |
public void testIsLocked() { testIsLocked(false); } |
446 |
|
|
public void testIsLocked_fair() { testIsLocked(true); } |
447 |
|
|
public void testIsLocked(boolean fair) { |
448 |
jsr166 |
1.64 |
final ReentrantLock lock = new ReentrantLock(fair); |
449 |
jsr166 |
1.46 |
try { |
450 |
|
|
assertFalse(lock.isLocked()); |
451 |
|
|
lock.lock(); |
452 |
|
|
assertTrue(lock.isLocked()); |
453 |
|
|
lock.lock(); |
454 |
|
|
assertTrue(lock.isLocked()); |
455 |
|
|
lock.unlock(); |
456 |
|
|
assertTrue(lock.isLocked()); |
457 |
|
|
lock.unlock(); |
458 |
|
|
assertFalse(lock.isLocked()); |
459 |
|
|
final CyclicBarrier barrier = new CyclicBarrier(2); |
460 |
|
|
Thread t = newStartedThread(new CheckedRunnable() { |
461 |
|
|
public void realRun() throws Exception { |
462 |
|
|
lock.lock(); |
463 |
|
|
assertTrue(lock.isLocked()); |
464 |
|
|
barrier.await(); |
465 |
|
|
barrier.await(); |
466 |
|
|
lock.unlock(); |
467 |
|
|
}}); |
468 |
|
|
|
469 |
|
|
barrier.await(); |
470 |
|
|
assertTrue(lock.isLocked()); |
471 |
|
|
barrier.await(); |
472 |
|
|
awaitTermination(t); |
473 |
|
|
assertFalse(lock.isLocked()); |
474 |
jsr166 |
1.57 |
} catch (Exception fail) { threadUnexpectedException(fail); } |
475 |
jsr166 |
1.26 |
} |
476 |
dl |
1.6 |
|
477 |
dl |
1.5 |
/** |
478 |
|
|
* lockInterruptibly succeeds when unlocked, else is interruptible |
479 |
|
|
*/ |
480 |
jsr166 |
1.46 |
public void testLockInterruptibly() { testLockInterruptibly(false); } |
481 |
|
|
public void testLockInterruptibly_fair() { testLockInterruptibly(true); } |
482 |
|
|
public void testLockInterruptibly(boolean fair) { |
483 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
484 |
|
|
try { |
485 |
|
|
lock.lockInterruptibly(); |
486 |
jsr166 |
1.57 |
} catch (InterruptedException fail) { threadUnexpectedException(fail); } |
487 |
jsr166 |
1.46 |
assertLockedByMoi(lock); |
488 |
jsr166 |
1.41 |
Thread t = newStartedThread(new InterruptedLockRunnable(lock)); |
489 |
jsr166 |
1.45 |
waitForQueuedThread(lock, t); |
490 |
jsr166 |
1.29 |
t.interrupt(); |
491 |
|
|
assertTrue(lock.isLocked()); |
492 |
|
|
assertTrue(lock.isHeldByCurrentThread()); |
493 |
jsr166 |
1.42 |
awaitTermination(t); |
494 |
jsr166 |
1.45 |
releaseLock(lock); |
495 |
dl |
1.1 |
} |
496 |
dl |
1.2 |
|
497 |
dl |
1.6 |
/** |
498 |
|
|
* Calling await without holding lock throws IllegalMonitorStateException |
499 |
|
|
*/ |
500 |
jsr166 |
1.46 |
public void testAwait_IMSE() { testAwait_IMSE(false); } |
501 |
|
|
public void testAwait_IMSE_fair() { testAwait_IMSE(true); } |
502 |
|
|
public void testAwait_IMSE(boolean fair) { |
503 |
|
|
final ReentrantLock lock = new ReentrantLock(fair); |
504 |
dl |
1.2 |
final Condition c = lock.newCondition(); |
505 |
jsr166 |
1.48 |
for (AwaitMethod awaitMethod : AwaitMethod.values()) { |
506 |
|
|
long startTime = System.nanoTime(); |
507 |
jsr166 |
1.46 |
try { |
508 |
jsr166 |
1.48 |
await(c, awaitMethod); |
509 |
jsr166 |
1.46 |
shouldThrow(); |
510 |
jsr166 |
1.48 |
} catch (IllegalMonitorStateException success) { |
511 |
|
|
} catch (InterruptedException e) { threadUnexpectedException(e); } |
512 |
|
|
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
513 |
jsr166 |
1.46 |
} |
514 |
dl |
1.2 |
} |
515 |
|
|
|
516 |
dl |
1.6 |
/** |
517 |
|
|
* Calling signal without holding lock throws IllegalMonitorStateException |
518 |
|
|
*/ |
519 |
jsr166 |
1.46 |
public void testSignal_IMSE() { testSignal_IMSE(false); } |
520 |
|
|
public void testSignal_IMSE_fair() { testSignal_IMSE(true); } |
521 |
|
|
public void testSignal_IMSE(boolean fair) { |
522 |
|
|
final ReentrantLock lock = new ReentrantLock(fair); |
523 |
dl |
1.2 |
final Condition c = lock.newCondition(); |
524 |
|
|
try { |
525 |
|
|
c.signal(); |
526 |
dl |
1.6 |
shouldThrow(); |
527 |
jsr166 |
1.29 |
} catch (IllegalMonitorStateException success) {} |
528 |
dl |
1.2 |
} |
529 |
|
|
|
530 |
dl |
1.6 |
/** |
531 |
|
|
* awaitNanos without a signal times out |
532 |
|
|
*/ |
533 |
jsr166 |
1.46 |
public void testAwaitNanos_Timeout() { testAwaitNanos_Timeout(false); } |
534 |
|
|
public void testAwaitNanos_Timeout_fair() { testAwaitNanos_Timeout(true); } |
535 |
|
|
public void testAwaitNanos_Timeout(boolean fair) { |
536 |
jsr166 |
1.64 |
final ReentrantLock lock = new ReentrantLock(fair); |
537 |
|
|
final Condition c = lock.newCondition(); |
538 |
|
|
final long timeoutMillis = timeoutMillis(); |
539 |
|
|
final long timeoutNanos = MILLISECONDS.toNanos(timeoutMillis); |
540 |
|
|
lock.lock(); |
541 |
|
|
final long startTime = System.nanoTime(); |
542 |
jsr166 |
1.46 |
try { |
543 |
|
|
long nanosRemaining = c.awaitNanos(timeoutNanos); |
544 |
|
|
assertTrue(nanosRemaining <= 0); |
545 |
jsr166 |
1.57 |
} catch (InterruptedException fail) { threadUnexpectedException(fail); } |
546 |
jsr166 |
1.64 |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
547 |
|
|
lock.unlock(); |
548 |
dl |
1.2 |
} |
549 |
|
|
|
550 |
dl |
1.6 |
/** |
551 |
jsr166 |
1.38 |
* timed await without a signal times out |
552 |
dl |
1.6 |
*/ |
553 |
jsr166 |
1.46 |
public void testAwait_Timeout() { testAwait_Timeout(false); } |
554 |
|
|
public void testAwait_Timeout_fair() { testAwait_Timeout(true); } |
555 |
|
|
public void testAwait_Timeout(boolean fair) { |
556 |
jsr166 |
1.64 |
final ReentrantLock lock = new ReentrantLock(fair); |
557 |
|
|
final Condition c = lock.newCondition(); |
558 |
|
|
final long timeoutMillis = timeoutMillis(); |
559 |
|
|
lock.lock(); |
560 |
|
|
final long startTime = System.nanoTime(); |
561 |
jsr166 |
1.46 |
try { |
562 |
|
|
assertFalse(c.await(timeoutMillis, MILLISECONDS)); |
563 |
jsr166 |
1.57 |
} catch (InterruptedException fail) { threadUnexpectedException(fail); } |
564 |
jsr166 |
1.64 |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
565 |
|
|
lock.unlock(); |
566 |
dl |
1.2 |
} |
567 |
|
|
|
568 |
dl |
1.6 |
/** |
569 |
|
|
* awaitUntil without a signal times out |
570 |
|
|
*/ |
571 |
jsr166 |
1.46 |
public void testAwaitUntil_Timeout() { testAwaitUntil_Timeout(false); } |
572 |
|
|
public void testAwaitUntil_Timeout_fair() { testAwaitUntil_Timeout(true); } |
573 |
|
|
public void testAwaitUntil_Timeout(boolean fair) { |
574 |
jsr166 |
1.64 |
final ReentrantLock lock = new ReentrantLock(fair); |
575 |
|
|
final Condition c = lock.newCondition(); |
576 |
|
|
lock.lock(); |
577 |
|
|
// We shouldn't assume that nanoTime and currentTimeMillis |
578 |
|
|
// use the same time source, so don't use nanoTime here. |
579 |
|
|
final java.util.Date delayedDate = delayedDate(timeoutMillis()); |
580 |
jsr166 |
1.46 |
try { |
581 |
jsr166 |
1.63 |
assertFalse(c.awaitUntil(delayedDate)); |
582 |
jsr166 |
1.57 |
} catch (InterruptedException fail) { threadUnexpectedException(fail); } |
583 |
jsr166 |
1.64 |
assertTrue(new java.util.Date().getTime() >= delayedDate.getTime()); |
584 |
|
|
lock.unlock(); |
585 |
dl |
1.2 |
} |
586 |
|
|
|
587 |
dl |
1.6 |
/** |
588 |
|
|
* await returns when signalled |
589 |
|
|
*/ |
590 |
jsr166 |
1.46 |
public void testAwait() { testAwait(false); } |
591 |
|
|
public void testAwait_fair() { testAwait(true); } |
592 |
|
|
public void testAwait(boolean fair) { |
593 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
594 |
dl |
1.13 |
final Condition c = lock.newCondition(); |
595 |
jsr166 |
1.45 |
final CountDownLatch locked = new CountDownLatch(1); |
596 |
jsr166 |
1.41 |
Thread t = newStartedThread(new CheckedRunnable() { |
597 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
598 |
|
|
lock.lock(); |
599 |
jsr166 |
1.45 |
locked.countDown(); |
600 |
jsr166 |
1.29 |
c.await(); |
601 |
|
|
lock.unlock(); |
602 |
|
|
}}); |
603 |
dl |
1.5 |
|
604 |
jsr166 |
1.46 |
await(locked); |
605 |
jsr166 |
1.29 |
lock.lock(); |
606 |
jsr166 |
1.45 |
assertHasWaiters(lock, c, t); |
607 |
jsr166 |
1.29 |
c.signal(); |
608 |
jsr166 |
1.45 |
assertHasNoWaiters(lock, c); |
609 |
|
|
assertTrue(t.isAlive()); |
610 |
jsr166 |
1.29 |
lock.unlock(); |
611 |
jsr166 |
1.42 |
awaitTermination(t); |
612 |
dl |
1.5 |
} |
613 |
|
|
|
614 |
dl |
1.6 |
/** |
615 |
dl |
1.14 |
* hasWaiters throws NPE if null |
616 |
|
|
*/ |
617 |
jsr166 |
1.46 |
public void testHasWaitersNPE() { testHasWaitersNPE(false); } |
618 |
|
|
public void testHasWaitersNPE_fair() { testHasWaitersNPE(true); } |
619 |
|
|
public void testHasWaitersNPE(boolean fair) { |
620 |
|
|
final ReentrantLock lock = new ReentrantLock(fair); |
621 |
dl |
1.14 |
try { |
622 |
|
|
lock.hasWaiters(null); |
623 |
|
|
shouldThrow(); |
624 |
jsr166 |
1.29 |
} catch (NullPointerException success) {} |
625 |
dl |
1.14 |
} |
626 |
|
|
|
627 |
|
|
/** |
628 |
|
|
* getWaitQueueLength throws NPE if null |
629 |
|
|
*/ |
630 |
jsr166 |
1.46 |
public void testGetWaitQueueLengthNPE() { testGetWaitQueueLengthNPE(false); } |
631 |
|
|
public void testGetWaitQueueLengthNPE_fair() { testGetWaitQueueLengthNPE(true); } |
632 |
|
|
public void testGetWaitQueueLengthNPE(boolean fair) { |
633 |
|
|
final ReentrantLock lock = new ReentrantLock(fair); |
634 |
dl |
1.14 |
try { |
635 |
|
|
lock.getWaitQueueLength(null); |
636 |
|
|
shouldThrow(); |
637 |
jsr166 |
1.29 |
} catch (NullPointerException success) {} |
638 |
dl |
1.14 |
} |
639 |
|
|
|
640 |
|
|
/** |
641 |
|
|
* getWaitingThreads throws NPE if null |
642 |
|
|
*/ |
643 |
jsr166 |
1.46 |
public void testGetWaitingThreadsNPE() { testGetWaitingThreadsNPE(false); } |
644 |
|
|
public void testGetWaitingThreadsNPE_fair() { testGetWaitingThreadsNPE(true); } |
645 |
|
|
public void testGetWaitingThreadsNPE(boolean fair) { |
646 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
647 |
dl |
1.14 |
try { |
648 |
|
|
lock.getWaitingThreads(null); |
649 |
|
|
shouldThrow(); |
650 |
jsr166 |
1.29 |
} catch (NullPointerException success) {} |
651 |
dl |
1.14 |
} |
652 |
|
|
|
653 |
|
|
/** |
654 |
jsr166 |
1.45 |
* hasWaiters throws IllegalArgumentException if not owned |
655 |
dl |
1.13 |
*/ |
656 |
jsr166 |
1.46 |
public void testHasWaitersIAE() { testHasWaitersIAE(false); } |
657 |
|
|
public void testHasWaitersIAE_fair() { testHasWaitersIAE(true); } |
658 |
|
|
public void testHasWaitersIAE(boolean fair) { |
659 |
|
|
final ReentrantLock lock = new ReentrantLock(fair); |
660 |
jsr166 |
1.29 |
final Condition c = lock.newCondition(); |
661 |
jsr166 |
1.46 |
final ReentrantLock lock2 = new ReentrantLock(fair); |
662 |
dl |
1.13 |
try { |
663 |
|
|
lock2.hasWaiters(c); |
664 |
|
|
shouldThrow(); |
665 |
jsr166 |
1.29 |
} catch (IllegalArgumentException success) {} |
666 |
dl |
1.13 |
} |
667 |
|
|
|
668 |
|
|
/** |
669 |
jsr166 |
1.45 |
* hasWaiters throws IllegalMonitorStateException if not locked |
670 |
dl |
1.13 |
*/ |
671 |
jsr166 |
1.46 |
public void testHasWaitersIMSE() { testHasWaitersIMSE(false); } |
672 |
|
|
public void testHasWaitersIMSE_fair() { testHasWaitersIMSE(true); } |
673 |
|
|
public void testHasWaitersIMSE(boolean fair) { |
674 |
|
|
final ReentrantLock lock = new ReentrantLock(fair); |
675 |
jsr166 |
1.29 |
final Condition c = lock.newCondition(); |
676 |
dl |
1.13 |
try { |
677 |
|
|
lock.hasWaiters(c); |
678 |
|
|
shouldThrow(); |
679 |
jsr166 |
1.29 |
} catch (IllegalMonitorStateException success) {} |
680 |
dl |
1.13 |
} |
681 |
|
|
|
682 |
|
|
/** |
683 |
jsr166 |
1.45 |
* getWaitQueueLength throws IllegalArgumentException if not owned |
684 |
dl |
1.13 |
*/ |
685 |
jsr166 |
1.46 |
public void testGetWaitQueueLengthIAE() { testGetWaitQueueLengthIAE(false); } |
686 |
|
|
public void testGetWaitQueueLengthIAE_fair() { testGetWaitQueueLengthIAE(true); } |
687 |
|
|
public void testGetWaitQueueLengthIAE(boolean fair) { |
688 |
|
|
final ReentrantLock lock = new ReentrantLock(fair); |
689 |
jsr166 |
1.29 |
final Condition c = lock.newCondition(); |
690 |
jsr166 |
1.46 |
final ReentrantLock lock2 = new ReentrantLock(fair); |
691 |
dl |
1.13 |
try { |
692 |
|
|
lock2.getWaitQueueLength(c); |
693 |
|
|
shouldThrow(); |
694 |
jsr166 |
1.29 |
} catch (IllegalArgumentException success) {} |
695 |
dl |
1.13 |
} |
696 |
|
|
|
697 |
|
|
/** |
698 |
jsr166 |
1.45 |
* getWaitQueueLength throws IllegalMonitorStateException if not locked |
699 |
dl |
1.13 |
*/ |
700 |
jsr166 |
1.46 |
public void testGetWaitQueueLengthIMSE() { testGetWaitQueueLengthIMSE(false); } |
701 |
|
|
public void testGetWaitQueueLengthIMSE_fair() { testGetWaitQueueLengthIMSE(true); } |
702 |
|
|
public void testGetWaitQueueLengthIMSE(boolean fair) { |
703 |
|
|
final ReentrantLock lock = new ReentrantLock(fair); |
704 |
jsr166 |
1.29 |
final Condition c = lock.newCondition(); |
705 |
dl |
1.13 |
try { |
706 |
|
|
lock.getWaitQueueLength(c); |
707 |
|
|
shouldThrow(); |
708 |
jsr166 |
1.29 |
} catch (IllegalMonitorStateException success) {} |
709 |
dl |
1.13 |
} |
710 |
|
|
|
711 |
|
|
/** |
712 |
jsr166 |
1.45 |
* getWaitingThreads throws IllegalArgumentException if not owned |
713 |
dl |
1.13 |
*/ |
714 |
jsr166 |
1.46 |
public void testGetWaitingThreadsIAE() { testGetWaitingThreadsIAE(false); } |
715 |
|
|
public void testGetWaitingThreadsIAE_fair() { testGetWaitingThreadsIAE(true); } |
716 |
|
|
public void testGetWaitingThreadsIAE(boolean fair) { |
717 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
718 |
jsr166 |
1.29 |
final Condition c = lock.newCondition(); |
719 |
jsr166 |
1.46 |
final PublicReentrantLock lock2 = new PublicReentrantLock(fair); |
720 |
dl |
1.13 |
try { |
721 |
|
|
lock2.getWaitingThreads(c); |
722 |
|
|
shouldThrow(); |
723 |
jsr166 |
1.29 |
} catch (IllegalArgumentException success) {} |
724 |
dl |
1.13 |
} |
725 |
|
|
|
726 |
|
|
/** |
727 |
jsr166 |
1.45 |
* getWaitingThreads throws IllegalMonitorStateException if not locked |
728 |
dl |
1.13 |
*/ |
729 |
jsr166 |
1.46 |
public void testGetWaitingThreadsIMSE() { testGetWaitingThreadsIMSE(false); } |
730 |
|
|
public void testGetWaitingThreadsIMSE_fair() { testGetWaitingThreadsIMSE(true); } |
731 |
|
|
public void testGetWaitingThreadsIMSE(boolean fair) { |
732 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
733 |
jsr166 |
1.29 |
final Condition c = lock.newCondition(); |
734 |
dl |
1.13 |
try { |
735 |
|
|
lock.getWaitingThreads(c); |
736 |
|
|
shouldThrow(); |
737 |
jsr166 |
1.29 |
} catch (IllegalMonitorStateException success) {} |
738 |
dl |
1.13 |
} |
739 |
|
|
|
740 |
|
|
/** |
741 |
dl |
1.6 |
* hasWaiters returns true when a thread is waiting, else false |
742 |
|
|
*/ |
743 |
jsr166 |
1.46 |
public void testHasWaiters() { testHasWaiters(false); } |
744 |
|
|
public void testHasWaiters_fair() { testHasWaiters(true); } |
745 |
|
|
public void testHasWaiters(boolean fair) { |
746 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
747 |
dl |
1.13 |
final Condition c = lock.newCondition(); |
748 |
jsr166 |
1.51 |
final CountDownLatch pleaseSignal = new CountDownLatch(1); |
749 |
jsr166 |
1.41 |
Thread t = newStartedThread(new CheckedRunnable() { |
750 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
751 |
|
|
lock.lock(); |
752 |
jsr166 |
1.45 |
assertHasNoWaiters(lock, c); |
753 |
jsr166 |
1.37 |
assertFalse(lock.hasWaiters(c)); |
754 |
jsr166 |
1.51 |
pleaseSignal.countDown(); |
755 |
jsr166 |
1.29 |
c.await(); |
756 |
jsr166 |
1.45 |
assertHasNoWaiters(lock, c); |
757 |
|
|
assertFalse(lock.hasWaiters(c)); |
758 |
jsr166 |
1.29 |
lock.unlock(); |
759 |
|
|
}}); |
760 |
dl |
1.2 |
|
761 |
jsr166 |
1.51 |
await(pleaseSignal); |
762 |
jsr166 |
1.29 |
lock.lock(); |
763 |
jsr166 |
1.45 |
assertHasWaiters(lock, c, t); |
764 |
jsr166 |
1.29 |
assertTrue(lock.hasWaiters(c)); |
765 |
|
|
c.signal(); |
766 |
jsr166 |
1.45 |
assertHasNoWaiters(lock, c); |
767 |
jsr166 |
1.29 |
assertFalse(lock.hasWaiters(c)); |
768 |
|
|
lock.unlock(); |
769 |
jsr166 |
1.42 |
awaitTermination(t); |
770 |
jsr166 |
1.45 |
assertHasNoWaiters(lock, c); |
771 |
dl |
1.5 |
} |
772 |
|
|
|
773 |
dl |
1.6 |
/** |
774 |
|
|
* getWaitQueueLength returns number of waiting threads |
775 |
|
|
*/ |
776 |
jsr166 |
1.46 |
public void testGetWaitQueueLength() { testGetWaitQueueLength(false); } |
777 |
|
|
public void testGetWaitQueueLength_fair() { testGetWaitQueueLength(true); } |
778 |
|
|
public void testGetWaitQueueLength(boolean fair) { |
779 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
780 |
dl |
1.13 |
final Condition c = lock.newCondition(); |
781 |
jsr166 |
1.45 |
final CountDownLatch locked1 = new CountDownLatch(1); |
782 |
|
|
final CountDownLatch locked2 = new CountDownLatch(1); |
783 |
|
|
Thread t1 = new Thread(new CheckedRunnable() { |
784 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
785 |
|
|
lock.lock(); |
786 |
jsr166 |
1.37 |
assertFalse(lock.hasWaiters(c)); |
787 |
|
|
assertEquals(0, lock.getWaitQueueLength(c)); |
788 |
jsr166 |
1.45 |
locked1.countDown(); |
789 |
jsr166 |
1.29 |
c.await(); |
790 |
|
|
lock.unlock(); |
791 |
|
|
}}); |
792 |
dl |
1.13 |
|
793 |
jsr166 |
1.45 |
Thread t2 = new Thread(new CheckedRunnable() { |
794 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
795 |
|
|
lock.lock(); |
796 |
jsr166 |
1.37 |
assertTrue(lock.hasWaiters(c)); |
797 |
|
|
assertEquals(1, lock.getWaitQueueLength(c)); |
798 |
jsr166 |
1.45 |
locked2.countDown(); |
799 |
jsr166 |
1.29 |
c.await(); |
800 |
|
|
lock.unlock(); |
801 |
|
|
}}); |
802 |
|
|
|
803 |
|
|
lock.lock(); |
804 |
jsr166 |
1.45 |
assertEquals(0, lock.getWaitQueueLength(c)); |
805 |
|
|
lock.unlock(); |
806 |
|
|
|
807 |
|
|
t1.start(); |
808 |
jsr166 |
1.46 |
await(locked1); |
809 |
jsr166 |
1.45 |
|
810 |
|
|
lock.lock(); |
811 |
|
|
assertHasWaiters(lock, c, t1); |
812 |
|
|
assertEquals(1, lock.getWaitQueueLength(c)); |
813 |
|
|
lock.unlock(); |
814 |
|
|
|
815 |
|
|
t2.start(); |
816 |
jsr166 |
1.46 |
await(locked2); |
817 |
jsr166 |
1.45 |
|
818 |
|
|
lock.lock(); |
819 |
|
|
assertHasWaiters(lock, c, t1, t2); |
820 |
jsr166 |
1.29 |
assertEquals(2, lock.getWaitQueueLength(c)); |
821 |
|
|
c.signalAll(); |
822 |
jsr166 |
1.45 |
assertHasNoWaiters(lock, c); |
823 |
jsr166 |
1.29 |
lock.unlock(); |
824 |
jsr166 |
1.45 |
|
825 |
jsr166 |
1.42 |
awaitTermination(t1); |
826 |
|
|
awaitTermination(t2); |
827 |
jsr166 |
1.45 |
|
828 |
|
|
assertHasNoWaiters(lock, c); |
829 |
dl |
1.13 |
} |
830 |
|
|
|
831 |
|
|
/** |
832 |
|
|
* getWaitingThreads returns only and all waiting threads |
833 |
|
|
*/ |
834 |
jsr166 |
1.46 |
public void testGetWaitingThreads() { testGetWaitingThreads(false); } |
835 |
|
|
public void testGetWaitingThreads_fair() { testGetWaitingThreads(true); } |
836 |
|
|
public void testGetWaitingThreads(boolean fair) { |
837 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
838 |
dl |
1.13 |
final Condition c = lock.newCondition(); |
839 |
jsr166 |
1.45 |
final CountDownLatch locked1 = new CountDownLatch(1); |
840 |
|
|
final CountDownLatch locked2 = new CountDownLatch(1); |
841 |
jsr166 |
1.30 |
Thread t1 = new Thread(new CheckedRunnable() { |
842 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
843 |
|
|
lock.lock(); |
844 |
jsr166 |
1.37 |
assertTrue(lock.getWaitingThreads(c).isEmpty()); |
845 |
jsr166 |
1.45 |
locked1.countDown(); |
846 |
jsr166 |
1.29 |
c.await(); |
847 |
|
|
lock.unlock(); |
848 |
|
|
}}); |
849 |
|
|
|
850 |
jsr166 |
1.30 |
Thread t2 = new Thread(new CheckedRunnable() { |
851 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
852 |
|
|
lock.lock(); |
853 |
jsr166 |
1.37 |
assertFalse(lock.getWaitingThreads(c).isEmpty()); |
854 |
jsr166 |
1.45 |
locked2.countDown(); |
855 |
jsr166 |
1.29 |
c.await(); |
856 |
|
|
lock.unlock(); |
857 |
|
|
}}); |
858 |
dl |
1.5 |
|
859 |
jsr166 |
1.29 |
lock.lock(); |
860 |
|
|
assertTrue(lock.getWaitingThreads(c).isEmpty()); |
861 |
|
|
lock.unlock(); |
862 |
jsr166 |
1.45 |
|
863 |
jsr166 |
1.29 |
t1.start(); |
864 |
jsr166 |
1.46 |
await(locked1); |
865 |
jsr166 |
1.45 |
|
866 |
|
|
lock.lock(); |
867 |
|
|
assertHasWaiters(lock, c, t1); |
868 |
|
|
assertTrue(lock.getWaitingThreads(c).contains(t1)); |
869 |
|
|
assertFalse(lock.getWaitingThreads(c).contains(t2)); |
870 |
|
|
assertEquals(1, lock.getWaitingThreads(c).size()); |
871 |
|
|
lock.unlock(); |
872 |
|
|
|
873 |
jsr166 |
1.29 |
t2.start(); |
874 |
jsr166 |
1.46 |
await(locked2); |
875 |
jsr166 |
1.45 |
|
876 |
jsr166 |
1.29 |
lock.lock(); |
877 |
jsr166 |
1.45 |
assertHasWaiters(lock, c, t1, t2); |
878 |
jsr166 |
1.29 |
assertTrue(lock.getWaitingThreads(c).contains(t1)); |
879 |
|
|
assertTrue(lock.getWaitingThreads(c).contains(t2)); |
880 |
jsr166 |
1.45 |
assertEquals(2, lock.getWaitingThreads(c).size()); |
881 |
jsr166 |
1.29 |
c.signalAll(); |
882 |
jsr166 |
1.45 |
assertHasNoWaiters(lock, c); |
883 |
jsr166 |
1.29 |
lock.unlock(); |
884 |
jsr166 |
1.45 |
|
885 |
jsr166 |
1.42 |
awaitTermination(t1); |
886 |
|
|
awaitTermination(t2); |
887 |
jsr166 |
1.26 |
|
888 |
jsr166 |
1.45 |
assertHasNoWaiters(lock, c); |
889 |
dl |
1.22 |
} |
890 |
dl |
1.2 |
|
891 |
dl |
1.6 |
/** |
892 |
jsr166 |
1.51 |
* awaitUninterruptibly is uninterruptible |
893 |
dl |
1.6 |
*/ |
894 |
jsr166 |
1.46 |
public void testAwaitUninterruptibly() { testAwaitUninterruptibly(false); } |
895 |
|
|
public void testAwaitUninterruptibly_fair() { testAwaitUninterruptibly(true); } |
896 |
|
|
public void testAwaitUninterruptibly(boolean fair) { |
897 |
|
|
final ReentrantLock lock = new ReentrantLock(fair); |
898 |
jsr166 |
1.65 |
final Condition condition = lock.newCondition(); |
899 |
jsr166 |
1.51 |
final CountDownLatch pleaseInterrupt = new CountDownLatch(2); |
900 |
|
|
|
901 |
|
|
Thread t1 = newStartedThread(new CheckedRunnable() { |
902 |
|
|
public void realRun() { |
903 |
|
|
// Interrupt before awaitUninterruptibly |
904 |
|
|
lock.lock(); |
905 |
|
|
pleaseInterrupt.countDown(); |
906 |
|
|
Thread.currentThread().interrupt(); |
907 |
jsr166 |
1.65 |
condition.awaitUninterruptibly(); |
908 |
jsr166 |
1.51 |
assertTrue(Thread.interrupted()); |
909 |
|
|
lock.unlock(); |
910 |
|
|
}}); |
911 |
|
|
|
912 |
|
|
Thread t2 = newStartedThread(new CheckedRunnable() { |
913 |
jsr166 |
1.45 |
public void realRun() { |
914 |
jsr166 |
1.51 |
// Interrupt during awaitUninterruptibly |
915 |
jsr166 |
1.45 |
lock.lock(); |
916 |
jsr166 |
1.51 |
pleaseInterrupt.countDown(); |
917 |
jsr166 |
1.65 |
condition.awaitUninterruptibly(); |
918 |
jsr166 |
1.45 |
assertTrue(Thread.interrupted()); |
919 |
|
|
lock.unlock(); |
920 |
|
|
}}); |
921 |
dl |
1.22 |
|
922 |
jsr166 |
1.51 |
await(pleaseInterrupt); |
923 |
jsr166 |
1.65 |
t2.interrupt(); |
924 |
jsr166 |
1.45 |
lock.lock(); |
925 |
|
|
lock.unlock(); |
926 |
jsr166 |
1.65 |
assertThreadBlocks(t1, Thread.State.WAITING); |
927 |
|
|
assertThreadBlocks(t2, Thread.State.WAITING); |
928 |
jsr166 |
1.51 |
|
929 |
jsr166 |
1.29 |
lock.lock(); |
930 |
jsr166 |
1.65 |
condition.signalAll(); |
931 |
jsr166 |
1.45 |
lock.unlock(); |
932 |
jsr166 |
1.51 |
|
933 |
|
|
awaitTermination(t1); |
934 |
|
|
awaitTermination(t2); |
935 |
dl |
1.2 |
} |
936 |
|
|
|
937 |
dl |
1.6 |
/** |
938 |
jsr166 |
1.46 |
* await/awaitNanos/awaitUntil is interruptible |
939 |
dl |
1.6 |
*/ |
940 |
jsr166 |
1.46 |
public void testInterruptible_await() { testInterruptible(false, AwaitMethod.await); } |
941 |
|
|
public void testInterruptible_await_fair() { testInterruptible(true, AwaitMethod.await); } |
942 |
jsr166 |
1.48 |
public void testInterruptible_awaitTimed() { testInterruptible(false, AwaitMethod.awaitTimed); } |
943 |
|
|
public void testInterruptible_awaitTimed_fair() { testInterruptible(true, AwaitMethod.awaitTimed); } |
944 |
jsr166 |
1.46 |
public void testInterruptible_awaitNanos() { testInterruptible(false, AwaitMethod.awaitNanos); } |
945 |
|
|
public void testInterruptible_awaitNanos_fair() { testInterruptible(true, AwaitMethod.awaitNanos); } |
946 |
|
|
public void testInterruptible_awaitUntil() { testInterruptible(false, AwaitMethod.awaitUntil); } |
947 |
|
|
public void testInterruptible_awaitUntil_fair() { testInterruptible(true, AwaitMethod.awaitUntil); } |
948 |
|
|
public void testInterruptible(boolean fair, final AwaitMethod awaitMethod) { |
949 |
|
|
final PublicReentrantLock lock = |
950 |
|
|
new PublicReentrantLock(fair); |
951 |
dl |
1.2 |
final Condition c = lock.newCondition(); |
952 |
jsr166 |
1.51 |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
953 |
jsr166 |
1.41 |
Thread t = newStartedThread(new CheckedInterruptedRunnable() { |
954 |
jsr166 |
1.30 |
public void realRun() throws InterruptedException { |
955 |
jsr166 |
1.29 |
lock.lock(); |
956 |
jsr166 |
1.46 |
assertLockedByMoi(lock); |
957 |
jsr166 |
1.43 |
assertHasNoWaiters(lock, c); |
958 |
jsr166 |
1.51 |
pleaseInterrupt.countDown(); |
959 |
jsr166 |
1.43 |
try { |
960 |
jsr166 |
1.46 |
await(c, awaitMethod); |
961 |
jsr166 |
1.43 |
} finally { |
962 |
jsr166 |
1.46 |
assertLockedByMoi(lock); |
963 |
jsr166 |
1.43 |
assertHasNoWaiters(lock, c); |
964 |
|
|
lock.unlock(); |
965 |
|
|
assertFalse(Thread.interrupted()); |
966 |
|
|
} |
967 |
jsr166 |
1.29 |
}}); |
968 |
|
|
|
969 |
jsr166 |
1.51 |
await(pleaseInterrupt); |
970 |
jsr166 |
1.43 |
assertHasWaiters(lock, c, t); |
971 |
jsr166 |
1.29 |
t.interrupt(); |
972 |
jsr166 |
1.42 |
awaitTermination(t); |
973 |
jsr166 |
1.46 |
assertNotLocked(lock); |
974 |
dl |
1.2 |
} |
975 |
|
|
|
976 |
dl |
1.6 |
/** |
977 |
jsr166 |
1.46 |
* signalAll wakes up all threads |
978 |
dl |
1.6 |
*/ |
979 |
jsr166 |
1.46 |
public void testSignalAll_await() { testSignalAll(false, AwaitMethod.await); } |
980 |
|
|
public void testSignalAll_await_fair() { testSignalAll(true, AwaitMethod.await); } |
981 |
jsr166 |
1.48 |
public void testSignalAll_awaitTimed() { testSignalAll(false, AwaitMethod.awaitTimed); } |
982 |
|
|
public void testSignalAll_awaitTimed_fair() { testSignalAll(true, AwaitMethod.awaitTimed); } |
983 |
jsr166 |
1.46 |
public void testSignalAll_awaitNanos() { testSignalAll(false, AwaitMethod.awaitNanos); } |
984 |
|
|
public void testSignalAll_awaitNanos_fair() { testSignalAll(true, AwaitMethod.awaitNanos); } |
985 |
|
|
public void testSignalAll_awaitUntil() { testSignalAll(false, AwaitMethod.awaitUntil); } |
986 |
|
|
public void testSignalAll_awaitUntil_fair() { testSignalAll(true, AwaitMethod.awaitUntil); } |
987 |
|
|
public void testSignalAll(boolean fair, final AwaitMethod awaitMethod) { |
988 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
989 |
dl |
1.2 |
final Condition c = lock.newCondition(); |
990 |
jsr166 |
1.51 |
final CountDownLatch pleaseSignal = new CountDownLatch(2); |
991 |
jsr166 |
1.46 |
class Awaiter extends CheckedRunnable { |
992 |
jsr166 |
1.30 |
public void realRun() throws InterruptedException { |
993 |
jsr166 |
1.29 |
lock.lock(); |
994 |
jsr166 |
1.51 |
pleaseSignal.countDown(); |
995 |
jsr166 |
1.46 |
await(c, awaitMethod); |
996 |
|
|
lock.unlock(); |
997 |
|
|
} |
998 |
|
|
} |
999 |
jsr166 |
1.29 |
|
1000 |
jsr166 |
1.46 |
Thread t1 = newStartedThread(new Awaiter()); |
1001 |
|
|
Thread t2 = newStartedThread(new Awaiter()); |
1002 |
dl |
1.2 |
|
1003 |
jsr166 |
1.51 |
await(pleaseSignal); |
1004 |
jsr166 |
1.46 |
lock.lock(); |
1005 |
|
|
assertHasWaiters(lock, c, t1, t2); |
1006 |
|
|
c.signalAll(); |
1007 |
|
|
assertHasNoWaiters(lock, c); |
1008 |
|
|
lock.unlock(); |
1009 |
|
|
awaitTermination(t1); |
1010 |
|
|
awaitTermination(t2); |
1011 |
dl |
1.2 |
} |
1012 |
|
|
|
1013 |
dl |
1.6 |
/** |
1014 |
jsr166 |
1.49 |
* signal wakes up waiting threads in FIFO order |
1015 |
dl |
1.6 |
*/ |
1016 |
jsr166 |
1.46 |
public void testSignalWakesFifo() { testSignalWakesFifo(false); } |
1017 |
|
|
public void testSignalWakesFifo_fair() { testSignalWakesFifo(true); } |
1018 |
|
|
public void testSignalWakesFifo(boolean fair) { |
1019 |
|
|
final PublicReentrantLock lock = |
1020 |
|
|
new PublicReentrantLock(fair); |
1021 |
dl |
1.2 |
final Condition c = lock.newCondition(); |
1022 |
jsr166 |
1.46 |
final CountDownLatch locked1 = new CountDownLatch(1); |
1023 |
|
|
final CountDownLatch locked2 = new CountDownLatch(1); |
1024 |
jsr166 |
1.41 |
Thread t1 = newStartedThread(new CheckedRunnable() { |
1025 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
1026 |
|
|
lock.lock(); |
1027 |
jsr166 |
1.46 |
locked1.countDown(); |
1028 |
jsr166 |
1.29 |
c.await(); |
1029 |
|
|
lock.unlock(); |
1030 |
|
|
}}); |
1031 |
|
|
|
1032 |
jsr166 |
1.46 |
await(locked1); |
1033 |
|
|
|
1034 |
jsr166 |
1.41 |
Thread t2 = newStartedThread(new CheckedRunnable() { |
1035 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
1036 |
|
|
lock.lock(); |
1037 |
jsr166 |
1.46 |
locked2.countDown(); |
1038 |
jsr166 |
1.29 |
c.await(); |
1039 |
|
|
lock.unlock(); |
1040 |
|
|
}}); |
1041 |
dl |
1.2 |
|
1042 |
jsr166 |
1.46 |
await(locked2); |
1043 |
|
|
|
1044 |
jsr166 |
1.29 |
lock.lock(); |
1045 |
jsr166 |
1.45 |
assertHasWaiters(lock, c, t1, t2); |
1046 |
jsr166 |
1.46 |
assertFalse(lock.hasQueuedThreads()); |
1047 |
|
|
c.signal(); |
1048 |
|
|
assertHasWaiters(lock, c, t2); |
1049 |
|
|
assertTrue(lock.hasQueuedThread(t1)); |
1050 |
|
|
assertFalse(lock.hasQueuedThread(t2)); |
1051 |
|
|
c.signal(); |
1052 |
jsr166 |
1.45 |
assertHasNoWaiters(lock, c); |
1053 |
jsr166 |
1.46 |
assertTrue(lock.hasQueuedThread(t1)); |
1054 |
|
|
assertTrue(lock.hasQueuedThread(t2)); |
1055 |
jsr166 |
1.29 |
lock.unlock(); |
1056 |
jsr166 |
1.42 |
awaitTermination(t1); |
1057 |
|
|
awaitTermination(t2); |
1058 |
dl |
1.3 |
} |
1059 |
|
|
|
1060 |
dl |
1.6 |
/** |
1061 |
dl |
1.23 |
* await after multiple reentrant locking preserves lock count |
1062 |
|
|
*/ |
1063 |
jsr166 |
1.46 |
public void testAwaitLockCount() { testAwaitLockCount(false); } |
1064 |
|
|
public void testAwaitLockCount_fair() { testAwaitLockCount(true); } |
1065 |
|
|
public void testAwaitLockCount(boolean fair) { |
1066 |
|
|
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
1067 |
dl |
1.23 |
final Condition c = lock.newCondition(); |
1068 |
jsr166 |
1.51 |
final CountDownLatch pleaseSignal = new CountDownLatch(2); |
1069 |
jsr166 |
1.41 |
Thread t1 = newStartedThread(new CheckedRunnable() { |
1070 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
1071 |
|
|
lock.lock(); |
1072 |
jsr166 |
1.46 |
assertLockedByMoi(lock); |
1073 |
jsr166 |
1.37 |
assertEquals(1, lock.getHoldCount()); |
1074 |
jsr166 |
1.51 |
pleaseSignal.countDown(); |
1075 |
jsr166 |
1.29 |
c.await(); |
1076 |
jsr166 |
1.46 |
assertLockedByMoi(lock); |
1077 |
jsr166 |
1.37 |
assertEquals(1, lock.getHoldCount()); |
1078 |
jsr166 |
1.29 |
lock.unlock(); |
1079 |
|
|
}}); |
1080 |
dl |
1.23 |
|
1081 |
jsr166 |
1.41 |
Thread t2 = newStartedThread(new CheckedRunnable() { |
1082 |
jsr166 |
1.29 |
public void realRun() throws InterruptedException { |
1083 |
|
|
lock.lock(); |
1084 |
|
|
lock.lock(); |
1085 |
jsr166 |
1.46 |
assertLockedByMoi(lock); |
1086 |
jsr166 |
1.37 |
assertEquals(2, lock.getHoldCount()); |
1087 |
jsr166 |
1.51 |
pleaseSignal.countDown(); |
1088 |
jsr166 |
1.29 |
c.await(); |
1089 |
jsr166 |
1.46 |
assertLockedByMoi(lock); |
1090 |
jsr166 |
1.37 |
assertEquals(2, lock.getHoldCount()); |
1091 |
jsr166 |
1.29 |
lock.unlock(); |
1092 |
|
|
lock.unlock(); |
1093 |
|
|
}}); |
1094 |
|
|
|
1095 |
jsr166 |
1.51 |
await(pleaseSignal); |
1096 |
jsr166 |
1.29 |
lock.lock(); |
1097 |
jsr166 |
1.45 |
assertHasWaiters(lock, c, t1, t2); |
1098 |
|
|
assertEquals(1, lock.getHoldCount()); |
1099 |
jsr166 |
1.29 |
c.signalAll(); |
1100 |
jsr166 |
1.45 |
assertHasNoWaiters(lock, c); |
1101 |
jsr166 |
1.29 |
lock.unlock(); |
1102 |
jsr166 |
1.42 |
awaitTermination(t1); |
1103 |
|
|
awaitTermination(t2); |
1104 |
dl |
1.23 |
} |
1105 |
|
|
|
1106 |
|
|
/** |
1107 |
dl |
1.6 |
* A serialized lock deserializes as unlocked |
1108 |
|
|
*/ |
1109 |
jsr166 |
1.46 |
public void testSerialization() { testSerialization(false); } |
1110 |
|
|
public void testSerialization_fair() { testSerialization(true); } |
1111 |
|
|
public void testSerialization(boolean fair) { |
1112 |
jsr166 |
1.64 |
final ReentrantLock lock = new ReentrantLock(fair); |
1113 |
jsr166 |
1.46 |
lock.lock(); |
1114 |
|
|
|
1115 |
|
|
ReentrantLock clone = serialClone(lock); |
1116 |
|
|
assertEquals(lock.isFair(), clone.isFair()); |
1117 |
|
|
assertTrue(lock.isLocked()); |
1118 |
|
|
assertFalse(clone.isLocked()); |
1119 |
|
|
assertEquals(1, lock.getHoldCount()); |
1120 |
|
|
assertEquals(0, clone.getHoldCount()); |
1121 |
|
|
clone.lock(); |
1122 |
|
|
clone.lock(); |
1123 |
|
|
assertTrue(clone.isLocked()); |
1124 |
|
|
assertEquals(2, clone.getHoldCount()); |
1125 |
|
|
assertEquals(1, lock.getHoldCount()); |
1126 |
|
|
clone.unlock(); |
1127 |
|
|
clone.unlock(); |
1128 |
|
|
assertTrue(lock.isLocked()); |
1129 |
|
|
assertFalse(clone.isLocked()); |
1130 |
dl |
1.2 |
} |
1131 |
dl |
1.1 |
|
1132 |
dl |
1.18 |
/** |
1133 |
|
|
* toString indicates current lock state |
1134 |
|
|
*/ |
1135 |
jsr166 |
1.46 |
public void testToString() { testToString(false); } |
1136 |
|
|
public void testToString_fair() { testToString(true); } |
1137 |
|
|
public void testToString(boolean fair) { |
1138 |
jsr166 |
1.64 |
final ReentrantLock lock = new ReentrantLock(fair); |
1139 |
jsr166 |
1.49 |
assertTrue(lock.toString().contains("Unlocked")); |
1140 |
dl |
1.18 |
lock.lock(); |
1141 |
jsr166 |
1.64 |
assertTrue(lock.toString().contains("Locked by")); |
1142 |
jsr166 |
1.49 |
lock.unlock(); |
1143 |
|
|
assertTrue(lock.toString().contains("Unlocked")); |
1144 |
dl |
1.18 |
} |
1145 |
jsr166 |
1.67 |
|
1146 |
|
|
/** |
1147 |
|
|
* Tests scenario for JDK-8187408 |
1148 |
|
|
* AbstractQueuedSynchronizer wait queue corrupted when thread awaits without holding the lock |
1149 |
|
|
*/ |
1150 |
|
|
public void testBug8187408() throws InterruptedException { |
1151 |
|
|
final ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
1152 |
|
|
final AwaitMethod awaitMethod = randomAwaitMethod(); |
1153 |
|
|
final int nThreads = rnd.nextInt(2, 10); |
1154 |
|
|
final ReentrantLock lock = new ReentrantLock(); |
1155 |
|
|
final Condition cond = lock.newCondition(); |
1156 |
|
|
final CountDownLatch done = new CountDownLatch(nThreads); |
1157 |
|
|
final ArrayList<Thread> threads = new ArrayList<>(); |
1158 |
|
|
|
1159 |
|
|
Runnable rogue = () -> { |
1160 |
|
|
while (done.getCount() > 0) { |
1161 |
|
|
try { |
1162 |
|
|
// call await without holding lock?! |
1163 |
|
|
await(cond, awaitMethod); |
1164 |
|
|
throw new AssertionError("should throw"); |
1165 |
|
|
} |
1166 |
jsr166 |
1.69 |
catch (IllegalMonitorStateException success) {} |
1167 |
jsr166 |
1.67 |
catch (Throwable fail) { threadUnexpectedException(fail); }}}; |
1168 |
|
|
Thread rogueThread = new Thread(rogue, "rogue"); |
1169 |
|
|
threads.add(rogueThread); |
1170 |
|
|
rogueThread.start(); |
1171 |
|
|
|
1172 |
|
|
Runnable waiter = () -> { |
1173 |
|
|
lock.lock(); |
1174 |
|
|
try { |
1175 |
|
|
done.countDown(); |
1176 |
|
|
cond.await(); |
1177 |
|
|
} catch (Throwable fail) { |
1178 |
|
|
threadUnexpectedException(fail); |
1179 |
|
|
} finally { |
1180 |
|
|
lock.unlock(); |
1181 |
|
|
}}; |
1182 |
|
|
for (int i = 0; i < nThreads; i++) { |
1183 |
|
|
Thread thread = new Thread(waiter, "waiter"); |
1184 |
|
|
threads.add(thread); |
1185 |
|
|
thread.start(); |
1186 |
|
|
} |
1187 |
|
|
|
1188 |
|
|
assertTrue(done.await(LONG_DELAY_MS, MILLISECONDS)); |
1189 |
|
|
lock.lock(); |
1190 |
|
|
try { |
1191 |
|
|
assertEquals(nThreads, lock.getWaitQueueLength(cond)); |
1192 |
|
|
} finally { |
1193 |
|
|
cond.signalAll(); |
1194 |
|
|
lock.unlock(); |
1195 |
|
|
} |
1196 |
|
|
for (Thread thread : threads) { |
1197 |
|
|
thread.join(LONG_DELAY_MS); |
1198 |
|
|
assertFalse(thread.isAlive()); |
1199 |
|
|
} |
1200 |
|
|
} |
1201 |
jsr166 |
1.70 |
|
1202 |
|
|
/** |
1203 |
|
|
* ThreadMXBean reports the blockers that we expect. |
1204 |
|
|
*/ |
1205 |
|
|
public void testBlockers() { |
1206 |
|
|
if (!testImplementationDetails) return; |
1207 |
|
|
final boolean fair = randomBoolean(); |
1208 |
|
|
final boolean timedAcquire = randomBoolean(); |
1209 |
|
|
final boolean timedAwait = randomBoolean(); |
1210 |
|
|
final String syncClassName = fair |
1211 |
|
|
? "ReentrantLock$FairSync" |
1212 |
|
|
: "ReentrantLock$NonfairSync"; |
1213 |
|
|
final String conditionClassName |
1214 |
|
|
= "AbstractQueuedSynchronizer$ConditionObject"; |
1215 |
|
|
final Thread.State expectedAcquireState = timedAcquire |
1216 |
|
|
? Thread.State.TIMED_WAITING |
1217 |
|
|
: Thread.State.WAITING; |
1218 |
|
|
final Thread.State expectedAwaitState = timedAwait |
1219 |
|
|
? Thread.State.TIMED_WAITING |
1220 |
|
|
: Thread.State.WAITING; |
1221 |
|
|
final Lock lock = new ReentrantLock(fair); |
1222 |
|
|
final Condition condition = lock.newCondition(); |
1223 |
|
|
final AtomicBoolean conditionSatisfied = new AtomicBoolean(false); |
1224 |
|
|
lock.lock(); |
1225 |
|
|
final Thread thread = newStartedThread((Action) () -> { |
1226 |
|
|
if (timedAcquire) |
1227 |
|
|
lock.tryLock(LONGER_DELAY_MS, MILLISECONDS); |
1228 |
|
|
else |
1229 |
|
|
lock.lock(); |
1230 |
|
|
while (!conditionSatisfied.get()) |
1231 |
|
|
if (timedAwait) |
1232 |
|
|
condition.await(LONGER_DELAY_MS, MILLISECONDS); |
1233 |
|
|
else |
1234 |
|
|
condition.await(); |
1235 |
|
|
}); |
1236 |
|
|
Callable<Boolean> waitingForLock = () -> { |
1237 |
|
|
String className; |
1238 |
|
|
return thread.getState() == expectedAcquireState |
1239 |
|
|
&& (className = blockerClassName(thread)) != null |
1240 |
|
|
&& className.endsWith(syncClassName); |
1241 |
|
|
}; |
1242 |
|
|
waitForThreadToEnterWaitState(thread, waitingForLock); |
1243 |
|
|
|
1244 |
|
|
lock.unlock(); |
1245 |
|
|
Callable<Boolean> waitingForCondition = () -> { |
1246 |
|
|
String className; |
1247 |
|
|
return thread.getState() == expectedAwaitState |
1248 |
|
|
&& (className = blockerClassName(thread)) != null |
1249 |
|
|
&& className.endsWith(conditionClassName); |
1250 |
|
|
}; |
1251 |
|
|
waitForThreadToEnterWaitState(thread, waitingForCondition); |
1252 |
|
|
|
1253 |
|
|
// politely release the waiter |
1254 |
|
|
conditionSatisfied.set(true); |
1255 |
|
|
lock.lock(); |
1256 |
|
|
try { |
1257 |
|
|
condition.signal(); |
1258 |
|
|
} finally { lock.unlock(); } |
1259 |
|
|
|
1260 |
|
|
awaitTermination(thread); |
1261 |
|
|
} |
1262 |
dl |
1.1 |
} |