ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/jdk7/java/util/concurrent/ForkJoinTask.java
Revision: 1.8
Committed: Fri Sep 20 10:52:10 2013 UTC (10 years, 8 months ago) by dl
Branch: MAIN
Changes since 1.7: +4 -2 lines
Log Message:
fix exceptionTable leak

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 java.util.concurrent;
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     * <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 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
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     * 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
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     * 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
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     * 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
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     * {@link Phaser}, {@link #helpQuiesce}, and {@link #complete}) that
138     * may be of use in constructing custom subclasses for problems that
139 dl 1.5 * 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     int s;
288 dl 1.5 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.5 } 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     int s;
325 dl 1.5 ForkJoinPool cp = ForkJoinPool.common;
326 dl 1.1 if (Thread.interrupted())
327     throw new InterruptedException();
328 dl 1.5 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.1 while ((s = status) >= 0) {
335     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     /**
348     * Implementation for join, get, quietlyJoin. Directly handles
349     * only cases of already-completed, external wait, and
350     * unfork+exec. Others are relayed to ForkJoinPool.awaitJoin.
351     *
352     * @return status upon completion
353     */
354     private int doJoin() {
355     int s; Thread t; ForkJoinWorkerThread wt; ForkJoinPool.WorkQueue w;
356     return (s = status) < 0 ? s :
357     ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ?
358     (w = (wt = (ForkJoinWorkerThread)t).workQueue).
359     tryUnpush(this) && (s = doExec()) < 0 ? s :
360     wt.pool.awaitJoin(w, this) :
361     externalAwaitDone();
362     }
363    
364     /**
365     * Implementation for invoke, quietlyInvoke.
366     *
367     * @return status upon completion
368     */
369     private int doInvoke() {
370     int s; Thread t; ForkJoinWorkerThread wt;
371     return (s = doExec()) < 0 ? s :
372     ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ?
373     (wt = (ForkJoinWorkerThread)t).pool.awaitJoin(wt.workQueue, this) :
374     externalAwaitDone();
375     }
376    
377     // Exception table support
378    
379     /**
380     * Table of exceptions thrown by tasks, to enable reporting by
381     * callers. Because exceptions are rare, we don't directly keep
382     * them with task objects, but instead use a weak ref table. Note
383     * that cancellation exceptions don't appear in the table, but are
384     * instead recorded as status values.
385     *
386     * Note: These statics are initialized below in static block.
387     */
388     private static final ExceptionNode[] exceptionTable;
389     private static final ReentrantLock exceptionTableLock;
390     private static final ReferenceQueue<Object> exceptionTableRefQueue;
391    
392     /**
393     * Fixed capacity for exceptionTable.
394     */
395     private static final int EXCEPTION_MAP_CAPACITY = 32;
396    
397     /**
398     * Key-value nodes for exception table. The chained hash table
399     * uses identity comparisons, full locking, and weak references
400     * for keys. The table has a fixed capacity because it only
401     * maintains task exceptions long enough for joiners to access
402     * them, so should never become very large for sustained
403     * periods. However, since we do not know when the last joiner
404     * completes, we must use weak references and expunge them. We do
405     * so on each operation (hence full locking). Also, some thread in
406     * any ForkJoinPool will call helpExpungeStaleExceptions when its
407     * pool becomes isQuiescent.
408     */
409     static final class ExceptionNode extends WeakReference<ForkJoinTask<?>> {
410     final Throwable ex;
411     ExceptionNode next;
412     final long thrower; // use id not ref to avoid weak cycles
413 dl 1.8 final int hashCode; // store task hashCode before weak ref disappears
414 dl 1.1 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 dl 1.8 this.hashCode = System.identityHashCode(task);
420 dl 1.1 }
421     }
422    
423     /**
424     * Records exception and sets status.
425     *
426     * @return status on exit
427     */
428     final int recordExceptionalCompletion(Throwable ex) {
429     int s;
430     if ((s = status) >= 0) {
431     int h = System.identityHashCode(this);
432     final ReentrantLock lock = exceptionTableLock;
433     lock.lock();
434     try {
435     expungeStaleExceptions();
436     ExceptionNode[] t = exceptionTable;
437     int i = h & (t.length - 1);
438     for (ExceptionNode e = t[i]; ; e = e.next) {
439     if (e == null) {
440     t[i] = new ExceptionNode(this, ex, t[i]);
441     break;
442     }
443     if (e.get() == this) // already present
444     break;
445     }
446     } finally {
447     lock.unlock();
448     }
449     s = setCompletion(EXCEPTIONAL);
450     }
451     return s;
452     }
453    
454     /**
455 jsr166 1.2 * Records exception and possibly propagates.
456 dl 1.1 *
457     * @return status on exit
458     */
459     private int setExceptionalCompletion(Throwable ex) {
460     int s = recordExceptionalCompletion(ex);
461     if ((s & DONE_MASK) == EXCEPTIONAL)
462     internalPropagateException(ex);
463     return s;
464     }
465    
466     /**
467     * Hook for exception propagation support for tasks with completers.
468     */
469     void internalPropagateException(Throwable ex) {
470     }
471    
472     /**
473     * Cancels, ignoring any exceptions thrown by cancel. Used during
474     * worker and pool shutdown. Cancel is spec'ed not to throw any
475     * exceptions, but if it does anyway, we have no recourse during
476     * shutdown, so guard against this case.
477     */
478     static final void cancelIgnoringExceptions(ForkJoinTask<?> t) {
479     if (t != null && t.status >= 0) {
480     try {
481     t.cancel(false);
482     } catch (Throwable ignore) {
483     }
484     }
485     }
486    
487     /**
488 jsr166 1.4 * Removes exception node and clears status.
489 dl 1.1 */
490     private void clearExceptionalCompletion() {
491     int h = System.identityHashCode(this);
492     final ReentrantLock lock = exceptionTableLock;
493     lock.lock();
494     try {
495     ExceptionNode[] t = exceptionTable;
496     int i = h & (t.length - 1);
497     ExceptionNode e = t[i];
498     ExceptionNode pred = null;
499     while (e != null) {
500     ExceptionNode next = e.next;
501     if (e.get() == this) {
502     if (pred == null)
503     t[i] = next;
504     else
505     pred.next = next;
506     break;
507     }
508     pred = e;
509     e = next;
510     }
511     expungeStaleExceptions();
512     status = 0;
513     } finally {
514     lock.unlock();
515     }
516     }
517    
518     /**
519     * Returns a rethrowable exception for the given task, if
520     * available. To provide accurate stack traces, if the exception
521     * was not thrown by the current thread, we try to create a new
522     * exception of the same type as the one thrown, but with the
523     * recorded exception as its cause. If there is no such
524     * constructor, we instead try to use a no-arg constructor,
525     * followed by initCause, to the same effect. If none of these
526     * apply, or any fail due to other exceptions, we return the
527     * recorded exception, which is still correct, although it may
528     * contain a misleading stack trace.
529     *
530     * @return the exception, or null if none
531     */
532     private Throwable getThrowableException() {
533     if ((status & DONE_MASK) != EXCEPTIONAL)
534     return null;
535     int h = System.identityHashCode(this);
536     ExceptionNode e;
537     final ReentrantLock lock = exceptionTableLock;
538     lock.lock();
539     try {
540     expungeStaleExceptions();
541     ExceptionNode[] t = exceptionTable;
542     e = t[h & (t.length - 1)];
543     while (e != null && e.get() != this)
544     e = e.next;
545     } finally {
546     lock.unlock();
547     }
548     Throwable ex;
549     if (e == null || (ex = e.ex) == null)
550     return null;
551     if (false && e.thrower != Thread.currentThread().getId()) {
552     Class<? extends Throwable> ec = ex.getClass();
553     try {
554     Constructor<?> noArgCtor = null;
555     Constructor<?>[] cs = ec.getConstructors();// public ctors only
556     for (int i = 0; i < cs.length; ++i) {
557     Constructor<?> c = cs[i];
558     Class<?>[] ps = c.getParameterTypes();
559     if (ps.length == 0)
560     noArgCtor = c;
561     else if (ps.length == 1 && ps[0] == Throwable.class)
562     return (Throwable)(c.newInstance(ex));
563     }
564     if (noArgCtor != null) {
565     Throwable wx = (Throwable)(noArgCtor.newInstance());
566     wx.initCause(ex);
567     return wx;
568     }
569     } catch (Exception ignore) {
570     }
571     }
572     return ex;
573     }
574    
575     /**
576     * Poll stale refs and remove them. Call only while holding lock.
577     */
578     private static void expungeStaleExceptions() {
579     for (Object x; (x = exceptionTableRefQueue.poll()) != null;) {
580     if (x instanceof ExceptionNode) {
581 dl 1.8 int hashCode = ((ExceptionNode)x).hashCode;
582 dl 1.1 ExceptionNode[] t = exceptionTable;
583 dl 1.8 int i = hashCode & (t.length - 1);
584 dl 1.1 ExceptionNode e = t[i];
585     ExceptionNode pred = null;
586     while (e != null) {
587     ExceptionNode next = e.next;
588     if (e == x) {
589     if (pred == null)
590     t[i] = next;
591     else
592     pred.next = next;
593     break;
594     }
595     pred = e;
596     e = next;
597     }
598     }
599     }
600     }
601    
602     /**
603     * If lock is available, poll stale refs and remove them.
604     * Called from ForkJoinPool when pools become quiescent.
605     */
606     static final void helpExpungeStaleExceptions() {
607     final ReentrantLock lock = exceptionTableLock;
608     if (lock.tryLock()) {
609     try {
610     expungeStaleExceptions();
611     } finally {
612     lock.unlock();
613     }
614     }
615     }
616    
617     /**
618     * A version of "sneaky throw" to relay exceptions
619     */
620 dl 1.5 static void rethrow(Throwable ex) {
621     if (ex != null)
622     ForkJoinTask.<RuntimeException>uncheckedThrow(ex);
623 dl 1.1 }
624    
625     /**
626     * The sneaky part of sneaky throw, relying on generics
627     * limitations to evade compiler complaints about rethrowing
628     * unchecked exceptions
629     */
630     @SuppressWarnings("unchecked") static <T extends Throwable>
631 dl 1.5 void uncheckedThrow(Throwable t) throws T {
632     throw (T)t; // rely on vacuous cast
633 dl 1.1 }
634    
635     /**
636     * Throws exception, if any, associated with the given status.
637     */
638     private void reportException(int s) {
639     if (s == CANCELLED)
640     throw new CancellationException();
641     if (s == EXCEPTIONAL)
642     rethrow(getThrowableException());
643     }
644    
645     // public methods
646    
647     /**
648     * Arranges to asynchronously execute this task in the pool the
649     * current task is running in, if applicable, or using the {@link
650     * ForkJoinPool#commonPool()} if not {@link #inForkJoinPool}. While
651     * it is not necessarily enforced, it is a usage error to fork a
652     * task more than once unless it has completed and been
653     * reinitialized. Subsequent modifications to the state of this
654     * task or any data it operates on are not necessarily
655     * consistently observable by any thread other than the one
656     * executing it unless preceded by a call to {@link #join} or
657     * related methods, or a call to {@link #isDone} returning {@code
658     * true}.
659     *
660     * @return {@code this}, to simplify usage
661     */
662     public final ForkJoinTask<V> fork() {
663     Thread t;
664     if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread)
665     ((ForkJoinWorkerThread)t).workQueue.push(this);
666     else
667 dl 1.5 ForkJoinPool.common.externalPush(this);
668 dl 1.1 return this;
669     }
670    
671     /**
672     * Returns the result of the computation when it {@link #isDone is
673     * done}. This method differs from {@link #get()} in that
674     * abnormal completion results in {@code RuntimeException} or
675     * {@code Error}, not {@code ExecutionException}, and that
676     * interrupts of the calling thread do <em>not</em> cause the
677     * method to abruptly return by throwing {@code
678     * InterruptedException}.
679     *
680     * @return the computed result
681     */
682     public final V join() {
683     int s;
684     if ((s = doJoin() & DONE_MASK) != NORMAL)
685     reportException(s);
686     return getRawResult();
687     }
688    
689     /**
690     * Commences performing this task, awaits its completion if
691     * necessary, and returns its result, or throws an (unchecked)
692     * {@code RuntimeException} or {@code Error} if the underlying
693     * computation did so.
694     *
695     * @return the computed result
696     */
697     public final V invoke() {
698     int s;
699     if ((s = doInvoke() & DONE_MASK) != NORMAL)
700     reportException(s);
701     return getRawResult();
702     }
703    
704     /**
705     * Forks the given tasks, returning when {@code isDone} holds for
706     * each task or an (unchecked) exception is encountered, in which
707     * case the exception is rethrown. If more than one task
708     * encounters an exception, then this method throws any one of
709     * these exceptions. If any task encounters an exception, the
710     * other may be cancelled. However, the execution status of
711     * individual tasks is not guaranteed upon exceptional return. The
712     * status of each task may be obtained using {@link
713     * #getException()} and related methods to check if they have been
714     * cancelled, completed normally or exceptionally, or left
715     * unprocessed.
716     *
717     * @param t1 the first task
718     * @param t2 the second task
719     * @throws NullPointerException if any task is null
720     */
721     public static void invokeAll(ForkJoinTask<?> t1, ForkJoinTask<?> t2) {
722     int s1, s2;
723     t2.fork();
724     if ((s1 = t1.doInvoke() & DONE_MASK) != NORMAL)
725     t1.reportException(s1);
726     if ((s2 = t2.doJoin() & DONE_MASK) != NORMAL)
727     t2.reportException(s2);
728     }
729    
730     /**
731     * Forks the given tasks, returning when {@code isDone} holds for
732     * each task or an (unchecked) exception is encountered, in which
733     * case the exception is rethrown. If more than one task
734     * encounters an exception, then this method throws any one of
735     * these exceptions. If any task encounters an exception, others
736     * may be cancelled. However, the execution status of individual
737     * tasks is not guaranteed upon exceptional return. The status of
738     * each task may be obtained using {@link #getException()} and
739     * related methods to check if they have been cancelled, completed
740     * normally or exceptionally, or left unprocessed.
741     *
742     * @param tasks the tasks
743     * @throws NullPointerException if any task is null
744     */
745     public static void invokeAll(ForkJoinTask<?>... tasks) {
746     Throwable ex = null;
747     int last = tasks.length - 1;
748     for (int i = last; i >= 0; --i) {
749     ForkJoinTask<?> t = tasks[i];
750     if (t == null) {
751     if (ex == null)
752     ex = new NullPointerException();
753     }
754     else if (i != 0)
755     t.fork();
756     else if (t.doInvoke() < NORMAL && ex == null)
757     ex = t.getException();
758     }
759     for (int i = 1; i <= last; ++i) {
760     ForkJoinTask<?> t = tasks[i];
761     if (t != null) {
762     if (ex != null)
763     t.cancel(false);
764     else if (t.doJoin() < NORMAL)
765     ex = t.getException();
766     }
767     }
768     if (ex != null)
769     rethrow(ex);
770     }
771    
772     /**
773     * Forks all tasks in the specified collection, returning when
774     * {@code isDone} holds for each task or an (unchecked) exception
775     * is encountered, in which case the exception is rethrown. If
776     * more than one task encounters an exception, then this method
777     * throws any one of these exceptions. If any task encounters an
778     * exception, others may be cancelled. However, the execution
779     * status of individual tasks is not guaranteed upon exceptional
780     * return. The status of each task may be obtained using {@link
781     * #getException()} and related methods to check if they have been
782     * cancelled, completed normally or exceptionally, or left
783     * unprocessed.
784     *
785     * @param tasks the collection of tasks
786 jsr166 1.7 * @param <T> the type of the values returned from the tasks
787 dl 1.1 * @return the tasks argument, to simplify usage
788     * @throws NullPointerException if tasks or any element are null
789     */
790     public static <T extends ForkJoinTask<?>> Collection<T> invokeAll(Collection<T> tasks) {
791     if (!(tasks instanceof RandomAccess) || !(tasks instanceof List<?>)) {
792     invokeAll(tasks.toArray(new ForkJoinTask<?>[tasks.size()]));
793     return tasks;
794     }
795     @SuppressWarnings("unchecked")
796     List<? extends ForkJoinTask<?>> ts =
797     (List<? extends ForkJoinTask<?>>) tasks;
798     Throwable ex = null;
799     int last = ts.size() - 1;
800     for (int i = last; i >= 0; --i) {
801     ForkJoinTask<?> t = ts.get(i);
802     if (t == null) {
803     if (ex == null)
804     ex = new NullPointerException();
805     }
806     else if (i != 0)
807     t.fork();
808     else if (t.doInvoke() < NORMAL && ex == null)
809     ex = t.getException();
810     }
811     for (int i = 1; i <= last; ++i) {
812     ForkJoinTask<?> t = ts.get(i);
813     if (t != null) {
814     if (ex != null)
815     t.cancel(false);
816     else if (t.doJoin() < NORMAL)
817     ex = t.getException();
818     }
819     }
820     if (ex != null)
821     rethrow(ex);
822     return tasks;
823     }
824    
825     /**
826     * Attempts to cancel execution of this task. This attempt will
827     * fail if the task has already completed or could not be
828     * cancelled for some other reason. If successful, and this task
829     * has not started when {@code cancel} is called, execution of
830     * this task is suppressed. After this method returns
831     * successfully, unless there is an intervening call to {@link
832     * #reinitialize}, subsequent calls to {@link #isCancelled},
833     * {@link #isDone}, and {@code cancel} will return {@code true}
834     * and calls to {@link #join} and related methods will result in
835     * {@code CancellationException}.
836     *
837     * <p>This method may be overridden in subclasses, but if so, must
838     * still ensure that these properties hold. In particular, the
839     * {@code cancel} method itself must not throw exceptions.
840     *
841     * <p>This method is designed to be invoked by <em>other</em>
842     * tasks. To terminate the current task, you can just return or
843     * throw an unchecked exception from its computation method, or
844 dl 1.5 * invoke {@link #completeExceptionally(Throwable)}.
845 dl 1.1 *
846     * @param mayInterruptIfRunning this value has no effect in the
847     * default implementation because interrupts are not used to
848     * control cancellation.
849     *
850     * @return {@code true} if this task is now cancelled
851     */
852     public boolean cancel(boolean mayInterruptIfRunning) {
853     return (setCompletion(CANCELLED) & DONE_MASK) == CANCELLED;
854     }
855    
856     public final boolean isDone() {
857     return status < 0;
858     }
859    
860     public final boolean isCancelled() {
861     return (status & DONE_MASK) == CANCELLED;
862     }
863    
864     /**
865     * Returns {@code true} if this task threw an exception or was cancelled.
866     *
867     * @return {@code true} if this task threw an exception or was cancelled
868     */
869     public final boolean isCompletedAbnormally() {
870     return status < NORMAL;
871     }
872    
873     /**
874     * Returns {@code true} if this task completed without throwing an
875     * exception and was not cancelled.
876     *
877     * @return {@code true} if this task completed without throwing an
878     * exception and was not cancelled
879     */
880     public final boolean isCompletedNormally() {
881     return (status & DONE_MASK) == NORMAL;
882     }
883    
884     /**
885     * Returns the exception thrown by the base computation, or a
886     * {@code CancellationException} if cancelled, or {@code null} if
887     * none or if the method has not yet completed.
888     *
889     * @return the exception, or {@code null} if none
890     */
891     public final Throwable getException() {
892     int s = status & DONE_MASK;
893     return ((s >= NORMAL) ? null :
894     (s == CANCELLED) ? new CancellationException() :
895     getThrowableException());
896     }
897    
898     /**
899     * Completes this task abnormally, and if not already aborted or
900     * cancelled, causes it to throw the given exception upon
901     * {@code join} and related operations. This method may be used
902     * to induce exceptions in asynchronous tasks, or to force
903     * completion of tasks that would not otherwise complete. Its use
904     * in other situations is discouraged. This method is
905     * overridable, but overridden versions must invoke {@code super}
906     * implementation to maintain guarantees.
907     *
908     * @param ex the exception to throw. If this exception is not a
909     * {@code RuntimeException} or {@code Error}, the actual exception
910     * thrown will be a {@code RuntimeException} with cause {@code ex}.
911     */
912     public void completeExceptionally(Throwable ex) {
913     setExceptionalCompletion((ex instanceof RuntimeException) ||
914     (ex instanceof Error) ? ex :
915     new RuntimeException(ex));
916     }
917    
918     /**
919     * Completes this task, and if not already aborted or cancelled,
920     * returning the given value as the result of subsequent
921     * invocations of {@code join} and related operations. This method
922     * may be used to provide results for asynchronous tasks, or to
923     * provide alternative handling for tasks that would not otherwise
924     * complete normally. Its use in other situations is
925     * discouraged. This method is overridable, but overridden
926     * versions must invoke {@code super} implementation to maintain
927     * guarantees.
928     *
929     * @param value the result value for this task
930     */
931     public void complete(V value) {
932     try {
933     setRawResult(value);
934     } catch (Throwable rex) {
935     setExceptionalCompletion(rex);
936     return;
937     }
938     setCompletion(NORMAL);
939     }
940    
941     /**
942     * Completes this task normally without setting a value. The most
943     * recent value established by {@link #setRawResult} (or {@code
944     * null} by default) will be returned as the result of subsequent
945     * invocations of {@code join} and related operations.
946     *
947     * @since 1.8
948     */
949     public final void quietlyComplete() {
950     setCompletion(NORMAL);
951     }
952    
953     /**
954     * Waits if necessary for the computation to complete, and then
955     * retrieves its result.
956     *
957     * @return the computed result
958     * @throws CancellationException if the computation was cancelled
959     * @throws ExecutionException if the computation threw an
960     * exception
961     * @throws InterruptedException if the current thread is not a
962     * member of a ForkJoinPool and was interrupted while waiting
963     */
964     public final V get() throws InterruptedException, ExecutionException {
965     int s = (Thread.currentThread() instanceof ForkJoinWorkerThread) ?
966     doJoin() : externalInterruptibleAwaitDone();
967     Throwable ex;
968     if ((s &= DONE_MASK) == CANCELLED)
969     throw new CancellationException();
970     if (s == EXCEPTIONAL && (ex = getThrowableException()) != null)
971     throw new ExecutionException(ex);
972     return getRawResult();
973     }
974    
975     /**
976     * Waits if necessary for at most the given time for the computation
977     * to complete, and then retrieves its result, if available.
978     *
979     * @param timeout the maximum time to wait
980     * @param unit the time unit of the timeout argument
981     * @return the computed result
982     * @throws CancellationException if the computation was cancelled
983     * @throws ExecutionException if the computation threw an
984     * exception
985     * @throws InterruptedException if the current thread is not a
986     * member of a ForkJoinPool and was interrupted while waiting
987     * @throws TimeoutException if the wait timed out
988     */
989     public final V get(long timeout, TimeUnit unit)
990     throws InterruptedException, ExecutionException, TimeoutException {
991     if (Thread.interrupted())
992     throw new InterruptedException();
993     // Messy in part because we measure in nanosecs, but wait in millisecs
994 jsr166 1.3 int s; long ms;
995     long ns = unit.toNanos(timeout);
996 dl 1.5 ForkJoinPool cp;
997 jsr166 1.3 if ((s = status) >= 0 && ns > 0L) {
998 dl 1.1 long deadline = System.nanoTime() + ns;
999     ForkJoinPool p = null;
1000     ForkJoinPool.WorkQueue w = null;
1001     Thread t = Thread.currentThread();
1002     if (t instanceof ForkJoinWorkerThread) {
1003     ForkJoinWorkerThread wt = (ForkJoinWorkerThread)t;
1004     p = wt.pool;
1005     w = wt.workQueue;
1006     p.helpJoinOnce(w, this); // no retries on failure
1007     }
1008 dl 1.5 else if ((cp = ForkJoinPool.common) != null) {
1009     if (this instanceof CountedCompleter)
1010     cp.externalHelpComplete((CountedCompleter<?>)this);
1011     else if (cp.tryExternalUnpush(this))
1012     doExec();
1013     }
1014 dl 1.1 boolean canBlock = false;
1015     boolean interrupted = false;
1016     try {
1017     while ((s = status) >= 0) {
1018     if (w != null && w.qlock < 0)
1019     cancelIgnoringExceptions(this);
1020     else if (!canBlock) {
1021 dl 1.5 if (p == null || p.tryCompensate(p.ctl))
1022 dl 1.1 canBlock = true;
1023     }
1024     else {
1025     if ((ms = TimeUnit.NANOSECONDS.toMillis(ns)) > 0L &&
1026     U.compareAndSwapInt(this, STATUS, s, s | SIGNAL)) {
1027     synchronized (this) {
1028     if (status >= 0) {
1029     try {
1030     wait(ms);
1031     } catch (InterruptedException ie) {
1032     if (p == null)
1033     interrupted = true;
1034     }
1035     }
1036     else
1037     notifyAll();
1038     }
1039     }
1040     if ((s = status) < 0 || interrupted ||
1041     (ns = deadline - System.nanoTime()) <= 0L)
1042     break;
1043     }
1044     }
1045     } finally {
1046     if (p != null && canBlock)
1047     p.incrementActiveCount();
1048     }
1049     if (interrupted)
1050     throw new InterruptedException();
1051     }
1052     if ((s &= DONE_MASK) != NORMAL) {
1053     Throwable ex;
1054     if (s == CANCELLED)
1055     throw new CancellationException();
1056     if (s != EXCEPTIONAL)
1057     throw new TimeoutException();
1058     if ((ex = getThrowableException()) != null)
1059     throw new ExecutionException(ex);
1060     }
1061     return getRawResult();
1062     }
1063    
1064     /**
1065     * Joins this task, without returning its result or throwing its
1066     * exception. This method may be useful when processing
1067     * collections of tasks when some have been cancelled or otherwise
1068     * known to have aborted.
1069     */
1070     public final void quietlyJoin() {
1071     doJoin();
1072     }
1073    
1074     /**
1075     * Commences performing this task and awaits its completion if
1076     * necessary, without returning its result or throwing its
1077     * exception.
1078     */
1079     public final void quietlyInvoke() {
1080     doInvoke();
1081     }
1082    
1083     /**
1084     * Possibly executes tasks until the pool hosting the current task
1085     * {@link ForkJoinPool#isQuiescent is quiescent}. This method may
1086     * be of use in designs in which many tasks are forked, but none
1087     * are explicitly joined, instead executing them until all are
1088     * processed.
1089     */
1090     public static void helpQuiesce() {
1091     Thread t;
1092     if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) {
1093     ForkJoinWorkerThread wt = (ForkJoinWorkerThread)t;
1094     wt.pool.helpQuiescePool(wt.workQueue);
1095     }
1096     else
1097 dl 1.5 ForkJoinPool.quiesceCommonPool();
1098 dl 1.1 }
1099    
1100     /**
1101     * Resets the internal bookkeeping state of this task, allowing a
1102     * subsequent {@code fork}. This method allows repeated reuse of
1103     * this task, but only if reuse occurs when this task has either
1104     * never been forked, or has been forked, then completed and all
1105     * outstanding joins of this task have also completed. Effects
1106     * under any other usage conditions are not guaranteed.
1107     * This method may be useful when executing
1108     * pre-constructed trees of subtasks in loops.
1109     *
1110     * <p>Upon completion of this method, {@code isDone()} reports
1111     * {@code false}, and {@code getException()} reports {@code
1112     * null}. However, the value returned by {@code getRawResult} is
1113     * unaffected. To clear this value, you can invoke {@code
1114     * setRawResult(null)}.
1115     */
1116     public void reinitialize() {
1117     if ((status & DONE_MASK) == EXCEPTIONAL)
1118     clearExceptionalCompletion();
1119     else
1120     status = 0;
1121     }
1122    
1123     /**
1124     * Returns the pool hosting the current task execution, or null
1125     * if this task is executing outside of any ForkJoinPool.
1126     *
1127     * @see #inForkJoinPool
1128     * @return the pool, or {@code null} if none
1129     */
1130     public static ForkJoinPool getPool() {
1131     Thread t = Thread.currentThread();
1132     return (t instanceof ForkJoinWorkerThread) ?
1133     ((ForkJoinWorkerThread) t).pool : null;
1134     }
1135    
1136     /**
1137     * Returns {@code true} if the current thread is a {@link
1138     * ForkJoinWorkerThread} executing as a ForkJoinPool computation.
1139     *
1140     * @return {@code true} if the current thread is a {@link
1141     * ForkJoinWorkerThread} executing as a ForkJoinPool computation,
1142     * or {@code false} otherwise
1143     */
1144     public static boolean inForkJoinPool() {
1145     return Thread.currentThread() instanceof ForkJoinWorkerThread;
1146     }
1147    
1148     /**
1149     * Tries to unschedule this task for execution. This method will
1150     * typically (but is not guaranteed to) succeed if this task is
1151     * the most recently forked task by the current thread, and has
1152     * not commenced executing in another thread. This method may be
1153     * useful when arranging alternative local processing of tasks
1154     * that could have been, but were not, stolen.
1155     *
1156     * @return {@code true} if unforked
1157     */
1158     public boolean tryUnfork() {
1159     Thread t;
1160     return (((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ?
1161     ((ForkJoinWorkerThread)t).workQueue.tryUnpush(this) :
1162 dl 1.5 ForkJoinPool.common.tryExternalUnpush(this));
1163 dl 1.1 }
1164    
1165     /**
1166     * Returns an estimate of the number of tasks that have been
1167     * forked by the current worker thread but not yet executed. This
1168     * value may be useful for heuristic decisions about whether to
1169     * fork other tasks.
1170     *
1171     * @return the number of tasks
1172     */
1173     public static int getQueuedTaskCount() {
1174     Thread t; ForkJoinPool.WorkQueue q;
1175     if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread)
1176     q = ((ForkJoinWorkerThread)t).workQueue;
1177     else
1178     q = ForkJoinPool.commonSubmitterQueue();
1179     return (q == null) ? 0 : q.queueSize();
1180     }
1181    
1182     /**
1183     * Returns an estimate of how many more locally queued tasks are
1184     * held by the current worker thread than there are other worker
1185     * threads that might steal them, or zero if this thread is not
1186     * operating in a ForkJoinPool. This value may be useful for
1187     * heuristic decisions about whether to fork other tasks. In many
1188     * usages of ForkJoinTasks, at steady state, each worker should
1189     * aim to maintain a small constant surplus (for example, 3) of
1190     * tasks, and to process computations locally if this threshold is
1191     * exceeded.
1192     *
1193     * @return the surplus number of tasks, which may be negative
1194     */
1195     public static int getSurplusQueuedTaskCount() {
1196     return ForkJoinPool.getSurplusQueuedTaskCount();
1197     }
1198    
1199     // Extension methods
1200    
1201     /**
1202     * Returns the result that would be returned by {@link #join}, even
1203     * if this task completed abnormally, or {@code null} if this task
1204     * is not known to have been completed. This method is designed
1205     * to aid debugging, as well as to support extensions. Its use in
1206     * any other context is discouraged.
1207     *
1208     * @return the result, or {@code null} if not completed
1209     */
1210     public abstract V getRawResult();
1211    
1212     /**
1213     * Forces the given value to be returned as a result. This method
1214     * is designed to support extensions, and should not in general be
1215     * called otherwise.
1216     *
1217     * @param value the value
1218     */
1219     protected abstract void setRawResult(V value);
1220    
1221     /**
1222     * Immediately performs the base action of this task and returns
1223     * true if, upon return from this method, this task is guaranteed
1224     * to have completed normally. This method may return false
1225     * otherwise, to indicate that this task is not necessarily
1226     * complete (or is not known to be complete), for example in
1227     * asynchronous actions that require explicit invocations of
1228     * completion methods. This method may also throw an (unchecked)
1229     * exception to indicate abnormal exit. This method is designed to
1230     * support extensions, and should not in general be called
1231     * otherwise.
1232     *
1233     * @return {@code true} if this task is known to have completed normally
1234     */
1235     protected abstract boolean exec();
1236    
1237     /**
1238     * Returns, but does not unschedule or execute, a task queued by
1239     * the current thread but not yet executed, if one is immediately
1240     * available. There is no guarantee that this task will actually
1241     * be polled or executed next. Conversely, this method may return
1242     * null even if a task exists but cannot be accessed without
1243     * contention with other threads. This method is designed
1244     * primarily to support extensions, and is unlikely to be useful
1245     * otherwise.
1246     *
1247     * @return the next task, or {@code null} if none are available
1248     */
1249     protected static ForkJoinTask<?> peekNextLocalTask() {
1250     Thread t; ForkJoinPool.WorkQueue q;
1251     if ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread)
1252     q = ((ForkJoinWorkerThread)t).workQueue;
1253     else
1254     q = ForkJoinPool.commonSubmitterQueue();
1255     return (q == null) ? null : q.peek();
1256     }
1257    
1258     /**
1259     * Unschedules and returns, without executing, the next task
1260     * queued by the current thread but not yet executed, if the
1261     * current thread is operating in a ForkJoinPool. This method is
1262     * designed primarily to support extensions, and is unlikely to be
1263     * useful otherwise.
1264     *
1265     * @return the next task, or {@code null} if none are available
1266     */
1267     protected static ForkJoinTask<?> pollNextLocalTask() {
1268     Thread t;
1269     return ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ?
1270     ((ForkJoinWorkerThread)t).workQueue.nextLocalTask() :
1271     null;
1272     }
1273    
1274     /**
1275     * If the current thread is operating in a ForkJoinPool,
1276     * unschedules and returns, without executing, the next task
1277     * queued by the current thread but not yet executed, if one is
1278     * available, or if not available, a task that was forked by some
1279     * other thread, if available. Availability may be transient, so a
1280     * {@code null} result does not necessarily imply quiescence of
1281     * the pool this task is operating in. This method is designed
1282     * primarily to support extensions, and is unlikely to be useful
1283     * otherwise.
1284     *
1285     * @return a task, or {@code null} if none are available
1286     */
1287     protected static ForkJoinTask<?> pollTask() {
1288     Thread t; ForkJoinWorkerThread wt;
1289     return ((t = Thread.currentThread()) instanceof ForkJoinWorkerThread) ?
1290     (wt = (ForkJoinWorkerThread)t).pool.nextTaskFor(wt.workQueue) :
1291     null;
1292     }
1293    
1294     // tag operations
1295    
1296     /**
1297     * Returns the tag for this task.
1298     *
1299     * @return the tag for this task
1300     * @since 1.8
1301     */
1302     public final short getForkJoinTaskTag() {
1303     return (short)status;
1304     }
1305    
1306     /**
1307     * Atomically sets the tag value for this task.
1308     *
1309     * @param tag the tag value
1310     * @return the previous value of the tag
1311     * @since 1.8
1312     */
1313     public final short setForkJoinTaskTag(short tag) {
1314     for (int s;;) {
1315     if (U.compareAndSwapInt(this, STATUS, s = status,
1316     (s & ~SMASK) | (tag & SMASK)))
1317     return (short)s;
1318     }
1319     }
1320    
1321     /**
1322     * Atomically conditionally sets the tag value for this task.
1323     * Among other applications, tags can be used as visit markers
1324     * in tasks operating on graphs, as in methods that check: {@code
1325     * if (task.compareAndSetForkJoinTaskTag((short)0, (short)1))}
1326     * before processing, otherwise exiting because the node has
1327     * already been visited.
1328     *
1329     * @param e the expected tag value
1330     * @param tag the new tag value
1331 dl 1.5 * @return {@code true} if successful; i.e., the current value was
1332 dl 1.1 * equal to e and is now tag.
1333     * @since 1.8
1334     */
1335     public final boolean compareAndSetForkJoinTaskTag(short e, short tag) {
1336     for (int s;;) {
1337     if ((short)(s = status) != e)
1338     return false;
1339     if (U.compareAndSwapInt(this, STATUS, s,
1340     (s & ~SMASK) | (tag & SMASK)))
1341     return true;
1342     }
1343     }
1344    
1345     /**
1346     * Adaptor for Runnables. This implements RunnableFuture
1347     * to be compliant with AbstractExecutorService constraints
1348     * when used in ForkJoinPool.
1349     */
1350     static final class AdaptedRunnable<T> extends ForkJoinTask<T>
1351     implements RunnableFuture<T> {
1352     final Runnable runnable;
1353     T result;
1354     AdaptedRunnable(Runnable runnable, T result) {
1355     if (runnable == null) throw new NullPointerException();
1356     this.runnable = runnable;
1357     this.result = result; // OK to set this even before completion
1358     }
1359     public final T getRawResult() { return result; }
1360     public final void setRawResult(T v) { result = v; }
1361     public final boolean exec() { runnable.run(); return true; }
1362     public final void run() { invoke(); }
1363     private static final long serialVersionUID = 5232453952276885070L;
1364     }
1365    
1366     /**
1367     * Adaptor for Runnables without results
1368     */
1369     static final class AdaptedRunnableAction extends ForkJoinTask<Void>
1370     implements RunnableFuture<Void> {
1371     final Runnable runnable;
1372     AdaptedRunnableAction(Runnable runnable) {
1373     if (runnable == null) throw new NullPointerException();
1374     this.runnable = runnable;
1375     }
1376     public final Void getRawResult() { return null; }
1377     public final void setRawResult(Void v) { }
1378     public final boolean exec() { runnable.run(); return true; }
1379     public final void run() { invoke(); }
1380     private static final long serialVersionUID = 5232453952276885070L;
1381     }
1382    
1383     /**
1384 dl 1.5 * Adaptor for Runnables in which failure forces worker exception
1385     */
1386     static final class RunnableExecuteAction extends ForkJoinTask<Void> {
1387     final Runnable runnable;
1388     RunnableExecuteAction(Runnable runnable) {
1389     if (runnable == null) throw new NullPointerException();
1390     this.runnable = runnable;
1391     }
1392     public final Void getRawResult() { return null; }
1393     public final void setRawResult(Void v) { }
1394     public final boolean exec() { runnable.run(); return true; }
1395     void internalPropagateException(Throwable ex) {
1396     rethrow(ex); // rethrow outside exec() catches.
1397     }
1398     private static final long serialVersionUID = 5232453952276885070L;
1399     }
1400    
1401     /**
1402 dl 1.1 * Adaptor for Callables
1403     */
1404     static final class AdaptedCallable<T> extends ForkJoinTask<T>
1405     implements RunnableFuture<T> {
1406     final Callable<? extends T> callable;
1407     T result;
1408     AdaptedCallable(Callable<? extends T> callable) {
1409     if (callable == null) throw new NullPointerException();
1410     this.callable = callable;
1411     }
1412     public final T getRawResult() { return result; }
1413     public final void setRawResult(T v) { result = v; }
1414     public final boolean exec() {
1415     try {
1416     result = callable.call();
1417     return true;
1418     } catch (Error err) {
1419     throw err;
1420     } catch (RuntimeException rex) {
1421     throw rex;
1422     } catch (Exception ex) {
1423     throw new RuntimeException(ex);
1424     }
1425     }
1426     public final void run() { invoke(); }
1427     private static final long serialVersionUID = 2838392045355241008L;
1428     }
1429    
1430     /**
1431     * Returns a new {@code ForkJoinTask} that performs the {@code run}
1432     * method of the given {@code Runnable} as its action, and returns
1433     * a null result upon {@link #join}.
1434     *
1435     * @param runnable the runnable action
1436     * @return the task
1437     */
1438     public static ForkJoinTask<?> adapt(Runnable runnable) {
1439     return new AdaptedRunnableAction(runnable);
1440     }
1441    
1442     /**
1443     * Returns a new {@code ForkJoinTask} that performs the {@code run}
1444     * method of the given {@code Runnable} as its action, and returns
1445     * the given result upon {@link #join}.
1446     *
1447     * @param runnable the runnable action
1448     * @param result the result upon completion
1449 jsr166 1.7 * @param <T> the type of the result
1450 dl 1.1 * @return the task
1451     */
1452     public static <T> ForkJoinTask<T> adapt(Runnable runnable, T result) {
1453     return new AdaptedRunnable<T>(runnable, result);
1454     }
1455    
1456     /**
1457     * Returns a new {@code ForkJoinTask} that performs the {@code call}
1458     * method of the given {@code Callable} as its action, and returns
1459     * its result upon {@link #join}, translating any checked exceptions
1460     * encountered into {@code RuntimeException}.
1461     *
1462     * @param callable the callable action
1463 jsr166 1.7 * @param <T> the type of the callable's result
1464 dl 1.1 * @return the task
1465     */
1466     public static <T> ForkJoinTask<T> adapt(Callable<? extends T> callable) {
1467     return new AdaptedCallable<T>(callable);
1468     }
1469    
1470     // Serialization support
1471    
1472     private static final long serialVersionUID = -7721805057305804111L;
1473    
1474     /**
1475     * Saves this task to a stream (that is, serializes it).
1476     *
1477     * @serialData the current run status and the exception thrown
1478     * during execution, or {@code null} if none
1479     */
1480     private void writeObject(java.io.ObjectOutputStream s)
1481     throws java.io.IOException {
1482     s.defaultWriteObject();
1483     s.writeObject(getException());
1484     }
1485    
1486     /**
1487     * Reconstitutes this task from a stream (that is, deserializes it).
1488     */
1489     private void readObject(java.io.ObjectInputStream s)
1490     throws java.io.IOException, ClassNotFoundException {
1491     s.defaultReadObject();
1492     Object ex = s.readObject();
1493     if (ex != null)
1494     setExceptionalCompletion((Throwable)ex);
1495     }
1496    
1497     // Unsafe mechanics
1498     private static final sun.misc.Unsafe U;
1499     private static final long STATUS;
1500    
1501     static {
1502     exceptionTableLock = new ReentrantLock();
1503     exceptionTableRefQueue = new ReferenceQueue<Object>();
1504     exceptionTable = new ExceptionNode[EXCEPTION_MAP_CAPACITY];
1505     try {
1506     U = sun.misc.Unsafe.getUnsafe();
1507     Class<?> k = ForkJoinTask.class;
1508     STATUS = U.objectFieldOffset
1509     (k.getDeclaredField("status"));
1510     } catch (Exception e) {
1511     throw new Error(e);
1512     }
1513     }
1514     }