ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/jsr166e/ForkJoinTask.java
Revision: 1.19
Committed: Thu Jun 30 14:17:04 2016 UTC (7 years, 9 months ago) by jsr166
Branch: MAIN
CVS Tags: HEAD
Changes since 1.18: +1 -1 lines
Log Message:
fix typo reported by Ivan Gerasimov

File Contents

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