1546 |
|
*/ |
1547 |
|
final void incrementActiveCount() { |
1548 |
|
long c; |
1549 |
< |
do {} while(!U.compareAndSwapLong |
1550 |
< |
(this, CTL, c = ctl, ((c & ~AC_MASK) | |
1551 |
< |
((c & AC_MASK) + AC_UNIT)))); |
1549 |
> |
do {} while (!U.compareAndSwapLong |
1550 |
> |
(this, CTL, c = ctl, ((c & ~AC_MASK) | |
1551 |
> |
((c & AC_MASK) + AC_UNIT)))); |
1552 |
|
} |
1553 |
|
|
1554 |
|
/** |
1959 |
|
} |
1960 |
|
} |
1961 |
|
long c; // reactivate |
1962 |
< |
do {} while(!U.compareAndSwapLong |
1963 |
< |
(this, CTL, c = ctl, |
1964 |
< |
((c & ~AC_MASK) | |
1965 |
< |
((c & AC_MASK) + AC_UNIT)))); |
1962 |
> |
do {} while (!U.compareAndSwapLong |
1963 |
> |
(this, CTL, c = ctl, |
1964 |
> |
((c & ~AC_MASK) | |
1965 |
> |
((c & AC_MASK) + AC_UNIT)))); |
1966 |
|
} |
1967 |
|
} |
1968 |
|
} |
2032 |
|
if ((q = findNonEmptyStealQueue()) != null) { |
2033 |
|
if (!active) { // re-establish active count |
2034 |
|
active = true; |
2035 |
< |
do {} while(!U.compareAndSwapLong |
2036 |
< |
(this, CTL, c = ctl, |
2037 |
< |
((c & ~AC_MASK) | |
2038 |
< |
((c & AC_MASK) + AC_UNIT)))); |
2035 |
> |
do {} while (!U.compareAndSwapLong |
2036 |
> |
(this, CTL, c = ctl, |
2037 |
> |
((c & ~AC_MASK) | |
2038 |
> |
((c & AC_MASK) + AC_UNIT)))); |
2039 |
|
} |
2040 |
|
if ((b = q.base) - q.top < 0 && (t = q.pollAt(b)) != null) { |
2041 |
|
(w.currentSteal = t).doExec(); |