ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/jsr166y/ForkJoinPool.java

Comparing jsr166/src/jsr166y/ForkJoinPool.java (file contents):
Revision 1.95 by dl, Fri Mar 4 13:29:39 2011 UTC vs.
Revision 1.126 by jsr166, Tue Feb 21 00:44:53 2012 UTC

#	Line 1 | Line 1
1		/*
2		* Written by Doug Lea with assistance from members of JCP JSR-166
3		* Expert Group and released to the public domain, as explained at
4	<	* http://creativecommons.org/licenses/publicdomain
4	>	* http://creativecommons.org/publicdomain/zero/1.0/
5		*/
6
7		package jsr166y;
8	–
8		import java.util.ArrayList;
9		import java.util.Arrays;
10		import java.util.Collection;
#	Line 19 | Line 18 | import java.util.concurrent.Future;
18		import java.util.concurrent.RejectedExecutionException;
19		import java.util.concurrent.RunnableFuture;
20		import java.util.concurrent.TimeUnit;
22	–	import java.util.concurrent.TimeoutException;
21		import java.util.concurrent.atomic.AtomicInteger;
22	<	import java.util.concurrent.locks.LockSupport;
23	<	import java.util.concurrent.locks.ReentrantLock;
22	>	import java.util.concurrent.atomic.AtomicLong;
23	>	import java.util.concurrent.locks.AbstractQueuedSynchronizer;
24		import java.util.concurrent.locks.Condition;
25
26		/**
#	Line 34 | Line 32 | import java.util.concurrent.locks.Condit
32		* <p>A {@code ForkJoinPool} differs from other kinds of {@link
33		* ExecutorService} mainly by virtue of employing
34		* <em>work-stealing</em>: all threads in the pool attempt to find and
35	<	* execute subtasks created by other active tasks (eventually blocking
36	<	* waiting for work if none exist). This enables efficient processing
37	<	* when most tasks spawn other subtasks (as do most {@code
38	<	* ForkJoinTask}s). When setting <em>asyncMode</em> to true in
39	<	* constructors, {@code ForkJoinPool}s may also be appropriate for use
40	<	* with event-style tasks that are never joined.
35	>	* execute tasks submitted to the pool and/or created by other active
36	>	* tasks (eventually blocking waiting for work if none exist). This
37	>	* enables efficient processing when most tasks spawn other subtasks
38	>	* (as do most {@code ForkJoinTask}s), as well as when many small
39	>	* tasks are submitted to the pool from external clients.  Especially
40	>	* when setting <em>asyncMode</em> to true in constructors, {@code
41	>	* ForkJoinPool}s may also be appropriate for use with event-style
42	>	* tasks that are never joined.
43		*
44		* <p>A {@code ForkJoinPool} is constructed with a given target
45		* parallelism level; by default, equal to the number of available
#	Line 59 | Line 59 | import java.util.concurrent.locks.Condit
59		* convenient form for informal monitoring.
60		*
61		* <p> As is the case with other ExecutorServices, there are three
62	<	* main task execution methods summarized in the following
63	<	* table. These are designed to be used by clients not already engaged
64	<	* in fork/join computations in the current pool.  The main forms of
65	<	* these methods accept instances of {@code ForkJoinTask}, but
66	<	* overloaded forms also allow mixed execution of plain {@code
62	>	* main task execution methods summarized in the following table.
63	>	* These are designed to be used primarily by clients not already
64	>	* engaged in fork/join computations in the current pool.  The main
65	>	* forms of these methods accept instances of {@code ForkJoinTask},
66	>	* but overloaded forms also allow mixed execution of plain {@code
67		* Runnable}- or {@code Callable}- based activities as well.  However,
68	<	* tasks that are already executing in a pool should normally
69	<	* <em>NOT</em> use these pool execution methods, but instead use the
70	<	* within-computation forms listed in the table.
68	>	* tasks that are already executing in a pool should normally instead
69	>	* use the within-computation forms listed in the table unless using
70	>	* async event-style tasks that are not usually joined, in which case
71	>	* there is little difference among choice of methods.
72		*
73		* <table BORDER CELLPADDING=3 CELLSPACING=1>
74		*  <tr>
#	Line 102 | Line 103 | import java.util.concurrent.locks.Condit
103		* daemon} mode, there is typically no need to explicitly {@link
104		* #shutdown} such a pool upon program exit.
105		*
106	<	* <pre>
106	>	*  <pre> {@code
107		* static final ForkJoinPool mainPool = new ForkJoinPool();
108		* ...
109		* public void sort(long[] array) {
110		*   mainPool.invoke(new SortTask(array, 0, array.length));
111	<	* }
111	<	* </pre>
111	>	* }}</pre>
112		*
113		* <p><b>Implementation notes</b>: This implementation restricts the
114		* maximum number of running threads to 32767. Attempts to create
#	Line 127 | Line 127 | public class ForkJoinPool extends Abstra
127		/*
128		* Implementation Overview
129		*
130	<	* This class provides the central bookkeeping and control for a
131	<	* set of worker threads: Submissions from non-FJ threads enter
132	<	* into a submission queue. Workers take these tasks and typically
133	<	* split them into subtasks that may be stolen by other workers.
134	<	* Preference rules give first priority to processing tasks from
135	<	* their own queues (LIFO or FIFO, depending on mode), then to
136	<	* randomized FIFO steals of tasks in other worker queues, and
137	<	* lastly to new submissions.
130	>	* This class and its nested classes provide the main
131	>	* functionality and control for a set of worker threads:
132	>	* Submissions from non-FJ threads enter into submission queues.
133	>	* Workers take these tasks and typically split them into subtasks
134	>	* that may be stolen by other workers.  Preference rules give
135	>	* first priority to processing tasks from their own queues (LIFO
136	>	* or FIFO, depending on mode), then to randomized FIFO steals of
137	>	* tasks in other queues.
138	>	*
139	>	* WorkQueues
140	>	* ==========
141	>	*
142	>	* Most operations occur within work-stealing queues (in nested
143	>	* class WorkQueue).  These are special forms of Deques that
144	>	* support only three of the four possible end-operations -- push,
145	>	* pop, and poll (aka steal), under the further constraints that
146	>	* push and pop are called only from the owning thread (or, as
147	>	* extended here, under a lock), while poll may be called from
148	>	* other threads.  (If you are unfamiliar with them, you probably
149	>	* want to read Herlihy and Shavit's book "The Art of
150	>	* Multiprocessor programming", chapter 16 describing these in
151	>	* more detail before proceeding.)  The main work-stealing queue
152	>	* design is roughly similar to those in the papers "Dynamic
153	>	* Circular Work-Stealing Deque" by Chase and Lev, SPAA 2005
154	>	* (http://research.sun.com/scalable/pubs/index.html) and
155	>	* "Idempotent work stealing" by Michael, Saraswat, and Vechev,
156	>	* PPoPP 2009 (http://portal.acm.org/citation.cfm?id=1504186).
157	>	* The main differences ultimately stem from GC requirements that
158	>	* we null out taken slots as soon as we can, to maintain as small
159	>	* a footprint as possible even in programs generating huge
160	>	* numbers of tasks. To accomplish this, we shift the CAS
161	>	* arbitrating pop vs poll (steal) from being on the indices
162	>	* ("base" and "top") to the slots themselves.  So, both a
163	>	* successful pop and poll mainly entail a CAS of a slot from
164	>	* non-null to null.  Because we rely on CASes of references, we
165	>	* do not need tag bits on base or top.  They are simple ints as
166	>	* used in any circular array-based queue (see for example
167	>	* ArrayDeque).  Updates to the indices must still be ordered in a
168	>	* way that guarantees that top == base means the queue is empty,
169	>	* but otherwise may err on the side of possibly making the queue
170	>	* appear nonempty when a push, pop, or poll have not fully
171	>	* committed. Note that this means that the poll operation,
172	>	* considered individually, is not wait-free. One thief cannot
173	>	* successfully continue until another in-progress one (or, if
174	>	* previously empty, a push) completes.  However, in the
175	>	* aggregate, we ensure at least probabilistic non-blockingness.
176	>	* If an attempted steal fails, a thief always chooses a different
177	>	* random victim target to try next. So, in order for one thief to
178	>	* progress, it suffices for any in-progress poll or new push on
179	>	* any empty queue to complete. (This is why we normally use
180	>	* method pollAt and its variants that try once at the apparent
181	>	* base index, else consider alternative actions, rather than
182	>	* method poll.)
183	>	*
184	>	* This approach also enables support of a user mode in which local
185	>	* task processing is in FIFO, not LIFO order, simply by using
186	>	* poll rather than pop.  This can be useful in message-passing
187	>	* frameworks in which tasks are never joined.  However neither
188	>	* mode considers affinities, loads, cache localities, etc, so
189	>	* rarely provide the best possible performance on a given
190	>	* machine, but portably provide good throughput by averaging over
191	>	* these factors.  (Further, even if we did try to use such
192	>	* information, we do not usually have a basis for exploiting it.
193	>	* For example, some sets of tasks profit from cache affinities,
194	>	* but others are harmed by cache pollution effects.)
195	>	*
196	>	* WorkQueues are also used in a similar way for tasks submitted
197	>	* to the pool. We cannot mix these tasks in the same queues used
198	>	* for work-stealing (this would contaminate lifo/fifo
199	>	* processing). Instead, we loosely associate submission queues
200	>	* with submitting threads, using a form of hashing.  The
201	>	* ThreadLocal Submitter class contains a value initially used as
202	>	* a hash code for choosing existing queues, but may be randomly
203	>	* repositioned upon contention with other submitters.  In
204	>	* essence, submitters act like workers except that they never
205	>	* take tasks, and they are multiplexed on to a finite number of
206	>	* shared work queues. However, classes are set up so that future
207	>	* extensions could allow submitters to optionally help perform
208	>	* tasks as well. Insertion of tasks in shared mode requires a
209	>	* lock (mainly to protect in the case of resizing) but we use
210	>	* only a simple spinlock (using bits in field runState), because
211	>	* submitters encountering a busy queue move on to try or create
212	>	* other queues -- they block only when creating and registering
213	>	* new queues.
214	>	*
215	>	* Management
216	>	* ==========
217		*
218		* The main throughput advantages of work-stealing stem from
219		* decentralized control -- workers mostly take tasks from
220		* themselves or each other. We cannot negate this in the
221		* implementation of other management responsibilities. The main
222		* tactic for avoiding bottlenecks is packing nearly all
223	<	* essentially atomic control state into a single 64bit volatile
224	<	* variable ("ctl"). This variable is read on the order of 10-100
225	<	* times as often as it is modified (always via CAS). (There is
226	<	* some additional control state, for example variable "shutdown"
227	<	* for which we can cope with uncoordinated updates.)  This
228	<	* streamlines synchronization and control at the expense of messy
229	<	* constructions needed to repack status bits upon updates.
230	<	* Updates tend not to contend with each other except during
231	<	* bursts while submitted tasks begin or end.  In some cases when
232	<	* they do contend, threads can instead do something else
233	<	* (usually, scan for tasks) until contention subsides.
234	<	*
235	<	* To enable packing, we restrict maximum parallelism to (1<<15)-1
236	<	* (which is far in excess of normal operating range) to allow
237	<	* ids, counts, and their negations (used for thresholding) to fit
238	<	* into 16bit fields.
239	<	*
240	<	* Recording Workers.  Workers are recorded in the "workers" array
241	<	* that is created upon pool construction and expanded if (rarely)
242	<	* necessary.  This is an array as opposed to some other data
243	<	* structure to support index-based random steals by workers.
244	<	* Updates to the array recording new workers and unrecording
245	<	* terminated ones are protected from each other by a seqLock
246	<	* (scanGuard) but the array is otherwise concurrently readable,
168	<	* and accessed directly by workers. To simplify index-based
223	>	* essentially atomic control state into two volatile variables
224	>	* that are by far most often read (not written) as status and
225	>	* consistency checks.
226	>	*
227	>	* Field "ctl" contains 64 bits holding all the information needed
228	>	* to atomically decide to add, inactivate, enqueue (on an event
229	>	* queue), dequeue, and/or re-activate workers.  To enable this
230	>	* packing, we restrict maximum parallelism to (1<<15)-1 (which is
231	>	* far in excess of normal operating range) to allow ids, counts,
232	>	* and their negations (used for thresholding) to fit into 16bit
233	>	* fields.
234	>	*
235	>	* Field "runState" contains 32 bits needed to register and
236	>	* deregister WorkQueues, as well as to enable shutdown. It is
237	>	* only modified under a lock (normally briefly held, but
238	>	* occasionally protecting allocations and resizings) but even
239	>	* when locked remains available to check consistency.
240	>	*
241	>	* Recording WorkQueues.  WorkQueues are recorded in the
242	>	* "workQueues" array that is created upon pool construction and
243	>	* expanded if necessary.  Updates to the array while recording
244	>	* new workers and unrecording terminated ones are protected from
245	>	* each other by a lock but the array is otherwise concurrently
246	>	* readable, and accessed directly.  To simplify index-based
247		* operations, the array size is always a power of two, and all
248	<	* readers must tolerate null slots. To avoid flailing during
249	<	* start-up, the array is presized to hold twice #parallelism
250	<	* workers (which is unlikely to need further resizing during
251	<	* execution). But to avoid dealing with so many null slots,
252	<	* variable scanGuard includes a mask for the nearest power of two
253	<	* that contains all current workers.  All worker thread creation
254	<	* is on-demand, triggered by task submissions, replacement of
255	<	* terminated workers, and/or compensation for blocked
256	<	* workers. However, all other support code is set up to work with
257	<	* other policies.  To ensure that we do not hold on to worker
258	<	* references that would prevent GC, ALL accesses to workers are
259	<	* via indices into the workers array (which is one source of some
260	<	* of the messy code constructions here). In essence, the workers
261	<	* array serves as a weak reference mechanism. Thus for example
262	<	* the wait queue field of ctl stores worker indices, not worker
263	<	* references.  Access to the workers in associated methods (for
264	<	* example signalWork) must both index-check and null-check the
265	<	* IDs. All such accesses ignore bad IDs by returning out early
266	<	* from what they are doing, since this can only be associated
267	<	* with termination, in which case it is OK to give up.
268	<	*
269	<	* All uses of the workers array, as well as queue arrays, check
270	<	* that the array is non-null (even if previously non-null). This
271	<	* allows nulling during termination, which is currently not
272	<	* necessary, but remains an option for resource-revocation-based
273	<	* shutdown schemes.
248	>	* readers must tolerate null slots. Shared (submission) queues
249	>	* are at even indices, worker queues at odd indices. Grouping
250	>	* them together in this way simplifies and speeds up task
251	>	* scanning.
252	>	*
253	>	* All worker thread creation is on-demand, triggered by task
254	>	* submissions, replacement of terminated workers, and/or
255	>	* compensation for blocked workers. However, all other support
256	>	* code is set up to work with other policies.  To ensure that we
257	>	* do not hold on to worker references that would prevent GC, ALL
258	>	* accesses to workQueues are via indices into the workQueues
259	>	* array (which is one source of some of the messy code
260	>	* constructions here). In essence, the workQueues array serves as
261	>	* a weak reference mechanism. Thus for example the wait queue
262	>	* field of ctl stores indices, not references.  Access to the
263	>	* workQueues in associated methods (for example signalWork) must
264	>	* both index-check and null-check the IDs. All such accesses
265	>	* ignore bad IDs by returning out early from what they are doing,
266	>	* since this can only be associated with termination, in which
267	>	* case it is OK to give up.  All uses of the workQueues array
268	>	* also check that it is non-null (even if previously
269	>	* non-null). This allows nulling during termination, which is
270	>	* currently not necessary, but remains an option for
271	>	* resource-revocation-based shutdown schemes. It also helps
272	>	* reduce JIT issuance of uncommon-trap code, which tends to
273	>	* unnecessarily complicate control flow in some methods.
274		*
275	<	* Wait Queuing. Unlike HPC work-stealing frameworks, we cannot
275	>	* Event Queuing. Unlike HPC work-stealing frameworks, we cannot
276		* let workers spin indefinitely scanning for tasks when none can
277		* be found immediately, and we cannot start/resume workers unless
278		* there appear to be tasks available.  On the other hand, we must
279		* quickly prod them into action when new tasks are submitted or
280	<	* generated.  We park/unpark workers after placing in an event
281	<	* wait queue when they cannot find work. This "queue" is actually
282	<	* a simple Treiber stack, headed by the "id" field of ctl, plus a
283	<	* 15bit counter value to both wake up waiters (by advancing their
284	<	* count) and avoid ABA effects. Successors are held in worker
285	<	* field "nextWait".  Queuing deals with several intrinsic races,
286	<	* mainly that a task-producing thread can miss seeing (and
280	>	* generated. In many usages, ramp-up time to activate workers is
281	>	* the main limiting factor in overall performance (this is
282	>	* compounded at program start-up by JIT compilation and
283	>	* allocation). So we try to streamline this as much as possible.
284	>	* We park/unpark workers after placing in an event wait queue
285	>	* when they cannot find work. This "queue" is actually a simple
286	>	* Treiber stack, headed by the "id" field of ctl, plus a 15bit
287	>	* counter value (that reflects the number of times a worker has
288	>	* been inactivated) to avoid ABA effects (we need only as many
289	>	* version numbers as worker threads). Successors are held in
290	>	* field WorkQueue.nextWait.  Queuing deals with several intrinsic
291	>	* races, mainly that a task-producing thread can miss seeing (and
292		* signalling) another thread that gave up looking for work but
293		* has not yet entered the wait queue. We solve this by requiring
294	<	* a full sweep of all workers both before (in scan()) and after
295	<	* (in tryAwaitWork()) a newly waiting worker is added to the wait
296	<	* queue. During a rescan, the worker might release some other
297	<	* queued worker rather than itself, which has the same net
298	<	* effect. Because enqueued workers may actually be rescanning
299	<	* rather than waiting, we set and clear the "parked" field of
300	<	* ForkJoinWorkerThread to reduce unnecessary calls to unpark.
301	<	* (Use of the parked field requires a secondary recheck to avoid
302	<	* missed signals.)
294	>	* a full sweep of all workers (via repeated calls to method
295	>	* scan()) both before and after a newly waiting worker is added
296	>	* to the wait queue. During a rescan, the worker might release
297	>	* some other queued worker rather than itself, which has the same
298	>	* net effect. Because enqueued workers may actually be rescanning
299	>	* rather than waiting, we set and clear the "parker" field of
300	>	* WorkQueues to reduce unnecessary calls to unpark.  (This
301	>	* requires a secondary recheck to avoid missed signals.)  Note
302	>	* the unusual conventions about Thread.interrupts surrounding
303	>	* parking and other blocking: Because interrupts are used solely
304	>	* to alert threads to check termination, which is checked anyway
305	>	* upon blocking, we clear status (using Thread.interrupted)
306	>	* before any call to park, so that park does not immediately
307	>	* return due to status being set via some other unrelated call to
308	>	* interrupt in user code.
309		*
310		* Signalling.  We create or wake up workers only when there
311		* appears to be at least one task they might be able to find and
312		* execute.  When a submission is added or another worker adds a
313	<	* task to a queue that previously had two or fewer tasks, they
313	>	* task to a queue that previously had fewer than two tasks, they
314		* signal waiting workers (or trigger creation of new ones if
315		* fewer than the given parallelism level -- see signalWork).
316	<	* These primary signals are buttressed by signals during rescans
317	<	* as well as those performed when a worker steals a task and
318	<	* notices that there are more tasks too; together these cover the
319	<	* signals needed in cases when more than two tasks are pushed
231	<	* but untaken.
316	>	* These primary signals are buttressed by signals during rescans;
317	>	* together these cover the signals needed in cases when more
318	>	* tasks are pushed but untaken, and improve performance compared
319	>	* to having one thread wake up all workers.
320		*
321		* Trimming workers. To release resources after periods of lack of
322		* use, a worker starting to wait when the pool is quiescent will
#	Line 236 | Line 324 | public class ForkJoinPool extends Abstra
324		* SHRINK_RATE nanosecs. This will slowly propagate, eventually
325		* terminating all workers after long periods of non-use.
326		*
327	<	* Submissions. External submissions are maintained in an
328	<	* array-based queue that is structured identically to
329	<	* ForkJoinWorkerThread queues except for the use of
330	<	* submissionLock in method addSubmission. Unlike the case for
331	<	* worker queues, multiple external threads can add new
332	<	* submissions, so adding requires a lock.
333	<	*
334	<	* Compensation. Beyond work-stealing support and lifecycle
335	<	* control, the main responsibility of this framework is to take
336	<	* actions when one worker is waiting to join a task stolen (or
337	<	* always held by) another.  Because we are multiplexing many
338	<	* tasks on to a pool of workers, we can't just let them block (as
339	<	* in Thread.join).  We also cannot just reassign the joiner's
340	<	* run-time stack with another and replace it later, which would
341	<	* be a form of "continuation", that even if possible is not
342	<	* necessarily a good idea since we sometimes need both an
343	<	* unblocked task and its continuation to progress. Instead we
344	<	* combine two tactics:
327	>	* Shutdown and Termination. A call to shutdownNow atomically sets
328	>	* a runState bit and then (non-atomically) sets each worker's
329	>	* runState status, cancels all unprocessed tasks, and wakes up
330	>	* all waiting workers.  Detecting whether termination should
331	>	* commence after a non-abrupt shutdown() call requires more work
332	>	* and bookkeeping. We need consensus about quiescence (i.e., that
333	>	* there is no more work). The active count provides a primary
334	>	* indication but non-abrupt shutdown still requires a rechecking
335	>	* scan for any workers that are inactive but not queued.
336	>	*
337	>	* Joining Tasks
338	>	* =============
339	>	*
340	>	* Any of several actions may be taken when one worker is waiting
341	>	* to join a task stolen (or always held) by another.  Because we
342	>	* are multiplexing many tasks on to a pool of workers, we can't
343	>	* just let them block (as in Thread.join).  We also cannot just
344	>	* reassign the joiner's run-time stack with another and replace
345	>	* it later, which would be a form of "continuation", that even if
346	>	* possible is not necessarily a good idea since we sometimes need
347	>	* both an unblocked task and its continuation to progress.
348	>	* Instead we combine two tactics:
349		*
350		*   Helping: Arranging for the joiner to execute some task that it
351	<	*      would be running if the steal had not occurred.  Method
260	<	*      ForkJoinWorkerThread.joinTask tracks joining->stealing
261	<	*      links to try to find such a task.
351	>	*      would be running if the steal had not occurred.
352		*
353		*   Compensating: Unless there are already enough live threads,
354	<	*      method tryPreBlock() may create or re-activate a spare
355	<	*      thread to compensate for blocked joiners until they
356	<	*      unblock.
354	>	*      method tryCompensate() may create or re-activate a spare
355	>	*      thread to compensate for blocked joiners until they unblock.
356	>	*
357	>	* A third form (implemented in tryRemoveAndExec and
358	>	* tryPollForAndExec) amounts to helping a hypothetical
359	>	* compensator: If we can readily tell that a possible action of a
360	>	* compensator is to steal and execute the task being joined, the
361	>	* joining thread can do so directly, without the need for a
362	>	* compensation thread (although at the expense of larger run-time
363	>	* stacks, but the tradeoff is typically worthwhile).
364		*
365		* The ManagedBlocker extension API can't use helping so relies
366		* only on compensation in method awaitBlocker.
367		*
368	+	* The algorithm in tryHelpStealer entails a form of "linear"
369	+	* helping: Each worker records (in field currentSteal) the most
370	+	* recent task it stole from some other worker. Plus, it records
371	+	* (in field currentJoin) the task it is currently actively
372	+	* joining. Method tryHelpStealer uses these markers to try to
373	+	* find a worker to help (i.e., steal back a task from and execute
374	+	* it) that could hasten completion of the actively joined task.
375	+	* In essence, the joiner executes a task that would be on its own
376	+	* local deque had the to-be-joined task not been stolen. This may
377	+	* be seen as a conservative variant of the approach in Wagner &
378	+	* Calder "Leapfrogging: a portable technique for implementing
379	+	* efficient futures" SIGPLAN Notices, 1993
380	+	* (http://portal.acm.org/citation.cfm?id=155354). It differs in
381	+	* that: (1) We only maintain dependency links across workers upon
382	+	* steals, rather than use per-task bookkeeping.  This sometimes
383	+	* requires a linear scan of workQueues array to locate stealers,
384	+	* but often doesn't because stealers leave hints (that may become
385	+	* stale/wrong) of where to locate them.  A stealHint is only a
386	+	* hint because a worker might have had multiple steals and the
387	+	* hint records only one of them (usually the most current).
388	+	* Hinting isolates cost to when it is needed, rather than adding
389	+	* to per-task overhead.  (2) It is "shallow", ignoring nesting
390	+	* and potentially cyclic mutual steals.  (3) It is intentionally
391	+	* racy: field currentJoin is updated only while actively joining,
392	+	* which means that we miss links in the chain during long-lived
393	+	* tasks, GC stalls etc (which is OK since blocking in such cases
394	+	* is usually a good idea).  (4) We bound the number of attempts
395	+	* to find work (see MAX_HELP) and fall back to suspending the
396	+	* worker and if necessary replacing it with another.
397	+	*
398		* It is impossible to keep exactly the target parallelism number
399		* of threads running at any given time.  Determining the
400		* existence of conservatively safe helping targets, the
401		* availability of already-created spares, and the apparent need
402	<	* to create new spares are all racy and require heuristic
403	<	* guidance, so we rely on multiple retries of each.  Currently,
404	<	* in keeping with on-demand signalling policy, we compensate only
405	<	* if blocking would leave less than one active (non-waiting,
406	<	* non-blocked) worker. Additionally, to avoid some false alarms
407	<	* due to GC, lagging counters, system activity, etc, compensated
408	<	* blocking for joins is only attempted after rechecks stabilize
409	<	* (retries are interspersed with Thread.yield, for good
410	<	* citizenship).  The variable blockedCount, incremented before
411	<	* blocking and decremented after, is sometimes needed to
412	<	* distinguish cases of waiting for work vs blocking on joins or
413	<	* other managed sync. Both cases are equivalent for most pool
414	<	* control, so we can update non-atomically. (Additionally,
415	<	* contention on blockedCount alleviates some contention on ctl).
416	<	*
417	<	* Shutdown and Termination. A call to shutdownNow atomically sets
418	<	* the ctl stop bit and then (non-atomically) sets each workers
419	<	* "terminate" status, cancels all unprocessed tasks, and wakes up
420	<	* all waiting workers.  Detecting whether termination should
421	<	* commence after a non-abrupt shutdown() call requires more work
422	<	* and bookkeeping. We need consensus about quiesence (i.e., that
423	<	* there is no more work) which is reflected in active counts so
424	<	* long as there are no current blockers, as well as possible
425	<	* re-evaluations during independent changes in blocking or
426	<	* quiescing workers.
402	>	* to create new spares are all racy, so we rely on multiple
403	>	* retries of each.  Compensation in the apparent absence of
404	>	* helping opportunities is challenging to control on JVMs, where
405	>	* GC and other activities can stall progress of tasks that in
406	>	* turn stall out many other dependent tasks, without us being
407	>	* able to determine whether they will ever require compensation.
408	>	* Even though work-stealing otherwise encounters little
409	>	* degradation in the presence of more threads than cores,
410	>	* aggressively adding new threads in such cases entails risk of
411	>	* unwanted positive feedback control loops in which more threads
412	>	* cause more dependent stalls (as well as delayed progress of
413	>	* unblocked threads to the point that we know they are available)
414	>	* leading to more situations requiring more threads, and so
415	>	* on. This aspect of control can be seen as an (analytically
416	>	* intractable) game with an opponent that may choose the worst
417	>	* (for us) active thread to stall at any time.  We take several
418	>	* precautions to bound losses (and thus bound gains), mainly in
419	>	* methods tryCompensate and awaitJoin: (1) We only try
420	>	* compensation after attempting enough helping steps (measured
421	>	* via counting and timing) that we have already consumed the
422	>	* estimated cost of creating and activating a new thread.  (2) We
423	>	* allow up to 50% of threads to be blocked before initially
424	>	* adding any others, and unless completely saturated, check that
425	>	* some work is available for a new worker before adding. Also, we
426	>	* create up to only 50% more threads until entering a mode that
427	>	* only adds a thread if all others are possibly blocked.  All
428	>	* together, this means that we might be half as fast to react,
429	>	* and create half as many threads as possible in the ideal case,
430	>	* but present vastly fewer anomalies in all other cases compared
431	>	* to both more aggressive and more conservative alternatives.
432		*
433		* Style notes: There is a lot of representation-level coupling
434		* among classes ForkJoinPool, ForkJoinWorkerThread, and
435	<	* ForkJoinTask.  Most fields of ForkJoinWorkerThread maintain
436	<	* data structures managed by ForkJoinPool, so are directly
437	<	* accessed.  Conversely we allow access to "workers" array by
438	<	* workers, and direct access to ForkJoinTask.status by both
439	<	* ForkJoinPool and ForkJoinWorkerThread.  There is little point
440	<	* trying to reduce this, since any associated future changes in
441	<	* representations will need to be accompanied by algorithmic
442	<	* changes anyway. All together, these low-level implementation
443	<	* choices produce as much as a factor of 4 performance
444	<	* improvement compared to naive implementations, and enable the
445	<	* processing of billions of tasks per second, at the expense of
446	<	* some ugliness.
447	<	*
448	<	* Methods signalWork() and scan() are the main bottlenecks so are
449	<	* especially heavily micro-optimized/mangled.  There are lots of
450	<	* inline assignments (of form "while ((local = field) != 0)")
451	<	* which are usually the simplest way to ensure the required read
452	<	* orderings (which are sometimes critical). This leads to a
453	<	* "C"-like style of listing declarations of these locals at the
454	<	* heads of methods or blocks.  There are several occurrences of
455	<	* the unusual "do {} while (!cas...)"  which is the simplest way
456	<	* to force an update of a CAS'ed variable. There are also other
457	<	* coding oddities that help some methods perform reasonably even
458	<	* when interpreted (not compiled).
459	<	*
460	<	* The order of declarations in this file is: (1) declarations of
461	<	* statics (2) fields (along with constants used when unpacking
462	<	* some of them), listed in an order that tends to reduce
331	<	* contention among them a bit under most JVMs.  (3) internal
332	<	* control methods (4) callbacks and other support for
333	<	* ForkJoinTask and ForkJoinWorkerThread classes, (5) exported
334	<	* methods (plus a few little helpers). (6) static block
335	<	* initializing all statics in a minimally dependent order.
435	>	* ForkJoinTask.  The fields of WorkQueue maintain data structures
436	>	* managed by ForkJoinPool, so are directly accessed.  There is
437	>	* little point trying to reduce this, since any associated future
438	>	* changes in representations will need to be accompanied by
439	>	* algorithmic changes anyway. Several methods intrinsically
440	>	* sprawl because they must accumulate sets of consistent reads of
441	>	* volatiles held in local variables.  Methods signalWork() and
442	>	* scan() are the main bottlenecks, so are especially heavily
443	>	* micro-optimized/mangled.  There are lots of inline assignments
444	>	* (of form "while ((local = field) != 0)") which are usually the
445	>	* simplest way to ensure the required read orderings (which are
446	>	* sometimes critical). This leads to a "C"-like style of listing
447	>	* declarations of these locals at the heads of methods or blocks.
448	>	* There are several occurrences of the unusual "do {} while
449	>	* (!cas...)"  which is the simplest way to force an update of a
450	>	* CAS'ed variable. There are also other coding oddities that help
451	>	* some methods perform reasonably even when interpreted (not
452	>	* compiled).
453	>	*
454	>	* The order of declarations in this file is:
455	>	* (1) Static utility functions
456	>	* (2) Nested (static) classes
457	>	* (3) Static fields
458	>	* (4) Fields, along with constants used when unpacking some of them
459	>	* (5) Internal control methods
460	>	* (6) Callbacks and other support for ForkJoinTask methods
461	>	* (7) Exported methods
462	>	* (8) Static block initializing statics in minimally dependent order
463		*/
464
465	+	// Static utilities
466	+
467	+	/**
468	+	* If there is a security manager, makes sure caller has
469	+	* permission to modify threads.
470	+	*/
471	+	private static void checkPermission() {
472	+	SecurityManager security = System.getSecurityManager();
473	+	if (security != null)
474	+	security.checkPermission(modifyThreadPermission);
475	+	}
476	+
477	+	// Nested classes
478	+
479		/**
480		* Factory for creating new {@link ForkJoinWorkerThread}s.
481		* A {@code ForkJoinWorkerThreadFactory} must be defined and used
#	Line 363 | Line 504 | public class ForkJoinPool extends Abstra
504		}
505
506		/**
507	<	* Creates a new ForkJoinWorkerThread. This factory is used unless
508	<	* overridden in ForkJoinPool constructors.
507	>	* A simple non-reentrant lock used for exclusion when managing
508	>	* queues and workers. We use a custom lock so that we can readily
509	>	* probe lock state in constructions that check among alternative
510	>	* actions. The lock is normally only very briefly held, and
511	>	* sometimes treated as a spinlock, but other usages block to
512	>	* reduce overall contention in those cases where locked code
513	>	* bodies perform allocation/resizing.
514	>	*/
515	>	static final class Mutex extends AbstractQueuedSynchronizer {
516	>	public final boolean tryAcquire(int ignore) {
517	>	return compareAndSetState(0, 1);
518	>	}
519	>	public final boolean tryRelease(int ignore) {
520	>	setState(0);
521	>	return true;
522	>	}
523	>	public final void lock() { acquire(0); }
524	>	public final void unlock() { release(0); }
525	>	public final boolean isHeldExclusively() { return getState() == 1; }
526	>	public final Condition newCondition() { return new ConditionObject(); }
527	>	}
528	>
529	>	/**
530	>	* Class for artificial tasks that are used to replace the target
531	>	* of local joins if they are removed from an interior queue slot
532	>	* in WorkQueue.tryRemoveAndExec. We don't need the proxy to
533	>	* actually do anything beyond having a unique identity.
534	>	*/
535	>	static final class EmptyTask extends ForkJoinTask<Void> {
536	>	EmptyTask() { status = ForkJoinTask.NORMAL; } // force done
537	>	public final Void getRawResult() { return null; }
538	>	public final void setRawResult(Void x) {}
539	>	public final boolean exec() { return true; }
540	>	}
541	>
542	>	/**
543	>	* Queues supporting work-stealing as well as external task
544	>	* submission. See above for main rationale and algorithms.
545	>	* Implementation relies heavily on "Unsafe" intrinsics
546	>	* and selective use of "volatile":
547	>	*
548	>	* Field "base" is the index (mod array.length) of the least valid
549	>	* queue slot, which is always the next position to steal (poll)
550	>	* from if nonempty. Reads and writes require volatile orderings
551	>	* but not CAS, because updates are only performed after slot
552	>	* CASes.
553	>	*
554	>	* Field "top" is the index (mod array.length) of the next queue
555	>	* slot to push to or pop from. It is written only by owner thread
556	>	* for push, or under lock for trySharedPush, and accessed by
557	>	* other threads only after reading (volatile) base.  Both top and
558	>	* base are allowed to wrap around on overflow, but (top - base)
559	>	* (or more commonly -(base - top) to force volatile read of base
560	>	* before top) still estimates size.
561	>	*
562	>	* The array slots are read and written using the emulation of
563	>	* volatiles/atomics provided by Unsafe. Insertions must in
564	>	* general use putOrderedObject as a form of releasing store to
565	>	* ensure that all writes to the task object are ordered before
566	>	* its publication in the queue. (Although we can avoid one case
567	>	* of this when locked in trySharedPush.) All removals entail a
568	>	* CAS to null.  The array is always a power of two. To ensure
569	>	* safety of Unsafe array operations, all accesses perform
570	>	* explicit null checks and implicit bounds checks via
571	>	* power-of-two masking.
572	>	*
573	>	* In addition to basic queuing support, this class contains
574	>	* fields described elsewhere to control execution. It turns out
575	>	* to work better memory-layout-wise to include them in this
576	>	* class rather than a separate class.
577	>	*
578	>	* Performance on most platforms is very sensitive to placement of
579	>	* instances of both WorkQueues and their arrays -- we absolutely
580	>	* do not want multiple WorkQueue instances or multiple queue
581	>	* arrays sharing cache lines. (It would be best for queue objects
582	>	* and their arrays to share, but there is nothing available to
583	>	* help arrange that).  Unfortunately, because they are recorded
584	>	* in a common array, WorkQueue instances are often moved to be
585	>	* adjacent by garbage collectors. To reduce impact, we use field
586	>	* padding that works OK on common platforms; this effectively
587	>	* trades off slightly slower average field access for the sake of
588	>	* avoiding really bad worst-case access. (Until better JVM
589	>	* support is in place, this padding is dependent on transient
590	>	* properties of JVM field layout rules.)  We also take care in
591	>	* allocating, sizing and resizing the array. Non-shared queue
592	>	* arrays are initialized (via method growArray) by workers before
593	>	* use. Others are allocated on first use.
594		*/
595	<	public static final ForkJoinWorkerThreadFactory
596	<	defaultForkJoinWorkerThreadFactory;
595	>	static final class WorkQueue {
596	>	/**
597	>	* Capacity of work-stealing queue array upon initialization.
598	>	* Must be a power of two; at least 4, but should be larger to
599	>	* reduce or eliminate cacheline sharing among queues.
600	>	* Currently, it is much larger, as a partial workaround for
601	>	* the fact that JVMs often place arrays in locations that
602	>	* share GC bookkeeping (especially cardmarks) such that
603	>	* per-write accesses encounter serious memory contention.
604	>	*/
605	>	static final int INITIAL_QUEUE_CAPACITY = 1 << 13;
606
607	<	/**
608	<	* Permission required for callers of methods that may start or
609	<	* kill threads.
610	<	*/
611	<	private static final RuntimePermission modifyThreadPermission;
607	>	/**
608	>	* Maximum size for queue arrays. Must be a power of two less
609	>	* than or equal to 1 << (31 - width of array entry) to ensure
610	>	* lack of wraparound of index calculations, but defined to a
611	>	* value a bit less than this to help users trap runaway
612	>	* programs before saturating systems.
613	>	*/
614	>	static final int MAXIMUM_QUEUE_CAPACITY = 1 << 26; // 64M
615
616	<	/**
617	<	* If there is a security manager, makes sure caller has
618	<	* permission to modify threads.
619	<	*/
620	<	private static void checkPermission() {
621	<	SecurityManager security = System.getSecurityManager();
622	<	if (security != null)
623	<	security.checkPermission(modifyThreadPermission);
616	>	volatile long totalSteals; // cumulative number of steals
617	>	int seed;                  // for random scanning; initialize nonzero
618	>	volatile int eventCount;   // encoded inactivation count; < 0 if inactive
619	>	int nextWait;              // encoded record of next event waiter
620	>	int rescans;               // remaining scans until block
621	>	int nsteals;               // top-level task executions since last idle
622	>	final int mode;            // lifo, fifo, or shared
623	>	int poolIndex;             // index of this queue in pool (or 0)
624	>	int stealHint;             // index of most recent known stealer
625	>	volatile int runState;     // 1: locked, -1: terminate; else 0
626	>	volatile int base;         // index of next slot for poll
627	>	int top;                   // index of next slot for push
628	>	ForkJoinTask<?>[] array;   // the elements (initially unallocated)
629	>	final ForkJoinPool pool;   // the containing pool (may be null)
630	>	final ForkJoinWorkerThread owner; // owning thread or null if shared
631	>	volatile Thread parker;    // == owner during call to park; else null
632	>	ForkJoinTask<?> currentJoin;  // task being joined in awaitJoin
633	>	ForkJoinTask<?> currentSteal; // current non-local task being executed
634	>	// Heuristic padding to ameliorate unfortunate memory placements
635	>	Object p00, p01, p02, p03, p04, p05, p06, p07;
636	>	Object p08, p09, p0a, p0b, p0c, p0d, p0e;
637	>
638	>	WorkQueue(ForkJoinPool pool, ForkJoinWorkerThread owner, int mode) {
639	>	this.mode = mode;
640	>	this.pool = pool;
641	>	this.owner = owner;
642	>	// Place indices in the center of array (that is not yet allocated)
643	>	base = top = INITIAL_QUEUE_CAPACITY >>> 1;
644	>	}
645	>
646	>	/**
647	>	* Returns the approximate number of tasks in the queue.
648	>	*/
649	>	final int queueSize() {
650	>	int n = base - top;       // non-owner callers must read base first
651	>	return (n >= 0) ? 0 : -n; // ignore transient negative
652	>	}
653	>
654	>	/**
655	>	* Provides a more accurate estimate of whether this queue has
656	>	* any tasks than does queueSize, by checking whether a
657	>	* near-empty queue has at least one unclaimed task.
658	>	*/
659	>	final boolean isEmpty() {
660	>	ForkJoinTask<?>[] a; int m, s;
661	>	int n = base - (s = top);
662	>	return (n >= 0 ||
663	>	(n == -1 &&
664	>	((a = array) == null ||
665	>	(m = a.length - 1) < 0 ||
666	>	U.getObjectVolatile
667	>	(a, ((m & (s - 1)) << ASHIFT) + ABASE) == null)));
668	>	}
669	>
670	>	/**
671	>	* Pushes a task. Call only by owner in unshared queues.
672	>	*
673	>	* @param task the task. Caller must ensure non-null.
674	>	* @throw RejectedExecutionException if array cannot be resized
675	>	*/
676	>	final void push(ForkJoinTask<?> task) {
677	>	ForkJoinTask<?>[] a; ForkJoinPool p;
678	>	int s = top, m, n;
679	>	if ((a = array) != null) {    // ignore if queue removed
680	>	U.putOrderedObject
681	>	(a, (((m = a.length - 1) & s) << ASHIFT) + ABASE, task);
682	>	if ((n = (top = s + 1) - base) <= 2) {
683	>	if ((p = pool) != null)
684	>	p.signalWork();
685	>	}
686	>	else if (n >= m)
687	>	growArray(true);
688	>	}
689	>	}
690	>
691	>	/**
692	>	* Pushes a task if lock is free and array is either big
693	>	* enough or can be resized to be big enough.
694	>	*
695	>	* @param task the task. Caller must ensure non-null.
696	>	* @return true if submitted
697	>	*/
698	>	final boolean trySharedPush(ForkJoinTask<?> task) {
699	>	boolean submitted = false;
700	>	if (runState == 0 && U.compareAndSwapInt(this, RUNSTATE, 0, 1)) {
701	>	ForkJoinTask<?>[] a = array;
702	>	int s = top;
703	>	try {
704	>	if ((a != null && a.length > s + 1 - base) ||
705	>	(a = growArray(false)) != null) { // must presize
706	>	int j = (((a.length - 1) & s) << ASHIFT) + ABASE;
707	>	U.putObject(a, (long)j, task);    // don't need "ordered"
708	>	top = s + 1;
709	>	submitted = true;
710	>	}
711	>	} finally {
712	>	runState = 0;                         // unlock
713	>	}
714	>	}
715	>	return submitted;
716	>	}
717	>
718	>	/**
719	>	* Takes next task, if one exists, in LIFO order.  Call only
720	>	* by owner in unshared queues. (We do not have a shared
721	>	* version of this method because it is never needed.)
722	>	*/
723	>	final ForkJoinTask<?> pop() {
724	>	ForkJoinTask<?> t; int m;
725	>	ForkJoinTask<?>[] a = array;
726	>	if (a != null && (m = a.length - 1) >= 0) {
727	>	for (int s; (s = top - 1) - base >= 0;) {
728	>	int j = ((m & s) << ASHIFT) + ABASE;
729	>	if ((t = (ForkJoinTask<?>)U.getObjectVolatile(a, j)) == null)
730	>	break;
731	>	if (U.compareAndSwapObject(a, j, t, null)) {
732	>	top = s;
733	>	return t;
734	>	}
735	>	}
736	>	}
737	>	return null;
738	>	}
739	>
740	>	/**
741	>	* Takes a task in FIFO order if b is base of queue and a task
742	>	* can be claimed without contention. Specialized versions
743	>	* appear in ForkJoinPool methods scan and tryHelpStealer.
744	>	*/
745	>	final ForkJoinTask<?> pollAt(int b) {
746	>	ForkJoinTask<?> t; ForkJoinTask<?>[] a;
747	>	if ((a = array) != null) {
748	>	int j = (((a.length - 1) & b) << ASHIFT) + ABASE;
749	>	if ((t = (ForkJoinTask<?>)U.getObjectVolatile(a, j)) != null &&
750	>	base == b &&
751	>	U.compareAndSwapObject(a, j, t, null)) {
752	>	base = b + 1;
753	>	return t;
754	>	}
755	>	}
756	>	return null;
757	>	}
758	>
759	>	/**
760	>	* Takes next task, if one exists, in FIFO order.
761	>	*/
762	>	final ForkJoinTask<?> poll() {
763	>	ForkJoinTask<?>[] a; int b; ForkJoinTask<?> t;
764	>	while ((b = base) - top < 0 && (a = array) != null) {
765	>	int j = (((a.length - 1) & b) << ASHIFT) + ABASE;
766	>	t = (ForkJoinTask<?>)U.getObjectVolatile(a, j);
767	>	if (t != null) {
768	>	if (base == b &&
769	>	U.compareAndSwapObject(a, j, t, null)) {
770	>	base = b + 1;
771	>	return t;
772	>	}
773	>	}
774	>	else if (base == b) {
775	>	if (b + 1 == top)
776	>	break;
777	>	Thread.yield(); // wait for lagging update
778	>	}
779	>	}
780	>	return null;
781	>	}
782	>
783	>	/**
784	>	* Takes next task, if one exists, in order specified by mode.
785	>	*/
786	>	final ForkJoinTask<?> nextLocalTask() {
787	>	return mode == 0 ? pop() : poll();
788	>	}
789	>
790	>	/**
791	>	* Returns next task, if one exists, in order specified by mode.
792	>	*/
793	>	final ForkJoinTask<?> peek() {
794	>	ForkJoinTask<?>[] a = array; int m;
795	>	if (a == null || (m = a.length - 1) < 0)
796	>	return null;
797	>	int i = mode == 0 ? top - 1 : base;
798	>	int j = ((i & m) << ASHIFT) + ABASE;
799	>	return (ForkJoinTask<?>)U.getObjectVolatile(a, j);
800	>	}
801	>
802	>	/**
803	>	* Pops the given task only if it is at the current top.
804	>	*/
805	>	final boolean tryUnpush(ForkJoinTask<?> t) {
806	>	ForkJoinTask<?>[] a; int s;
807	>	if ((a = array) != null && (s = top) != base &&
808	>	U.compareAndSwapObject
809	>	(a, (((a.length - 1) & --s) << ASHIFT) + ABASE, t, null)) {
810	>	top = s;
811	>	return true;
812	>	}
813	>	return false;
814	>	}
815	>
816	>	/**
817	>	* Polls the given task only if it is at the current base.
818	>	*/
819	>	final boolean pollFor(ForkJoinTask<?> task) {
820	>	ForkJoinTask<?>[] a; int b;
821	>	if ((b = base) - top < 0 && (a = array) != null) {
822	>	int j = (((a.length - 1) & b) << ASHIFT) + ABASE;
823	>	if (U.getObjectVolatile(a, j) == task && base == b &&
824	>	U.compareAndSwapObject(a, j, task, null)) {
825	>	base = b + 1;
826	>	return true;
827	>	}
828	>	}
829	>	return false;
830	>	}
831	>
832	>	/**
833	>	* If present, removes from queue and executes the given task, or
834	>	* any other cancelled task. Returns (true) immediately on any CAS
835	>	* or consistency check failure so caller can retry.
836	>	*
837	>	* @return false if no progress can be made
838	>	*/
839	>	final boolean tryRemoveAndExec(ForkJoinTask<?> task) {
840	>	boolean removed = false, empty = true, progress = true;
841	>	ForkJoinTask<?>[] a; int m, s, b, n;
842	>	if ((a = array) != null && (m = a.length - 1) >= 0 &&
843	>	(n = (s = top) - (b = base)) > 0) {
844	>	for (ForkJoinTask<?> t;;) {           // traverse from s to b
845	>	int j = ((--s & m) << ASHIFT) + ABASE;
846	>	t = (ForkJoinTask<?>)U.getObjectVolatile(a, j);
847	>	if (t == null)                    // inconsistent length
848	>	break;
849	>	else if (t == task) {
850	>	if (s + 1 == top) {           // pop
851	>	if (!U.compareAndSwapObject(a, j, task, null))
852	>	break;
853	>	top = s;
854	>	removed = true;
855	>	}
856	>	else if (base == b)           // replace with proxy
857	>	removed = U.compareAndSwapObject(a, j, task,
858	>	new EmptyTask());
859	>	break;
860	>	}
861	>	else if (t.status >= 0)
862	>	empty = false;
863	>	else if (s + 1 == top) {          // pop and throw away
864	>	if (U.compareAndSwapObject(a, j, t, null))
865	>	top = s;
866	>	break;
867	>	}
868	>	if (--n == 0) {
869	>	if (!empty && base == b)
870	>	progress = false;
871	>	break;
872	>	}
873	>	}
874	>	}
875	>	if (removed)
876	>	task.doExec();
877	>	return progress;
878	>	}
879	>
880	>	/**
881	>	* Initializes or doubles the capacity of array. Call either
882	>	* by owner or with lock held -- it is OK for base, but not
883	>	* top, to move while resizings are in progress.
884	>	*
885	>	* @param rejectOnFailure if true, throw exception if capacity
886	>	* exceeded (relayed ultimately to user); else return null.
887	>	*/
888	>	final ForkJoinTask<?>[] growArray(boolean rejectOnFailure) {
889	>	ForkJoinTask<?>[] oldA = array;
890	>	int size = oldA != null ? oldA.length << 1 : INITIAL_QUEUE_CAPACITY;
891	>	if (size <= MAXIMUM_QUEUE_CAPACITY) {
892	>	int oldMask, t, b;
893	>	ForkJoinTask<?>[] a = array = new ForkJoinTask<?>[size];
894	>	if (oldA != null && (oldMask = oldA.length - 1) >= 0 &&
895	>	(t = top) - (b = base) > 0) {
896	>	int mask = size - 1;
897	>	do {
898	>	ForkJoinTask<?> x;
899	>	int oldj = ((b & oldMask) << ASHIFT) + ABASE;
900	>	int j    = ((b &    mask) << ASHIFT) + ABASE;
901	>	x = (ForkJoinTask<?>)U.getObjectVolatile(oldA, oldj);
902	>	if (x != null &&
903	>	U.compareAndSwapObject(oldA, oldj, x, null))
904	>	U.putObjectVolatile(a, j, x);
905	>	} while (++b != t);
906	>	}
907	>	return a;
908	>	}
909	>	else if (!rejectOnFailure)
910	>	return null;
911	>	else
912	>	throw new RejectedExecutionException("Queue capacity exceeded");
913	>	}
914	>
915	>	/**
916	>	* Removes and cancels all known tasks, ignoring any exceptions.
917	>	*/
918	>	final void cancelAll() {
919	>	ForkJoinTask.cancelIgnoringExceptions(currentJoin);
920	>	ForkJoinTask.cancelIgnoringExceptions(currentSteal);
921	>	for (ForkJoinTask<?> t; (t = poll()) != null; )
922	>	ForkJoinTask.cancelIgnoringExceptions(t);
923	>	}
924	>
925	>	/**
926	>	* Computes next value for random probes.  Scans don't require
927	>	* a very high quality generator, but also not a crummy one.
928	>	* Marsaglia xor-shift is cheap and works well enough.  Note:
929	>	* This is manually inlined in its usages in ForkJoinPool to
930	>	* avoid writes inside busy scan loops.
931	>	*/
932	>	final int nextSeed() {
933	>	int r = seed;
934	>	r ^= r << 13;
935	>	r ^= r >>> 17;
936	>	return seed = r ^= r << 5;
937	>	}
938	>
939	>	// Execution methods
940	>
941	>	/**
942	>	* Removes and runs tasks until empty, using local mode
943	>	* ordering. Normally called only after checking for apparent
944	>	* non-emptiness.
945	>	*/
946	>	final void runLocalTasks() {
947	>	// hoist checks from repeated pop/poll
948	>	ForkJoinTask<?>[] a; int m;
949	>	if ((a = array) != null && (m = a.length - 1) >= 0) {
950	>	if (mode == 0) {
951	>	for (int s; (s = top - 1) - base >= 0;) {
952	>	int j = ((m & s) << ASHIFT) + ABASE;
953	>	ForkJoinTask<?> t =
954	>	(ForkJoinTask<?>)U.getObjectVolatile(a, j);
955	>	if (t != null) {
956	>	if (U.compareAndSwapObject(a, j, t, null)) {
957	>	top = s;
958	>	t.doExec();
959	>	}
960	>	}
961	>	else
962	>	break;
963	>	}
964	>	}
965	>	else {
966	>	for (int b; (b = base) - top < 0;) {
967	>	int j = ((m & b) << ASHIFT) + ABASE;
968	>	ForkJoinTask<?> t =
969	>	(ForkJoinTask<?>)U.getObjectVolatile(a, j);
970	>	if (t != null) {
971	>	if (base == b &&
972	>	U.compareAndSwapObject(a, j, t, null)) {
973	>	base = b + 1;
974	>	t.doExec();
975	>	}
976	>	} else if (base == b) {
977	>	if (b + 1 == top)
978	>	break;
979	>	Thread.yield(); // wait for lagging update
980	>	}
981	>	}
982	>	}
983	>	}
984	>	}
985	>
986	>	/**
987	>	* Executes a top-level task and any local tasks remaining
988	>	* after execution.
989	>	*
990	>	* @return true unless terminating
991	>	*/
992	>	final boolean runTask(ForkJoinTask<?> t) {
993	>	boolean alive = true;
994	>	if (t != null) {
995	>	currentSteal = t;
996	>	t.doExec();
997	>	if (top != base)        // conservative guard
998	>	runLocalTasks();
999	>	++nsteals;
1000	>	currentSteal = null;
1001	>	}
1002	>	else if (runState < 0)      // terminating
1003	>	alive = false;
1004	>	return alive;
1005	>	}
1006	>
1007	>	/**
1008	>	* Executes a non-top-level (stolen) task.
1009	>	*/
1010	>	final void runSubtask(ForkJoinTask<?> t) {
1011	>	if (t != null) {
1012	>	ForkJoinTask<?> ps = currentSteal;
1013	>	currentSteal = t;
1014	>	t.doExec();
1015	>	currentSteal = ps;
1016	>	}
1017	>	}
1018	>
1019	>	/**
1020	>	* Returns true if owned and not known to be blocked.
1021	>	*/
1022	>	final boolean isApparentlyUnblocked() {
1023	>	Thread wt; Thread.State s;
1024	>	return (eventCount >= 0 &&
1025	>	(wt = owner) != null &&
1026	>	(s = wt.getState()) != Thread.State.BLOCKED &&
1027	>	s != Thread.State.WAITING &&
1028	>	s != Thread.State.TIMED_WAITING);
1029	>	}
1030	>
1031	>	/**
1032	>	* If this owned and is not already interrupted, try to
1033	>	* interrupt and/or unpark, ignoring exceptions.
1034	>	*/
1035	>	final void interruptOwner() {
1036	>	Thread wt, p;
1037	>	if ((wt = owner) != null && !wt.isInterrupted()) {
1038	>	try {
1039	>	wt.interrupt();
1040	>	} catch (SecurityException ignore) {
1041	>	}
1042	>	}
1043	>	if ((p = parker) != null)
1044	>	U.unpark(p);
1045	>	}
1046	>
1047	>	// Unsafe mechanics
1048	>	private static final sun.misc.Unsafe U;
1049	>	private static final long RUNSTATE;
1050	>	private static final int ABASE;
1051	>	private static final int ASHIFT;
1052	>	static {
1053	>	int s;
1054	>	try {
1055	>	U = getUnsafe();
1056	>	Class<?> k = WorkQueue.class;
1057	>	Class<?> ak = ForkJoinTask[].class;
1058	>	RUNSTATE = U.objectFieldOffset
1059	>	(k.getDeclaredField("runState"));
1060	>	ABASE = U.arrayBaseOffset(ak);
1061	>	s = U.arrayIndexScale(ak);
1062	>	} catch (Exception e) {
1063	>	throw new Error(e);
1064	>	}
1065	>	if ((s & (s-1)) != 0)
1066	>	throw new Error("data type scale not a power of two");
1067	>	ASHIFT = 31 - Integer.numberOfLeadingZeros(s);
1068	>	}
1069		}
1070
1071		/**
1072	<	* Generator for assigning sequence numbers as pool names.
1072	>	* Per-thread records for threads that submit to pools. Currently
1073	>	* holds only pseudo-random seed / index that is used to choose
1074	>	* submission queues in method doSubmit. In the future, this may
1075	>	* also incorporate a means to implement different task rejection
1076	>	* and resubmission policies.
1077	>	*
1078	>	* Seeds for submitters and workers/workQueues work in basically
1079	>	* the same way but are initialized and updated using slightly
1080	>	* different mechanics. Both are initialized using the same
1081	>	* approach as in class ThreadLocal, where successive values are
1082	>	* unlikely to collide with previous values. This is done during
1083	>	* registration for workers, but requires a separate AtomicInteger
1084	>	* for submitters. Seeds are then randomly modified upon
1085	>	* collisions using xorshifts, which requires a non-zero seed.
1086		*/
1087	<	private static final AtomicInteger poolNumberGenerator;
1087	>	static final class Submitter {
1088	>	int seed;
1089	>	Submitter() {
1090	>	int s = nextSubmitterSeed.getAndAdd(SEED_INCREMENT);
1091	>	seed = (s == 0) ? 1 : s; // ensure non-zero
1092	>	}
1093	>	}
1094
1095	<	/**
1096	<	* Generator for initial random seeds for worker victim
1097	<	* selection. This is used only to create initial seeds. Random
1098	<	* steals use a cheaper xorshift generator per steal attempt. We
1099	<	* don't expect much contention on seedGenerator, so just use a
1100	<	* plain Random.
399	<	*/
400	<	static final Random workerSeedGenerator;
1095	>	/** ThreadLocal class for Submitters */
1096	>	static final class ThreadSubmitter extends ThreadLocal<Submitter> {
1097	>	public Submitter initialValue() { return new Submitter(); }
1098	>	}
1099	>
1100	>	// static fields (initialized in static initializer below)
1101
1102		/**
1103	<	* Array holding all worker threads in the pool.  Initialized upon
1104	<	* construction. Array size must be a power of two.  Updates and
405	<	* replacements are protected by scanGuard, but the array is
406	<	* always kept in a consistent enough state to be randomly
407	<	* accessed without locking by workers performing work-stealing,
408	<	* as well as other traversal-based methods in this class, so long
409	<	* as reads memory-acquire by first reading ctl. All readers must
410	<	* tolerate that some array slots may be null.
1103	>	* Creates a new ForkJoinWorkerThread. This factory is used unless
1104	>	* overridden in ForkJoinPool constructors.
1105		*/
1106	<	ForkJoinWorkerThread[] workers;
1106	>	public static final ForkJoinWorkerThreadFactory
1107	>	defaultForkJoinWorkerThreadFactory;
1108
1109		/**
1110	<	* Initial size for submission queue array. Must be a power of
416	<	* two.  In many applications, these always stay small so we use a
417	<	* small initial cap.
1110	>	* Generator for assigning sequence numbers as pool names.
1111		*/
1112	<	private static final int INITIAL_QUEUE_CAPACITY = 8;
1112	>	private static final AtomicInteger poolNumberGenerator;
1113
1114		/**
1115	<	* Maximum size for submission queue array. Must be a power of two
1116	<	* less than or equal to 1 << (31 - width of array entry) to
424	<	* ensure lack of index wraparound, but is capped at a lower
425	<	* value to help users trap runaway computations.
1115	>	* Generator for initial hashes/seeds for submitters. Accessed by
1116	>	* Submitter class constructor.
1117		*/
1118	<	private static final int MAXIMUM_QUEUE_CAPACITY = 1 << 24; // 16M
1118	>	static final AtomicInteger nextSubmitterSeed;
1119
1120		/**
1121	<	* Array serving as submission queue. Initialized upon construction.
1121	>	* Permission required for callers of methods that may start or
1122	>	* kill threads.
1123		*/
1124	<	private ForkJoinTask<?>[] submissionQueue;
1124	>	private static final RuntimePermission modifyThreadPermission;
1125
1126		/**
1127	<	* Lock protecting submissions array for addSubmission
1127	>	* Per-thread submission bookeeping. Shared across all pools
1128	>	* to reduce ThreadLocal pollution and because random motion
1129	>	* to avoid contention in one pool is likely to hold for others.
1130		*/
1131	<	private final ReentrantLock submissionLock;
1131	>	private static final ThreadSubmitter submitters;
1132	>
1133	>	// static constants
1134
1135		/**
1136	<	* Condition for awaitTermination, using submissionLock for
1137	<	* convenience.
1136	>	* The wakeup interval (in nanoseconds) for a worker waiting for a
1137	>	* task when the pool is quiescent to instead try to shrink the
1138	>	* number of workers.  The exact value does not matter too
1139	>	* much. It must be short enough to release resources during
1140	>	* sustained periods of idleness, but not so short that threads
1141	>	* are continually re-created.
1142		*/
1143	<	private final Condition termination;
1143	>	private static final long SHRINK_RATE =
1144	>	4L * 1000L * 1000L * 1000L; // 4 seconds
1145
1146		/**
1147	<	* Creation factory for worker threads.
1147	>	* The timeout value for attempted shrinkage, includes
1148	>	* some slop to cope with system timer imprecision.
1149		*/
1150	<	private final ForkJoinWorkerThreadFactory factory;
1150	>	private static final long SHRINK_TIMEOUT = SHRINK_RATE - (SHRINK_RATE / 10);
1151
1152		/**
1153	<	* The uncaught exception handler used when any worker abruptly
1154	<	* terminates.
1153	>	* The maximum stolen->joining link depth allowed in method
1154	>	* tryHelpStealer.  Must be a power of two. This value also
1155	>	* controls the maximum number of times to try to help join a task
1156	>	* without any apparent progress or change in pool state before
1157	>	* giving up and blocking (see awaitJoin).  Depths for legitimate
1158	>	* chains are unbounded, but we use a fixed constant to avoid
1159	>	* (otherwise unchecked) cycles and to bound staleness of
1160	>	* traversal parameters at the expense of sometimes blocking when
1161	>	* we could be helping.
1162		*/
1163	<	final Thread.UncaughtExceptionHandler ueh;
1163	>	private static final int MAX_HELP = 32;
1164
1165		/**
1166	<	* Prefix for assigning names to worker threads
1166	>	* Secondary time-based bound (in nanosecs) for helping attempts
1167	>	* before trying compensated blocking in awaitJoin. Used in
1168	>	* conjunction with MAX_HELP to reduce variance due to different
1169	>	* polling rates associated with different helping options. The
1170	>	* value should roughly approximate the time required to create
1171	>	* and/or activate a worker thread.
1172		*/
1173	<	private final String workerNamePrefix;
1173	>	private static final long COMPENSATION_DELAY = 100L * 1000L; // 0.1 millisec
1174
1175		/**
1176	<	* Sum of per-thread steal counts, updated only when threads are
1177	<	* idle or terminating.
1176	>	* Increment for seed generators. See class ThreadLocal for
1177	>	* explanation.
1178		*/
1179	<	private volatile long stealCount;
1179	>	private static final int SEED_INCREMENT = 0x61c88647;
1180
1181		/**
1182	<	* Main pool control -- a long packed with:
1182	>	* Bits and masks for control variables
1183	>	*
1184	>	* Field ctl is a long packed with:
1185		* AC: Number of active running workers minus target parallelism (16 bits)
1186	<	* TC: Number of total workers minus target parallelism (16bits)
1186	>	* TC: Number of total workers minus target parallelism (16 bits)
1187		* ST: true if pool is terminating (1 bit)
1188		* EC: the wait count of top waiting thread (15 bits)
1189	<	* ID: ~poolIndex of top of Treiber stack of waiting threads (16 bits)
1189	>	* ID: poolIndex of top of Treiber stack of waiters (16 bits)
1190		*
1191		* When convenient, we can extract the upper 32 bits of counts and
1192		* the lower 32 bits of queue state, u = (int)(ctl >>> 32) and e =
#	Line 479 | Line 1195 | public class ForkJoinPool extends Abstra
1195		* parallelism and the positionings of fields makes it possible to
1196		* perform the most common checks via sign tests of fields: When
1197		* ac is negative, there are not enough active workers, when tc is
1198	<	* negative, there are not enough total workers, when id is
483	<	* negative, there is at least one waiting worker, and when e is
1198	>	* negative, there are not enough total workers, and when e is
1199		* negative, the pool is terminating.  To deal with these possibly
1200		* negative fields, we use casts in and out of "short" and/or
1201		* signed shifts to maintain signedness.
1202	+	*
1203	+	* When a thread is queued (inactivated), its eventCount field is
1204	+	* set negative, which is the only way to tell if a worker is
1205	+	* prevented from executing tasks, even though it must continue to
1206	+	* scan for them to avoid queuing races. Note however that
1207	+	* eventCount updates lag releases so usage requires care.
1208	+	*
1209	+	* Field runState is an int packed with:
1210	+	* SHUTDOWN: true if shutdown is enabled (1 bit)
1211	+	* SEQ:  a sequence number updated upon (de)registering workers (30 bits)
1212	+	* INIT: set true after workQueues array construction (1 bit)
1213	+	*
1214	+	* The sequence number enables simple consistency checks:
1215	+	* Staleness of read-only operations on the workQueues array can
1216	+	* be checked by comparing runState before vs after the reads.
1217		*/
488	–	volatile long ctl;
1218
1219		// bit positions/shifts for fields
1220		private static final int  AC_SHIFT   = 48;
#	Line 494 | Line 1223 | public class ForkJoinPool extends Abstra
1223		private static final int  EC_SHIFT   = 16;
1224
1225		// bounds
1226	<	private static final int  MAX_ID     = 0x7fff;  // max poolIndex
1227	<	private static final int  SMASK      = 0xffff;  // mask short bits
1226	>	private static final int  SMASK      = 0xffff;  // short bits
1227	>	private static final int  MAX_CAP    = 0x7fff;  // max #workers - 1
1228	>	private static final int  SQMASK     = 0xfffe;  // even short bits
1229		private static final int  SHORT_SIGN = 1 << 15;
1230		private static final int  INT_SIGN   = 1 << 31;
1231
#	Line 517 | Line 1247 | public class ForkJoinPool extends Abstra
1247		private static final int  UTC_UNIT   = 1 << UTC_SHIFT;
1248
1249		// masks and units for dealing with e = (int)ctl
1250	<	private static final int  E_MASK     = 0x7fffffff; // no STOP_BIT
1251	<	private static final int  EC_UNIT    = 1 << EC_SHIFT;
1250	>	private static final int E_MASK      = 0x7fffffff; // no STOP_BIT
1251	>	private static final int E_SEQ       = 1 << EC_SHIFT;
1252
1253	<	/**
1254	<	* The target parallelism level.
525	<	*/
526	<	final int parallelism;
1253	>	// runState bits
1254	>	private static final int SHUTDOWN    = 1 << 31;
1255
1256	<	/**
1257	<	* Index (mod submission queue length) of next element to take
1258	<	* from submission queue. Usage is identical to that for
1259	<	* per-worker queues -- see ForkJoinWorkerThread internal
532	<	* documentation.
533	<	*/
534	<	volatile int queueBase;
1256	>	// access mode for WorkQueue
1257	>	static final int LIFO_QUEUE          =  0;
1258	>	static final int FIFO_QUEUE          =  1;
1259	>	static final int SHARED_QUEUE        = -1;
1260
1261	<	/**
537	<	* Index (mod submission queue length) of next element to add
538	<	* in submission queue. Usage is identical to that for
539	<	* per-worker queues -- see ForkJoinWorkerThread internal
540	<	* documentation.
541	<	*/
542	<	int queueTop;
1261	>	// Instance fields
1262
1263	<	/**
1264	<	* True when shutdown() has been called.
1265	<	*/
1266	<	volatile boolean shutdown;
1263	>	/*
1264	>	* Field layout order in this class tends to matter more than one
1265	>	* would like. Runtime layout order is only loosely related to
1266	>	* declaration order and may differ across JVMs, but the following
1267	>	* empirically works OK on current JVMs.
1268	>	*/
1269	>
1270	>	volatile long ctl;                         // main pool control
1271	>	final int parallelism;                     // parallelism level
1272	>	final int localMode;                       // per-worker scheduling mode
1273	>	final int submitMask;                      // submit queue index bound
1274	>	int nextSeed;                              // for initializing worker seeds
1275	>	volatile int runState;                     // shutdown status and seq
1276	>	WorkQueue[] workQueues;                    // main registry
1277	>	final Mutex lock;                          // for registration
1278	>	final Condition termination;               // for awaitTermination
1279	>	final ForkJoinWorkerThreadFactory factory; // factory for new workers
1280	>	final Thread.UncaughtExceptionHandler ueh; // per-worker UEH
1281	>	final AtomicLong stealCount;               // collect counts when terminated
1282	>	final AtomicInteger nextWorkerNumber;      // to create worker name string
1283	>	final String workerNamePrefix;             // to create worker name string
1284
1285	<	/**
550	<	* True if use local fifo, not default lifo, for local polling
551	<	* Read by, and replicated by ForkJoinWorkerThreads
552	<	*/
553	<	final boolean locallyFifo;
1285	>	//  Creating, registering, and deregistering workers
1286
1287		/**
1288	<	* The number of threads in ForkJoinWorkerThreads.helpQuiescePool.
557	<	* When non-zero, suppresses automatic shutdown when active
558	<	* counts become zero.
1288	>	* Tries to create and start a worker
1289		*/
1290	<	volatile int quiescerCount;
1290	>	private void addWorker() {
1291	>	Throwable ex = null;
1292	>	ForkJoinWorkerThread wt = null;
1293	>	try {
1294	>	if ((wt = factory.newThread(this)) != null) {
1295	>	wt.start();
1296	>	return;
1297	>	}
1298	>	} catch (Throwable e) {
1299	>	ex = e;
1300	>	}
1301	>	deregisterWorker(wt, ex); // adjust counts etc on failure
1302	>	}
1303
1304		/**
1305	<	* The number of threads blocked in join.
1305	>	* Callback from ForkJoinWorkerThread constructor to assign a
1306	>	* public name. This must be separate from registerWorker because
1307	>	* it is called during the "super" constructor call in
1308	>	* ForkJoinWorkerThread.
1309		*/
1310	<	volatile int blockedCount;
1310	>	final String nextWorkerName() {
1311	>	return workerNamePrefix.concat
1312	>	(Integer.toString(nextWorkerNumber.addAndGet(1)));
1313	>	}
1314
1315		/**
1316	<	* Counter for worker Thread names (unrelated to their poolIndex)
1316	>	* Callback from ForkJoinWorkerThread constructor to establish its
1317	>	* poolIndex and record its WorkQueue. To avoid scanning bias due
1318	>	* to packing entries in front of the workQueues array, we treat
1319	>	* the array as a simple power-of-two hash table using per-thread
1320	>	* seed as hash, expanding as needed.
1321	>	*
1322	>	* @param w the worker's queue
1323		*/
1324	<	private volatile int nextWorkerNumber;
1324	>	final void registerWorker(WorkQueue w) {
1325	>	Mutex lock = this.lock;
1326	>	lock.lock();
1327	>	try {
1328	>	WorkQueue[] ws = workQueues;
1329	>	if (w != null && ws != null) {          // skip on shutdown/failure
1330	>	int rs, n;
1331	>	while ((n = ws.length) <            // ensure can hold total
1332	>	(parallelism + (short)(ctl >>> TC_SHIFT) << 1))
1333	>	workQueues = ws = Arrays.copyOf(ws, n << 1);
1334	>	int m = n - 1;
1335	>	int s = nextSeed += SEED_INCREMENT; // rarely-colliding sequence
1336	>	w.seed = (s == 0) ? 1 : s;          // ensure non-zero seed
1337	>	int r = (s << 1) | 1;               // use odd-numbered indices
1338	>	while (ws[r &= m] != null)          // step by approx half size
1339	>	r += ((n >>> 1) & SQMASK) + 2;
1340	>	w.eventCount = w.poolIndex = r;     // establish before recording
1341	>	ws[r] = w;                          // also update seq
1342	>	runState = ((rs = runState) & SHUTDOWN) | ((rs + 2) & ~SHUTDOWN);
1343	>	}
1344	>	} finally {
1345	>	lock.unlock();
1346	>	}
1347	>	}
1348
1349		/**
1350	<	* The index for the next created worker. Accessed under scanGuard.
1350	>	* Final callback from terminating worker, as well as upon failure
1351	>	* to construct or start a worker in addWorker.  Removes record of
1352	>	* worker from array, and adjusts counts. If pool is shutting
1353	>	* down, tries to complete termination.
1354	>	*
1355	>	* @param wt the worker thread or null if addWorker failed
1356	>	* @param ex the exception causing failure, or null if none
1357		*/
1358	<	private int nextWorkerIndex;
1358	>	final void deregisterWorker(ForkJoinWorkerThread wt, Throwable ex) {
1359	>	Mutex lock = this.lock;
1360	>	WorkQueue w = null;
1361	>	if (wt != null && (w = wt.workQueue) != null) {
1362	>	w.runState = -1;                // ensure runState is set
1363	>	stealCount.getAndAdd(w.totalSteals + w.nsteals);
1364	>	int idx = w.poolIndex;
1365	>	lock.lock();
1366	>	try {                           // remove record from array
1367	>	WorkQueue[] ws = workQueues;
1368	>	if (ws != null && idx >= 0 && idx < ws.length && ws[idx] == w)
1369	>	ws[idx] = null;
1370	>	} finally {
1371	>	lock.unlock();
1372	>	}
1373	>	}
1374
1375	<	/**
1376	<	* SeqLock and index masking for updates to workers array.  Locked
1377	<	* when SG_UNIT is set. Unlocking clears bit by adding
1378	<	* SG_UNIT. Staleness of read-only operations can be checked by
1379	<	* comparing scanGuard to value before the reads. The low 16 bits
1380	<	* (i.e, anding with SMASK) hold (the smallest power of two
1381	<	* covering all worker indices, minus one, and is used to avoid
1382	<	* dealing with large numbers of null slots when the workers array
1383	<	* is overallocated.
1384	<	*/
1385	<	volatile int scanGuard;
1375	>	long c;                             // adjust ctl counts
1376	>	do {} while (!U.compareAndSwapLong
1377	>	(this, CTL, c = ctl, (((c - AC_UNIT) & AC_MASK) |
1378	>	((c - TC_UNIT) & TC_MASK) |
1379	>	(c & ~(AC_MASK|TC_MASK)))));
1380	>
1381	>	if (!tryTerminate(false, false) && w != null) {
1382	>	w.cancelAll();                  // cancel remaining tasks
1383	>	if (w.array != null)            // suppress signal if never ran
1384	>	signalWork();               // wake up or create replacement
1385	>	if (ex == null)                 // help clean refs on way out
1386	>	ForkJoinTask.helpExpungeStaleExceptions();
1387	>	}
1388
1389	<	private static final int SG_UNIT = 1 << 16;
1389	>	if (ex != null)                     // rethrow
1390	>	U.throwException(ex);
1391	>	}
1392	>
1393	>
1394	>	// Submissions
1395
1396		/**
1397	<	* The wakeup interval (in nanoseconds) for a worker waiting for a
1398	<	* task when the pool is quiescent to instead try to shrink the
1399	<	* number of workers.  The exact value does not matter too
1400	<	* much. It must be short enough to release resources during
1401	<	* sustained periods of idleness, but not so short that threads
1402	<	* are continually re-created.
1403	<	*/
1404	<	private static final long SHRINK_RATE =
1405	<	4L * 1000L * 1000L * 1000L; // 4 seconds
1397	>	* Unless shutting down, adds the given task to a submission queue
1398	>	* at submitter's current queue index (modulo submission
1399	>	* range). If no queue exists at the index, one is created.  If
1400	>	* the queue is busy, another index is randomly chosen. The
1401	>	* submitMask bounds the effective number of queues to the
1402	>	* (nearest power of two for) parallelism level.
1403	>	*
1404	>	* @param task the task. Caller must ensure non-null.
1405	>	*/
1406	>	private void doSubmit(ForkJoinTask<?> task) {
1407	>	Submitter s = submitters.get();
1408	>	for (int r = s.seed, m = submitMask;;) {
1409	>	WorkQueue[] ws; WorkQueue q;
1410	>	int k = r & m & SQMASK;          // use only even indices
1411	>	if (runState < 0 || (ws = workQueues) == null || ws.length <= k)
1412	>	throw new RejectedExecutionException(); // shutting down
1413	>	else if ((q = ws[k]) == null) {  // create new queue
1414	>	WorkQueue nq = new WorkQueue(this, null, SHARED_QUEUE);
1415	>	Mutex lock = this.lock;      // construct outside lock
1416	>	lock.lock();
1417	>	try {                        // recheck under lock
1418	>	int rs = runState;       // to update seq
1419	>	if (ws == workQueues && ws[k] == null) {
1420	>	ws[k] = nq;
1421	>	runState = ((rs & SHUTDOWN) | ((rs + 2) & ~SHUTDOWN));
1422	>	}
1423	>	} finally {
1424	>	lock.unlock();
1425	>	}
1426	>	}
1427	>	else if (q.trySharedPush(task)) {
1428	>	signalWork();
1429	>	return;
1430	>	}
1431	>	else if (m > 1) {                // move to a different index
1432	>	r ^= r << 13;                // same xorshift as WorkQueues
1433	>	r ^= r >>> 17;
1434	>	s.seed = r ^= r << 5;
1435	>	}
1436	>	else
1437	>	Thread.yield();              // yield if no alternatives
1438	>	}
1439	>	}
1440	>
1441	>	// Maintaining ctl counts
1442
1443		/**
1444	<	* Top-level loop for worker threads: On each step: if the
604	<	* previous step swept through all queues and found no tasks, or
605	<	* there are excess threads, then possibly blocks. Otherwise,
606	<	* scans for and, if found, executes a task. Returns when pool
607	<	* and/or worker terminate.
608	<	*
609	<	* @param w the worker
1444	>	* Increments active count; mainly called upon return from blocking.
1445		*/
1446	<	final void work(ForkJoinWorkerThread w) {
612	<	boolean swept = false;                // true on empty scans
1446	>	final void incrementActiveCount() {
1447		long c;
1448	<	while (!w.terminate && (int)(c = ctl) >= 0) {
615	<	int a;                            // active count
616	<	if (!swept && (a = (int)(c >> AC_SHIFT)) <= 0)
617	<	swept = scan(w, a);
618	<	else if (tryAwaitWork(w, c))
619	<	swept = false;
620	<	}
1448	>	do {} while (!U.compareAndSwapLong(this, CTL, c = ctl, c + AC_UNIT));
1449		}
1450
623	–	// Signalling
624	–
1451		/**
1452	<	* Wakes up or creates a worker.
1452	>	* Tries to activate or create a worker if too few are active.
1453		*/
1454		final void signalWork() {
1455	<	/*
1456	<	* The while condition is true if: (there is are too few total
1457	<	* workers OR there is at least one waiter) AND (there are too
1458	<	* few active workers OR the pool is terminating).  The value
1459	<	* of e distinguishes the remaining cases: zero (no waiters)
1460	<	* for create, negative if terminating (in which case do
1461	<	* nothing), else release a waiter. The secondary checks for
1462	<	* release (non-null array etc) can fail if the pool begins
1463	<	* terminating after the test, and don't impose any added cost
1464	<	* because JVMs must perform null and bounds checks anyway.
1465	<	*/
1466	<	long c; int e, u;
1467	<	while ((((e = (int)(c = ctl)) | (u = (int)(c >>> 32))) &
1468	<	(INT_SIGN|SHORT_SIGN)) == (INT_SIGN|SHORT_SIGN) && e >= 0) {
1469	<	if (e > 0) {                         // release a waiting worker
1470	<	int i; ForkJoinWorkerThread w; ForkJoinWorkerThread[] ws;
645	<	if ((ws = workers) == null ||
646	<	(i = ~e & SMASK) >= ws.length ||
647	<	(w = ws[i]) == null)
1455	>	long c; int u;
1456	>	while ((u = (int)((c = ctl) >>> 32)) < 0) {     // too few active
1457	>	WorkQueue[] ws = workQueues; int e, i; WorkQueue w; Thread p;
1458	>	if ((e = (int)c) > 0) {                     // at least one waiting
1459	>	if (ws != null && (i = e & SMASK) < ws.length &&
1460	>	(w = ws[i]) != null && w.eventCount == (e | INT_SIGN)) {
1461	>	long nc = (((long)(w.nextWait & E_MASK)) |
1462	>	((long)(u + UAC_UNIT) << 32));
1463	>	if (U.compareAndSwapLong(this, CTL, c, nc)) {
1464	>	w.eventCount = (e + E_SEQ) & E_MASK;
1465	>	if ((p = w.parker) != null)
1466	>	U.unpark(p);                // activate and release
1467	>	break;
1468	>	}
1469	>	}
1470	>	else
1471		break;
1472	<	long nc = (((long)(w.nextWait & E_MASK)) |
1473	<	((long)(u + UAC_UNIT) << 32));
1474	<	if (w.eventCount == e &&
1475	<	UNSAFE.compareAndSwapLong(this, ctlOffset, c, nc)) {
1476	<	w.eventCount = (e + EC_UNIT) & E_MASK;
1477	<	if (w.parked)
655	<	UNSAFE.unpark(w);
1472	>	}
1473	>	else if (e == 0 && (u & SHORT_SIGN) != 0) { // too few total
1474	>	long nc = (long)(((u + UTC_UNIT) & UTC_MASK) |
1475	>	((u + UAC_UNIT) & UAC_MASK)) << 32;
1476	>	if (U.compareAndSwapLong(this, CTL, c, nc)) {
1477	>	addWorker();
1478		break;
1479		}
1480		}
1481	<	else if (UNSAFE.compareAndSwapLong
660	<	(this, ctlOffset, c,
661	<	(long)(((u + UTC_UNIT) & UTC_MASK) |
662	<	((u + UAC_UNIT) & UAC_MASK)) << 32)) {
663	<	addWorker();
1481	>	else
1482		break;
665	–	}
1483		}
1484		}
1485
669	–	/**
670	–	* Variant of signalWork to help release waiters on rescans.
671	–	* Tries once to release a waiter if active count < 0.
672	–	*
673	–	* @return false if failed due to contention, else true
674	–	*/
675	–	private boolean tryReleaseWaiter() {
676	–	long c; int e, i; ForkJoinWorkerThread w; ForkJoinWorkerThread[] ws;
677	–	if ((e = (int)(c = ctl)) > 0 &&
678	–	(int)(c >> AC_SHIFT) < 0 &&
679	–	(ws = workers) != null &&
680	–	(i = ~e & SMASK) < ws.length &&
681	–	(w = ws[i]) != null) {
682	–	long nc = ((long)(w.nextWait & E_MASK) |
683	–	((c + AC_UNIT) & (AC_MASK|TC_MASK)));
684	–	if (w.eventCount != e ||
685	–	!UNSAFE.compareAndSwapLong(this, ctlOffset, c, nc))
686	–	return false;
687	–	w.eventCount = (e + EC_UNIT) & E_MASK;
688	–	if (w.parked)
689	–	UNSAFE.unpark(w);
690	–	}
691	–	return true;
692	–	}
1486
1487		// Scanning for tasks
1488
1489		/**
1490	<	* Scans for and, if found, executes one task. Scans start at a
1491	<	* random index of workers array, and randomly select the first
1492	<	* (2*#workers)-1 probes, and then, if all empty, resort to 2
1493	<	* circular sweeps, which is necessary to check quiescence. and
1494	<	* taking a submission only if no stealable tasks were found.  The
1495	<	* steal code inside the loop is a specialized form of
1496	<	* ForkJoinWorkerThread.deqTask, followed bookkeeping to support
1497	<	* helpJoinTask and signal propagation. The code for submission
1498	<	* queues is almost identical. On each steal, the worker completes
1499	<	* not only the task, but also all local tasks that this task may
1500	<	* have generated. On detecting staleness or contention when
1501	<	* trying to take a task, this method returns without finishing
1502	<	* sweep, which allows global state rechecks before retry.
1503	<	*
1504	<	* @param w the worker
1505	<	* @param a the number of active workers
1506	<	* @return true if swept all queues without finding a task
1507	<	*/
1508	<	private boolean scan(ForkJoinWorkerThread w, int a) {
1509	<	int g = scanGuard; // mask 0 avoids useless scans if only one active
1510	<	int m = parallelism == 1 - a? 0 : g & SMASK;
1511	<	ForkJoinWorkerThread[] ws = workers;
1512	<	if (ws == null || ws.length <= m)         // staleness check
1513	<	return false;
1514	<	for (int r = w.seed, k = r, j = -(m + m); j <= m + m; ++j) {
1515	<	ForkJoinTask<?> t; ForkJoinTask<?>[] q; int b, i;
1516	<	ForkJoinWorkerThread v = ws[k & m];
1517	<	if (v != null && (b = v.queueBase) != v.queueTop &&
1518	<	(q = v.queue) != null && (i = (q.length - 1) & b) >= 0) {
1519	<	long u = (i << ASHIFT) + ABASE;
1520	<	if ((t = q[i]) != null && v.queueBase == b &&
1521	<	UNSAFE.compareAndSwapObject(q, u, t, null)) {
1522	<	int d = (v.queueBase = b + 1) - v.queueTop;
1523	<	v.stealHint = w.poolIndex;
1524	<	if (d != 0)
1525	<	signalWork();             // propagate if nonempty
1526	<	w.execTask(t);
1490	>	* Top-level runloop for workers, called by ForkJoinWorkerThread.run.
1491	>	*/
1492	>	final void runWorker(WorkQueue w) {
1493	>	w.growArray(false);         // initialize queue array in this thread
1494	>	do {} while (w.runTask(scan(w)));
1495	>	}
1496	>
1497	>	/**
1498	>	* Scans for and, if found, returns one task, else possibly
1499	>	* inactivates the worker. This method operates on single reads of
1500	>	* volatile state and is designed to be re-invoked continuously,
1501	>	* in part because it returns upon detecting inconsistencies,
1502	>	* contention, or state changes that indicate possible success on
1503	>	* re-invocation.
1504	>	*
1505	>	* The scan searches for tasks across a random permutation of
1506	>	* queues (starting at a random index and stepping by a random
1507	>	* relative prime, checking each at least once).  The scan
1508	>	* terminates upon either finding a non-empty queue, or completing
1509	>	* the sweep. If the worker is not inactivated, it takes and
1510	>	* returns a task from this queue.  On failure to find a task, we
1511	>	* take one of the following actions, after which the caller will
1512	>	* retry calling this method unless terminated.
1513	>	*
1514	>	* * If pool is terminating, terminate the worker.
1515	>	*
1516	>	* * If not a complete sweep, try to release a waiting worker.  If
1517	>	* the scan terminated because the worker is inactivated, then the
1518	>	* released worker will often be the calling worker, and it can
1519	>	* succeed obtaining a task on the next call. Or maybe it is
1520	>	* another worker, but with same net effect. Releasing in other
1521	>	* cases as well ensures that we have enough workers running.
1522	>	*
1523	>	* * If not already enqueued, try to inactivate and enqueue the
1524	>	* worker on wait queue. Or, if inactivating has caused the pool
1525	>	* to be quiescent, relay to idleAwaitWork to check for
1526	>	* termination and possibly shrink pool.
1527	>	*
1528	>	* * If already inactive, and the caller has run a task since the
1529	>	* last empty scan, return (to allow rescan) unless others are
1530	>	* also inactivated.  Field WorkQueue.rescans counts down on each
1531	>	* scan to ensure eventual inactivation and blocking.
1532	>	*
1533	>	* * If already enqueued and none of the above apply, park
1534	>	* awaiting signal,
1535	>	*
1536	>	* @param w the worker (via its WorkQueue)
1537	>	* @return a task or null of none found
1538	>	*/
1539	>	private final ForkJoinTask<?> scan(WorkQueue w) {
1540	>	WorkQueue[] ws;                       // first update random seed
1541	>	int r = w.seed; r ^= r << 13; r ^= r >>> 17; w.seed = r ^= r << 5;
1542	>	int rs = runState, m;                 // volatile read order matters
1543	>	if ((ws = workQueues) != null && (m = ws.length - 1) > 0) {
1544	>	int ec = w.eventCount;            // ec is negative if inactive
1545	>	int step = (r >>> 16) | 1;        // relative prime
1546	>	for (int j = (m + 1) << 2; ; r += step) {
1547	>	WorkQueue q; ForkJoinTask<?> t; ForkJoinTask<?>[] a; int b;
1548	>	if ((q = ws[r & m]) != null && (b = q.base) - q.top < 0 &&
1549	>	(a = q.array) != null) {  // probably nonempty
1550	>	int i = (((a.length - 1) & b) << ASHIFT) + ABASE;
1551	>	t = (ForkJoinTask<?>)U.getObjectVolatile(a, i);
1552	>	if (q.base == b && ec >= 0 && t != null &&
1553	>	U.compareAndSwapObject(a, i, t, null)) {
1554	>	q.base = b + 1;       // specialization of pollAt
1555	>	return t;
1556	>	}
1557	>	else if ((t != null || b + 1 != q.top) &&
1558	>	(ec < 0 || j <= m)) {
1559	>	rs = 0;               // mark scan as imcomplete
1560	>	break;                // caller can retry after release
1561	>	}
1562		}
1563	<	r ^= r << 13; r ^= r >>> 17; w.seed = r ^ (r << 5);
1564	<	return false;                     // store next seed
1563	>	if (--j < 0)
1564	>	break;
1565		}
1566	<	else if (j < 0) {                     // xorshift
1567	<	r ^= r << 13; r ^= r >>> 17; k = r ^= r << 5;
1566	>	long c = ctl; int e = (int)c, a = (int)(c >> AC_SHIFT), nr, ns;
1567	>	if (e < 0)                        // decode ctl on empty scan
1568	>	w.runState = -1;              // pool is terminating
1569	>	else if (rs == 0 || rs != runState) { // incomplete scan
1570	>	WorkQueue v; Thread p;        // try to release a waiter
1571	>	if (e > 0 && a < 0 && w.eventCount == ec &&
1572	>	(v = ws[e & m]) != null && v.eventCount == (e | INT_SIGN)) {
1573	>	long nc = ((long)(v.nextWait & E_MASK) |
1574	>	((c + AC_UNIT) & (AC_MASK|TC_MASK)));
1575	>	if (ctl == c && U.compareAndSwapLong(this, CTL, c, nc)) {
1576	>	v.eventCount = (e + E_SEQ) & E_MASK;
1577	>	if ((p = v.parker) != null)
1578	>	U.unpark(p);
1579	>	}
1580	>	}
1581		}
1582	<	else
1583	<	++k;
1584	<	}
1585	<	if (scanGuard != g)                       // staleness check
1586	<	return false;
1587	<	else {                                    // try to take submission
1588	<	ForkJoinTask<?> t; ForkJoinTask<?>[] q; int b, i;
1589	<	if ((b = queueBase) != queueTop &&
1590	<	(q = submissionQueue) != null &&
1591	<	(i = (q.length - 1) & b) >= 0) {
1592	<	long u = (i << ASHIFT) + ABASE;
752	<	if ((t = q[i]) != null && queueBase == b &&
753	<	UNSAFE.compareAndSwapObject(q, u, t, null)) {
754	<	queueBase = b + 1;
755	<	w.execTask(t);
756	<	}
757	<	return false;
758	<	}
759	<	return true;                         // all queues empty
760	<	}
761	<	}
762	<
763	<	/**
764	<	* Tries to enqueue worker w in wait queue and await change in
765	<	* worker's eventCount.  If the pool is quiescent, possibly
766	<	* terminates worker upon exit.  Otherwise, before blocking,
767	<	* rescans queues to avoid missed signals.  Upon finding work,
768	<	* releases at least one worker (which may be the current
769	<	* worker). Rescans restart upon detected staleness or failure to
770	<	* release due to contention. Note the unusual conventions about
771	<	* Thread.interrupt here and elsewhere: Because interrupts are
772	<	* used solely to alert threads to check termination, which is
773	<	* checked here anyway, we clear status (using Thread.interrupted)
774	<	* before any call to park, so that park does not immediately
775	<	* return due to status being set via some other unrelated call to
776	<	* interrupt in user code.
777	<	*
778	<	* @param w the calling worker
779	<	* @param c the ctl value on entry
780	<	* @return true if waited or another thread was released upon enq
781	<	*/
782	<	private boolean tryAwaitWork(ForkJoinWorkerThread w, long c) {
783	<	int v = w.eventCount;
784	<	w.nextWait = (int)c;                      // w's successor record
785	<	long nc = (long)(v & E_MASK) | ((c - AC_UNIT) & (AC_MASK|TC_MASK));
786	<	if (ctl != c || !UNSAFE.compareAndSwapLong(this, ctlOffset, c, nc)) {
787	<	long d = ctl; // return true if lost to a deq, to force scan
788	<	return (int)d != (int)c && ((d - c) & AC_MASK) >= 0L;
789	<	}
790	<	for (int sc = w.stealCount; sc != 0;) {   // accumulate stealCount
791	<	long s = stealCount;
792	<	if (UNSAFE.compareAndSwapLong(this, stealCountOffset, s, s + sc))
793	<	sc = w.stealCount = 0;
794	<	else if (w.eventCount != v)
795	<	return true;                      // update next time
796	<	}
797	<	if (parallelism + (int)(nc >> AC_SHIFT) == 0 &&
798	<	blockedCount == 0 && quiescerCount == 0)
799	<	idleAwaitWork(w, nc, c, v);           // quiescent
800	<	for (boolean rescanned = false;;) {
801	<	if (w.eventCount != v)
802	<	return true;
803	<	if (!rescanned) {
804	<	int g = scanGuard, m = g & SMASK;
805	<	ForkJoinWorkerThread[] ws = workers;
806	<	if (ws != null && m < ws.length) {
807	<	rescanned = true;
808	<	for (int i = 0; i <= m; ++i) {
809	<	ForkJoinWorkerThread u = ws[i];
810	<	if (u != null) {
811	<	if (u.queueBase != u.queueTop &&
812	<	!tryReleaseWaiter())
813	<	rescanned = false; // contended
814	<	if (w.eventCount != v)
815	<	return true;
816	<	}
1582	>	else if (ec >= 0) {               // try to enqueue/inactivate
1583	>	long nc = (long)ec | ((c - AC_UNIT) & (AC_MASK|TC_MASK));
1584	>	w.nextWait = e;
1585	>	w.eventCount = ec | INT_SIGN; // mark as inactive
1586	>	if (ctl != c || !U.compareAndSwapLong(this, CTL, c, nc))
1587	>	w.eventCount = ec;        // unmark on CAS failure
1588	>	else {
1589	>	if ((ns = w.nsteals) != 0) {
1590	>	w.nsteals = 0;        // set rescans if ran task
1591	>	w.rescans = (a > 0) ? 0 : a + parallelism;
1592	>	w.totalSteals += ns;
1593		}
1594	+	if (a == 1 - parallelism) // quiescent
1595	+	idleAwaitWork(w, nc, c);
1596		}
819	–	if (scanGuard != g ||              // stale
820	–	(queueBase != queueTop && !tryReleaseWaiter()))
821	–	rescanned = false;
822	–	if (!rescanned)
823	–	Thread.yield();                // reduce contention
824	–	else
825	–	Thread.interrupted();          // clear before park
1597		}
1598	<	else {
1599	<	w.parked = true;                   // must recheck
1600	<	if (w.eventCount != v) {
1601	<	w.parked = false;
1602	<	return true;
1598	>	else if (w.eventCount < 0) {      // already queued
1599	>	if ((nr = w.rescans) > 0) {   // continue rescanning
1600	>	int ac = a + parallelism;
1601	>	if (((w.rescans = (ac < nr) ? ac : nr - 1) & 3) == 0)
1602	>	Thread.yield();       // yield before block
1603	>	}
1604	>	else {
1605	>	Thread.interrupted();     // clear status
1606	>	Thread wt = Thread.currentThread();
1607	>	U.putObject(wt, PARKBLOCKER, this);
1608	>	w.parker = wt;            // emulate LockSupport.park
1609	>	if (w.eventCount < 0)     // recheck
1610	>	U.park(false, 0L);
1611	>	w.parker = null;
1612	>	U.putObject(wt, PARKBLOCKER, null);
1613		}
833	–	LockSupport.park(this);
834	–	rescanned = w.parked = false;
1614		}
1615		}
1616	+	return null;
1617		}
1618
1619		/**
1620	<	* If inactivating worker w has caused pool to become
1621	<	* quiescent, check for pool termination, and wait for event
1622	<	* for up to SHRINK_RATE nanosecs (rescans are unnecessary in
1623	<	* this case because quiescence reflects consensus about lack
1624	<	* of work). On timeout, if ctl has not changed, terminate the
1625	<	* worker. Upon its termination (see deregisterWorker), it may
846	<	* wake up another worker to possibly repeat this process.
1620	>	* If inactivating worker w has caused the pool to become
1621	>	* quiescent, checks for pool termination, and, so long as this is
1622	>	* not the only worker, waits for event for up to SHRINK_RATE
1623	>	* nanosecs.  On timeout, if ctl has not changed, terminates the
1624	>	* worker, which will in turn wake up another worker to possibly
1625	>	* repeat this process.
1626		*
1627		* @param w the calling worker
1628	<	* @param currentCtl the ctl value after enqueuing w
1629	<	* @param prevCtl the ctl value if w terminated
1630	<	* @param v the eventCount w awaits change
1631	<	*/
1632	<	private void idleAwaitWork(ForkJoinWorkerThread w, long currentCtl,
1633	<	long prevCtl, int v) {
1634	<	if (w.eventCount == v) {
1635	<	if (shutdown)
857	<	tryTerminate(false);
858	<	ForkJoinTask.helpExpungeStaleExceptions(); // help clean weak refs
1628	>	* @param currentCtl the ctl value triggering possible quiescence
1629	>	* @param prevCtl the ctl value to restore if thread is terminated
1630	>	*/
1631	>	private void idleAwaitWork(WorkQueue w, long currentCtl, long prevCtl) {
1632	>	if (w.eventCount < 0 && !tryTerminate(false, false) &&
1633	>	(int)prevCtl != 0 && ctl == currentCtl) {
1634	>	Thread wt = Thread.currentThread();
1635	>	Thread.yield();            // yield before block
1636		while (ctl == currentCtl) {
1637		long startTime = System.nanoTime();
1638	<	w.parked = true;
1639	<	if (w.eventCount == v)             // must recheck
1640	<	LockSupport.parkNanos(this, SHRINK_RATE);
1641	<	w.parked = false;
1642	<	if (w.eventCount != v)
1638	>	Thread.interrupted();  // timed variant of version in scan()
1639	>	U.putObject(wt, PARKBLOCKER, this);
1640	>	w.parker = wt;
1641	>	if (ctl == currentCtl)
1642	>	U.park(false, SHRINK_RATE);
1643	>	w.parker = null;
1644	>	U.putObject(wt, PARKBLOCKER, null);
1645	>	if (ctl != currentCtl)
1646		break;
1647	<	else if (System.nanoTime() - startTime < SHRINK_RATE)
1648	<	Thread.interrupted();          // spurious wakeup
1649	<	else if (UNSAFE.compareAndSwapLong(this, ctlOffset,
1650	<	currentCtl, prevCtl)) {
871	<	w.terminate = true;            // restore previous
872	<	w.eventCount = ((int)currentCtl + EC_UNIT) & E_MASK;
1647	>	if (System.nanoTime() - startTime >= SHRINK_TIMEOUT &&
1648	>	U.compareAndSwapLong(this, CTL, currentCtl, prevCtl)) {
1649	>	w.eventCount = (w.eventCount + E_SEQ) | E_MASK;
1650	>	w.runState = -1;   // shrink
1651		break;
1652		}
1653		}
1654		}
1655		}
1656
879	–	// Submissions
880	–
1657		/**
1658	<	* Enqueues the given task in the submissionQueue.  Same idea as
1659	<	* ForkJoinWorkerThread.pushTask except for use of submissionLock.
1660	<	*
1661	<	* @param t the task
1662	<	*/
1663	<	private void addSubmission(ForkJoinTask<?> t) {
1664	<	final ReentrantLock lock = this.submissionLock;
1665	<	lock.lock();
1666	<	try {
1667	<	ForkJoinTask<?>[] q; int s, m;
1668	<	if ((q = submissionQueue) != null) {    // ignore if queue removed
1669	<	long u = (((s = queueTop) & (m = q.length-1)) << ASHIFT)+ABASE;
1670	<	UNSAFE.putOrderedObject(q, u, t);
1671	<	queueTop = s + 1;
1672	<	if (s - queueBase == m)
1673	<	growSubmissionQueue();
1658	>	* Tries to locate and execute tasks for a stealer of the given
1659	>	* task, or in turn one of its stealers, Traces currentSteal ->
1660	>	* currentJoin links looking for a thread working on a descendant
1661	>	* of the given task and with a non-empty queue to steal back and
1662	>	* execute tasks from. The first call to this method upon a
1663	>	* waiting join will often entail scanning/search, (which is OK
1664	>	* because the joiner has nothing better to do), but this method
1665	>	* leaves hints in workers to speed up subsequent calls. The
1666	>	* implementation is very branchy to cope with potential
1667	>	* inconsistencies or loops encountering chains that are stale,
1668	>	* unknown, or so long that they are likely cyclic.  All of these
1669	>	* cases are dealt with by just retrying by caller.
1670	>	*
1671	>	* @param joiner the joining worker
1672	>	* @param task the task to join
1673	>	* @return true if found or ran a task (and so is immediately retryable)
1674	>	*/
1675	>	private boolean tryHelpStealer(WorkQueue joiner, ForkJoinTask<?> task) {
1676	>	WorkQueue[] ws;
1677	>	int m, depth = MAX_HELP;                // remaining chain depth
1678	>	boolean progress = false;
1679	>	if ((ws = workQueues) != null && (m = ws.length - 1) > 0 &&
1680	>	task.status >= 0) {
1681	>	ForkJoinTask<?> subtask = task;     // current target
1682	>	outer: for (WorkQueue j = joiner;;) {
1683	>	WorkQueue stealer = null;       // find stealer of subtask
1684	>	WorkQueue v = ws[j.stealHint & m]; // try hint
1685	>	if (v != null && v.currentSteal == subtask)
1686	>	stealer = v;
1687	>	else {                          // scan
1688	>	for (int i = 1; i <= m; i += 2) {
1689	>	if ((v = ws[i]) != null && v.currentSteal == subtask &&
1690	>	v != joiner) {
1691	>	stealer = v;
1692	>	j.stealHint = i;    // save hint
1693	>	break;
1694	>	}
1695	>	}
1696	>	if (stealer == null)
1697	>	break;
1698	>	}
1699	>
1700	>	for (WorkQueue q = stealer;;) { // try to help stealer
1701	>	ForkJoinTask[] a; ForkJoinTask<?> t; int b;
1702	>	if (task.status < 0)
1703	>	break outer;
1704	>	if ((b = q.base) - q.top < 0 && (a = q.array) != null) {
1705	>	progress = true;
1706	>	int i = (((a.length - 1) & b) << ASHIFT) + ABASE;
1707	>	t = (ForkJoinTask<?>)U.getObjectVolatile(a, i);
1708	>	if (subtask.status < 0) // must recheck before taking
1709	>	break outer;
1710	>	if (t != null &&
1711	>	q.base == b &&
1712	>	U.compareAndSwapObject(a, i, t, null)) {
1713	>	q.base = b + 1;
1714	>	joiner.runSubtask(t);
1715	>	}
1716	>	else if (q.base == b)
1717	>	break outer;        // possibly stalled
1718	>	}
1719	>	else {                      // descend
1720	>	ForkJoinTask<?> next = stealer.currentJoin;
1721	>	if (--depth <= 0 || subtask.status < 0 ||
1722	>	next == null || next == subtask)
1723	>	break outer;        // stale, dead-end, or cyclic
1724	>	subtask = next;
1725	>	j = stealer;
1726	>	break;
1727	>	}
1728	>	}
1729		}
899	–	} finally {
900	–	lock.unlock();
1730		}
1731	<	signalWork();
1731	>	return progress;
1732		}
1733
905	–	//  (pollSubmission is defined below with exported methods)
906	–
1734		/**
1735	<	* Creates or doubles submissionQueue array.
1736	<	* Basically identical to ForkJoinWorkerThread version.
1735	>	* If task is at base of some steal queue, steals and executes it.
1736	>	*
1737	>	* @param joiner the joining worker
1738	>	* @param task the task
1739		*/
1740	<	private void growSubmissionQueue() {
1741	<	ForkJoinTask<?>[] oldQ = submissionQueue;
1742	<	int size = oldQ != null ? oldQ.length << 1 : INITIAL_QUEUE_CAPACITY;
1743	<	if (size > MAXIMUM_QUEUE_CAPACITY)
1744	<	throw new RejectedExecutionException("Queue capacity exceeded");
1745	<	if (size < INITIAL_QUEUE_CAPACITY)
1746	<	size = INITIAL_QUEUE_CAPACITY;
1747	<	ForkJoinTask<?>[] q = submissionQueue = new ForkJoinTask<?>[size];
1748	<	int mask = size - 1;
920	<	int top = queueTop;
921	<	int oldMask;
922	<	if (oldQ != null && (oldMask = oldQ.length - 1) >= 0) {
923	<	for (int b = queueBase; b != top; ++b) {
924	<	long u = ((b & oldMask) << ASHIFT) + ABASE;
925	<	Object x = UNSAFE.getObjectVolatile(oldQ, u);
926	<	if (x != null && UNSAFE.compareAndSwapObject(oldQ, u, x, null))
927	<	UNSAFE.putObjectVolatile
928	<	(q, ((b & mask) << ASHIFT) + ABASE, x);
1740	>	private void tryPollForAndExec(WorkQueue joiner, ForkJoinTask<?> task) {
1741	>	WorkQueue[] ws;
1742	>	if ((ws = workQueues) != null) {
1743	>	for (int j = 1; j < ws.length && task.status >= 0; j += 2) {
1744	>	WorkQueue q = ws[j];
1745	>	if (q != null && q.pollFor(task)) {
1746	>	joiner.runSubtask(task);
1747	>	break;
1748	>	}
1749		}
1750		}
1751		}
1752
933	–	// Blocking support
934	–
1753		/**
1754	<	* Tries to increment blockedCount, decrement active count
1755	<	* (sometimes implicitly) and possibly release or create a
1756	<	* compensating worker in preparation for blocking. Fails
1757	<	* on contention or termination.
1754	>	* Tries to decrement active count (sometimes implicitly) and
1755	>	* possibly release or create a compensating worker in preparation
1756	>	* for blocking. Fails on contention or termination. Otherwise,
1757	>	* adds a new thread if no idle workers are available and either
1758	>	* pool would become completely starved or: (at least half
1759	>	* starved, and fewer than 50% spares exist, and there is at least
1760	>	* one task apparently available). Even though the availability
1761	>	* check requires a full scan, it is worthwhile in reducing false
1762	>	* alarms.
1763		*
1764	+	* @param task if non-null, a task being waited for
1765	+	* @param blocker if non-null, a blocker being waited for
1766		* @return true if the caller can block, else should recheck and retry
1767		*/
1768	<	private boolean tryPreBlock() {
1769	<	int b = blockedCount;
1770	<	if (UNSAFE.compareAndSwapInt(this, blockedCountOffset, b, b + 1)) {
1771	<	int pc = parallelism;
1772	<	do {
1773	<	ForkJoinWorkerThread[] ws; ForkJoinWorkerThread w;
1774	<	int e, ac, tc, rc, i;
1775	<	long c = ctl;
1776	<	int u = (int)(c >>> 32);
1777	<	if ((e = (int)c) < 0) {
1778	<	// skip -- terminating
1779	<	}
1780	<	else if ((ac = (u >> UAC_SHIFT)) <= 0 && e != 0 &&
1781	<	(ws = workers) != null &&
1782	<	(i = ~e & SMASK) < ws.length &&
1783	<	(w = ws[i]) != null) {
1784	<	long nc = ((long)(w.nextWait & E_MASK) |
1785	<	(c & (AC_MASK|TC_MASK)));
1786	<	if (w.eventCount == e &&
962	<	UNSAFE.compareAndSwapLong(this, ctlOffset, c, nc)) {
963	<	w.eventCount = (e + EC_UNIT) & E_MASK;
964	<	if (w.parked)
965	<	UNSAFE.unpark(w);
966	<	return true;             // release an idle worker
1768	>	final boolean tryCompensate(ForkJoinTask<?> task, ManagedBlocker blocker) {
1769	>	int pc = parallelism, e;
1770	>	long c = ctl;
1771	>	WorkQueue[] ws = workQueues;
1772	>	if ((e = (int)c) >= 0 && ws != null) {
1773	>	int u, a, ac, hc;
1774	>	int tc = (short)((u = (int)(c >>> 32)) >>> UTC_SHIFT) + pc;
1775	>	boolean replace = false;
1776	>	if ((a = u >> UAC_SHIFT) <= 0) {
1777	>	if ((ac = a + pc) <= 1)
1778	>	replace = true;
1779	>	else if ((e > 0 || (task != null &&
1780	>	ac <= (hc = pc >>> 1) && tc < pc + hc))) {
1781	>	WorkQueue w;
1782	>	for (int j = 0; j < ws.length; ++j) {
1783	>	if ((w = ws[j]) != null && !w.isEmpty()) {
1784	>	replace = true;
1785	>	break;   // in compensation range and tasks available
1786	>	}
1787		}
1788		}
1789	<	else if ((tc = (short)(u >>> UTC_SHIFT)) >= 0 && ac + pc > 1) {
1789	>	}
1790	>	if ((task == null || task.status >= 0) && // recheck need to block
1791	>	(blocker == null || !blocker.isReleasable()) && ctl == c) {
1792	>	if (!replace) {          // no compensation
1793		long nc = ((c - AC_UNIT) & AC_MASK) | (c & ~AC_MASK);
1794	<	if (UNSAFE.compareAndSwapLong(this, ctlOffset, c, nc))
1795	<	return true;             // no compensation needed
1794	>	if (U.compareAndSwapLong(this, CTL, c, nc))
1795	>	return true;
1796		}
1797	<	else if (tc + pc < MAX_ID) {
1797	>	else if (e != 0) {       // release an idle worker
1798	>	WorkQueue w; Thread p; int i;
1799	>	if ((i = e & SMASK) < ws.length && (w = ws[i]) != null) {
1800	>	long nc = ((long)(w.nextWait & E_MASK) |
1801	>	(c & (AC_MASK|TC_MASK)));
1802	>	if (w.eventCount == (e | INT_SIGN) &&
1803	>	U.compareAndSwapLong(this, CTL, c, nc)) {
1804	>	w.eventCount = (e + E_SEQ) & E_MASK;
1805	>	if ((p = w.parker) != null)
1806	>	U.unpark(p);
1807	>	return true;
1808	>	}
1809	>	}
1810	>	}
1811	>	else if (tc < MAX_CAP) { // create replacement
1812		long nc = ((c + TC_UNIT) & TC_MASK) | (c & ~TC_MASK);
1813	<	if (UNSAFE.compareAndSwapLong(this, ctlOffset, c, nc)) {
1813	>	if (U.compareAndSwapLong(this, CTL, c, nc)) {
1814		addWorker();
1815	<	return true;            // create a replacement
1815	>	return true;
1816		}
1817		}
981	–	// try to back out on any failure and let caller retry
982	–	} while (!UNSAFE.compareAndSwapInt(this, blockedCountOffset,
983	–	b = blockedCount, b - 1));
984	–	}
985	–	return false;
986	–	}
987	–
988	–	/**
989	–	* Decrements blockedCount and increments active count
990	–	*/
991	–	private void postBlock() {
992	–	long c;
993	–	do {} while (!UNSAFE.compareAndSwapLong(this, ctlOffset,  // no mask
994	–	c = ctl, c + AC_UNIT));
995	–	int b;
996	–	do {} while(!UNSAFE.compareAndSwapInt(this, blockedCountOffset,
997	–	b = blockedCount, b - 1));
998	–	}
999	–
1000	–	/**
1001	–	* Possibly blocks waiting for the given task to complete, or
1002	–	* cancels the task if terminating.  Fails to wait if contended.
1003	–	*
1004	–	* @param joinMe the task
1005	–	*/
1006	–	final void tryAwaitJoin(ForkJoinTask<?> joinMe) {
1007	–	int s;
1008	–	Thread.interrupted(); // clear interrupts before checking termination
1009	–	if (joinMe.status >= 0) {
1010	–	if (tryPreBlock()) {
1011	–	joinMe.tryAwaitDone(0L);
1012	–	postBlock();
1818		}
1014	–	else if ((ctl & STOP_BIT) != 0L)
1015	–	joinMe.cancelIgnoringExceptions();
1819		}
1820	+	return false;
1821		}
1822
1823		/**
1824	<	* Possibly blocks the given worker waiting for joinMe to
1021	<	* complete or timeout
1824	>	* Helps and/or blocks until the given task is done.
1825		*
1826	<	* @param joinMe the task
1827	<	* @param millis the wait time for underlying Object.wait
1826	>	* @param joiner the joining worker
1827	>	* @param task the task
1828	>	* @return task status on exit
1829		*/
1830	<	final void timedAwaitJoin(ForkJoinTask<?> joinMe, long nanos) {
1831	<	while (joinMe.status >= 0) {
1832	<	Thread.interrupted();
1833	<	if ((ctl & STOP_BIT) != 0L) {
1834	<	joinMe.cancelIgnoringExceptions();
1835	<	break;
1836	<	}
1837	<	if (tryPreBlock()) {
1838	<	long last = System.nanoTime();
1839	<	while (joinMe.status >= 0) {
1840	<	long millis = TimeUnit.NANOSECONDS.toMillis(nanos);
1841	<	if (millis <= 0)
1842	<	break;
1843	<	joinMe.tryAwaitDone(millis);
1844	<	if (joinMe.status < 0)
1845	<	break;
1846	<	if ((ctl & STOP_BIT) != 0L) {
1847	<	joinMe.cancelIgnoringExceptions();
1848	<	break;
1830	>	final int awaitJoin(WorkQueue joiner, ForkJoinTask<?> task) {
1831	>	ForkJoinTask<?> prevJoin = joiner.currentJoin;
1832	>	joiner.currentJoin = task;
1833	>	long startTime = 0L;
1834	>	for (int k = 0, s; ; ++k) {
1835	>	if ((joiner.isEmpty() ?                  // try to help
1836	>	!tryHelpStealer(joiner, task) :
1837	>	!joiner.tryRemoveAndExec(task))) {
1838	>	if (k == 0) {
1839	>	startTime = System.nanoTime();
1840	>	tryPollForAndExec(joiner, task); // check uncommon case
1841	>	}
1842	>	else if ((k & (MAX_HELP - 1)) == 0 &&
1843	>	System.nanoTime() - startTime >= COMPENSATION_DELAY &&
1844	>	tryCompensate(task, null)) {
1845	>	if (task.trySetSignal() && task.status >= 0) {
1846	>	synchronized (task) {
1847	>	if (task.status >= 0) {
1848	>	try {                // see ForkJoinTask
1849	>	task.wait();     //  for explanation
1850	>	} catch (InterruptedException ie) {
1851	>	}
1852	>	}
1853	>	else
1854	>	task.notifyAll();
1855	>	}
1856		}
1857	<	long now = System.nanoTime();
1858	<	nanos -= now - last;
1859	<	last = now;
1857	>	long c;                          // re-activate
1858	>	do {} while (!U.compareAndSwapLong
1859	>	(this, CTL, c = ctl, c + AC_UNIT));
1860		}
1050	–	postBlock();
1051	–	break;
1861		}
1862	<	}
1863	<	}
1864	<
1056	<	/**
1057	<	* If necessary, compensates for blocker, and blocks
1058	<	*/
1059	<	private void awaitBlocker(ManagedBlocker blocker)
1060	<	throws InterruptedException {
1061	<	while (!blocker.isReleasable()) {
1062	<	if (tryPreBlock()) {
1063	<	try {
1064	<	do {} while (!blocker.isReleasable() && !blocker.block());
1065	<	} finally {
1066	<	postBlock();
1067	<	}
1068	<	break;
1862	>	if ((s = task.status) < 0) {
1863	>	joiner.currentJoin = prevJoin;
1864	>	return s;
1865		}
1866	+	else if ((k & (MAX_HELP - 1)) == MAX_HELP >>> 1)
1867	+	Thread.yield();                     // for politeness
1868		}
1869		}
1870
1073	–	// Creating, registering and deregistring workers
1074	–
1871		/**
1872	<	* Tries to create and start a worker; minimally rolls back counts
1873	<	* on failure.
1872	>	* Stripped-down variant of awaitJoin used by timed joins. Tries
1873	>	* to help join only while there is continuous progress. (Caller
1874	>	* will then enter a timed wait.)
1875	>	*
1876	>	* @param joiner the joining worker
1877	>	* @param task the task
1878	>	* @return task status on exit
1879		*/
1880	<	private void addWorker() {
1881	<	Throwable ex = null;
1882	<	ForkJoinWorkerThread t = null;
1883	<	try {
1884	<	t = factory.newThread(this);
1885	<	} catch (Throwable e) {
1886	<	ex = e;
1887	<	}
1087	<	if (t == null) {  // null or exceptional factory return
1088	<	long c;       // adjust counts
1089	<	do {} while (!UNSAFE.compareAndSwapLong
1090	<	(this, ctlOffset, c = ctl,
1091	<	(((c - AC_UNIT) & AC_MASK) |
1092	<	((c - TC_UNIT) & TC_MASK) |
1093	<	(c & ~(AC_MASK|TC_MASK)))));
1094	<	// Propagate exception if originating from an external caller
1095	<	if (!tryTerminate(false) && ex != null &&
1096	<	!(Thread.currentThread() instanceof ForkJoinWorkerThread))
1097	<	UNSAFE.throwException(ex);
1098	<	}
1099	<	else
1100	<	t.start();
1880	>	final int helpJoinOnce(WorkQueue joiner, ForkJoinTask<?> task) {
1881	>	int s;
1882	>	while ((s = task.status) >= 0 &&
1883	>	(joiner.isEmpty() ?
1884	>	tryHelpStealer(joiner, task) :
1885	>	joiner.tryRemoveAndExec(task)))
1886	>	;
1887	>	return s;
1888		}
1889
1890		/**
1891	<	* Callback from ForkJoinWorkerThread constructor to assign a
1892	<	* public name
1893	<	*/
1894	<	final String nextWorkerName() {
1895	<	for (int n;;) {
1896	<	if (UNSAFE.compareAndSwapInt(this, nextWorkerNumberOffset,
1897	<	n = nextWorkerNumber, ++n))
1898	<	return workerNamePrefix + n;
1891	>	* Returns a (probably) non-empty steal queue, if one is found
1892	>	* during a random, then cyclic scan, else null.  This method must
1893	>	* be retried by caller if, by the time it tries to use the queue,
1894	>	* it is empty.
1895	>	*/
1896	>	private WorkQueue findNonEmptyStealQueue(WorkQueue w) {
1897	>	// Similar to loop in scan(), but ignoring submissions
1898	>	int r = w.seed; r ^= r << 13; r ^= r >>> 17; w.seed = r ^= r << 5;
1899	>	int step = (r >>> 16) | 1;
1900	>	for (WorkQueue[] ws;;) {
1901	>	int rs = runState, m;
1902	>	if ((ws = workQueues) == null || (m = ws.length - 1) < 1)
1903	>	return null;
1904	>	for (int j = (m + 1) << 2; ; r += step) {
1905	>	WorkQueue q = ws[((r << 1) | 1) & m];
1906	>	if (q != null && !q.isEmpty())
1907	>	return q;
1908	>	else if (--j < 0) {
1909	>	if (runState == rs)
1910	>	return null;
1911	>	break;
1912	>	}
1913	>	}
1914		}
1915		}
1916
1917		/**
1918	<	* Callback from ForkJoinWorkerThread constructor to
1919	<	* determine its poolIndex and record in workers array.
1920	<	*
1921	<	* @param w the worker
1922	<	* @return the worker's pool index
1923	<	*/
1924	<	final int registerWorker(ForkJoinWorkerThread w) {
1925	<	/*
1926	<	* In the typical case, a new worker acquires the lock, uses
1927	<	* next available index and returns quickly.  Since we should
1928	<	* not block callers (ultimately from signalWork or
1929	<	* tryPreBlock) waiting for the lock needed to do this, we
1930	<	* instead help release other workers while waiting for the
1931	<	* lock.
1932	<	*/
1933	<	for (int g;;) {
1934	<	ForkJoinWorkerThread[] ws;
1133	<	if (((g = scanGuard) & SG_UNIT) == 0 &&
1134	<	UNSAFE.compareAndSwapInt(this, scanGuardOffset,
1135	<	g, g | SG_UNIT)) {
1136	<	int k = nextWorkerIndex;
1137	<	try {
1138	<	if ((ws = workers) != null) { // ignore on shutdown
1139	<	int n = ws.length;
1140	<	if (k < 0 || k >= n || ws[k] != null) {
1141	<	for (k = 0; k < n && ws[k] != null; ++k)
1142	<	;
1143	<	if (k == n)
1144	<	ws = workers = Arrays.copyOf(ws, n << 1);
1145	<	}
1146	<	ws[k] = w;
1147	<	nextWorkerIndex = k + 1;
1148	<	int m = g & SMASK;
1149	<	g = k >= m? ((m << 1) + 1) & SMASK : g + (SG_UNIT<<1);
1150	<	}
1151	<	} finally {
1152	<	scanGuard = g;
1918	>	* Runs tasks until {@code isQuiescent()}. We piggyback on
1919	>	* active count ctl maintenance, but rather than blocking
1920	>	* when tasks cannot be found, we rescan until all others cannot
1921	>	* find tasks either.
1922	>	*/
1923	>	final void helpQuiescePool(WorkQueue w) {
1924	>	for (boolean active = true;;) {
1925	>	if (w.base - w.top < 0)
1926	>	w.runLocalTasks();  // exhaust local queue
1927	>	WorkQueue q = findNonEmptyStealQueue(w);
1928	>	if (q != null) {
1929	>	ForkJoinTask<?> t; int b;
1930	>	if (!active) {      // re-establish active count
1931	>	long c;
1932	>	active = true;
1933	>	do {} while (!U.compareAndSwapLong
1934	>	(this, CTL, c = ctl, c + AC_UNIT));
1935		}
1936	<	return k;
1936	>	if ((b = q.base) - q.top < 0 && (t = q.pollAt(b)) != null)
1937	>	w.runSubtask(t);
1938		}
1939	<	else if ((ws = workers) != null) { // help release others
1940	<	for (ForkJoinWorkerThread u : ws) {
1941	<	if (u != null && u.queueBase != u.queueTop) {
1942	<	if (tryReleaseWaiter())
1943	<	break;
1944	<	}
1939	>	else {
1940	>	long c;
1941	>	if (active) {       // decrement active count without queuing
1942	>	active = false;
1943	>	do {} while (!U.compareAndSwapLong
1944	>	(this, CTL, c = ctl, c -= AC_UNIT));
1945	>	}
1946	>	else
1947	>	c = ctl;        // re-increment on exit
1948	>	if ((int)(c >> AC_SHIFT) + parallelism == 0) {
1949	>	do {} while (!U.compareAndSwapLong
1950	>	(this, CTL, c = ctl, c + AC_UNIT));
1951	>	break;
1952		}
1953		}
1954		}
1955		}
1956
1957		/**
1958	<	* Final callback from terminating worker.  Removes record of
1169	<	* worker from array, and adjusts counts. If pool is shutting
1170	<	* down, tries to complete termination.
1958	>	* Gets and removes a local or stolen task for the given worker.
1959		*
1960	<	* @param w the worker
1960	>	* @return a task, if available
1961		*/
1962	<	final void deregisterWorker(ForkJoinWorkerThread w, Throwable ex) {
1963	<	int idx = w.poolIndex;
1964	<	int sc = w.stealCount;
1965	<	int steps = 0;
1966	<	// Remove from array, adjust worker counts and collect steal count.
1967	<	// We can intermix failed removes or adjusts with steal updates
1968	<	do {
1969	<	long s, c;
1970	<	int g;
1183	<	if (steps == 0 && ((g = scanGuard) & SG_UNIT) == 0 &&
1184	<	UNSAFE.compareAndSwapInt(this, scanGuardOffset,
1185	<	g, g |= SG_UNIT)) {
1186	<	ForkJoinWorkerThread[] ws = workers;
1187	<	if (ws != null && idx >= 0 &&
1188	<	idx < ws.length && ws[idx] == w)
1189	<	ws[idx] = null;    // verify
1190	<	nextWorkerIndex = idx;
1191	<	scanGuard = g + SG_UNIT;
1192	<	steps = 1;
1193	<	}
1194	<	if (steps == 1 &&
1195	<	UNSAFE.compareAndSwapLong(this, ctlOffset, c = ctl,
1196	<	(((c - AC_UNIT) & AC_MASK) |
1197	<	((c - TC_UNIT) & TC_MASK) |
1198	<	(c & ~(AC_MASK|TC_MASK)))))
1199	<	steps = 2;
1200	<	if (sc != 0 &&
1201	<	UNSAFE.compareAndSwapLong(this, stealCountOffset,
1202	<	s = stealCount, s + sc))
1203	<	sc = 0;
1204	<	} while (steps != 2 || sc != 0);
1205	<	if (!tryTerminate(false)) {
1206	<	if (ex != null)   // possibly replace if died abnormally
1207	<	signalWork();
1208	<	else
1209	<	tryReleaseWaiter();
1962	>	final ForkJoinTask<?> nextTaskFor(WorkQueue w) {
1963	>	for (ForkJoinTask<?> t;;) {
1964	>	WorkQueue q; int b;
1965	>	if ((t = w.nextLocalTask()) != null)
1966	>	return t;
1967	>	if ((q = findNonEmptyStealQueue(w)) == null)
1968	>	return null;
1969	>	if ((b = q.base) - q.top < 0 && (t = q.pollAt(b)) != null)
1970	>	return t;
1971		}
1972		}
1973
1213	–	// Shutdown and termination
1214	–
1974		/**
1975	<	* Possibly initiates and/or completes termination.
1975	>	* Returns the approximate (non-atomic) number of idle threads per
1976	>	* active thread to offset steal queue size for method
1977	>	* ForkJoinTask.getSurplusQueuedTaskCount().
1978	>	*/
1979	>	final int idlePerActive() {
1980	>	// Approximate at powers of two for small values, saturate past 4
1981	>	int p = parallelism;
1982	>	int a = p + (int)(ctl >> AC_SHIFT);
1983	>	return (a > (p >>>= 1) ? 0 :
1984	>	a > (p >>>= 1) ? 1 :
1985	>	a > (p >>>= 1) ? 2 :
1986	>	a > (p >>>= 1) ? 4 :
1987	>	8);
1988	>	}
1989	>
1990	>	//  Termination
1991	>
1992	>	/**
1993	>	* Possibly initiates and/or completes termination.  The caller
1994	>	* triggering termination runs three passes through workQueues:
1995	>	* (0) Setting termination status, followed by wakeups of queued
1996	>	* workers; (1) cancelling all tasks; (2) interrupting lagging
1997	>	* threads (likely in external tasks, but possibly also blocked in
1998	>	* joins).  Each pass repeats previous steps because of potential
1999	>	* lagging thread creation.
2000		*
2001		* @param now if true, unconditionally terminate, else only
2002	<	* if shutdown and empty queue and no active workers
2002	>	* if no work and no active workers
2003	>	* @param enable if true, enable shutdown when next possible
2004		* @return true if now terminating or terminated
2005		*/
2006	<	private boolean tryTerminate(boolean now) {
2007	<	long c;
2008	<	while (((c = ctl) & STOP_BIT) == 0) {
2009	<	if (!now) {
2010	<	if ((int)(c >> AC_SHIFT) != -parallelism)
2011	<	return false;
2012	<	if (!shutdown || blockedCount != 0 || quiescerCount != 0 ||
2013	<	queueBase != queueTop) {
1230	<	if (ctl == c) // staleness check
1231	<	return false;
1232	<	continue;
2006	>	private boolean tryTerminate(boolean now, boolean enable) {
2007	>	Mutex lock = this.lock;
2008	>	for (long c;;) {
2009	>	if (((c = ctl) & STOP_BIT) != 0) {      // already terminating
2010	>	if ((short)(c >>> TC_SHIFT) == -parallelism) {
2011	>	lock.lock();                    // don't need try/finally
2012	>	termination.signalAll();        // signal when 0 workers
2013	>	lock.unlock();
2014		}
2015	+	return true;
2016		}
2017	<	if (UNSAFE.compareAndSwapLong(this, ctlOffset, c, c | STOP_BIT))
2018	<	startTerminating();
2019	<	}
2020	<	if ((short)(c >>> TC_SHIFT) == -parallelism) { // signal when 0 workers
2021	<	final ReentrantLock lock = this.submissionLock;
1240	<	lock.lock();
1241	<	try {
1242	<	termination.signalAll();
1243	<	} finally {
2017	>	if (runState >= 0) {                    // not yet enabled
2018	>	if (!enable)
2019	>	return false;
2020	>	lock.lock();
2021	>	runState |= SHUTDOWN;
2022		lock.unlock();
2023		}
2024	<	}
2025	<	return true;
2026	<	}
2027	<
2028	<	/**
2029	<	* Runs up to three passes through workers: (0) Setting
2030	<	* termination status for each worker, followed by wakeups up to
2031	<	* queued workers; (1) helping cancel tasks; (2) interrupting
2032	<	* lagging threads (likely in external tasks, but possibly also
2033	<	* blocked in joins).  Each pass repeats previous steps because of
2034	<	* potential lagging thread creation.
2035	<	*/
2036	<	private void startTerminating() {
2037	<	cancelSubmissions();
2038	<	for (int pass = 0; pass < 3; ++pass) {
2039	<	ForkJoinWorkerThread[] ws = workers;
2040	<	if (ws != null) {
2041	<	for (ForkJoinWorkerThread w : ws) {
2042	<	if (w != null) {
2043	<	w.terminate = true;
2044	<	if (pass > 0) {
2045	<	w.cancelTasks();
2046	<	if (pass > 1 && !w.isInterrupted()) {
2047	<	try {
2048	<	w.interrupt();
2049	<	} catch (SecurityException ignore) {
2024	>	if (!now) {                             // check if idle & no tasks
2025	>	if ((int)(c >> AC_SHIFT) != -parallelism ||
2026	>	hasQueuedSubmissions())
2027	>	return false;
2028	>	// Check for unqueued inactive workers. One pass suffices.
2029	>	WorkQueue[] ws = workQueues; WorkQueue w;
2030	>	if (ws != null) {
2031	>	for (int i = 1; i < ws.length; i += 2) {
2032	>	if ((w = ws[i]) != null && w.eventCount >= 0)
2033	>	return false;
2034	>	}
2035	>	}
2036	>	}
2037	>	if (U.compareAndSwapLong(this, CTL, c, c | STOP_BIT)) {
2038	>	for (int pass = 0; pass < 3; ++pass) {
2039	>	WorkQueue[] ws = workQueues;
2040	>	if (ws != null) {
2041	>	WorkQueue w;
2042	>	int n = ws.length;
2043	>	for (int i = 0; i < n; ++i) {
2044	>	if ((w = ws[i]) != null) {
2045	>	w.runState = -1;
2046	>	if (pass > 0) {
2047	>	w.cancelAll();
2048	>	if (pass > 1)
2049	>	w.interruptOwner();
2050		}
2051		}
2052		}
2053	+	// Wake up workers parked on event queue
2054	+	int i, e; long cc; Thread p;
2055	+	while ((e = (int)(cc = ctl) & E_MASK) != 0 &&
2056	+	(i = e & SMASK) < n &&
2057	+	(w = ws[i]) != null) {
2058	+	long nc = ((long)(w.nextWait & E_MASK) |
2059	+	((cc + AC_UNIT) & AC_MASK) |
2060	+	(cc & (TC_MASK|STOP_BIT)));
2061	+	if (w.eventCount == (e | INT_SIGN) &&
2062	+	U.compareAndSwapLong(this, CTL, cc, nc)) {
2063	+	w.eventCount = (e + E_SEQ) & E_MASK;
2064	+	w.runState = -1;
2065	+	if ((p = w.parker) != null)
2066	+	U.unpark(p);
2067	+	}
2068	+	}
2069		}
2070		}
1277	–	terminateWaiters();
1278	–	}
1279	–	}
1280	–	}
1281	–
1282	–	/**
1283	–	* Polls and cancels all submissions. Called only during termination.
1284	–	*/
1285	–	private void cancelSubmissions() {
1286	–	while (queueBase != queueTop) {
1287	–	ForkJoinTask<?> task = pollSubmission();
1288	–	if (task != null) {
1289	–	try {
1290	–	task.cancel(false);
1291	–	} catch (Throwable ignore) {
1292	–	}
1293	–	}
1294	–	}
1295	–	}
1296	–
1297	–	/**
1298	–	* Tries to set the termination status of waiting workers, and
1299	–	* then wakes them up (after which they will terminate).
1300	–	*/
1301	–	private void terminateWaiters() {
1302	–	ForkJoinWorkerThread[] ws = workers;
1303	–	if (ws != null) {
1304	–	ForkJoinWorkerThread w; long c; int i, e;
1305	–	int n = ws.length;
1306	–	while ((i = ~(e = (int)(c = ctl)) & SMASK) < n &&
1307	–	(w = ws[i]) != null && w.eventCount == (e & E_MASK)) {
1308	–	if (UNSAFE.compareAndSwapLong(this, ctlOffset, c,
1309	–	(long)(w.nextWait & E_MASK) |
1310	–	((c + AC_UNIT) & AC_MASK) |
1311	–	(c & (TC_MASK|STOP_BIT)))) {
1312	–	w.terminate = true;
1313	–	w.eventCount = e + EC_UNIT;
1314	–	if (w.parked)
1315	–	UNSAFE.unpark(w);
1316	–	}
2071		}
2072		}
2073		}
2074
1321	–	// misc ForkJoinWorkerThread support
1322	–
1323	–	/**
1324	–	* Increment or decrement quiescerCount. Needed only to prevent
1325	–	* triggering shutdown if a worker is transiently inactive while
1326	–	* checking quiescence.
1327	–	*
1328	–	* @param delta 1 for increment, -1 for decrement
1329	–	*/
1330	–	final void addQuiescerCount(int delta) {
1331	–	int c;
1332	–	do {} while(!UNSAFE.compareAndSwapInt(this, quiescerCountOffset,
1333	–	c = quiescerCount, c + delta));
1334	–	}
1335	–
1336	–	/**
1337	–	* Directly increment or decrement active count without
1338	–	* queuing. This method is used to transiently assert inactivation
1339	–	* while checking quiescence.
1340	–	*
1341	–	* @param delta 1 for increment, -1 for decrement
1342	–	*/
1343	–	final void addActiveCount(int delta) {
1344	–	long d = delta < 0 ? -AC_UNIT : AC_UNIT;
1345	–	long c;
1346	–	do {} while (!UNSAFE.compareAndSwapLong(this, ctlOffset, c = ctl,
1347	–	((c + d) & AC_MASK) |
1348	–	(c & ~AC_MASK)));
1349	–	}
1350	–
1351	–	/**
1352	–	* Returns the approximate (non-atomic) number of idle threads per
1353	–	* active thread.
1354	–	*/
1355	–	final int idlePerActive() {
1356	–	// Approximate at powers of two for small values, saturate past 4
1357	–	int p = parallelism;
1358	–	int a = p + (int)(ctl >> AC_SHIFT);
1359	–	return (a > (p >>>= 1) ? 0 :
1360	–	a > (p >>>= 1) ? 1 :
1361	–	a > (p >>>= 1) ? 2 :
1362	–	a > (p >>>= 1) ? 4 :
1363	–	8);
1364	–	}
1365	–
2075		// Exported methods
2076
2077		// Constructors
#	Line 1432 | Line 2141 | public class ForkJoinPool extends Abstra
2141		checkPermission();
2142		if (factory == null)
2143		throw new NullPointerException();
2144	<	if (parallelism <= 0 || parallelism > MAX_ID)
2144	>	if (parallelism <= 0 || parallelism > MAX_CAP)
2145		throw new IllegalArgumentException();
2146		this.parallelism = parallelism;
2147		this.factory = factory;
2148		this.ueh = handler;
2149	<	this.locallyFifo = asyncMode;
2149	>	this.localMode = asyncMode ? FIFO_QUEUE : LIFO_QUEUE;
2150		long np = (long)(-parallelism); // offset ctl counts
2151		this.ctl = ((np << AC_SHIFT) & AC_MASK) | ((np << TC_SHIFT) & TC_MASK);
2152	<	this.submissionQueue = new ForkJoinTask<?>[INITIAL_QUEUE_CAPACITY];
2153	<	// initialize workers array with room for 2*parallelism if possible
2154	<	int n = parallelism << 1;
2155	<	if (n >= MAX_ID)
2156	<	n = MAX_ID;
2157	<	else { // See Hackers Delight, sec 3.2, where n < (1 << 16)
2158	<	n |= n >>> 1; n |= n >>> 2; n |= n >>> 4; n |= n >>> 8;
2159	<	}
2160	<	workers = new ForkJoinWorkerThread[n + 1];
2161	<	this.submissionLock = new ReentrantLock();
1453	<	this.termination = submissionLock.newCondition();
2152	>	// Use nearest power 2 for workQueues size. See Hackers Delight sec 3.2.
2153	>	int n = parallelism - 1;
2154	>	n |= n >>> 1; n |= n >>> 2; n |= n >>> 4; n |= n >>> 8; n |= n >>> 16;
2155	>	int size = (n + 1) << 1;        // #slots = 2*#workers
2156	>	this.submitMask = size - 1;     // room for max # of submit queues
2157	>	this.workQueues = new WorkQueue[size];
2158	>	this.termination = (this.lock = new Mutex()).newCondition();
2159	>	this.stealCount = new AtomicLong();
2160	>	this.nextWorkerNumber = new AtomicInteger();
2161	>	int pn = poolNumberGenerator.incrementAndGet();
2162		StringBuilder sb = new StringBuilder("ForkJoinPool-");
2163	<	sb.append(poolNumberGenerator.incrementAndGet());
2163	>	sb.append(Integer.toString(pn));
2164		sb.append("-worker-");
2165		this.workerNamePrefix = sb.toString();
2166	+	lock.lock();
2167	+	this.runState = 1;              // set init flag
2168	+	lock.unlock();
2169		}
2170
2171		// Execution methods
#	Line 1476 | Line 2187 | public class ForkJoinPool extends Abstra
2187		*         scheduled for execution
2188		*/
2189		public <T> T invoke(ForkJoinTask<T> task) {
1479	–	Thread t = Thread.currentThread();
2190		if (task == null)
2191		throw new NullPointerException();
2192	<	if (shutdown)
2193	<	throw new RejectedExecutionException();
1484	<	if ((t instanceof ForkJoinWorkerThread) &&
1485	<	((ForkJoinWorkerThread)t).pool == this)
1486	<	return task.invoke();  // bypass submit if in same pool
1487	<	else {
1488	<	addSubmission(task);
1489	<	return task.join();
1490	<	}
1491	<	}
1492	<
1493	<	/**
1494	<	* Unless terminating, forks task if within an ongoing FJ
1495	<	* computation in the current pool, else submits as external task.
1496	<	*/
1497	<	private <T> void forkOrSubmit(ForkJoinTask<T> task) {
1498	<	ForkJoinWorkerThread w;
1499	<	Thread t = Thread.currentThread();
1500	<	if (shutdown)
1501	<	throw new RejectedExecutionException();
1502	<	if ((t instanceof ForkJoinWorkerThread) &&
1503	<	(w = (ForkJoinWorkerThread)t).pool == this)
1504	<	w.pushTask(task);
1505	<	else
1506	<	addSubmission(task);
2192	>	doSubmit(task);
2193	>	return task.join();
2194		}
2195
2196		/**
#	Line 1517 | Line 2204 | public class ForkJoinPool extends Abstra
2204		public void execute(ForkJoinTask<?> task) {
2205		if (task == null)
2206		throw new NullPointerException();
2207	<	forkOrSubmit(task);
2207	>	doSubmit(task);
2208		}
2209
2210		// AbstractExecutorService methods
#	Line 1534 | Line 2221 | public class ForkJoinPool extends Abstra
2221		if (task instanceof ForkJoinTask<?>) // avoid re-wrap
2222		job = (ForkJoinTask<?>) task;
2223		else
2224	<	job = ForkJoinTask.adapt(task, null);
2225	<	forkOrSubmit(job);
2224	>	job = new ForkJoinTask.AdaptedRunnableAction(task);
2225	>	doSubmit(job);
2226		}
2227
2228		/**
#	Line 1550 | Line 2237 | public class ForkJoinPool extends Abstra
2237		public <T> ForkJoinTask<T> submit(ForkJoinTask<T> task) {
2238		if (task == null)
2239		throw new NullPointerException();
2240	<	forkOrSubmit(task);
2240	>	doSubmit(task);
2241		return task;
2242		}
2243
#	Line 1560 | Line 2247 | public class ForkJoinPool extends Abstra
2247		*         scheduled for execution
2248		*/
2249		public <T> ForkJoinTask<T> submit(Callable<T> task) {
2250	<	if (task == null)
2251	<	throw new NullPointerException();
1565	<	ForkJoinTask<T> job = ForkJoinTask.adapt(task);
1566	<	forkOrSubmit(job);
2250	>	ForkJoinTask<T> job = new ForkJoinTask.AdaptedCallable<T>(task);
2251	>	doSubmit(job);
2252		return job;
2253		}
2254
#	Line 1573 | Line 2258 | public class ForkJoinPool extends Abstra
2258		*         scheduled for execution
2259		*/
2260		public <T> ForkJoinTask<T> submit(Runnable task, T result) {
2261	<	if (task == null)
2262	<	throw new NullPointerException();
1578	<	ForkJoinTask<T> job = ForkJoinTask.adapt(task, result);
1579	<	forkOrSubmit(job);
2261	>	ForkJoinTask<T> job = new ForkJoinTask.AdaptedRunnable<T>(task, result);
2262	>	doSubmit(job);
2263		return job;
2264		}
2265
#	Line 1592 | Line 2275 | public class ForkJoinPool extends Abstra
2275		if (task instanceof ForkJoinTask<?>) // avoid re-wrap
2276		job = (ForkJoinTask<?>) task;
2277		else
2278	<	job = ForkJoinTask.adapt(task, null);
2279	<	forkOrSubmit(job);
2278	>	job = new ForkJoinTask.AdaptedRunnableAction(task);
2279	>	doSubmit(job);
2280		return job;
2281		}
2282
#	Line 1602 | Line 2285 | public class ForkJoinPool extends Abstra
2285		* @throws RejectedExecutionException {@inheritDoc}
2286		*/
2287		public <T> List<Future<T>> invokeAll(Collection<? extends Callable<T>> tasks) {
2288	<	ArrayList<ForkJoinTask<T>> forkJoinTasks =
2289	<	new ArrayList<ForkJoinTask<T>>(tasks.size());
2290	<	for (Callable<T> task : tasks)
2291	<	forkJoinTasks.add(ForkJoinTask.adapt(task));
2292	<	invoke(new InvokeAll<T>(forkJoinTasks));
2293	<
2288	>	// In previous versions of this class, this method constructed
2289	>	// a task to run ForkJoinTask.invokeAll, but now external
2290	>	// invocation of multiple tasks is at least as efficient.
2291	>	List<ForkJoinTask<T>> fs = new ArrayList<ForkJoinTask<T>>(tasks.size());
2292	>	// Workaround needed because method wasn't declared with
2293	>	// wildcards in return type but should have been.
2294		@SuppressWarnings({"unchecked", "rawtypes"})
2295	<	List<Future<T>> futures = (List<Future<T>>) (List) forkJoinTasks;
1613	<	return futures;
1614	<	}
2295	>	List<Future<T>> futures = (List<Future<T>>) (List) fs;
2296
2297	<	static final class InvokeAll<T> extends RecursiveAction {
2298	<	final ArrayList<ForkJoinTask<T>> tasks;
2299	<	InvokeAll(ArrayList<ForkJoinTask<T>> tasks) { this.tasks = tasks; }
2300	<	public void compute() {
2301	<	try { invokeAll(tasks); }
2302	<	catch (Exception ignore) {}
2297	>	boolean done = false;
2298	>	try {
2299	>	for (Callable<T> t : tasks) {
2300	>	ForkJoinTask<T> f = new ForkJoinTask.AdaptedCallable<T>(t);
2301	>	doSubmit(f);
2302	>	fs.add(f);
2303	>	}
2304	>	for (ForkJoinTask<T> f : fs)
2305	>	f.quietlyJoin();
2306	>	done = true;
2307	>	return futures;
2308	>	} finally {
2309	>	if (!done)
2310	>	for (ForkJoinTask<T> f : fs)
2311	>	f.cancel(false);
2312		}
1623	–	private static final long serialVersionUID = -7914297376763021607L;
2313		}
2314
2315		/**
#	Line 1670 | Line 2359 | public class ForkJoinPool extends Abstra
2359		* @return {@code true} if this pool uses async mode
2360		*/
2361		public boolean getAsyncMode() {
2362	<	return locallyFifo;
2362	>	return localMode != 0;
2363		}
2364
2365		/**
#	Line 1682 | Line 2371 | public class ForkJoinPool extends Abstra
2371		* @return the number of worker threads
2372		*/
2373		public int getRunningThreadCount() {
2374	<	int r = parallelism + (int)(ctl >> AC_SHIFT);
2375	<	return r <= 0? 0 : r; // suppress momentarily negative values
2374	>	int rc = 0;
2375	>	WorkQueue[] ws; WorkQueue w;
2376	>	if ((ws = workQueues) != null) {
2377	>	for (int i = 1; i < ws.length; i += 2) {
2378	>	if ((w = ws[i]) != null && w.isApparentlyUnblocked())
2379	>	++rc;
2380	>	}
2381	>	}
2382	>	return rc;
2383		}
2384
2385		/**
#	Line 1694 | Line 2390 | public class ForkJoinPool extends Abstra
2390		* @return the number of active threads
2391		*/
2392		public int getActiveThreadCount() {
2393	<	int r = parallelism + (int)(ctl >> AC_SHIFT) + blockedCount;
2394	<	return r <= 0? 0 : r; // suppress momentarily negative values
2393	>	int r = parallelism + (int)(ctl >> AC_SHIFT);
2394	>	return (r <= 0) ? 0 : r; // suppress momentarily negative values
2395		}
2396
2397		/**
#	Line 1710 | Line 2406 | public class ForkJoinPool extends Abstra
2406		* @return {@code true} if all threads are currently idle
2407		*/
2408		public boolean isQuiescent() {
2409	<	return parallelism + (int)(ctl >> AC_SHIFT) + blockedCount == 0;
2409	>	return (int)(ctl >> AC_SHIFT) + parallelism == 0;
2410		}
2411
2412		/**
#	Line 1725 | Line 2421 | public class ForkJoinPool extends Abstra
2421		* @return the number of steals
2422		*/
2423		public long getStealCount() {
2424	<	return stealCount;
2424	>	long count = stealCount.get();
2425	>	WorkQueue[] ws; WorkQueue w;
2426	>	if ((ws = workQueues) != null) {
2427	>	for (int i = 1; i < ws.length; i += 2) {
2428	>	if ((w = ws[i]) != null)
2429	>	count += w.totalSteals;
2430	>	}
2431	>	}
2432	>	return count;
2433		}
2434
2435		/**
#	Line 1740 | Line 2444 | public class ForkJoinPool extends Abstra
2444		*/
2445		public long getQueuedTaskCount() {
2446		long count = 0;
2447	<	ForkJoinWorkerThread[] ws;
2448	<	if ((short)(ctl >>> TC_SHIFT) > -parallelism &&
2449	<	(ws = workers) != null) {
2450	<	for (ForkJoinWorkerThread w : ws)
2451	<	if (w != null)
2452	<	count -= w.queueBase - w.queueTop; // must read base first
2447	>	WorkQueue[] ws; WorkQueue w;
2448	>	if ((ws = workQueues) != null) {
2449	>	for (int i = 1; i < ws.length; i += 2) {
2450	>	if ((w = ws[i]) != null)
2451	>	count += w.queueSize();
2452	>	}
2453		}
2454		return count;
2455		}
#	Line 1758 | Line 2462 | public class ForkJoinPool extends Abstra
2462		* @return the number of queued submissions
2463		*/
2464		public int getQueuedSubmissionCount() {
2465	<	return -queueBase + queueTop;
2465	>	int count = 0;
2466	>	WorkQueue[] ws; WorkQueue w;
2467	>	if ((ws = workQueues) != null) {
2468	>	for (int i = 0; i < ws.length; i += 2) {
2469	>	if ((w = ws[i]) != null)
2470	>	count += w.queueSize();
2471	>	}
2472	>	}
2473	>	return count;
2474		}
2475
2476		/**
#	Line 1768 | Line 2480 | public class ForkJoinPool extends Abstra
2480		* @return {@code true} if there are any queued submissions
2481		*/
2482		public boolean hasQueuedSubmissions() {
2483	<	return queueBase != queueTop;
2483	>	WorkQueue[] ws; WorkQueue w;
2484	>	if ((ws = workQueues) != null) {
2485	>	for (int i = 0; i < ws.length; i += 2) {
2486	>	if ((w = ws[i]) != null && !w.isEmpty())
2487	>	return true;
2488	>	}
2489	>	}
2490	>	return false;
2491		}
2492
2493		/**
#	Line 1779 | Line 2498 | public class ForkJoinPool extends Abstra
2498		* @return the next submission, or {@code null} if none
2499		*/
2500		protected ForkJoinTask<?> pollSubmission() {
2501	<	ForkJoinTask<?> t; ForkJoinTask<?>[] q; int b, i;
2502	<	while ((b = queueBase) != queueTop &&
2503	<	(q = submissionQueue) != null &&
2504	<	(i = (q.length - 1) & b) >= 0) {
2505	<	long u = (i << ASHIFT) + ABASE;
1787	<	if ((t = q[i]) != null &&
1788	<	queueBase == b &&
1789	<	UNSAFE.compareAndSwapObject(q, u, t, null)) {
1790	<	queueBase = b + 1;
1791	<	return t;
2501	>	WorkQueue[] ws; WorkQueue w; ForkJoinTask<?> t;
2502	>	if ((ws = workQueues) != null) {
2503	>	for (int i = 0; i < ws.length; i += 2) {
2504	>	if ((w = ws[i]) != null && (t = w.poll()) != null)
2505	>	return t;
2506		}
2507		}
2508		return null;
#	Line 1813 | Line 2527 | public class ForkJoinPool extends Abstra
2527		*/
2528		protected int drainTasksTo(Collection<? super ForkJoinTask<?>> c) {
2529		int count = 0;
2530	<	while (queueBase != queueTop) {
2531	<	ForkJoinTask<?> t = pollSubmission();
2532	<	if (t != null) {
2533	<	c.add(t);
2534	<	++count;
2530	>	WorkQueue[] ws; WorkQueue w; ForkJoinTask<?> t;
2531	>	if ((ws = workQueues) != null) {
2532	>	for (int i = 0; i < ws.length; ++i) {
2533	>	if ((w = ws[i]) != null) {
2534	>	while ((t = w.poll()) != null) {
2535	>	c.add(t);
2536	>	++count;
2537	>	}
2538	>	}
2539		}
2540		}
1823	–	ForkJoinWorkerThread[] ws;
1824	–	if ((short)(ctl >>> TC_SHIFT) > -parallelism &&
1825	–	(ws = workers) != null) {
1826	–	for (ForkJoinWorkerThread w : ws)
1827	–	if (w != null)
1828	–	count += w.drainTasksTo(c);
1829	–	}
2541		return count;
2542		}
2543
#	Line 1838 | Line 2549 | public class ForkJoinPool extends Abstra
2549		* @return a string identifying this pool, as well as its state
2550		*/
2551		public String toString() {
2552	<	long st = getStealCount();
2553	<	long qt = getQueuedTaskCount();
2554	<	long qs = getQueuedSubmissionCount();
1844	<	int pc = parallelism;
2552	>	// Use a single pass through workQueues to collect counts
2553	>	long qt = 0L, qs = 0L; int rc = 0;
2554	>	long st = stealCount.get();
2555		long c = ctl;
2556	+	WorkQueue[] ws; WorkQueue w;
2557	+	if ((ws = workQueues) != null) {
2558	+	for (int i = 0; i < ws.length; ++i) {
2559	+	if ((w = ws[i]) != null) {
2560	+	int size = w.queueSize();
2561	+	if ((i & 1) == 0)
2562	+	qs += size;
2563	+	else {
2564	+	qt += size;
2565	+	st += w.totalSteals;
2566	+	if (w.isApparentlyUnblocked())
2567	+	++rc;
2568	+	}
2569	+	}
2570	+	}
2571	+	}
2572	+	int pc = parallelism;
2573		int tc = pc + (short)(c >>> TC_SHIFT);
2574	<	int rc = pc + (int)(c >> AC_SHIFT);
2575	<	if (rc < 0) // ignore transient negative
2576	<	rc = 0;
1850	<	int ac = rc + blockedCount;
2574	>	int ac = pc + (int)(c >> AC_SHIFT);
2575	>	if (ac < 0) // ignore transient negative
2576	>	ac = 0;
2577		String level;
2578		if ((c & STOP_BIT) != 0)
2579	<	level = (tc == 0)? "Terminated" : "Terminating";
2579	>	level = (tc == 0) ? "Terminated" : "Terminating";
2580		else
2581	<	level = shutdown? "Shutting down" : "Running";
2581	>	level = runState < 0 ? "Shutting down" : "Running";
2582		return super.toString() +
2583		"[" + level +
2584		", parallelism = " + pc +
#	Line 1879 | Line 2605 | public class ForkJoinPool extends Abstra
2605		*/
2606		public void shutdown() {
2607		checkPermission();
2608	<	shutdown = true;
1883	<	tryTerminate(false);
2608	>	tryTerminate(false, true);
2609		}
2610
2611		/**
#	Line 1901 | Line 2626 | public class ForkJoinPool extends Abstra
2626		*/
2627		public List<Runnable> shutdownNow() {
2628		checkPermission();
2629	<	shutdown = true;
1905	<	tryTerminate(true);
2629	>	tryTerminate(true, true);
2630		return Collections.emptyList();
2631		}
2632
#	Line 1937 | Line 2661 | public class ForkJoinPool extends Abstra
2661		}
2662
2663		/**
1940	–	* Returns true if terminating or terminated. Used by ForkJoinWorkerThread.
1941	–	*/
1942	–	final boolean isAtLeastTerminating() {
1943	–	return (ctl & STOP_BIT) != 0L;
1944	–	}
1945	–
1946	–	/**
2664		* Returns {@code true} if this pool has been shut down.
2665		*
2666		* @return {@code true} if this pool has been shut down
2667		*/
2668		public boolean isShutdown() {
2669	<	return shutdown;
2669	>	return runState < 0;
2670		}
2671
2672		/**
#	Line 1966 | Line 2683 | public class ForkJoinPool extends Abstra
2683		public boolean awaitTermination(long timeout, TimeUnit unit)
2684		throws InterruptedException {
2685		long nanos = unit.toNanos(timeout);
2686	<	final ReentrantLock lock = this.submissionLock;
2686	>	final Mutex lock = this.lock;
2687		lock.lock();
2688		try {
2689		for (;;) {
#	Line 2077 | Line 2794 | public class ForkJoinPool extends Abstra
2794		public static void managedBlock(ManagedBlocker blocker)
2795		throws InterruptedException {
2796		Thread t = Thread.currentThread();
2797	<	if (t instanceof ForkJoinWorkerThread) {
2798	<	ForkJoinWorkerThread w = (ForkJoinWorkerThread) t;
2799	<	w.pool.awaitBlocker(blocker);
2800	<	}
2801	<	else {
2802	<	do {} while (!blocker.isReleasable() && !blocker.block());
2797	>	ForkJoinPool p = ((t instanceof ForkJoinWorkerThread) ?
2798	>	((ForkJoinWorkerThread)t).pool : null);
2799	>	while (!blocker.isReleasable()) {
2800	>	if (p == null || p.tryCompensate(null, blocker)) {
2801	>	try {
2802	>	do {} while (!blocker.isReleasable() && !blocker.block());
2803	>	} finally {
2804	>	if (p != null)
2805	>	p.incrementActiveCount();
2806	>	}
2807	>	break;
2808	>	}
2809		}
2810		}
2811
#	Line 2091 | Line 2814 | public class ForkJoinPool extends Abstra
2814		// implement RunnableFuture.
2815
2816		protected <T> RunnableFuture<T> newTaskFor(Runnable runnable, T value) {
2817	<	return (RunnableFuture<T>) ForkJoinTask.adapt(runnable, value);
2817	>	return new ForkJoinTask.AdaptedRunnable<T>(runnable, value);
2818		}
2819
2820		protected <T> RunnableFuture<T> newTaskFor(Callable<T> callable) {
2821	<	return (RunnableFuture<T>) ForkJoinTask.adapt(callable);
2821	>	return new ForkJoinTask.AdaptedCallable<T>(callable);
2822		}
2823
2824		// Unsafe mechanics
2825	<	private static final sun.misc.Unsafe UNSAFE;
2826	<	private static final long ctlOffset;
2827	<	private static final long stealCountOffset;
2828	<	private static final long blockedCountOffset;
2106	<	private static final long quiescerCountOffset;
2107	<	private static final long scanGuardOffset;
2108	<	private static final long nextWorkerNumberOffset;
2109	<	private static final long ABASE;
2825	>	private static final sun.misc.Unsafe U;
2826	>	private static final long CTL;
2827	>	private static final long PARKBLOCKER;
2828	>	private static final int ABASE;
2829		private static final int ASHIFT;
2830
2831		static {
2832		poolNumberGenerator = new AtomicInteger();
2833	<	workerSeedGenerator = new Random();
2833	>	nextSubmitterSeed = new AtomicInteger(0x55555555);
2834		modifyThreadPermission = new RuntimePermission("modifyThread");
2835		defaultForkJoinWorkerThreadFactory =
2836		new DefaultForkJoinWorkerThreadFactory();
2837	+	submitters = new ThreadSubmitter();
2838		int s;
2839		try {
2840	<	UNSAFE = getUnsafe();
2841	<	Class k = ForkJoinPool.class;
2842	<	ctlOffset = UNSAFE.objectFieldOffset
2840	>	U = getUnsafe();
2841	>	Class<?> k = ForkJoinPool.class;
2842	>	Class<?> ak = ForkJoinTask[].class;
2843	>	CTL = U.objectFieldOffset
2844		(k.getDeclaredField("ctl"));
2845	<	stealCountOffset = UNSAFE.objectFieldOffset
2846	<	(k.getDeclaredField("stealCount"));
2847	<	blockedCountOffset = UNSAFE.objectFieldOffset
2848	<	(k.getDeclaredField("blockedCount"));
2849	<	quiescerCountOffset = UNSAFE.objectFieldOffset
2129	<	(k.getDeclaredField("quiescerCount"));
2130	<	scanGuardOffset = UNSAFE.objectFieldOffset
2131	<	(k.getDeclaredField("scanGuard"));
2132	<	nextWorkerNumberOffset = UNSAFE.objectFieldOffset
2133	<	(k.getDeclaredField("nextWorkerNumber"));
2134	<	Class a = ForkJoinTask[].class;
2135	<	ABASE = UNSAFE.arrayBaseOffset(a);
2136	<	s = UNSAFE.arrayIndexScale(a);
2845	>	Class<?> tk = Thread.class;
2846	>	PARKBLOCKER = U.objectFieldOffset
2847	>	(tk.getDeclaredField("parkBlocker"));
2848	>	ABASE = U.arrayBaseOffset(ak);
2849	>	s = U.arrayIndexScale(ak);
2850		} catch (Exception e) {
2851		throw new Error(e);
2852		}
#	Line 2169 | Line 2882 | public class ForkJoinPool extends Abstra
2882		}
2883		}
2884		}
2885	+
2886		}

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines