| 1 |
|
/* |
| 2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
| 3 |
|
* Expert Group and released to the public domain, as explained at |
| 4 |
< |
* http://creativecommons.org/licenses/publicdomain |
| 4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
| 5 |
|
*/ |
| 6 |
|
|
| 7 |
|
package jsr166y; |
| 17 |
|
* {@link java.util.concurrent.CountDownLatch CountDownLatch} |
| 18 |
|
* but supporting more flexible usage. |
| 19 |
|
* |
| 20 |
< |
* <p> <b>Registration.</b> Unlike the case for other barriers, the |
| 20 |
> |
* <p><b>Registration.</b> Unlike the case for other barriers, the |
| 21 |
|
* number of parties <em>registered</em> to synchronize on a phaser |
| 22 |
|
* may vary over time. Tasks may be registered at any time (using |
| 23 |
|
* methods {@link #register}, {@link #bulkRegister}, or forms of |
| 30 |
|
* (However, you can introduce such bookkeeping by subclassing this |
| 31 |
|
* class.) |
| 32 |
|
* |
| 33 |
< |
* <p> <b>Synchronization.</b> Like a {@code CyclicBarrier}, a {@code |
| 33 |
> |
* <p><b>Synchronization.</b> Like a {@code CyclicBarrier}, a {@code |
| 34 |
|
* Phaser} may be repeatedly awaited. Method {@link |
| 35 |
|
* #arriveAndAwaitAdvance} has effect analogous to {@link |
| 36 |
|
* java.util.concurrent.CyclicBarrier#await CyclicBarrier.await}. Each |
| 44 |
|
* |
| 45 |
|
* <ul> |
| 46 |
|
* |
| 47 |
< |
* <li> <b>Arrival.</b> Methods {@link #arrive} and |
| 47 |
> |
* <li><b>Arrival.</b> Methods {@link #arrive} and |
| 48 |
|
* {@link #arriveAndDeregister} record arrival. These methods |
| 49 |
|
* do not block, but return an associated <em>arrival phase |
| 50 |
|
* number</em>; that is, the phase number of the phaser to which |
| 57 |
|
* flexible than, providing a barrier action to a {@code |
| 58 |
|
* CyclicBarrier}. |
| 59 |
|
* |
| 60 |
< |
* <li> <b>Waiting.</b> Method {@link #awaitAdvance} requires an |
| 60 |
> |
* <li><b>Waiting.</b> Method {@link #awaitAdvance} requires an |
| 61 |
|
* argument indicating an arrival phase number, and returns when |
| 62 |
|
* the phaser advances to (or is already at) a different phase. |
| 63 |
|
* Unlike similar constructions using {@code CyclicBarrier}, |
| 74 |
|
* |
| 75 |
|
* </ul> |
| 76 |
|
* |
| 77 |
< |
* <p> <b>Termination.</b> A phaser may enter a <em>termination</em> |
| 77 |
> |
* <p><b>Termination.</b> A phaser may enter a <em>termination</em> |
| 78 |
|
* state, that may be checked using method {@link #isTerminated}. Upon |
| 79 |
|
* termination, all synchronization methods immediately return without |
| 80 |
< |
* waiting for advance, as indicated by a negative return |
| 81 |
< |
* value. Similarly, attempts to register upon termination have no |
| 82 |
< |
* effect. Termination is triggered when an invocation of {@code |
| 83 |
< |
* onAdvance} returns {@code true}. The default implementation returns |
| 84 |
< |
* {@code true} if a deregistration has caused the number of |
| 85 |
< |
* registered parties to become zero. As illustrated below, when |
| 86 |
< |
* phasers control actions with a fixed number of iterations, it is |
| 87 |
< |
* often convenient to override this method to cause termination when |
| 88 |
< |
* the current phase number reaches a threshold. Method {@link |
| 89 |
< |
* #forceTermination} is also available to abruptly release waiting |
| 90 |
< |
* threads and allow them to terminate. |
| 80 |
> |
* waiting for advance, as indicated by a negative return value. |
| 81 |
> |
* Similarly, attempts to register upon termination have no effect. |
| 82 |
> |
* Termination is triggered when an invocation of {@code onAdvance} |
| 83 |
> |
* returns {@code true}. The default implementation returns {@code |
| 84 |
> |
* true} if a deregistration has caused the number of registered |
| 85 |
> |
* parties to become zero. As illustrated below, when phasers control |
| 86 |
> |
* actions with a fixed number of iterations, it is often convenient |
| 87 |
> |
* to override this method to cause termination when the current phase |
| 88 |
> |
* number reaches a threshold. Method {@link #forceTermination} is |
| 89 |
> |
* also available to abruptly release waiting threads and allow them |
| 90 |
> |
* to terminate. |
| 91 |
|
* |
| 92 |
< |
* <p> <b>Tiering.</b> Phasers may be <em>tiered</em> (i.e., |
| 92 |
> |
* <p><b>Tiering.</b> Phasers may be <em>tiered</em> (i.e., |
| 93 |
|
* constructed in tree structures) to reduce contention. Phasers with |
| 94 |
|
* large numbers of parties that would otherwise experience heavy |
| 95 |
|
* synchronization contention costs may instead be set up so that |
| 130 |
|
* void runTasks(List<Runnable> tasks) { |
| 131 |
|
* final Phaser phaser = new Phaser(1); // "1" to register self |
| 132 |
|
* // create and start threads |
| 133 |
< |
* for (Runnable task : tasks) { |
| 133 |
> |
* for (final Runnable task : tasks) { |
| 134 |
|
* phaser.register(); |
| 135 |
|
* new Thread() { |
| 136 |
|
* public void run() { |
| 237 |
|
*/ |
| 238 |
|
|
| 239 |
|
/** |
| 240 |
< |
* Primary state representation, holding four fields: |
| 240 |
> |
* Primary state representation, holding four bit-fields: |
| 241 |
|
* |
| 242 |
< |
* * unarrived -- the number of parties yet to hit barrier (bits 0-15) |
| 243 |
< |
* * parties -- the number of parties to wait (bits 16-31) |
| 244 |
< |
* * phase -- the generation of the barrier (bits 32-62) |
| 245 |
< |
* * terminated -- set if barrier is terminated (bit 63 / sign) |
| 242 |
> |
* unarrived -- the number of parties yet to hit barrier (bits 0-15) |
| 243 |
> |
* parties -- the number of parties to wait (bits 16-31) |
| 244 |
> |
* phase -- the generation of the barrier (bits 32-62) |
| 245 |
> |
* terminated -- set if barrier is terminated (bit 63 / sign) |
| 246 |
|
* |
| 247 |
|
* Except that a phaser with no registered parties is |
| 248 |
< |
* distinguished with the otherwise illegal state of having zero |
| 248 |
> |
* distinguished by the otherwise illegal state of having zero |
| 249 |
|
* parties and one unarrived parties (encoded as EMPTY below). |
| 250 |
|
* |
| 251 |
|
* To efficiently maintain atomicity, these values are packed into |
| 260 |
|
* parent. |
| 261 |
|
* |
| 262 |
|
* The phase of a subphaser is allowed to lag that of its |
| 263 |
< |
* ancestors until it is actually accessed. Method reconcileState |
| 264 |
< |
* is usually attempted only only when the number of unarrived |
| 265 |
< |
* parties appears to be zero, which indicates a potential lag in |
| 266 |
< |
* updating phase after the root advanced. |
| 263 |
> |
* ancestors until it is actually accessed -- see method |
| 264 |
> |
* reconcileState. |
| 265 |
|
*/ |
| 266 |
|
private volatile long state; |
| 267 |
|
|
| 268 |
|
private static final int MAX_PARTIES = 0xffff; |
| 269 |
< |
private static final int MAX_PHASE = 0x7fffffff; |
| 269 |
> |
private static final int MAX_PHASE = Integer.MAX_VALUE; |
| 270 |
|
private static final int PARTIES_SHIFT = 16; |
| 271 |
|
private static final int PHASE_SHIFT = 32; |
| 272 |
|
private static final int UNARRIVED_MASK = 0xffff; // to mask ints |
| 273 |
|
private static final long PARTIES_MASK = 0xffff0000L; // to mask longs |
| 274 |
+ |
private static final long COUNTS_MASK = 0xffffffffL; |
| 275 |
|
private static final long TERMINATION_BIT = 1L << 63; |
| 276 |
|
|
| 277 |
|
// some special values |
| 278 |
|
private static final int ONE_ARRIVAL = 1; |
| 279 |
|
private static final int ONE_PARTY = 1 << PARTIES_SHIFT; |
| 280 |
+ |
private static final int ONE_DEREGISTER = ONE_ARRIVAL|ONE_PARTY; |
| 281 |
|
private static final int EMPTY = 1; |
| 282 |
|
|
| 283 |
|
// The following unpacking methods are usually manually inlined |
| 284 |
|
|
| 285 |
|
private static int unarrivedOf(long s) { |
| 286 |
|
int counts = (int)s; |
| 287 |
< |
return (counts == EMPTY) ? 0 : counts & UNARRIVED_MASK; |
| 287 |
> |
return (counts == EMPTY) ? 0 : (counts & UNARRIVED_MASK); |
| 288 |
|
} |
| 289 |
|
|
| 290 |
|
private static int partiesOf(long s) { |
| 292 |
|
} |
| 293 |
|
|
| 294 |
|
private static int phaseOf(long s) { |
| 295 |
< |
return (int) (s >>> PHASE_SHIFT); |
| 295 |
> |
return (int)(s >>> PHASE_SHIFT); |
| 296 |
|
} |
| 297 |
|
|
| 298 |
|
private static int arrivedOf(long s) { |
| 345 |
|
* Manually tuned to speed up and minimize race windows for the |
| 346 |
|
* common case of just decrementing unarrived field. |
| 347 |
|
* |
| 348 |
< |
* @param deregister false for arrive, true for arriveAndDeregister |
| 348 |
> |
* @param adjust value to subtract from state; |
| 349 |
> |
* ONE_ARRIVAL for arrive, |
| 350 |
> |
* ONE_DEREGISTER for arriveAndDeregister |
| 351 |
|
*/ |
| 352 |
< |
private int doArrive(boolean deregister) { |
| 351 |
< |
int adj = deregister ? ONE_ARRIVAL|ONE_PARTY : ONE_ARRIVAL; |
| 352 |
> |
private int doArrive(int adjust) { |
| 353 |
|
final Phaser root = this.root; |
| 354 |
|
for (;;) { |
| 355 |
|
long s = (root == this) ? state : reconcileState(); |
| 356 |
|
int phase = (int)(s >>> PHASE_SHIFT); |
| 356 |
– |
int counts = (int)s; |
| 357 |
– |
int unarrived = (counts & UNARRIVED_MASK) - 1; |
| 357 |
|
if (phase < 0) |
| 358 |
|
return phase; |
| 359 |
< |
else if (counts == EMPTY || unarrived < 0) { |
| 360 |
< |
if (root == this || reconcileState() == s) |
| 361 |
< |
throw new IllegalStateException(badArrive(s)); |
| 362 |
< |
} |
| 363 |
< |
else if (UNSAFE.compareAndSwapLong(this, stateOffset, s, s-=adj)) { |
| 364 |
< |
if (unarrived == 0) { |
| 359 |
> |
int counts = (int)s; |
| 360 |
> |
int unarrived = (counts == EMPTY) ? 0 : (counts & UNARRIVED_MASK); |
| 361 |
> |
if (unarrived <= 0) |
| 362 |
> |
throw new IllegalStateException(badArrive(s)); |
| 363 |
> |
if (UNSAFE.compareAndSwapLong(this, stateOffset, s, s-=adjust)) { |
| 364 |
> |
if (unarrived == 1) { |
| 365 |
|
long n = s & PARTIES_MASK; // base of next state |
| 366 |
< |
int nextUnarrived = ((int)n) >>> PARTIES_SHIFT; |
| 367 |
< |
if (root != this) |
| 368 |
< |
return parent.doArrive(nextUnarrived == 0); |
| 369 |
< |
if (onAdvance(phase, nextUnarrived)) |
| 370 |
< |
n |= TERMINATION_BIT; |
| 371 |
< |
else if (nextUnarrived == 0) |
| 372 |
< |
n |= EMPTY; |
| 366 |
> |
int nextUnarrived = (int)n >>> PARTIES_SHIFT; |
| 367 |
> |
if (root == this) { |
| 368 |
> |
if (onAdvance(phase, nextUnarrived)) |
| 369 |
> |
n |= TERMINATION_BIT; |
| 370 |
> |
else if (nextUnarrived == 0) |
| 371 |
> |
n |= EMPTY; |
| 372 |
> |
else |
| 373 |
> |
n |= nextUnarrived; |
| 374 |
> |
int nextPhase = (phase + 1) & MAX_PHASE; |
| 375 |
> |
n |= (long)nextPhase << PHASE_SHIFT; |
| 376 |
> |
UNSAFE.compareAndSwapLong(this, stateOffset, s, n); |
| 377 |
> |
releaseWaiters(phase); |
| 378 |
> |
} |
| 379 |
> |
else if (nextUnarrived == 0) { // propagate deregistration |
| 380 |
> |
phase = parent.doArrive(ONE_DEREGISTER); |
| 381 |
> |
UNSAFE.compareAndSwapLong(this, stateOffset, |
| 382 |
> |
s, s | EMPTY); |
| 383 |
> |
} |
| 384 |
|
else |
| 385 |
< |
n |= nextUnarrived; |
| 376 |
< |
n |= ((long)((phase + 1) & MAX_PHASE)) << PHASE_SHIFT; |
| 377 |
< |
UNSAFE.compareAndSwapLong(this, stateOffset, s, n); |
| 378 |
< |
releaseWaiters(phase); |
| 385 |
> |
phase = parent.doArrive(ONE_ARRIVAL); |
| 386 |
|
} |
| 387 |
|
return phase; |
| 388 |
|
} |
| 397 |
|
*/ |
| 398 |
|
private int doRegister(int registrations) { |
| 399 |
|
// adjustment to state |
| 400 |
< |
long adj = ((long)registrations << PARTIES_SHIFT) | registrations; |
| 401 |
< |
Phaser par = parent; |
| 400 |
> |
long adjust = ((long)registrations << PARTIES_SHIFT) | registrations; |
| 401 |
> |
final Phaser parent = this.parent; |
| 402 |
|
int phase; |
| 403 |
|
for (;;) { |
| 404 |
< |
long s = state; |
| 404 |
> |
long s = (parent == null) ? state : reconcileState(); |
| 405 |
|
int counts = (int)s; |
| 406 |
|
int parties = counts >>> PARTIES_SHIFT; |
| 407 |
|
int unarrived = counts & UNARRIVED_MASK; |
| 408 |
|
if (registrations > MAX_PARTIES - parties) |
| 409 |
|
throw new IllegalStateException(badRegister(s)); |
| 410 |
< |
else if ((phase = (int)(s >>> PHASE_SHIFT)) < 0) |
| 410 |
> |
phase = (int)(s >>> PHASE_SHIFT); |
| 411 |
> |
if (phase < 0) |
| 412 |
|
break; |
| 413 |
< |
else if (counts != EMPTY) { // not 1st registration |
| 414 |
< |
if (par == null || reconcileState() == s) { |
| 413 |
> |
if (counts != EMPTY) { // not 1st registration |
| 414 |
> |
if (parent == null || reconcileState() == s) { |
| 415 |
|
if (unarrived == 0) // wait out advance |
| 416 |
|
root.internalAwaitAdvance(phase, null); |
| 417 |
|
else if (UNSAFE.compareAndSwapLong(this, stateOffset, |
| 418 |
< |
s, s + adj)) |
| 418 |
> |
s, s + adjust)) |
| 419 |
|
break; |
| 420 |
|
} |
| 421 |
|
} |
| 422 |
< |
else if (par == null) { // 1st root registration |
| 423 |
< |
long next = (((long) phase) << PHASE_SHIFT) | adj; |
| 422 |
> |
else if (parent == null) { // 1st root registration |
| 423 |
> |
long next = ((long)phase << PHASE_SHIFT) | adjust; |
| 424 |
|
if (UNSAFE.compareAndSwapLong(this, stateOffset, s, next)) |
| 425 |
|
break; |
| 426 |
|
} |
| 427 |
|
else { |
| 428 |
|
synchronized (this) { // 1st sub registration |
| 429 |
|
if (state == s) { // recheck under lock |
| 430 |
< |
par.doRegister(1); |
| 431 |
< |
do { // force current phase |
| 430 |
> |
phase = parent.doRegister(1); |
| 431 |
> |
if (phase < 0) |
| 432 |
> |
break; |
| 433 |
> |
// finish registration whenever parent registration |
| 434 |
> |
// succeeded, even when racing with termination, |
| 435 |
> |
// since these are part of the same "transaction". |
| 436 |
> |
while (!UNSAFE.compareAndSwapLong |
| 437 |
> |
(this, stateOffset, s, |
| 438 |
> |
((long)phase << PHASE_SHIFT) | adjust)) { |
| 439 |
> |
s = state; |
| 440 |
|
phase = (int)(root.state >>> PHASE_SHIFT); |
| 441 |
< |
// assert phase < 0 || (int)state == EMPTY; |
| 442 |
< |
} while (!UNSAFE.compareAndSwapLong |
| 427 |
< |
(this, stateOffset, state, |
| 428 |
< |
(((long) phase) << PHASE_SHIFT) | adj)); |
| 441 |
> |
// assert (int)s == EMPTY; |
| 442 |
> |
} |
| 443 |
|
break; |
| 444 |
|
} |
| 445 |
|
} |
| 450 |
|
|
| 451 |
|
/** |
| 452 |
|
* Resolves lagged phase propagation from root if necessary. |
| 453 |
+ |
* Reconciliation normally occurs when root has advanced but |
| 454 |
+ |
* subphasers have not yet done so, in which case they must finish |
| 455 |
+ |
* their own advance by setting unarrived to parties (or if |
| 456 |
+ |
* parties is zero, resetting to unregistered EMPTY state). |
| 457 |
+ |
* |
| 458 |
+ |
* @return reconciled state |
| 459 |
|
*/ |
| 460 |
|
private long reconcileState() { |
| 461 |
< |
Phaser rt = root; |
| 461 |
> |
final Phaser root = this.root; |
| 462 |
|
long s = state; |
| 463 |
< |
if (rt != this) { |
| 464 |
< |
int phase; |
| 465 |
< |
while ((phase = (int)(rt.state >>> PHASE_SHIFT)) != |
| 466 |
< |
(int)(s >>> PHASE_SHIFT)) { |
| 467 |
< |
// assert phase < 0 || unarrivedOf(s) == 0 |
| 468 |
< |
long t; // to reread s |
| 469 |
< |
long p = s & PARTIES_MASK; // unshifted parties field |
| 470 |
< |
long n = (((long) phase) << PHASE_SHIFT) | p; |
| 471 |
< |
if (phase >= 0) { |
| 472 |
< |
if (p == 0L) |
| 473 |
< |
n |= EMPTY; // reset to empty |
| 474 |
< |
else |
| 455 |
< |
n |= p >>> PARTIES_SHIFT; // set unarr to parties |
| 456 |
< |
} |
| 457 |
< |
if ((t = state) == s && |
| 458 |
< |
UNSAFE.compareAndSwapLong(this, stateOffset, s, s = n)) |
| 459 |
< |
break; |
| 460 |
< |
s = t; |
| 461 |
< |
} |
| 463 |
> |
if (root != this) { |
| 464 |
> |
int phase, p; |
| 465 |
> |
// CAS to root phase with current parties, tripping unarrived |
| 466 |
> |
while ((phase = (int)(root.state >>> PHASE_SHIFT)) != |
| 467 |
> |
(int)(s >>> PHASE_SHIFT) && |
| 468 |
> |
!UNSAFE.compareAndSwapLong |
| 469 |
> |
(this, stateOffset, s, |
| 470 |
> |
s = (((long)phase << PHASE_SHIFT) | |
| 471 |
> |
((phase < 0) ? (s & COUNTS_MASK) : |
| 472 |
> |
(((p = (int)s >>> PARTIES_SHIFT) == 0) ? EMPTY : |
| 473 |
> |
((s & PARTIES_MASK) | p)))))) |
| 474 |
> |
s = state; |
| 475 |
|
} |
| 476 |
|
return s; |
| 477 |
|
} |
| 537 |
|
this.evenQ = new AtomicReference<QNode>(); |
| 538 |
|
this.oddQ = new AtomicReference<QNode>(); |
| 539 |
|
} |
| 540 |
< |
this.state = (parties == 0) ? (long) EMPTY : |
| 541 |
< |
((((long) phase) << PHASE_SHIFT) | |
| 542 |
< |
(((long) parties) << PARTIES_SHIFT) | |
| 543 |
< |
((long) parties)); |
| 540 |
> |
this.state = (parties == 0) ? (long)EMPTY : |
| 541 |
> |
((long)phase << PHASE_SHIFT) | |
| 542 |
> |
((long)parties << PARTIES_SHIFT) | |
| 543 |
> |
((long)parties); |
| 544 |
|
} |
| 545 |
|
|
| 546 |
|
/** |
| 554 |
|
* |
| 555 |
|
* @return the arrival phase number to which this registration |
| 556 |
|
* applied. If this value is negative, then this phaser has |
| 557 |
< |
* terminated, in which casem registration has no effect. |
| 557 |
> |
* terminated, in which case registration has no effect. |
| 558 |
|
* @throws IllegalStateException if attempting to register more |
| 559 |
|
* than the maximum supported number of parties |
| 560 |
|
*/ |
| 576 |
|
* advance to the next phase |
| 577 |
|
* @return the arrival phase number to which this registration |
| 578 |
|
* applied. If this value is negative, then this phaser has |
| 579 |
< |
* terminated, in which casem registration has no effect. |
| 579 |
> |
* terminated, in which case registration has no effect. |
| 580 |
|
* @throws IllegalStateException if attempting to register more |
| 581 |
|
* than the maximum supported number of parties |
| 582 |
|
* @throws IllegalArgumentException if {@code parties < 0} |
| 602 |
|
* of unarrived parties would become negative |
| 603 |
|
*/ |
| 604 |
|
public int arrive() { |
| 605 |
< |
return doArrive(false); |
| 605 |
> |
return doArrive(ONE_ARRIVAL); |
| 606 |
|
} |
| 607 |
|
|
| 608 |
|
/** |
| 622 |
|
* of registered or unarrived parties would become negative |
| 623 |
|
*/ |
| 624 |
|
public int arriveAndDeregister() { |
| 625 |
< |
return doArrive(true); |
| 625 |
> |
return doArrive(ONE_DEREGISTER); |
| 626 |
|
} |
| 627 |
|
|
| 628 |
|
/** |
| 649 |
|
for (;;) { |
| 650 |
|
long s = (root == this) ? state : reconcileState(); |
| 651 |
|
int phase = (int)(s >>> PHASE_SHIFT); |
| 639 |
– |
int counts = (int)s; |
| 640 |
– |
int unarrived = (counts & UNARRIVED_MASK) - 1; |
| 652 |
|
if (phase < 0) |
| 653 |
|
return phase; |
| 654 |
< |
else if (counts == EMPTY || unarrived < 0) { |
| 655 |
< |
if (reconcileState() == s) |
| 656 |
< |
throw new IllegalStateException(badArrive(s)); |
| 657 |
< |
} |
| 658 |
< |
else if (UNSAFE.compareAndSwapLong(this, stateOffset, s, |
| 659 |
< |
s -= ONE_ARRIVAL)) { |
| 660 |
< |
if (unarrived != 0) |
| 654 |
> |
int counts = (int)s; |
| 655 |
> |
int unarrived = (counts == EMPTY) ? 0 : (counts & UNARRIVED_MASK); |
| 656 |
> |
if (unarrived <= 0) |
| 657 |
> |
throw new IllegalStateException(badArrive(s)); |
| 658 |
> |
if (UNSAFE.compareAndSwapLong(this, stateOffset, s, |
| 659 |
> |
s -= ONE_ARRIVAL)) { |
| 660 |
> |
if (unarrived > 1) |
| 661 |
|
return root.internalAwaitAdvance(phase, null); |
| 662 |
|
if (root != this) |
| 663 |
|
return parent.arriveAndAwaitAdvance(); |
| 664 |
|
long n = s & PARTIES_MASK; // base of next state |
| 665 |
< |
int nextUnarrived = ((int)n) >>> PARTIES_SHIFT; |
| 665 |
> |
int nextUnarrived = (int)n >>> PARTIES_SHIFT; |
| 666 |
|
if (onAdvance(phase, nextUnarrived)) |
| 667 |
|
n |= TERMINATION_BIT; |
| 668 |
|
else if (nextUnarrived == 0) |
| 693 |
|
*/ |
| 694 |
|
public int awaitAdvance(int phase) { |
| 695 |
|
final Phaser root = this.root; |
| 696 |
< |
int p = (int)((root == this? state : reconcileState()) >>> PHASE_SHIFT); |
| 696 |
> |
long s = (root == this) ? state : reconcileState(); |
| 697 |
> |
int p = (int)(s >>> PHASE_SHIFT); |
| 698 |
|
if (phase < 0) |
| 699 |
|
return phase; |
| 700 |
|
if (p == phase) |
| 720 |
|
public int awaitAdvanceInterruptibly(int phase) |
| 721 |
|
throws InterruptedException { |
| 722 |
|
final Phaser root = this.root; |
| 723 |
< |
int p = (int)((root == this? state : reconcileState()) >>> PHASE_SHIFT); |
| 723 |
> |
long s = (root == this) ? state : reconcileState(); |
| 724 |
> |
int p = (int)(s >>> PHASE_SHIFT); |
| 725 |
|
if (phase < 0) |
| 726 |
|
return phase; |
| 727 |
|
if (p == phase) { |
| 758 |
|
throws InterruptedException, TimeoutException { |
| 759 |
|
long nanos = unit.toNanos(timeout); |
| 760 |
|
final Phaser root = this.root; |
| 761 |
< |
int p = (int)((root == this? state : reconcileState()) >>> PHASE_SHIFT); |
| 761 |
> |
long s = (root == this) ? state : reconcileState(); |
| 762 |
> |
int p = (int)(s >>> PHASE_SHIFT); |
| 763 |
|
if (phase < 0) |
| 764 |
|
return phase; |
| 765 |
|
if (p == phase) { |
| 787 |
|
final Phaser root = this.root; |
| 788 |
|
long s; |
| 789 |
|
while ((s = root.state) >= 0) { |
| 790 |
< |
long next = (s & ~((long)UNARRIVED_MASK)) | TERMINATION_BIT; |
| 791 |
< |
if (UNSAFE.compareAndSwapLong(root, stateOffset, s, next)) { |
| 790 |
> |
if (UNSAFE.compareAndSwapLong(root, stateOffset, |
| 791 |
> |
s, s | TERMINATION_BIT)) { |
| 792 |
|
// signal all threads |
| 793 |
< |
releaseWaiters(0); |
| 794 |
< |
releaseWaiters(1); |
| 793 |
> |
releaseWaiters(0); // Waiters on evenQ |
| 794 |
> |
releaseWaiters(1); // Waiters on oddQ |
| 795 |
|
return; |
| 796 |
|
} |
| 797 |
|
} |
| 821 |
|
|
| 822 |
|
/** |
| 823 |
|
* Returns the number of registered parties that have arrived at |
| 824 |
< |
* the current phase of this phaser. |
| 824 |
> |
* the current phase of this phaser. If this phaser has terminated, |
| 825 |
> |
* the returned value is meaningless and arbitrary. |
| 826 |
|
* |
| 827 |
|
* @return the number of arrived parties |
| 828 |
|
*/ |
| 832 |
|
|
| 833 |
|
/** |
| 834 |
|
* Returns the number of registered parties that have not yet |
| 835 |
< |
* arrived at the current phase of this phaser. |
| 835 |
> |
* arrived at the current phase of this phaser. If this phaser has |
| 836 |
> |
* terminated, the returned value is meaningless and arbitrary. |
| 837 |
|
* |
| 838 |
|
* @return the number of unarrived parties |
| 839 |
|
*/ |
| 997 |
|
|
| 998 |
|
/** |
| 999 |
|
* Possibly blocks and waits for phase to advance unless aborted. |
| 1000 |
< |
* Call only from root node. |
| 1000 |
> |
* Call only on root phaser. |
| 1001 |
|
* |
| 1002 |
|
* @param phase current phase |
| 1003 |
|
* @param node if non-null, the wait node to track interrupt and timeout; |
| 1005 |
|
* @return current phase |
| 1006 |
|
*/ |
| 1007 |
|
private int internalAwaitAdvance(int phase, QNode node) { |
| 1008 |
+ |
// assert root == this; |
| 1009 |
|
releaseWaiters(phase-1); // ensure old queue clean |
| 1010 |
|
boolean queued = false; // true when node is enqueued |
| 1011 |
|
int lastUnarrived = 0; // to increase spins upon change |
| 1119 |
|
|
| 1120 |
|
// Unsafe mechanics |
| 1121 |
|
|
| 1122 |
< |
private static final sun.misc.Unsafe UNSAFE = getUnsafe(); |
| 1123 |
< |
private static final long stateOffset = |
| 1124 |
< |
objectFieldOffset("state", Phaser.class); |
| 1108 |
< |
|
| 1109 |
< |
private static long objectFieldOffset(String field, Class<?> klazz) { |
| 1122 |
> |
private static final sun.misc.Unsafe UNSAFE; |
| 1123 |
> |
private static final long stateOffset; |
| 1124 |
> |
static { |
| 1125 |
|
try { |
| 1126 |
< |
return UNSAFE.objectFieldOffset(klazz.getDeclaredField(field)); |
| 1127 |
< |
} catch (NoSuchFieldException e) { |
| 1128 |
< |
// Convert Exception to corresponding Error |
| 1129 |
< |
NoSuchFieldError error = new NoSuchFieldError(field); |
| 1130 |
< |
error.initCause(e); |
| 1131 |
< |
throw error; |
| 1126 |
> |
UNSAFE = getUnsafe(); |
| 1127 |
> |
Class<?> k = Phaser.class; |
| 1128 |
> |
stateOffset = UNSAFE.objectFieldOffset |
| 1129 |
> |
(k.getDeclaredField("state")); |
| 1130 |
> |
} catch (Exception e) { |
| 1131 |
> |
throw new Error(e); |
| 1132 |
|
} |
| 1133 |
|
} |
| 1134 |
|
|
| 1142 |
|
private static sun.misc.Unsafe getUnsafe() { |
| 1143 |
|
try { |
| 1144 |
|
return sun.misc.Unsafe.getUnsafe(); |
| 1145 |
< |
} catch (SecurityException se) { |
| 1146 |
< |
try { |
| 1147 |
< |
return java.security.AccessController.doPrivileged |
| 1148 |
< |
(new java.security |
| 1149 |
< |
.PrivilegedExceptionAction<sun.misc.Unsafe>() { |
| 1150 |
< |
public sun.misc.Unsafe run() throws Exception { |
| 1151 |
< |
java.lang.reflect.Field f = sun.misc |
| 1152 |
< |
.Unsafe.class.getDeclaredField("theUnsafe"); |
| 1153 |
< |
f.setAccessible(true); |
| 1154 |
< |
return (sun.misc.Unsafe) f.get(null); |
| 1155 |
< |
}}); |
| 1156 |
< |
} catch (java.security.PrivilegedActionException e) { |
| 1157 |
< |
throw new RuntimeException("Could not initialize intrinsics", |
| 1158 |
< |
e.getCause()); |
| 1159 |
< |
} |
| 1145 |
> |
} catch (SecurityException tryReflectionInstead) {} |
| 1146 |
> |
try { |
| 1147 |
> |
return java.security.AccessController.doPrivileged |
| 1148 |
> |
(new java.security.PrivilegedExceptionAction<sun.misc.Unsafe>() { |
| 1149 |
> |
public sun.misc.Unsafe run() throws Exception { |
| 1150 |
> |
Class<sun.misc.Unsafe> k = sun.misc.Unsafe.class; |
| 1151 |
> |
for (java.lang.reflect.Field f : k.getDeclaredFields()) { |
| 1152 |
> |
f.setAccessible(true); |
| 1153 |
> |
Object x = f.get(null); |
| 1154 |
> |
if (k.isInstance(x)) |
| 1155 |
> |
return k.cast(x); |
| 1156 |
> |
} |
| 1157 |
> |
throw new NoSuchFieldError("the Unsafe"); |
| 1158 |
> |
}}); |
| 1159 |
> |
} catch (java.security.PrivilegedActionException e) { |
| 1160 |
> |
throw new RuntimeException("Could not initialize intrinsics", |
| 1161 |
> |
e.getCause()); |
| 1162 |
|
} |
| 1163 |
|
} |
| 1164 |
|
} |
