13 |
|
import java.util.Collection; |
14 |
|
import java.util.Collections; |
15 |
|
import java.util.List; |
16 |
– |
import java.util.concurrent.locks.Condition; |
16 |
|
import java.util.concurrent.locks.LockSupport; |
17 |
|
import java.util.concurrent.locks.ReentrantLock; |
18 |
|
import java.util.concurrent.atomic.AtomicInteger; |
19 |
< |
import java.util.concurrent.atomic.AtomicLong; |
19 |
> |
import java.util.concurrent.CountDownLatch; |
20 |
|
|
21 |
|
/** |
22 |
< |
* An {@link ExecutorService} for running {@link ForkJoinTask}s. A |
23 |
< |
* ForkJoinPool provides the entry point for submissions from |
24 |
< |
* non-ForkJoinTasks, as well as management and monitoring operations. |
25 |
< |
* Normally a single ForkJoinPool is used for a large number of |
27 |
< |
* submitted tasks. Otherwise, use would not usually outweigh the |
28 |
< |
* construction and bookkeeping overhead of creating a large set of |
29 |
< |
* threads. |
22 |
> |
* An {@link ExecutorService} for running {@link ForkJoinTask}s. |
23 |
> |
* A {@code ForkJoinPool} provides the entry point for submissions |
24 |
> |
* from non-{@code ForkJoinTask} clients, as well as management and |
25 |
> |
* monitoring operations. |
26 |
|
* |
27 |
< |
* <p>ForkJoinPools differ from other kinds of Executors mainly in |
28 |
< |
* that they provide <em>work-stealing</em>: all threads in the pool |
29 |
< |
* attempt to find and execute subtasks created by other active tasks |
30 |
< |
* (eventually blocking if none exist). This makes them efficient when |
31 |
< |
* most tasks spawn other subtasks (as do most ForkJoinTasks), as well |
32 |
< |
* as the mixed execution of some plain Runnable- or Callable- based |
33 |
< |
* activities along with ForkJoinTasks. When setting |
34 |
< |
* {@code setAsyncMode}, a ForkJoinPools may also be appropriate for |
35 |
< |
* use with fine-grained tasks that are never joined. Otherwise, other |
40 |
< |
* ExecutorService implementations are typically more appropriate |
41 |
< |
* choices. |
27 |
> |
* <p>A {@code ForkJoinPool} differs from other kinds of {@link |
28 |
> |
* ExecutorService} mainly by virtue of employing |
29 |
> |
* <em>work-stealing</em>: all threads in the pool attempt to find and |
30 |
> |
* execute subtasks created by other active tasks (eventually blocking |
31 |
> |
* waiting for work if none exist). This enables efficient processing |
32 |
> |
* when most tasks spawn other subtasks (as do most {@code |
33 |
> |
* ForkJoinTask}s). When setting <em>asyncMode</em> to true in |
34 |
> |
* constructors, {@code ForkJoinPool}s may also be appropriate for use |
35 |
> |
* with event-style tasks that are never joined. |
36 |
|
* |
37 |
< |
* <p>A ForkJoinPool may be constructed with a given parallelism level |
38 |
< |
* (target pool size), which it attempts to maintain by dynamically |
39 |
< |
* adding, suspending, or resuming threads, even if some tasks are |
40 |
< |
* waiting to join others. However, no such adjustments are performed |
41 |
< |
* in the face of blocked IO or other unmanaged synchronization. The |
42 |
< |
* nested {@code ManagedBlocker} interface enables extension of |
43 |
< |
* the kinds of synchronization accommodated. The target parallelism |
44 |
< |
* level may also be changed dynamically ({@code setParallelism}) |
45 |
< |
* and thread construction can be limited using methods |
52 |
< |
* {@code setMaximumPoolSize} and/or |
53 |
< |
* {@code setMaintainsParallelism}. |
37 |
> |
* <p>A {@code ForkJoinPool} is constructed with a given target |
38 |
> |
* parallelism level; by default, equal to the number of available |
39 |
> |
* processors. The pool attempts to maintain enough active (or |
40 |
> |
* available) threads by dynamically adding, suspending, or resuming |
41 |
> |
* internal worker threads, even if some tasks are stalled waiting to |
42 |
> |
* join others. However, no such adjustments are guaranteed in the |
43 |
> |
* face of blocked IO or other unmanaged synchronization. The nested |
44 |
> |
* {@link ManagedBlocker} interface enables extension of the kinds of |
45 |
> |
* synchronization accommodated. |
46 |
|
* |
47 |
|
* <p>In addition to execution and lifecycle control methods, this |
48 |
|
* class provides status check methods (for example |
49 |
< |
* {@code getStealCount}) that are intended to aid in developing, |
49 |
> |
* {@link #getStealCount}) that are intended to aid in developing, |
50 |
|
* tuning, and monitoring fork/join applications. Also, method |
51 |
< |
* {@code toString} returns indications of pool state in a |
51 |
> |
* {@link #toString} returns indications of pool state in a |
52 |
|
* convenient form for informal monitoring. |
53 |
|
* |
54 |
+ |
* <p> As is the case with other ExecutorServices, there are three |
55 |
+ |
* main task execution methods summarized in the following |
56 |
+ |
* table. These are designed to be used by clients not already engaged |
57 |
+ |
* in fork/join computations in the current pool. The main forms of |
58 |
+ |
* these methods accept instances of {@code ForkJoinTask}, but |
59 |
+ |
* overloaded forms also allow mixed execution of plain {@code |
60 |
+ |
* Runnable}- or {@code Callable}- based activities as well. However, |
61 |
+ |
* tasks that are already executing in a pool should normally |
62 |
+ |
* <em>NOT</em> use these pool execution methods, but instead use the |
63 |
+ |
* within-computation forms listed in the table. |
64 |
+ |
* |
65 |
+ |
* <table BORDER CELLPADDING=3 CELLSPACING=1> |
66 |
+ |
* <tr> |
67 |
+ |
* <td></td> |
68 |
+ |
* <td ALIGN=CENTER> <b>Call from non-fork/join clients</b></td> |
69 |
+ |
* <td ALIGN=CENTER> <b>Call from within fork/join computations</b></td> |
70 |
+ |
* </tr> |
71 |
+ |
* <tr> |
72 |
+ |
* <td> <b>Arange async execution</td> |
73 |
+ |
* <td> {@link #execute(ForkJoinTask)}</td> |
74 |
+ |
* <td> {@link ForkJoinTask#fork}</td> |
75 |
+ |
* </tr> |
76 |
+ |
* <tr> |
77 |
+ |
* <td> <b>Await and obtain result</td> |
78 |
+ |
* <td> {@link #invoke(ForkJoinTask)}</td> |
79 |
+ |
* <td> {@link ForkJoinTask#invoke}</td> |
80 |
+ |
* </tr> |
81 |
+ |
* <tr> |
82 |
+ |
* <td> <b>Arrange exec and obtain Future</td> |
83 |
+ |
* <td> {@link #submit(ForkJoinTask)}</td> |
84 |
+ |
* <td> {@link ForkJoinTask#fork} (ForkJoinTasks <em>are</em> Futures)</td> |
85 |
+ |
* </tr> |
86 |
+ |
* </table> |
87 |
+ |
* |
88 |
+ |
* <p><b>Sample Usage.</b> Normally a single {@code ForkJoinPool} is |
89 |
+ |
* used for all parallel task execution in a program or subsystem. |
90 |
+ |
* Otherwise, use would not usually outweigh the construction and |
91 |
+ |
* bookkeeping overhead of creating a large set of threads. For |
92 |
+ |
* example, a common pool could be used for the {@code SortTasks} |
93 |
+ |
* illustrated in {@link RecursiveAction}. Because {@code |
94 |
+ |
* ForkJoinPool} uses threads in {@linkplain java.lang.Thread#isDaemon |
95 |
+ |
* daemon} mode, there is typically no need to explicitly {@link |
96 |
+ |
* #shutdown} such a pool upon program exit. |
97 |
+ |
* |
98 |
+ |
* <pre> |
99 |
+ |
* static final ForkJoinPool mainPool = new ForkJoinPool(); |
100 |
+ |
* ... |
101 |
+ |
* public void sort(long[] array) { |
102 |
+ |
* mainPool.invoke(new SortTask(array, 0, array.length)); |
103 |
+ |
* } |
104 |
+ |
* </pre> |
105 |
+ |
* |
106 |
|
* <p><b>Implementation notes</b>: This implementation restricts the |
107 |
|
* maximum number of running threads to 32767. Attempts to create |
108 |
< |
* pools with greater than the maximum result in |
109 |
< |
* IllegalArgumentExceptions. |
108 |
> |
* pools with greater than the maximum number result in |
109 |
> |
* {@code IllegalArgumentException}. |
110 |
> |
* |
111 |
> |
* <p>This implementation rejects submitted tasks (that is, by throwing |
112 |
> |
* {@link RejectedExecutionException}) only when the pool is shut down |
113 |
> |
* or internal resources have been exhuasted. |
114 |
|
* |
115 |
|
* @since 1.7 |
116 |
|
* @author Doug Lea |
118 |
|
public class ForkJoinPool extends AbstractExecutorService { |
119 |
|
|
120 |
|
/* |
121 |
< |
* See the extended comments interspersed below for design, |
122 |
< |
* rationale, and walkthroughs. |
123 |
< |
*/ |
124 |
< |
|
125 |
< |
/** Mask for packing and unpacking shorts */ |
126 |
< |
private static final int shortMask = 0xffff; |
127 |
< |
|
128 |
< |
/** Max pool size -- must be a power of two minus 1 */ |
129 |
< |
private static final int MAX_THREADS = 0x7FFF; |
130 |
< |
|
131 |
< |
/** |
132 |
< |
* Factory for creating new ForkJoinWorkerThreads. A |
133 |
< |
* ForkJoinWorkerThreadFactory must be defined and used for |
134 |
< |
* ForkJoinWorkerThread subclasses that extend base functionality |
135 |
< |
* or initialize threads with different contexts. |
121 |
> |
* Implementation Overview |
122 |
> |
* |
123 |
> |
* This class provides the central bookkeeping and control for a |
124 |
> |
* set of worker threads: Submissions from non-FJ threads enter |
125 |
> |
* into a submission queue. Workers take these tasks and typically |
126 |
> |
* split them into subtasks that may be stolen by other workers. |
127 |
> |
* The main work-stealing mechanics implemented in class |
128 |
> |
* ForkJoinWorkerThread give first priority to processing tasks |
129 |
> |
* from their own queues (LIFO or FIFO, depending on mode), then |
130 |
> |
* to randomized FIFO steals of tasks in other worker queues, and |
131 |
> |
* lastly to new submissions. These mechanics do not consider |
132 |
> |
* affinities, loads, cache localities, etc, so rarely provide the |
133 |
> |
* best possible performance on a given machine, but portably |
134 |
> |
* provide good throughput by averaging over these factors. |
135 |
> |
* (Further, even if we did try to use such information, we do not |
136 |
> |
* usually have a basis for exploiting it. For example, some sets |
137 |
> |
* of tasks profit from cache affinities, but others are harmed by |
138 |
> |
* cache pollution effects.) |
139 |
> |
* |
140 |
> |
* Beyond work-stealing support and essential bookkeeping, the |
141 |
> |
* main responsibility of this framework is to take actions when |
142 |
> |
* one worker is waiting to join a task stolen (or always held by) |
143 |
> |
* another. Becauae we are multiplexing many tasks on to a pool |
144 |
> |
* of workers, we can't just let them block (as in Thread.join). |
145 |
> |
* We also cannot just reassign the joiner's run-time stack with |
146 |
> |
* another and replace it later, which would be a form of |
147 |
> |
* "continuation", that even if possible is not necessarily a good |
148 |
> |
* idea. Given that the creation costs of most threads on most |
149 |
> |
* systems mainly surrounds setting up runtime stacks, thread |
150 |
> |
* creation and switching is usually not much more expensive than |
151 |
> |
* stack creation and switching, and is more flexible). Instead we |
152 |
> |
* combine two tactics: |
153 |
> |
* |
154 |
> |
* Helping: Arranging for the joiner to execute some task that it |
155 |
> |
* would be running if the steal had not occurred. Method |
156 |
> |
* ForkJoinWorkerThread.helpJoinTask tracks joining->stealing |
157 |
> |
* links to try to find such a task. |
158 |
> |
* |
159 |
> |
* Compensating: Unless there are already enough live threads, |
160 |
> |
* creating or or re-activating a spare thread to compensate |
161 |
> |
* for the (blocked) joiner until it unblocks. Spares then |
162 |
> |
* suspend at their next opportunity or eventually die if |
163 |
> |
* unused for too long. See below and the internal |
164 |
> |
* documentation for tryAwaitJoin for more details about |
165 |
> |
* compensation rules. |
166 |
> |
* |
167 |
> |
* Because the determining existence of conservatively safe |
168 |
> |
* helping targets, the availability of already-created spares, |
169 |
> |
* and the apparent need to create new spares are all racy and |
170 |
> |
* require heuristic guidance, joins (in |
171 |
> |
* ForkJoinWorkerThread.joinTask) interleave these options until |
172 |
> |
* successful. Creating a new spare always succeeds, but also |
173 |
> |
* increases application footprint, so we try to avoid it, within |
174 |
> |
* reason. |
175 |
> |
* |
176 |
> |
* The ManagedBlocker extension API can't use helping so uses a |
177 |
> |
* special version of compensation in method awaitBlocker. |
178 |
> |
* |
179 |
> |
* The main throughput advantages of work-stealing stem from |
180 |
> |
* decentralized control -- workers mostly steal tasks from each |
181 |
> |
* other. We do not want to negate this by creating bottlenecks |
182 |
> |
* implementing other management responsibilities. So we use a |
183 |
> |
* collection of techniques that avoid, reduce, or cope well with |
184 |
> |
* contention. These entail several instances of bit-packing into |
185 |
> |
* CASable fields to maintain only the minimally required |
186 |
> |
* atomicity. To enable such packing, we restrict maximum |
187 |
> |
* parallelism to (1<<15)-1 (enabling twice this (to accommodate |
188 |
> |
* unbalanced increments and decrements) to fit into a 16 bit |
189 |
> |
* field, which is far in excess of normal operating range. Even |
190 |
> |
* though updates to some of these bookkeeping fields do sometimes |
191 |
> |
* contend with each other, they don't normally cache-contend with |
192 |
> |
* updates to others enough to warrant memory padding or |
193 |
> |
* isolation. So they are all held as fields of ForkJoinPool |
194 |
> |
* objects. The main capabilities are as follows: |
195 |
> |
* |
196 |
> |
* 1. Creating and removing workers. Workers are recorded in the |
197 |
> |
* "workers" array. This is an array as opposed to some other data |
198 |
> |
* structure to support index-based random steals by workers. |
199 |
> |
* Updates to the array recording new workers and unrecording |
200 |
> |
* terminated ones are protected from each other by a lock |
201 |
> |
* (workerLock) but the array is otherwise concurrently readable, |
202 |
> |
* and accessed directly by workers. To simplify index-based |
203 |
> |
* operations, the array size is always a power of two, and all |
204 |
> |
* readers must tolerate null slots. Currently, all worker thread |
205 |
> |
* creation is on-demand, triggered by task submissions, |
206 |
> |
* replacement of terminated workers, and/or compensation for |
207 |
> |
* blocked workers. However, all other support code is set up to |
208 |
> |
* work with other policies. |
209 |
> |
* |
210 |
> |
* 2. Bookkeeping for dynamically adding and removing workers. We |
211 |
> |
* aim to approximately maintain the given level of parallelism. |
212 |
> |
* When some workers are known to be blocked (on joins or via |
213 |
> |
* ManagedBlocker), we may create or resume others to take their |
214 |
> |
* place until they unblock (see below). Implementing this |
215 |
> |
* requires counts of the number of "running" threads (i.e., those |
216 |
> |
* that are neither blocked nor artifically suspended) as well as |
217 |
> |
* the total number. These two values are packed into one field, |
218 |
> |
* "workerCounts" because we need accurate snapshots when deciding |
219 |
> |
* to create, resume or suspend. Note however that the |
220 |
> |
* correspondance of these counts to reality is not guaranteed. In |
221 |
> |
* particular updates for unblocked threads may lag until they |
222 |
> |
* actually wake up. |
223 |
> |
* |
224 |
> |
* 3. Maintaining global run state. The run state of the pool |
225 |
> |
* consists of a runLevel (SHUTDOWN, TERMINATING, etc) similar to |
226 |
> |
* those in other Executor implementations, as well as a count of |
227 |
> |
* "active" workers -- those that are, or soon will be, or |
228 |
> |
* recently were executing tasks. The runLevel and active count |
229 |
> |
* are packed together in order to correctly trigger shutdown and |
230 |
> |
* termination. Without care, active counts can be subject to very |
231 |
> |
* high contention. We substantially reduce this contention by |
232 |
> |
* relaxing update rules. A worker must claim active status |
233 |
> |
* prospectively, by activating if it sees that a submitted or |
234 |
> |
* stealable task exists (it may find after activating that the |
235 |
> |
* task no longer exists). It stays active while processing this |
236 |
> |
* task (if it exists) and any other local subtasks it produces, |
237 |
> |
* until it cannot find any other tasks. It then tries |
238 |
> |
* inactivating (see method preStep), but upon update contention |
239 |
> |
* instead scans for more tasks, later retrying inactivation if it |
240 |
> |
* doesn't find any. |
241 |
> |
* |
242 |
> |
* 4. Managing idle workers waiting for tasks. We cannot let |
243 |
> |
* workers spin indefinitely scanning for tasks when none are |
244 |
> |
* available. On the other hand, we must quickly prod them into |
245 |
> |
* action when new tasks are submitted or generated. We |
246 |
> |
* park/unpark these idle workers using an event-count scheme. |
247 |
> |
* Field eventCount is incremented upon events that may enable |
248 |
> |
* workers that previously could not find a task to now find one: |
249 |
> |
* Submission of a new task to the pool, or another worker pushing |
250 |
> |
* a task onto a previously empty queue. (We also use this |
251 |
> |
* mechanism for termination and reconfiguration actions that |
252 |
> |
* require wakeups of idle workers). Each worker maintains its |
253 |
> |
* last known event count, and blocks when a scan for work did not |
254 |
> |
* find a task AND its lastEventCount matches the current |
255 |
> |
* eventCount. Waiting idle workers are recorded in a variant of |
256 |
> |
* Treiber stack headed by field eventWaiters which, when nonzero, |
257 |
> |
* encodes the thread index and count awaited for by the worker |
258 |
> |
* thread most recently calling eventSync. This thread in turn has |
259 |
> |
* a record (field nextEventWaiter) for the next waiting worker. |
260 |
> |
* In addition to allowing simpler decisions about need for |
261 |
> |
* wakeup, the event count bits in eventWaiters serve the role of |
262 |
> |
* tags to avoid ABA errors in Treiber stacks. To reduce delays |
263 |
> |
* in task diffusion, workers not otherwise occupied may invoke |
264 |
> |
* method releaseWaiters, that removes and signals (unparks) |
265 |
> |
* workers not waiting on current count. To minimize task |
266 |
> |
* production stalls associate with signalling, any worker pushing |
267 |
> |
* 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. |
274 |
> |
* Conceptually they are merged into the same event, which is OK |
275 |
> |
* when their only purpose is to enable workers to scan for work. |
276 |
> |
* |
277 |
> |
* 5. Managing suspension of extra workers. When a worker is about |
278 |
> |
* to block waiting for a join (or via ManagedBlockers), we may |
279 |
> |
* create a new thread to maintain parallelism level, or at least |
280 |
> |
* avoid starvation. Usually, extra threads are needed for only |
281 |
> |
* very short periods, yet join dependencies are such that we |
282 |
> |
* sometimes need them in bursts. Rather than create new threads |
283 |
> |
* each time this happens, we suspend no-longer-needed extra ones |
284 |
> |
* as "spares". For most purposes, we don't distinguish "extra" |
285 |
> |
* spare threads from normal "core" threads: On each call to |
286 |
> |
* preStep (the only point at which we can do this) a worker |
287 |
> |
* checks to see if there are now too many running workers, and if |
288 |
> |
* so, suspends itself. Methods tryAwaitJoin and awaitBlocker |
289 |
> |
* look for suspended threads to resume before considering |
290 |
> |
* creating a new replacement. We don't need a special data |
291 |
> |
* structure to maintain spares; simply scanning the workers array |
292 |
> |
* looking for worker.isSuspended() is fine because the calling |
293 |
> |
* thread is otherwise not doing anything useful anyway; we are at |
294 |
> |
* least as happy if after locating a spare, the caller doesn't |
295 |
> |
* actually block because the join is ready before we try to |
296 |
> |
* adjust and compensate. Note that this is intrinsically racy. |
297 |
> |
* One thread may become a spare at about the same time as another |
298 |
> |
* is needlessly being created. We counteract this and related |
299 |
> |
* slop in part by requiring resumed spares to immediately recheck |
300 |
> |
* (in preStep) to see whether they they should re-suspend. The |
301 |
> |
* only effective difference between "extra" and "core" threads is |
302 |
> |
* that we allow the "extra" ones to time out and die if they are |
303 |
> |
* not resumed within a keep-alive interval of a few seconds. This |
304 |
> |
* is implemented mainly within ForkJoinWorkerThread, but requires |
305 |
> |
* some coordination (isTrimmed() -- meaning killed while |
306 |
> |
* suspended) to correctly maintain pool counts. |
307 |
> |
* |
308 |
> |
* 6. Deciding when to create new workers. The main dynamic |
309 |
> |
* control in this class is deciding when to create extra threads, |
310 |
> |
* in methods awaitJoin and awaitBlocker. We always need to create |
311 |
> |
* one when the number of running threads would become zero and |
312 |
> |
* all workers are busy. However, this is not easy to detect |
313 |
> |
* reliably in the presence of transients so we use retries and |
314 |
> |
* allow slack (in tryAwaitJoin) to reduce false alarms. These |
315 |
> |
* effectively reduce churn at the price of systematically |
316 |
> |
* undershooting target parallelism when many threads are blocked. |
317 |
> |
* However, biasing toward undeshooting partially compensates for |
318 |
> |
* the above mechanics to suspend extra threads, that normally |
319 |
> |
* lead to overshoot because we can only suspend workers |
320 |
> |
* in-between top-level actions. It also better copes with the |
321 |
> |
* fact that some of the methods in this class tend to never |
322 |
> |
* become compiled (but are interpreted), so some components of |
323 |
> |
* the entire set of controls might execute many times faster than |
324 |
> |
* others. And similarly for cases where the apparent lack of work |
325 |
> |
* is just due to GC stalls and other transient system activity. |
326 |
> |
* |
327 |
> |
* Beware that there is a lot of representation-level coupling |
328 |
> |
* among classes ForkJoinPool, ForkJoinWorkerThread, and |
329 |
> |
* ForkJoinTask. For example, direct access to "workers" array by |
330 |
> |
* workers, and direct access to ForkJoinTask.status by both |
331 |
> |
* ForkJoinPool and ForkJoinWorkerThread. There is little point |
332 |
> |
* trying to reduce this, since any associated future changes in |
333 |
> |
* representations will need to be accompanied by algorithmic |
334 |
> |
* changes anyway. |
335 |
> |
* |
336 |
> |
* Style notes: There are lots of inline assignments (of form |
337 |
> |
* "while ((local = field) != 0)") which are usually the simplest |
338 |
> |
* way to ensure read orderings. Also several occurrences of the |
339 |
> |
* unusual "do {} while(!cas...)" which is the simplest way to |
340 |
> |
* force an update of a CAS'ed variable. There are also other |
341 |
> |
* coding oddities that help some methods perform reasonably even |
342 |
> |
* when interpreted (not compiled), at the expense of messiness. |
343 |
> |
* |
344 |
> |
* The order of declarations in this file is: (1) statics (2) |
345 |
> |
* fields (along with constants used when unpacking some of them) |
346 |
> |
* (3) internal control methods (4) callbacks and other support |
347 |
> |
* for ForkJoinTask and ForkJoinWorkerThread classes, (5) exported |
348 |
> |
* methods (plus a few little helpers). |
349 |
> |
*/ |
350 |
> |
|
351 |
> |
/** |
352 |
> |
* Factory for creating new {@link ForkJoinWorkerThread}s. |
353 |
> |
* A {@code ForkJoinWorkerThreadFactory} must be defined and used |
354 |
> |
* for {@code ForkJoinWorkerThread} subclasses that extend base |
355 |
> |
* functionality or initialize threads with different contexts. |
356 |
|
*/ |
357 |
|
public static interface ForkJoinWorkerThreadFactory { |
358 |
|
/** |
359 |
|
* Returns a new worker thread operating in the given pool. |
360 |
|
* |
361 |
|
* @param pool the pool this thread works in |
362 |
< |
* @throws NullPointerException if pool is null |
362 |
> |
* @throws NullPointerException if the pool is null |
363 |
|
*/ |
364 |
|
public ForkJoinWorkerThread newThread(ForkJoinPool pool); |
365 |
|
} |
368 |
|
* Default ForkJoinWorkerThreadFactory implementation; creates a |
369 |
|
* new ForkJoinWorkerThread. |
370 |
|
*/ |
371 |
< |
static class DefaultForkJoinWorkerThreadFactory |
371 |
> |
static class DefaultForkJoinWorkerThreadFactory |
372 |
|
implements ForkJoinWorkerThreadFactory { |
373 |
|
public ForkJoinWorkerThread newThread(ForkJoinPool pool) { |
374 |
< |
try { |
107 |
< |
return new ForkJoinWorkerThread(pool); |
108 |
< |
} catch (OutOfMemoryError oom) { |
109 |
< |
return null; |
110 |
< |
} |
374 |
> |
return new ForkJoinWorkerThread(pool); |
375 |
|
} |
376 |
|
} |
377 |
|
|
407 |
|
new AtomicInteger(); |
408 |
|
|
409 |
|
/** |
410 |
< |
* Array holding all worker threads in the pool. Initialized upon |
411 |
< |
* first use. Array size must be a power of two. Updates and |
148 |
< |
* replacements are protected by workerLock, but it is always kept |
149 |
< |
* in a consistent enough state to be randomly accessed without |
150 |
< |
* locking by workers performing work-stealing. |
410 |
> |
* Absolute bound for parallelism level. Twice this number must |
411 |
> |
* fit into a 16bit field to enable word-packing for some counts. |
412 |
|
*/ |
413 |
< |
volatile ForkJoinWorkerThread[] workers; |
413 |
> |
private static final int MAX_THREADS = 0x7fff; |
414 |
|
|
415 |
|
/** |
416 |
< |
* Lock protecting access to workers. |
416 |
> |
* Array holding all worker threads in the pool. Array size must |
417 |
> |
* be a power of two. Updates and replacements are protected by |
418 |
> |
* workerLock, but the array is always kept in a consistent enough |
419 |
> |
* state to be randomly accessed without locking by workers |
420 |
> |
* performing work-stealing, as well as other traversal-based |
421 |
> |
* methods in this class. All readers must tolerate that some |
422 |
> |
* array slots may be null. |
423 |
|
*/ |
424 |
< |
private final ReentrantLock workerLock; |
424 |
> |
volatile ForkJoinWorkerThread[] workers; |
425 |
|
|
426 |
|
/** |
427 |
< |
* Condition for awaitTermination. |
427 |
> |
* Queue for external submissions. |
428 |
|
*/ |
429 |
< |
private final Condition termination; |
429 |
> |
private final LinkedTransferQueue<ForkJoinTask<?>> submissionQueue; |
430 |
|
|
431 |
|
/** |
432 |
< |
* The uncaught exception handler used when any worker |
166 |
< |
* abruptly terminates |
432 |
> |
* Lock protecting updates to workers array. |
433 |
|
*/ |
434 |
< |
private Thread.UncaughtExceptionHandler ueh; |
434 |
> |
private final ReentrantLock workerLock; |
435 |
|
|
436 |
|
/** |
437 |
< |
* Creation factory for worker threads. |
437 |
> |
* Latch released upon termination. |
438 |
|
*/ |
439 |
< |
private final ForkJoinWorkerThreadFactory factory; |
439 |
> |
private final Phaser termination; |
440 |
|
|
441 |
|
/** |
442 |
< |
* Head of stack of threads that were created to maintain |
177 |
< |
* parallelism when other threads blocked, but have since |
178 |
< |
* suspended when the parallelism level rose. |
442 |
> |
* Creation factory for worker threads. |
443 |
|
*/ |
444 |
< |
private volatile WaitQueueNode spareStack; |
444 |
> |
private final ForkJoinWorkerThreadFactory factory; |
445 |
|
|
446 |
|
/** |
447 |
|
* Sum of per-thread steal counts, updated only when threads are |
448 |
|
* idle or terminating. |
449 |
|
*/ |
450 |
< |
private final AtomicLong stealCount; |
450 |
> |
private volatile long stealCount; |
451 |
|
|
452 |
|
/** |
453 |
< |
* Queue for external submissions. |
453 |
> |
* Encoded record of top of treiber stack of threads waiting for |
454 |
> |
* events. The top 32 bits contain the count being waited for. The |
455 |
> |
* bottom word contains one plus the pool index of waiting worker |
456 |
> |
* thread. |
457 |
|
*/ |
458 |
< |
private final LinkedTransferQueue<ForkJoinTask<?>> submissionQueue; |
458 |
> |
private volatile long eventWaiters; |
459 |
> |
|
460 |
> |
private static final int EVENT_COUNT_SHIFT = 32; |
461 |
> |
private static final long WAITER_ID_MASK = (1L << EVENT_COUNT_SHIFT)-1L; |
462 |
|
|
463 |
|
/** |
464 |
< |
* Head of Treiber stack for barrier sync. See below for explanation. |
464 |
> |
* A counter for events that may wake up worker threads: |
465 |
> |
* - Submission of a new task to the pool |
466 |
> |
* - A worker pushing a task on an empty queue |
467 |
> |
* - termination and reconfiguration |
468 |
|
*/ |
469 |
< |
private volatile WaitQueueNode syncStack; |
469 |
> |
private volatile int eventCount; |
470 |
|
|
471 |
|
/** |
472 |
< |
* The count for event barrier |
473 |
< |
*/ |
474 |
< |
private volatile long eventCount; |
472 |
> |
* Lifecycle control. The low word contains the number of workers |
473 |
> |
* that are (probably) executing tasks. This value is atomically |
474 |
> |
* incremented before a worker gets a task to run, and decremented |
475 |
> |
* when worker has no tasks and cannot find any. Bits 16-18 |
476 |
> |
* contain runLevel value. When all are zero, the pool is |
477 |
> |
* running. Level transitions are monotonic (running -> shutdown |
478 |
> |
* -> terminating -> terminated) so each transition adds a bit. |
479 |
> |
* These are bundled together to ensure consistent read for |
480 |
> |
* termination checks (i.e., that runLevel is at least SHUTDOWN |
481 |
> |
* and active threads is zero). |
482 |
> |
*/ |
483 |
> |
private volatile int runState; |
484 |
> |
|
485 |
> |
// Note: The order among run level values matters. |
486 |
> |
private static final int RUNLEVEL_SHIFT = 16; |
487 |
> |
private static final int SHUTDOWN = 1 << RUNLEVEL_SHIFT; |
488 |
> |
private static final int TERMINATING = 1 << (RUNLEVEL_SHIFT + 1); |
489 |
> |
private static final int TERMINATED = 1 << (RUNLEVEL_SHIFT + 2); |
490 |
> |
private static final int ACTIVE_COUNT_MASK = (1 << RUNLEVEL_SHIFT) - 1; |
491 |
> |
private static final int ONE_ACTIVE = 1; // active update delta |
492 |
|
|
493 |
|
/** |
494 |
< |
* Pool number, just for assigning useful names to worker threads |
494 |
> |
* Holds number of total (i.e., created and not yet terminated) |
495 |
> |
* and running (i.e., not blocked on joins or other managed sync) |
496 |
> |
* threads, packed together to ensure consistent snapshot when |
497 |
> |
* making decisions about creating and suspending spare |
498 |
> |
* threads. Updated only by CAS. Note that adding a new worker |
499 |
> |
* requires incrementing both counts, since workers start off in |
500 |
> |
* running state. |
501 |
|
*/ |
502 |
< |
private final int poolNumber; |
502 |
> |
private volatile int workerCounts; |
503 |
> |
|
504 |
> |
private static final int TOTAL_COUNT_SHIFT = 16; |
505 |
> |
private static final int RUNNING_COUNT_MASK = (1 << TOTAL_COUNT_SHIFT) - 1; |
506 |
> |
private static final int ONE_RUNNING = 1; |
507 |
> |
private static final int ONE_TOTAL = 1 << TOTAL_COUNT_SHIFT; |
508 |
|
|
509 |
|
/** |
510 |
< |
* The maximum allowed pool size |
510 |
> |
* The target parallelism level. |
511 |
> |
* Accessed directly by ForkJoinWorkerThreads. |
512 |
|
*/ |
513 |
< |
private volatile int maxPoolSize; |
513 |
> |
final int parallelism; |
514 |
|
|
515 |
|
/** |
516 |
< |
* The desired parallelism level, updated only under workerLock. |
516 |
> |
* True if use local fifo, not default lifo, for local polling |
517 |
> |
* Read by, and replicated by ForkJoinWorkerThreads |
518 |
|
*/ |
519 |
< |
private volatile int parallelism; |
519 |
> |
final boolean locallyFifo; |
520 |
|
|
521 |
|
/** |
522 |
< |
* True if use local fifo, not default lifo, for local polling |
522 |
> |
* The uncaught exception handler used when any worker abruptly |
523 |
> |
* terminates. |
524 |
|
*/ |
525 |
< |
private volatile boolean locallyFifo; |
525 |
> |
private final Thread.UncaughtExceptionHandler ueh; |
526 |
|
|
527 |
|
/** |
528 |
< |
* Holds number of total (i.e., created and not yet terminated) |
225 |
< |
* and running (i.e., not blocked on joins or other managed sync) |
226 |
< |
* threads, packed into one int to ensure consistent snapshot when |
227 |
< |
* making decisions about creating and suspending spare |
228 |
< |
* threads. Updated only by CAS. Note: CASes in |
229 |
< |
* updateRunningCount and preJoin assume that running active count |
230 |
< |
* is in low word, so need to be modified if this changes. |
528 |
> |
* Pool number, just for assigning useful names to worker threads |
529 |
|
*/ |
530 |
< |
private volatile int workerCounts; |
530 |
> |
private final int poolNumber; |
531 |
|
|
532 |
< |
private static int totalCountOf(int s) { return s >>> 16; } |
533 |
< |
private static int runningCountOf(int s) { return s & shortMask; } |
236 |
< |
private static int workerCountsFor(int t, int r) { return (t << 16) + r; } |
532 |
> |
// Utilities for CASing fields. Note that several of these |
533 |
> |
// are manually inlined by callers |
534 |
|
|
535 |
|
/** |
536 |
< |
* Adds delta (which may be negative) to running count. This must |
240 |
< |
* be called before (with negative arg) and after (with positive) |
241 |
< |
* any managed synchronization (i.e., mainly, joins). |
242 |
< |
* |
243 |
< |
* @param delta the number to add |
536 |
> |
* Increments running count. Also used by ForkJoinTask. |
537 |
|
*/ |
538 |
< |
final void updateRunningCount(int delta) { |
539 |
< |
int s; |
540 |
< |
do {} while (!casWorkerCounts(s = workerCounts, s + delta)); |
538 |
> |
final void incrementRunningCount() { |
539 |
> |
int c; |
540 |
> |
do {} while (!UNSAFE.compareAndSwapInt(this, workerCountsOffset, |
541 |
> |
c = workerCounts, |
542 |
> |
c + ONE_RUNNING)); |
543 |
|
} |
544 |
|
|
545 |
|
/** |
546 |
< |
* Adds delta (which may be negative) to both total and running |
252 |
< |
* count. This must be called upon creation and termination of |
253 |
< |
* worker threads. |
254 |
< |
* |
255 |
< |
* @param delta the number to add |
546 |
> |
* Tries to decrement running count unless already zero |
547 |
|
*/ |
548 |
< |
private void updateWorkerCount(int delta) { |
549 |
< |
int d = delta + (delta << 16); // add to both lo and hi parts |
550 |
< |
int s; |
551 |
< |
do {} while (!casWorkerCounts(s = workerCounts, s + d)); |
548 |
> |
final boolean tryDecrementRunningCount() { |
549 |
> |
int wc = workerCounts; |
550 |
> |
if ((wc & RUNNING_COUNT_MASK) == 0) |
551 |
> |
return false; |
552 |
> |
return UNSAFE.compareAndSwapInt(this, workerCountsOffset, |
553 |
> |
wc, wc - ONE_RUNNING); |
554 |
|
} |
555 |
|
|
556 |
|
/** |
557 |
< |
* Lifecycle control. High word contains runState, low word |
265 |
< |
* contains the number of workers that are (probably) executing |
266 |
< |
* tasks. This value is atomically incremented before a worker |
267 |
< |
* gets a task to run, and decremented when worker has no tasks |
268 |
< |
* and cannot find any. These two fields are bundled together to |
269 |
< |
* support correct termination triggering. Note: activeCount |
270 |
< |
* CAS'es cheat by assuming active count is in low word, so need |
271 |
< |
* to be modified if this changes |
557 |
> |
* Tries to increment running count |
558 |
|
*/ |
559 |
< |
private volatile int runControl; |
560 |
< |
|
561 |
< |
// RunState values. Order among values matters |
562 |
< |
private static final int RUNNING = 0; |
563 |
< |
private static final int SHUTDOWN = 1; |
278 |
< |
private static final int TERMINATING = 2; |
279 |
< |
private static final int TERMINATED = 3; |
280 |
< |
|
281 |
< |
private static int runStateOf(int c) { return c >>> 16; } |
282 |
< |
private static int activeCountOf(int c) { return c & shortMask; } |
283 |
< |
private static int runControlFor(int r, int a) { return (r << 16) + a; } |
559 |
> |
final boolean tryIncrementRunningCount() { |
560 |
> |
int wc; |
561 |
> |
return UNSAFE.compareAndSwapInt(this, workerCountsOffset, |
562 |
> |
wc = workerCounts, wc + ONE_RUNNING); |
563 |
> |
} |
564 |
|
|
565 |
|
/** |
566 |
|
* Tries incrementing active count; fails on contention. |
567 |
< |
* Called by workers before/during executing tasks. |
567 |
> |
* Called by workers before executing tasks. |
568 |
|
* |
569 |
|
* @return true on success |
570 |
|
*/ |
571 |
|
final boolean tryIncrementActiveCount() { |
572 |
< |
int c = runControl; |
573 |
< |
return casRunControl(c, c+1); |
572 |
> |
int c; |
573 |
> |
return UNSAFE.compareAndSwapInt(this, runStateOffset, |
574 |
> |
c = runState, c + ONE_ACTIVE); |
575 |
|
} |
576 |
|
|
577 |
|
/** |
578 |
|
* Tries decrementing active count; fails on contention. |
579 |
< |
* Possibly triggers termination on success. |
299 |
< |
* Called by workers when they can't find tasks. |
300 |
< |
* |
301 |
< |
* @return true on success |
579 |
> |
* Called when workers cannot find tasks to run. |
580 |
|
*/ |
581 |
|
final boolean tryDecrementActiveCount() { |
582 |
< |
int c = runControl; |
583 |
< |
int nextc = c - 1; |
584 |
< |
if (!casRunControl(c, nextc)) |
307 |
< |
return false; |
308 |
< |
if (canTerminateOnShutdown(nextc)) |
309 |
< |
terminateOnShutdown(); |
310 |
< |
return true; |
582 |
> |
int c; |
583 |
> |
return UNSAFE.compareAndSwapInt(this, runStateOffset, |
584 |
> |
c = runState, c - ONE_ACTIVE); |
585 |
|
} |
586 |
|
|
587 |
|
/** |
588 |
< |
* Returns true if argument represents zero active count and |
589 |
< |
* nonzero runstate, which is the triggering condition for |
316 |
< |
* terminating on shutdown. |
588 |
> |
* Advances to at least the given level. Returns true if not |
589 |
> |
* already in at least the given level. |
590 |
|
*/ |
591 |
< |
private static boolean canTerminateOnShutdown(int c) { |
592 |
< |
// i.e. least bit is nonzero runState bit |
593 |
< |
return ((c & -c) >>> 16) != 0; |
591 |
> |
private boolean advanceRunLevel(int level) { |
592 |
> |
for (;;) { |
593 |
> |
int s = runState; |
594 |
> |
if ((s & level) != 0) |
595 |
> |
return false; |
596 |
> |
if (UNSAFE.compareAndSwapInt(this, runStateOffset, s, s | level)) |
597 |
> |
return true; |
598 |
> |
} |
599 |
|
} |
600 |
|
|
601 |
+ |
// workers array maintenance |
602 |
+ |
|
603 |
|
/** |
604 |
< |
* Transition run state to at least the given state. Return true |
325 |
< |
* if not already at least given state. |
604 |
> |
* Records and returns a workers array index for new worker. |
605 |
|
*/ |
606 |
< |
private boolean transitionRunStateTo(int state) { |
607 |
< |
for (;;) { |
608 |
< |
int c = runControl; |
609 |
< |
if (runStateOf(c) >= state) |
610 |
< |
return false; |
611 |
< |
if (casRunControl(c, runControlFor(state, activeCountOf(c)))) |
612 |
< |
return true; |
606 |
> |
private int recordWorker(ForkJoinWorkerThread w) { |
607 |
> |
// Try using slot totalCount-1. If not available, scan and/or resize |
608 |
> |
int k = (workerCounts >>> TOTAL_COUNT_SHIFT) - 1; |
609 |
> |
final ReentrantLock lock = this.workerLock; |
610 |
> |
lock.lock(); |
611 |
> |
try { |
612 |
> |
ForkJoinWorkerThread[] ws = workers; |
613 |
> |
int nws = ws.length; |
614 |
> |
if (k < 0 || k >= nws || ws[k] != null) { |
615 |
> |
for (k = 0; k < nws && ws[k] != null; ++k) |
616 |
> |
; |
617 |
> |
if (k == nws) |
618 |
> |
ws = Arrays.copyOf(ws, nws << 1); |
619 |
> |
} |
620 |
> |
ws[k] = w; |
621 |
> |
workers = ws; // volatile array write ensures slot visibility |
622 |
> |
} finally { |
623 |
> |
lock.unlock(); |
624 |
|
} |
625 |
+ |
return k; |
626 |
|
} |
627 |
|
|
628 |
|
/** |
629 |
< |
* Controls whether to add spares to maintain parallelism |
629 |
> |
* Nulls out record of worker in workers array |
630 |
|
*/ |
631 |
< |
private volatile boolean maintainsParallelism; |
631 |
> |
private void forgetWorker(ForkJoinWorkerThread w) { |
632 |
> |
int idx = w.poolIndex; |
633 |
> |
// Locking helps method recordWorker avoid unecessary expansion |
634 |
> |
final ReentrantLock lock = this.workerLock; |
635 |
> |
lock.lock(); |
636 |
> |
try { |
637 |
> |
ForkJoinWorkerThread[] ws = workers; |
638 |
> |
if (idx >= 0 && idx < ws.length && ws[idx] == w) // verify |
639 |
> |
ws[idx] = null; |
640 |
> |
} finally { |
641 |
> |
lock.unlock(); |
642 |
> |
} |
643 |
> |
} |
644 |
|
|
645 |
< |
// Constructors |
645 |
> |
// adding and removing workers |
646 |
|
|
647 |
|
/** |
648 |
< |
* Creates a ForkJoinPool with a pool size equal to the number of |
649 |
< |
* processors available on the system, using the default |
650 |
< |
* ForkJoinWorkerThreadFactory. |
648 |
> |
* Tries to create and add new worker. Assumes that worker counts |
649 |
> |
* are already updated to accommodate the worker, so adjusts on |
650 |
> |
* failure. |
651 |
|
* |
652 |
< |
* @throws SecurityException if a security manager exists and |
350 |
< |
* the caller is not permitted to modify threads |
351 |
< |
* because it does not hold {@link |
352 |
< |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
652 |
> |
* @return new worker or null if creation failed |
653 |
|
*/ |
654 |
< |
public ForkJoinPool() { |
655 |
< |
this(Runtime.getRuntime().availableProcessors(), |
656 |
< |
defaultForkJoinWorkerThreadFactory); |
654 |
> |
private ForkJoinWorkerThread addWorker() { |
655 |
> |
ForkJoinWorkerThread w = null; |
656 |
> |
try { |
657 |
> |
w = factory.newThread(this); |
658 |
> |
} finally { // Adjust on either null or exceptional factory return |
659 |
> |
if (w == null) |
660 |
> |
onWorkerCreationFailure(); |
661 |
> |
} |
662 |
> |
if (w != null) |
663 |
> |
w.start(recordWorker(w), ueh); |
664 |
> |
return w; |
665 |
|
} |
666 |
|
|
667 |
|
/** |
668 |
< |
* Creates a ForkJoinPool with the indicated parallelism level |
361 |
< |
* threads and using the default ForkJoinWorkerThreadFactory. |
362 |
< |
* |
363 |
< |
* @param parallelism the number of worker threads |
364 |
< |
* @throws IllegalArgumentException if parallelism less than or |
365 |
< |
* equal to zero |
366 |
< |
* @throws SecurityException if a security manager exists and |
367 |
< |
* the caller is not permitted to modify threads |
368 |
< |
* because it does not hold {@link |
369 |
< |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
668 |
> |
* Adjusts counts upon failure to create worker |
669 |
|
*/ |
670 |
< |
public ForkJoinPool(int parallelism) { |
671 |
< |
this(parallelism, defaultForkJoinWorkerThreadFactory); |
670 |
> |
private void onWorkerCreationFailure() { |
671 |
> |
for (;;) { |
672 |
> |
int wc = workerCounts; |
673 |
> |
int rc = wc & RUNNING_COUNT_MASK; |
674 |
> |
int tc = wc >>> TOTAL_COUNT_SHIFT; |
675 |
> |
if (rc == 0 || wc == 0) |
676 |
> |
Thread.yield(); // must wait for other counts to settle |
677 |
> |
else if (UNSAFE.compareAndSwapInt(this, workerCountsOffset, wc, |
678 |
> |
wc - (ONE_RUNNING|ONE_TOTAL))) |
679 |
> |
break; |
680 |
> |
} |
681 |
> |
tryTerminate(false); // in case of failure during shutdown |
682 |
|
} |
683 |
|
|
684 |
|
/** |
685 |
< |
* Creates a ForkJoinPool with parallelism equal to the number of |
686 |
< |
* processors available on the system and using the given |
378 |
< |
* ForkJoinWorkerThreadFactory. |
379 |
< |
* |
380 |
< |
* @param factory the factory for creating new threads |
381 |
< |
* @throws NullPointerException if factory is null |
382 |
< |
* @throws SecurityException if a security manager exists and |
383 |
< |
* the caller is not permitted to modify threads |
384 |
< |
* because it does not hold {@link |
385 |
< |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
685 |
> |
* Creates enough total workers to establish target parallelism, |
686 |
> |
* giving up if terminating or addWorker fails |
687 |
|
*/ |
688 |
< |
public ForkJoinPool(ForkJoinWorkerThreadFactory factory) { |
689 |
< |
this(Runtime.getRuntime().availableProcessors(), factory); |
688 |
> |
private void ensureEnoughTotalWorkers() { |
689 |
> |
int wc; |
690 |
> |
while (((wc = workerCounts) >>> TOTAL_COUNT_SHIFT) < parallelism && |
691 |
> |
runState < TERMINATING) { |
692 |
> |
if ((UNSAFE.compareAndSwapInt(this, workerCountsOffset, |
693 |
> |
wc, wc + (ONE_RUNNING|ONE_TOTAL)) && |
694 |
> |
addWorker() == null)) |
695 |
> |
break; |
696 |
> |
} |
697 |
|
} |
698 |
|
|
699 |
|
/** |
700 |
< |
* Creates a ForkJoinPool with the given parallelism and factory. |
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 terminatation, else possibly replaces |
703 |
> |
* the worker. |
704 |
|
* |
705 |
< |
* @param parallelism the targeted number of worker threads |
395 |
< |
* @param factory the factory for creating new threads |
396 |
< |
* @throws IllegalArgumentException if parallelism less than or |
397 |
< |
* equal to zero, or greater than implementation limit |
398 |
< |
* @throws NullPointerException if factory is null |
399 |
< |
* @throws SecurityException if a security manager exists and |
400 |
< |
* the caller is not permitted to modify threads |
401 |
< |
* because it does not hold {@link |
402 |
< |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
705 |
> |
* @param w the worker |
706 |
|
*/ |
707 |
< |
public ForkJoinPool(int parallelism, ForkJoinWorkerThreadFactory factory) { |
708 |
< |
if (parallelism <= 0 || parallelism > MAX_THREADS) |
709 |
< |
throw new IllegalArgumentException(); |
710 |
< |
if (factory == null) |
711 |
< |
throw new NullPointerException(); |
712 |
< |
checkPermission(); |
713 |
< |
this.factory = factory; |
714 |
< |
this.parallelism = parallelism; |
715 |
< |
this.maxPoolSize = MAX_THREADS; |
716 |
< |
this.maintainsParallelism = true; |
717 |
< |
this.poolNumber = poolNumberGenerator.incrementAndGet(); |
718 |
< |
this.workerLock = new ReentrantLock(); |
719 |
< |
this.termination = workerLock.newCondition(); |
720 |
< |
this.stealCount = new AtomicLong(); |
721 |
< |
this.submissionQueue = new LinkedTransferQueue<ForkJoinTask<?>>(); |
722 |
< |
// worker array and workers are lazily constructed |
707 |
> |
final void workerTerminated(ForkJoinWorkerThread w) { |
708 |
> |
if (w.active) { // force inactive |
709 |
> |
w.active = false; |
710 |
> |
do {} while (!tryDecrementActiveCount()); |
711 |
> |
} |
712 |
> |
forgetWorker(w); |
713 |
> |
|
714 |
> |
// Decrement total count, and if was running, running count |
715 |
> |
// Spin (waiting for other updates) if either would be negative |
716 |
> |
int nr = w.isTrimmed() ? 0 : ONE_RUNNING; |
717 |
> |
int unit = ONE_TOTAL + nr; |
718 |
> |
for (;;) { |
719 |
> |
int wc = workerCounts; |
720 |
> |
int rc = wc & RUNNING_COUNT_MASK; |
721 |
> |
int tc = wc >>> TOTAL_COUNT_SHIFT; |
722 |
> |
if (rc - nr < 0 || tc == 0) |
723 |
> |
Thread.yield(); // back off if waiting for other updates |
724 |
> |
else if (UNSAFE.compareAndSwapInt(this, workerCountsOffset, |
725 |
> |
wc, wc - unit)) |
726 |
> |
break; |
727 |
> |
} |
728 |
> |
|
729 |
> |
accumulateStealCount(w); // collect final count |
730 |
> |
if (!tryTerminate(false)) |
731 |
> |
ensureEnoughTotalWorkers(); |
732 |
|
} |
733 |
|
|
734 |
+ |
// Waiting for and signalling events |
735 |
+ |
|
736 |
|
/** |
737 |
< |
* Creates a new worker thread using factory. |
738 |
< |
* |
425 |
< |
* @param index the index to assign worker |
426 |
< |
* @return new worker, or null of factory failed |
737 |
> |
* Releases workers blocked on a count not equal to current count. |
738 |
> |
* @return true if any released |
739 |
|
*/ |
740 |
< |
private ForkJoinWorkerThread createWorker(int index) { |
741 |
< |
Thread.UncaughtExceptionHandler h = ueh; |
742 |
< |
ForkJoinWorkerThread w = factory.newThread(this); |
743 |
< |
if (w != null) { |
744 |
< |
w.poolIndex = index; |
745 |
< |
w.setDaemon(true); |
746 |
< |
w.setAsyncMode(locallyFifo); |
747 |
< |
w.setName("ForkJoinPool-" + poolNumber + "-worker-" + index); |
748 |
< |
if (h != null) |
749 |
< |
w.setUncaughtExceptionHandler(h); |
740 |
> |
private void releaseWaiters() { |
741 |
> |
long top; |
742 |
> |
while ((top = eventWaiters) != 0L) { |
743 |
> |
ForkJoinWorkerThread[] ws = workers; |
744 |
> |
int n = ws.length; |
745 |
> |
for (;;) { |
746 |
> |
int i = ((int)(top & WAITER_ID_MASK)) - 1; |
747 |
> |
int e = (int)(top >>> EVENT_COUNT_SHIFT); |
748 |
> |
if (i < 0 || e == eventCount) |
749 |
> |
return; |
750 |
> |
ForkJoinWorkerThread w; |
751 |
> |
if (i < n && (w = ws[i]) != null && |
752 |
> |
UNSAFE.compareAndSwapLong(this, eventWaitersOffset, |
753 |
> |
top, w.nextWaiter)) { |
754 |
> |
LockSupport.unpark(w); |
755 |
> |
top = eventWaiters; |
756 |
> |
} |
757 |
> |
else |
758 |
> |
break; // possibly stale; reread |
759 |
> |
} |
760 |
|
} |
439 |
– |
return w; |
761 |
|
} |
762 |
|
|
763 |
|
/** |
764 |
< |
* Returns a good size for worker array given pool size. |
765 |
< |
* Currently requires size to be a power of two. |
764 |
> |
* Ensures eventCount on exit is different (mod 2^32) than on |
765 |
> |
* entry and wakes up all waiters |
766 |
|
*/ |
767 |
< |
private static int arraySizeFor(int poolSize) { |
768 |
< |
return (poolSize <= 1) ? 1 : |
769 |
< |
(1 << (32 - Integer.numberOfLeadingZeros(poolSize-1))); |
767 |
> |
private void signalEvent() { |
768 |
> |
int c; |
769 |
> |
do {} while (!UNSAFE.compareAndSwapInt(this, eventCountOffset, |
770 |
> |
c = eventCount, c+1)); |
771 |
> |
releaseWaiters(); |
772 |
|
} |
773 |
|
|
774 |
|
/** |
775 |
< |
* Creates or resizes array if necessary to hold newLength. |
776 |
< |
* Call only under exclusion. |
454 |
< |
* |
455 |
< |
* @return the array |
775 |
> |
* Advances eventCount and releases waiters until interference by |
776 |
> |
* other releasing threads is detected. |
777 |
|
*/ |
778 |
< |
private ForkJoinWorkerThread[] ensureWorkerArrayCapacity(int newLength) { |
779 |
< |
ForkJoinWorkerThread[] ws = workers; |
780 |
< |
if (ws == null) |
781 |
< |
return workers = new ForkJoinWorkerThread[arraySizeFor(newLength)]; |
782 |
< |
else if (newLength > ws.length) |
783 |
< |
return workers = Arrays.copyOf(ws, arraySizeFor(newLength)); |
784 |
< |
else |
785 |
< |
return ws; |
778 |
> |
final void signalWork() { |
779 |
> |
int c; |
780 |
> |
UNSAFE.compareAndSwapInt(this, eventCountOffset, c=eventCount, c+1); |
781 |
> |
long top; |
782 |
> |
while ((top = eventWaiters) != 0L) { |
783 |
> |
int ec = eventCount; |
784 |
> |
ForkJoinWorkerThread[] ws = workers; |
785 |
> |
int n = ws.length; |
786 |
> |
for (;;) { |
787 |
> |
int i = ((int)(top & WAITER_ID_MASK)) - 1; |
788 |
> |
int e = (int)(top >>> EVENT_COUNT_SHIFT); |
789 |
> |
if (i < 0 || e == ec) |
790 |
> |
return; |
791 |
> |
ForkJoinWorkerThread w; |
792 |
> |
if (i < n && (w = ws[i]) != null && |
793 |
> |
UNSAFE.compareAndSwapLong(this, eventWaitersOffset, |
794 |
> |
top, top = w.nextWaiter)) { |
795 |
> |
LockSupport.unpark(w); |
796 |
> |
if (top != eventWaiters) // let someone else take over |
797 |
> |
return; |
798 |
> |
} |
799 |
> |
else |
800 |
> |
break; // possibly stale; reread |
801 |
> |
} |
802 |
> |
} |
803 |
|
} |
804 |
|
|
805 |
|
/** |
806 |
< |
* Tries to shrink workers into smaller array after one or more terminate. |
806 |
> |
* Blockss worker until terminating or event count |
807 |
> |
* advances from last value held by worker |
808 |
> |
* |
809 |
> |
* @param w the calling worker thread |
810 |
|
*/ |
811 |
< |
private void tryShrinkWorkerArray() { |
812 |
< |
ForkJoinWorkerThread[] ws = workers; |
813 |
< |
if (ws != null) { |
814 |
< |
int len = ws.length; |
815 |
< |
int last = len - 1; |
816 |
< |
while (last >= 0 && ws[last] == null) |
817 |
< |
--last; |
818 |
< |
int newLength = arraySizeFor(last+1); |
819 |
< |
if (newLength < len) |
820 |
< |
workers = Arrays.copyOf(ws, newLength); |
811 |
> |
private void eventSync(ForkJoinWorkerThread w) { |
812 |
> |
int wec = w.lastEventCount; |
813 |
> |
long nextTop = (((long)wec << EVENT_COUNT_SHIFT) | |
814 |
> |
((long)(w.poolIndex + 1))); |
815 |
> |
long top; |
816 |
> |
while ((runState < SHUTDOWN || !tryTerminate(false)) && |
817 |
> |
(((int)(top = eventWaiters) & WAITER_ID_MASK) == 0 || |
818 |
> |
(int)(top >>> EVENT_COUNT_SHIFT) == wec) && |
819 |
> |
eventCount == wec) { |
820 |
> |
if (UNSAFE.compareAndSwapLong(this, eventWaitersOffset, |
821 |
> |
w.nextWaiter = top, nextTop)) { |
822 |
> |
accumulateStealCount(w); // transfer steals while idle |
823 |
> |
Thread.interrupted(); // clear/ignore interrupt |
824 |
> |
while (eventCount == wec) |
825 |
> |
w.doPark(); |
826 |
> |
break; |
827 |
> |
} |
828 |
|
} |
829 |
+ |
w.lastEventCount = eventCount; |
830 |
|
} |
831 |
|
|
832 |
|
/** |
833 |
< |
* Initializes workers if necessary. |
833 |
> |
* Callback from workers invoked upon each top-level action (i.e., |
834 |
> |
* stealing a task or taking a submission and running |
835 |
> |
* it). Performs one or both of the following: |
836 |
> |
* |
837 |
> |
* * If the worker cannot find work, updates its active status to |
838 |
> |
* inactive and updates activeCount unless there is contention, in |
839 |
> |
* which case it may try again (either in this or a subsequent |
840 |
> |
* call). Additionally, awaits the next task event and/or helps |
841 |
> |
* wake up other releasable waiters. |
842 |
> |
* |
843 |
> |
* * If there are too many running threads, suspends this worker |
844 |
> |
* (first forcing inactivation if necessary). If it is not |
845 |
> |
* resumed before a keepAlive elapses, the worker may be "trimmed" |
846 |
> |
* -- killed while suspended within suspendAsSpare. Otherwise, |
847 |
> |
* upon resume it rechecks to make sure that it is still needed. |
848 |
> |
* |
849 |
> |
* @param w the worker |
850 |
> |
* @param retries the number of scans by caller failing to find work |
851 |
> |
* find any (in which case it may block waiting for work). |
852 |
|
*/ |
853 |
< |
final void ensureWorkerInitialization() { |
854 |
< |
ForkJoinWorkerThread[] ws = workers; |
855 |
< |
if (ws == null) { |
856 |
< |
final ReentrantLock lock = this.workerLock; |
857 |
< |
lock.lock(); |
858 |
< |
try { |
859 |
< |
ws = workers; |
860 |
< |
if (ws == null) { |
861 |
< |
int ps = parallelism; |
862 |
< |
ws = ensureWorkerArrayCapacity(ps); |
863 |
< |
for (int i = 0; i < ps; ++i) { |
864 |
< |
ForkJoinWorkerThread w = createWorker(i); |
865 |
< |
if (w != null) { |
866 |
< |
ws[i] = w; |
867 |
< |
w.start(); |
868 |
< |
updateWorkerCount(1); |
853 |
> |
final void preStep(ForkJoinWorkerThread w, int retries) { |
854 |
> |
boolean active = w.active; |
855 |
> |
boolean inactivate = active && retries > 0; |
856 |
> |
for (;;) { |
857 |
> |
int rs, wc; |
858 |
> |
if (inactivate && |
859 |
> |
UNSAFE.compareAndSwapInt(this, runStateOffset, |
860 |
> |
rs = runState, rs - ONE_ACTIVE)) |
861 |
> |
inactivate = active = w.active = false; |
862 |
> |
if (((wc = workerCounts) & RUNNING_COUNT_MASK) <= parallelism) { |
863 |
> |
if (retries > 0) { |
864 |
> |
if (retries > 1 && !active) |
865 |
> |
eventSync(w); |
866 |
> |
releaseWaiters(); |
867 |
> |
} |
868 |
> |
break; |
869 |
> |
} |
870 |
> |
if (!(inactivate |= active) && // must inactivate to suspend |
871 |
> |
UNSAFE.compareAndSwapInt(this, workerCountsOffset, |
872 |
> |
wc, wc - ONE_RUNNING) && |
873 |
> |
!w.suspendAsSpare()) // false if trimmed |
874 |
> |
break; |
875 |
> |
} |
876 |
> |
} |
877 |
> |
|
878 |
> |
/** |
879 |
> |
* Awaits join of the given task if enough threads, or can resume |
880 |
> |
* or create a spare. Fails (in which case the given task might |
881 |
> |
* not be done) upon contention or lack of decision about |
882 |
> |
* blocking. |
883 |
> |
* |
884 |
> |
* We allow blocking if: |
885 |
> |
* |
886 |
> |
* 1. There would still be at least as many running threads as |
887 |
> |
* parallelism level if this thread blocks. |
888 |
> |
* |
889 |
> |
* 2. A spare is resumed to replace this worker. We tolerate |
890 |
> |
* races in the decision to replace when a spare is found. |
891 |
> |
* This may release too many, but if so, the superfluous ones |
892 |
> |
* will re-suspend via preStep(). |
893 |
> |
* |
894 |
> |
* 3. After #spares repeated retries, there are fewer than #spare |
895 |
> |
* threads not running. We allow this slack to avoid hysteresis |
896 |
> |
* and as a hedge against lag/uncertainty of running count |
897 |
> |
* estimates when signalling or unblocking stalls. |
898 |
> |
* |
899 |
> |
* 4. All existing workers are busy (as rechecked via #spares |
900 |
> |
* repeated retries by caller) and a new spare is created. |
901 |
> |
* |
902 |
> |
* If none of the above hold, we escape out by re-incrementing |
903 |
> |
* count and returning to caller, which can retry later. |
904 |
> |
* |
905 |
> |
* @param joinMe the task to join |
906 |
> |
* @param retries the number of calls to this method for this join |
907 |
> |
*/ |
908 |
> |
final void tryAwaitJoin(ForkJoinTask<?> joinMe, int retries) { |
909 |
> |
int pc = parallelism; |
910 |
> |
boolean running = true; // false when running count decremented |
911 |
> |
outer:while (joinMe.status >= 0) { |
912 |
> |
int wc = workerCounts; |
913 |
> |
int rc = wc & RUNNING_COUNT_MASK; |
914 |
> |
int tc = wc >>> TOTAL_COUNT_SHIFT; |
915 |
> |
if (running) { // replace with spare or decrement count |
916 |
> |
if (rc <= pc && tc > pc && |
917 |
> |
(retries > 0 || tc > (runState & ACTIVE_COUNT_MASK))) { |
918 |
> |
ForkJoinWorkerThread[] ws = workers; // search for spare |
919 |
> |
int nws = ws.length; |
920 |
> |
for (int i = 0; i < nws; ++i) { |
921 |
> |
ForkJoinWorkerThread w = ws[i]; |
922 |
> |
if (w != null && w.isSuspended()) { |
923 |
> |
if ((workerCounts & RUNNING_COUNT_MASK) > pc) |
924 |
> |
continue outer; |
925 |
> |
if (joinMe.status < 0) |
926 |
> |
break outer; |
927 |
> |
if (w.tryResumeSpare()) { |
928 |
> |
running = false; |
929 |
> |
break outer; |
930 |
> |
} |
931 |
> |
continue outer; // rescan on failure to resume |
932 |
|
} |
933 |
|
} |
934 |
|
} |
935 |
< |
} finally { |
936 |
< |
lock.unlock(); |
935 |
> |
if ((rc <= pc && (rc == 0 || --retries < 0)) || // no retry |
936 |
> |
joinMe.status < 0) |
937 |
> |
break; |
938 |
> |
if (workerCounts == wc && |
939 |
> |
UNSAFE.compareAndSwapInt(this, workerCountsOffset, |
940 |
> |
wc, wc - ONE_RUNNING)) |
941 |
> |
running = false; |
942 |
> |
} |
943 |
> |
else { // allow blocking if enough threads |
944 |
> |
int sc = tc - pc + 1; // = spares, plus the one to add |
945 |
> |
if (sc > 0 && rc > 0 && rc >= pc - sc && rc > pc - retries) |
946 |
> |
break; |
947 |
> |
if (--retries > sc && tc < MAX_THREADS && |
948 |
> |
tc == (runState & ACTIVE_COUNT_MASK) && |
949 |
> |
workerCounts == wc && |
950 |
> |
UNSAFE.compareAndSwapInt(this, workerCountsOffset, wc, |
951 |
> |
wc + (ONE_RUNNING|ONE_TOTAL))) { |
952 |
> |
addWorker(); |
953 |
> |
break; |
954 |
> |
} |
955 |
> |
if (workerCounts == wc && |
956 |
> |
UNSAFE.compareAndSwapInt (this, workerCountsOffset, |
957 |
> |
wc, wc + ONE_RUNNING)) { |
958 |
> |
running = true; // back out; allow retry |
959 |
> |
break; |
960 |
> |
} |
961 |
|
} |
962 |
|
} |
963 |
+ |
if (!running) { // can block |
964 |
+ |
int c; // to inline incrementRunningCount |
965 |
+ |
joinMe.internalAwaitDone(); |
966 |
+ |
do {} while (!UNSAFE.compareAndSwapInt |
967 |
+ |
(this, workerCountsOffset, |
968 |
+ |
c = workerCounts, c + ONE_RUNNING)); |
969 |
+ |
} |
970 |
|
} |
971 |
|
|
972 |
|
/** |
973 |
< |
* Worker creation and startup for threads added via setParallelism. |
973 |
> |
* Same idea as (and shares many code snippets with) tryAwaitJoin, |
974 |
> |
* but self-contained because there are no caller retries. |
975 |
> |
* TODO: Rework to use simpler API. |
976 |
|
*/ |
977 |
< |
private void createAndStartAddedWorkers() { |
978 |
< |
resumeAllSpares(); // Allow spares to convert to nonspare |
979 |
< |
int ps = parallelism; |
980 |
< |
ForkJoinWorkerThread[] ws = ensureWorkerArrayCapacity(ps); |
981 |
< |
int len = ws.length; |
982 |
< |
// Sweep through slots, to keep lowest indices most populated |
983 |
< |
int k = 0; |
984 |
< |
while (k < len) { |
985 |
< |
if (ws[k] != null) { |
986 |
< |
++k; |
987 |
< |
continue; |
977 |
> |
final void awaitBlocker(ManagedBlocker blocker) |
978 |
> |
throws InterruptedException { |
979 |
> |
int pc = parallelism; |
980 |
> |
boolean running = true; |
981 |
> |
int retries = 0; |
982 |
> |
boolean done; |
983 |
> |
outer:while (!(done = blocker.isReleasable())) { |
984 |
> |
int wc = workerCounts; |
985 |
> |
int rc = wc & RUNNING_COUNT_MASK; |
986 |
> |
int tc = wc >>> TOTAL_COUNT_SHIFT; |
987 |
> |
if (running) { |
988 |
> |
if (rc <= pc && tc > pc && |
989 |
> |
(retries > 0 || tc > (runState & ACTIVE_COUNT_MASK))) { |
990 |
> |
ForkJoinWorkerThread[] ws = workers; |
991 |
> |
int nws = ws.length; |
992 |
> |
for (int i = 0; i < nws; ++i) { |
993 |
> |
ForkJoinWorkerThread w = ws[i]; |
994 |
> |
if (w != null && w.isSuspended()) { |
995 |
> |
if ((workerCounts & RUNNING_COUNT_MASK) > pc) |
996 |
> |
continue outer; |
997 |
> |
if (done = blocker.isReleasable()) |
998 |
> |
break outer; |
999 |
> |
if (w.tryResumeSpare()) { |
1000 |
> |
running = false; |
1001 |
> |
break outer; |
1002 |
> |
} |
1003 |
> |
continue outer; |
1004 |
> |
} |
1005 |
> |
} |
1006 |
> |
if (done = blocker.isReleasable()) |
1007 |
> |
break; |
1008 |
> |
} |
1009 |
> |
if (rc > 0 && workerCounts == wc && |
1010 |
> |
UNSAFE.compareAndSwapInt(this, workerCountsOffset, |
1011 |
> |
wc, wc - ONE_RUNNING)) { |
1012 |
> |
running = false; |
1013 |
> |
if (rc > pc) |
1014 |
> |
break; |
1015 |
> |
} |
1016 |
|
} |
1017 |
< |
int s = workerCounts; |
527 |
< |
int tc = totalCountOf(s); |
528 |
< |
int rc = runningCountOf(s); |
529 |
< |
if (rc >= ps || tc >= ps) |
1017 |
> |
else if (rc >= pc) |
1018 |
|
break; |
1019 |
< |
if (casWorkerCounts (s, workerCountsFor(tc+1, rc+1))) { |
1020 |
< |
ForkJoinWorkerThread w = createWorker(k); |
1021 |
< |
if (w != null) { |
1022 |
< |
ws[k++] = w; |
1023 |
< |
w.start(); |
1024 |
< |
} |
1025 |
< |
else { |
1026 |
< |
updateWorkerCount(-1); // back out on failed creation |
1027 |
< |
break; |
1019 |
> |
else if (tc < MAX_THREADS && |
1020 |
> |
tc == (runState & ACTIVE_COUNT_MASK) && |
1021 |
> |
workerCounts == wc && |
1022 |
> |
UNSAFE.compareAndSwapInt(this, workerCountsOffset, wc, |
1023 |
> |
wc + (ONE_RUNNING|ONE_TOTAL))) { |
1024 |
> |
addWorker(); |
1025 |
> |
break; |
1026 |
> |
} |
1027 |
> |
else if (workerCounts == wc && |
1028 |
> |
UNSAFE.compareAndSwapInt (this, workerCountsOffset, |
1029 |
> |
wc, wc + ONE_RUNNING)) { |
1030 |
> |
Thread.yield(); |
1031 |
> |
++retries; |
1032 |
> |
running = true; // allow rescan |
1033 |
> |
} |
1034 |
> |
} |
1035 |
> |
|
1036 |
> |
try { |
1037 |
> |
if (!done) |
1038 |
> |
do {} while (!blocker.isReleasable() && !blocker.block()); |
1039 |
> |
} finally { |
1040 |
> |
if (!running) { |
1041 |
> |
int c; |
1042 |
> |
do {} while (!UNSAFE.compareAndSwapInt |
1043 |
> |
(this, workerCountsOffset, |
1044 |
> |
c = workerCounts, c + ONE_RUNNING)); |
1045 |
> |
} |
1046 |
> |
} |
1047 |
> |
} |
1048 |
> |
|
1049 |
> |
/** |
1050 |
> |
* Possibly initiates and/or completes termination. |
1051 |
> |
* |
1052 |
> |
* @param now if true, unconditionally terminate, else only |
1053 |
> |
* if shutdown and empty queue and no active workers |
1054 |
> |
* @return true if now terminating or terminated |
1055 |
> |
*/ |
1056 |
> |
private boolean tryTerminate(boolean now) { |
1057 |
> |
if (now) |
1058 |
> |
advanceRunLevel(SHUTDOWN); // ensure at least SHUTDOWN |
1059 |
> |
else if (runState < SHUTDOWN || |
1060 |
> |
!submissionQueue.isEmpty() || |
1061 |
> |
(runState & ACTIVE_COUNT_MASK) != 0) |
1062 |
> |
return false; |
1063 |
> |
|
1064 |
> |
if (advanceRunLevel(TERMINATING)) |
1065 |
> |
startTerminating(); |
1066 |
> |
|
1067 |
> |
// Finish now if all threads terminated; else in some subsequent call |
1068 |
> |
if ((workerCounts >>> TOTAL_COUNT_SHIFT) == 0) { |
1069 |
> |
advanceRunLevel(TERMINATED); |
1070 |
> |
termination.arrive(); |
1071 |
> |
} |
1072 |
> |
return true; |
1073 |
> |
} |
1074 |
> |
|
1075 |
> |
/** |
1076 |
> |
* Actions on transition to TERMINATING |
1077 |
> |
*/ |
1078 |
> |
private void startTerminating() { |
1079 |
> |
for (int i = 0; i < 2; ++i) { // twice to mop up newly created workers |
1080 |
> |
cancelSubmissions(); |
1081 |
> |
shutdownWorkers(); |
1082 |
> |
cancelWorkerTasks(); |
1083 |
> |
signalEvent(); |
1084 |
> |
interruptWorkers(); |
1085 |
> |
} |
1086 |
> |
} |
1087 |
> |
|
1088 |
> |
/** |
1089 |
> |
* Clear out and cancel submissions, ignoring exceptions |
1090 |
> |
*/ |
1091 |
> |
private void cancelSubmissions() { |
1092 |
> |
ForkJoinTask<?> task; |
1093 |
> |
while ((task = submissionQueue.poll()) != null) { |
1094 |
> |
try { |
1095 |
> |
task.cancel(false); |
1096 |
> |
} catch (Throwable ignore) { |
1097 |
> |
} |
1098 |
> |
} |
1099 |
> |
} |
1100 |
> |
|
1101 |
> |
/** |
1102 |
> |
* Sets all worker run states to at least shutdown, |
1103 |
> |
* also resuming suspended workers |
1104 |
> |
*/ |
1105 |
> |
private void shutdownWorkers() { |
1106 |
> |
ForkJoinWorkerThread[] ws = workers; |
1107 |
> |
int nws = ws.length; |
1108 |
> |
for (int i = 0; i < nws; ++i) { |
1109 |
> |
ForkJoinWorkerThread w = ws[i]; |
1110 |
> |
if (w != null) |
1111 |
> |
w.shutdown(); |
1112 |
> |
} |
1113 |
> |
} |
1114 |
> |
|
1115 |
> |
/** |
1116 |
> |
* Clears out and cancels all locally queued tasks |
1117 |
> |
*/ |
1118 |
> |
private void cancelWorkerTasks() { |
1119 |
> |
ForkJoinWorkerThread[] ws = workers; |
1120 |
> |
int nws = ws.length; |
1121 |
> |
for (int i = 0; i < nws; ++i) { |
1122 |
> |
ForkJoinWorkerThread w = ws[i]; |
1123 |
> |
if (w != null) |
1124 |
> |
w.cancelTasks(); |
1125 |
> |
} |
1126 |
> |
} |
1127 |
> |
|
1128 |
> |
/** |
1129 |
> |
* Unsticks all workers blocked on joins etc |
1130 |
> |
*/ |
1131 |
> |
private void interruptWorkers() { |
1132 |
> |
ForkJoinWorkerThread[] ws = workers; |
1133 |
> |
int nws = ws.length; |
1134 |
> |
for (int i = 0; i < nws; ++i) { |
1135 |
> |
ForkJoinWorkerThread w = ws[i]; |
1136 |
> |
if (w != null && !w.isTerminated()) { |
1137 |
> |
try { |
1138 |
> |
w.interrupt(); |
1139 |
> |
} catch (SecurityException ignore) { |
1140 |
|
} |
1141 |
|
} |
1142 |
|
} |
1143 |
|
} |
1144 |
|
|
1145 |
+ |
// misc support for ForkJoinWorkerThread |
1146 |
+ |
|
1147 |
+ |
/** |
1148 |
+ |
* Returns pool number |
1149 |
+ |
*/ |
1150 |
+ |
final int getPoolNumber() { |
1151 |
+ |
return poolNumber; |
1152 |
+ |
} |
1153 |
+ |
|
1154 |
+ |
/** |
1155 |
+ |
* Accumulates steal count from a worker, clearing |
1156 |
+ |
* the worker's value |
1157 |
+ |
*/ |
1158 |
+ |
final void accumulateStealCount(ForkJoinWorkerThread w) { |
1159 |
+ |
int sc = w.stealCount; |
1160 |
+ |
if (sc != 0) { |
1161 |
+ |
long c; |
1162 |
+ |
w.stealCount = 0; |
1163 |
+ |
do {} while (!UNSAFE.compareAndSwapLong(this, stealCountOffset, |
1164 |
+ |
c = stealCount, c + sc)); |
1165 |
+ |
} |
1166 |
+ |
} |
1167 |
+ |
|
1168 |
+ |
/** |
1169 |
+ |
* Returns the approximate (non-atomic) number of idle threads per |
1170 |
+ |
* active thread. |
1171 |
+ |
*/ |
1172 |
+ |
final int idlePerActive() { |
1173 |
+ |
int pc = parallelism; // use parallelism, not rc |
1174 |
+ |
int ac = runState; // no mask -- artifically boosts during shutdown |
1175 |
+ |
// Use exact results for small values, saturate past 4 |
1176 |
+ |
return pc <= ac? 0 : pc >>> 1 <= ac? 1 : pc >>> 2 <= ac? 3 : pc >>> 3; |
1177 |
+ |
} |
1178 |
+ |
|
1179 |
+ |
// Public and protected methods |
1180 |
+ |
|
1181 |
+ |
// Constructors |
1182 |
+ |
|
1183 |
+ |
/** |
1184 |
+ |
* Creates a {@code ForkJoinPool} with parallelism equal to {@link |
1185 |
+ |
* java.lang.Runtime#availableProcessors}, using the {@linkplain |
1186 |
+ |
* #defaultForkJoinWorkerThreadFactory default thread factory}, |
1187 |
+ |
* no UncaughtExceptionHandler, and non-async LIFO processing mode. |
1188 |
+ |
* |
1189 |
+ |
* @throws SecurityException if a security manager exists and |
1190 |
+ |
* the caller is not permitted to modify threads |
1191 |
+ |
* because it does not hold {@link |
1192 |
+ |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
1193 |
+ |
*/ |
1194 |
+ |
public ForkJoinPool() { |
1195 |
+ |
this(Runtime.getRuntime().availableProcessors(), |
1196 |
+ |
defaultForkJoinWorkerThreadFactory, null, false); |
1197 |
+ |
} |
1198 |
+ |
|
1199 |
+ |
/** |
1200 |
+ |
* Creates a {@code ForkJoinPool} with the indicated parallelism |
1201 |
+ |
* level, the {@linkplain |
1202 |
+ |
* #defaultForkJoinWorkerThreadFactory default thread factory}, |
1203 |
+ |
* no UncaughtExceptionHandler, and non-async LIFO processing mode. |
1204 |
+ |
* |
1205 |
+ |
* @param parallelism the parallelism level |
1206 |
+ |
* @throws IllegalArgumentException if parallelism less than or |
1207 |
+ |
* equal to zero, or greater than implementation limit |
1208 |
+ |
* @throws SecurityException if a security manager exists and |
1209 |
+ |
* the caller is not permitted to modify threads |
1210 |
+ |
* because it does not hold {@link |
1211 |
+ |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
1212 |
+ |
*/ |
1213 |
+ |
public ForkJoinPool(int parallelism) { |
1214 |
+ |
this(parallelism, defaultForkJoinWorkerThreadFactory, null, false); |
1215 |
+ |
} |
1216 |
+ |
|
1217 |
+ |
/** |
1218 |
+ |
* Creates a {@code ForkJoinPool} with the given parameters. |
1219 |
+ |
* |
1220 |
+ |
* @param parallelism the parallelism level. For default value, |
1221 |
+ |
* use {@link java.lang.Runtime#availableProcessors}. |
1222 |
+ |
* @param factory the factory for creating new threads. For default value, |
1223 |
+ |
* use {@link #defaultForkJoinWorkerThreadFactory}. |
1224 |
+ |
* @param handler the handler for internal worker threads that |
1225 |
+ |
* terminate due to unrecoverable errors encountered while executing |
1226 |
+ |
* tasks. For default value, use <code>null</code>. |
1227 |
+ |
* @param asyncMode if true, |
1228 |
+ |
* establishes local first-in-first-out scheduling mode for forked |
1229 |
+ |
* tasks that are never joined. This mode may be more appropriate |
1230 |
+ |
* than default locally stack-based mode in applications in which |
1231 |
+ |
* worker threads only process event-style asynchronous tasks. |
1232 |
+ |
* For default value, use <code>false</code>. |
1233 |
+ |
* @throws IllegalArgumentException if parallelism less than or |
1234 |
+ |
* equal to zero, or greater than implementation limit |
1235 |
+ |
* @throws NullPointerException if the factory is null |
1236 |
+ |
* @throws SecurityException if a security manager exists and |
1237 |
+ |
* the caller is not permitted to modify threads |
1238 |
+ |
* because it does not hold {@link |
1239 |
+ |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
1240 |
+ |
*/ |
1241 |
+ |
public ForkJoinPool(int parallelism, |
1242 |
+ |
ForkJoinWorkerThreadFactory factory, |
1243 |
+ |
Thread.UncaughtExceptionHandler handler, |
1244 |
+ |
boolean asyncMode) { |
1245 |
+ |
checkPermission(); |
1246 |
+ |
if (factory == null) |
1247 |
+ |
throw new NullPointerException(); |
1248 |
+ |
if (parallelism <= 0 || parallelism > MAX_THREADS) |
1249 |
+ |
throw new IllegalArgumentException(); |
1250 |
+ |
this.parallelism = parallelism; |
1251 |
+ |
this.factory = factory; |
1252 |
+ |
this.ueh = handler; |
1253 |
+ |
this.locallyFifo = asyncMode; |
1254 |
+ |
int arraySize = initialArraySizeFor(parallelism); |
1255 |
+ |
this.workers = new ForkJoinWorkerThread[arraySize]; |
1256 |
+ |
this.submissionQueue = new LinkedTransferQueue<ForkJoinTask<?>>(); |
1257 |
+ |
this.workerLock = new ReentrantLock(); |
1258 |
+ |
this.termination = new Phaser(1); |
1259 |
+ |
this.poolNumber = poolNumberGenerator.incrementAndGet(); |
1260 |
+ |
} |
1261 |
+ |
|
1262 |
+ |
/** |
1263 |
+ |
* Returns initial power of two size for workers array. |
1264 |
+ |
* @param pc the initial parallelism level |
1265 |
+ |
*/ |
1266 |
+ |
private static int initialArraySizeFor(int pc) { |
1267 |
+ |
// See Hackers Delight, sec 3.2. We know MAX_THREADS < (1 >>> 16) |
1268 |
+ |
int size = pc < MAX_THREADS ? pc + 1 : MAX_THREADS; |
1269 |
+ |
size |= size >>> 1; |
1270 |
+ |
size |= size >>> 2; |
1271 |
+ |
size |= size >>> 4; |
1272 |
+ |
size |= size >>> 8; |
1273 |
+ |
return size + 1; |
1274 |
+ |
} |
1275 |
+ |
|
1276 |
|
// Execution methods |
1277 |
|
|
1278 |
|
/** |
1281 |
|
private <T> void doSubmit(ForkJoinTask<T> task) { |
1282 |
|
if (task == null) |
1283 |
|
throw new NullPointerException(); |
1284 |
< |
if (isShutdown()) |
1284 |
> |
if (runState >= SHUTDOWN) |
1285 |
|
throw new RejectedExecutionException(); |
555 |
– |
if (workers == null) |
556 |
– |
ensureWorkerInitialization(); |
1286 |
|
submissionQueue.offer(task); |
1287 |
< |
signalIdleWorkers(); |
1287 |
> |
signalEvent(); |
1288 |
> |
ensureEnoughTotalWorkers(); |
1289 |
|
} |
1290 |
|
|
1291 |
|
/** |
1292 |
|
* Performs the given task, returning its result upon completion. |
1293 |
+ |
* If the caller is already engaged in a fork/join computation in |
1294 |
+ |
* the current pool, this method is equivalent in effect to |
1295 |
+ |
* {@link ForkJoinTask#invoke}. |
1296 |
|
* |
1297 |
|
* @param task the task |
1298 |
|
* @return the task's result |
1299 |
< |
* @throws NullPointerException if task is null |
1300 |
< |
* @throws RejectedExecutionException if pool is shut down |
1299 |
> |
* @throws NullPointerException if the task is null |
1300 |
> |
* @throws RejectedExecutionException if the task cannot be |
1301 |
> |
* scheduled for execution |
1302 |
|
*/ |
1303 |
|
public <T> T invoke(ForkJoinTask<T> task) { |
1304 |
|
doSubmit(task); |
1307 |
|
|
1308 |
|
/** |
1309 |
|
* Arranges for (asynchronous) execution of the given task. |
1310 |
+ |
* If the caller is already engaged in a fork/join computation in |
1311 |
+ |
* the current pool, this method is equivalent in effect to |
1312 |
+ |
* {@link ForkJoinTask#fork}. |
1313 |
|
* |
1314 |
|
* @param task the task |
1315 |
< |
* @throws NullPointerException if task is null |
1316 |
< |
* @throws RejectedExecutionException if pool is shut down |
1315 |
> |
* @throws NullPointerException if the task is null |
1316 |
> |
* @throws RejectedExecutionException if the task cannot be |
1317 |
> |
* scheduled for execution |
1318 |
|
*/ |
1319 |
< |
public <T> void execute(ForkJoinTask<T> task) { |
1319 |
> |
public void execute(ForkJoinTask<?> task) { |
1320 |
|
doSubmit(task); |
1321 |
|
} |
1322 |
|
|
1323 |
|
// AbstractExecutorService methods |
1324 |
|
|
1325 |
+ |
/** |
1326 |
+ |
* @throws NullPointerException if the task is null |
1327 |
+ |
* @throws RejectedExecutionException if the task cannot be |
1328 |
+ |
* scheduled for execution |
1329 |
+ |
*/ |
1330 |
|
public void execute(Runnable task) { |
1331 |
|
ForkJoinTask<?> job; |
1332 |
< |
if (task instanceof AdaptedCallable) // avoid re-wrap |
1333 |
< |
job = (AdaptedCallable<?>)task; |
591 |
< |
else if (task instanceof AdaptedRunnable) |
592 |
< |
job = (AdaptedRunnable<?>)task; |
593 |
< |
else |
594 |
< |
job = new AdaptedRunnable<Void>(task, null); |
595 |
< |
doSubmit(job); |
596 |
< |
} |
597 |
< |
|
598 |
< |
public <T> ForkJoinTask<T> submit(Callable<T> task) { |
599 |
< |
ForkJoinTask<T> job = new AdaptedCallable<T>(task); |
600 |
< |
doSubmit(job); |
601 |
< |
return job; |
602 |
< |
} |
603 |
< |
|
604 |
< |
public <T> ForkJoinTask<T> submit(Runnable task, T result) { |
605 |
< |
ForkJoinTask<T> job = new AdaptedRunnable<T>(task, result); |
606 |
< |
doSubmit(job); |
607 |
< |
return job; |
608 |
< |
} |
609 |
< |
|
610 |
< |
public ForkJoinTask<?> submit(Runnable task) { |
611 |
< |
ForkJoinTask<?> job; |
612 |
< |
if (task instanceof AdaptedCallable) // avoid re-wrap |
613 |
< |
job = (AdaptedCallable<?>)task; |
614 |
< |
else if (task instanceof AdaptedRunnable) |
615 |
< |
job = (AdaptedRunnable<?>)task; |
1332 |
> |
if (task instanceof ForkJoinTask<?>) // avoid re-wrap |
1333 |
> |
job = (ForkJoinTask<?>) task; |
1334 |
|
else |
1335 |
< |
job = new AdaptedRunnable<Void>(task, null); |
1335 |
> |
job = ForkJoinTask.adapt(task, null); |
1336 |
|
doSubmit(job); |
619 |
– |
return job; |
1337 |
|
} |
1338 |
|
|
1339 |
|
/** |
1340 |
|
* Submits a ForkJoinTask for execution. |
1341 |
+ |
* If the caller is already engaged in a fork/join computation in |
1342 |
+ |
* the current pool, this method is equivalent in effect to |
1343 |
+ |
* {@link ForkJoinTask#fork}. |
1344 |
|
* |
1345 |
|
* @param task the task to submit |
1346 |
|
* @return the task |
1347 |
+ |
* @throws NullPointerException if the task is null |
1348 |
|
* @throws RejectedExecutionException if the task cannot be |
1349 |
|
* scheduled for execution |
629 |
– |
* @throws NullPointerException if the task is null |
1350 |
|
*/ |
1351 |
|
public <T> ForkJoinTask<T> submit(ForkJoinTask<T> task) { |
1352 |
|
doSubmit(task); |
1354 |
|
} |
1355 |
|
|
1356 |
|
/** |
1357 |
< |
* Adaptor for Runnables. This implements RunnableFuture |
1358 |
< |
* to be compliant with AbstractExecutorService constraints. |
1357 |
> |
* @throws NullPointerException if the task is null |
1358 |
> |
* @throws RejectedExecutionException if the task cannot be |
1359 |
> |
* scheduled for execution |
1360 |
|
*/ |
1361 |
< |
static final class AdaptedRunnable<T> extends ForkJoinTask<T> |
1362 |
< |
implements RunnableFuture<T> { |
1363 |
< |
final Runnable runnable; |
1364 |
< |
final T resultOnCompletion; |
644 |
< |
T result; |
645 |
< |
AdaptedRunnable(Runnable runnable, T result) { |
646 |
< |
if (runnable == null) throw new NullPointerException(); |
647 |
< |
this.runnable = runnable; |
648 |
< |
this.resultOnCompletion = result; |
649 |
< |
} |
650 |
< |
public T getRawResult() { return result; } |
651 |
< |
public void setRawResult(T v) { result = v; } |
652 |
< |
public boolean exec() { |
653 |
< |
runnable.run(); |
654 |
< |
result = resultOnCompletion; |
655 |
< |
return true; |
656 |
< |
} |
657 |
< |
public void run() { invoke(); } |
658 |
< |
private static final long serialVersionUID = 5232453952276885070L; |
1361 |
> |
public <T> ForkJoinTask<T> submit(Callable<T> task) { |
1362 |
> |
ForkJoinTask<T> job = ForkJoinTask.adapt(task); |
1363 |
> |
doSubmit(job); |
1364 |
> |
return job; |
1365 |
|
} |
1366 |
|
|
1367 |
|
/** |
1368 |
< |
* Adaptor for Callables |
1369 |
< |
*/ |
1370 |
< |
static final class AdaptedCallable<T> extends ForkJoinTask<T> |
1371 |
< |
implements RunnableFuture<T> { |
1372 |
< |
final Callable<T> callable; |
1373 |
< |
T result; |
1374 |
< |
AdaptedCallable(Callable<T> callable) { |
1375 |
< |
if (callable == null) throw new NullPointerException(); |
1376 |
< |
this.callable = callable; |
1377 |
< |
} |
1378 |
< |
public T getRawResult() { return result; } |
1379 |
< |
public void setRawResult(T v) { result = v; } |
1380 |
< |
public boolean exec() { |
1381 |
< |
try { |
1382 |
< |
result = callable.call(); |
1383 |
< |
return true; |
1384 |
< |
} catch (Error err) { |
1385 |
< |
throw err; |
1386 |
< |
} catch (RuntimeException rex) { |
1387 |
< |
throw rex; |
1388 |
< |
} catch (Exception ex) { |
1389 |
< |
throw new RuntimeException(ex); |
1390 |
< |
} |
685 |
< |
} |
686 |
< |
public void run() { invoke(); } |
687 |
< |
private static final long serialVersionUID = 2838392045355241008L; |
1368 |
> |
* @throws NullPointerException if the task is null |
1369 |
> |
* @throws RejectedExecutionException if the task cannot be |
1370 |
> |
* scheduled for execution |
1371 |
> |
*/ |
1372 |
> |
public <T> ForkJoinTask<T> submit(Runnable task, T result) { |
1373 |
> |
ForkJoinTask<T> job = ForkJoinTask.adapt(task, result); |
1374 |
> |
doSubmit(job); |
1375 |
> |
return job; |
1376 |
> |
} |
1377 |
> |
|
1378 |
> |
/** |
1379 |
> |
* @throws NullPointerException if the task is null |
1380 |
> |
* @throws RejectedExecutionException if the task cannot be |
1381 |
> |
* scheduled for execution |
1382 |
> |
*/ |
1383 |
> |
public ForkJoinTask<?> submit(Runnable task) { |
1384 |
> |
ForkJoinTask<?> job; |
1385 |
> |
if (task instanceof ForkJoinTask<?>) // avoid re-wrap |
1386 |
> |
job = (ForkJoinTask<?>) task; |
1387 |
> |
else |
1388 |
> |
job = ForkJoinTask.adapt(task, null); |
1389 |
> |
doSubmit(job); |
1390 |
> |
return job; |
1391 |
|
} |
1392 |
|
|
1393 |
+ |
/** |
1394 |
+ |
* @throws NullPointerException {@inheritDoc} |
1395 |
+ |
* @throws RejectedExecutionException {@inheritDoc} |
1396 |
+ |
*/ |
1397 |
|
public <T> List<Future<T>> invokeAll(Collection<? extends Callable<T>> tasks) { |
1398 |
|
ArrayList<ForkJoinTask<T>> forkJoinTasks = |
1399 |
|
new ArrayList<ForkJoinTask<T>>(tasks.size()); |
1400 |
|
for (Callable<T> task : tasks) |
1401 |
< |
forkJoinTasks.add(new AdaptedCallable<T>(task)); |
1401 |
> |
forkJoinTasks.add(ForkJoinTask.adapt(task)); |
1402 |
|
invoke(new InvokeAll<T>(forkJoinTasks)); |
1403 |
|
|
1404 |
|
@SuppressWarnings({"unchecked", "rawtypes"}) |
1405 |
< |
List<Future<T>> futures = (List<Future<T>>) (List) forkJoinTasks; |
1405 |
> |
List<Future<T>> futures = (List<Future<T>>) (List) forkJoinTasks; |
1406 |
|
return futures; |
1407 |
|
} |
1408 |
|
|
1416 |
|
private static final long serialVersionUID = -7914297376763021607L; |
1417 |
|
} |
1418 |
|
|
712 |
– |
// Configuration and status settings and queries |
713 |
– |
|
1419 |
|
/** |
1420 |
|
* Returns the factory used for constructing new workers. |
1421 |
|
* |
1429 |
|
* Returns the handler for internal worker threads that terminate |
1430 |
|
* due to unrecoverable errors encountered while executing tasks. |
1431 |
|
* |
1432 |
< |
* @return the handler, or null if none |
1432 |
> |
* @return the handler, or {@code null} if none |
1433 |
|
*/ |
1434 |
|
public Thread.UncaughtExceptionHandler getUncaughtExceptionHandler() { |
1435 |
< |
Thread.UncaughtExceptionHandler h; |
731 |
< |
final ReentrantLock lock = this.workerLock; |
732 |
< |
lock.lock(); |
733 |
< |
try { |
734 |
< |
h = ueh; |
735 |
< |
} finally { |
736 |
< |
lock.unlock(); |
737 |
< |
} |
738 |
< |
return h; |
739 |
< |
} |
740 |
< |
|
741 |
< |
/** |
742 |
< |
* Sets the handler for internal worker threads that terminate due |
743 |
< |
* to unrecoverable errors encountered while executing tasks. |
744 |
< |
* Unless set, the current default or ThreadGroup handler is used |
745 |
< |
* as handler. |
746 |
< |
* |
747 |
< |
* @param h the new handler |
748 |
< |
* @return the old handler, or null if none |
749 |
< |
* @throws SecurityException if a security manager exists and |
750 |
< |
* the caller is not permitted to modify threads |
751 |
< |
* because it does not hold {@link |
752 |
< |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
753 |
< |
*/ |
754 |
< |
public Thread.UncaughtExceptionHandler |
755 |
< |
setUncaughtExceptionHandler(Thread.UncaughtExceptionHandler h) { |
756 |
< |
checkPermission(); |
757 |
< |
Thread.UncaughtExceptionHandler old = null; |
758 |
< |
final ReentrantLock lock = this.workerLock; |
759 |
< |
lock.lock(); |
760 |
< |
try { |
761 |
< |
old = ueh; |
762 |
< |
ueh = h; |
763 |
< |
ForkJoinWorkerThread[] ws = workers; |
764 |
< |
if (ws != null) { |
765 |
< |
for (int i = 0; i < ws.length; ++i) { |
766 |
< |
ForkJoinWorkerThread w = ws[i]; |
767 |
< |
if (w != null) |
768 |
< |
w.setUncaughtExceptionHandler(h); |
769 |
< |
} |
770 |
< |
} |
771 |
< |
} finally { |
772 |
< |
lock.unlock(); |
773 |
< |
} |
774 |
< |
return old; |
775 |
< |
} |
776 |
< |
|
777 |
< |
|
778 |
< |
/** |
779 |
< |
* Sets the target parallelism level of this pool. |
780 |
< |
* |
781 |
< |
* @param parallelism the target parallelism |
782 |
< |
* @throws IllegalArgumentException if parallelism less than or |
783 |
< |
* equal to zero or greater than maximum size bounds |
784 |
< |
* @throws SecurityException if a security manager exists and |
785 |
< |
* the caller is not permitted to modify threads |
786 |
< |
* because it does not hold {@link |
787 |
< |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
788 |
< |
*/ |
789 |
< |
public void setParallelism(int parallelism) { |
790 |
< |
checkPermission(); |
791 |
< |
if (parallelism <= 0 || parallelism > maxPoolSize) |
792 |
< |
throw new IllegalArgumentException(); |
793 |
< |
final ReentrantLock lock = this.workerLock; |
794 |
< |
lock.lock(); |
795 |
< |
try { |
796 |
< |
if (!isTerminating()) { |
797 |
< |
int p = this.parallelism; |
798 |
< |
this.parallelism = parallelism; |
799 |
< |
if (parallelism > p) |
800 |
< |
createAndStartAddedWorkers(); |
801 |
< |
else |
802 |
< |
trimSpares(); |
803 |
< |
} |
804 |
< |
} finally { |
805 |
< |
lock.unlock(); |
806 |
< |
} |
807 |
< |
signalIdleWorkers(); |
1435 |
> |
return ueh; |
1436 |
|
} |
1437 |
|
|
1438 |
|
/** |
1439 |
< |
* Returns the targeted number of worker threads in this pool. |
1439 |
> |
* Returns the targeted parallelism level of this pool. |
1440 |
|
* |
1441 |
< |
* @return the targeted number of worker threads in this pool |
1441 |
> |
* @return the targeted parallelism level of this pool |
1442 |
|
*/ |
1443 |
|
public int getParallelism() { |
1444 |
|
return parallelism; |
1447 |
|
/** |
1448 |
|
* Returns the number of worker threads that have started but not |
1449 |
|
* yet terminated. This result returned by this method may differ |
1450 |
< |
* from {@code getParallelism} when threads are created to |
1450 |
> |
* from {@link #getParallelism} when threads are created to |
1451 |
|
* maintain parallelism when others are cooperatively blocked. |
1452 |
|
* |
1453 |
|
* @return the number of worker threads |
1454 |
|
*/ |
1455 |
|
public int getPoolSize() { |
1456 |
< |
return totalCountOf(workerCounts); |
829 |
< |
} |
830 |
< |
|
831 |
< |
/** |
832 |
< |
* Returns the maximum number of threads allowed to exist in the |
833 |
< |
* pool, even if there are insufficient unblocked running threads. |
834 |
< |
* |
835 |
< |
* @return the maximum |
836 |
< |
*/ |
837 |
< |
public int getMaximumPoolSize() { |
838 |
< |
return maxPoolSize; |
839 |
< |
} |
840 |
< |
|
841 |
< |
/** |
842 |
< |
* Sets the maximum number of threads allowed to exist in the |
843 |
< |
* pool, even if there are insufficient unblocked running threads. |
844 |
< |
* Setting this value has no effect on current pool size. It |
845 |
< |
* controls construction of new threads. |
846 |
< |
* |
847 |
< |
* @throws IllegalArgumentException if negative or greater then |
848 |
< |
* internal implementation limit |
849 |
< |
*/ |
850 |
< |
public void setMaximumPoolSize(int newMax) { |
851 |
< |
if (newMax < 0 || newMax > MAX_THREADS) |
852 |
< |
throw new IllegalArgumentException(); |
853 |
< |
maxPoolSize = newMax; |
854 |
< |
} |
855 |
< |
|
856 |
< |
|
857 |
< |
/** |
858 |
< |
* Returns true if this pool dynamically maintains its target |
859 |
< |
* parallelism level. If false, new threads are added only to |
860 |
< |
* avoid possible starvation. |
861 |
< |
* This setting is by default true. |
862 |
< |
* |
863 |
< |
* @return true if maintains parallelism |
864 |
< |
*/ |
865 |
< |
public boolean getMaintainsParallelism() { |
866 |
< |
return maintainsParallelism; |
1456 |
> |
return workerCounts >>> TOTAL_COUNT_SHIFT; |
1457 |
|
} |
1458 |
|
|
1459 |
|
/** |
1460 |
< |
* Sets whether this pool dynamically maintains its target |
871 |
< |
* parallelism level. If false, new threads are added only to |
872 |
< |
* avoid possible starvation. |
873 |
< |
* |
874 |
< |
* @param enable true to maintains parallelism |
875 |
< |
*/ |
876 |
< |
public void setMaintainsParallelism(boolean enable) { |
877 |
< |
maintainsParallelism = enable; |
878 |
< |
} |
879 |
< |
|
880 |
< |
/** |
881 |
< |
* Establishes local first-in-first-out scheduling mode for forked |
882 |
< |
* tasks that are never joined. This mode may be more appropriate |
883 |
< |
* than default locally stack-based mode in applications in which |
884 |
< |
* worker threads only process asynchronous tasks. This method is |
885 |
< |
* designed to be invoked only when pool is quiescent, and |
886 |
< |
* typically only before any tasks are submitted. The effects of |
887 |
< |
* invocations at other times may be unpredictable. |
888 |
< |
* |
889 |
< |
* @param async if true, use locally FIFO scheduling |
890 |
< |
* @return the previous mode |
891 |
< |
*/ |
892 |
< |
public boolean setAsyncMode(boolean async) { |
893 |
< |
boolean oldMode = locallyFifo; |
894 |
< |
locallyFifo = async; |
895 |
< |
ForkJoinWorkerThread[] ws = workers; |
896 |
< |
if (ws != null) { |
897 |
< |
for (int i = 0; i < ws.length; ++i) { |
898 |
< |
ForkJoinWorkerThread t = ws[i]; |
899 |
< |
if (t != null) |
900 |
< |
t.setAsyncMode(async); |
901 |
< |
} |
902 |
< |
} |
903 |
< |
return oldMode; |
904 |
< |
} |
905 |
< |
|
906 |
< |
/** |
907 |
< |
* Returns true if this pool uses local first-in-first-out |
1460 |
> |
* Returns {@code true} if this pool uses local first-in-first-out |
1461 |
|
* scheduling mode for forked tasks that are never joined. |
1462 |
|
* |
1463 |
< |
* @return true if this pool uses async mode |
1463 |
> |
* @return {@code true} if this pool uses async mode |
1464 |
|
*/ |
1465 |
|
public boolean getAsyncMode() { |
1466 |
|
return locallyFifo; |
1469 |
|
/** |
1470 |
|
* Returns an estimate of the number of worker threads that are |
1471 |
|
* not blocked waiting to join tasks or for other managed |
1472 |
< |
* synchronization. |
1472 |
> |
* synchronization. This method may overestimate the |
1473 |
> |
* number of running threads. |
1474 |
|
* |
1475 |
|
* @return the number of worker threads |
1476 |
|
*/ |
1477 |
|
public int getRunningThreadCount() { |
1478 |
< |
return runningCountOf(workerCounts); |
1478 |
> |
return workerCounts & RUNNING_COUNT_MASK; |
1479 |
|
} |
1480 |
|
|
1481 |
|
/** |
1486 |
|
* @return the number of active threads |
1487 |
|
*/ |
1488 |
|
public int getActiveThreadCount() { |
1489 |
< |
return activeCountOf(runControl); |
1489 |
> |
return runState & ACTIVE_COUNT_MASK; |
1490 |
|
} |
1491 |
|
|
1492 |
|
/** |
1493 |
< |
* Returns an estimate of the number of threads that are currently |
1494 |
< |
* idle waiting for tasks. This method may underestimate the |
1495 |
< |
* number of idle threads. |
1493 |
> |
* Returns {@code true} if all worker threads are currently idle. |
1494 |
> |
* An idle worker is one that cannot obtain a task to execute |
1495 |
> |
* because none are available to steal from other threads, and |
1496 |
> |
* there are no pending submissions to the pool. This method is |
1497 |
> |
* conservative; it might not return {@code true} immediately upon |
1498 |
> |
* idleness of all threads, but will eventually become true if |
1499 |
> |
* threads remain inactive. |
1500 |
|
* |
1501 |
< |
* @return the number of idle threads |
944 |
< |
*/ |
945 |
< |
final int getIdleThreadCount() { |
946 |
< |
int c = runningCountOf(workerCounts) - activeCountOf(runControl); |
947 |
< |
return (c <= 0) ? 0 : c; |
948 |
< |
} |
949 |
< |
|
950 |
< |
/** |
951 |
< |
* Returns true if all worker threads are currently idle. An idle |
952 |
< |
* worker is one that cannot obtain a task to execute because none |
953 |
< |
* are available to steal from other threads, and there are no |
954 |
< |
* pending submissions to the pool. This method is conservative; |
955 |
< |
* it might not return true immediately upon idleness of all |
956 |
< |
* threads, but will eventually become true if threads remain |
957 |
< |
* inactive. |
958 |
< |
* |
959 |
< |
* @return true if all threads are currently idle |
1501 |
> |
* @return {@code true} if all threads are currently idle |
1502 |
|
*/ |
1503 |
|
public boolean isQuiescent() { |
1504 |
< |
return activeCountOf(runControl) == 0; |
1504 |
> |
return (runState & ACTIVE_COUNT_MASK) == 0; |
1505 |
|
} |
1506 |
|
|
1507 |
|
/** |
1516 |
|
* @return the number of steals |
1517 |
|
*/ |
1518 |
|
public long getStealCount() { |
1519 |
< |
return stealCount.get(); |
978 |
< |
} |
979 |
< |
|
980 |
< |
/** |
981 |
< |
* Accumulates steal count from a worker. |
982 |
< |
* Call only when worker known to be idle. |
983 |
< |
*/ |
984 |
< |
private void updateStealCount(ForkJoinWorkerThread w) { |
985 |
< |
int sc = w.getAndClearStealCount(); |
986 |
< |
if (sc != 0) |
987 |
< |
stealCount.addAndGet(sc); |
1519 |
> |
return stealCount; |
1520 |
|
} |
1521 |
|
|
1522 |
|
/** |
1532 |
|
public long getQueuedTaskCount() { |
1533 |
|
long count = 0; |
1534 |
|
ForkJoinWorkerThread[] ws = workers; |
1535 |
< |
if (ws != null) { |
1536 |
< |
for (int i = 0; i < ws.length; ++i) { |
1537 |
< |
ForkJoinWorkerThread t = ws[i]; |
1538 |
< |
if (t != null) |
1539 |
< |
count += t.getQueueSize(); |
1008 |
< |
} |
1535 |
> |
int nws = ws.length; |
1536 |
> |
for (int i = 0; i < nws; ++i) { |
1537 |
> |
ForkJoinWorkerThread w = ws[i]; |
1538 |
> |
if (w != null) |
1539 |
> |
count += w.getQueueSize(); |
1540 |
|
} |
1541 |
|
return count; |
1542 |
|
} |
1543 |
|
|
1544 |
|
/** |
1545 |
< |
* Returns an estimate of the number tasks submitted to this pool |
1546 |
< |
* that have not yet begun executing. This method takes time |
1545 |
> |
* Returns an estimate of the number of tasks submitted to this |
1546 |
> |
* pool that have not yet begun executing. This method takes time |
1547 |
|
* proportional to the number of submissions. |
1548 |
|
* |
1549 |
|
* @return the number of queued submissions |
1553 |
|
} |
1554 |
|
|
1555 |
|
/** |
1556 |
< |
* Returns true if there are any tasks submitted to this pool |
1557 |
< |
* that have not yet begun executing. |
1556 |
> |
* Returns {@code true} if there are any tasks submitted to this |
1557 |
> |
* pool that have not yet begun executing. |
1558 |
|
* |
1559 |
|
* @return {@code true} if there are any queued submissions |
1560 |
|
*/ |
1567 |
|
* available. This method may be useful in extensions to this |
1568 |
|
* class that re-assign work in systems with multiple pools. |
1569 |
|
* |
1570 |
< |
* @return the next submission, or null if none |
1570 |
> |
* @return the next submission, or {@code null} if none |
1571 |
|
*/ |
1572 |
|
protected ForkJoinTask<?> pollSubmission() { |
1573 |
|
return submissionQueue.poll(); |
1577 |
|
* Removes all available unexecuted submitted and forked tasks |
1578 |
|
* from scheduling queues and adds them to the given collection, |
1579 |
|
* without altering their execution status. These may include |
1580 |
< |
* artificially generated or wrapped tasks. This method is designed |
1581 |
< |
* to be invoked only when the pool is known to be |
1580 |
> |
* artificially generated or wrapped tasks. This method is |
1581 |
> |
* designed to be invoked only when the pool is known to be |
1582 |
|
* quiescent. Invocations at other times may not remove all |
1583 |
|
* tasks. A failure encountered while attempting to add elements |
1584 |
|
* to collection {@code c} may result in elements being in |
1590 |
|
* @param c the collection to transfer elements into |
1591 |
|
* @return the number of elements transferred |
1592 |
|
*/ |
1593 |
< |
protected int drainTasksTo(Collection<ForkJoinTask<?>> c) { |
1593 |
> |
protected int drainTasksTo(Collection<? super ForkJoinTask<?>> c) { |
1594 |
|
int n = submissionQueue.drainTo(c); |
1595 |
|
ForkJoinWorkerThread[] ws = workers; |
1596 |
< |
if (ws != null) { |
1597 |
< |
for (int i = 0; i < ws.length; ++i) { |
1598 |
< |
ForkJoinWorkerThread w = ws[i]; |
1599 |
< |
if (w != null) |
1600 |
< |
n += w.drainTasksTo(c); |
1070 |
< |
} |
1596 |
> |
int nws = ws.length; |
1597 |
> |
for (int i = 0; i < nws; ++i) { |
1598 |
> |
ForkJoinWorkerThread w = ws[i]; |
1599 |
> |
if (w != null) |
1600 |
> |
n += w.drainTasksTo(c); |
1601 |
|
} |
1602 |
|
return n; |
1603 |
|
} |
1604 |
|
|
1605 |
|
/** |
1606 |
+ |
* Returns count of total parks by existing workers. |
1607 |
+ |
* Used during development only since not meaningful to users. |
1608 |
+ |
*/ |
1609 |
+ |
private int collectParkCount() { |
1610 |
+ |
int count = 0; |
1611 |
+ |
ForkJoinWorkerThread[] ws = workers; |
1612 |
+ |
int nws = ws.length; |
1613 |
+ |
for (int i = 0; i < nws; ++i) { |
1614 |
+ |
ForkJoinWorkerThread w = ws[i]; |
1615 |
+ |
if (w != null) |
1616 |
+ |
count += w.parkCount; |
1617 |
+ |
} |
1618 |
+ |
return count; |
1619 |
+ |
} |
1620 |
+ |
|
1621 |
+ |
/** |
1622 |
|
* Returns a string identifying this pool, as well as its state, |
1623 |
|
* including indications of run state, parallelism level, and |
1624 |
|
* worker and task counts. |
1626 |
|
* @return a string identifying this pool, as well as its state |
1627 |
|
*/ |
1628 |
|
public String toString() { |
1083 |
– |
int ps = parallelism; |
1084 |
– |
int wc = workerCounts; |
1085 |
– |
int rc = runControl; |
1629 |
|
long st = getStealCount(); |
1630 |
|
long qt = getQueuedTaskCount(); |
1631 |
|
long qs = getQueuedSubmissionCount(); |
1632 |
+ |
int wc = workerCounts; |
1633 |
+ |
int tc = wc >>> TOTAL_COUNT_SHIFT; |
1634 |
+ |
int rc = wc & RUNNING_COUNT_MASK; |
1635 |
+ |
int pc = parallelism; |
1636 |
+ |
int rs = runState; |
1637 |
+ |
int ac = rs & ACTIVE_COUNT_MASK; |
1638 |
+ |
// int pk = collectParkCount(); |
1639 |
|
return super.toString() + |
1640 |
< |
"[" + runStateToString(runStateOf(rc)) + |
1641 |
< |
", parallelism = " + ps + |
1642 |
< |
", size = " + totalCountOf(wc) + |
1643 |
< |
", active = " + activeCountOf(rc) + |
1644 |
< |
", running = " + runningCountOf(wc) + |
1640 |
> |
"[" + runLevelToString(rs) + |
1641 |
> |
", parallelism = " + pc + |
1642 |
> |
", size = " + tc + |
1643 |
> |
", active = " + ac + |
1644 |
> |
", running = " + rc + |
1645 |
|
", steals = " + st + |
1646 |
|
", tasks = " + qt + |
1647 |
|
", submissions = " + qs + |
1648 |
+ |
// ", parks = " + pk + |
1649 |
|
"]"; |
1650 |
|
} |
1651 |
|
|
1652 |
< |
private static String runStateToString(int rs) { |
1653 |
< |
switch(rs) { |
1654 |
< |
case RUNNING: return "Running"; |
1655 |
< |
case SHUTDOWN: return "Shutting down"; |
1656 |
< |
case TERMINATING: return "Terminating"; |
1106 |
< |
case TERMINATED: return "Terminated"; |
1107 |
< |
default: throw new Error("Unknown run state"); |
1108 |
< |
} |
1652 |
> |
private static String runLevelToString(int s) { |
1653 |
> |
return ((s & TERMINATED) != 0 ? "Terminated" : |
1654 |
> |
((s & TERMINATING) != 0 ? "Terminating" : |
1655 |
> |
((s & SHUTDOWN) != 0 ? "Shutting down" : |
1656 |
> |
"Running"))); |
1657 |
|
} |
1658 |
|
|
1111 |
– |
// lifecycle control |
1112 |
– |
|
1659 |
|
/** |
1660 |
|
* Initiates an orderly shutdown in which previously submitted |
1661 |
|
* tasks are executed, but no new tasks will be accepted. |
1670 |
|
*/ |
1671 |
|
public void shutdown() { |
1672 |
|
checkPermission(); |
1673 |
< |
transitionRunStateTo(SHUTDOWN); |
1674 |
< |
if (canTerminateOnShutdown(runControl)) |
1129 |
< |
terminateOnShutdown(); |
1673 |
> |
advanceRunLevel(SHUTDOWN); |
1674 |
> |
tryTerminate(false); |
1675 |
|
} |
1676 |
|
|
1677 |
|
/** |
1678 |
< |
* Attempts to stop all actively executing tasks, and cancels all |
1679 |
< |
* waiting tasks. Tasks that are in the process of being |
1680 |
< |
* submitted or executed concurrently during the course of this |
1681 |
< |
* method may or may not be rejected. Unlike some other executors, |
1682 |
< |
* this method cancels rather than collects non-executed tasks |
1683 |
< |
* upon termination, so always returns an empty list. However, you |
1684 |
< |
* can use method {@code drainTasksTo} before invoking this |
1685 |
< |
* method to transfer unexecuted tasks to another collection. |
1678 |
> |
* Attempts to cancel and/or stop all tasks, and reject all |
1679 |
> |
* subsequently submitted tasks. Tasks that are in the process of |
1680 |
> |
* being submitted or executed concurrently during the course of |
1681 |
> |
* this method may or may not be rejected. This method cancels |
1682 |
> |
* both existing and unexecuted tasks, in order to permit |
1683 |
> |
* termination in the presence of task dependencies. So the method |
1684 |
> |
* always returns an empty list (unlike the case for some other |
1685 |
> |
* Executors). |
1686 |
|
* |
1687 |
|
* @return an empty list |
1688 |
|
* @throws SecurityException if a security manager exists and |
1692 |
|
*/ |
1693 |
|
public List<Runnable> shutdownNow() { |
1694 |
|
checkPermission(); |
1695 |
< |
terminate(); |
1695 |
> |
tryTerminate(true); |
1696 |
|
return Collections.emptyList(); |
1697 |
|
} |
1698 |
|
|
1702 |
|
* @return {@code true} if all tasks have completed following shut down |
1703 |
|
*/ |
1704 |
|
public boolean isTerminated() { |
1705 |
< |
return runStateOf(runControl) == TERMINATED; |
1705 |
> |
return runState >= TERMINATED; |
1706 |
|
} |
1707 |
|
|
1708 |
|
/** |
1709 |
|
* Returns {@code true} if the process of termination has |
1710 |
< |
* commenced but possibly not yet completed. |
1710 |
> |
* commenced but not yet completed. This method may be useful for |
1711 |
> |
* debugging. A return of {@code true} reported a sufficient |
1712 |
> |
* period after shutdown may indicate that submitted tasks have |
1713 |
> |
* ignored or suppressed interruption, causing this executor not |
1714 |
> |
* to properly terminate. |
1715 |
|
* |
1716 |
< |
* @return {@code true} if terminating |
1716 |
> |
* @return {@code true} if terminating but not yet terminated |
1717 |
|
*/ |
1718 |
|
public boolean isTerminating() { |
1719 |
< |
return runStateOf(runControl) >= TERMINATING; |
1719 |
> |
return (runState & (TERMINATING|TERMINATED)) == TERMINATING; |
1720 |
|
} |
1721 |
|
|
1722 |
|
/** |
1725 |
|
* @return {@code true} if this pool has been shut down |
1726 |
|
*/ |
1727 |
|
public boolean isShutdown() { |
1728 |
< |
return runStateOf(runControl) >= SHUTDOWN; |
1728 |
> |
return runState >= SHUTDOWN; |
1729 |
|
} |
1730 |
|
|
1731 |
|
/** |
1741 |
|
*/ |
1742 |
|
public boolean awaitTermination(long timeout, TimeUnit unit) |
1743 |
|
throws InterruptedException { |
1195 |
– |
long nanos = unit.toNanos(timeout); |
1196 |
– |
final ReentrantLock lock = this.workerLock; |
1197 |
– |
lock.lock(); |
1198 |
– |
try { |
1199 |
– |
for (;;) { |
1200 |
– |
if (isTerminated()) |
1201 |
– |
return true; |
1202 |
– |
if (nanos <= 0) |
1203 |
– |
return false; |
1204 |
– |
nanos = termination.awaitNanos(nanos); |
1205 |
– |
} |
1206 |
– |
} finally { |
1207 |
– |
lock.unlock(); |
1208 |
– |
} |
1209 |
– |
} |
1210 |
– |
|
1211 |
– |
// Shutdown and termination support |
1212 |
– |
|
1213 |
– |
/** |
1214 |
– |
* Callback from terminating worker. Nulls out the corresponding |
1215 |
– |
* workers slot, and if terminating, tries to terminate; else |
1216 |
– |
* tries to shrink workers array. |
1217 |
– |
* |
1218 |
– |
* @param w the worker |
1219 |
– |
*/ |
1220 |
– |
final void workerTerminated(ForkJoinWorkerThread w) { |
1221 |
– |
updateStealCount(w); |
1222 |
– |
updateWorkerCount(-1); |
1223 |
– |
final ReentrantLock lock = this.workerLock; |
1224 |
– |
lock.lock(); |
1225 |
– |
try { |
1226 |
– |
ForkJoinWorkerThread[] ws = workers; |
1227 |
– |
if (ws != null) { |
1228 |
– |
int idx = w.poolIndex; |
1229 |
– |
if (idx >= 0 && idx < ws.length && ws[idx] == w) |
1230 |
– |
ws[idx] = null; |
1231 |
– |
if (totalCountOf(workerCounts) == 0) { |
1232 |
– |
terminate(); // no-op if already terminating |
1233 |
– |
transitionRunStateTo(TERMINATED); |
1234 |
– |
termination.signalAll(); |
1235 |
– |
} |
1236 |
– |
else if (!isTerminating()) { |
1237 |
– |
tryShrinkWorkerArray(); |
1238 |
– |
tryResumeSpare(true); // allow replacement |
1239 |
– |
} |
1240 |
– |
} |
1241 |
– |
} finally { |
1242 |
– |
lock.unlock(); |
1243 |
– |
} |
1244 |
– |
signalIdleWorkers(); |
1245 |
– |
} |
1246 |
– |
|
1247 |
– |
/** |
1248 |
– |
* Initiates termination. |
1249 |
– |
*/ |
1250 |
– |
private void terminate() { |
1251 |
– |
if (transitionRunStateTo(TERMINATING)) { |
1252 |
– |
stopAllWorkers(); |
1253 |
– |
resumeAllSpares(); |
1254 |
– |
signalIdleWorkers(); |
1255 |
– |
cancelQueuedSubmissions(); |
1256 |
– |
cancelQueuedWorkerTasks(); |
1257 |
– |
interruptUnterminatedWorkers(); |
1258 |
– |
signalIdleWorkers(); // resignal after interrupt |
1259 |
– |
} |
1260 |
– |
} |
1261 |
– |
|
1262 |
– |
/** |
1263 |
– |
* Possibly terminates when on shutdown state. |
1264 |
– |
*/ |
1265 |
– |
private void terminateOnShutdown() { |
1266 |
– |
if (!hasQueuedSubmissions() && canTerminateOnShutdown(runControl)) |
1267 |
– |
terminate(); |
1268 |
– |
} |
1269 |
– |
|
1270 |
– |
/** |
1271 |
– |
* Clears out and cancels submissions. |
1272 |
– |
*/ |
1273 |
– |
private void cancelQueuedSubmissions() { |
1274 |
– |
ForkJoinTask<?> task; |
1275 |
– |
while ((task = pollSubmission()) != null) |
1276 |
– |
task.cancel(false); |
1277 |
– |
} |
1278 |
– |
|
1279 |
– |
/** |
1280 |
– |
* Cleans out worker queues. |
1281 |
– |
*/ |
1282 |
– |
private void cancelQueuedWorkerTasks() { |
1283 |
– |
final ReentrantLock lock = this.workerLock; |
1284 |
– |
lock.lock(); |
1285 |
– |
try { |
1286 |
– |
ForkJoinWorkerThread[] ws = workers; |
1287 |
– |
if (ws != null) { |
1288 |
– |
for (int i = 0; i < ws.length; ++i) { |
1289 |
– |
ForkJoinWorkerThread t = ws[i]; |
1290 |
– |
if (t != null) |
1291 |
– |
t.cancelTasks(); |
1292 |
– |
} |
1293 |
– |
} |
1294 |
– |
} finally { |
1295 |
– |
lock.unlock(); |
1296 |
– |
} |
1297 |
– |
} |
1298 |
– |
|
1299 |
– |
/** |
1300 |
– |
* Sets each worker's status to terminating. Requires lock to avoid |
1301 |
– |
* conflicts with add/remove. |
1302 |
– |
*/ |
1303 |
– |
private void stopAllWorkers() { |
1304 |
– |
final ReentrantLock lock = this.workerLock; |
1305 |
– |
lock.lock(); |
1306 |
– |
try { |
1307 |
– |
ForkJoinWorkerThread[] ws = workers; |
1308 |
– |
if (ws != null) { |
1309 |
– |
for (int i = 0; i < ws.length; ++i) { |
1310 |
– |
ForkJoinWorkerThread t = ws[i]; |
1311 |
– |
if (t != null) |
1312 |
– |
t.shutdownNow(); |
1313 |
– |
} |
1314 |
– |
} |
1315 |
– |
} finally { |
1316 |
– |
lock.unlock(); |
1317 |
– |
} |
1318 |
– |
} |
1319 |
– |
|
1320 |
– |
/** |
1321 |
– |
* Interrupts all unterminated workers. This is not required for |
1322 |
– |
* sake of internal control, but may help unstick user code during |
1323 |
– |
* shutdown. |
1324 |
– |
*/ |
1325 |
– |
private void interruptUnterminatedWorkers() { |
1326 |
– |
final ReentrantLock lock = this.workerLock; |
1327 |
– |
lock.lock(); |
1744 |
|
try { |
1745 |
< |
ForkJoinWorkerThread[] ws = workers; |
1746 |
< |
if (ws != null) { |
1331 |
< |
for (int i = 0; i < ws.length; ++i) { |
1332 |
< |
ForkJoinWorkerThread t = ws[i]; |
1333 |
< |
if (t != null && !t.isTerminated()) { |
1334 |
< |
try { |
1335 |
< |
t.interrupt(); |
1336 |
< |
} catch (SecurityException ignore) { |
1337 |
< |
} |
1338 |
< |
} |
1339 |
< |
} |
1340 |
< |
} |
1341 |
< |
} finally { |
1342 |
< |
lock.unlock(); |
1343 |
< |
} |
1344 |
< |
} |
1345 |
< |
|
1346 |
< |
|
1347 |
< |
/* |
1348 |
< |
* Nodes for event barrier to manage idle threads. Queue nodes |
1349 |
< |
* are basic Treiber stack nodes, also used for spare stack. |
1350 |
< |
* |
1351 |
< |
* The event barrier has an event count and a wait queue (actually |
1352 |
< |
* a Treiber stack). Workers are enabled to look for work when |
1353 |
< |
* the eventCount is incremented. If they fail to find work, they |
1354 |
< |
* may wait for next count. Upon release, threads help others wake |
1355 |
< |
* up. |
1356 |
< |
* |
1357 |
< |
* Synchronization events occur only in enough contexts to |
1358 |
< |
* maintain overall liveness: |
1359 |
< |
* |
1360 |
< |
* - Submission of a new task to the pool |
1361 |
< |
* - Resizes or other changes to the workers array |
1362 |
< |
* - pool termination |
1363 |
< |
* - A worker pushing a task on an empty queue |
1364 |
< |
* |
1365 |
< |
* The case of pushing a task occurs often enough, and is heavy |
1366 |
< |
* enough compared to simple stack pushes, to require special |
1367 |
< |
* handling: Method signalWork returns without advancing count if |
1368 |
< |
* the queue appears to be empty. This would ordinarily result in |
1369 |
< |
* races causing some queued waiters not to be woken up. To avoid |
1370 |
< |
* this, the first worker enqueued in method sync (see |
1371 |
< |
* syncIsReleasable) rescans for tasks after being enqueued, and |
1372 |
< |
* helps signal if any are found. This works well because the |
1373 |
< |
* worker has nothing better to do, and so might as well help |
1374 |
< |
* alleviate the overhead and contention on the threads actually |
1375 |
< |
* doing work. Also, since event counts increments on task |
1376 |
< |
* availability exist to maintain liveness (rather than to force |
1377 |
< |
* refreshes etc), it is OK for callers to exit early if |
1378 |
< |
* contending with another signaller. |
1379 |
< |
*/ |
1380 |
< |
static final class WaitQueueNode { |
1381 |
< |
WaitQueueNode next; // only written before enqueued |
1382 |
< |
volatile ForkJoinWorkerThread thread; // nulled to cancel wait |
1383 |
< |
final long count; // unused for spare stack |
1384 |
< |
|
1385 |
< |
WaitQueueNode(long c, ForkJoinWorkerThread w) { |
1386 |
< |
count = c; |
1387 |
< |
thread = w; |
1388 |
< |
} |
1389 |
< |
|
1390 |
< |
/** |
1391 |
< |
* Wakes up waiter, returning false if known to already |
1392 |
< |
*/ |
1393 |
< |
boolean signal() { |
1394 |
< |
ForkJoinWorkerThread t = thread; |
1395 |
< |
if (t == null) |
1396 |
< |
return false; |
1397 |
< |
thread = null; |
1398 |
< |
LockSupport.unpark(t); |
1399 |
< |
return true; |
1400 |
< |
} |
1401 |
< |
|
1402 |
< |
/** |
1403 |
< |
* Awaits release on sync. |
1404 |
< |
*/ |
1405 |
< |
void awaitSyncRelease(ForkJoinPool p) { |
1406 |
< |
while (thread != null && !p.syncIsReleasable(this)) |
1407 |
< |
LockSupport.park(this); |
1408 |
< |
} |
1409 |
< |
|
1410 |
< |
/** |
1411 |
< |
* Awaits resumption as spare. |
1412 |
< |
*/ |
1413 |
< |
void awaitSpareRelease() { |
1414 |
< |
while (thread != null) { |
1415 |
< |
if (!Thread.interrupted()) |
1416 |
< |
LockSupport.park(this); |
1417 |
< |
} |
1418 |
< |
} |
1419 |
< |
} |
1420 |
< |
|
1421 |
< |
/** |
1422 |
< |
* Ensures that no thread is waiting for count to advance from the |
1423 |
< |
* current value of eventCount read on entry to this method, by |
1424 |
< |
* releasing waiting threads if necessary. |
1425 |
< |
* |
1426 |
< |
* @return the count |
1427 |
< |
*/ |
1428 |
< |
final long ensureSync() { |
1429 |
< |
long c = eventCount; |
1430 |
< |
WaitQueueNode q; |
1431 |
< |
while ((q = syncStack) != null && q.count < c) { |
1432 |
< |
if (casBarrierStack(q, null)) { |
1433 |
< |
do { |
1434 |
< |
q.signal(); |
1435 |
< |
} while ((q = q.next) != null); |
1436 |
< |
break; |
1437 |
< |
} |
1438 |
< |
} |
1439 |
< |
return c; |
1440 |
< |
} |
1441 |
< |
|
1442 |
< |
/** |
1443 |
< |
* Increments event count and releases waiting threads. |
1444 |
< |
*/ |
1445 |
< |
private void signalIdleWorkers() { |
1446 |
< |
long c; |
1447 |
< |
do {} while (!casEventCount(c = eventCount, c+1)); |
1448 |
< |
ensureSync(); |
1449 |
< |
} |
1450 |
< |
|
1451 |
< |
/** |
1452 |
< |
* Signals threads waiting to poll a task. Because method sync |
1453 |
< |
* rechecks availability, it is OK to only proceed if queue |
1454 |
< |
* appears to be non-empty, and OK to skip under contention to |
1455 |
< |
* increment count (since some other thread succeeded). |
1456 |
< |
*/ |
1457 |
< |
final void signalWork() { |
1458 |
< |
long c; |
1459 |
< |
WaitQueueNode q; |
1460 |
< |
if (syncStack != null && |
1461 |
< |
casEventCount(c = eventCount, c+1) && |
1462 |
< |
(((q = syncStack) != null && q.count <= c) && |
1463 |
< |
(!casBarrierStack(q, q.next) || !q.signal()))) |
1464 |
< |
ensureSync(); |
1465 |
< |
} |
1466 |
< |
|
1467 |
< |
/** |
1468 |
< |
* Waits until event count advances from last value held by |
1469 |
< |
* caller, or if excess threads, caller is resumed as spare, or |
1470 |
< |
* caller or pool is terminating. Updates caller's event on exit. |
1471 |
< |
* |
1472 |
< |
* @param w the calling worker thread |
1473 |
< |
*/ |
1474 |
< |
final void sync(ForkJoinWorkerThread w) { |
1475 |
< |
updateStealCount(w); // Transfer w's count while it is idle |
1476 |
< |
|
1477 |
< |
while (!w.isShutdown() && !isTerminating() && !suspendIfSpare(w)) { |
1478 |
< |
long prev = w.lastEventCount; |
1479 |
< |
WaitQueueNode node = null; |
1480 |
< |
WaitQueueNode h; |
1481 |
< |
while (eventCount == prev && |
1482 |
< |
((h = syncStack) == null || h.count == prev)) { |
1483 |
< |
if (node == null) |
1484 |
< |
node = new WaitQueueNode(prev, w); |
1485 |
< |
if (casBarrierStack(node.next = h, node)) { |
1486 |
< |
node.awaitSyncRelease(this); |
1487 |
< |
break; |
1488 |
< |
} |
1489 |
< |
} |
1490 |
< |
long ec = ensureSync(); |
1491 |
< |
if (ec != prev) { |
1492 |
< |
w.lastEventCount = ec; |
1493 |
< |
break; |
1494 |
< |
} |
1495 |
< |
} |
1496 |
< |
} |
1497 |
< |
|
1498 |
< |
/** |
1499 |
< |
* Returns true if worker waiting on sync can proceed: |
1500 |
< |
* - on signal (thread == null) |
1501 |
< |
* - on event count advance (winning race to notify vs signaller) |
1502 |
< |
* - on interrupt |
1503 |
< |
* - if the first queued node, we find work available |
1504 |
< |
* If node was not signalled and event count not advanced on exit, |
1505 |
< |
* then we also help advance event count. |
1506 |
< |
* |
1507 |
< |
* @return true if node can be released |
1508 |
< |
*/ |
1509 |
< |
final boolean syncIsReleasable(WaitQueueNode node) { |
1510 |
< |
long prev = node.count; |
1511 |
< |
if (!Thread.interrupted() && node.thread != null && |
1512 |
< |
(node.next != null || |
1513 |
< |
!ForkJoinWorkerThread.hasQueuedTasks(workers)) && |
1514 |
< |
eventCount == prev) |
1515 |
< |
return false; |
1516 |
< |
if (node.thread != null) { |
1517 |
< |
node.thread = null; |
1518 |
< |
long ec = eventCount; |
1519 |
< |
if (prev <= ec) // help signal |
1520 |
< |
casEventCount(ec, ec+1); |
1521 |
< |
} |
1522 |
< |
return true; |
1523 |
< |
} |
1524 |
< |
|
1525 |
< |
/** |
1526 |
< |
* Returns true if a new sync event occurred since last call to |
1527 |
< |
* sync or this method, if so, updating caller's count. |
1528 |
< |
*/ |
1529 |
< |
final boolean hasNewSyncEvent(ForkJoinWorkerThread w) { |
1530 |
< |
long lc = w.lastEventCount; |
1531 |
< |
long ec = ensureSync(); |
1532 |
< |
if (ec == lc) |
1745 |
> |
return termination.awaitAdvanceInterruptibly(0, timeout, unit) > 0; |
1746 |
> |
} catch(TimeoutException ex) { |
1747 |
|
return false; |
1534 |
– |
w.lastEventCount = ec; |
1535 |
– |
return true; |
1536 |
– |
} |
1537 |
– |
|
1538 |
– |
// Parallelism maintenance |
1539 |
– |
|
1540 |
– |
/** |
1541 |
– |
* Decrements running count; if too low, adds spare. |
1542 |
– |
* |
1543 |
– |
* Conceptually, all we need to do here is add or resume a |
1544 |
– |
* spare thread when one is about to block (and remove or |
1545 |
– |
* suspend it later when unblocked -- see suspendIfSpare). |
1546 |
– |
* However, implementing this idea requires coping with |
1547 |
– |
* several problems: we have imperfect information about the |
1548 |
– |
* states of threads. Some count updates can and usually do |
1549 |
– |
* lag run state changes, despite arrangements to keep them |
1550 |
– |
* accurate (for example, when possible, updating counts |
1551 |
– |
* before signalling or resuming), especially when running on |
1552 |
– |
* dynamic JVMs that don't optimize the infrequent paths that |
1553 |
– |
* update counts. Generating too many threads can make these |
1554 |
– |
* problems become worse, because excess threads are more |
1555 |
– |
* likely to be context-switched with others, slowing them all |
1556 |
– |
* down, especially if there is no work available, so all are |
1557 |
– |
* busy scanning or idling. Also, excess spare threads can |
1558 |
– |
* only be suspended or removed when they are idle, not |
1559 |
– |
* immediately when they aren't needed. So adding threads will |
1560 |
– |
* raise parallelism level for longer than necessary. Also, |
1561 |
– |
* FJ applications often encounter highly transient peaks when |
1562 |
– |
* many threads are blocked joining, but for less time than it |
1563 |
– |
* takes to create or resume spares. |
1564 |
– |
* |
1565 |
– |
* @param joinMe if non-null, return early if done |
1566 |
– |
* @param maintainParallelism if true, try to stay within |
1567 |
– |
* target counts, else create only to avoid starvation |
1568 |
– |
* @return true if joinMe known to be done |
1569 |
– |
*/ |
1570 |
– |
final boolean preJoin(ForkJoinTask<?> joinMe, |
1571 |
– |
boolean maintainParallelism) { |
1572 |
– |
maintainParallelism &= maintainsParallelism; // overrride |
1573 |
– |
boolean dec = false; // true when running count decremented |
1574 |
– |
while (spareStack == null || !tryResumeSpare(dec)) { |
1575 |
– |
int counts = workerCounts; |
1576 |
– |
if (dec || (dec = casWorkerCounts(counts, --counts))) { |
1577 |
– |
// CAS cheat |
1578 |
– |
if (!needSpare(counts, maintainParallelism)) |
1579 |
– |
break; |
1580 |
– |
if (joinMe.status < 0) |
1581 |
– |
return true; |
1582 |
– |
if (tryAddSpare(counts)) |
1583 |
– |
break; |
1584 |
– |
} |
1585 |
– |
} |
1586 |
– |
return false; |
1587 |
– |
} |
1588 |
– |
|
1589 |
– |
/** |
1590 |
– |
* Same idea as preJoin |
1591 |
– |
*/ |
1592 |
– |
final boolean preBlock(ManagedBlocker blocker, |
1593 |
– |
boolean maintainParallelism) { |
1594 |
– |
maintainParallelism &= maintainsParallelism; |
1595 |
– |
boolean dec = false; |
1596 |
– |
while (spareStack == null || !tryResumeSpare(dec)) { |
1597 |
– |
int counts = workerCounts; |
1598 |
– |
if (dec || (dec = casWorkerCounts(counts, --counts))) { |
1599 |
– |
if (!needSpare(counts, maintainParallelism)) |
1600 |
– |
break; |
1601 |
– |
if (blocker.isReleasable()) |
1602 |
– |
return true; |
1603 |
– |
if (tryAddSpare(counts)) |
1604 |
– |
break; |
1605 |
– |
} |
1606 |
– |
} |
1607 |
– |
return false; |
1608 |
– |
} |
1609 |
– |
|
1610 |
– |
/** |
1611 |
– |
* Returns true if a spare thread appears to be needed. If |
1612 |
– |
* maintaining parallelism, returns true when the deficit in |
1613 |
– |
* running threads is more than the surplus of total threads, and |
1614 |
– |
* there is apparently some work to do. This self-limiting rule |
1615 |
– |
* means that the more threads that have already been added, the |
1616 |
– |
* less parallelism we will tolerate before adding another. |
1617 |
– |
* |
1618 |
– |
* @param counts current worker counts |
1619 |
– |
* @param maintainParallelism try to maintain parallelism |
1620 |
– |
*/ |
1621 |
– |
private boolean needSpare(int counts, boolean maintainParallelism) { |
1622 |
– |
int ps = parallelism; |
1623 |
– |
int rc = runningCountOf(counts); |
1624 |
– |
int tc = totalCountOf(counts); |
1625 |
– |
int runningDeficit = ps - rc; |
1626 |
– |
int totalSurplus = tc - ps; |
1627 |
– |
return (tc < maxPoolSize && |
1628 |
– |
(rc == 0 || totalSurplus < 0 || |
1629 |
– |
(maintainParallelism && |
1630 |
– |
runningDeficit > totalSurplus && |
1631 |
– |
ForkJoinWorkerThread.hasQueuedTasks(workers)))); |
1632 |
– |
} |
1633 |
– |
|
1634 |
– |
/** |
1635 |
– |
* Adds a spare worker if lock available and no more than the |
1636 |
– |
* expected numbers of threads exist. |
1637 |
– |
* |
1638 |
– |
* @return true if successful |
1639 |
– |
*/ |
1640 |
– |
private boolean tryAddSpare(int expectedCounts) { |
1641 |
– |
final ReentrantLock lock = this.workerLock; |
1642 |
– |
int expectedRunning = runningCountOf(expectedCounts); |
1643 |
– |
int expectedTotal = totalCountOf(expectedCounts); |
1644 |
– |
boolean success = false; |
1645 |
– |
boolean locked = false; |
1646 |
– |
// confirm counts while locking; CAS after obtaining lock |
1647 |
– |
try { |
1648 |
– |
for (;;) { |
1649 |
– |
int s = workerCounts; |
1650 |
– |
int tc = totalCountOf(s); |
1651 |
– |
int rc = runningCountOf(s); |
1652 |
– |
if (rc > expectedRunning || tc > expectedTotal) |
1653 |
– |
break; |
1654 |
– |
if (!locked && !(locked = lock.tryLock())) |
1655 |
– |
break; |
1656 |
– |
if (casWorkerCounts(s, workerCountsFor(tc+1, rc+1))) { |
1657 |
– |
createAndStartSpare(tc); |
1658 |
– |
success = true; |
1659 |
– |
break; |
1660 |
– |
} |
1661 |
– |
} |
1662 |
– |
} finally { |
1663 |
– |
if (locked) |
1664 |
– |
lock.unlock(); |
1665 |
– |
} |
1666 |
– |
return success; |
1667 |
– |
} |
1668 |
– |
|
1669 |
– |
/** |
1670 |
– |
* Adds the kth spare worker. On entry, pool counts are already |
1671 |
– |
* adjusted to reflect addition. |
1672 |
– |
*/ |
1673 |
– |
private void createAndStartSpare(int k) { |
1674 |
– |
ForkJoinWorkerThread w = null; |
1675 |
– |
ForkJoinWorkerThread[] ws = ensureWorkerArrayCapacity(k + 1); |
1676 |
– |
int len = ws.length; |
1677 |
– |
// Probably, we can place at slot k. If not, find empty slot |
1678 |
– |
if (k < len && ws[k] != null) { |
1679 |
– |
for (k = 0; k < len && ws[k] != null; ++k) |
1680 |
– |
; |
1681 |
– |
} |
1682 |
– |
if (k < len && !isTerminating() && (w = createWorker(k)) != null) { |
1683 |
– |
ws[k] = w; |
1684 |
– |
w.start(); |
1685 |
– |
} |
1686 |
– |
else |
1687 |
– |
updateWorkerCount(-1); // adjust on failure |
1688 |
– |
signalIdleWorkers(); |
1689 |
– |
} |
1690 |
– |
|
1691 |
– |
/** |
1692 |
– |
* Suspends calling thread w if there are excess threads. Called |
1693 |
– |
* only from sync. Spares are enqueued in a Treiber stack using |
1694 |
– |
* the same WaitQueueNodes as barriers. They are resumed mainly |
1695 |
– |
* in preJoin, but are also woken on pool events that require all |
1696 |
– |
* threads to check run state. |
1697 |
– |
* |
1698 |
– |
* @param w the caller |
1699 |
– |
*/ |
1700 |
– |
private boolean suspendIfSpare(ForkJoinWorkerThread w) { |
1701 |
– |
WaitQueueNode node = null; |
1702 |
– |
int s; |
1703 |
– |
while (parallelism < runningCountOf(s = workerCounts)) { |
1704 |
– |
if (node == null) |
1705 |
– |
node = new WaitQueueNode(0, w); |
1706 |
– |
if (casWorkerCounts(s, s-1)) { // representation-dependent |
1707 |
– |
// push onto stack |
1708 |
– |
do {} while (!casSpareStack(node.next = spareStack, node)); |
1709 |
– |
// block until released by resumeSpare |
1710 |
– |
node.awaitSpareRelease(); |
1711 |
– |
return true; |
1712 |
– |
} |
1713 |
– |
} |
1714 |
– |
return false; |
1715 |
– |
} |
1716 |
– |
|
1717 |
– |
/** |
1718 |
– |
* Tries to pop and resume a spare thread. |
1719 |
– |
* |
1720 |
– |
* @param updateCount if true, increment running count on success |
1721 |
– |
* @return true if successful |
1722 |
– |
*/ |
1723 |
– |
private boolean tryResumeSpare(boolean updateCount) { |
1724 |
– |
WaitQueueNode q; |
1725 |
– |
while ((q = spareStack) != null) { |
1726 |
– |
if (casSpareStack(q, q.next)) { |
1727 |
– |
if (updateCount) |
1728 |
– |
updateRunningCount(1); |
1729 |
– |
q.signal(); |
1730 |
– |
return true; |
1731 |
– |
} |
1732 |
– |
} |
1733 |
– |
return false; |
1734 |
– |
} |
1735 |
– |
|
1736 |
– |
/** |
1737 |
– |
* Pops and resumes all spare threads. Same idea as ensureSync. |
1738 |
– |
* |
1739 |
– |
* @return true if any spares released |
1740 |
– |
*/ |
1741 |
– |
private boolean resumeAllSpares() { |
1742 |
– |
WaitQueueNode q; |
1743 |
– |
while ( (q = spareStack) != null) { |
1744 |
– |
if (casSpareStack(q, null)) { |
1745 |
– |
do { |
1746 |
– |
updateRunningCount(1); |
1747 |
– |
q.signal(); |
1748 |
– |
} while ((q = q.next) != null); |
1749 |
– |
return true; |
1750 |
– |
} |
1751 |
– |
} |
1752 |
– |
return false; |
1753 |
– |
} |
1754 |
– |
|
1755 |
– |
/** |
1756 |
– |
* Pops and shuts down excessive spare threads. Call only while |
1757 |
– |
* holding lock. This is not guaranteed to eliminate all excess |
1758 |
– |
* threads, only those suspended as spares, which are the ones |
1759 |
– |
* unlikely to be needed in the future. |
1760 |
– |
*/ |
1761 |
– |
private void trimSpares() { |
1762 |
– |
int surplus = totalCountOf(workerCounts) - parallelism; |
1763 |
– |
WaitQueueNode q; |
1764 |
– |
while (surplus > 0 && (q = spareStack) != null) { |
1765 |
– |
if (casSpareStack(q, null)) { |
1766 |
– |
do { |
1767 |
– |
updateRunningCount(1); |
1768 |
– |
ForkJoinWorkerThread w = q.thread; |
1769 |
– |
if (w != null && surplus > 0 && |
1770 |
– |
runningCountOf(workerCounts) > 0 && w.shutdown()) |
1771 |
– |
--surplus; |
1772 |
– |
q.signal(); |
1773 |
– |
} while ((q = q.next) != null); |
1774 |
– |
} |
1748 |
|
} |
1749 |
|
} |
1750 |
|
|
1751 |
|
/** |
1752 |
|
* Interface for extending managed parallelism for tasks running |
1753 |
< |
* in ForkJoinPools. A ManagedBlocker provides two methods. |
1754 |
< |
* Method {@code isReleasable} must return true if blocking is not |
1755 |
< |
* necessary. Method {@code block} blocks the current thread if |
1756 |
< |
* necessary (perhaps internally invoking {@code isReleasable} |
1757 |
< |
* before actually blocking.). |
1753 |
> |
* in {@link ForkJoinPool}s. |
1754 |
> |
* |
1755 |
> |
* <p>A {@code ManagedBlocker} provides two methods. |
1756 |
> |
* Method {@code isReleasable} must return {@code true} if |
1757 |
> |
* blocking is not necessary. Method {@code block} blocks the |
1758 |
> |
* current thread if necessary (perhaps internally invoking |
1759 |
> |
* {@code isReleasable} before actually blocking). |
1760 |
|
* |
1761 |
|
* <p>For example, here is a ManagedBlocker based on a |
1762 |
|
* ReentrantLock: |
1780 |
|
* Possibly blocks the current thread, for example waiting for |
1781 |
|
* a lock or condition. |
1782 |
|
* |
1783 |
< |
* @return true if no additional blocking is necessary (i.e., |
1784 |
< |
* if isReleasable would return true) |
1783 |
> |
* @return {@code true} if no additional blocking is necessary |
1784 |
> |
* (i.e., if isReleasable would return true) |
1785 |
|
* @throws InterruptedException if interrupted while waiting |
1786 |
|
* (the method is not required to do so, but is allowed to) |
1787 |
|
*/ |
1788 |
|
boolean block() throws InterruptedException; |
1789 |
|
|
1790 |
|
/** |
1791 |
< |
* Returns true if blocking is unnecessary. |
1791 |
> |
* Returns {@code true} if blocking is unnecessary. |
1792 |
|
*/ |
1793 |
|
boolean isReleasable(); |
1794 |
|
} |
1795 |
|
|
1796 |
|
/** |
1797 |
|
* Blocks in accord with the given blocker. If the current thread |
1798 |
< |
* is a ForkJoinWorkerThread, this method possibly arranges for a |
1799 |
< |
* spare thread to be activated if necessary to ensure parallelism |
1800 |
< |
* while the current thread is blocked. If |
1826 |
< |
* {@code maintainParallelism} is true and the pool supports |
1827 |
< |
* it ({@link #getMaintainsParallelism}), this method attempts to |
1828 |
< |
* maintain the pool's nominal parallelism. Otherwise it activates |
1829 |
< |
* a thread only if necessary to avoid complete starvation. This |
1830 |
< |
* option may be preferable when blockages use timeouts, or are |
1831 |
< |
* almost always brief. |
1798 |
> |
* is a {@link ForkJoinWorkerThread}, this method possibly |
1799 |
> |
* arranges for a spare thread to be activated if necessary to |
1800 |
> |
* ensure sufficient parallelism while the current thread is blocked. |
1801 |
|
* |
1802 |
< |
* <p> If the caller is not a ForkJoinTask, this method is behaviorally |
1803 |
< |
* equivalent to |
1802 |
> |
* <p>If the caller is not a {@link ForkJoinTask}, this method is |
1803 |
> |
* behaviorally equivalent to |
1804 |
|
* <pre> {@code |
1805 |
|
* while (!blocker.isReleasable()) |
1806 |
|
* if (blocker.block()) |
1807 |
|
* return; |
1808 |
|
* }</pre> |
1809 |
< |
* If the caller is a ForkJoinTask, then the pool may first |
1810 |
< |
* be expanded to ensure parallelism, and later adjusted. |
1809 |
> |
* |
1810 |
> |
* If the caller is a {@code ForkJoinTask}, then the pool may |
1811 |
> |
* first be expanded to ensure parallelism, and later adjusted. |
1812 |
|
* |
1813 |
|
* @param blocker the blocker |
1844 |
– |
* @param maintainParallelism if true and supported by this pool, |
1845 |
– |
* attempt to maintain the pool's nominal parallelism; otherwise |
1846 |
– |
* activate a thread only if necessary to avoid complete |
1847 |
– |
* starvation. |
1814 |
|
* @throws InterruptedException if blocker.block did so |
1815 |
|
*/ |
1816 |
< |
public static void managedBlock(ManagedBlocker blocker, |
1851 |
< |
boolean maintainParallelism) |
1816 |
> |
public static void managedBlock(ManagedBlocker blocker) |
1817 |
|
throws InterruptedException { |
1818 |
|
Thread t = Thread.currentThread(); |
1819 |
< |
ForkJoinPool pool = ((t instanceof ForkJoinWorkerThread) ? |
1820 |
< |
((ForkJoinWorkerThread) t).pool : null); |
1821 |
< |
if (!blocker.isReleasable()) { |
1822 |
< |
try { |
1858 |
< |
if (pool == null || |
1859 |
< |
!pool.preBlock(blocker, maintainParallelism)) |
1860 |
< |
awaitBlocker(blocker); |
1861 |
< |
} finally { |
1862 |
< |
if (pool != null) |
1863 |
< |
pool.updateRunningCount(1); |
1864 |
< |
} |
1819 |
> |
if (t instanceof ForkJoinWorkerThread) |
1820 |
> |
((ForkJoinWorkerThread) t).pool.awaitBlocker(blocker); |
1821 |
> |
else { |
1822 |
> |
do {} while (!blocker.isReleasable() && !blocker.block()); |
1823 |
|
} |
1824 |
|
} |
1825 |
|
|
1826 |
< |
private static void awaitBlocker(ManagedBlocker blocker) |
1827 |
< |
throws InterruptedException { |
1828 |
< |
do {} while (!blocker.isReleasable() && !blocker.block()); |
1871 |
< |
} |
1872 |
< |
|
1873 |
< |
// AbstractExecutorService overrides |
1826 |
> |
// AbstractExecutorService overrides. These rely on undocumented |
1827 |
> |
// fact that ForkJoinTask.adapt returns ForkJoinTasks that also |
1828 |
> |
// implement RunnableFuture. |
1829 |
|
|
1830 |
|
protected <T> RunnableFuture<T> newTaskFor(Runnable runnable, T value) { |
1831 |
< |
return new AdaptedRunnable<T>(runnable, value); |
1831 |
> |
return (RunnableFuture<T>) ForkJoinTask.adapt(runnable, value); |
1832 |
|
} |
1833 |
|
|
1834 |
|
protected <T> RunnableFuture<T> newTaskFor(Callable<T> callable) { |
1835 |
< |
return new AdaptedCallable<T>(callable); |
1835 |
> |
return (RunnableFuture<T>) ForkJoinTask.adapt(callable); |
1836 |
|
} |
1837 |
|
|
1838 |
+ |
// Unsafe mechanics |
1839 |
+ |
|
1840 |
+ |
private static final sun.misc.Unsafe UNSAFE = getUnsafe(); |
1841 |
+ |
private static final long workerCountsOffset = |
1842 |
+ |
objectFieldOffset("workerCounts", ForkJoinPool.class); |
1843 |
+ |
private static final long runStateOffset = |
1844 |
+ |
objectFieldOffset("runState", ForkJoinPool.class); |
1845 |
+ |
private static final long eventCountOffset = |
1846 |
+ |
objectFieldOffset("eventCount", ForkJoinPool.class); |
1847 |
+ |
private static final long eventWaitersOffset = |
1848 |
+ |
objectFieldOffset("eventWaiters",ForkJoinPool.class); |
1849 |
+ |
private static final long stealCountOffset = |
1850 |
+ |
objectFieldOffset("stealCount",ForkJoinPool.class); |
1851 |
+ |
|
1852 |
+ |
private static long objectFieldOffset(String field, Class<?> klazz) { |
1853 |
+ |
try { |
1854 |
+ |
return UNSAFE.objectFieldOffset(klazz.getDeclaredField(field)); |
1855 |
+ |
} catch (NoSuchFieldException e) { |
1856 |
+ |
// Convert Exception to corresponding Error |
1857 |
+ |
NoSuchFieldError error = new NoSuchFieldError(field); |
1858 |
+ |
error.initCause(e); |
1859 |
+ |
throw error; |
1860 |
+ |
} |
1861 |
+ |
} |
1862 |
|
|
1863 |
< |
// Unsafe mechanics for jsr166y 3rd party package. |
1863 |
> |
/** |
1864 |
> |
* Returns a sun.misc.Unsafe. Suitable for use in a 3rd party package. |
1865 |
> |
* Replace with a simple call to Unsafe.getUnsafe when integrating |
1866 |
> |
* into a jdk. |
1867 |
> |
* |
1868 |
> |
* @return a sun.misc.Unsafe |
1869 |
> |
*/ |
1870 |
|
private static sun.misc.Unsafe getUnsafe() { |
1871 |
|
try { |
1872 |
|
return sun.misc.Unsafe.getUnsafe(); |
1873 |
|
} catch (SecurityException se) { |
1874 |
|
try { |
1875 |
|
return java.security.AccessController.doPrivileged |
1876 |
< |
(new java.security.PrivilegedExceptionAction<sun.misc.Unsafe>() { |
1876 |
> |
(new java.security |
1877 |
> |
.PrivilegedExceptionAction<sun.misc.Unsafe>() { |
1878 |
|
public sun.misc.Unsafe run() throws Exception { |
1879 |
< |
return getUnsafeByReflection(); |
1879 |
> |
java.lang.reflect.Field f = sun.misc |
1880 |
> |
.Unsafe.class.getDeclaredField("theUnsafe"); |
1881 |
> |
f.setAccessible(true); |
1882 |
> |
return (sun.misc.Unsafe) f.get(null); |
1883 |
|
}}); |
1884 |
|
} catch (java.security.PrivilegedActionException e) { |
1885 |
|
throw new RuntimeException("Could not initialize intrinsics", |
1887 |
|
} |
1888 |
|
} |
1889 |
|
} |
1901 |
– |
|
1902 |
– |
private static sun.misc.Unsafe getUnsafeByReflection() |
1903 |
– |
throws NoSuchFieldException, IllegalAccessException { |
1904 |
– |
java.lang.reflect.Field f = |
1905 |
– |
sun.misc.Unsafe.class.getDeclaredField("theUnsafe"); |
1906 |
– |
f.setAccessible(true); |
1907 |
– |
return (sun.misc.Unsafe) f.get(null); |
1908 |
– |
} |
1909 |
– |
|
1910 |
– |
private static long fieldOffset(String fieldName, Class<?> klazz) { |
1911 |
– |
try { |
1912 |
– |
return UNSAFE.objectFieldOffset(klazz.getDeclaredField(fieldName)); |
1913 |
– |
} catch (NoSuchFieldException e) { |
1914 |
– |
// Convert Exception to Error |
1915 |
– |
NoSuchFieldError error = new NoSuchFieldError(fieldName); |
1916 |
– |
error.initCause(e); |
1917 |
– |
throw error; |
1918 |
– |
} |
1919 |
– |
} |
1920 |
– |
|
1921 |
– |
private static final sun.misc.Unsafe UNSAFE = getUnsafe(); |
1922 |
– |
static final long eventCountOffset = |
1923 |
– |
fieldOffset("eventCount", ForkJoinPool.class); |
1924 |
– |
static final long workerCountsOffset = |
1925 |
– |
fieldOffset("workerCounts", ForkJoinPool.class); |
1926 |
– |
static final long runControlOffset = |
1927 |
– |
fieldOffset("runControl", ForkJoinPool.class); |
1928 |
– |
static final long syncStackOffset = |
1929 |
– |
fieldOffset("syncStack",ForkJoinPool.class); |
1930 |
– |
static final long spareStackOffset = |
1931 |
– |
fieldOffset("spareStack", ForkJoinPool.class); |
1932 |
– |
|
1933 |
– |
private boolean casEventCount(long cmp, long val) { |
1934 |
– |
return UNSAFE.compareAndSwapLong(this, eventCountOffset, cmp, val); |
1935 |
– |
} |
1936 |
– |
private boolean casWorkerCounts(int cmp, int val) { |
1937 |
– |
return UNSAFE.compareAndSwapInt(this, workerCountsOffset, cmp, val); |
1938 |
– |
} |
1939 |
– |
private boolean casRunControl(int cmp, int val) { |
1940 |
– |
return UNSAFE.compareAndSwapInt(this, runControlOffset, cmp, val); |
1941 |
– |
} |
1942 |
– |
private boolean casSpareStack(WaitQueueNode cmp, WaitQueueNode val) { |
1943 |
– |
return UNSAFE.compareAndSwapObject(this, spareStackOffset, cmp, val); |
1944 |
– |
} |
1945 |
– |
private boolean casBarrierStack(WaitQueueNode cmp, WaitQueueNode val) { |
1946 |
– |
return UNSAFE.compareAndSwapObject(this, syncStackOffset, cmp, val); |
1947 |
– |
} |
1890 |
|
} |