490 |
|
|
491 |
|
/* |
492 |
|
* Intrinsics-based atomic writes for queue slots. These are |
493 |
< |
* basically the same as methods in AtomicObjectArray, but |
493 |
> |
* basically the same as methods in AtomicReferenceArray, but |
494 |
|
* specialized for (1) ForkJoinTask elements (2) requirement that |
495 |
|
* nullness and bounds checks have already been performed by |
496 |
|
* callers and (3) effective offsets are known not to overflow |
497 |
|
* from int to long (because of MAXIMUM_QUEUE_CAPACITY). We don't |
498 |
|
* need corresponding version for reads: plain array reads are OK |
499 |
< |
* because they protected by other volatile reads and are |
499 |
> |
* because they are protected by other volatile reads and are |
500 |
|
* confirmed by CASes. |
501 |
|
* |
502 |
|
* Most uses don't actually call these methods, but instead contain |
1057 |
|
} |
1058 |
|
|
1059 |
|
/** |
1060 |
< |
* Implements ForJoinTask.getSurplusQueuedTaskCount(). |
1060 |
> |
* Implements ForkJoinTask.getSurplusQueuedTaskCount(). |
1061 |
|
* Returns an estimate of the number of tasks, offset by a |
1062 |
|
* function of number of idle workers. |
1063 |
|
* |