1 |
|
/* |
2 |
< |
* Written by members of JCP JSR-166 Expert Group and released to the |
3 |
< |
* public domain. Use, modify, and redistribute this code in any way |
4 |
< |
* without acknowledgement. Other contributors include Andrew Wright, |
5 |
< |
* Jeffrey Hayes, Pat Fischer, Mike Judd. |
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/publicdomain/zero/1.0/ |
5 |
> |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
> |
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
|
import junit.framework.*; |
10 |
|
import java.util.concurrent.locks.*; |
11 |
|
import java.util.concurrent.*; |
12 |
+ |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
13 |
|
import java.util.*; |
14 |
|
import java.io.*; |
15 |
|
|
16 |
|
public class ReentrantLockTest extends JSR166TestCase { |
17 |
|
public static void main(String[] args) { |
18 |
< |
junit.textui.TestRunner.run (suite()); |
18 |
> |
junit.textui.TestRunner.run(suite()); |
19 |
|
} |
20 |
|
public static Test suite() { |
21 |
< |
return new TestSuite(ReentrantLockTest.class); |
21 |
> |
return new TestSuite(ReentrantLockTest.class); |
22 |
|
} |
23 |
|
|
24 |
|
/** |
25 |
|
* A runnable calling lockInterruptibly |
26 |
|
*/ |
27 |
< |
class InterruptibleLockRunnable implements Runnable { |
27 |
> |
class InterruptibleLockRunnable extends CheckedRunnable { |
28 |
|
final ReentrantLock lock; |
29 |
|
InterruptibleLockRunnable(ReentrantLock l) { lock = l; } |
30 |
< |
public void run() { |
31 |
< |
try { |
30 |
< |
lock.lockInterruptibly(); |
31 |
< |
} catch(InterruptedException success){} |
30 |
> |
public void realRun() throws InterruptedException { |
31 |
> |
lock.lockInterruptibly(); |
32 |
|
} |
33 |
|
} |
34 |
|
|
35 |
– |
|
35 |
|
/** |
36 |
|
* A runnable calling lockInterruptibly that expects to be |
37 |
|
* interrupted |
38 |
|
*/ |
39 |
< |
class InterruptedLockRunnable implements Runnable { |
39 |
> |
class InterruptedLockRunnable extends CheckedInterruptedRunnable { |
40 |
|
final ReentrantLock lock; |
41 |
|
InterruptedLockRunnable(ReentrantLock l) { lock = l; } |
42 |
< |
public void run() { |
43 |
< |
try { |
45 |
< |
lock.lockInterruptibly(); |
46 |
< |
threadShouldThrow(); |
47 |
< |
} catch(InterruptedException success){} |
42 |
> |
public void realRun() throws InterruptedException { |
43 |
> |
lock.lockInterruptibly(); |
44 |
|
} |
45 |
|
} |
46 |
|
|
49 |
|
*/ |
50 |
|
static class PublicReentrantLock extends ReentrantLock { |
51 |
|
PublicReentrantLock() { super(); } |
52 |
< |
public Collection<Thread> getQueuedThreads() { |
53 |
< |
return super.getQueuedThreads(); |
52 |
> |
PublicReentrantLock(boolean fair) { super(fair); } |
53 |
> |
public Thread getOwner() { |
54 |
> |
return super.getOwner(); |
55 |
|
} |
56 |
< |
public ConditionObject newCondition() { |
57 |
< |
return new PublicCondition(this); |
56 |
> |
public Collection<Thread> getQueuedThreads() { |
57 |
> |
return super.getQueuedThreads(); |
58 |
|
} |
59 |
< |
|
60 |
< |
static class PublicCondition extends ReentrantLock.ConditionObject { |
64 |
< |
PublicCondition(PublicReentrantLock l) { super(l); } |
65 |
< |
public Collection<Thread> getWaitingThreads() { |
66 |
< |
return super.getWaitingThreads(); |
67 |
< |
} |
59 |
> |
public Collection<Thread> getWaitingThreads(Condition c) { |
60 |
> |
return super.getWaitingThreads(c); |
61 |
|
} |
62 |
+ |
} |
63 |
|
|
64 |
+ |
/** |
65 |
+ |
* Releases write lock, checking that it had a hold count of 1. |
66 |
+ |
*/ |
67 |
+ |
void releaseLock(PublicReentrantLock lock) { |
68 |
+ |
assertLockedByMoi(lock); |
69 |
+ |
lock.unlock(); |
70 |
+ |
assertFalse(lock.isHeldByCurrentThread()); |
71 |
+ |
assertNotLocked(lock); |
72 |
|
} |
73 |
|
|
74 |
< |
/* |
75 |
< |
* locking an unlocked lock succeeds |
74 |
> |
/** |
75 |
> |
* Spin-waits until lock.hasQueuedThread(t) becomes true. |
76 |
|
*/ |
77 |
< |
public void testLock() { |
78 |
< |
ReentrantLock rl = new ReentrantLock(); |
79 |
< |
rl.lock(); |
80 |
< |
assertTrue(rl.isLocked()); |
81 |
< |
rl.unlock(); |
77 |
> |
void waitForQueuedThread(PublicReentrantLock lock, Thread t) { |
78 |
> |
long startTime = System.nanoTime(); |
79 |
> |
while (!lock.hasQueuedThread(t)) { |
80 |
> |
if (millisElapsedSince(startTime) > LONG_DELAY_MS) |
81 |
> |
throw new AssertionError("timed out"); |
82 |
> |
Thread.yield(); |
83 |
> |
} |
84 |
> |
assertTrue(t.isAlive()); |
85 |
> |
assertTrue(lock.getOwner() != t); |
86 |
|
} |
87 |
|
|
88 |
< |
/* |
89 |
< |
* locking an unlocked fair lock succeeds |
88 |
> |
/** |
89 |
> |
* Checks that lock is not locked. |
90 |
|
*/ |
91 |
< |
public void testFairLock() { |
92 |
< |
ReentrantLock rl = new ReentrantLock(true); |
93 |
< |
rl.lock(); |
94 |
< |
assertTrue(rl.isLocked()); |
95 |
< |
rl.unlock(); |
91 |
> |
void assertNotLocked(PublicReentrantLock lock) { |
92 |
> |
assertFalse(lock.isLocked()); |
93 |
> |
assertFalse(lock.isHeldByCurrentThread()); |
94 |
> |
assertNull(lock.getOwner()); |
95 |
> |
assertEquals(0, lock.getHoldCount()); |
96 |
|
} |
97 |
|
|
98 |
< |
/* |
99 |
< |
* Unlocking an unlocked lock throws IllegalMonitorStateException |
98 |
> |
/** |
99 |
> |
* Checks that lock is locked by the given thread. |
100 |
|
*/ |
101 |
< |
public void testUnlock_IllegalMonitorStateException() { |
102 |
< |
ReentrantLock rl = new ReentrantLock(); |
103 |
< |
try { |
104 |
< |
rl.unlock(); |
105 |
< |
shouldThrow(); |
101 |
> |
void assertLockedBy(PublicReentrantLock lock, Thread t) { |
102 |
> |
assertTrue(lock.isLocked()); |
103 |
> |
assertSame(t, lock.getOwner()); |
104 |
> |
assertEquals(t == Thread.currentThread(), |
105 |
> |
lock.isHeldByCurrentThread()); |
106 |
> |
assertEquals(t == Thread.currentThread(), |
107 |
> |
lock.getHoldCount() > 0); |
108 |
> |
} |
109 |
> |
|
110 |
> |
/** |
111 |
> |
* Checks that lock is locked by the current thread. |
112 |
> |
*/ |
113 |
> |
void assertLockedByMoi(PublicReentrantLock lock) { |
114 |
> |
assertLockedBy(lock, Thread.currentThread()); |
115 |
> |
} |
116 |
|
|
117 |
< |
} catch(IllegalMonitorStateException success){} |
117 |
> |
/** |
118 |
> |
* Checks that condition c has no waiters. |
119 |
> |
*/ |
120 |
> |
void assertHasNoWaiters(PublicReentrantLock lock, Condition c) { |
121 |
> |
assertHasWaiters(lock, c, new Thread[] {}); |
122 |
|
} |
123 |
|
|
124 |
< |
/* |
125 |
< |
* trylock on an unlocked lock succeeds |
124 |
> |
/** |
125 |
> |
* Checks that condition c has exactly the given waiter threads. |
126 |
|
*/ |
127 |
< |
public void testTryLock() { |
128 |
< |
ReentrantLock rl = new ReentrantLock(); |
129 |
< |
assertTrue(rl.tryLock()); |
130 |
< |
assertTrue(rl.isLocked()); |
131 |
< |
rl.unlock(); |
127 |
> |
void assertHasWaiters(PublicReentrantLock lock, Condition c, |
128 |
> |
Thread... threads) { |
129 |
> |
lock.lock(); |
130 |
> |
assertEquals(threads.length > 0, lock.hasWaiters(c)); |
131 |
> |
assertEquals(threads.length, lock.getWaitQueueLength(c)); |
132 |
> |
assertEquals(threads.length == 0, lock.getWaitingThreads(c).isEmpty()); |
133 |
> |
assertEquals(threads.length, lock.getWaitingThreads(c).size()); |
134 |
> |
assertEquals(new HashSet<Thread>(lock.getWaitingThreads(c)), |
135 |
> |
new HashSet<Thread>(Arrays.asList(threads))); |
136 |
> |
lock.unlock(); |
137 |
|
} |
138 |
|
|
139 |
+ |
enum AwaitMethod { await, awaitNanos, awaitUntil }; |
140 |
|
|
141 |
< |
/* |
142 |
< |
* getLockQueueLength reports number of waiting threads |
141 |
> |
/** |
142 |
> |
* Awaits condition using the specified AwaitMethod. |
143 |
|
*/ |
144 |
< |
public void testGetLockQueueLength() { |
145 |
< |
final ReentrantLock lock = new ReentrantLock(); |
146 |
< |
Thread t1 = new Thread(new InterruptedLockRunnable(lock)); |
147 |
< |
Thread t2 = new Thread(new InterruptibleLockRunnable(lock)); |
148 |
< |
try { |
149 |
< |
assertEquals(0, lock.getLockQueueLength()); |
150 |
< |
lock.lock(); |
151 |
< |
t1.start(); |
152 |
< |
Thread.sleep(SHORT_DELAY_MS); |
153 |
< |
assertEquals(1, lock.getLockQueueLength()); |
154 |
< |
t2.start(); |
155 |
< |
Thread.sleep(SHORT_DELAY_MS); |
156 |
< |
assertEquals(2, lock.getLockQueueLength()); |
157 |
< |
t1.interrupt(); |
132 |
< |
Thread.sleep(SHORT_DELAY_MS); |
133 |
< |
assertEquals(1, lock.getLockQueueLength()); |
134 |
< |
lock.unlock(); |
135 |
< |
Thread.sleep(SHORT_DELAY_MS); |
136 |
< |
assertEquals(0, lock.getLockQueueLength()); |
137 |
< |
t1.join(); |
138 |
< |
t2.join(); |
139 |
< |
} catch(Exception e){ |
140 |
< |
unexpectedException(); |
144 |
> |
void await(Condition c, AwaitMethod awaitMethod) |
145 |
> |
throws InterruptedException { |
146 |
> |
switch (awaitMethod) { |
147 |
> |
case await: |
148 |
> |
c.await(); |
149 |
> |
break; |
150 |
> |
case awaitNanos: |
151 |
> |
long nanosRemaining = c.awaitNanos(MILLISECONDS.toNanos(2 * LONG_DELAY_MS)); |
152 |
> |
assertTrue(nanosRemaining > 0); |
153 |
> |
break; |
154 |
> |
case awaitUntil: |
155 |
> |
java.util.Date d = new java.util.Date(); |
156 |
> |
assertTrue(c.awaitUntil(new java.util.Date(d.getTime() + 2 * LONG_DELAY_MS))); |
157 |
> |
break; |
158 |
|
} |
159 |
< |
} |
159 |
> |
} |
160 |
|
|
161 |
< |
/* |
162 |
< |
* getQueuedThreads includes waiting threads |
161 |
> |
/** |
162 |
> |
* Constructor sets given fairness, and is in unlocked state |
163 |
|
*/ |
164 |
< |
public void testGetQueuedThreads() { |
165 |
< |
final PublicReentrantLock lock = new PublicReentrantLock(); |
149 |
< |
Thread t1 = new Thread(new InterruptedLockRunnable(lock)); |
150 |
< |
Thread t2 = new Thread(new InterruptibleLockRunnable(lock)); |
151 |
< |
try { |
152 |
< |
assertTrue(lock.getQueuedThreads().isEmpty()); |
153 |
< |
lock.lock(); |
154 |
< |
assertTrue(lock.getQueuedThreads().isEmpty()); |
155 |
< |
t1.start(); |
156 |
< |
Thread.sleep(SHORT_DELAY_MS); |
157 |
< |
assertTrue(lock.getQueuedThreads().contains(t1)); |
158 |
< |
t2.start(); |
159 |
< |
Thread.sleep(SHORT_DELAY_MS); |
160 |
< |
assertTrue(lock.getQueuedThreads().contains(t1)); |
161 |
< |
assertTrue(lock.getQueuedThreads().contains(t2)); |
162 |
< |
t1.interrupt(); |
163 |
< |
Thread.sleep(SHORT_DELAY_MS); |
164 |
< |
assertFalse(lock.getQueuedThreads().contains(t1)); |
165 |
< |
assertTrue(lock.getQueuedThreads().contains(t2)); |
166 |
< |
lock.unlock(); |
167 |
< |
Thread.sleep(SHORT_DELAY_MS); |
168 |
< |
assertTrue(lock.getQueuedThreads().isEmpty()); |
169 |
< |
t1.join(); |
170 |
< |
t2.join(); |
171 |
< |
} catch(Exception e){ |
172 |
< |
unexpectedException(); |
173 |
< |
} |
174 |
< |
} |
164 |
> |
public void testConstructor() { |
165 |
> |
PublicReentrantLock lock; |
166 |
|
|
167 |
+ |
lock = new PublicReentrantLock(); |
168 |
+ |
assertFalse(lock.isFair()); |
169 |
+ |
assertNotLocked(lock); |
170 |
|
|
171 |
< |
/* |
172 |
< |
* timed trylock is interruptible. |
173 |
< |
*/ |
174 |
< |
public void testInterruptedException2() { |
175 |
< |
final ReentrantLock lock = new ReentrantLock(); |
176 |
< |
lock.lock(); |
177 |
< |
Thread t = new Thread(new Runnable() { |
184 |
< |
public void run() { |
185 |
< |
try { |
186 |
< |
lock.tryLock(MEDIUM_DELAY_MS,TimeUnit.MILLISECONDS); |
187 |
< |
threadShouldThrow(); |
188 |
< |
} catch(InterruptedException success){} |
189 |
< |
} |
190 |
< |
}); |
191 |
< |
try { |
192 |
< |
t.start(); |
193 |
< |
t.interrupt(); |
194 |
< |
} catch(Exception e){ |
195 |
< |
unexpectedException(); |
196 |
< |
} |
171 |
> |
lock = new PublicReentrantLock(true); |
172 |
> |
assertTrue(lock.isFair()); |
173 |
> |
assertNotLocked(lock); |
174 |
> |
|
175 |
> |
lock = new PublicReentrantLock(false); |
176 |
> |
assertFalse(lock.isFair()); |
177 |
> |
assertNotLocked(lock); |
178 |
|
} |
179 |
|
|
180 |
+ |
/** |
181 |
+ |
* locking an unlocked lock succeeds |
182 |
+ |
*/ |
183 |
+ |
public void testLock() { testLock(false); } |
184 |
+ |
public void testLock_fair() { testLock(true); } |
185 |
+ |
public void testLock(boolean fair) { |
186 |
+ |
PublicReentrantLock lock = new PublicReentrantLock(fair); |
187 |
+ |
lock.lock(); |
188 |
+ |
assertLockedByMoi(lock); |
189 |
+ |
releaseLock(lock); |
190 |
+ |
} |
191 |
|
|
192 |
|
/** |
193 |
< |
* Trylock on a locked lock fails |
193 |
> |
* Unlocking an unlocked lock throws IllegalMonitorStateException |
194 |
|
*/ |
195 |
< |
public void testTryLockWhenLocked() { |
196 |
< |
final ReentrantLock lock = new ReentrantLock(); |
197 |
< |
lock.lock(); |
198 |
< |
Thread t = new Thread(new Runnable() { |
207 |
< |
public void run() { |
208 |
< |
threadAssertFalse(lock.tryLock()); |
209 |
< |
} |
210 |
< |
}); |
195 |
> |
public void testUnlock_IMSE() { testUnlock_IMSE(false); } |
196 |
> |
public void testUnlock_IMSE_fair() { testUnlock_IMSE(true); } |
197 |
> |
public void testUnlock_IMSE(boolean fair) { |
198 |
> |
ReentrantLock lock = new ReentrantLock(fair); |
199 |
|
try { |
212 |
– |
t.start(); |
213 |
– |
t.join(); |
200 |
|
lock.unlock(); |
201 |
< |
} catch(Exception e){ |
202 |
< |
unexpectedException(); |
203 |
< |
} |
218 |
< |
} |
201 |
> |
shouldThrow(); |
202 |
> |
} catch (IllegalMonitorStateException success) {} |
203 |
> |
} |
204 |
|
|
205 |
|
/** |
206 |
< |
* Timed trylock on a locked lock times out |
206 |
> |
* tryLock on an unlocked lock succeeds |
207 |
|
*/ |
208 |
< |
public void testTryLock_Timeout() { |
209 |
< |
final ReentrantLock lock = new ReentrantLock(); |
210 |
< |
lock.lock(); |
211 |
< |
Thread t = new Thread(new Runnable() { |
212 |
< |
public void run() { |
213 |
< |
try { |
214 |
< |
threadAssertFalse(lock.tryLock(1, TimeUnit.MILLISECONDS)); |
215 |
< |
} catch (Exception ex) { |
216 |
< |
threadUnexpectedException(); |
217 |
< |
} |
218 |
< |
} |
219 |
< |
}); |
208 |
> |
public void testTryLock() { testTryLock(false); } |
209 |
> |
public void testTryLock_fair() { testTryLock(true); } |
210 |
> |
public void testTryLock(boolean fair) { |
211 |
> |
PublicReentrantLock lock = new PublicReentrantLock(fair); |
212 |
> |
assertTrue(lock.tryLock()); |
213 |
> |
assertLockedByMoi(lock); |
214 |
> |
assertTrue(lock.tryLock()); |
215 |
> |
assertLockedByMoi(lock); |
216 |
> |
lock.unlock(); |
217 |
> |
releaseLock(lock); |
218 |
> |
} |
219 |
> |
|
220 |
> |
/** |
221 |
> |
* hasQueuedThreads reports whether there are waiting threads |
222 |
> |
*/ |
223 |
> |
public void testHasQueuedThreads() { testHasQueuedThreads(false); } |
224 |
> |
public void testHasQueuedThreads_fair() { testHasQueuedThreads(true); } |
225 |
> |
public void testHasQueuedThreads(boolean fair) { |
226 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
227 |
> |
Thread t1 = new Thread(new InterruptedLockRunnable(lock)); |
228 |
> |
Thread t2 = new Thread(new InterruptibleLockRunnable(lock)); |
229 |
> |
assertFalse(lock.hasQueuedThreads()); |
230 |
> |
lock.lock(); |
231 |
> |
assertFalse(lock.hasQueuedThreads()); |
232 |
> |
t1.start(); |
233 |
> |
waitForQueuedThread(lock, t1); |
234 |
> |
assertTrue(lock.hasQueuedThreads()); |
235 |
> |
t2.start(); |
236 |
> |
waitForQueuedThread(lock, t2); |
237 |
> |
assertTrue(lock.hasQueuedThreads()); |
238 |
> |
t1.interrupt(); |
239 |
> |
awaitTermination(t1); |
240 |
> |
assertTrue(lock.hasQueuedThreads()); |
241 |
> |
lock.unlock(); |
242 |
> |
awaitTermination(t2); |
243 |
> |
assertFalse(lock.hasQueuedThreads()); |
244 |
> |
} |
245 |
> |
|
246 |
> |
/** |
247 |
> |
* getQueueLength reports number of waiting threads |
248 |
> |
*/ |
249 |
> |
public void testGetQueueLength() { testGetQueueLength(false); } |
250 |
> |
public void testGetQueueLength_fair() { testGetQueueLength(true); } |
251 |
> |
public void testGetQueueLength(boolean fair) { |
252 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
253 |
> |
Thread t1 = new Thread(new InterruptedLockRunnable(lock)); |
254 |
> |
Thread t2 = new Thread(new InterruptibleLockRunnable(lock)); |
255 |
> |
assertEquals(0, lock.getQueueLength()); |
256 |
> |
lock.lock(); |
257 |
> |
t1.start(); |
258 |
> |
waitForQueuedThread(lock, t1); |
259 |
> |
assertEquals(1, lock.getQueueLength()); |
260 |
> |
t2.start(); |
261 |
> |
waitForQueuedThread(lock, t2); |
262 |
> |
assertEquals(2, lock.getQueueLength()); |
263 |
> |
t1.interrupt(); |
264 |
> |
awaitTermination(t1); |
265 |
> |
assertEquals(1, lock.getQueueLength()); |
266 |
> |
lock.unlock(); |
267 |
> |
awaitTermination(t2); |
268 |
> |
assertEquals(0, lock.getQueueLength()); |
269 |
> |
} |
270 |
> |
|
271 |
> |
/** |
272 |
> |
* hasQueuedThread(null) throws NPE |
273 |
> |
*/ |
274 |
> |
public void testHasQueuedThreadNPE() { testHasQueuedThreadNPE(false); } |
275 |
> |
public void testHasQueuedThreadNPE_fair() { testHasQueuedThreadNPE(true); } |
276 |
> |
public void testHasQueuedThreadNPE(boolean fair) { |
277 |
> |
final ReentrantLock lock = new ReentrantLock(fair); |
278 |
|
try { |
279 |
< |
t.start(); |
280 |
< |
t.join(); |
281 |
< |
lock.unlock(); |
282 |
< |
} catch(Exception e){ |
283 |
< |
unexpectedException(); |
241 |
< |
} |
242 |
< |
} |
243 |
< |
|
279 |
> |
lock.hasQueuedThread(null); |
280 |
> |
shouldThrow(); |
281 |
> |
} catch (NullPointerException success) {} |
282 |
> |
} |
283 |
> |
|
284 |
|
/** |
285 |
< |
* getHoldCount returns number of recursive holds |
285 |
> |
* hasQueuedThread reports whether a thread is queued. |
286 |
|
*/ |
287 |
< |
public void testGetHoldCount() { |
288 |
< |
ReentrantLock lock = new ReentrantLock(); |
289 |
< |
for(int i = 1; i <= SIZE; i++) { |
290 |
< |
lock.lock(); |
291 |
< |
assertEquals(i,lock.getHoldCount()); |
292 |
< |
} |
293 |
< |
for(int i = SIZE; i > 0; i--) { |
294 |
< |
lock.unlock(); |
295 |
< |
assertEquals(i-1,lock.getHoldCount()); |
296 |
< |
} |
287 |
> |
public void testHasQueuedThread() { testHasQueuedThread(false); } |
288 |
> |
public void testHasQueuedThread_fair() { testHasQueuedThread(true); } |
289 |
> |
public void testHasQueuedThread(boolean fair) { |
290 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
291 |
> |
Thread t1 = new Thread(new InterruptedLockRunnable(lock)); |
292 |
> |
Thread t2 = new Thread(new InterruptibleLockRunnable(lock)); |
293 |
> |
assertFalse(lock.hasQueuedThread(t1)); |
294 |
> |
assertFalse(lock.hasQueuedThread(t2)); |
295 |
> |
lock.lock(); |
296 |
> |
t1.start(); |
297 |
> |
waitForQueuedThread(lock, t1); |
298 |
> |
assertTrue(lock.hasQueuedThread(t1)); |
299 |
> |
assertFalse(lock.hasQueuedThread(t2)); |
300 |
> |
t2.start(); |
301 |
> |
waitForQueuedThread(lock, t2); |
302 |
> |
assertTrue(lock.hasQueuedThread(t1)); |
303 |
> |
assertTrue(lock.hasQueuedThread(t2)); |
304 |
> |
t1.interrupt(); |
305 |
> |
awaitTermination(t1); |
306 |
> |
assertFalse(lock.hasQueuedThread(t1)); |
307 |
> |
assertTrue(lock.hasQueuedThread(t2)); |
308 |
> |
lock.unlock(); |
309 |
> |
awaitTermination(t2); |
310 |
> |
assertFalse(lock.hasQueuedThread(t1)); |
311 |
> |
assertFalse(lock.hasQueuedThread(t2)); |
312 |
|
} |
313 |
< |
|
259 |
< |
|
313 |
> |
|
314 |
|
/** |
315 |
< |
* isLocked is true when locked and false when not |
315 |
> |
* getQueuedThreads includes waiting threads |
316 |
|
*/ |
317 |
< |
public void testIsLocked() { |
318 |
< |
final ReentrantLock lock = new ReentrantLock(); |
319 |
< |
lock.lock(); |
320 |
< |
assertTrue(lock.isLocked()); |
321 |
< |
lock.unlock(); |
322 |
< |
assertFalse(lock.isLocked()); |
323 |
< |
Thread t = new Thread(new Runnable() { |
324 |
< |
public void run() { |
325 |
< |
lock.lock(); |
326 |
< |
try { |
327 |
< |
Thread.sleep(SMALL_DELAY_MS); |
328 |
< |
} |
329 |
< |
catch(Exception e) { |
330 |
< |
threadUnexpectedException(); |
331 |
< |
} |
332 |
< |
lock.unlock(); |
333 |
< |
} |
334 |
< |
}); |
335 |
< |
try { |
336 |
< |
t.start(); |
337 |
< |
Thread.sleep(SHORT_DELAY_MS); |
338 |
< |
assertTrue(lock.isLocked()); |
339 |
< |
t.join(); |
340 |
< |
assertFalse(lock.isLocked()); |
341 |
< |
} catch(Exception e){ |
342 |
< |
unexpectedException(); |
343 |
< |
} |
317 |
> |
public void testGetQueuedThreads() { testGetQueuedThreads(false); } |
318 |
> |
public void testGetQueuedThreads_fair() { testGetQueuedThreads(true); } |
319 |
> |
public void testGetQueuedThreads(boolean fair) { |
320 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
321 |
> |
Thread t1 = new Thread(new InterruptedLockRunnable(lock)); |
322 |
> |
Thread t2 = new Thread(new InterruptibleLockRunnable(lock)); |
323 |
> |
assertTrue(lock.getQueuedThreads().isEmpty()); |
324 |
> |
lock.lock(); |
325 |
> |
assertTrue(lock.getQueuedThreads().isEmpty()); |
326 |
> |
t1.start(); |
327 |
> |
waitForQueuedThread(lock, t1); |
328 |
> |
assertEquals(1, lock.getQueuedThreads().size()); |
329 |
> |
assertTrue(lock.getQueuedThreads().contains(t1)); |
330 |
> |
t2.start(); |
331 |
> |
waitForQueuedThread(lock, t2); |
332 |
> |
assertEquals(2, lock.getQueuedThreads().size()); |
333 |
> |
assertTrue(lock.getQueuedThreads().contains(t1)); |
334 |
> |
assertTrue(lock.getQueuedThreads().contains(t2)); |
335 |
> |
t1.interrupt(); |
336 |
> |
awaitTermination(t1); |
337 |
> |
assertFalse(lock.getQueuedThreads().contains(t1)); |
338 |
> |
assertTrue(lock.getQueuedThreads().contains(t2)); |
339 |
> |
assertEquals(1, lock.getQueuedThreads().size()); |
340 |
> |
lock.unlock(); |
341 |
> |
awaitTermination(t2); |
342 |
> |
assertTrue(lock.getQueuedThreads().isEmpty()); |
343 |
> |
} |
344 |
> |
|
345 |
> |
/** |
346 |
> |
* timed tryLock is interruptible. |
347 |
> |
*/ |
348 |
> |
public void testTryLock_Interruptible() { testTryLock_Interruptible(false); } |
349 |
> |
public void testTryLock_Interruptible_fair() { testTryLock_Interruptible(true); } |
350 |
> |
public void testTryLock_Interruptible(boolean fair) { |
351 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
352 |
> |
lock.lock(); |
353 |
> |
Thread t = newStartedThread(new CheckedInterruptedRunnable() { |
354 |
> |
public void realRun() throws InterruptedException { |
355 |
> |
lock.tryLock(2 * LONG_DELAY_MS, MILLISECONDS); |
356 |
> |
}}); |
357 |
> |
|
358 |
> |
waitForQueuedThread(lock, t); |
359 |
> |
t.interrupt(); |
360 |
> |
awaitTermination(t); |
361 |
> |
releaseLock(lock); |
362 |
> |
} |
363 |
> |
|
364 |
> |
/** |
365 |
> |
* tryLock on a locked lock fails |
366 |
> |
*/ |
367 |
> |
public void testTryLockWhenLocked() { testTryLockWhenLocked(false); } |
368 |
> |
public void testTryLockWhenLocked_fair() { testTryLockWhenLocked(true); } |
369 |
> |
public void testTryLockWhenLocked(boolean fair) { |
370 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
371 |
> |
lock.lock(); |
372 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
373 |
> |
public void realRun() { |
374 |
> |
assertFalse(lock.tryLock()); |
375 |
> |
}}); |
376 |
> |
|
377 |
> |
awaitTermination(t); |
378 |
> |
releaseLock(lock); |
379 |
> |
} |
380 |
> |
|
381 |
> |
/** |
382 |
> |
* Timed tryLock on a locked lock times out |
383 |
> |
*/ |
384 |
> |
public void testTryLock_Timeout() { testTryLock_Timeout(false); } |
385 |
> |
public void testTryLock_Timeout_fair() { testTryLock_Timeout(true); } |
386 |
> |
public void testTryLock_Timeout(boolean fair) { |
387 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
388 |
> |
lock.lock(); |
389 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
390 |
> |
public void realRun() throws InterruptedException { |
391 |
> |
long startTime = System.nanoTime(); |
392 |
> |
long timeoutMillis = 10; |
393 |
> |
assertFalse(lock.tryLock(timeoutMillis, MILLISECONDS)); |
394 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
395 |
> |
}}); |
396 |
> |
|
397 |
> |
awaitTermination(t); |
398 |
> |
releaseLock(lock); |
399 |
|
} |
400 |
|
|
401 |
+ |
/** |
402 |
+ |
* getHoldCount returns number of recursive holds |
403 |
+ |
*/ |
404 |
+ |
public void testGetHoldCount() { testGetHoldCount(false); } |
405 |
+ |
public void testGetHoldCount_fair() { testGetHoldCount(true); } |
406 |
+ |
public void testGetHoldCount(boolean fair) { |
407 |
+ |
ReentrantLock lock = new ReentrantLock(fair); |
408 |
+ |
for (int i = 1; i <= SIZE; i++) { |
409 |
+ |
lock.lock(); |
410 |
+ |
assertEquals(i, lock.getHoldCount()); |
411 |
+ |
} |
412 |
+ |
for (int i = SIZE; i > 0; i--) { |
413 |
+ |
lock.unlock(); |
414 |
+ |
assertEquals(i-1, lock.getHoldCount()); |
415 |
+ |
} |
416 |
+ |
} |
417 |
|
|
418 |
< |
/* |
419 |
< |
* lockInterruptibly is interruptible. |
418 |
> |
/** |
419 |
> |
* isLocked is true when locked and false when not |
420 |
|
*/ |
421 |
< |
public void testLockInterruptibly1() { |
422 |
< |
final ReentrantLock lock = new ReentrantLock(); |
423 |
< |
lock.lock(); |
299 |
< |
Thread t = new Thread(new InterruptedLockRunnable(lock)); |
421 |
> |
public void testIsLocked() { testIsLocked(false); } |
422 |
> |
public void testIsLocked_fair() { testIsLocked(true); } |
423 |
> |
public void testIsLocked(boolean fair) { |
424 |
|
try { |
425 |
< |
t.start(); |
426 |
< |
t.interrupt(); |
425 |
> |
final ReentrantLock lock = new ReentrantLock(fair); |
426 |
> |
assertFalse(lock.isLocked()); |
427 |
> |
lock.lock(); |
428 |
> |
assertTrue(lock.isLocked()); |
429 |
> |
lock.lock(); |
430 |
> |
assertTrue(lock.isLocked()); |
431 |
|
lock.unlock(); |
432 |
< |
t.join(); |
433 |
< |
} catch(Exception e){ |
434 |
< |
unexpectedException(); |
432 |
> |
assertTrue(lock.isLocked()); |
433 |
> |
lock.unlock(); |
434 |
> |
assertFalse(lock.isLocked()); |
435 |
> |
final CyclicBarrier barrier = new CyclicBarrier(2); |
436 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
437 |
> |
public void realRun() throws Exception { |
438 |
> |
lock.lock(); |
439 |
> |
assertTrue(lock.isLocked()); |
440 |
> |
barrier.await(); |
441 |
> |
barrier.await(); |
442 |
> |
lock.unlock(); |
443 |
> |
}}); |
444 |
> |
|
445 |
> |
barrier.await(); |
446 |
> |
assertTrue(lock.isLocked()); |
447 |
> |
barrier.await(); |
448 |
> |
awaitTermination(t); |
449 |
> |
assertFalse(lock.isLocked()); |
450 |
> |
} catch (Exception e) { |
451 |
> |
threadUnexpectedException(e); |
452 |
|
} |
453 |
< |
} |
453 |
> |
} |
454 |
|
|
455 |
|
/** |
456 |
|
* lockInterruptibly succeeds when unlocked, else is interruptible |
457 |
|
*/ |
458 |
< |
public void testLockInterruptibly2() { |
459 |
< |
final ReentrantLock lock = new ReentrantLock(); |
460 |
< |
try { |
461 |
< |
lock.lockInterruptibly(); |
317 |
< |
} catch(Exception e) { |
318 |
< |
unexpectedException(); |
319 |
< |
} |
320 |
< |
Thread t = new Thread(new InterruptedLockRunnable(lock)); |
458 |
> |
public void testLockInterruptibly() { testLockInterruptibly(false); } |
459 |
> |
public void testLockInterruptibly_fair() { testLockInterruptibly(true); } |
460 |
> |
public void testLockInterruptibly(boolean fair) { |
461 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
462 |
|
try { |
463 |
< |
t.start(); |
464 |
< |
t.interrupt(); |
465 |
< |
assertTrue(lock.isLocked()); |
325 |
< |
assertTrue(lock.isHeldByCurrentThread()); |
326 |
< |
t.join(); |
327 |
< |
} catch(Exception e){ |
328 |
< |
unexpectedException(); |
463 |
> |
lock.lockInterruptibly(); |
464 |
> |
} catch (InterruptedException ie) { |
465 |
> |
threadUnexpectedException(ie); |
466 |
|
} |
467 |
+ |
assertLockedByMoi(lock); |
468 |
+ |
Thread t = newStartedThread(new InterruptedLockRunnable(lock)); |
469 |
+ |
waitForQueuedThread(lock, t); |
470 |
+ |
t.interrupt(); |
471 |
+ |
assertTrue(lock.isLocked()); |
472 |
+ |
assertTrue(lock.isHeldByCurrentThread()); |
473 |
+ |
awaitTermination(t); |
474 |
+ |
releaseLock(lock); |
475 |
|
} |
476 |
|
|
477 |
|
/** |
478 |
|
* Calling await without holding lock throws IllegalMonitorStateException |
479 |
|
*/ |
480 |
< |
public void testAwait_IllegalMonitor() { |
481 |
< |
final ReentrantLock lock = new ReentrantLock(); |
480 |
> |
public void testAwait_IMSE() { testAwait_IMSE(false); } |
481 |
> |
public void testAwait_IMSE_fair() { testAwait_IMSE(true); } |
482 |
> |
public void testAwait_IMSE(boolean fair) { |
483 |
> |
final ReentrantLock lock = new ReentrantLock(fair); |
484 |
|
final Condition c = lock.newCondition(); |
485 |
+ |
long startTime = System.nanoTime(); |
486 |
|
try { |
487 |
< |
c.await(); |
488 |
< |
shouldThrow(); |
489 |
< |
} |
490 |
< |
catch (IllegalMonitorStateException success) { |
491 |
< |
} |
492 |
< |
catch (Exception ex) { |
493 |
< |
unexpectedException(); |
487 |
> |
try { |
488 |
> |
c.await(); |
489 |
> |
shouldThrow(); |
490 |
> |
} catch (IllegalMonitorStateException success) {} |
491 |
> |
try { |
492 |
> |
c.await(LONG_DELAY_MS, MILLISECONDS); |
493 |
> |
shouldThrow(); |
494 |
> |
} catch (IllegalMonitorStateException success) {} |
495 |
> |
try { |
496 |
> |
c.awaitNanos(MILLISECONDS.toNanos(LONG_DELAY_MS)); |
497 |
> |
shouldThrow(); |
498 |
> |
} catch (IllegalMonitorStateException success) {} |
499 |
> |
try { |
500 |
> |
c.awaitUninterruptibly(); |
501 |
> |
shouldThrow(); |
502 |
> |
} catch (IllegalMonitorStateException success) {} |
503 |
> |
} catch (InterruptedException ie) { |
504 |
> |
threadUnexpectedException(ie); |
505 |
|
} |
506 |
+ |
assertTrue(millisElapsedSince(startTime) < MEDIUM_DELAY_MS); |
507 |
|
} |
508 |
|
|
509 |
|
/** |
510 |
|
* Calling signal without holding lock throws IllegalMonitorStateException |
511 |
|
*/ |
512 |
< |
public void testSignal_IllegalMonitor() { |
513 |
< |
final ReentrantLock lock = new ReentrantLock(); |
512 |
> |
public void testSignal_IMSE() { testSignal_IMSE(false); } |
513 |
> |
public void testSignal_IMSE_fair() { testSignal_IMSE(true); } |
514 |
> |
public void testSignal_IMSE(boolean fair) { |
515 |
> |
final ReentrantLock lock = new ReentrantLock(fair); |
516 |
|
final Condition c = lock.newCondition(); |
517 |
|
try { |
518 |
|
c.signal(); |
519 |
|
shouldThrow(); |
520 |
< |
} |
359 |
< |
catch (IllegalMonitorStateException success) { |
360 |
< |
} |
361 |
< |
catch (Exception ex) { |
362 |
< |
unexpectedException(); |
363 |
< |
} |
520 |
> |
} catch (IllegalMonitorStateException success) {} |
521 |
|
} |
522 |
|
|
523 |
|
/** |
524 |
|
* awaitNanos without a signal times out |
525 |
|
*/ |
526 |
< |
public void testAwaitNanos_Timeout() { |
527 |
< |
final ReentrantLock lock = new ReentrantLock(); |
528 |
< |
final Condition c = lock.newCondition(); |
526 |
> |
public void testAwaitNanos_Timeout() { testAwaitNanos_Timeout(false); } |
527 |
> |
public void testAwaitNanos_Timeout_fair() { testAwaitNanos_Timeout(true); } |
528 |
> |
public void testAwaitNanos_Timeout(boolean fair) { |
529 |
|
try { |
530 |
+ |
final ReentrantLock lock = new ReentrantLock(fair); |
531 |
+ |
final Condition c = lock.newCondition(); |
532 |
|
lock.lock(); |
533 |
< |
long t = c.awaitNanos(100); |
534 |
< |
assertTrue(t <= 0); |
533 |
> |
long startTime = System.nanoTime(); |
534 |
> |
long timeoutMillis = 10; |
535 |
> |
long timeoutNanos = MILLISECONDS.toNanos(timeoutMillis); |
536 |
> |
long nanosRemaining = c.awaitNanos(timeoutNanos); |
537 |
> |
assertTrue(nanosRemaining <= 0); |
538 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
539 |
|
lock.unlock(); |
540 |
< |
} |
541 |
< |
catch (Exception ex) { |
379 |
< |
unexpectedException(); |
540 |
> |
} catch (InterruptedException e) { |
541 |
> |
threadUnexpectedException(e); |
542 |
|
} |
543 |
|
} |
544 |
|
|
545 |
|
/** |
546 |
< |
* timed await without a signal times out |
546 |
> |
* timed await without a signal times out |
547 |
|
*/ |
548 |
< |
public void testAwait_Timeout() { |
549 |
< |
final ReentrantLock lock = new ReentrantLock(); |
550 |
< |
final Condition c = lock.newCondition(); |
548 |
> |
public void testAwait_Timeout() { testAwait_Timeout(false); } |
549 |
> |
public void testAwait_Timeout_fair() { testAwait_Timeout(true); } |
550 |
> |
public void testAwait_Timeout(boolean fair) { |
551 |
|
try { |
552 |
+ |
final ReentrantLock lock = new ReentrantLock(fair); |
553 |
+ |
final Condition c = lock.newCondition(); |
554 |
|
lock.lock(); |
555 |
< |
assertFalse(c.await(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
555 |
> |
long startTime = System.nanoTime(); |
556 |
> |
long timeoutMillis = 10; |
557 |
> |
assertFalse(c.await(timeoutMillis, MILLISECONDS)); |
558 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
559 |
|
lock.unlock(); |
560 |
< |
} |
561 |
< |
catch (Exception ex) { |
395 |
< |
unexpectedException(); |
560 |
> |
} catch (InterruptedException e) { |
561 |
> |
threadUnexpectedException(e); |
562 |
|
} |
563 |
|
} |
564 |
|
|
565 |
|
/** |
566 |
|
* awaitUntil without a signal times out |
567 |
|
*/ |
568 |
< |
public void testAwaitUntil_Timeout() { |
569 |
< |
final ReentrantLock lock = new ReentrantLock(); |
570 |
< |
final Condition c = lock.newCondition(); |
568 |
> |
public void testAwaitUntil_Timeout() { testAwaitUntil_Timeout(false); } |
569 |
> |
public void testAwaitUntil_Timeout_fair() { testAwaitUntil_Timeout(true); } |
570 |
> |
public void testAwaitUntil_Timeout(boolean fair) { |
571 |
|
try { |
572 |
+ |
final ReentrantLock lock = new ReentrantLock(fair); |
573 |
+ |
final Condition c = lock.newCondition(); |
574 |
|
lock.lock(); |
575 |
+ |
long startTime = System.nanoTime(); |
576 |
+ |
long timeoutMillis = 10; |
577 |
|
java.util.Date d = new java.util.Date(); |
578 |
< |
assertFalse(c.awaitUntil(new java.util.Date(d.getTime() + 10))); |
578 |
> |
assertFalse(c.awaitUntil(new java.util.Date(d.getTime() + timeoutMillis))); |
579 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis); |
580 |
|
lock.unlock(); |
581 |
< |
} |
582 |
< |
catch (Exception ex) { |
412 |
< |
unexpectedException(); |
581 |
> |
} catch (InterruptedException e) { |
582 |
> |
threadUnexpectedException(e); |
583 |
|
} |
584 |
|
} |
585 |
|
|
586 |
|
/** |
587 |
|
* await returns when signalled |
588 |
|
*/ |
589 |
< |
public void testAwait() { |
590 |
< |
final ReentrantLock lock = new ReentrantLock(); |
591 |
< |
final ReentrantLock.ConditionObject c = lock.newCondition(); |
592 |
< |
Thread t = new Thread(new Runnable() { |
593 |
< |
public void run() { |
594 |
< |
try { |
595 |
< |
lock.lock(); |
596 |
< |
c.await(); |
597 |
< |
lock.unlock(); |
598 |
< |
} |
599 |
< |
catch(InterruptedException e) { |
600 |
< |
threadUnexpectedException(); |
601 |
< |
} |
602 |
< |
} |
603 |
< |
}); |
589 |
> |
public void testAwait() { testAwait(false); } |
590 |
> |
public void testAwait_fair() { testAwait(true); } |
591 |
> |
public void testAwait(boolean fair) { |
592 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
593 |
> |
final Condition c = lock.newCondition(); |
594 |
> |
final CountDownLatch locked = new CountDownLatch(1); |
595 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
596 |
> |
public void realRun() throws InterruptedException { |
597 |
> |
lock.lock(); |
598 |
> |
locked.countDown(); |
599 |
> |
c.await(); |
600 |
> |
lock.unlock(); |
601 |
> |
}}); |
602 |
> |
|
603 |
> |
await(locked); |
604 |
> |
lock.lock(); |
605 |
> |
assertHasWaiters(lock, c, t); |
606 |
> |
c.signal(); |
607 |
> |
assertHasNoWaiters(lock, c); |
608 |
> |
assertTrue(t.isAlive()); |
609 |
> |
lock.unlock(); |
610 |
> |
awaitTermination(t); |
611 |
> |
} |
612 |
|
|
613 |
+ |
/** |
614 |
+ |
* hasWaiters throws NPE if null |
615 |
+ |
*/ |
616 |
+ |
public void testHasWaitersNPE() { testHasWaitersNPE(false); } |
617 |
+ |
public void testHasWaitersNPE_fair() { testHasWaitersNPE(true); } |
618 |
+ |
public void testHasWaitersNPE(boolean fair) { |
619 |
+ |
final ReentrantLock lock = new ReentrantLock(fair); |
620 |
|
try { |
621 |
< |
t.start(); |
622 |
< |
Thread.sleep(SHORT_DELAY_MS); |
623 |
< |
lock.lock(); |
439 |
< |
c.signal(); |
440 |
< |
lock.unlock(); |
441 |
< |
t.join(SHORT_DELAY_MS); |
442 |
< |
assertFalse(t.isAlive()); |
443 |
< |
} |
444 |
< |
catch (Exception ex) { |
445 |
< |
unexpectedException(); |
446 |
< |
} |
621 |
> |
lock.hasWaiters(null); |
622 |
> |
shouldThrow(); |
623 |
> |
} catch (NullPointerException success) {} |
624 |
|
} |
625 |
|
|
626 |
|
/** |
627 |
< |
* hasWaiters returns true when a thread is waiting, else false |
627 |
> |
* getWaitQueueLength throws NPE if null |
628 |
|
*/ |
629 |
< |
public void testHasWaiters() { |
630 |
< |
final ReentrantLock lock = new ReentrantLock(); |
631 |
< |
final ReentrantLock.ConditionObject c = lock.newCondition(); |
632 |
< |
Thread t = new Thread(new Runnable() { |
633 |
< |
public void run() { |
634 |
< |
try { |
635 |
< |
lock.lock(); |
636 |
< |
threadAssertFalse(c.hasWaiters()); |
637 |
< |
threadAssertEquals(0, c.getWaitQueueLength()); |
461 |
< |
c.await(); |
462 |
< |
lock.unlock(); |
463 |
< |
} |
464 |
< |
catch(InterruptedException e) { |
465 |
< |
threadUnexpectedException(); |
466 |
< |
} |
467 |
< |
} |
468 |
< |
}); |
629 |
> |
public void testGetWaitQueueLengthNPE() { testGetWaitQueueLengthNPE(false); } |
630 |
> |
public void testGetWaitQueueLengthNPE_fair() { testGetWaitQueueLengthNPE(true); } |
631 |
> |
public void testGetWaitQueueLengthNPE(boolean fair) { |
632 |
> |
final ReentrantLock lock = new ReentrantLock(fair); |
633 |
> |
try { |
634 |
> |
lock.getWaitQueueLength(null); |
635 |
> |
shouldThrow(); |
636 |
> |
} catch (NullPointerException success) {} |
637 |
> |
} |
638 |
|
|
639 |
+ |
/** |
640 |
+ |
* getWaitingThreads throws NPE if null |
641 |
+ |
*/ |
642 |
+ |
public void testGetWaitingThreadsNPE() { testGetWaitingThreadsNPE(false); } |
643 |
+ |
public void testGetWaitingThreadsNPE_fair() { testGetWaitingThreadsNPE(true); } |
644 |
+ |
public void testGetWaitingThreadsNPE(boolean fair) { |
645 |
+ |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
646 |
|
try { |
647 |
< |
t.start(); |
648 |
< |
Thread.sleep(SHORT_DELAY_MS); |
649 |
< |
lock.lock(); |
474 |
< |
assertTrue(c.hasWaiters()); |
475 |
< |
assertEquals(1, c.getWaitQueueLength()); |
476 |
< |
c.signal(); |
477 |
< |
lock.unlock(); |
478 |
< |
Thread.sleep(SHORT_DELAY_MS); |
479 |
< |
lock.lock(); |
480 |
< |
assertFalse(c.hasWaiters()); |
481 |
< |
assertEquals(0, c.getWaitQueueLength()); |
482 |
< |
lock.unlock(); |
483 |
< |
t.join(SHORT_DELAY_MS); |
484 |
< |
assertFalse(t.isAlive()); |
485 |
< |
} |
486 |
< |
catch (Exception ex) { |
487 |
< |
unexpectedException(); |
488 |
< |
} |
647 |
> |
lock.getWaitingThreads(null); |
648 |
> |
shouldThrow(); |
649 |
> |
} catch (NullPointerException success) {} |
650 |
|
} |
651 |
|
|
652 |
|
/** |
653 |
< |
* getWaitQueueLength returns number of waiting threads |
653 |
> |
* hasWaiters throws IllegalArgumentException if not owned |
654 |
|
*/ |
655 |
< |
public void testGetWaitQueueLength() { |
656 |
< |
final ReentrantLock lock = new ReentrantLock(); |
657 |
< |
final ReentrantLock.ConditionObject c = lock.newCondition(); |
658 |
< |
Thread t1 = new Thread(new Runnable() { |
659 |
< |
public void run() { |
660 |
< |
try { |
661 |
< |
lock.lock(); |
662 |
< |
threadAssertFalse(c.hasWaiters()); |
663 |
< |
threadAssertEquals(0, c.getWaitQueueLength()); |
664 |
< |
c.await(); |
665 |
< |
lock.unlock(); |
505 |
< |
} |
506 |
< |
catch(InterruptedException e) { |
507 |
< |
threadUnexpectedException(); |
508 |
< |
} |
509 |
< |
} |
510 |
< |
}); |
511 |
< |
|
512 |
< |
Thread t2 = new Thread(new Runnable() { |
513 |
< |
public void run() { |
514 |
< |
try { |
515 |
< |
lock.lock(); |
516 |
< |
threadAssertTrue(c.hasWaiters()); |
517 |
< |
threadAssertEquals(1, c.getWaitQueueLength()); |
518 |
< |
c.await(); |
519 |
< |
lock.unlock(); |
520 |
< |
} |
521 |
< |
catch(InterruptedException e) { |
522 |
< |
threadUnexpectedException(); |
523 |
< |
} |
524 |
< |
} |
525 |
< |
}); |
655 |
> |
public void testHasWaitersIAE() { testHasWaitersIAE(false); } |
656 |
> |
public void testHasWaitersIAE_fair() { testHasWaitersIAE(true); } |
657 |
> |
public void testHasWaitersIAE(boolean fair) { |
658 |
> |
final ReentrantLock lock = new ReentrantLock(fair); |
659 |
> |
final Condition c = lock.newCondition(); |
660 |
> |
final ReentrantLock lock2 = new ReentrantLock(fair); |
661 |
> |
try { |
662 |
> |
lock2.hasWaiters(c); |
663 |
> |
shouldThrow(); |
664 |
> |
} catch (IllegalArgumentException success) {} |
665 |
> |
} |
666 |
|
|
667 |
+ |
/** |
668 |
+ |
* hasWaiters throws IllegalMonitorStateException if not locked |
669 |
+ |
*/ |
670 |
+ |
public void testHasWaitersIMSE() { testHasWaitersIMSE(false); } |
671 |
+ |
public void testHasWaitersIMSE_fair() { testHasWaitersIMSE(true); } |
672 |
+ |
public void testHasWaitersIMSE(boolean fair) { |
673 |
+ |
final ReentrantLock lock = new ReentrantLock(fair); |
674 |
+ |
final Condition c = lock.newCondition(); |
675 |
|
try { |
676 |
< |
t1.start(); |
677 |
< |
Thread.sleep(SHORT_DELAY_MS); |
678 |
< |
t2.start(); |
531 |
< |
Thread.sleep(SHORT_DELAY_MS); |
532 |
< |
lock.lock(); |
533 |
< |
assertTrue(c.hasWaiters()); |
534 |
< |
assertEquals(2, c.getWaitQueueLength()); |
535 |
< |
c.signalAll(); |
536 |
< |
lock.unlock(); |
537 |
< |
Thread.sleep(SHORT_DELAY_MS); |
538 |
< |
lock.lock(); |
539 |
< |
assertFalse(c.hasWaiters()); |
540 |
< |
assertEquals(0, c.getWaitQueueLength()); |
541 |
< |
lock.unlock(); |
542 |
< |
t1.join(SHORT_DELAY_MS); |
543 |
< |
t2.join(SHORT_DELAY_MS); |
544 |
< |
assertFalse(t1.isAlive()); |
545 |
< |
assertFalse(t2.isAlive()); |
546 |
< |
} |
547 |
< |
catch (Exception ex) { |
548 |
< |
unexpectedException(); |
549 |
< |
} |
676 |
> |
lock.hasWaiters(c); |
677 |
> |
shouldThrow(); |
678 |
> |
} catch (IllegalMonitorStateException success) {} |
679 |
|
} |
680 |
|
|
681 |
|
/** |
682 |
< |
* getWaitingThreads returns only and all waiting threads |
682 |
> |
* getWaitQueueLength throws IllegalArgumentException if not owned |
683 |
|
*/ |
684 |
< |
public void testGetWaitingThreads() { |
685 |
< |
final PublicReentrantLock lock = new PublicReentrantLock(); |
686 |
< |
final PublicReentrantLock.PublicCondition c = (PublicReentrantLock.PublicCondition)lock.newCondition(); |
687 |
< |
Thread t1 = new Thread(new Runnable() { |
688 |
< |
public void run() { |
689 |
< |
try { |
690 |
< |
lock.lock(); |
691 |
< |
threadAssertTrue(c.getWaitingThreads().isEmpty()); |
692 |
< |
c.await(); |
693 |
< |
lock.unlock(); |
694 |
< |
} |
566 |
< |
catch(InterruptedException e) { |
567 |
< |
threadUnexpectedException(); |
568 |
< |
} |
569 |
< |
} |
570 |
< |
}); |
571 |
< |
|
572 |
< |
Thread t2 = new Thread(new Runnable() { |
573 |
< |
public void run() { |
574 |
< |
try { |
575 |
< |
lock.lock(); |
576 |
< |
threadAssertFalse(c.getWaitingThreads().isEmpty()); |
577 |
< |
c.await(); |
578 |
< |
lock.unlock(); |
579 |
< |
} |
580 |
< |
catch(InterruptedException e) { |
581 |
< |
threadUnexpectedException(); |
582 |
< |
} |
583 |
< |
} |
584 |
< |
}); |
684 |
> |
public void testGetWaitQueueLengthIAE() { testGetWaitQueueLengthIAE(false); } |
685 |
> |
public void testGetWaitQueueLengthIAE_fair() { testGetWaitQueueLengthIAE(true); } |
686 |
> |
public void testGetWaitQueueLengthIAE(boolean fair) { |
687 |
> |
final ReentrantLock lock = new ReentrantLock(fair); |
688 |
> |
final Condition c = lock.newCondition(); |
689 |
> |
final ReentrantLock lock2 = new ReentrantLock(fair); |
690 |
> |
try { |
691 |
> |
lock2.getWaitQueueLength(c); |
692 |
> |
shouldThrow(); |
693 |
> |
} catch (IllegalArgumentException success) {} |
694 |
> |
} |
695 |
|
|
696 |
+ |
/** |
697 |
+ |
* getWaitQueueLength throws IllegalMonitorStateException if not locked |
698 |
+ |
*/ |
699 |
+ |
public void testGetWaitQueueLengthIMSE() { testGetWaitQueueLengthIMSE(false); } |
700 |
+ |
public void testGetWaitQueueLengthIMSE_fair() { testGetWaitQueueLengthIMSE(true); } |
701 |
+ |
public void testGetWaitQueueLengthIMSE(boolean fair) { |
702 |
+ |
final ReentrantLock lock = new ReentrantLock(fair); |
703 |
+ |
final Condition c = lock.newCondition(); |
704 |
|
try { |
705 |
< |
lock.lock(); |
706 |
< |
assertTrue(c.getWaitingThreads().isEmpty()); |
707 |
< |
lock.unlock(); |
590 |
< |
t1.start(); |
591 |
< |
Thread.sleep(SHORT_DELAY_MS); |
592 |
< |
t2.start(); |
593 |
< |
Thread.sleep(SHORT_DELAY_MS); |
594 |
< |
lock.lock(); |
595 |
< |
assertTrue(c.hasWaiters()); |
596 |
< |
assertTrue(c.getWaitingThreads().contains(t1)); |
597 |
< |
assertTrue(c.getWaitingThreads().contains(t2)); |
598 |
< |
c.signalAll(); |
599 |
< |
lock.unlock(); |
600 |
< |
Thread.sleep(SHORT_DELAY_MS); |
601 |
< |
lock.lock(); |
602 |
< |
assertFalse(c.hasWaiters()); |
603 |
< |
assertTrue(c.getWaitingThreads().isEmpty()); |
604 |
< |
lock.unlock(); |
605 |
< |
t1.join(SHORT_DELAY_MS); |
606 |
< |
t2.join(SHORT_DELAY_MS); |
607 |
< |
assertFalse(t1.isAlive()); |
608 |
< |
assertFalse(t2.isAlive()); |
609 |
< |
} |
610 |
< |
catch (Exception ex) { |
611 |
< |
unexpectedException(); |
612 |
< |
} |
705 |
> |
lock.getWaitQueueLength(c); |
706 |
> |
shouldThrow(); |
707 |
> |
} catch (IllegalMonitorStateException success) {} |
708 |
|
} |
709 |
|
|
710 |
|
/** |
711 |
< |
* awaitUninterruptibly doesn't abort on interrupt |
711 |
> |
* getWaitingThreads throws IllegalArgumentException if not owned |
712 |
|
*/ |
713 |
< |
public void testAwaitUninterruptibly() { |
714 |
< |
final ReentrantLock lock = new ReentrantLock(); |
713 |
> |
public void testGetWaitingThreadsIAE() { testGetWaitingThreadsIAE(false); } |
714 |
> |
public void testGetWaitingThreadsIAE_fair() { testGetWaitingThreadsIAE(true); } |
715 |
> |
public void testGetWaitingThreadsIAE(boolean fair) { |
716 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
717 |
|
final Condition c = lock.newCondition(); |
718 |
< |
Thread t = new Thread(new Runnable() { |
719 |
< |
public void run() { |
720 |
< |
lock.lock(); |
721 |
< |
c.awaitUninterruptibly(); |
722 |
< |
lock.unlock(); |
723 |
< |
} |
627 |
< |
}); |
718 |
> |
final PublicReentrantLock lock2 = new PublicReentrantLock(fair); |
719 |
> |
try { |
720 |
> |
lock2.getWaitingThreads(c); |
721 |
> |
shouldThrow(); |
722 |
> |
} catch (IllegalArgumentException success) {} |
723 |
> |
} |
724 |
|
|
725 |
+ |
/** |
726 |
+ |
* getWaitingThreads throws IllegalMonitorStateException if not locked |
727 |
+ |
*/ |
728 |
+ |
public void testGetWaitingThreadsIMSE() { testGetWaitingThreadsIMSE(false); } |
729 |
+ |
public void testGetWaitingThreadsIMSE_fair() { testGetWaitingThreadsIMSE(true); } |
730 |
+ |
public void testGetWaitingThreadsIMSE(boolean fair) { |
731 |
+ |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
732 |
+ |
final Condition c = lock.newCondition(); |
733 |
|
try { |
734 |
< |
t.start(); |
735 |
< |
Thread.sleep(SHORT_DELAY_MS); |
736 |
< |
t.interrupt(); |
633 |
< |
lock.lock(); |
634 |
< |
c.signal(); |
635 |
< |
lock.unlock(); |
636 |
< |
assert(t.isInterrupted()); |
637 |
< |
t.join(SHORT_DELAY_MS); |
638 |
< |
assertFalse(t.isAlive()); |
639 |
< |
} |
640 |
< |
catch (Exception ex) { |
641 |
< |
unexpectedException(); |
642 |
< |
} |
734 |
> |
lock.getWaitingThreads(c); |
735 |
> |
shouldThrow(); |
736 |
> |
} catch (IllegalMonitorStateException success) {} |
737 |
|
} |
738 |
|
|
739 |
|
/** |
740 |
< |
* await is interruptible |
740 |
> |
* hasWaiters returns true when a thread is waiting, else false |
741 |
|
*/ |
742 |
< |
public void testAwait_Interrupt() { |
743 |
< |
final ReentrantLock lock = new ReentrantLock(); |
742 |
> |
public void testHasWaiters() { testHasWaiters(false); } |
743 |
> |
public void testHasWaiters_fair() { testHasWaiters(true); } |
744 |
> |
public void testHasWaiters(boolean fair) { |
745 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
746 |
|
final Condition c = lock.newCondition(); |
747 |
< |
Thread t = new Thread(new Runnable() { |
748 |
< |
public void run() { |
749 |
< |
try { |
750 |
< |
lock.lock(); |
751 |
< |
c.await(); |
752 |
< |
lock.unlock(); |
753 |
< |
threadShouldThrow(); |
754 |
< |
} |
755 |
< |
catch(InterruptedException success) { |
756 |
< |
} |
757 |
< |
} |
758 |
< |
}); |
747 |
> |
final CountDownLatch locked = new CountDownLatch(1); |
748 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
749 |
> |
public void realRun() throws InterruptedException { |
750 |
> |
lock.lock(); |
751 |
> |
assertHasNoWaiters(lock, c); |
752 |
> |
assertFalse(lock.hasWaiters(c)); |
753 |
> |
locked.countDown(); |
754 |
> |
c.await(); |
755 |
> |
assertHasNoWaiters(lock, c); |
756 |
> |
assertFalse(lock.hasWaiters(c)); |
757 |
> |
lock.unlock(); |
758 |
> |
}}); |
759 |
> |
|
760 |
> |
await(locked); |
761 |
> |
lock.lock(); |
762 |
> |
assertHasWaiters(lock, c, t); |
763 |
> |
assertTrue(lock.hasWaiters(c)); |
764 |
> |
c.signal(); |
765 |
> |
assertHasNoWaiters(lock, c); |
766 |
> |
assertFalse(lock.hasWaiters(c)); |
767 |
> |
lock.unlock(); |
768 |
> |
awaitTermination(t); |
769 |
> |
assertHasNoWaiters(lock, c); |
770 |
> |
} |
771 |
|
|
772 |
< |
try { |
773 |
< |
t.start(); |
774 |
< |
Thread.sleep(SHORT_DELAY_MS); |
775 |
< |
t.interrupt(); |
776 |
< |
t.join(SHORT_DELAY_MS); |
777 |
< |
assertFalse(t.isAlive()); |
778 |
< |
} |
779 |
< |
catch (Exception ex) { |
780 |
< |
unexpectedException(); |
781 |
< |
} |
772 |
> |
/** |
773 |
> |
* getWaitQueueLength returns number of waiting threads |
774 |
> |
*/ |
775 |
> |
public void testGetWaitQueueLength() { testGetWaitQueueLength(false); } |
776 |
> |
public void testGetWaitQueueLength_fair() { testGetWaitQueueLength(true); } |
777 |
> |
public void testGetWaitQueueLength(boolean fair) { |
778 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
779 |
> |
final Condition c = lock.newCondition(); |
780 |
> |
final CountDownLatch locked1 = new CountDownLatch(1); |
781 |
> |
final CountDownLatch locked2 = new CountDownLatch(1); |
782 |
> |
Thread t1 = new Thread(new CheckedRunnable() { |
783 |
> |
public void realRun() throws InterruptedException { |
784 |
> |
lock.lock(); |
785 |
> |
assertFalse(lock.hasWaiters(c)); |
786 |
> |
assertEquals(0, lock.getWaitQueueLength(c)); |
787 |
> |
locked1.countDown(); |
788 |
> |
c.await(); |
789 |
> |
lock.unlock(); |
790 |
> |
}}); |
791 |
> |
|
792 |
> |
Thread t2 = new Thread(new CheckedRunnable() { |
793 |
> |
public void realRun() throws InterruptedException { |
794 |
> |
lock.lock(); |
795 |
> |
assertTrue(lock.hasWaiters(c)); |
796 |
> |
assertEquals(1, lock.getWaitQueueLength(c)); |
797 |
> |
locked2.countDown(); |
798 |
> |
c.await(); |
799 |
> |
lock.unlock(); |
800 |
> |
}}); |
801 |
> |
|
802 |
> |
lock.lock(); |
803 |
> |
assertEquals(0, lock.getWaitQueueLength(c)); |
804 |
> |
lock.unlock(); |
805 |
> |
|
806 |
> |
t1.start(); |
807 |
> |
await(locked1); |
808 |
> |
|
809 |
> |
lock.lock(); |
810 |
> |
assertHasWaiters(lock, c, t1); |
811 |
> |
assertEquals(1, lock.getWaitQueueLength(c)); |
812 |
> |
lock.unlock(); |
813 |
> |
|
814 |
> |
t2.start(); |
815 |
> |
await(locked2); |
816 |
> |
|
817 |
> |
lock.lock(); |
818 |
> |
assertHasWaiters(lock, c, t1, t2); |
819 |
> |
assertEquals(2, lock.getWaitQueueLength(c)); |
820 |
> |
c.signalAll(); |
821 |
> |
assertHasNoWaiters(lock, c); |
822 |
> |
lock.unlock(); |
823 |
> |
|
824 |
> |
awaitTermination(t1); |
825 |
> |
awaitTermination(t2); |
826 |
> |
|
827 |
> |
assertHasNoWaiters(lock, c); |
828 |
|
} |
829 |
|
|
830 |
|
/** |
831 |
< |
* awaitNanos is interruptible |
831 |
> |
* getWaitingThreads returns only and all waiting threads |
832 |
|
*/ |
833 |
< |
public void testAwaitNanos_Interrupt() { |
834 |
< |
final ReentrantLock lock = new ReentrantLock(); |
833 |
> |
public void testGetWaitingThreads() { testGetWaitingThreads(false); } |
834 |
> |
public void testGetWaitingThreads_fair() { testGetWaitingThreads(true); } |
835 |
> |
public void testGetWaitingThreads(boolean fair) { |
836 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
837 |
|
final Condition c = lock.newCondition(); |
838 |
< |
Thread t = new Thread(new Runnable() { |
839 |
< |
public void run() { |
840 |
< |
try { |
841 |
< |
lock.lock(); |
842 |
< |
c.awaitNanos(SHORT_DELAY_MS * 2 * 1000000); |
843 |
< |
lock.unlock(); |
844 |
< |
threadShouldThrow(); |
845 |
< |
} |
846 |
< |
catch(InterruptedException success) { |
847 |
< |
} |
848 |
< |
} |
849 |
< |
}); |
838 |
> |
final CountDownLatch locked1 = new CountDownLatch(1); |
839 |
> |
final CountDownLatch locked2 = new CountDownLatch(1); |
840 |
> |
Thread t1 = new Thread(new CheckedRunnable() { |
841 |
> |
public void realRun() throws InterruptedException { |
842 |
> |
lock.lock(); |
843 |
> |
assertTrue(lock.getWaitingThreads(c).isEmpty()); |
844 |
> |
locked1.countDown(); |
845 |
> |
c.await(); |
846 |
> |
lock.unlock(); |
847 |
> |
}}); |
848 |
> |
|
849 |
> |
Thread t2 = new Thread(new CheckedRunnable() { |
850 |
> |
public void realRun() throws InterruptedException { |
851 |
> |
lock.lock(); |
852 |
> |
assertFalse(lock.getWaitingThreads(c).isEmpty()); |
853 |
> |
locked2.countDown(); |
854 |
> |
c.await(); |
855 |
> |
lock.unlock(); |
856 |
> |
}}); |
857 |
> |
|
858 |
> |
lock.lock(); |
859 |
> |
assertTrue(lock.getWaitingThreads(c).isEmpty()); |
860 |
> |
lock.unlock(); |
861 |
> |
|
862 |
> |
t1.start(); |
863 |
> |
await(locked1); |
864 |
> |
|
865 |
> |
lock.lock(); |
866 |
> |
assertHasWaiters(lock, c, t1); |
867 |
> |
assertTrue(lock.getWaitingThreads(c).contains(t1)); |
868 |
> |
assertFalse(lock.getWaitingThreads(c).contains(t2)); |
869 |
> |
assertEquals(1, lock.getWaitingThreads(c).size()); |
870 |
> |
lock.unlock(); |
871 |
> |
|
872 |
> |
t2.start(); |
873 |
> |
await(locked2); |
874 |
> |
|
875 |
> |
lock.lock(); |
876 |
> |
assertHasWaiters(lock, c, t1, t2); |
877 |
> |
assertTrue(lock.getWaitingThreads(c).contains(t1)); |
878 |
> |
assertTrue(lock.getWaitingThreads(c).contains(t2)); |
879 |
> |
assertEquals(2, lock.getWaitingThreads(c).size()); |
880 |
> |
c.signalAll(); |
881 |
> |
assertHasNoWaiters(lock, c); |
882 |
> |
lock.unlock(); |
883 |
|
|
884 |
< |
try { |
885 |
< |
t.start(); |
886 |
< |
Thread.sleep(SHORT_DELAY_MS); |
887 |
< |
t.interrupt(); |
699 |
< |
t.join(SHORT_DELAY_MS); |
700 |
< |
assertFalse(t.isAlive()); |
701 |
< |
} |
702 |
< |
catch (Exception ex) { |
703 |
< |
unexpectedException(); |
704 |
< |
} |
884 |
> |
awaitTermination(t1); |
885 |
> |
awaitTermination(t2); |
886 |
> |
|
887 |
> |
assertHasNoWaiters(lock, c); |
888 |
|
} |
889 |
|
|
890 |
|
/** |
891 |
< |
* awaitUntil is interruptible |
891 |
> |
* awaitUninterruptibly doesn't abort on interrupt |
892 |
|
*/ |
893 |
< |
public void testAwaitUntil_Interrupt() { |
894 |
< |
final ReentrantLock lock = new ReentrantLock(); |
893 |
> |
public void testAwaitUninterruptibly() { testAwaitUninterruptibly(false); } |
894 |
> |
public void testAwaitUninterruptibly_fair() { testAwaitUninterruptibly(true); } |
895 |
> |
public void testAwaitUninterruptibly(boolean fair) { |
896 |
> |
final ReentrantLock lock = new ReentrantLock(fair); |
897 |
|
final Condition c = lock.newCondition(); |
898 |
< |
Thread t = new Thread(new Runnable() { |
899 |
< |
public void run() { |
900 |
< |
try { |
901 |
< |
lock.lock(); |
902 |
< |
java.util.Date d = new java.util.Date(); |
903 |
< |
c.awaitUntil(new java.util.Date(d.getTime() + 10000)); |
904 |
< |
lock.unlock(); |
905 |
< |
threadShouldThrow(); |
906 |
< |
} |
907 |
< |
catch(InterruptedException success) { |
908 |
< |
} |
909 |
< |
} |
910 |
< |
}); |
911 |
< |
|
912 |
< |
try { |
913 |
< |
t.start(); |
914 |
< |
Thread.sleep(SHORT_DELAY_MS); |
915 |
< |
t.interrupt(); |
916 |
< |
t.join(SHORT_DELAY_MS); |
917 |
< |
assertFalse(t.isAlive()); |
918 |
< |
} |
919 |
< |
catch (Exception ex) { |
920 |
< |
unexpectedException(); |
921 |
< |
} |
898 |
> |
final CountDownLatch locked = new CountDownLatch(1); |
899 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
900 |
> |
public void realRun() { |
901 |
> |
lock.lock(); |
902 |
> |
locked.countDown(); |
903 |
> |
c.awaitUninterruptibly(); |
904 |
> |
assertTrue(Thread.interrupted()); |
905 |
> |
lock.unlock(); |
906 |
> |
}}); |
907 |
> |
|
908 |
> |
await(locked); |
909 |
> |
lock.lock(); |
910 |
> |
lock.unlock(); |
911 |
> |
t.interrupt(); |
912 |
> |
long timeoutMillis = 10; |
913 |
> |
assertThreadStaysAlive(t, timeoutMillis); |
914 |
> |
lock.lock(); |
915 |
> |
c.signal(); |
916 |
> |
lock.unlock(); |
917 |
> |
awaitTermination(t); |
918 |
> |
} |
919 |
> |
|
920 |
> |
/** |
921 |
> |
* await/awaitNanos/awaitUntil is interruptible |
922 |
> |
*/ |
923 |
> |
public void testInterruptible_await() { testInterruptible(false, AwaitMethod.await); } |
924 |
> |
public void testInterruptible_await_fair() { testInterruptible(true, AwaitMethod.await); } |
925 |
> |
public void testInterruptible_awaitNanos() { testInterruptible(false, AwaitMethod.awaitNanos); } |
926 |
> |
public void testInterruptible_awaitNanos_fair() { testInterruptible(true, AwaitMethod.awaitNanos); } |
927 |
> |
public void testInterruptible_awaitUntil() { testInterruptible(false, AwaitMethod.awaitUntil); } |
928 |
> |
public void testInterruptible_awaitUntil_fair() { testInterruptible(true, AwaitMethod.awaitUntil); } |
929 |
> |
public void testInterruptible(boolean fair, final AwaitMethod awaitMethod) { |
930 |
> |
final PublicReentrantLock lock = |
931 |
> |
new PublicReentrantLock(fair); |
932 |
> |
final Condition c = lock.newCondition(); |
933 |
> |
final CountDownLatch locked = new CountDownLatch(1); |
934 |
> |
Thread t = newStartedThread(new CheckedInterruptedRunnable() { |
935 |
> |
public void realRun() throws InterruptedException { |
936 |
> |
lock.lock(); |
937 |
> |
assertLockedByMoi(lock); |
938 |
> |
assertHasNoWaiters(lock, c); |
939 |
> |
locked.countDown(); |
940 |
> |
try { |
941 |
> |
await(c, awaitMethod); |
942 |
> |
} finally { |
943 |
> |
assertLockedByMoi(lock); |
944 |
> |
assertHasNoWaiters(lock, c); |
945 |
> |
lock.unlock(); |
946 |
> |
assertFalse(Thread.interrupted()); |
947 |
> |
} |
948 |
> |
}}); |
949 |
> |
|
950 |
> |
await(locked); |
951 |
> |
assertHasWaiters(lock, c, t); |
952 |
> |
t.interrupt(); |
953 |
> |
awaitTermination(t); |
954 |
> |
assertNotLocked(lock); |
955 |
|
} |
956 |
|
|
957 |
|
/** |
958 |
|
* signalAll wakes up all threads |
959 |
|
*/ |
960 |
< |
public void testSignalAll() { |
961 |
< |
final ReentrantLock lock = new ReentrantLock(); |
960 |
> |
public void testSignalAll_await() { testSignalAll(false, AwaitMethod.await); } |
961 |
> |
public void testSignalAll_await_fair() { testSignalAll(true, AwaitMethod.await); } |
962 |
> |
public void testSignalAll_awaitNanos() { testSignalAll(false, AwaitMethod.awaitNanos); } |
963 |
> |
public void testSignalAll_awaitNanos_fair() { testSignalAll(true, AwaitMethod.awaitNanos); } |
964 |
> |
public void testSignalAll_awaitUntil() { testSignalAll(false, AwaitMethod.awaitUntil); } |
965 |
> |
public void testSignalAll_awaitUntil_fair() { testSignalAll(true, AwaitMethod.awaitUntil); } |
966 |
> |
public void testSignalAll(boolean fair, final AwaitMethod awaitMethod) { |
967 |
> |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
968 |
|
final Condition c = lock.newCondition(); |
969 |
< |
Thread t1 = new Thread(new Runnable() { |
970 |
< |
public void run() { |
971 |
< |
try { |
972 |
< |
lock.lock(); |
973 |
< |
c.await(); |
974 |
< |
lock.unlock(); |
975 |
< |
} |
976 |
< |
catch(InterruptedException e) { |
753 |
< |
threadUnexpectedException(); |
754 |
< |
} |
755 |
< |
} |
756 |
< |
}); |
757 |
< |
|
758 |
< |
Thread t2 = new Thread(new Runnable() { |
759 |
< |
public void run() { |
760 |
< |
try { |
761 |
< |
lock.lock(); |
762 |
< |
c.await(); |
763 |
< |
lock.unlock(); |
764 |
< |
} |
765 |
< |
catch(InterruptedException e) { |
766 |
< |
threadUnexpectedException(); |
767 |
< |
} |
768 |
< |
} |
769 |
< |
}); |
770 |
< |
|
771 |
< |
try { |
772 |
< |
t1.start(); |
773 |
< |
t2.start(); |
774 |
< |
Thread.sleep(SHORT_DELAY_MS); |
775 |
< |
lock.lock(); |
776 |
< |
c.signalAll(); |
777 |
< |
lock.unlock(); |
778 |
< |
t1.join(SHORT_DELAY_MS); |
779 |
< |
t2.join(SHORT_DELAY_MS); |
780 |
< |
assertFalse(t1.isAlive()); |
781 |
< |
assertFalse(t2.isAlive()); |
782 |
< |
} |
783 |
< |
catch (Exception ex) { |
784 |
< |
unexpectedException(); |
969 |
> |
final CountDownLatch locked = new CountDownLatch(2); |
970 |
> |
class Awaiter extends CheckedRunnable { |
971 |
> |
public void realRun() throws InterruptedException { |
972 |
> |
lock.lock(); |
973 |
> |
locked.countDown(); |
974 |
> |
await(c, awaitMethod); |
975 |
> |
lock.unlock(); |
976 |
> |
} |
977 |
|
} |
978 |
+ |
|
979 |
+ |
Thread t1 = newStartedThread(new Awaiter()); |
980 |
+ |
Thread t2 = newStartedThread(new Awaiter()); |
981 |
+ |
|
982 |
+ |
await(locked); |
983 |
+ |
lock.lock(); |
984 |
+ |
assertHasWaiters(lock, c, t1, t2); |
985 |
+ |
c.signalAll(); |
986 |
+ |
assertHasNoWaiters(lock, c); |
987 |
+ |
lock.unlock(); |
988 |
+ |
awaitTermination(t1); |
989 |
+ |
awaitTermination(t2); |
990 |
+ |
} |
991 |
+ |
|
992 |
+ |
/** |
993 |
+ |
* signal wakes up waiting threads in FIFO order. |
994 |
+ |
*/ |
995 |
+ |
public void testSignalWakesFifo() { testSignalWakesFifo(false); } |
996 |
+ |
public void testSignalWakesFifo_fair() { testSignalWakesFifo(true); } |
997 |
+ |
public void testSignalWakesFifo(boolean fair) { |
998 |
+ |
final PublicReentrantLock lock = |
999 |
+ |
new PublicReentrantLock(fair); |
1000 |
+ |
final Condition c = lock.newCondition(); |
1001 |
+ |
final CountDownLatch locked1 = new CountDownLatch(1); |
1002 |
+ |
final CountDownLatch locked2 = new CountDownLatch(1); |
1003 |
+ |
Thread t1 = newStartedThread(new CheckedRunnable() { |
1004 |
+ |
public void realRun() throws InterruptedException { |
1005 |
+ |
lock.lock(); |
1006 |
+ |
locked1.countDown(); |
1007 |
+ |
c.await(); |
1008 |
+ |
lock.unlock(); |
1009 |
+ |
}}); |
1010 |
+ |
|
1011 |
+ |
await(locked1); |
1012 |
+ |
|
1013 |
+ |
Thread t2 = newStartedThread(new CheckedRunnable() { |
1014 |
+ |
public void realRun() throws InterruptedException { |
1015 |
+ |
lock.lock(); |
1016 |
+ |
locked2.countDown(); |
1017 |
+ |
c.await(); |
1018 |
+ |
lock.unlock(); |
1019 |
+ |
}}); |
1020 |
+ |
|
1021 |
+ |
await(locked2); |
1022 |
+ |
|
1023 |
+ |
lock.lock(); |
1024 |
+ |
assertHasWaiters(lock, c, t1, t2); |
1025 |
+ |
assertFalse(lock.hasQueuedThreads()); |
1026 |
+ |
c.signal(); |
1027 |
+ |
assertHasWaiters(lock, c, t2); |
1028 |
+ |
assertTrue(lock.hasQueuedThread(t1)); |
1029 |
+ |
assertFalse(lock.hasQueuedThread(t2)); |
1030 |
+ |
c.signal(); |
1031 |
+ |
assertHasNoWaiters(lock, c); |
1032 |
+ |
assertTrue(lock.hasQueuedThread(t1)); |
1033 |
+ |
assertTrue(lock.hasQueuedThread(t2)); |
1034 |
+ |
lock.unlock(); |
1035 |
+ |
awaitTermination(t1); |
1036 |
+ |
awaitTermination(t2); |
1037 |
+ |
} |
1038 |
+ |
|
1039 |
+ |
/** |
1040 |
+ |
* await after multiple reentrant locking preserves lock count |
1041 |
+ |
*/ |
1042 |
+ |
public void testAwaitLockCount() { testAwaitLockCount(false); } |
1043 |
+ |
public void testAwaitLockCount_fair() { testAwaitLockCount(true); } |
1044 |
+ |
public void testAwaitLockCount(boolean fair) { |
1045 |
+ |
final PublicReentrantLock lock = new PublicReentrantLock(fair); |
1046 |
+ |
final Condition c = lock.newCondition(); |
1047 |
+ |
final CountDownLatch locked = new CountDownLatch(2); |
1048 |
+ |
Thread t1 = newStartedThread(new CheckedRunnable() { |
1049 |
+ |
public void realRun() throws InterruptedException { |
1050 |
+ |
lock.lock(); |
1051 |
+ |
assertLockedByMoi(lock); |
1052 |
+ |
assertEquals(1, lock.getHoldCount()); |
1053 |
+ |
locked.countDown(); |
1054 |
+ |
c.await(); |
1055 |
+ |
assertLockedByMoi(lock); |
1056 |
+ |
assertEquals(1, lock.getHoldCount()); |
1057 |
+ |
lock.unlock(); |
1058 |
+ |
}}); |
1059 |
+ |
|
1060 |
+ |
Thread t2 = newStartedThread(new CheckedRunnable() { |
1061 |
+ |
public void realRun() throws InterruptedException { |
1062 |
+ |
lock.lock(); |
1063 |
+ |
lock.lock(); |
1064 |
+ |
assertLockedByMoi(lock); |
1065 |
+ |
assertEquals(2, lock.getHoldCount()); |
1066 |
+ |
locked.countDown(); |
1067 |
+ |
c.await(); |
1068 |
+ |
assertLockedByMoi(lock); |
1069 |
+ |
assertEquals(2, lock.getHoldCount()); |
1070 |
+ |
lock.unlock(); |
1071 |
+ |
lock.unlock(); |
1072 |
+ |
}}); |
1073 |
+ |
|
1074 |
+ |
await(locked); |
1075 |
+ |
lock.lock(); |
1076 |
+ |
assertHasWaiters(lock, c, t1, t2); |
1077 |
+ |
assertEquals(1, lock.getHoldCount()); |
1078 |
+ |
c.signalAll(); |
1079 |
+ |
assertHasNoWaiters(lock, c); |
1080 |
+ |
lock.unlock(); |
1081 |
+ |
awaitTermination(t1); |
1082 |
+ |
awaitTermination(t2); |
1083 |
|
} |
1084 |
|
|
1085 |
|
/** |
1086 |
|
* A serialized lock deserializes as unlocked |
1087 |
|
*/ |
1088 |
< |
public void testSerialization() { |
1089 |
< |
ReentrantLock l = new ReentrantLock(); |
1090 |
< |
l.lock(); |
1091 |
< |
l.unlock(); |
1092 |
< |
|
1093 |
< |
try { |
1094 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
1095 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
1096 |
< |
out.writeObject(l); |
1097 |
< |
out.close(); |
1098 |
< |
|
1099 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
1100 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
1101 |
< |
ReentrantLock r = (ReentrantLock) in.readObject(); |
1102 |
< |
r.lock(); |
1103 |
< |
r.unlock(); |
1104 |
< |
} catch(Exception e){ |
1105 |
< |
e.printStackTrace(); |
1106 |
< |
unexpectedException(); |
1107 |
< |
} |
1088 |
> |
public void testSerialization() { testSerialization(false); } |
1089 |
> |
public void testSerialization_fair() { testSerialization(true); } |
1090 |
> |
public void testSerialization(boolean fair) { |
1091 |
> |
ReentrantLock lock = new ReentrantLock(fair); |
1092 |
> |
lock.lock(); |
1093 |
> |
|
1094 |
> |
ReentrantLock clone = serialClone(lock); |
1095 |
> |
assertEquals(lock.isFair(), clone.isFair()); |
1096 |
> |
assertTrue(lock.isLocked()); |
1097 |
> |
assertFalse(clone.isLocked()); |
1098 |
> |
assertEquals(1, lock.getHoldCount()); |
1099 |
> |
assertEquals(0, clone.getHoldCount()); |
1100 |
> |
clone.lock(); |
1101 |
> |
clone.lock(); |
1102 |
> |
assertTrue(clone.isLocked()); |
1103 |
> |
assertEquals(2, clone.getHoldCount()); |
1104 |
> |
assertEquals(1, lock.getHoldCount()); |
1105 |
> |
clone.unlock(); |
1106 |
> |
clone.unlock(); |
1107 |
> |
assertTrue(lock.isLocked()); |
1108 |
> |
assertFalse(clone.isLocked()); |
1109 |
|
} |
1110 |
|
|
1111 |
+ |
/** |
1112 |
+ |
* toString indicates current lock state |
1113 |
+ |
*/ |
1114 |
+ |
public void testToString() { testToString(false); } |
1115 |
+ |
public void testToString_fair() { testToString(true); } |
1116 |
+ |
public void testToString(boolean fair) { |
1117 |
+ |
ReentrantLock lock = new ReentrantLock(fair); |
1118 |
+ |
String us = lock.toString(); |
1119 |
+ |
assertTrue(us.indexOf("Unlocked") >= 0); |
1120 |
+ |
lock.lock(); |
1121 |
+ |
String ls = lock.toString(); |
1122 |
+ |
assertTrue(ls.indexOf("Locked") >= 0); |
1123 |
+ |
} |
1124 |
|
} |