ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/tck/SynchronousQueueTest.java
Revision: 1.47
Committed: Sat Apr 25 04:55:31 2015 UTC (9 years ago) by jsr166
Branch: MAIN
Changes since 1.46: +1 -1 lines
Log Message:
improve main methods; respect system properties; actually fail if a test fails

File Contents

# Content
1 /*
2 * Written by Doug Lea with assistance from members of JCP JSR-166
3 * Expert Group and released to the public domain, as explained at
4 * http://creativecommons.org/publicdomain/zero/1.0/
5 * Other contributors include Andrew Wright, Jeffrey Hayes,
6 * Pat Fisher, Mike Judd.
7 */
8
9 import static java.util.concurrent.TimeUnit.MILLISECONDS;
10
11 import java.util.ArrayList;
12 import java.util.Arrays;
13 import java.util.Collection;
14 import java.util.Iterator;
15 import java.util.NoSuchElementException;
16 import java.util.concurrent.BlockingQueue;
17 import java.util.concurrent.CountDownLatch;
18 import java.util.concurrent.Executors;
19 import java.util.concurrent.ExecutorService;
20 import java.util.concurrent.SynchronousQueue;
21
22 import junit.framework.Test;
23
24 public class SynchronousQueueTest extends JSR166TestCase {
25
26 public static class Fair extends BlockingQueueTest {
27 protected BlockingQueue emptyCollection() {
28 return new SynchronousQueue(true);
29 }
30 }
31
32 public static class NonFair extends BlockingQueueTest {
33 protected BlockingQueue emptyCollection() {
34 return new SynchronousQueue(false);
35 }
36 }
37
38 public static void main(String[] args) {
39 main(suite(), args);
40 }
41
42 public static Test suite() {
43 return newTestSuite(SynchronousQueueTest.class,
44 new Fair().testSuite(),
45 new NonFair().testSuite());
46 }
47
48 /**
49 * Any SynchronousQueue is both empty and full
50 */
51 public void testEmptyFull() { testEmptyFull(false); }
52 public void testEmptyFull_fair() { testEmptyFull(true); }
53 public void testEmptyFull(boolean fair) {
54 final SynchronousQueue q = new SynchronousQueue(fair);
55 assertTrue(q.isEmpty());
56 assertEquals(0, q.size());
57 assertEquals(0, q.remainingCapacity());
58 assertFalse(q.offer(zero));
59 }
60
61 /**
62 * offer fails if no active taker
63 */
64 public void testOffer() { testOffer(false); }
65 public void testOffer_fair() { testOffer(true); }
66 public void testOffer(boolean fair) {
67 SynchronousQueue q = new SynchronousQueue(fair);
68 assertFalse(q.offer(one));
69 }
70
71 /**
72 * add throws IllegalStateException if no active taker
73 */
74 public void testAdd() { testAdd(false); }
75 public void testAdd_fair() { testAdd(true); }
76 public void testAdd(boolean fair) {
77 SynchronousQueue q = new SynchronousQueue(fair);
78 assertEquals(0, q.remainingCapacity());
79 try {
80 q.add(one);
81 shouldThrow();
82 } catch (IllegalStateException success) {}
83 }
84
85 /**
86 * addAll(this) throws IllegalArgumentException
87 */
88 public void testAddAll_self() { testAddAll_self(false); }
89 public void testAddAll_self_fair() { testAddAll_self(true); }
90 public void testAddAll_self(boolean fair) {
91 SynchronousQueue q = new SynchronousQueue(fair);
92 try {
93 q.addAll(q);
94 shouldThrow();
95 } catch (IllegalArgumentException success) {}
96 }
97
98 /**
99 * addAll throws ISE if no active taker
100 */
101 public void testAddAll_ISE() { testAddAll_ISE(false); }
102 public void testAddAll_ISE_fair() { testAddAll_ISE(true); }
103 public void testAddAll_ISE(boolean fair) {
104 SynchronousQueue q = new SynchronousQueue(fair);
105 Integer[] ints = new Integer[1];
106 for (int i = 0; i < ints.length; i++)
107 ints[i] = i;
108 Collection<Integer> coll = Arrays.asList(ints);
109 try {
110 q.addAll(coll);
111 shouldThrow();
112 } catch (IllegalStateException success) {}
113 }
114
115 /**
116 * put blocks interruptibly if no active taker
117 */
118 public void testBlockingPut() { testBlockingPut(false); }
119 public void testBlockingPut_fair() { testBlockingPut(true); }
120 public void testBlockingPut(boolean fair) {
121 final SynchronousQueue q = new SynchronousQueue(fair);
122 final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
123 Thread t = newStartedThread(new CheckedRunnable() {
124 public void realRun() throws InterruptedException {
125 Thread.currentThread().interrupt();
126 try {
127 q.put(99);
128 shouldThrow();
129 } catch (InterruptedException success) {}
130 assertFalse(Thread.interrupted());
131
132 pleaseInterrupt.countDown();
133 try {
134 q.put(99);
135 shouldThrow();
136 } catch (InterruptedException success) {}
137 assertFalse(Thread.interrupted());
138 }});
139
140 await(pleaseInterrupt);
141 assertThreadStaysAlive(t);
142 t.interrupt();
143 awaitTermination(t);
144 assertEquals(0, q.remainingCapacity());
145 }
146
147 /**
148 * put blocks interruptibly waiting for take
149 */
150 public void testPutWithTake() { testPutWithTake(false); }
151 public void testPutWithTake_fair() { testPutWithTake(true); }
152 public void testPutWithTake(boolean fair) {
153 final SynchronousQueue q = new SynchronousQueue(fair);
154 final CountDownLatch pleaseTake = new CountDownLatch(1);
155 final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
156 Thread t = newStartedThread(new CheckedRunnable() {
157 public void realRun() throws InterruptedException {
158 pleaseTake.countDown();
159 q.put(one);
160
161 pleaseInterrupt.countDown();
162 try {
163 q.put(99);
164 shouldThrow();
165 } catch (InterruptedException success) {}
166 assertFalse(Thread.interrupted());
167 }});
168
169 await(pleaseTake);
170 assertEquals(0, q.remainingCapacity());
171 try { assertSame(one, q.take()); }
172 catch (InterruptedException e) { threadUnexpectedException(e); }
173
174 await(pleaseInterrupt);
175 assertThreadStaysAlive(t);
176 t.interrupt();
177 awaitTermination(t);
178 assertEquals(0, q.remainingCapacity());
179 }
180
181 /**
182 * timed offer times out if elements not taken
183 */
184 public void testTimedOffer() { testTimedOffer(false); }
185 public void testTimedOffer_fair() { testTimedOffer(true); }
186 public void testTimedOffer(boolean fair) {
187 final SynchronousQueue q = new SynchronousQueue(fair);
188 final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
189 Thread t = newStartedThread(new CheckedRunnable() {
190 public void realRun() throws InterruptedException {
191 long startTime = System.nanoTime();
192 assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS));
193 assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
194 pleaseInterrupt.countDown();
195 try {
196 q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS);
197 shouldThrow();
198 } catch (InterruptedException success) {}
199 }});
200
201 await(pleaseInterrupt);
202 assertThreadStaysAlive(t);
203 t.interrupt();
204 awaitTermination(t);
205 }
206
207 /**
208 * poll return null if no active putter
209 */
210 public void testPoll() { testPoll(false); }
211 public void testPoll_fair() { testPoll(true); }
212 public void testPoll(boolean fair) {
213 final SynchronousQueue q = new SynchronousQueue(fair);
214 assertNull(q.poll());
215 }
216
217 /**
218 * timed poll with zero timeout times out if no active putter
219 */
220 public void testTimedPoll0() { testTimedPoll0(false); }
221 public void testTimedPoll0_fair() { testTimedPoll0(true); }
222 public void testTimedPoll0(boolean fair) {
223 final SynchronousQueue q = new SynchronousQueue(fair);
224 try { assertNull(q.poll(0, MILLISECONDS)); }
225 catch (InterruptedException e) { threadUnexpectedException(e); }
226 }
227
228 /**
229 * timed poll with nonzero timeout times out if no active putter
230 */
231 public void testTimedPoll() { testTimedPoll(false); }
232 public void testTimedPoll_fair() { testTimedPoll(true); }
233 public void testTimedPoll(boolean fair) {
234 final SynchronousQueue q = new SynchronousQueue(fair);
235 long startTime = System.nanoTime();
236 try { assertNull(q.poll(timeoutMillis(), MILLISECONDS)); }
237 catch (InterruptedException e) { threadUnexpectedException(e); }
238 assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
239 }
240
241 /**
242 * timed poll before a delayed offer times out, returning null;
243 * after offer succeeds; on interruption throws
244 */
245 public void testTimedPollWithOffer() { testTimedPollWithOffer(false); }
246 public void testTimedPollWithOffer_fair() { testTimedPollWithOffer(true); }
247 public void testTimedPollWithOffer(boolean fair) {
248 final SynchronousQueue q = new SynchronousQueue(fair);
249 final CountDownLatch pleaseOffer = new CountDownLatch(1);
250 final CountDownLatch pleaseInterrupt = new CountDownLatch(1);
251 Thread t = newStartedThread(new CheckedRunnable() {
252 public void realRun() throws InterruptedException {
253 long startTime = System.nanoTime();
254 assertNull(q.poll(timeoutMillis(), MILLISECONDS));
255 assertTrue(millisElapsedSince(startTime) >= timeoutMillis());
256
257 pleaseOffer.countDown();
258 startTime = System.nanoTime();
259 assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS));
260 assertTrue(millisElapsedSince(startTime) < MEDIUM_DELAY_MS);
261
262 Thread.currentThread().interrupt();
263 try {
264 q.poll(LONG_DELAY_MS, MILLISECONDS);
265 shouldThrow();
266 } catch (InterruptedException success) {}
267 assertFalse(Thread.interrupted());
268
269 pleaseInterrupt.countDown();
270 try {
271 q.poll(LONG_DELAY_MS, MILLISECONDS);
272 shouldThrow();
273 } catch (InterruptedException success) {}
274 assertFalse(Thread.interrupted());
275 }});
276
277 await(pleaseOffer);
278 long startTime = System.nanoTime();
279 try { assertTrue(q.offer(zero, LONG_DELAY_MS, MILLISECONDS)); }
280 catch (InterruptedException e) { threadUnexpectedException(e); }
281 assertTrue(millisElapsedSince(startTime) < MEDIUM_DELAY_MS);
282
283 await(pleaseInterrupt);
284 assertThreadStaysAlive(t);
285 t.interrupt();
286 awaitTermination(t);
287 }
288
289 /**
290 * peek() returns null if no active putter
291 */
292 public void testPeek() { testPeek(false); }
293 public void testPeek_fair() { testPeek(true); }
294 public void testPeek(boolean fair) {
295 final SynchronousQueue q = new SynchronousQueue(fair);
296 assertNull(q.peek());
297 }
298
299 /**
300 * element() throws NoSuchElementException if no active putter
301 */
302 public void testElement() { testElement(false); }
303 public void testElement_fair() { testElement(true); }
304 public void testElement(boolean fair) {
305 final SynchronousQueue q = new SynchronousQueue(fair);
306 try {
307 q.element();
308 shouldThrow();
309 } catch (NoSuchElementException success) {}
310 }
311
312 /**
313 * remove() throws NoSuchElementException if no active putter
314 */
315 public void testRemove() { testRemove(false); }
316 public void testRemove_fair() { testRemove(true); }
317 public void testRemove(boolean fair) {
318 final SynchronousQueue q = new SynchronousQueue(fair);
319 try {
320 q.remove();
321 shouldThrow();
322 } catch (NoSuchElementException success) {}
323 }
324
325 /**
326 * contains returns false
327 */
328 public void testContains() { testContains(false); }
329 public void testContains_fair() { testContains(true); }
330 public void testContains(boolean fair) {
331 final SynchronousQueue q = new SynchronousQueue(fair);
332 assertFalse(q.contains(zero));
333 }
334
335 /**
336 * clear ensures isEmpty
337 */
338 public void testClear() { testClear(false); }
339 public void testClear_fair() { testClear(true); }
340 public void testClear(boolean fair) {
341 final SynchronousQueue q = new SynchronousQueue(fair);
342 q.clear();
343 assertTrue(q.isEmpty());
344 }
345
346 /**
347 * containsAll returns false unless empty
348 */
349 public void testContainsAll() { testContainsAll(false); }
350 public void testContainsAll_fair() { testContainsAll(true); }
351 public void testContainsAll(boolean fair) {
352 final SynchronousQueue q = new SynchronousQueue(fair);
353 Integer[] empty = new Integer[0];
354 assertTrue(q.containsAll(Arrays.asList(empty)));
355 Integer[] ints = new Integer[1]; ints[0] = zero;
356 assertFalse(q.containsAll(Arrays.asList(ints)));
357 }
358
359 /**
360 * retainAll returns false
361 */
362 public void testRetainAll() { testRetainAll(false); }
363 public void testRetainAll_fair() { testRetainAll(true); }
364 public void testRetainAll(boolean fair) {
365 final SynchronousQueue q = new SynchronousQueue(fair);
366 Integer[] empty = new Integer[0];
367 assertFalse(q.retainAll(Arrays.asList(empty)));
368 Integer[] ints = new Integer[1]; ints[0] = zero;
369 assertFalse(q.retainAll(Arrays.asList(ints)));
370 }
371
372 /**
373 * removeAll returns false
374 */
375 public void testRemoveAll() { testRemoveAll(false); }
376 public void testRemoveAll_fair() { testRemoveAll(true); }
377 public void testRemoveAll(boolean fair) {
378 final SynchronousQueue q = new SynchronousQueue(fair);
379 Integer[] empty = new Integer[0];
380 assertFalse(q.removeAll(Arrays.asList(empty)));
381 Integer[] ints = new Integer[1]; ints[0] = zero;
382 assertFalse(q.containsAll(Arrays.asList(ints)));
383 }
384
385 /**
386 * toArray is empty
387 */
388 public void testToArray() { testToArray(false); }
389 public void testToArray_fair() { testToArray(true); }
390 public void testToArray(boolean fair) {
391 final SynchronousQueue q = new SynchronousQueue(fair);
392 Object[] o = q.toArray();
393 assertEquals(0, o.length);
394 }
395
396 /**
397 * toArray(Integer array) returns its argument with the first
398 * element (if present) nulled out
399 */
400 public void testToArray2() { testToArray2(false); }
401 public void testToArray2_fair() { testToArray2(true); }
402 public void testToArray2(boolean fair) {
403 final SynchronousQueue<Integer> q
404 = new SynchronousQueue<Integer>(fair);
405 Integer[] a;
406
407 a = new Integer[0];
408 assertSame(a, q.toArray(a));
409
410 a = new Integer[3];
411 Arrays.fill(a, 42);
412 assertSame(a, q.toArray(a));
413 assertNull(a[0]);
414 for (int i = 1; i < a.length; i++)
415 assertEquals(42, (int) a[i]);
416 }
417
418 /**
419 * toArray(null) throws NPE
420 */
421 public void testToArray_null() { testToArray_null(false); }
422 public void testToArray_null_fair() { testToArray_null(true); }
423 public void testToArray_null(boolean fair) {
424 final SynchronousQueue q = new SynchronousQueue(fair);
425 try {
426 Object[] o = q.toArray(null);
427 shouldThrow();
428 } catch (NullPointerException success) {}
429 }
430
431 /**
432 * iterator does not traverse any elements
433 */
434 public void testIterator() { testIterator(false); }
435 public void testIterator_fair() { testIterator(true); }
436 public void testIterator(boolean fair) {
437 assertIteratorExhausted(new SynchronousQueue(fair).iterator());
438 }
439
440 /**
441 * iterator remove throws ISE
442 */
443 public void testIteratorRemove() { testIteratorRemove(false); }
444 public void testIteratorRemove_fair() { testIteratorRemove(true); }
445 public void testIteratorRemove(boolean fair) {
446 final SynchronousQueue q = new SynchronousQueue(fair);
447 Iterator it = q.iterator();
448 try {
449 it.remove();
450 shouldThrow();
451 } catch (IllegalStateException success) {}
452 }
453
454 /**
455 * toString returns a non-null string
456 */
457 public void testToString() { testToString(false); }
458 public void testToString_fair() { testToString(true); }
459 public void testToString(boolean fair) {
460 final SynchronousQueue q = new SynchronousQueue(fair);
461 String s = q.toString();
462 assertNotNull(s);
463 }
464
465 /**
466 * offer transfers elements across Executor tasks
467 */
468 public void testOfferInExecutor() { testOfferInExecutor(false); }
469 public void testOfferInExecutor_fair() { testOfferInExecutor(true); }
470 public void testOfferInExecutor(boolean fair) {
471 final SynchronousQueue q = new SynchronousQueue(fair);
472 ExecutorService executor = Executors.newFixedThreadPool(2);
473 final CheckedBarrier threadsStarted = new CheckedBarrier(2);
474
475 executor.execute(new CheckedRunnable() {
476 public void realRun() throws InterruptedException {
477 assertFalse(q.offer(one));
478 threadsStarted.await();
479 assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS));
480 assertEquals(0, q.remainingCapacity());
481 }});
482
483 executor.execute(new CheckedRunnable() {
484 public void realRun() throws InterruptedException {
485 threadsStarted.await();
486 assertSame(one, q.take());
487 }});
488
489 joinPool(executor);
490 }
491
492 /**
493 * timed poll retrieves elements across Executor threads
494 */
495 public void testPollInExecutor() { testPollInExecutor(false); }
496 public void testPollInExecutor_fair() { testPollInExecutor(true); }
497 public void testPollInExecutor(boolean fair) {
498 final SynchronousQueue q = new SynchronousQueue(fair);
499 final CheckedBarrier threadsStarted = new CheckedBarrier(2);
500 ExecutorService executor = Executors.newFixedThreadPool(2);
501 executor.execute(new CheckedRunnable() {
502 public void realRun() throws InterruptedException {
503 assertNull(q.poll());
504 threadsStarted.await();
505 assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
506 assertTrue(q.isEmpty());
507 }});
508
509 executor.execute(new CheckedRunnable() {
510 public void realRun() throws InterruptedException {
511 threadsStarted.await();
512 q.put(one);
513 }});
514
515 joinPool(executor);
516 }
517
518 /**
519 * a deserialized serialized queue is usable
520 */
521 public void testSerialization() {
522 final SynchronousQueue x = new SynchronousQueue();
523 final SynchronousQueue y = new SynchronousQueue(false);
524 final SynchronousQueue z = new SynchronousQueue(true);
525 assertSerialEquals(x, y);
526 assertNotSerialEquals(x, z);
527 SynchronousQueue[] qs = { x, y, z };
528 for (SynchronousQueue q : qs) {
529 SynchronousQueue clone = serialClone(q);
530 assertNotSame(q, clone);
531 assertSerialEquals(q, clone);
532 assertTrue(clone.isEmpty());
533 assertEquals(0, clone.size());
534 assertEquals(0, clone.remainingCapacity());
535 assertFalse(clone.offer(zero));
536 }
537 }
538
539 /**
540 * drainTo(c) of empty queue doesn't transfer elements
541 */
542 public void testDrainTo() { testDrainTo(false); }
543 public void testDrainTo_fair() { testDrainTo(true); }
544 public void testDrainTo(boolean fair) {
545 final SynchronousQueue q = new SynchronousQueue(fair);
546 ArrayList l = new ArrayList();
547 q.drainTo(l);
548 assertEquals(0, q.size());
549 assertEquals(0, l.size());
550 }
551
552 /**
553 * drainTo empties queue, unblocking a waiting put.
554 */
555 public void testDrainToWithActivePut() { testDrainToWithActivePut(false); }
556 public void testDrainToWithActivePut_fair() { testDrainToWithActivePut(true); }
557 public void testDrainToWithActivePut(boolean fair) {
558 final SynchronousQueue q = new SynchronousQueue(fair);
559 Thread t = newStartedThread(new CheckedRunnable() {
560 public void realRun() throws InterruptedException {
561 q.put(one);
562 }});
563
564 ArrayList l = new ArrayList();
565 long startTime = System.nanoTime();
566 while (l.isEmpty()) {
567 q.drainTo(l);
568 if (millisElapsedSince(startTime) > LONG_DELAY_MS)
569 fail("timed out");
570 Thread.yield();
571 }
572 assertTrue(l.size() == 1);
573 assertSame(one, l.get(0));
574 awaitTermination(t);
575 }
576
577 /**
578 * drainTo(c, n) empties up to n elements of queue into c
579 */
580 public void testDrainToN() throws InterruptedException {
581 final SynchronousQueue q = new SynchronousQueue();
582 Thread t1 = newStartedThread(new CheckedRunnable() {
583 public void realRun() throws InterruptedException {
584 q.put(one);
585 }});
586
587 Thread t2 = newStartedThread(new CheckedRunnable() {
588 public void realRun() throws InterruptedException {
589 q.put(two);
590 }});
591
592 ArrayList l = new ArrayList();
593 delay(SHORT_DELAY_MS);
594 q.drainTo(l, 1);
595 assertEquals(1, l.size());
596 q.drainTo(l, 1);
597 assertEquals(2, l.size());
598 assertTrue(l.contains(one));
599 assertTrue(l.contains(two));
600 awaitTermination(t1);
601 awaitTermination(t2);
602 }
603
604 /**
605 * remove(null), contains(null) always return false
606 */
607 public void testNeverContainsNull() {
608 Collection<?> q = new SynchronousQueue();
609 assertFalse(q.contains(null));
610 assertFalse(q.remove(null));
611 }
612
613 }