99 |
|
* |
100 |
|
* <p>The common pool is by default constructed with default |
101 |
|
* parameters, but these may be controlled by setting three {@link |
102 |
< |
* System#getProperty properties} with prefix {@code |
102 |
> |
* System#getProperty system properties} with prefix {@code |
103 |
|
* java.util.concurrent.ForkJoinPool.common}: {@code parallelism} -- |
104 |
|
* an integer greater than zero, {@code threadFactory} -- the class |
105 |
|
* name of a {@link ForkJoinWorkerThreadFactory}, and {@code |
1326 |
|
* wrap around zero, this method harmlessly fails to reinitialize |
1327 |
|
* if workQueues exists, while still advancing plock. |
1328 |
|
* |
1329 |
< |
* Additonally tries to create the first worker. |
1329 |
> |
* Additionally tries to create the first worker. |
1330 |
|
*/ |
1331 |
|
private void initWorkers() { |
1332 |
|
WorkQueue[] ws, nws; int ps; |
1788 |
|
WorkQueue[] ws; WorkQueue w; Thread p; long c; int m, u, e, i, s; |
1789 |
|
if ((u = (int)(ctl >>> 32)) < 0 && (u >> UAC_SHIFT) < 0 && |
1790 |
|
(ws = workQueues) != null && (m = ws.length - 1) >= 0) { |
1791 |
< |
outer: for (int k = origin, j = once? 0 : m; j >= 0; --j) { |
1791 |
> |
outer: for (int k = origin, j = once ? 0 : m; j >= 0; --j) { |
1792 |
|
WorkQueue q = ws[k++ & m]; |
1793 |
|
for (int n = m;;) { // limit to at most m signals |
1794 |
|
if (task != null && task.status < 0) |