ViewVC Help

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

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

Comparing jsr166/src/jsr166y/ForkJoinPool.java (file contents):
Revision 1.58 by dl, Fri Jul 23 13:07:43 2010 UTC vs.
Revision 1.81 by jsr166, Mon Sep 20 20:42:36 2010 UTC

#	Line 6 | Line 6
6
7		package jsr166y;
8
9	–	import java.util.concurrent.*;
10	–
9		import java.util.ArrayList;
10		import java.util.Arrays;
11		import java.util.Collection;
12		import java.util.Collections;
13		import java.util.List;
14	+	import java.util.concurrent.AbstractExecutorService;
15	+	import java.util.concurrent.Callable;
16	+	import java.util.concurrent.ExecutorService;
17	+	import java.util.concurrent.Future;
18	+	import java.util.concurrent.RejectedExecutionException;
19	+	import java.util.concurrent.RunnableFuture;
20	+	import java.util.concurrent.TimeUnit;
21	+	import java.util.concurrent.TimeoutException;
22	+	import java.util.concurrent.atomic.AtomicInteger;
23		import java.util.concurrent.locks.LockSupport;
24		import java.util.concurrent.locks.ReentrantLock;
18	–	import java.util.concurrent.atomic.AtomicInteger;
19	–	import java.util.concurrent.CountDownLatch;
25
26		/**
27		* An {@link ExecutorService} for running {@link ForkJoinTask}s.
#	Line 52 | Line 57 | import java.util.concurrent.CountDownLat
57		* convenient form for informal monitoring.
58		*
59		* <p> As is the case with other ExecutorServices, there are three
60	<	* main task execution methods summarized in the follwoing
60	>	* main task execution methods summarized in the following
61		* table. These are designed to be used by clients not already engaged
62		* in fork/join computations in the current pool.  The main forms of
63		* these methods accept instances of {@code ForkJoinTask}, but
#	Line 60 | Line 65 | import java.util.concurrent.CountDownLat
65		* Runnable}- or {@code Callable}- based activities as well.  However,
66		* tasks that are already executing in a pool should normally
67		* <em>NOT</em> use these pool execution methods, but instead use the
68	<	* within-computation forms listed in the table.
68	>	* within-computation forms listed in the table.
69		*
70		* <table BORDER CELLPADDING=3 CELLSPACING=1>
71		*  <tr>
#	Line 69 | Line 74 | import java.util.concurrent.CountDownLat
74		*    <td ALIGN=CENTER> <b>Call from within fork/join computations</b></td>
75		*  </tr>
76		*  <tr>
77	<	*    <td> <b>Arange async execution</td>
77	>	*    <td> <b>Arrange async execution</td>
78		*    <td> {@link #execute(ForkJoinTask)}</td>
79		*    <td> {@link ForkJoinTask#fork}</td>
80		*  </tr>
#	Line 84 | Line 89 | import java.util.concurrent.CountDownLat
89		*    <td> {@link ForkJoinTask#fork} (ForkJoinTasks <em>are</em> Futures)</td>
90		*  </tr>
91		* </table>
92	<	*
92	>	*
93		* <p><b>Sample Usage.</b> Normally a single {@code ForkJoinPool} is
94		* used for all parallel task execution in a program or subsystem.
95		* Otherwise, use would not usually outweigh the construction and
#	Line 110 | Line 115 | import java.util.concurrent.CountDownLat
115		*
116		* <p>This implementation rejects submitted tasks (that is, by throwing
117		* {@link RejectedExecutionException}) only when the pool is shut down
118	<	* or internal resources have been exhuasted.
118	>	* or internal resources have been exhausted.
119		*
120		* @since 1.7
121		* @author Doug Lea
#	Line 138 | Line 143 | public class ForkJoinPool extends Abstra
143		* cache pollution effects.)
144		*
145		* Beyond work-stealing support and essential bookkeeping, the
146	<	* main responsibility of this framework is to arrange tactics for
147	<	* when one worker is waiting to join a task stolen (or always
148	<	* held by) another.  Becauae we are multiplexing many tasks on to
149	<	* a pool of workers, we can't just let them block (as in
150	<	* Thread.join).  We also cannot just reassign the joiner's
151	<	* run-time stack with another and replace it later, which would
152	<	* be a form of "continuation", that even if possible is not
153	<	* necessarily a good idea. Given that the creation costs of most
154	<	* threads on most systems mainly surrounds setting up runtime
155	<	* stacks, thread creation and switching is usually not much more
156	<	* expensive than stack creation and switching, and is more
157	<	* flexible). Instead we combine two tactics:
146	>	* main responsibility of this framework is to take actions when
147	>	* one worker is waiting to join a task stolen (or always held by)
148	>	* another.  Because we are multiplexing many tasks on to a pool
149	>	* of workers, we can't just let them block (as in Thread.join).
150	>	* We also cannot just reassign the joiner's run-time stack with
151	>	* another and replace it later, which would be a form of
152	>	* "continuation", that even if possible is not necessarily a good
153	>	* idea. Given that the creation costs of most threads on most
154	>	* systems mainly surrounds setting up runtime stacks, thread
155	>	* creation and switching is usually not much more expensive than
156	>	* stack creation and switching, and is more flexible). Instead we
157	>	* combine two tactics:
158		*
159	<	*   1. Arranging for the joiner to execute some task that it
159	>	*   Helping: Arranging for the joiner to execute some task that it
160		*      would be running if the steal had not occurred.  Method
161		*      ForkJoinWorkerThread.helpJoinTask tracks joining->stealing
162		*      links to try to find such a task.
163		*
164	<	*   2. Unless there are already enough live threads, creating or
165	<	*      or re-activating a spare thread to compensate for the
166	<	*      (blocked) joiner until it unblocks.  Spares then suspend
167	<	*      at their next opportunity or eventually die if unused for
168	<	*      too long.  See below and the internal documentation
169	<	*      for tryAwaitJoin for more details about compensation
170	<	*      rules.
171	<	*
172	<	* Because the determining existence of conservatively safe
173	<	* helping targets, the availability of already-created spares,
174	<	* and the apparent need to create new spares are all racy and
175	<	* require heuristic guidance, joins (in
176	<	* ForkJoinWorkerThread.joinTask) interleave these options until
177	<	* successful.  Creating a new spare always succeeds, but also
178	<	* increases application footprint, so we try to avoid it, within
179	<	* reason.
164	>	*   Compensating: Unless there are already enough live threads,
165	>	*      method helpMaintainParallelism() may create or
166	>	*      re-activate a spare thread to compensate for blocked
167	>	*      joiners until they unblock.
168	>	*
169	>	* It is impossible to keep exactly the target (parallelism)
170	>	* number of threads running at any given time.  Determining
171	>	* existence of conservatively safe helping targets, the
172	>	* availability of already-created spares, and the apparent need
173	>	* to create new spares are all racy and require heuristic
174	>	* guidance, so we rely on multiple retries of each.  Compensation
175	>	* occurs in slow-motion. It is triggered only upon timeouts of
176	>	* Object.wait used for joins. This reduces poor decisions that
177	>	* would otherwise be made when threads are waiting for others
178	>	* that are stalled because of unrelated activities such as
179	>	* garbage collection.
180		*
181	<	* The ManagedBlocker extension API can't use option (1) so uses a
182	<	* special version of (2) in method awaitBlocker.
181	>	* The ManagedBlocker extension API can't use helping so relies
182	>	* only on compensation in method awaitBlocker.
183		*
184		* The main throughput advantages of work-stealing stem from
185		* decentralized control -- workers mostly steal tasks from each
#	Line 207 | Line 212 | public class ForkJoinPool extends Abstra
212		* blocked workers. However, all other support code is set up to
213		* work with other policies.
214		*
215	+	* To ensure that we do not hold on to worker references that
216	+	* would prevent GC, ALL accesses to workers are via indices into
217	+	* the workers array (which is one source of some of the unusual
218	+	* code constructions here). In essence, the workers array serves
219	+	* as a WeakReference mechanism. Thus for example the event queue
220	+	* stores worker indices, not worker references. Access to the
221	+	* workers in associated methods (for example releaseEventWaiters)
222	+	* must both index-check and null-check the IDs. All such accesses
223	+	* ignore bad IDs by returning out early from what they are doing,
224	+	* since this can only be associated with shutdown, in which case
225	+	* it is OK to give up. On termination, we just clobber these
226	+	* data structures without trying to use them.
227	+	*
228		* 2. Bookkeeping for dynamically adding and removing workers. We
229		* aim to approximately maintain the given level of parallelism.
230		* When some workers are known to be blocked (on joins or via
231		* ManagedBlocker), we may create or resume others to take their
232		* place until they unblock (see below). Implementing this
233		* requires counts of the number of "running" threads (i.e., those
234	<	* that are neither blocked nor artifically suspended) as well as
234	>	* that are neither blocked nor artificially suspended) as well as
235		* the total number.  These two values are packed into one field,
236		* "workerCounts" because we need accurate snapshots when deciding
237		* to create, resume or suspend.  Note however that the
238	<	* correspondance of these counts to reality is not guaranteed. In
238	>	* correspondence of these counts to reality is not guaranteed. In
239		* particular updates for unblocked threads may lag until they
240		* actually wake up.
241		*
#	Line 248 | Line 266 | public class ForkJoinPool extends Abstra
266		* workers that previously could not find a task to now find one:
267		* Submission of a new task to the pool, or another worker pushing
268		* a task onto a previously empty queue.  (We also use this
269	<	* mechanism for termination and reconfiguration actions that
269	>	* mechanism for configuration and termination actions that
270		* require wakeups of idle workers).  Each worker maintains its
271		* last known event count, and blocks when a scan for work did not
272		* find a task AND its lastEventCount matches the current
#	Line 259 | Line 277 | public class ForkJoinPool extends Abstra
277		* a record (field nextEventWaiter) for the next waiting worker.
278		* In addition to allowing simpler decisions about need for
279		* wakeup, the event count bits in eventWaiters serve the role of
280	<	* tags to avoid ABA errors in Treiber stacks.  To reduce delays
281	<	* in task diffusion, workers not otherwise occupied may invoke
282	<	* method releaseWaiters, that removes and signals (unparks)
283	<	* workers not waiting on current count. To minimize task
284	<	* production stalls associate with signalling, any worker pushing
285	<	* a task on an empty queue invokes the weaker method signalWork,
268	<	* that only releases idle workers until it detects interference
269	<	* by other threads trying to release, and lets them take
270	<	* over. The net effect is a tree-like diffusion of signals, where
271	<	* released threads (and possibly others) help with unparks.  To
272	<	* further reduce contention effects a bit, failed CASes to
273	<	* increment field eventCount are tolerated without retries.
280	>	* tags to avoid ABA errors in Treiber stacks. Upon any wakeup,
281	>	* released threads also try to release at most two others.  The
282	>	* net effect is a tree-like diffusion of signals, where released
283	>	* threads (and possibly others) help with unparks.  To further
284	>	* reduce contention effects a bit, failed CASes to increment
285	>	* field eventCount are tolerated without retries in signalWork.
286		* Conceptually they are merged into the same event, which is OK
287		* when their only purpose is to enable workers to scan for work.
288		*
289	<	* 5. Managing suspension of extra workers. When a worker is about
290	<	* to block waiting for a join (or via ManagedBlockers), we may
291	<	* create a new thread to maintain parallelism level, or at least
292	<	* avoid starvation. Usually, extra threads are needed for only
293	<	* very short periods, yet join dependencies are such that we
294	<	* sometimes need them in bursts. Rather than create new threads
295	<	* each time this happens, we suspend no-longer-needed extra ones
296	<	* as "spares". For most purposes, we don't distinguish "extra"
297	<	* spare threads from normal "core" threads: On each call to
298	<	* preStep (the only point at which we can do this) a worker
299	<	* checks to see if there are now too many running workers, and if
300	<	* so, suspends itself.  Methods tryAwaitJoin and awaitBlocker
301	<	* look for suspended threads to resume before considering
302	<	* creating a new replacement. We don't need a special data
303	<	* structure to maintain spares; simply scanning the workers array
304	<	* looking for worker.isSuspended() is fine because the calling
305	<	* thread is otherwise not doing anything useful anyway; we are at
306	<	* least as happy if after locating a spare, the caller doesn't
307	<	* actually block because the join is ready before we try to
308	<	* adjust and compensate.  Note that this is intrinsically racy.
309	<	* One thread may become a spare at about the same time as another
310	<	* is needlessly being created. We counteract this and related
311	<	* slop in part by requiring resumed spares to immediately recheck
312	<	* (in preStep) to see whether they they should re-suspend. The
313	<	* only effective difference between "extra" and "core" threads is
314	<	* that we allow the "extra" ones to time out and die if they are
315	<	* not resumed within a keep-alive interval of a few seconds. This
316	<	* is implemented mainly within ForkJoinWorkerThread, but requires
317	<	* some coordination (isTrimmed() -- meaning killed while
318	<	* suspended) to correctly maintain pool counts.
319	<	*
320	<	* 6. Deciding when to create new workers. The main dynamic
321	<	* control in this class is deciding when to create extra threads,
322	<	* in methods awaitJoin and awaitBlocker. We always need to create
323	<	* one when the number of running threads would become zero and
324	<	* all workers are busy. However, this is not easy to detect
325	<	* reliably in the presence of transients so we use retries and
326	<	* allow slack (in tryAwaitJoin) to reduce false alarms.  These
327	<	* effectively reduce churn at the price of systematically
328	<	* undershooting target parallelism when many threads are blocked.
329	<	* However, biasing toward undeshooting partially compensates for
330	<	* the above mechanics to suspend extra threads, that normally
331	<	* lead to overshoot because we can only suspend workers
332	<	* in-between top-level actions. It also better copes with the
333	<	* fact that some of the methods in this class tend to never
334	<	* become compiled (but are interpreted), so some components of
335	<	* the entire set of controls might execute many times faster than
336	<	* others. And similarly for cases where the apparent lack of work
337	<	* is just due to GC stalls and other transient system activity.
289	>	* 5. Managing suspension of extra workers. When a worker notices
290	>	* (usually upon timeout of a wait()) that there are too few
291	>	* running threads, we may create a new thread to maintain
292	>	* parallelism level, or at least avoid starvation. Usually, extra
293	>	* threads are needed for only very short periods, yet join
294	>	* dependencies are such that we sometimes need them in
295	>	* bursts. Rather than create new threads each time this happens,
296	>	* we suspend no-longer-needed extra ones as "spares". For most
297	>	* purposes, we don't distinguish "extra" spare threads from
298	>	* normal "core" threads: On each call to preStep (the only point
299	>	* at which we can do this) a worker checks to see if there are
300	>	* now too many running workers, and if so, suspends itself.
301	>	* Method helpMaintainParallelism looks for suspended threads to
302	>	* resume before considering creating a new replacement. The
303	>	* spares themselves are encoded on another variant of a Treiber
304	>	* Stack, headed at field "spareWaiters".  Note that the use of
305	>	* spares is intrinsically racy.  One thread may become a spare at
306	>	* about the same time as another is needlessly being created. We
307	>	* counteract this and related slop in part by requiring resumed
308	>	* spares to immediately recheck (in preStep) to see whether they
309	>	* should re-suspend.
310	>	*
311	>	* 6. Killing off unneeded workers. A timeout mechanism is used to
312	>	* shed unused workers: The oldest (first) event queue waiter uses
313	>	* a timed rather than hard wait. When this wait times out without
314	>	* a normal wakeup, it tries to shutdown any one (for convenience
315	>	* the newest) other spare or event waiter via
316	>	* tryShutdownUnusedWorker. This eventually reduces the number of
317	>	* worker threads to a minimum of one after a long enough period
318	>	* without use.
319	>	*
320	>	* 7. Deciding when to create new workers. The main dynamic
321	>	* control in this class is deciding when to create extra threads
322	>	* in method helpMaintainParallelism. We would like to keep
323	>	* exactly #parallelism threads running, which is an impossible
324	>	* task. We always need to create one when the number of running
325	>	* threads would become zero and all workers are busy. Beyond
326	>	* this, we must rely on heuristics that work well in the
327	>	* presence of transient phenomena such as GC stalls, dynamic
328	>	* compilation, and wake-up lags. These transients are extremely
329	>	* common -- we are normally trying to fully saturate the CPUs on
330	>	* a machine, so almost any activity other than running tasks
331	>	* impedes accuracy. Our main defense is to allow parallelism to
332	>	* lapse for a while during joins, and use a timeout to see if,
333	>	* after the resulting settling, there is still a need for
334	>	* additional workers.  This also better copes with the fact that
335	>	* some of the methods in this class tend to never become compiled
336	>	* (but are interpreted), so some components of the entire set of
337	>	* controls might execute 100 times faster than others. And
338	>	* similarly for cases where the apparent lack of work is just due
339	>	* to GC stalls and other transient system activity.
340		*
341		* Beware that there is a lot of representation-level coupling
342		* among classes ForkJoinPool, ForkJoinWorkerThread, and
#	Line 335 | Line 349 | public class ForkJoinPool extends Abstra
349		*
350		* Style notes: There are lots of inline assignments (of form
351		* "while ((local = field) != 0)") which are usually the simplest
352	<	* way to ensure read orderings. Also several occurrences of the
353	<	* unusual "do {} while(!cas...)" which is the simplest way to
354	<	* force an update of a CAS'ed variable. There are also other
355	<	* coding oddities that help some methods perform reasonably even
356	<	* when interpreted (not compiled), at the expense of messiness.
352	>	* way to ensure the required read orderings (which are sometimes
353	>	* critical). Also several occurrences of the unusual "do {}
354	>	* while (!cas...)" which is the simplest way to force an update of
355	>	* a CAS'ed variable. There are also other coding oddities that
356	>	* help some methods perform reasonably even when interpreted (not
357	>	* compiled), at the expense of some messy constructions that
358	>	* reduce byte code counts.
359		*
360		* The order of declarations in this file is: (1) statics (2)
361		* fields (along with constants used when unpacking some of them)
#	Line 407 | Line 423 | public class ForkJoinPool extends Abstra
423		new AtomicInteger();
424
425		/**
426	<	* Absolute bound for parallelism level. Twice this number must
427	<	* fit into a 16bit field to enable word-packing for some counts.
426	>	* The time to block in a join (see awaitJoin) before checking if
427	>	* a new worker should be (re)started to maintain parallelism
428	>	* level. The value should be short enough to maintain global
429	>	* responsiveness and progress but long enough to avoid
430	>	* counterproductive firings during GC stalls or unrelated system
431	>	* activity, and to not bog down systems with continual re-firings
432	>	* on GCs or legitimately long waits.
433	>	*/
434	>	private static final long JOIN_TIMEOUT_MILLIS = 250L; // 4 per second
435	>
436	>	/**
437	>	* The wakeup interval (in nanoseconds) for the oldest worker
438	>	* waiting for an event to invoke tryShutdownUnusedWorker to
439	>	* shrink the number of workers.  The exact value does not matter
440	>	* too much. It must be short enough to release resources during
441	>	* sustained periods of idleness, but not so short that threads
442	>	* are continually re-created.
443	>	*/
444	>	private static final long SHRINK_RATE_NANOS =
445	>	30L * 1000L * 1000L * 1000L; // 2 per minute
446	>
447	>	/**
448	>	* Absolute bound for parallelism level. Twice this number plus
449	>	* one (i.e., 0xfff) must fit into a 16bit field to enable
450	>	* word-packing for some counts and indices.
451		*/
452	<	private static final int MAX_THREADS = 0x7fff;
452	>	private static final int MAX_WORKERS   = 0x7fff;
453
454		/**
455		* Array holding all worker threads in the pool.  Array size must
#	Line 450 | Line 489 | public class ForkJoinPool extends Abstra
489		private volatile long stealCount;
490
491		/**
492	<	* Encoded record of top of treiber stack of threads waiting for
492	>	* Encoded record of top of Treiber stack of threads waiting for
493		* events. The top 32 bits contain the count being waited for. The
494	<	* bottom word contains one plus the pool index of waiting worker
495	<	* thread.
494	>	* bottom 16 bits contains one plus the pool index of waiting
495	>	* worker thread. (Bits 16-31 are unused.)
496		*/
497		private volatile long eventWaiters;
498
499		private static final int  EVENT_COUNT_SHIFT = 32;
500	<	private static final long WAITER_ID_MASK = (1L << EVENT_COUNT_SHIFT)-1L;
500	>	private static final long WAITER_ID_MASK    = (1L << 16) - 1L;
501
502		/**
503		* A counter for events that may wake up worker threads:
504		*   - Submission of a new task to the pool
505		*   - A worker pushing a task on an empty queue
506	<	*   - termination and reconfiguration
506	>	*   - termination
507		*/
508		private volatile int eventCount;
509
510		/**
511	+	* Encoded record of top of Treiber stack of spare threads waiting
512	+	* for resumption. The top 16 bits contain an arbitrary count to
513	+	* avoid ABA effects. The bottom 16bits contains one plus the pool
514	+	* index of waiting worker thread.
515	+	*/
516	+	private volatile int spareWaiters;
517	+
518	+	private static final int SPARE_COUNT_SHIFT = 16;
519	+	private static final int SPARE_ID_MASK     = (1 << 16) - 1;
520	+
521	+	/**
522		* Lifecycle control. The low word contains the number of workers
523		* that are (probably) executing tasks. This value is atomically
524		* incremented before a worker gets a task to run, and decremented
525	<	* when worker has no tasks and cannot find any.  Bits 16-18
525	>	* when a worker has no tasks and cannot find any.  Bits 16-18
526		* contain runLevel value. When all are zero, the pool is
527		* running. Level transitions are monotonic (running -> shutdown
528		* -> terminating -> terminated) so each transition adds a bit.
529		* These are bundled together to ensure consistent read for
530		* termination checks (i.e., that runLevel is at least SHUTDOWN
531		* and active threads is zero).
532	+	*
533	+	* Notes: Most direct CASes are dependent on these bitfield
534	+	* positions.  Also, this field is non-private to enable direct
535	+	* performance-sensitive CASes in ForkJoinWorkerThread.
536		*/
537	<	private volatile int runState;
537	>	volatile int runState;
538
539		// Note: The order among run level values matters.
540		private static final int RUNLEVEL_SHIFT     = 16;
#	Line 488 | Line 542 | public class ForkJoinPool extends Abstra
542		private static final int TERMINATING        = 1 << (RUNLEVEL_SHIFT + 1);
543		private static final int TERMINATED         = 1 << (RUNLEVEL_SHIFT + 2);
544		private static final int ACTIVE_COUNT_MASK  = (1 << RUNLEVEL_SHIFT) - 1;
491	–	private static final int ONE_ACTIVE         = 1; // active update delta
545
546		/**
547		* Holds number of total (i.e., created and not yet terminated)
#	Line 497 | Line 550 | public class ForkJoinPool extends Abstra
550		* making decisions about creating and suspending spare
551		* threads. Updated only by CAS. Note that adding a new worker
552		* requires incrementing both counts, since workers start off in
553	<	* running state.  This field is also used for memory-fencing
501	<	* configuration parameters.
553	>	* running state.
554		*/
555		private volatile int workerCounts;
556
#	Line 530 | Line 582 | public class ForkJoinPool extends Abstra
582		*/
583		private final int poolNumber;
584
585	<	// Utilities for CASing fields. Note that several of these
586	<	// are manually inlined by callers
585	>	// Utilities for CASing fields. Note that most of these
586	>	// are usually manually inlined by callers
587
588		/**
589	<	* Increments running count.  Also used by ForkJoinTask.
589	>	* Increments running count part of workerCounts
590		*/
591		final void incrementRunningCount() {
592		int c;
593		do {} while (!UNSAFE.compareAndSwapInt(this, workerCountsOffset,
594	<	c = workerCounts,
594	>	c = workerCounts,
595		c + ONE_RUNNING));
596		}
597
#	Line 555 | Line 607 | public class ForkJoinPool extends Abstra
607		}
608
609		/**
610	<	* Tries to increment running count
611	<	*/
560	<	final boolean tryIncrementRunningCount() {
561	<	int wc;
562	<	return UNSAFE.compareAndSwapInt(this, workerCountsOffset,
563	<	wc = workerCounts, wc + ONE_RUNNING);
564	<	}
565	<
566	<	/**
567	<	* Tries incrementing active count; fails on contention.
568	<	* Called by workers before executing tasks.
610	>	* Forces decrement of encoded workerCounts, awaiting nonzero if
611	>	* (rarely) necessary when other count updates lag.
612		*
613	<	* @return true on success
613	>	* @param dr -- either zero or ONE_RUNNING
614	>	* @param dt -- either zero or ONE_TOTAL
615		*/
616	<	final boolean tryIncrementActiveCount() {
617	<	int c;
618	<	return UNSAFE.compareAndSwapInt(this, runStateOffset,
619	<	c = runState, c + ONE_ACTIVE);
616	>	private void decrementWorkerCounts(int dr, int dt) {
617	>	for (;;) {
618	>	int wc = workerCounts;
619	>	if ((wc & RUNNING_COUNT_MASK)  - dr < 0 ||
620	>	(wc >>> TOTAL_COUNT_SHIFT) - dt < 0) {
621	>	if ((runState & TERMINATED) != 0)
622	>	return; // lagging termination on a backout
623	>	Thread.yield();
624	>	}
625	>	if (UNSAFE.compareAndSwapInt(this, workerCountsOffset,
626	>	wc, wc - (dr + dt)))
627	>	return;
628	>	}
629		}
630
631		/**
#	Line 582 | Line 635 | public class ForkJoinPool extends Abstra
635		final boolean tryDecrementActiveCount() {
636		int c;
637		return UNSAFE.compareAndSwapInt(this, runStateOffset,
638	<	c = runState, c - ONE_ACTIVE);
638	>	c = runState, c - 1);
639		}
640
641		/**
#	Line 611 | Line 664 | public class ForkJoinPool extends Abstra
664		lock.lock();
665		try {
666		ForkJoinWorkerThread[] ws = workers;
667	<	int nws = ws.length;
668	<	if (k < 0 || k >= nws || ws[k] != null) {
669	<	for (k = 0; k < nws && ws[k] != null; ++k)
667	>	int n = ws.length;
668	>	if (k < 0 || k >= n || ws[k] != null) {
669	>	for (k = 0; k < n && ws[k] != null; ++k)
670		;
671	<	if (k == nws)
672	<	ws = Arrays.copyOf(ws, nws << 1);
671	>	if (k == n)
672	>	ws = Arrays.copyOf(ws, n << 1);
673		}
674		ws[k] = w;
675		workers = ws; // volatile array write ensures slot visibility
#	Line 627 | Line 680 | public class ForkJoinPool extends Abstra
680		}
681
682		/**
683	<	* Nulls out record of worker in workers array
683	>	* Nulls out record of worker in workers array.
684		*/
685		private void forgetWorker(ForkJoinWorkerThread w) {
686		int idx = w.poolIndex;
687	<	// Locking helps method recordWorker avoid unecessary expansion
687	>	// Locking helps method recordWorker avoid unnecessary expansion
688		final ReentrantLock lock = this.workerLock;
689		lock.lock();
690		try {
#	Line 643 | Line 696 | public class ForkJoinPool extends Abstra
696		}
697		}
698
646	–	// adding and removing workers
647	–
699		/**
700	<	* Tries to create and add new worker. Assumes that worker counts
701	<	* are already updated to accommodate the worker, so adjusts on
702	<	* failure.
700	>	* Final callback from terminating worker.  Removes record of
701	>	* worker from array, and adjusts counts. If pool is shutting
702	>	* down, tries to complete termination.
703		*
704	<	* @return new worker or null if creation failed
704	>	* @param w the worker
705		*/
706	<	private ForkJoinWorkerThread addWorker() {
707	<	ForkJoinWorkerThread w = null;
708	<	try {
709	<	w = factory.newThread(this);
710	<	} finally { // Adjust on either null or exceptional factory return
711	<	if (w == null) {
661	<	onWorkerCreationFailure();
662	<	return null;
663	<	}
664	<	}
665	<	w.start(recordWorker(w), ueh);
666	<	return w;
706	>	final void workerTerminated(ForkJoinWorkerThread w) {
707	>	forgetWorker(w);
708	>	decrementWorkerCounts(w.isTrimmed()? 0 : ONE_RUNNING, ONE_TOTAL);
709	>	while (w.stealCount != 0) // collect final count
710	>	tryAccumulateStealCount(w);
711	>	tryTerminate(false);
712		}
713
714	+	// Waiting for and signalling events
715	+
716		/**
717	<	* Adjusts counts upon failure to create worker
717	>	* Releases workers blocked on a count not equal to current count.
718	>	* Normally called after precheck that eventWaiters isn't zero to
719	>	* avoid wasted array checks. Gives up upon a change in count or
720	>	* upon releasing two workers, letting others take over.
721		*/
722	<	private void onWorkerCreationFailure() {
723	<	for (;;) {
724	<	int wc = workerCounts;
725	<	if ((wc >>> TOTAL_COUNT_SHIFT) == 0)
726	<	Thread.yield(); // wait for other counts to settle
727	<	else if (UNSAFE.compareAndSwapInt(this, workerCountsOffset, wc,
728	<	wc - (ONE_RUNNING|ONE_TOTAL)))
722	>	private void releaseEventWaiters() {
723	>	ForkJoinWorkerThread[] ws = workers;
724	>	int n = ws.length;
725	>	long h = eventWaiters;
726	>	int ec = eventCount;
727	>	boolean releasedOne = false;
728	>	ForkJoinWorkerThread w; int id;
729	>	while ((id = ((int)(h & WAITER_ID_MASK)) - 1) >= 0 &&
730	>	(int)(h >>> EVENT_COUNT_SHIFT) != ec &&
731	>	id < n && (w = ws[id]) != null) {
732	>	if (UNSAFE.compareAndSwapLong(this, eventWaitersOffset,
733	>	h,  w.nextWaiter)) {
734	>	LockSupport.unpark(w);
735	>	if (releasedOne) // exit on second release
736	>	break;
737	>	releasedOne = true;
738	>	}
739	>	if (eventCount != ec)
740		break;
741	+	h = eventWaiters;
742		}
681	–	tryTerminate(false); // in case of failure during shutdown
743		}
744
745		/**
746	<	* Creates and/or resumes enough workers to establish target
747	<	* parallelism, giving up if terminating or addWorker fails
687	<	*
688	<	* TODO: recast this to support lazier creation and automated
689	<	* parallelism maintenance
746	>	* Tries to advance eventCount and releases waiters. Called only
747	>	* from workers.
748		*/
749	<	private void ensureEnoughWorkers() {
750	<	for (;;) {
751	<	int pc = parallelism;
752	<	int wc = workerCounts;
753	<	int rc = wc & RUNNING_COUNT_MASK;
696	<	int tc = wc >>> TOTAL_COUNT_SHIFT;
697	<	if (tc < pc) {
698	<	if (runState == TERMINATING ||
699	<	(UNSAFE.compareAndSwapInt
700	<	(this, workerCountsOffset,
701	<	wc, wc + (ONE_RUNNING|ONE_TOTAL)) &&
702	<	addWorker() == null))
703	<	break;
704	<	}
705	<	else if (tc > pc && rc < pc &&
706	<	tc > (runState & ACTIVE_COUNT_MASK)) {
707	<	ForkJoinWorkerThread spare = null;
708	<	ForkJoinWorkerThread[] ws = workers;
709	<	int nws = ws.length;
710	<	for (int i = 0; i < nws; ++i) {
711	<	ForkJoinWorkerThread w = ws[i];
712	<	if (w != null && w.isSuspended()) {
713	<	if ((workerCounts & RUNNING_COUNT_MASK) > pc ||
714	<	runState == TERMINATING)
715	<	return;
716	<	if (w.tryResumeSpare())
717	<	incrementRunningCount();
718	<	break;
719	<	}
720	<	}
721	<	}
722	<	else
723	<	break;
724	<	}
749	>	final void signalWork() {
750	>	int c; // try to increment event count -- CAS failure OK
751	>	UNSAFE.compareAndSwapInt(this, eventCountOffset, c = eventCount, c+1);
752	>	if (eventWaiters != 0L)
753	>	releaseEventWaiters();
754		}
755
756		/**
757	<	* Final callback from terminating worker.  Removes record of
758	<	* worker from array, and adjusts counts. If pool is shutting
730	<	* down, tries to complete terminatation, else possibly replaces
731	<	* the worker.
757	>	* Adds the given worker to event queue and blocks until
758	>	* terminating or event count advances from the given value
759		*
760	<	* @param w the worker
760	>	* @param w the calling worker thread
761	>	* @param ec the count
762		*/
763	<	final void workerTerminated(ForkJoinWorkerThread w) {
764	<	if (w.active) { // force inactive
765	<	w.active = false;
766	<	do {} while (!tryDecrementActiveCount());
767	<	}
768	<	forgetWorker(w);
769	<
770	<	// Decrement total count, and if was running, running count
771	<	// Spin (waiting for other updates) if either would be negative
772	<	int nr = w.isTrimmed() ? 0 : ONE_RUNNING;
745	<	int unit = ONE_TOTAL + nr;
746	<	for (;;) {
747	<	int wc = workerCounts;
748	<	int rc = wc & RUNNING_COUNT_MASK;
749	<	if (rc - nr < 0 || (wc >>> TOTAL_COUNT_SHIFT) == 0)
750	<	Thread.yield(); // back off if waiting for other updates
751	<	else if (UNSAFE.compareAndSwapInt(this, workerCountsOffset,
752	<	wc, wc - unit))
763	>	private void eventSync(ForkJoinWorkerThread w, int ec) {
764	>	long nh = (((long)ec) << EVENT_COUNT_SHIFT) | ((long)(w.poolIndex+1));
765	>	long h;
766	>	while ((runState < SHUTDOWN || !tryTerminate(false)) &&
767	>	(((int)((h = eventWaiters) & WAITER_ID_MASK)) == 0 ||
768	>	(int)(h >>> EVENT_COUNT_SHIFT) == ec) &&
769	>	eventCount == ec) {
770	>	if (UNSAFE.compareAndSwapLong(this, eventWaitersOffset,
771	>	w.nextWaiter = h, nh)) {
772	>	awaitEvent(w, ec);
773		break;
774	+	}
775		}
755	–
756	–	accumulateStealCount(w); // collect final count
757	–	if (!tryTerminate(false))
758	–	ensureEnoughWorkers();
776		}
777
761	–	// Waiting for and signalling events
762	–
778		/**
779	<	* Releases workers blocked on a count not equal to current count.
780	<	* @return true if any released
779	>	* Blocks the given worker (that has already been entered as an
780	>	* event waiter) until terminating or event count advances from
781	>	* the given value. The oldest (first) waiter uses a timed wait to
782	>	* occasionally one-by-one shrink the number of workers (to a
783	>	* minimum of one) if the pool has not been used for extended
784	>	* periods.
785	>	*
786	>	* @param w the calling worker thread
787	>	* @param ec the count
788		*/
789	<	private void releaseWaiters() {
790	<	long top;
791	<	while ((top = eventWaiters) != 0L) {
792	<	ForkJoinWorkerThread[] ws = workers;
793	<	int n = ws.length;
794	<	for (;;) {
795	<	int i = ((int)(top & WAITER_ID_MASK)) - 1;
796	<	if (i < 0 || (int)(top >>> EVENT_COUNT_SHIFT) == eventCount)
797	<	return;
798	<	ForkJoinWorkerThread w;
799	<	if (i < n && (w = ws[i]) != null &&
800	<	UNSAFE.compareAndSwapLong(this, eventWaitersOffset,
801	<	top, w.nextWaiter)) {
802	<	LockSupport.unpark(w);
803	<	top = eventWaiters;
789	>	private void awaitEvent(ForkJoinWorkerThread w, int ec) {
790	>	while (eventCount == ec) {
791	>	if (tryAccumulateStealCount(w)) { // transfer while idle
792	>	boolean untimed = (w.nextWaiter != 0L ||
793	>	(workerCounts & RUNNING_COUNT_MASK) <= 1);
794	>	long startTime = untimed? 0 : System.nanoTime();
795	>	Thread.interrupted();         // clear/ignore interrupt
796	>	if (eventCount != ec || w.isTerminating())
797	>	break;                    // recheck after clear
798	>	if (untimed)
799	>	LockSupport.park(w);
800	>	else {
801	>	LockSupport.parkNanos(w, SHRINK_RATE_NANOS);
802	>	if (eventCount != ec || w.isTerminating())
803	>	break;
804	>	if (System.nanoTime() - startTime >= SHRINK_RATE_NANOS)
805	>	tryShutdownUnusedWorker(ec);
806		}
783	–	else
784	–	break;      // possibly stale; reread
807		}
808		}
809		}
810
811	+	// Maintaining parallelism
812	+
813		/**
814	<	* Ensures eventCount on exit is different (mod 2^32) than on
791	<	* entry and wakes up all waiters
814	>	* Pushes worker onto the spare stack.
815		*/
816	<	private void signalEvent() {
817	<	int c;
818	<	do {} while (!UNSAFE.compareAndSwapInt(this, eventCountOffset,
819	<	c = eventCount, c+1));
797	<	releaseWaiters();
816	>	final void pushSpare(ForkJoinWorkerThread w) {
817	>	int ns = (++w.spareCount << SPARE_COUNT_SHIFT) | (w.poolIndex + 1);
818	>	do {} while (!UNSAFE.compareAndSwapInt(this, spareWaitersOffset,
819	>	w.nextSpare = spareWaiters,ns));
820		}
821
822		/**
823	<	* Advances eventCount and releases waiters until interference by
824	<	* other releasing threads is detected.
823	>	* Tries (once) to resume a spare if the number of running
824	>	* threads is less than target.
825		*/
826	<	final void signalWork() {
827	<	int c;
828	<	UNSAFE.compareAndSwapInt(this, eventCountOffset, c=eventCount, c+1);
829	<	long top;
830	<	while ((top = eventWaiters) != 0L) {
831	<	int ec = eventCount;
832	<	ForkJoinWorkerThread[] ws = workers;
833	<	int n = ws.length;
834	<	for (;;) {
835	<	int i = ((int)(top & WAITER_ID_MASK)) - 1;
836	<	if (i < 0 || (int)(top >>> EVENT_COUNT_SHIFT) == ec)
837	<	return;
838	<	ForkJoinWorkerThread w;
839	<	if (i < n && (w = ws[i]) != null &&
840	<	UNSAFE.compareAndSwapLong(this, eventWaitersOffset,
841	<	top, top = w.nextWaiter)) {
842	<	LockSupport.unpark(w);
843	<	if (top != eventWaiters) // let someone else take over
844	<	return;
845	<	}
824	<	else
825	<	break;      // possibly stale; reread
826	<	}
826	>	private void tryResumeSpare() {
827	>	int sw, id;
828	>	ForkJoinWorkerThread[] ws = workers;
829	>	int n = ws.length;
830	>	ForkJoinWorkerThread w;
831	>	if ((sw = spareWaiters) != 0 &&
832	>	(id = (sw & SPARE_ID_MASK) - 1) >= 0 &&
833	>	id < n && (w = ws[id]) != null &&
834	>	(workerCounts & RUNNING_COUNT_MASK) < parallelism &&
835	>	spareWaiters == sw &&
836	>	UNSAFE.compareAndSwapInt(this, spareWaitersOffset,
837	>	sw, w.nextSpare)) {
838	>	int c; // increment running count before resume
839	>	do {} while (!UNSAFE.compareAndSwapInt
840	>	(this, workerCountsOffset,
841	>	c = workerCounts, c + ONE_RUNNING));
842	>	if (w.tryUnsuspend())
843	>	LockSupport.unpark(w);
844	>	else   // back out if w was shutdown
845	>	decrementWorkerCounts(ONE_RUNNING, 0);
846		}
847		}
848
849		/**
850	<	* If worker is inactive, blocks until terminating or event count
851	<	* advances from last value held by worker; in any case helps
852	<	* release others.
853	<	*
854	<	* @param w the calling worker thread
836	<	* @param retries the number of scans by caller failing to find work
837	<	* @return false if now too many threads running
850	>	* Tries to increase the number of running workers if below target
851	>	* parallelism: If a spare exists tries to resume it via
852	>	* tryResumeSpare.  Otherwise, if not enough total workers or all
853	>	* existing workers are busy, adds a new worker. In all cases also
854	>	* helps wake up releasable workers waiting for work.
855		*/
856	<	private boolean eventSync(ForkJoinWorkerThread w, int retries) {
857	<	int wec = w.lastEventCount;
858	<	if (retries > 1) { // can only block after 2nd miss
859	<	long nextTop = (((long)wec << EVENT_COUNT_SHIFT) |
860	<	((long)(w.poolIndex + 1)));
861	<	long top;
862	<	while ((runState < SHUTDOWN || !tryTerminate(false)) &&
863	<	(((int)(top = eventWaiters) & WAITER_ID_MASK) == 0 ||
864	<	(int)(top >>> EVENT_COUNT_SHIFT) == wec) &&
865	<	eventCount == wec) {
866	<	if (UNSAFE.compareAndSwapLong(this, eventWaitersOffset,
867	<	w.nextWaiter = top, nextTop)) {
868	<	accumulateStealCount(w); // transfer steals while idle
869	<	Thread.interrupted();    // clear/ignore interrupt
870	<	while (eventCount == wec)
871	<	w.doPark();
856	>	private void helpMaintainParallelism() {
857	>	int pc = parallelism;
858	>	int wc, rs, tc;
859	>	while (((wc = workerCounts) & RUNNING_COUNT_MASK) < pc &&
860	>	(rs = runState) < TERMINATING) {
861	>	if (spareWaiters != 0)
862	>	tryResumeSpare();
863	>	else if ((tc = wc >>> TOTAL_COUNT_SHIFT) >= MAX_WORKERS ||
864	>	(tc >= pc && (rs & ACTIVE_COUNT_MASK) != tc))
865	>	break;   // enough total
866	>	else if (runState == rs && workerCounts == wc &&
867	>	UNSAFE.compareAndSwapInt(this, workerCountsOffset, wc,
868	>	wc + (ONE_RUNNING|ONE_TOTAL))) {
869	>	ForkJoinWorkerThread w = null;
870	>	Throwable fail = null;
871	>	try {
872	>	w = factory.newThread(this);
873	>	} catch (Throwable ex) {
874	>	fail = ex;
875	>	}
876	>	if (w == null) { // null or exceptional factory return
877	>	decrementWorkerCounts(ONE_RUNNING, ONE_TOTAL);
878	>	tryTerminate(false); // handle failure during shutdown
879	>	// If originating from an external caller,
880	>	// propagate exception, else ignore
881	>	if (fail != null && runState < TERMINATING &&
882	>	!(Thread.currentThread() instanceof
883	>	ForkJoinWorkerThread))
884	>	UNSAFE.throwException(fail);
885		break;
886		}
887	+	w.start(recordWorker(w), ueh);
888	+	if ((workerCounts >>> TOTAL_COUNT_SHIFT) >= pc) {
889	+	int c; // advance event count
890	+	UNSAFE.compareAndSwapInt(this, eventCountOffset,
891	+	c = eventCount, c+1);
892	+	break; // add at most one unless total below target
893	+	}
894		}
858	–	wec = eventCount;
895		}
896	<	releaseWaiters();
897	<	int wc = workerCounts;
898	<	if ((wc & RUNNING_COUNT_MASK) <= parallelism) {
899	<	w.lastEventCount = wec;
900	<	return true;
896	>	if (eventWaiters != 0L)
897	>	releaseEventWaiters();
898	>	}
899	>
900	>	/**
901	>	* Callback from the oldest waiter in awaitEvent waking up after a
902	>	* period of non-use. If all workers are idle, tries (once) to
903	>	* shutdown an event waiter or a spare, if one exists. Note that
904	>	* we don't need CAS or locks here because the method is called
905	>	* only from one thread occasionally waking (and even misfires are
906	>	* OK). Note that until the shutdown worker fully terminates,
907	>	* workerCounts will overestimate total count, which is tolerable.
908	>	*
909	>	* @param ec the event count waited on by caller (to abort
910	>	* attempt if count has since changed).
911	>	*/
912	>	private void tryShutdownUnusedWorker(int ec) {
913	>	if (runState == 0 && eventCount == ec) { // only trigger if all idle
914	>	ForkJoinWorkerThread[] ws = workers;
915	>	int n = ws.length;
916	>	ForkJoinWorkerThread w = null;
917	>	boolean shutdown = false;
918	>	int sw;
919	>	long h;
920	>	if ((sw = spareWaiters) != 0) { // prefer killing spares
921	>	int id = (sw & SPARE_ID_MASK) - 1;
922	>	if (id >= 0 && id < n && (w = ws[id]) != null &&
923	>	UNSAFE.compareAndSwapInt(this, spareWaitersOffset,
924	>	sw, w.nextSpare))
925	>	shutdown = true;
926	>	}
927	>	else if ((h = eventWaiters) != 0L) {
928	>	long nh;
929	>	int id = ((int)(h & WAITER_ID_MASK)) - 1;
930	>	if (id >= 0 && id < n && (w = ws[id]) != null &&
931	>	(nh = w.nextWaiter) != 0L && // keep at least one worker
932	>	UNSAFE.compareAndSwapLong(this, eventWaitersOffset, h, nh))
933	>	shutdown = true;
934	>	}
935	>	if (w != null && shutdown) {
936	>	w.shutdown();
937	>	LockSupport.unpark(w);
938	>	}
939		}
940	<	if (wec != w.lastEventCount) // back up if may re-wait
867	<	w.lastEventCount = wec - (wc >>> TOTAL_COUNT_SHIFT);
868	<	return false;
940	>	releaseEventWaiters(); // in case of interference
941		}
942
943		/**
944		* Callback from workers invoked upon each top-level action (i.e.,
945	<	* stealing a task or taking a submission and running
946	<	* it). Performs one or both of the following:
945	>	* stealing a task or taking a submission and running it).
946	>	* Performs one or more of the following:
947		*
948	<	* * If the worker cannot find work, updates its active status to
949	<	* inactive and updates activeCount unless there is contention, in
950	<	* which case it may try again (either in this or a subsequent
951	<	* call).  Additionally, awaits the next task event and/or helps
952	<	* wake up other releasable waiters.
953	<	*
954	<	* * If there are too many running threads, suspends this worker
955	<	* (first forcing inactivation if necessary).  If it is not
956	<	* resumed before a keepAlive elapses, the worker may be "trimmed"
957	<	* -- killed while suspended within suspendAsSpare. Otherwise,
958	<	* upon resume it rechecks to make sure that it is still needed.
948	>	* 1. If the worker is active and either did not run a task
949	>	*    or there are too many workers, try to set its active status
950	>	*    to inactive and update activeCount. On contention, we may
951	>	*    try again in this or a subsequent call.
952	>	*
953	>	* 2. If not enough total workers, help create some.
954	>	*
955	>	* 3. If there are too many running workers, suspend this worker
956	>	*    (first forcing inactive if necessary).  If it is not needed,
957	>	*    it may be shutdown while suspended (via
958	>	*    tryShutdownUnusedWorker).  Otherwise, upon resume it
959	>	*    rechecks running thread count and need for event sync.
960	>	*
961	>	* 4. If worker did not run a task, await the next task event via
962	>	*    eventSync if necessary (first forcing inactivation), upon
963	>	*    which the worker may be shutdown via
964	>	*    tryShutdownUnusedWorker.  Otherwise, help release any
965	>	*    existing event waiters that are now releasable,
966		*
967		* @param w the worker
968	<	* @param retries the number of scans by caller failing to find work
890	<	* find any (in which case it may block waiting for work).
968	>	* @param ran true if worker ran a task since last call to this method
969		*/
970	<	final void preStep(ForkJoinWorkerThread w, int retries) {
970	>	final void preStep(ForkJoinWorkerThread w, boolean ran) {
971	>	int wec = w.lastEventCount;
972		boolean active = w.active;
973	<	boolean inactivate = active && retries != 0;
974	<	for (;;) {
975	<	int rs, wc;
976	<	if (inactivate &&
977	<	UNSAFE.compareAndSwapInt(this, runStateOffset,
978	<	rs = runState, rs - ONE_ACTIVE))
973	>	boolean inactivate = false;
974	>	int pc = parallelism;
975	>	while (w.runState == 0) {
976	>	int rs = runState;
977	>	if (rs >= TERMINATING) { // propagate shutdown
978	>	w.shutdown();
979	>	break;
980	>	}
981	>	if ((inactivate || (active && (rs & ACTIVE_COUNT_MASK) >= pc)) &&
982	>	UNSAFE.compareAndSwapInt(this, runStateOffset, rs, rs - 1))
983		inactivate = active = w.active = false;
984	<	if (((wc = workerCounts) & RUNNING_COUNT_MASK) <= parallelism) {
985	<	if (active || eventSync(w, retries))
984	>	int wc = workerCounts;
985	>	if ((wc & RUNNING_COUNT_MASK) > pc) {
986	>	if (!(inactivate |= active) && // must inactivate to suspend
987	>	workerCounts == wc &&      // try to suspend as spare
988	>	UNSAFE.compareAndSwapInt(this, workerCountsOffset,
989	>	wc, wc - ONE_RUNNING))
990	>	w.suspendAsSpare();
991	>	}
992	>	else if ((wc >>> TOTAL_COUNT_SHIFT) < pc)
993	>	helpMaintainParallelism();     // not enough workers
994	>	else if (!ran) {
995	>	long h = eventWaiters;
996	>	int ec = eventCount;
997	>	if (h != 0L && (int)(h >>> EVENT_COUNT_SHIFT) != ec)
998	>	releaseEventWaiters();     // release others before waiting
999	>	else if (ec != wec) {
1000	>	w.lastEventCount = ec;     // no need to wait
1001		break;
1002	+	}
1003	+	else if (!(inactivate |= active))
1004	+	eventSync(w, wec);         // must inactivate before sync
1005		}
1006	<	else if (!(inactivate |= active) &&  // must inactivate to suspend
906	<	UNSAFE.compareAndSwapInt(this, workerCountsOffset,
907	<	wc, wc - ONE_RUNNING) &&
908	<	!w.suspendAsSpare())             // false if trimmed
1006	>	else
1007		break;
1008		}
1009		}
1010
1011		/**
1012	<	* Awaits join of the given task if enough threads, or can resume
1013	<	* or create a spare. Fails (in which case the given task might
916	<	* not be done) upon contention or lack of decision about
917	<	* blocking. Returns void because caller must check
918	<	* task status on return anyway.
919	<	*
920	<	* We allow blocking if:
921	<	*
922	<	* 1. There would still be at least as many running threads as
923	<	*    parallelism level if this thread blocks.
924	<	*
925	<	* 2. A spare is resumed to replace this worker. We tolerate
926	<	*    slop in the decision to replace if a spare is found without
927	<	*    first decrementing run count.  This may release too many,
928	<	*    but if so, the superfluous ones will re-suspend via
929	<	*    preStep().
930	<	*
931	<	* 3. After #spares repeated checks, there are no fewer than #spare
932	<	*    threads not running. We allow this slack to avoid hysteresis
933	<	*    and as a hedge against lag/uncertainty of running count
934	<	*    estimates when signalling or unblocking stalls.
935	<	*
936	<	* 4. All existing workers are busy (as rechecked via repeated
937	<	*    retries by caller) and a new spare is created.
938	<	*
939	<	* If none of the above hold, we try to escape out by
940	<	* re-incrementing count and returning to caller, which can retry
941	<	* later.
1012	>	* Helps and/or blocks awaiting join of the given task.
1013	>	* See above for explanation.
1014		*
1015		* @param joinMe the task to join
1016	<	* @param retries if negative, then serve only as a precheck
945	<	*   that the thread can be replaced by a spare. Otherwise,
946	<	*   the number of repeated calls to this method returning busy
947	<	* @return true if the call must be retried because there
948	<	*   none of the blocking checks hold
1016	>	* @param worker the current worker thread
1017		*/
1018	<	final boolean tryAwaitJoin(ForkJoinTask<?> joinMe, int retries) {
1019	<	if (joinMe.status < 0) // precheck to prime loop
1020	<	return false;
1021	<	int pc = parallelism;
1022	<	boolean running = true; // false when running count decremented
1023	<	outer:for (;;) {
1024	<	int wc = workerCounts;
1025	<	int rc = wc & RUNNING_COUNT_MASK;
1026	<	int tc = wc >>> TOTAL_COUNT_SHIFT;
1027	<	if (running) { // replace with spare or decrement count
1028	<	if (rc <= pc && tc > pc &&
1029	<	(retries > 0 || tc > (runState & ACTIVE_COUNT_MASK))) {
1030	<	ForkJoinWorkerThread[] ws = workers;
1031	<	int nws = ws.length;
1032	<	for (int i = 0; i < nws; ++i) { // search for spare
1033	<	ForkJoinWorkerThread w = ws[i];
1034	<	if (w != null) {
1035	<	if (joinMe.status < 0)
1036	<	return false;
1037	<	if (w.isSuspended()) {
1038	<	if ((workerCounts & RUNNING_COUNT_MASK)>=pc &&
1039	<	w.tryResumeSpare()) {
1040	<	running = false;
1041	<	break outer;
1042	<	}
1043	<	continue outer; // rescan
1044	<	}
977	<	}
978	<	}
979	<	}
980	<	if (retries < 0 || // < 0 means replacement check only
981	<	rc == 0 || joinMe.status < 0 || workerCounts != wc ||
982	<	!UNSAFE.compareAndSwapInt(this, workerCountsOffset,
983	<	wc, wc - ONE_RUNNING))
984	<	return false; // done or inconsistent or contended
985	<	running = false;
986	<	if (rc > pc)
987	<	break;
988	<	}
989	<	else { // allow blocking if enough threads
990	<	if (rc >= pc || joinMe.status < 0)
991	<	break;
992	<	int sc = tc - pc + 1; // = spare threads, plus the one to add
993	<	if (retries > sc) {
994	<	if (rc > 0 && rc >= pc - sc) // allow slack
995	<	break;
996	<	if (tc < MAX_THREADS &&
997	<	tc == (runState & ACTIVE_COUNT_MASK) &&
998	<	workerCounts == wc &&
999	<	UNSAFE.compareAndSwapInt(this, workerCountsOffset, wc,
1000	<	wc+(ONE_RUNNING|ONE_TOTAL))) {
1001	<	addWorker();
1002	<	break;
1003	<	}
1004	<	}
1005	<	if (workerCounts == wc &&        // back out to allow rescan
1006	<	UNSAFE.compareAndSwapInt (this, workerCountsOffset,
1007	<	wc, wc + ONE_RUNNING)) {
1008	<	releaseWaiters();            // help others progress
1009	<	return true;                 // let caller retry
1010	<	}
1018	>	final void awaitJoin(ForkJoinTask<?> joinMe, ForkJoinWorkerThread worker) {
1019	>	int retries = 2 + (parallelism >> 2); // #helpJoins before blocking
1020	>	while (joinMe.status >= 0) {
1021	>	int wc;
1022	>	worker.helpJoinTask(joinMe);
1023	>	if (joinMe.status < 0)
1024	>	break;
1025	>	else if (retries > 0)
1026	>	--retries;
1027	>	else if (((wc = workerCounts) & RUNNING_COUNT_MASK) != 0 &&
1028	>	UNSAFE.compareAndSwapInt(this, workerCountsOffset,
1029	>	wc, wc - ONE_RUNNING)) {
1030	>	int stat, c; long h;
1031	>	while ((stat = joinMe.status) >= 0 &&
1032	>	(h = eventWaiters) != 0L && // help release others
1033	>	(int)(h >>> EVENT_COUNT_SHIFT) != eventCount)
1034	>	releaseEventWaiters();
1035	>	if (stat >= 0 &&
1036	>	((workerCounts & RUNNING_COUNT_MASK) == 0 ||
1037	>	(stat =
1038	>	joinMe.internalAwaitDone(JOIN_TIMEOUT_MILLIS)) >= 0))
1039	>	helpMaintainParallelism(); // timeout or no running workers
1040	>	do {} while (!UNSAFE.compareAndSwapInt
1041	>	(this, workerCountsOffset,
1042	>	c = workerCounts, c + ONE_RUNNING));
1043	>	if (stat < 0)
1044	>	break;   // else restart
1045		}
1046		}
1013	–	// arrive here if can block
1014	–	joinMe.internalAwaitDone();
1015	–	int c;                      // to inline incrementRunningCount
1016	–	do {} while (!UNSAFE.compareAndSwapInt
1017	–	(this, workerCountsOffset,
1018	–	c = workerCounts, c + ONE_RUNNING));
1019	–	return false;
1047		}
1048
1049		/**
1050	<	* Same idea as (and shares many code snippets with) tryAwaitJoin,
1024	<	* but self-contained because there are no caller retries.
1025	<	* TODO: Rework to use simpler API.
1050	>	* Same idea as awaitJoin, but no helping, retries, or timeouts.
1051		*/
1052		final void awaitBlocker(ManagedBlocker blocker)
1053		throws InterruptedException {
1054	<	boolean done;
1030	<	if (done = blocker.isReleasable())
1031	<	return;
1032	<	int pc = parallelism;
1033	<	int retries = 0;
1034	<	boolean running = true; // false when running count decremented
1035	<	outer:for (;;) {
1054	>	while (!blocker.isReleasable()) {
1055		int wc = workerCounts;
1056	<	int rc = wc & RUNNING_COUNT_MASK;
1057	<	int tc = wc >>> TOTAL_COUNT_SHIFT;
1058	<	if (running) {
1059	<	if (rc <= pc && tc > pc &&
1060	<	(retries > 0 || tc > (runState & ACTIVE_COUNT_MASK))) {
1061	<	ForkJoinWorkerThread[] ws = workers;
1062	<	int nws = ws.length;
1063	<	for (int i = 0; i < nws; ++i) {
1064	<	ForkJoinWorkerThread w = ws[i];
1065	<	if (w != null) {
1066	<	if (done = blocker.isReleasable())
1067	<	return;
1068	<	if (w.isSuspended()) {
1069	<	if ((workerCounts & RUNNING_COUNT_MASK)>=pc &&
1051	<	w.tryResumeSpare()) {
1052	<	running = false;
1053	<	break outer;
1054	<	}
1055	<	continue outer; // rescan
1056	<	}
1057	<	}
1058	<	}
1059	<	}
1060	<	if (done = blocker.isReleasable())
1061	<	return;
1062	<	if (rc == 0 || workerCounts != wc ||
1063	<	!UNSAFE.compareAndSwapInt(this, workerCountsOffset,
1064	<	wc, wc - ONE_RUNNING))
1065	<	continue;
1066	<	running = false;
1067	<	if (rc > pc)
1068	<	break;
1069	<	}
1070	<	else {
1071	<	if (rc >= pc || (done = blocker.isReleasable()))
1072	<	break;
1073	<	int sc = tc - pc + 1;
1074	<	if (retries++ > sc) {
1075	<	if (rc > 0 && rc >= pc - sc)
1076	<	break;
1077	<	if (tc < MAX_THREADS &&
1078	<	tc == (runState & ACTIVE_COUNT_MASK) &&
1079	<	workerCounts == wc &&
1080	<	UNSAFE.compareAndSwapInt(this, workerCountsOffset, wc,
1081	<	wc+(ONE_RUNNING|ONE_TOTAL))) {
1082	<	addWorker();
1083	<	break;
1056	>	if ((wc & RUNNING_COUNT_MASK) != 0 &&
1057	>	UNSAFE.compareAndSwapInt(this, workerCountsOffset,
1058	>	wc, wc - ONE_RUNNING)) {
1059	>	try {
1060	>	while (!blocker.isReleasable()) {
1061	>	long h = eventWaiters;
1062	>	if (h != 0L &&
1063	>	(int)(h >>> EVENT_COUNT_SHIFT) != eventCount)
1064	>	releaseEventWaiters();
1065	>	else if ((workerCounts & RUNNING_COUNT_MASK) == 0 &&
1066	>	runState < TERMINATING)
1067	>	helpMaintainParallelism();
1068	>	else if (blocker.block())
1069	>	break;
1070		}
1071	+	} finally {
1072	+	int c;
1073	+	do {} while (!UNSAFE.compareAndSwapInt
1074	+	(this, workerCountsOffset,
1075	+	c = workerCounts, c + ONE_RUNNING));
1076		}
1077	<	Thread.yield();
1087	<	}
1088	<	}
1089	<
1090	<	try {
1091	<	if (!done)
1092	<	do {} while (!blocker.isReleasable() && !blocker.block());
1093	<	} finally {
1094	<	if (!running) {
1095	<	int c;
1096	<	do {} while (!UNSAFE.compareAndSwapInt
1097	<	(this, workerCountsOffset,
1098	<	c = workerCounts, c + ONE_RUNNING));
1077	>	break;
1078		}
1079		}
1080	<	}
1080	>	}
1081
1082		/**
1083		* Possibly initiates and/or completes termination.
#	Line 1126 | Line 1105 | public class ForkJoinPool extends Abstra
1105		return true;
1106		}
1107
1108	+
1109		/**
1110		* Actions on transition to TERMINATING
1111	+	*
1112	+	* Runs up to four passes through workers: (0) shutting down each
1113	+	* (without waking up if parked) to quickly spread notifications
1114	+	* without unnecessary bouncing around event queues etc (1) wake
1115	+	* up and help cancel tasks (2) interrupt (3) mop up races with
1116	+	* interrupted workers
1117		*/
1118		private void startTerminating() {
1119	<	for (int i = 0; i < 2; ++i) { // twice to mop up newly created workers
1120	<	cancelSubmissions();
1121	<	shutdownWorkers();
1122	<	cancelWorkerTasks();
1123	<	signalEvent();
1124	<	interruptWorkers();
1119	>	cancelSubmissions();
1120	>	for (int passes = 0; passes < 4 && workerCounts != 0; ++passes) {
1121	>	int c; // advance event count
1122	>	UNSAFE.compareAndSwapInt(this, eventCountOffset,
1123	>	c = eventCount, c+1);
1124	>	eventWaiters = 0L; // clobber lists
1125	>	spareWaiters = 0;
1126	>	for (ForkJoinWorkerThread w : workers) {
1127	>	if (w != null) {
1128	>	w.shutdown();
1129	>	if (passes > 0 && !w.isTerminated()) {
1130	>	w.cancelTasks();
1131	>	LockSupport.unpark(w);
1132	>	if (passes > 1 && !w.isInterrupted()) {
1133	>	try {
1134	>	w.interrupt();
1135	>	} catch (SecurityException ignore) {
1136	>	}
1137	>	}
1138	>	}
1139	>	}
1140	>	}
1141		}
1142		}
1143
1144		/**
1145	<	* Clear out and cancel submissions, ignoring exceptions
1145	>	* Clears out and cancels submissions, ignoring exceptions.
1146		*/
1147		private void cancelSubmissions() {
1148		ForkJoinTask<?> task;
#	Line 1152 | Line 1154 | public class ForkJoinPool extends Abstra
1154		}
1155		}
1156
1155	–	/**
1156	–	* Sets all worker run states to at least shutdown,
1157	–	* also resuming suspended workers
1158	–	*/
1159	–	private void shutdownWorkers() {
1160	–	ForkJoinWorkerThread[] ws = workers;
1161	–	int nws = ws.length;
1162	–	for (int i = 0; i < nws; ++i) {
1163	–	ForkJoinWorkerThread w = ws[i];
1164	–	if (w != null)
1165	–	w.shutdown();
1166	–	}
1167	–	}
1168	–
1169	–	/**
1170	–	* Clears out and cancels all locally queued tasks
1171	–	*/
1172	–	private void cancelWorkerTasks() {
1173	–	ForkJoinWorkerThread[] ws = workers;
1174	–	int nws = ws.length;
1175	–	for (int i = 0; i < nws; ++i) {
1176	–	ForkJoinWorkerThread w = ws[i];
1177	–	if (w != null)
1178	–	w.cancelTasks();
1179	–	}
1180	–	}
1181	–
1182	–	/**
1183	–	* Unsticks all workers blocked on joins etc
1184	–	*/
1185	–	private void interruptWorkers() {
1186	–	ForkJoinWorkerThread[] ws = workers;
1187	–	int nws = ws.length;
1188	–	for (int i = 0; i < nws; ++i) {
1189	–	ForkJoinWorkerThread w = ws[i];
1190	–	if (w != null && !w.isTerminated()) {
1191	–	try {
1192	–	w.interrupt();
1193	–	} catch (SecurityException ignore) {
1194	–	}
1195	–	}
1196	–	}
1197	–	}
1198	–
1157		// misc support for ForkJoinWorkerThread
1158
1159		/**
1160	<	* Returns pool number
1160	>	* Returns pool number.
1161		*/
1162		final int getPoolNumber() {
1163		return poolNumber;
1164		}
1165
1166		/**
1167	<	* Accumulates steal count from a worker, clearing
1168	<	* the worker's value
1167	>	* Tries to accumulate steal count from a worker, clearing
1168	>	* the worker's value if successful.
1169	>	*
1170	>	* @return true if worker steal count now zero
1171		*/
1172	<	final void accumulateStealCount(ForkJoinWorkerThread w) {
1172	>	final boolean tryAccumulateStealCount(ForkJoinWorkerThread w) {
1173		int sc = w.stealCount;
1174	<	if (sc != 0) {
1175	<	long c;
1176	<	w.stealCount = 0;
1177	<	do {} while (!UNSAFE.compareAndSwapLong(this, stealCountOffset,
1178	<	c = stealCount, c + sc));
1174	>	long c = stealCount;
1175	>	// CAS even if zero, for fence effects
1176	>	if (UNSAFE.compareAndSwapLong(this, stealCountOffset, c, c + sc)) {
1177	>	if (sc != 0)
1178	>	w.stealCount = 0;
1179	>	return true;
1180		}
1181	+	return sc == 0;
1182		}
1183
1184		/**
#	Line 1225 | Line 1187 | public class ForkJoinPool extends Abstra
1187		*/
1188		final int idlePerActive() {
1189		int pc = parallelism; // use parallelism, not rc
1190	<	int ac = runState;    // no mask -- artifically boosts during shutdown
1190	>	int ac = runState;    // no mask -- artificially boosts during shutdown
1191		// Use exact results for small values, saturate past 4
1192	<	return pc <= ac? 0 : pc >>> 1 <= ac? 1 : pc >>> 2 <= ac? 3 : pc >>> 3;
1192	>	return ((pc <= ac) ? 0 :
1193	>	(pc >>> 1 <= ac) ? 1 :
1194	>	(pc >>> 2 <= ac) ? 3 :
1195	>	pc >>> 3);
1196		}
1197
1198		// Public and protected methods
#	Line 1275 | Line 1240 | public class ForkJoinPool extends Abstra
1240		* use {@link java.lang.Runtime#availableProcessors}.
1241		* @param factory the factory for creating new threads. For default value,
1242		* use {@link #defaultForkJoinWorkerThreadFactory}.
1243	<	* @param handler the handler for internal worker threads that
1244	<	* terminate due to unrecoverable errors encountered while executing
1245	<	* tasks. For default value, use <code>null</code>.
1246	<	* @param asyncMode if true,
1243	>	* @param handler the handler for internal worker threads that
1244	>	* terminate due to unrecoverable errors encountered while executing
1245	>	* tasks. For default value, use {@code null}.
1246	>	* @param asyncMode if true,
1247		* establishes local first-in-first-out scheduling mode for forked
1248		* tasks that are never joined. This mode may be more appropriate
1249		* than default locally stack-based mode in applications in which
1250		* worker threads only process event-style asynchronous tasks.
1251	<	* For default value, use <code>false</code>.
1251	>	* For default value, use {@code false}.
1252		* @throws IllegalArgumentException if parallelism less than or
1253		*         equal to zero, or greater than implementation limit
1254		* @throws NullPointerException if the factory is null
#	Line 1292 | Line 1257 | public class ForkJoinPool extends Abstra
1257		*         because it does not hold {@link
1258		*         java.lang.RuntimePermission}{@code ("modifyThread")}
1259		*/
1260	<	public ForkJoinPool(int parallelism,
1260	>	public ForkJoinPool(int parallelism,
1261		ForkJoinWorkerThreadFactory factory,
1262		Thread.UncaughtExceptionHandler handler,
1263		boolean asyncMode) {
1264		checkPermission();
1265		if (factory == null)
1266		throw new NullPointerException();
1267	<	if (parallelism <= 0 || parallelism > MAX_THREADS)
1267	>	if (parallelism <= 0 || parallelism > MAX_WORKERS)
1268		throw new IllegalArgumentException();
1269		this.parallelism = parallelism;
1270		this.factory = factory;
#	Line 1318 | Line 1283 | public class ForkJoinPool extends Abstra
1283		* @param pc the initial parallelism level
1284		*/
1285		private static int initialArraySizeFor(int pc) {
1286	<	// See Hackers Delight, sec 3.2. We know MAX_THREADS < (1 >>> 16)
1287	<	int size = pc < MAX_THREADS ? pc + 1 : MAX_THREADS;
1286	>	// If possible, initially allocate enough space for one spare
1287	>	int size = pc < MAX_WORKERS ? pc + 1 : MAX_WORKERS;
1288	>	// See Hackers Delight, sec 3.2. We know MAX_WORKERS < (1 >>> 16)
1289		size |= size >>> 1;
1290		size |= size >>> 2;
1291		size |= size >>> 4;
#	Line 1338 | Line 1304 | public class ForkJoinPool extends Abstra
1304		if (runState >= SHUTDOWN)
1305		throw new RejectedExecutionException();
1306		submissionQueue.offer(task);
1307	<	signalEvent();
1308	<	ensureEnoughWorkers();
1307	>	int c; // try to increment event count -- CAS failure OK
1308	>	UNSAFE.compareAndSwapInt(this, eventCountOffset, c = eventCount, c+1);
1309	>	helpMaintainParallelism(); // create, start, or resume some workers
1310		}
1311
1312		/**
1313		* Performs the given task, returning its result upon completion.
1347	–	* If the caller is already engaged in a fork/join computation in
1348	–	* the current pool, this method is equivalent in effect to
1349	–	* {@link ForkJoinTask#invoke}.
1314		*
1315		* @param task the task
1316		* @return the task's result
#	Line 1361 | Line 1325 | public class ForkJoinPool extends Abstra
1325
1326		/**
1327		* Arranges for (asynchronous) execution of the given task.
1364	–	* If the caller is already engaged in a fork/join computation in
1365	–	* the current pool, this method is equivalent in effect to
1366	–	* {@link ForkJoinTask#fork}.
1328		*
1329		* @param task the task
1330		* @throws NullPointerException if the task is null
#	Line 1392 | Line 1353 | public class ForkJoinPool extends Abstra
1353
1354		/**
1355		* Submits a ForkJoinTask for execution.
1395	–	* If the caller is already engaged in a fork/join computation in
1396	–	* the current pool, this method is equivalent in effect to
1397	–	* {@link ForkJoinTask#fork}.
1356		*
1357		* @param task the task to submit
1358		* @return the task
#	Line 1500 | Line 1458 | public class ForkJoinPool extends Abstra
1458
1459		/**
1460		* Returns the number of worker threads that have started but not
1461	<	* yet terminated.  This result returned by this method may differ
1461	>	* yet terminated.  The result returned by this method may differ
1462		* from {@link #getParallelism} when threads are created to
1463		* maintain parallelism when others are cooperatively blocked.
1464		*
#	Line 1585 | Line 1543 | public class ForkJoinPool extends Abstra
1543		*/
1544		public long getQueuedTaskCount() {
1545		long count = 0;
1546	<	ForkJoinWorkerThread[] ws = workers;
1589	<	int nws = ws.length;
1590	<	for (int i = 0; i < nws; ++i) {
1591	<	ForkJoinWorkerThread w = ws[i];
1546	>	for (ForkJoinWorkerThread w : workers)
1547		if (w != null)
1548		count += w.getQueueSize();
1594	–	}
1549		return count;
1550		}
1551
#	Line 1645 | Line 1599 | public class ForkJoinPool extends Abstra
1599		* @return the number of elements transferred
1600		*/
1601		protected int drainTasksTo(Collection<? super ForkJoinTask<?>> c) {
1602	<	int n = submissionQueue.drainTo(c);
1603	<	ForkJoinWorkerThread[] ws = workers;
1650	<	int nws = ws.length;
1651	<	for (int i = 0; i < nws; ++i) {
1652	<	ForkJoinWorkerThread w = ws[i];
1653	<	if (w != null)
1654	<	n += w.drainTasksTo(c);
1655	<	}
1656	<	return n;
1657	<	}
1658	<
1659	<	/**
1660	<	* Returns count of total parks by existing workers.
1661	<	* Used during development only since not meaningful to users.
1662	<	*/
1663	<	private int collectParkCount() {
1664	<	int count = 0;
1665	<	ForkJoinWorkerThread[] ws = workers;
1666	<	int nws = ws.length;
1667	<	for (int i = 0; i < nws; ++i) {
1668	<	ForkJoinWorkerThread w = ws[i];
1602	>	int count = submissionQueue.drainTo(c);
1603	>	for (ForkJoinWorkerThread w : workers)
1604		if (w != null)
1605	<	count += w.parkCount;
1671	<	}
1605	>	count += w.drainTasksTo(c);
1606		return count;
1607		}
1608
#	Line 1689 | Line 1623 | public class ForkJoinPool extends Abstra
1623		int pc = parallelism;
1624		int rs = runState;
1625		int ac = rs & ACTIVE_COUNT_MASK;
1692	–	//        int pk = collectParkCount();
1626		return super.toString() +
1627		"[" + runLevelToString(rs) +
1628		", parallelism = " + pc +
#	Line 1699 | Line 1632 | public class ForkJoinPool extends Abstra
1632		", steals = " + st +
1633		", tasks = " + qt +
1634		", submissions = " + qs +
1702	–	//            ", parks = " + pk +
1635		"]";
1636		}
1637
#	Line 1774 | Line 1706 | public class ForkJoinPool extends Abstra
1706		}
1707
1708		/**
1709	+	* Returns true if terminating or terminated. Used by ForkJoinWorkerThread.
1710	+	*/
1711	+	final boolean isAtLeastTerminating() {
1712	+	return runState >= TERMINATING;
1713	+	}
1714	+
1715	+	/**
1716		* Returns {@code true} if this pool has been shut down.
1717		*
1718		* @return {@code true} if this pool has been shut down
#	Line 1797 | Line 1736 | public class ForkJoinPool extends Abstra
1736		throws InterruptedException {
1737		try {
1738		return termination.awaitAdvanceInterruptibly(0, timeout, unit) > 0;
1739	<	} catch(TimeoutException ex) {
1739	>	} catch (TimeoutException ex) {
1740		return false;
1741		}
1742		}
#	Line 1806 | Line 1745 | public class ForkJoinPool extends Abstra
1745		* Interface for extending managed parallelism for tasks running
1746		* in {@link ForkJoinPool}s.
1747		*
1748	<	* <p>A {@code ManagedBlocker} provides two methods.
1749	<	* Method {@code isReleasable} must return {@code true} if
1750	<	* blocking is not necessary. Method {@code block} blocks the
1751	<	* current thread if necessary (perhaps internally invoking
1752	<	* {@code isReleasable} before actually blocking).
1748	>	* <p>A {@code ManagedBlocker} provides two methods.  Method
1749	>	* {@code isReleasable} must return {@code true} if blocking is
1750	>	* not necessary. Method {@code block} blocks the current thread
1751	>	* if necessary (perhaps internally invoking {@code isReleasable}
1752	>	* before actually blocking). The unusual methods in this API
1753	>	* accommodate synchronizers that may, but don't usually, block
1754	>	* for long periods. Similarly, they allow more efficient internal
1755	>	* handling of cases in which additional workers may be, but
1756	>	* usually are not, needed to ensure sufficient parallelism.
1757	>	* Toward this end, implementations of method {@code isReleasable}
1758	>	* must be amenable to repeated invocation.
1759		*
1760		* <p>For example, here is a ManagedBlocker based on a
1761		* ReentrantLock:
#	Line 1828 | Line 1773 | public class ForkJoinPool extends Abstra
1773		*     return hasLock || (hasLock = lock.tryLock());
1774		*   }
1775		* }}</pre>
1776	+	*
1777	+	* <p>Here is a class that possibly blocks waiting for an
1778	+	* item on a given queue:
1779	+	*  <pre> {@code
1780	+	* class QueueTaker<E> implements ManagedBlocker {
1781	+	*   final BlockingQueue<E> queue;
1782	+	*   volatile E item = null;
1783	+	*   QueueTaker(BlockingQueue<E> q) { this.queue = q; }
1784	+	*   public boolean block() throws InterruptedException {
1785	+	*     if (item == null)
1786	+	*       item = queue.take();
1787	+	*     return true;
1788	+	*   }
1789	+	*   public boolean isReleasable() {
1790	+	*     return item != null || (item = queue.poll()) != null;
1791	+	*   }
1792	+	*   public E getItem() { // call after pool.managedBlock completes
1793	+	*     return item;
1794	+	*   }
1795	+	* }}</pre>
1796		*/
1797		public static interface ManagedBlocker {
1798		/**
#	Line 1870 | Line 1835 | public class ForkJoinPool extends Abstra
1835		public static void managedBlock(ManagedBlocker blocker)
1836		throws InterruptedException {
1837		Thread t = Thread.currentThread();
1838	<	if (t instanceof ForkJoinWorkerThread)
1839	<	((ForkJoinWorkerThread) t).pool.awaitBlocker(blocker);
1838	>	if (t instanceof ForkJoinWorkerThread) {
1839	>	ForkJoinWorkerThread w = (ForkJoinWorkerThread) t;
1840	>	w.pool.awaitBlocker(blocker);
1841	>	}
1842		else {
1843		do {} while (!blocker.isReleasable() && !blocker.block());
1844		}
#	Line 1899 | Line 1866 | public class ForkJoinPool extends Abstra
1866		private static final long eventCountOffset =
1867		objectFieldOffset("eventCount", ForkJoinPool.class);
1868		private static final long eventWaitersOffset =
1869	<	objectFieldOffset("eventWaiters",ForkJoinPool.class);
1869	>	objectFieldOffset("eventWaiters", ForkJoinPool.class);
1870		private static final long stealCountOffset =
1871	<	objectFieldOffset("stealCount",ForkJoinPool.class);
1871	>	objectFieldOffset("stealCount", ForkJoinPool.class);
1872	>	private static final long spareWaitersOffset =
1873	>	objectFieldOffset("spareWaiters", ForkJoinPool.class);
1874
1875		private static long objectFieldOffset(String field, Class<?> klazz) {
1876		try {

Diff Legend

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