| 48 |
|
* @param x the value to update |
| 49 |
|
*/ |
| 50 |
|
public void update(long x) { |
| 51 |
< |
Cell[] as; long b, v; HashCode hc; Cell a; int n; |
| 51 |
> |
Cell[] as; long b, v; int[] hc; Cell a; int n; |
| 52 |
|
if ((as = cells) != null || |
| 53 |
|
(b = base) < x && !casBase(b, x)) { |
| 54 |
|
boolean uncontended = true; |
| 55 |
< |
int h = (hc = threadHashCode.get()).code; |
| 56 |
< |
if (as == null || (n = as.length) < 1 || |
| 57 |
< |
(a = as[(n - 1) & h]) == null || |
| 55 |
> |
if ((hc = threadHashCode.get()) == null || |
| 56 |
> |
as == null || (n = as.length) < 1 || |
| 57 |
> |
(a = as[(n - 1) & hc[0]]) == null || |
| 58 |
|
((v = a.value) < x && !(uncontended = a.cas(v, x)))) |
| 59 |
|
retryUpdate(x, hc, uncontended); |
| 60 |
|
} |
| 62 |
|
|
| 63 |
|
/** |
| 64 |
|
* Returns the current maximum. The returned value is |
| 65 |
< |
* <em>NOT</em> an atomic snapshot: invocation in the absence of |
| 65 |
> |
* <em>NOT</em> an atomic snapshot; invocation in the absence of |
| 66 |
|
* concurrent updates returns an accurate result, but concurrent |
| 67 |
|
* updates that occur while the value is being calculated might |
| 68 |
|
* not be incorporated. |
