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 |
< |
import java.util.concurrent.ExecutionException; |
6 |
> |
|
7 |
> |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
8 |
> |
import static java.util.concurrent.TimeUnit.SECONDS; |
9 |
> |
|
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; |
10 |
– |
import java.util.concurrent.ForkJoinWorkerThread; |
15 |
|
import java.util.concurrent.RecursiveAction; |
12 |
– |
import java.util.concurrent.TimeUnit; |
16 |
|
import java.util.concurrent.TimeoutException; |
17 |
|
import java.util.concurrent.atomic.AtomicIntegerFieldUpdater; |
18 |
< |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
19 |
< |
import static java.util.concurrent.TimeUnit.SECONDS; |
20 |
< |
import java.util.HashSet; |
18 |
< |
import junit.framework.*; |
18 |
> |
|
19 |
> |
import junit.framework.Test; |
20 |
> |
import junit.framework.TestSuite; |
21 |
|
|
22 |
|
public class ForkJoinTaskTest extends JSR166TestCase { |
23 |
|
|
24 |
|
public static void main(String[] args) { |
25 |
< |
junit.textui.TestRunner.run(suite()); |
25 |
> |
main(suite(), args); |
26 |
|
} |
27 |
|
|
28 |
|
public static Test suite() { |
48 |
|
} |
49 |
|
|
50 |
|
private void testInvokeOnPool(ForkJoinPool pool, RecursiveAction a) { |
51 |
< |
try { |
51 |
> |
try (PoolCleaner cleaner = cleaner(pool)) { |
52 |
|
assertFalse(a.isDone()); |
53 |
|
assertFalse(a.isCompletedNormally()); |
54 |
|
assertFalse(a.isCompletedAbnormally()); |
64 |
|
assertFalse(a.isCancelled()); |
65 |
|
assertNull(a.getException()); |
66 |
|
assertNull(a.getRawResult()); |
65 |
– |
} finally { |
66 |
– |
joinPool(pool); |
67 |
|
} |
68 |
|
} |
69 |
|
|
96 |
|
|
97 |
|
{ |
98 |
|
Thread.currentThread().interrupt(); |
99 |
< |
long t0 = System.nanoTime(); |
99 |
> |
long startTime = System.nanoTime(); |
100 |
|
assertSame(expected, a.join()); |
101 |
< |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
101 |
> |
assertTrue(millisElapsedSince(startTime) < SMALL_DELAY_MS); |
102 |
|
Thread.interrupted(); |
103 |
|
} |
104 |
|
|
105 |
|
{ |
106 |
|
Thread.currentThread().interrupt(); |
107 |
< |
long t0 = System.nanoTime(); |
107 |
> |
long startTime = System.nanoTime(); |
108 |
|
a.quietlyJoin(); // should be no-op |
109 |
< |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
109 |
> |
assertTrue(millisElapsedSince(startTime) < SMALL_DELAY_MS); |
110 |
|
Thread.interrupted(); |
111 |
|
} |
112 |
|
|
139 |
|
Thread.interrupted(); |
140 |
|
|
141 |
|
{ |
142 |
< |
long t0 = System.nanoTime(); |
142 |
> |
long startTime = System.nanoTime(); |
143 |
|
a.quietlyJoin(); // should be no-op |
144 |
< |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
144 |
> |
assertTrue(millisElapsedSince(startTime) < SMALL_DELAY_MS); |
145 |
|
} |
146 |
|
|
147 |
|
try { |
177 |
|
Thread.interrupted(); |
178 |
|
|
179 |
|
{ |
180 |
< |
long t0 = System.nanoTime(); |
180 |
> |
long startTime = System.nanoTime(); |
181 |
|
a.quietlyJoin(); // should be no-op |
182 |
< |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
182 |
> |
assertTrue(millisElapsedSince(startTime) < SMALL_DELAY_MS); |
183 |
|
} |
184 |
|
|
185 |
|
try { |
216 |
|
AtomicIntegerFieldUpdater.newUpdater(BinaryAsyncAction.class, |
217 |
|
"controlState"); |
218 |
|
|
219 |
< |
private BinaryAsyncAction parent; |
219 |
> |
private volatile BinaryAsyncAction parent; |
220 |
|
|
221 |
< |
private BinaryAsyncAction sibling; |
221 |
> |
private volatile BinaryAsyncAction sibling; |
222 |
|
|
223 |
|
protected BinaryAsyncAction() { |
224 |
|
} |
349 |
|
} |
350 |
|
} |
351 |
|
|
352 |
– |
|
352 |
|
static final class FailingAsyncFib extends BinaryAsyncAction { |
353 |
|
int number; |
354 |
|
public FailingAsyncFib(int n) { |
384 |
|
*/ |
385 |
|
public void testInvoke() { |
386 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
387 |
< |
public void realCompute() { |
387 |
> |
protected void realCompute() { |
388 |
|
AsyncFib f = new AsyncFib(8); |
389 |
|
assertNull(f.invoke()); |
390 |
|
assertEquals(21, f.number); |
400 |
|
*/ |
401 |
|
public void testQuietlyInvoke() { |
402 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
403 |
< |
public void realCompute() { |
403 |
> |
protected void realCompute() { |
404 |
|
AsyncFib f = new AsyncFib(8); |
405 |
|
f.quietlyInvoke(); |
406 |
|
assertEquals(21, f.number); |
414 |
|
*/ |
415 |
|
public void testForkJoin() { |
416 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
417 |
< |
public void realCompute() { |
417 |
> |
protected void realCompute() { |
418 |
|
AsyncFib f = new AsyncFib(8); |
419 |
|
assertSame(f, f.fork()); |
420 |
|
assertNull(f.join()); |
429 |
|
*/ |
430 |
|
public void testForkGet() { |
431 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
432 |
< |
public void realCompute() throws Exception { |
432 |
> |
protected void realCompute() throws Exception { |
433 |
|
AsyncFib f = new AsyncFib(8); |
434 |
|
assertSame(f, f.fork()); |
435 |
|
assertNull(f.get()); |
444 |
|
*/ |
445 |
|
public void testForkTimedGet() { |
446 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
447 |
< |
public void realCompute() throws Exception { |
447 |
> |
protected void realCompute() throws Exception { |
448 |
|
AsyncFib f = new AsyncFib(8); |
449 |
|
assertSame(f, f.fork()); |
450 |
|
assertNull(f.get(LONG_DELAY_MS, MILLISECONDS)); |
459 |
|
*/ |
460 |
|
public void testForkTimedGetNPE() { |
461 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
462 |
< |
public void realCompute() throws Exception { |
462 |
> |
protected void realCompute() throws Exception { |
463 |
|
AsyncFib f = new AsyncFib(8); |
464 |
|
assertSame(f, f.fork()); |
465 |
|
try { |
475 |
|
*/ |
476 |
|
public void testForkQuietlyJoin() { |
477 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
478 |
< |
public void realCompute() { |
478 |
> |
protected void realCompute() { |
479 |
|
AsyncFib f = new AsyncFib(8); |
480 |
|
assertSame(f, f.fork()); |
481 |
|
f.quietlyJoin(); |
485 |
|
testInvokeOnPool(mainPool(), a); |
486 |
|
} |
487 |
|
|
489 |
– |
|
488 |
|
/** |
489 |
|
* helpQuiesce returns when tasks are complete. |
490 |
|
* getQueuedTaskCount returns 0 when quiescent |
491 |
|
*/ |
492 |
|
public void testForkHelpQuiesce() { |
493 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
494 |
< |
public void realCompute() { |
494 |
> |
protected void realCompute() { |
495 |
|
AsyncFib f = new AsyncFib(8); |
496 |
|
assertSame(f, f.fork()); |
497 |
< |
f.helpQuiesce(); |
497 |
> |
helpQuiesce(); |
498 |
|
assertEquals(21, f.number); |
499 |
|
assertEquals(0, getQueuedTaskCount()); |
500 |
|
checkCompletedNormally(f); |
502 |
|
testInvokeOnPool(mainPool(), a); |
503 |
|
} |
504 |
|
|
507 |
– |
|
505 |
|
/** |
506 |
|
* invoke task throws exception when task completes abnormally |
507 |
|
*/ |
508 |
|
public void testAbnormalInvoke() { |
509 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
510 |
< |
public void realCompute() { |
510 |
> |
protected void realCompute() { |
511 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
512 |
|
try { |
513 |
|
f.invoke(); |
524 |
|
*/ |
525 |
|
public void testAbnormalQuietlyInvoke() { |
526 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
527 |
< |
public void realCompute() { |
527 |
> |
protected void realCompute() { |
528 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
529 |
|
f.quietlyInvoke(); |
530 |
|
assertTrue(f.getException() instanceof FJException); |
538 |
|
*/ |
539 |
|
public void testAbnormalForkJoin() { |
540 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
541 |
< |
public void realCompute() { |
541 |
> |
protected void realCompute() { |
542 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
543 |
|
assertSame(f, f.fork()); |
544 |
|
try { |
556 |
|
*/ |
557 |
|
public void testAbnormalForkGet() { |
558 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
559 |
< |
public void realCompute() throws Exception { |
559 |
> |
protected void realCompute() throws Exception { |
560 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
561 |
|
assertSame(f, f.fork()); |
562 |
|
try { |
576 |
|
*/ |
577 |
|
public void testAbnormalForkTimedGet() { |
578 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
579 |
< |
public void realCompute() throws Exception { |
579 |
> |
protected void realCompute() throws Exception { |
580 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
581 |
|
assertSame(f, f.fork()); |
582 |
|
try { |
596 |
|
*/ |
597 |
|
public void testAbnormalForkQuietlyJoin() { |
598 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
599 |
< |
public void realCompute() { |
599 |
> |
protected void realCompute() { |
600 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
601 |
|
assertSame(f, f.fork()); |
602 |
|
f.quietlyJoin(); |
611 |
|
*/ |
612 |
|
public void testCancelledInvoke() { |
613 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
614 |
< |
public void realCompute() { |
614 |
> |
protected void realCompute() { |
615 |
|
AsyncFib f = new AsyncFib(8); |
616 |
|
assertTrue(f.cancel(true)); |
617 |
|
try { |
629 |
|
*/ |
630 |
|
public void testCancelledForkJoin() { |
631 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
632 |
< |
public void realCompute() { |
632 |
> |
protected void realCompute() { |
633 |
|
AsyncFib f = new AsyncFib(8); |
634 |
|
assertTrue(f.cancel(true)); |
635 |
|
assertSame(f, f.fork()); |
648 |
|
*/ |
649 |
|
public void testCancelledForkGet() { |
650 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
651 |
< |
public void realCompute() throws Exception { |
651 |
> |
protected void realCompute() throws Exception { |
652 |
|
AsyncFib f = new AsyncFib(8); |
653 |
|
assertTrue(f.cancel(true)); |
654 |
|
assertSame(f, f.fork()); |
667 |
|
*/ |
668 |
|
public void testCancelledForkTimedGet() throws Exception { |
669 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
670 |
< |
public void realCompute() throws Exception { |
670 |
> |
protected void realCompute() throws Exception { |
671 |
|
AsyncFib f = new AsyncFib(8); |
672 |
|
assertTrue(f.cancel(true)); |
673 |
|
assertSame(f, f.fork()); |
686 |
|
*/ |
687 |
|
public void testCancelledForkQuietlyJoin() { |
688 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
689 |
< |
public void realCompute() { |
689 |
> |
protected void realCompute() { |
690 |
|
AsyncFib f = new AsyncFib(8); |
691 |
|
assertTrue(f.cancel(true)); |
692 |
|
assertSame(f, f.fork()); |
702 |
|
public void testGetPool() { |
703 |
|
final ForkJoinPool mainPool = mainPool(); |
704 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
705 |
< |
public void realCompute() { |
705 |
> |
protected void realCompute() { |
706 |
|
assertSame(mainPool, getPool()); |
707 |
|
}}; |
708 |
|
testInvokeOnPool(mainPool, a); |
713 |
|
*/ |
714 |
|
public void testGetPool2() { |
715 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
716 |
< |
public void realCompute() { |
716 |
> |
protected void realCompute() { |
717 |
|
assertNull(getPool()); |
718 |
|
}}; |
719 |
|
assertNull(a.invoke()); |
724 |
|
*/ |
725 |
|
public void testInForkJoinPool() { |
726 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
727 |
< |
public void realCompute() { |
727 |
> |
protected void realCompute() { |
728 |
|
assertTrue(inForkJoinPool()); |
729 |
|
}}; |
730 |
|
testInvokeOnPool(mainPool(), a); |
735 |
|
*/ |
736 |
|
public void testInForkJoinPool2() { |
737 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
738 |
< |
public void realCompute() { |
738 |
> |
protected void realCompute() { |
739 |
|
assertFalse(inForkJoinPool()); |
740 |
|
}}; |
741 |
|
assertNull(a.invoke()); |
746 |
|
*/ |
747 |
|
public void testSetRawResult() { |
748 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
749 |
< |
public void realCompute() { |
749 |
> |
protected void realCompute() { |
750 |
|
setRawResult(null); |
751 |
|
assertNull(getRawResult()); |
752 |
|
}}; |
758 |
|
*/ |
759 |
|
public void testCompleteExceptionally() { |
760 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
761 |
< |
public void realCompute() { |
761 |
> |
protected void realCompute() { |
762 |
|
AsyncFib f = new AsyncFib(8); |
763 |
|
f.completeExceptionally(new FJException()); |
764 |
|
try { |
776 |
|
*/ |
777 |
|
public void testInvokeAll2() { |
778 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
779 |
< |
public void realCompute() { |
779 |
> |
protected void realCompute() { |
780 |
|
AsyncFib f = new AsyncFib(8); |
781 |
|
AsyncFib g = new AsyncFib(9); |
782 |
|
invokeAll(f, g); |
793 |
|
*/ |
794 |
|
public void testInvokeAll1() { |
795 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
796 |
< |
public void realCompute() { |
796 |
> |
protected void realCompute() { |
797 |
|
AsyncFib f = new AsyncFib(8); |
798 |
|
invokeAll(f); |
799 |
|
checkCompletedNormally(f); |
807 |
|
*/ |
808 |
|
public void testInvokeAll3() { |
809 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
810 |
< |
public void realCompute() { |
810 |
> |
protected void realCompute() { |
811 |
|
AsyncFib f = new AsyncFib(8); |
812 |
|
AsyncFib g = new AsyncFib(9); |
813 |
|
AsyncFib h = new AsyncFib(7); |
827 |
|
*/ |
828 |
|
public void testInvokeAllCollection() { |
829 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
830 |
< |
public void realCompute() { |
830 |
> |
protected void realCompute() { |
831 |
|
AsyncFib f = new AsyncFib(8); |
832 |
|
AsyncFib g = new AsyncFib(9); |
833 |
|
AsyncFib h = new AsyncFib(7); |
846 |
|
testInvokeOnPool(mainPool(), a); |
847 |
|
} |
848 |
|
|
852 |
– |
|
849 |
|
/** |
850 |
|
* invokeAll(tasks) with any null task throws NPE |
851 |
|
*/ |
852 |
|
public void testInvokeAllNPE() { |
853 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
854 |
< |
public void realCompute() { |
854 |
> |
protected void realCompute() { |
855 |
|
AsyncFib f = new AsyncFib(8); |
856 |
|
AsyncFib g = new AsyncFib(9); |
857 |
|
AsyncFib h = null; |
868 |
|
*/ |
869 |
|
public void testAbnormalInvokeAll2() { |
870 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
871 |
< |
public void realCompute() { |
871 |
> |
protected void realCompute() { |
872 |
|
AsyncFib f = new AsyncFib(8); |
873 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
874 |
|
try { |
886 |
|
*/ |
887 |
|
public void testAbnormalInvokeAll1() { |
888 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
889 |
< |
public void realCompute() { |
889 |
> |
protected void realCompute() { |
890 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
891 |
|
try { |
892 |
|
invokeAll(g); |
903 |
|
*/ |
904 |
|
public void testAbnormalInvokeAll3() { |
905 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
906 |
< |
public void realCompute() { |
906 |
> |
protected void realCompute() { |
907 |
|
AsyncFib f = new AsyncFib(8); |
908 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
909 |
|
AsyncFib h = new AsyncFib(7); |
918 |
|
} |
919 |
|
|
920 |
|
/** |
921 |
< |
* invokeAll(collection) throws exception if any task does |
921 |
> |
* invokeAll(collection) throws exception if any task does |
922 |
|
*/ |
923 |
|
public void testAbnormalInvokeAllCollection() { |
924 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
925 |
< |
public void realCompute() { |
925 |
> |
protected void realCompute() { |
926 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
927 |
|
AsyncFib g = new AsyncFib(9); |
928 |
|
AsyncFib h = new AsyncFib(7); |
946 |
|
*/ |
947 |
|
public void testTryUnfork() { |
948 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
949 |
< |
public void realCompute() { |
949 |
> |
protected void realCompute() { |
950 |
|
AsyncFib g = new AsyncFib(9); |
951 |
|
assertSame(g, g.fork()); |
952 |
|
AsyncFib f = new AsyncFib(8); |
965 |
|
*/ |
966 |
|
public void testGetSurplusQueuedTaskCount() { |
967 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
968 |
< |
public void realCompute() { |
968 |
> |
protected void realCompute() { |
969 |
|
AsyncFib h = new AsyncFib(7); |
970 |
|
assertSame(h, h.fork()); |
971 |
|
AsyncFib g = new AsyncFib(9); |
987 |
|
*/ |
988 |
|
public void testPeekNextLocalTask() { |
989 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
990 |
< |
public void realCompute() { |
990 |
> |
protected void realCompute() { |
991 |
|
AsyncFib g = new AsyncFib(9); |
992 |
|
assertSame(g, g.fork()); |
993 |
|
AsyncFib f = new AsyncFib(8); |
1007 |
|
*/ |
1008 |
|
public void testPollNextLocalTask() { |
1009 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1010 |
< |
public void realCompute() { |
1010 |
> |
protected void realCompute() { |
1011 |
|
AsyncFib g = new AsyncFib(9); |
1012 |
|
assertSame(g, g.fork()); |
1013 |
|
AsyncFib f = new AsyncFib(8); |
1026 |
|
*/ |
1027 |
|
public void testPollTask() { |
1028 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1029 |
< |
public void realCompute() { |
1029 |
> |
protected void realCompute() { |
1030 |
|
AsyncFib g = new AsyncFib(9); |
1031 |
|
assertSame(g, g.fork()); |
1032 |
|
AsyncFib f = new AsyncFib(8); |
1044 |
|
*/ |
1045 |
|
public void testPeekNextLocalTaskAsync() { |
1046 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1047 |
< |
public void realCompute() { |
1047 |
> |
protected void realCompute() { |
1048 |
|
AsyncFib g = new AsyncFib(9); |
1049 |
|
assertSame(g, g.fork()); |
1050 |
|
AsyncFib f = new AsyncFib(8); |
1065 |
|
*/ |
1066 |
|
public void testPollNextLocalTaskAsync() { |
1067 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1068 |
< |
public void realCompute() { |
1068 |
> |
protected void realCompute() { |
1069 |
|
AsyncFib g = new AsyncFib(9); |
1070 |
|
assertSame(g, g.fork()); |
1071 |
|
AsyncFib f = new AsyncFib(8); |
1085 |
|
*/ |
1086 |
|
public void testPollTaskAsync() { |
1087 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1088 |
< |
public void realCompute() { |
1088 |
> |
protected void realCompute() { |
1089 |
|
AsyncFib g = new AsyncFib(9); |
1090 |
|
assertSame(g, g.fork()); |
1091 |
|
AsyncFib f = new AsyncFib(8); |
1108 |
|
*/ |
1109 |
|
public void testInvokeSingleton() { |
1110 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1111 |
< |
public void realCompute() { |
1111 |
> |
protected void realCompute() { |
1112 |
|
AsyncFib f = new AsyncFib(8); |
1113 |
|
assertNull(f.invoke()); |
1114 |
|
assertEquals(21, f.number); |
1124 |
|
*/ |
1125 |
|
public void testQuietlyInvokeSingleton() { |
1126 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1127 |
< |
public void realCompute() { |
1127 |
> |
protected void realCompute() { |
1128 |
|
AsyncFib f = new AsyncFib(8); |
1129 |
|
f.quietlyInvoke(); |
1130 |
|
assertEquals(21, f.number); |
1138 |
|
*/ |
1139 |
|
public void testForkJoinSingleton() { |
1140 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1141 |
< |
public void realCompute() { |
1141 |
> |
protected void realCompute() { |
1142 |
|
AsyncFib f = new AsyncFib(8); |
1143 |
|
assertSame(f, f.fork()); |
1144 |
|
assertNull(f.join()); |
1153 |
|
*/ |
1154 |
|
public void testForkGetSingleton() { |
1155 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1156 |
< |
public void realCompute() throws Exception { |
1156 |
> |
protected void realCompute() throws Exception { |
1157 |
|
AsyncFib f = new AsyncFib(8); |
1158 |
|
assertSame(f, f.fork()); |
1159 |
|
assertNull(f.get()); |
1168 |
|
*/ |
1169 |
|
public void testForkTimedGetSingleton() { |
1170 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1171 |
< |
public void realCompute() throws Exception { |
1171 |
> |
protected void realCompute() throws Exception { |
1172 |
|
AsyncFib f = new AsyncFib(8); |
1173 |
|
assertSame(f, f.fork()); |
1174 |
|
assertNull(f.get(LONG_DELAY_MS, MILLISECONDS)); |
1183 |
|
*/ |
1184 |
|
public void testForkTimedGetNPESingleton() { |
1185 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1186 |
< |
public void realCompute() throws Exception { |
1186 |
> |
protected void realCompute() throws Exception { |
1187 |
|
AsyncFib f = new AsyncFib(8); |
1188 |
|
assertSame(f, f.fork()); |
1189 |
|
try { |
1199 |
|
*/ |
1200 |
|
public void testForkQuietlyJoinSingleton() { |
1201 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1202 |
< |
public void realCompute() { |
1202 |
> |
protected void realCompute() { |
1203 |
|
AsyncFib f = new AsyncFib(8); |
1204 |
|
assertSame(f, f.fork()); |
1205 |
|
f.quietlyJoin(); |
1209 |
|
testInvokeOnPool(singletonPool(), a); |
1210 |
|
} |
1211 |
|
|
1216 |
– |
|
1212 |
|
/** |
1213 |
|
* helpQuiesce returns when tasks are complete. |
1214 |
|
* getQueuedTaskCount returns 0 when quiescent |
1215 |
|
*/ |
1216 |
|
public void testForkHelpQuiesceSingleton() { |
1217 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1218 |
< |
public void realCompute() { |
1218 |
> |
protected void realCompute() { |
1219 |
|
AsyncFib f = new AsyncFib(8); |
1220 |
|
assertSame(f, f.fork()); |
1221 |
< |
f.helpQuiesce(); |
1221 |
> |
helpQuiesce(); |
1222 |
|
assertEquals(0, getQueuedTaskCount()); |
1223 |
|
assertEquals(21, f.number); |
1224 |
|
checkCompletedNormally(f); |
1226 |
|
testInvokeOnPool(singletonPool(), a); |
1227 |
|
} |
1228 |
|
|
1234 |
– |
|
1229 |
|
/** |
1230 |
|
* invoke task throws exception when task completes abnormally |
1231 |
|
*/ |
1232 |
|
public void testAbnormalInvokeSingleton() { |
1233 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1234 |
< |
public void realCompute() { |
1234 |
> |
protected void realCompute() { |
1235 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1236 |
|
try { |
1237 |
|
f.invoke(); |
1248 |
|
*/ |
1249 |
|
public void testAbnormalQuietlyInvokeSingleton() { |
1250 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1251 |
< |
public void realCompute() { |
1251 |
> |
protected void realCompute() { |
1252 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1253 |
|
f.quietlyInvoke(); |
1254 |
|
assertTrue(f.getException() instanceof FJException); |
1262 |
|
*/ |
1263 |
|
public void testAbnormalForkJoinSingleton() { |
1264 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1265 |
< |
public void realCompute() { |
1265 |
> |
protected void realCompute() { |
1266 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1267 |
|
assertSame(f, f.fork()); |
1268 |
|
try { |
1280 |
|
*/ |
1281 |
|
public void testAbnormalForkGetSingleton() { |
1282 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1283 |
< |
public void realCompute() throws Exception { |
1283 |
> |
protected void realCompute() throws Exception { |
1284 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1285 |
|
assertSame(f, f.fork()); |
1286 |
|
try { |
1300 |
|
*/ |
1301 |
|
public void testAbnormalForkTimedGetSingleton() { |
1302 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1303 |
< |
public void realCompute() throws Exception { |
1303 |
> |
protected void realCompute() throws Exception { |
1304 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1305 |
|
assertSame(f, f.fork()); |
1306 |
|
try { |
1320 |
|
*/ |
1321 |
|
public void testAbnormalForkQuietlyJoinSingleton() { |
1322 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1323 |
< |
public void realCompute() { |
1323 |
> |
protected void realCompute() { |
1324 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1325 |
|
assertSame(f, f.fork()); |
1326 |
|
f.quietlyJoin(); |
1335 |
|
*/ |
1336 |
|
public void testCancelledInvokeSingleton() { |
1337 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1338 |
< |
public void realCompute() { |
1338 |
> |
protected void realCompute() { |
1339 |
|
AsyncFib f = new AsyncFib(8); |
1340 |
|
assertTrue(f.cancel(true)); |
1341 |
|
try { |
1353 |
|
*/ |
1354 |
|
public void testCancelledForkJoinSingleton() { |
1355 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1356 |
< |
public void realCompute() { |
1356 |
> |
protected void realCompute() { |
1357 |
|
AsyncFib f = new AsyncFib(8); |
1358 |
|
assertTrue(f.cancel(true)); |
1359 |
|
assertSame(f, f.fork()); |
1372 |
|
*/ |
1373 |
|
public void testCancelledForkGetSingleton() { |
1374 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1375 |
< |
public void realCompute() throws Exception { |
1375 |
> |
protected void realCompute() throws Exception { |
1376 |
|
AsyncFib f = new AsyncFib(8); |
1377 |
|
assertTrue(f.cancel(true)); |
1378 |
|
assertSame(f, f.fork()); |
1391 |
|
*/ |
1392 |
|
public void testCancelledForkTimedGetSingleton() throws Exception { |
1393 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1394 |
< |
public void realCompute() throws Exception { |
1394 |
> |
protected void realCompute() throws Exception { |
1395 |
|
AsyncFib f = new AsyncFib(8); |
1396 |
|
assertTrue(f.cancel(true)); |
1397 |
|
assertSame(f, f.fork()); |
1410 |
|
*/ |
1411 |
|
public void testCancelledForkQuietlyJoinSingleton() { |
1412 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1413 |
< |
public void realCompute() { |
1413 |
> |
protected void realCompute() { |
1414 |
|
AsyncFib f = new AsyncFib(8); |
1415 |
|
assertTrue(f.cancel(true)); |
1416 |
|
assertSame(f, f.fork()); |
1425 |
|
*/ |
1426 |
|
public void testCompleteExceptionallySingleton() { |
1427 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1428 |
< |
public void realCompute() { |
1428 |
> |
protected void realCompute() { |
1429 |
|
AsyncFib f = new AsyncFib(8); |
1430 |
|
f.completeExceptionally(new FJException()); |
1431 |
|
try { |
1443 |
|
*/ |
1444 |
|
public void testInvokeAll2Singleton() { |
1445 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1446 |
< |
public void realCompute() { |
1446 |
> |
protected void realCompute() { |
1447 |
|
AsyncFib f = new AsyncFib(8); |
1448 |
|
AsyncFib g = new AsyncFib(9); |
1449 |
|
invokeAll(f, g); |
1460 |
|
*/ |
1461 |
|
public void testInvokeAll1Singleton() { |
1462 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1463 |
< |
public void realCompute() { |
1463 |
> |
protected void realCompute() { |
1464 |
|
AsyncFib f = new AsyncFib(8); |
1465 |
|
invokeAll(f); |
1466 |
|
checkCompletedNormally(f); |
1474 |
|
*/ |
1475 |
|
public void testInvokeAll3Singleton() { |
1476 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1477 |
< |
public void realCompute() { |
1477 |
> |
protected void realCompute() { |
1478 |
|
AsyncFib f = new AsyncFib(8); |
1479 |
|
AsyncFib g = new AsyncFib(9); |
1480 |
|
AsyncFib h = new AsyncFib(7); |
1494 |
|
*/ |
1495 |
|
public void testInvokeAllCollectionSingleton() { |
1496 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1497 |
< |
public void realCompute() { |
1497 |
> |
protected void realCompute() { |
1498 |
|
AsyncFib f = new AsyncFib(8); |
1499 |
|
AsyncFib g = new AsyncFib(9); |
1500 |
|
AsyncFib h = new AsyncFib(7); |
1513 |
|
testInvokeOnPool(singletonPool(), a); |
1514 |
|
} |
1515 |
|
|
1522 |
– |
|
1516 |
|
/** |
1517 |
|
* invokeAll(tasks) with any null task throws NPE |
1518 |
|
*/ |
1519 |
|
public void testInvokeAllNPESingleton() { |
1520 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1521 |
< |
public void realCompute() { |
1521 |
> |
protected void realCompute() { |
1522 |
|
AsyncFib f = new AsyncFib(8); |
1523 |
|
AsyncFib g = new AsyncFib(9); |
1524 |
|
AsyncFib h = null; |
1535 |
|
*/ |
1536 |
|
public void testAbnormalInvokeAll2Singleton() { |
1537 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1538 |
< |
public void realCompute() { |
1538 |
> |
protected void realCompute() { |
1539 |
|
AsyncFib f = new AsyncFib(8); |
1540 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
1541 |
|
try { |
1553 |
|
*/ |
1554 |
|
public void testAbnormalInvokeAll1Singleton() { |
1555 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1556 |
< |
public void realCompute() { |
1556 |
> |
protected void realCompute() { |
1557 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
1558 |
|
try { |
1559 |
|
invokeAll(g); |
1570 |
|
*/ |
1571 |
|
public void testAbnormalInvokeAll3Singleton() { |
1572 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1573 |
< |
public void realCompute() { |
1573 |
> |
protected void realCompute() { |
1574 |
|
AsyncFib f = new AsyncFib(8); |
1575 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
1576 |
|
AsyncFib h = new AsyncFib(7); |
1585 |
|
} |
1586 |
|
|
1587 |
|
/** |
1588 |
< |
* invokeAll(collection) throws exception if any task does |
1588 |
> |
* invokeAll(collection) throws exception if any task does |
1589 |
|
*/ |
1590 |
|
public void testAbnormalInvokeAllCollectionSingleton() { |
1591 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1592 |
< |
public void realCompute() { |
1592 |
> |
protected void realCompute() { |
1593 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1594 |
|
AsyncFib g = new AsyncFib(9); |
1595 |
|
AsyncFib h = new AsyncFib(7); |
1607 |
|
testInvokeOnPool(singletonPool(), a); |
1608 |
|
} |
1609 |
|
|
1610 |
+ |
/** |
1611 |
+ |
* ForkJoinTask.quietlyComplete returns when task completes |
1612 |
+ |
* normally without setting a value. The most recent value |
1613 |
+ |
* established by setRawResult(V) (or null by default) is returned |
1614 |
+ |
* from invoke. |
1615 |
+ |
*/ |
1616 |
+ |
public void testQuietlyComplete() { |
1617 |
+ |
RecursiveAction a = new CheckedRecursiveAction() { |
1618 |
+ |
protected void realCompute() { |
1619 |
+ |
AsyncFib f = new AsyncFib(8); |
1620 |
+ |
f.quietlyComplete(); |
1621 |
+ |
assertEquals(8, f.number); |
1622 |
+ |
checkCompletedNormally(f); |
1623 |
+ |
}}; |
1624 |
+ |
testInvokeOnPool(mainPool(), a); |
1625 |
+ |
} |
1626 |
+ |
|
1627 |
|
} |