[ViewVC] Diff of: jsr166/jsr166/src/jsr166e/ForkJoinPool.java

Comparing jsr166/src/jsr166e/ForkJoinPool.java (file contents):
Revision 1.11 by dl, Wed Oct 31 12:49:13 2012 UTC vs.
Revision 1.61 by jsr166, Sun Jul 14 19:55:05 2013 UTC

#	Line 6 \| Line 6
6
7		package jsr166e;
8
9	+	import java.lang.Thread.UncaughtExceptionHandler;
10		import java.util.ArrayList;
11		import java.util.Arrays;
12		import java.util.Collection;
13		import java.util.Collections;
14		import java.util.List;
14	–	import java.util.Random;
15		import java.util.concurrent.AbstractExecutorService;
16		import java.util.concurrent.Callable;
17		import java.util.concurrent.ExecutorService;
18		import java.util.concurrent.Future;
19		import java.util.concurrent.RejectedExecutionException;
20		import java.util.concurrent.RunnableFuture;
21	–	import java.util.concurrent.ThreadLocalRandom;
21		import java.util.concurrent.TimeUnit;
23	–	import java.util.concurrent.atomic.AtomicInteger;
24	–	import java.util.concurrent.atomic.AtomicLong;
25	–	import java.util.concurrent.locks.AbstractQueuedSynchronizer;
26	–	import java.util.concurrent.locks.Condition;
22
23		/**
24		* An {@link ExecutorService} for running {@link ForkJoinTask}s.
#	Line 43 \| Line 38 \| import java.util.concurrent.locks.Condit
38		* ForkJoinPool}s may also be appropriate for use with event-style
39		* tasks that are never joined.
40		*
41	<	* <p>A static {@link #commonPool} is available and appropriate for
41	>	* <p>A static {@link #commonPool()} is available and appropriate for
42		* most applications. The common pool is used by any ForkJoinTask that
43		* is not explicitly submitted to a specified pool. Using the common
44		* pool normally reduces resource usage (its threads are slowly
45		* reclaimed during periods of non-use, and reinstated upon subsequent
46	<	* use). The common pool is by default constructed with default
52	<	* parameters, but these may be controlled by setting any or all of
53	<	* the three properties {@code
54	<	* java.util.concurrent.ForkJoinPool.common.{parallelism,
55	<	* threadFactory, exceptionHandler}}.
46	>	* use).
47		*
48		* <p>For applications that require separate or custom pools, a {@code
49		* ForkJoinPool} may be constructed with a given target parallelism
50		* level; by default, equal to the number of available processors. The
51		* pool attempts to maintain enough active (or available) threads by
52		* dynamically adding, suspending, or resuming internal worker
53	<	* threads, even if some tasks are stalled waiting to join
54	<	* others. However, no such adjustments are guaranteed in the face of
55	<	* blocked IO or other unmanaged synchronization. The nested {@link
53	>	* threads, even if some tasks are stalled waiting to join others.
54	>	* However, no such adjustments are guaranteed in the face of blocked
55	>	* I/O or other unmanaged synchronization. The nested {@link
56		* ManagedBlocker} interface enables extension of the kinds of
57		* synchronization accommodated.
58		*
#	Line 72 \| Line 63 \| import java.util.concurrent.locks.Condit
63		* {@link #toString} returns indications of pool state in a
64		* convenient form for informal monitoring.
65		*
66	<	* <p> As is the case with other ExecutorServices, there are three
66	>	* <p>As is the case with other ExecutorServices, there are three
67		* main task execution methods summarized in the following table.
68		* These are designed to be used primarily by clients not already
69		* engaged in fork/join computations in the current pool. The main
#	Line 85 \| Line 76 \| import java.util.concurrent.locks.Condit
76		* there is little difference among choice of methods.
77		*
78		* <table BORDER CELLPADDING=3 CELLSPACING=1>
79	+	* <caption>Summary of task execution methods</caption>
80		* <tr>
81		* <td></td>
82		* <td ALIGN=CENTER> <b>Call from non-fork/join clients</b></td>
83		* <td ALIGN=CENTER> <b>Call from within fork/join computations</b></td>
84		* </tr>
85		* <tr>
86	<	* <td> <b>Arrange async execution</td>
86	>	* <td> <b>Arrange async execution</b></td>
87		* <td> {@link #execute(ForkJoinTask)}</td>
88		* <td> {@link ForkJoinTask#fork}</td>
89		* </tr>
90		* <tr>
91	<	* <td> <b>Await and obtain result</td>
91	>	* <td> <b>Await and obtain result</b></td>
92		* <td> {@link #invoke(ForkJoinTask)}</td>
93		* <td> {@link ForkJoinTask#invoke}</td>
94		* </tr>
95		* <tr>
96	<	* <td> <b>Arrange exec and obtain Future</td>
96	>	* <td> <b>Arrange exec and obtain Future</b></td>
97		* <td> {@link #submit(ForkJoinTask)}</td>
98		* <td> {@link ForkJoinTask#fork} (ForkJoinTasks <em>are</em> Futures)</td>
99		* </tr>
100		* </table>
101		*
102	+	* <p>The common pool is by default constructed with default
103	+	* parameters, but these may be controlled by setting three
104	+	* {@linkplain System#getProperty system properties}:
105	+	* <ul>
106	+	* <li>{@code java.util.concurrent.ForkJoinPool.common.parallelism}
107	+	* - the parallelism level, a non-negative integer
108	+	* <li>{@code java.util.concurrent.ForkJoinPool.common.threadFactory}
109	+	* - the class name of a {@link ForkJoinWorkerThreadFactory}
110	+	* <li>{@code java.util.concurrent.ForkJoinPool.common.exceptionHandler}
111	+	* - the class name of a {@link UncaughtExceptionHandler}
112	+	* </ul>
113	+	* The system class loader is used to load these classes.
114	+	* Upon any error in establishing these settings, default parameters
115	+	* are used. It is possible to disable or limit the use of threads in
116	+	* the common pool by setting the parallelism property to zero, and/or
117	+	* using a factory that may return {@code null}.
118	+	*
119		* <p><b>Implementation notes</b>: This implementation restricts the
120		* maximum number of running threads to 32767. Attempts to create
121		* pools with greater than the maximum number result in
#	Line 151 \| Line 160 \| public class ForkJoinPool extends Abstra
160		* (http://research.sun.com/scalable/pubs/index.html) and
161		* "Idempotent work stealing" by Michael, Saraswat, and Vechev,
162		* PPoPP 2009 (http://portal.acm.org/citation.cfm?id=1504186).
163	<	* The main differences ultimately stem from GC requirements that
164	<	* we null out taken slots as soon as we can, to maintain as small
165	<	* a footprint as possible even in programs generating huge
166	<	* numbers of tasks. To accomplish this, we shift the CAS
167	<	* arbitrating pop vs poll (steal) from being on the indices
168	<	* ("base" and "top") to the slots themselves. So, both a
169	<	* successful pop and poll mainly entail a CAS of a slot from
170	<	* non-null to null. Because we rely on CASes of references, we
171	<	* do not need tag bits on base or top. They are simple ints as
172	<	* used in any circular array-based queue (see for example
173	<	* ArrayDeque). Updates to the indices must still be ordered in a
174	<	* way that guarantees that top == base means the queue is empty,
175	<	* but otherwise may err on the side of possibly making the queue
176	<	* appear nonempty when a push, pop, or poll have not fully
177	<	* committed. Note that this means that the poll operation,
178	<	* considered individually, is not wait-free. One thief cannot
179	<	* successfully continue until another in-progress one (or, if
180	<	* previously empty, a push) completes. However, in the
181	<	* aggregate, we ensure at least probabilistic non-blockingness.
182	<	* If an attempted steal fails, a thief always chooses a different
183	<	* random victim target to try next. So, in order for one thief to
184	<	* progress, it suffices for any in-progress poll or new push on
185	<	* any empty queue to complete. (This is why we normally use
186	<	* method pollAt and its variants that try once at the apparent
187	<	* base index, else consider alternative actions, rather than
188	<	* method poll.)
163	>	* See also "Correct and Efficient Work-Stealing for Weak Memory
164	>	* Models" by Le, Pop, Cohen, and Nardelli, PPoPP 2013
165	>	* (http://www.di.ens.fr/~zappa/readings/ppopp13.pdf) for an
166	>	* analysis of memory ordering (atomic, volatile etc) issues. The
167	>	* main differences ultimately stem from GC requirements that we
168	>	* null out taken slots as soon as we can, to maintain as small a
169	>	* footprint as possible even in programs generating huge numbers
170	>	* of tasks. To accomplish this, we shift the CAS arbitrating pop
171	>	* vs poll (steal) from being on the indices ("base" and "top") to
172	>	* the slots themselves. So, both a successful pop and poll
173	>	* mainly entail a CAS of a slot from non-null to null. Because
174	>	* we rely on CASes of references, we do not need tag bits on base
175	>	* or top. They are simple ints as used in any circular
176	>	* array-based queue (see for example ArrayDeque). Updates to the
177	>	* indices must still be ordered in a way that guarantees that top
178	>	* == base means the queue is empty, but otherwise may err on the
179	>	* side of possibly making the queue appear nonempty when a push,
180	>	* pop, or poll have not fully committed. Note that this means
181	>	* that the poll operation, considered individually, is not
182	>	* wait-free. One thief cannot successfully continue until another
183	>	* in-progress one (or, if previously empty, a push) completes.
184	>	* However, in the aggregate, we ensure at least probabilistic
185	>	* non-blockingness. If an attempted steal fails, a thief always
186	>	* chooses a different random victim target to try next. So, in
187	>	* order for one thief to progress, it suffices for any
188	>	* in-progress poll or new push on any empty queue to
189	>	* complete. (This is why we normally use method pollAt and its
190	>	* variants that try once at the apparent base index, else
191	>	* consider alternative actions, rather than method poll.)
192		*
193		* This approach also enables support of a user mode in which local
194		* task processing is in FIFO, not LIFO order, simply by using
#	Line 193 \| Line 205 \| public class ForkJoinPool extends Abstra
205		* WorkQueues are also used in a similar way for tasks submitted
206		* to the pool. We cannot mix these tasks in the same queues used
207		* for work-stealing (this would contaminate lifo/fifo
208	<	* processing). Instead, we loosely associate submission queues
208	>	* processing). Instead, we randomly associate submission queues
209		* with submitting threads, using a form of hashing. The
210	<	* ThreadLocal Submitter class contains a value initially used as
211	<	* a hash code for choosing existing queues, but may be randomly
212	<	* repositioned upon contention with other submitters. In
213	<	* essence, submitters act like workers except that they never
214	<	* take tasks, and they are multiplexed on to a finite number of
215	<	* shared work queues. However, classes are set up so that future
216	<	* extensions could allow submitters to optionally help perform
217	<	* tasks as well. Insertion of tasks in shared mode requires a
218	<	* lock (mainly to protect in the case of resizing) but we use
219	<	* only a simple spinlock (using bits in field runState), because
220	<	* submitters encountering a busy queue move on to try or create
221	<	* other queues -- they block only when creating and registering
222	<	* new queues.
210	>	* Submitter probe value serves as a hash code for
211	>	* choosing existing queues, and may be randomly repositioned upon
212	>	* contention with other submitters. In essence, submitters act
213	>	* like workers except that they are restricted to executing local
214	>	* tasks that they submitted (or in the case of CountedCompleters,
215	>	* others with the same root task). However, because most
216	>	* shared/external queue operations are more expensive than
217	>	* internal, and because, at steady state, external submitters
218	>	* will compete for CPU with workers, ForkJoinTask.join and
219	>	* related methods disable them from repeatedly helping to process
220	>	* tasks if all workers are active. Insertion of tasks in shared
221	>	* mode requires a lock (mainly to protect in the case of
222	>	* resizing) but we use only a simple spinlock (using bits in
223	>	* field qlock), because submitters encountering a busy queue move
224	>	* on to try or create other queues -- they block only when
225	>	* creating and registering new queues.
226		*
227		* Management
228		* ==========
#	Line 229 \| Line 244 \| public class ForkJoinPool extends Abstra
244		* and their negations (used for thresholding) to fit into 16bit
245		* fields.
246		*
247	<	* Field "runState" contains 32 bits needed to register and
248	<	* deregister WorkQueues, as well as to enable shutdown. It is
249	<	* only modified under a lock (normally briefly held, but
250	<	* occasionally protecting allocations and resizings) but even
251	<	* when locked remains available to check consistency.
247	>	* Field "plock" is a form of sequence lock with a saturating
248	>	* shutdown bit (similarly for per-queue "qlocks"), mainly
249	>	* protecting updates to the workQueues array, as well as to
250	>	* enable shutdown. When used as a lock, it is normally only very
251	>	* briefly held, so is nearly always available after at most a
252	>	* brief spin, but we use a monitor-based backup strategy to
253	>	* block when needed.
254		*
255		* Recording WorkQueues. WorkQueues are recorded in the
256		* "workQueues" array that is created upon first use and expanded
#	Line 242 \| Line 259 \| public class ForkJoinPool extends Abstra
259		* by a lock but the array is otherwise concurrently readable, and
260		* accessed directly. To simplify index-based operations, the
261		* array size is always a power of two, and all readers must
262	<	* tolerate null slots. Shared (submission) queues are at even
263	<	* indices, worker queues at odd indices. Grouping them together
264	<	* in this way simplifies and speeds up task scanning.
262	>	* tolerate null slots. Worker queues are at odd indices. Shared
263	>	* (submission) queues are at even indices, up to a maximum of 64
264	>	* slots, to limit growth even if array needs to expand to add
265	>	* more workers. Grouping them together in this way simplifies and
266	>	* speeds up task scanning.
267		*
268		* All worker thread creation is on-demand, triggered by task
269		* submissions, replacement of terminated workers, and/or
#	Line 289 \| Line 308 \| public class ForkJoinPool extends Abstra
308		* has not yet entered the wait queue. We solve this by requiring
309		* a full sweep of all workers (via repeated calls to method
310		* scan()) both before and after a newly waiting worker is added
311	<	* to the wait queue. During a rescan, the worker might release
312	<	* some other queued worker rather than itself, which has the same
313	<	* net effect. Because enqueued workers may actually be rescanning
314	<	* rather than waiting, we set and clear the "parker" field of
315	<	* WorkQueues to reduce unnecessary calls to unpark. (This
316	<	* requires a secondary recheck to avoid missed signals.) Note
317	<	* the unusual conventions about Thread.interrupts surrounding
318	<	* parking and other blocking: Because interrupts are used solely
319	<	* to alert threads to check termination, which is checked anyway
320	<	* upon blocking, we clear status (using Thread.interrupted)
321	<	* before any call to park, so that park does not immediately
303	<	* return due to status being set via some other unrelated call to
304	<	* interrupt in user code.
311	>	* to the wait queue. Because enqueued workers may actually be
312	>	* rescanning rather than waiting, we set and clear the "parker"
313	>	* field of WorkQueues to reduce unnecessary calls to unpark.
314	>	* (This requires a secondary recheck to avoid missed signals.)
315	>	* Note the unusual conventions about Thread.interrupts
316	>	* surrounding parking and other blocking: Because interrupts are
317	>	* used solely to alert threads to check termination, which is
318	>	* checked anyway upon blocking, we clear status (using
319	>	* Thread.interrupted) before any call to park, so that park does
320	>	* not immediately return due to status being set via some other
321	>	* unrelated call to interrupt in user code.
322		*
323		* Signalling. We create or wake up workers only when there
324		* appears to be at least one task they might be able to find and
325		* execute. When a submission is added or another worker adds a
326	<	* task to a queue that previously had fewer than two tasks, they
327	<	* signal waiting workers (or trigger creation of new ones if
328	<	* fewer than the given parallelism level -- see signalWork).
329	<	* These primary signals are buttressed by signals during rescans;
330	<	* together these cover the signals needed in cases when more
331	<	* tasks are pushed but untaken, and improve performance compared
332	<	* to having one thread wake up all workers.
326	>	* task to a queue that has fewer than two tasks, they signal
327	>	* waiting workers (or trigger creation of new ones if fewer than
328	>	* the given parallelism level -- signalWork). These primary
329	>	* signals are buttressed by others whenever other threads remove
330	>	* a task from a queue and notice that there are other tasks there
331	>	* as well. So in general, pools will be over-signalled. On most
332	>	* platforms, signalling (unpark) overhead time is noticeably
333	>	* long, and the time between signalling a thread and it actually
334	>	* making progress can be very noticeably long, so it is worth
335	>	* offloading these delays from critical paths as much as
336	>	* possible. Additionally, workers spin-down gradually, by staying
337	>	* alive so long as they see the ctl state changing. Similar
338	>	* stability-sensing techniques are also used before blocking in
339	>	* awaitJoin and helpComplete.
340		*
341		* Trimming workers. To release resources after periods of lack of
342		* use, a worker starting to wait when the pool is quiescent will
#	Line 323 \| Line 347 \| public class ForkJoinPool extends Abstra
347		* periods of non-use.
348		*
349		* Shutdown and Termination. A call to shutdownNow atomically sets
350	<	* a runState bit and then (non-atomically) sets each worker's
351	<	* runState status, cancels all unprocessed tasks, and wakes up
350	>	* a plock bit and then (non-atomically) sets each worker's
351	>	* qlock status, cancels all unprocessed tasks, and wakes up
352		* all waiting workers. Detecting whether termination should
353		* commence after a non-abrupt shutdown() call requires more work
354		* and bookkeeping. We need consensus about quiescence (i.e., that
#	Line 352 \| Line 376 \| public class ForkJoinPool extends Abstra
376		* method tryCompensate() may create or re-activate a spare
377		* thread to compensate for blocked joiners until they unblock.
378		*
379	<	* A third form (implemented in tryRemoveAndExec and
380	<	* tryPollForAndExec) amounts to helping a hypothetical
381	<	* compensator: If we can readily tell that a possible action of a
382	<	* compensator is to steal and execute the task being joined, the
383	<	* joining thread can do so directly, without the need for a
384	<	* compensation thread (although at the expense of larger run-time
385	<	* stacks, but the tradeoff is typically worthwhile).
379	>	* A third form (implemented in tryRemoveAndExec) amounts to
380	>	* helping a hypothetical compensator: If we can readily tell that
381	>	* a possible action of a compensator is to steal and execute the
382	>	* task being joined, the joining thread can do so directly,
383	>	* without the need for a compensation thread (although at the
384	>	* expense of larger run-time stacks, but the tradeoff is
385	>	* typically worthwhile).
386		*
387		* The ManagedBlocker extension API can't use helping so relies
388		* only on compensation in method awaitBlocker.
#	Line 380 \| Line 404 \| public class ForkJoinPool extends Abstra
404		* steals, rather than use per-task bookkeeping. This sometimes
405		* requires a linear scan of workQueues array to locate stealers,
406		* but often doesn't because stealers leave hints (that may become
407	<	* stale/wrong) of where to locate them. A stealHint is only a
408	<	* hint because a worker might have had multiple steals and the
409	<	* hint records only one of them (usually the most current).
410	<	* Hinting isolates cost to when it is needed, rather than adding
411	<	* to per-task overhead. (2) It is "shallow", ignoring nesting
412	<	* and potentially cyclic mutual steals. (3) It is intentionally
407	>	* stale/wrong) of where to locate them. It is only a hint
408	>	* because a worker might have had multiple steals and the hint
409	>	* records only one of them (usually the most current). Hinting
410	>	* isolates cost to when it is needed, rather than adding to
411	>	* per-task overhead. (2) It is "shallow", ignoring nesting and
412	>	* potentially cyclic mutual steals. (3) It is intentionally
413		* racy: field currentJoin is updated only while actively joining,
414		* which means that we miss links in the chain during long-lived
415		* tasks, GC stalls etc (which is OK since blocking in such cases
#	Line 393 \| Line 417 \| public class ForkJoinPool extends Abstra
417		* to find work (see MAX_HELP) and fall back to suspending the
418		* worker and if necessary replacing it with another.
419		*
420	+	* Helping actions for CountedCompleters are much simpler: Method
421	+	* helpComplete can take and execute any task with the same root
422	+	* as the task being waited on. However, this still entails some
423	+	* traversal of completer chains, so is less efficient than using
424	+	* CountedCompleters without explicit joins.
425	+	*
426		* It is impossible to keep exactly the target parallelism number
427		* of threads running at any given time. Determining the
428		* existence of conservatively safe helping targets, the
#	Line 414 \| Line 444 \| public class ForkJoinPool extends Abstra
444		* intractable) game with an opponent that may choose the worst
445		* (for us) active thread to stall at any time. We take several
446		* precautions to bound losses (and thus bound gains), mainly in
447	<	* methods tryCompensate and awaitJoin: (1) We only try
448	<	* compensation after attempting enough helping steps (measured
449	<	* via counting and timing) that we have already consumed the
450	<	* estimated cost of creating and activating a new thread. (2) We
451	<	* allow up to 50% of threads to be blocked before initially
452	<	* adding any others, and unless completely saturated, check that
453	<	* some work is available for a new worker before adding. Also, we
454	<	* create up to only 50% more threads until entering a mode that
455	<	* only adds a thread if all others are possibly blocked. All
456	<	* together, this means that we might be half as fast to react,
457	<	* and create half as many threads as possible in the ideal case,
458	<	* but present vastly fewer anomalies in all other cases compared
459	<	* to both more aggressive and more conservative alternatives.
460	<	*
461	<	* Style notes: There is a lot of representation-level coupling
462	<	* among classes ForkJoinPool, ForkJoinWorkerThread, and
463	<	* ForkJoinTask. The fields of WorkQueue maintain data structures
464	<	* managed by ForkJoinPool, so are directly accessed. There is
465	<	* little point trying to reduce this, since any associated future
466	<	* changes in representations will need to be accompanied by
467	<	* algorithmic changes anyway. Several methods intrinsically
468	<	* sprawl because they must accumulate sets of consistent reads of
469	<	* volatiles held in local variables. Methods signalWork() and
470	<	* scan() are the main bottlenecks, so are especially heavily
447	>	* methods tryCompensate and awaitJoin.
448	>	*
449	>	* Common Pool
450	>	* ===========
451	>	*
452	>	* The static common pool always exists after static
453	>	* initialization. Since it (or any other created pool) need
454	>	* never be used, we minimize initial construction overhead and
455	>	* footprint to the setup of about a dozen fields, with no nested
456	>	* allocation. Most bootstrapping occurs within method
457	>	* fullExternalPush during the first submission to the pool.
458	>	*
459	>	* When external threads submit to the common pool, they can
460	>	* perform subtask processing (see externalHelpJoin and related
461	>	* methods). This caller-helps policy makes it sensible to set
462	>	* common pool parallelism level to one (or more) less than the
463	>	* total number of available cores, or even zero for pure
464	>	* caller-runs. We do not need to record whether external
465	>	* submissions are to the common pool -- if not, externalHelpJoin
466	>	* returns quickly (at the most helping to signal some common pool
467	>	* workers). These submitters would otherwise be blocked waiting
468	>	* for completion, so the extra effort (with liberally sprinkled
469	>	* task status checks) in inapplicable cases amounts to an odd
470	>	* form of limited spin-wait before blocking in ForkJoinTask.join.
471	>	*
472	>	* Style notes
473	>	* ===========
474	>	*
475	>	* There is a lot of representation-level coupling among classes
476	>	* ForkJoinPool, ForkJoinWorkerThread, and ForkJoinTask. The
477	>	* fields of WorkQueue maintain data structures managed by
478	>	* ForkJoinPool, so are directly accessed. There is little point
479	>	* trying to reduce this, since any associated future changes in
480	>	* representations will need to be accompanied by algorithmic
481	>	* changes anyway. Several methods intrinsically sprawl because
482	>	* they must accumulate sets of consistent reads of volatiles held
483	>	* in local variables. Methods signalWork() and scan() are the
484	>	* main bottlenecks, so are especially heavily
485		* micro-optimized/mangled. There are lots of inline assignments
486		* (of form "while ((local = field) != 0)") which are usually the
487		* simplest way to ensure the required read orderings (which are
#	Line 445 \| Line 489 \| public class ForkJoinPool extends Abstra
489		* declarations of these locals at the heads of methods or blocks.
490		* There are several occurrences of the unusual "do {} while
491		* (!cas...)" which is the simplest way to force an update of a
492	<	* CAS'ed variable. There are also other coding oddities that help
492	>	* CAS'ed variable. There are also other coding oddities (including
493	>	* several unnecessary-looking hoisted null checks) that help
494		* some methods perform reasonably even when interpreted (not
495		* compiled).
496		*
#	Line 486 \| Line 531 \| public class ForkJoinPool extends Abstra
531		*
532		* @param pool the pool this thread works in
533		* @throws NullPointerException if the pool is null
534	+	* @return the new worker thread
535		*/
536		public ForkJoinWorkerThread newThread(ForkJoinPool pool);
537		}
#	Line 494 \| Line 540 \| public class ForkJoinPool extends Abstra
540		* Default ForkJoinWorkerThreadFactory implementation; creates a
541		* new ForkJoinWorkerThread.
542		*/
543	<	static class DefaultForkJoinWorkerThreadFactory
543	>	static final class DefaultForkJoinWorkerThreadFactory
544		implements ForkJoinWorkerThreadFactory {
545	<	public ForkJoinWorkerThread newThread(ForkJoinPool pool) {
545	>	public final ForkJoinWorkerThread newThread(ForkJoinPool pool) {
546		return new ForkJoinWorkerThread(pool);
547		}
548		}
#	Line 508 \| Line 554 \| public class ForkJoinPool extends Abstra
554		* actually do anything beyond having a unique identity.
555		*/
556		static final class EmptyTask extends ForkJoinTask<Void> {
557	+	private static final long serialVersionUID = -7721805057305804111L;
558		EmptyTask() { status = ForkJoinTask.NORMAL; } // force done
559		public final Void getRawResult() { return null; }
560		public final void setRawResult(Void x) {}
#	Line 528 \| Line 575 \| public class ForkJoinPool extends Abstra
575		*
576		* Field "top" is the index (mod array.length) of the next queue
577		* slot to push to or pop from. It is written only by owner thread
578	<	* for push, or under lock for trySharedPush, and accessed by
579	<	* other threads only after reading (volatile) base. Both top and
580	<	* base are allowed to wrap around on overflow, but (top - base)
581	<	* (or more commonly -(base - top) to force volatile read of base
582	<	* before top) still estimates size.
578	>	* for push, or under lock for external/shared push, and accessed
579	>	* by other threads only after reading (volatile) base. Both top
580	>	* and base are allowed to wrap around on overflow, but (top -
581	>	* base) (or more commonly -(base - top) to force volatile read of
582	>	* base before top) still estimates size. The lock ("qlock") is
583	>	* forced to -1 on termination, causing all further lock attempts
584	>	* to fail. (Note: we don't need CAS for termination state because
585	>	* upon pool shutdown, all shared-queues will stop being used
586	>	* anyway.) Nearly all lock bodies are set up so that exceptions
587	>	* within lock bodies are "impossible" (modulo JVM errors that
588	>	* would cause failure anyway.)
589		*
590		* The array slots are read and written using the emulation of
591		* volatiles/atomics provided by Unsafe. Insertions must in
592		* general use putOrderedObject as a form of releasing store to
593		* ensure that all writes to the task object are ordered before
594	<	* its publication in the queue. (Although we can avoid one case
595	<	* of this when locked in trySharedPush.) All removals entail a
596	<	* CAS to null. The array is always a power of two. To ensure
597	<	* safety of Unsafe array operations, all accesses perform
545	<	* explicit null checks and implicit bounds checks via
546	<	* power-of-two masking.
594	>	* its publication in the queue. All removals entail a CAS to
595	>	* null. The array is always a power of two. To ensure safety of
596	>	* Unsafe array operations, all accesses perform explicit null
597	>	* checks and implicit bounds checks via power-of-two masking.
598		*
599		* In addition to basic queuing support, this class contains
600		* fields described elsewhere to control execution. It turns out
601	<	* to work better memory-layout-wise to include them in this
602	<	* class rather than a separate class.
601	>	* to work better memory-layout-wise to include them in this class
602	>	* rather than a separate class.
603		*
604		* Performance on most platforms is very sensitive to placement of
605		* instances of both WorkQueues and their arrays -- we absolutely
606		* do not want multiple WorkQueue instances or multiple queue
607		* arrays sharing cache lines. (It would be best for queue objects
608		* and their arrays to share, but there is nothing available to
609	<	* help arrange that). Unfortunately, because they are recorded
610	<	* in a common array, WorkQueue instances are often moved to be
560	<	* adjacent by garbage collectors. To reduce impact, we use field
561	<	* padding that works OK on common platforms; this effectively
562	<	* trades off slightly slower average field access for the sake of
563	<	* avoiding really bad worst-case access. (Until better JVM
564	<	* support is in place, this padding is dependent on transient
565	<	* properties of JVM field layout rules.) We also take care in
566	<	* allocating, sizing and resizing the array. Non-shared queue
567	<	* arrays are initialized (via method growArray) by workers before
568	<	* use. Others are allocated on first use.
609	>	* help arrange that). The @Contended annotation alerts JVMs to
610	>	* try to keep instances apart.
611		*/
612		static final class WorkQueue {
613		/**
#	Line 588 \| Line 630 \| public class ForkJoinPool extends Abstra
630		*/
631		static final int MAXIMUM_QUEUE_CAPACITY = 1 << 26; // 64M
632
633	<	volatile long totalSteals; // cumulative number of steals
634	<	int seed; // for random scanning; initialize nonzero
633	>	// Heuristic padding to ameliorate unfortunate memory placements
634	>	volatile long pad00, pad01, pad02, pad03, pad04, pad05, pad06;
635	>
636		volatile int eventCount; // encoded inactivation count; < 0 if inactive
637		int nextWait; // encoded record of next event waiter
638	<	int rescans; // remaining scans until block
639	<	int nsteals; // top-level task executions since last idle
640	<	final int mode; // lifo, fifo, or shared
641	<	int poolIndex; // index of this queue in pool (or 0)
642	<	int stealHint; // index of most recent known stealer
600	<	volatile int runState; // 1: locked, -1: terminate; else 0
638	>	int nsteals; // number of steals
639	>	int hint; // steal index hint
640	>	short poolIndex; // index of this queue in pool
641	>	final short mode; // 0: lifo, > 0: fifo, < 0: shared
642	>	volatile int qlock; // 1: locked, -1: terminate; else 0
643		volatile int base; // index of next slot for poll
644		int top; // index of next slot for push
645		ForkJoinTask<?>[] array; // the elements (initially unallocated)
#	Line 606 \| Line 648 \| public class ForkJoinPool extends Abstra
648		volatile Thread parker; // == owner during call to park; else null
649		volatile ForkJoinTask<?> currentJoin; // task being joined in awaitJoin
650		ForkJoinTask<?> currentSteal; // current non-local task being executed
609	–	// Heuristic padding to ameliorate unfortunate memory placements
610	–	Object p00, p01, p02, p03, p04, p05, p06, p07;
611	–	Object p08, p09, p0a, p0b, p0c, p0d, p0e;
651
652	<	WorkQueue(ForkJoinPool pool, ForkJoinWorkerThread owner, int mode) {
653	<	this.mode = mode;
652	>	volatile Object pad10, pad11, pad12, pad13, pad14, pad15, pad16, pad17;
653	>	volatile Object pad18, pad19, pad1a, pad1b, pad1c, pad1d;
654	>
655	>	WorkQueue(ForkJoinPool pool, ForkJoinWorkerThread owner, int mode,
656	>	int seed) {
657		this.pool = pool;
658		this.owner = owner;
659	+	this.mode = (short)mode;
660	+	this.hint = seed; // store initial seed for runWorker
661		// Place indices in the center of array (that is not yet allocated)
662		base = top = INITIAL_QUEUE_CAPACITY >>> 1;
663		}
#	Line 638 \| Line 682 \| public class ForkJoinPool extends Abstra
682		(n == -1 &&
683		((a = array) == null \|\|
684		(m = a.length - 1) < 0 \|\|
685	<	U.getObjectVolatile
686	<	(a, ((m & (s - 1)) << ASHIFT) + ABASE) == null)));
685	>	U.getObject
686	>	(a, (long)((m & (s - 1)) << ASHIFT) + ABASE) == null)));
687		}
688
689		/**
690	<	* Pushes a task. Call only by owner in unshared queues.
690	>	* Pushes a task. Call only by owner in unshared queues. (The
691	>	* shared-queue version is embedded in method externalPush.)
692		*
693		* @param task the task. Caller must ensure non-null.
694	<	* @throw RejectedExecutionException if array cannot be resized
694	>	* @throws RejectedExecutionException if array cannot be resized
695		*/
696		final void push(ForkJoinTask<?> task) {
697		ForkJoinTask<?>[] a; ForkJoinPool p;
698	<	int s = top, m, n;
698	>	int s = top, n;
699		if ((a = array) != null) { // ignore if queue removed
700	<	U.putOrderedObject
701	<	(a, (((m = a.length - 1) & s) << ASHIFT) + ABASE, task);
702	<	if ((n = (top = s + 1) - base) <= 2) {
703	<	if ((p = pool) != null)
659	<	p.signalWork();
660	<	}
700	>	int m = a.length - 1;
701	>	U.putOrderedObject(a, ((m & s) << ASHIFT) + ABASE, task);
702	>	if ((n = (top = s + 1) - base) <= 2)
703	>	(p = pool).signalWork(p.workQueues, this);
704		else if (n >= m)
705	<	growArray(true);
705	>	growArray();
706		}
707		}
708
709		/**
710	<	* Pushes a task if lock is free and array is either big
711	<	* enough or can be resized to be big enough.
712	<	*
670	<	* @param task the task. Caller must ensure non-null.
671	<	* @return true if submitted
710	>	* Initializes or doubles the capacity of array. Call either
711	>	* by owner or with lock held -- it is OK for base, but not
712	>	* top, to move while resizings are in progress.
713		*/
714	<	final boolean trySharedPush(ForkJoinTask<?> task) {
715	<	boolean submitted = false;
716	<	if (runState == 0 && U.compareAndSwapInt(this, RUNSTATE, 0, 1)) {
717	<	ForkJoinTask<?>[] a = array;
718	<	int s = top;
719	<	try {
720	<	if ((a != null && a.length > s + 1 - base) \|\|
721	<	(a = growArray(false)) != null) { // must presize
722	<	int j = (((a.length - 1) & s) << ASHIFT) + ABASE;
723	<	U.putObject(a, (long)j, task); // don't need "ordered"
724	<	top = s + 1;
725	<	submitted = true;
726	<	}
727	<	} finally {
728	<	runState = 0; // unlock
729	<	}
714	>	final ForkJoinTask<?>[] growArray() {
715	>	ForkJoinTask<?>[] oldA = array;
716	>	int size = oldA != null ? oldA.length << 1 : INITIAL_QUEUE_CAPACITY;
717	>	if (size > MAXIMUM_QUEUE_CAPACITY)
718	>	throw new RejectedExecutionException("Queue capacity exceeded");
719	>	int oldMask, t, b;
720	>	ForkJoinTask<?>[] a = array = new ForkJoinTask<?>[size];
721	>	if (oldA != null && (oldMask = oldA.length - 1) >= 0 &&
722	>	(t = top) - (b = base) > 0) {
723	>	int mask = size - 1;
724	>	do {
725	>	ForkJoinTask<?> x;
726	>	int oldj = ((b & oldMask) << ASHIFT) + ABASE;
727	>	int j = ((b & mask) << ASHIFT) + ABASE;
728	>	x = (ForkJoinTask<?>)U.getObjectVolatile(oldA, oldj);
729	>	if (x != null &&
730	>	U.compareAndSwapObject(oldA, oldj, x, null))
731	>	U.putObjectVolatile(a, j, x);
732	>	} while (++b != t);
733		}
734	<	return submitted;
734	>	return a;
735		}
736
737		/**
#	Line 710 \| Line 754 \| public class ForkJoinPool extends Abstra
754		return null;
755		}
756
713	–	final ForkJoinTask<?> sharedPop() {
714	–	ForkJoinTask<?> task = null;
715	–	if (runState == 0 && U.compareAndSwapInt(this, RUNSTATE, 0, 1)) {
716	–	try {
717	–	ForkJoinTask<?>[] a; int m;
718	–	if ((a = array) != null && (m = a.length - 1) >= 0) {
719	–	for (int s; (s = top - 1) - base >= 0;) {
720	–	long j = ((m & s) << ASHIFT) + ABASE;
721	–	ForkJoinTask<?> t =
722	–	(ForkJoinTask<?>)U.getObject(a, j);
723	–	if (t == null)
724	–	break;
725	–	if (U.compareAndSwapObject(a, j, t, null)) {
726	–	top = s;
727	–	task = t;
728	–	break;
729	–	}
730	–	}
731	–	}
732	–	} finally {
733	–	runState = 0;
734	–	}
735	–	}
736	–	return task;
737	–	}
738	–
739	–
757		/**
758		* Takes a task in FIFO order if b is base of queue and a task
759		* can be claimed without contention. Specialized versions
#	Line 747 \| Line 764 \| public class ForkJoinPool extends Abstra
764		if ((a = array) != null) {
765		int j = (((a.length - 1) & b) << ASHIFT) + ABASE;
766		if ((t = (ForkJoinTask<?>)U.getObjectVolatile(a, j)) != null &&
767	<	base == b &&
768	<	U.compareAndSwapObject(a, j, t, null)) {
752	<	base = b + 1;
767	>	base == b && U.compareAndSwapObject(a, j, t, null)) {
768	>	U.putOrderedInt(this, QBASE, b + 1);
769		return t;
770		}
771		}
#	Line 765 \| Line 781 \| public class ForkJoinPool extends Abstra
781		int j = (((a.length - 1) & b) << ASHIFT) + ABASE;
782		t = (ForkJoinTask<?>)U.getObjectVolatile(a, j);
783		if (t != null) {
784	<	if (base == b &&
785	<	U.compareAndSwapObject(a, j, t, null)) {
770	<	base = b + 1;
784	>	if (U.compareAndSwapObject(a, j, t, null)) {
785	>	U.putOrderedInt(this, QBASE, b + 1);
786		return t;
787		}
788		}
789		else if (base == b) {
790		if (b + 1 == top)
791		break;
792	<	Thread.yield(); // wait for lagging update
792	>	Thread.yield(); // wait for lagging update (very rare)
793		}
794		}
795		return null;
#	Line 801 \| Line 816 \| public class ForkJoinPool extends Abstra
816
817		/**
818		* Pops the given task only if it is at the current top.
819	+	* (A shared version is available only via FJP.tryExternalUnpush)
820		*/
821		final boolean tryUnpush(ForkJoinTask<?> t) {
822		ForkJoinTask<?>[] a; int s;
#	Line 814 \| Line 830 \| public class ForkJoinPool extends Abstra
830		}
831
832		/**
817	–	* Version of tryUnpush for shared queues; called by non-FJ
818	–	* submitters after prechecking that task probably exists.
819	–	*/
820	–	final boolean trySharedUnpush(ForkJoinTask<?> t) {
821	–	boolean success = false;
822	–	if (runState == 0 && U.compareAndSwapInt(this, RUNSTATE, 0, 1)) {
823	–	try {
824	–	ForkJoinTask<?>[] a; int s;
825	–	if ((a = array) != null && (s = top) != base &&
826	–	U.compareAndSwapObject
827	–	(a, (((a.length - 1) & --s) << ASHIFT) + ABASE, t, null)) {
828	–	top = s;
829	–	success = true;
830	–	}
831	–	} finally {
832	–	runState = 0; // unlock
833	–	}
834	–	}
835	–	return success;
836	–	}
837	–
838	–	/**
839	–	* Polls the given task only if it is at the current base.
840	–	*/
841	–	final boolean pollFor(ForkJoinTask<?> task) {
842	–	ForkJoinTask<?>[] a; int b;
843	–	if ((b = base) - top < 0 && (a = array) != null) {
844	–	int j = (((a.length - 1) & b) << ASHIFT) + ABASE;
845	–	if (U.getObjectVolatile(a, j) == task && base == b &&
846	–	U.compareAndSwapObject(a, j, task, null)) {
847	–	base = b + 1;
848	–	return true;
849	–	}
850	–	}
851	–	return false;
852	–	}
853	–
854	–	/**
855	–	* Initializes or doubles the capacity of array. Call either
856	–	* by owner or with lock held -- it is OK for base, but not
857	–	* top, to move while resizings are in progress.
858	–	*
859	–	* @param rejectOnFailure if true, throw exception if capacity
860	–	* exceeded (relayed ultimately to user); else return null.
861	–	*/
862	–	final ForkJoinTask<?>[] growArray(boolean rejectOnFailure) {
863	–	ForkJoinTask<?>[] oldA = array;
864	–	int size = oldA != null ? oldA.length << 1 : INITIAL_QUEUE_CAPACITY;
865	–	if (size <= MAXIMUM_QUEUE_CAPACITY) {
866	–	int oldMask, t, b;
867	–	ForkJoinTask<?>[] a = array = new ForkJoinTask<?>[size];
868	–	if (oldA != null && (oldMask = oldA.length - 1) >= 0 &&
869	–	(t = top) - (b = base) > 0) {
870	–	int mask = size - 1;
871	–	do {
872	–	ForkJoinTask<?> x;
873	–	int oldj = ((b & oldMask) << ASHIFT) + ABASE;
874	–	int j = ((b & mask) << ASHIFT) + ABASE;
875	–	x = (ForkJoinTask<?>)U.getObjectVolatile(oldA, oldj);
876	–	if (x != null &&
877	–	U.compareAndSwapObject(oldA, oldj, x, null))
878	–	U.putObjectVolatile(a, j, x);
879	–	} while (++b != t);
880	–	}
881	–	return a;
882	–	}
883	–	else if (!rejectOnFailure)
884	–	return null;
885	–	else
886	–	throw new RejectedExecutionException("Queue capacity exceeded");
887	–	}
888	–
889	–	/**
833		* Removes and cancels all known tasks, ignoring any exceptions.
834		*/
835		final void cancelAll() {
#	Line 896 \| Line 839 \| public class ForkJoinPool extends Abstra
839		ForkJoinTask.cancelIgnoringExceptions(t);
840		}
841
899	–	/**
900	–	* Computes next value for random probes. Scans don't require
901	–	* a very high quality generator, but also not a crummy one.
902	–	* Marsaglia xor-shift is cheap and works well enough. Note:
903	–	* This is manually inlined in its usages in ForkJoinPool to
904	–	* avoid writes inside busy scan loops.
905	–	*/
906	–	final int nextSeed() {
907	–	int r = seed;
908	–	r ^= r << 13;
909	–	r ^= r >>> 17;
910	–	return seed = r ^= r << 5;
911	–	}
912	–
842		// Specialized execution methods
843
844		/**
845	<	* Pops and runs tasks until empty.
845	>	* Polls and runs tasks until empty.
846		*/
847	<	private void popAndExecAll() {
848	<	// A bit faster than repeated pop calls
849	<	ForkJoinTask<?>[] a; int m, s; long j; ForkJoinTask<?> t;
921	<	while ((a = array) != null && (m = a.length - 1) >= 0 &&
922	<	(s = top - 1) - base >= 0 &&
923	<	(t = ((ForkJoinTask<?>)
924	<	U.getObject(a, j = ((m & s) << ASHIFT) + ABASE)))
925	<	!= null) {
926	<	if (U.compareAndSwapObject(a, j, t, null)) {
927	<	top = s;
928	<	t.doExec();
929	<	}
930	<	}
847	>	final void pollAndExecAll() {
848	>	for (ForkJoinTask<?> t; (t = poll()) != null;)
849	>	t.doExec();
850		}
851
852		/**
853	<	* Polls and runs tasks until empty.
853	>	* Executes a top-level task and any local tasks remaining
854	>	* after execution.
855		*/
856	<	private void pollAndExecAll() {
857	<	for (ForkJoinTask<?> t; (t = poll()) != null;)
858	<	t.doExec();
856	>	final void runTask(ForkJoinTask<?> task) {
857	>	if ((currentSteal = task) != null) {
858	>	task.doExec();
859	>	ForkJoinTask<?>[] a = array;
860	>	int md = mode;
861	>	++nsteals;
862	>	currentSteal = null;
863	>	if (md != 0)
864	>	pollAndExecAll();
865	>	else if (a != null) {
866	>	int s, m = a.length - 1;
867	>	while ((s = top - 1) - base >= 0) {
868	>	long i = ((m & s) << ASHIFT) + ABASE;
869	>	ForkJoinTask<?> t = (ForkJoinTask<?>)U.getObject(a, i);
870	>	if (t == null)
871	>	break;
872	>	if (U.compareAndSwapObject(a, i, t, null)) {
873	>	top = s;
874	>	t.doExec();
875	>	}
876	>	}
877	>	}
878	>	}
879		}
880
881		/**
882	<	* If present, removes from queue and executes the given task, or
883	<	* any other cancelled task. Returns (true) immediately on any CAS
882	>	* If present, removes from queue and executes the given task,
883	>	* or any other cancelled task. Returns (true) on any CAS
884		* or consistency check failure so caller can retry.
885		*
886	<	* @return 0 if no progress can be made, else positive
947	<	* (this unusual convention simplifies use with tryHelpStealer.)
886	>	* @return false if no progress can be made, else true
887		*/
888	<	final int tryRemoveAndExec(ForkJoinTask<?> task) {
889	<	int stat = 1;
951	<	boolean removed = false, empty = true;
888	>	final boolean tryRemoveAndExec(ForkJoinTask<?> task) {
889	>	boolean stat;
890		ForkJoinTask<?>[] a; int m, s, b, n;
891	<	if ((a = array) != null && (m = a.length - 1) >= 0 &&
891	>	if (task != null && (a = array) != null && (m = a.length - 1) >= 0 &&
892		(n = (s = top) - (b = base)) > 0) {
893	+	boolean removed = false, empty = true;
894	+	stat = true;
895		for (ForkJoinTask<?> t;;) { // traverse from s to b
896	<	int j = ((--s & m) << ASHIFT) + ABASE;
897	<	t = (ForkJoinTask<?>)U.getObjectVolatile(a, j);
896	>	long j = ((--s & m) << ASHIFT) + ABASE;
897	>	t = (ForkJoinTask<?>)U.getObject(a, j);
898		if (t == null) // inconsistent length
899		break;
900		else if (t == task) {
#	Line 978 \| Line 918 \| public class ForkJoinPool extends Abstra
918		}
919		if (--n == 0) {
920		if (!empty && base == b)
921	<	stat = 0;
921	>	stat = false;
922		break;
923		}
924		}
925	+	if (removed)
926	+	task.doExec();
927		}
928	<	if (removed)
929	<	task.doExec();
928	>	else
929	>	stat = false;
930		return stat;
931		}
932
933		/**
934	<	* Version of shared pop that takes top element only if it
935	<	* its root is the given CountedCompleter.
934	>	* Tries to poll for and execute the given task or any other
935	>	* task in its CountedCompleter computation.
936		*/
937	<	final CountedCompleter<?> sharedPopCC(CountedCompleter<?> root) {
938	<	CountedCompleter<?> task = null;
939	<	if (runState == 0 && U.compareAndSwapInt(this, RUNSTATE, 0, 1)) {
940	<	try {
941	<	ForkJoinTask<?>[] a; int m;
942	<	if ((a = array) != null && (m = a.length - 1) >= 0) {
943	<	outer:for (int s; (s = top - 1) - base >= 0;) {
944	<	long j = ((m & s) << ASHIFT) + ABASE;
945	<	ForkJoinTask<?> t =
946	<	(ForkJoinTask<?>)U.getObject(a, j);
947	<	if (t == null \|\| !(t instanceof CountedCompleter))
948	<	break;
949	<	CountedCompleter<?> cc = (CountedCompleter<?>)t;
1008	<	for (CountedCompleter<?> q = cc, p;;) {
1009	<	if (q == root) {
1010	<	if (U.compareAndSwapObject(a, j, cc, null)) {
1011	<	top = s;
1012	<	task = cc;
1013	<	break outer;
1014	<	}
1015	<	break;
1016	<	}
1017	<	if ((p = q.completer) == null)
1018	<	break outer;
1019	<	q = p;
937	>	final boolean pollAndExecCC(CountedCompleter<?> root) {
938	>	ForkJoinTask<?>[] a; int b; Object o; CountedCompleter<?> t, r;
939	>	if ((b = base) - top < 0 && (a = array) != null) {
940	>	long j = (((a.length - 1) & b) << ASHIFT) + ABASE;
941	>	if ((o = U.getObjectVolatile(a, j)) == null)
942	>	return true; // retry
943	>	if (o instanceof CountedCompleter) {
944	>	for (t = (CountedCompleter<?>)o, r = t;;) {
945	>	if (r == root) {
946	>	if (base == b &&
947	>	U.compareAndSwapObject(a, j, t, null)) {
948	>	U.putOrderedInt(this, QBASE, b + 1);
949	>	t.doExec();
950		}
951	+	return true;
952		}
953	+	else if ((r = r.completer) == null)
954	+	break; // not part of root computation
955		}
1023	–	} finally {
1024	–	runState = 0;
956		}
957		}
958	<	return task;
958	>	return false;
959		}
960
961		/**
962	<	* Executes a top-level task and any local tasks remaining
963	<	* after execution.
962	>	* Tries to pop and execute the given task or any other task
963	>	* in its CountedCompleter computation.
964		*/
965	<	final void runTask(ForkJoinTask<?> t) {
966	<	if (t != null) {
967	<	currentSteal = t;
968	<	t.doExec();
969	<	if (top != base) { // process remaining local tasks
970	<	if (mode == 0)
971	<	popAndExecAll();
972	<	else
973	<	pollAndExecAll();
965	>	final boolean externalPopAndExecCC(CountedCompleter<?> root) {
966	>	ForkJoinTask<?>[] a; int s; Object o; CountedCompleter<?> t, r;
967	>	if (base - (s = top) < 0 && (a = array) != null) {
968	>	long j = (((a.length - 1) & (s - 1)) << ASHIFT) + ABASE;
969	>	if ((o = U.getObject(a, j)) instanceof CountedCompleter) {
970	>	for (t = (CountedCompleter<?>)o, r = t;;) {
971	>	if (r == root) {
972	>	if (U.compareAndSwapInt(this, QLOCK, 0, 1)) {
973	>	if (top == s && array == a &&
974	>	U.compareAndSwapObject(a, j, t, null)) {
975	>	top = s - 1;
976	>	qlock = 0;
977	>	t.doExec();
978	>	}
979	>	else
980	>	qlock = 0;
981	>	}
982	>	return true;
983	>	}
984	>	else if ((r = r.completer) == null)
985	>	break;
986	>	}
987		}
1044	–	++nsteals;
1045	–	currentSteal = null;
988		}
989	+	return false;
990		}
991
992		/**
993	<	* Executes a non-top-level (stolen) task.
993	>	* Internal version
994		*/
995	<	final void runSubtask(ForkJoinTask<?> t) {
996	<	if (t != null) {
997	<	ForkJoinTask<?> ps = currentSteal;
998	<	currentSteal = t;
999	<	t.doExec();
1000	<	currentSteal = ps;
995	>	final boolean internalPopAndExecCC(CountedCompleter<?> root) {
996	>	ForkJoinTask<?>[] a; int s; Object o; CountedCompleter<?> t, r;
997	>	if (base - (s = top) < 0 && (a = array) != null) {
998	>	long j = (((a.length - 1) & (s - 1)) << ASHIFT) + ABASE;
999	>	if ((o = U.getObject(a, j)) instanceof CountedCompleter) {
1000	>	for (t = (CountedCompleter<?>)o, r = t;;) {
1001	>	if (r == root) {
1002	>	if (U.compareAndSwapObject(a, j, t, null)) {
1003	>	top = s - 1;
1004	>	t.doExec();
1005	>	}
1006	>	return true;
1007	>	}
1008	>	else if ((r = r.completer) == null)
1009	>	break;
1010	>	}
1011	>	}
1012		}
1013	+	return false;
1014		}
1015
1016		/**
#	Line 1070 \| Line 1025 \| public class ForkJoinPool extends Abstra
1025		s != Thread.State.TIMED_WAITING);
1026		}
1027
1073	–	/**
1074	–	* If this owned and is not already interrupted, try to
1075	–	* interrupt and/or unpark, ignoring exceptions.
1076	–	*/
1077	–	final void interruptOwner() {
1078	–	Thread wt, p;
1079	–	if ((wt = owner) != null && !wt.isInterrupted()) {
1080	–	try {
1081	–	wt.interrupt();
1082	–	} catch (SecurityException ignore) {
1083	–	}
1084	–	}
1085	–	if ((p = parker) != null)
1086	–	U.unpark(p);
1087	–	}
1088	–
1028		// Unsafe mechanics
1029		private static final sun.misc.Unsafe U;
1030	<	private static final long RUNSTATE;
1030	>	private static final long QBASE;
1031	>	private static final long QLOCK;
1032		private static final int ABASE;
1033		private static final int ASHIFT;
1034		static {
1095	–	int s;
1035		try {
1036		U = getUnsafe();
1037		Class<?> k = WorkQueue.class;
1038		Class<?> ak = ForkJoinTask[].class;
1039	<	RUNSTATE = U.objectFieldOffset
1040	<	(k.getDeclaredField("runState"));
1039	>	QBASE = U.objectFieldOffset
1040	>	(k.getDeclaredField("base"));
1041	>	QLOCK = U.objectFieldOffset
1042	>	(k.getDeclaredField("qlock"));
1043		ABASE = U.arrayBaseOffset(ak);
1044	<	s = U.arrayIndexScale(ak);
1044	>	int scale = U.arrayIndexScale(ak);
1045	>	if ((scale & (scale - 1)) != 0)
1046	>	throw new Error("data type scale not a power of two");
1047	>	ASHIFT = 31 - Integer.numberOfLeadingZeros(scale);
1048		} catch (Exception e) {
1049		throw new Error(e);
1050		}
1107	–	if ((s & (s-1)) != 0)
1108	–	throw new Error("data type scale not a power of two");
1109	–	ASHIFT = 31 - Integer.numberOfLeadingZeros(s);
1051		}
1052		}
1053
1054	+	// static fields (initialized in static initializer below)
1055	+
1056		/**
1057	<	* Per-thread records for threads that submit to pools. Currently
1058	<	* holds only pseudo-random seed / index that is used to choose
1059	<	* submission queues in method doSubmit. In the future, this may
1060	<	* also incorporate a means to implement different task rejection
1061	<	* and resubmission policies.
1119	<	*
1120	<	* Seeds for submitters and workers/workQueues work in basically
1121	<	* the same way but are initialized and updated using slightly
1122	<	* different mechanics. Both are initialized using the same
1123	<	* approach as in class ThreadLocal, where successive values are
1124	<	* unlikely to collide with previous values. This is done during
1125	<	* registration for workers, but requires a separate AtomicInteger
1126	<	* for submitters. Seeds are then randomly modified upon
1127	<	* collisions using xorshifts, which requires a non-zero seed.
1057	>	* Per-thread submission bookkeeping. Shared across all pools
1058	>	* to reduce ThreadLocal pollution and because random motion
1059	>	* to avoid contention in one pool is likely to hold for others.
1060	>	* Lazily initialized on first submission (but null-checked
1061	>	* in other contexts to avoid unnecessary initialization).
1062		*/
1063	<	static final class Submitter {
1130	<	int seed;
1131	<	Submitter() {
1132	<	int s = nextSubmitterSeed.getAndAdd(SEED_INCREMENT);
1133	<	seed = (s == 0) ? 1 : s; // ensure non-zero
1134	<	}
1135	<	}
1136	<
1137	<	/** ThreadLocal class for Submitters */
1138	<	static final class ThreadSubmitter extends ThreadLocal<Submitter> {
1139	<	public Submitter initialValue() { return new Submitter(); }
1140	<	}
1141	<
1142	<	// static fields (initialized in static initializer below)
1063	>	static final ThreadLocal<Submitter> submitters;
1064
1065		/**
1066		* Creates a new ForkJoinWorkerThread. This factory is used unless
#	Line 1148 \| Line 1069 \| public class ForkJoinPool extends Abstra
1069		public static final ForkJoinWorkerThreadFactory
1070		defaultForkJoinWorkerThreadFactory;
1071
1151	–	/** Property prefix for constructing common pool */
1152	–	private static final String propPrefix =
1153	–	"java.util.concurrent.ForkJoinPool.common.";
1154	–
1072		/**
1073	<	* Common (static) pool. Non-null for public use unless a static
1074	<	* construction exception, but internal usages must null-check on
1158	<	* use.
1159	<	*/
1160	<	static final ForkJoinPool commonPool;
1161	<
1162	<	/**
1163	<	* Common pool parallelism. Must equal commonPool.parallelism.
1073	>	* Permission required for callers of methods that may start or
1074	>	* kill threads.
1075		*/
1076	<	static final int commonPoolParallelism;
1076	>	private static final RuntimePermission modifyThreadPermission;
1077
1078		/**
1079	<	* Generator for assigning sequence numbers as pool names.
1079	>	* Common (static) pool. Non-null for public use unless a static
1080	>	* construction exception, but internal usages null-check on use
1081	>	* to paranoically avoid potential initialization circularities
1082	>	* as well as to simplify generated code.
1083		*/
1084	<	private static final AtomicInteger poolNumberGenerator;
1084	>	static final ForkJoinPool common;
1085
1086		/**
1087	<	* Generator for initial hashes/seeds for submitters. Accessed by
1088	<	* Submitter class constructor.
1087	>	* Common pool parallelism. To allow simpler use and management
1088	>	* when common pool threads are disabled, we allow the underlying
1089	>	* common.parallelism field to be zero, but in that case still report
1090	>	* parallelism as 1 to reflect resulting caller-runs mechanics.
1091		*/
1092	<	static final AtomicInteger nextSubmitterSeed;
1092	>	static final int commonParallelism;
1093
1094		/**
1095	<	* Permission required for callers of methods that may start or
1180	<	* kill threads.
1095	>	* Sequence number for creating workerNamePrefix.
1096		*/
1097	<	private static final RuntimePermission modifyThreadPermission;
1097	>	private static int poolNumberSequence;
1098
1099		/**
1100	<	* Per-thread submission bookkeeping. Shared across all pools
1101	<	* to reduce ThreadLocal pollution and because random motion
1187	<	* to avoid contention in one pool is likely to hold for others.
1100	>	* Returns the next sequence number. We don't expect this to
1101	>	* ever contend, so use simple builtin sync.
1102		*/
1103	<	private static final ThreadSubmitter submitters;
1103	>	private static final synchronized int nextPoolId() {
1104	>	return ++poolNumberSequence;
1105	>	}
1106
1107		// static constants
1108
1109		/**
1110	<	* Initial timeout value (in nanoseconds) for the thread triggering
1111	<	* quiescence to park waiting for new work. On timeout, the thread
1112	<	* will instead try to shrink the number of workers.
1110	>	* Initial timeout value (in nanoseconds) for the thread
1111	>	* triggering quiescence to park waiting for new work. On timeout,
1112	>	* the thread will instead try to shrink the number of
1113	>	* workers. The value should be large enough to avoid overly
1114	>	* aggressive shrinkage during most transient stalls (long GCs
1115	>	* etc).
1116		*/
1117	<	private static final long IDLE_TIMEOUT = 1000L * 1000L * 1000L; // 1sec
1117	>	private static final long IDLE_TIMEOUT = 2000L * 1000L * 1000L; // 2sec
1118
1119		/**
1120		* Timeout value when there are more threads than parallelism level
1121		*/
1122	<	private static final long FAST_IDLE_TIMEOUT = 100L * 1000L * 1000L;
1122	>	private static final long FAST_IDLE_TIMEOUT = 200L * 1000L * 1000L;
1123	>
1124	>	/**
1125	>	* Tolerance for idle timeouts, to cope with timer undershoots
1126	>	*/
1127	>	private static final long TIMEOUT_SLOP = 2000000L;
1128
1129		/**
1130		* The maximum stolen->joining link depth allowed in method
1131	<	* tryHelpStealer. Must be a power of two. This value also
1208	<	* controls the maximum number of times to try to help join a task
1209	<	* without any apparent progress or change in pool state before
1210	<	* giving up and blocking (see awaitJoin). Depths for legitimate
1131	>	* tryHelpStealer. Must be a power of two. Depths for legitimate
1132		* chains are unbounded, but we use a fixed constant to avoid
1133		* (otherwise unchecked) cycles and to bound staleness of
1134		* traversal parameters at the expense of sometimes blocking when
#	Line 1216 \| Line 1137 \| public class ForkJoinPool extends Abstra
1137		private static final int MAX_HELP = 64;
1138
1139		/**
1219	–	* Secondary time-based bound (in nanosecs) for helping attempts
1220	–	* before trying compensated blocking in awaitJoin. Used in
1221	–	* conjunction with MAX_HELP to reduce variance due to different
1222	–	* polling rates associated with different helping options. The
1223	–	* value should roughly approximate the time required to create
1224	–	* and/or activate a worker thread.
1225	–	*/
1226	–	private static final long COMPENSATION_DELAY = 1L << 18; // ~0.25 millisec
1227	–
1228	–	/**
1140		* Increment for seed generators. See class ThreadLocal for
1141		* explanation.
1142		*/
1143		private static final int SEED_INCREMENT = 0x61c88647;
1144
1145	<	/**
1145	>	/*
1146		* Bits and masks for control variables
1147		*
1148		* Field ctl is a long packed with:
#	Line 1259 \| Line 1170 \| public class ForkJoinPool extends Abstra
1170		* scan for them to avoid queuing races. Note however that
1171		* eventCount updates lag releases so usage requires care.
1172		*
1173	<	* Field runState is an int packed with:
1173	>	* Field plock is an int packed with:
1174		* SHUTDOWN: true if shutdown is enabled (1 bit)
1175	<	* SEQ: a sequence number updated upon (de)registering workers (30 bits)
1176	<	* INIT: set true after workQueues array construction (1 bit)
1175	>	* SEQ: a sequence lock, with PL_LOCK bit set if locked (30 bits)
1176	>	* SIGNAL: set when threads may be waiting on the lock (1 bit)
1177		*
1178		* The sequence number enables simple consistency checks:
1179		* Staleness of read-only operations on the workQueues array can
1180	<	* be checked by comparing runState before vs after the reads.
1180	>	* be checked by comparing plock before vs after the reads.
1181		*/
1182
1183		// bit positions/shifts for fields
#	Line 1278 \| Line 1189 \| public class ForkJoinPool extends Abstra
1189		// bounds
1190		private static final int SMASK = 0xffff; // short bits
1191		private static final int MAX_CAP = 0x7fff; // max #workers - 1
1192	<	private static final int SQMASK = 0xfffe; // even short bits
1192	>	private static final int EVENMASK = 0xfffe; // even short bits
1193	>	private static final int SQMASK = 0x007e; // max 64 (even) slots
1194		private static final int SHORT_SIGN = 1 << 15;
1195		private static final int INT_SIGN = 1 << 31;
1196
#	Line 1303 \| Line 1215 \| public class ForkJoinPool extends Abstra
1215		private static final int E_MASK = 0x7fffffff; // no STOP_BIT
1216		private static final int E_SEQ = 1 << EC_SHIFT;
1217
1218	<	// runState bits
1218	>	// plock bits
1219		private static final int SHUTDOWN = 1 << 31;
1220	+	private static final int PL_LOCK = 2;
1221	+	private static final int PL_SIGNAL = 1;
1222	+	private static final int PL_SPINS = 1 << 8;
1223
1224		// access mode for WorkQueue
1225		static final int LIFO_QUEUE = 0;
1226		static final int FIFO_QUEUE = 1;
1227		static final int SHARED_QUEUE = -1;
1228
1229	<	// Instance fields
1230	<
1316	<	/*
1317	<	* Field layout order in this class tends to matter more than one
1318	<	* would like. Runtime layout order is only loosely related to
1319	<	* declaration order and may differ across JVMs, but the following
1320	<	* empirically works OK on current JVMs.
1321	<	*/
1229	>	// Heuristic padding to ameliorate unfortunate memory placements
1230	>	volatile long pad00, pad01, pad02, pad03, pad04, pad05, pad06;
1231
1232	+	// Instance fields
1233		volatile long stealCount; // collects worker counts
1234		volatile long ctl; // main pool control
1235	<	final int parallelism; // parallelism level
1236	<	final int localMode; // per-worker scheduling mode
1237	<	volatile int nextWorkerNumber; // to create worker name string
1238	<	final int submitMask; // submit queue index bound
1329	<	int nextSeed; // for initializing worker seeds
1330	<	volatile int mainLock; // spinlock for array updates
1331	<	volatile int runState; // shutdown status and seq
1235	>	volatile int plock; // shutdown status and seqLock
1236	>	volatile int indexSeed; // worker/submitter index seed
1237	>	final short parallelism; // parallelism level
1238	>	final short mode; // LIFO/FIFO
1239		WorkQueue[] workQueues; // main registry
1240	<	final ForkJoinWorkerThreadFactory factory; // factory for new workers
1241	<	final Thread.UncaughtExceptionHandler ueh; // per-worker UEH
1240	>	final ForkJoinWorkerThreadFactory factory;
1241	>	final UncaughtExceptionHandler ueh; // per-worker UEH
1242		final String workerNamePrefix; // to create worker name string
1243
1244	<	/*
1245	<	* Mechanics for main lock protecting worker array updates. Uses
1339	<	* the same strategy as ConcurrentHashMap bins -- a spinLock for
1340	<	* normal cases, but falling back to builtin lock when (rarely)
1341	<	* needed. See internal ConcurrentHashMap documentation for
1342	<	* explanation.
1343	<	*/
1244	>	volatile Object pad10, pad11, pad12, pad13, pad14, pad15, pad16, pad17;
1245	>	volatile Object pad18, pad19, pad1a, pad1b;
1246
1247	<	static final int LOCK_WAITING = 2; // bit to indicate need for signal
1248	<	static final int MAX_LOCK_SPINS = 1 << 8;
1249	<
1250	<	private void tryAwaitMainLock() {
1251	<	int spins = MAX_LOCK_SPINS, r = 0, h;
1252	<	while (((h = mainLock) & 1) != 0) {
1253	<	if (r == 0)
1254	<	r = ThreadLocalRandom.current().nextInt(); // randomize spins
1247	>	/**
1248	>	* Acquires the plock lock to protect worker array and related
1249	>	* updates. This method is called only if an initial CAS on plock
1250	>	* fails. This acts as a spinlock for normal cases, but falls back
1251	>	* to builtin monitor to block when (rarely) needed. This would be
1252	>	* a terrible idea for a highly contended lock, but works fine as
1253	>	* a more conservative alternative to a pure spinlock.
1254	>	*/
1255	>	private int acquirePlock() {
1256	>	int spins = PL_SPINS, ps, nps;
1257	>	for (;;) {
1258	>	if (((ps = plock) & PL_LOCK) == 0 &&
1259	>	U.compareAndSwapInt(this, PLOCK, ps, nps = ps + PL_LOCK))
1260	>	return nps;
1261		else if (spins >= 0) {
1262	<	r ^= r << 1; r ^= r >>> 3; r ^= r << 10; // xorshift
1355	<	if (r >= 0)
1262	>	if (ThreadLocalRandom.current().nextInt() >= 0)
1263		--spins;
1264		}
1265	<	else if (U.compareAndSwapInt(this, MAINLOCK, h, h \| LOCK_WAITING)) {
1265	>	else if (U.compareAndSwapInt(this, PLOCK, ps, ps \| PL_SIGNAL)) {
1266		synchronized (this) {
1267	<	if ((mainLock & LOCK_WAITING) != 0) {
1267	>	if ((plock & PL_SIGNAL) != 0) {
1268		try {
1269		wait();
1270		} catch (InterruptedException ie) {
#	Line 1368 \| Line 1275 \| public class ForkJoinPool extends Abstra
1275		}
1276		}
1277		else
1278	<	notifyAll(); // possibly won race vs signaller
1278	>	notifyAll();
1279		}
1373	–	break;
1280		}
1281		}
1282		}
1283
1378	–	// Creating, registering, and deregistering workers
1379	–
1284		/**
1285	<	* Tries to create and start a worker
1285	>	* Unlocks and signals any thread waiting for plock. Called only
1286	>	* when CAS of seq value for unlock fails.
1287		*/
1288	<	private void addWorker() {
1289	<	Throwable ex = null;
1290	<	ForkJoinWorkerThread wt = null;
1386	<	try {
1387	<	if ((wt = factory.newThread(this)) != null) {
1388	<	wt.start();
1389	<	return;
1390	<	}
1391	<	} catch (Throwable e) {
1392	<	ex = e;
1393	<	}
1394	<	deregisterWorker(wt, ex); // adjust counts etc on failure
1288	>	private void releasePlock(int ps) {
1289	>	plock = ps;
1290	>	synchronized (this) { notifyAll(); }
1291		}
1292
1293		/**
1294	<	* Callback from ForkJoinWorkerThread constructor to assign a
1295	<	* public name. This must be separate from registerWorker because
1400	<	* it is called during the "super" constructor call in
1401	<	* ForkJoinWorkerThread.
1294	>	* Tries to create and start one worker if fewer than target
1295	>	* parallelism level exist. Adjusts counts etc on failure.
1296		*/
1297	<	final String nextWorkerName() {
1298	<	int n;
1299	<	do {} while (!U.compareAndSwapInt(this, NEXTWORKERNUMBER,
1300	<	n = nextWorkerNumber, ++n));
1301	<	return workerNamePrefix.concat(Integer.toString(n));
1297	>	private void tryAddWorker() {
1298	>	long c; int u, e;
1299	>	while ((u = (int)((c = ctl) >>> 32)) < 0 &&
1300	>	(u & SHORT_SIGN) != 0 && (e = (int)c) >= 0) {
1301	>	long nc = ((long)(((u + UTC_UNIT) & UTC_MASK) \|
1302	>	((u + UAC_UNIT) & UAC_MASK)) << 32) \| (long)e;
1303	>	if (U.compareAndSwapLong(this, CTL, c, nc)) {
1304	>	ForkJoinWorkerThreadFactory fac;
1305	>	Throwable ex = null;
1306	>	ForkJoinWorkerThread wt = null;
1307	>	try {
1308	>	if ((fac = factory) != null &&
1309	>	(wt = fac.newThread(this)) != null) {
1310	>	wt.start();
1311	>	break;
1312	>	}
1313	>	} catch (Throwable rex) {
1314	>	ex = rex;
1315	>	}
1316	>	deregisterWorker(wt, ex);
1317	>	break;
1318	>	}
1319	>	}
1320		}
1321
1322	+	// Registering and deregistering workers
1323	+
1324		/**
1325	<	* Callback from ForkJoinWorkerThread constructor to establish its
1326	<	* poolIndex and record its WorkQueue. To avoid scanning bias due
1327	<	* to packing entries in front of the workQueues array, we treat
1328	<	* the array as a simple power-of-two hash table using per-thread
1329	<	* seed as hash, expanding as needed.
1330	<	*
1331	<	* @param w the worker's queue
1332	<	*/
1333	<	final void registerWorker(WorkQueue w) {
1334	<	while (!U.compareAndSwapInt(this, MAINLOCK, 0, 1))
1335	<	tryAwaitMainLock();
1325	>	* Callback from ForkJoinWorkerThread to establish and record its
1326	>	* WorkQueue. To avoid scanning bias due to packing entries in
1327	>	* front of the workQueues array, we treat the array as a simple
1328	>	* power-of-two hash table using per-thread seed as hash,
1329	>	* expanding as needed.
1330	>	*
1331	>	* @param wt the worker thread
1332	>	* @return the worker's queue
1333	>	*/
1334	>	final WorkQueue registerWorker(ForkJoinWorkerThread wt) {
1335	>	UncaughtExceptionHandler handler; WorkQueue[] ws; int s, ps;
1336	>	wt.setDaemon(true);
1337	>	if ((handler = ueh) != null)
1338	>	wt.setUncaughtExceptionHandler(handler);
1339	>	do {} while (!U.compareAndSwapInt(this, INDEXSEED, s = indexSeed,
1340	>	s += SEED_INCREMENT) \|\|
1341	>	s == 0); // skip 0
1342	>	WorkQueue w = new WorkQueue(this, wt, mode, s);
1343	>	if (((ps = plock) & PL_LOCK) != 0 \|\|
1344	>	!U.compareAndSwapInt(this, PLOCK, ps, ps += PL_LOCK))
1345	>	ps = acquirePlock();
1346	>	int nps = (ps & SHUTDOWN) \| ((ps + PL_LOCK) & ~SHUTDOWN);
1347		try {
1348	<	WorkQueue[] ws;
1349	<	if ((ws = workQueues) == null)
1350	<	ws = workQueues = new WorkQueue[submitMask + 1];
1351	<	if (w != null) {
1352	<	int rs, n = ws.length, m = n - 1;
1353	<	int s = nextSeed += SEED_INCREMENT; // rarely-colliding sequence
1429	<	w.seed = (s == 0) ? 1 : s; // ensure non-zero seed
1430	<	int r = (s << 1) \| 1; // use odd-numbered indices
1431	<	if (ws[r &= m] != null) { // collision
1432	<	int probes = 0; // step by approx half size
1433	<	int step = (n <= 4) ? 2 : ((n >>> 1) & SQMASK) + 2;
1348	>	if ((ws = workQueues) != null) { // skip if shutting down
1349	>	int n = ws.length, m = n - 1;
1350	>	int r = (s << 1) \| 1; // use odd-numbered indices
1351	>	if (ws[r &= m] != null) { // collision
1352	>	int probes = 0; // step by approx half size
1353	>	int step = (n <= 4) ? 2 : ((n >>> 1) & EVENMASK) + 2;
1354		while (ws[r = (r + step) & m] != null) {
1355		if (++probes >= n) {
1356		workQueues = ws = Arrays.copyOf(ws, n <<= 1);
#	Line 1439 \| Line 1359 \| public class ForkJoinPool extends Abstra
1359		}
1360		}
1361		}
1362	<	w.eventCount = w.poolIndex = r; // establish before recording
1363	<	ws[r] = w; // also update seq
1364	<	runState = ((rs = runState) & SHUTDOWN) \| ((rs + 2) & ~SHUTDOWN);
1362	>	w.poolIndex = (short)r;
1363	>	w.eventCount = r; // volatile write orders
1364	>	ws[r] = w;
1365		}
1366		} finally {
1367	<	if (!U.compareAndSwapInt(this, MAINLOCK, 1, 0)) {
1368	<	mainLock = 0;
1449	<	synchronized (this) { notifyAll(); };
1450	<	}
1367	>	if (!U.compareAndSwapInt(this, PLOCK, ps, nps))
1368	>	releasePlock(nps);
1369		}
1370	+	wt.setName(workerNamePrefix.concat(Integer.toString(w.poolIndex >>> 1)));
1371	+	return w;
1372		}
1373
1374		/**
1375		* Final callback from terminating worker, as well as upon failure
1376	<	* to construct or start a worker in addWorker. Removes record of
1377	<	* worker from array, and adjusts counts. If pool is shutting
1378	<	* down, tries to complete termination.
1376	>	* to construct or start a worker. Removes record of worker from
1377	>	* array, and adjusts counts. If pool is shutting down, tries to
1378	>	* complete termination.
1379		*
1380	<	* @param wt the worker thread or null if addWorker failed
1380	>	* @param wt the worker thread, or null if construction failed
1381		* @param ex the exception causing failure, or null if none
1382		*/
1383		final void deregisterWorker(ForkJoinWorkerThread wt, Throwable ex) {
1384		WorkQueue w = null;
1385		if (wt != null && (w = wt.workQueue) != null) {
1386	<	w.runState = -1; // ensure runState is set
1387	<	long steals = w.totalSteals + w.nsteals, sc;
1386	>	int ps; long sc;
1387	>	w.qlock = -1; // ensure set
1388		do {} while (!U.compareAndSwapLong(this, STEALCOUNT,
1389	<	sc = stealCount, sc + steals));
1390	<	int idx = w.poolIndex;
1391	<	while (!U.compareAndSwapInt(this, MAINLOCK, 0, 1))
1392	<	tryAwaitMainLock();
1389	>	sc = stealCount,
1390	>	sc + w.nsteals));
1391	>	if (((ps = plock) & PL_LOCK) != 0 \|\|
1392	>	!U.compareAndSwapInt(this, PLOCK, ps, ps += PL_LOCK))
1393	>	ps = acquirePlock();
1394	>	int nps = (ps & SHUTDOWN) \| ((ps + PL_LOCK) & ~SHUTDOWN);
1395		try {
1396	+	int idx = w.poolIndex;
1397		WorkQueue[] ws = workQueues;
1398		if (ws != null && idx >= 0 && idx < ws.length && ws[idx] == w)
1399		ws[idx] = null;
1400		} finally {
1401	<	if (!U.compareAndSwapInt(this, MAINLOCK, 1, 0)) {
1402	<	mainLock = 0;
1480	<	synchronized (this) { notifyAll(); };
1481	<	}
1401	>	if (!U.compareAndSwapInt(this, PLOCK, ps, nps))
1402	>	releasePlock(nps);
1403		}
1404		}
1405
1406	<	long c; // adjust ctl counts
1406	>	long c; // adjust ctl counts
1407		do {} while (!U.compareAndSwapLong
1408		(this, CTL, c = ctl, (((c - AC_UNIT) & AC_MASK) \|
1409		((c - TC_UNIT) & TC_MASK) \|
1410		(c & ~(AC_MASK\|TC_MASK)))));
1411
1412	<	if (!tryTerminate(false, false) && w != null) {
1413	<	w.cancelAll(); // cancel remaining tasks
1414	<	if (w.array != null) // suppress signal if never ran
1415	<	signalWork(); // wake up or create replacement
1416	<	if (ex == null) // help clean refs on way out
1417	<	ForkJoinTask.helpExpungeStaleExceptions();
1418	<	}
1419	<
1420	<	if (ex != null) // rethrow
1421	<	ForkJoinTask.rethrow(ex);
1422	<	}
1423	<
1424	<	// Submissions
1425	<
1426	<	/**
1427	<	* Unless shutting down, adds the given task to a submission queue
1428	<	* at submitter's current queue index (modulo submission
1429	<	* range). If no queue exists at the index, one is created. If
1509	<	* the queue is busy, another index is randomly chosen. The
1510	<	* submitMask bounds the effective number of queues to the
1511	<	* (nearest power of two for) parallelism level.
1512	<	*
1513	<	* @param task the task. Caller must ensure non-null.
1514	<	*/
1515	<	private void doSubmit(ForkJoinTask<?> task) {
1516	<	Submitter s = submitters.get();
1517	<	for (int r = s.seed, m = submitMask;;) {
1518	<	WorkQueue[] ws; WorkQueue q;
1519	<	int k = r & m & SQMASK; // use only even indices
1520	<	if (runState < 0)
1521	<	throw new RejectedExecutionException(); // shutting down
1522	<	else if ((ws = workQueues) == null \|\| ws.length <= k) {
1523	<	while (!U.compareAndSwapInt(this, MAINLOCK, 0, 1))
1524	<	tryAwaitMainLock();
1525	<	try {
1526	<	if (workQueues == null)
1527	<	workQueues = new WorkQueue[submitMask + 1];
1528	<	} finally {
1529	<	if (!U.compareAndSwapInt(this, MAINLOCK, 1, 0)) {
1530	<	mainLock = 0;
1531	<	synchronized (this) { notifyAll(); };
1412	>	if (!tryTerminate(false, false) && w != null && w.array != null) {
1413	>	w.cancelAll(); // cancel remaining tasks
1414	>	WorkQueue[] ws; WorkQueue v; Thread p; int u, i, e;
1415	>	while ((u = (int)((c = ctl) >>> 32)) < 0 && (e = (int)c) >= 0) {
1416	>	if (e > 0) { // activate or create replacement
1417	>	if ((ws = workQueues) == null \|\|
1418	>	(i = e & SMASK) >= ws.length \|\|
1419	>	(v = ws[i]) == null)
1420	>	break;
1421	>	long nc = (((long)(v.nextWait & E_MASK)) \|
1422	>	((long)(u + UAC_UNIT) << 32));
1423	>	if (v.eventCount != (e \| INT_SIGN))
1424	>	break;
1425	>	if (U.compareAndSwapLong(this, CTL, c, nc)) {
1426	>	v.eventCount = (e + E_SEQ) & E_MASK;
1427	>	if ((p = v.parker) != null)
1428	>	U.unpark(p);
1429	>	break;
1430		}
1431		}
1432	<	}
1433	<	else if ((q = ws[k]) == null) { // create new queue
1434	<	WorkQueue nq = new WorkQueue(this, null, SHARED_QUEUE);
1435	<	while (!U.compareAndSwapInt(this, MAINLOCK, 0, 1))
1538	<	tryAwaitMainLock();
1539	<	try {
1540	<	int rs = runState; // to update seq
1541	<	if (ws == workQueues && ws[k] == null) {
1542	<	ws[k] = nq;
1543	<	runState = ((rs & SHUTDOWN) \| ((rs + 2) & ~SHUTDOWN));
1544	<	}
1545	<	} finally {
1546	<	if (!U.compareAndSwapInt(this, MAINLOCK, 1, 0)) {
1547	<	mainLock = 0;
1548	<	synchronized (this) { notifyAll(); };
1549	<	}
1432	>	else {
1433	>	if ((short)u < 0)
1434	>	tryAddWorker();
1435	>	break;
1436		}
1437		}
1552	–	else if (q.trySharedPush(task)) {
1553	–	signalWork();
1554	–	return;
1555	–	}
1556	–	else if (m > 1) { // move to a different index
1557	–	r ^= r << 13; // same xorshift as WorkQueues
1558	–	r ^= r >>> 17;
1559	–	s.seed = r ^= r << 5;
1560	–	}
1561	–	else
1562	–	Thread.yield(); // yield if no alternatives
1438		}
1439	+	if (ex == null) // help clean refs on way out
1440	+	ForkJoinTask.helpExpungeStaleExceptions();
1441	+	else // rethrow
1442	+	ForkJoinTask.rethrow(ex);
1443		}
1444
1445	+	// Submissions
1446	+
1447		/**
1448	<	* Submits the given (non-null) task to the common pool, if possible.
1448	>	* Per-thread records for threads that submit to pools. Currently
1449	>	* holds only pseudo-random seed / index that is used to choose
1450	>	* submission queues in method externalPush. In the future, this may
1451	>	* also incorporate a means to implement different task rejection
1452	>	* and resubmission policies.
1453	>	*
1454	>	* Seeds for submitters and workers/workQueues work in basically
1455	>	* the same way but are initialized and updated using slightly
1456	>	* different mechanics. Both are initialized using the same
1457	>	* approach as in class ThreadLocal, where successive values are
1458	>	* unlikely to collide with previous values. Seeds are then
1459	>	* randomly modified upon collisions using xorshifts, which
1460	>	* requires a non-zero seed.
1461		*/
1462	<	static void submitToCommonPool(ForkJoinTask<?> task) {
1463	<	ForkJoinPool p;
1464	<	if ((p = commonPool) == null)
1572	<	throw new RejectedExecutionException("Common Pool Unavailable");
1573	<	p.doSubmit(task);
1462	>	static final class Submitter {
1463	>	int seed;
1464	>	Submitter(int s) { seed = s; }
1465		}
1466
1467		/**
1468	<	* Returns true if the given task was submitted to common pool
1469	<	* and has not yet commenced execution, and is available for
1470	<	* removal according to execution policies; if so removing the
1471	<	* submission from the pool.
1468	>	* Unless shutting down, adds the given task to a submission queue
1469	>	* at submitter's current queue index (modulo submission
1470	>	* range). Only the most common path is directly handled in this
1471	>	* method. All others are relayed to fullExternalPush.
1472		*
1473	<	* @param task the task
1583	<	* @return true if successful
1473	>	* @param task the task. Caller must ensure non-null.
1474		*/
1475	<	static boolean tryUnsubmitFromCommonPool(ForkJoinTask<?> task) {
1476	<	// If not oversaturating platform, peek, looking for task and
1477	<	// eligibility before using trySharedUnpush to actually take
1478	<	// it under lock
1479	<	ForkJoinPool p; WorkQueue[] ws; WorkQueue w, q;
1480	<	ForkJoinTask<?>[] a; int ac, s, m;
1481	<	if ((p = commonPool) != null && (ws = p.workQueues) != null) {
1482	<	int k = submitters.get().seed & p.submitMask & SQMASK;
1483	<	if ((m = ws.length - 1) >= k && (q = ws[k]) != null &&
1484	<	(ac = (int)(p.ctl >> AC_SHIFT)) <= 0) {
1485	<	if (ac == 0) { // double check if all workers active
1486	<	for (int i = 1; i <= m; i += 2) {
1487	<	if ((w = ws[i]) != null && w.parker != null) {
1488	<	ac = -1;
1489	<	break;
1490	<	}
1491	<	}
1602	<	}
1603	<	return (ac < 0 && (a = q.array) != null &&
1604	<	(s = q.top - 1) - q.base >= 0 &&
1605	<	s >= 0 && s < a.length &&
1606	<	a[s] == task &&
1607	<	q.trySharedUnpush(task));
1475	>	final void externalPush(ForkJoinTask<?> task) {
1476	>	Submitter z = submitters.get();
1477	>	WorkQueue q; int r, m, s, n, am; ForkJoinTask<?>[] a;
1478	>	int ps = plock;
1479	>	WorkQueue[] ws = workQueues;
1480	>	if (z != null && ps > 0 && ws != null && (m = (ws.length - 1)) >= 0 &&
1481	>	(q = ws[m & (r = z.seed) & SQMASK]) != null && r != 0 &&
1482	>	U.compareAndSwapInt(q, QLOCK, 0, 1)) { // lock
1483	>	if ((a = q.array) != null &&
1484	>	(am = a.length - 1) > (n = (s = q.top) - q.base)) {
1485	>	int j = ((am & s) << ASHIFT) + ABASE;
1486	>	U.putOrderedObject(a, j, task);
1487	>	q.top = s + 1; // push on to deque
1488	>	q.qlock = 0;
1489	>	if (n <= 1)
1490	>	signalWork(ws, q);
1491	>	return;
1492		}
1493	+	q.qlock = 0;
1494		}
1495	<	return false;
1495	>	fullExternalPush(task);
1496		}
1497
1498		/**
1499	<	* Tries to pop and run a task within same computation from common pool
1500	<	*/
1501	<	static void popAndExecCCFromCommonPool(CountedCompleter<?> cc) {
1502	<	ForkJoinPool p; WorkQueue[] ws; WorkQueue q, w; int m, ac;
1503	<	CountedCompleter<?> par, task;
1504	<	if ((p = commonPool) != null && (ws = p.workQueues) != null) {
1505	<	while ((par = cc.completer) != null) // find root
1506	<	cc = par;
1507	<	int k = submitters.get().seed & p.submitMask & SQMASK;
1508	<	if ((m = ws.length - 1) >= k && (q = ws[k]) != null &&
1509	<	(ac = (int)(p.ctl >> AC_SHIFT)) <= 0) {
1510	<	if (ac == 0) {
1511	<	for (int i = 1; i <= m; i += 2) {
1512	<	if ((w = ws[i]) != null && w.parker != null) {
1513	<	ac = -1;
1514	<	break;
1499	>	* Full version of externalPush. This method is called, among
1500	>	* other times, upon the first submission of the first task to the
1501	>	* pool, so must perform secondary initialization. It also
1502	>	* detects first submission by an external thread by looking up
1503	>	* its ThreadLocal, and creates a new shared queue if the one at
1504	>	* index if empty or contended. The plock lock body must be
1505	>	* exception-free (so no try/finally) so we optimistically
1506	>	* allocate new queues outside the lock and throw them away if
1507	>	* (very rarely) not needed.
1508	>	*
1509	>	* Secondary initialization occurs when plock is zero, to create
1510	>	* workQueue array and set plock to a valid value. This lock body
1511	>	* must also be exception-free. Because the plock seq value can
1512	>	* eventually wrap around zero, this method harmlessly fails to
1513	>	* reinitialize if workQueues exists, while still advancing plock.
1514	>	*/
1515	>	private void fullExternalPush(ForkJoinTask<?> task) {
1516	>	int r = 0; // random index seed
1517	>	for (Submitter z = submitters.get();;) {
1518	>	WorkQueue[] ws; WorkQueue q; int ps, m, k;
1519	>	if (z == null) {
1520	>	if (U.compareAndSwapInt(this, INDEXSEED, r = indexSeed,
1521	>	r += SEED_INCREMENT) && r != 0)
1522	>	submitters.set(z = new Submitter(r));
1523	>	}
1524	>	else if (r == 0) { // move to a different index
1525	>	r = z.seed;
1526	>	r ^= r << 13; // same xorshift as WorkQueues
1527	>	r ^= r >>> 17;
1528	>	z.seed = r ^= (r << 5);
1529	>	}
1530	>	if ((ps = plock) < 0)
1531	>	throw new RejectedExecutionException();
1532	>	else if (ps == 0 \|\| (ws = workQueues) == null \|\|
1533	>	(m = ws.length - 1) < 0) { // initialize workQueues
1534	>	int p = parallelism; // find power of two table size
1535	>	int n = (p > 1) ? p - 1 : 1; // ensure at least 2 slots
1536	>	n \|= n >>> 1; n \|= n >>> 2; n \|= n >>> 4;
1537	>	n \|= n >>> 8; n \|= n >>> 16; n = (n + 1) << 1;
1538	>	WorkQueue[] nws = ((ws = workQueues) == null \|\| ws.length == 0 ?
1539	>	new WorkQueue[n] : null);
1540	>	if (((ps = plock) & PL_LOCK) != 0 \|\|
1541	>	!U.compareAndSwapInt(this, PLOCK, ps, ps += PL_LOCK))
1542	>	ps = acquirePlock();
1543	>	if (((ws = workQueues) == null \|\| ws.length == 0) && nws != null)
1544	>	workQueues = nws;
1545	>	int nps = (ps & SHUTDOWN) \| ((ps + PL_LOCK) & ~SHUTDOWN);
1546	>	if (!U.compareAndSwapInt(this, PLOCK, ps, nps))
1547	>	releasePlock(nps);
1548	>	}
1549	>	else if ((q = ws[k = r & m & SQMASK]) != null) {
1550	>	if (q.qlock == 0 && U.compareAndSwapInt(q, QLOCK, 0, 1)) {
1551	>	ForkJoinTask<?>[] a = q.array;
1552	>	int s = q.top;
1553	>	boolean submitted = false;
1554	>	try { // locked version of push
1555	>	if ((a != null && a.length > s + 1 - q.base) \|\|
1556	>	(a = q.growArray()) != null) { // must presize
1557	>	int j = (((a.length - 1) & s) << ASHIFT) + ABASE;
1558	>	U.putOrderedObject(a, j, task);
1559	>	q.top = s + 1;
1560	>	submitted = true;
1561		}
1562	+	} finally {
1563	+	q.qlock = 0; // unlock
1564		}
1565	<	}
1566	<	if (ac < 0 && q.top - q.base > 0 &&
1567	<	(task = q.sharedPopCC(cc)) != null)
1568	<	task.exec();
1565	>	if (submitted) {
1566	>	signalWork(ws, q);
1567	>	return;
1568	>	}
1569	>	}
1570	>	r = 0; // move on failure
1571	>	}
1572	>	else if (((ps = plock) & PL_LOCK) == 0) { // create new queue
1573	>	q = new WorkQueue(this, null, SHARED_QUEUE, r);
1574	>	q.poolIndex = (short)k;
1575	>	if (((ps = plock) & PL_LOCK) != 0 \|\|
1576	>	!U.compareAndSwapInt(this, PLOCK, ps, ps += PL_LOCK))
1577	>	ps = acquirePlock();
1578	>	if ((ws = workQueues) != null && k < ws.length && ws[k] == null)
1579	>	ws[k] = q;
1580	>	int nps = (ps & SHUTDOWN) \| ((ps + PL_LOCK) & ~SHUTDOWN);
1581	>	if (!U.compareAndSwapInt(this, PLOCK, ps, nps))
1582	>	releasePlock(nps);
1583		}
1584	+	else
1585	+	r = 0;
1586		}
1587		}
1588
#	Line 1644 \| Line 1593 \| public class ForkJoinPool extends Abstra
1593		*/
1594		final void incrementActiveCount() {
1595		long c;
1596	<	do {} while (!U.compareAndSwapLong(this, CTL, c = ctl, c + AC_UNIT));
1596	>	do {} while (!U.compareAndSwapLong
1597	>	(this, CTL, c = ctl, ((c & ~AC_MASK) \|
1598	>	((c & AC_MASK) + AC_UNIT))));
1599		}
1600
1601		/**
1602	<	* Tries to create one or activate one or more workers if too few are active.
1602	>	* Tries to create or activate a worker if too few are active.
1603	>	*
1604	>	* @param ws the worker array to use to find signallees
1605	>	* @param q if non-null, the queue holding tasks to be processed
1606		*/
1607	<	final void signalWork() {
1608	<	long c; int u;
1609	<	while ((u = (int)((c = ctl) >>> 32)) < 0) { // too few active
1610	<	WorkQueue[] ws = workQueues; int e, i; WorkQueue w; Thread p;
1611	<	if ((e = (int)c) > 0) { // at least one waiting
1612	<	if (ws != null && (i = e & SMASK) < ws.length &&
1613	<	(w = ws[i]) != null && w.eventCount == (e \| INT_SIGN)) {
1614	<	long nc = (((long)(w.nextWait & E_MASK)) \|
1615	<	((long)(u + UAC_UNIT) << 32));
1662	<	if (U.compareAndSwapLong(this, CTL, c, nc)) {
1663	<	w.eventCount = (e + E_SEQ) & E_MASK;
1664	<	if ((p = w.parker) != null)
1665	<	U.unpark(p); // activate and release
1666	<	break;
1667	<	}
1668	<	}
1669	<	else
1670	<	break;
1607	>	final void signalWork(WorkQueue[] ws, WorkQueue q) {
1608	>	for (;;) {
1609	>	long c; int e, u, i; WorkQueue w; Thread p;
1610	>	if ((u = (int)((c = ctl) >>> 32)) >= 0)
1611	>	break;
1612	>	if ((e = (int)c) <= 0) {
1613	>	if ((short)u < 0)
1614	>	tryAddWorker();
1615	>	break;
1616		}
1617	<	else if (e == 0 && (u & SHORT_SIGN) != 0) { // too few total
1618	<	long nc = (long)(((u + UTC_UNIT) & UTC_MASK) \|
1619	<	((u + UAC_UNIT) & UAC_MASK)) << 32;
1620	<	if (U.compareAndSwapLong(this, CTL, c, nc)) {
1621	<	addWorker();
1622	<	break;
1623	<	}
1617	>	if (ws == null \|\| ws.length <= (i = e & SMASK) \|\|
1618	>	(w = ws[i]) == null)
1619	>	break;
1620	>	long nc = (((long)(w.nextWait & E_MASK)) \|
1621	>	((long)(u + UAC_UNIT)) << 32);
1622	>	int ne = (e + E_SEQ) & E_MASK;
1623	>	if (w.eventCount == (e \| INT_SIGN) &&
1624	>	U.compareAndSwapLong(this, CTL, c, nc)) {
1625	>	w.eventCount = ne;
1626	>	if ((p = w.parker) != null)
1627	>	U.unpark(p);
1628	>	break;
1629		}
1630	<	else
1630	>	if (q != null && q.base >= q.top)
1631		break;
1632		}
1633		}
#	Line 1688 \| Line 1638 \| public class ForkJoinPool extends Abstra
1638		* Top-level runloop for workers, called by ForkJoinWorkerThread.run.
1639		*/
1640		final void runWorker(WorkQueue w) {
1641	<	w.growArray(false); // initialize queue array in this thread
1642	<	do { w.runTask(scan(w)); } while (w.runState >= 0);
1641	>	w.growArray(); // allocate queue
1642	>	for (int r = w.hint; scan(w, r) == 0; ) {
1643	>	r ^= r << 13; r ^= r >>> 17; r ^= r << 5; // xorshift
1644	>	}
1645		}
1646
1647		/**
1648	<	* Scans for and, if found, returns one task, else possibly
1648	>	* Scans for and, if found, runs one task, else possibly
1649		* inactivates the worker. This method operates on single reads of
1650		* volatile state and is designed to be re-invoked continuously,
1651		* in part because it returns upon detecting inconsistencies,
1652		* contention, or state changes that indicate possible success on
1653		* re-invocation.
1654		*
1655	<	* The scan searches for tasks across a random permutation of
1656	<	* queues (starting at a random index and stepping by a random
1657	<	* relative prime, checking each at least once). The scan
1658	<	* terminates upon either finding a non-empty queue, or completing
1659	<	* the sweep. If the worker is not inactivated, it takes and
1660	<	* returns a task from this queue. On failure to find a task, we
1661	<	* take one of the following actions, after which the caller will
1662	<	* retry calling this method unless terminated.
1663	<	*
1712	<	* * If pool is terminating, terminate the worker.
1713	<	*
1714	<	* * If not a complete sweep, try to release a waiting worker. If
1715	<	* the scan terminated because the worker is inactivated, then the
1716	<	* released worker will often be the calling worker, and it can
1717	<	* succeed obtaining a task on the next call. Or maybe it is
1718	<	* another worker, but with same net effect. Releasing in other
1719	<	* cases as well ensures that we have enough workers running.
1720	<	*
1721	<	* * If not already enqueued, try to inactivate and enqueue the
1722	<	* worker on wait queue. Or, if inactivating has caused the pool
1723	<	* to be quiescent, relay to idleAwaitWork to check for
1724	<	* termination and possibly shrink pool.
1725	<	*
1726	<	* * If already inactive, and the caller has run a task since the
1727	<	* last empty scan, return (to allow rescan) unless others are
1728	<	* also inactivated. Field WorkQueue.rescans counts down on each
1729	<	* scan to ensure eventual inactivation and blocking.
1730	<	*
1731	<	* * If already enqueued and none of the above apply, park
1732	<	* awaiting signal,
1655	>	* The scan searches for tasks across queues starting at a random
1656	>	* index, checking each at least twice. The scan terminates upon
1657	>	* either finding a non-empty queue, or completing the sweep. If
1658	>	* the worker is not inactivated, it takes and runs a task from
1659	>	* this queue. Otherwise, if not activated, it tries to activate
1660	>	* itself or some other worker by signalling. On failure to find a
1661	>	* task, returns (for retry) if pool state may have changed during
1662	>	* an empty scan, or tries to inactivate if active, else possibly
1663	>	* blocks or terminates via method awaitWork.
1664		*
1665		* @param w the worker (via its WorkQueue)
1666	<	* @return a task or null if none found
1666	>	* @param r a random seed
1667	>	* @return worker qlock status if would have waited, else 0
1668		*/
1669	<	private final ForkJoinTask<?> scan(WorkQueue w) {
1670	<	WorkQueue[] ws; // first update random seed
1671	<	int r = w.seed; r ^= r << 13; r ^= r >>> 17; w.seed = r ^= r << 5;
1672	<	int rs = runState, m; // volatile read order matters
1673	<	if ((ws = workQueues) != null && (m = ws.length - 1) > 0) {
1674	<	int ec = w.eventCount; // ec is negative if inactive
1675	<	int step = (r >>> 16) \| 1; // relative prime
1676	<	for (int j = (m + 1) << 2; ; r += step) {
1677	<	WorkQueue q; ForkJoinTask<?> t; ForkJoinTask<?>[] a; int b;
1678	<	if ((q = ws[r & m]) != null && (b = q.base) - q.top < 0 &&
1679	<	(a = q.array) != null) { // probably nonempty
1680	<	int i = (((a.length - 1) & b) << ASHIFT) + ABASE;
1681	<	t = (ForkJoinTask<?>)U.getObjectVolatile(a, i);
1682	<	if (q.base == b && ec >= 0 && t != null &&
1683	<	U.compareAndSwapObject(a, i, t, null)) {
1684	<	if (q.top - (q.base = b + 1) > 0)
1685	<	signalWork(); // help pushes signal
1686	<	return t;
1687	<	}
1688	<	else if (ec < 0 \|\| j <= m) {
1757	<	rs = 0; // mark scan as imcomplete
1758	<	break; // caller can retry after release
1669	>	private final int scan(WorkQueue w, int r) {
1670	>	WorkQueue[] ws; int m;
1671	>	long c = ctl; // for consistency check
1672	>	if ((ws = workQueues) != null && (m = ws.length - 1) >= 0 && w != null) {
1673	>	for (int j = m + m + 1, ec = w.eventCount;;) {
1674	>	WorkQueue q; int b, e; ForkJoinTask<?>[] a; ForkJoinTask<?> t;
1675	>	if ((q = ws[(r - j) & m]) != null &&
1676	>	(b = q.base) - q.top < 0 && (a = q.array) != null) {
1677	>	long i = (((a.length - 1) & b) << ASHIFT) + ABASE;
1678	>	if ((t = ((ForkJoinTask<?>)
1679	>	U.getObjectVolatile(a, i))) != null) {
1680	>	if (ec < 0)
1681	>	helpRelease(c, ws, w, q, b);
1682	>	else if (q.base == b &&
1683	>	U.compareAndSwapObject(a, i, t, null)) {
1684	>	U.putOrderedInt(q, QBASE, b + 1);
1685	>	if ((b + 1) - q.top < 0)
1686	>	signalWork(ws, q);
1687	>	w.runTask(t);
1688	>	}
1689		}
1690	+	break;
1691		}
1692	<	if (--j < 0)
1692	>	else if (--j < 0) {
1693	>	if ((ec \| (e = (int)c)) < 0) // inactive or terminating
1694	>	return awaitWork(w, c, ec);
1695	>	else if (ctl == c) { // try to inactivate and enqueue
1696	>	long nc = (long)ec \| ((c - AC_UNIT) & (AC_MASK\|TC_MASK));
1697	>	w.nextWait = e;
1698	>	w.eventCount = ec \| INT_SIGN;
1699	>	if (!U.compareAndSwapLong(this, CTL, c, nc))
1700	>	w.eventCount = ec; // back out
1701	>	}
1702		break;
1703	+	}
1704		}
1705	+	}
1706	+	return 0;
1707	+	}
1708
1709	<	long c = ctl; int e = (int)c, a = (int)(c >> AC_SHIFT), nr, ns;
1710	<	if (e < 0) // decode ctl on empty scan
1711	<	w.runState = -1; // pool is terminating
1712	<	else if (rs == 0 \|\| rs != runState) { // incomplete scan
1713	<	WorkQueue v; Thread p; // try to release a waiter
1714	<	if (e > 0 && a < 0 && w.eventCount == ec &&
1715	<	(v = ws[e & m]) != null && v.eventCount == (e \| INT_SIGN)) {
1716	<	long nc = ((long)(v.nextWait & E_MASK) \|
1717	<	((c + AC_UNIT) & (AC_MASK\|TC_MASK)));
1718	<	if (ctl == c && U.compareAndSwapLong(this, CTL, c, nc)) {
1719	<	v.eventCount = (e + E_SEQ) & E_MASK;
1720	<	if ((p = v.parker) != null)
1721	<	U.unpark(p);
1722	<	}
1723	<	}
1709	>	/**
1710	>	* A continuation of scan(), possibly blocking or terminating
1711	>	* worker w. Returns without blocking if pool state has apparently
1712	>	* changed since last invocation. Also, if inactivating w has
1713	>	* caused the pool to become quiescent, checks for pool
1714	>	* termination, and, so long as this is not the only worker, waits
1715	>	* for event for up to a given duration. On timeout, if ctl has
1716	>	* not changed, terminates the worker, which will in turn wake up
1717	>	* another worker to possibly repeat this process.
1718	>	*
1719	>	* @param w the calling worker
1720	>	* @param c the ctl value on entry to scan
1721	>	* @param ec the worker's eventCount on entry to scan
1722	>	*/
1723	>	private final int awaitWork(WorkQueue w, long c, int ec) {
1724	>	int stat, ns; long parkTime, deadline;
1725	>	if ((stat = w.qlock) >= 0 && w.eventCount == ec && ctl == c &&
1726	>	!Thread.interrupted()) {
1727	>	int e = (int)c;
1728	>	int u = (int)(c >>> 32);
1729	>	int d = (u >> UAC_SHIFT) + parallelism; // active count
1730	>
1731	>	if (e < 0 \|\| (d <= 0 && tryTerminate(false, false)))
1732	>	stat = w.qlock = -1; // pool is terminating
1733	>	else if ((ns = w.nsteals) != 0) { // collect steals and retry
1734	>	long sc;
1735	>	w.nsteals = 0;
1736	>	do {} while (!U.compareAndSwapLong(this, STEALCOUNT,
1737	>	sc = stealCount, sc + ns));
1738		}
1739	<	else if (ec >= 0) { // try to enqueue/inactivate
1740	<	long nc = (long)ec \| ((c - AC_UNIT) & (AC_MASK\|TC_MASK));
1741	<	w.nextWait = e;
1742	<	w.eventCount = ec \| INT_SIGN; // mark as inactive
1743	<	if (ctl != c \|\| !U.compareAndSwapLong(this, CTL, c, nc))
1744	<	w.eventCount = ec; // unmark on CAS failure
1745	<	else {
1746	<	if ((ns = w.nsteals) != 0) {
1747	<	w.nsteals = 0; // set rescans if ran task
1790	<	w.rescans = (a > 0) ? 0 : a + parallelism;
1791	<	w.totalSteals += ns;
1792	<	}
1793	<	if (a == 1 - parallelism) // quiescent
1794	<	idleAwaitWork(w, nc, c);
1739	>	else {
1740	>	long pc = ((d > 0 \|\| ec != (e \| INT_SIGN)) ? 0L :
1741	>	((long)(w.nextWait & E_MASK)) \| // ctl to restore
1742	>	((long)(u + UAC_UNIT)) << 32);
1743	>	if (pc != 0L) { // timed wait if last waiter
1744	>	int dc = -(short)(c >>> TC_SHIFT);
1745	>	parkTime = (dc < 0 ? FAST_IDLE_TIMEOUT:
1746	>	(dc + 1) * IDLE_TIMEOUT);
1747	>	deadline = System.nanoTime() + parkTime - TIMEOUT_SLOP;
1748		}
1749	<	}
1750	<	else if (w.eventCount < 0) { // already queued
1751	<	int ac = a + parallelism;
1799	<	if ((nr = w.rescans) > 0) // continue rescanning
1800	<	w.rescans = (ac < nr) ? ac : nr - 1;
1801	<	else if (((w.seed >>> 16) & ac) == 0) { // randomize park
1802	<	Thread.interrupted(); // clear status
1749	>	else
1750	>	parkTime = deadline = 0L;
1751	>	if (w.eventCount == ec && ctl == c) {
1752		Thread wt = Thread.currentThread();
1753		U.putObject(wt, PARKBLOCKER, this);
1754		w.parker = wt; // emulate LockSupport.park
1755	<	if (w.eventCount < 0) // recheck
1756	<	U.park(false, 0L);
1755	>	if (w.eventCount == ec && ctl == c)
1756	>	U.park(false, parkTime); // must recheck before park
1757		w.parker = null;
1758		U.putObject(wt, PARKBLOCKER, null);
1759	+	if (parkTime != 0L && ctl == c &&
1760	+	deadline - System.nanoTime() <= 0L &&
1761	+	U.compareAndSwapLong(this, CTL, c, pc))
1762	+	stat = w.qlock = -1; // shrink pool
1763		}
1764		}
1765		}
1766	<	return null;
1766	>	return stat;
1767		}
1768
1769		/**
1770	<	* If inactivating worker w has caused the pool to become
1771	<	* quiescent, checks for pool termination, and, so long as this is
1772	<	* not the only worker, waits for event for up to a given
1773	<	* duration. On timeout, if ctl has not changed, terminates the
1774	<	* worker, which will in turn wake up another worker to possibly
1775	<	* repeat this process.
1776	<	*
1777	<	* @param w the calling worker
1778	<	* @param currentCtl the ctl value triggering possible quiescence
1779	<	* @param prevCtl the ctl value to restore if thread is terminated
1780	<	*/
1781	<	private void idleAwaitWork(WorkQueue w, long currentCtl, long prevCtl) {
1782	<	if (w.eventCount < 0 && !tryTerminate(false, false) &&
1783	<	(int)prevCtl != 0 && !hasQueuedSubmissions() && ctl == currentCtl) {
1784	<	int dc = -(short)(currentCtl >>> TC_SHIFT);
1785	<	long parkTime = dc < 0 ? FAST_IDLE_TIMEOUT: (dc + 1) * IDLE_TIMEOUT;
1786	<	long deadline = System.nanoTime() + parkTime - 100000L; // 1ms slop
1787	<	Thread wt = Thread.currentThread();
1788	<	while (ctl == currentCtl) {
1789	<	Thread.interrupted(); // timed variant of version in scan()
1837	<	U.putObject(wt, PARKBLOCKER, this);
1838	<	w.parker = wt;
1839	<	if (ctl == currentCtl)
1840	<	U.park(false, parkTime);
1841	<	w.parker = null;
1842	<	U.putObject(wt, PARKBLOCKER, null);
1843	<	if (ctl != currentCtl)
1844	<	break;
1845	<	if (deadline - System.nanoTime() <= 0L &&
1846	<	U.compareAndSwapLong(this, CTL, currentCtl, prevCtl)) {
1847	<	w.eventCount = (w.eventCount + E_SEQ) \| E_MASK;
1848	<	w.runState = -1; // shrink
1849	<	break;
1850	<	}
1770	>	* Possibly releases (signals) a worker. Called only from scan()
1771	>	* when a worker with apparently inactive status finds a non-empty
1772	>	* queue. This requires revalidating all of the associated state
1773	>	* from caller.
1774	>	*/
1775	>	private final void helpRelease(long c, WorkQueue[] ws, WorkQueue w,
1776	>	WorkQueue q, int b) {
1777	>	WorkQueue v; int e, i; Thread p;
1778	>	if (w != null && w.eventCount < 0 && (e = (int)c) > 0 &&
1779	>	ws != null && ws.length > (i = e & SMASK) &&
1780	>	(v = ws[i]) != null && ctl == c) {
1781	>	long nc = (((long)(v.nextWait & E_MASK)) \|
1782	>	((long)((int)(c >>> 32) + UAC_UNIT)) << 32);
1783	>	int ne = (e + E_SEQ) & E_MASK;
1784	>	if (q != null && q.base == b && w.eventCount < 0 &&
1785	>	v.eventCount == (e \| INT_SIGN) &&
1786	>	U.compareAndSwapLong(this, CTL, c, nc)) {
1787	>	v.eventCount = ne;
1788	>	if ((p = v.parker) != null)
1789	>	U.unpark(p);
1790		}
1791		}
1792		}
#	Line 1872 \| Line 1811 \| public class ForkJoinPool extends Abstra
1811		*/
1812		private int tryHelpStealer(WorkQueue joiner, ForkJoinTask<?> task) {
1813		int stat = 0, steps = 0; // bound to avoid cycles
1814	<	if (joiner != null && task != null) { // hoist null checks
1814	>	if (task != null && joiner != null &&
1815	>	joiner.base - joiner.top >= 0) { // hoist checks
1816		restart: for (;;) {
1817		ForkJoinTask<?> subtask = task; // current target
1818		for (WorkQueue j = joiner, v;;) { // v is stealer of subtask
#	Line 1883 \| Line 1823 \| public class ForkJoinPool extends Abstra
1823		}
1824		if ((ws = workQueues) == null \|\| (m = ws.length - 1) <= 0)
1825		break restart; // shutting down
1826	<	if ((v = ws[h = (j.stealHint \| 1) & m]) == null \|\|
1826	>	if ((v = ws[h = (j.hint \| 1) & m]) == null \|\|
1827		v.currentSteal != subtask) {
1828		for (int origin = h;;) { // find stealer
1829		if (((h = (h + 2) & m) & 15) == 1 &&
#	Line 1891 \| Line 1831 \| public class ForkJoinPool extends Abstra
1831		continue restart; // occasional staleness check
1832		if ((v = ws[h]) != null &&
1833		v.currentSteal == subtask) {
1834	<	j.stealHint = h; // save hint
1834	>	j.hint = h; // save hint
1835		break;
1836		}
1837		if (h == origin)
#	Line 1899 \| Line 1839 \| public class ForkJoinPool extends Abstra
1839		}
1840		}
1841		for (;;) { // help stealer or descend to its stealer
1842	<	ForkJoinTask[] a; int b;
1842	>	ForkJoinTask[] a; int b;
1843		if (subtask.status < 0) // surround probes with
1844		continue restart; // consistency checks
1845		if ((b = v.base) - v.top < 0 && (a = v.array) != null) {
#	Line 1910 \| Line 1850 \| public class ForkJoinPool extends Abstra
1850		v.currentSteal != subtask)
1851		continue restart; // stale
1852		stat = 1; // apparent progress
1853	<	if (t != null && v.base == b &&
1854	<	U.compareAndSwapObject(a, i, t, null)) {
1855	<	v.base = b + 1; // help stealer
1856	<	joiner.runSubtask(t);
1853	>	if (v.base == b) {
1854	>	if (t == null)
1855	>	break restart;
1856	>	if (U.compareAndSwapObject(a, i, t, null)) {
1857	>	U.putOrderedInt(v, QBASE, b + 1);
1858	>	ForkJoinTask<?> ps = joiner.currentSteal;
1859	>	int jt = joiner.top;
1860	>	do {
1861	>	joiner.currentSteal = t;
1862	>	t.doExec(); // clear local tasks too
1863	>	} while (task.status >= 0 &&
1864	>	joiner.top != jt &&
1865	>	(t = joiner.pop()) != null);
1866	>	joiner.currentSteal = ps;
1867	>	break restart;
1868	>	}
1869		}
1918	–	else if (v.base == b && ++steps == MAX_HELP)
1919	–	break restart; // v apparently stalled
1870		}
1871		else { // empty -- try to descend
1872		ForkJoinTask<?> next = v.currentJoin;
#	Line 1939 \| Line 1889 \| public class ForkJoinPool extends Abstra
1889		}
1890
1891		/**
1892	<	* If task is at base of some steal queue, steals and executes it.
1892	>	* Analog of tryHelpStealer for CountedCompleters. Tries to steal
1893	>	* and run tasks within the target's computation.
1894		*
1895	<	* @param joiner the joining worker
1945	<	* @param task the task
1895	>	* @param task the task to join
1896		*/
1897	<	private void tryPollForAndExec(WorkQueue joiner, ForkJoinTask<?> task) {
1898	<	WorkQueue[] ws;
1899	<	if ((ws = workQueues) != null) {
1900	<	for (int j = 1; j < ws.length && task.status >= 0; j += 2) {
1901	<	WorkQueue q = ws[j];
1902	<	if (q != null && q.pollFor(task)) {
1903	<	joiner.runSubtask(task);
1897	>	private int helpComplete(WorkQueue joiner, CountedCompleter<?> task) {
1898	>	WorkQueue[] ws; int m;
1899	>	int s = 0;
1900	>	if ((ws = workQueues) != null && (m = ws.length - 1) >= 0 &&
1901	>	joiner != null && task != null) {
1902	>	int j = joiner.poolIndex;
1903	>	int scans = m + m + 1;
1904	>	long c = 0L; // for stability check
1905	>	for (int k = scans; ; j += 2) {
1906	>	WorkQueue q;
1907	>	if ((s = task.status) < 0)
1908		break;
1909	+	else if (joiner.internalPopAndExecCC(task))
1910	+	k = scans;
1911	+	else if ((s = task.status) < 0)
1912	+	break;
1913	+	else if ((q = ws[j & m]) != null && q.pollAndExecCC(task))
1914	+	k = scans;
1915	+	else if (--k < 0) {
1916	+	if (c == (c = ctl))
1917	+	break;
1918	+	k = scans;
1919		}
1920		}
1921		}
1922	+	return s;
1923		}
1924
1925		/**
1926		* Tries to decrement active count (sometimes implicitly) and
1927		* possibly release or create a compensating worker in preparation
1928		* for blocking. Fails on contention or termination. Otherwise,
1929	<	* adds a new thread if no idle workers are available and either
1930	<	* pool would become completely starved or: (at least half
1931	<	* starved, and fewer than 50% spares exist, and there is at least
1932	<	* one task apparently available). Even though the availability
1968	<	* check requires a full scan, it is worthwhile in reducing false
1969	<	* alarms.
1970	<	*
1971	<	* @param task if non-null, a task being waited for
1972	<	* @param blocker if non-null, a blocker being waited for
1973	<	* @return true if the caller can block, else should recheck and retry
1929	>	* adds a new thread if no idle workers are available and pool
1930	>	* may become starved.
1931	>	*
1932	>	* @param c the assumed ctl value
1933		*/
1934	<	final boolean tryCompensate(ForkJoinTask<?> task, ManagedBlocker blocker) {
1976	<	int pc = parallelism, e;
1977	<	long c = ctl;
1934	>	final boolean tryCompensate(long c) {
1935		WorkQueue[] ws = workQueues;
1936	<	if ((e = (int)c) >= 0 && ws != null) {
1937	<	int u, a, ac, hc;
1938	<	int tc = (short)((u = (int)(c >>> 32)) >>> UTC_SHIFT) + pc;
1939	<	boolean replace = false;
1940	<	if ((a = u >> UAC_SHIFT) <= 0) {
1941	<	if ((ac = a + pc) <= 1)
1942	<	replace = true;
1943	<	else if ((e > 0 \|\| (task != null &&
1944	<	ac <= (hc = pc >>> 1) && tc < pc + hc))) {
1945	<	WorkQueue w;
1946	<	for (int j = 0; j < ws.length; ++j) {
1947	<	if ((w = ws[j]) != null && !w.isEmpty()) {
1948	<	replace = true;
1949	<	break; // in compensation range and tasks available
1950	<	}
1951	<	}
1952	<	}
1936	>	int pc = parallelism, e = (int)c, m, tc;
1937	>	if (ws != null && (m = ws.length - 1) >= 0 && e >= 0 && ctl == c) {
1938	>	WorkQueue w = ws[e & m];
1939	>	if (e != 0 && w != null) {
1940	>	Thread p;
1941	>	long nc = ((long)(w.nextWait & E_MASK) \|
1942	>	(c & (AC_MASK\|TC_MASK)));
1943	>	int ne = (e + E_SEQ) & E_MASK;
1944	>	if (w.eventCount == (e \| INT_SIGN) &&
1945	>	U.compareAndSwapLong(this, CTL, c, nc)) {
1946	>	w.eventCount = ne;
1947	>	if ((p = w.parker) != null)
1948	>	U.unpark(p);
1949	>	return true; // replace with idle worker
1950	>	}
1951	>	}
1952	>	else if ((tc = (short)(c >>> TC_SHIFT)) >= 0 &&
1953	>	(int)(c >> AC_SHIFT) + pc > 1) {
1954	>	long nc = ((c - AC_UNIT) & AC_MASK) \| (c & ~AC_MASK);
1955	>	if (U.compareAndSwapLong(this, CTL, c, nc))
1956	>	return true; // no compensation
1957		}
1958	<	if ((task == null \|\| task.status >= 0) && // recheck need to block
1959	<	(blocker == null \|\| !blocker.isReleasable()) && ctl == c) {
1960	<	if (!replace) { // no compensation
1961	<	long nc = ((c - AC_UNIT) & AC_MASK) \| (c & ~AC_MASK);
1962	<	if (U.compareAndSwapLong(this, CTL, c, nc))
1963	<	return true;
1964	<	}
1965	<	else if (e != 0) { // release an idle worker
1966	<	WorkQueue w; Thread p; int i;
1967	<	if ((i = e & SMASK) < ws.length && (w = ws[i]) != null) {
2007	<	long nc = ((long)(w.nextWait & E_MASK) \|
2008	<	(c & (AC_MASK\|TC_MASK)));
2009	<	if (w.eventCount == (e \| INT_SIGN) &&
2010	<	U.compareAndSwapLong(this, CTL, c, nc)) {
2011	<	w.eventCount = (e + E_SEQ) & E_MASK;
2012	<	if ((p = w.parker) != null)
2013	<	U.unpark(p);
1958	>	else if (tc + pc < MAX_CAP) {
1959	>	long nc = ((c + TC_UNIT) & TC_MASK) \| (c & ~TC_MASK);
1960	>	if (U.compareAndSwapLong(this, CTL, c, nc)) {
1961	>	ForkJoinWorkerThreadFactory fac;
1962	>	Throwable ex = null;
1963	>	ForkJoinWorkerThread wt = null;
1964	>	try {
1965	>	if ((fac = factory) != null &&
1966	>	(wt = fac.newThread(this)) != null) {
1967	>	wt.start();
1968		return true;
1969		}
1970	+	} catch (Throwable rex) {
1971	+	ex = rex;
1972		}
1973	<	}
2018	<	else if (tc < MAX_CAP) { // create replacement
2019	<	long nc = ((c + TC_UNIT) & TC_MASK) \| (c & ~TC_MASK);
2020	<	if (U.compareAndSwapLong(this, CTL, c, nc)) {
2021	<	addWorker();
2022	<	return true;
2023	<	}
1973	>	deregisterWorker(wt, ex); // clean up and return false
1974		}
1975		}
1976		}
#	Line 2035 \| Line 1985 \| public class ForkJoinPool extends Abstra
1985		* @return task status on exit
1986		*/
1987		final int awaitJoin(WorkQueue joiner, ForkJoinTask<?> task) {
1988	<	int s;
1989	<	if ((s = task.status) >= 0) {
1988	>	int s = 0;
1989	>	if (task != null && (s = task.status) >= 0 && joiner != null) {
1990		ForkJoinTask<?> prevJoin = joiner.currentJoin;
1991		joiner.currentJoin = task;
1992	<	long startTime = 0L;
1993	<	for (int k = 0;;) {
1994	<	if ((s = (joiner.isEmpty() ? // try to help
1995	<	tryHelpStealer(joiner, task) :
1996	<	joiner.tryRemoveAndExec(task))) == 0 &&
1992	>	do {} while (joiner.tryRemoveAndExec(task) && // process local tasks
1993	>	(s = task.status) >= 0);
1994	>	if (s >= 0 && (task instanceof CountedCompleter))
1995	>	s = helpComplete(joiner, (CountedCompleter<?>)task);
1996	>	long cc = 0; // for stability checks
1997	>	while (s >= 0 && (s = task.status) >= 0) {
1998	>	if ((s = tryHelpStealer(joiner, task)) == 0 &&
1999		(s = task.status) >= 0) {
2000	<	if (k == 0) {
2001	<	startTime = System.nanoTime();
2002	<	tryPollForAndExec(joiner, task); // check uncommon case
2003	<	}
2052	<	else if ((k & (MAX_HELP - 1)) == 0 &&
2053	<	System.nanoTime() - startTime >=
2054	<	COMPENSATION_DELAY &&
2055	<	tryCompensate(task, null)) {
2056	<	if (task.trySetSignal()) {
2000	>	if (!tryCompensate(cc))
2001	>	cc = ctl;
2002	>	else {
2003	>	if (task.trySetSignal() && (s = task.status) >= 0) {
2004		synchronized (task) {
2005		if (task.status >= 0) {
2006		try { // see ForkJoinTask
#	Line 2065 \| Line 2012 \| public class ForkJoinPool extends Abstra
2012		task.notifyAll();
2013		}
2014		}
2015	<	long c; // re-activate
2015	>	long c; // reactivate
2016		do {} while (!U.compareAndSwapLong
2017	<	(this, CTL, c = ctl, c + AC_UNIT));
2017	>	(this, CTL, c = ctl,
2018	>	((c & ~AC_MASK) \|
2019	>	((c & AC_MASK) + AC_UNIT))));
2020		}
2021		}
2073	–	if (s < 0 \|\| (s = task.status) < 0) {
2074	–	joiner.currentJoin = prevJoin;
2075	–	break;
2076	–	}
2077	–	else if ((k++ & (MAX_HELP - 1)) == MAX_HELP >>> 1)
2078	–	Thread.yield(); // for politeness
2022		}
2023	+	joiner.currentJoin = prevJoin;
2024		}
2025		return s;
2026		}
#	Line 2088 \| Line 2032 \| public class ForkJoinPool extends Abstra
2032		*
2033		* @param joiner the joining worker
2034		* @param task the task
2091	–	* @return task status on exit
2035		*/
2036	<	final int helpJoinOnce(WorkQueue joiner, ForkJoinTask<?> task) {
2036	>	final void helpJoinOnce(WorkQueue joiner, ForkJoinTask<?> task) {
2037		int s;
2038	<	while ((s = task.status) >= 0 &&
2039	<	(joiner.isEmpty() ?
2040	<	tryHelpStealer(joiner, task) :
2041	<	joiner.tryRemoveAndExec(task)) != 0)
2042	<	;
2043	<	return s;
2038	>	if (joiner != null && task != null && (s = task.status) >= 0) {
2039	>	ForkJoinTask<?> prevJoin = joiner.currentJoin;
2040	>	joiner.currentJoin = task;
2041	>	do {} while (joiner.tryRemoveAndExec(task) && // process local tasks
2042	>	(s = task.status) >= 0);
2043	>	if (s >= 0) {
2044	>	if (task instanceof CountedCompleter)
2045	>	helpComplete(joiner, (CountedCompleter<?>)task);
2046	>	do {} while (task.status >= 0 &&
2047	>	tryHelpStealer(joiner, task) > 0);
2048	>	}
2049	>	joiner.currentJoin = prevJoin;
2050	>	}
2051		}
2052
2053		/**
2054		* Returns a (probably) non-empty steal queue, if one is found
2055	<	* during a random, then cyclic scan, else null. This method must
2056	<	* be retried by caller if, by the time it tries to use the queue,
2057	<	* it is empty.
2058	<	*/
2059	<	private WorkQueue findNonEmptyStealQueue(WorkQueue w) {
2060	<	// Similar to loop in scan(), but ignoring submissions
2061	<	int r = w.seed; r ^= r << 13; r ^= r >>> 17; w.seed = r ^= r << 5;
2062	<	int step = (r >>> 16) \| 1;
2063	<	for (WorkQueue[] ws;;) {
2064	<	int rs = runState, m;
2065	<	if ((ws = workQueues) == null \|\| (m = ws.length - 1) < 1)
2066	<	return null;
2117	<	for (int j = (m + 1) << 2; ; r += step) {
2118	<	WorkQueue q = ws[((r << 1) \| 1) & m];
2119	<	if (q != null && !q.isEmpty())
2120	<	return q;
2121	<	else if (--j < 0) {
2122	<	if (runState == rs)
2123	<	return null;
2124	<	break;
2055	>	* during a scan, else null. This method must be retried by
2056	>	* caller if, by the time it tries to use the queue, it is empty.
2057	>	*/
2058	>	private WorkQueue findNonEmptyStealQueue() {
2059	>	int r = ThreadLocalRandom.current().nextInt();
2060	>	for (;;) {
2061	>	int ps = plock, m; WorkQueue[] ws; WorkQueue q;
2062	>	if ((ws = workQueues) != null && (m = ws.length - 1) >= 0) {
2063	>	for (int j = (m + 1) << 2; j >= 0; --j) {
2064	>	if ((q = ws[(((r - j) << 1) \| 1) & m]) != null &&
2065	>	q.base - q.top < 0)
2066	>	return q;
2067		}
2068		}
2069	+	if (plock == ps)
2070	+	return null;
2071		}
2072		}
2073
#	Line 2134 \| Line 2078 \| public class ForkJoinPool extends Abstra
2078		* find tasks either.
2079		*/
2080		final void helpQuiescePool(WorkQueue w) {
2081	+	ForkJoinTask<?> ps = w.currentSteal;
2082		for (boolean active = true;;) {
2083	<	ForkJoinTask<?> localTask; // exhaust local queue
2084	<	while ((localTask = w.nextLocalTask()) != null)
2085	<	localTask.doExec();
2086	<	WorkQueue q = findNonEmptyStealQueue(w);
2142	<	if (q != null) {
2143	<	ForkJoinTask<?> t; int b;
2083	>	long c; WorkQueue q; ForkJoinTask<?> t; int b;
2084	>	while ((t = w.nextLocalTask()) != null)
2085	>	t.doExec();
2086	>	if ((q = findNonEmptyStealQueue()) != null) {
2087		if (!active) { // re-establish active count
2145	–	long c;
2088		active = true;
2089		do {} while (!U.compareAndSwapLong
2090	<	(this, CTL, c = ctl, c + AC_UNIT));
2090	>	(this, CTL, c = ctl,
2091	>	((c & ~AC_MASK) \|
2092	>	((c & AC_MASK) + AC_UNIT))));
2093	>	}
2094	>	if ((b = q.base) - q.top < 0 && (t = q.pollAt(b)) != null) {
2095	>	(w.currentSteal = t).doExec();
2096	>	w.currentSteal = ps;
2097		}
2150	–	if ((b = q.base) - q.top < 0 && (t = q.pollAt(b)) != null)
2151	–	w.runSubtask(t);
2098		}
2099	<	else {
2100	<	long c;
2101	<	if (active) { // decrement active count without queuing
2099	>	else if (active) { // decrement active count without queuing
2100	>	long nc = ((c = ctl) & ~AC_MASK) \| ((c & AC_MASK) - AC_UNIT);
2101	>	if ((int)(nc >> AC_SHIFT) + parallelism == 0)
2102	>	break; // bypass decrement-then-increment
2103	>	if (U.compareAndSwapLong(this, CTL, c, nc))
2104		active = false;
2157	–	do {} while (!U.compareAndSwapLong
2158	–	(this, CTL, c = ctl, c -= AC_UNIT));
2159	–	}
2160	–	else
2161	–	c = ctl; // re-increment on exit
2162	–	if ((int)(c >> AC_SHIFT) + parallelism == 0) {
2163	–	do {} while (!U.compareAndSwapLong
2164	–	(this, CTL, c = ctl, c + AC_UNIT));
2165	–	break;
2166	–	}
2105		}
2106	<	}
2107	<	}
2108	<
2109	<	/**
2110	<	* Restricted version of helpQuiescePool for non-FJ callers
2173	<	*/
2174	<	static void externalHelpQuiescePool() {
2175	<	ForkJoinPool p; WorkQueue[] ws; WorkQueue q, sq;
2176	<	ForkJoinTask<?>[] a; int b;
2177	<	ForkJoinTask<?> t = null;
2178	<	int k = submitters.get().seed & SQMASK;
2179	<	if ((p = commonPool) != null &&
2180	<	(ws = p.workQueues) != null &&
2181	<	ws.length > (k &= p.submitMask) &&
2182	<	(q = ws[k]) != null) {
2183	<	while (q.top - q.base > 0) {
2184	<	if ((t = q.sharedPop()) != null)
2185	<	break;
2186	<	}
2187	<	if (t == null && (sq = p.findNonEmptyStealQueue(q)) != null &&
2188	<	(b = sq.base) - sq.top < 0)
2189	<	t = sq.pollAt(b);
2190	<	if (t != null)
2191	<	t.doExec();
2106	>	else if ((int)((c = ctl) >> AC_SHIFT) + parallelism <= 0 &&
2107	>	U.compareAndSwapLong
2108	>	(this, CTL, c, ((c & ~AC_MASK) \|
2109	>	((c & AC_MASK) + AC_UNIT))))
2110	>	break;
2111		}
2112		}
2113
#	Line 2202 \| Line 2121 \| public class ForkJoinPool extends Abstra
2121		WorkQueue q; int b;
2122		if ((t = w.nextLocalTask()) != null)
2123		return t;
2124	<	if ((q = findNonEmptyStealQueue(w)) == null)
2124	>	if ((q = findNonEmptyStealQueue()) == null)
2125		return null;
2126		if ((b = q.base) - q.top < 0 && (t = q.pollAt(b)) != null)
2127		return t;
#	Line 2210 \| Line 2129 \| public class ForkJoinPool extends Abstra
2129		}
2130
2131		/**
2132	<	* Returns the approximate (non-atomic) number of idle threads per
2133	<	* active thread to offset steal queue size for method
2134	<	* ForkJoinTask.getSurplusQueuedTaskCount().
2135	<	*/
2136	<	final int idlePerActive() {
2137	<	// Approximate at powers of two for small values, saturate past 4
2138	<	int p = parallelism;
2139	<	int a = p + (int)(ctl >> AC_SHIFT);
2140	<	return (a > (p >>>= 1) ? 0 :
2141	<	a > (p >>>= 1) ? 1 :
2142	<	a > (p >>>= 1) ? 2 :
2143	<	a > (p >>>= 1) ? 4 :
2144	<	8);
2145	<	}
2146	<
2147	<	/**
2148	<	* Returns approximate submission queue length for the given caller
2149	<	*/
2150	<	static int getEstimatedSubmitterQueueLength() {
2151	<	ForkJoinPool p; WorkQueue[] ws; WorkQueue q;
2152	<	int k = submitters.get().seed & SQMASK;
2153	<	return ((p = commonPool) != null && (ws = p.workQueues) != null &&
2154	<	ws.length > (k &= p.submitMask) &&
2155	<	(q = ws[k]) != null) ?
2156	<	q.queueSize() : 0;
2132	>	* Returns a cheap heuristic guide for task partitioning when
2133	>	* programmers, frameworks, tools, or languages have little or no
2134	>	* idea about task granularity. In essence by offering this
2135	>	* method, we ask users only about tradeoffs in overhead vs
2136	>	* expected throughput and its variance, rather than how finely to
2137	>	* partition tasks.
2138	>	*
2139	>	* In a steady state strict (tree-structured) computation, each
2140	>	* thread makes available for stealing enough tasks for other
2141	>	* threads to remain active. Inductively, if all threads play by
2142	>	* the same rules, each thread should make available only a
2143	>	* constant number of tasks.
2144	>	*
2145	>	* The minimum useful constant is just 1. But using a value of 1
2146	>	* would require immediate replenishment upon each steal to
2147	>	* maintain enough tasks, which is infeasible. Further,
2148	>	* partitionings/granularities of offered tasks should minimize
2149	>	* steal rates, which in general means that threads nearer the top
2150	>	* of computation tree should generate more than those nearer the
2151	>	* bottom. In perfect steady state, each thread is at
2152	>	* approximately the same level of computation tree. However,
2153	>	* producing extra tasks amortizes the uncertainty of progress and
2154	>	* diffusion assumptions.
2155	>	*
2156	>	* So, users will want to use values larger (but not much larger)
2157	>	* than 1 to both smooth over transient shortages and hedge
2158	>	* against uneven progress; as traded off against the cost of
2159	>	* extra task overhead. We leave the user to pick a threshold
2160	>	* value to compare with the results of this call to guide
2161	>	* decisions, but recommend values such as 3.
2162	>	*
2163	>	* When all threads are active, it is on average OK to estimate
2164	>	* surplus strictly locally. In steady-state, if one thread is
2165	>	* maintaining say 2 surplus tasks, then so are others. So we can
2166	>	* just use estimated queue length. However, this strategy alone
2167	>	* leads to serious mis-estimates in some non-steady-state
2168	>	* conditions (ramp-up, ramp-down, other stalls). We can detect
2169	>	* many of these by further considering the number of "idle"
2170	>	* threads, that are known to have zero queued tasks, so
2171	>	* compensate by a factor of (#idle/#active) threads.
2172	>	*
2173	>	* Note: The approximation of #busy workers as #active workers is
2174	>	* not very good under current signalling scheme, and should be
2175	>	* improved.
2176	>	*/
2177	>	static int getSurplusQueuedTaskCount() {
2178	>	Thread t; ForkJoinWorkerThread wt; ForkJoinPool pool; WorkQueue q;
2179	>	if (((t = Thread.currentThread()) instanceof ForkJoinWorkerThread)) {
2180	>	int p = (pool = (wt = (ForkJoinWorkerThread)t).pool).parallelism;
2181	>	int n = (q = wt.workQueue).top - q.base;
2182	>	int a = (int)(pool.ctl >> AC_SHIFT) + p;
2183	>	return n - (a > (p >>>= 1) ? 0 :
2184	>	a > (p >>>= 1) ? 1 :
2185	>	a > (p >>>= 1) ? 2 :
2186	>	a > (p >>>= 1) ? 4 :
2187	>	8);
2188	>	}
2189	>	return 0;
2190		}
2191
2192		// Termination
#	Line 2254 \| Line 2206 \| public class ForkJoinPool extends Abstra
2206		* @return true if now terminating or terminated
2207		*/
2208		private boolean tryTerminate(boolean now, boolean enable) {
2209	+	int ps;
2210	+	if (this == common) // cannot shut down
2211	+	return false;
2212	+	if ((ps = plock) >= 0) { // enable by setting plock
2213	+	if (!enable)
2214	+	return false;
2215	+	if ((ps & PL_LOCK) != 0 \|\|
2216	+	!U.compareAndSwapInt(this, PLOCK, ps, ps += PL_LOCK))
2217	+	ps = acquirePlock();
2218	+	int nps = ((ps + PL_LOCK) & ~SHUTDOWN) \| SHUTDOWN;
2219	+	if (!U.compareAndSwapInt(this, PLOCK, ps, nps))
2220	+	releasePlock(nps);
2221	+	}
2222		for (long c;;) {
2223	<	if (((c = ctl) & STOP_BIT) != 0) { // already terminating
2224	<	if ((short)(c >>> TC_SHIFT) == -parallelism) {
2223	>	if (((c = ctl) & STOP_BIT) != 0) { // already terminating
2224	>	if ((short)(c >>> TC_SHIFT) + parallelism <= 0) {
2225		synchronized (this) {
2226	<	notifyAll(); // signal when 0 workers
2226	>	notifyAll(); // signal when 0 workers
2227		}
2228		}
2229		return true;
2230		}
2231	<	if (runState >= 0) { // not yet enabled
2232	<	if (!enable)
2233	<	return false;
2269	<	while (!U.compareAndSwapInt(this, MAINLOCK, 0, 1))
2270	<	tryAwaitMainLock();
2271	<	try {
2272	<	runState \|= SHUTDOWN;
2273	<	} finally {
2274	<	if (!U.compareAndSwapInt(this, MAINLOCK, 1, 0)) {
2275	<	mainLock = 0;
2276	<	synchronized (this) { notifyAll(); };
2277	<	}
2278	<	}
2279	<	}
2280	<	if (!now) { // check if idle & no tasks
2281	<	if ((int)(c >> AC_SHIFT) != -parallelism \|\|
2282	<	hasQueuedSubmissions())
2231	>	if (!now) { // check if idle & no tasks
2232	>	WorkQueue[] ws; WorkQueue w;
2233	>	if ((int)(c >> AC_SHIFT) + parallelism > 0)
2234		return false;
2235	<	// Check for unqueued inactive workers. One pass suffices.
2236	<	WorkQueue[] ws = workQueues; WorkQueue w;
2237	<	if (ws != null) {
2238	<	for (int i = 1; i < ws.length; i += 2) {
2239	<	if ((w = ws[i]) != null && w.eventCount >= 0)
2235	>	if ((ws = workQueues) != null) {
2236	>	for (int i = 0; i < ws.length; ++i) {
2237	>	if ((w = ws[i]) != null &&
2238	>	(!w.isEmpty() \|\|
2239	>	((i & 1) != 0 && w.eventCount >= 0))) {
2240	>	signalWork(ws, w);
2241		return false;
2242	+	}
2243		}
2244		}
2245		}
2246		if (U.compareAndSwapLong(this, CTL, c, c \| STOP_BIT)) {
2247		for (int pass = 0; pass < 3; ++pass) {
2248	<	WorkQueue[] ws = workQueues;
2249	<	if (ws != null) {
2297	<	WorkQueue w;
2248	>	WorkQueue[] ws; WorkQueue w; Thread wt;
2249	>	if ((ws = workQueues) != null) {
2250		int n = ws.length;
2251		for (int i = 0; i < n; ++i) {
2252		if ((w = ws[i]) != null) {
2253	<	w.runState = -1;
2253	>	w.qlock = -1;
2254		if (pass > 0) {
2255		w.cancelAll();
2256	<	if (pass > 1)
2257	<	w.interruptOwner();
2256	>	if (pass > 1 && (wt = w.owner) != null) {
2257	>	if (!wt.isInterrupted()) {
2258	>	try {
2259	>	wt.interrupt();
2260	>	} catch (Throwable ignore) {
2261	>	}
2262	>	}
2263	>	U.unpark(wt);
2264	>	}
2265		}
2266		}
2267		}
2268		// Wake up workers parked on event queue
2269		int i, e; long cc; Thread p;
2270		while ((e = (int)(cc = ctl) & E_MASK) != 0 &&
2271	<	(i = e & SMASK) < n &&
2271	>	(i = e & SMASK) < n && i >= 0 &&
2272		(w = ws[i]) != null) {
2273		long nc = ((long)(w.nextWait & E_MASK) \|
2274		((cc + AC_UNIT) & AC_MASK) \|
#	Line 2317 \| Line 2276 \| public class ForkJoinPool extends Abstra
2276		if (w.eventCount == (e \| INT_SIGN) &&
2277		U.compareAndSwapLong(this, CTL, cc, nc)) {
2278		w.eventCount = (e + E_SEQ) & E_MASK;
2279	<	w.runState = -1;
2279	>	w.qlock = -1;
2280		if ((p = w.parker) != null)
2281		U.unpark(p);
2282		}
#	Line 2328 \| Line 2287 \| public class ForkJoinPool extends Abstra
2287		}
2288		}
2289
2290	+	// external operations on common pool
2291	+
2292	+	/**
2293	+	* Returns common pool queue for a thread that has submitted at
2294	+	* least one task.
2295	+	*/
2296	+	static WorkQueue commonSubmitterQueue() {
2297	+	Submitter z; ForkJoinPool p; WorkQueue[] ws; int m, r;
2298	+	return ((z = submitters.get()) != null &&
2299	+	(p = common) != null &&
2300	+	(ws = p.workQueues) != null &&
2301	+	(m = ws.length - 1) >= 0) ?
2302	+	ws[m & z.seed & SQMASK] : null;
2303	+	}
2304	+
2305	+	/**
2306	+	* Tries to pop the given task from submitter's queue in common pool.
2307	+	*/
2308	+	final boolean tryExternalUnpush(ForkJoinTask<?> task) {
2309	+	WorkQueue joiner; ForkJoinTask<?>[] a; int m, s;
2310	+	Submitter z = submitters.get();
2311	+	WorkQueue[] ws = workQueues;
2312	+	boolean popped = false;
2313	+	if (z != null && ws != null && (m = ws.length - 1) >= 0 &&
2314	+	(joiner = ws[z.seed & m & SQMASK]) != null &&
2315	+	joiner.base != (s = joiner.top) &&
2316	+	(a = joiner.array) != null) {
2317	+	long j = (((a.length - 1) & (s - 1)) << ASHIFT) + ABASE;
2318	+	if (U.getObject(a, j) == task &&
2319	+	U.compareAndSwapInt(joiner, QLOCK, 0, 1)) {
2320	+	if (joiner.top == s && joiner.array == a &&
2321	+	U.compareAndSwapObject(a, j, task, null)) {
2322	+	joiner.top = s - 1;
2323	+	popped = true;
2324	+	}
2325	+	joiner.qlock = 0;
2326	+	}
2327	+	}
2328	+	return popped;
2329	+	}
2330	+
2331	+	final int externalHelpComplete(CountedCompleter<?> task) {
2332	+	WorkQueue joiner; int m, j;
2333	+	Submitter z = submitters.get();
2334	+	WorkQueue[] ws = workQueues;
2335	+	int s = 0;
2336	+	if (z != null && ws != null && (m = ws.length - 1) >= 0 &&
2337	+	(joiner = ws[(j = z.seed) & m & SQMASK]) != null && task != null) {
2338	+	int scans = m + m + 1;
2339	+	long c = 0L; // for stability check
2340	+	j \|= 1; // poll odd queues
2341	+	for (int k = scans; ; j += 2) {
2342	+	WorkQueue q;
2343	+	if ((s = task.status) < 0)
2344	+	break;
2345	+	else if (joiner.externalPopAndExecCC(task))
2346	+	k = scans;
2347	+	else if ((s = task.status) < 0)
2348	+	break;
2349	+	else if ((q = ws[j & m]) != null && q.pollAndExecCC(task))
2350	+	k = scans;
2351	+	else if (--k < 0) {
2352	+	if (c == (c = ctl))
2353	+	break;
2354	+	k = scans;
2355	+	}
2356	+	}
2357	+	}
2358	+	return s;
2359	+	}
2360	+
2361		// Exported methods
2362
2363		// Constructors
#	Line 2344 \| Line 2374 \| public class ForkJoinPool extends Abstra
2374		* java.lang.RuntimePermission}{@code ("modifyThread")}
2375		*/
2376		public ForkJoinPool() {
2377	<	this(Runtime.getRuntime().availableProcessors(),
2377	>	this(Math.min(MAX_CAP, Runtime.getRuntime().availableProcessors()),
2378		defaultForkJoinWorkerThreadFactory, null, false);
2379		}
2380
#	Line 2392 \| Line 2422 \| public class ForkJoinPool extends Abstra
2422		*/
2423		public ForkJoinPool(int parallelism,
2424		ForkJoinWorkerThreadFactory factory,
2425	<	Thread.UncaughtExceptionHandler handler,
2425	>	UncaughtExceptionHandler handler,
2426		boolean asyncMode) {
2427	+	this(checkParallelism(parallelism),
2428	+	checkFactory(factory),
2429	+	handler,
2430	+	(asyncMode ? FIFO_QUEUE : LIFO_QUEUE),
2431	+	"ForkJoinPool-" + nextPoolId() + "-worker-");
2432		checkPermission();
2433	<	if (factory == null)
2434	<	throw new NullPointerException();
2433	>	}
2434	>
2435	>	private static int checkParallelism(int parallelism) {
2436		if (parallelism <= 0 \|\| parallelism > MAX_CAP)
2437		throw new IllegalArgumentException();
2438	<	this.parallelism = parallelism;
2439	<	this.factory = factory;
2440	<	this.ueh = handler;
2441	<	this.localMode = asyncMode ? FIFO_QUEUE : LIFO_QUEUE;
2442	<	long np = (long)(-parallelism); // offset ctl counts
2443	<	this.ctl = ((np << AC_SHIFT) & AC_MASK) \| ((np << TC_SHIFT) & TC_MASK);
2444	<	// Use nearest power 2 for workQueues size. See Hackers Delight sec 3.2.
2445	<	int n = parallelism - 1;
2410	<	n \|= n >>> 1; n \|= n >>> 2; n \|= n >>> 4; n \|= n >>> 8; n \|= n >>> 16;
2411	<	this.submitMask = ((n + 1) << 1) - 1;
2412	<	int pn = poolNumberGenerator.incrementAndGet();
2413	<	StringBuilder sb = new StringBuilder("ForkJoinPool-");
2414	<	sb.append(Integer.toString(pn));
2415	<	sb.append("-worker-");
2416	<	this.workerNamePrefix = sb.toString();
2417	<	this.runState = 1; // set init flag
2438	>	return parallelism;
2439	>	}
2440	>
2441	>	private static ForkJoinWorkerThreadFactory checkFactory
2442	>	(ForkJoinWorkerThreadFactory factory) {
2443	>	if (factory == null)
2444	>	throw new NullPointerException();
2445	>	return factory;
2446		}
2447
2448		/**
2449	<	* Constructor for common pool, suitable only for static initialization.
2450	<	* Basically the same as above, but uses smallest possible initial footprint.
2451	<	*/
2452	<	ForkJoinPool(int parallelism, int submitMask,
2453	<	ForkJoinWorkerThreadFactory factory,
2454	<	Thread.UncaughtExceptionHandler handler) {
2449	>	* Creates a {@code ForkJoinPool} with the given parameters, without
2450	>	* any security checks or parameter validation. Invoked directly by
2451	>	* makeCommonPool.
2452	>	*/
2453	>	private ForkJoinPool(int parallelism,
2454	>	ForkJoinWorkerThreadFactory factory,
2455	>	UncaughtExceptionHandler handler,
2456	>	int mode,
2457	>	String workerNamePrefix) {
2458	>	this.workerNamePrefix = workerNamePrefix;
2459		this.factory = factory;
2460		this.ueh = handler;
2461	<	this.submitMask = submitMask;
2462	<	this.parallelism = parallelism;
2463	<	long np = (long)(-parallelism);
2461	>	this.mode = (short)mode;
2462	>	this.parallelism = (short)parallelism;
2463	>	long np = (long)(-parallelism); // offset ctl counts
2464		this.ctl = ((np << AC_SHIFT) & AC_MASK) \| ((np << TC_SHIFT) & TC_MASK);
2433	–	this.localMode = LIFO_QUEUE;
2434	–	this.workerNamePrefix = "ForkJoinPool.commonPool-worker-";
2435	–	this.runState = 1;
2465		}
2466
2467		/**
2468	<	* Returns the common pool instance.
2468	>	* Returns the common pool instance. This pool is statically
2469	>	* constructed; its run state is unaffected by attempts to {@link
2470	>	* #shutdown} or {@link #shutdownNow}. However this pool and any
2471	>	* ongoing processing are automatically terminated upon program
2472	>	* {@link System#exit}. Any program that relies on asynchronous
2473	>	* task processing to complete before program termination should
2474	>	* invoke {@code commonPool().}{@link #awaitQuiescence awaitQuiescence},
2475	>	* before exit.
2476		*
2477		* @return the common pool instance
2478	+	* @since 1.8
2479		*/
2480		public static ForkJoinPool commonPool() {
2481	<	ForkJoinPool p;
2482	<	if ((p = commonPool) == null)
2446	<	throw new Error("Common Pool Unavailable");
2447	<	return p;
2481	>	// assert common != null : "static init error";
2482	>	return common;
2483		}
2484
2485		// Execution methods
#	Line 2468 \| Line 2503 \| public class ForkJoinPool extends Abstra
2503		public <T> T invoke(ForkJoinTask<T> task) {
2504		if (task == null)
2505		throw new NullPointerException();
2506	<	doSubmit(task);
2506	>	externalPush(task);
2507		return task.join();
2508		}
2509
#	Line 2483 \| Line 2518 \| public class ForkJoinPool extends Abstra
2518		public void execute(ForkJoinTask<?> task) {
2519		if (task == null)
2520		throw new NullPointerException();
2521	<	doSubmit(task);
2521	>	externalPush(task);
2522		}
2523
2524		// AbstractExecutorService methods
#	Line 2500 \| Line 2535 \| public class ForkJoinPool extends Abstra
2535		if (task instanceof ForkJoinTask<?>) // avoid re-wrap
2536		job = (ForkJoinTask<?>) task;
2537		else
2538	<	job = new ForkJoinTask.AdaptedRunnableAction(task);
2539	<	doSubmit(job);
2538	>	job = new ForkJoinTask.RunnableExecuteAction(task);
2539	>	externalPush(job);
2540		}
2541
2542		/**
#	Line 2516 \| Line 2551 \| public class ForkJoinPool extends Abstra
2551		public <T> ForkJoinTask<T> submit(ForkJoinTask<T> task) {
2552		if (task == null)
2553		throw new NullPointerException();
2554	<	doSubmit(task);
2554	>	externalPush(task);
2555		return task;
2556		}
2557
#	Line 2527 \| Line 2562 \| public class ForkJoinPool extends Abstra
2562		*/
2563		public <T> ForkJoinTask<T> submit(Callable<T> task) {
2564		ForkJoinTask<T> job = new ForkJoinTask.AdaptedCallable<T>(task);
2565	<	doSubmit(job);
2565	>	externalPush(job);
2566		return job;
2567		}
2568
#	Line 2538 \| Line 2573 \| public class ForkJoinPool extends Abstra
2573		*/
2574		public <T> ForkJoinTask<T> submit(Runnable task, T result) {
2575		ForkJoinTask<T> job = new ForkJoinTask.AdaptedRunnable<T>(task, result);
2576	<	doSubmit(job);
2576	>	externalPush(job);
2577		return job;
2578		}
2579
#	Line 2555 \| Line 2590 \| public class ForkJoinPool extends Abstra
2590		job = (ForkJoinTask<?>) task;
2591		else
2592		job = new ForkJoinTask.AdaptedRunnableAction(task);
2593	<	doSubmit(job);
2593	>	externalPush(job);
2594		return job;
2595		}
2596
#	Line 2567 \| Line 2602 \| public class ForkJoinPool extends Abstra
2602		// In previous versions of this class, this method constructed
2603		// a task to run ForkJoinTask.invokeAll, but now external
2604		// invocation of multiple tasks is at least as efficient.
2605	<	List<ForkJoinTask<T>> fs = new ArrayList<ForkJoinTask<T>>(tasks.size());
2571	<	// Workaround needed because method wasn't declared with
2572	<	// wildcards in return type but should have been.
2573	<	@SuppressWarnings({"unchecked", "rawtypes"})
2574	<	List<Future<T>> futures = (List<Future<T>>) (List) fs;
2605	>	ArrayList<Future<T>> futures = new ArrayList<Future<T>>(tasks.size());
2606
2607		boolean done = false;
2608		try {
2609		for (Callable<T> t : tasks) {
2610		ForkJoinTask<T> f = new ForkJoinTask.AdaptedCallable<T>(t);
2611	<	doSubmit(f);
2612	<	fs.add(f);
2611	>	futures.add(f);
2612	>	externalPush(f);
2613		}
2614	<	for (ForkJoinTask<T> f : fs)
2615	<	f.quietlyJoin();
2614	>	for (int i = 0, size = futures.size(); i < size; i++)
2615	>	((ForkJoinTask<?>)futures.get(i)).quietlyJoin();
2616		done = true;
2617		return futures;
2618		} finally {
2619		if (!done)
2620	<	for (ForkJoinTask<T> f : fs)
2621	<	f.cancel(false);
2620	>	for (int i = 0, size = futures.size(); i < size; i++)
2621	>	futures.get(i).cancel(false);
2622		}
2623		}
2624
#	Line 2606 \| Line 2637 \| public class ForkJoinPool extends Abstra
2637		*
2638		* @return the handler, or {@code null} if none
2639		*/
2640	<	public Thread.UncaughtExceptionHandler getUncaughtExceptionHandler() {
2640	>	public UncaughtExceptionHandler getUncaughtExceptionHandler() {
2641		return ueh;
2642		}
2643
#	Line 2616 \| Line 2647 \| public class ForkJoinPool extends Abstra
2647		* @return the targeted parallelism level of this pool
2648		*/
2649		public int getParallelism() {
2650	<	return parallelism;
2650	>	int par;
2651	>	return ((par = parallelism) > 0) ? par : 1;
2652		}
2653
2654		/**
2655		* Returns the targeted parallelism level of the common pool.
2656		*
2657		* @return the targeted parallelism level of the common pool
2658	+	* @since 1.8
2659		*/
2660		public static int getCommonPoolParallelism() {
2661	<	return commonPoolParallelism;
2661	>	return commonParallelism;
2662		}
2663
2664		/**
#	Line 2647 \| Line 2680 \| public class ForkJoinPool extends Abstra
2680		* @return {@code true} if this pool uses async mode
2681		*/
2682		public boolean getAsyncMode() {
2683	<	return localMode != 0;
2683	>	return mode == FIFO_QUEUE;
2684		}
2685
2686		/**
#	Line 2694 \| Line 2727 \| public class ForkJoinPool extends Abstra
2727		* @return {@code true} if all threads are currently idle
2728		*/
2729		public boolean isQuiescent() {
2730	<	return (int)(ctl >> AC_SHIFT) + parallelism == 0;
2730	>	return parallelism + (int)(ctl >> AC_SHIFT) <= 0;
2731		}
2732
2733		/**
#	Line 2714 \| Line 2747 \| public class ForkJoinPool extends Abstra
2747		if ((ws = workQueues) != null) {
2748		for (int i = 1; i < ws.length; i += 2) {
2749		if ((w = ws[i]) != null)
2750	<	count += w.totalSteals;
2750	>	count += w.nsteals;
2751		}
2752		}
2753		return count;
#	Line 2850 \| Line 2883 \| public class ForkJoinPool extends Abstra
2883		qs += size;
2884		else {
2885		qt += size;
2886	<	st += w.totalSteals;
2886	>	st += w.nsteals;
2887		if (w.isApparentlyUnblocked())
2888		++rc;
2889		}
#	Line 2866 \| Line 2899 \| public class ForkJoinPool extends Abstra
2899		if ((c & STOP_BIT) != 0)
2900		level = (tc == 0) ? "Terminated" : "Terminating";
2901		else
2902	<	level = runState < 0 ? "Shutting down" : "Running";
2902	>	level = plock < 0 ? "Shutting down" : "Running";
2903		return super.toString() +
2904		"[" + level +
2905		", parallelism = " + pc +
#	Line 2883 \| Line 2916 \| public class ForkJoinPool extends Abstra
2916		* Possibly initiates an orderly shutdown in which previously
2917		* submitted tasks are executed, but no new tasks will be
2918		* accepted. Invocation has no effect on execution state if this
2919	<	* is the {@link #commonPool}, and no additional effect if
2919	>	* is the {@link #commonPool()}, and no additional effect if
2920		* already shut down. Tasks that are in the process of being
2921		* submitted concurrently during the course of this method may or
2922		* may not be rejected.
#	Line 2895 \| Line 2928 \| public class ForkJoinPool extends Abstra
2928		*/
2929		public void shutdown() {
2930		checkPermission();
2931	<	if (this != commonPool)
2899	<	tryTerminate(false, true);
2931	>	tryTerminate(false, true);
2932		}
2933
2934		/**
2935		* Possibly attempts to cancel and/or stop all tasks, and reject
2936		* all subsequently submitted tasks. Invocation has no effect on
2937	<	* execution state if this is the {@link #commonPool}, and no
2937	>	* execution state if this is the {@link #commonPool()}, and no
2938		* additional effect if already shut down. Otherwise, tasks that
2939		* are in the process of being submitted or executed concurrently
2940		* during the course of this method may or may not be
#	Line 2919 \| Line 2951 \| public class ForkJoinPool extends Abstra
2951		*/
2952		public List<Runnable> shutdownNow() {
2953		checkPermission();
2954	<	if (this != commonPool)
2923	<	tryTerminate(true, true);
2954	>	tryTerminate(true, true);
2955		return Collections.emptyList();
2956		}
2957
#	Line 2932 \| Line 2963 \| public class ForkJoinPool extends Abstra
2963		public boolean isTerminated() {
2964		long c = ctl;
2965		return ((c & STOP_BIT) != 0L &&
2966	<	(short)(c >>> TC_SHIFT) == -parallelism);
2966	>	(short)(c >>> TC_SHIFT) + parallelism <= 0);
2967		}
2968
2969		/**
#	Line 2940 \| Line 2971 \| public class ForkJoinPool extends Abstra
2971		* commenced but not yet completed. This method may be useful for
2972		* debugging. A return of {@code true} reported a sufficient
2973		* period after shutdown may indicate that submitted tasks have
2974	<	* ignored or suppressed interruption, or are waiting for IO,
2974	>	* ignored or suppressed interruption, or are waiting for I/O,
2975		* causing this executor not to properly terminate. (See the
2976		* advisory notes for class {@link ForkJoinTask} stating that
2977		* tasks should not normally entail blocking operations. But if
#	Line 2951 \| Line 2982 \| public class ForkJoinPool extends Abstra
2982		public boolean isTerminating() {
2983		long c = ctl;
2984		return ((c & STOP_BIT) != 0L &&
2985	<	(short)(c >>> TC_SHIFT) != -parallelism);
2985	>	(short)(c >>> TC_SHIFT) + parallelism > 0);
2986		}
2987
2988		/**
#	Line 2960 \| Line 2991 \| public class ForkJoinPool extends Abstra
2991		* @return {@code true} if this pool has been shut down
2992		*/
2993		public boolean isShutdown() {
2994	<	return runState < 0;
2994	>	return plock < 0;
2995		}
2996
2997		/**
2998	<	* Blocks until all tasks have completed execution after a shutdown
2999	<	* request, or the timeout occurs, or the current thread is
3000	<	* interrupted, whichever happens first.
2998	>	* Blocks until all tasks have completed execution after a
2999	>	* shutdown request, or the timeout occurs, or the current thread
3000	>	* is interrupted, whichever happens first. Because the {@link
3001	>	* #commonPool()} never terminates until program shutdown, when
3002	>	* applied to the common pool, this method is equivalent to {@link
3003	>	* #awaitQuiescence(long, TimeUnit)} but always returns {@code false}.
3004		*
3005		* @param timeout the maximum time to wait
3006		* @param unit the time unit of the timeout argument
#	Line 2976 \| Line 3010 \| public class ForkJoinPool extends Abstra
3010		*/
3011		public boolean awaitTermination(long timeout, TimeUnit unit)
3012		throws InterruptedException {
3013	+	if (Thread.interrupted())
3014	+	throw new InterruptedException();
3015	+	if (this == common) {
3016	+	awaitQuiescence(timeout, unit);
3017	+	return false;
3018	+	}
3019		long nanos = unit.toNanos(timeout);
3020		if (isTerminated())
3021		return true;
3022	<	long startTime = System.nanoTime();
3023	<	boolean terminated = false;
3022	>	if (nanos <= 0L)
3023	>	return false;
3024	>	long deadline = System.nanoTime() + nanos;
3025		synchronized (this) {
3026	<	for (long waitTime = nanos, millis = 0L;;) {
3027	<	if (terminated = isTerminated() \|\|
3028	<	waitTime <= 0L \|\|
3029	<	(millis = unit.toMillis(waitTime)) <= 0L)
3026	>	for (;;) {
3027	>	if (isTerminated())
3028	>	return true;
3029	>	if (nanos <= 0L)
3030	>	return false;
3031	>	long millis = TimeUnit.NANOSECONDS.toMillis(nanos);
3032	>	wait(millis > 0L ? millis : 1L);
3033	>	nanos = deadline - System.nanoTime();
3034	>	}
3035	>	}
3036	>	}
3037	>
3038	>	/**
3039	>	* If called by a ForkJoinTask operating in this pool, equivalent
3040	>	* in effect to {@link ForkJoinTask#helpQuiesce}. Otherwise,
3041	>	* waits and/or attempts to assist performing tasks until this
3042	>	* pool {@link #isQuiescent} or the indicated timeout elapses.
3043	>	*
3044	>	* @param timeout the maximum time to wait
3045	>	* @param unit the time unit of the timeout argument
3046	>	* @return {@code true} if quiescent; {@code false} if the
3047	>	* timeout elapsed.
3048	>	*/
3049	>	public boolean awaitQuiescence(long timeout, TimeUnit unit) {
3050	>	long nanos = unit.toNanos(timeout);
3051	>	ForkJoinWorkerThread wt;
3052	>	Thread thread = Thread.currentThread();
3053	>	if ((thread instanceof ForkJoinWorkerThread) &&
3054	>	(wt = (ForkJoinWorkerThread)thread).pool == this) {
3055	>	helpQuiescePool(wt.workQueue);
3056	>	return true;
3057	>	}
3058	>	long startTime = System.nanoTime();
3059	>	WorkQueue[] ws;
3060	>	int r = 0, m;
3061	>	boolean found = true;
3062	>	while (!isQuiescent() && (ws = workQueues) != null &&
3063	>	(m = ws.length - 1) >= 0) {
3064	>	if (!found) {
3065	>	if ((System.nanoTime() - startTime) > nanos)
3066	>	return false;
3067	>	Thread.yield(); // cannot block
3068	>	}
3069	>	found = false;
3070	>	for (int j = (m + 1) << 2; j >= 0; --j) {
3071	>	ForkJoinTask<?> t; WorkQueue q; int b;
3072	>	if ((q = ws[r++ & m]) != null && (b = q.base) - q.top < 0) {
3073	>	found = true;
3074	>	if ((t = q.pollAt(b)) != null)
3075	>	t.doExec();
3076		break;
3077	<	wait(millis);
2991	<	waitTime = nanos - (System.nanoTime() - startTime);
3077	>	}
3078		}
3079		}
3080	<	return terminated;
3080	>	return true;
3081	>	}
3082	>
3083	>	/**
3084	>	* Waits and/or attempts to assist performing tasks indefinitely
3085	>	* until the {@link #commonPool()} {@link #isQuiescent}.
3086	>	*/
3087	>	static void quiesceCommonPool() {
3088	>	common.awaitQuiescence(Long.MAX_VALUE, TimeUnit.NANOSECONDS);
3089		}
3090
3091		/**
#	Line 3003 \| Line 3097 \| public class ForkJoinPool extends Abstra
3097		* not necessary. Method {@code block} blocks the current thread
3098		* if necessary (perhaps internally invoking {@code isReleasable}
3099		* before actually blocking). These actions are performed by any
3100	<	* thread invoking {@link ForkJoinPool#managedBlock}. The
3101	<	* unusual methods in this API accommodate synchronizers that may,
3102	<	* but don't usually, block for long periods. Similarly, they
3100	>	* thread invoking {@link ForkJoinPool#managedBlock(ManagedBlocker)}.
3101	>	* The unusual methods in this API accommodate synchronizers that
3102	>	* may, but don't usually, block for long periods. Similarly, they
3103		* allow more efficient internal handling of cases in which
3104		* additional workers may be, but usually are not, needed to
3105		* ensure sufficient parallelism. Toward this end,
#	Line 3063 \| Line 3157 \| public class ForkJoinPool extends Abstra
3157
3158		/**
3159		* Returns {@code true} if blocking is unnecessary.
3160	+	* @return {@code true} if blocking is unnecessary
3161		*/
3162		boolean isReleasable();
3163		}
#	Line 3090 \| Line 3185 \| public class ForkJoinPool extends Abstra
3185		public static void managedBlock(ManagedBlocker blocker)
3186		throws InterruptedException {
3187		Thread t = Thread.currentThread();
3188	<	ForkJoinPool p = ((t instanceof ForkJoinWorkerThread) ?
3189	<	((ForkJoinWorkerThread)t).pool : null);
3190	<	while (!blocker.isReleasable()) {
3191	<	if (p == null \|\| p.tryCompensate(null, blocker)) {
3192	<	try {
3193	<	do {} while (!blocker.isReleasable() && !blocker.block());
3194	<	} finally {
3195	<	if (p != null)
3188	>	if (t instanceof ForkJoinWorkerThread) {
3189	>	ForkJoinPool p = ((ForkJoinWorkerThread)t).pool;
3190	>	while (!blocker.isReleasable()) {
3191	>	if (p.tryCompensate(p.ctl)) {
3192	>	try {
3193	>	do {} while (!blocker.isReleasable() &&
3194	>	!blocker.block());
3195	>	} finally {
3196		p.incrementActiveCount();
3197	+	}
3198	+	break;
3199		}
3103	–	break;
3200		}
3201		}
3202	+	else {
3203	+	do {} while (!blocker.isReleasable() &&
3204	+	!blocker.block());
3205	+	}
3206		}
3207
3208		// AbstractExecutorService overrides. These rely on undocumented
#	Line 3123 \| Line 3223 \| public class ForkJoinPool extends Abstra
3223		private static final long PARKBLOCKER;
3224		private static final int ABASE;
3225		private static final int ASHIFT;
3126	–	private static final long NEXTWORKERNUMBER;
3226		private static final long STEALCOUNT;
3227	<	private static final long MAINLOCK;
3227	>	private static final long PLOCK;
3228	>	private static final long INDEXSEED;
3229	>	private static final long QBASE;
3230	>	private static final long QLOCK;
3231
3232		static {
3233	<	poolNumberGenerator = new AtomicInteger();
3132	<	nextSubmitterSeed = new AtomicInteger(0x55555555);
3133	<	modifyThreadPermission = new RuntimePermission("modifyThread");
3134	<	defaultForkJoinWorkerThreadFactory =
3135	<	new DefaultForkJoinWorkerThreadFactory();
3136	<	submitters = new ThreadSubmitter();
3137	<	int s;
3233	>	// initialize field offsets for CAS etc
3234		try {
3235		U = getUnsafe();
3236		Class<?> k = ForkJoinPool.class;
3141	–	Class<?> ak = ForkJoinTask[].class;
3237		CTL = U.objectFieldOffset
3238		(k.getDeclaredField("ctl"));
3144	–	NEXTWORKERNUMBER = U.objectFieldOffset
3145	–	(k.getDeclaredField("nextWorkerNumber"));
3239		STEALCOUNT = U.objectFieldOffset
3240		(k.getDeclaredField("stealCount"));
3241	<	MAINLOCK = U.objectFieldOffset
3242	<	(k.getDeclaredField("mainLock"));
3241	>	PLOCK = U.objectFieldOffset
3242	>	(k.getDeclaredField("plock"));
3243	>	INDEXSEED = U.objectFieldOffset
3244	>	(k.getDeclaredField("indexSeed"));
3245		Class<?> tk = Thread.class;
3246		PARKBLOCKER = U.objectFieldOffset
3247		(tk.getDeclaredField("parkBlocker"));
3248	+	Class<?> wk = WorkQueue.class;
3249	+	QBASE = U.objectFieldOffset
3250	+	(wk.getDeclaredField("base"));
3251	+	QLOCK = U.objectFieldOffset
3252	+	(wk.getDeclaredField("qlock"));
3253	+	Class<?> ak = ForkJoinTask[].class;
3254		ABASE = U.arrayBaseOffset(ak);
3255	<	s = U.arrayIndexScale(ak);
3256	<	ASHIFT = 31 - Integer.numberOfLeadingZeros(s);
3257	<	} catch (Exception e) {
3258	<	throw new Error(e);
3158	<	}
3159	<	if ((s & (s-1)) != 0)
3160	<	throw new Error("data type scale not a power of two");
3161	<	try { // Establish common pool
3162	<	String pp = System.getProperty(propPrefix + "parallelism");
3163	<	String fp = System.getProperty(propPrefix + "threadFactory");
3164	<	String up = System.getProperty(propPrefix + "exceptionHandler");
3165	<	ForkJoinWorkerThreadFactory fac = (fp == null) ?
3166	<	defaultForkJoinWorkerThreadFactory :
3167	<	((ForkJoinWorkerThreadFactory)ClassLoader.
3168	<	getSystemClassLoader().loadClass(fp).newInstance());
3169	<	Thread.UncaughtExceptionHandler ueh = (up == null) ? null :
3170	<	((Thread.UncaughtExceptionHandler)ClassLoader.
3171	<	getSystemClassLoader().loadClass(up).newInstance());
3172	<	int par;
3173	<	if ((pp == null \|\| (par = Integer.parseInt(pp)) <= 0))
3174	<	par = Runtime.getRuntime().availableProcessors();
3175	<	if (par > MAX_CAP)
3176	<	par = MAX_CAP;
3177	<	commonPoolParallelism = par;
3178	<	int n = par - 1; // precompute submit mask
3179	<	n \|= n >>> 1; n \|= n >>> 2; n \|= n >>> 4;
3180	<	n \|= n >>> 8; n \|= n >>> 16;
3181	<	int mask = ((n + 1) << 1) - 1;
3182	<	commonPool = new ForkJoinPool(par, mask, fac, ueh);
3255	>	int scale = U.arrayIndexScale(ak);
3256	>	if ((scale & (scale - 1)) != 0)
3257	>	throw new Error("data type scale not a power of two");
3258	>	ASHIFT = 31 - Integer.numberOfLeadingZeros(scale);
3259		} catch (Exception e) {
3260		throw new Error(e);
3261		}
3262	+
3263	+	submitters = new ThreadLocal<Submitter>();
3264	+	defaultForkJoinWorkerThreadFactory =
3265	+	new DefaultForkJoinWorkerThreadFactory();
3266	+	modifyThreadPermission = new RuntimePermission("modifyThread");
3267	+
3268	+	common = java.security.AccessController.doPrivileged
3269	+	(new java.security.PrivilegedAction<ForkJoinPool>() {
3270	+	public ForkJoinPool run() { return makeCommonPool(); }});
3271	+	int par = common.parallelism; // report 1 even if threads disabled
3272	+	commonParallelism = par > 0 ? par : 1;
3273	+	}
3274	+
3275	+	/**
3276	+	* Creates and returns the common pool, respecting user settings
3277	+	* specified via system properties.
3278	+	*/
3279	+	private static ForkJoinPool makeCommonPool() {
3280	+	int parallelism = -1;
3281	+	ForkJoinWorkerThreadFactory factory
3282	+	= defaultForkJoinWorkerThreadFactory;
3283	+	UncaughtExceptionHandler handler = null;
3284	+	try { // ignore exceptions in accessing/parsing properties
3285	+	String pp = System.getProperty
3286	+	("java.util.concurrent.ForkJoinPool.common.parallelism");
3287	+	String fp = System.getProperty
3288	+	("java.util.concurrent.ForkJoinPool.common.threadFactory");
3289	+	String hp = System.getProperty
3290	+	("java.util.concurrent.ForkJoinPool.common.exceptionHandler");
3291	+	if (pp != null)
3292	+	parallelism = Integer.parseInt(pp);
3293	+	if (fp != null)
3294	+	factory = ((ForkJoinWorkerThreadFactory)ClassLoader.
3295	+	getSystemClassLoader().loadClass(fp).newInstance());
3296	+	if (hp != null)
3297	+	handler = ((UncaughtExceptionHandler)ClassLoader.
3298	+	getSystemClassLoader().loadClass(hp).newInstance());
3299	+	} catch (Exception ignore) {
3300	+	}
3301	+
3302	+	if (parallelism < 0 && // default 1 less than #cores
3303	+	(parallelism = Runtime.getRuntime().availableProcessors() - 1) < 0)
3304	+	parallelism = 0;
3305	+	if (parallelism > MAX_CAP)
3306	+	parallelism = MAX_CAP;
3307	+	return new ForkJoinPool(parallelism, factory, handler, LIFO_QUEUE,
3308	+	"ForkJoinPool.commonPool-worker-");
3309		}
3310
3311		/**
#	Line 3195 \| Line 3318 \| public class ForkJoinPool extends Abstra
3318		private static sun.misc.Unsafe getUnsafe() {
3319		try {
3320		return sun.misc.Unsafe.getUnsafe();
3321	<	} catch (SecurityException se) {
3322	<	try {
3323	<	return java.security.AccessController.doPrivileged
3324	<	(new java.security
3325	<	.PrivilegedExceptionAction<sun.misc.Unsafe>() {
3326	<	public sun.misc.Unsafe run() throws Exception {
3327	<	java.lang.reflect.Field f = sun.misc
3328	<	.Unsafe.class.getDeclaredField("theUnsafe");
3329	<	f.setAccessible(true);
3330	<	return (sun.misc.Unsafe) f.get(null);
3331	<	}});
3332	<	} catch (java.security.PrivilegedActionException e) {
3333	<	throw new RuntimeException("Could not initialize intrinsics",
3334	<	e.getCause());
3335	<	}
3321	>	} catch (SecurityException tryReflectionInstead) {}
3322	>	try {
3323	>	return java.security.AccessController.doPrivileged
3324	>	(new java.security.PrivilegedExceptionAction<sun.misc.Unsafe>() {
3325	>	public sun.misc.Unsafe run() throws Exception {
3326	>	Class<sun.misc.Unsafe> k = sun.misc.Unsafe.class;
3327	>	for (java.lang.reflect.Field f : k.getDeclaredFields()) {
3328	>	f.setAccessible(true);
3329	>	Object x = f.get(null);
3330	>	if (k.isInstance(x))
3331	>	return k.cast(x);
3332	>	}
3333	>	throw new NoSuchFieldError("the Unsafe");
3334	>	}});
3335	>	} catch (java.security.PrivilegedActionException e) {
3336	>	throw new RuntimeException("Could not initialize intrinsics",
3337	>	e.getCause());
3338		}
3339		}
3215	–
3340		}

Diff Legend

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

Comparing jsr166/src/jsr166e/ForkJoinPool.java (file contents): Revision 1.11 by dl, Wed Oct 31 12:49:13 2012 UTC vs. Revision 1.61 by jsr166, Sun Jul 14 19:55:05 2013 UTC

Diff Legend

Comparing jsr166/src/jsr166e/ForkJoinPool.java (file contents):
Revision 1.11 by dl, Wed Oct 31 12:49:13 2012 UTC vs.
Revision 1.61 by jsr166, Sun Jul 14 19:55:05 2013 UTC