5 |
|
*/ |
6 |
|
|
7 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
8 |
– |
import static java.util.concurrent.TimeUnit.SECONDS; |
8 |
|
|
9 |
|
import java.util.Arrays; |
11 |
– |
import java.util.Collections; |
10 |
|
import java.util.concurrent.CountDownLatch; |
11 |
|
import java.util.concurrent.ExecutionException; |
12 |
|
import java.util.concurrent.ForkJoinPool; |
99 |
|
assertNull(a.getException()); |
100 |
|
assertNull(a.getRawResult()); |
101 |
|
if (a instanceof BinaryAsyncAction) |
102 |
< |
assertTrue(((BinaryAsyncAction)a).getForkJoinTaskTag() == INITIAL_STATE); |
102 |
> |
assertEquals(INITIAL_STATE, |
103 |
> |
((BinaryAsyncAction)a).getForkJoinTaskTag()); |
104 |
|
|
105 |
|
try { |
106 |
< |
a.get(0L, SECONDS); |
106 |
> |
a.get(randomExpiredTimeout(), randomTimeUnit()); |
107 |
|
shouldThrow(); |
108 |
|
} catch (TimeoutException success) { |
109 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
121 |
|
assertNull(a.getException()); |
122 |
|
assertSame(expected, a.getRawResult()); |
123 |
|
if (a instanceof BinaryAsyncAction) |
124 |
< |
assertTrue(((BinaryAsyncAction)a).getForkJoinTaskTag() == COMPLETE_STATE); |
124 |
> |
assertEquals(COMPLETE_STATE, |
125 |
> |
((BinaryAsyncAction)a).getForkJoinTaskTag()); |
126 |
|
|
127 |
|
{ |
128 |
|
Thread.currentThread().interrupt(); |
129 |
|
long startTime = System.nanoTime(); |
130 |
|
assertSame(expected, a.join()); |
131 |
< |
assertTrue(millisElapsedSince(startTime) < SMALL_DELAY_MS); |
131 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
132 |
|
Thread.interrupted(); |
133 |
|
} |
134 |
|
|
136 |
|
Thread.currentThread().interrupt(); |
137 |
|
long startTime = System.nanoTime(); |
138 |
|
a.quietlyJoin(); // should be no-op |
139 |
< |
assertTrue(millisElapsedSince(startTime) < SMALL_DELAY_MS); |
139 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
140 |
|
Thread.interrupted(); |
141 |
|
} |
142 |
|
|
144 |
|
assertFalse(a.cancel(true)); |
145 |
|
try { |
146 |
|
assertSame(expected, a.get()); |
147 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
148 |
< |
try { |
149 |
< |
assertSame(expected, a.get(5L, SECONDS)); |
147 |
> |
assertSame(expected, a.get(randomTimeout(), randomTimeUnit())); |
148 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
149 |
|
} |
150 |
|
|
172 |
|
{ |
173 |
|
long startTime = System.nanoTime(); |
174 |
|
a.quietlyJoin(); // should be no-op |
175 |
< |
assertTrue(millisElapsedSince(startTime) < SMALL_DELAY_MS); |
175 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
176 |
|
} |
177 |
|
|
178 |
|
try { |
183 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
184 |
|
|
185 |
|
try { |
186 |
< |
a.get(5L, SECONDS); |
186 |
> |
a.get(randomTimeout(), randomTimeUnit()); |
187 |
|
shouldThrow(); |
188 |
|
} catch (ExecutionException success) { |
189 |
|
assertSame(t.getClass(), success.getCause().getClass()); |
248 |
|
} |
249 |
|
return false; |
250 |
|
} |
251 |
< |
|
251 |
> |
|
252 |
|
public final void complete() { |
253 |
|
BinaryAsyncAction a = this; |
254 |
|
for (;;) { |
308 |
|
try { |
309 |
|
AsyncFib f = this; |
310 |
|
int n = f.number; |
311 |
< |
if (n > 1) { |
312 |
< |
while (n > 1) { |
313 |
< |
AsyncFib p = f; |
314 |
< |
AsyncFib r = new AsyncFib(n - 2); |
315 |
< |
f = new AsyncFib(--n); |
316 |
< |
p.linkSubtasks(r, f); |
319 |
< |
r.fork(); |
320 |
< |
} |
321 |
< |
f.number = n; |
311 |
> |
while (n > 1) { |
312 |
> |
AsyncFib p = f; |
313 |
> |
AsyncFib r = new AsyncFib(n - 2); |
314 |
> |
f = new AsyncFib(--n); |
315 |
> |
p.linkSubtasks(r, f); |
316 |
> |
r.fork(); |
317 |
|
} |
318 |
|
f.complete(); |
319 |
|
} |
346 |
|
try { |
347 |
|
FailingAsyncFib f = this; |
348 |
|
int n = f.number; |
349 |
< |
if (n > 1) { |
350 |
< |
while (n > 1) { |
351 |
< |
FailingAsyncFib p = f; |
352 |
< |
FailingAsyncFib r = new FailingAsyncFib(n - 2); |
353 |
< |
f = new FailingAsyncFib(--n); |
354 |
< |
p.linkSubtasks(r, f); |
360 |
< |
r.fork(); |
361 |
< |
} |
362 |
< |
f.number = n; |
349 |
> |
while (n > 1) { |
350 |
> |
FailingAsyncFib p = f; |
351 |
> |
FailingAsyncFib r = new FailingAsyncFib(n - 2); |
352 |
> |
f = new FailingAsyncFib(--n); |
353 |
> |
p.linkSubtasks(r, f); |
354 |
> |
r.fork(); |
355 |
|
} |
356 |
|
f.complete(); |
357 |
|
} |
485 |
|
AsyncFib f = new AsyncFib(8); |
486 |
|
assertSame(f, f.fork()); |
487 |
|
try { |
488 |
< |
f.get(5L, null); |
488 |
> |
f.get(randomTimeout(), null); |
489 |
|
shouldThrow(); |
490 |
|
} catch (NullPointerException success) {} |
491 |
|
}}; |
919 |
|
AsyncFib f = new AsyncFib(8); |
920 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
921 |
|
ForkJoinTask[] tasks = { f, g }; |
922 |
< |
Collections.shuffle(Arrays.asList(tasks)); |
922 |
> |
shuffle(tasks); |
923 |
|
try { |
924 |
|
invokeAll(tasks[0], tasks[1]); |
925 |
|
shouldThrow(); |
946 |
|
FailingAsyncFib g = new FailingAsyncFib(9); |
947 |
|
AsyncFib h = new AsyncFib(7); |
948 |
|
ForkJoinTask[] tasks = { f, g, h }; |
949 |
< |
Collections.shuffle(Arrays.asList(tasks)); |
949 |
> |
shuffle(tasks); |
950 |
|
try { |
951 |
|
invokeAll(tasks[0], tasks[1], tasks[2]); |
952 |
|
shouldThrow(); |
973 |
|
AsyncFib g = new AsyncFib(9); |
974 |
|
AsyncFib h = new AsyncFib(7); |
975 |
|
ForkJoinTask[] tasks = { f, g, h }; |
976 |
< |
Collections.shuffle(Arrays.asList(tasks)); |
976 |
> |
shuffle(tasks); |
977 |
|
try { |
978 |
|
invokeAll(Arrays.asList(tasks)); |
979 |
|
shouldThrow(); |