7 |
|
package jsr166y; |
8 |
|
|
9 |
|
import java.util.concurrent.*; |
10 |
– |
|
10 |
|
import java.util.ArrayList; |
11 |
|
import java.util.Arrays; |
12 |
|
import java.util.Collection; |
156 |
|
* links to try to find such a task. |
157 |
|
* |
158 |
|
* Compensating: Unless there are already enough live threads, |
159 |
< |
* method helpMaintainParallelism() may create or or |
159 |
> |
* method helpMaintainParallelism() may create or |
160 |
|
* re-activate a spare thread to compensate for blocked |
161 |
|
* joiners until they unblock. |
162 |
|
* |
300 |
|
* about the same time as another is needlessly being created. We |
301 |
|
* counteract this and related slop in part by requiring resumed |
302 |
|
* spares to immediately recheck (in preStep) to see whether they |
303 |
< |
* they should re-suspend. |
303 |
> |
* should re-suspend. |
304 |
|
* |
305 |
|
* 6. Killing off unneeded workers. A timeout mechanism is used to |
306 |
|
* shed unused workers: The oldest (first) event queue waiter uses |
317 |
|
* exactly #parallelism threads running, which is an impossible |
318 |
|
* task. We always need to create one when the number of running |
319 |
|
* threads would become zero and all workers are busy. Beyond |
320 |
< |
* this, we must rely on heuristics that work well in the the |
321 |
< |
* presence of transients phenomena such as GC stalls, dynamic |
320 |
> |
* this, we must rely on heuristics that work well in the |
321 |
> |
* presence of transient phenomena such as GC stalls, dynamic |
322 |
|
* compilation, and wake-up lags. These transients are extremely |
323 |
|
* common -- we are normally trying to fully saturate the CPUs on |
324 |
|
* a machine, so almost any activity other than running tasks |
345 |
|
* "while ((local = field) != 0)") which are usually the simplest |
346 |
|
* way to ensure the required read orderings (which are sometimes |
347 |
|
* critical). Also several occurrences of the unusual "do {} |
348 |
< |
* while(!cas...)" which is the simplest way to force an update of |
348 |
> |
* while (!cas...)" which is the simplest way to force an update of |
349 |
|
* a CAS'ed variable. There are also other coding oddities that |
350 |
|
* help some methods perform reasonably even when interpreted (not |
351 |
|
* compiled), at the expense of some messy constructions that |
429 |
|
|
430 |
|
/** |
431 |
|
* The wakeup interval (in nanoseconds) for the oldest worker |
432 |
< |
* worker waiting for an event invokes tryShutdownUnusedWorker to shrink |
432 |
> |
* waiting for an event invokes tryShutdownUnusedWorker to shrink |
433 |
|
* the number of workers. The exact value does not matter too |
434 |
|
* much, but should be long enough to slowly release resources |
435 |
|
* during long periods without use without disrupting normal use. |
673 |
|
} |
674 |
|
|
675 |
|
/** |
676 |
< |
* Nulls out record of worker in workers array |
676 |
> |
* Nulls out record of worker in workers array. |
677 |
|
*/ |
678 |
|
private void forgetWorker(ForkJoinWorkerThread w) { |
679 |
|
int idx = w.poolIndex; |
806 |
|
// Maintaining parallelism |
807 |
|
|
808 |
|
/** |
809 |
< |
* Pushes worker onto the spare stack |
809 |
> |
* Pushes worker onto the spare stack. |
810 |
|
*/ |
811 |
|
final void pushSpare(ForkJoinWorkerThread w) { |
812 |
|
int ns = (++w.spareCount << SPARE_COUNT_SHIFT) | (w.poolIndex + 1); |
831 |
|
UNSAFE.compareAndSwapInt(this, spareWaitersOffset, |
832 |
|
sw, w.nextSpare)) { |
833 |
|
int c; // increment running count before resume |
834 |
< |
do {} while(!UNSAFE.compareAndSwapInt |
835 |
< |
(this, workerCountsOffset, |
836 |
< |
c = workerCounts, c + ONE_RUNNING)); |
834 |
> |
do {} while (!UNSAFE.compareAndSwapInt |
835 |
> |
(this, workerCountsOffset, |
836 |
> |
c = workerCounts, c + ONE_RUNNING)); |
837 |
|
if (w.tryUnsuspend()) |
838 |
|
LockSupport.unpark(w); |
839 |
|
else // back out if w was shutdown |
984 |
|
w.lastEventCount = ec; // no need to wait |
985 |
|
break; |
986 |
|
} |
987 |
< |
else if (!(inactivate |= active)) |
987 |
> |
else if (!(inactivate |= active)) |
988 |
|
eventSync(w, wec); // must inactivate before sync |
989 |
|
} |
990 |
|
else |
1106 |
|
c = eventCount, c+1); |
1107 |
|
eventWaiters = 0L; // clobber lists |
1108 |
|
spareWaiters = 0; |
1109 |
< |
ForkJoinWorkerThread[] ws = workers; |
1111 |
< |
int n = ws.length; |
1112 |
< |
for (int i = 0; i < n; ++i) { |
1113 |
< |
ForkJoinWorkerThread w = ws[i]; |
1109 |
> |
for (ForkJoinWorkerThread w : workers) { |
1110 |
|
if (w != null) { |
1111 |
|
w.shutdown(); |
1112 |
|
if (passes > 0 && !w.isTerminated()) { |
1125 |
|
} |
1126 |
|
|
1127 |
|
/** |
1128 |
< |
* Clear out and cancel submissions, ignoring exceptions |
1128 |
> |
* Clears out and cancels submissions, ignoring exceptions. |
1129 |
|
*/ |
1130 |
|
private void cancelSubmissions() { |
1131 |
|
ForkJoinTask<?> task; |
1140 |
|
// misc support for ForkJoinWorkerThread |
1141 |
|
|
1142 |
|
/** |
1143 |
< |
* Returns pool number |
1143 |
> |
* Returns pool number. |
1144 |
|
*/ |
1145 |
|
final int getPoolNumber() { |
1146 |
|
return poolNumber; |
1147 |
|
} |
1148 |
|
|
1149 |
|
/** |
1150 |
< |
* Tries to accumulates steal count from a worker, clearing |
1151 |
< |
* the worker's value. |
1150 |
> |
* Tries to accumulate steal count from a worker, clearing |
1151 |
> |
* the worker's value if successful. |
1152 |
|
* |
1153 |
|
* @return true if worker steal count now zero |
1154 |
|
*/ |
1172 |
|
int pc = parallelism; // use parallelism, not rc |
1173 |
|
int ac = runState; // no mask -- artificially boosts during shutdown |
1174 |
|
// Use exact results for small values, saturate past 4 |
1175 |
< |
return pc <= ac? 0 : pc >>> 1 <= ac? 1 : pc >>> 2 <= ac? 3 : pc >>> 3; |
1175 |
> |
return ((pc <= ac) ? 0 : |
1176 |
> |
(pc >>> 1 <= ac) ? 1 : |
1177 |
> |
(pc >>> 2 <= ac) ? 3 : |
1178 |
> |
pc >>> 3); |
1179 |
|
} |
1180 |
|
|
1181 |
|
// Public and protected methods |
1225 |
|
* use {@link #defaultForkJoinWorkerThreadFactory}. |
1226 |
|
* @param handler the handler for internal worker threads that |
1227 |
|
* terminate due to unrecoverable errors encountered while executing |
1228 |
< |
* tasks. For default value, use <code>null</code>. |
1228 |
> |
* tasks. For default value, use {@code null}. |
1229 |
|
* @param asyncMode if true, |
1230 |
|
* establishes local first-in-first-out scheduling mode for forked |
1231 |
|
* tasks that are never joined. This mode may be more appropriate |
1232 |
|
* than default locally stack-based mode in applications in which |
1233 |
|
* worker threads only process event-style asynchronous tasks. |
1234 |
< |
* For default value, use <code>false</code>. |
1234 |
> |
* For default value, use {@code false}. |
1235 |
|
* @throws IllegalArgumentException if parallelism less than or |
1236 |
|
* equal to zero, or greater than implementation limit |
1237 |
|
* @throws NullPointerException if the factory is null |
1526 |
|
*/ |
1527 |
|
public long getQueuedTaskCount() { |
1528 |
|
long count = 0; |
1529 |
< |
ForkJoinWorkerThread[] ws = workers; |
1531 |
< |
int n = ws.length; |
1532 |
< |
for (int i = 0; i < n; ++i) { |
1533 |
< |
ForkJoinWorkerThread w = ws[i]; |
1529 |
> |
for (ForkJoinWorkerThread w : workers) |
1530 |
|
if (w != null) |
1531 |
|
count += w.getQueueSize(); |
1536 |
– |
} |
1532 |
|
return count; |
1533 |
|
} |
1534 |
|
|
1583 |
|
*/ |
1584 |
|
protected int drainTasksTo(Collection<? super ForkJoinTask<?>> c) { |
1585 |
|
int count = submissionQueue.drainTo(c); |
1586 |
< |
ForkJoinWorkerThread[] ws = workers; |
1592 |
< |
int n = ws.length; |
1593 |
< |
for (int i = 0; i < n; ++i) { |
1594 |
< |
ForkJoinWorkerThread w = ws[i]; |
1586 |
> |
for (ForkJoinWorkerThread w : workers) |
1587 |
|
if (w != null) |
1588 |
|
count += w.drainTasksTo(c); |
1597 |
– |
} |
1589 |
|
return count; |
1590 |
|
} |
1591 |
|
|
1712 |
|
throws InterruptedException { |
1713 |
|
try { |
1714 |
|
return termination.awaitAdvanceInterruptibly(0, timeout, unit) > 0; |
1715 |
< |
} catch(TimeoutException ex) { |
1715 |
> |
} catch (TimeoutException ex) { |
1716 |
|
return false; |
1717 |
|
} |
1718 |
|
} |