158 |
|
for (int b;;) { |
159 |
|
if (((b = t.getPendingCount()) & FINISHED) != 0) |
160 |
|
break outer; // already done |
161 |
< |
state = ((b & CUMULATE) != 0? FINISHED : |
161 |
> |
state = ((b & CUMULATE) != 0 ? FINISHED : |
162 |
|
(l > org) ? SUMMED : (SUMMED|FINISHED)); |
163 |
|
if (t.compareAndSetPendingCount(b, b|state)) |
164 |
|
break; |
307 |
|
for (int b;;) { |
308 |
|
if (((b = t.getPendingCount()) & FINISHED) != 0) |
309 |
|
break outer; // already done |
310 |
< |
state = ((b & CUMULATE) != 0? FINISHED : |
310 |
> |
state = ((b & CUMULATE) != 0 ? FINISHED : |
311 |
|
(l > org) ? SUMMED : (SUMMED|FINISHED)); |
312 |
|
if (t.compareAndSetPendingCount(b, b|state)) |
313 |
|
break; |
456 |
|
for (int b;;) { |
457 |
|
if (((b = t.getPendingCount()) & FINISHED) != 0) |
458 |
|
break outer; // already done |
459 |
< |
state = ((b & CUMULATE) != 0? FINISHED : |
459 |
> |
state = ((b & CUMULATE) != 0 ? FINISHED : |
460 |
|
(l > org) ? SUMMED : (SUMMED|FINISHED)); |
461 |
|
if (t.compareAndSetPendingCount(b, b|state)) |
462 |
|
break; |
605 |
|
for (int b;;) { |
606 |
|
if (((b = t.getPendingCount()) & FINISHED) != 0) |
607 |
|
break outer; // already done |
608 |
< |
state = ((b & CUMULATE) != 0? FINISHED : |
608 |
> |
state = ((b & CUMULATE) != 0 ? FINISHED : |
609 |
|
(l > org) ? SUMMED : (SUMMED|FINISHED)); |
610 |
|
if (t.compareAndSetPendingCount(b, b|state)) |
611 |
|
break; |
669 |
|
} |
670 |
|
|
671 |
|
|
672 |
< |
} |
672 |
> |
} |