A {@code ForkJoinPool} differs from other kinds of {@link
* ExecutorService} mainly by virtue of employing
* work-stealing: all threads in the pool attempt to find and
- * execute subtasks created by other active tasks (eventually blocking
- * waiting for work if none exist). This enables efficient processing
- * when most tasks spawn other subtasks (as do most {@code
- * ForkJoinTask}s). When setting asyncMode to true in
- * constructors, {@code ForkJoinPool}s may also be appropriate for use
- * with event-style tasks that are never joined.
+ * execute tasks submitted to the pool and/or created by other active
+ * tasks (eventually blocking waiting for work if none exist). This
+ * enables efficient processing when most tasks spawn other subtasks
+ * (as do most {@code ForkJoinTask}s), as well as when many small
+ * tasks are submitted to the pool from external clients. Especially
+ * when setting asyncMode to true in constructors, {@code
+ * ForkJoinPool}s may also be appropriate for use with event-style
+ * tasks that are never joined.
*
*
A {@code ForkJoinPool} is constructed with a given target
* parallelism level; by default, equal to the number of available
@@ -52,15 +60,16 @@ import java.util.concurrent.CountDownLat
* convenient form for informal monitoring.
*
*
As is the case with other ExecutorServices, there are three
- * main task execution methods summarized in the following
- * table. These are designed to be used by clients not already engaged
- * in fork/join computations in the current pool. The main forms of
- * these methods accept instances of {@code ForkJoinTask}, but
- * overloaded forms also allow mixed execution of plain {@code
+ * main task execution methods summarized in the following table.
+ * These are designed to be used primarily by clients not already
+ * engaged in fork/join computations in the current pool. The main
+ * forms of these methods accept instances of {@code ForkJoinTask},
+ * but overloaded forms also allow mixed execution of plain {@code
* Runnable}- or {@code Callable}- based activities as well. However,
- * tasks that are already executing in a pool should normally
- * NOT use these pool execution methods, but instead use the
- * within-computation forms listed in the table.
+ * tasks that are already executing in a pool should normally instead
+ * use the within-computation forms listed in the table unless using
+ * async event-style tasks that are not usually joined, in which case
+ * there is little difference among choice of methods.
*
*
*
@@ -69,7 +78,7 @@ import java.util.concurrent.CountDownLat
* | Call from within fork/join computations |
*
*
- * | Arange async execution |
+ * Arrange async execution |
* {@link #execute(ForkJoinTask)} |
* {@link ForkJoinTask#fork} |
*
@@ -95,13 +104,12 @@ import java.util.concurrent.CountDownLat
* daemon} mode, there is typically no need to explicitly {@link
* #shutdown} such a pool upon program exit.
*
- *
+ * {@code
* static final ForkJoinPool mainPool = new ForkJoinPool();
* ...
* public void sort(long[] array) {
* mainPool.invoke(new SortTask(array, 0, array.length));
- * }
- *
+ * }}
*
* Implementation notes: This implementation restricts the
* maximum number of running threads to 32767. Attempts to create
@@ -120,245 +128,325 @@ public class ForkJoinPool extends Abstra
/*
* Implementation Overview
*
- * This class provides the central bookkeeping and control for a
- * set of worker threads: Submissions from non-FJ threads enter
- * into a submission queue. Workers take these tasks and typically
- * split them into subtasks that may be stolen by other workers.
- * The main work-stealing mechanics implemented in class
- * ForkJoinWorkerThread give first priority to processing tasks
- * from their own queues (LIFO or FIFO, depending on mode), then
- * to randomized FIFO steals of tasks in other worker queues, and
- * lastly to new submissions. These mechanics do not consider
- * affinities, loads, cache localities, etc, so rarely provide the
- * best possible performance on a given machine, but portably
- * provide good throughput by averaging over these factors.
- * (Further, even if we did try to use such information, we do not
- * usually have a basis for exploiting it. For example, some sets
- * of tasks profit from cache affinities, but others are harmed by
- * cache pollution effects.)
- *
- * Beyond work-stealing support and essential bookkeeping, the
- * main responsibility of this framework is to take actions when
- * one worker is waiting to join a task stolen (or always held by)
- * another. Becauae we are multiplexing many tasks on to a pool
- * of workers, we can't just let them block (as in Thread.join).
- * We also cannot just reassign the joiner's run-time stack with
- * another and replace it later, which would be a form of
- * "continuation", that even if possible is not necessarily a good
- * idea. Given that the creation costs of most threads on most
- * systems mainly surrounds setting up runtime stacks, thread
- * creation and switching is usually not much more expensive than
- * stack creation and switching, and is more flexible). Instead we
- * combine two tactics:
+ * This class and its nested classes provide the main
+ * functionality and control for a set of worker threads:
+ * Submissions from non-FJ threads enter into submission queues.
+ * Workers take these tasks and typically split them into subtasks
+ * that may be stolen by other workers. Preference rules give
+ * first priority to processing tasks from their own queues (LIFO
+ * or FIFO, depending on mode), then to randomized FIFO steals of
+ * tasks in other queues.
+ *
+ * WorkQueues
+ * ==========
+ *
+ * Most operations occur within work-stealing queues (in nested
+ * class WorkQueue). These are special forms of Deques that
+ * support only three of the four possible end-operations -- push,
+ * pop, and poll (aka steal), under the further constraints that
+ * push and pop are called only from the owning thread (or, as
+ * extended here, under a lock), while poll may be called from
+ * other threads. (If you are unfamiliar with them, you probably
+ * want to read Herlihy and Shavit's book "The Art of
+ * Multiprocessor programming", chapter 16 describing these in
+ * more detail before proceeding.) The main work-stealing queue
+ * design is roughly similar to those in the papers "Dynamic
+ * Circular Work-Stealing Deque" by Chase and Lev, SPAA 2005
+ * (http://research.sun.com/scalable/pubs/index.html) and
+ * "Idempotent work stealing" by Michael, Saraswat, and Vechev,
+ * PPoPP 2009 (http://portal.acm.org/citation.cfm?id=1504186).
+ * The main differences ultimately stem from GC requirements that
+ * we null out taken slots as soon as we can, to maintain as small
+ * a footprint as possible even in programs generating huge
+ * numbers of tasks. To accomplish this, we shift the CAS
+ * arbitrating pop vs poll (steal) from being on the indices
+ * ("base" and "top") to the slots themselves. So, both a
+ * successful pop and poll mainly entail a CAS of a slot from
+ * non-null to null. Because we rely on CASes of references, we
+ * do not need tag bits on base or top. They are simple ints as
+ * used in any circular array-based queue (see for example
+ * ArrayDeque). Updates to the indices must still be ordered in a
+ * way that guarantees that top == base means the queue is empty,
+ * but otherwise may err on the side of possibly making the queue
+ * appear nonempty when a push, pop, or poll have not fully
+ * committed. Note that this means that the poll operation,
+ * considered individually, is not wait-free. One thief cannot
+ * successfully continue until another in-progress one (or, if
+ * previously empty, a push) completes. However, in the
+ * aggregate, we ensure at least probabilistic non-blockingness.
+ * If an attempted steal fails, a thief always chooses a different
+ * random victim target to try next. So, in order for one thief to
+ * progress, it suffices for any in-progress poll or new push on
+ * any empty queue to complete.
+ *
+ * This approach also enables support of a user mode in which local
+ * task processing is in FIFO, not LIFO order, simply by using
+ * poll rather than pop. This can be useful in message-passing
+ * frameworks in which tasks are never joined. However neither
+ * mode considers affinities, loads, cache localities, etc, so
+ * rarely provide the best possible performance on a given
+ * machine, but portably provide good throughput by averaging over
+ * these factors. (Further, even if we did try to use such
+ * information, we do not usually have a basis for exploiting it.
+ * For example, some sets of tasks profit from cache affinities,
+ * but others are harmed by cache pollution effects.)
+ *
+ * WorkQueues are also used in a similar way for tasks submitted
+ * to the pool. We cannot mix these tasks in the same queues used
+ * for work-stealing (this would contaminate lifo/fifo
+ * processing). Instead, we loosely associate submission queues
+ * with submitting threads, using a form of hashing. The
+ * ThreadLocal Submitter class contains a value initially used as
+ * a hash code for choosing existing queues, but may be randomly
+ * repositioned upon contention with other submitters. In
+ * essence, submitters act like workers except that they never
+ * take tasks, and they are multiplexed on to a finite number of
+ * shared work queues. However, classes are set up so that future
+ * extensions could allow submitters to optionally help perform
+ * tasks as well. Pool submissions from internal workers are also
+ * allowed, but use randomized rather than thread-hashed queue
+ * indices to avoid imbalance. Insertion of tasks in shared mode
+ * requires a lock (mainly to protect in the case of resizing) but
+ * we use only a simple spinlock (using bits in field runState),
+ * because submitters encountering a busy queue try or create
+ * others so never block.
+ *
+ * Management
+ * ==========
+ *
+ * The main throughput advantages of work-stealing stem from
+ * decentralized control -- workers mostly take tasks from
+ * themselves or each other. We cannot negate this in the
+ * implementation of other management responsibilities. The main
+ * tactic for avoiding bottlenecks is packing nearly all
+ * essentially atomic control state into two volatile variables
+ * that are by far most often read (not written) as status and
+ * consistency checks.
+ *
+ * Field "ctl" contains 64 bits holding all the information needed
+ * to atomically decide to add, inactivate, enqueue (on an event
+ * queue), dequeue, and/or re-activate workers. To enable this
+ * packing, we restrict maximum parallelism to (1<<15)-1 (which is
+ * far in excess of normal operating range) to allow ids, counts,
+ * and their negations (used for thresholding) to fit into 16bit
+ * fields.
+ *
+ * Field "runState" contains 32 bits needed to register and
+ * deregister WorkQueues, as well as to enable shutdown. It is
+ * only modified under a lock (normally briefly held, but
+ * occasionally protecting allocations and resizings) but even
+ * when locked remains available to check consistency.
+ *
+ * Recording WorkQueues. WorkQueues are recorded in the
+ * "workQueues" array that is created upon pool construction and
+ * expanded if necessary. Updates to the array while recording
+ * new workers and unrecording terminated ones are protected from
+ * each other by a lock but the array is otherwise concurrently
+ * readable, and accessed directly. To simplify index-based
+ * operations, the array size is always a power of two, and all
+ * readers must tolerate null slots. Shared (submission) queues
+ * are at even indices, worker queues at odd indices. Grouping
+ * them together in this way simplifies and speeds up task
+ * scanning. To avoid flailing during start-up, the array is
+ * presized to hold twice #parallelism workers (which is unlikely
+ * to need further resizing during execution). But to avoid
+ * dealing with so many null slots, variable runState includes a
+ * mask for the nearest power of two that contains all current
+ * workers. All worker thread creation is on-demand, triggered by
+ * task submissions, replacement of terminated workers, and/or
+ * compensation for blocked workers. However, all other support
+ * code is set up to work with other policies. To ensure that we
+ * do not hold on to worker references that would prevent GC, ALL
+ * accesses to workQueues are via indices into the workQueues
+ * array (which is one source of some of the messy code
+ * constructions here). In essence, the workQueues array serves as
+ * a weak reference mechanism. Thus for example the wait queue
+ * field of ctl stores indices, not references. Access to the
+ * workQueues in associated methods (for example signalWork) must
+ * both index-check and null-check the IDs. All such accesses
+ * ignore bad IDs by returning out early from what they are doing,
+ * since this can only be associated with termination, in which
+ * case it is OK to give up.
+ *
+ * All uses of the workQueues array check that it is non-null
+ * (even if previously non-null). This allows nulling during
+ * termination, which is currently not necessary, but remains an
+ * option for resource-revocation-based shutdown schemes. It also
+ * helps reduce JIT issuance of uncommon-trap code, which tends to
+ * unnecessarily complicate control flow in some methods.
+ *
+ * Event Queuing. Unlike HPC work-stealing frameworks, we cannot
+ * let workers spin indefinitely scanning for tasks when none can
+ * be found immediately, and we cannot start/resume workers unless
+ * there appear to be tasks available. On the other hand, we must
+ * quickly prod them into action when new tasks are submitted or
+ * generated. In many usages, ramp-up time to activate workers is
+ * the main limiting factor in overall performance (this is
+ * compounded at program start-up by JIT compilation and
+ * allocation). So we try to streamline this as much as possible.
+ * We park/unpark workers after placing in an event wait queue
+ * when they cannot find work. This "queue" is actually a simple
+ * Treiber stack, headed by the "id" field of ctl, plus a 15bit
+ * counter value (that reflects the number of times a worker has
+ * been inactivated) to avoid ABA effects (we need only as many
+ * version numbers as worker threads). Successors are held in
+ * field WorkQueue.nextWait. Queuing deals with several intrinsic
+ * races, mainly that a task-producing thread can miss seeing (and
+ * signalling) another thread that gave up looking for work but
+ * has not yet entered the wait queue. We solve this by requiring
+ * a full sweep of all workers (via repeated calls to method
+ * scan()) both before and after a newly waiting worker is added
+ * to the wait queue. During a rescan, the worker might release
+ * some other queued worker rather than itself, which has the same
+ * net effect. Because enqueued workers may actually be rescanning
+ * rather than waiting, we set and clear the "parker" field of
+ * WorkQueues to reduce unnecessary calls to unpark. (This
+ * requires a secondary recheck to avoid missed signals.) Note
+ * the unusual conventions about Thread.interrupts surrounding
+ * parking and other blocking: Because interrupts are used solely
+ * to alert threads to check termination, which is checked anyway
+ * upon blocking, we clear status (using Thread.interrupted)
+ * before any call to park, so that park does not immediately
+ * return due to status being set via some other unrelated call to
+ * interrupt in user code.
+ *
+ * Signalling. We create or wake up workers only when there
+ * appears to be at least one task they might be able to find and
+ * execute. When a submission is added or another worker adds a
+ * task to a queue that previously had fewer than two tasks, they
+ * signal waiting workers (or trigger creation of new ones if
+ * fewer than the given parallelism level -- see signalWork).
+ * These primary signals are buttressed by signals during rescans;
+ * together these cover the signals needed in cases when more
+ * tasks are pushed but untaken, and improve performance compared
+ * to having one thread wake up all workers.
+ *
+ * Trimming workers. To release resources after periods of lack of
+ * use, a worker starting to wait when the pool is quiescent will
+ * time out and terminate if the pool has remained quiescent for
+ * SHRINK_RATE nanosecs. This will slowly propagate, eventually
+ * terminating all workers after long periods of non-use.
+ *
+ * Shutdown and Termination. A call to shutdownNow atomically sets
+ * a runState bit and then (non-atomically) sets each worker's
+ * runState status, cancels all unprocessed tasks, and wakes up
+ * all waiting workers. Detecting whether termination should
+ * commence after a non-abrupt shutdown() call requires more work
+ * and bookkeeping. We need consensus about quiescence (i.e., that
+ * there is no more work). The active count provides a primary
+ * indication but non-abrupt shutdown still requires a rechecking
+ * scan for any workers that are inactive but not queued.
+ *
+ * Joining Tasks
+ * =============
+ *
+ * Any of several actions may be taken when one worker is waiting
+ * to join a task stolen (or always held) by another. Because we
+ * are multiplexing many tasks on to a pool of workers, we can't
+ * just let them block (as in Thread.join). We also cannot just
+ * reassign the joiner's run-time stack with another and replace
+ * it later, which would be a form of "continuation", that even if
+ * possible is not necessarily a good idea since we sometimes need
+ * both an unblocked task and its continuation to progress.
+ * Instead we combine two tactics:
*
* Helping: Arranging for the joiner to execute some task that it
- * would be running if the steal had not occurred. Method
- * ForkJoinWorkerThread.helpJoinTask tracks joining->stealing
- * links to try to find such a task.
+ * would be running if the steal had not occurred.
*
* Compensating: Unless there are already enough live threads,
- * method helpMaintainParallelism() may create or or
- * re-activate a spare thread to compensate for blocked
- * joiners until they unblock.
- *
- * Because the determining existence of conservatively safe
- * helping targets, the availability of already-created spares,
- * and the apparent need to create new spares are all racy and
- * require heuristic guidance, we rely on multiple retries of
- * each. Further, because it is impossible to keep exactly the
- * target (parallelism) number of threads running at any given
- * time, we allow compensation during joins to fail, and enlist
- * all other threads to help out whenever they are not otherwise
- * occupied (i.e., mainly in method preStep).
+ * method tryCompensate() may create or re-activate a spare
+ * thread to compensate for blocked joiners until they unblock.
+ *
+ * A third form (implemented in tryRemoveAndExec and
+ * tryPollForAndExec) amounts to helping a hypothetical
+ * compensator: If we can readily tell that a possible action of a
+ * compensator is to steal and execute the task being joined, the
+ * joining thread can do so directly, without the need for a
+ * compensation thread (although at the expense of larger run-time
+ * stacks, but the tradeoff is typically worthwhile).
*
* The ManagedBlocker extension API can't use helping so relies
* only on compensation in method awaitBlocker.
*
- * The main throughput advantages of work-stealing stem from
- * decentralized control -- workers mostly steal tasks from each
- * other. We do not want to negate this by creating bottlenecks
- * implementing other management responsibilities. So we use a
- * collection of techniques that avoid, reduce, or cope well with
- * contention. These entail several instances of bit-packing into
- * CASable fields to maintain only the minimally required
- * atomicity. To enable such packing, we restrict maximum
- * parallelism to (1<<15)-1 (enabling twice this (to accommodate
- * unbalanced increments and decrements) to fit into a 16 bit
- * field, which is far in excess of normal operating range. Even
- * though updates to some of these bookkeeping fields do sometimes
- * contend with each other, they don't normally cache-contend with
- * updates to others enough to warrant memory padding or
- * isolation. So they are all held as fields of ForkJoinPool
- * objects. The main capabilities are as follows:
- *
- * 1. Creating and removing workers. Workers are recorded in the
- * "workers" array. This is an array as opposed to some other data
- * structure to support index-based random steals by workers.
- * Updates to the array recording new workers and unrecording
- * terminated ones are protected from each other by a lock
- * (workerLock) but the array is otherwise concurrently readable,
- * and accessed directly by workers. To simplify index-based
- * operations, the array size is always a power of two, and all
- * readers must tolerate null slots. Currently, all worker thread
- * creation is on-demand, triggered by task submissions,
- * replacement of terminated workers, and/or compensation for
- * blocked workers. However, all other support code is set up to
- * work with other policies.
- *
- * To ensure that we do not hold on to worker references that
- * would prevent GC, ALL accesses to workers are via indices into
- * the workers array (which is one source of some of the unusual
- * code constructions here). In essence, the workers array serves
- * as a WeakReference mechanism. Thus for example the event queue
- * stores worker indices, not worker references. Access to the
- * workers in associated methods (for example releaseEventWaiters)
- * must both index-check and null-check the IDs. All such accesses
- * ignore bad IDs by returning out early from what they are doing,
- * since this can only be associated with shutdown, in which case
- * it is OK to give up. On termination, we just clobber these
- * data structures without trying to use them.
- *
- * 2. Bookkeeping for dynamically adding and removing workers. We
- * aim to approximately maintain the given level of parallelism.
- * When some workers are known to be blocked (on joins or via
- * ManagedBlocker), we may create or resume others to take their
- * place until they unblock (see below). Implementing this
- * requires counts of the number of "running" threads (i.e., those
- * that are neither blocked nor artifically suspended) as well as
- * the total number. These two values are packed into one field,
- * "workerCounts" because we need accurate snapshots when deciding
- * to create, resume or suspend. Note however that the
- * correspondance of these counts to reality is not guaranteed. In
- * particular updates for unblocked threads may lag until they
- * actually wake up.
- *
- * 3. Maintaining global run state. The run state of the pool
- * consists of a runLevel (SHUTDOWN, TERMINATING, etc) similar to
- * those in other Executor implementations, as well as a count of
- * "active" workers -- those that are, or soon will be, or
- * recently were executing tasks. The runLevel and active count
- * are packed together in order to correctly trigger shutdown and
- * termination. Without care, active counts can be subject to very
- * high contention. We substantially reduce this contention by
- * relaxing update rules. A worker must claim active status
- * prospectively, by activating if it sees that a submitted or
- * stealable task exists (it may find after activating that the
- * task no longer exists). It stays active while processing this
- * task (if it exists) and any other local subtasks it produces,
- * until it cannot find any other tasks. It then tries
- * inactivating (see method preStep), but upon update contention
- * instead scans for more tasks, later retrying inactivation if it
- * doesn't find any.
- *
- * 4. Managing idle workers waiting for tasks. We cannot let
- * workers spin indefinitely scanning for tasks when none are
- * available. On the other hand, we must quickly prod them into
- * action when new tasks are submitted or generated. We
- * park/unpark these idle workers using an event-count scheme.
- * Field eventCount is incremented upon events that may enable
- * workers that previously could not find a task to now find one:
- * Submission of a new task to the pool, or another worker pushing
- * a task onto a previously empty queue. (We also use this
- * mechanism for configuration and termination actions that
- * require wakeups of idle workers). Each worker maintains its
- * last known event count, and blocks when a scan for work did not
- * find a task AND its lastEventCount matches the current
- * eventCount. Waiting idle workers are recorded in a variant of
- * Treiber stack headed by field eventWaiters which, when nonzero,
- * encodes the thread index and count awaited for by the worker
- * thread most recently calling eventSync. This thread in turn has
- * a record (field nextEventWaiter) for the next waiting worker.
- * In addition to allowing simpler decisions about need for
- * wakeup, the event count bits in eventWaiters serve the role of
- * tags to avoid ABA errors in Treiber stacks. Upon any wakeup,
- * released threads also try to release others (but give up upon
- * contention to reduce useless flailing). The net effect is a
- * tree-like diffusion of signals, where released threads (and
- * possibly others) help with unparks. To further reduce
- * contention effects a bit, failed CASes to increment field
- * eventCount are tolerated without retries in signalWork.
- * Conceptually they are merged into the same event, which is OK
- * when their only purpose is to enable workers to scan for work.
- *
- * 5. Managing suspension of extra workers. When a worker is about
- * to block waiting for a join (or via ManagedBlockers), we may
- * create a new thread to maintain parallelism level, or at least
- * avoid starvation. Usually, extra threads are needed for only
- * very short periods, yet join dependencies are such that we
- * sometimes need them in bursts. Rather than create new threads
- * each time this happens, we suspend no-longer-needed extra ones
- * as "spares". For most purposes, we don't distinguish "extra"
- * spare threads from normal "core" threads: On each call to
- * preStep (the only point at which we can do this) a worker
- * checks to see if there are now too many running workers, and if
- * so, suspends itself. Method helpMaintainParallelism looks for
- * suspended threads to resume before considering creating a new
- * replacement. The spares themselves are encoded on another
- * variant of a Treiber Stack, headed at field "spareWaiters".
- * Note that the use of spares is intrinsically racy. One thread
- * may become a spare at about the same time as another is
- * needlessly being created. We counteract this and related slop
- * in part by requiring resumed spares to immediately recheck (in
- * preStep) to see whether they they should re-suspend.
- *
- * 6. Killing off unneeded workers. The Spare and Event queues use
- * similar mechanisms to shed unused workers: The oldest (first)
- * waiter uses a timed rather than hard wait. When this wait times
- * out without a normal wakeup, it tries to shutdown any one (for
- * convenience the newest) other waiter via tryShutdownSpare or
- * tryShutdownWaiter, respectively. The wakeup rates for spares
- * are much shorter than for waiters. Together, they will
- * eventually reduce the number of worker threads to a minimum of
- * one after a long enough period without use.
- *
- * 7. Deciding when to create new workers. The main dynamic
- * control in this class is deciding when to create extra threads
- * in method helpMaintainParallelism. We would like to keep
- * exactly #parallelism threads running, which is an impossble
- * task. We always need to create one when the number of running
- * threads would become zero and all workers are busy. Beyond
- * this, we must rely on heuristics that work well in the the
- * presence of transients phenomena such as GC stalls, dynamic
- * compilation, and wake-up lags. These transients are extremely
- * common -- we are normally trying to fully saturate the CPUs on
- * a machine, so almost any activity other than running tasks
- * impedes accuracy. Our main defense is to allow some slack in
- * creation thresholds, using rules that reflect the fact that the
- * more threads we have running, the more likely that we are
- * underestimating the number running threads. (We also include
- * some heuristic use of Thread.yield when all workers appear to
- * be busy, to improve likelihood of counts settling.) The rules
- * also better cope with the fact that some of the methods in this
- * class tend to never become compiled (but are interpreted), so
- * some components of the entire set of controls might execute 100
- * times faster than others. And similarly for cases where the
- * apparent lack of work is just due to GC stalls and other
- * transient system activity.
+ * The algorithm in tryHelpStealer entails a form of "linear"
+ * helping: Each worker records (in field currentSteal) the most
+ * recent task it stole from some other worker. Plus, it records
+ * (in field currentJoin) the task it is currently actively
+ * joining. Method tryHelpStealer uses these markers to try to
+ * find a worker to help (i.e., steal back a task from and execute
+ * it) that could hasten completion of the actively joined task.
+ * In essence, the joiner executes a task that would be on its own
+ * local deque had the to-be-joined task not been stolen. This may
+ * be seen as a conservative variant of the approach in Wagner &
+ * Calder "Leapfrogging: a portable technique for implementing
+ * efficient futures" SIGPLAN Notices, 1993
+ * (http://portal.acm.org/citation.cfm?id=155354). It differs in
+ * that: (1) We only maintain dependency links across workers upon
+ * steals, rather than use per-task bookkeeping. This sometimes
+ * requires a linear scan of workers array to locate stealers, but
+ * often doesn't because stealers leave hints (that may become
+ * stale/wrong) of where to locate them. A stealHint is only a
+ * hint because a worker might have had multiple steals and the
+ * hint records only one of them (usually the most current).
+ * Hinting isolates cost to when it is needed, rather than adding
+ * to per-task overhead. (2) It is "shallow", ignoring nesting
+ * and potentially cyclic mutual steals. (3) It is intentionally
+ * racy: field currentJoin is updated only while actively joining,
+ * which means that we miss links in the chain during long-lived
+ * tasks, GC stalls etc (which is OK since blocking in such cases
+ * is usually a good idea). (4) We bound the number of attempts
+ * to find work (see MAX_HELP_DEPTH) and fall back to suspending
+ * the worker and if necessary replacing it with another.
+ *
+ * It is impossible to keep exactly the target parallelism number
+ * of threads running at any given time. Determining the
+ * existence of conservatively safe helping targets, the
+ * availability of already-created spares, and the apparent need
+ * to create new spares are all racy, so we rely on multiple
+ * retries of each. Currently, in keeping with on-demand
+ * signalling policy, we compensate only if blocking would leave
+ * less than one active (non-waiting, non-blocked) worker.
+ * Additionally, to avoid some false alarms due to GC, lagging
+ * counters, system activity, etc, compensated blocking for joins
+ * is only attempted after rechecks stabilize in
+ * ForkJoinTask.awaitJoin. (Retries are interspersed with
+ * Thread.yield, for good citizenship.)
*
- * Beware that there is a lot of representation-level coupling
+ * Style notes: There is a lot of representation-level coupling
* among classes ForkJoinPool, ForkJoinWorkerThread, and
- * ForkJoinTask. For example, direct access to "workers" array by
- * workers, and direct access to ForkJoinTask.status by both
- * ForkJoinPool and ForkJoinWorkerThread. There is little point
- * trying to reduce this, since any associated future changes in
- * representations will need to be accompanied by algorithmic
- * changes anyway.
- *
- * Style notes: There are lots of inline assignments (of form
- * "while ((local = field) != 0)") which are usually the simplest
- * way to ensure the required read orderings (which are sometimes
- * critical). Also several occurrences of the unusual "do {}
- * while(!cas...)" which is the simplest way to force an update of
- * a CAS'ed variable. There are also other coding oddities that
- * help some methods perform reasonably even when interpreted (not
- * compiled), at the expense of some messy constructions that
- * reduce byte code counts.
- *
- * The order of declarations in this file is: (1) statics (2)
- * fields (along with constants used when unpacking some of them)
- * (3) internal control methods (4) callbacks and other support
- * for ForkJoinTask and ForkJoinWorkerThread classes, (5) exported
- * methods (plus a few little helpers).
+ * ForkJoinTask. The fields of WorkQueue maintain data structures
+ * managed by ForkJoinPool, so are directly accessed. There is
+ * little point trying to reduce this, since any associated future
+ * changes in representations will need to be accompanied by
+ * algorithmic changes anyway. All together, these low-level
+ * implementation choices produce as much as a factor of 4
+ * performance improvement compared to naive implementations, and
+ * enable the processing of billions of tasks per second, at the
+ * expense of some ugliness.
+ *
+ * Methods signalWork() and scan() are the main bottlenecks, so are
+ * especially heavily micro-optimized/mangled. There are lots of
+ * inline assignments (of form "while ((local = field) != 0)")
+ * which are usually the simplest way to ensure the required read
+ * orderings (which are sometimes critical). This leads to a
+ * "C"-like style of listing declarations of these locals at the
+ * heads of methods or blocks. There are several occurrences of
+ * the unusual "do {} while (!cas...)" which is the simplest way
+ * to force an update of a CAS'ed variable. There are also other
+ * coding oddities that help some methods perform reasonably even
+ * when interpreted (not compiled).
+ *
+ * The order of declarations in this file is:
+ * (1) statics
+ * (2) fields (along with constants used when unpacking some of
+ * them), listed in an order that tends to reduce contention
+ * among them a bit under most JVMs;
+ * (3) nested classes
+ * (4) internal control methods
+ * (5) callbacks and other support for ForkJoinTask methods
+ * (6) exported methods (plus a few little helpers)
+ * (7) static block initializing all statics in a minimally
+ * dependent order.
*/
/**
@@ -393,15 +481,13 @@ public class ForkJoinPool extends Abstra
* overridden in ForkJoinPool constructors.
*/
public static final ForkJoinWorkerThreadFactory
- defaultForkJoinWorkerThreadFactory =
- new DefaultForkJoinWorkerThreadFactory();
+ defaultForkJoinWorkerThreadFactory;
/**
* Permission required for callers of methods that may start or
* kill threads.
*/
- private static final RuntimePermission modifyThreadPermission =
- new RuntimePermission("modifyThread");
+ private static final RuntimePermission modifyThreadPermission;
/**
* If there is a security manager, makes sure caller has
@@ -416,856 +502,1382 @@ public class ForkJoinPool extends Abstra
/**
* Generator for assigning sequence numbers as pool names.
*/
- private static final AtomicInteger poolNumberGenerator =
- new AtomicInteger();
-
- /**
- * The wakeup interval (in nanoseconds) for the oldest worker
- * worker waiting for an event invokes tryShutdownWaiter to shrink
- * the number of workers. The exact value does not matter too
- * much, but should be long enough to slowly release resources
- * during long periods without use without disrupting normal use.
- */
- private static final long SHRINK_RATE_NANOS =
- 60L * 1000L * 1000L * 1000L; // one minute
+ private static final AtomicInteger poolNumberGenerator;
/**
- * Absolute bound for parallelism level. Twice this number plus
- * one (i.e., 0xfff) must fit into a 16bit field to enable
- * word-packing for some counts and indices.
+ * Bits and masks for control variables
+ *
+ * Field ctl is a long packed with:
+ * AC: Number of active running workers minus target parallelism (16 bits)
+ * TC: Number of total workers minus target parallelism (16 bits)
+ * ST: true if pool is terminating (1 bit)
+ * EC: the wait count of top waiting thread (15 bits)
+ * ID: ~(poolIndex >>> 1) of top of Treiber stack of waiters (16 bits)
+ *
+ * When convenient, we can extract the upper 32 bits of counts and
+ * the lower 32 bits of queue state, u = (int)(ctl >>> 32) and e =
+ * (int)ctl. The ec field is never accessed alone, but always
+ * together with id and st. The offsets of counts by the target
+ * parallelism and the positionings of fields makes it possible to
+ * perform the most common checks via sign tests of fields: When
+ * ac is negative, there are not enough active workers, when tc is
+ * negative, there are not enough total workers, when id is
+ * negative, there is at least one waiting worker, and when e is
+ * negative, the pool is terminating. To deal with these possibly
+ * negative fields, we use casts in and out of "short" and/or
+ * signed shifts to maintain signedness.
+ *
+ * When a thread is queued (inactivated), its eventCount field is
+ * negative, which is the only way to tell if a worker is
+ * prevented from executing tasks, even though it must continue to
+ * scan for them to avoid queuing races.
+ *
+ * Field runState is an int packed with:
+ * SHUTDOWN: true if shutdown is enabled (1 bit)
+ * SEQ: a sequence number updated upon (de)registering workers (15 bits)
+ * MASK: mask (power of 2 - 1) covering all registered poolIndexes (16 bits)
+ *
+ * The combination of mask and sequence number enables simple
+ * consistency checks: Staleness of read-only operations on the
+ * workers and queues arrays can be checked by comparing runState
+ * before vs after the reads. The low 16 bits (i.e, anding with
+ * SMASK) hold the smallest power of two covering all worker
+ * indices, minus one. The mask for queues (vs workers) is twice
+ * this value plus 1.
+ */
+
+ // bit positions/shifts for fields
+ private static final int AC_SHIFT = 48;
+ private static final int TC_SHIFT = 32;
+ private static final int ST_SHIFT = 31;
+ private static final int EC_SHIFT = 16;
+
+ // bounds
+ private static final int MAX_ID = 0x7fff; // max poolIndex
+ private static final int SMASK = 0xffff; // mask short bits
+ private static final int SHORT_SIGN = 1 << 15;
+ private static final int INT_SIGN = 1 << 31;
+
+ // masks
+ private static final long STOP_BIT = 0x0001L << ST_SHIFT;
+ private static final long AC_MASK = ((long)SMASK) << AC_SHIFT;
+ private static final long TC_MASK = ((long)SMASK) << TC_SHIFT;
+
+ // units for incrementing and decrementing
+ private static final long TC_UNIT = 1L << TC_SHIFT;
+ private static final long AC_UNIT = 1L << AC_SHIFT;
+
+ // masks and units for dealing with u = (int)(ctl >>> 32)
+ private static final int UAC_SHIFT = AC_SHIFT - 32;
+ private static final int UTC_SHIFT = TC_SHIFT - 32;
+ private static final int UAC_MASK = SMASK << UAC_SHIFT;
+ private static final int UTC_MASK = SMASK << UTC_SHIFT;
+ private static final int UAC_UNIT = 1 << UAC_SHIFT;
+ private static final int UTC_UNIT = 1 << UTC_SHIFT;
+
+ // masks and units for dealing with e = (int)ctl
+ private static final int E_MASK = 0x7fffffff; // no STOP_BIT
+ private static final int E_SEQ = 1 << EC_SHIFT;
+
+ // runState bits
+ private static final int SHUTDOWN = 1 << 31;
+ private static final int RS_SEQ = 1 << 16;
+ private static final int RS_SEQ_MASK = 0x7fff0000;
+
+ // access mode for WorkQueue
+ static final int LIFO_QUEUE = 0;
+ static final int FIFO_QUEUE = 1;
+ static final int SHARED_QUEUE = -1;
+
+ /**
+ * The wakeup interval (in nanoseconds) for a worker waiting for a
+ * task when the pool is quiescent to instead try to shrink the
+ * number of workers. The exact value does not matter too
+ * much. It must be short enough to release resources during
+ * sustained periods of idleness, but not so short that threads
+ * are continually re-created.
+ */
+ private static final long SHRINK_RATE =
+ 4L * 1000L * 1000L * 1000L; // 4 seconds
+
+ /**
+ * The timeout value for attempted shrinkage, includes
+ * some slop to cope with system timer imprecision.
+ */
+ private static final long SHRINK_TIMEOUT = SHRINK_RATE - (SHRINK_RATE / 10);
+
+ /**
+ * The maximum stolen->joining link depth allowed in tryHelpStealer.
+ * Depths for legitimate chains are unbounded, but we use a fixed
+ * constant to avoid (otherwise unchecked) cycles and to bound
+ * staleness of traversal parameters at the expense of sometimes
+ * blocking when we could be helping.
*/
- private static final int MAX_WORKERS = 0x7fff;
+ private static final int MAX_HELP_DEPTH = 16;
- /**
- * Array holding all worker threads in the pool. Array size must
- * be a power of two. Updates and replacements are protected by
- * workerLock, but the array is always kept in a consistent enough
- * state to be randomly accessed without locking by workers
- * performing work-stealing, as well as other traversal-based
- * methods in this class. All readers must tolerate that some
- * array slots may be null.
+ /*
+ * Field layout order in this class tends to matter more than one
+ * would like. Runtime layout order is only loosely related to
+ * declaration order and may differ across JVMs, but the following
+ * empirically works OK on current JVMs.
+ */
+
+ volatile long ctl; // main pool control
+ final int parallelism; // parallelism level
+ final int localMode; // per-worker scheduling mode
+ int nextPoolIndex; // hint used in registerWorker
+ volatile int runState; // shutdown status, seq, and mask
+ WorkQueue[] workQueues; // main registry
+ final ReentrantLock lock; // for registration
+ final Condition termination; // for awaitTermination
+ final ForkJoinWorkerThreadFactory factory; // factory for new workers
+ final Thread.UncaughtExceptionHandler ueh; // per-worker UEH
+ final AtomicLong stealCount; // collect counts when terminated
+ final AtomicInteger nextWorkerNumber; // to create worker name string
+ final String workerNamePrefix; // Prefix for assigning worker names
+
+ /**
+ * Queues supporting work-stealing as well as external task
+ * submission. See above for main rationale and algorithms.
+ * Implementation relies heavily on "Unsafe" intrinsics
+ * and selective use of "volatile":
+ *
+ * Field "base" is the index (mod array.length) of the least valid
+ * queue slot, which is always the next position to steal (poll)
+ * from if nonempty. Reads and writes require volatile orderings
+ * but not CAS, because updates are only performed after slot
+ * CASes.
+ *
+ * Field "top" is the index (mod array.length) of the next queue
+ * slot to push to or pop from. It is written only by owner thread
+ * for push, or under lock for trySharedPush, and accessed by
+ * other threads only after reading (volatile) base. Both top and
+ * base are allowed to wrap around on overflow, but (top - base)
+ * (or more commonly -(base - top) to force volatile read of base
+ * before top) still estimates size.
+ *
+ * The array slots are read and written using the emulation of
+ * volatiles/atomics provided by Unsafe. Insertions must in
+ * general use putOrderedObject as a form of releasing store to
+ * ensure that all writes to the task object are ordered before
+ * its publication in the queue. (Although we can avoid one case
+ * of this when locked in trySharedPush.) All removals entail a
+ * CAS to null. The array is always a power of two. To ensure
+ * safety of Unsafe array operations, all accesses perform
+ * explicit null checks and implicit bounds checks via
+ * power-of-two masking.
+ *
+ * In addition to basic queuing support, this class contains
+ * fields described elsewhere to control execution. It turns out
+ * to work better memory-layout-wise to include them in this
+ * class rather than a separate class.
+ *
+ * Performance on most platforms is very sensitive to placement of
+ * instances of both WorkQueues and their arrays -- we absolutely
+ * do not want multiple WorkQueue instances or multiple queue
+ * arrays sharing cache lines. (It would be best for queue objects
+ * and their arrays to share, but there is nothing available to
+ * help arrange that). Unfortunately, because they are recorded
+ * in a common array, WorkQueue instances are often moved to be
+ * adjacent by garbage collectors. To reduce impact, we use field
+ * padding that works OK on common platforms; this effectively
+ * trades off slightly slower average field access for the sake of
+ * avoiding really bad worst-case access. (Until better JVM
+ * support is in place, this padding is dependent on transient
+ * properties of JVM field layout rules.) We also take care in
+ * allocating and sizing and resizing the array. Non-shared queue
+ * arrays are initialized (via method growArray) by workers before
+ * use. Others are allocated on first use.
*/
- volatile ForkJoinWorkerThread[] workers;
+ static final class WorkQueue {
+ /**
+ * Capacity of work-stealing queue array upon initialization.
+ * Must be a power of two; at least 4, but set larger to
+ * reduce cacheline sharing among queues.
+ */
+ static final int INITIAL_QUEUE_CAPACITY = 1 << 8;
- /**
- * Queue for external submissions.
- */
- private final LinkedTransferQueue> submissionQueue;
+ /**
+ * Maximum size for queue arrays. Must be a power of two less
+ * than or equal to 1 << (31 - width of array entry) to ensure
+ * lack of wraparound of index calculations, but defined to a
+ * value a bit less than this to help users trap runaway
+ * programs before saturating systems.
+ */
+ static final int MAXIMUM_QUEUE_CAPACITY = 1 << 26; // 64M
- /**
- * Lock protecting updates to workers array.
- */
- private final ReentrantLock workerLock;
+ volatile long totalSteals; // cumulative number of steals
+ int seed; // for random scanning; initialize nonzero
+ volatile int eventCount; // encoded inactivation count; < 0 if inactive
+ int nextWait; // encoded record of next event waiter
+ int rescans; // remaining scans until block
+ int nsteals; // top-level task executions since last idle
+ final int mode; // lifo, fifo, or shared
+ int poolIndex; // index of this queue in pool (or 0)
+ int stealHint; // index of most recent known stealer
+ volatile int runState; // 1: locked, -1: terminate; else 0
+ volatile int base; // index of next slot for poll
+ int top; // index of next slot for push
+ ForkJoinTask[] array; // the elements (initially unallocated)
+ final ForkJoinWorkerThread owner; // owning thread or null if shared
+ volatile Thread parker; // == owner during call to park; else null
+ ForkJoinTask currentJoin; // task being joined in awaitJoin
+ ForkJoinTask currentSteal; // current non-local task being executed
+ // Heuristic padding to ameliorate unfortunate memory placements
+ Object p00, p01, p02, p03, p04, p05, p06, p07, p08, p09, p0a;
+
+ WorkQueue(ForkJoinWorkerThread owner, int mode) {
+ this.owner = owner;
+ this.mode = mode;
+ // Place indices in the center of array (that is not yet allocated)
+ base = top = INITIAL_QUEUE_CAPACITY >>> 1;
+ }
- /**
- * Latch released upon termination.
- */
- private final Phaser termination;
+ /**
+ * Returns number of tasks in the queue.
+ */
+ final int queueSize() {
+ int n = base - top; // non-owner callers must read base first
+ return (n >= 0) ? 0 : -n;
+ }
- /**
- * Creation factory for worker threads.
- */
- private final ForkJoinWorkerThreadFactory factory;
+ /**
+ * Pushes a task. Call only by owner in unshared queues.
+ *
+ * @param task the task. Caller must ensure non-null.
+ * @param p if non-null, pool to signal if necessary
+ * @throw RejectedExecutionException if array cannot be resized
+ */
+ final void push(ForkJoinTask task, ForkJoinPool p) {
+ ForkJoinTask[] a;
+ int s = top, m, n;
+ if ((a = array) != null) { // ignore if queue removed
+ U.putOrderedObject
+ (a, (((m = a.length - 1) & s) << ASHIFT) + ABASE, task);
+ if ((n = (top = s + 1) - base) <= 2) {
+ if (p != null)
+ p.signalWork();
+ }
+ else if (n >= m)
+ growArray(true);
+ }
+ }
- /**
- * Sum of per-thread steal counts, updated only when threads are
- * idle or terminating.
- */
- private volatile long stealCount;
+ /**
+ * Pushes a task if lock is free and array is either big
+ * enough or can be resized to be big enough.
+ *
+ * @param task the task. Caller must ensure non-null.
+ * @return true if submitted
+ */
+ final boolean trySharedPush(ForkJoinTask task) {
+ boolean submitted = false;
+ if (runState == 0 && U.compareAndSwapInt(this, RUNSTATE, 0, 1)) {
+ ForkJoinTask[] a = array;
+ int s = top, n = s - base;
+ try {
+ if ((a != null && n < a.length - 1) ||
+ (a = growArray(false)) != null) { // must presize
+ int j = (((a.length - 1) & s) << ASHIFT) + ABASE;
+ U.putObject(a, (long)j, task); // don't need "ordered"
+ top = s + 1;
+ submitted = true;
+ }
+ } finally {
+ runState = 0; // unlock
+ }
+ }
+ return submitted;
+ }
- /**
- * Encoded record of top of treiber stack of threads waiting for
- * events. The top 32 bits contain the count being waited for. The
- * bottom 16 bits contains one plus the pool index of waiting
- * worker thread. (Bits 16-31 are unused.)
- */
- private volatile long eventWaiters;
+ /**
+ * Takes next task, if one exists, in FIFO order.
+ */
+ final ForkJoinTask poll() {
+ ForkJoinTask[] a; int b, i;
+ while ((b = base) - top < 0 && (a = array) != null &&
+ (i = (a.length - 1) & b) >= 0) {
+ int j = (i << ASHIFT) + ABASE;
+ ForkJoinTask t = (ForkJoinTask)U.getObjectVolatile(a, j);
+ if (t != null && base == b &&
+ U.compareAndSwapObject(a, j, t, null)) {
+ base = b + 1;
+ return t;
+ }
+ }
+ return null;
+ }
- private static final int EVENT_COUNT_SHIFT = 32;
- private static final long WAITER_ID_MASK = (1L << 16) - 1L;
+ /**
+ * Takes next task, if one exists, in LIFO order.
+ * Call only by owner in unshared queues.
+ */
+ final ForkJoinTask pop() {
+ ForkJoinTask t; int m;
+ ForkJoinTask[] a = array;
+ if (a != null && (m = a.length - 1) >= 0) {
+ for (int s; (s = top - 1) - base >= 0;) {
+ int j = ((m & s) << ASHIFT) + ABASE;
+ if ((t = (ForkJoinTask)U.getObjectVolatile(a, j)) == null)
+ break;
+ if (U.compareAndSwapObject(a, j, t, null)) {
+ top = s;
+ return t;
+ }
+ }
+ }
+ return null;
+ }
- /**
- * A counter for events that may wake up worker threads:
- * - Submission of a new task to the pool
- * - A worker pushing a task on an empty queue
- * - termination
- */
- private volatile int eventCount;
+ /**
+ * Takes next task, if one exists, in order specified by mode.
+ */
+ final ForkJoinTask nextLocalTask() {
+ return mode == 0 ? pop() : poll();
+ }
- /**
- * Encoded record of top of treiber stack of spare threads waiting
- * for resumption. The top 16 bits contain an arbitrary count to
- * avoid ABA effects. The bottom 16bits contains one plus the pool
- * index of waiting worker thread.
- */
- private volatile int spareWaiters;
+ /**
+ * Returns next task, if one exists, in order specified by mode.
+ */
+ final ForkJoinTask peek() {
+ ForkJoinTask[] a = array; int m;
+ if (a == null || (m = a.length - 1) < 0)
+ return null;
+ int i = mode == 0 ? top - 1 : base;
+ int j = ((i & m) << ASHIFT) + ABASE;
+ return (ForkJoinTask)U.getObjectVolatile(a, j);
+ }
- private static final int SPARE_COUNT_SHIFT = 16;
- private static final int SPARE_ID_MASK = (1 << 16) - 1;
+ /**
+ * Returns task at index b if b is current base of queue.
+ */
+ final ForkJoinTask pollAt(int b) {
+ ForkJoinTask[] a; int i;
+ ForkJoinTask task = null;
+ if ((a = array) != null && (i = ((a.length - 1) & b)) >= 0) {
+ int j = (i << ASHIFT) + ABASE;
+ ForkJoinTask t = (ForkJoinTask)U.getObjectVolatile(a, j);
+ if (t != null && base == b &&
+ U.compareAndSwapObject(a, j, t, null)) {
+ base = b + 1;
+ task = t;
+ }
+ }
+ return task;
+ }
- /**
- * Lifecycle control. The low word contains the number of workers
- * that are (probably) executing tasks. This value is atomically
- * incremented before a worker gets a task to run, and decremented
- * when worker has no tasks and cannot find any. Bits 16-18
- * contain runLevel value. When all are zero, the pool is
- * running. Level transitions are monotonic (running -> shutdown
- * -> terminating -> terminated) so each transition adds a bit.
- * These are bundled together to ensure consistent read for
- * termination checks (i.e., that runLevel is at least SHUTDOWN
- * and active threads is zero).
- *
- * Notes: Most direct CASes are dependent on these bitfield
- * positions. Also, this field is non-private to enable direct
- * performance-sensitive CASes in ForkJoinWorkerThread.
- */
- volatile int runState;
+ /**
+ * Pops the given task only if it is at the current top.
+ */
+ final boolean tryUnpush(ForkJoinTask t) {
+ ForkJoinTask[] a; int s;
+ if ((a = array) != null && (s = top) != base &&
+ U.compareAndSwapObject
+ (a, (((a.length - 1) & --s) << ASHIFT) + ABASE, t, null)) {
+ top = s;
+ return true;
+ }
+ return false;
+ }
- // Note: The order among run level values matters.
- private static final int RUNLEVEL_SHIFT = 16;
- private static final int SHUTDOWN = 1 << RUNLEVEL_SHIFT;
- private static final int TERMINATING = 1 << (RUNLEVEL_SHIFT + 1);
- private static final int TERMINATED = 1 << (RUNLEVEL_SHIFT + 2);
- private static final int ACTIVE_COUNT_MASK = (1 << RUNLEVEL_SHIFT) - 1;
+ /**
+ * Polls the given task only if it is at the current base.
+ */
+ final boolean pollFor(ForkJoinTask task) {
+ ForkJoinTask[] a; int b, i;
+ if ((b = base) - top < 0 && (a = array) != null &&
+ (i = (a.length - 1) & b) >= 0) {
+ int j = (i << ASHIFT) + ABASE;
+ if (U.getObjectVolatile(a, j) == task && base == b &&
+ U.compareAndSwapObject(a, j, task, null)) {
+ base = b + 1;
+ return true;
+ }
+ }
+ return false;
+ }
- /**
- * Holds number of total (i.e., created and not yet terminated)
- * and running (i.e., not blocked on joins or other managed sync)
- * threads, packed together to ensure consistent snapshot when
- * making decisions about creating and suspending spare
- * threads. Updated only by CAS. Note that adding a new worker
- * requires incrementing both counts, since workers start off in
- * running state.
- */
- private volatile int workerCounts;
+ /**
+ * If present, removes from queue and executes the given task, or
+ * any other cancelled task. Returns (true) immediately on any CAS
+ * or consistency check failure so caller can retry.
+ *
+ * @return false if no progress can be made
+ */
+ final boolean tryRemoveAndExec(ForkJoinTask task) {
+ boolean removed = false, empty = true, progress = true;
+ ForkJoinTask[] a; int m, s, b, n;
+ if ((a = array) != null && (m = a.length - 1) >= 0 &&
+ (n = (s = top) - (b = base)) > 0) {
+ for (ForkJoinTask t;;) { // traverse from s to b
+ int j = ((--s & m) << ASHIFT) + ABASE;
+ t = (ForkJoinTask)U.getObjectVolatile(a, j);
+ if (t == null) // inconsistent length
+ break;
+ else if (t == task) {
+ if (s + 1 == top) { // pop
+ if (!U.compareAndSwapObject(a, j, task, null))
+ break;
+ top = s;
+ removed = true;
+ }
+ else if (base == b) // replace with proxy
+ removed = U.compareAndSwapObject(a, j, task,
+ new EmptyTask());
+ break;
+ }
+ else if (t.status >= 0)
+ empty = false;
+ else if (s + 1 == top) { // pop and throw away
+ if (U.compareAndSwapObject(a, j, t, null))
+ top = s;
+ break;
+ }
+ if (--n == 0) {
+ if (!empty && base == b)
+ progress = false;
+ break;
+ }
+ }
+ }
+ if (removed)
+ task.doExec();
+ return progress;
+ }
- private static final int TOTAL_COUNT_SHIFT = 16;
- private static final int RUNNING_COUNT_MASK = (1 << TOTAL_COUNT_SHIFT) - 1;
- private static final int ONE_RUNNING = 1;
- private static final int ONE_TOTAL = 1 << TOTAL_COUNT_SHIFT;
+ /**
+ * Initializes or doubles the capacity of array. Call either
+ * by owner or with lock held -- it is OK for base, but not
+ * top, to move while resizings are in progress.
+ *
+ * @param rejectOnFailure if true, throw exception if capacity
+ * exceeded (relayed ultimately to user); else return null.
+ */
+ final ForkJoinTask[] growArray(boolean rejectOnFailure) {
+ ForkJoinTask[] oldA = array;
+ int size = oldA != null ? oldA.length << 1 : INITIAL_QUEUE_CAPACITY;
+ if (size <= MAXIMUM_QUEUE_CAPACITY) {
+ int oldMask, t, b;
+ ForkJoinTask[] a = array = new ForkJoinTask[size];
+ if (oldA != null && (oldMask = oldA.length - 1) >= 0 &&
+ (t = top) - (b = base) > 0) {
+ int mask = size - 1;
+ do {
+ ForkJoinTask x;
+ int oldj = ((b & oldMask) << ASHIFT) + ABASE;
+ int j = ((b & mask) << ASHIFT) + ABASE;
+ x = (ForkJoinTask)U.getObjectVolatile(oldA, oldj);
+ if (x != null &&
+ U.compareAndSwapObject(oldA, oldj, x, null))
+ U.putObjectVolatile(a, j, x);
+ } while (++b != t);
+ }
+ return a;
+ }
+ else if (!rejectOnFailure)
+ return null;
+ else
+ throw new RejectedExecutionException("Queue capacity exceeded");
+ }
- /**
- * The target parallelism level.
- * Accessed directly by ForkJoinWorkerThreads.
- */
- final int parallelism;
+ /**
+ * Removes and cancels all known tasks, ignoring any exceptions.
+ */
+ final void cancelAll() {
+ ForkJoinTask.cancelIgnoringExceptions(currentJoin);
+ ForkJoinTask.cancelIgnoringExceptions(currentSteal);
+ for (ForkJoinTask t; (t = poll()) != null; )
+ ForkJoinTask.cancelIgnoringExceptions(t);
+ }
- /**
- * True if use local fifo, not default lifo, for local polling
- * Read by, and replicated by ForkJoinWorkerThreads
- */
- final boolean locallyFifo;
+ // Execution methods
- /**
- * The uncaught exception handler used when any worker abruptly
- * terminates.
- */
- private final Thread.UncaughtExceptionHandler ueh;
+ /**
+ * Removes and runs tasks until empty, using local mode
+ * ordering.
+ */
+ final void runLocalTasks() {
+ if (base - top < 0) {
+ for (ForkJoinTask t; (t = nextLocalTask()) != null; )
+ t.doExec();
+ }
+ }
- /**
- * Pool number, just for assigning useful names to worker threads
- */
- private final int poolNumber;
+ /**
+ * Executes a top-level task and any local tasks remaining
+ * after execution.
+ *
+ * @return true unless terminating
+ */
+ final boolean runTask(ForkJoinTask t) {
+ boolean alive = true;
+ if (t != null) {
+ currentSteal = t;
+ t.doExec();
+ runLocalTasks();
+ ++nsteals;
+ currentSteal = null;
+ }
+ else if (runState < 0) // terminating
+ alive = false;
+ return alive;
+ }
+ /**
+ * Executes a non-top-level (stolen) task.
+ */
+ final void runSubtask(ForkJoinTask t) {
+ if (t != null) {
+ ForkJoinTask ps = currentSteal;
+ currentSteal = t;
+ t.doExec();
+ currentSteal = ps;
+ }
+ }
- // Utilities for CASing fields. Note that most of these
- // are usually manually inlined by callers
+ /**
+ * Computes next value for random probes. Scans don't require
+ * a very high quality generator, but also not a crummy one.
+ * Marsaglia xor-shift is cheap and works well enough. Note:
+ * This is manually inlined in several usages in ForkJoinPool
+ * to avoid writes inside busy scan loops.
+ */
+ final int nextSeed() {
+ int r = seed;
+ r ^= r << 13;
+ r ^= r >>> 17;
+ r ^= r << 5;
+ return seed = r;
+ }
- /**
- * Increments running count part of workerCounts
- */
- final void incrementRunningCount() {
- int c;
- do {} while (!UNSAFE.compareAndSwapInt(this, workerCountsOffset,
- c = workerCounts,
- c + ONE_RUNNING));
+ // Unsafe mechanics
+ private static final sun.misc.Unsafe U;
+ private static final long RUNSTATE;
+ private static final int ABASE;
+ private static final int ASHIFT;
+ static {
+ int s;
+ try {
+ U = getUnsafe();
+ Class k = WorkQueue.class;
+ Class ak = ForkJoinTask[].class;
+ RUNSTATE = U.objectFieldOffset
+ (k.getDeclaredField("runState"));
+ ABASE = U.arrayBaseOffset(ak);
+ s = U.arrayIndexScale(ak);
+ } catch (Exception e) {
+ throw new Error(e);
+ }
+ if ((s & (s-1)) != 0)
+ throw new Error("data type scale not a power of two");
+ ASHIFT = 31 - Integer.numberOfLeadingZeros(s);
+ }
}
/**
- * Tries to decrement running count unless already zero
+ * Class for artificial tasks that are used to replace the target
+ * of local joins if they are removed from an interior queue slot
+ * in WorkQueue.tryRemoveAndExec. We don't need the proxy to
+ * actually do anything beyond having a unique identity.
*/
- final boolean tryDecrementRunningCount() {
- int wc = workerCounts;
- if ((wc & RUNNING_COUNT_MASK) == 0)
- return false;
- return UNSAFE.compareAndSwapInt(this, workerCountsOffset,
- wc, wc - ONE_RUNNING);
+ static final class EmptyTask extends ForkJoinTask {
+ EmptyTask() { status = ForkJoinTask.NORMAL; } // force done
+ public Void getRawResult() { return null; }
+ public void setRawResult(Void x) {}
+ public boolean exec() { return true; }
}
/**
- * Forces decrement of encoded workerCounts, awaiting nonzero if
- * (rarely) necessary when other count updates lag.
- *
- * @param dr -- either zero or ONE_RUNNING
- * @param dt == either zero or ONE_TOTAL
+ * Per-thread records for (typically non-FJ) threads that submit
+ * to pools. Cureently holds only psuedo-random seed / index that
+ * is used to choose submission queues in method doSubmit. In the
+ * future, this may incorporate a means to implement different
+ * task rejection and resubmission policies.
*/
- private void decrementWorkerCounts(int dr, int dt) {
- for (;;) {
- int wc = workerCounts;
- if ((wc & RUNNING_COUNT_MASK) - dr < 0 ||
- (wc >>> TOTAL_COUNT_SHIFT) - dt < 0) {
- if ((runState & TERMINATED) != 0)
- return; // lagging termination on a backout
- Thread.yield();
- }
- if (UNSAFE.compareAndSwapInt(this, workerCountsOffset,
- wc, wc - (dr + dt)))
- return;
+ static final class Submitter {
+ int seed; // seed for random submission queue selection
+
+ // Heuristic padding to ameliorate unfortunate memory placements
+ int p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, pa, pb, pc, pd, pe;
+
+ Submitter() {
+ // Use identityHashCode, forced negative, for seed
+ seed = System.identityHashCode(Thread.currentThread()) | (1 << 31);
}
- }
- /**
- * Increments event count
- */
- private void advanceEventCount() {
- int c;
- do {} while(!UNSAFE.compareAndSwapInt(this, eventCountOffset,
- c = eventCount, c+1));
+ /**
+ * Computes next value for random probes. Like method
+ * WorkQueue.nextSeed, this is manually inlined in several
+ * usages to avoid writes inside busy loops.
+ */
+ final int nextSeed() {
+ int r = seed;
+ r ^= r << 13;
+ r ^= r >>> 17;
+ return seed = r ^= r << 5;
+ }
}
- /**
- * Tries incrementing active count; fails on contention.
- * Called by workers before executing tasks.
- *
- * @return true on success
- */
- final boolean tryIncrementActiveCount() {
- int c;
- return UNSAFE.compareAndSwapInt(this, runStateOffset,
- c = runState, c + 1);
+ /** ThreadLocal class for Submitters */
+ static final class ThreadSubmitter extends ThreadLocal {
+ public Submitter initialValue() { return new Submitter(); }
}
/**
- * Tries decrementing active count; fails on contention.
- * Called when workers cannot find tasks to run.
+ * Per-thread submission bookeeping. Shared across all pools
+ * to reduce ThreadLocal pollution and because random motion
+ * to avoid contention in one pool is likely to hold for others.
*/
- final boolean tryDecrementActiveCount() {
- int c;
- return UNSAFE.compareAndSwapInt(this, runStateOffset,
- c = runState, c - 1);
- }
+ static final ThreadSubmitter submitters = new ThreadSubmitter();
/**
- * Advances to at least the given level. Returns true if not
- * already in at least the given level.
+ * Top-level runloop for workers
*/
- private boolean advanceRunLevel(int level) {
- for (;;) {
- int s = runState;
- if ((s & level) != 0)
- return false;
- if (UNSAFE.compareAndSwapInt(this, runStateOffset, s, s | level))
- return true;
- }
+ final void runWorker(ForkJoinWorkerThread wt) {
+ // Initialize queue array and seed in this thread
+ WorkQueue w = wt.workQueue;
+ w.growArray(false);
+ // Same initial hash as Submitters
+ w.seed = System.identityHashCode(Thread.currentThread()) | (1 << 31);
+
+ do {} while (w.runTask(scan(w)));
}
- // workers array maintenance
+ // Creating, registering and deregistering workers
/**
- * Records and returns a workers array index for new worker.
+ * Tries to create and start a worker
*/
- private int recordWorker(ForkJoinWorkerThread w) {
- // Try using slot totalCount-1. If not available, scan and/or resize
- int k = (workerCounts >>> TOTAL_COUNT_SHIFT) - 1;
- final ReentrantLock lock = this.workerLock;
- lock.lock();
+ private void addWorker() {
+ Throwable ex = null;
+ ForkJoinWorkerThread w = null;
try {
- ForkJoinWorkerThread[] ws = workers;
- int n = ws.length;
- if (k < 0 || k >= n || ws[k] != null) {
- for (k = 0; k < n && ws[k] != null; ++k)
- ;
- if (k == n)
- ws = Arrays.copyOf(ws, n << 1);
+ if ((w = factory.newThread(this)) != null) {
+ w.start();
+ return;
}
- ws[k] = w;
- workers = ws; // volatile array write ensures slot visibility
- } finally {
- lock.unlock();
+ } catch (Throwable e) {
+ ex = e;
}
- return k;
+ deregisterWorker(w, ex);
}
/**
- * Nulls out record of worker in workers array
+ * Callback from ForkJoinWorkerThread constructor to assign a
+ * public name. This must be separate from registerWorker because
+ * it is called during the "super" constructor call in
+ * ForkJoinWorkerThread.
*/
- private void forgetWorker(ForkJoinWorkerThread w) {
- int idx = w.poolIndex;
- // Locking helps method recordWorker avoid unecessary expansion
- final ReentrantLock lock = this.workerLock;
+ final String nextWorkerName() {
+ return workerNamePrefix.concat
+ (Integer.toString(nextWorkerNumber.addAndGet(1)));
+ }
+
+ /**
+ * Callback from ForkJoinWorkerThread constructor to establish and
+ * record its WorkQueue.
+ *
+ * @param wt the worker thread
+ */
+ final void registerWorker(ForkJoinWorkerThread wt) {
+ WorkQueue w = wt.workQueue;
+ ReentrantLock lock = this.lock;
lock.lock();
try {
- ForkJoinWorkerThread[] ws = workers;
- if (idx >= 0 && idx < ws.length && ws[idx] == w) // verify
- ws[idx] = null;
+ int k = nextPoolIndex;
+ WorkQueue[] ws = workQueues;
+ if (ws != null) { // ignore on shutdown
+ int n = ws.length;
+ if (k < 0 || (k & 1) == 0 || k >= n || ws[k] != null) {
+ for (k = 1; k < n && ws[k] != null; k += 2)
+ ; // workers are at odd indices
+ if (k >= n) // resize
+ workQueues = ws = Arrays.copyOf(ws, n << 1);
+ }
+ w.poolIndex = k;
+ w.eventCount = ~(k >>> 1) & SMASK; // Set up wait count
+ ws[k] = w; // record worker
+ nextPoolIndex = k + 2;
+ int rs = runState;
+ int m = rs & SMASK; // recalculate runState mask
+ if (k > m)
+ m = (m << 1) + 1;
+ runState = (rs & SHUTDOWN) | ((rs + RS_SEQ) & RS_SEQ_MASK) | m;
+ }
} finally {
lock.unlock();
}
}
- // adding and removing workers
-
/**
- * Tries to create and add new worker. Assumes that worker counts
- * are already updated to accommodate the worker, so adjusts on
- * failure.
+ * Final callback from terminating worker, as well as failure to
+ * construct or start a worker in addWorker. Removes record of
+ * worker from array, and adjusts counts. If pool is shutting
+ * down, tries to complete termination.
*
- * @return the worker, or null on failure
+ * @param wt the worker thread or null if addWorker failed
+ * @param ex the exception causing failure, or null if none
*/
- private ForkJoinWorkerThread addWorker() {
- ForkJoinWorkerThread w = null;
- try {
- w = factory.newThread(this);
- } finally { // Adjust on either null or exceptional factory return
- if (w == null) {
- decrementWorkerCounts(ONE_RUNNING, ONE_TOTAL);
- tryTerminate(false); // in case of failure during shutdown
+ final void deregisterWorker(ForkJoinWorkerThread wt, Throwable ex) {
+ WorkQueue w = null;
+ if (wt != null && (w = wt.workQueue) != null) {
+ w.runState = -1; // ensure runState is set
+ stealCount.getAndAdd(w.totalSteals + w.nsteals);
+ int idx = w.poolIndex;
+ ReentrantLock lock = this.lock;
+ lock.lock();
+ try { // remove record from array
+ WorkQueue[] ws = workQueues;
+ if (ws != null && idx >= 0 && idx < ws.length && ws[idx] == w)
+ ws[nextPoolIndex = idx] = null;
+ } finally {
+ lock.unlock();
}
}
- if (w != null) {
- w.start(recordWorker(w), ueh);
- advanceEventCount();
+
+ long c; // adjust ctl counts
+ do {} while (!U.compareAndSwapLong
+ (this, CTL, c = ctl, (((c - AC_UNIT) & AC_MASK) |
+ ((c - TC_UNIT) & TC_MASK) |
+ (c & ~(AC_MASK|TC_MASK)))));
+
+ if (!tryTerminate(false) && w != null) {
+ w.cancelAll(); // cancel remaining tasks
+ if (w.array != null) // suppress signal if never ran
+ signalWork(); // wake up or create replacement
}
- return w;
+
+ if (ex != null) // rethrow
+ U.throwException(ex);
}
/**
- * Final callback from terminating worker. Removes record of
- * worker from array, and adjusts counts. If pool is shutting
- * down, tries to complete terminatation.
+ * Tries to add and register a new queue at the given index.
*
- * @param w the worker
+ * @param idx the workQueues array index to register the queue
+ * @return the queue, or null if could not add because could
+ * not acquire lock or idx is unusable
*/
- final void workerTerminated(ForkJoinWorkerThread w) {
- forgetWorker(w);
- decrementWorkerCounts(w.isTrimmed()? 0 : ONE_RUNNING, ONE_TOTAL);
- while (w.stealCount != 0) // collect final count
- tryAccumulateStealCount(w);
- tryTerminate(false);
+ private WorkQueue tryAddSharedQueue(int idx) {
+ WorkQueue q = null;
+ ReentrantLock lock = this.lock;
+ if (idx >= 0 && (idx & 1) == 0 && !lock.isLocked()) {
+ // create queue outside of lock but only if apparently free
+ WorkQueue nq = new WorkQueue(null, SHARED_QUEUE);
+ if (lock.tryLock()) {
+ try {
+ WorkQueue[] ws = workQueues;
+ if (ws != null && idx < ws.length) {
+ if ((q = ws[idx]) == null) {
+ int rs; // update runState seq
+ ws[idx] = q = nq;
+ runState = (((rs = runState) & SHUTDOWN) |
+ ((rs + RS_SEQ) & ~SHUTDOWN));
+ }
+ }
+ } finally {
+ lock.unlock();
+ }
+ }
+ }
+ return q;
}
- // Waiting for and signalling events
+ // Maintaining ctl counts
/**
- * Releases workers blocked on a count not equal to current count.
- * Normally called after precheck that eventWaiters isn't zero to
- * avoid wasted array checks. Gives up upon a change in count or
- * contention, letting other workers take over.
- */
- private void releaseEventWaiters() {
- ForkJoinWorkerThread[] ws = workers;
- int n = ws.length;
- long h = eventWaiters;
- int ec = eventCount;
- ForkJoinWorkerThread w; int id;
- while ((int)(h >>> EVENT_COUNT_SHIFT) != ec &&
- (id = ((int)(h & WAITER_ID_MASK)) - 1) >= 0 &&
- id < n && (w = ws[id]) != null &&
- UNSAFE.compareAndSwapLong(this, eventWaitersOffset,
- h, h = w.nextWaiter)) {
- LockSupport.unpark(w);
- if (eventWaiters != h || eventCount != ec)
- break;
- }
+ * Increments active count; mainly called upon return from blocking.
+ */
+ final void incrementActiveCount() {
+ long c;
+ do {} while (!U.compareAndSwapLong(this, CTL, c = ctl, c + AC_UNIT));
}
/**
- * Tries to advance eventCount and releases waiters. Called only
- * from workers.
+ * Activates or creates a worker.
*/
final void signalWork() {
- int c; // try to increment event count -- CAS failure OK
- UNSAFE.compareAndSwapInt(this, eventCountOffset, c = eventCount, c+1);
- if (eventWaiters != 0L)
- releaseEventWaiters();
- }
-
- /**
- * Adds the given worker to event queue and blocks until
- * terminating or event count advances from the workers
- * lastEventCount value
- *
- * @param w the calling worker thread
- */
- private void eventSync(ForkJoinWorkerThread w) {
- int ec = w.lastEventCount;
- long nh = (((long)ec) << EVENT_COUNT_SHIFT) | ((long)(w.poolIndex+1));
- long h;
- while ((runState < SHUTDOWN || !tryTerminate(false)) &&
- (((int)((h = eventWaiters) & WAITER_ID_MASK)) == 0 ||
- (int)(h >>> EVENT_COUNT_SHIFT) == ec) &&
- eventCount == ec) {
- if (UNSAFE.compareAndSwapLong(this, eventWaitersOffset,
- w.nextWaiter = h, nh)) {
- awaitEvent(w, ec);
- break;
+ /*
+ * The while condition is true if: (there is are too few total
+ * workers OR there is at least one waiter) AND (there are too
+ * few active workers OR the pool is terminating). The value
+ * of e distinguishes the remaining cases: zero (no waiters)
+ * for create, negative if terminating (in which case do
+ * nothing), else release a waiter. The secondary checks for
+ * release (non-null array etc) can fail if the pool begins
+ * terminating after the test, and don't impose any added cost
+ * because JVMs must perform null and bounds checks anyway.
+ */
+ long c; int e, u;
+ while ((((e = (int)(c = ctl)) | (u = (int)(c >>> 32))) &
+ (INT_SIGN|SHORT_SIGN)) == (INT_SIGN|SHORT_SIGN)) {
+ WorkQueue[] ws = workQueues; int i; WorkQueue w; Thread p;
+ if (e == 0) { // add a new worker
+ if (U.compareAndSwapLong
+ (this, CTL, c, (long)(((u + UTC_UNIT) & UTC_MASK) |
+ ((u + UAC_UNIT) & UAC_MASK)) << 32)) {
+ addWorker();
+ break;
+ }
}
- }
- }
-
- /**
- * Blocks the given worker (that has already been entered as an
- * event waiter) until terminating or event count advances from
- * the given value. The oldest (first) waiter uses a timed wait to
- * occasionally one-by-one shrink the number of workers (to a
- * minumum of one) if the pool has not been used for extended
- * periods.
- *
- * @param w the calling worker thread
- * @param ec the count
- */
- private void awaitEvent(ForkJoinWorkerThread w, int ec) {
- while (eventCount == ec) {
- if (tryAccumulateStealCount(w)) { // transfer while idle
- boolean untimed = (w.nextWaiter != 0L ||
- (workerCounts & RUNNING_COUNT_MASK) <= 1);
- long startTime = untimed? 0 : System.nanoTime();
- Thread.interrupted(); // clear/ignore interrupt
- if (eventCount != ec || !w.isRunning() ||
- runState >= TERMINATING) // recheck after clear
+ else if (e > 0 && ws != null &&
+ (i = ((~e << 1) | 1) & SMASK) < ws.length &&
+ (w = ws[i]) != null &&
+ w.eventCount == (e | INT_SIGN)) {
+ if (U.compareAndSwapLong
+ (this, CTL, c, (((long)(w.nextWait & E_MASK)) |
+ ((long)(u + UAC_UNIT) << 32)))) {
+ w.eventCount = (e + E_SEQ) & E_MASK;
+ if ((p = w.parker) != null)
+ U.unpark(p); // release a waiting worker
break;
- if (untimed)
- LockSupport.park(w);
- else {
- LockSupport.parkNanos(w, SHRINK_RATE_NANOS);
- if (eventCount != ec || !w.isRunning() ||
- runState >= TERMINATING)
- break;
- if (System.nanoTime() - startTime >= SHRINK_RATE_NANOS)
- tryShutdownWaiter(ec);
}
}
+ else
+ break;
}
}
/**
- * Callback from the oldest waiter in awaitEvent waking up after a
- * period of non-use. Tries (once) to shutdown an event waiter (or
- * a spare, if one exists). Note that we don't need CAS or locks
- * here because the method is called only from one thread
- * occasionally waking (and even misfires are OK). Note that
- * until the shutdown worker fully terminates, workerCounts
- * will overestimate total count, which is tolerable.
- *
- * @param ec the event count waited on by caller (to abort
- * attempt if count has since changed).
- */
- private void tryShutdownWaiter(int ec) {
- if (spareWaiters != 0) { // prefer killing spares
- tryShutdownSpare();
- return;
- }
- ForkJoinWorkerThread[] ws = workers;
- int n = ws.length;
- long h = eventWaiters;
- ForkJoinWorkerThread w; int id; long nh;
- if (runState == 0 &&
- submissionQueue.isEmpty() &&
- eventCount == ec &&
- (id = ((int)(h & WAITER_ID_MASK)) - 1) >= 0 &&
- id < n && (w = ws[id]) != null &&
- (nh = w.nextWaiter) != 0L && // keep at least one worker
- UNSAFE.compareAndSwapLong(this, eventWaitersOffset, h, nh)) {
- w.shutdown();
- LockSupport.unpark(w);
+ * Tries to decrement active count (sometimes implicitly) and
+ * possibly release or create a compensating worker in preparation
+ * for blocking. Fails on contention or termination.
+ *
+ * @return true if the caller can block, else should recheck and retry
+ */
+ final boolean tryCompensate() {
+ WorkQueue[] ws; WorkQueue w; Thread p;
+ int pc = parallelism, e, u, ac, tc, i;
+ long c = ctl;
+
+ if ((e = (int)c) >= 0) {
+ if ((ac = ((u = (int)(c >>> 32)) >> UAC_SHIFT)) <= 0 &&
+ e != 0 && (ws = workQueues) != null &&
+ (i = ((~e << 1) | 1) & SMASK) < ws.length &&
+ (w = ws[i]) != null) {
+ if (w.eventCount == (e | INT_SIGN) &&
+ U.compareAndSwapLong
+ (this, CTL, c, ((long)(w.nextWait & E_MASK) |
+ (c & (AC_MASK|TC_MASK))))) {
+ w.eventCount = (e + E_SEQ) & E_MASK;
+ if ((p = w.parker) != null)
+ U.unpark(p);
+ return true; // release an idle worker
+ }
+ }
+ else if ((tc = (short)(u >>> UTC_SHIFT)) >= 0 && ac + pc > 1) {
+ long nc = ((c - AC_UNIT) & AC_MASK) | (c & ~AC_MASK);
+ if (U.compareAndSwapLong(this, CTL, c, nc))
+ return true; // no compensation needed
+ }
+ else if (tc + pc < MAX_ID) {
+ long nc = ((c + TC_UNIT) & TC_MASK) | (c & ~TC_MASK);
+ if (U.compareAndSwapLong(this, CTL, c, nc)) {
+ addWorker();
+ return true; // create replacement
+ }
+ }
}
- releaseEventWaiters();
+ return false;
}
- // Maintaining spares
-
- /**
- * Pushes worker onto the spare stack
- */
- final void pushSpare(ForkJoinWorkerThread w) {
- int ns = (++w.spareCount << SPARE_COUNT_SHIFT) | (w.poolIndex + 1);
- do {} while (!UNSAFE.compareAndSwapInt(this, spareWaitersOffset,
- w.nextSpare = spareWaiters,ns));
- }
+ // Submissions
/**
- * Callback from oldest spare occasionally waking up. Tries
- * (once) to shutdown a spare. Same idea as tryShutdownWaiter.
+ * Unless shutting down, adds the given task to a submission queue
+ * at submitter's current queue index. If no queue exists at the
+ * index, one is created unless pool lock is busy. If the queue
+ * and/or lock are busy, another index is randomly chosen.
*/
- final void tryShutdownSpare() {
- int sw, id;
- ForkJoinWorkerThread w;
- ForkJoinWorkerThread[] ws;
- if ((id = ((sw = spareWaiters) & SPARE_ID_MASK) - 1) >= 0 &&
- id < (ws = workers).length && (w = ws[id]) != null &&
- (workerCounts & RUNNING_COUNT_MASK) >= parallelism &&
- UNSAFE.compareAndSwapInt(this, spareWaitersOffset,
- sw, w.nextSpare)) {
- w.shutdown();
- LockSupport.unpark(w);
- advanceEventCount();
+ private void doSubmit(ForkJoinTask task) {
+ if (task == null)
+ throw new NullPointerException();
+ Submitter s = submitters.get();
+ for (int r = s.seed;;) {
+ WorkQueue q; int k;
+ int rs = runState, m = rs & SMASK;
+ WorkQueue[] ws = workQueues;
+ if (rs < 0 || ws == null) // shutting down
+ throw new RejectedExecutionException();
+ if (ws.length > m && // k must be at index
+ ((q = ws[k = (r << 1) & m]) != null ||
+ (q = tryAddSharedQueue(k)) != null) &&
+ q.trySharedPush(task)) {
+ signalWork();
+ return;
+ }
+ r ^= r << 13; // xorshift seed to new position
+ r ^= r >>> 17;
+ if (((s.seed = r ^= r << 5) & m) == 0)
+ Thread.yield(); // occasionally yield if busy
+ }
+ }
+
+
+ // Scanning for tasks
+
+ /**
+ * Scans for and, if found, returns one task, else possibly
+ * inactivates the worker. This method operates on single reads of
+ * volatile state and is designed to be re-invoked continuously in
+ * part because it returns upon detecting inconsistencies,
+ * contention, or state changes that indicate possible success on
+ * re-invocation.
+ *
+ * The scan searches for tasks across queues, randomly selecting
+ * the first #queues probes, favoring steals 2:1 over submissions
+ * (by exploiting even/odd indexing), and then performing a
+ * circular sweep of all queues. The scan terminates upon either
+ * finding a non-empty queue, or completing a full sweep. If the
+ * worker is not inactivated, it takes and returns a task from
+ * this queue. On failure to find a task, we take one of the
+ * following actions, after which the caller will retry calling
+ * this method unless terminated.
+ *
+ * * If not a complete sweep, try to release a waiting worker. If
+ * the scan terminated because the worker is inactivated, then the
+ * released worker will often be the calling worker, and it can
+ * succeed obtaining a task on the next call. Or maybe it is
+ * another worker, but with same net effect. Releasing in other
+ * cases as well ensures that we have enough workers running.
+ *
+ * * If the caller has run a task since the last empty scan,
+ * return (to allow rescan) if other workers are not also yet
+ * enqueued. Field WorkQueue.rescans counts down on each scan to
+ * ensure eventual inactivation, and occasional calls to
+ * Thread.yield to help avoid interference with more useful
+ * activities on the system.
+ *
+ * * If pool is terminating, terminate the worker.
+ *
+ * * If not already enqueued, try to inactivate and enqueue the
+ * worker on wait queue.
+ *
+ * * If already enqueued and none of the above apply, either park
+ * awaiting signal, or if this is the most recent waiter and pool
+ * is quiescent, relay to idleAwaitWork to check for termination
+ * and possibly shrink pool.
+ *
+ * @param w the worker (via its WorkQueue)
+ * @return a task or null of none found
+ */
+ private final ForkJoinTask scan(WorkQueue w) {
+ boolean swept = false; // true after full empty scan
+ WorkQueue[] ws; // volatile read order matters
+ int r = w.seed, ec = w.eventCount; // ec is negative if inactive
+ int rs = runState, m = rs & SMASK;
+ if ((ws = workQueues) != null && ws.length > m) {
+ ForkJoinTask task = null;
+ for (int k = 0, j = -2 - m; ; ++j) {
+ WorkQueue q; int b;
+ if (j < 0) { // random probes while j negative
+ r ^= r << 13; r ^= r >>> 17; k = (r ^= r << 5) | (j & 1);
+ } // worker (not submit) for odd j
+ else // cyclic scan when j >= 0
+ k += (m >>> 1) | 1; // step by half to reduce bias
+
+ if ((q = ws[k & m]) != null && (b = q.base) - q.top < 0) {
+ if (ec >= 0)
+ task = q.pollAt(b); // steal
+ break;
+ }
+ else if (j > m) {
+ if (rs == runState) // staleness check
+ swept = true;
+ break;
+ }
+ }
+ w.seed = r; // save seed for next scan
+ if (task != null)
+ return task;
+ }
+
+ // Decode ctl on empty scan
+ long c = ctl; int e = (int)c, a = (int)(c >> AC_SHIFT), nr, ns;
+ if (!swept) { // try to release a waiter
+ WorkQueue v; Thread p;
+ if (e > 0 && a < 0 && ws != null &&
+ (v = ws[((~e << 1) | 1) & m]) != null &&
+ v.eventCount == (e | INT_SIGN) && U.compareAndSwapLong
+ (this, CTL, c, ((long)(v.nextWait & E_MASK) |
+ ((c + AC_UNIT) & (AC_MASK|TC_MASK))))) {
+ v.eventCount = (e + E_SEQ) & E_MASK;
+ if ((p = v.parker) != null)
+ U.unpark(p);
+ }
}
+ else if ((nr = w.rescans) > 0) { // continue rescanning
+ int ac = a + parallelism;
+ if ((w.rescans = (ac < nr) ? ac : nr - 1) > 0 && w.seed < 0 &&
+ w.eventCount == ec)
+ Thread.yield(); // 1 bit randomness for yield call
+ }
+ else if (e < 0) // pool is terminating
+ w.runState = -1;
+ else if (ec >= 0) { // try to enqueue
+ long nc = (long)ec | ((c - AC_UNIT) & (AC_MASK|TC_MASK));
+ w.nextWait = e;
+ w.eventCount = ec | INT_SIGN; // mark as inactive
+ if (!U.compareAndSwapLong(this, CTL, c, nc))
+ w.eventCount = ec; // back out on CAS failure
+ else if ((ns = w.nsteals) != 0) { // set rescans if ran task
+ if (a <= 0) // ... unless too many active
+ w.rescans = a + parallelism;
+ w.nsteals = 0;
+ w.totalSteals += ns;
+ }
+ }
+ else{ // already queued
+ if (parallelism == -a)
+ idleAwaitWork(w); // quiescent
+ if (w.eventCount == ec) {
+ Thread.interrupted(); // clear status
+ ForkJoinWorkerThread wt = w.owner;
+ U.putObject(wt, PARKBLOCKER, this);
+ w.parker = wt; // emulate LockSupport.park
+ if (w.eventCount == ec) // recheck
+ U.park(false, 0L); // block
+ w.parker = null;
+ U.putObject(wt, PARKBLOCKER, null);
+ }
+ }
+ return null;
}
/**
- * Tries (once) to resume a spare if worker counts match
- * the given count.
- *
- * @param wc workerCounts value on invocation of this method
- */
- private void tryResumeSpare(int wc) {
- ForkJoinWorkerThread[] ws = workers;
- int n = ws.length;
- int sw, id, rs; ForkJoinWorkerThread w;
- if ((id = ((sw = spareWaiters) & SPARE_ID_MASK) - 1) >= 0 &&
- id < n && (w = ws[id]) != null &&
- (rs = runState) < TERMINATING &&
- eventWaiters == 0L && workerCounts == wc) {
- // In case all workers busy, heuristically back off to let settle
- Thread.yield();
- if (eventWaiters == 0L && runState == rs && // recheck
- workerCounts == wc && spareWaiters == sw &&
- UNSAFE.compareAndSwapInt(this, spareWaitersOffset,
- sw, w.nextSpare)) {
- int c; // increment running count before resume
- do {} while(!UNSAFE.compareAndSwapInt
- (this, workerCountsOffset,
- c = workerCounts, c + ONE_RUNNING));
- if (w.tryUnsuspend())
- LockSupport.unpark(w);
- else // back out if w was shutdown
- decrementWorkerCounts(ONE_RUNNING, 0);
+ * If inactivating worker w has caused pool to become quiescent,
+ * checks for pool termination, and, so long as this is not the
+ * only worker, waits for event for up to SHRINK_RATE nanosecs.
+ * On timeout, if ctl has not changed, terminates the worker,
+ * which will in turn wake up another worker to possibly repeat
+ * this process.
+ *
+ * @param w the calling worker
+ */
+ private void idleAwaitWork(WorkQueue w) {
+ long c; int nw, ec;
+ if (!tryTerminate(false) &&
+ (int)((c = ctl) >> AC_SHIFT) + parallelism == 0 &&
+ (ec = w.eventCount) == ((int)c | INT_SIGN) &&
+ (nw = w.nextWait) != 0) {
+ long nc = ((long)(nw & E_MASK) | // ctl to restore on timeout
+ ((c + AC_UNIT) & AC_MASK) | (c & TC_MASK));
+ ForkJoinTask.helpExpungeStaleExceptions(); // help clean
+ ForkJoinWorkerThread wt = w.owner;
+ while (ctl == c) {
+ long startTime = System.nanoTime();
+ Thread.interrupted(); // timed variant of version in scan()
+ U.putObject(wt, PARKBLOCKER, this);
+ w.parker = wt;
+ if (ctl == c)
+ U.park(false, SHRINK_RATE);
+ w.parker = null;
+ U.putObject(wt, PARKBLOCKER, null);
+ if (ctl != c)
+ break;
+ if (System.nanoTime() - startTime >= SHRINK_TIMEOUT &&
+ U.compareAndSwapLong(this, CTL, c, nc)) {
+ w.runState = -1; // shrink
+ w.eventCount = (ec + E_SEQ) | E_MASK;
+ break;
+ }
}
}
}
- // adding workers on demand
-
/**
- * Adds one or more workers if needed to establish target parallelism.
- * Retries upon contention.
- */
- private void addWorkerIfBelowTarget() {
- int pc = parallelism;
- int wc;
- while (((wc = workerCounts) >>> TOTAL_COUNT_SHIFT) < pc &&
- runState < TERMINATING) {
- if (UNSAFE.compareAndSwapInt(this, workerCountsOffset, wc,
- wc + (ONE_RUNNING|ONE_TOTAL))) {
- if (addWorker() == null)
- break;
+ * Tries to locate and execute tasks for a stealer of the given
+ * task, or in turn one of its stealers, Traces currentSteal ->
+ * currentJoin links looking for a thread working on a descendant
+ * of the given task and with a non-empty queue to steal back and
+ * execute tasks from. The first call to this method upon a
+ * waiting join will often entail scanning/search, (which is OK
+ * because the joiner has nothing better to do), but this method
+ * leaves hints in workers to speed up subsequent calls. The
+ * implementation is very branchy to cope with potential
+ * inconsistencies or loops encountering chains that are stale,
+ * unknown, or of length greater than MAX_HELP_DEPTH links. All
+ * of these cases are dealt with by just retrying by caller.
+ *
+ * @param joiner the joining worker
+ * @param task the task to join
+ * @return true if found or ran a task (and so is immediately retryable)
+ */
+ final boolean tryHelpStealer(WorkQueue joiner, ForkJoinTask task) {
+ ForkJoinTask subtask; // current target
+ boolean progress = false;
+ int depth = 0; // current chain depth
+ int m = runState & SMASK;
+ WorkQueue[] ws = workQueues;
+
+ if (ws != null && ws.length > m && (subtask = task).status >= 0) {
+ outer:for (WorkQueue j = joiner;;) {
+ // Try to find the stealer of subtask, by first using hint
+ WorkQueue stealer = null;
+ WorkQueue v = ws[j.stealHint & m];
+ if (v != null && v.currentSteal == subtask)
+ stealer = v;
+ else {
+ for (int i = 1; i <= m; i += 2) {
+ if ((v = ws[i]) != null && v.currentSteal == subtask) {
+ stealer = v;
+ j.stealHint = i; // save hint
+ break;
+ }
+ }
+ if (stealer == null)
+ break;
+ }
+
+ for (WorkQueue q = stealer;;) { // Try to help stealer
+ ForkJoinTask t; int b;
+ if (task.status < 0)
+ break outer;
+ if ((b = q.base) - q.top < 0) {
+ progress = true;
+ if (subtask.status < 0)
+ break outer; // stale
+ if ((t = q.pollAt(b)) != null) {
+ stealer.stealHint = joiner.poolIndex;
+ joiner.runSubtask(t);
+ }
+ }
+ else { // empty - try to descend to find stealer's stealer
+ ForkJoinTask next = stealer.currentJoin;
+ if (++depth == MAX_HELP_DEPTH || subtask.status < 0 ||
+ next == null || next == subtask)
+ break outer; // max depth, stale, dead-end, cyclic
+ subtask = next;
+ j = stealer;
+ break;
+ }
+ }
}
}
+ return progress;
}
/**
- * Tries (once) to add a new worker if all existing workers are
- * busy, and there are either no running workers or the deficit is
- * at least twice the surplus.
+ * If task is at base of some steal queue, steals and executes it.
*
- * @param wc workerCounts value on invocation of this method
+ * @param joiner the joining worker
+ * @param task the task
*/
- private void tryAddWorkerIfBusy(int wc) {
- int tc, rc, rs;
- int pc = parallelism;
- if ((tc = wc >>> TOTAL_COUNT_SHIFT) < MAX_WORKERS &&
- ((rc = wc & RUNNING_COUNT_MASK) == 0 ||
- rc < pc - ((tc - pc) << 1)) &&
- (rs = runState) < TERMINATING &&
- (rs & ACTIVE_COUNT_MASK) == tc) {
- // Since all workers busy, heuristically back off to let settle
- Thread.yield();
- if (eventWaiters == 0L && spareWaiters == 0 && // recheck
- runState == rs && workerCounts == wc &&
- UNSAFE.compareAndSwapInt(this, workerCountsOffset, wc,
- wc + (ONE_RUNNING|ONE_TOTAL)))
- addWorker();
+ final void tryPollForAndExec(WorkQueue joiner, ForkJoinTask task) {
+ WorkQueue[] ws;
+ int m = runState & SMASK;
+ if ((ws = workQueues) != null && ws.length > m) {
+ for (int j = 1; j <= m && task.status >= 0; j += 2) {
+ WorkQueue q = ws[j];
+ if (q != null && q.pollFor(task)) {
+ joiner.runSubtask(task);
+ break;
+ }
+ }
}
}
/**
- * Does at most one of:
- *
- * 1. Help wake up existing workers waiting for work via
- * releaseEventWaiters. (If any exist, then it doesn't
- * matter right now if under target parallelism level.)
- *
- * 2. If a spare exists, try (once) to resume it via tryResumeSpare.
- *
- * 3. If there are not enough total workers, add some
- * via addWorkerIfBelowTarget;
- *
- * 4. Try (once) to add a new worker if all existing workers
- * are busy, via tryAddWorkerIfBusy
- */
- private void helpMaintainParallelism() {
- long h; int pc, wc;
- if (((int)((h = eventWaiters) & WAITER_ID_MASK)) != 0) {
- if ((int)(h >>> EVENT_COUNT_SHIFT) != eventCount)
- releaseEventWaiters(); // avoid useless call
- }
- else if ((pc = parallelism) >
- ((wc = workerCounts) & RUNNING_COUNT_MASK)) {
- if (spareWaiters != 0)
- tryResumeSpare(wc);
- else if ((wc >>> TOTAL_COUNT_SHIFT) < pc)
- addWorkerIfBelowTarget();
- else
- tryAddWorkerIfBusy(wc);
+ * Returns a non-empty steal queue, if one is found during a random,
+ * then cyclic scan, else null. This method must be retried by
+ * caller if, by the time it tries to use the queue, it is empty.
+ */
+ private WorkQueue findNonEmptyStealQueue(WorkQueue w) {
+ int r = w.seed; // Same idea as scan(), but ignoring submissions
+ for (WorkQueue[] ws;;) {
+ int m = runState & SMASK;
+ if ((ws = workQueues) == null)
+ return null;
+ if (ws.length > m) {
+ WorkQueue q;
+ for (int n = m << 2, k = r, j = -n;;) {
+ r ^= r << 13; r ^= r >>> 17; r ^= r << 5;
+ if ((q = ws[(k | 1) & m]) != null && q.base - q.top < 0) {
+ w.seed = r;
+ return q;
+ }
+ else if (j > n)
+ return null;
+ else
+ k = (j++ < 0) ? r : k + ((m >>> 1) | 1);
+
+ }
+ }
}
}
/**
- * Callback from workers invoked upon each top-level action (i.e.,
- * stealing a task or taking a submission and running it).
- * Performs one or more of the following:
- *
- * 1. If the worker is active, try to set its active status to
- * inactive and update activeCount. On contention, we may try
- * again on this or subsequent call.
- *
- * 2. Release any existing event waiters that are now relesable
- *
- * 3. If there are too many running threads, suspend this worker
- * (first forcing inactive if necessary). If it is not
- * needed, it may be killed while suspended via
- * tryShutdownSpare. Otherwise, upon resume it rechecks to make
- * sure that it is still needed.
- *
- * 4. If more than 1 miss, await the next task event via
- * eventSync (first forcing inactivation if necessary), upon
- * which worker may also be killed, via tryShutdownWaiter.
- *
- * 5. Help reactivate other workers via helpMaintainParallelism
- *
- * @param w the worker
- * @param misses the number of scans by caller failing to find work
- * (saturating at 2 to avoid wraparound)
- */
- final void preStep(ForkJoinWorkerThread w, int misses) {
- boolean active = w.active;
- int pc = parallelism;
- for (;;) {
- int rs, wc, rc, ec; long h;
- if (active && UNSAFE.compareAndSwapInt(this, runStateOffset,
- rs = runState, rs - 1))
- active = w.active = false;
- if (((int)((h = eventWaiters) & WAITER_ID_MASK)) != 0 &&
- (int)(h >>> EVENT_COUNT_SHIFT) != eventCount) {
- releaseEventWaiters();
- if (misses > 1)
- continue; // clear before sync below
- }
- if ((rc = ((wc = workerCounts) & RUNNING_COUNT_MASK)) > pc) {
- if (!active && // must inactivate to suspend
- workerCounts == wc && // try to suspend as spare
- UNSAFE.compareAndSwapInt(this, workerCountsOffset,
- wc, wc - ONE_RUNNING)) {
- w.suspendAsSpare();
- if (!w.isRunning())
- break; // was killed while spare
- }
- continue;
- }
- if (misses > 0) {
- if ((ec = eventCount) == w.lastEventCount && misses > 1) {
- if (!active) { // must inactivate to sync
- eventSync(w);
- if (w.isRunning())
- misses = 1; // don't re-sync
- else
- break; // was killed while waiting
- }
- continue;
+ * Runs tasks until {@code isQuiescent()}. We piggyback on
+ * active count ctl maintenance, but rather than blocking
+ * when tasks cannot be found, we rescan until all others cannot
+ * find tasks either.
+ */
+ final void helpQuiescePool(WorkQueue w) {
+ for (boolean active = true;;) {
+ w.runLocalTasks(); // exhaust local queue
+ WorkQueue q = findNonEmptyStealQueue(w);
+ if (q != null) {
+ ForkJoinTask t;
+ if (!active) { // re-establish active count
+ long c;
+ active = true;
+ do {} while (!U.compareAndSwapLong
+ (this, CTL, c = ctl, c + AC_UNIT));
+ }
+ if ((t = q.poll()) != null)
+ w.runSubtask(t);
+ }
+ else {
+ long c;
+ if (active) { // decrement active count without queuing
+ active = false;
+ do {} while (!U.compareAndSwapLong
+ (this, CTL, c = ctl, c -= AC_UNIT));
+ }
+ else
+ c = ctl; // re-increment on exit
+ if ((int)(c >> AC_SHIFT) + parallelism == 0) {
+ do {} while (!U.compareAndSwapLong
+ (this, CTL, c = ctl, c + AC_UNIT));
+ break;
}
- w.lastEventCount = ec;
}
- if (rc < pc)
- helpMaintainParallelism();
- break;
}
}
/**
- * Helps and/or blocks awaiting join of the given task.
- * Alternates between helpJoinTask() and helpMaintainParallelism()
- * as many times as there is a deficit in running count (or longer
- * if running count would become zero), then blocks if task still
- * not done.
+ * Gets and removes a local or stolen task for the given worker.
*
- * @param joinMe the task to join
+ * @return a task, if available
*/
- final void awaitJoin(ForkJoinTask joinMe, ForkJoinWorkerThread worker) {
- int threshold = parallelism; // descend blocking thresholds
- while (joinMe.status >= 0) {
- boolean block; int wc;
- worker.helpJoinTask(joinMe);
- if (joinMe.status < 0)
- break;
- if (((wc = workerCounts) & RUNNING_COUNT_MASK) <= threshold) {
- if (threshold > 0)
- --threshold;
- else
- advanceEventCount(); // force release
- block = false;
- }
- else
- block = UNSAFE.compareAndSwapInt(this, workerCountsOffset,
- wc, wc - ONE_RUNNING);
- helpMaintainParallelism();
- if (block) {
- int c;
- joinMe.internalAwaitDone();
- do {} while (!UNSAFE.compareAndSwapInt
- (this, workerCountsOffset,
- c = workerCounts, c + ONE_RUNNING));
- break;
- }
+ final ForkJoinTask nextTaskFor(WorkQueue w) {
+ for (ForkJoinTask t;;) {
+ WorkQueue q;
+ if ((t = w.nextLocalTask()) != null)
+ return t;
+ if ((q = findNonEmptyStealQueue(w)) == null)
+ return null;
+ if ((t = q.poll()) != null)
+ return t;
}
}
/**
- * Same idea as awaitJoin, but no helping
+ * Returns the approximate (non-atomic) number of idle threads per
+ * active thread to offset steal queue size for method
+ * ForkJoinTask.getSurplusQueuedTaskCount().
*/
- final void awaitBlocker(ManagedBlocker blocker)
- throws InterruptedException {
- int threshold = parallelism;
- while (!blocker.isReleasable()) {
- boolean block; int wc;
- if (((wc = workerCounts) & RUNNING_COUNT_MASK) <= threshold) {
- if (threshold > 0)
- --threshold;
- else
- advanceEventCount();
- block = false;
- }
- else
- block = UNSAFE.compareAndSwapInt(this, workerCountsOffset,
- wc, wc - ONE_RUNNING);
- helpMaintainParallelism();
- if (block) {
- try {
- do {} while (!blocker.isReleasable() && !blocker.block());
- } finally {
- int c;
- do {} while (!UNSAFE.compareAndSwapInt
- (this, workerCountsOffset,
- c = workerCounts, c + ONE_RUNNING));
- }
- break;
- }
+ final int idlePerActive() {
+ // Approximate at powers of two for small values, saturate past 4
+ int p = parallelism;
+ int a = p + (int)(ctl >> AC_SHIFT);
+ return (a > (p >>>= 1) ? 0 :
+ a > (p >>>= 1) ? 1 :
+ a > (p >>>= 1) ? 2 :
+ a > (p >>>= 1) ? 4 :
+ 8);
+ }
+
+ // Termination
+
+ /**
+ * Sets SHUTDOWN bit of runState under lock
+ */
+ private void enableShutdown() {
+ ReentrantLock lock = this.lock;
+ if (runState >= 0) {
+ lock.lock(); // don't need try/finally
+ runState |= SHUTDOWN;
+ lock.unlock();
}
}
/**
- * Possibly initiates and/or completes termination.
+ * Possibly initiates and/or completes termination. Upon
+ * termination, cancels all queued tasks and then
*
* @param now if true, unconditionally terminate, else only
- * if shutdown and empty queue and no active workers
+ * if no work and no active workers
* @return true if now terminating or terminated
*/
private boolean tryTerminate(boolean now) {
- if (now)
- advanceRunLevel(SHUTDOWN); // ensure at least SHUTDOWN
- else if (runState < SHUTDOWN ||
- !submissionQueue.isEmpty() ||
- (runState & ACTIVE_COUNT_MASK) != 0)
- return false;
-
- if (advanceRunLevel(TERMINATING))
- startTerminating();
-
- // Finish now if all threads terminated; else in some subsequent call
- if ((workerCounts >>> TOTAL_COUNT_SHIFT) == 0) {
- advanceRunLevel(TERMINATED);
- termination.arrive();
+ for (long c;;) {
+ if (((c = ctl) & STOP_BIT) != 0) { // already terminating
+ if ((short)(c >>> TC_SHIFT) == -parallelism) {
+ ReentrantLock lock = this.lock; // signal when no workers
+ lock.lock(); // don't need try/finally
+ termination.signalAll(); // signal when 0 workers
+ lock.unlock();
+ }
+ return true;
+ }
+ if (!now) {
+ if ((int)(c >> AC_SHIFT) != -parallelism || runState >= 0 ||
+ hasQueuedSubmissions())
+ return false;
+ // Check for unqueued inactive workers. One pass suffices.
+ WorkQueue[] ws = workQueues; WorkQueue w;
+ if (ws != null) {
+ int n = ws.length;
+ for (int i = 1; i < n; i += 2) {
+ if ((w = ws[i]) != null && w.eventCount >= 0)
+ return false;
+ }
+ }
+ }
+ if (U.compareAndSwapLong(this, CTL, c, c | STOP_BIT))
+ startTerminating();
}
- return true;
}
/**
- * Actions on transition to TERMINATING
- *
- * Runs up to four passes through workers: (0) shutting down each
- * (without waking up if parked) to quickly spread notifications
- * without unnecessary bouncing around event queues etc (1) wake
- * up and help cancel tasks (2) interrupt (3) mop up races with
- * interrupted workers
+ * Initiates termination: Runs three passes through workQueues:
+ * (0) Setting termination status, followed by wakeups of queued
+ * workers; (1) cancelling all tasks; (2) interrupting lagging
+ * threads (likely in external tasks, but possibly also blocked in
+ * joins). Each pass repeats previous steps because of potential
+ * lagging thread creation.
*/
private void startTerminating() {
- cancelSubmissions();
- for (int passes = 0; passes < 4 && workerCounts != 0; ++passes) {
- advanceEventCount();
- eventWaiters = 0L; // clobber lists
- spareWaiters = 0;
- ForkJoinWorkerThread[] ws = workers;
- int n = ws.length;
- for (int i = 0; i < n; ++i) {
- ForkJoinWorkerThread w = ws[i];
- if (w != null) {
- w.shutdown();
- if (passes > 0 && !w.isTerminated()) {
- w.cancelTasks();
- LockSupport.unpark(w);
- if (passes > 1) {
- try {
- w.interrupt();
- } catch (SecurityException ignore) {
+ for (int pass = 0; pass < 3; ++pass) {
+ WorkQueue[] ws = workQueues;
+ if (ws != null) {
+ WorkQueue w; Thread wt;
+ int n = ws.length;
+ for (int j = 0; j < n; ++j) {
+ if ((w = ws[j]) != null) {
+ w.runState = -1;
+ if (pass > 0) {
+ w.cancelAll();
+ if (pass > 1 && (wt = w.owner) != null &&
+ !wt.isInterrupted()) {
+ try {
+ wt.interrupt();
+ } catch (SecurityException ignore) {
+ }
}
}
}
}
+ // Wake up workers parked on event queue
+ int i, e; long c; Thread p;
+ while ((i = ((~(e = (int)(c = ctl)) << 1) | 1) & SMASK) < n &&
+ (w = ws[i]) != null &&
+ w.eventCount == (e | INT_SIGN)) {
+ long nc = ((long)(w.nextWait & E_MASK) |
+ ((c + AC_UNIT) & AC_MASK) |
+ (c & (TC_MASK|STOP_BIT)));
+ if (U.compareAndSwapLong(this, CTL, c, nc)) {
+ w.eventCount = (e + E_SEQ) & E_MASK;
+ if ((p = w.parker) != null)
+ U.unpark(p);
+ }
+ }
}
}
}
- /**
- * Clear out and cancel submissions, ignoring exceptions
- */
- private void cancelSubmissions() {
- ForkJoinTask task;
- while ((task = submissionQueue.poll()) != null) {
- try {
- task.cancel(false);
- } catch (Throwable ignore) {
- }
- }
- }
-
- // misc support for ForkJoinWorkerThread
-
- /**
- * Returns pool number
- */
- final int getPoolNumber() {
- return poolNumber;
- }
-
- /**
- * Tries to accumulates steal count from a worker, clearing
- * the worker's value.
- *
- * @return true if worker steal count now zero
- */
- final boolean tryAccumulateStealCount(ForkJoinWorkerThread w) {
- int sc = w.stealCount;
- long c = stealCount;
- // CAS even if zero, for fence effects
- if (UNSAFE.compareAndSwapLong(this, stealCountOffset, c, c + sc)) {
- if (sc != 0)
- w.stealCount = 0;
- return true;
- }
- return sc == 0;
- }
-
- /**
- * Returns the approximate (non-atomic) number of idle threads per
- * active thread.
- */
- final int idlePerActive() {
- int pc = parallelism; // use parallelism, not rc
- int ac = runState; // no mask -- artifically boosts during shutdown
- // Use exact results for small values, saturate past 4
- return pc <= ac? 0 : pc >>> 1 <= ac? 1 : pc >>> 2 <= ac? 3 : pc >>> 3;
- }
-
- // Public and protected methods
+ // Exported methods
// Constructors
@@ -1312,13 +1924,13 @@ public class ForkJoinPool extends Abstra
* use {@link #defaultForkJoinWorkerThreadFactory}.
* @param handler the handler for internal worker threads that
* terminate due to unrecoverable errors encountered while executing
- * tasks. For default value, use null.
+ * tasks. For default value, use {@code null}.
* @param asyncMode if true,
* establishes local first-in-first-out scheduling mode for forked
* tasks that are never joined. This mode may be more appropriate
* than default locally stack-based mode in applications in which
* worker threads only process event-style asynchronous tasks.
- * For default value, use false.
+ * For default value, use {@code false}.
* @throws IllegalArgumentException if parallelism less than or
* equal to zero, or greater than implementation limit
* @throws NullPointerException if the factory is null
@@ -1334,54 +1946,48 @@ public class ForkJoinPool extends Abstra
checkPermission();
if (factory == null)
throw new NullPointerException();
- if (parallelism <= 0 || parallelism > MAX_WORKERS)
+ if (parallelism <= 0 || parallelism > MAX_ID)
throw new IllegalArgumentException();
this.parallelism = parallelism;
this.factory = factory;
this.ueh = handler;
- this.locallyFifo = asyncMode;
- int arraySize = initialArraySizeFor(parallelism);
- this.workers = new ForkJoinWorkerThread[arraySize];
- this.submissionQueue = new LinkedTransferQueue>();
- this.workerLock = new ReentrantLock();
- this.termination = new Phaser(1);
- this.poolNumber = poolNumberGenerator.incrementAndGet();
- }
-
- /**
- * Returns initial power of two size for workers array.
- * @param pc the initial parallelism level
- */
- private static int initialArraySizeFor(int pc) {
- // See Hackers Delight, sec 3.2. We know MAX_WORKERS < (1 >>> 16)
- int size = pc < MAX_WORKERS ? pc + 1 : MAX_WORKERS;
- size |= size >>> 1;
- size |= size >>> 2;
- size |= size >>> 4;
- size |= size >>> 8;
- return size + 1;
+ this.localMode = asyncMode ? FIFO_QUEUE : LIFO_QUEUE;
+ this.nextPoolIndex = 1;
+ long np = (long)(-parallelism); // offset ctl counts
+ this.ctl = ((np << AC_SHIFT) & AC_MASK) | ((np << TC_SHIFT) & TC_MASK);
+ // initialize workQueues array with room for 2*parallelism if possible
+ int n = parallelism << 1;
+ if (n >= MAX_ID)
+ n = MAX_ID;
+ else { // See Hackers Delight, sec 3.2, where n < (1 << 16)
+ n |= n >>> 1; n |= n >>> 2; n |= n >>> 4; n |= n >>> 8;
+ }
+ this.workQueues = new WorkQueue[(n + 1) << 1];
+ ReentrantLock lck = this.lock = new ReentrantLock();
+ this.termination = lck.newCondition();
+ this.stealCount = new AtomicLong();
+ this.nextWorkerNumber = new AtomicInteger();
+ StringBuilder sb = new StringBuilder("ForkJoinPool-");
+ sb.append(poolNumberGenerator.incrementAndGet());
+ sb.append("-worker-");
+ this.workerNamePrefix = sb.toString();
+ // Create initial submission queue
+ WorkQueue sq = tryAddSharedQueue(0);
+ if (sq != null)
+ sq.growArray(false);
}
// Execution methods
/**
- * Common code for execute, invoke and submit
- */
- private void doSubmit(ForkJoinTask task) {
- if (task == null)
- throw new NullPointerException();
- if (runState >= SHUTDOWN)
- throw new RejectedExecutionException();
- submissionQueue.offer(task);
- advanceEventCount();
- if (eventWaiters != 0L)
- releaseEventWaiters();
- if ((workerCounts >>> TOTAL_COUNT_SHIFT) < parallelism)
- addWorkerIfBelowTarget();
- }
-
- /**
* Performs the given task, returning its result upon completion.
+ * If the computation encounters an unchecked Exception or Error,
+ * it is rethrown as the outcome of this invocation. Rethrown
+ * exceptions behave in the same way as regular exceptions, but,
+ * when possible, contain stack traces (as displayed for example
+ * using {@code ex.printStackTrace()}) of both the current thread
+ * as well as the thread actually encountering the exception;
+ * minimally only the latter.
*
* @param task the task
* @return the task's result
@@ -1414,6 +2020,8 @@ public class ForkJoinPool extends Abstra
* scheduled for execution
*/
public void execute(Runnable task) {
+ if (task == null)
+ throw new NullPointerException();
ForkJoinTask job;
if (task instanceof ForkJoinTask) // avoid re-wrap
job = (ForkJoinTask) task;
@@ -1442,6 +2050,8 @@ public class ForkJoinPool extends Abstra
* scheduled for execution
*/
public ForkJoinTask submit(Callable task) {
+ if (task == null)
+ throw new NullPointerException();
ForkJoinTask job = ForkJoinTask.adapt(task);
doSubmit(job);
return job;
@@ -1453,6 +2063,8 @@ public class ForkJoinPool extends Abstra
* scheduled for execution
*/
public ForkJoinTask submit(Runnable task, T result) {
+ if (task == null)
+ throw new NullPointerException();
ForkJoinTask job = ForkJoinTask.adapt(task, result);
doSubmit(job);
return job;
@@ -1464,6 +2076,8 @@ public class ForkJoinPool extends Abstra
* scheduled for execution
*/
public ForkJoinTask submit(Runnable task) {
+ if (task == null)
+ throw new NullPointerException();
ForkJoinTask job;
if (task instanceof ForkJoinTask) // avoid re-wrap
job = (ForkJoinTask) task;
@@ -1529,14 +2143,14 @@ public class ForkJoinPool extends Abstra
/**
* Returns the number of worker threads that have started but not
- * yet terminated. This result returned by this method may differ
+ * yet terminated. The result returned by this method may differ
* from {@link #getParallelism} when threads are created to
* maintain parallelism when others are cooperatively blocked.
*
* @return the number of worker threads
*/
public int getPoolSize() {
- return workerCounts >>> TOTAL_COUNT_SHIFT;
+ return parallelism + (short)(ctl >>> TC_SHIFT);
}
/**
@@ -1546,7 +2160,7 @@ public class ForkJoinPool extends Abstra
* @return {@code true} if this pool uses async mode
*/
public boolean getAsyncMode() {
- return locallyFifo;
+ return localMode != 0;
}
/**
@@ -1558,7 +2172,21 @@ public class ForkJoinPool extends Abstra
* @return the number of worker threads
*/
public int getRunningThreadCount() {
- return workerCounts & RUNNING_COUNT_MASK;
+ int rc = 0;
+ WorkQueue[] ws; WorkQueue w;
+ if ((ws = workQueues) != null) {
+ int n = ws.length;
+ for (int i = 1; i < n; i += 2) {
+ Thread.State s; ForkJoinWorkerThread wt;
+ if ((w = ws[i]) != null && (wt = w.owner) != null &&
+ w.eventCount >= 0 &&
+ (s = wt.getState()) != Thread.State.BLOCKED &&
+ s != Thread.State.WAITING &&
+ s != Thread.State.TIMED_WAITING)
+ ++rc;
+ }
+ }
+ return rc;
}
/**
@@ -1569,7 +2197,8 @@ public class ForkJoinPool extends Abstra
* @return the number of active threads
*/
public int getActiveThreadCount() {
- return runState & ACTIVE_COUNT_MASK;
+ int r = parallelism + (int)(ctl >> AC_SHIFT);
+ return (r <= 0) ? 0 : r; // suppress momentarily negative values
}
/**
@@ -1584,7 +2213,7 @@ public class ForkJoinPool extends Abstra
* @return {@code true} if all threads are currently idle
*/
public boolean isQuiescent() {
- return (runState & ACTIVE_COUNT_MASK) == 0;
+ return (int)(ctl >> AC_SHIFT) + parallelism == 0;
}
/**
@@ -1599,7 +2228,16 @@ public class ForkJoinPool extends Abstra
* @return the number of steals
*/
public long getStealCount() {
- return stealCount;
+ long count = stealCount.get();
+ WorkQueue[] ws; WorkQueue w;
+ if ((ws = workQueues) != null) {
+ int n = ws.length;
+ for (int i = 1; i < n; i += 2) {
+ if ((w = ws[i]) != null)
+ count += w.totalSteals;
+ }
+ }
+ return count;
}
/**
@@ -1614,25 +2252,35 @@ public class ForkJoinPool extends Abstra
*/
public long getQueuedTaskCount() {
long count = 0;
- ForkJoinWorkerThread[] ws = workers;
- int n = ws.length;
- for (int i = 0; i < n; ++i) {
- ForkJoinWorkerThread w = ws[i];
- if (w != null)
- count += w.getQueueSize();
+ WorkQueue[] ws; WorkQueue w;
+ if ((ws = workQueues) != null) {
+ int n = ws.length;
+ for (int i = 1; i < n; i += 2) {
+ if ((w = ws[i]) != null)
+ count += w.queueSize();
+ }
}
return count;
}
/**
* Returns an estimate of the number of tasks submitted to this
- * pool that have not yet begun executing. This method takes time
- * proportional to the number of submissions.
+ * pool that have not yet begun executing. This method may take
+ * time proportional to the number of submissions.
*
* @return the number of queued submissions
*/
public int getQueuedSubmissionCount() {
- return submissionQueue.size();
+ int count = 0;
+ WorkQueue[] ws; WorkQueue w;
+ if ((ws = workQueues) != null) {
+ int n = ws.length;
+ for (int i = 0; i < n; i += 2) {
+ if ((w = ws[i]) != null)
+ count += w.queueSize();
+ }
+ }
+ return count;
}
/**
@@ -1642,7 +2290,15 @@ public class ForkJoinPool extends Abstra
* @return {@code true} if there are any queued submissions
*/
public boolean hasQueuedSubmissions() {
- return !submissionQueue.isEmpty();
+ WorkQueue[] ws; WorkQueue w;
+ if ((ws = workQueues) != null) {
+ int n = ws.length;
+ for (int i = 0; i < n; i += 2) {
+ if ((w = ws[i]) != null && w.queueSize() != 0)
+ return true;
+ }
+ }
+ return false;
}
/**
@@ -1653,7 +2309,15 @@ public class ForkJoinPool extends Abstra
* @return the next submission, or {@code null} if none
*/
protected ForkJoinTask pollSubmission() {
- return submissionQueue.poll();
+ WorkQueue[] ws; WorkQueue w; ForkJoinTask t;
+ if ((ws = workQueues) != null) {
+ int n = ws.length;
+ for (int i = 0; i < n; i += 2) {
+ if ((w = ws[i]) != null && (t = w.poll()) != null)
+ return t;
+ }
+ }
+ return null;
}
/**
@@ -1674,13 +2338,18 @@ public class ForkJoinPool extends Abstra
* @return the number of elements transferred
*/
protected int drainTasksTo(Collection> c) {
- int count = submissionQueue.drainTo(c);
- ForkJoinWorkerThread[] ws = workers;
- int n = ws.length;
- for (int i = 0; i < n; ++i) {
- ForkJoinWorkerThread w = ws[i];
- if (w != null)
- count += w.drainTasksTo(c);
+ int count = 0;
+ WorkQueue[] ws; WorkQueue w; ForkJoinTask t;
+ if ((ws = workQueues) != null) {
+ int n = ws.length;
+ for (int i = 0; i < n; ++i) {
+ if ((w = ws[i]) != null) {
+ while ((t = w.poll()) != null) {
+ c.add(t);
+ ++count;
+ }
+ }
+ }
}
return count;
}
@@ -1696,14 +2365,20 @@ public class ForkJoinPool extends Abstra
long st = getStealCount();
long qt = getQueuedTaskCount();
long qs = getQueuedSubmissionCount();
- int wc = workerCounts;
- int tc = wc >>> TOTAL_COUNT_SHIFT;
- int rc = wc & RUNNING_COUNT_MASK;
+ int rc = getRunningThreadCount();
int pc = parallelism;
- int rs = runState;
- int ac = rs & ACTIVE_COUNT_MASK;
+ long c = ctl;
+ int tc = pc + (short)(c >>> TC_SHIFT);
+ int ac = pc + (int)(c >> AC_SHIFT);
+ if (ac < 0) // ignore transient negative
+ ac = 0;
+ String level;
+ if ((c & STOP_BIT) != 0)
+ level = (tc == 0) ? "Terminated" : "Terminating";
+ else
+ level = runState < 0 ? "Shutting down" : "Running";
return super.toString() +
- "[" + runLevelToString(rs) +
+ "[" + level +
", parallelism = " + pc +
", size = " + tc +
", active = " + ac +
@@ -1714,13 +2389,6 @@ public class ForkJoinPool extends Abstra
"]";
}
- private static String runLevelToString(int s) {
- return ((s & TERMINATED) != 0 ? "Terminated" :
- ((s & TERMINATING) != 0 ? "Terminating" :
- ((s & SHUTDOWN) != 0 ? "Shutting down" :
- "Running")));
- }
-
/**
* Initiates an orderly shutdown in which previously submitted
* tasks are executed, but no new tasks will be accepted.
@@ -1735,7 +2403,7 @@ public class ForkJoinPool extends Abstra
*/
public void shutdown() {
checkPermission();
- advanceRunLevel(SHUTDOWN);
+ enableShutdown();
tryTerminate(false);
}
@@ -1757,6 +2425,7 @@ public class ForkJoinPool extends Abstra
*/
public List shutdownNow() {
checkPermission();
+ enableShutdown();
tryTerminate(true);
return Collections.emptyList();
}
@@ -1767,7 +2436,9 @@ public class ForkJoinPool extends Abstra
* @return {@code true} if all tasks have completed following shut down
*/
public boolean isTerminated() {
- return runState >= TERMINATED;
+ long c = ctl;
+ return ((c & STOP_BIT) != 0L &&
+ (short)(c >>> TC_SHIFT) == -parallelism);
}
/**
@@ -1775,13 +2446,18 @@ public class ForkJoinPool extends Abstra
* commenced but not yet completed. This method may be useful for
* debugging. A return of {@code true} reported a sufficient
* period after shutdown may indicate that submitted tasks have
- * ignored or suppressed interruption, causing this executor not
- * to properly terminate.
+ * ignored or suppressed interruption, or are waiting for IO,
+ * causing this executor not to properly terminate. (See the
+ * advisory notes for class {@link ForkJoinTask} stating that
+ * tasks should not normally entail blocking operations. But if
+ * they do, they must abort them on interrupt.)
*
* @return {@code true} if terminating but not yet terminated
*/
public boolean isTerminating() {
- return (runState & (TERMINATING|TERMINATED)) == TERMINATING;
+ long c = ctl;
+ return ((c & STOP_BIT) != 0L &&
+ (short)(c >>> TC_SHIFT) != -parallelism);
}
/**
@@ -1790,7 +2466,7 @@ public class ForkJoinPool extends Abstra
* @return {@code true} if this pool has been shut down
*/
public boolean isShutdown() {
- return runState >= SHUTDOWN;
+ return runState < 0;
}
/**
@@ -1806,10 +2482,19 @@ public class ForkJoinPool extends Abstra
*/
public boolean awaitTermination(long timeout, TimeUnit unit)
throws InterruptedException {
+ long nanos = unit.toNanos(timeout);
+ final ReentrantLock lock = this.lock;
+ lock.lock();
try {
- return termination.awaitAdvanceInterruptibly(0, timeout, unit) > 0;
- } catch(TimeoutException ex) {
- return false;
+ for (;;) {
+ if (isTerminated())
+ return true;
+ if (nanos <= 0)
+ return false;
+ nanos = termination.awaitNanos(nanos);
+ }
+ } finally {
+ lock.unlock();
}
}
@@ -1821,13 +2506,15 @@ public class ForkJoinPool extends Abstra
* {@code isReleasable} must return {@code true} if blocking is
* not necessary. Method {@code block} blocks the current thread
* if necessary (perhaps internally invoking {@code isReleasable}
- * before actually blocking). The unusual methods in this API
- * accommodate synchronizers that may, but don't usually, block
- * for long periods. Similarly, they allow more efficient internal
- * handling of cases in which additional workers may be, but
- * usually are not, needed to ensure sufficient parallelism.
- * Toward this end, implementations of method {@code isReleasable}
- * must be amenable to repeated invocation.
+ * before actually blocking). These actions are performed by any
+ * thread invoking {@link ForkJoinPool#managedBlock}. The
+ * unusual methods in this API accommodate synchronizers that may,
+ * but don't usually, block for long periods. Similarly, they
+ * allow more efficient internal handling of cases in which
+ * additional workers may be, but usually are not, needed to
+ * ensure sufficient parallelism. Toward this end,
+ * implementations of method {@code isReleasable} must be amenable
+ * to repeated invocation.
*
* For example, here is a ManagedBlocker based on a
* ReentrantLock:
@@ -1855,11 +2542,11 @@ public class ForkJoinPool extends Abstra
* QueueTaker(BlockingQueue q) { this.queue = q; }
* public boolean block() throws InterruptedException {
* if (item == null)
- * item = queue.take
+ * item = queue.take();
* return true;
* }
* public boolean isReleasable() {
- * return item != null || (item = queue.poll) != null;
+ * return item != null || (item = queue.poll()) != null;
* }
* public E getItem() { // call after pool.managedBlock completes
* return item;
@@ -1907,12 +2594,18 @@ public class ForkJoinPool extends Abstra
public static void managedBlock(ManagedBlocker blocker)
throws InterruptedException {
Thread t = Thread.currentThread();
- if (t instanceof ForkJoinWorkerThread) {
- ForkJoinWorkerThread w = (ForkJoinWorkerThread) t;
- w.pool.awaitBlocker(blocker);
- }
- else {
- do {} while (!blocker.isReleasable() && !blocker.block());
+ ForkJoinPool p = ((t instanceof ForkJoinWorkerThread) ?
+ ((ForkJoinWorkerThread)t).pool : null);
+ while (!blocker.isReleasable()) {
+ if (p == null || p.tryCompensate()) {
+ try {
+ do {} while (!blocker.isReleasable() && !blocker.block());
+ } finally {
+ if (p != null)
+ p.incrementActiveCount();
+ }
+ break;
+ }
}
}
@@ -1929,29 +2622,29 @@ public class ForkJoinPool extends Abstra
}
// Unsafe mechanics
-
- private static final sun.misc.Unsafe UNSAFE = getUnsafe();
- private static final long workerCountsOffset =
- objectFieldOffset("workerCounts", ForkJoinPool.class);
- private static final long runStateOffset =
- objectFieldOffset("runState", ForkJoinPool.class);
- private static final long eventCountOffset =
- objectFieldOffset("eventCount", ForkJoinPool.class);
- private static final long eventWaitersOffset =
- objectFieldOffset("eventWaiters",ForkJoinPool.class);
- private static final long stealCountOffset =
- objectFieldOffset("stealCount",ForkJoinPool.class);
- private static final long spareWaitersOffset =
- objectFieldOffset("spareWaiters",ForkJoinPool.class);
-
- private static long objectFieldOffset(String field, Class klazz) {
+ private static final sun.misc.Unsafe U;
+ private static final long CTL;
+ private static final long RUNSTATE;
+ private static final long PARKBLOCKER;
+
+ static {
+ poolNumberGenerator = new AtomicInteger();
+ modifyThreadPermission = new RuntimePermission("modifyThread");
+ defaultForkJoinWorkerThreadFactory =
+ new DefaultForkJoinWorkerThreadFactory();
+ int s;
try {
- return UNSAFE.objectFieldOffset(klazz.getDeclaredField(field));
- } catch (NoSuchFieldException e) {
- // Convert Exception to corresponding Error
- NoSuchFieldError error = new NoSuchFieldError(field);
- error.initCause(e);
- throw error;
+ U = getUnsafe();
+ Class k = ForkJoinPool.class;
+ Class tk = Thread.class;
+ CTL = U.objectFieldOffset
+ (k.getDeclaredField("ctl"));
+ RUNSTATE = U.objectFieldOffset
+ (k.getDeclaredField("runState"));
+ PARKBLOCKER = U.objectFieldOffset
+ (tk.getDeclaredField("parkBlocker"));
+ } catch (Exception e) {
+ throw new Error(e);
}
}
@@ -1982,4 +2675,5 @@ public class ForkJoinPool extends Abstra
}
}
}
+
}