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 |
> |
|
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; |
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 |
|
|
76 |
|
assertNull(a.getRawResult()); |
77 |
|
|
78 |
|
try { |
79 |
< |
a.get(0L, SECONDS); |
79 |
> |
a.get(randomExpiredTimeout(), randomTimeUnit()); |
80 |
|
shouldThrow(); |
81 |
|
} catch (TimeoutException success) { |
82 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
93 |
|
assertFalse(a.isCompletedAbnormally()); |
94 |
|
assertNull(a.getException()); |
95 |
|
assertSame(expected, a.getRawResult()); |
96 |
< |
assertSame(expected, a.join()); |
96 |
> |
|
97 |
> |
{ |
98 |
> |
Thread.currentThread().interrupt(); |
99 |
> |
long startTime = System.nanoTime(); |
100 |
> |
assertSame(expected, a.join()); |
101 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
102 |
> |
Thread.interrupted(); |
103 |
> |
} |
104 |
> |
|
105 |
> |
{ |
106 |
> |
Thread.currentThread().interrupt(); |
107 |
> |
long startTime = System.nanoTime(); |
108 |
> |
a.quietlyJoin(); // should be no-op |
109 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
110 |
> |
Thread.interrupted(); |
111 |
> |
} |
112 |
> |
|
113 |
|
assertFalse(a.cancel(false)); |
114 |
|
assertFalse(a.cancel(true)); |
115 |
|
try { |
116 |
|
assertSame(expected, a.get()); |
117 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
102 |
< |
try { |
103 |
< |
assertSame(expected, a.get(5L, SECONDS)); |
117 |
> |
assertSame(expected, a.get(randomTimeout(), randomTimeUnit())); |
118 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
119 |
|
} |
120 |
|
|
129 |
|
assertTrue(a.cancel(true)); |
130 |
|
|
131 |
|
try { |
132 |
+ |
Thread.currentThread().interrupt(); |
133 |
|
a.join(); |
134 |
|
shouldThrow(); |
135 |
|
} catch (CancellationException success) { |
136 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
137 |
+ |
Thread.interrupted(); |
138 |
+ |
|
139 |
+ |
{ |
140 |
+ |
long startTime = System.nanoTime(); |
141 |
+ |
a.quietlyJoin(); // should be no-op |
142 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
143 |
+ |
} |
144 |
|
|
145 |
|
try { |
146 |
|
a.get(); |
149 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
150 |
|
|
151 |
|
try { |
152 |
< |
a.get(5L, SECONDS); |
152 |
> |
a.get(randomTimeout(), randomTimeUnit()); |
153 |
|
shouldThrow(); |
154 |
|
} catch (CancellationException success) { |
155 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
160 |
|
assertFalse(a.isCancelled()); |
161 |
|
assertFalse(a.isCompletedNormally()); |
162 |
|
assertTrue(a.isCompletedAbnormally()); |
163 |
< |
assertSame(t, a.getException()); |
163 |
> |
assertSame(t.getClass(), a.getException().getClass()); |
164 |
|
assertNull(a.getRawResult()); |
165 |
|
assertFalse(a.cancel(false)); |
166 |
|
assertFalse(a.cancel(true)); |
167 |
|
|
168 |
|
try { |
169 |
+ |
Thread.currentThread().interrupt(); |
170 |
|
a.join(); |
171 |
|
shouldThrow(); |
172 |
|
} catch (Throwable expected) { |
173 |
< |
assertSame(t, expected); |
173 |
> |
assertSame(t.getClass(), expected.getClass()); |
174 |
> |
} |
175 |
> |
Thread.interrupted(); |
176 |
> |
|
177 |
> |
{ |
178 |
> |
long startTime = System.nanoTime(); |
179 |
> |
a.quietlyJoin(); // should be no-op |
180 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
181 |
|
} |
182 |
|
|
183 |
|
try { |
184 |
|
a.get(); |
185 |
|
shouldThrow(); |
186 |
|
} catch (ExecutionException success) { |
187 |
< |
assertSame(t, success.getCause()); |
187 |
> |
assertSame(t.getClass(), success.getCause().getClass()); |
188 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
189 |
|
|
190 |
|
try { |
191 |
< |
a.get(5L, SECONDS); |
191 |
> |
a.get(randomTimeout(), randomTimeUnit()); |
192 |
|
shouldThrow(); |
193 |
|
} catch (ExecutionException success) { |
194 |
< |
assertSame(t, success.getCause()); |
194 |
> |
assertSame(t.getClass(), success.getCause().getClass()); |
195 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
196 |
|
} |
197 |
|
|
203 |
|
* differently than supplied Recursive forms. |
204 |
|
*/ |
205 |
|
|
206 |
< |
static final class FJException extends RuntimeException { |
206 |
> |
public static final class FJException extends RuntimeException { |
207 |
|
FJException() { super(); } |
208 |
|
} |
209 |
|
|
214 |
|
AtomicIntegerFieldUpdater.newUpdater(BinaryAsyncAction.class, |
215 |
|
"controlState"); |
216 |
|
|
217 |
< |
private BinaryAsyncAction parent; |
217 |
> |
private volatile BinaryAsyncAction parent; |
218 |
|
|
219 |
< |
private BinaryAsyncAction sibling; |
219 |
> |
private volatile BinaryAsyncAction sibling; |
220 |
|
|
221 |
|
protected BinaryAsyncAction() { |
222 |
|
} |
251 |
|
super.completeExceptionally(ex); |
252 |
|
} |
253 |
|
|
254 |
+ |
public boolean cancel(boolean mayInterruptIfRunning) { |
255 |
+ |
if (super.cancel(mayInterruptIfRunning)) { |
256 |
+ |
completeExceptionally(new FJException()); |
257 |
+ |
return true; |
258 |
+ |
} |
259 |
+ |
return false; |
260 |
+ |
} |
261 |
+ |
|
262 |
|
public final void complete() { |
263 |
|
BinaryAsyncAction a = this; |
264 |
|
for (;;) { |
280 |
|
} |
281 |
|
|
282 |
|
public final void completeExceptionally(Throwable ex) { |
283 |
< |
BinaryAsyncAction a = this; |
246 |
< |
while (!a.isCompletedAbnormally()) { |
283 |
> |
for (BinaryAsyncAction a = this;;) { |
284 |
|
a.completeThisExceptionally(ex); |
285 |
|
BinaryAsyncAction s = a.sibling; |
286 |
< |
if (s != null) |
287 |
< |
s.cancel(false); |
288 |
< |
if (!a.onException() || (a = a.parent) == null) |
286 |
> |
if (s != null && !s.isDone()) |
287 |
> |
s.completeExceptionally(ex); |
288 |
> |
if ((a = a.parent) == null) |
289 |
|
break; |
290 |
|
} |
291 |
|
} |
335 |
|
public final boolean exec() { |
336 |
|
AsyncFib f = this; |
337 |
|
int n = f.number; |
338 |
< |
if (n > 1) { |
339 |
< |
while (n > 1) { |
340 |
< |
AsyncFib p = f; |
341 |
< |
AsyncFib r = new AsyncFib(n - 2); |
342 |
< |
f = new AsyncFib(--n); |
343 |
< |
p.linkSubtasks(r, f); |
307 |
< |
r.fork(); |
308 |
< |
} |
309 |
< |
f.number = n; |
338 |
> |
while (n > 1) { |
339 |
> |
AsyncFib p = f; |
340 |
> |
AsyncFib r = new AsyncFib(n - 2); |
341 |
> |
f = new AsyncFib(--n); |
342 |
> |
p.linkSubtasks(r, f); |
343 |
> |
r.fork(); |
344 |
|
} |
345 |
|
f.complete(); |
346 |
|
return false; |
351 |
|
} |
352 |
|
} |
353 |
|
|
320 |
– |
|
354 |
|
static final class FailingAsyncFib extends BinaryAsyncAction { |
355 |
|
int number; |
356 |
|
public FailingAsyncFib(int n) { |
360 |
|
public final boolean exec() { |
361 |
|
FailingAsyncFib f = this; |
362 |
|
int n = f.number; |
363 |
< |
if (n > 1) { |
364 |
< |
while (n > 1) { |
365 |
< |
FailingAsyncFib p = f; |
366 |
< |
FailingAsyncFib r = new FailingAsyncFib(n - 2); |
367 |
< |
f = new FailingAsyncFib(--n); |
368 |
< |
p.linkSubtasks(r, f); |
336 |
< |
r.fork(); |
337 |
< |
} |
338 |
< |
f.number = n; |
363 |
> |
while (n > 1) { |
364 |
> |
FailingAsyncFib p = f; |
365 |
> |
FailingAsyncFib r = new FailingAsyncFib(n - 2); |
366 |
> |
f = new FailingAsyncFib(--n); |
367 |
> |
p.linkSubtasks(r, f); |
368 |
> |
r.fork(); |
369 |
|
} |
370 |
|
f.complete(); |
371 |
|
return false; |
379 |
|
/** |
380 |
|
* invoke returns when task completes normally. |
381 |
|
* isCompletedAbnormally and isCancelled return false for normally |
382 |
< |
* completed tasks. getRawResult of a RecursiveAction returns null; |
382 |
> |
* completed tasks; getRawResult returns null. |
383 |
|
*/ |
384 |
|
public void testInvoke() { |
385 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
386 |
< |
public void realCompute() { |
386 |
> |
protected void realCompute() { |
387 |
|
AsyncFib f = new AsyncFib(8); |
388 |
|
assertNull(f.invoke()); |
389 |
|
assertEquals(21, f.number); |
399 |
|
*/ |
400 |
|
public void testQuietlyInvoke() { |
401 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
402 |
< |
public void realCompute() { |
402 |
> |
protected void realCompute() { |
403 |
|
AsyncFib f = new AsyncFib(8); |
404 |
|
f.quietlyInvoke(); |
405 |
|
assertEquals(21, f.number); |
413 |
|
*/ |
414 |
|
public void testForkJoin() { |
415 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
416 |
< |
public void realCompute() { |
416 |
> |
protected void realCompute() { |
417 |
|
AsyncFib f = new AsyncFib(8); |
418 |
|
assertSame(f, f.fork()); |
419 |
|
assertNull(f.join()); |
428 |
|
*/ |
429 |
|
public void testForkGet() { |
430 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
431 |
< |
public void realCompute() throws Exception { |
431 |
> |
protected void realCompute() throws Exception { |
432 |
|
AsyncFib f = new AsyncFib(8); |
433 |
|
assertSame(f, f.fork()); |
434 |
|
assertNull(f.get()); |
443 |
|
*/ |
444 |
|
public void testForkTimedGet() { |
445 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
446 |
< |
public void realCompute() throws Exception { |
446 |
> |
protected void realCompute() throws Exception { |
447 |
|
AsyncFib f = new AsyncFib(8); |
448 |
|
assertSame(f, f.fork()); |
449 |
|
assertNull(f.get(LONG_DELAY_MS, MILLISECONDS)); |
458 |
|
*/ |
459 |
|
public void testForkTimedGetNPE() { |
460 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
461 |
< |
public void realCompute() throws Exception { |
461 |
> |
protected void realCompute() throws Exception { |
462 |
|
AsyncFib f = new AsyncFib(8); |
463 |
|
assertSame(f, f.fork()); |
464 |
|
try { |
465 |
< |
f.get(5L, null); |
465 |
> |
f.get(randomTimeout(), null); |
466 |
|
shouldThrow(); |
467 |
|
} catch (NullPointerException success) {} |
468 |
|
}}; |
474 |
|
*/ |
475 |
|
public void testForkQuietlyJoin() { |
476 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
477 |
< |
public void realCompute() { |
477 |
> |
protected void realCompute() { |
478 |
|
AsyncFib f = new AsyncFib(8); |
479 |
|
assertSame(f, f.fork()); |
480 |
|
f.quietlyJoin(); |
484 |
|
testInvokeOnPool(mainPool(), a); |
485 |
|
} |
486 |
|
|
457 |
– |
|
487 |
|
/** |
488 |
|
* helpQuiesce returns when tasks are complete. |
489 |
|
* getQueuedTaskCount returns 0 when quiescent |
490 |
|
*/ |
491 |
|
public void testForkHelpQuiesce() { |
492 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
493 |
< |
public void realCompute() { |
493 |
> |
protected void realCompute() { |
494 |
|
AsyncFib f = new AsyncFib(8); |
495 |
|
assertSame(f, f.fork()); |
496 |
< |
f.helpQuiesce(); |
496 |
> |
helpQuiesce(); |
497 |
|
assertEquals(21, f.number); |
498 |
|
assertEquals(0, getQueuedTaskCount()); |
499 |
|
checkCompletedNormally(f); |
501 |
|
testInvokeOnPool(mainPool(), a); |
502 |
|
} |
503 |
|
|
475 |
– |
|
504 |
|
/** |
505 |
|
* invoke task throws exception when task completes abnormally |
506 |
|
*/ |
507 |
|
public void testAbnormalInvoke() { |
508 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
509 |
< |
public void realCompute() { |
509 |
> |
protected void realCompute() { |
510 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
511 |
|
try { |
512 |
|
f.invoke(); |
523 |
|
*/ |
524 |
|
public void testAbnormalQuietlyInvoke() { |
525 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
526 |
< |
public void realCompute() { |
526 |
> |
protected void realCompute() { |
527 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
528 |
|
f.quietlyInvoke(); |
529 |
|
assertTrue(f.getException() instanceof FJException); |
537 |
|
*/ |
538 |
|
public void testAbnormalForkJoin() { |
539 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
540 |
< |
public void realCompute() { |
540 |
> |
protected void realCompute() { |
541 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
542 |
|
assertSame(f, f.fork()); |
543 |
|
try { |
555 |
|
*/ |
556 |
|
public void testAbnormalForkGet() { |
557 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
558 |
< |
public void realCompute() throws Exception { |
558 |
> |
protected void realCompute() throws Exception { |
559 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
560 |
|
assertSame(f, f.fork()); |
561 |
|
try { |
575 |
|
*/ |
576 |
|
public void testAbnormalForkTimedGet() { |
577 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
578 |
< |
public void realCompute() throws Exception { |
578 |
> |
protected void realCompute() throws Exception { |
579 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
580 |
|
assertSame(f, f.fork()); |
581 |
|
try { |
595 |
|
*/ |
596 |
|
public void testAbnormalForkQuietlyJoin() { |
597 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
598 |
< |
public void realCompute() { |
598 |
> |
protected void realCompute() { |
599 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
600 |
|
assertSame(f, f.fork()); |
601 |
|
f.quietlyJoin(); |
610 |
|
*/ |
611 |
|
public void testCancelledInvoke() { |
612 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
613 |
< |
public void realCompute() { |
613 |
> |
protected void realCompute() { |
614 |
|
AsyncFib f = new AsyncFib(8); |
615 |
|
assertTrue(f.cancel(true)); |
616 |
|
try { |
628 |
|
*/ |
629 |
|
public void testCancelledForkJoin() { |
630 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
631 |
< |
public void realCompute() { |
631 |
> |
protected void realCompute() { |
632 |
|
AsyncFib f = new AsyncFib(8); |
633 |
|
assertTrue(f.cancel(true)); |
634 |
|
assertSame(f, f.fork()); |
647 |
|
*/ |
648 |
|
public void testCancelledForkGet() { |
649 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
650 |
< |
public void realCompute() throws Exception { |
650 |
> |
protected void realCompute() throws Exception { |
651 |
|
AsyncFib f = new AsyncFib(8); |
652 |
|
assertTrue(f.cancel(true)); |
653 |
|
assertSame(f, f.fork()); |
666 |
|
*/ |
667 |
|
public void testCancelledForkTimedGet() throws Exception { |
668 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
669 |
< |
public void realCompute() throws Exception { |
669 |
> |
protected void realCompute() throws Exception { |
670 |
|
AsyncFib f = new AsyncFib(8); |
671 |
|
assertTrue(f.cancel(true)); |
672 |
|
assertSame(f, f.fork()); |
685 |
|
*/ |
686 |
|
public void testCancelledForkQuietlyJoin() { |
687 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
688 |
< |
public void realCompute() { |
688 |
> |
protected void realCompute() { |
689 |
|
AsyncFib f = new AsyncFib(8); |
690 |
|
assertTrue(f.cancel(true)); |
691 |
|
assertSame(f, f.fork()); |
701 |
|
public void testGetPool() { |
702 |
|
final ForkJoinPool mainPool = mainPool(); |
703 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
704 |
< |
public void realCompute() { |
704 |
> |
protected void realCompute() { |
705 |
|
assertSame(mainPool, getPool()); |
706 |
|
}}; |
707 |
|
testInvokeOnPool(mainPool, a); |
712 |
|
*/ |
713 |
|
public void testGetPool2() { |
714 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
715 |
< |
public void realCompute() { |
715 |
> |
protected void realCompute() { |
716 |
|
assertNull(getPool()); |
717 |
|
}}; |
718 |
|
assertNull(a.invoke()); |
723 |
|
*/ |
724 |
|
public void testInForkJoinPool() { |
725 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
726 |
< |
public void realCompute() { |
726 |
> |
protected void realCompute() { |
727 |
|
assertTrue(inForkJoinPool()); |
728 |
|
}}; |
729 |
|
testInvokeOnPool(mainPool(), a); |
734 |
|
*/ |
735 |
|
public void testInForkJoinPool2() { |
736 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
737 |
< |
public void realCompute() { |
737 |
> |
protected void realCompute() { |
738 |
|
assertFalse(inForkJoinPool()); |
739 |
|
}}; |
740 |
|
assertNull(a.invoke()); |
745 |
|
*/ |
746 |
|
public void testSetRawResult() { |
747 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
748 |
< |
public void realCompute() { |
748 |
> |
protected void realCompute() { |
749 |
|
setRawResult(null); |
750 |
+ |
assertNull(getRawResult()); |
751 |
|
}}; |
752 |
|
assertNull(a.invoke()); |
753 |
|
} |
757 |
|
*/ |
758 |
|
public void testCompleteExceptionally() { |
759 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
760 |
< |
public void realCompute() { |
760 |
> |
protected void realCompute() { |
761 |
|
AsyncFib f = new AsyncFib(8); |
762 |
|
f.completeExceptionally(new FJException()); |
763 |
|
try { |
771 |
|
} |
772 |
|
|
773 |
|
/** |
774 |
+ |
* completeExceptionally(null) surprisingly has the same effect as |
775 |
+ |
* completeExceptionally(new RuntimeException()) |
776 |
+ |
*/ |
777 |
+ |
public void testCompleteExceptionally_null() { |
778 |
+ |
RecursiveAction a = new CheckedRecursiveAction() { |
779 |
+ |
protected void realCompute() { |
780 |
+ |
AsyncFib f = new AsyncFib(8); |
781 |
+ |
f.completeExceptionally(null); |
782 |
+ |
try { |
783 |
+ |
f.invoke(); |
784 |
+ |
shouldThrow(); |
785 |
+ |
} catch (RuntimeException success) { |
786 |
+ |
assertSame(success.getClass(), RuntimeException.class); |
787 |
+ |
assertNull(success.getCause()); |
788 |
+ |
checkCompletedAbnormally(f, success); |
789 |
+ |
} |
790 |
+ |
}}; |
791 |
+ |
testInvokeOnPool(mainPool(), a); |
792 |
+ |
} |
793 |
+ |
|
794 |
+ |
/** |
795 |
|
* invokeAll(t1, t2) invokes all task arguments |
796 |
|
*/ |
797 |
|
public void testInvokeAll2() { |
798 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
799 |
< |
public void realCompute() { |
799 |
> |
protected void realCompute() { |
800 |
|
AsyncFib f = new AsyncFib(8); |
801 |
|
AsyncFib g = new AsyncFib(9); |
802 |
|
invokeAll(f, g); |
813 |
|
*/ |
814 |
|
public void testInvokeAll1() { |
815 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
816 |
< |
public void realCompute() { |
816 |
> |
protected void realCompute() { |
817 |
|
AsyncFib f = new AsyncFib(8); |
818 |
|
invokeAll(f); |
819 |
|
checkCompletedNormally(f); |
827 |
|
*/ |
828 |
|
public void testInvokeAll3() { |
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); |
847 |
|
*/ |
848 |
|
public void testInvokeAllCollection() { |
849 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
850 |
< |
public void realCompute() { |
850 |
> |
protected void realCompute() { |
851 |
|
AsyncFib f = new AsyncFib(8); |
852 |
|
AsyncFib g = new AsyncFib(9); |
853 |
|
AsyncFib h = new AsyncFib(7); |
866 |
|
testInvokeOnPool(mainPool(), a); |
867 |
|
} |
868 |
|
|
819 |
– |
|
869 |
|
/** |
870 |
|
* invokeAll(tasks) with any null task throws NPE |
871 |
|
*/ |
872 |
|
public void testInvokeAllNPE() { |
873 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
874 |
< |
public void realCompute() { |
874 |
> |
protected void realCompute() { |
875 |
|
AsyncFib f = new AsyncFib(8); |
876 |
|
AsyncFib g = new AsyncFib(9); |
877 |
|
AsyncFib h = null; |
888 |
|
*/ |
889 |
|
public void testAbnormalInvokeAll2() { |
890 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
891 |
< |
public void realCompute() { |
891 |
> |
protected void realCompute() { |
892 |
|
AsyncFib f = new AsyncFib(8); |
893 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
894 |
+ |
ForkJoinTask[] tasks = { f, g }; |
895 |
+ |
shuffle(tasks); |
896 |
|
try { |
897 |
< |
invokeAll(f, g); |
897 |
> |
invokeAll(tasks); |
898 |
|
shouldThrow(); |
899 |
|
} catch (FJException success) { |
900 |
|
checkCompletedAbnormally(g, success); |
908 |
|
*/ |
909 |
|
public void testAbnormalInvokeAll1() { |
910 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
911 |
< |
public void realCompute() { |
911 |
> |
protected void realCompute() { |
912 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
913 |
|
try { |
914 |
|
invokeAll(g); |
925 |
|
*/ |
926 |
|
public void testAbnormalInvokeAll3() { |
927 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
928 |
< |
public void realCompute() { |
928 |
> |
protected void realCompute() { |
929 |
|
AsyncFib f = new AsyncFib(8); |
930 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
931 |
|
AsyncFib h = new AsyncFib(7); |
932 |
+ |
ForkJoinTask[] tasks = { f, g, h }; |
933 |
+ |
shuffle(tasks); |
934 |
|
try { |
935 |
< |
invokeAll(f, g, h); |
935 |
> |
invokeAll(tasks); |
936 |
|
shouldThrow(); |
937 |
|
} catch (FJException success) { |
938 |
|
checkCompletedAbnormally(g, success); |
942 |
|
} |
943 |
|
|
944 |
|
/** |
945 |
< |
* invokeAll(collection) throws exception if any task does |
945 |
> |
* invokeAll(collection) throws exception if any task does |
946 |
|
*/ |
947 |
|
public void testAbnormalInvokeAllCollection() { |
948 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
949 |
< |
public void realCompute() { |
949 |
> |
protected void realCompute() { |
950 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
951 |
|
AsyncFib g = new AsyncFib(9); |
952 |
|
AsyncFib h = new AsyncFib(7); |
953 |
< |
HashSet set = new HashSet(); |
954 |
< |
set.add(f); |
902 |
< |
set.add(g); |
903 |
< |
set.add(h); |
953 |
> |
ForkJoinTask[] tasks = { f, g, h }; |
954 |
> |
shuffle(tasks); |
955 |
|
try { |
956 |
< |
invokeAll(set); |
956 |
> |
invokeAll(Arrays.asList(tasks)); |
957 |
|
shouldThrow(); |
958 |
|
} catch (FJException success) { |
959 |
|
checkCompletedAbnormally(f, success); |
968 |
|
*/ |
969 |
|
public void testTryUnfork() { |
970 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
971 |
< |
public void realCompute() { |
971 |
> |
protected void realCompute() { |
972 |
|
AsyncFib g = new AsyncFib(9); |
973 |
|
assertSame(g, g.fork()); |
974 |
|
AsyncFib f = new AsyncFib(8); |
987 |
|
*/ |
988 |
|
public void testGetSurplusQueuedTaskCount() { |
989 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
990 |
< |
public void realCompute() { |
990 |
> |
protected void realCompute() { |
991 |
|
AsyncFib h = new AsyncFib(7); |
992 |
|
assertSame(h, h.fork()); |
993 |
|
AsyncFib g = new AsyncFib(9); |
1009 |
|
*/ |
1010 |
|
public void testPeekNextLocalTask() { |
1011 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1012 |
< |
public void realCompute() { |
1012 |
> |
protected void realCompute() { |
1013 |
|
AsyncFib g = new AsyncFib(9); |
1014 |
|
assertSame(g, g.fork()); |
1015 |
|
AsyncFib f = new AsyncFib(8); |
1029 |
|
*/ |
1030 |
|
public void testPollNextLocalTask() { |
1031 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1032 |
< |
public void realCompute() { |
1032 |
> |
protected void realCompute() { |
1033 |
|
AsyncFib g = new AsyncFib(9); |
1034 |
|
assertSame(g, g.fork()); |
1035 |
|
AsyncFib f = new AsyncFib(8); |
1048 |
|
*/ |
1049 |
|
public void testPollTask() { |
1050 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1051 |
< |
public void realCompute() { |
1051 |
> |
protected void realCompute() { |
1052 |
|
AsyncFib g = new AsyncFib(9); |
1053 |
|
assertSame(g, g.fork()); |
1054 |
|
AsyncFib f = new AsyncFib(8); |
1066 |
|
*/ |
1067 |
|
public void testPeekNextLocalTaskAsync() { |
1068 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1069 |
< |
public void realCompute() { |
1069 |
> |
protected void realCompute() { |
1070 |
|
AsyncFib g = new AsyncFib(9); |
1071 |
|
assertSame(g, g.fork()); |
1072 |
|
AsyncFib f = new AsyncFib(8); |
1087 |
|
*/ |
1088 |
|
public void testPollNextLocalTaskAsync() { |
1089 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1090 |
< |
public void realCompute() { |
1090 |
> |
protected void realCompute() { |
1091 |
|
AsyncFib g = new AsyncFib(9); |
1092 |
|
assertSame(g, g.fork()); |
1093 |
|
AsyncFib f = new AsyncFib(8); |
1107 |
|
*/ |
1108 |
|
public void testPollTaskAsync() { |
1109 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1110 |
< |
public void realCompute() { |
1110 |
> |
protected void realCompute() { |
1111 |
|
AsyncFib g = new AsyncFib(9); |
1112 |
|
assertSame(g, g.fork()); |
1113 |
|
AsyncFib f = new AsyncFib(8); |
1126 |
|
/** |
1127 |
|
* invoke returns when task completes normally. |
1128 |
|
* isCompletedAbnormally and isCancelled return false for normally |
1129 |
< |
* completed tasks. getRawResult of a RecursiveAction returns null; |
1129 |
> |
* completed tasks; getRawResult returns null. |
1130 |
|
*/ |
1131 |
|
public void testInvokeSingleton() { |
1132 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1133 |
< |
public void realCompute() { |
1133 |
> |
protected void realCompute() { |
1134 |
|
AsyncFib f = new AsyncFib(8); |
1135 |
|
assertNull(f.invoke()); |
1136 |
|
assertEquals(21, f.number); |
1146 |
|
*/ |
1147 |
|
public void testQuietlyInvokeSingleton() { |
1148 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1149 |
< |
public void realCompute() { |
1149 |
> |
protected void realCompute() { |
1150 |
|
AsyncFib f = new AsyncFib(8); |
1151 |
|
f.quietlyInvoke(); |
1152 |
|
assertEquals(21, f.number); |
1160 |
|
*/ |
1161 |
|
public void testForkJoinSingleton() { |
1162 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1163 |
< |
public void realCompute() { |
1163 |
> |
protected void realCompute() { |
1164 |
|
AsyncFib f = new AsyncFib(8); |
1165 |
|
assertSame(f, f.fork()); |
1166 |
|
assertNull(f.join()); |
1175 |
|
*/ |
1176 |
|
public void testForkGetSingleton() { |
1177 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1178 |
< |
public void realCompute() throws Exception { |
1178 |
> |
protected void realCompute() throws Exception { |
1179 |
|
AsyncFib f = new AsyncFib(8); |
1180 |
|
assertSame(f, f.fork()); |
1181 |
|
assertNull(f.get()); |
1190 |
|
*/ |
1191 |
|
public void testForkTimedGetSingleton() { |
1192 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1193 |
< |
public void realCompute() throws Exception { |
1193 |
> |
protected void realCompute() throws Exception { |
1194 |
|
AsyncFib f = new AsyncFib(8); |
1195 |
|
assertSame(f, f.fork()); |
1196 |
|
assertNull(f.get(LONG_DELAY_MS, MILLISECONDS)); |
1205 |
|
*/ |
1206 |
|
public void testForkTimedGetNPESingleton() { |
1207 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1208 |
< |
public void realCompute() throws Exception { |
1208 |
> |
protected void realCompute() throws Exception { |
1209 |
|
AsyncFib f = new AsyncFib(8); |
1210 |
|
assertSame(f, f.fork()); |
1211 |
|
try { |
1212 |
< |
f.get(5L, null); |
1212 |
> |
f.get(randomTimeout(), null); |
1213 |
|
shouldThrow(); |
1214 |
|
} catch (NullPointerException success) {} |
1215 |
|
}}; |
1221 |
|
*/ |
1222 |
|
public void testForkQuietlyJoinSingleton() { |
1223 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1224 |
< |
public void realCompute() { |
1224 |
> |
protected void realCompute() { |
1225 |
|
AsyncFib f = new AsyncFib(8); |
1226 |
|
assertSame(f, f.fork()); |
1227 |
|
f.quietlyJoin(); |
1231 |
|
testInvokeOnPool(singletonPool(), a); |
1232 |
|
} |
1233 |
|
|
1183 |
– |
|
1234 |
|
/** |
1235 |
|
* helpQuiesce returns when tasks are complete. |
1236 |
|
* getQueuedTaskCount returns 0 when quiescent |
1237 |
|
*/ |
1238 |
|
public void testForkHelpQuiesceSingleton() { |
1239 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1240 |
< |
public void realCompute() { |
1240 |
> |
protected void realCompute() { |
1241 |
|
AsyncFib f = new AsyncFib(8); |
1242 |
|
assertSame(f, f.fork()); |
1243 |
< |
f.helpQuiesce(); |
1243 |
> |
helpQuiesce(); |
1244 |
|
assertEquals(0, getQueuedTaskCount()); |
1245 |
|
assertEquals(21, f.number); |
1246 |
|
checkCompletedNormally(f); |
1248 |
|
testInvokeOnPool(singletonPool(), a); |
1249 |
|
} |
1250 |
|
|
1201 |
– |
|
1251 |
|
/** |
1252 |
|
* invoke task throws exception when task completes abnormally |
1253 |
|
*/ |
1254 |
|
public void testAbnormalInvokeSingleton() { |
1255 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1256 |
< |
public void realCompute() { |
1256 |
> |
protected void realCompute() { |
1257 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1258 |
|
try { |
1259 |
|
f.invoke(); |
1270 |
|
*/ |
1271 |
|
public void testAbnormalQuietlyInvokeSingleton() { |
1272 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1273 |
< |
public void realCompute() { |
1273 |
> |
protected void realCompute() { |
1274 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1275 |
|
f.quietlyInvoke(); |
1276 |
|
assertTrue(f.getException() instanceof FJException); |
1284 |
|
*/ |
1285 |
|
public void testAbnormalForkJoinSingleton() { |
1286 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1287 |
< |
public void realCompute() { |
1287 |
> |
protected void realCompute() { |
1288 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1289 |
|
assertSame(f, f.fork()); |
1290 |
|
try { |
1302 |
|
*/ |
1303 |
|
public void testAbnormalForkGetSingleton() { |
1304 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1305 |
< |
public void realCompute() throws Exception { |
1305 |
> |
protected void realCompute() throws Exception { |
1306 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1307 |
|
assertSame(f, f.fork()); |
1308 |
|
try { |
1322 |
|
*/ |
1323 |
|
public void testAbnormalForkTimedGetSingleton() { |
1324 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1325 |
< |
public void realCompute() throws Exception { |
1325 |
> |
protected void realCompute() throws Exception { |
1326 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1327 |
|
assertSame(f, f.fork()); |
1328 |
|
try { |
1342 |
|
*/ |
1343 |
|
public void testAbnormalForkQuietlyJoinSingleton() { |
1344 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1345 |
< |
public void realCompute() { |
1345 |
> |
protected void realCompute() { |
1346 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1347 |
|
assertSame(f, f.fork()); |
1348 |
|
f.quietlyJoin(); |
1357 |
|
*/ |
1358 |
|
public void testCancelledInvokeSingleton() { |
1359 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1360 |
< |
public void realCompute() { |
1360 |
> |
protected void realCompute() { |
1361 |
|
AsyncFib f = new AsyncFib(8); |
1362 |
|
assertTrue(f.cancel(true)); |
1363 |
|
try { |
1375 |
|
*/ |
1376 |
|
public void testCancelledForkJoinSingleton() { |
1377 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1378 |
< |
public void realCompute() { |
1378 |
> |
protected void realCompute() { |
1379 |
|
AsyncFib f = new AsyncFib(8); |
1380 |
|
assertTrue(f.cancel(true)); |
1381 |
|
assertSame(f, f.fork()); |
1394 |
|
*/ |
1395 |
|
public void testCancelledForkGetSingleton() { |
1396 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1397 |
< |
public void realCompute() throws Exception { |
1397 |
> |
protected void realCompute() throws Exception { |
1398 |
|
AsyncFib f = new AsyncFib(8); |
1399 |
|
assertTrue(f.cancel(true)); |
1400 |
|
assertSame(f, f.fork()); |
1413 |
|
*/ |
1414 |
|
public void testCancelledForkTimedGetSingleton() throws Exception { |
1415 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1416 |
< |
public void realCompute() throws Exception { |
1416 |
> |
protected void realCompute() throws Exception { |
1417 |
|
AsyncFib f = new AsyncFib(8); |
1418 |
|
assertTrue(f.cancel(true)); |
1419 |
|
assertSame(f, f.fork()); |
1432 |
|
*/ |
1433 |
|
public void testCancelledForkQuietlyJoinSingleton() { |
1434 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1435 |
< |
public void realCompute() { |
1435 |
> |
protected void realCompute() { |
1436 |
|
AsyncFib f = new AsyncFib(8); |
1437 |
|
assertTrue(f.cancel(true)); |
1438 |
|
assertSame(f, f.fork()); |
1447 |
|
*/ |
1448 |
|
public void testCompleteExceptionallySingleton() { |
1449 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1450 |
< |
public void realCompute() { |
1450 |
> |
protected void realCompute() { |
1451 |
|
AsyncFib f = new AsyncFib(8); |
1452 |
|
f.completeExceptionally(new FJException()); |
1453 |
|
try { |
1465 |
|
*/ |
1466 |
|
public void testInvokeAll2Singleton() { |
1467 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1468 |
< |
public void realCompute() { |
1468 |
> |
protected void realCompute() { |
1469 |
|
AsyncFib f = new AsyncFib(8); |
1470 |
|
AsyncFib g = new AsyncFib(9); |
1471 |
|
invokeAll(f, g); |
1482 |
|
*/ |
1483 |
|
public void testInvokeAll1Singleton() { |
1484 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1485 |
< |
public void realCompute() { |
1485 |
> |
protected void realCompute() { |
1486 |
|
AsyncFib f = new AsyncFib(8); |
1487 |
|
invokeAll(f); |
1488 |
|
checkCompletedNormally(f); |
1496 |
|
*/ |
1497 |
|
public void testInvokeAll3Singleton() { |
1498 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1499 |
< |
public void realCompute() { |
1499 |
> |
protected void realCompute() { |
1500 |
|
AsyncFib f = new AsyncFib(8); |
1501 |
|
AsyncFib g = new AsyncFib(9); |
1502 |
|
AsyncFib h = new AsyncFib(7); |
1516 |
|
*/ |
1517 |
|
public void testInvokeAllCollectionSingleton() { |
1518 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1519 |
< |
public void realCompute() { |
1519 |
> |
protected void realCompute() { |
1520 |
|
AsyncFib f = new AsyncFib(8); |
1521 |
|
AsyncFib g = new AsyncFib(9); |
1522 |
|
AsyncFib h = new AsyncFib(7); |
1535 |
|
testInvokeOnPool(singletonPool(), a); |
1536 |
|
} |
1537 |
|
|
1489 |
– |
|
1538 |
|
/** |
1539 |
|
* invokeAll(tasks) with any null task throws NPE |
1540 |
|
*/ |
1541 |
|
public void testInvokeAllNPESingleton() { |
1542 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1543 |
< |
public void realCompute() { |
1543 |
> |
protected void realCompute() { |
1544 |
|
AsyncFib f = new AsyncFib(8); |
1545 |
|
AsyncFib g = new AsyncFib(9); |
1546 |
|
AsyncFib h = null; |
1557 |
|
*/ |
1558 |
|
public void testAbnormalInvokeAll2Singleton() { |
1559 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1560 |
< |
public void realCompute() { |
1560 |
> |
protected void realCompute() { |
1561 |
|
AsyncFib f = new AsyncFib(8); |
1562 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
1563 |
+ |
ForkJoinTask[] tasks = { f, g }; |
1564 |
+ |
shuffle(tasks); |
1565 |
|
try { |
1566 |
< |
invokeAll(f, g); |
1566 |
> |
invokeAll(tasks); |
1567 |
|
shouldThrow(); |
1568 |
|
} catch (FJException success) { |
1569 |
|
checkCompletedAbnormally(g, success); |
1577 |
|
*/ |
1578 |
|
public void testAbnormalInvokeAll1Singleton() { |
1579 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1580 |
< |
public void realCompute() { |
1580 |
> |
protected void realCompute() { |
1581 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
1582 |
|
try { |
1583 |
|
invokeAll(g); |
1594 |
|
*/ |
1595 |
|
public void testAbnormalInvokeAll3Singleton() { |
1596 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1597 |
< |
public void realCompute() { |
1597 |
> |
protected void realCompute() { |
1598 |
|
AsyncFib f = new AsyncFib(8); |
1599 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
1600 |
|
AsyncFib h = new AsyncFib(7); |
1601 |
+ |
ForkJoinTask[] tasks = { f, g, h }; |
1602 |
+ |
shuffle(tasks); |
1603 |
|
try { |
1604 |
< |
invokeAll(f, g, h); |
1604 |
> |
invokeAll(tasks); |
1605 |
|
shouldThrow(); |
1606 |
|
} catch (FJException success) { |
1607 |
|
checkCompletedAbnormally(g, success); |
1611 |
|
} |
1612 |
|
|
1613 |
|
/** |
1614 |
< |
* invokeAll(collection) throws exception if any task does |
1614 |
> |
* invokeAll(collection) throws exception if any task does |
1615 |
|
*/ |
1616 |
|
public void testAbnormalInvokeAllCollectionSingleton() { |
1617 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1618 |
< |
public void realCompute() { |
1618 |
> |
protected void realCompute() { |
1619 |
|
FailingAsyncFib f = new FailingAsyncFib(8); |
1620 |
|
AsyncFib g = new AsyncFib(9); |
1621 |
|
AsyncFib h = new AsyncFib(7); |
1622 |
< |
HashSet set = new HashSet(); |
1623 |
< |
set.add(f); |
1572 |
< |
set.add(g); |
1573 |
< |
set.add(h); |
1622 |
> |
ForkJoinTask[] tasks = { f, g, h }; |
1623 |
> |
shuffle(tasks); |
1624 |
|
try { |
1625 |
< |
invokeAll(set); |
1625 |
> |
invokeAll(Arrays.asList(tasks)); |
1626 |
|
shouldThrow(); |
1627 |
|
} catch (FJException success) { |
1628 |
|
checkCompletedAbnormally(f, success); |
1631 |
|
testInvokeOnPool(singletonPool(), a); |
1632 |
|
} |
1633 |
|
|
1634 |
+ |
/** |
1635 |
+ |
* ForkJoinTask.quietlyComplete returns when task completes |
1636 |
+ |
* normally without setting a value. The most recent value |
1637 |
+ |
* established by setRawResult(V) (or null by default) is returned |
1638 |
+ |
* from invoke. |
1639 |
+ |
*/ |
1640 |
+ |
public void testQuietlyComplete() { |
1641 |
+ |
RecursiveAction a = new CheckedRecursiveAction() { |
1642 |
+ |
protected void realCompute() { |
1643 |
+ |
AsyncFib f = new AsyncFib(8); |
1644 |
+ |
f.quietlyComplete(); |
1645 |
+ |
assertEquals(8, f.number); |
1646 |
+ |
checkCompletedNormally(f); |
1647 |
+ |
}}; |
1648 |
+ |
testInvokeOnPool(mainPool(), a); |
1649 |
+ |
} |
1650 |
+ |
|
1651 |
|
} |