5 |
|
*/ |
6 |
|
|
7 |
|
package jsr166y; |
8 |
+ |
|
9 |
|
import java.io.Serializable; |
10 |
|
import java.util.Collection; |
11 |
|
import java.util.List; |
30 |
|
* subtasks may be hosted by a small number of actual threads in a |
31 |
|
* ForkJoinPool, at the price of some usage limitations. |
32 |
|
* |
33 |
< |
* <p>A "main" {@code ForkJoinTask} begins execution when submitted |
34 |
< |
* to a {@link ForkJoinPool}. Once started, it will usually in turn |
35 |
< |
* start other subtasks. As indicated by the name of this class, |
36 |
< |
* many programs using {@code ForkJoinTask} employ only methods |
37 |
< |
* {@link #fork} and {@link #join}, or derivatives such as {@link |
33 |
> |
* <p>A "main" {@code ForkJoinTask} begins execution when it is |
34 |
> |
* explicitly submitted to a {@link ForkJoinPool}, or, if not already |
35 |
> |
* engaged in a ForkJoin computation, commenced in the {@link |
36 |
> |
* ForkJoinPool#commonPool()} via {@link #fork}, {@link #invoke}, or |
37 |
> |
* related methods. Once started, it will usually in turn start other |
38 |
> |
* subtasks. As indicated by the name of this class, many programs |
39 |
> |
* using {@code ForkJoinTask} employ only methods {@link #fork} and |
40 |
> |
* {@link #join}, or derivatives such as {@link |
41 |
|
* #invokeAll(ForkJoinTask...) invokeAll}. However, this class also |
42 |
|
* provides a number of other methods that can come into play in |
43 |
< |
* advanced usages, as well as extension mechanics that allow |
44 |
< |
* support of new forms of fork/join processing. |
43 |
> |
* advanced usages, as well as extension mechanics that allow support |
44 |
> |
* of new forms of fork/join processing. |
45 |
|
* |
46 |
|
* <p>A {@code ForkJoinTask} is a lightweight form of {@link Future}. |
47 |
|
* The efficiency of {@code ForkJoinTask}s stems from a set of |
55 |
|
* minimize other blocking synchronization apart from joining other |
56 |
|
* tasks or using synchronizers such as Phasers that are advertised to |
57 |
|
* cooperate with fork/join scheduling. Subdividable tasks should also |
58 |
< |
* not perform blocking IO, and should ideally access variables that |
58 |
> |
* not perform blocking I/O, and should ideally access variables that |
59 |
|
* are completely independent of those accessed by other running |
60 |
|
* tasks. These guidelines are loosely enforced by not permitting |
61 |
|
* checked exceptions such as {@code IOExceptions} to be |
73 |
|
* <p>It is possible to define and use ForkJoinTasks that may block, |
74 |
|
* but doing do requires three further considerations: (1) Completion |
75 |
|
* of few if any <em>other</em> tasks should be dependent on a task |
76 |
< |
* that blocks on external synchronization or IO. Event-style async |
77 |
< |
* tasks that are never joined often fall into this category. (2) To |
78 |
< |
* minimize resource impact, tasks should be small; ideally performing |
79 |
< |
* only the (possibly) blocking action. (3) Unless the {@link |
76 |
> |
* that blocks on external synchronization or I/O. Event-style async |
77 |
> |
* tasks that are never joined (for example, those subclassing {@link |
78 |
> |
* CountedCompleter}) often fall into this category. (2) To minimize |
79 |
> |
* resource impact, tasks should be small; ideally performing only the |
80 |
> |
* (possibly) blocking action. (3) Unless the {@link |
81 |
|
* ForkJoinPool.ManagedBlocker} API is used, or the number of possibly |
82 |
|
* blocked tasks is known to be less than the pool's {@link |
83 |
|
* ForkJoinPool#getParallelism} level, the pool cannot guarantee that |
120 |
|
* <p>The ForkJoinTask class is not usually directly subclassed. |
121 |
|
* Instead, you subclass one of the abstract classes that support a |
122 |
|
* particular style of fork/join processing, typically {@link |
123 |
< |
* RecursiveAction} for computations that do not return results, or |
124 |
< |
* {@link RecursiveTask} for those that do. Normally, a concrete |
125 |
< |
* ForkJoinTask subclass declares fields comprising its parameters, |
126 |
< |
* established in a constructor, and then defines a {@code compute} |
127 |
< |
* method that somehow uses the control methods supplied by this base |
128 |
< |
* class. While these methods have {@code public} access (to allow |
129 |
< |
* instances of different task subclasses to call each other's |
125 |
< |
* methods), some of them may only be called from within other |
126 |
< |
* ForkJoinTasks (as may be determined using method {@link |
127 |
< |
* #inForkJoinPool}). Attempts to invoke them in other contexts |
128 |
< |
* result in exceptions or errors, possibly including |
129 |
< |
* {@code ClassCastException}. |
123 |
> |
* RecursiveAction} for most computations that do not return results, |
124 |
> |
* {@link RecursiveTask} for those that do, and {@link |
125 |
> |
* CountedCompleter} for those in which completed actions trigger |
126 |
> |
* other actions. Normally, a concrete ForkJoinTask subclass declares |
127 |
> |
* fields comprising its parameters, established in a constructor, and |
128 |
> |
* then defines a {@code compute} method that somehow uses the control |
129 |
> |
* methods supplied by this base class. |
130 |
|
* |
131 |
|
* <p>Method {@link #join} and its variants are appropriate for use |
132 |
|
* only when completion dependencies are acyclic; that is, the |
137 |
|
* {@link Phaser}, {@link #helpQuiesce}, and {@link #complete}) that |
138 |
|
* may be of use in constructing custom subclasses for problems that |
139 |
|
* are not statically structured as DAGs. To support such usages a |
140 |
< |
* ForkJoinTask may be atomically <em>marked</em> using {@link |
141 |
< |
* #markForkJoinTask} and checked for marking using {@link |
142 |
< |
* #isMarkedForkJoinTask}. The ForkJoinTask implementation does not |
143 |
< |
* use these {@code protected} methods or marks for any purpose, but |
144 |
< |
* they may be of use in the construction of specialized subclasses. |
145 |
< |
* For example, parallel graph traversals can use the supplied methods |
146 |
< |
* to avoid revisiting nodes/tasks that have already been processed. |
147 |
< |
* Also, completion based designs can use them to record that one |
148 |
< |
* subtask has completed. (Method names for marking are bulky in part |
149 |
< |
* to encourage definition of methods that reflect their usage |
150 |
< |
* patterns.) |
140 |
> |
* ForkJoinTask may be atomically <em>tagged</em> with a {@code short} |
141 |
> |
* value using {@link #setForkJoinTaskTag} or {@link |
142 |
> |
* #compareAndSetForkJoinTaskTag} and checked using {@link |
143 |
> |
* #getForkJoinTaskTag}. The ForkJoinTask implementation does not use |
144 |
> |
* these {@code protected} methods or tags for any purpose, but they |
145 |
> |
* may be of use in the construction of specialized subclasses. For |
146 |
> |
* example, parallel graph traversals can use the supplied methods to |
147 |
> |
* avoid revisiting nodes/tasks that have already been processed. |
148 |
> |
* (Method names for tagging are bulky in part to encourage definition |
149 |
> |
* of methods that reflect their usage patterns.) |
150 |
|
* |
151 |
|
* <p>Most base support methods are {@code final}, to prevent |
152 |
|
* overriding of implementations that are intrinsically tied to the |
212 |
|
* thin-lock techniques, so use some odd coding idioms that tend |
213 |
|
* to avoid them, mainly by arranging that every synchronized |
214 |
|
* block performs a wait, notifyAll or both. |
215 |
+ |
* |
216 |
+ |
* These control bits occupy only (some of) the upper half (16 |
217 |
+ |
* bits) of status field. The lower bits are used for user-defined |
218 |
+ |
* tags. |
219 |
|
*/ |
220 |
|
|
221 |
|
/** The run status of this task */ |
224 |
|
static final int NORMAL = 0xf0000000; // must be negative |
225 |
|
static final int CANCELLED = 0xc0000000; // must be < NORMAL |
226 |
|
static final int EXCEPTIONAL = 0x80000000; // must be < CANCELLED |
227 |
< |
static final int SIGNAL = 0x00000001; |
228 |
< |
static final int MARKED = 0x00000002; |
227 |
> |
static final int SIGNAL = 0x00010000; // must be >= 1 << 16 |
228 |
> |
static final int SMASK = 0x0000ffff; // short bits for tags |
229 |
|
|
230 |
|
/** |
231 |
|
* Marks completion and wakes up threads waiting to join this |
232 |
< |
* task. A specialization for NORMAL completion is in method |
230 |
< |
* doExec. |
232 |
> |
* task. |
233 |
|
* |
234 |
|
* @param completion one of NORMAL, CANCELLED, EXCEPTIONAL |
235 |
|
* @return completion status on exit |
239 |
|
if ((s = status) < 0) |
240 |
|
return s; |
241 |
|
if (U.compareAndSwapInt(this, STATUS, s, s | completion)) { |
242 |
< |
if ((s & SIGNAL) != 0) |
242 |
> |
if ((s >>> 16) != 0) |
243 |
|
synchronized (this) { notifyAll(); } |
244 |
|
return completion; |
245 |
|
} |
261 |
|
} catch (Throwable rex) { |
262 |
|
return setExceptionalCompletion(rex); |
263 |
|
} |
264 |
< |
while ((s = status) >= 0 && completed) { |
265 |
< |
if (U.compareAndSwapInt(this, STATUS, s, s | NORMAL)) { |
264 |
< |
if ((s & SIGNAL) != 0) |
265 |
< |
synchronized (this) { notifyAll(); } |
266 |
< |
return NORMAL; |
267 |
< |
} |
268 |
< |
} |
264 |
> |
if (completed) |
265 |
> |
s = setCompletion(NORMAL); |
266 |
|
} |
267 |
|
return s; |
268 |
|
} |
269 |
|
|
270 |
|
/** |
271 |
< |
* Tries to set SIGNAL status. Used by ForkJoinPool. Other |
272 |
< |
* variants are directly incorporated into externalAwaitDone etc. |
271 |
> |
* Tries to set SIGNAL status unless already completed. Used by |
272 |
> |
* ForkJoinPool. Other variants are directly incorporated into |
273 |
> |
* externalAwaitDone etc. |
274 |
|
* |
275 |
|
* @return true if successful |
276 |
|
*/ |
277 |
|
final boolean trySetSignal() { |
278 |
< |
int s; |
279 |
< |
return U.compareAndSwapInt(this, STATUS, s = status, s | SIGNAL); |
278 |
> |
int s = status; |
279 |
> |
return s >= 0 && U.compareAndSwapInt(this, STATUS, s, s | SIGNAL); |
280 |
|
} |
281 |
|
|
282 |
|
/** |
284 |
|
* @return status upon completion |
285 |
|
*/ |
286 |
|
private int externalAwaitDone() { |
289 |
– |
boolean interrupted = false; |
287 |
|
int s; |
288 |
+ |
ForkJoinPool.externalHelpJoin(this); |
289 |
+ |
boolean interrupted = false; |
290 |
|
while ((s = status) >= 0) { |
291 |
|
if (U.compareAndSwapInt(this, STATUS, s, s | SIGNAL)) { |
292 |
|
synchronized (this) { |
314 |
|
int s; |
315 |
|
if (Thread.interrupted()) |
316 |
|
throw new InterruptedException(); |
317 |
+ |
ForkJoinPool.externalHelpJoin(this); |
318 |
|
while ((s = status) >= 0) { |
319 |
|
if (U.compareAndSwapInt(this, STATUS, s, s | SIGNAL)) { |
320 |
|
synchronized (this) { |
338 |
|
*/ |
339 |
|
private int doJoin() { |
340 |
|
int s; Thread t; ForkJoinWorkerThread wt; ForkJoinPool.WorkQueue w; |
341 |
< |
if ((s = status) >= 0) { |
342 |
< |
if (((t = Thread.currentThread()) instanceof ForkJoinWorkerThread)) { |
343 |
< |
if (!(w = (wt = (ForkJoinWorkerThread)t).workQueue). |
344 |
< |
tryUnpush(this) || (s = doExec()) >= 0) |
345 |
< |
s = wt.pool.awaitJoin(w, this); |
346 |
< |
} |
347 |
< |
else |
348 |
< |
s = externalAwaitDone(); |
349 |
< |
} |
350 |
< |
return s; |
341 |
> |
return (s = status) < 0 ? s : |
342 |
> |
((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ? |
343 |
> |
(w = (wt = (ForkJoinWorkerThread)t).workQueue). |
344 |
> |
tryUnpush(this) && (s = doExec()) < 0 ? s : |
345 |
> |
wt.pool.awaitJoin(w, this) : |
346 |
> |
externalAwaitDone(); |
347 |
|
} |
348 |
|
|
349 |
|
/** |
353 |
|
*/ |
354 |
|
private int doInvoke() { |
355 |
|
int s; Thread t; ForkJoinWorkerThread wt; |
356 |
< |
if ((s = doExec()) >= 0) { |
357 |
< |
if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) |
358 |
< |
s = (wt = (ForkJoinWorkerThread)t).pool.awaitJoin(wt.workQueue, |
359 |
< |
this); |
364 |
< |
else |
365 |
< |
s = externalAwaitDone(); |
366 |
< |
} |
367 |
< |
return s; |
356 |
> |
return (s = doExec()) < 0 ? s : |
357 |
> |
((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ? |
358 |
> |
(wt = (ForkJoinWorkerThread)t).pool.awaitJoin(wt.workQueue, this) : |
359 |
> |
externalAwaitDone(); |
360 |
|
} |
361 |
|
|
362 |
|
// Exception table support |
404 |
|
} |
405 |
|
|
406 |
|
/** |
407 |
< |
* Records exception and sets exceptional completion. |
407 |
> |
* Records exception and sets status. |
408 |
|
* |
409 |
|
* @return status on exit |
410 |
|
*/ |
411 |
< |
private int setExceptionalCompletion(Throwable ex) { |
412 |
< |
int h = System.identityHashCode(this); |
413 |
< |
final ReentrantLock lock = exceptionTableLock; |
414 |
< |
lock.lock(); |
415 |
< |
try { |
416 |
< |
expungeStaleExceptions(); |
417 |
< |
ExceptionNode[] t = exceptionTable; |
418 |
< |
int i = h & (t.length - 1); |
419 |
< |
for (ExceptionNode e = t[i]; ; e = e.next) { |
420 |
< |
if (e == null) { |
421 |
< |
t[i] = new ExceptionNode(this, ex, t[i]); |
422 |
< |
break; |
411 |
> |
final int recordExceptionalCompletion(Throwable ex) { |
412 |
> |
int s; |
413 |
> |
if ((s = status) >= 0) { |
414 |
> |
int h = System.identityHashCode(this); |
415 |
> |
final ReentrantLock lock = exceptionTableLock; |
416 |
> |
lock.lock(); |
417 |
> |
try { |
418 |
> |
expungeStaleExceptions(); |
419 |
> |
ExceptionNode[] t = exceptionTable; |
420 |
> |
int i = h & (t.length - 1); |
421 |
> |
for (ExceptionNode e = t[i]; ; e = e.next) { |
422 |
> |
if (e == null) { |
423 |
> |
t[i] = new ExceptionNode(this, ex, t[i]); |
424 |
> |
break; |
425 |
> |
} |
426 |
> |
if (e.get() == this) // already present |
427 |
> |
break; |
428 |
|
} |
429 |
< |
if (e.get() == this) // already present |
430 |
< |
break; |
429 |
> |
} finally { |
430 |
> |
lock.unlock(); |
431 |
|
} |
432 |
< |
} finally { |
436 |
< |
lock.unlock(); |
432 |
> |
s = setCompletion(EXCEPTIONAL); |
433 |
|
} |
434 |
< |
return setCompletion(EXCEPTIONAL); |
434 |
> |
return s; |
435 |
> |
} |
436 |
> |
|
437 |
> |
/** |
438 |
> |
* Records exception and possibly propagates. |
439 |
> |
* |
440 |
> |
* @return status on exit |
441 |
> |
*/ |
442 |
> |
private int setExceptionalCompletion(Throwable ex) { |
443 |
> |
int s = recordExceptionalCompletion(ex); |
444 |
> |
if ((s & DONE_MASK) == EXCEPTIONAL) |
445 |
> |
internalPropagateException(ex); |
446 |
> |
return s; |
447 |
> |
} |
448 |
> |
|
449 |
> |
/** |
450 |
> |
* Hook for exception propagation support for tasks with completers. |
451 |
> |
*/ |
452 |
> |
void internalPropagateException(Throwable ex) { |
453 |
|
} |
454 |
|
|
455 |
|
/** |
531 |
|
Throwable ex; |
532 |
|
if (e == null || (ex = e.ex) == null) |
533 |
|
return null; |
534 |
< |
if (e.thrower != Thread.currentThread().getId()) { |
534 |
> |
if (false && e.thrower != Thread.currentThread().getId()) { |
535 |
|
Class<? extends Throwable> ec = ex.getClass(); |
536 |
|
try { |
537 |
|
Constructor<?> noArgCtor = null; |
598 |
|
} |
599 |
|
|
600 |
|
/** |
601 |
+ |
* A version of "sneaky throw" to relay exceptions |
602 |
+ |
*/ |
603 |
+ |
static void rethrow(final Throwable ex) { |
604 |
+ |
if (ex != null) { |
605 |
+ |
if (ex instanceof Error) |
606 |
+ |
throw (Error)ex; |
607 |
+ |
if (ex instanceof RuntimeException) |
608 |
+ |
throw (RuntimeException)ex; |
609 |
+ |
throw uncheckedThrowable(ex, RuntimeException.class); |
610 |
+ |
} |
611 |
+ |
} |
612 |
+ |
|
613 |
+ |
/** |
614 |
+ |
* The sneaky part of sneaky throw, relying on generics |
615 |
+ |
* limitations to evade compiler complaints about rethrowing |
616 |
+ |
* unchecked exceptions |
617 |
+ |
*/ |
618 |
+ |
@SuppressWarnings("unchecked") static <T extends Throwable> |
619 |
+ |
T uncheckedThrowable(final Throwable t, final Class<T> c) { |
620 |
+ |
return (T)t; // rely on vacuous cast |
621 |
+ |
} |
622 |
+ |
|
623 |
+ |
/** |
624 |
|
* Throws exception, if any, associated with the given status. |
625 |
|
*/ |
626 |
|
private void reportException(int s) { |
627 |
< |
Throwable ex = ((s == CANCELLED) ? new CancellationException() : |
628 |
< |
(s == EXCEPTIONAL) ? getThrowableException() : |
629 |
< |
null); |
630 |
< |
if (ex != null) |
594 |
< |
U.throwException(ex); |
627 |
> |
if (s == CANCELLED) |
628 |
> |
throw new CancellationException(); |
629 |
> |
if (s == EXCEPTIONAL) |
630 |
> |
rethrow(getThrowableException()); |
631 |
|
} |
632 |
|
|
633 |
|
// public methods |
634 |
|
|
635 |
|
/** |
636 |
< |
* Arranges to asynchronously execute this task. While it is not |
637 |
< |
* necessarily enforced, it is a usage error to fork a task more |
638 |
< |
* than once unless it has completed and been reinitialized. |
639 |
< |
* Subsequent modifications to the state of this task or any data |
640 |
< |
* it operates on are not necessarily consistently observable by |
641 |
< |
* any thread other than the one executing it unless preceded by a |
642 |
< |
* call to {@link #join} or related methods, or a call to {@link |
643 |
< |
* #isDone} returning {@code true}. |
644 |
< |
* |
645 |
< |
* <p>This method may be invoked only from within {@code |
646 |
< |
* ForkJoinPool} computations (as may be determined using method |
611 |
< |
* {@link #inForkJoinPool}). Attempts to invoke in other contexts |
612 |
< |
* result in exceptions or errors, possibly including {@code |
613 |
< |
* ClassCastException}. |
636 |
> |
* Arranges to asynchronously execute this task in the pool the |
637 |
> |
* current task is running in, if applicable, or using the {@link |
638 |
> |
* ForkJoinPool#commonPool()} if not {@link #inForkJoinPool}. While |
639 |
> |
* it is not necessarily enforced, it is a usage error to fork a |
640 |
> |
* task more than once unless it has completed and been |
641 |
> |
* reinitialized. Subsequent modifications to the state of this |
642 |
> |
* task or any data it operates on are not necessarily |
643 |
> |
* consistently observable by any thread other than the one |
644 |
> |
* executing it unless preceded by a call to {@link #join} or |
645 |
> |
* related methods, or a call to {@link #isDone} returning {@code |
646 |
> |
* true}. |
647 |
|
* |
648 |
|
* @return {@code this}, to simplify usage |
649 |
|
*/ |
650 |
|
public final ForkJoinTask<V> fork() { |
651 |
< |
((ForkJoinWorkerThread)Thread.currentThread()).workQueue.push(this); |
651 |
> |
Thread t; |
652 |
> |
if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) |
653 |
> |
((ForkJoinWorkerThread)t).workQueue.push(this); |
654 |
> |
else |
655 |
> |
ForkJoinPool.commonPool.externalPush(this); |
656 |
|
return this; |
657 |
|
} |
658 |
|
|
702 |
|
* cancelled, completed normally or exceptionally, or left |
703 |
|
* unprocessed. |
704 |
|
* |
668 |
– |
* <p>This method may be invoked only from within {@code |
669 |
– |
* ForkJoinPool} computations (as may be determined using method |
670 |
– |
* {@link #inForkJoinPool}). Attempts to invoke in other contexts |
671 |
– |
* result in exceptions or errors, possibly including {@code |
672 |
– |
* ClassCastException}. |
673 |
– |
* |
705 |
|
* @param t1 the first task |
706 |
|
* @param t2 the second task |
707 |
|
* @throws NullPointerException if any task is null |
727 |
|
* related methods to check if they have been cancelled, completed |
728 |
|
* normally or exceptionally, or left unprocessed. |
729 |
|
* |
699 |
– |
* <p>This method may be invoked only from within {@code |
700 |
– |
* ForkJoinPool} computations (as may be determined using method |
701 |
– |
* {@link #inForkJoinPool}). Attempts to invoke in other contexts |
702 |
– |
* result in exceptions or errors, possibly including {@code |
703 |
– |
* ClassCastException}. |
704 |
– |
* |
730 |
|
* @param tasks the tasks |
731 |
|
* @throws NullPointerException if any task is null |
732 |
|
*/ |
754 |
|
} |
755 |
|
} |
756 |
|
if (ex != null) |
757 |
< |
U.throwException(ex); |
757 |
> |
rethrow(ex); |
758 |
|
} |
759 |
|
|
760 |
|
/** |
770 |
|
* cancelled, completed normally or exceptionally, or left |
771 |
|
* unprocessed. |
772 |
|
* |
748 |
– |
* <p>This method may be invoked only from within {@code |
749 |
– |
* ForkJoinPool} computations (as may be determined using method |
750 |
– |
* {@link #inForkJoinPool}). Attempts to invoke in other contexts |
751 |
– |
* result in exceptions or errors, possibly including {@code |
752 |
– |
* ClassCastException}. |
753 |
– |
* |
773 |
|
* @param tasks the collection of tasks |
774 |
|
* @return the tasks argument, to simplify usage |
775 |
|
* @throws NullPointerException if tasks or any element are null |
805 |
|
} |
806 |
|
} |
807 |
|
if (ex != null) |
808 |
< |
U.throwException(ex); |
808 |
> |
rethrow(ex); |
809 |
|
return tasks; |
810 |
|
} |
811 |
|
|
926 |
|
} |
927 |
|
|
928 |
|
/** |
929 |
+ |
* Completes this task normally without setting a value. The most |
930 |
+ |
* recent value established by {@link #setRawResult} (or {@code |
931 |
+ |
* null} by default) will be returned as the result of subsequent |
932 |
+ |
* invocations of {@code join} and related operations. |
933 |
+ |
* |
934 |
+ |
* @since 1.8 |
935 |
+ |
*/ |
936 |
+ |
public final void quietlyComplete() { |
937 |
+ |
setCompletion(NORMAL); |
938 |
+ |
} |
939 |
+ |
|
940 |
+ |
/** |
941 |
|
* Waits if necessary for the computation to complete, and then |
942 |
|
* retrieves its result. |
943 |
|
* |
978 |
|
if (Thread.interrupted()) |
979 |
|
throw new InterruptedException(); |
980 |
|
// Messy in part because we measure in nanosecs, but wait in millisecs |
981 |
< |
int s; long ns, ms; |
982 |
< |
if ((s = status) >= 0 && (ns = unit.toNanos(timeout)) > 0L) { |
981 |
> |
int s; long ms; |
982 |
> |
long ns = unit.toNanos(timeout); |
983 |
> |
if ((s = status) >= 0 && ns > 0L) { |
984 |
|
long deadline = System.nanoTime() + ns; |
985 |
|
ForkJoinPool p = null; |
986 |
|
ForkJoinPool.WorkQueue w = null; |
989 |
|
ForkJoinWorkerThread wt = (ForkJoinWorkerThread)t; |
990 |
|
p = wt.pool; |
991 |
|
w = wt.workQueue; |
992 |
< |
s = p.helpJoinOnce(w, this); // no retries on failure |
992 |
> |
p.helpJoinOnce(w, this); // no retries on failure |
993 |
|
} |
994 |
+ |
else |
995 |
+ |
ForkJoinPool.externalHelpJoin(this); |
996 |
|
boolean canBlock = false; |
997 |
|
boolean interrupted = false; |
998 |
|
try { |
999 |
|
while ((s = status) >= 0) { |
1000 |
< |
if (w != null && w.runState < 0) |
1000 |
> |
if (w != null && w.qlock < 0) |
1001 |
|
cancelIgnoringExceptions(this); |
1002 |
|
else if (!canBlock) { |
1003 |
< |
if (p == null || p.tryCompensate(this, null)) |
1003 |
> |
if (p == null || p.tryCompensate()) |
1004 |
|
canBlock = true; |
1005 |
|
} |
1006 |
|
else { |
1068 |
|
* be of use in designs in which many tasks are forked, but none |
1069 |
|
* are explicitly joined, instead executing them until all are |
1070 |
|
* processed. |
1037 |
– |
* |
1038 |
– |
* <p>This method may be invoked only from within {@code |
1039 |
– |
* ForkJoinPool} computations (as may be determined using method |
1040 |
– |
* {@link #inForkJoinPool}). Attempts to invoke in other contexts |
1041 |
– |
* result in exceptions or errors, possibly including {@code |
1042 |
– |
* ClassCastException}. |
1071 |
|
*/ |
1072 |
|
public static void helpQuiesce() { |
1073 |
< |
ForkJoinWorkerThread wt = |
1074 |
< |
(ForkJoinWorkerThread)Thread.currentThread(); |
1075 |
< |
wt.pool.helpQuiescePool(wt.workQueue); |
1073 |
> |
Thread t; |
1074 |
> |
if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) { |
1075 |
> |
ForkJoinWorkerThread wt = (ForkJoinWorkerThread)t; |
1076 |
> |
wt.pool.helpQuiescePool(wt.workQueue); |
1077 |
> |
} |
1078 |
> |
else |
1079 |
> |
ForkJoinPool.externalHelpQuiescePool(); |
1080 |
|
} |
1081 |
|
|
1082 |
|
/** |
1129 |
|
|
1130 |
|
/** |
1131 |
|
* Tries to unschedule this task for execution. This method will |
1132 |
< |
* typically succeed if this task is the most recently forked task |
1133 |
< |
* by the current thread, and has not commenced executing in |
1134 |
< |
* another thread. This method may be useful when arranging |
1135 |
< |
* alternative local processing of tasks that could have been, but |
1136 |
< |
* were not, stolen. |
1105 |
< |
* |
1106 |
< |
* <p>This method may be invoked only from within {@code |
1107 |
< |
* ForkJoinPool} computations (as may be determined using method |
1108 |
< |
* {@link #inForkJoinPool}). Attempts to invoke in other contexts |
1109 |
< |
* result in exceptions or errors, possibly including {@code |
1110 |
< |
* ClassCastException}. |
1132 |
> |
* typically (but is not guaranteed to) succeed if this task is |
1133 |
> |
* the most recently forked task by the current thread, and has |
1134 |
> |
* not commenced executing in another thread. This method may be |
1135 |
> |
* useful when arranging alternative local processing of tasks |
1136 |
> |
* that could have been, but were not, stolen. |
1137 |
|
* |
1138 |
|
* @return {@code true} if unforked |
1139 |
|
*/ |
1140 |
|
public boolean tryUnfork() { |
1141 |
< |
return ((ForkJoinWorkerThread)Thread.currentThread()) |
1142 |
< |
.workQueue.tryUnpush(this); |
1141 |
> |
Thread t; |
1142 |
> |
return (((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ? |
1143 |
> |
((ForkJoinWorkerThread)t).workQueue.tryUnpush(this) : |
1144 |
> |
ForkJoinPool.tryExternalUnpush(this)); |
1145 |
|
} |
1146 |
|
|
1147 |
|
/** |
1150 |
|
* value may be useful for heuristic decisions about whether to |
1151 |
|
* fork other tasks. |
1152 |
|
* |
1125 |
– |
* <p>This method may be invoked only from within {@code |
1126 |
– |
* ForkJoinPool} computations (as may be determined using method |
1127 |
– |
* {@link #inForkJoinPool}). Attempts to invoke in other contexts |
1128 |
– |
* result in exceptions or errors, possibly including {@code |
1129 |
– |
* ClassCastException}. |
1130 |
– |
* |
1153 |
|
* @return the number of tasks |
1154 |
|
*/ |
1155 |
|
public static int getQueuedTaskCount() { |
1156 |
< |
return ((ForkJoinWorkerThread) Thread.currentThread()) |
1157 |
< |
.workQueue.queueSize(); |
1156 |
> |
Thread t; ForkJoinPool.WorkQueue q; |
1157 |
> |
if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) |
1158 |
> |
q = ((ForkJoinWorkerThread)t).workQueue; |
1159 |
> |
else |
1160 |
> |
q = ForkJoinPool.commonSubmitterQueue(); |
1161 |
> |
return (q == null) ? 0 : q.queueSize(); |
1162 |
|
} |
1163 |
|
|
1164 |
|
/** |
1165 |
|
* Returns an estimate of how many more locally queued tasks are |
1166 |
|
* held by the current worker thread than there are other worker |
1167 |
< |
* threads that might steal them. This value may be useful for |
1167 |
> |
* threads that might steal them, or zero if this thread is not |
1168 |
> |
* operating in a ForkJoinPool. This value may be useful for |
1169 |
|
* heuristic decisions about whether to fork other tasks. In many |
1170 |
|
* usages of ForkJoinTasks, at steady state, each worker should |
1171 |
|
* aim to maintain a small constant surplus (for example, 3) of |
1172 |
|
* tasks, and to process computations locally if this threshold is |
1173 |
|
* exceeded. |
1174 |
|
* |
1148 |
– |
* <p>This method may be invoked only from within {@code |
1149 |
– |
* ForkJoinPool} computations (as may be determined using method |
1150 |
– |
* {@link #inForkJoinPool}). Attempts to invoke in other contexts |
1151 |
– |
* result in exceptions or errors, possibly including {@code |
1152 |
– |
* ClassCastException}. |
1153 |
– |
* |
1175 |
|
* @return the surplus number of tasks, which may be negative |
1176 |
|
*/ |
1177 |
|
public static int getSurplusQueuedTaskCount() { |
1178 |
< |
/* |
1158 |
< |
* The aim of this method is to return a cheap heuristic guide |
1159 |
< |
* for task partitioning when programmers, frameworks, tools, |
1160 |
< |
* or languages have little or no idea about task granularity. |
1161 |
< |
* In essence by offering this method, we ask users only about |
1162 |
< |
* tradeoffs in overhead vs expected throughput and its |
1163 |
< |
* variance, rather than how finely to partition tasks. |
1164 |
< |
* |
1165 |
< |
* In a steady state strict (tree-structured) computation, |
1166 |
< |
* each thread makes available for stealing enough tasks for |
1167 |
< |
* other threads to remain active. Inductively, if all threads |
1168 |
< |
* play by the same rules, each thread should make available |
1169 |
< |
* only a constant number of tasks. |
1170 |
< |
* |
1171 |
< |
* The minimum useful constant is just 1. But using a value of |
1172 |
< |
* 1 would require immediate replenishment upon each steal to |
1173 |
< |
* maintain enough tasks, which is infeasible. Further, |
1174 |
< |
* partitionings/granularities of offered tasks should |
1175 |
< |
* minimize steal rates, which in general means that threads |
1176 |
< |
* nearer the top of computation tree should generate more |
1177 |
< |
* than those nearer the bottom. In perfect steady state, each |
1178 |
< |
* thread is at approximately the same level of computation |
1179 |
< |
* tree. However, producing extra tasks amortizes the |
1180 |
< |
* uncertainty of progress and diffusion assumptions. |
1181 |
< |
* |
1182 |
< |
* So, users will want to use values larger, but not much |
1183 |
< |
* larger than 1 to both smooth over transient shortages and |
1184 |
< |
* hedge against uneven progress; as traded off against the |
1185 |
< |
* cost of extra task overhead. We leave the user to pick a |
1186 |
< |
* threshold value to compare with the results of this call to |
1187 |
< |
* guide decisions, but recommend values such as 3. |
1188 |
< |
* |
1189 |
< |
* When all threads are active, it is on average OK to |
1190 |
< |
* estimate surplus strictly locally. In steady-state, if one |
1191 |
< |
* thread is maintaining say 2 surplus tasks, then so are |
1192 |
< |
* others. So we can just use estimated queue length. |
1193 |
< |
* However, this strategy alone leads to serious mis-estimates |
1194 |
< |
* in some non-steady-state conditions (ramp-up, ramp-down, |
1195 |
< |
* other stalls). We can detect many of these by further |
1196 |
< |
* considering the number of "idle" threads, that are known to |
1197 |
< |
* have zero queued tasks, so compensate by a factor of |
1198 |
< |
* (#idle/#active) threads. |
1199 |
< |
*/ |
1200 |
< |
ForkJoinWorkerThread wt = |
1201 |
< |
(ForkJoinWorkerThread)Thread.currentThread(); |
1202 |
< |
return wt.workQueue.queueSize() - wt.pool.idlePerActive(); |
1178 |
> |
return ForkJoinPool.getSurplusQueuedTaskCount(); |
1179 |
|
} |
1180 |
|
|
1181 |
|
// Extension methods |
1201 |
|
protected abstract void setRawResult(V value); |
1202 |
|
|
1203 |
|
/** |
1204 |
< |
* Immediately performs the base action of this task. This method |
1205 |
< |
* is designed to support extensions, and should not in general be |
1206 |
< |
* called otherwise. The return value controls whether this task |
1207 |
< |
* is considered to be done normally. It may return false in |
1204 |
> |
* Immediately performs the base action of this task and returns |
1205 |
> |
* true if, upon return from this method, this task is guaranteed |
1206 |
> |
* to have completed normally. This method may return false |
1207 |
> |
* otherwise, to indicate that this task is not necessarily |
1208 |
> |
* complete (or is not known to be complete), for example in |
1209 |
|
* asynchronous actions that require explicit invocations of |
1210 |
< |
* {@link #complete} to become joinable. It may also throw an |
1211 |
< |
* (unchecked) exception to indicate abnormal exit. |
1210 |
> |
* completion methods. This method may also throw an (unchecked) |
1211 |
> |
* exception to indicate abnormal exit. This method is designed to |
1212 |
> |
* support extensions, and should not in general be called |
1213 |
> |
* otherwise. |
1214 |
|
* |
1215 |
< |
* @return {@code true} if completed normally |
1215 |
> |
* @return {@code true} if this task is known to have completed normally |
1216 |
|
*/ |
1217 |
|
protected abstract boolean exec(); |
1218 |
|
|
1226 |
|
* primarily to support extensions, and is unlikely to be useful |
1227 |
|
* otherwise. |
1228 |
|
* |
1250 |
– |
* <p>This method may be invoked only from within {@code |
1251 |
– |
* ForkJoinPool} computations (as may be determined using method |
1252 |
– |
* {@link #inForkJoinPool}). Attempts to invoke in other contexts |
1253 |
– |
* result in exceptions or errors, possibly including {@code |
1254 |
– |
* ClassCastException}. |
1255 |
– |
* |
1229 |
|
* @return the next task, or {@code null} if none are available |
1230 |
|
*/ |
1231 |
|
protected static ForkJoinTask<?> peekNextLocalTask() { |
1232 |
< |
return ((ForkJoinWorkerThread) Thread.currentThread()).workQueue.peek(); |
1232 |
> |
Thread t; ForkJoinPool.WorkQueue q; |
1233 |
> |
if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) |
1234 |
> |
q = ((ForkJoinWorkerThread)t).workQueue; |
1235 |
> |
else |
1236 |
> |
q = ForkJoinPool.commonSubmitterQueue(); |
1237 |
> |
return (q == null) ? null : q.peek(); |
1238 |
|
} |
1239 |
|
|
1240 |
|
/** |
1241 |
|
* Unschedules and returns, without executing, the next task |
1242 |
< |
* queued by the current thread but not yet executed. This method |
1243 |
< |
* is designed primarily to support extensions, and is unlikely to |
1244 |
< |
* be useful otherwise. |
1245 |
< |
* |
1268 |
< |
* <p>This method may be invoked only from within {@code |
1269 |
< |
* ForkJoinPool} computations (as may be determined using method |
1270 |
< |
* {@link #inForkJoinPool}). Attempts to invoke in other contexts |
1271 |
< |
* result in exceptions or errors, possibly including {@code |
1272 |
< |
* ClassCastException}. |
1242 |
> |
* queued by the current thread but not yet executed, if the |
1243 |
> |
* current thread is operating in a ForkJoinPool. This method is |
1244 |
> |
* designed primarily to support extensions, and is unlikely to be |
1245 |
> |
* useful otherwise. |
1246 |
|
* |
1247 |
|
* @return the next task, or {@code null} if none are available |
1248 |
|
*/ |
1249 |
|
protected static ForkJoinTask<?> pollNextLocalTask() { |
1250 |
< |
return ((ForkJoinWorkerThread) Thread.currentThread()) |
1251 |
< |
.workQueue.nextLocalTask(); |
1250 |
> |
Thread t; |
1251 |
> |
return ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ? |
1252 |
> |
((ForkJoinWorkerThread)t).workQueue.nextLocalTask() : |
1253 |
> |
null; |
1254 |
|
} |
1255 |
|
|
1256 |
|
/** |
1257 |
< |
* Unschedules and returns, without executing, the next task |
1257 |
> |
* If the current thread is operating in a ForkJoinPool, |
1258 |
> |
* unschedules and returns, without executing, the next task |
1259 |
|
* queued by the current thread but not yet executed, if one is |
1260 |
|
* available, or if not available, a task that was forked by some |
1261 |
|
* other thread, if available. Availability may be transient, so a |
1262 |
< |
* {@code null} result does not necessarily imply quiescence |
1263 |
< |
* of the pool this task is operating in. This method is designed |
1262 |
> |
* {@code null} result does not necessarily imply quiescence of |
1263 |
> |
* the pool this task is operating in. This method is designed |
1264 |
|
* primarily to support extensions, and is unlikely to be useful |
1265 |
|
* otherwise. |
1266 |
|
* |
1291 |
– |
* <p>This method may be invoked only from within {@code |
1292 |
– |
* ForkJoinPool} computations (as may be determined using method |
1293 |
– |
* {@link #inForkJoinPool}). Attempts to invoke in other contexts |
1294 |
– |
* result in exceptions or errors, possibly including {@code |
1295 |
– |
* ClassCastException}. |
1296 |
– |
* |
1267 |
|
* @return a task, or {@code null} if none are available |
1268 |
|
*/ |
1269 |
|
protected static ForkJoinTask<?> pollTask() { |
1270 |
< |
ForkJoinWorkerThread wt = |
1271 |
< |
(ForkJoinWorkerThread)Thread.currentThread(); |
1272 |
< |
return wt.pool.nextTaskFor(wt.workQueue); |
1270 |
> |
Thread t; ForkJoinWorkerThread wt; |
1271 |
> |
return ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ? |
1272 |
> |
(wt = (ForkJoinWorkerThread)t).pool.nextTaskFor(wt.workQueue) : |
1273 |
> |
null; |
1274 |
|
} |
1275 |
|
|
1276 |
< |
// Mark-bit operations |
1276 |
> |
// tag operations |
1277 |
|
|
1278 |
|
/** |
1279 |
< |
* Returns true if this task is marked. |
1279 |
> |
* Returns the tag for this task. |
1280 |
|
* |
1281 |
< |
* @return true if this task is marked |
1281 |
> |
* @return the tag for this task |
1282 |
|
* @since 1.8 |
1283 |
|
*/ |
1284 |
< |
public final boolean isMarkedForkJoinTask() { |
1285 |
< |
return (status & MARKED) != 0; |
1284 |
> |
public final short getForkJoinTaskTag() { |
1285 |
> |
return (short)status; |
1286 |
|
} |
1287 |
|
|
1288 |
|
/** |
1289 |
< |
* Atomically sets the mark on this task. |
1289 |
> |
* Atomically sets the tag value for this task. |
1290 |
|
* |
1291 |
< |
* @return true if this task was previously unmarked |
1291 |
> |
* @param tag the tag value |
1292 |
> |
* @return the previous value of the tag |
1293 |
|
* @since 1.8 |
1294 |
|
*/ |
1295 |
< |
public final boolean markForkJoinTask() { |
1295 |
> |
public final short setForkJoinTaskTag(short tag) { |
1296 |
|
for (int s;;) { |
1297 |
< |
if (((s = status) & MARKED) != 0) |
1298 |
< |
return false; |
1299 |
< |
if (U.compareAndSwapInt(this, STATUS, s, s | MARKED)) |
1328 |
< |
return true; |
1297 |
> |
if (U.compareAndSwapInt(this, STATUS, s = status, |
1298 |
> |
(s & ~SMASK) | (tag & SMASK))) |
1299 |
> |
return (short)s; |
1300 |
|
} |
1301 |
|
} |
1302 |
|
|
1303 |
|
/** |
1304 |
< |
* Atomically clears the mark on this task. |
1304 |
> |
* Atomically conditionally sets the tag value for this task. |
1305 |
> |
* Among other applications, tags can be used as visit markers |
1306 |
> |
* in tasks operating on graphs, as in methods that check: {@code |
1307 |
> |
* if (task.compareAndSetForkJoinTaskTag((short)0, (short)1))} |
1308 |
> |
* before processing, otherwise exiting because the node has |
1309 |
> |
* already been visited. |
1310 |
|
* |
1311 |
< |
* @return true if this task was previously marked |
1311 |
> |
* @param e the expected tag value |
1312 |
> |
* @param tag the new tag value |
1313 |
> |
* @return true if successful; i.e., the current value was |
1314 |
> |
* equal to e and is now tag. |
1315 |
|
* @since 1.8 |
1316 |
|
*/ |
1317 |
< |
public final boolean unmarkForkJoinTask() { |
1317 |
> |
public final boolean compareAndSetForkJoinTaskTag(short e, short tag) { |
1318 |
|
for (int s;;) { |
1319 |
< |
if (((s = status) & MARKED) == 0) |
1319 |
> |
if ((short)(s = status) != e) |
1320 |
|
return false; |
1321 |
< |
if (U.compareAndSwapInt(this, STATUS, s, s & ~MARKED)) |
1321 |
> |
if (U.compareAndSwapInt(this, STATUS, s, |
1322 |
> |
(s & ~SMASK) | (tag & SMASK))) |
1323 |
|
return true; |
1324 |
|
} |
1325 |
|
} |
1459 |
|
// Unsafe mechanics |
1460 |
|
private static final sun.misc.Unsafe U; |
1461 |
|
private static final long STATUS; |
1462 |
+ |
|
1463 |
|
static { |
1464 |
|
exceptionTableLock = new ReentrantLock(); |
1465 |
|
exceptionTableRefQueue = new ReferenceQueue<Object>(); |
1466 |
|
exceptionTable = new ExceptionNode[EXCEPTION_MAP_CAPACITY]; |
1467 |
|
try { |
1468 |
|
U = getUnsafe(); |
1469 |
+ |
Class<?> k = ForkJoinTask.class; |
1470 |
|
STATUS = U.objectFieldOffset |
1471 |
< |
(ForkJoinTask.class.getDeclaredField("status")); |
1471 |
> |
(k.getDeclaredField("status")); |
1472 |
|
} catch (Exception e) { |
1473 |
|
throw new Error(e); |
1474 |
|
} |