5 |
|
*/ |
6 |
|
|
7 |
|
package jsr166y; |
8 |
< |
import java.util.*; |
8 |
> |
|
9 |
|
import java.util.concurrent.*; |
10 |
< |
import java.util.concurrent.locks.*; |
11 |
< |
import java.util.concurrent.atomic.*; |
12 |
< |
import sun.misc.Unsafe; |
13 |
< |
import java.lang.reflect.*; |
10 |
> |
|
11 |
> |
import java.util.ArrayList; |
12 |
> |
import java.util.Arrays; |
13 |
> |
import java.util.Collection; |
14 |
> |
import java.util.Collections; |
15 |
> |
import java.util.List; |
16 |
> |
import java.util.concurrent.locks.Condition; |
17 |
> |
import java.util.concurrent.locks.LockSupport; |
18 |
> |
import java.util.concurrent.locks.ReentrantLock; |
19 |
> |
import java.util.concurrent.atomic.AtomicInteger; |
20 |
> |
import java.util.concurrent.atomic.AtomicLong; |
21 |
|
|
22 |
|
/** |
23 |
|
* An {@link ExecutorService} for running {@link ForkJoinTask}s. A |
34 |
|
* (eventually blocking if none exist). This makes them efficient when |
35 |
|
* most tasks spawn other subtasks (as do most ForkJoinTasks), as well |
36 |
|
* as the mixed execution of some plain Runnable- or Callable- based |
37 |
< |
* activities along with ForkJoinTasks. Otherwise, other |
37 |
> |
* activities along with ForkJoinTasks. When setting |
38 |
> |
* {@code setAsyncMode}, a ForkJoinPools may also be appropriate for |
39 |
> |
* use with fine-grained tasks that are never joined. Otherwise, other |
40 |
|
* ExecutorService implementations are typically more appropriate |
41 |
|
* choices. |
42 |
|
* |
45 |
|
* adding, suspending, or resuming threads, even if some tasks are |
46 |
|
* waiting to join others. However, no such adjustments are performed |
47 |
|
* in the face of blocked IO or other unmanaged synchronization. The |
48 |
< |
* nested <code>ManagedBlocker</code> interface enables extension of |
48 |
> |
* nested {@code ManagedBlocker} interface enables extension of |
49 |
|
* the kinds of synchronization accommodated. The target parallelism |
50 |
< |
* level may also be changed dynamically (<code>setParallelism</code>) |
51 |
< |
* and dynamically thread construction can be limited using methods |
52 |
< |
* <code>setMaximumPoolSize</code> and/or |
53 |
< |
* <code>setMaintainsParallelism</code>. |
50 |
> |
* level may also be changed dynamically ({@code setParallelism}) |
51 |
> |
* and thread construction can be limited using methods |
52 |
> |
* {@code setMaximumPoolSize} and/or |
53 |
> |
* {@code setMaintainsParallelism}. |
54 |
|
* |
55 |
|
* <p>In addition to execution and lifecycle control methods, this |
56 |
|
* class provides status check methods (for example |
57 |
< |
* <code>getStealCount</code>) that are intended to aid in developing, |
57 |
> |
* {@code getStealCount}) that are intended to aid in developing, |
58 |
|
* tuning, and monitoring fork/join applications. Also, method |
59 |
< |
* <code>toString</code> returns indications of pool state in a |
59 |
> |
* {@code toString} returns indications of pool state in a |
60 |
|
* convenient form for informal monitoring. |
61 |
|
* |
62 |
|
* <p><b>Implementation notes</b>: This implementation restricts the |
63 |
|
* maximum number of running threads to 32767. Attempts to create |
64 |
|
* pools with greater than the maximum result in |
65 |
|
* IllegalArgumentExceptions. |
66 |
+ |
* |
67 |
+ |
* @since 1.7 |
68 |
+ |
* @author Doug Lea |
69 |
|
*/ |
70 |
|
public class ForkJoinPool extends AbstractExecutorService { |
71 |
|
|
91 |
|
* Returns a new worker thread operating in the given pool. |
92 |
|
* |
93 |
|
* @param pool the pool this thread works in |
94 |
< |
* @throws NullPointerException if pool is null; |
94 |
> |
* @throws NullPointerException if pool is null |
95 |
|
*/ |
96 |
|
public ForkJoinWorkerThread newThread(ForkJoinPool pool); |
97 |
|
} |
98 |
|
|
99 |
|
/** |
100 |
< |
* Default ForkJoinWorkerThreadFactory implementation, creates a |
100 |
> |
* Default ForkJoinWorkerThreadFactory implementation; creates a |
101 |
|
* new ForkJoinWorkerThread. |
102 |
|
*/ |
103 |
|
static class DefaultForkJoinWorkerThreadFactory |
143 |
|
new AtomicInteger(); |
144 |
|
|
145 |
|
/** |
146 |
< |
* Array holding all worker threads in the pool. Array size must |
147 |
< |
* be a power of two. Updates and replacements are protected by |
148 |
< |
* workerLock, but it is always kept in a consistent enough state |
149 |
< |
* to be randomly accessed without locking by workers performing |
150 |
< |
* work-stealing. |
146 |
> |
* Array holding all worker threads in the pool. Initialized upon |
147 |
> |
* 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. |
151 |
|
*/ |
152 |
|
volatile ForkJoinWorkerThread[] workers; |
153 |
|
|
163 |
|
|
164 |
|
/** |
165 |
|
* The uncaught exception handler used when any worker |
166 |
< |
* abrupty terminates |
166 |
> |
* abruptly terminates |
167 |
|
*/ |
168 |
|
private Thread.UncaughtExceptionHandler ueh; |
169 |
|
|
191 |
|
private final LinkedTransferQueue<ForkJoinTask<?>> submissionQueue; |
192 |
|
|
193 |
|
/** |
194 |
< |
* Head of Treiber stack for barrier sync. See below for explanation |
194 |
> |
* Head of Treiber stack for barrier sync. See below for explanation. |
195 |
|
*/ |
196 |
|
private volatile WaitQueueNode syncStack; |
197 |
|
|
216 |
|
private volatile int parallelism; |
217 |
|
|
218 |
|
/** |
219 |
+ |
* True if use local fifo, not default lifo, for local polling |
220 |
+ |
*/ |
221 |
+ |
private volatile boolean locallyFifo; |
222 |
+ |
|
223 |
+ |
/** |
224 |
|
* 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 running active count is in low |
230 |
< |
* word, so need to be modified if this changes |
229 |
> |
* updateRunningCount and preJoin assume that running active count |
230 |
> |
* is in low word, so need to be modified if this changes. |
231 |
|
*/ |
232 |
|
private volatile int workerCounts; |
233 |
|
|
236 |
|
private static int workerCountsFor(int t, int r) { return (t << 16) + r; } |
237 |
|
|
238 |
|
/** |
239 |
< |
* Add delta (which may be negative) to running count. This must |
239 |
> |
* 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) |
241 |
> |
* any managed synchronization (i.e., mainly, joins). |
242 |
> |
* |
243 |
|
* @param delta the number to add |
244 |
|
*/ |
245 |
|
final void updateRunningCount(int delta) { |
246 |
|
int s; |
247 |
< |
do;while (!casWorkerCounts(s = workerCounts, s + delta)); |
247 |
> |
do {} while (!casWorkerCounts(s = workerCounts, s + delta)); |
248 |
|
} |
249 |
|
|
250 |
|
/** |
251 |
< |
* Add delta (which may be negative) to both total and running |
251 |
> |
* 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 |
256 |
|
*/ |
257 |
|
private void updateWorkerCount(int delta) { |
258 |
|
int d = delta + (delta << 16); // add to both lo and hi parts |
259 |
|
int s; |
260 |
< |
do;while (!casWorkerCounts(s = workerCounts, s + d)); |
260 |
> |
do {} while (!casWorkerCounts(s = workerCounts, s + d)); |
261 |
|
} |
262 |
|
|
263 |
|
/** |
283 |
|
private static int runControlFor(int r, int a) { return (r << 16) + a; } |
284 |
|
|
285 |
|
/** |
286 |
< |
* Try incrementing active count; fail on contention. Called by |
287 |
< |
* workers before/during executing tasks. |
288 |
< |
* @return true on success; |
286 |
> |
* Tries incrementing active count; fails on contention. |
287 |
> |
* Called by workers before/during executing tasks. |
288 |
> |
* |
289 |
> |
* @return true on success |
290 |
|
*/ |
291 |
|
final boolean tryIncrementActiveCount() { |
292 |
|
int c = runControl; |
294 |
|
} |
295 |
|
|
296 |
|
/** |
297 |
< |
* Try decrementing active count; fail on contention. |
298 |
< |
* Possibly trigger termination on success |
297 |
> |
* Tries decrementing active count; fails on contention. |
298 |
> |
* Possibly triggers termination on success. |
299 |
|
* Called by workers when they can't find tasks. |
300 |
+ |
* |
301 |
|
* @return true on success |
302 |
|
*/ |
303 |
|
final boolean tryDecrementActiveCount() { |
311 |
|
} |
312 |
|
|
313 |
|
/** |
314 |
< |
* Return true if argument represents zero active count and |
315 |
< |
* nonzero runstate, which is the triggering condition for |
314 |
> |
* Returns {@code true} if argument represents zero active count |
315 |
> |
* and nonzero runstate, which is the triggering condition for |
316 |
|
* terminating on shutdown. |
317 |
|
*/ |
318 |
|
private static boolean canTerminateOnShutdown(int c) { |
319 |
< |
return ((c & -c) >>> 16) != 0; // i.e. least bit is nonzero runState bit |
319 |
> |
// i.e. least bit is nonzero runState bit |
320 |
> |
return ((c & -c) >>> 16) != 0; |
321 |
|
} |
322 |
|
|
323 |
|
/** |
343 |
|
|
344 |
|
/** |
345 |
|
* Creates a ForkJoinPool with a pool size equal to the number of |
346 |
< |
* processors available on the system and using the default |
347 |
< |
* ForkJoinWorkerThreadFactory, |
346 |
> |
* processors available on the system, using the default |
347 |
> |
* ForkJoinWorkerThreadFactory. |
348 |
> |
* |
349 |
|
* @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")</code>, |
352 |
> |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
353 |
|
*/ |
354 |
|
public ForkJoinPool() { |
355 |
|
this(Runtime.getRuntime().availableProcessors(), |
357 |
|
} |
358 |
|
|
359 |
|
/** |
360 |
< |
* Creates a ForkJoinPool with the indicated parellelism level |
361 |
< |
* threads, and using the default ForkJoinWorkerThreadFactory, |
360 |
> |
* 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")</code>, |
369 |
> |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
370 |
|
*/ |
371 |
|
public ForkJoinPool(int parallelism) { |
372 |
|
this(parallelism, defaultForkJoinWorkerThreadFactory); |
375 |
|
/** |
376 |
|
* Creates a ForkJoinPool with parallelism equal to the number of |
377 |
|
* processors available on the system and using the given |
378 |
< |
* ForkJoinWorkerThreadFactory, |
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")</code>, |
385 |
> |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
386 |
|
*/ |
387 |
|
public ForkJoinPool(ForkJoinWorkerThreadFactory factory) { |
388 |
|
this(Runtime.getRuntime().availableProcessors(), factory); |
394 |
|
* @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. |
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")</code>, |
402 |
> |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
403 |
|
*/ |
404 |
|
public ForkJoinPool(int parallelism, ForkJoinWorkerThreadFactory factory) { |
405 |
|
if (parallelism <= 0 || parallelism > MAX_THREADS) |
416 |
|
this.termination = workerLock.newCondition(); |
417 |
|
this.stealCount = new AtomicLong(); |
418 |
|
this.submissionQueue = new LinkedTransferQueue<ForkJoinTask<?>>(); |
419 |
< |
createAndStartInitialWorkers(parallelism); |
419 |
> |
// worker array and workers are lazily constructed |
420 |
|
} |
421 |
|
|
422 |
|
/** |
423 |
< |
* Create new worker using factory. |
423 |
> |
* Creates a new worker thread using factory. |
424 |
> |
* |
425 |
|
* @param index the index to assign worker |
426 |
|
* @return new worker, or null of factory failed |
427 |
|
*/ |
431 |
|
if (w != null) { |
432 |
|
w.poolIndex = index; |
433 |
|
w.setDaemon(true); |
434 |
+ |
w.setAsyncMode(locallyFifo); |
435 |
|
w.setName("ForkJoinPool-" + poolNumber + "-worker-" + index); |
436 |
|
if (h != null) |
437 |
|
w.setUncaughtExceptionHandler(h); |
440 |
|
} |
441 |
|
|
442 |
|
/** |
443 |
< |
* Return a good size for worker array given pool size. |
443 |
> |
* Returns a good size for worker array given pool size. |
444 |
|
* Currently requires size to be a power of two. |
445 |
|
*/ |
446 |
< |
private static int arraySizeFor(int ps) { |
447 |
< |
return ps <= 1? 1 : (1 << (32 - Integer.numberOfLeadingZeros(ps-1))); |
446 |
> |
private static int arraySizeFor(int poolSize) { |
447 |
> |
return (poolSize <= 1) ? 1 : |
448 |
> |
(1 << (32 - Integer.numberOfLeadingZeros(poolSize-1))); |
449 |
|
} |
450 |
|
|
451 |
|
/** |
452 |
< |
* Create or resize array if necessary to hold newLength |
452 |
> |
* Creates or resizes array if necessary to hold newLength. |
453 |
> |
* Call only under exclusion. |
454 |
> |
* |
455 |
|
* @return the array |
456 |
|
*/ |
457 |
|
private ForkJoinWorkerThread[] ensureWorkerArrayCapacity(int newLength) { |
465 |
|
} |
466 |
|
|
467 |
|
/** |
468 |
< |
* Try to shrink workers into smaller array after one or more terminate |
468 |
> |
* Tries to shrink workers into smaller array after one or more terminate. |
469 |
|
*/ |
470 |
|
private void tryShrinkWorkerArray() { |
471 |
|
ForkJoinWorkerThread[] ws = workers; |
472 |
< |
int len = ws.length; |
473 |
< |
int last = len - 1; |
474 |
< |
while (last >= 0 && ws[last] == null) |
475 |
< |
--last; |
476 |
< |
int newLength = arraySizeFor(last+1); |
477 |
< |
if (newLength < len) |
478 |
< |
workers = Arrays.copyOf(ws, newLength); |
472 |
> |
if (ws != null) { |
473 |
> |
int len = ws.length; |
474 |
> |
int last = len - 1; |
475 |
> |
while (last >= 0 && ws[last] == null) |
476 |
> |
--last; |
477 |
> |
int newLength = arraySizeFor(last+1); |
478 |
> |
if (newLength < len) |
479 |
> |
workers = Arrays.copyOf(ws, newLength); |
480 |
> |
} |
481 |
|
} |
482 |
|
|
483 |
|
/** |
484 |
< |
* Initial worker array and worker creation and startup. (This |
453 |
< |
* must be done under lock to avoid interference by some of the |
454 |
< |
* newly started threads while creating others.) |
484 |
> |
* Initializes workers if necessary. |
485 |
|
*/ |
486 |
< |
private void createAndStartInitialWorkers(int ps) { |
487 |
< |
final ReentrantLock lock = this.workerLock; |
488 |
< |
lock.lock(); |
489 |
< |
try { |
490 |
< |
ForkJoinWorkerThread[] ws = ensureWorkerArrayCapacity(ps); |
491 |
< |
for (int i = 0; i < ps; ++i) { |
492 |
< |
ForkJoinWorkerThread w = createWorker(i); |
493 |
< |
if (w != null) { |
494 |
< |
ws[i] = w; |
495 |
< |
w.start(); |
496 |
< |
updateWorkerCount(1); |
486 |
> |
final void ensureWorkerInitialization() { |
487 |
> |
ForkJoinWorkerThread[] ws = workers; |
488 |
> |
if (ws == null) { |
489 |
> |
final ReentrantLock lock = this.workerLock; |
490 |
> |
lock.lock(); |
491 |
> |
try { |
492 |
> |
ws = workers; |
493 |
> |
if (ws == null) { |
494 |
> |
int ps = parallelism; |
495 |
> |
ws = ensureWorkerArrayCapacity(ps); |
496 |
> |
for (int i = 0; i < ps; ++i) { |
497 |
> |
ForkJoinWorkerThread w = createWorker(i); |
498 |
> |
if (w != null) { |
499 |
> |
ws[i] = w; |
500 |
> |
w.start(); |
501 |
> |
updateWorkerCount(1); |
502 |
> |
} |
503 |
> |
} |
504 |
|
} |
505 |
+ |
} finally { |
506 |
+ |
lock.unlock(); |
507 |
|
} |
469 |
– |
} finally { |
470 |
– |
lock.unlock(); |
508 |
|
} |
509 |
|
} |
510 |
|
|
548 |
|
* Common code for execute, invoke and submit |
549 |
|
*/ |
550 |
|
private <T> void doSubmit(ForkJoinTask<T> task) { |
551 |
+ |
if (task == null) |
552 |
+ |
throw new NullPointerException(); |
553 |
|
if (isShutdown()) |
554 |
|
throw new RejectedExecutionException(); |
555 |
+ |
if (workers == null) |
556 |
+ |
ensureWorkerInitialization(); |
557 |
|
submissionQueue.offer(task); |
558 |
|
signalIdleWorkers(); |
559 |
|
} |
560 |
|
|
561 |
|
/** |
562 |
< |
* Performs the given task; returning its result upon completion |
562 |
> |
* Performs the given task, returning its result upon completion. |
563 |
> |
* |
564 |
|
* @param task the task |
565 |
|
* @return the task's result |
566 |
|
* @throws NullPointerException if task is null |
573 |
|
|
574 |
|
/** |
575 |
|
* Arranges for (asynchronous) execution of the given task. |
576 |
+ |
* |
577 |
|
* @param task the task |
578 |
|
* @throws NullPointerException if task is null |
579 |
|
* @throws RejectedExecutionException if pool is shut down |
585 |
|
// AbstractExecutorService methods |
586 |
|
|
587 |
|
public void execute(Runnable task) { |
588 |
< |
doSubmit(new AdaptedRunnable<Void>(task, null)); |
588 |
> |
ForkJoinTask<?> job; |
589 |
> |
if (task instanceof ForkJoinTask<?>) // avoid re-wrap |
590 |
> |
job = (ForkJoinTask<?>) task; |
591 |
> |
else |
592 |
> |
job = new AdaptedRunnable<Void>(task, null); |
593 |
> |
doSubmit(job); |
594 |
|
} |
595 |
|
|
596 |
|
public <T> ForkJoinTask<T> submit(Callable<T> task) { |
606 |
|
} |
607 |
|
|
608 |
|
public ForkJoinTask<?> submit(Runnable task) { |
609 |
< |
ForkJoinTask<Void> job = new AdaptedRunnable<Void>(task, null); |
609 |
> |
ForkJoinTask<?> job; |
610 |
> |
if (task instanceof ForkJoinTask<?>) // avoid re-wrap |
611 |
> |
job = (ForkJoinTask<?>) task; |
612 |
> |
else |
613 |
> |
job = new AdaptedRunnable<Void>(task, null); |
614 |
|
doSubmit(job); |
615 |
|
return job; |
616 |
|
} |
617 |
|
|
618 |
|
/** |
619 |
+ |
* Submits a ForkJoinTask for execution. |
620 |
+ |
* |
621 |
+ |
* @param task the task to submit |
622 |
+ |
* @return the task |
623 |
+ |
* @throws RejectedExecutionException if the task cannot be |
624 |
+ |
* scheduled for execution |
625 |
+ |
* @throws NullPointerException if the task is null |
626 |
+ |
*/ |
627 |
+ |
public <T> ForkJoinTask<T> submit(ForkJoinTask<T> task) { |
628 |
+ |
doSubmit(task); |
629 |
+ |
return task; |
630 |
+ |
} |
631 |
+ |
|
632 |
+ |
/** |
633 |
|
* Adaptor for Runnables. This implements RunnableFuture |
634 |
< |
* to be compliant with AbstractExecutorService constraints |
634 |
> |
* to be compliant with AbstractExecutorService constraints. |
635 |
|
*/ |
636 |
|
static final class AdaptedRunnable<T> extends ForkJoinTask<T> |
637 |
|
implements RunnableFuture<T> { |
651 |
|
return true; |
652 |
|
} |
653 |
|
public void run() { invoke(); } |
654 |
+ |
private static final long serialVersionUID = 5232453952276885070L; |
655 |
|
} |
656 |
|
|
657 |
|
/** |
680 |
|
} |
681 |
|
} |
682 |
|
public void run() { invoke(); } |
683 |
+ |
private static final long serialVersionUID = 2838392045355241008L; |
684 |
|
} |
685 |
|
|
686 |
|
public <T> List<Future<T>> invokeAll(Collection<? extends Callable<T>> tasks) { |
687 |
< |
ArrayList<ForkJoinTask<T>> ts = |
687 |
> |
ArrayList<ForkJoinTask<T>> forkJoinTasks = |
688 |
|
new ArrayList<ForkJoinTask<T>>(tasks.size()); |
689 |
< |
for (Callable<T> c : tasks) |
690 |
< |
ts.add(new AdaptedCallable<T>(c)); |
691 |
< |
invoke(new InvokeAll<T>(ts)); |
692 |
< |
return (List<Future<T>>)(List)ts; |
689 |
> |
for (Callable<T> task : tasks) |
690 |
> |
forkJoinTasks.add(new AdaptedCallable<T>(task)); |
691 |
> |
invoke(new InvokeAll<T>(forkJoinTasks)); |
692 |
> |
|
693 |
> |
@SuppressWarnings({"unchecked", "rawtypes"}) |
694 |
> |
List<Future<T>> futures = (List<Future<T>>) (List) forkJoinTasks; |
695 |
> |
return futures; |
696 |
|
} |
697 |
|
|
698 |
|
static final class InvokeAll<T> extends RecursiveAction { |
699 |
|
final ArrayList<ForkJoinTask<T>> tasks; |
700 |
|
InvokeAll(ArrayList<ForkJoinTask<T>> tasks) { this.tasks = tasks; } |
701 |
|
public void compute() { |
702 |
< |
try { invokeAll(tasks); } catch(Exception ignore) {} |
702 |
> |
try { invokeAll(tasks); } |
703 |
> |
catch (Exception ignore) {} |
704 |
|
} |
705 |
+ |
private static final long serialVersionUID = -7914297376763021607L; |
706 |
|
} |
707 |
|
|
708 |
|
// Configuration and status settings and queries |
709 |
|
|
710 |
|
/** |
711 |
< |
* Returns the factory used for constructing new workers |
711 |
> |
* Returns the factory used for constructing new workers. |
712 |
|
* |
713 |
|
* @return the factory used for constructing new workers |
714 |
|
*/ |
719 |
|
/** |
720 |
|
* Returns the handler for internal worker threads that terminate |
721 |
|
* due to unrecoverable errors encountered while executing tasks. |
722 |
< |
* @return the handler, or null if none |
722 |
> |
* |
723 |
> |
* @return the handler, or {@code null} if none |
724 |
|
*/ |
725 |
|
public Thread.UncaughtExceptionHandler getUncaughtExceptionHandler() { |
726 |
|
Thread.UncaughtExceptionHandler h; |
741 |
|
* as handler. |
742 |
|
* |
743 |
|
* @param h the new handler |
744 |
< |
* @return the old handler, or null if none |
744 |
> |
* @return the old handler, or {@code null} if none |
745 |
|
* @throws SecurityException if a security manager exists and |
746 |
|
* the caller is not permitted to modify threads |
747 |
|
* because it does not hold {@link |
748 |
< |
* java.lang.RuntimePermission}<code>("modifyThread")</code>, |
748 |
> |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
749 |
|
*/ |
750 |
|
public Thread.UncaughtExceptionHandler |
751 |
|
setUncaughtExceptionHandler(Thread.UncaughtExceptionHandler h) { |
757 |
|
old = ueh; |
758 |
|
ueh = h; |
759 |
|
ForkJoinWorkerThread[] ws = workers; |
760 |
< |
for (int i = 0; i < ws.length; ++i) { |
761 |
< |
ForkJoinWorkerThread w = ws[i]; |
762 |
< |
if (w != null) |
763 |
< |
w.setUncaughtExceptionHandler(h); |
760 |
> |
if (ws != null) { |
761 |
> |
for (int i = 0; i < ws.length; ++i) { |
762 |
> |
ForkJoinWorkerThread w = ws[i]; |
763 |
> |
if (w != null) |
764 |
> |
w.setUncaughtExceptionHandler(h); |
765 |
> |
} |
766 |
|
} |
767 |
|
} finally { |
768 |
|
lock.unlock(); |
772 |
|
|
773 |
|
|
774 |
|
/** |
775 |
< |
* Sets the target paralleism level of this pool. |
775 |
> |
* Sets the target parallelism level of this pool. |
776 |
> |
* |
777 |
|
* @param parallelism the target parallelism |
778 |
|
* @throws IllegalArgumentException if parallelism less than or |
779 |
< |
* equal to zero or greater than maximum size bounds. |
779 |
> |
* equal to zero or greater than maximum size bounds |
780 |
|
* @throws SecurityException if a security manager exists and |
781 |
|
* the caller is not permitted to modify threads |
782 |
|
* because it does not hold {@link |
783 |
< |
* java.lang.RuntimePermission}<code>("modifyThread")</code>, |
783 |
> |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
784 |
|
*/ |
785 |
|
public void setParallelism(int parallelism) { |
786 |
|
checkPermission(); |
815 |
|
/** |
816 |
|
* Returns the number of worker threads that have started but not |
817 |
|
* yet terminated. This result returned by this method may differ |
818 |
< |
* from <code>getParallelism</code> when threads are created to |
818 |
> |
* from {@code getParallelism} when threads are created to |
819 |
|
* maintain parallelism when others are cooperatively blocked. |
820 |
|
* |
821 |
|
* @return the number of worker threads |
827 |
|
/** |
828 |
|
* Returns the maximum number of threads allowed to exist in the |
829 |
|
* pool, even if there are insufficient unblocked running threads. |
830 |
+ |
* |
831 |
|
* @return the maximum |
832 |
|
*/ |
833 |
|
public int getMaximumPoolSize() { |
839 |
|
* pool, even if there are insufficient unblocked running threads. |
840 |
|
* Setting this value has no effect on current pool size. It |
841 |
|
* controls construction of new threads. |
842 |
+ |
* |
843 |
|
* @throws IllegalArgumentException if negative or greater then |
844 |
< |
* internal implementation limit. |
844 |
> |
* internal implementation limit |
845 |
|
*/ |
846 |
|
public void setMaximumPoolSize(int newMax) { |
847 |
|
if (newMax < 0 || newMax > MAX_THREADS) |
851 |
|
|
852 |
|
|
853 |
|
/** |
854 |
< |
* Returns true if this pool dynamically maintains its target |
855 |
< |
* parallelism level. If false, new threads are added only to |
856 |
< |
* avoid possible starvation. |
857 |
< |
* This setting is by default true; |
858 |
< |
* @return true if maintains parallelism |
854 |
> |
* Returns {@code true} if this pool dynamically maintains its |
855 |
> |
* target parallelism level. If false, new threads are added only |
856 |
> |
* to avoid possible starvation. This setting is by default true. |
857 |
> |
* |
858 |
> |
* @return {@code true} if maintains parallelism |
859 |
|
*/ |
860 |
|
public boolean getMaintainsParallelism() { |
861 |
|
return maintainsParallelism; |
865 |
|
* Sets whether this pool dynamically maintains its target |
866 |
|
* parallelism level. If false, new threads are added only to |
867 |
|
* avoid possible starvation. |
868 |
< |
* @param enable true to maintains parallelism |
868 |
> |
* |
869 |
> |
* @param enable {@code true} to maintain parallelism |
870 |
|
*/ |
871 |
|
public void setMaintainsParallelism(boolean enable) { |
872 |
|
maintainsParallelism = enable; |
873 |
|
} |
874 |
|
|
875 |
|
/** |
876 |
+ |
* Establishes local first-in-first-out scheduling mode for forked |
877 |
+ |
* tasks that are never joined. This mode may be more appropriate |
878 |
+ |
* than default locally stack-based mode in applications in which |
879 |
+ |
* worker threads only process asynchronous tasks. This method is |
880 |
+ |
* designed to be invoked only when pool is quiescent, and |
881 |
+ |
* typically only before any tasks are submitted. The effects of |
882 |
+ |
* invocations at other times may be unpredictable. |
883 |
+ |
* |
884 |
+ |
* @param async if true, use locally FIFO scheduling |
885 |
+ |
* @return the previous mode |
886 |
+ |
*/ |
887 |
+ |
public boolean setAsyncMode(boolean async) { |
888 |
+ |
boolean oldMode = locallyFifo; |
889 |
+ |
locallyFifo = async; |
890 |
+ |
ForkJoinWorkerThread[] ws = workers; |
891 |
+ |
if (ws != null) { |
892 |
+ |
for (int i = 0; i < ws.length; ++i) { |
893 |
+ |
ForkJoinWorkerThread t = ws[i]; |
894 |
+ |
if (t != null) |
895 |
+ |
t.setAsyncMode(async); |
896 |
+ |
} |
897 |
+ |
} |
898 |
+ |
return oldMode; |
899 |
+ |
} |
900 |
+ |
|
901 |
+ |
/** |
902 |
+ |
* Returns {@code true} if this pool uses local first-in-first-out |
903 |
+ |
* scheduling mode for forked tasks that are never joined. |
904 |
+ |
* |
905 |
+ |
* @return {@code true} if this pool uses async mode |
906 |
+ |
*/ |
907 |
+ |
public boolean getAsyncMode() { |
908 |
+ |
return locallyFifo; |
909 |
+ |
} |
910 |
+ |
|
911 |
+ |
/** |
912 |
|
* Returns an estimate of the number of worker threads that are |
913 |
|
* not blocked waiting to join tasks or for other managed |
914 |
|
* synchronization. |
923 |
|
* Returns an estimate of the number of threads that are currently |
924 |
|
* stealing or executing tasks. This method may overestimate the |
925 |
|
* number of active threads. |
926 |
< |
* @return the number of active threads. |
926 |
> |
* |
927 |
> |
* @return the number of active threads |
928 |
|
*/ |
929 |
|
public int getActiveThreadCount() { |
930 |
|
return activeCountOf(runControl); |
934 |
|
* Returns an estimate of the number of threads that are currently |
935 |
|
* idle waiting for tasks. This method may underestimate the |
936 |
|
* number of idle threads. |
937 |
< |
* @return the number of idle threads. |
937 |
> |
* |
938 |
> |
* @return the number of idle threads |
939 |
|
*/ |
940 |
|
final int getIdleThreadCount() { |
941 |
|
int c = runningCountOf(workerCounts) - activeCountOf(runControl); |
942 |
< |
return (c <= 0)? 0 : c; |
942 |
> |
return (c <= 0) ? 0 : c; |
943 |
|
} |
944 |
|
|
945 |
|
/** |
946 |
< |
* Returns true if all worker threads are currently idle. An idle |
947 |
< |
* worker is one that cannot obtain a task to execute because none |
948 |
< |
* are available to steal from other threads, and there are no |
949 |
< |
* pending submissions to the pool. This method is conservative: |
950 |
< |
* It might not return true immediately upon idleness of all |
951 |
< |
* threads, but will eventually become true if threads remain |
952 |
< |
* inactive. |
953 |
< |
* @return true if all threads are currently idle |
946 |
> |
* Returns {@code true} if all worker threads are currently idle. |
947 |
> |
* An idle worker is one that cannot obtain a task to execute |
948 |
> |
* because none are available to steal from other threads, and |
949 |
> |
* there are no pending submissions to the pool. This method is |
950 |
> |
* conservative; it might not return {@code true} immediately upon |
951 |
> |
* idleness of all threads, but will eventually become true if |
952 |
> |
* threads remain inactive. |
953 |
> |
* |
954 |
> |
* @return {@code true} if all threads are currently idle |
955 |
|
*/ |
956 |
|
public boolean isQuiescent() { |
957 |
|
return activeCountOf(runControl) == 0; |
962 |
|
* one thread's work queue by another. The reported value |
963 |
|
* underestimates the actual total number of steals when the pool |
964 |
|
* is not quiescent. This value may be useful for monitoring and |
965 |
< |
* tuning fork/join programs: In general, steal counts should be |
965 |
> |
* tuning fork/join programs: in general, steal counts should be |
966 |
|
* high enough to keep threads busy, but low enough to avoid |
967 |
|
* overhead and contention across threads. |
968 |
< |
* @return the number of steals. |
968 |
> |
* |
969 |
> |
* @return the number of steals |
970 |
|
*/ |
971 |
|
public long getStealCount() { |
972 |
|
return stealCount.get(); |
973 |
|
} |
974 |
|
|
975 |
|
/** |
976 |
< |
* Accumulate steal count from a worker. Call only |
977 |
< |
* when worker known to be idle. |
976 |
> |
* Accumulates steal count from a worker. |
977 |
> |
* Call only when worker known to be idle. |
978 |
|
*/ |
979 |
|
private void updateStealCount(ForkJoinWorkerThread w) { |
980 |
|
int sc = w.getAndClearStealCount(); |
989 |
|
* an approximation, obtained by iterating across all threads in |
990 |
|
* the pool. This method may be useful for tuning task |
991 |
|
* granularities. |
992 |
< |
* @return the number of queued tasks. |
992 |
> |
* |
993 |
> |
* @return the number of queued tasks |
994 |
|
*/ |
995 |
|
public long getQueuedTaskCount() { |
996 |
|
long count = 0; |
997 |
|
ForkJoinWorkerThread[] ws = workers; |
998 |
< |
for (int i = 0; i < ws.length; ++i) { |
999 |
< |
ForkJoinWorkerThread t = ws[i]; |
1000 |
< |
if (t != null) |
1001 |
< |
count += t.getQueueSize(); |
998 |
> |
if (ws != null) { |
999 |
> |
for (int i = 0; i < ws.length; ++i) { |
1000 |
> |
ForkJoinWorkerThread t = ws[i]; |
1001 |
> |
if (t != null) |
1002 |
> |
count += t.getQueueSize(); |
1003 |
> |
} |
1004 |
|
} |
1005 |
|
return count; |
1006 |
|
} |
1009 |
|
* Returns an estimate of the number tasks submitted to this pool |
1010 |
|
* that have not yet begun executing. This method takes time |
1011 |
|
* proportional to the number of submissions. |
1012 |
< |
* @return the number of queued submissions. |
1012 |
> |
* |
1013 |
> |
* @return the number of queued submissions |
1014 |
|
*/ |
1015 |
|
public int getQueuedSubmissionCount() { |
1016 |
|
return submissionQueue.size(); |
1017 |
|
} |
1018 |
|
|
1019 |
|
/** |
1020 |
< |
* Returns true if there are any tasks submitted to this pool |
1021 |
< |
* that have not yet begun executing. |
1022 |
< |
* @return <code>true</code> if there are any queued submissions. |
1020 |
> |
* Returns {@code true} if there are any tasks submitted to this |
1021 |
> |
* pool that have not yet begun executing. |
1022 |
> |
* |
1023 |
> |
* @return {@code true} if there are any queued submissions |
1024 |
|
*/ |
1025 |
|
public boolean hasQueuedSubmissions() { |
1026 |
|
return !submissionQueue.isEmpty(); |
1030 |
|
* Removes and returns the next unexecuted submission if one is |
1031 |
|
* available. This method may be useful in extensions to this |
1032 |
|
* class that re-assign work in systems with multiple pools. |
1033 |
< |
* @return the next submission, or null if none |
1033 |
> |
* |
1034 |
> |
* @return the next submission, or {@code null} if none |
1035 |
|
*/ |
1036 |
|
protected ForkJoinTask<?> pollSubmission() { |
1037 |
|
return submissionQueue.poll(); |
1038 |
|
} |
1039 |
|
|
1040 |
|
/** |
1041 |
+ |
* Removes all available unexecuted submitted and forked tasks |
1042 |
+ |
* from scheduling queues and adds them to the given collection, |
1043 |
+ |
* without altering their execution status. These may include |
1044 |
+ |
* artificially generated or wrapped tasks. This method is designed |
1045 |
+ |
* to be invoked only when the pool is known to be |
1046 |
+ |
* quiescent. Invocations at other times may not remove all |
1047 |
+ |
* tasks. A failure encountered while attempting to add elements |
1048 |
+ |
* to collection {@code c} may result in elements being in |
1049 |
+ |
* neither, either or both collections when the associated |
1050 |
+ |
* exception is thrown. The behavior of this operation is |
1051 |
+ |
* undefined if the specified collection is modified while the |
1052 |
+ |
* operation is in progress. |
1053 |
+ |
* |
1054 |
+ |
* @param c the collection to transfer elements into |
1055 |
+ |
* @return the number of elements transferred |
1056 |
+ |
*/ |
1057 |
+ |
protected int drainTasksTo(Collection<ForkJoinTask<?>> c) { |
1058 |
+ |
int n = submissionQueue.drainTo(c); |
1059 |
+ |
ForkJoinWorkerThread[] ws = workers; |
1060 |
+ |
if (ws != null) { |
1061 |
+ |
for (int i = 0; i < ws.length; ++i) { |
1062 |
+ |
ForkJoinWorkerThread w = ws[i]; |
1063 |
+ |
if (w != null) |
1064 |
+ |
n += w.drainTasksTo(c); |
1065 |
+ |
} |
1066 |
+ |
} |
1067 |
+ |
return n; |
1068 |
+ |
} |
1069 |
+ |
|
1070 |
+ |
/** |
1071 |
|
* Returns a string identifying this pool, as well as its state, |
1072 |
|
* including indications of run state, parallelism level, and |
1073 |
|
* worker and task counts. |
1111 |
|
* Invocation has no additional effect if already shut down. |
1112 |
|
* Tasks that are in the process of being submitted concurrently |
1113 |
|
* during the course of this method may or may not be rejected. |
1114 |
+ |
* |
1115 |
|
* @throws SecurityException if a security manager exists and |
1116 |
|
* the caller is not permitted to modify threads |
1117 |
|
* because it does not hold {@link |
1118 |
< |
* java.lang.RuntimePermission}<code>("modifyThread")</code>, |
1118 |
> |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
1119 |
|
*/ |
1120 |
|
public void shutdown() { |
1121 |
|
checkPermission(); |
1129 |
|
* waiting tasks. Tasks that are in the process of being |
1130 |
|
* submitted or executed concurrently during the course of this |
1131 |
|
* method may or may not be rejected. Unlike some other executors, |
1132 |
< |
* this method cancels rather than collects non-executed tasks, |
1133 |
< |
* so always returns an empty list. |
1132 |
> |
* this method cancels rather than collects non-executed tasks |
1133 |
> |
* upon termination, so always returns an empty list. However, you |
1134 |
> |
* can use method {@code drainTasksTo} before invoking this |
1135 |
> |
* method to transfer unexecuted tasks to another collection. |
1136 |
> |
* |
1137 |
|
* @return an empty list |
1138 |
|
* @throws SecurityException if a security manager exists and |
1139 |
|
* the caller is not permitted to modify threads |
1140 |
|
* because it does not hold {@link |
1141 |
< |
* java.lang.RuntimePermission}<code>("modifyThread")</code>, |
1141 |
> |
* java.lang.RuntimePermission}{@code ("modifyThread")} |
1142 |
|
*/ |
1143 |
|
public List<Runnable> shutdownNow() { |
1144 |
|
checkPermission(); |
1147 |
|
} |
1148 |
|
|
1149 |
|
/** |
1150 |
< |
* Returns <code>true</code> if all tasks have completed following shut down. |
1150 |
> |
* Returns {@code true} if all tasks have completed following shut down. |
1151 |
|
* |
1152 |
< |
* @return <code>true</code> if all tasks have completed following shut down |
1152 |
> |
* @return {@code true} if all tasks have completed following shut down |
1153 |
|
*/ |
1154 |
|
public boolean isTerminated() { |
1155 |
|
return runStateOf(runControl) == TERMINATED; |
1156 |
|
} |
1157 |
|
|
1158 |
|
/** |
1159 |
< |
* Returns <code>true</code> if the process of termination has |
1159 |
> |
* Returns {@code true} if the process of termination has |
1160 |
|
* commenced but possibly not yet completed. |
1161 |
|
* |
1162 |
< |
* @return <code>true</code> if terminating |
1162 |
> |
* @return {@code true} if terminating |
1163 |
|
*/ |
1164 |
|
public boolean isTerminating() { |
1165 |
|
return runStateOf(runControl) >= TERMINATING; |
1166 |
|
} |
1167 |
|
|
1168 |
|
/** |
1169 |
< |
* Returns <code>true</code> if this pool has been shut down. |
1169 |
> |
* Returns {@code true} if this pool has been shut down. |
1170 |
|
* |
1171 |
< |
* @return <code>true</code> if this pool has been shut down |
1171 |
> |
* @return {@code true} if this pool has been shut down |
1172 |
|
*/ |
1173 |
|
public boolean isShutdown() { |
1174 |
|
return runStateOf(runControl) >= SHUTDOWN; |
1181 |
|
* |
1182 |
|
* @param timeout the maximum time to wait |
1183 |
|
* @param unit the time unit of the timeout argument |
1184 |
< |
* @return <code>true</code> if this executor terminated and |
1185 |
< |
* <code>false</code> if the timeout elapsed before termination |
1184 |
> |
* @return {@code true} if this executor terminated and |
1185 |
> |
* {@code false} if the timeout elapsed before termination |
1186 |
|
* @throws InterruptedException if interrupted while waiting |
1187 |
|
*/ |
1188 |
|
public boolean awaitTermination(long timeout, TimeUnit unit) |
1206 |
|
// Shutdown and termination support |
1207 |
|
|
1208 |
|
/** |
1209 |
< |
* Callback from terminating worker. Null out the corresponding |
1210 |
< |
* workers slot, and if terminating, try to terminate, else try to |
1211 |
< |
* shrink workers array. |
1209 |
> |
* Callback from terminating worker. Nulls out the corresponding |
1210 |
> |
* workers slot, and if terminating, tries to terminate; else |
1211 |
> |
* tries to shrink workers array. |
1212 |
> |
* |
1213 |
|
* @param w the worker |
1214 |
|
*/ |
1215 |
|
final void workerTerminated(ForkJoinWorkerThread w) { |
1219 |
|
lock.lock(); |
1220 |
|
try { |
1221 |
|
ForkJoinWorkerThread[] ws = workers; |
1222 |
< |
int idx = w.poolIndex; |
1223 |
< |
if (idx >= 0 && idx < ws.length && ws[idx] == w) |
1224 |
< |
ws[idx] = null; |
1225 |
< |
if (totalCountOf(workerCounts) == 0) { |
1226 |
< |
terminate(); // no-op if already terminating |
1227 |
< |
transitionRunStateTo(TERMINATED); |
1228 |
< |
termination.signalAll(); |
1229 |
< |
} |
1230 |
< |
else if (!isTerminating()) { |
1231 |
< |
tryShrinkWorkerArray(); |
1232 |
< |
tryResumeSpare(true); // allow replacement |
1222 |
> |
if (ws != null) { |
1223 |
> |
int idx = w.poolIndex; |
1224 |
> |
if (idx >= 0 && idx < ws.length && ws[idx] == w) |
1225 |
> |
ws[idx] = null; |
1226 |
> |
if (totalCountOf(workerCounts) == 0) { |
1227 |
> |
terminate(); // no-op if already terminating |
1228 |
> |
transitionRunStateTo(TERMINATED); |
1229 |
> |
termination.signalAll(); |
1230 |
> |
} |
1231 |
> |
else if (!isTerminating()) { |
1232 |
> |
tryShrinkWorkerArray(); |
1233 |
> |
tryResumeSpare(true); // allow replacement |
1234 |
> |
} |
1235 |
|
} |
1236 |
|
} finally { |
1237 |
|
lock.unlock(); |
1240 |
|
} |
1241 |
|
|
1242 |
|
/** |
1243 |
< |
* Initiate termination. |
1243 |
> |
* Initiates termination. |
1244 |
|
*/ |
1245 |
|
private void terminate() { |
1246 |
|
if (transitionRunStateTo(TERMINATING)) { |
1255 |
|
} |
1256 |
|
|
1257 |
|
/** |
1258 |
< |
* Possibly terminate when on shutdown state |
1258 |
> |
* Possibly terminates when on shutdown state. |
1259 |
|
*/ |
1260 |
|
private void terminateOnShutdown() { |
1261 |
|
if (!hasQueuedSubmissions() && canTerminateOnShutdown(runControl)) |
1263 |
|
} |
1264 |
|
|
1265 |
|
/** |
1266 |
< |
* Clear out and cancel submissions |
1266 |
> |
* Clears out and cancels submissions. |
1267 |
|
*/ |
1268 |
|
private void cancelQueuedSubmissions() { |
1269 |
|
ForkJoinTask<?> task; |
1272 |
|
} |
1273 |
|
|
1274 |
|
/** |
1275 |
< |
* Clean out worker queues. |
1275 |
> |
* Cleans out worker queues. |
1276 |
|
*/ |
1277 |
|
private void cancelQueuedWorkerTasks() { |
1278 |
|
final ReentrantLock lock = this.workerLock; |
1279 |
|
lock.lock(); |
1280 |
|
try { |
1281 |
|
ForkJoinWorkerThread[] ws = workers; |
1282 |
< |
for (int i = 0; i < ws.length; ++i) { |
1283 |
< |
ForkJoinWorkerThread t = ws[i]; |
1284 |
< |
if (t != null) |
1285 |
< |
t.cancelTasks(); |
1282 |
> |
if (ws != null) { |
1283 |
> |
for (int i = 0; i < ws.length; ++i) { |
1284 |
> |
ForkJoinWorkerThread t = ws[i]; |
1285 |
> |
if (t != null) |
1286 |
> |
t.cancelTasks(); |
1287 |
> |
} |
1288 |
|
} |
1289 |
|
} finally { |
1290 |
|
lock.unlock(); |
1292 |
|
} |
1293 |
|
|
1294 |
|
/** |
1295 |
< |
* Set each worker's status to terminating. Requires lock to avoid |
1296 |
< |
* conflicts with add/remove |
1295 |
> |
* Sets each worker's status to terminating. Requires lock to avoid |
1296 |
> |
* conflicts with add/remove. |
1297 |
|
*/ |
1298 |
|
private void stopAllWorkers() { |
1299 |
|
final ReentrantLock lock = this.workerLock; |
1300 |
|
lock.lock(); |
1301 |
|
try { |
1302 |
|
ForkJoinWorkerThread[] ws = workers; |
1303 |
< |
for (int i = 0; i < ws.length; ++i) { |
1304 |
< |
ForkJoinWorkerThread t = ws[i]; |
1305 |
< |
if (t != null) |
1306 |
< |
t.shutdownNow(); |
1303 |
> |
if (ws != null) { |
1304 |
> |
for (int i = 0; i < ws.length; ++i) { |
1305 |
> |
ForkJoinWorkerThread t = ws[i]; |
1306 |
> |
if (t != null) |
1307 |
> |
t.shutdownNow(); |
1308 |
> |
} |
1309 |
|
} |
1310 |
|
} finally { |
1311 |
|
lock.unlock(); |
1313 |
|
} |
1314 |
|
|
1315 |
|
/** |
1316 |
< |
* Interrupt all unterminated workers. This is not required for |
1316 |
> |
* Interrupts all unterminated workers. This is not required for |
1317 |
|
* sake of internal control, but may help unstick user code during |
1318 |
|
* shutdown. |
1319 |
|
*/ |
1322 |
|
lock.lock(); |
1323 |
|
try { |
1324 |
|
ForkJoinWorkerThread[] ws = workers; |
1325 |
< |
for (int i = 0; i < ws.length; ++i) { |
1326 |
< |
ForkJoinWorkerThread t = ws[i]; |
1327 |
< |
if (t != null && !t.isTerminated()) { |
1328 |
< |
try { |
1329 |
< |
t.interrupt(); |
1330 |
< |
} catch (SecurityException ignore) { |
1325 |
> |
if (ws != null) { |
1326 |
> |
for (int i = 0; i < ws.length; ++i) { |
1327 |
> |
ForkJoinWorkerThread t = ws[i]; |
1328 |
> |
if (t != null && !t.isTerminated()) { |
1329 |
> |
try { |
1330 |
> |
t.interrupt(); |
1331 |
> |
} catch (SecurityException ignore) { |
1332 |
> |
} |
1333 |
|
} |
1334 |
|
} |
1335 |
|
} |
1383 |
|
} |
1384 |
|
|
1385 |
|
/** |
1386 |
< |
* Wake up waiter, returning false if known to already |
1386 |
> |
* Wakes up waiter, returning false if known to already |
1387 |
|
*/ |
1388 |
|
boolean signal() { |
1389 |
|
ForkJoinWorkerThread t = thread; |
1395 |
|
} |
1396 |
|
|
1397 |
|
/** |
1398 |
< |
* Await release on sync |
1398 |
> |
* Awaits release on sync. |
1399 |
|
*/ |
1400 |
|
void awaitSyncRelease(ForkJoinPool p) { |
1401 |
|
while (thread != null && !p.syncIsReleasable(this)) |
1403 |
|
} |
1404 |
|
|
1405 |
|
/** |
1406 |
< |
* Await resumption as spare |
1406 |
> |
* Awaits resumption as spare. |
1407 |
|
*/ |
1408 |
|
void awaitSpareRelease() { |
1409 |
|
while (thread != null) { |
1417 |
|
* Ensures that no thread is waiting for count to advance from the |
1418 |
|
* current value of eventCount read on entry to this method, by |
1419 |
|
* releasing waiting threads if necessary. |
1420 |
+ |
* |
1421 |
|
* @return the count |
1422 |
|
*/ |
1423 |
|
final long ensureSync() { |
1439 |
|
*/ |
1440 |
|
private void signalIdleWorkers() { |
1441 |
|
long c; |
1442 |
< |
do;while (!casEventCount(c = eventCount, c+1)); |
1442 |
> |
do {} while (!casEventCount(c = eventCount, c+1)); |
1443 |
|
ensureSync(); |
1444 |
|
} |
1445 |
|
|
1446 |
|
/** |
1447 |
< |
* Signal threads waiting to poll a task. Because method sync |
1447 |
> |
* Signals threads waiting to poll a task. Because method sync |
1448 |
|
* rechecks availability, it is OK to only proceed if queue |
1449 |
|
* appears to be non-empty, and OK to skip under contention to |
1450 |
|
* increment count (since some other thread succeeded). |
1463 |
|
* Waits until event count advances from last value held by |
1464 |
|
* caller, or if excess threads, caller is resumed as spare, or |
1465 |
|
* caller or pool is terminating. Updates caller's event on exit. |
1466 |
+ |
* |
1467 |
|
* @param w the calling worker thread |
1468 |
|
*/ |
1469 |
|
final void sync(ForkJoinWorkerThread w) { |
1473 |
|
long prev = w.lastEventCount; |
1474 |
|
WaitQueueNode node = null; |
1475 |
|
WaitQueueNode h; |
1476 |
< |
while (eventCount == prev && |
1476 |
> |
while (eventCount == prev && |
1477 |
|
((h = syncStack) == null || h.count == prev)) { |
1478 |
|
if (node == null) |
1479 |
|
node = new WaitQueueNode(prev, w); |
1491 |
|
} |
1492 |
|
|
1493 |
|
/** |
1494 |
< |
* Returns true if worker waiting on sync can proceed: |
1494 |
> |
* Returns {@code true} if worker waiting on sync can proceed: |
1495 |
|
* - on signal (thread == null) |
1496 |
|
* - on event count advance (winning race to notify vs signaller) |
1497 |
< |
* - on Interrupt |
1498 |
< |
* - if the first queued node, we find work available |
1499 |
< |
* If node was not signalled and event count not advanced on exit, |
1497 |
> |
* - on interrupt |
1498 |
> |
* - if the first queued node, we find work available |
1499 |
> |
* If node was not signalled and event count not advanced on exit, |
1500 |
|
* then we also help advance event count. |
1501 |
< |
* @return true if node can be released |
1501 |
> |
* |
1502 |
> |
* @return {@code true} if node can be released |
1503 |
|
*/ |
1504 |
|
final boolean syncIsReleasable(WaitQueueNode node) { |
1505 |
|
long prev = node.count; |
1518 |
|
} |
1519 |
|
|
1520 |
|
/** |
1521 |
< |
* Returns true if a new sync event occurred since last call to |
1522 |
< |
* sync or this method, if so, updating caller's count. |
1521 |
> |
* Returns {@code true} if a new sync event occurred since last |
1522 |
> |
* call to sync or this method, if so, updating caller's count. |
1523 |
|
*/ |
1524 |
|
final boolean hasNewSyncEvent(ForkJoinWorkerThread w) { |
1525 |
|
long lc = w.lastEventCount; |
1533 |
|
// Parallelism maintenance |
1534 |
|
|
1535 |
|
/** |
1536 |
< |
* Decrement running count; if too low, add spare. |
1536 |
> |
* Decrements running count; if too low, adds spare. |
1537 |
|
* |
1538 |
|
* Conceptually, all we need to do here is add or resume a |
1539 |
|
* spare thread when one is about to block (and remove or |
1540 |
|
* suspend it later when unblocked -- see suspendIfSpare). |
1541 |
|
* However, implementing this idea requires coping with |
1542 |
< |
* several problems: We have imperfect information about the |
1542 |
> |
* several problems: we have imperfect information about the |
1543 |
|
* states of threads. Some count updates can and usually do |
1544 |
|
* lag run state changes, despite arrangements to keep them |
1545 |
|
* accurate (for example, when possible, updating counts |
1553 |
|
* only be suspended or removed when they are idle, not |
1554 |
|
* immediately when they aren't needed. So adding threads will |
1555 |
|
* raise parallelism level for longer than necessary. Also, |
1556 |
< |
* FJ applications often enounter highly transient peaks when |
1556 |
> |
* FJ applications often encounter highly transient peaks when |
1557 |
|
* many threads are blocked joining, but for less time than it |
1558 |
|
* takes to create or resume spares. |
1559 |
|
* |
1562 |
|
* target counts, else create only to avoid starvation |
1563 |
|
* @return true if joinMe known to be done |
1564 |
|
*/ |
1565 |
< |
final boolean preJoin(ForkJoinTask<?> joinMe, boolean maintainParallelism) { |
1565 |
> |
final boolean preJoin(ForkJoinTask<?> joinMe, |
1566 |
> |
boolean maintainParallelism) { |
1567 |
|
maintainParallelism &= maintainsParallelism; // overrride |
1568 |
|
boolean dec = false; // true when running count decremented |
1569 |
|
while (spareStack == null || !tryResumeSpare(dec)) { |
1570 |
|
int counts = workerCounts; |
1571 |
< |
if (dec || (dec = casWorkerCounts(counts, --counts))) { // CAS cheat |
1571 |
> |
if (dec || (dec = casWorkerCounts(counts, --counts))) { |
1572 |
> |
// CAS cheat |
1573 |
|
if (!needSpare(counts, maintainParallelism)) |
1574 |
|
break; |
1575 |
|
if (joinMe.status < 0) |
1584 |
|
/** |
1585 |
|
* Same idea as preJoin |
1586 |
|
*/ |
1587 |
< |
final boolean preBlock(ManagedBlocker blocker, boolean maintainParallelism){ |
1587 |
> |
final boolean preBlock(ManagedBlocker blocker, |
1588 |
> |
boolean maintainParallelism) { |
1589 |
|
maintainParallelism &= maintainsParallelism; |
1590 |
|
boolean dec = false; |
1591 |
|
while (spareStack == null || !tryResumeSpare(dec)) { |
1603 |
|
} |
1604 |
|
|
1605 |
|
/** |
1606 |
< |
* Returns true if a spare thread appears to be needed. If |
1607 |
< |
* maintaining parallelism, returns true when the deficit in |
1606 |
> |
* Returns {@code true} if a spare thread appears to be needed. |
1607 |
> |
* If maintaining parallelism, returns true when the deficit in |
1608 |
|
* running threads is more than the surplus of total threads, and |
1609 |
|
* there is apparently some work to do. This self-limiting rule |
1610 |
|
* means that the more threads that have already been added, the |
1611 |
|
* less parallelism we will tolerate before adding another. |
1612 |
+ |
* |
1613 |
|
* @param counts current worker counts |
1614 |
|
* @param maintainParallelism try to maintain parallelism |
1615 |
|
*/ |
1622 |
|
return (tc < maxPoolSize && |
1623 |
|
(rc == 0 || totalSurplus < 0 || |
1624 |
|
(maintainParallelism && |
1625 |
< |
runningDeficit > totalSurplus && |
1625 |
> |
runningDeficit > totalSurplus && |
1626 |
|
ForkJoinWorkerThread.hasQueuedTasks(workers)))); |
1627 |
|
} |
1628 |
< |
|
1628 |
> |
|
1629 |
|
/** |
1630 |
< |
* Add a spare worker if lock available and no more than the |
1631 |
< |
* expected numbers of threads exist |
1630 |
> |
* Adds a spare worker if lock available and no more than the |
1631 |
> |
* expected numbers of threads exist. |
1632 |
> |
* |
1633 |
|
* @return true if successful |
1634 |
|
*/ |
1635 |
|
private boolean tryAddSpare(int expectedCounts) { |
1662 |
|
} |
1663 |
|
|
1664 |
|
/** |
1665 |
< |
* Add the kth spare worker. On entry, pool coounts are already |
1665 |
> |
* Adds the kth spare worker. On entry, pool counts are already |
1666 |
|
* adjusted to reflect addition. |
1667 |
|
*/ |
1668 |
|
private void createAndStartSpare(int k) { |
1684 |
|
} |
1685 |
|
|
1686 |
|
/** |
1687 |
< |
* Suspend calling thread w if there are excess threads. Called |
1688 |
< |
* only from sync. Spares are enqueued in a Treiber stack |
1689 |
< |
* using the same WaitQueueNodes as barriers. They are resumed |
1690 |
< |
* mainly in preJoin, but are also woken on pool events that |
1691 |
< |
* require all threads to check run state. |
1687 |
> |
* Suspends calling thread w if there are excess threads. Called |
1688 |
> |
* only from sync. Spares are enqueued in a Treiber stack using |
1689 |
> |
* the same WaitQueueNodes as barriers. They are resumed mainly |
1690 |
> |
* in preJoin, but are also woken on pool events that require all |
1691 |
> |
* threads to check run state. |
1692 |
> |
* |
1693 |
|
* @param w the caller |
1694 |
|
*/ |
1695 |
|
private boolean suspendIfSpare(ForkJoinWorkerThread w) { |
1700 |
|
node = new WaitQueueNode(0, w); |
1701 |
|
if (casWorkerCounts(s, s-1)) { // representation-dependent |
1702 |
|
// push onto stack |
1703 |
< |
do;while (!casSpareStack(node.next = spareStack, node)); |
1703 |
> |
do {} while (!casSpareStack(node.next = spareStack, node)); |
1704 |
|
// block until released by resumeSpare |
1705 |
|
node.awaitSpareRelease(); |
1706 |
|
return true; |
1710 |
|
} |
1711 |
|
|
1712 |
|
/** |
1713 |
< |
* Try to pop and resume a spare thread. |
1713 |
> |
* Tries to pop and resume a spare thread. |
1714 |
> |
* |
1715 |
|
* @param updateCount if true, increment running count on success |
1716 |
|
* @return true if successful |
1717 |
|
*/ |
1729 |
|
} |
1730 |
|
|
1731 |
|
/** |
1732 |
< |
* Pop and resume all spare threads. Same idea as ensureSync. |
1732 |
> |
* Pops and resumes all spare threads. Same idea as ensureSync. |
1733 |
> |
* |
1734 |
|
* @return true if any spares released |
1735 |
|
*/ |
1736 |
|
private boolean resumeAllSpares() { |
1748 |
|
} |
1749 |
|
|
1750 |
|
/** |
1751 |
< |
* Pop and shutdown excessive spare threads. Call only while |
1751 |
> |
* Pops and shuts down excessive spare threads. Call only while |
1752 |
|
* holding lock. This is not guaranteed to eliminate all excess |
1753 |
|
* threads, only those suspended as spares, which are the ones |
1754 |
|
* unlikely to be needed in the future. |
1773 |
|
/** |
1774 |
|
* Interface for extending managed parallelism for tasks running |
1775 |
|
* in ForkJoinPools. A ManagedBlocker provides two methods. |
1776 |
< |
* Method <code>isReleasable</code> must return true if blocking is not |
1777 |
< |
* necessary. Method <code>block</code> blocks the current thread |
1778 |
< |
* if necessary (perhaps internally invoking isReleasable before |
1779 |
< |
* actually blocking.). |
1776 |
> |
* Method {@code isReleasable} must return {@code true} if |
1777 |
> |
* blocking is not necessary. Method {@code block} blocks the |
1778 |
> |
* current thread if necessary (perhaps internally invoking |
1779 |
> |
* {@code isReleasable} before actually blocking.). |
1780 |
> |
* |
1781 |
|
* <p>For example, here is a ManagedBlocker based on a |
1782 |
|
* ReentrantLock: |
1783 |
< |
* <pre> |
1784 |
< |
* class ManagedLocker implements ManagedBlocker { |
1785 |
< |
* final ReentrantLock lock; |
1786 |
< |
* boolean hasLock = false; |
1787 |
< |
* ManagedLocker(ReentrantLock lock) { this.lock = lock; } |
1788 |
< |
* public boolean block() { |
1789 |
< |
* if (!hasLock) |
1790 |
< |
* lock.lock(); |
1791 |
< |
* return true; |
1792 |
< |
* } |
1793 |
< |
* public boolean isReleasable() { |
1794 |
< |
* return hasLock || (hasLock = lock.tryLock()); |
1614 |
< |
* } |
1783 |
> |
* <pre> {@code |
1784 |
> |
* class ManagedLocker implements ManagedBlocker { |
1785 |
> |
* final ReentrantLock lock; |
1786 |
> |
* boolean hasLock = false; |
1787 |
> |
* ManagedLocker(ReentrantLock lock) { this.lock = lock; } |
1788 |
> |
* public boolean block() { |
1789 |
> |
* if (!hasLock) |
1790 |
> |
* lock.lock(); |
1791 |
> |
* return true; |
1792 |
> |
* } |
1793 |
> |
* public boolean isReleasable() { |
1794 |
> |
* return hasLock || (hasLock = lock.tryLock()); |
1795 |
|
* } |
1796 |
< |
* </pre> |
1796 |
> |
* }}</pre> |
1797 |
|
*/ |
1798 |
|
public static interface ManagedBlocker { |
1799 |
|
/** |
1800 |
|
* Possibly blocks the current thread, for example waiting for |
1801 |
|
* a lock or condition. |
1802 |
< |
* @return true if no additional blocking is necessary (i.e., |
1803 |
< |
* if isReleasable would return true). |
1802 |
> |
* |
1803 |
> |
* @return {@code true} if no additional blocking is necessary |
1804 |
> |
* (i.e., if isReleasable would return true) |
1805 |
|
* @throws InterruptedException if interrupted while waiting |
1806 |
< |
* (the method is not required to do so, but is allowe to). |
1806 |
> |
* (the method is not required to do so, but is allowed to) |
1807 |
|
*/ |
1808 |
|
boolean block() throws InterruptedException; |
1809 |
|
|
1810 |
|
/** |
1811 |
< |
* Returns true if blocking is unnecessary. |
1811 |
> |
* Returns {@code true} if blocking is unnecessary. |
1812 |
|
*/ |
1813 |
|
boolean isReleasable(); |
1814 |
|
} |
1818 |
|
* is a ForkJoinWorkerThread, this method possibly arranges for a |
1819 |
|
* spare thread to be activated if necessary to ensure parallelism |
1820 |
|
* while the current thread is blocked. If |
1821 |
< |
* <code>maintainParallelism</code> is true and the pool supports |
1821 |
> |
* {@code maintainParallelism} is {@code true} and the pool supports |
1822 |
|
* it ({@link #getMaintainsParallelism}), this method attempts to |
1823 |
< |
* maintain the pool's nominal parallelism. Otherwise if activates |
1823 |
> |
* maintain the pool's nominal parallelism. Otherwise it activates |
1824 |
|
* a thread only if necessary to avoid complete starvation. This |
1825 |
|
* option may be preferable when blockages use timeouts, or are |
1826 |
|
* almost always brief. |
1827 |
|
* |
1828 |
|
* <p> If the caller is not a ForkJoinTask, this method is behaviorally |
1829 |
|
* equivalent to |
1830 |
< |
* <pre> |
1831 |
< |
* while (!blocker.isReleasable()) |
1832 |
< |
* if (blocker.block()) |
1833 |
< |
* return; |
1834 |
< |
* </pre> |
1830 |
> |
* <pre> {@code |
1831 |
> |
* while (!blocker.isReleasable()) |
1832 |
> |
* if (blocker.block()) |
1833 |
> |
* return; |
1834 |
> |
* }</pre> |
1835 |
|
* If the caller is a ForkJoinTask, then the pool may first |
1836 |
|
* be expanded to ensure parallelism, and later adjusted. |
1837 |
|
* |
1838 |
|
* @param blocker the blocker |
1839 |
< |
* @param maintainParallelism if true and supported by this pool, |
1840 |
< |
* attempt to maintain the pool's nominal parallelism; otherwise |
1841 |
< |
* activate a thread only if necessary to avoid complete |
1842 |
< |
* starvation. |
1843 |
< |
* @throws InterruptedException if blocker.block did so. |
1839 |
> |
* @param maintainParallelism if {@code true} and supported by |
1840 |
> |
* this pool, attempt to maintain the pool's nominal parallelism; |
1841 |
> |
* otherwise activate a thread only if necessary to avoid |
1842 |
> |
* complete starvation. |
1843 |
> |
* @throws InterruptedException if blocker.block did so |
1844 |
|
*/ |
1845 |
|
public static void managedBlock(ManagedBlocker blocker, |
1846 |
|
boolean maintainParallelism) |
1847 |
|
throws InterruptedException { |
1848 |
|
Thread t = Thread.currentThread(); |
1849 |
< |
ForkJoinPool pool = (t instanceof ForkJoinWorkerThread? |
1850 |
< |
((ForkJoinWorkerThread)t).pool : null); |
1849 |
> |
ForkJoinPool pool = ((t instanceof ForkJoinWorkerThread) ? |
1850 |
> |
((ForkJoinWorkerThread) t).pool : null); |
1851 |
|
if (!blocker.isReleasable()) { |
1852 |
|
try { |
1853 |
|
if (pool == null || |
1862 |
|
|
1863 |
|
private static void awaitBlocker(ManagedBlocker blocker) |
1864 |
|
throws InterruptedException { |
1865 |
< |
do;while (!blocker.isReleasable() && !blocker.block()); |
1865 |
> |
do {} while (!blocker.isReleasable() && !blocker.block()); |
1866 |
|
} |
1867 |
|
|
1868 |
|
// AbstractExecutorService overrides |
1869 |
|
|
1870 |
|
protected <T> RunnableFuture<T> newTaskFor(Runnable runnable, T value) { |
1871 |
< |
return new AdaptedRunnable(runnable, value); |
1871 |
> |
return new AdaptedRunnable<T>(runnable, value); |
1872 |
|
} |
1873 |
|
|
1874 |
|
protected <T> RunnableFuture<T> newTaskFor(Callable<T> callable) { |
1875 |
< |
return new AdaptedCallable(callable); |
1875 |
> |
return new AdaptedCallable<T>(callable); |
1876 |
|
} |
1877 |
|
|
1878 |
+ |
// Unsafe mechanics |
1879 |
|
|
1880 |
< |
// Temporary Unsafe mechanics for preliminary release |
1881 |
< |
|
1882 |
< |
static final Unsafe _unsafe; |
1883 |
< |
static final long eventCountOffset; |
1884 |
< |
static final long workerCountsOffset; |
1885 |
< |
static final long runControlOffset; |
1886 |
< |
static final long syncStackOffset; |
1887 |
< |
static final long spareStackOffset; |
1888 |
< |
|
1889 |
< |
static { |
1890 |
< |
try { |
1709 |
< |
if (ForkJoinPool.class.getClassLoader() != null) { |
1710 |
< |
Field f = Unsafe.class.getDeclaredField("theUnsafe"); |
1711 |
< |
f.setAccessible(true); |
1712 |
< |
_unsafe = (Unsafe)f.get(null); |
1713 |
< |
} |
1714 |
< |
else |
1715 |
< |
_unsafe = Unsafe.getUnsafe(); |
1716 |
< |
eventCountOffset = _unsafe.objectFieldOffset |
1717 |
< |
(ForkJoinPool.class.getDeclaredField("eventCount")); |
1718 |
< |
workerCountsOffset = _unsafe.objectFieldOffset |
1719 |
< |
(ForkJoinPool.class.getDeclaredField("workerCounts")); |
1720 |
< |
runControlOffset = _unsafe.objectFieldOffset |
1721 |
< |
(ForkJoinPool.class.getDeclaredField("runControl")); |
1722 |
< |
syncStackOffset = _unsafe.objectFieldOffset |
1723 |
< |
(ForkJoinPool.class.getDeclaredField("syncStack")); |
1724 |
< |
spareStackOffset = _unsafe.objectFieldOffset |
1725 |
< |
(ForkJoinPool.class.getDeclaredField("spareStack")); |
1726 |
< |
} catch (Exception e) { |
1727 |
< |
throw new RuntimeException("Could not initialize intrinsics", e); |
1728 |
< |
} |
1729 |
< |
} |
1880 |
> |
private static final sun.misc.Unsafe UNSAFE = getUnsafe(); |
1881 |
> |
private static final long eventCountOffset = |
1882 |
> |
objectFieldOffset("eventCount", ForkJoinPool.class); |
1883 |
> |
private static final long workerCountsOffset = |
1884 |
> |
objectFieldOffset("workerCounts", ForkJoinPool.class); |
1885 |
> |
private static final long runControlOffset = |
1886 |
> |
objectFieldOffset("runControl", ForkJoinPool.class); |
1887 |
> |
private static final long syncStackOffset = |
1888 |
> |
objectFieldOffset("syncStack",ForkJoinPool.class); |
1889 |
> |
private static final long spareStackOffset = |
1890 |
> |
objectFieldOffset("spareStack", ForkJoinPool.class); |
1891 |
|
|
1892 |
|
private boolean casEventCount(long cmp, long val) { |
1893 |
< |
return _unsafe.compareAndSwapLong(this, eventCountOffset, cmp, val); |
1893 |
> |
return UNSAFE.compareAndSwapLong(this, eventCountOffset, cmp, val); |
1894 |
|
} |
1895 |
|
private boolean casWorkerCounts(int cmp, int val) { |
1896 |
< |
return _unsafe.compareAndSwapInt(this, workerCountsOffset, cmp, val); |
1896 |
> |
return UNSAFE.compareAndSwapInt(this, workerCountsOffset, cmp, val); |
1897 |
|
} |
1898 |
|
private boolean casRunControl(int cmp, int val) { |
1899 |
< |
return _unsafe.compareAndSwapInt(this, runControlOffset, cmp, val); |
1899 |
> |
return UNSAFE.compareAndSwapInt(this, runControlOffset, cmp, val); |
1900 |
|
} |
1901 |
|
private boolean casSpareStack(WaitQueueNode cmp, WaitQueueNode val) { |
1902 |
< |
return _unsafe.compareAndSwapObject(this, spareStackOffset, cmp, val); |
1902 |
> |
return UNSAFE.compareAndSwapObject(this, spareStackOffset, cmp, val); |
1903 |
|
} |
1904 |
|
private boolean casBarrierStack(WaitQueueNode cmp, WaitQueueNode val) { |
1905 |
< |
return _unsafe.compareAndSwapObject(this, syncStackOffset, cmp, val); |
1905 |
> |
return UNSAFE.compareAndSwapObject(this, syncStackOffset, cmp, val); |
1906 |
> |
} |
1907 |
> |
|
1908 |
> |
private static long objectFieldOffset(String field, Class<?> klazz) { |
1909 |
> |
try { |
1910 |
> |
return UNSAFE.objectFieldOffset(klazz.getDeclaredField(field)); |
1911 |
> |
} catch (NoSuchFieldException e) { |
1912 |
> |
// Convert Exception to corresponding Error |
1913 |
> |
NoSuchFieldError error = new NoSuchFieldError(field); |
1914 |
> |
error.initCause(e); |
1915 |
> |
throw error; |
1916 |
> |
} |
1917 |
> |
} |
1918 |
> |
|
1919 |
> |
/** |
1920 |
> |
* Returns a sun.misc.Unsafe. Suitable for use in a 3rd party package. |
1921 |
> |
* Replace with a simple call to Unsafe.getUnsafe when integrating |
1922 |
> |
* into a jdk. |
1923 |
> |
* |
1924 |
> |
* @return a sun.misc.Unsafe |
1925 |
> |
*/ |
1926 |
> |
private static sun.misc.Unsafe getUnsafe() { |
1927 |
> |
try { |
1928 |
> |
return sun.misc.Unsafe.getUnsafe(); |
1929 |
> |
} catch (SecurityException se) { |
1930 |
> |
try { |
1931 |
> |
return java.security.AccessController.doPrivileged |
1932 |
> |
(new java.security |
1933 |
> |
.PrivilegedExceptionAction<sun.misc.Unsafe>() { |
1934 |
> |
public sun.misc.Unsafe run() throws Exception { |
1935 |
> |
java.lang.reflect.Field f = sun.misc |
1936 |
> |
.Unsafe.class.getDeclaredField("theUnsafe"); |
1937 |
> |
f.setAccessible(true); |
1938 |
> |
return (sun.misc.Unsafe) f.get(null); |
1939 |
> |
}}); |
1940 |
> |
} catch (java.security.PrivilegedActionException e) { |
1941 |
> |
throw new RuntimeException("Could not initialize intrinsics", |
1942 |
> |
e.getCause()); |
1943 |
> |
} |
1944 |
> |
} |
1945 |
|
} |
1946 |
|
} |