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.HashSet; |
10 |
|
import java.util.concurrent.CancellationException; |
11 |
|
import java.util.concurrent.ExecutionException; |
12 |
|
import java.util.concurrent.ForkJoinPool; |
13 |
< |
import java.util.concurrent.ForkJoinWorkerThread; |
13 |
> |
import java.util.concurrent.ForkJoinTask; |
14 |
|
import java.util.concurrent.RecursiveTask; |
13 |
– |
import java.util.concurrent.TimeUnit; |
15 |
|
import java.util.concurrent.TimeoutException; |
16 |
< |
import static java.util.concurrent.TimeUnit.SECONDS; |
17 |
< |
import java.util.HashSet; |
16 |
> |
|
17 |
> |
import junit.framework.Test; |
18 |
> |
import junit.framework.TestSuite; |
19 |
|
|
20 |
|
public class RecursiveTaskTest extends JSR166TestCase { |
21 |
|
|
22 |
|
public static void main(String[] args) { |
23 |
< |
junit.textui.TestRunner.run(suite()); |
23 |
> |
main(suite(), args); |
24 |
|
} |
25 |
|
public static Test suite() { |
26 |
|
return new TestSuite(RecursiveTaskTest.class); |
41 |
|
} |
42 |
|
|
43 |
|
private <T> T testInvokeOnPool(ForkJoinPool pool, RecursiveTask<T> a) { |
44 |
< |
try { |
44 |
> |
try (PoolCleaner cleaner = cleaner(pool)) { |
45 |
|
checkNotDone(a); |
46 |
|
|
47 |
|
T result = pool.invoke(a); |
48 |
|
|
49 |
|
checkCompletedNormally(a, result); |
50 |
|
return result; |
49 |
– |
} finally { |
50 |
– |
joinPool(pool); |
51 |
|
} |
52 |
|
} |
53 |
|
|
59 |
|
assertNull(a.getException()); |
60 |
|
assertNull(a.getRawResult()); |
61 |
|
|
62 |
< |
if (! (Thread.currentThread() instanceof ForkJoinWorkerThread)) { |
62 |
> |
if (! ForkJoinTask.inForkJoinPool()) { |
63 |
|
Thread.currentThread().interrupt(); |
64 |
|
try { |
65 |
|
a.get(); |
152 |
|
assertFalse(a.isCancelled()); |
153 |
|
assertFalse(a.isCompletedNormally()); |
154 |
|
assertTrue(a.isCompletedAbnormally()); |
155 |
< |
assertSame(t, a.getException()); |
155 |
> |
assertSame(t.getClass(), a.getException().getClass()); |
156 |
|
assertNull(a.getRawResult()); |
157 |
|
assertFalse(a.cancel(false)); |
158 |
|
assertFalse(a.cancel(true)); |
161 |
|
a.join(); |
162 |
|
shouldThrow(); |
163 |
|
} catch (Throwable expected) { |
164 |
< |
assertSame(t, expected); |
164 |
> |
assertSame(t.getClass(), expected.getClass()); |
165 |
|
} |
166 |
|
|
167 |
|
try { |
168 |
|
a.get(); |
169 |
|
shouldThrow(); |
170 |
|
} catch (ExecutionException success) { |
171 |
< |
assertSame(t, success.getCause()); |
171 |
> |
assertSame(t.getClass(), success.getCause().getClass()); |
172 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
173 |
|
|
174 |
|
try { |
175 |
|
a.get(5L, SECONDS); |
176 |
|
shouldThrow(); |
177 |
|
} catch (ExecutionException success) { |
178 |
< |
assertSame(t, success.getCause()); |
178 |
> |
assertSame(t.getClass(), success.getCause().getClass()); |
179 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
180 |
|
} |
181 |
|
|
182 |
< |
static final class FJException extends RuntimeException { |
183 |
< |
FJException() { super(); } |
182 |
> |
public static final class FJException extends RuntimeException { |
183 |
> |
public FJException() { super(); } |
184 |
|
} |
185 |
|
|
186 |
< |
// An invalid return value for Fib |
186 |
> |
/** An invalid return value for Fib. */ |
187 |
|
static final Integer NoResult = Integer.valueOf(-17); |
188 |
|
|
189 |
< |
// A simple recursive task for testing |
189 |
> |
/** A simple recursive task for testing. */ |
190 |
|
final class FibTask extends CheckedRecursiveTask<Integer> { |
191 |
|
final int number; |
192 |
|
FibTask(int n) { number = n; } |
204 |
|
} |
205 |
|
} |
206 |
|
|
207 |
< |
// A recursive action failing in base case |
207 |
> |
/** A recursive action failing in base case. */ |
208 |
|
final class FailingFibTask extends RecursiveTask<Integer> { |
209 |
|
final int number; |
210 |
|
int result; |
318 |
|
assertEquals(21, (int) testInvokeOnPool(mainPool(), a)); |
319 |
|
} |
320 |
|
|
321 |
– |
|
321 |
|
/** |
322 |
|
* helpQuiesce returns when tasks are complete. |
323 |
|
* getQueuedTaskCount returns 0 when quiescent |
327 |
|
public Integer realCompute() { |
328 |
|
FibTask f = new FibTask(8); |
329 |
|
assertSame(f, f.fork()); |
330 |
< |
f.helpQuiesce(); |
330 |
> |
helpQuiesce(); |
331 |
> |
while (!f.isDone()) // wait out race |
332 |
> |
; |
333 |
|
assertEquals(0, getQueuedTaskCount()); |
334 |
|
checkCompletedNormally(f, 21); |
335 |
|
return NoResult; |
337 |
|
assertSame(NoResult, testInvokeOnPool(mainPool(), a)); |
338 |
|
} |
339 |
|
|
339 |
– |
|
340 |
|
/** |
341 |
|
* invoke task throws exception when task completes abnormally |
342 |
|
*/ |
762 |
|
assertSame(NoResult, testInvokeOnPool(mainPool(), a)); |
763 |
|
} |
764 |
|
|
765 |
– |
|
765 |
|
/** |
766 |
|
* invokeAll(tasks) with any null task throws NPE |
767 |
|
*/ |