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; |
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 |
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 long PHASE_MASK = -1L << PHASE_SHIFT; |
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 TERMINATION_BIT = 1L << 63; |
290 |
|
} |
291 |
|
|
292 |
|
private static int phaseOf(long s) { |
293 |
< |
return (int) (s >>> PHASE_SHIFT); |
293 |
> |
return (int)(s >>> PHASE_SHIFT); |
294 |
|
} |
295 |
|
|
296 |
|
private static int arrivedOf(long s) { |
360 |
|
throw new IllegalStateException(badArrive(s)); |
361 |
|
} |
362 |
|
else if (UNSAFE.compareAndSwapLong(this, stateOffset, s, s-=adj)) { |
363 |
+ |
long n = s & PARTIES_MASK; // base of next state |
364 |
+ |
int nextUnarrived = (int)n >>> PARTIES_SHIFT; |
365 |
|
if (unarrived == 0) { |
366 |
< |
long n = s & PARTIES_MASK; // base of next state |
367 |
< |
int nextUnarrived = ((int)n) >>> PARTIES_SHIFT; |
368 |
< |
if (root != this) |
369 |
< |
return parent.doArrive(nextUnarrived == 0); |
370 |
< |
if (onAdvance(phase, nextUnarrived)) |
371 |
< |
n |= TERMINATION_BIT; |
372 |
< |
else if (nextUnarrived == 0) |
373 |
< |
n |= EMPTY; |
366 |
> |
if (root == this) { |
367 |
> |
if (onAdvance(phase, nextUnarrived)) |
368 |
> |
n |= TERMINATION_BIT; |
369 |
> |
else if (nextUnarrived == 0) |
370 |
> |
n |= EMPTY; |
371 |
> |
else |
372 |
> |
n |= nextUnarrived; |
373 |
> |
n |= (long)((phase + 1) & MAX_PHASE) << PHASE_SHIFT; |
374 |
> |
UNSAFE.compareAndSwapLong(this, stateOffset, s, n); |
375 |
> |
} |
376 |
> |
else if (nextUnarrived == 0) { // propagate deregistration |
377 |
> |
phase = parent.doArrive(true); |
378 |
> |
UNSAFE.compareAndSwapLong(this, stateOffset, |
379 |
> |
s, s | EMPTY); |
380 |
> |
} |
381 |
|
else |
382 |
< |
n |= nextUnarrived; |
375 |
< |
n |= ((long)((phase + 1) & MAX_PHASE)) << PHASE_SHIFT; |
376 |
< |
UNSAFE.compareAndSwapLong(this, stateOffset, s, n); |
382 |
> |
phase = parent.doArrive(false); |
383 |
|
releaseWaiters(phase); |
384 |
|
} |
385 |
|
return phase; |
396 |
|
private int doRegister(int registrations) { |
397 |
|
// adjustment to state |
398 |
|
long adj = ((long)registrations << PARTIES_SHIFT) | registrations; |
399 |
< |
Phaser par = parent; |
399 |
> |
final Phaser parent = this.parent; |
400 |
|
int phase; |
401 |
|
for (;;) { |
402 |
< |
long s = state; |
402 |
> |
long s = (parent == null) ? state : reconcileState(); |
403 |
|
int counts = (int)s; |
404 |
|
int parties = counts >>> PARTIES_SHIFT; |
405 |
|
int unarrived = counts & UNARRIVED_MASK; |
408 |
|
else if ((phase = (int)(s >>> PHASE_SHIFT)) < 0) |
409 |
|
break; |
410 |
|
else if (counts != EMPTY) { // not 1st registration |
411 |
< |
if (par == null || reconcileState() == s) { |
411 |
> |
if (parent == null || reconcileState() == s) { |
412 |
|
if (unarrived == 0) // wait out advance |
413 |
|
root.internalAwaitAdvance(phase, null); |
414 |
|
else if (UNSAFE.compareAndSwapLong(this, stateOffset, |
416 |
|
break; |
417 |
|
} |
418 |
|
} |
419 |
< |
else if (par == null) { // 1st root registration |
420 |
< |
long next = (((long) phase) << PHASE_SHIFT) | adj; |
419 |
> |
else if (parent == null) { // 1st root registration |
420 |
> |
long next = ((long)phase << PHASE_SHIFT) | adj; |
421 |
|
if (UNSAFE.compareAndSwapLong(this, stateOffset, s, next)) |
422 |
|
break; |
423 |
|
} |
424 |
|
else { |
425 |
|
synchronized (this) { // 1st sub registration |
426 |
|
if (state == s) { // recheck under lock |
427 |
< |
par.doRegister(1); |
427 |
> |
parent.doRegister(1); |
428 |
|
do { // force current phase |
429 |
|
phase = (int)(root.state >>> PHASE_SHIFT); |
430 |
|
// assert phase < 0 || (int)state == EMPTY; |
431 |
|
} while (!UNSAFE.compareAndSwapLong |
432 |
|
(this, stateOffset, state, |
433 |
< |
(((long) phase) << PHASE_SHIFT) | adj)); |
433 |
> |
((long)phase << PHASE_SHIFT) | adj)); |
434 |
|
break; |
435 |
|
} |
436 |
|
} |
462 |
|
(int)(s >>> PHASE_SHIFT) && |
463 |
|
!UNSAFE.compareAndSwapLong |
464 |
|
(this, stateOffset, s, |
465 |
< |
s = ((((long) phase) << PHASE_SHIFT) | (s & PARTIES_MASK) | |
465 |
> |
s = (((long)phase << PHASE_SHIFT) | |
466 |
> |
(s & PARTIES_MASK) | |
467 |
|
((p = (int)s >>> PARTIES_SHIFT) == 0 ? EMPTY : |
468 |
< |
(u = (int)s & UNARRIVED_MASK) == 0 ? p : u)))) |
468 |
> |
((u = (int)s & UNARRIVED_MASK) == 0 && phase >= 0) ? |
469 |
> |
p : u)))) |
470 |
|
s = state; |
471 |
|
} |
472 |
|
return s; |
533 |
|
this.evenQ = new AtomicReference<QNode>(); |
534 |
|
this.oddQ = new AtomicReference<QNode>(); |
535 |
|
} |
536 |
< |
this.state = (parties == 0) ? (long) EMPTY : |
537 |
< |
((((long) phase) << PHASE_SHIFT) | |
538 |
< |
(((long) parties) << PARTIES_SHIFT) | |
539 |
< |
((long) parties)); |
536 |
> |
this.state = (parties == 0) ? (long)EMPTY : |
537 |
> |
((long)phase << PHASE_SHIFT) | |
538 |
> |
((long)parties << PARTIES_SHIFT) | |
539 |
> |
((long)parties); |
540 |
|
} |
541 |
|
|
542 |
|
/** |
660 |
|
if (root != this) |
661 |
|
return parent.arriveAndAwaitAdvance(); |
662 |
|
long n = s & PARTIES_MASK; // base of next state |
663 |
< |
int nextUnarrived = ((int)n) >>> PARTIES_SHIFT; |
663 |
> |
int nextUnarrived = (int)n >>> PARTIES_SHIFT; |
664 |
|
if (onAdvance(phase, nextUnarrived)) |
665 |
|
n |= TERMINATION_BIT; |
666 |
|
else if (nextUnarrived == 0) |
1116 |
|
|
1117 |
|
// Unsafe mechanics |
1118 |
|
|
1119 |
< |
private static final sun.misc.Unsafe UNSAFE = getUnsafe(); |
1120 |
< |
private static final long stateOffset = |
1121 |
< |
objectFieldOffset("state", Phaser.class); |
1114 |
< |
|
1115 |
< |
private static long objectFieldOffset(String field, Class<?> klazz) { |
1119 |
> |
private static final sun.misc.Unsafe UNSAFE; |
1120 |
> |
private static final long stateOffset; |
1121 |
> |
static { |
1122 |
|
try { |
1123 |
< |
return UNSAFE.objectFieldOffset(klazz.getDeclaredField(field)); |
1124 |
< |
} catch (NoSuchFieldException e) { |
1125 |
< |
// Convert Exception to corresponding Error |
1126 |
< |
NoSuchFieldError error = new NoSuchFieldError(field); |
1127 |
< |
error.initCause(e); |
1128 |
< |
throw error; |
1123 |
> |
UNSAFE = getUnsafe(); |
1124 |
> |
Class<?> k = Phaser.class; |
1125 |
> |
stateOffset = UNSAFE.objectFieldOffset |
1126 |
> |
(k.getDeclaredField("state")); |
1127 |
> |
} catch (Exception e) { |
1128 |
> |
throw new Error(e); |
1129 |
|
} |
1130 |
|
} |
1131 |
|
|