ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/jsr166e/ForkJoinTask.java
Revision: 1.14
Committed: Sun Jul 21 06:32:28 2013 UTC (10 years, 9 months ago) by jsr166
Branch: MAIN
Changes since 1.13: +4 -1 lines
Log Message:
sync javadoc fixes from src/main

File Contents

# User Rev Content
1 dl 1.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/publicdomain/zero/1.0/
5     */
6    
7     package jsr166e;
8    
9     import java.io.Serializable;
10     import java.util.Collection;
11     import java.util.List;
12     import java.util.RandomAccess;
13     import java.lang.ref.WeakReference;
14     import java.lang.ref.ReferenceQueue;
15     import java.util.concurrent.Callable;
16     import java.util.concurrent.CancellationException;
17     import java.util.concurrent.ExecutionException;
18     import java.util.concurrent.Future;
19     import java.util.concurrent.RejectedExecutionException;
20     import java.util.concurrent.RunnableFuture;
21     import java.util.concurrent.TimeUnit;
22     import java.util.concurrent.TimeoutException;
23     import java.util.concurrent.locks.ReentrantLock;
24     import java.lang.reflect.Constructor;
25    
26     /**
27     * Abstract base class for tasks that run within a {@link ForkJoinPool}.
28     * A {@code ForkJoinTask} is a thread-like entity that is much
29     * lighter weight than a normal thread. Huge numbers of tasks and
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 dl 1.2 * <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 dl 1.5 * ForkJoinPool#commonPool()} via {@link #fork}, {@link #invoke}, or
37 dl 1.2 * 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 dl 1.1 * #invokeAll(ForkJoinTask...) invokeAll}. However, this class also
42     * provides a number of other methods that can come into play in
43 dl 1.2 * advanced usages, as well as extension mechanics that allow support
44     * of new forms of fork/join processing.
45 dl 1.1 *
46     * <p>A {@code ForkJoinTask} is a lightweight form of {@link Future}.
47     * The efficiency of {@code ForkJoinTask}s stems from a set of
48     * restrictions (that are only partially statically enforceable)
49     * reflecting their main use as computational tasks calculating pure
50     * functions or operating on purely isolated objects. The primary
51     * coordination mechanisms are {@link #fork}, that arranges
52     * asynchronous execution, and {@link #join}, that doesn't proceed
53     * until the task's result has been computed. Computations should
54     * ideally avoid {@code synchronized} methods or blocks, and should
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 jsr166 1.6 * not perform blocking I/O, and should ideally access variables that
59 dl 1.1 * 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
62     * thrown. However, computations may still encounter unchecked
63     * exceptions, that are rethrown to callers attempting to join
64     * them. These exceptions may additionally include {@link
65     * RejectedExecutionException} stemming from internal resource
66     * exhaustion, such as failure to allocate internal task
67     * queues. Rethrown exceptions behave in the same way as regular
68     * exceptions, but, when possible, contain stack traces (as displayed
69     * for example using {@code ex.printStackTrace()}) of both the thread
70     * that initiated the computation as well as the thread actually
71     * encountering the exception; minimally only the latter.
72     *
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 jsr166 1.6 * that blocks on external synchronization or I/O. Event-style async
77 dl 1.1 * 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
84     * enough threads will be available to ensure progress or good
85     * performance.
86     *
87     * <p>The primary method for awaiting completion and extracting
88     * results of a task is {@link #join}, but there are several variants:
89     * The {@link Future#get} methods support interruptible and/or timed
90     * waits for completion and report results using {@code Future}
91     * conventions. Method {@link #invoke} is semantically
92     * equivalent to {@code fork(); join()} but always attempts to begin
93     * execution in the current thread. The "<em>quiet</em>" forms of
94     * these methods do not extract results or report exceptions. These
95     * may be useful when a set of tasks are being executed, and you need
96     * to delay processing of results or exceptions until all complete.
97     * Method {@code invokeAll} (available in multiple versions)
98     * performs the most common form of parallel invocation: forking a set
99     * of tasks and joining them all.
100     *
101     * <p>In the most typical usages, a fork-join pair act like a call
102     * (fork) and return (join) from a parallel recursive function. As is
103     * the case with other forms of recursive calls, returns (joins)
104     * should be performed innermost-first. For example, {@code a.fork();
105     * b.fork(); b.join(); a.join();} is likely to be substantially more
106     * efficient than joining {@code a} before {@code b}.
107     *
108     * <p>The execution status of tasks may be queried at several levels
109     * of detail: {@link #isDone} is true if a task completed in any way
110     * (including the case where a task was cancelled without executing);
111     * {@link #isCompletedNormally} is true if a task completed without
112     * cancellation or encountering an exception; {@link #isCancelled} is
113     * true if the task was cancelled (in which case {@link #getException}
114     * returns a {@link java.util.concurrent.CancellationException}); and
115     * {@link #isCompletedAbnormally} is true if a task was either
116     * cancelled or encountered an exception, in which case {@link
117     * #getException} will return either the encountered exception or
118     * {@link java.util.concurrent.CancellationException}.
119     *
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 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 dl 1.2 * methods supplied by this base class.
130 dl 1.1 *
131     * <p>Method {@link #join} and its variants are appropriate for use
132     * only when completion dependencies are acyclic; that is, the
133     * parallel computation can be described as a directed acyclic graph
134     * (DAG). Otherwise, executions may encounter a form of deadlock as
135     * tasks cyclically wait for each other. However, this framework
136     * supports other methods and techniques (for example the use of
137 jsr166 1.14 * {@link java.util.concurrent.Phaser Phaser}, {@link #helpQuiesce}, and {@link #complete}) that
138 dl 1.1 * may be of use in constructing custom subclasses for problems that
139 dl 1.13 * are not statically structured as DAGs. To support such usages, a
140 dl 1.1 * 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
153     * underlying lightweight task scheduling framework. Developers
154     * creating new basic styles of fork/join processing should minimally
155     * implement {@code protected} methods {@link #exec}, {@link
156     * #setRawResult}, and {@link #getRawResult}, while also introducing
157     * an abstract computational method that can be implemented in its
158     * subclasses, possibly relying on other {@code protected} methods
159     * provided by this class.
160     *
161     * <p>ForkJoinTasks should perform relatively small amounts of
162     * computation. Large tasks should be split into smaller subtasks,
163     * usually via recursive decomposition. As a very rough rule of thumb,
164     * a task should perform more than 100 and less than 10000 basic
165     * computational steps, and should avoid indefinite looping. If tasks
166     * are too big, then parallelism cannot improve throughput. If too
167     * small, then memory and internal task maintenance overhead may
168     * overwhelm processing.
169     *
170     * <p>This class provides {@code adapt} methods for {@link Runnable}
171     * and {@link Callable}, that may be of use when mixing execution of
172     * {@code ForkJoinTasks} with other kinds of tasks. When all tasks are
173     * of this form, consider using a pool constructed in <em>asyncMode</em>.
174     *
175     * <p>ForkJoinTasks are {@code Serializable}, which enables them to be
176     * used in extensions such as remote execution frameworks. It is
177     * sensible to serialize tasks only before or after, but not during,
178     * execution. Serialization is not relied on during execution itself.
179     *
180     * @since 1.7
181     * @author Doug Lea
182     */
183     public abstract class ForkJoinTask<V> implements Future<V>, Serializable {
184    
185     /*
186     * See the internal documentation of class ForkJoinPool for a
187     * general implementation overview. ForkJoinTasks are mainly
188     * responsible for maintaining their "status" field amidst relays
189     * to methods in ForkJoinWorkerThread and ForkJoinPool.
190     *
191     * The methods of this class are more-or-less layered into
192     * (1) basic status maintenance
193     * (2) execution and awaiting completion
194     * (3) user-level methods that additionally report results.
195     * This is sometimes hard to see because this file orders exported
196     * methods in a way that flows well in javadocs.
197     */
198    
199     /*
200     * The status field holds run control status bits packed into a
201     * single int to minimize footprint and to ensure atomicity (via
202     * CAS). Status is initially zero, and takes on nonnegative
203     * values until completed, upon which status (anded with
204     * DONE_MASK) holds value NORMAL, CANCELLED, or EXCEPTIONAL. Tasks
205     * undergoing blocking waits by other threads have the SIGNAL bit
206     * set. Completion of a stolen task with SIGNAL set awakens any
207     * waiters via notifyAll. Even though suboptimal for some
208     * purposes, we use basic builtin wait/notify to take advantage of
209     * "monitor inflation" in JVMs that we would otherwise need to
210     * emulate to avoid adding further per-task bookkeeping overhead.
211     * We want these monitors to be "fat", i.e., not use biasing or
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 */
222     volatile int status; // accessed directly by pool and workers
223     static final int DONE_MASK = 0xf0000000; // mask out non-completion bits
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 = 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.
233     *
234     * @param completion one of NORMAL, CANCELLED, EXCEPTIONAL
235     * @return completion status on exit
236     */
237     private int setCompletion(int completion) {
238     for (int s;;) {
239     if ((s = status) < 0)
240     return s;
241     if (U.compareAndSwapInt(this, STATUS, s, s | completion)) {
242     if ((s >>> 16) != 0)
243     synchronized (this) { notifyAll(); }
244     return completion;
245     }
246     }
247     }
248    
249     /**
250     * Primary execution method for stolen tasks. Unless done, calls
251     * exec and records status if completed, but doesn't wait for
252     * completion otherwise.
253     *
254     * @return status on exit from this method
255     */
256     final int doExec() {
257     int s; boolean completed;
258     if ((s = status) >= 0) {
259     try {
260     completed = exec();
261     } catch (Throwable rex) {
262     return setExceptionalCompletion(rex);
263     }
264     if (completed)
265     s = setCompletion(NORMAL);
266     }
267     return s;
268     }
269    
270     /**
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 = status;
279     return s >= 0 && U.compareAndSwapInt(this, STATUS, s, s | SIGNAL);
280     }
281    
282     /**
283     * Blocks a non-worker-thread until completion.
284     * @return status upon completion
285     */
286     private int externalAwaitDone() {
287 dl 1.2 int s;
288 dl 1.13 ForkJoinPool cp = ForkJoinPool.common;
289     if ((s = status) >= 0) {
290     if (cp != null) {
291     if (this instanceof CountedCompleter)
292     s = cp.externalHelpComplete((CountedCompleter<?>)this);
293     else if (cp.tryExternalUnpush(this))
294     s = doExec();
295     }
296     if (s >= 0 && (s = status) >= 0) {
297     boolean interrupted = false;
298     do {
299     if (U.compareAndSwapInt(this, STATUS, s, s | SIGNAL)) {
300     synchronized (this) {
301     if (status >= 0) {
302     try {
303     wait();
304     } catch (InterruptedException ie) {
305     interrupted = true;
306     }
307     }
308     else
309     notifyAll();
310 dl 1.1 }
311     }
312 dl 1.13 } while ((s = status) >= 0);
313     if (interrupted)
314     Thread.currentThread().interrupt();
315 dl 1.1 }
316     }
317     return s;
318     }
319    
320     /**
321     * Blocks a non-worker-thread until completion or interruption.
322     */
323     private int externalInterruptibleAwaitDone() throws InterruptedException {
324 dl 1.4 int s;
325 dl 1.13 ForkJoinPool cp = ForkJoinPool.common;
326 dl 1.1 if (Thread.interrupted())
327     throw new InterruptedException();
328 dl 1.13 if ((s = status) >= 0 && cp != null) {
329     if (this instanceof CountedCompleter)
330     cp.externalHelpComplete((CountedCompleter<?>)this);
331     else if (cp.tryExternalUnpush(this))
332     doExec();
333     }
334 dl 1.4 while ((s = status) >= 0) {
335 dl 1.1 if (U.compareAndSwapInt(this, STATUS, s, s | SIGNAL)) {
336     synchronized (this) {
337     if (status >= 0)
338     wait();
339     else
340     notifyAll();
341     }
342     }
343     }
344     return s;
345     }
346    
347 dl 1.4
348 dl 1.1 /**
349     * Implementation for join, get, quietlyJoin. Directly handles
350     * only cases of already-completed, external wait, and
351     * unfork+exec. Others are relayed to ForkJoinPool.awaitJoin.
352     *
353     * @return status upon completion
354     */
355     private int doJoin() {
356     int s; Thread t; ForkJoinWorkerThread wt; ForkJoinPool.WorkQueue w;
357 dl 1.2 return (s = status) < 0 ? s :
358     ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ?
359     (w = (wt = (ForkJoinWorkerThread)t).workQueue).
360     tryUnpush(this) && (s = doExec()) < 0 ? s :
361     wt.pool.awaitJoin(w, this) :
362     externalAwaitDone();
363 dl 1.1 }
364    
365     /**
366     * Implementation for invoke, quietlyInvoke.
367     *
368     * @return status upon completion
369     */
370     private int doInvoke() {
371     int s; Thread t; ForkJoinWorkerThread wt;
372 dl 1.2 return (s = doExec()) < 0 ? s :
373     ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ?
374     (wt = (ForkJoinWorkerThread)t).pool.awaitJoin(wt.workQueue, this) :
375     externalAwaitDone();
376 dl 1.1 }
377    
378     // Exception table support
379    
380     /**
381     * Table of exceptions thrown by tasks, to enable reporting by
382     * callers. Because exceptions are rare, we don't directly keep
383     * them with task objects, but instead use a weak ref table. Note
384     * that cancellation exceptions don't appear in the table, but are
385     * instead recorded as status values.
386     *
387     * Note: These statics are initialized below in static block.
388     */
389     private static final ExceptionNode[] exceptionTable;
390     private static final ReentrantLock exceptionTableLock;
391     private static final ReferenceQueue<Object> exceptionTableRefQueue;
392    
393     /**
394     * Fixed capacity for exceptionTable.
395     */
396     private static final int EXCEPTION_MAP_CAPACITY = 32;
397    
398     /**
399     * Key-value nodes for exception table. The chained hash table
400     * uses identity comparisons, full locking, and weak references
401     * for keys. The table has a fixed capacity because it only
402     * maintains task exceptions long enough for joiners to access
403     * them, so should never become very large for sustained
404     * periods. However, since we do not know when the last joiner
405     * completes, we must use weak references and expunge them. We do
406     * so on each operation (hence full locking). Also, some thread in
407     * any ForkJoinPool will call helpExpungeStaleExceptions when its
408     * pool becomes isQuiescent.
409     */
410     static final class ExceptionNode extends WeakReference<ForkJoinTask<?>> {
411     final Throwable ex;
412     ExceptionNode next;
413     final long thrower; // use id not ref to avoid weak cycles
414     ExceptionNode(ForkJoinTask<?> task, Throwable ex, ExceptionNode next) {
415     super(task, exceptionTableRefQueue);
416     this.ex = ex;
417     this.next = next;
418     this.thrower = Thread.currentThread().getId();
419     }
420     }
421    
422     /**
423     * Records exception and sets status.
424     *
425     * @return status on exit
426     */
427     final int recordExceptionalCompletion(Throwable ex) {
428     int s;
429     if ((s = status) >= 0) {
430     int h = System.identityHashCode(this);
431     final ReentrantLock lock = exceptionTableLock;
432     lock.lock();
433     try {
434     expungeStaleExceptions();
435     ExceptionNode[] t = exceptionTable;
436     int i = h & (t.length - 1);
437     for (ExceptionNode e = t[i]; ; e = e.next) {
438     if (e == null) {
439     t[i] = new ExceptionNode(this, ex, t[i]);
440     break;
441     }
442     if (e.get() == this) // already present
443     break;
444     }
445     } finally {
446     lock.unlock();
447     }
448     s = setCompletion(EXCEPTIONAL);
449     }
450     return s;
451     }
452    
453     /**
454 jsr166 1.8 * Records exception and possibly propagates.
455 dl 1.1 *
456     * @return status on exit
457     */
458     private int setExceptionalCompletion(Throwable ex) {
459     int s = recordExceptionalCompletion(ex);
460     if ((s & DONE_MASK) == EXCEPTIONAL)
461     internalPropagateException(ex);
462     return s;
463     }
464    
465     /**
466     * Hook for exception propagation support for tasks with completers.
467     */
468     void internalPropagateException(Throwable ex) {
469     }
470    
471     /**
472     * Cancels, ignoring any exceptions thrown by cancel. Used during
473     * worker and pool shutdown. Cancel is spec'ed not to throw any
474     * exceptions, but if it does anyway, we have no recourse during
475     * shutdown, so guard against this case.
476     */
477     static final void cancelIgnoringExceptions(ForkJoinTask<?> t) {
478     if (t != null && t.status >= 0) {
479     try {
480     t.cancel(false);
481     } catch (Throwable ignore) {
482     }
483     }
484     }
485    
486     /**
487 jsr166 1.12 * Removes exception node and clears status.
488 dl 1.1 */
489     private void clearExceptionalCompletion() {
490     int h = System.identityHashCode(this);
491     final ReentrantLock lock = exceptionTableLock;
492     lock.lock();
493     try {
494     ExceptionNode[] t = exceptionTable;
495     int i = h & (t.length - 1);
496     ExceptionNode e = t[i];
497     ExceptionNode pred = null;
498     while (e != null) {
499     ExceptionNode next = e.next;
500     if (e.get() == this) {
501     if (pred == null)
502     t[i] = next;
503     else
504     pred.next = next;
505     break;
506     }
507     pred = e;
508     e = next;
509     }
510     expungeStaleExceptions();
511     status = 0;
512     } finally {
513     lock.unlock();
514     }
515     }
516    
517     /**
518     * Returns a rethrowable exception for the given task, if
519     * available. To provide accurate stack traces, if the exception
520     * was not thrown by the current thread, we try to create a new
521     * exception of the same type as the one thrown, but with the
522     * recorded exception as its cause. If there is no such
523     * constructor, we instead try to use a no-arg constructor,
524     * followed by initCause, to the same effect. If none of these
525     * apply, or any fail due to other exceptions, we return the
526     * recorded exception, which is still correct, although it may
527     * contain a misleading stack trace.
528     *
529     * @return the exception, or null if none
530     */
531     private Throwable getThrowableException() {
532     if ((status & DONE_MASK) != EXCEPTIONAL)
533     return null;
534     int h = System.identityHashCode(this);
535     ExceptionNode e;
536     final ReentrantLock lock = exceptionTableLock;
537     lock.lock();
538     try {
539     expungeStaleExceptions();
540     ExceptionNode[] t = exceptionTable;
541     e = t[h & (t.length - 1)];
542     while (e != null && e.get() != this)
543     e = e.next;
544     } finally {
545     lock.unlock();
546     }
547     Throwable ex;
548     if (e == null || (ex = e.ex) == null)
549     return null;
550     if (false && e.thrower != Thread.currentThread().getId()) {
551     Class<? extends Throwable> ec = ex.getClass();
552     try {
553     Constructor<?> noArgCtor = null;
554     Constructor<?>[] cs = ec.getConstructors();// public ctors only
555     for (int i = 0; i < cs.length; ++i) {
556     Constructor<?> c = cs[i];
557     Class<?>[] ps = c.getParameterTypes();
558     if (ps.length == 0)
559     noArgCtor = c;
560     else if (ps.length == 1 && ps[0] == Throwable.class)
561     return (Throwable)(c.newInstance(ex));
562     }
563     if (noArgCtor != null) {
564     Throwable wx = (Throwable)(noArgCtor.newInstance());
565     wx.initCause(ex);
566     return wx;
567     }
568     } catch (Exception ignore) {
569     }
570     }
571     return ex;
572     }
573    
574     /**
575     * Poll stale refs and remove them. Call only while holding lock.
576     */
577     private static void expungeStaleExceptions() {
578     for (Object x; (x = exceptionTableRefQueue.poll()) != null;) {
579     if (x instanceof ExceptionNode) {
580     ForkJoinTask<?> key = ((ExceptionNode)x).get();
581     ExceptionNode[] t = exceptionTable;
582     int i = System.identityHashCode(key) & (t.length - 1);
583     ExceptionNode e = t[i];
584     ExceptionNode pred = null;
585     while (e != null) {
586     ExceptionNode next = e.next;
587     if (e == x) {
588     if (pred == null)
589     t[i] = next;
590     else
591     pred.next = next;
592     break;
593     }
594     pred = e;
595     e = next;
596     }
597     }
598     }
599     }
600    
601     /**
602     * If lock is available, poll stale refs and remove them.
603     * Called from ForkJoinPool when pools become quiescent.
604     */
605     static final void helpExpungeStaleExceptions() {
606     final ReentrantLock lock = exceptionTableLock;
607     if (lock.tryLock()) {
608     try {
609     expungeStaleExceptions();
610     } finally {
611     lock.unlock();
612     }
613     }
614     }
615    
616     /**
617 dl 1.3 * A version of "sneaky throw" to relay exceptions
618     */
619 dl 1.13 static void rethrow(Throwable ex) {
620     if (ex != null)
621 dl 1.9 ForkJoinTask.<RuntimeException>uncheckedThrow(ex);
622 dl 1.3 }
623    
624     /**
625     * The sneaky part of sneaky throw, relying on generics
626     * limitations to evade compiler complaints about rethrowing
627     * unchecked exceptions
628     */
629     @SuppressWarnings("unchecked") static <T extends Throwable>
630 dl 1.9 void uncheckedThrow(Throwable t) throws T {
631 dl 1.13 throw (T)t; // rely on vacuous cast
632 dl 1.3 }
633    
634     /**
635 dl 1.1 * Throws exception, if any, associated with the given status.
636     */
637     private void reportException(int s) {
638 dl 1.3 if (s == CANCELLED)
639     throw new CancellationException();
640     if (s == EXCEPTIONAL)
641     rethrow(getThrowableException());
642 dl 1.1 }
643    
644     // public methods
645    
646     /**
647 dl 1.2 * Arranges to asynchronously execute this task in the pool the
648     * current task is running in, if applicable, or using the {@link
649 dl 1.5 * ForkJoinPool#commonPool()} if not {@link #inForkJoinPool}. While
650 dl 1.2 * it is not necessarily enforced, it is a usage error to fork a
651     * task more than once unless it has completed and been
652     * reinitialized. Subsequent modifications to the state of this
653     * task or any data it operates on are not necessarily
654     * consistently observable by any thread other than the one
655     * executing it unless preceded by a call to {@link #join} or
656     * related methods, or a call to {@link #isDone} returning {@code
657     * true}.
658 dl 1.1 *
659     * @return {@code this}, to simplify usage
660     */
661     public final ForkJoinTask<V> fork() {
662 dl 1.2 Thread t;
663     if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread)
664     ((ForkJoinWorkerThread)t).workQueue.push(this);
665     else
666 dl 1.9 ForkJoinPool.common.externalPush(this);
667 dl 1.1 return this;
668     }
669    
670     /**
671     * Returns the result of the computation when it {@link #isDone is
672     * done}. This method differs from {@link #get()} in that
673     * abnormal completion results in {@code RuntimeException} or
674     * {@code Error}, not {@code ExecutionException}, and that
675     * interrupts of the calling thread do <em>not</em> cause the
676     * method to abruptly return by throwing {@code
677     * InterruptedException}.
678     *
679     * @return the computed result
680     */
681     public final V join() {
682     int s;
683     if ((s = doJoin() & DONE_MASK) != NORMAL)
684     reportException(s);
685     return getRawResult();
686     }
687    
688     /**
689     * Commences performing this task, awaits its completion if
690     * necessary, and returns its result, or throws an (unchecked)
691     * {@code RuntimeException} or {@code Error} if the underlying
692     * computation did so.
693     *
694     * @return the computed result
695     */
696     public final V invoke() {
697     int s;
698     if ((s = doInvoke() & DONE_MASK) != NORMAL)
699     reportException(s);
700     return getRawResult();
701     }
702    
703     /**
704     * Forks the given tasks, returning when {@code isDone} holds for
705     * each task or an (unchecked) exception is encountered, in which
706     * case the exception is rethrown. If more than one task
707     * encounters an exception, then this method throws any one of
708     * these exceptions. If any task encounters an exception, the
709     * other may be cancelled. However, the execution status of
710     * individual tasks is not guaranteed upon exceptional return. The
711     * status of each task may be obtained using {@link
712     * #getException()} and related methods to check if they have been
713     * cancelled, completed normally or exceptionally, or left
714     * unprocessed.
715     *
716     * @param t1 the first task
717     * @param t2 the second task
718     * @throws NullPointerException if any task is null
719     */
720     public static void invokeAll(ForkJoinTask<?> t1, ForkJoinTask<?> t2) {
721     int s1, s2;
722     t2.fork();
723     if ((s1 = t1.doInvoke() & DONE_MASK) != NORMAL)
724     t1.reportException(s1);
725     if ((s2 = t2.doJoin() & DONE_MASK) != NORMAL)
726     t2.reportException(s2);
727     }
728    
729     /**
730     * Forks the given tasks, returning when {@code isDone} holds for
731     * each task or an (unchecked) exception is encountered, in which
732     * case the exception is rethrown. If more than one task
733     * encounters an exception, then this method throws any one of
734     * these exceptions. If any task encounters an exception, others
735     * may be cancelled. However, the execution status of individual
736     * tasks is not guaranteed upon exceptional return. The status of
737     * each task may be obtained using {@link #getException()} and
738     * related methods to check if they have been cancelled, completed
739     * normally or exceptionally, or left unprocessed.
740     *
741     * @param tasks the tasks
742     * @throws NullPointerException if any task is null
743     */
744     public static void invokeAll(ForkJoinTask<?>... tasks) {
745     Throwable ex = null;
746     int last = tasks.length - 1;
747     for (int i = last; i >= 0; --i) {
748     ForkJoinTask<?> t = tasks[i];
749     if (t == null) {
750     if (ex == null)
751     ex = new NullPointerException();
752     }
753     else if (i != 0)
754     t.fork();
755     else if (t.doInvoke() < NORMAL && ex == null)
756     ex = t.getException();
757     }
758     for (int i = 1; i <= last; ++i) {
759     ForkJoinTask<?> t = tasks[i];
760     if (t != null) {
761     if (ex != null)
762     t.cancel(false);
763     else if (t.doJoin() < NORMAL)
764     ex = t.getException();
765     }
766     }
767     if (ex != null)
768 dl 1.3 rethrow(ex);
769 dl 1.1 }
770    
771     /**
772     * Forks all tasks in the specified collection, returning when
773     * {@code isDone} holds for each task or an (unchecked) exception
774     * is encountered, in which case the exception is rethrown. If
775     * more than one task encounters an exception, then this method
776     * throws any one of these exceptions. If any task encounters an
777     * exception, others may be cancelled. However, the execution
778     * status of individual tasks is not guaranteed upon exceptional
779     * return. The status of each task may be obtained using {@link
780     * #getException()} and related methods to check if they have been
781     * cancelled, completed normally or exceptionally, or left
782     * unprocessed.
783     *
784     * @param tasks the collection of tasks
785 jsr166 1.14 * @param <T> the type of the values returned from the tasks
786 dl 1.1 * @return the tasks argument, to simplify usage
787     * @throws NullPointerException if tasks or any element are null
788     */
789     public static <T extends ForkJoinTask<?>> Collection<T> invokeAll(Collection<T> tasks) {
790     if (!(tasks instanceof RandomAccess) || !(tasks instanceof List<?>)) {
791     invokeAll(tasks.toArray(new ForkJoinTask<?>[tasks.size()]));
792     return tasks;
793     }
794     @SuppressWarnings("unchecked")
795     List<? extends ForkJoinTask<?>> ts =
796     (List<? extends ForkJoinTask<?>>) tasks;
797     Throwable ex = null;
798     int last = ts.size() - 1;
799     for (int i = last; i >= 0; --i) {
800     ForkJoinTask<?> t = ts.get(i);
801     if (t == null) {
802     if (ex == null)
803     ex = new NullPointerException();
804     }
805     else if (i != 0)
806     t.fork();
807     else if (t.doInvoke() < NORMAL && ex == null)
808     ex = t.getException();
809     }
810     for (int i = 1; i <= last; ++i) {
811     ForkJoinTask<?> t = ts.get(i);
812     if (t != null) {
813     if (ex != null)
814     t.cancel(false);
815     else if (t.doJoin() < NORMAL)
816     ex = t.getException();
817     }
818     }
819     if (ex != null)
820 dl 1.3 rethrow(ex);
821 dl 1.1 return tasks;
822     }
823    
824     /**
825     * Attempts to cancel execution of this task. This attempt will
826     * fail if the task has already completed or could not be
827     * cancelled for some other reason. If successful, and this task
828     * has not started when {@code cancel} is called, execution of
829     * this task is suppressed. After this method returns
830     * successfully, unless there is an intervening call to {@link
831     * #reinitialize}, subsequent calls to {@link #isCancelled},
832     * {@link #isDone}, and {@code cancel} will return {@code true}
833     * and calls to {@link #join} and related methods will result in
834     * {@code CancellationException}.
835     *
836     * <p>This method may be overridden in subclasses, but if so, must
837     * still ensure that these properties hold. In particular, the
838     * {@code cancel} method itself must not throw exceptions.
839     *
840     * <p>This method is designed to be invoked by <em>other</em>
841     * tasks. To terminate the current task, you can just return or
842     * throw an unchecked exception from its computation method, or
843 dl 1.13 * invoke {@link #completeExceptionally(Throwable)}.
844 dl 1.1 *
845     * @param mayInterruptIfRunning this value has no effect in the
846     * default implementation because interrupts are not used to
847     * control cancellation.
848     *
849     * @return {@code true} if this task is now cancelled
850     */
851     public boolean cancel(boolean mayInterruptIfRunning) {
852     return (setCompletion(CANCELLED) & DONE_MASK) == CANCELLED;
853     }
854    
855     public final boolean isDone() {
856     return status < 0;
857     }
858    
859     public final boolean isCancelled() {
860     return (status & DONE_MASK) == CANCELLED;
861     }
862    
863     /**
864     * Returns {@code true} if this task threw an exception or was cancelled.
865     *
866     * @return {@code true} if this task threw an exception or was cancelled
867     */
868     public final boolean isCompletedAbnormally() {
869     return status < NORMAL;
870     }
871    
872     /**
873     * Returns {@code true} if this task completed without throwing an
874     * exception and was not cancelled.
875     *
876     * @return {@code true} if this task completed without throwing an
877     * exception and was not cancelled
878     */
879     public final boolean isCompletedNormally() {
880     return (status & DONE_MASK) == NORMAL;
881     }
882    
883     /**
884     * Returns the exception thrown by the base computation, or a
885     * {@code CancellationException} if cancelled, or {@code null} if
886     * none or if the method has not yet completed.
887     *
888     * @return the exception, or {@code null} if none
889     */
890     public final Throwable getException() {
891     int s = status & DONE_MASK;
892     return ((s >= NORMAL) ? null :
893     (s == CANCELLED) ? new CancellationException() :
894     getThrowableException());
895     }
896    
897     /**
898     * Completes this task abnormally, and if not already aborted or
899     * cancelled, causes it to throw the given exception upon
900     * {@code join} and related operations. This method may be used
901     * to induce exceptions in asynchronous tasks, or to force
902     * completion of tasks that would not otherwise complete. Its use
903     * in other situations is discouraged. This method is
904     * overridable, but overridden versions must invoke {@code super}
905     * implementation to maintain guarantees.
906     *
907     * @param ex the exception to throw. If this exception is not a
908     * {@code RuntimeException} or {@code Error}, the actual exception
909     * thrown will be a {@code RuntimeException} with cause {@code ex}.
910     */
911     public void completeExceptionally(Throwable ex) {
912     setExceptionalCompletion((ex instanceof RuntimeException) ||
913     (ex instanceof Error) ? ex :
914     new RuntimeException(ex));
915     }
916    
917     /**
918     * Completes this task, and if not already aborted or cancelled,
919     * returning the given value as the result of subsequent
920     * invocations of {@code join} and related operations. This method
921     * may be used to provide results for asynchronous tasks, or to
922     * provide alternative handling for tasks that would not otherwise
923     * complete normally. Its use in other situations is
924     * discouraged. This method is overridable, but overridden
925     * versions must invoke {@code super} implementation to maintain
926     * guarantees.
927     *
928     * @param value the result value for this task
929     */
930     public void complete(V value) {
931     try {
932     setRawResult(value);
933     } catch (Throwable rex) {
934     setExceptionalCompletion(rex);
935     return;
936     }
937     setCompletion(NORMAL);
938     }
939    
940     /**
941     * Completes this task normally without setting a value. The most
942     * recent value established by {@link #setRawResult} (or {@code
943     * null} by default) will be returned as the result of subsequent
944     * invocations of {@code join} and related operations.
945     *
946     * @since 1.8
947     */
948     public final void quietlyComplete() {
949     setCompletion(NORMAL);
950     }
951    
952     /**
953     * Waits if necessary for the computation to complete, and then
954     * retrieves its result.
955     *
956     * @return the computed result
957     * @throws CancellationException if the computation was cancelled
958     * @throws ExecutionException if the computation threw an
959     * exception
960     * @throws InterruptedException if the current thread is not a
961     * member of a ForkJoinPool and was interrupted while waiting
962     */
963     public final V get() throws InterruptedException, ExecutionException {
964     int s = (Thread.currentThread() instanceof ForkJoinWorkerThread) ?
965     doJoin() : externalInterruptibleAwaitDone();
966     Throwable ex;
967     if ((s &= DONE_MASK) == CANCELLED)
968     throw new CancellationException();
969     if (s == EXCEPTIONAL && (ex = getThrowableException()) != null)
970     throw new ExecutionException(ex);
971     return getRawResult();
972     }
973    
974     /**
975     * Waits if necessary for at most the given time for the computation
976     * to complete, and then retrieves its result, if available.
977     *
978     * @param timeout the maximum time to wait
979     * @param unit the time unit of the timeout argument
980     * @return the computed result
981     * @throws CancellationException if the computation was cancelled
982     * @throws ExecutionException if the computation threw an
983     * exception
984     * @throws InterruptedException if the current thread is not a
985     * member of a ForkJoinPool and was interrupted while waiting
986     * @throws TimeoutException if the wait timed out
987     */
988     public final V get(long timeout, TimeUnit unit)
989     throws InterruptedException, ExecutionException, TimeoutException {
990     if (Thread.interrupted())
991     throw new InterruptedException();
992     // Messy in part because we measure in nanosecs, but wait in millisecs
993 dl 1.7 int s; long ms;
994     long ns = unit.toNanos(timeout);
995 dl 1.13 ForkJoinPool cp;
996 dl 1.7 if ((s = status) >= 0 && ns > 0L) {
997 dl 1.1 long deadline = System.nanoTime() + ns;
998     ForkJoinPool p = null;
999     ForkJoinPool.WorkQueue w = null;
1000     Thread t = Thread.currentThread();
1001     if (t instanceof ForkJoinWorkerThread) {
1002     ForkJoinWorkerThread wt = (ForkJoinWorkerThread)t;
1003     p = wt.pool;
1004     w = wt.workQueue;
1005 dl 1.4 p.helpJoinOnce(w, this); // no retries on failure
1006 dl 1.1 }
1007 dl 1.13 else if ((cp = ForkJoinPool.common) != null) {
1008     if (this instanceof CountedCompleter)
1009     cp.externalHelpComplete((CountedCompleter<?>)this);
1010     else if (cp.tryExternalUnpush(this))
1011     doExec();
1012     }
1013 dl 1.1 boolean canBlock = false;
1014     boolean interrupted = false;
1015     try {
1016     while ((s = status) >= 0) {
1017 dl 1.4 if (w != null && w.qlock < 0)
1018 dl 1.1 cancelIgnoringExceptions(this);
1019     else if (!canBlock) {
1020 dl 1.13 if (p == null || p.tryCompensate(p.ctl))
1021 dl 1.1 canBlock = true;
1022     }
1023     else {
1024     if ((ms = TimeUnit.NANOSECONDS.toMillis(ns)) > 0L &&
1025     U.compareAndSwapInt(this, STATUS, s, s | SIGNAL)) {
1026     synchronized (this) {
1027     if (status >= 0) {
1028     try {
1029     wait(ms);
1030     } catch (InterruptedException ie) {
1031     if (p == null)
1032     interrupted = true;
1033     }
1034     }
1035     else
1036     notifyAll();
1037     }
1038     }
1039     if ((s = status) < 0 || interrupted ||
1040     (ns = deadline - System.nanoTime()) <= 0L)
1041     break;
1042     }
1043     }
1044     } finally {
1045     if (p != null && canBlock)
1046     p.incrementActiveCount();
1047     }
1048     if (interrupted)
1049     throw new InterruptedException();
1050     }
1051     if ((s &= DONE_MASK) != NORMAL) {
1052     Throwable ex;
1053     if (s == CANCELLED)
1054     throw new CancellationException();
1055     if (s != EXCEPTIONAL)
1056     throw new TimeoutException();
1057     if ((ex = getThrowableException()) != null)
1058     throw new ExecutionException(ex);
1059     }
1060     return getRawResult();
1061     }
1062    
1063     /**
1064     * Joins this task, without returning its result or throwing its
1065     * exception. This method may be useful when processing
1066     * collections of tasks when some have been cancelled or otherwise
1067     * known to have aborted.
1068     */
1069     public final void quietlyJoin() {
1070     doJoin();
1071     }
1072    
1073     /**
1074     * Commences performing this task and awaits its completion if
1075     * necessary, without returning its result or throwing its
1076     * exception.
1077     */
1078     public final void quietlyInvoke() {
1079     doInvoke();
1080     }
1081    
1082     /**
1083     * Possibly executes tasks until the pool hosting the current task
1084     * {@link ForkJoinPool#isQuiescent is quiescent}. This method may
1085     * be of use in designs in which many tasks are forked, but none
1086     * are explicitly joined, instead executing them until all are
1087     * processed.
1088     */
1089     public static void helpQuiesce() {
1090 dl 1.2 Thread t;
1091     if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) {
1092     ForkJoinWorkerThread wt = (ForkJoinWorkerThread)t;
1093     wt.pool.helpQuiescePool(wt.workQueue);
1094     }
1095     else
1096 dl 1.9 ForkJoinPool.quiesceCommonPool();
1097 dl 1.1 }
1098    
1099     /**
1100     * Resets the internal bookkeeping state of this task, allowing a
1101     * subsequent {@code fork}. This method allows repeated reuse of
1102     * this task, but only if reuse occurs when this task has either
1103     * never been forked, or has been forked, then completed and all
1104     * outstanding joins of this task have also completed. Effects
1105     * under any other usage conditions are not guaranteed.
1106     * This method may be useful when executing
1107     * pre-constructed trees of subtasks in loops.
1108     *
1109     * <p>Upon completion of this method, {@code isDone()} reports
1110     * {@code false}, and {@code getException()} reports {@code
1111     * null}. However, the value returned by {@code getRawResult} is
1112     * unaffected. To clear this value, you can invoke {@code
1113     * setRawResult(null)}.
1114     */
1115     public void reinitialize() {
1116     if ((status & DONE_MASK) == EXCEPTIONAL)
1117     clearExceptionalCompletion();
1118     else
1119     status = 0;
1120     }
1121    
1122     /**
1123     * Returns the pool hosting the current task execution, or null
1124     * if this task is executing outside of any ForkJoinPool.
1125     *
1126     * @see #inForkJoinPool
1127     * @return the pool, or {@code null} if none
1128     */
1129     public static ForkJoinPool getPool() {
1130     Thread t = Thread.currentThread();
1131     return (t instanceof ForkJoinWorkerThread) ?
1132     ((ForkJoinWorkerThread) t).pool : null;
1133     }
1134    
1135     /**
1136     * Returns {@code true} if the current thread is a {@link
1137     * ForkJoinWorkerThread} executing as a ForkJoinPool computation.
1138     *
1139     * @return {@code true} if the current thread is a {@link
1140     * ForkJoinWorkerThread} executing as a ForkJoinPool computation,
1141     * or {@code false} otherwise
1142     */
1143     public static boolean inForkJoinPool() {
1144     return Thread.currentThread() instanceof ForkJoinWorkerThread;
1145     }
1146    
1147     /**
1148     * Tries to unschedule this task for execution. This method will
1149 dl 1.2 * typically (but is not guaranteed to) succeed if this task is
1150     * the most recently forked task by the current thread, and has
1151     * not commenced executing in another thread. This method may be
1152     * useful when arranging alternative local processing of tasks
1153     * that could have been, but were not, stolen.
1154 dl 1.1 *
1155     * @return {@code true} if unforked
1156     */
1157     public boolean tryUnfork() {
1158 dl 1.2 Thread t;
1159 dl 1.4 return (((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ?
1160     ((ForkJoinWorkerThread)t).workQueue.tryUnpush(this) :
1161 dl 1.13 ForkJoinPool.common.tryExternalUnpush(this));
1162 dl 1.1 }
1163    
1164     /**
1165     * Returns an estimate of the number of tasks that have been
1166     * forked by the current worker thread but not yet executed. This
1167     * value may be useful for heuristic decisions about whether to
1168     * fork other tasks.
1169     *
1170     * @return the number of tasks
1171     */
1172     public static int getQueuedTaskCount() {
1173 dl 1.4 Thread t; ForkJoinPool.WorkQueue q;
1174     if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread)
1175     q = ((ForkJoinWorkerThread)t).workQueue;
1176     else
1177     q = ForkJoinPool.commonSubmitterQueue();
1178     return (q == null) ? 0 : q.queueSize();
1179 dl 1.1 }
1180    
1181     /**
1182     * Returns an estimate of how many more locally queued tasks are
1183     * held by the current worker thread than there are other worker
1184 dl 1.2 * threads that might steal them, or zero if this thread is not
1185     * operating in a ForkJoinPool. This value may be useful for
1186 dl 1.1 * heuristic decisions about whether to fork other tasks. In many
1187     * usages of ForkJoinTasks, at steady state, each worker should
1188     * aim to maintain a small constant surplus (for example, 3) of
1189     * tasks, and to process computations locally if this threshold is
1190     * exceeded.
1191     *
1192     * @return the surplus number of tasks, which may be negative
1193     */
1194     public static int getSurplusQueuedTaskCount() {
1195 dl 1.4 return ForkJoinPool.getSurplusQueuedTaskCount();
1196 dl 1.1 }
1197    
1198     // Extension methods
1199    
1200     /**
1201     * Returns the result that would be returned by {@link #join}, even
1202     * if this task completed abnormally, or {@code null} if this task
1203     * is not known to have been completed. This method is designed
1204     * to aid debugging, as well as to support extensions. Its use in
1205     * any other context is discouraged.
1206     *
1207     * @return the result, or {@code null} if not completed
1208     */
1209     public abstract V getRawResult();
1210    
1211     /**
1212     * Forces the given value to be returned as a result. This method
1213     * is designed to support extensions, and should not in general be
1214     * called otherwise.
1215     *
1216     * @param value the value
1217     */
1218     protected abstract void setRawResult(V value);
1219    
1220     /**
1221     * Immediately performs the base action of this task and returns
1222     * true if, upon return from this method, this task is guaranteed
1223     * to have completed normally. This method may return false
1224     * otherwise, to indicate that this task is not necessarily
1225     * complete (or is not known to be complete), for example in
1226     * asynchronous actions that require explicit invocations of
1227     * completion methods. This method may also throw an (unchecked)
1228     * exception to indicate abnormal exit. This method is designed to
1229     * support extensions, and should not in general be called
1230     * otherwise.
1231     *
1232     * @return {@code true} if this task is known to have completed normally
1233     */
1234     protected abstract boolean exec();
1235    
1236     /**
1237     * Returns, but does not unschedule or execute, a task queued by
1238     * the current thread but not yet executed, if one is immediately
1239 dl 1.4 * available. There is no guarantee that this task will actually
1240     * be polled or executed next. Conversely, this method may return
1241     * null even if a task exists but cannot be accessed without
1242     * contention with other threads. This method is designed
1243 dl 1.1 * primarily to support extensions, and is unlikely to be useful
1244     * otherwise.
1245     *
1246     * @return the next task, or {@code null} if none are available
1247     */
1248     protected static ForkJoinTask<?> peekNextLocalTask() {
1249 dl 1.4 Thread t; ForkJoinPool.WorkQueue q;
1250     if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread)
1251     q = ((ForkJoinWorkerThread)t).workQueue;
1252     else
1253     q = ForkJoinPool.commonSubmitterQueue();
1254     return (q == null) ? null : q.peek();
1255 dl 1.1 }
1256    
1257     /**
1258     * Unschedules and returns, without executing, the next task
1259 dl 1.2 * queued by the current thread but not yet executed, if the
1260     * current thread is operating in a ForkJoinPool. This method is
1261     * designed primarily to support extensions, and is unlikely to be
1262     * useful otherwise.
1263 dl 1.1 *
1264     * @return the next task, or {@code null} if none are available
1265     */
1266     protected static ForkJoinTask<?> pollNextLocalTask() {
1267 dl 1.2 Thread t;
1268     return ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ?
1269     ((ForkJoinWorkerThread)t).workQueue.nextLocalTask() :
1270     null;
1271 dl 1.1 }
1272    
1273     /**
1274 dl 1.2 * If the current thread is operating in a ForkJoinPool,
1275     * unschedules and returns, without executing, the next task
1276 dl 1.1 * queued by the current thread but not yet executed, if one is
1277     * available, or if not available, a task that was forked by some
1278     * other thread, if available. Availability may be transient, so a
1279 dl 1.2 * {@code null} result does not necessarily imply quiescence of
1280     * the pool this task is operating in. This method is designed
1281 dl 1.1 * primarily to support extensions, and is unlikely to be useful
1282     * otherwise.
1283     *
1284     * @return a task, or {@code null} if none are available
1285     */
1286     protected static ForkJoinTask<?> pollTask() {
1287 dl 1.2 Thread t; ForkJoinWorkerThread wt;
1288     return ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ?
1289     (wt = (ForkJoinWorkerThread)t).pool.nextTaskFor(wt.workQueue) :
1290     null;
1291 dl 1.1 }
1292    
1293     // tag operations
1294    
1295     /**
1296     * Returns the tag for this task.
1297     *
1298     * @return the tag for this task
1299     * @since 1.8
1300     */
1301     public final short getForkJoinTaskTag() {
1302     return (short)status;
1303     }
1304    
1305     /**
1306     * Atomically sets the tag value for this task.
1307     *
1308     * @param tag the tag value
1309     * @return the previous value of the tag
1310     * @since 1.8
1311     */
1312     public final short setForkJoinTaskTag(short tag) {
1313     for (int s;;) {
1314     if (U.compareAndSwapInt(this, STATUS, s = status,
1315     (s & ~SMASK) | (tag & SMASK)))
1316     return (short)s;
1317     }
1318     }
1319    
1320     /**
1321     * Atomically conditionally sets the tag value for this task.
1322     * Among other applications, tags can be used as visit markers
1323     * in tasks operating on graphs, as in methods that check: {@code
1324     * if (task.compareAndSetForkJoinTaskTag((short)0, (short)1))}
1325     * before processing, otherwise exiting because the node has
1326     * already been visited.
1327     *
1328     * @param e the expected tag value
1329     * @param tag the new tag value
1330 dl 1.13 * @return {@code true} if successful; i.e., the current value was
1331 dl 1.1 * equal to e and is now tag.
1332     * @since 1.8
1333     */
1334     public final boolean compareAndSetForkJoinTaskTag(short e, short tag) {
1335     for (int s;;) {
1336     if ((short)(s = status) != e)
1337     return false;
1338     if (U.compareAndSwapInt(this, STATUS, s,
1339     (s & ~SMASK) | (tag & SMASK)))
1340     return true;
1341     }
1342     }
1343    
1344     /**
1345     * Adaptor for Runnables. This implements RunnableFuture
1346     * to be compliant with AbstractExecutorService constraints
1347     * when used in ForkJoinPool.
1348     */
1349     static final class AdaptedRunnable<T> extends ForkJoinTask<T>
1350     implements RunnableFuture<T> {
1351     final Runnable runnable;
1352     T result;
1353     AdaptedRunnable(Runnable runnable, T result) {
1354     if (runnable == null) throw new NullPointerException();
1355     this.runnable = runnable;
1356     this.result = result; // OK to set this even before completion
1357     }
1358     public final T getRawResult() { return result; }
1359     public final void setRawResult(T v) { result = v; }
1360     public final boolean exec() { runnable.run(); return true; }
1361     public final void run() { invoke(); }
1362     private static final long serialVersionUID = 5232453952276885070L;
1363     }
1364    
1365     /**
1366     * Adaptor for Runnables without results
1367     */
1368     static final class AdaptedRunnableAction extends ForkJoinTask<Void>
1369     implements RunnableFuture<Void> {
1370     final Runnable runnable;
1371     AdaptedRunnableAction(Runnable runnable) {
1372     if (runnable == null) throw new NullPointerException();
1373     this.runnable = runnable;
1374     }
1375     public final Void getRawResult() { return null; }
1376     public final void setRawResult(Void v) { }
1377     public final boolean exec() { runnable.run(); return true; }
1378     public final void run() { invoke(); }
1379     private static final long serialVersionUID = 5232453952276885070L;
1380     }
1381    
1382     /**
1383 dl 1.13 * Adaptor for Runnables in which failure forces worker exception
1384     */
1385     static final class RunnableExecuteAction extends ForkJoinTask<Void> {
1386     final Runnable runnable;
1387     RunnableExecuteAction(Runnable runnable) {
1388     if (runnable == null) throw new NullPointerException();
1389     this.runnable = runnable;
1390     }
1391     public final Void getRawResult() { return null; }
1392     public final void setRawResult(Void v) { }
1393     public final boolean exec() { runnable.run(); return true; }
1394     void internalPropagateException(Throwable ex) {
1395     rethrow(ex); // rethrow outside exec() catches.
1396     }
1397     private static final long serialVersionUID = 5232453952276885070L;
1398     }
1399    
1400     /**
1401 dl 1.1 * Adaptor for Callables
1402     */
1403     static final class AdaptedCallable<T> extends ForkJoinTask<T>
1404     implements RunnableFuture<T> {
1405     final Callable<? extends T> callable;
1406     T result;
1407     AdaptedCallable(Callable<? extends T> callable) {
1408     if (callable == null) throw new NullPointerException();
1409     this.callable = callable;
1410     }
1411     public final T getRawResult() { return result; }
1412     public final void setRawResult(T v) { result = v; }
1413     public final boolean exec() {
1414     try {
1415     result = callable.call();
1416     return true;
1417     } catch (Error err) {
1418     throw err;
1419     } catch (RuntimeException rex) {
1420     throw rex;
1421     } catch (Exception ex) {
1422     throw new RuntimeException(ex);
1423     }
1424     }
1425     public final void run() { invoke(); }
1426     private static final long serialVersionUID = 2838392045355241008L;
1427     }
1428    
1429     /**
1430     * Returns a new {@code ForkJoinTask} that performs the {@code run}
1431     * method of the given {@code Runnable} as its action, and returns
1432     * a null result upon {@link #join}.
1433     *
1434     * @param runnable the runnable action
1435     * @return the task
1436     */
1437     public static ForkJoinTask<?> adapt(Runnable runnable) {
1438     return new AdaptedRunnableAction(runnable);
1439     }
1440    
1441     /**
1442     * Returns a new {@code ForkJoinTask} that performs the {@code run}
1443     * method of the given {@code Runnable} as its action, and returns
1444     * the given result upon {@link #join}.
1445     *
1446     * @param runnable the runnable action
1447     * @param result the result upon completion
1448 jsr166 1.14 * @param <T> the type of the result
1449 dl 1.1 * @return the task
1450     */
1451     public static <T> ForkJoinTask<T> adapt(Runnable runnable, T result) {
1452     return new AdaptedRunnable<T>(runnable, result);
1453     }
1454    
1455     /**
1456     * Returns a new {@code ForkJoinTask} that performs the {@code call}
1457     * method of the given {@code Callable} as its action, and returns
1458     * its result upon {@link #join}, translating any checked exceptions
1459     * encountered into {@code RuntimeException}.
1460     *
1461     * @param callable the callable action
1462 jsr166 1.14 * @param <T> the type of the callable's result
1463 dl 1.1 * @return the task
1464     */
1465     public static <T> ForkJoinTask<T> adapt(Callable<? extends T> callable) {
1466     return new AdaptedCallable<T>(callable);
1467     }
1468    
1469     // Serialization support
1470    
1471     private static final long serialVersionUID = -7721805057305804111L;
1472    
1473     /**
1474     * Saves this task to a stream (that is, serializes it).
1475     *
1476     * @serialData the current run status and the exception thrown
1477     * during execution, or {@code null} if none
1478     */
1479     private void writeObject(java.io.ObjectOutputStream s)
1480     throws java.io.IOException {
1481     s.defaultWriteObject();
1482     s.writeObject(getException());
1483     }
1484    
1485     /**
1486     * Reconstitutes this task from a stream (that is, deserializes it).
1487     */
1488     private void readObject(java.io.ObjectInputStream s)
1489     throws java.io.IOException, ClassNotFoundException {
1490     s.defaultReadObject();
1491     Object ex = s.readObject();
1492     if (ex != null)
1493     setExceptionalCompletion((Throwable)ex);
1494     }
1495    
1496     // Unsafe mechanics
1497     private static final sun.misc.Unsafe U;
1498     private static final long STATUS;
1499 dl 1.4
1500 dl 1.1 static {
1501     exceptionTableLock = new ReentrantLock();
1502     exceptionTableRefQueue = new ReferenceQueue<Object>();
1503     exceptionTable = new ExceptionNode[EXCEPTION_MAP_CAPACITY];
1504     try {
1505     U = getUnsafe();
1506 dl 1.4 Class<?> k = ForkJoinTask.class;
1507 dl 1.1 STATUS = U.objectFieldOffset
1508 dl 1.4 (k.getDeclaredField("status"));
1509 dl 1.1 } catch (Exception e) {
1510     throw new Error(e);
1511     }
1512     }
1513    
1514     /**
1515     * Returns a sun.misc.Unsafe. Suitable for use in a 3rd party package.
1516     * Replace with a simple call to Unsafe.getUnsafe when integrating
1517     * into a jdk.
1518     *
1519     * @return a sun.misc.Unsafe
1520     */
1521     private static sun.misc.Unsafe getUnsafe() {
1522     try {
1523     return sun.misc.Unsafe.getUnsafe();
1524 jsr166 1.10 } catch (SecurityException tryReflectionInstead) {}
1525     try {
1526     return java.security.AccessController.doPrivileged
1527     (new java.security.PrivilegedExceptionAction<sun.misc.Unsafe>() {
1528     public sun.misc.Unsafe run() throws Exception {
1529     Class<sun.misc.Unsafe> k = sun.misc.Unsafe.class;
1530     for (java.lang.reflect.Field f : k.getDeclaredFields()) {
1531     f.setAccessible(true);
1532     Object x = f.get(null);
1533     if (k.isInstance(x))
1534     return k.cast(x);
1535     }
1536     throw new NoSuchFieldError("the Unsafe");
1537     }});
1538     } catch (java.security.PrivilegedActionException e) {
1539     throw new RuntimeException("Could not initialize intrinsics",
1540     e.getCause());
1541 dl 1.1 }
1542     }
1543     }