3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
|
* http://creativecommons.org/licenses/publicdomain |
5 |
|
*/ |
6 |
– |
import junit.framework.*; |
7 |
– |
import java.util.concurrent.*; |
8 |
– |
import java.util.*; |
6 |
|
|
7 |
+ |
import junit.framework.*; |
8 |
+ |
import java.util.concurrent.CancellationException; |
9 |
+ |
import java.util.concurrent.ExecutionException; |
10 |
+ |
import java.util.concurrent.ForkJoinPool; |
11 |
+ |
import java.util.concurrent.ForkJoinWorkerThread; |
12 |
+ |
import java.util.concurrent.RecursiveAction; |
13 |
+ |
import java.util.concurrent.TimeUnit; |
14 |
+ |
import java.util.HashSet; |
15 |
|
|
16 |
|
public class RecursiveActionTest extends JSR166TestCase { |
17 |
|
|
18 |
|
public static void main(String[] args) { |
19 |
< |
junit.textui.TestRunner.run (suite()); |
19 |
> |
junit.textui.TestRunner.run(suite()); |
20 |
|
} |
21 |
+ |
|
22 |
|
public static Test suite() { |
23 |
< |
return new TestSuite(RecursiveActionTest.class); |
23 |
> |
return new TestSuite(RecursiveActionTest.class); |
24 |
> |
} |
25 |
> |
|
26 |
> |
private static ForkJoinPool mainPool() { |
27 |
> |
return new ForkJoinPool(); |
28 |
> |
} |
29 |
> |
|
30 |
> |
private static ForkJoinPool singletonPool() { |
31 |
> |
return new ForkJoinPool(1); |
32 |
> |
} |
33 |
> |
|
34 |
> |
private static ForkJoinPool asyncSingletonPool() { |
35 |
> |
return new ForkJoinPool(1, |
36 |
> |
ForkJoinPool.defaultForkJoinWorkerThreadFactory, |
37 |
> |
null, true); |
38 |
|
} |
39 |
|
|
40 |
< |
static final ForkJoinPool mainPool = new ForkJoinPool(); |
41 |
< |
static final ForkJoinPool singletonPool = new ForkJoinPool(1); |
42 |
< |
static final ForkJoinPool asyncSingletonPool = new ForkJoinPool(1); |
43 |
< |
static { |
44 |
< |
asyncSingletonPool.setAsyncMode(true); |
40 |
> |
private void testInvokeOnPool(ForkJoinPool pool, RecursiveAction a) { |
41 |
> |
try { |
42 |
> |
assertTrue(pool.invoke(a) == null); |
43 |
> |
} finally { |
44 |
> |
joinPool(pool); |
45 |
> |
} |
46 |
|
} |
47 |
|
|
48 |
|
static final class FJException extends RuntimeException { |
89 |
|
* invoke returns when task completes normally. |
90 |
|
* isCompletedAbnormally and isCancelled return false for normally |
91 |
|
* completed tasks. getRawResult of a RecursiveAction returns null; |
71 |
– |
* |
92 |
|
*/ |
93 |
|
public void testInvoke() { |
94 |
|
RecursiveAction a = new RecursiveAction() { |
95 |
|
public void compute() { |
96 |
|
FibAction f = new FibAction(8); |
97 |
< |
f.invoke(); |
97 |
> |
threadAssertNull(f.invoke()); |
98 |
|
threadAssertTrue(f.result == 21); |
99 |
|
threadAssertTrue(f.isDone()); |
100 |
|
threadAssertFalse(f.isCancelled()); |
101 |
|
threadAssertFalse(f.isCompletedAbnormally()); |
102 |
|
threadAssertTrue(f.getRawResult() == null); |
103 |
|
}}; |
104 |
< |
mainPool.invoke(a); |
104 |
> |
testInvokeOnPool(mainPool(), a); |
105 |
|
} |
106 |
|
|
107 |
|
/** |
120 |
|
threadAssertFalse(f.isCompletedAbnormally()); |
121 |
|
threadAssertTrue(f.getRawResult() == null); |
122 |
|
}}; |
123 |
< |
mainPool.invoke(a); |
123 |
> |
testInvokeOnPool(mainPool(), a); |
124 |
|
} |
125 |
|
|
126 |
|
/** |
130 |
|
RecursiveAction a = new RecursiveAction() { |
131 |
|
public void compute() { |
132 |
|
FibAction f = new FibAction(8); |
133 |
< |
f.fork(); |
134 |
< |
f.join(); |
133 |
> |
threadAssertSame(f, f.fork()); |
134 |
> |
threadAssertNull(f.join()); |
135 |
|
threadAssertTrue(f.result == 21); |
136 |
|
threadAssertTrue(f.isDone()); |
137 |
|
threadAssertTrue(f.getRawResult() == null); |
138 |
|
}}; |
139 |
< |
mainPool.invoke(a); |
139 |
> |
testInvokeOnPool(mainPool(), a); |
140 |
|
} |
141 |
|
|
142 |
|
/** |
147 |
|
public void compute() { |
148 |
|
try { |
149 |
|
FibAction f = new FibAction(8); |
150 |
< |
f.fork(); |
151 |
< |
f.get(); |
150 |
> |
threadAssertSame(f, f.fork()); |
151 |
> |
threadAssertNull(f.get()); |
152 |
|
threadAssertTrue(f.result == 21); |
153 |
|
threadAssertTrue(f.isDone()); |
154 |
|
} catch (Exception ex) { |
155 |
|
unexpectedException(ex); |
156 |
|
} |
157 |
|
}}; |
158 |
< |
mainPool.invoke(a); |
158 |
> |
testInvokeOnPool(mainPool(), a); |
159 |
|
} |
160 |
|
|
161 |
|
/** |
166 |
|
public void compute() { |
167 |
|
try { |
168 |
|
FibAction f = new FibAction(8); |
169 |
< |
f.fork(); |
170 |
< |
f.get(5L, TimeUnit.SECONDS); |
169 |
> |
threadAssertSame(f, f.fork()); |
170 |
> |
threadAssertNull(f.get(5L, TimeUnit.SECONDS)); |
171 |
|
threadAssertTrue(f.result == 21); |
172 |
|
threadAssertTrue(f.isDone()); |
173 |
|
} catch (Exception ex) { |
174 |
|
unexpectedException(ex); |
175 |
|
} |
176 |
|
}}; |
177 |
< |
mainPool.invoke(a); |
177 |
> |
testInvokeOnPool(mainPool(), a); |
178 |
|
} |
179 |
|
|
180 |
|
/** |
182 |
|
*/ |
183 |
|
public void testForkTimedGetNPE() { |
184 |
|
RecursiveAction a = new RecursiveAction() { |
165 |
– |
public void compute() { |
166 |
– |
try { |
167 |
– |
FibAction f = new FibAction(8); |
168 |
– |
f.fork(); |
169 |
– |
f.get(5L, null); |
170 |
– |
shouldThrow(); |
171 |
– |
} catch (NullPointerException success) { |
172 |
– |
} catch (Exception ex) { |
173 |
– |
unexpectedException(ex); |
174 |
– |
} |
175 |
– |
} |
176 |
– |
}; |
177 |
– |
mainPool.invoke(a); |
178 |
– |
} |
179 |
– |
|
180 |
– |
/** |
181 |
– |
* helpJoin of a forked task returns when task completes |
182 |
– |
*/ |
183 |
– |
public void testForkHelpJoin() { |
184 |
– |
RecursiveAction a = new RecursiveAction() { |
185 |
|
public void compute() { |
186 |
< |
FibAction f = new FibAction(8); |
187 |
< |
f.fork(); |
188 |
< |
f.helpJoin(); |
189 |
< |
threadAssertTrue(f.result == 21); |
190 |
< |
threadAssertTrue(f.isDone()); |
186 |
> |
try { |
187 |
> |
FibAction f = new FibAction(8); |
188 |
> |
threadAssertSame(f, f.fork()); |
189 |
> |
f.get(5L, null); |
190 |
> |
shouldThrow(); |
191 |
> |
} catch (NullPointerException success) { |
192 |
> |
} catch (Exception ex) { |
193 |
> |
unexpectedException(ex); |
194 |
> |
} |
195 |
|
}}; |
196 |
< |
mainPool.invoke(a); |
196 |
> |
testInvokeOnPool(mainPool(), a); |
197 |
|
} |
198 |
|
|
199 |
|
/** |
203 |
|
RecursiveAction a = new RecursiveAction() { |
204 |
|
public void compute() { |
205 |
|
FibAction f = new FibAction(8); |
206 |
< |
f.fork(); |
206 |
> |
threadAssertSame(f, f.fork()); |
207 |
|
f.quietlyJoin(); |
208 |
|
threadAssertTrue(f.result == 21); |
209 |
|
threadAssertTrue(f.isDone()); |
210 |
|
}}; |
211 |
< |
mainPool.invoke(a); |
208 |
< |
} |
209 |
< |
|
210 |
< |
|
211 |
< |
/** |
212 |
< |
* quietlyHelpJoin of a forked task returns when task completes |
213 |
< |
*/ |
214 |
< |
public void testForkQuietlyHelpJoin() { |
215 |
< |
RecursiveAction a = new RecursiveAction() { |
216 |
< |
public void compute() { |
217 |
< |
FibAction f = new FibAction(8); |
218 |
< |
f.fork(); |
219 |
< |
f.quietlyHelpJoin(); |
220 |
< |
threadAssertTrue(f.result == 21); |
221 |
< |
threadAssertTrue(f.isDone()); |
222 |
< |
}}; |
223 |
< |
mainPool.invoke(a); |
211 |
> |
testInvokeOnPool(mainPool(), a); |
212 |
|
} |
213 |
|
|
214 |
|
|
220 |
|
RecursiveAction a = new RecursiveAction() { |
221 |
|
public void compute() { |
222 |
|
FibAction f = new FibAction(8); |
223 |
< |
f.fork(); |
223 |
> |
threadAssertSame(f, f.fork()); |
224 |
|
f.helpQuiesce(); |
225 |
|
threadAssertTrue(f.result == 21); |
226 |
|
threadAssertTrue(f.isDone()); |
227 |
|
threadAssertTrue(getQueuedTaskCount() == 0); |
228 |
|
}}; |
229 |
< |
mainPool.invoke(a); |
229 |
> |
testInvokeOnPool(mainPool(), a); |
230 |
|
} |
231 |
|
|
232 |
|
|
243 |
|
} catch (FJException success) { |
244 |
|
} |
245 |
|
}}; |
246 |
< |
mainPool.invoke(a); |
246 |
> |
testInvokeOnPool(mainPool(), a); |
247 |
|
} |
248 |
|
|
249 |
|
/** |
256 |
|
f.quietlyInvoke(); |
257 |
|
threadAssertTrue(f.isDone()); |
258 |
|
}}; |
259 |
< |
mainPool.invoke(a); |
259 |
> |
testInvokeOnPool(mainPool(), a); |
260 |
|
} |
261 |
|
|
262 |
|
/** |
267 |
|
public void compute() { |
268 |
|
try { |
269 |
|
FailingFibAction f = new FailingFibAction(8); |
270 |
< |
f.fork(); |
270 |
> |
threadAssertSame(f, f.fork()); |
271 |
|
f.join(); |
272 |
|
shouldThrow(); |
273 |
|
} catch (FJException success) { |
274 |
|
} |
275 |
|
}}; |
276 |
< |
mainPool.invoke(a); |
276 |
> |
testInvokeOnPool(mainPool(), a); |
277 |
|
} |
278 |
|
|
279 |
|
/** |
284 |
|
public void compute() { |
285 |
|
try { |
286 |
|
FailingFibAction f = new FailingFibAction(8); |
287 |
< |
f.fork(); |
287 |
> |
threadAssertSame(f, f.fork()); |
288 |
|
f.get(); |
289 |
|
shouldThrow(); |
290 |
|
} catch (ExecutionException success) { |
292 |
|
unexpectedException(ex); |
293 |
|
} |
294 |
|
}}; |
295 |
< |
mainPool.invoke(a); |
295 |
> |
testInvokeOnPool(mainPool(), a); |
296 |
|
} |
297 |
|
|
298 |
|
/** |
303 |
|
public void compute() { |
304 |
|
try { |
305 |
|
FailingFibAction f = new FailingFibAction(8); |
306 |
< |
f.fork(); |
306 |
> |
threadAssertSame(f, f.fork()); |
307 |
|
f.get(5L, TimeUnit.SECONDS); |
308 |
|
shouldThrow(); |
309 |
|
} catch (ExecutionException success) { |
311 |
|
unexpectedException(ex); |
312 |
|
} |
313 |
|
}}; |
314 |
< |
mainPool.invoke(a); |
327 |
< |
} |
328 |
< |
|
329 |
< |
/** |
330 |
< |
* join of a forked task throws exception when task completes abnormally |
331 |
< |
*/ |
332 |
< |
public void testAbnormalForkHelpJoin() { |
333 |
< |
RecursiveAction a = new RecursiveAction() { |
334 |
< |
public void compute() { |
335 |
< |
try { |
336 |
< |
FailingFibAction f = new FailingFibAction(8); |
337 |
< |
f.fork(); |
338 |
< |
f.helpJoin(); |
339 |
< |
shouldThrow(); |
340 |
< |
} catch (FJException success) { |
341 |
< |
} |
342 |
< |
}}; |
343 |
< |
mainPool.invoke(a); |
344 |
< |
} |
345 |
< |
|
346 |
< |
/** |
347 |
< |
* quietlyHelpJoin of a forked task returns when task completes abnormally. |
348 |
< |
* getException of failed task returns its exception. |
349 |
< |
* isCompletedAbnormally of a failed task returns true. |
350 |
< |
* isCancelled of a failed uncancelled task returns false |
351 |
< |
*/ |
352 |
< |
public void testAbnormalForkQuietlyHelpJoin() { |
353 |
< |
RecursiveAction a = new RecursiveAction() { |
354 |
< |
public void compute() { |
355 |
< |
FailingFibAction f = new FailingFibAction(8); |
356 |
< |
f.fork(); |
357 |
< |
f.quietlyHelpJoin(); |
358 |
< |
threadAssertTrue(f.isDone()); |
359 |
< |
threadAssertTrue(f.isCompletedAbnormally()); |
360 |
< |
threadAssertFalse(f.isCancelled()); |
361 |
< |
threadAssertTrue(f.getException() instanceof FJException); |
362 |
< |
}}; |
363 |
< |
mainPool.invoke(a); |
314 |
> |
testInvokeOnPool(mainPool(), a); |
315 |
|
} |
316 |
|
|
317 |
|
/** |
321 |
|
RecursiveAction a = new RecursiveAction() { |
322 |
|
public void compute() { |
323 |
|
FailingFibAction f = new FailingFibAction(8); |
324 |
< |
f.fork(); |
324 |
> |
threadAssertSame(f, f.fork()); |
325 |
|
f.quietlyJoin(); |
326 |
|
threadAssertTrue(f.isDone()); |
327 |
|
threadAssertTrue(f.isCompletedAbnormally()); |
328 |
|
threadAssertTrue(f.getException() instanceof FJException); |
329 |
|
}}; |
330 |
< |
mainPool.invoke(a); |
330 |
> |
testInvokeOnPool(mainPool(), a); |
331 |
|
} |
332 |
|
|
333 |
|
/** |
338 |
|
public void compute() { |
339 |
|
try { |
340 |
|
FibAction f = new FibAction(8); |
341 |
< |
f.cancel(true); |
341 |
> |
threadAssertTrue(f.cancel(true)); |
342 |
|
f.invoke(); |
343 |
|
shouldThrow(); |
344 |
|
} catch (CancellationException success) { |
345 |
|
} |
346 |
|
}}; |
347 |
< |
mainPool.invoke(a); |
347 |
> |
testInvokeOnPool(mainPool(), a); |
348 |
|
} |
349 |
|
|
350 |
|
/** |
355 |
|
public void compute() { |
356 |
|
try { |
357 |
|
FibAction f = new FibAction(8); |
358 |
< |
f.cancel(true); |
359 |
< |
f.fork(); |
358 |
> |
threadAssertTrue(f.cancel(true)); |
359 |
> |
threadAssertSame(f, f.fork()); |
360 |
|
f.join(); |
361 |
|
shouldThrow(); |
362 |
|
} catch (CancellationException success) { |
363 |
|
} |
364 |
|
}}; |
365 |
< |
mainPool.invoke(a); |
365 |
> |
testInvokeOnPool(mainPool(), a); |
366 |
|
} |
367 |
|
|
368 |
|
/** |
373 |
|
public void compute() { |
374 |
|
try { |
375 |
|
FibAction f = new FibAction(8); |
376 |
< |
f.cancel(true); |
377 |
< |
f.fork(); |
376 |
> |
threadAssertTrue(f.cancel(true)); |
377 |
> |
threadAssertSame(f, f.fork()); |
378 |
|
f.get(); |
379 |
|
shouldThrow(); |
380 |
|
} catch (CancellationException success) { |
382 |
|
unexpectedException(ex); |
383 |
|
} |
384 |
|
}}; |
385 |
< |
mainPool.invoke(a); |
385 |
> |
testInvokeOnPool(mainPool(), a); |
386 |
|
} |
387 |
|
|
388 |
|
/** |
393 |
|
public void compute() { |
394 |
|
try { |
395 |
|
FibAction f = new FibAction(8); |
396 |
< |
f.cancel(true); |
397 |
< |
f.fork(); |
396 |
> |
threadAssertTrue(f.cancel(true)); |
397 |
> |
threadAssertSame(f, f.fork()); |
398 |
|
f.get(5L, TimeUnit.SECONDS); |
399 |
|
shouldThrow(); |
400 |
|
} catch (CancellationException success) { |
402 |
|
unexpectedException(ex); |
403 |
|
} |
404 |
|
}}; |
405 |
< |
mainPool.invoke(a); |
455 |
< |
} |
456 |
< |
|
457 |
< |
/** |
458 |
< |
* join of a forked task throws exception when task cancelled |
459 |
< |
*/ |
460 |
< |
public void testCancelledForkHelpJoin() { |
461 |
< |
RecursiveAction a = new RecursiveAction() { |
462 |
< |
public void compute() { |
463 |
< |
try { |
464 |
< |
FibAction f = new FibAction(8); |
465 |
< |
f.cancel(true); |
466 |
< |
f.fork(); |
467 |
< |
f.helpJoin(); |
468 |
< |
shouldThrow(); |
469 |
< |
} catch (CancellationException success) { |
470 |
< |
} |
471 |
< |
}}; |
472 |
< |
mainPool.invoke(a); |
473 |
< |
} |
474 |
< |
|
475 |
< |
/** |
476 |
< |
* quietlyHelpJoin of a forked task returns when task cancelled. |
477 |
< |
* getException of cancelled task returns its exception. |
478 |
< |
* isCompletedAbnormally of a cancelled task returns true. |
479 |
< |
* isCancelled of a cancelled task returns true |
480 |
< |
*/ |
481 |
< |
public void testCancelledForkQuietlyHelpJoin() { |
482 |
< |
RecursiveAction a = new RecursiveAction() { |
483 |
< |
public void compute() { |
484 |
< |
FibAction f = new FibAction(8); |
485 |
< |
f.cancel(true); |
486 |
< |
f.fork(); |
487 |
< |
f.quietlyHelpJoin(); |
488 |
< |
threadAssertTrue(f.isDone()); |
489 |
< |
threadAssertTrue(f.isCompletedAbnormally()); |
490 |
< |
threadAssertTrue(f.isCancelled()); |
491 |
< |
threadAssertTrue(f.getException() instanceof CancellationException); |
492 |
< |
}}; |
493 |
< |
mainPool.invoke(a); |
405 |
> |
testInvokeOnPool(mainPool(), a); |
406 |
|
} |
407 |
|
|
408 |
|
/** |
412 |
|
RecursiveAction a = new RecursiveAction() { |
413 |
|
public void compute() { |
414 |
|
FibAction f = new FibAction(8); |
415 |
< |
f.cancel(true); |
416 |
< |
f.fork(); |
415 |
> |
threadAssertTrue(f.cancel(true)); |
416 |
> |
threadAssertSame(f, f.fork()); |
417 |
|
f.quietlyJoin(); |
418 |
|
threadAssertTrue(f.isDone()); |
419 |
|
threadAssertTrue(f.isCompletedAbnormally()); |
420 |
|
threadAssertTrue(f.getException() instanceof CancellationException); |
421 |
|
}}; |
422 |
< |
mainPool.invoke(a); |
422 |
> |
testInvokeOnPool(mainPool(), a); |
423 |
|
} |
424 |
|
|
425 |
|
/** |
426 |
|
* getPool of executing task returns its pool |
427 |
|
*/ |
428 |
|
public void testGetPool() { |
429 |
+ |
final ForkJoinPool mainPool = mainPool(); |
430 |
|
RecursiveAction a = new RecursiveAction() { |
431 |
|
public void compute() { |
432 |
|
threadAssertTrue(getPool() == mainPool); |
433 |
|
}}; |
434 |
< |
mainPool.invoke(a); |
434 |
> |
testInvokeOnPool(mainPool, a); |
435 |
|
} |
436 |
|
|
437 |
|
/** |
442 |
|
public void compute() { |
443 |
|
threadAssertTrue(getPool() == null); |
444 |
|
}}; |
445 |
< |
a.invoke(); |
445 |
> |
assertNull(a.invoke()); |
446 |
|
} |
447 |
|
|
448 |
|
/** |
453 |
|
public void compute() { |
454 |
|
threadAssertTrue(inForkJoinPool()); |
455 |
|
}}; |
456 |
< |
mainPool.invoke(a); |
456 |
> |
testInvokeOnPool(mainPool(), a); |
457 |
|
} |
458 |
|
|
459 |
|
/** |
464 |
|
public void compute() { |
465 |
|
threadAssertTrue(!inForkJoinPool()); |
466 |
|
}}; |
467 |
< |
a.invoke(); |
467 |
> |
assertNull(a.invoke()); |
468 |
|
} |
469 |
|
|
470 |
|
/** |
471 |
|
* getPool of current thread in pool returns its pool |
472 |
|
*/ |
473 |
|
public void testWorkerGetPool() { |
474 |
+ |
final ForkJoinPool mainPool = mainPool(); |
475 |
|
RecursiveAction a = new RecursiveAction() { |
476 |
|
public void compute() { |
477 |
|
ForkJoinWorkerThread w = |
478 |
< |
(ForkJoinWorkerThread)(Thread.currentThread()); |
478 |
> |
(ForkJoinWorkerThread) Thread.currentThread(); |
479 |
|
threadAssertTrue(w.getPool() == mainPool); |
480 |
|
}}; |
481 |
< |
mainPool.invoke(a); |
481 |
> |
testInvokeOnPool(mainPool, a); |
482 |
|
} |
483 |
|
|
484 |
|
/** |
485 |
|
* getPoolIndex of current thread in pool returns 0 <= value < poolSize |
572 |
– |
* |
486 |
|
*/ |
487 |
|
public void testWorkerGetPoolIndex() { |
488 |
+ |
final ForkJoinPool mainPool = mainPool(); |
489 |
|
RecursiveAction a = new RecursiveAction() { |
490 |
|
public void compute() { |
491 |
|
ForkJoinWorkerThread w = |
494 |
|
threadAssertTrue(idx >= 0); |
495 |
|
threadAssertTrue(idx < mainPool.getPoolSize()); |
496 |
|
}}; |
497 |
< |
mainPool.invoke(a); |
497 |
> |
testInvokeOnPool(mainPool, a); |
498 |
|
} |
499 |
|
|
500 |
|
|
506 |
|
public void compute() { |
507 |
|
setRawResult(null); |
508 |
|
}}; |
509 |
< |
a.invoke(); |
509 |
> |
assertNull(a.invoke()); |
510 |
|
} |
511 |
|
|
512 |
|
/** |
516 |
|
RecursiveAction a = new RecursiveAction() { |
517 |
|
public void compute() { |
518 |
|
FibAction f = new FibAction(8); |
519 |
< |
f.invoke(); |
519 |
> |
threadAssertNull(f.invoke()); |
520 |
|
threadAssertTrue(f.result == 21); |
521 |
|
threadAssertTrue(f.isDone()); |
522 |
|
threadAssertFalse(f.isCancelled()); |
523 |
|
threadAssertFalse(f.isCompletedAbnormally()); |
524 |
|
f.reinitialize(); |
525 |
< |
f.invoke(); |
525 |
> |
threadAssertNull(f.invoke()); |
526 |
|
threadAssertTrue(f.result == 21); |
527 |
|
}}; |
528 |
< |
mainPool.invoke(a); |
528 |
> |
testInvokeOnPool(mainPool(), a); |
529 |
|
} |
530 |
|
|
531 |
|
/** |
542 |
|
} catch (FJException success) { |
543 |
|
} |
544 |
|
}}; |
545 |
< |
mainPool.invoke(a); |
545 |
> |
testInvokeOnPool(mainPool(), a); |
546 |
|
} |
547 |
|
|
548 |
|
/** |
553 |
|
public void compute() { |
554 |
|
FibAction f = new FibAction(8); |
555 |
|
f.complete(null); |
556 |
< |
f.invoke(); |
556 |
> |
threadAssertNull(f.invoke()); |
557 |
|
threadAssertTrue(f.isDone()); |
558 |
|
threadAssertTrue(f.result == 0); |
559 |
|
}}; |
560 |
< |
mainPool.invoke(a); |
560 |
> |
testInvokeOnPool(mainPool(), a); |
561 |
|
} |
562 |
|
|
563 |
|
/** |
574 |
|
threadAssertTrue(g.isDone()); |
575 |
|
threadAssertTrue(g.result == 34); |
576 |
|
}}; |
577 |
< |
mainPool.invoke(a); |
577 |
> |
testInvokeOnPool(mainPool(), a); |
578 |
|
} |
579 |
|
|
580 |
|
/** |
588 |
|
threadAssertTrue(f.isDone()); |
589 |
|
threadAssertTrue(f.result == 21); |
590 |
|
}}; |
591 |
< |
mainPool.invoke(a); |
591 |
> |
testInvokeOnPool(mainPool(), a); |
592 |
|
} |
593 |
|
|
594 |
|
/** |
608 |
|
threadAssertTrue(h.isDone()); |
609 |
|
threadAssertTrue(h.result == 13); |
610 |
|
}}; |
611 |
< |
mainPool.invoke(a); |
611 |
> |
testInvokeOnPool(mainPool(), a); |
612 |
|
} |
613 |
|
|
614 |
|
/** |
632 |
|
threadAssertTrue(h.isDone()); |
633 |
|
threadAssertTrue(h.result == 13); |
634 |
|
}}; |
635 |
< |
mainPool.invoke(a); |
635 |
> |
testInvokeOnPool(mainPool(), a); |
636 |
|
} |
637 |
|
|
638 |
|
|
651 |
|
} catch (NullPointerException success) { |
652 |
|
} |
653 |
|
}}; |
654 |
< |
mainPool.invoke(a); |
654 |
> |
testInvokeOnPool(mainPool(), a); |
655 |
|
} |
656 |
|
|
657 |
|
/** |
668 |
|
} catch (FJException success) { |
669 |
|
} |
670 |
|
}}; |
671 |
< |
mainPool.invoke(a); |
671 |
> |
testInvokeOnPool(mainPool(), a); |
672 |
|
} |
673 |
|
|
674 |
|
/** |
684 |
|
} catch (FJException success) { |
685 |
|
} |
686 |
|
}}; |
687 |
< |
mainPool.invoke(a); |
687 |
> |
testInvokeOnPool(mainPool(), a); |
688 |
|
} |
689 |
|
|
690 |
|
/** |
702 |
|
} catch (FJException success) { |
703 |
|
} |
704 |
|
}}; |
705 |
< |
mainPool.invoke(a); |
705 |
> |
testInvokeOnPool(mainPool(), a); |
706 |
|
} |
707 |
|
|
708 |
|
/** |
724 |
|
} catch (FJException success) { |
725 |
|
} |
726 |
|
}}; |
727 |
< |
mainPool.invoke(a); |
727 |
> |
testInvokeOnPool(mainPool(), a); |
728 |
|
} |
729 |
|
|
730 |
|
/** |
735 |
|
RecursiveAction a = new RecursiveAction() { |
736 |
|
public void compute() { |
737 |
|
FibAction g = new FibAction(9); |
738 |
< |
g.fork(); |
738 |
> |
threadAssertSame(g, g.fork()); |
739 |
|
FibAction f = new FibAction(8); |
740 |
< |
f.fork(); |
740 |
> |
threadAssertSame(f, f.fork()); |
741 |
|
threadAssertTrue(f.tryUnfork()); |
742 |
|
helpQuiesce(); |
743 |
|
threadAssertFalse(f.isDone()); |
744 |
|
threadAssertTrue(g.isDone()); |
745 |
|
}}; |
746 |
< |
singletonPool.invoke(a); |
746 |
> |
testInvokeOnPool(singletonPool(), a); |
747 |
|
} |
748 |
|
|
749 |
|
/** |
754 |
|
RecursiveAction a = new RecursiveAction() { |
755 |
|
public void compute() { |
756 |
|
FibAction h = new FibAction(7); |
757 |
< |
h.fork(); |
757 |
> |
threadAssertSame(h, h.fork()); |
758 |
|
FibAction g = new FibAction(9); |
759 |
< |
g.fork(); |
759 |
> |
threadAssertSame(g, g.fork()); |
760 |
|
FibAction f = new FibAction(8); |
761 |
< |
f.fork(); |
761 |
> |
threadAssertSame(f, f.fork()); |
762 |
|
threadAssertTrue(getSurplusQueuedTaskCount() > 0); |
763 |
|
helpQuiesce(); |
764 |
|
}}; |
765 |
< |
singletonPool.invoke(a); |
765 |
> |
testInvokeOnPool(singletonPool(), a); |
766 |
|
} |
767 |
|
|
768 |
|
/** |
772 |
|
RecursiveAction a = new RecursiveAction() { |
773 |
|
public void compute() { |
774 |
|
FibAction g = new FibAction(9); |
775 |
< |
g.fork(); |
775 |
> |
threadAssertSame(g, g.fork()); |
776 |
|
FibAction f = new FibAction(8); |
777 |
< |
f.fork(); |
777 |
> |
threadAssertSame(f, f.fork()); |
778 |
|
threadAssertTrue(peekNextLocalTask() == f); |
779 |
< |
f.join(); |
779 |
> |
threadAssertNull(f.join()); |
780 |
|
threadAssertTrue(f.isDone()); |
781 |
|
helpQuiesce(); |
782 |
|
}}; |
783 |
< |
singletonPool.invoke(a); |
783 |
> |
testInvokeOnPool(singletonPool(), a); |
784 |
|
} |
785 |
|
|
786 |
|
/** |
791 |
|
RecursiveAction a = new RecursiveAction() { |
792 |
|
public void compute() { |
793 |
|
FibAction g = new FibAction(9); |
794 |
< |
g.fork(); |
794 |
> |
threadAssertSame(g, g.fork()); |
795 |
|
FibAction f = new FibAction(8); |
796 |
< |
f.fork(); |
796 |
> |
threadAssertSame(f, f.fork()); |
797 |
|
threadAssertTrue(pollNextLocalTask() == f); |
798 |
|
helpQuiesce(); |
799 |
|
threadAssertFalse(f.isDone()); |
800 |
|
}}; |
801 |
< |
singletonPool.invoke(a); |
801 |
> |
testInvokeOnPool(singletonPool(), a); |
802 |
|
} |
803 |
|
|
804 |
|
/** |
809 |
|
RecursiveAction a = new RecursiveAction() { |
810 |
|
public void compute() { |
811 |
|
FibAction g = new FibAction(9); |
812 |
< |
g.fork(); |
812 |
> |
threadAssertSame(g, g.fork()); |
813 |
|
FibAction f = new FibAction(8); |
814 |
< |
f.fork(); |
814 |
> |
threadAssertSame(f, f.fork()); |
815 |
|
threadAssertTrue(pollTask() == f); |
816 |
|
helpQuiesce(); |
817 |
|
threadAssertFalse(f.isDone()); |
818 |
|
threadAssertTrue(g.isDone()); |
819 |
|
}}; |
820 |
< |
singletonPool.invoke(a); |
820 |
> |
testInvokeOnPool(singletonPool(), a); |
821 |
|
} |
822 |
|
|
823 |
|
/** |
827 |
|
RecursiveAction a = new RecursiveAction() { |
828 |
|
public void compute() { |
829 |
|
FibAction g = new FibAction(9); |
830 |
< |
g.fork(); |
830 |
> |
threadAssertSame(g, g.fork()); |
831 |
|
FibAction f = new FibAction(8); |
832 |
< |
f.fork(); |
832 |
> |
threadAssertSame(f, f.fork()); |
833 |
|
threadAssertTrue(peekNextLocalTask() == g); |
834 |
< |
f.join(); |
834 |
> |
threadAssertNull(f.join()); |
835 |
|
helpQuiesce(); |
836 |
|
threadAssertTrue(f.isDone()); |
837 |
|
}}; |
838 |
< |
asyncSingletonPool.invoke(a); |
838 |
> |
testInvokeOnPool(asyncSingletonPool(), a); |
839 |
|
} |
840 |
|
|
841 |
|
/** |
846 |
|
RecursiveAction a = new RecursiveAction() { |
847 |
|
public void compute() { |
848 |
|
FibAction g = new FibAction(9); |
849 |
< |
g.fork(); |
849 |
> |
threadAssertSame(g, g.fork()); |
850 |
|
FibAction f = new FibAction(8); |
851 |
< |
f.fork(); |
851 |
> |
threadAssertSame(f, f.fork()); |
852 |
|
threadAssertTrue(pollNextLocalTask() == g); |
853 |
|
helpQuiesce(); |
854 |
|
threadAssertTrue(f.isDone()); |
855 |
|
threadAssertFalse(g.isDone()); |
856 |
|
}}; |
857 |
< |
asyncSingletonPool.invoke(a); |
857 |
> |
testInvokeOnPool(asyncSingletonPool(), a); |
858 |
|
} |
859 |
|
|
860 |
|
/** |
865 |
|
RecursiveAction a = new RecursiveAction() { |
866 |
|
public void compute() { |
867 |
|
FibAction g = new FibAction(9); |
868 |
< |
g.fork(); |
868 |
> |
threadAssertSame(g, g.fork()); |
869 |
|
FibAction f = new FibAction(8); |
870 |
< |
f.fork(); |
870 |
> |
threadAssertSame(f, f.fork()); |
871 |
|
threadAssertTrue(pollTask() == g); |
872 |
|
helpQuiesce(); |
873 |
|
threadAssertTrue(f.isDone()); |
874 |
|
threadAssertFalse(g.isDone()); |
875 |
|
}}; |
876 |
< |
asyncSingletonPool.invoke(a); |
876 |
> |
testInvokeOnPool(asyncSingletonPool(), a); |
877 |
|
} |
878 |
|
|
879 |
|
} |