ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/test/tck/RecursiveActionTest.java

Comparing jsr166/src/test/tck/RecursiveActionTest.java (file contents):
Revision 1.18 by jsr166, Thu Sep 16 00:52:49 2010 UTC vs.
Revision 1.46 by jsr166, Sun Oct 18 04:48:32 2015 UTC

#	Line 1 | Line 1
1		/*
2		* Written by Doug Lea with assistance from members of JCP JSR-166
3		* Expert Group and released to the public domain, as explained at
4	<	* http://creativecommons.org/licenses/publicdomain
4	>	* http://creativecommons.org/publicdomain/zero/1.0/
5		*/
6
7	<	import junit.framework.*;
7	>	import static java.util.concurrent.TimeUnit.SECONDS;
8	>
9	>	import java.util.Arrays;
10	>	import java.util.HashSet;
11		import java.util.concurrent.CancellationException;
12		import java.util.concurrent.ExecutionException;
13		import java.util.concurrent.ForkJoinPool;
14	+	import java.util.concurrent.ForkJoinTask;
15		import java.util.concurrent.ForkJoinWorkerThread;
16		import java.util.concurrent.RecursiveAction;
17	<	import java.util.concurrent.TimeUnit;
18	<	import java.util.HashSet;
17	>	import java.util.concurrent.SynchronousQueue;
18	>	import java.util.concurrent.ThreadLocalRandom;
19	>	import java.util.concurrent.TimeoutException;
20	>
21	>	import junit.framework.Test;
22	>	import junit.framework.TestSuite;
23
24		public class RecursiveActionTest extends JSR166TestCase {
25
26		public static void main(String[] args) {
27	<	junit.textui.TestRunner.run(suite());
27	>	main(suite(), args);
28		}
29
30		public static Test suite() {
#	Line 38 | Line 46 | public class RecursiveActionTest extends
46		}
47
48		private void testInvokeOnPool(ForkJoinPool pool, RecursiveAction a) {
49	<	try {
50	<	assertFalse(a.isDone());
43	<	assertFalse(a.isCompletedNormally());
44	<	assertFalse(a.isCompletedAbnormally());
45	<	assertFalse(a.isCancelled());
46	<	assertNull(a.getException());
49	>	try (PoolCleaner cleaner = cleaner(pool)) {
50	>	checkNotDone(a);
51
52		assertNull(pool.invoke(a));
53
54	<	assertTrue(a.isDone());
55	<	assertTrue(a.isCompletedNormally());
56	<	assertFalse(a.isCompletedAbnormally());
57	<	assertFalse(a.isCancelled());
58	<	assertNull(a.getException());
59	<	} finally {
60	<	joinPool(pool);
54	>	checkCompletedNormally(a);
55	>	}
56	>	}
57	>
58	>	void checkNotDone(RecursiveAction a) {
59	>	assertFalse(a.isDone());
60	>	assertFalse(a.isCompletedNormally());
61	>	assertFalse(a.isCompletedAbnormally());
62	>	assertFalse(a.isCancelled());
63	>	assertNull(a.getException());
64	>	assertNull(a.getRawResult());
65	>
66	>	if (! ForkJoinTask.inForkJoinPool()) {
67	>	Thread.currentThread().interrupt();
68	>	try {
69	>	a.get();
70	>	shouldThrow();
71	>	} catch (InterruptedException success) {
72	>	} catch (Throwable fail) { threadUnexpectedException(fail); }
73	>
74	>	Thread.currentThread().interrupt();
75	>	try {
76	>	a.get(5L, SECONDS);
77	>	shouldThrow();
78	>	} catch (InterruptedException success) {
79	>	} catch (Throwable fail) { threadUnexpectedException(fail); }
80	>	}
81	>
82	>	try {
83	>	a.get(0L, SECONDS);
84	>	shouldThrow();
85	>	} catch (TimeoutException success) {
86	>	} catch (Throwable fail) { threadUnexpectedException(fail); }
87	>	}
88	>
89	>	void checkCompletedNormally(RecursiveAction a) {
90	>	assertTrue(a.isDone());
91	>	assertFalse(a.isCancelled());
92	>	assertTrue(a.isCompletedNormally());
93	>	assertFalse(a.isCompletedAbnormally());
94	>	assertNull(a.getException());
95	>	assertNull(a.getRawResult());
96	>	assertNull(a.join());
97	>	assertFalse(a.cancel(false));
98	>	assertFalse(a.cancel(true));
99	>	try {
100	>	assertNull(a.get());
101	>	} catch (Throwable fail) { threadUnexpectedException(fail); }
102	>	try {
103	>	assertNull(a.get(5L, SECONDS));
104	>	} catch (Throwable fail) { threadUnexpectedException(fail); }
105	>	}
106	>
107	>	void checkCancelled(RecursiveAction a) {
108	>	assertTrue(a.isDone());
109	>	assertTrue(a.isCancelled());
110	>	assertFalse(a.isCompletedNormally());
111	>	assertTrue(a.isCompletedAbnormally());
112	>	assertTrue(a.getException() instanceof CancellationException);
113	>	assertNull(a.getRawResult());
114	>
115	>	try {
116	>	a.join();
117	>	shouldThrow();
118	>	} catch (CancellationException success) {
119	>	} catch (Throwable fail) { threadUnexpectedException(fail); }
120	>
121	>	try {
122	>	a.get();
123	>	shouldThrow();
124	>	} catch (CancellationException success) {
125	>	} catch (Throwable fail) { threadUnexpectedException(fail); }
126	>
127	>	try {
128	>	a.get(5L, SECONDS);
129	>	shouldThrow();
130	>	} catch (CancellationException success) {
131	>	} catch (Throwable fail) { threadUnexpectedException(fail); }
132	>	}
133	>
134	>	void checkCompletedAbnormally(RecursiveAction a, Throwable t) {
135	>	assertTrue(a.isDone());
136	>	assertFalse(a.isCancelled());
137	>	assertFalse(a.isCompletedNormally());
138	>	assertTrue(a.isCompletedAbnormally());
139	>	assertSame(t.getClass(), a.getException().getClass());
140	>	assertNull(a.getRawResult());
141	>	assertFalse(a.cancel(false));
142	>	assertFalse(a.cancel(true));
143	>
144	>	try {
145	>	a.join();
146	>	shouldThrow();
147	>	} catch (Throwable expected) {
148	>	assertSame(expected.getClass(), t.getClass());
149		}
150	+
151	+	try {
152	+	a.get();
153	+	shouldThrow();
154	+	} catch (ExecutionException success) {
155	+	assertSame(t.getClass(), success.getCause().getClass());
156	+	} catch (Throwable fail) { threadUnexpectedException(fail); }
157	+
158	+	try {
159	+	a.get(5L, SECONDS);
160	+	shouldThrow();
161	+	} catch (ExecutionException success) {
162	+	assertSame(t.getClass(), success.getCause().getClass());
163	+	} catch (Throwable fail) { threadUnexpectedException(fail); }
164		}
165
166	<	static final class FJException extends RuntimeException {
167	<	FJException() { super(); }
166	>	public static final class FJException extends RuntimeException {
167	>	public FJException() { super(); }
168	>	public FJException(Throwable cause) { super(cause); }
169		}
170
171		// A simple recursive action for testing
#	Line 66 | Line 173 | public class RecursiveActionTest extends
173		final int number;
174		int result;
175		FibAction(int n) { number = n; }
176	<	public void realCompute() {
176	>	protected void realCompute() {
177		int n = number;
178		if (n <= 1)
179		result = n;
#	Line 104 | Line 211 | public class RecursiveActionTest extends
211		*/
212		public void testInvoke() {
213		RecursiveAction a = new CheckedRecursiveAction() {
214	<	public void realCompute() {
214	>	protected void realCompute() {
215		FibAction f = new FibAction(8);
216		assertNull(f.invoke());
217		assertEquals(21, f.result);
218	<	assertTrue(f.isDone());
112	<	assertFalse(f.isCancelled());
113	<	assertFalse(f.isCompletedAbnormally());
114	<	assertNull(f.getRawResult());
218	>	checkCompletedNormally(f);
219		}};
220		testInvokeOnPool(mainPool(), a);
221		}
#	Line 123 | Line 227 | public class RecursiveActionTest extends
227		*/
228		public void testQuietlyInvoke() {
229		RecursiveAction a = new CheckedRecursiveAction() {
230	<	public void realCompute() {
230	>	protected void realCompute() {
231		FibAction f = new FibAction(8);
232		f.quietlyInvoke();
233		assertEquals(21, f.result);
234	<	assertTrue(f.isDone());
131	<	assertFalse(f.isCancelled());
132	<	assertFalse(f.isCompletedAbnormally());
133	<	assertNull(f.getRawResult());
234	>	checkCompletedNormally(f);
235		}};
236		testInvokeOnPool(mainPool(), a);
237		}
#	Line 140 | Line 241 | public class RecursiveActionTest extends
241		*/
242		public void testForkJoin() {
243		RecursiveAction a = new CheckedRecursiveAction() {
244	<	public void realCompute() {
244	>	protected void realCompute() {
245		FibAction f = new FibAction(8);
246		assertSame(f, f.fork());
247		assertNull(f.join());
248		assertEquals(21, f.result);
249	<	assertTrue(f.isDone());
250	<	assertNull(f.getRawResult());
249	>	checkCompletedNormally(f);
250	>	}};
251	>	testInvokeOnPool(mainPool(), a);
252	>	}
253	>
254	>	/**
255	>	* join/quietlyJoin of a forked task succeeds in the presence of interrupts
256	>	*/
257	>	public void testJoinIgnoresInterrupts() {
258	>	RecursiveAction a = new CheckedRecursiveAction() {
259	>	protected void realCompute() {
260	>	FibAction f = new FibAction(8);
261	>	final Thread myself = Thread.currentThread();
262	>
263	>	// test join()
264	>	assertSame(f, f.fork());
265	>	myself.interrupt();
266	>	assertTrue(myself.isInterrupted());
267	>	assertNull(f.join());
268	>	Thread.interrupted();
269	>	assertEquals(21, f.result);
270	>	checkCompletedNormally(f);
271	>
272	>	f = new FibAction(8);
273	>	f.cancel(true);
274	>	assertSame(f, f.fork());
275	>	myself.interrupt();
276	>	assertTrue(myself.isInterrupted());
277	>	try {
278	>	f.join();
279	>	shouldThrow();
280	>	} catch (CancellationException success) {
281	>	Thread.interrupted();
282	>	checkCancelled(f);
283	>	}
284	>
285	>	f = new FibAction(8);
286	>	f.completeExceptionally(new FJException());
287	>	assertSame(f, f.fork());
288	>	myself.interrupt();
289	>	assertTrue(myself.isInterrupted());
290	>	try {
291	>	f.join();
292	>	shouldThrow();
293	>	} catch (FJException success) {
294	>	Thread.interrupted();
295	>	checkCompletedAbnormally(f, success);
296	>	}
297	>
298	>	// test quietlyJoin()
299	>	f = new FibAction(8);
300	>	assertSame(f, f.fork());
301	>	myself.interrupt();
302	>	assertTrue(myself.isInterrupted());
303	>	f.quietlyJoin();
304	>	Thread.interrupted();
305	>	assertEquals(21, f.result);
306	>	checkCompletedNormally(f);
307	>
308	>	f = new FibAction(8);
309	>	f.cancel(true);
310	>	assertSame(f, f.fork());
311	>	myself.interrupt();
312	>	assertTrue(myself.isInterrupted());
313	>	f.quietlyJoin();
314	>	Thread.interrupted();
315	>	checkCancelled(f);
316	>
317	>	f = new FibAction(8);
318	>	f.completeExceptionally(new FJException());
319	>	assertSame(f, f.fork());
320	>	myself.interrupt();
321	>	assertTrue(myself.isInterrupted());
322	>	f.quietlyJoin();
323	>	Thread.interrupted();
324	>	checkCompletedAbnormally(f, f.getException());
325	>	}};
326	>	testInvokeOnPool(mainPool(), a);
327	>	a.reinitialize();
328	>	testInvokeOnPool(singletonPool(), a);
329	>	}
330	>
331	>	/**
332	>	* join/quietlyJoin of a forked task when not in ForkJoinPool
333	>	* succeeds in the presence of interrupts
334	>	*/
335	>	public void testJoinIgnoresInterruptsOutsideForkJoinPool() {
336	>	final SynchronousQueue<FibAction[]> sq =
337	>	new SynchronousQueue<FibAction[]>();
338	>	RecursiveAction a = new CheckedRecursiveAction() {
339	>	protected void realCompute() throws InterruptedException {
340	>	FibAction[] fibActions = new FibAction[6];
341	>	for (int i = 0; i < fibActions.length; i++)
342	>	fibActions[i] = new FibAction(8);
343	>
344	>	fibActions[1].cancel(false);
345	>	fibActions[2].completeExceptionally(new FJException());
346	>	fibActions[4].cancel(true);
347	>	fibActions[5].completeExceptionally(new FJException());
348	>
349	>	for (int i = 0; i < fibActions.length; i++)
350	>	fibActions[i].fork();
351	>
352	>	sq.put(fibActions);
353	>
354	>	helpQuiesce();
355	>	}};
356	>
357	>	Runnable r = new CheckedRunnable() {
358	>	public void realRun() throws InterruptedException {
359	>	FibAction[] fibActions = sq.take();
360	>	FibAction f;
361	>	final Thread myself = Thread.currentThread();
362	>
363	>	// test join() ------------
364	>
365	>	f = fibActions[0];
366	>	assertFalse(ForkJoinTask.inForkJoinPool());
367	>	myself.interrupt();
368	>	assertTrue(myself.isInterrupted());
369	>	assertNull(f.join());
370	>	assertTrue(Thread.interrupted());
371	>	assertEquals(21, f.result);
372	>	checkCompletedNormally(f);
373	>
374	>	f = fibActions[1];
375	>	myself.interrupt();
376	>	assertTrue(myself.isInterrupted());
377	>	try {
378	>	f.join();
379	>	shouldThrow();
380	>	} catch (CancellationException success) {
381	>	assertTrue(Thread.interrupted());
382	>	checkCancelled(f);
383	>	}
384	>
385	>	f = fibActions[2];
386	>	myself.interrupt();
387	>	assertTrue(myself.isInterrupted());
388	>	try {
389	>	f.join();
390	>	shouldThrow();
391	>	} catch (FJException success) {
392	>	assertTrue(Thread.interrupted());
393	>	checkCompletedAbnormally(f, success);
394	>	}
395	>
396	>	// test quietlyJoin() ---------
397	>
398	>	f = fibActions[3];
399	>	myself.interrupt();
400	>	assertTrue(myself.isInterrupted());
401	>	f.quietlyJoin();
402	>	assertTrue(Thread.interrupted());
403	>	assertEquals(21, f.result);
404	>	checkCompletedNormally(f);
405	>
406	>	f = fibActions[4];
407	>	myself.interrupt();
408	>	assertTrue(myself.isInterrupted());
409	>	f.quietlyJoin();
410	>	assertTrue(Thread.interrupted());
411	>	checkCancelled(f);
412	>
413	>	f = fibActions[5];
414	>	myself.interrupt();
415	>	assertTrue(myself.isInterrupted());
416	>	f.quietlyJoin();
417	>	assertTrue(Thread.interrupted());
418	>	assertTrue(f.getException() instanceof FJException);
419	>	checkCompletedAbnormally(f, f.getException());
420		}};
421	+
422	+	Thread t;
423	+
424	+	t = newStartedThread(r);
425		testInvokeOnPool(mainPool(), a);
426	+	awaitTermination(t);
427	+
428	+	a.reinitialize();
429	+	t = newStartedThread(r);
430	+	testInvokeOnPool(singletonPool(), a);
431	+	awaitTermination(t);
432		}
433
434		/**
#	Line 156 | Line 436 | public class RecursiveActionTest extends
436		*/
437		public void testForkGet() {
438		RecursiveAction a = new CheckedRecursiveAction() {
439	<	public void realCompute() throws Exception {
439	>	protected void realCompute() throws Exception {
440		FibAction f = new FibAction(8);
441		assertSame(f, f.fork());
442		assertNull(f.get());
443		assertEquals(21, f.result);
444	<	assertTrue(f.isDone());
444	>	checkCompletedNormally(f);
445		}};
446		testInvokeOnPool(mainPool(), a);
447		}
#	Line 171 | Line 451 | public class RecursiveActionTest extends
451		*/
452		public void testForkTimedGet() {
453		RecursiveAction a = new CheckedRecursiveAction() {
454	<	public void realCompute() throws Exception {
454	>	protected void realCompute() throws Exception {
455		FibAction f = new FibAction(8);
456		assertSame(f, f.fork());
457	<	assertNull(f.get(5L, TimeUnit.SECONDS));
457	>	assertNull(f.get(5L, SECONDS));
458		assertEquals(21, f.result);
459	<	assertTrue(f.isDone());
459	>	checkCompletedNormally(f);
460		}};
461		testInvokeOnPool(mainPool(), a);
462		}
#	Line 186 | Line 466 | public class RecursiveActionTest extends
466		*/
467		public void testForkTimedGetNPE() {
468		RecursiveAction a = new CheckedRecursiveAction() {
469	<	public void realCompute() throws Exception {
469	>	protected void realCompute() throws Exception {
470		FibAction f = new FibAction(8);
471		assertSame(f, f.fork());
472		try {
#	Line 202 | Line 482 | public class RecursiveActionTest extends
482		*/
483		public void testForkQuietlyJoin() {
484		RecursiveAction a = new CheckedRecursiveAction() {
485	<	public void realCompute() {
485	>	protected void realCompute() {
486		FibAction f = new FibAction(8);
487		assertSame(f, f.fork());
488		f.quietlyJoin();
489		assertEquals(21, f.result);
490	<	assertTrue(f.isDone());
490	>	checkCompletedNormally(f);
491		}};
492		testInvokeOnPool(mainPool(), a);
493		}
494
215	–
495		/**
496		* helpQuiesce returns when tasks are complete.
497		* getQueuedTaskCount returns 0 when quiescent
498		*/
499		public void testForkHelpQuiesce() {
500		RecursiveAction a = new CheckedRecursiveAction() {
501	<	public void realCompute() {
501	>	protected void realCompute() {
502		FibAction f = new FibAction(8);
503		assertSame(f, f.fork());
504	<	f.helpQuiesce();
504	>	helpQuiesce();
505	>	while (!f.isDone()) // wait out race
506	>	;
507		assertEquals(21, f.result);
227	–	assertTrue(f.isDone());
508		assertEquals(0, getQueuedTaskCount());
509	+	checkCompletedNormally(f);
510		}};
511		testInvokeOnPool(mainPool(), a);
512		}
513
233	–
514		/**
515		* invoke task throws exception when task completes abnormally
516		*/
517		public void testAbnormalInvoke() {
518		RecursiveAction a = new CheckedRecursiveAction() {
519	<	public void realCompute() {
519	>	protected void realCompute() {
520		FailingFibAction f = new FailingFibAction(8);
521		try {
522		f.invoke();
523		shouldThrow();
524	<	} catch (FJException success) {}
524	>	} catch (FJException success) {
525	>	checkCompletedAbnormally(f, success);
526	>	}
527		}};
528		testInvokeOnPool(mainPool(), a);
529		}
#	Line 251 | Line 533 | public class RecursiveActionTest extends
533		*/
534		public void testAbnormalQuietlyInvoke() {
535		RecursiveAction a = new CheckedRecursiveAction() {
536	<	public void realCompute() {
536	>	protected void realCompute() {
537		FailingFibAction f = new FailingFibAction(8);
538		f.quietlyInvoke();
539	<	assertTrue(f.isDone());
539	>	assertTrue(f.getException() instanceof FJException);
540	>	checkCompletedAbnormally(f, f.getException());
541		}};
542		testInvokeOnPool(mainPool(), a);
543		}
#	Line 264 | Line 547 | public class RecursiveActionTest extends
547		*/
548		public void testAbnormalForkJoin() {
549		RecursiveAction a = new CheckedRecursiveAction() {
550	<	public void realCompute() {
550	>	protected void realCompute() {
551		FailingFibAction f = new FailingFibAction(8);
552		assertSame(f, f.fork());
553		try {
554		f.join();
555		shouldThrow();
556	<	} catch (FJException success) {}
556	>	} catch (FJException success) {
557	>	checkCompletedAbnormally(f, success);
558	>	}
559		}};
560		testInvokeOnPool(mainPool(), a);
561		}
#	Line 280 | Line 565 | public class RecursiveActionTest extends
565		*/
566		public void testAbnormalForkGet() {
567		RecursiveAction a = new CheckedRecursiveAction() {
568	<	public void realCompute() throws Exception {
568	>	protected void realCompute() throws Exception {
569		FailingFibAction f = new FailingFibAction(8);
570		assertSame(f, f.fork());
571		try {
572		f.get();
573		shouldThrow();
574	<	} catch (ExecutionException success) {}
574	>	} catch (ExecutionException success) {
575	>	Throwable cause = success.getCause();
576	>	assertTrue(cause instanceof FJException);
577	>	checkCompletedAbnormally(f, cause);
578	>	}
579		}};
580		testInvokeOnPool(mainPool(), a);
581		}
#	Line 296 | Line 585 | public class RecursiveActionTest extends
585		*/
586		public void testAbnormalForkTimedGet() {
587		RecursiveAction a = new CheckedRecursiveAction() {
588	<	public void realCompute() throws Exception {
588	>	protected void realCompute() throws Exception {
589		FailingFibAction f = new FailingFibAction(8);
590		assertSame(f, f.fork());
591		try {
592	<	f.get(5L, TimeUnit.SECONDS);
592	>	f.get(5L, SECONDS);
593		shouldThrow();
594	<	} catch (ExecutionException success) {}
594	>	} catch (ExecutionException success) {
595	>	Throwable cause = success.getCause();
596	>	assertTrue(cause instanceof FJException);
597	>	checkCompletedAbnormally(f, cause);
598	>	}
599		}};
600		testInvokeOnPool(mainPool(), a);
601		}
#	Line 312 | Line 605 | public class RecursiveActionTest extends
605		*/
606		public void testAbnormalForkQuietlyJoin() {
607		RecursiveAction a = new CheckedRecursiveAction() {
608	<	public void realCompute() {
608	>	protected void realCompute() {
609		FailingFibAction f = new FailingFibAction(8);
610		assertSame(f, f.fork());
611		f.quietlyJoin();
319	–	assertTrue(f.isDone());
320	–	assertTrue(f.isCompletedAbnormally());
612		assertTrue(f.getException() instanceof FJException);
613	+	checkCompletedAbnormally(f, f.getException());
614		}};
615		testInvokeOnPool(mainPool(), a);
616		}
#	Line 328 | Line 620 | public class RecursiveActionTest extends
620		*/
621		public void testCancelledInvoke() {
622		RecursiveAction a = new CheckedRecursiveAction() {
623	<	public void realCompute() {
623	>	protected void realCompute() {
624		FibAction f = new FibAction(8);
625		assertTrue(f.cancel(true));
626		try {
627		f.invoke();
628		shouldThrow();
629	<	} catch (CancellationException success) {}
629	>	} catch (CancellationException success) {
630	>	checkCancelled(f);
631	>	}
632		}};
633		testInvokeOnPool(mainPool(), a);
634		}
#	Line 344 | Line 638 | public class RecursiveActionTest extends
638		*/
639		public void testCancelledForkJoin() {
640		RecursiveAction a = new CheckedRecursiveAction() {
641	<	public void realCompute() {
641	>	protected void realCompute() {
642		FibAction f = new FibAction(8);
643		assertTrue(f.cancel(true));
644		assertSame(f, f.fork());
645		try {
646		f.join();
647		shouldThrow();
648	<	} catch (CancellationException success) {}
648	>	} catch (CancellationException success) {
649	>	checkCancelled(f);
650	>	}
651		}};
652		testInvokeOnPool(mainPool(), a);
653		}
#	Line 361 | Line 657 | public class RecursiveActionTest extends
657		*/
658		public void testCancelledForkGet() {
659		RecursiveAction a = new CheckedRecursiveAction() {
660	<	public void realCompute() throws Exception {
660	>	protected void realCompute() throws Exception {
661		FibAction f = new FibAction(8);
662		assertTrue(f.cancel(true));
663		assertSame(f, f.fork());
664		try {
665		f.get();
666		shouldThrow();
667	<	} catch (CancellationException success) {}
667	>	} catch (CancellationException success) {
668	>	checkCancelled(f);
669	>	}
670		}};
671		testInvokeOnPool(mainPool(), a);
672		}
#	Line 378 | Line 676 | public class RecursiveActionTest extends
676		*/
677		public void testCancelledForkTimedGet() {
678		RecursiveAction a = new CheckedRecursiveAction() {
679	<	public void realCompute() throws Exception {
679	>	protected void realCompute() throws Exception {
680		FibAction f = new FibAction(8);
681		assertTrue(f.cancel(true));
682		assertSame(f, f.fork());
683		try {
684	<	f.get(5L, TimeUnit.SECONDS);
684	>	f.get(5L, SECONDS);
685		shouldThrow();
686	<	} catch (CancellationException success) {}
686	>	} catch (CancellationException success) {
687	>	checkCancelled(f);
688	>	}
689		}};
690		testInvokeOnPool(mainPool(), a);
691		}
#	Line 395 | Line 695 | public class RecursiveActionTest extends
695		*/
696		public void testCancelledForkQuietlyJoin() {
697		RecursiveAction a = new CheckedRecursiveAction() {
698	<	public void realCompute() {
698	>	protected void realCompute() {
699		FibAction f = new FibAction(8);
700		assertTrue(f.cancel(true));
701		assertSame(f, f.fork());
702		f.quietlyJoin();
703	<	assertTrue(f.isDone());
404	<	assertTrue(f.isCompletedAbnormally());
405	<	assertTrue(f.isCancelled());
406	<	assertTrue(f.getException() instanceof CancellationException);
703	>	checkCancelled(f);
704		}};
705		testInvokeOnPool(mainPool(), a);
706		}
#	Line 414 | Line 711 | public class RecursiveActionTest extends
711		public void testGetPool() {
712		final ForkJoinPool mainPool = mainPool();
713		RecursiveAction a = new CheckedRecursiveAction() {
714	<	public void realCompute() {
714	>	protected void realCompute() {
715		assertSame(mainPool, getPool());
716		}};
717		testInvokeOnPool(mainPool, a);
#	Line 425 | Line 722 | public class RecursiveActionTest extends
722		*/
723		public void testGetPool2() {
724		RecursiveAction a = new CheckedRecursiveAction() {
725	<	public void realCompute() {
725	>	protected void realCompute() {
726		assertNull(getPool());
727		}};
728		assertNull(a.invoke());
#	Line 436 | Line 733 | public class RecursiveActionTest extends
733		*/
734		public void testInForkJoinPool() {
735		RecursiveAction a = new CheckedRecursiveAction() {
736	<	public void realCompute() {
736	>	protected void realCompute() {
737		assertTrue(inForkJoinPool());
738		}};
739		testInvokeOnPool(mainPool(), a);
#	Line 447 | Line 744 | public class RecursiveActionTest extends
744		*/
745		public void testInForkJoinPool2() {
746		RecursiveAction a = new CheckedRecursiveAction() {
747	<	public void realCompute() {
747	>	protected void realCompute() {
748		assertFalse(inForkJoinPool());
749		}};
750		assertNull(a.invoke());
#	Line 459 | Line 756 | public class RecursiveActionTest extends
756		public void testWorkerGetPool() {
757		final ForkJoinPool mainPool = mainPool();
758		RecursiveAction a = new CheckedRecursiveAction() {
759	<	public void realCompute() {
759	>	protected void realCompute() {
760		ForkJoinWorkerThread w =
761		(ForkJoinWorkerThread) Thread.currentThread();
762		assertSame(mainPool, w.getPool());
#	Line 473 | Line 770 | public class RecursiveActionTest extends
770		public void testWorkerGetPoolIndex() {
771		final ForkJoinPool mainPool = mainPool();
772		RecursiveAction a = new CheckedRecursiveAction() {
773	<	public void realCompute() {
773	>	protected void realCompute() {
774		ForkJoinWorkerThread w =
775	<	(ForkJoinWorkerThread)(Thread.currentThread());
776	<	int idx = w.getPoolIndex();
777	<	assertTrue(idx >= 0);
778	<	assertTrue(idx < mainPool.getPoolSize());
775	>	(ForkJoinWorkerThread) Thread.currentThread();
776	>	assertTrue(w.getPoolIndex() >= 0);
777	>	// pool size can shrink after assigning index, so cannot check
778	>	// assertTrue(w.getPoolIndex() < mainPool.getPoolSize());
779		}};
780		testInvokeOnPool(mainPool, a);
781		}
782
486	–
783		/**
784		* setRawResult(null) succeeds
785		*/
786		public void testSetRawResult() {
787		RecursiveAction a = new CheckedRecursiveAction() {
788	<	public void realCompute() {
788	>	protected void realCompute() {
789		setRawResult(null);
790	+	assertNull(getRawResult());
791		}};
792		assertNull(a.invoke());
793		}
794
795		/**
796	<	* A reinitialized task may be re-invoked
796	>	* A reinitialized normally completed task may be re-invoked
797		*/
798		public void testReinitialize() {
799		RecursiveAction a = new CheckedRecursiveAction() {
800	<	public void realCompute() {
800	>	protected void realCompute() {
801		FibAction f = new FibAction(8);
802	<	assertNull(f.invoke());
803	<	assertEquals(21, f.result);
804	<	assertTrue(f.isDone());
805	<	assertFalse(f.isCancelled());
806	<	assertFalse(f.isCompletedAbnormally());
807	<	f.reinitialize();
808	<	assertNull(f.invoke());
809	<	assertEquals(21, f.result);
802	>	checkNotDone(f);
803	>
804	>	for (int i = 0; i < 3; i++) {
805	>	assertNull(f.invoke());
806	>	assertEquals(21, f.result);
807	>	checkCompletedNormally(f);
808	>	f.reinitialize();
809	>	checkNotDone(f);
810	>	}
811	>	}};
812	>	testInvokeOnPool(mainPool(), a);
813	>	}
814	>
815	>	/**
816	>	* A reinitialized abnormally completed task may be re-invoked
817	>	*/
818	>	public void testReinitializeAbnormal() {
819	>	RecursiveAction a = new CheckedRecursiveAction() {
820	>	protected void realCompute() {
821	>	FailingFibAction f = new FailingFibAction(8);
822	>	checkNotDone(f);
823	>
824	>	for (int i = 0; i < 3; i++) {
825	>	try {
826	>	f.invoke();
827	>	shouldThrow();
828	>	} catch (FJException success) {
829	>	checkCompletedAbnormally(f, success);
830	>	}
831	>	f.reinitialize();
832	>	checkNotDone(f);
833	>	}
834		}};
835		testInvokeOnPool(mainPool(), a);
836		}
#	Line 519 | Line 840 | public class RecursiveActionTest extends
840		*/
841		public void testCompleteExceptionally() {
842		RecursiveAction a = new CheckedRecursiveAction() {
843	<	public void realCompute() {
843	>	protected void realCompute() {
844		FibAction f = new FibAction(8);
845		f.completeExceptionally(new FJException());
846		try {
847		f.invoke();
848		shouldThrow();
849	<	} catch (FJException success) {}
849	>	} catch (FJException success) {
850	>	checkCompletedAbnormally(f, success);
851	>	}
852		}};
853		testInvokeOnPool(mainPool(), a);
854		}
#	Line 535 | Line 858 | public class RecursiveActionTest extends
858		*/
859		public void testComplete() {
860		RecursiveAction a = new CheckedRecursiveAction() {
861	<	public void realCompute() {
861	>	protected void realCompute() {
862		FibAction f = new FibAction(8);
863		f.complete(null);
864		assertNull(f.invoke());
542	–	assertTrue(f.isDone());
865		assertEquals(0, f.result);
866	+	checkCompletedNormally(f);
867		}};
868		testInvokeOnPool(mainPool(), a);
869		}
#	Line 550 | Line 873 | public class RecursiveActionTest extends
873		*/
874		public void testInvokeAll2() {
875		RecursiveAction a = new CheckedRecursiveAction() {
876	<	public void realCompute() {
876	>	protected void realCompute() {
877		FibAction f = new FibAction(8);
878		FibAction g = new FibAction(9);
879		invokeAll(f, g);
880	<	assertTrue(f.isDone());
880	>	checkCompletedNormally(f);
881		assertEquals(21, f.result);
882	<	assertTrue(g.isDone());
882	>	checkCompletedNormally(g);
883		assertEquals(34, g.result);
884		}};
885		testInvokeOnPool(mainPool(), a);
#	Line 567 | Line 890 | public class RecursiveActionTest extends
890		*/
891		public void testInvokeAll1() {
892		RecursiveAction a = new CheckedRecursiveAction() {
893	<	public void realCompute() {
893	>	protected void realCompute() {
894		FibAction f = new FibAction(8);
895		invokeAll(f);
896	<	assertTrue(f.isDone());
896	>	checkCompletedNormally(f);
897		assertEquals(21, f.result);
898		}};
899		testInvokeOnPool(mainPool(), a);
#	Line 581 | Line 904 | public class RecursiveActionTest extends
904		*/
905		public void testInvokeAll3() {
906		RecursiveAction a = new CheckedRecursiveAction() {
907	<	public void realCompute() {
907	>	protected void realCompute() {
908		FibAction f = new FibAction(8);
909		FibAction g = new FibAction(9);
910		FibAction h = new FibAction(7);
911		invokeAll(f, g, h);
912		assertTrue(f.isDone());
590	–	assertEquals(21, f.result);
913		assertTrue(g.isDone());
592	–	assertEquals(34, g.result);
914		assertTrue(h.isDone());
915	+	checkCompletedNormally(f);
916	+	assertEquals(21, f.result);
917	+	checkCompletedNormally(g);
918	+	assertEquals(34, g.result);
919	+	checkCompletedNormally(g);
920		assertEquals(13, h.result);
921		}};
922		testInvokeOnPool(mainPool(), a);
#	Line 601 | Line 927 | public class RecursiveActionTest extends
927		*/
928		public void testInvokeAllCollection() {
929		RecursiveAction a = new CheckedRecursiveAction() {
930	<	public void realCompute() {
930	>	protected void realCompute() {
931		FibAction f = new FibAction(8);
932		FibAction g = new FibAction(9);
933		FibAction h = new FibAction(7);
#	Line 611 | Line 937 | public class RecursiveActionTest extends
937		set.add(h);
938		invokeAll(set);
939		assertTrue(f.isDone());
614	–	assertEquals(21, f.result);
940		assertTrue(g.isDone());
616	–	assertEquals(34, g.result);
941		assertTrue(h.isDone());
942	+	checkCompletedNormally(f);
943	+	assertEquals(21, f.result);
944	+	checkCompletedNormally(g);
945	+	assertEquals(34, g.result);
946	+	checkCompletedNormally(g);
947		assertEquals(13, h.result);
948		}};
949		testInvokeOnPool(mainPool(), a);
950		}
951
623	–
952		/**
953		* invokeAll(tasks) with any null task throws NPE
954		*/
955		public void testInvokeAllNPE() {
956		RecursiveAction a = new CheckedRecursiveAction() {
957	<	public void realCompute() {
957	>	protected void realCompute() {
958		FibAction f = new FibAction(8);
959		FibAction g = new FibAction(9);
960		FibAction h = null;
#	Line 643 | Line 971 | public class RecursiveActionTest extends
971		*/
972		public void testAbnormalInvokeAll2() {
973		RecursiveAction a = new CheckedRecursiveAction() {
974	<	public void realCompute() {
974	>	protected void realCompute() {
975		FibAction f = new FibAction(8);
976		FailingFibAction g = new FailingFibAction(9);
977		try {
978		invokeAll(f, g);
979		shouldThrow();
980	<	} catch (FJException success) {}
980	>	} catch (FJException success) {
981	>	checkCompletedAbnormally(g, success);
982	>	}
983		}};
984		testInvokeOnPool(mainPool(), a);
985		}
#	Line 659 | Line 989 | public class RecursiveActionTest extends
989		*/
990		public void testAbnormalInvokeAll1() {
991		RecursiveAction a = new CheckedRecursiveAction() {
992	<	public void realCompute() {
992	>	protected void realCompute() {
993		FailingFibAction g = new FailingFibAction(9);
994		try {
995		invokeAll(g);
996		shouldThrow();
997	<	} catch (FJException success) {}
997	>	} catch (FJException success) {
998	>	checkCompletedAbnormally(g, success);
999	>	}
1000		}};
1001		testInvokeOnPool(mainPool(), a);
1002		}
#	Line 674 | Line 1006 | public class RecursiveActionTest extends
1006		*/
1007		public void testAbnormalInvokeAll3() {
1008		RecursiveAction a = new CheckedRecursiveAction() {
1009	<	public void realCompute() {
1009	>	protected void realCompute() {
1010		FibAction f = new FibAction(8);
1011		FailingFibAction g = new FailingFibAction(9);
1012		FibAction h = new FibAction(7);
1013		try {
1014		invokeAll(f, g, h);
1015		shouldThrow();
1016	<	} catch (FJException success) {}
1016	>	} catch (FJException success) {
1017	>	checkCompletedAbnormally(g, success);
1018	>	}
1019		}};
1020		testInvokeOnPool(mainPool(), a);
1021		}
#	Line 691 | Line 1025 | public class RecursiveActionTest extends
1025		*/
1026		public void testAbnormalInvokeAllCollection() {
1027		RecursiveAction a = new CheckedRecursiveAction() {
1028	<	public void realCompute() {
1028	>	protected void realCompute() {
1029		FailingFibAction f = new FailingFibAction(8);
1030		FibAction g = new FibAction(9);
1031		FibAction h = new FibAction(7);
#	Line 702 | Line 1036 | public class RecursiveActionTest extends
1036		try {
1037		invokeAll(set);
1038		shouldThrow();
1039	<	} catch (FJException success) {}
1039	>	} catch (FJException success) {
1040	>	checkCompletedAbnormally(f, success);
1041	>	}
1042		}};
1043		testInvokeOnPool(mainPool(), a);
1044		}
#	Line 713 | Line 1049 | public class RecursiveActionTest extends
1049		*/
1050		public void testTryUnfork() {
1051		RecursiveAction a = new CheckedRecursiveAction() {
1052	<	public void realCompute() {
1052	>	protected void realCompute() {
1053		FibAction g = new FibAction(9);
1054		assertSame(g, g.fork());
1055		FibAction f = new FibAction(8);
1056		assertSame(f, f.fork());
1057		assertTrue(f.tryUnfork());
1058		helpQuiesce();
1059	<	assertFalse(f.isDone());
1060	<	assertTrue(g.isDone());
1059	>	checkNotDone(f);
1060	>	checkCompletedNormally(g);
1061		}};
1062		testInvokeOnPool(singletonPool(), a);
1063		}
#	Line 732 | Line 1068 | public class RecursiveActionTest extends
1068		*/
1069		public void testGetSurplusQueuedTaskCount() {
1070		RecursiveAction a = new CheckedRecursiveAction() {
1071	<	public void realCompute() {
1071	>	protected void realCompute() {
1072		FibAction h = new FibAction(7);
1073		assertSame(h, h.fork());
1074		FibAction g = new FibAction(9);
#	Line 741 | Line 1077 | public class RecursiveActionTest extends
1077		assertSame(f, f.fork());
1078		assertTrue(getSurplusQueuedTaskCount() > 0);
1079		helpQuiesce();
1080	+	assertEquals(0, getSurplusQueuedTaskCount());
1081	+	checkCompletedNormally(f);
1082	+	checkCompletedNormally(g);
1083	+	checkCompletedNormally(h);
1084		}};
1085		testInvokeOnPool(singletonPool(), a);
1086		}
#	Line 750 | Line 1090 | public class RecursiveActionTest extends
1090		*/
1091		public void testPeekNextLocalTask() {
1092		RecursiveAction a = new CheckedRecursiveAction() {
1093	<	public void realCompute() {
1093	>	protected void realCompute() {
1094		FibAction g = new FibAction(9);
1095		assertSame(g, g.fork());
1096		FibAction f = new FibAction(8);
1097		assertSame(f, f.fork());
1098		assertSame(f, peekNextLocalTask());
1099		assertNull(f.join());
1100	<	assertTrue(f.isDone());
1100	>	checkCompletedNormally(f);
1101		helpQuiesce();
1102	+	checkCompletedNormally(f);
1103	+	checkCompletedNormally(g);
1104		}};
1105		testInvokeOnPool(singletonPool(), a);
1106		}
#	Line 769 | Line 1111 | public class RecursiveActionTest extends
1111		*/
1112		public void testPollNextLocalTask() {
1113		RecursiveAction a = new CheckedRecursiveAction() {
1114	<	public void realCompute() {
1114	>	protected void realCompute() {
1115		FibAction g = new FibAction(9);
1116		assertSame(g, g.fork());
1117		FibAction f = new FibAction(8);
1118		assertSame(f, f.fork());
1119		assertSame(f, pollNextLocalTask());
1120		helpQuiesce();
1121	<	assertFalse(f.isDone());
1121	>	checkNotDone(f);
1122	>	checkCompletedNormally(g);
1123		}};
1124		testInvokeOnPool(singletonPool(), a);
1125		}
1126
1127		/**
1128	<	* pollTask returns an unexecuted task
786	<	* without executing it
1128	>	* pollTask returns an unexecuted task without executing it
1129		*/
1130		public void testPollTask() {
1131		RecursiveAction a = new CheckedRecursiveAction() {
1132	<	public void realCompute() {
1132	>	protected void realCompute() {
1133		FibAction g = new FibAction(9);
1134		assertSame(g, g.fork());
1135		FibAction f = new FibAction(8);
1136		assertSame(f, f.fork());
1137		assertSame(f, pollTask());
1138		helpQuiesce();
1139	<	assertFalse(f.isDone());
1140	<	assertTrue(g.isDone());
1139	>	checkNotDone(f);
1140	>	checkCompletedNormally(g);
1141		}};
1142		testInvokeOnPool(singletonPool(), a);
1143		}
#	Line 805 | Line 1147 | public class RecursiveActionTest extends
1147		*/
1148		public void testPeekNextLocalTaskAsync() {
1149		RecursiveAction a = new CheckedRecursiveAction() {
1150	<	public void realCompute() {
1150	>	protected void realCompute() {
1151		FibAction g = new FibAction(9);
1152		assertSame(g, g.fork());
1153		FibAction f = new FibAction(8);
#	Line 813 | Line 1155 | public class RecursiveActionTest extends
1155		assertSame(g, peekNextLocalTask());
1156		assertNull(f.join());
1157		helpQuiesce();
1158	<	assertTrue(f.isDone());
1158	>	checkCompletedNormally(f);
1159	>	checkCompletedNormally(g);
1160		}};
1161		testInvokeOnPool(asyncSingletonPool(), a);
1162		}
1163
1164		/**
1165	<	* pollNextLocalTask returns least recent unexecuted task
1166	<	* without executing it, in async mode
1165	>	* pollNextLocalTask returns least recent unexecuted task without
1166	>	* executing it, in async mode
1167		*/
1168		public void testPollNextLocalTaskAsync() {
1169		RecursiveAction a = new CheckedRecursiveAction() {
1170	<	public void realCompute() {
1170	>	protected void realCompute() {
1171		FibAction g = new FibAction(9);
1172		assertSame(g, g.fork());
1173		FibAction f = new FibAction(8);
1174		assertSame(f, f.fork());
1175		assertSame(g, pollNextLocalTask());
1176		helpQuiesce();
1177	<	assertTrue(f.isDone());
1178	<	assertFalse(g.isDone());
1177	>	checkCompletedNormally(f);
1178	>	checkNotDone(g);
1179		}};
1180		testInvokeOnPool(asyncSingletonPool(), a);
1181		}
1182
1183		/**
1184	<	* pollTask returns an unexecuted task
1185	<	* without executing it, in async mode
1184	>	* pollTask returns an unexecuted task without executing it, in
1185	>	* async mode
1186		*/
1187		public void testPollTaskAsync() {
1188		RecursiveAction a = new CheckedRecursiveAction() {
1189	<	public void realCompute() {
1189	>	protected void realCompute() {
1190		FibAction g = new FibAction(9);
1191		assertSame(g, g.fork());
1192		FibAction f = new FibAction(8);
1193		assertSame(f, f.fork());
1194		assertSame(g, pollTask());
1195		helpQuiesce();
1196	<	assertTrue(f.isDone());
1197	<	assertFalse(g.isDone());
1196	>	checkCompletedNormally(f);
1197	>	checkNotDone(g);
1198		}};
1199		testInvokeOnPool(asyncSingletonPool(), a);
1200		}
1201
1202	+	/** Demo from RecursiveAction javadoc */
1203	+	static class SortTask extends RecursiveAction {
1204	+	final long[] array; final int lo, hi;
1205	+	SortTask(long[] array, int lo, int hi) {
1206	+	this.array = array; this.lo = lo; this.hi = hi;
1207	+	}
1208	+	SortTask(long[] array) { this(array, 0, array.length); }
1209	+	protected void compute() {
1210	+	if (hi - lo < THRESHOLD)
1211	+	sortSequentially(lo, hi);
1212	+	else {
1213	+	int mid = (lo + hi) >>> 1;
1214	+	invokeAll(new SortTask(array, lo, mid),
1215	+	new SortTask(array, mid, hi));
1216	+	merge(lo, mid, hi);
1217	+	}
1218	+	}
1219	+	// implementation details follow:
1220	+	static final int THRESHOLD = 100;
1221	+	void sortSequentially(int lo, int hi) {
1222	+	Arrays.sort(array, lo, hi);
1223	+	}
1224	+	void merge(int lo, int mid, int hi) {
1225	+	long[] buf = Arrays.copyOfRange(array, lo, mid);
1226	+	for (int i = 0, j = lo, k = mid; i < buf.length; j++)
1227	+	array[j] = (k == hi || buf[i] < array[k]) ?
1228	+	buf[i++] : array[k++];
1229	+	}
1230	+	}
1231	+
1232	+	/**
1233	+	* SortTask demo works as advertised
1234	+	*/
1235	+	public void testSortTaskDemo() {
1236	+	ThreadLocalRandom rnd = ThreadLocalRandom.current();
1237	+	long[] array = new long[1007];
1238	+	for (int i = 0; i < array.length; i++)
1239	+	array[i] = rnd.nextLong();
1240	+	long[] arrayClone = array.clone();
1241	+	testInvokeOnPool(mainPool(), new SortTask(array));
1242	+	Arrays.sort(arrayClone);
1243	+	assertTrue(Arrays.equals(array, arrayClone));
1244	+	}
1245		}

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines