--- jsr166/src/jsr166y/Phaser.java 2008/07/07 16:53:30 1.1
+++ jsr166/src/jsr166y/Phaser.java 2009/07/21 00:15:14 1.14
@@ -5,42 +5,46 @@
*/
package jsr166y;
-import jsr166y.forkjoin.*;
+
import java.util.concurrent.*;
import java.util.concurrent.atomic.*;
import java.util.concurrent.locks.LockSupport;
+import sun.misc.Unsafe;
+import java.lang.reflect.*;
/**
* A reusable synchronization barrier, similar in functionality to a
- * {@link java.util.concurrent.CyclicBarrier}, but supporting more
- * flexible usage.
+ * {@link java.util.concurrent.CyclicBarrier CyclicBarrier} and
+ * {@link java.util.concurrent.CountDownLatch CountDownLatch}
+ * but supporting more flexible usage.
*
*
*
- * - The number of parties synchronizing on the barrier may vary
- * over time. A task may register to be a party in a barrier at any
- * time, and may deregister upon arriving at the barrier. As is the
- * case with most basic synchronization constructs, registration
- * and deregistration affect only internal counts; they do not
- * establish any further internal bookkeeping, so tasks cannot query
- * whether they are registered.
+ *
- The number of parties synchronizing on a phaser may vary over
+ * time. A task may register to be a party at any time, and may
+ * deregister upon arriving at the barrier. As is the case with most
+ * basic synchronization constructs, registration and deregistration
+ * affect only internal counts; they do not establish any further
+ * internal bookkeeping, so tasks cannot query whether they are
+ * registered. (However, you can introduce such bookkeeping by
+ * subclassing this class.)
*
*
- Each generation has an associated phase value, starting at
* zero, and advancing when all parties reach the barrier (wrapping
- * around to zero after reaching Integer.MAX_VALUE).
- *
+ * around to zero after reaching {@code Integer.MAX_VALUE}).
+ *
*
- Like a CyclicBarrier, a Phaser may be repeatedly awaited.
- * Method arriveAndAwaitAdvance has effect analogous to
- * CyclicBarrier.await. However, Phasers separate two
- * aspects of coordination, that may be invoked independently:
+ * Method {@code arriveAndAwaitAdvance} has effect analogous to
+ * {@code CyclicBarrier.await}. However, Phasers separate two
+ * aspects of coordination, that may also be invoked independently:
*
*
*
- * - Arriving at a barrier. Methods arrive and
- * arriveAndDeregister do not block, but return
- * the phase value on entry to the method.
+ *
- Arriving at a barrier. Methods {@code arrive} and
+ * {@code arriveAndDeregister} do not block, but return
+ * the phase value current upon entry to the method.
*
- *
- Awaiting others. Method awaitAdvance requires an
+ *
- Awaiting others. Method {@code awaitAdvance} requires an
* argument indicating the entry phase, and returns when the
* barrier advances to a new phase.
*
@@ -48,112 +52,167 @@ import java.util.concurrent.locks.LockSu
*
* - Barrier actions, performed by the task triggering a phase
* advance while others may be waiting, are arranged by overriding
- * method onAdvance, that also controls termination.
+ * method {@code onAdvance}, that also controls termination.
+ * Overriding this method may be used to similar but more flexible
+ * effect as providing a barrier action to a CyclicBarrier.
*
*
- Phasers may enter a termination state in which all
- * await actions immediately return, indicating (via a negative phase
- * value) that execution is complete. Termination is triggered by
- * executing the overridable onAdvance method that is invoked
- * each time the barrier is tripped. When a Phaser is controlling an
+ * actions immediately return without updating phaser state or waiting
+ * for advance, and indicating (via a negative phase value) that
+ * execution is complete. Termination is triggered by executing the
+ * overridable {@code onAdvance} method that is invoked each time the
+ * barrier is about to be tripped. When a Phaser is controlling an
* action with a fixed number of iterations, it is often convenient to
* override this method to cause termination when the current phase
- * number reaches a threshold. Method forceTermination is
- * also available to assist recovery actions upon failure.
+ * number reaches a threshold. Method {@code forceTermination} is also
+ * available to abruptly release waiting threads and allow them to
+ * terminate.
+ *
+ *
- Phasers may be tiered to reduce contention. Phasers with large
+ * numbers of parties that would otherwise experience heavy
+ * synchronization contention costs may instead be arranged in trees.
+ * This will typically greatly increase throughput even though it
+ * incurs somewhat greater per-operation overhead.
*
- *
- Unlike most synchronizers, a Phaser may also be used with
- * ForkJoinTasks (as well as plain threads).
- *
- *
- By default, awaitAdvance continues to wait even if
- * the current thread is interrupted. And unlike the case in
+ *
- By default, {@code awaitAdvance} continues to wait even if
+ * the waiting thread is interrupted. And unlike the case in
* CyclicBarriers, exceptions encountered while tasks wait
* interruptibly or with timeout do not change the state of the
* barrier. If necessary, you can perform any associated recovery
- * within handlers of those exceptions.
+ * within handlers of those exceptions, often after invoking
+ * {@code forceTermination}.
+ *
+ *
- Phasers ensure lack of starvation when used by ForkJoinTasks.
*
*
*
- * Sample usage:
+ *
Sample usages:
*
- *
[todo: non-FJ example]
+ *
A Phaser may be used instead of a {@code CountDownLatch} to control
+ * a one-shot action serving a variable number of parties. The typical
+ * idiom is for the method setting this up to first register, then
+ * start the actions, then deregister, as in:
+ *
+ *
{@code
+ * void runTasks(List list) {
+ * final Phaser phaser = new Phaser(1); // "1" to register self
+ * for (Runnable r : list) {
+ * phaser.register();
+ * new Thread() {
+ * public void run() {
+ * phaser.arriveAndAwaitAdvance(); // await all creation
+ * r.run();
+ * phaser.arriveAndDeregister(); // signal completion
+ * }
+ * }.start();
+ * }
*
- * A Phaser may be used to support a style of programming in
- * which a task waits for others to complete, without otherwise
- * needing to keep track of which tasks it is waiting for. This is
- * similar to the "sync" construct in Cilk and "clocks" in X10.
- * Special constructions based on such barriers are available using
- * the LinkedAsyncAction and CyclicAction classes,
- * but they can be useful in other contexts as well. For a simple
- * (but not very useful) example, here is a variant of Fibonacci:
- *
- *
- * class BarrierFibonacci extends RecursiveAction {
- * int argument, result;
- * final Phaser parentBarrier;
- * BarrierFibonacci(int n, Phaser parentBarrier) {
- * this.argument = n;
- * this.parentBarrier = parentBarrier;
- * parentBarrier.register();
+ * doSomethingOnBehalfOfWorkers();
+ * phaser.arrive(); // allow threads to start
+ * int p = phaser.arriveAndDeregister(); // deregister self ...
+ * p = phaser.awaitAdvance(p); // ... and await arrival
+ * otherActions(); // do other things while tasks execute
+ * phaser.awaitAdvance(p); // await final completion
+ * }}
+ *
+ * One way to cause a set of threads to repeatedly perform actions
+ * for a given number of iterations is to override {@code onAdvance}:
+ *
+ *
{@code
+ * void startTasks(List list, final int iterations) {
+ * final Phaser phaser = new Phaser() {
+ * public boolean onAdvance(int phase, int registeredParties) {
+ * return phase >= iterations || registeredParties == 0;
+ * }
+ * };
+ * phaser.register();
+ * for (Runnable r : list) {
+ * phaser.register();
+ * new Thread() {
+ * public void run() {
+ * do {
+ * r.run();
+ * phaser.arriveAndAwaitAdvance();
+ * } while(!phaser.isTerminated();
+ * }
+ * }.start();
* }
- * protected void compute() {
- * int n = argument;
- * if (n <= 1)
- * result = n;
- * else {
- * Phaser childBarrier = new Phaser(1);
- * BarrierFibonacci f1 = new BarrierFibonacci(n - 1, childBarrier);
- * BarrierFibonacci f2 = new BarrierFibonacci(n - 2, childBarrier);
- * f1.fork();
- * f2.fork();
- * childBarrier.arriveAndAwait();
- * result = f1.result + f2.result;
+ * phaser.arriveAndDeregister(); // deregister self, don't wait
+ * }}
+ *
+ * To create a set of tasks using a tree of Phasers,
+ * you could use code of the following form, assuming a
+ * Task class with a constructor accepting a Phaser that
+ * it registers for upon construction:
+ *
{@code
+ * void build(Task[] actions, int lo, int hi, Phaser b) {
+ * int step = (hi - lo) / TASKS_PER_PHASER;
+ * if (step > 1) {
+ * int i = lo;
+ * while (i < hi) {
+ * int r = Math.min(i + step, hi);
+ * build(actions, i, r, new Phaser(b));
+ * i = r;
* }
- * parentBarrier.arriveAndDeregister();
+ * } else {
+ * for (int i = lo; i < hi; ++i)
+ * actions[i] = new Task(b);
+ * // assumes new Task(b) performs b.register()
* }
* }
+ * // .. initially called, for n tasks via
+ * build(new Task[n], 0, n, new Phaser());}
+ *
+ * The best value of {@code TASKS_PER_PHASER} depends mainly on
+ * expected barrier synchronization rates. A value as low as four may
+ * be appropriate for extremely small per-barrier task bodies (thus
+ * high rates), or up to hundreds for extremely large ones.
+ *
*
*
* Implementation notes: This implementation restricts the
- * maximum number of parties to 65535. Attempts to register
- * additional parties result in IllegalStateExceptions.
+ * maximum number of parties to 65535. Attempts to register additional
+ * parties result in IllegalStateExceptions. However, you can and
+ * should create tiered phasers to accommodate arbitrarily large sets
+ * of participants.
*/
public class Phaser {
/*
* This class implements an extension of X10 "clocks". Thanks to
- * Vijay Saraswat for the idea of applying it to ForkJoinTasks,
- * and to Vivek Sarkar for enhancements to extend functionality.
+ * Vijay Saraswat for the idea, and to Vivek Sarkar for
+ * enhancements to extend functionality.
*/
/**
* Barrier state representation. Conceptually, a barrier contains
* four values:
- *
+ *
* * parties -- the number of parties to wait (16 bits)
* * unarrived -- the number of parties yet to hit barrier (16 bits)
* * phase -- the generation of the barrier (31 bits)
* * terminated -- set if barrier is terminated (1 bit)
*
* However, to efficiently maintain atomicity, these values are
- * packed into a single AtomicLong. Termination uses the sign bit
- * of 32 bit representation of phase, so phase is set to -1 on
- * termination.
- */
- private final AtomicLong state;
-
- /**
- * Head of Treiber stack for waiting nonFJ threads.
+ * packed into a single (atomic) long. Termination uses the sign
+ * bit of 32 bit representation of phase, so phase is set to -1 on
+ * termination. Good performance relies on keeping state decoding
+ * and encoding simple, and keeping race windows short.
+ *
+ * Note: there are some cheats in arrive() that rely on unarrived
+ * count being lowest 16 bits.
*/
- private final AtomicReference head = new AtomicReference();
+ private volatile long state;
private static final int ushortBits = 16;
- private static final int ushortMask = (1 << ushortBits) - 1;
- private static final int phaseMask = 0x7fffffff;
+ private static final int ushortMask = 0xffff;
+ private static final int phaseMask = 0x7fffffff;
private static int unarrivedOf(long s) {
return (int)(s & ushortMask);
}
private static int partiesOf(long s) {
- return (int)(s & (ushortMask << 16)) >>> 16;
+ return ((int)s) >>> 16;
}
private static int phaseOf(long s) {
@@ -165,277 +224,479 @@ public class Phaser {
}
private static long stateFor(int phase, int parties, int unarrived) {
- return (((long)phase) << 32) | ((parties << 16) | unarrived);
+ return ((((long)phase) << 32) | (((long)parties) << 16) |
+ (long)unarrived);
}
- private static IllegalStateException badBounds(int parties, int unarrived) {
- return new IllegalStateException("Attempt to set " + unarrived +
- " unarrived of " + parties + " parties");
+ private static long trippedStateFor(int phase, int parties) {
+ long lp = (long)parties;
+ return (((long)phase) << 32) | (lp << 16) | lp;
+ }
+
+ /**
+ * Returns message string for bad bounds exceptions.
+ */
+ private static String badBounds(int parties, int unarrived) {
+ return ("Attempt to set " + unarrived +
+ " unarrived of " + parties + " parties");
+ }
+
+ /**
+ * The parent of this phaser, or null if none
+ */
+ private final Phaser parent;
+
+ /**
+ * The root of Phaser tree. Equals this if not in a tree. Used to
+ * support faster state push-down.
+ */
+ private final Phaser root;
+
+ // Wait queues
+
+ /**
+ * Heads of Treiber stacks for waiting threads. To eliminate
+ * contention while releasing some threads while adding others, we
+ * use two of them, alternating across even and odd phases.
+ */
+ private final AtomicReference evenQ = new AtomicReference();
+ private final AtomicReference oddQ = new AtomicReference();
+
+ private AtomicReference queueFor(int phase) {
+ return (phase & 1) == 0? evenQ : oddQ;
+ }
+
+ /**
+ * Returns current state, first resolving lagged propagation from
+ * root if necessary.
+ */
+ private long getReconciledState() {
+ return parent == null? state : reconcileState();
+ }
+
+ /**
+ * Recursively resolves state.
+ */
+ private long reconcileState() {
+ Phaser p = parent;
+ long s = state;
+ if (p != null) {
+ while (unarrivedOf(s) == 0 && phaseOf(s) != phaseOf(root.state)) {
+ long parentState = p.getReconciledState();
+ int parentPhase = phaseOf(parentState);
+ int phase = phaseOf(s = state);
+ if (phase != parentPhase) {
+ long next = trippedStateFor(parentPhase, partiesOf(s));
+ if (casState(s, next)) {
+ releaseWaiters(phase);
+ s = next;
+ }
+ }
+ }
+ }
+ return s;
}
/**
* Creates a new Phaser without any initially registered parties,
- * and initial phase number 0.
+ * initial phase number 0, and no parent. Any thread using this
+ * Phaser will need to first register for it.
*/
public Phaser() {
- state = new AtomicLong(stateFor(0, 0, 0));
+ this(null);
}
/**
* Creates a new Phaser with the given numbers of registered
- * unarrived parties and initial phase number 0.
- * @param parties the number of parties required to trip barrier.
+ * unarrived parties, initial phase number 0, and no parent.
+ *
+ * @param parties the number of parties required to trip barrier
* @throws IllegalArgumentException if parties less than zero
- * or greater than the maximum number of parties supported.
+ * or greater than the maximum number of parties supported
*/
public Phaser(int parties) {
+ this(null, parties);
+ }
+
+ /**
+ * Creates a new Phaser with the given parent, without any
+ * initially registered parties. If parent is non-null this phaser
+ * is registered with the parent and its initial phase number is
+ * the same as that of parent phaser.
+ *
+ * @param parent the parent phaser
+ */
+ public Phaser(Phaser parent) {
+ int phase = 0;
+ this.parent = parent;
+ if (parent != null) {
+ this.root = parent.root;
+ phase = parent.register();
+ }
+ else
+ this.root = this;
+ this.state = trippedStateFor(phase, 0);
+ }
+
+ /**
+ * Creates a new Phaser with the given parent and numbers of
+ * registered unarrived parties. If parent is non-null, this phaser
+ * is registered with the parent and its initial phase number is
+ * the same as that of parent phaser.
+ *
+ * @param parent the parent phaser
+ * @param parties the number of parties required to trip barrier
+ * @throws IllegalArgumentException if parties less than zero
+ * or greater than the maximum number of parties supported
+ */
+ public Phaser(Phaser parent, int parties) {
if (parties < 0 || parties > ushortMask)
throw new IllegalArgumentException("Illegal number of parties");
- state = new AtomicLong(stateFor(0, parties, parties));
+ int phase = 0;
+ this.parent = parent;
+ if (parent != null) {
+ this.root = parent.root;
+ phase = parent.register();
+ }
+ else
+ this.root = this;
+ this.state = trippedStateFor(phase, parties);
}
/**
* Adds a new unarrived party to this phaser.
+ *
+ * @return the current barrier phase number upon registration
+ * @throws IllegalStateException if attempting to register more
+ * than the maximum supported number of parties
+ */
+ public int register() {
+ return doRegister(1);
+ }
+
+ /**
+ * Adds the given number of new unarrived parties to this phaser.
+ *
+ * @param parties the number of parties required to trip barrier
* @return the current barrier phase number upon registration
* @throws IllegalStateException if attempting to register more
- * than the maximum supported number of parties.
+ * than the maximum supported number of parties
*/
- public int register() { // increment both parties and unarrived
- final AtomicLong state = this.state;
+ public int bulkRegister(int parties) {
+ if (parties < 0)
+ throw new IllegalArgumentException();
+ if (parties == 0)
+ return getPhase();
+ return doRegister(parties);
+ }
+
+ /**
+ * Shared code for register, bulkRegister
+ */
+ private int doRegister(int registrations) {
+ int phase;
for (;;) {
- long s = state.get();
- int phase = phaseOf(s);
- int parties = partiesOf(s) + 1;
- int unarrived = unarrivedOf(s) + 1;
+ long s = getReconciledState();
+ phase = phaseOf(s);
+ int unarrived = unarrivedOf(s) + registrations;
+ int parties = partiesOf(s) + registrations;
+ if (phase < 0)
+ break;
if (parties > ushortMask || unarrived > ushortMask)
- throw badBounds(parties, unarrived);
- if (state.compareAndSet(s, stateFor(phase, parties, unarrived)))
- return phase;
+ throw new IllegalStateException(badBounds(parties, unarrived));
+ if (phase == phaseOf(root.state) &&
+ casState(s, stateFor(phase, parties, unarrived)))
+ break;
}
+ return phase;
}
/**
* Arrives at the barrier, but does not wait for others. (You can
* in turn wait for others via {@link #awaitAdvance}).
*
- * @return the current barrier phase number upon entry to
- * this method, or a negative value if terminated;
- * @throws IllegalStateException if the number of unarrived
- * parties would become negative.
+ * @return the barrier phase number upon entry to this method, or a
+ * negative value if terminated
+ * @throws IllegalStateException if not terminated and the number
+ * of unarrived parties would become negative
*/
- public int arrive() { // decrement unarrived. If zero, trip
- final AtomicLong state = this.state;
+ public int arrive() {
+ int phase;
for (;;) {
- long s = state.get();
- int phase = phaseOf(s);
+ long s = state;
+ phase = phaseOf(s);
+ if (phase < 0)
+ break;
int parties = partiesOf(s);
int unarrived = unarrivedOf(s) - 1;
- if (unarrived < 0)
- throw badBounds(parties, unarrived);
- if (unarrived == 0 && phase >= 0) {
- trip(phase, parties);
- return phase;
+ if (unarrived > 0) { // Not the last arrival
+ if (casState(s, s - 1)) // s-1 adds one arrival
+ break;
}
- if (state.compareAndSet(s, stateFor(phase, parties, unarrived)))
- return phase;
+ else if (unarrived == 0) { // the last arrival
+ Phaser par = parent;
+ if (par == null) { // directly trip
+ if (casState
+ (s,
+ trippedStateFor(onAdvance(phase, parties)? -1 :
+ ((phase + 1) & phaseMask), parties))) {
+ releaseWaiters(phase);
+ break;
+ }
+ }
+ else { // cascade to parent
+ if (casState(s, s - 1)) { // zeroes unarrived
+ par.arrive();
+ reconcileState();
+ break;
+ }
+ }
+ }
+ else if (phase != phaseOf(root.state)) // or if unreconciled
+ reconcileState();
+ else
+ throw new IllegalStateException(badBounds(parties, unarrived));
}
+ return phase;
}
/**
* Arrives at the barrier, and deregisters from it, without
- * waiting for others.
+ * waiting for others. Deregistration reduces number of parties
+ * required to trip the barrier in future phases. If this phaser
+ * has a parent, and deregistration causes this phaser to have
+ * zero parties, this phaser is also deregistered from its parent.
*
* @return the current barrier phase number upon entry to
- * this method, or a negative value if terminated;
- * @throws IllegalStateException if the number of registered or
- * unarrived parties would become negative.
- */
- public int arriveAndDeregister() { // Same as arrive, plus decrement parties
- final AtomicLong state = this.state;
+ * this method, or a negative value if terminated
+ * @throws IllegalStateException if not terminated and the number
+ * of registered or unarrived parties would become negative
+ */
+ public int arriveAndDeregister() {
+ // similar code to arrive, but too different to merge
+ Phaser par = parent;
+ int phase;
for (;;) {
- long s = state.get();
- int phase = phaseOf(s);
+ long s = state;
+ phase = phaseOf(s);
+ if (phase < 0)
+ break;
int parties = partiesOf(s) - 1;
int unarrived = unarrivedOf(s) - 1;
- if (parties < 0 || unarrived < 0)
- throw badBounds(parties, unarrived);
- if (unarrived == 0 && phase >= 0) {
- trip(phase, parties);
- return phase;
+ if (parties >= 0) {
+ if (unarrived > 0 || (unarrived == 0 && par != null)) {
+ if (casState
+ (s,
+ stateFor(phase, parties, unarrived))) {
+ if (unarrived == 0) {
+ par.arriveAndDeregister();
+ reconcileState();
+ }
+ break;
+ }
+ continue;
+ }
+ if (unarrived == 0) {
+ if (casState
+ (s,
+ trippedStateFor(onAdvance(phase, parties)? -1 :
+ ((phase + 1) & phaseMask), parties))) {
+ releaseWaiters(phase);
+ break;
+ }
+ continue;
+ }
+ if (par != null && phase != phaseOf(root.state)) {
+ reconcileState();
+ continue;
+ }
}
- if (state.compareAndSet(s, stateFor(phase, parties, unarrived)))
- return phase;
+ throw new IllegalStateException(badBounds(parties, unarrived));
}
+ return phase;
}
/**
- * Arrives at the barrier and awaits others. Unlike other arrival
- * methods, this method returns the arrival index of the
- * caller. The caller tripping the barrier returns zero, the
- * previous caller 1, and so on.
- * @return the arrival index
- * @throws IllegalStateException if the number of unarrived
- * parties would become negative.
+ * Arrives at the barrier and awaits others. Equivalent in effect
+ * to {@code awaitAdvance(arrive())}. If you instead need to
+ * await with interruption of timeout, and/or deregister upon
+ * arrival, you can arrange them using analogous constructions.
+ *
+ * @return the phase on entry to this method
+ * @throws IllegalStateException if not terminated and the number
+ * of unarrived parties would become negative
*/
public int arriveAndAwaitAdvance() {
- final AtomicLong state = this.state;
- for (;;) {
- long s = state.get();
- int phase = phaseOf(s);
- int parties = partiesOf(s);
- int unarrived = unarrivedOf(s) - 1;
- if (unarrived < 0)
- throw badBounds(parties, unarrived);
- if (unarrived == 0 && phase >= 0) {
- trip(phase, parties);
- return 0;
- }
- if (state.compareAndSet(s, stateFor(phase, parties, unarrived))) {
- awaitAdvance(phase);
- return unarrived;
- }
- }
+ return awaitAdvance(arrive());
}
/**
* Awaits the phase of the barrier to advance from the given
- * value, or returns immediately if this barrier is terminated
+ * value, or returns immediately if argument is negative or this
+ * barrier is terminated.
+ *
* @param phase the phase on entry to this method
* @return the phase on exit from this method
*/
public int awaitAdvance(int phase) {
if (phase < 0)
return phase;
- Thread current = Thread.currentThread();
- if (current instanceof ForkJoinWorkerThread)
- return helpingWait(phase);
- if (untimedWait(current, phase, false))
- current.interrupt();
- return phaseOf(state.get());
+ long s = getReconciledState();
+ int p = phaseOf(s);
+ if (p != phase)
+ return p;
+ if (unarrivedOf(s) == 0 && parent != null)
+ parent.awaitAdvance(phase);
+ // Fall here even if parent waited, to reconcile and help release
+ return untimedWait(phase);
}
/**
* Awaits the phase of the barrier to advance from the given
- * value, or returns immediately if this barrier is terminated, or
- * throws InterruptedException if interrupted while waiting.
+ * value, or returns immediately if argument is negative or this
+ * barrier is terminated, or throws InterruptedException if
+ * interrupted while waiting.
+ *
* @param phase the phase on entry to this method
* @return the phase on exit from this method
* @throws InterruptedException if thread interrupted while waiting
*/
- public int awaitAdvanceInterruptibly(int phase) throws InterruptedException {
+ public int awaitAdvanceInterruptibly(int phase)
+ throws InterruptedException {
if (phase < 0)
return phase;
- Thread current = Thread.currentThread();
- if (current instanceof ForkJoinWorkerThread)
- return helpingWait(phase);
- else if (Thread.interrupted() || untimedWait(current, phase, true))
- throw new InterruptedException();
- else
- return phaseOf(state.get());
+ long s = getReconciledState();
+ int p = phaseOf(s);
+ if (p != phase)
+ return p;
+ if (unarrivedOf(s) == 0 && parent != null)
+ parent.awaitAdvanceInterruptibly(phase);
+ return interruptibleWait(phase);
}
/**
* Awaits the phase of the barrier to advance from the given value
- * or the given timeout elapses, or returns immediately if this
- * barrier is terminated
+ * or the given timeout elapses, or returns immediately if
+ * argument is negative or this barrier is terminated.
+ *
* @param phase the phase on entry to this method
* @return the phase on exit from this method
* @throws InterruptedException if thread interrupted while waiting
* @throws TimeoutException if timed out while waiting
*/
- public int awaitAdvanceInterruptibly(int phase, long timeout, TimeUnit unit)
+ public int awaitAdvanceInterruptibly(int phase, long timeout, TimeUnit unit)
throws InterruptedException, TimeoutException {
if (phase < 0)
return phase;
- long nanos = unit.toNanos(timeout);
- Thread current = Thread.currentThread();
- if (current instanceof ForkJoinWorkerThread)
- return timedHelpingWait(phase, nanos);
- timedWait(current, phase, nanos);
- return phaseOf(state.get());
+ long s = getReconciledState();
+ int p = phaseOf(s);
+ if (p != phase)
+ return p;
+ if (unarrivedOf(s) == 0 && parent != null)
+ parent.awaitAdvanceInterruptibly(phase, timeout, unit);
+ return timedWait(phase, unit.toNanos(timeout));
}
/**
* Forces this barrier to enter termination state. Counts of
- * arrived and registered parties are unaffected. This method may
- * be useful for coordinating recovery after one or more tasks
- * encounter unexpected exceptions.
+ * arrived and registered parties are unaffected. If this phaser
+ * has a parent, it too is terminated. This method may be useful
+ * for coordinating recovery after one or more tasks encounter
+ * unexpected exceptions.
*/
public void forceTermination() {
- final AtomicLong state = this.state;
for (;;) {
- long s = state.get();
+ long s = getReconciledState();
int phase = phaseOf(s);
int parties = partiesOf(s);
int unarrived = unarrivedOf(s);
if (phase < 0 ||
- state.compareAndSet(s, stateFor(-1, parties, unarrived))) {
- if (head.get() != null)
- releaseWaiters(-1);
+ casState(s, stateFor(-1, parties, unarrived))) {
+ releaseWaiters(0);
+ releaseWaiters(1);
+ if (parent != null)
+ parent.forceTermination();
return;
}
}
}
/**
- * Resets the barrier with the given numbers of registered unarrived
- * parties and phase number 0. This method allows repeated reuse
- * of this barrier, but only if it is somehow known not to be in
- * use for other purposes.
- * @param parties the number of parties required to trip barrier.
- * @throws IllegalArgumentException if parties less than zero
- * or greater than the maximum number of parties supported.
+ * Returns the current phase number. The maximum phase number is
+ * {@code Integer.MAX_VALUE}, after which it restarts at
+ * zero. Upon termination, the phase number is negative.
+ *
+ * @return the phase number, or a negative value if terminated
*/
- public void reset(int parties) {
- if (parties < 0 || parties > ushortMask)
- throw new IllegalArgumentException("Illegal number of parties");
- state.set(stateFor(0, parties, parties));
- if (head.get() != null)
- releaseWaiters(0);
+ public final int getPhase() {
+ return phaseOf(getReconciledState());
}
/**
- * Returns the current phase number. The maximum phase number is
- * Integer.MAX_VALUE, after which it restarts at
- * zero. Upon termination, the phase number is negative.
- * @return the phase number, or a negative value if terminated
+ * Returns {@code true} if the current phase number equals the given phase.
+ *
+ * @param phase the phase
+ * @return {@code true} if the current phase number equals the given phase
*/
- public int getPhase() {
- return phaseOf(state.get());
+ public final boolean hasPhase(int phase) {
+ return phaseOf(getReconciledState()) == phase;
}
/**
* Returns the number of parties registered at this barrier.
+ *
* @return the number of parties
*/
public int getRegisteredParties() {
- return partiesOf(state.get());
+ return partiesOf(state);
}
/**
* Returns the number of parties that have arrived at the current
* phase of this barrier.
+ *
* @return the number of arrived parties
*/
public int getArrivedParties() {
- return arrivedOf(state.get());
+ return arrivedOf(state);
}
/**
* Returns the number of registered parties that have not yet
* arrived at the current phase of this barrier.
+ *
* @return the number of unarrived parties
*/
public int getUnarrivedParties() {
- return unarrivedOf(state.get());
+ return unarrivedOf(state);
}
/**
- * Returns true if this barrier has been terminated
- * @return true if this barrier has been terminated
+ * Returns the parent of this phaser, or null if none.
+ *
+ * @return the parent of this phaser, or null if none
+ */
+ public Phaser getParent() {
+ return parent;
+ }
+
+ /**
+ * Returns the root ancestor of this phaser, which is the same as
+ * this phaser if it has no parent.
+ *
+ * @return the root ancestor of this phaser
+ */
+ public Phaser getRoot() {
+ return root;
+ }
+
+ /**
+ * Returns {@code true} if this barrier has been terminated.
+ *
+ * @return {@code true} if this barrier has been terminated
*/
public boolean isTerminated() {
- return phaseOf(state.get()) < 0;
+ return getPhase() < 0;
}
/**
@@ -444,252 +705,271 @@ public class Phaser {
* barrier is tripped (and thus all other waiting parties are
* dormant). If it returns true, then, rather than advance the
* phase number, this barrier will be set to a final termination
- * state, and subsequent calls to isTerminated will
+ * state, and subsequent calls to {@code isTerminated} will
* return true.
- *
+ *
* The default version returns true when the number of
* registered parties is zero. Normally, overrides that arrange
* termination for other reasons should also preserve this
* property.
*
+ *
You may override this method to perform an action with side
+ * effects visible to participating tasks, but it is in general
+ * only sensible to do so in designs where all parties register
+ * before any arrive, and all {@code awaitAdvance} at each phase.
+ * Otherwise, you cannot ensure lack of interference. In
+ * particular, this method may be invoked more than once per
+ * transition if other parties successfully register while the
+ * invocation of this method is in progress, thus postponing the
+ * transition until those parties also arrive, re-triggering this
+ * method.
+ *
* @param phase the phase number on entering the barrier
- * @param registeredParties the current number of registered
- * parties.
- * @return true if this barrier should terminate
+ * @param registeredParties the current number of registered parties
+ * @return {@code true} if this barrier should terminate
*/
protected boolean onAdvance(int phase, int registeredParties) {
return registeredParties <= 0;
}
/**
- * Returns a string identifying this barrier, as well as its
+ * Returns a string identifying this phaser, as well as its
* state. The state, in brackets, includes the String {@code
- * "phase ="} followed by the phase number, {@code "parties ="}
+ * "phase = "} followed by the phase number, {@code "parties = "}
* followed by the number of registered parties, and {@code
- * "arrived ="} followed by the number of arrived parties
+ * "arrived = "} followed by the number of arrived parties.
*
* @return a string identifying this barrier, as well as its state
*/
public String toString() {
- long s = state.get();
- return super.toString() + "[phase = " + phaseOf(s) + " parties = " + partiesOf(s) + " arrived = " + arrivedOf(s) + "]";
+ long s = getReconciledState();
+ return super.toString() +
+ "[phase = " + phaseOf(s) +
+ " parties = " + partiesOf(s) +
+ " arrived = " + arrivedOf(s) + "]";
}
- // methods for tripping and waiting
+ // methods for waiting
/**
- * Advance the current phase (or terminate)
+ * Wait nodes for Treiber stack representing wait queue
*/
- private void trip(int phase, int parties) {
- int next = onAdvance(phase, parties)? -1 : ((phase + 1) & phaseMask);
- state.set(stateFor(next, parties, parties));
- if (head.get() != null)
- releaseWaiters(next);
- }
-
- private int helpingWait(int phase) {
- final AtomicLong state = this.state;
- int p;
- while ((p = phaseOf(state.get())) == phase) {
- ForkJoinTask> t = ForkJoinWorkerThread.pollTask();
- if (t != null) {
- if ((p = phaseOf(state.get())) == phase)
- t.exec();
- else { // push task and exit if barrier advanced
- t.fork();
- break;
- }
+ static final class QNode implements ForkJoinPool.ManagedBlocker {
+ final Phaser phaser;
+ final int phase;
+ final long startTime;
+ final long nanos;
+ final boolean timed;
+ final boolean interruptible;
+ volatile boolean wasInterrupted = false;
+ volatile Thread thread; // nulled to cancel wait
+ QNode next;
+ QNode(Phaser phaser, int phase, boolean interruptible,
+ boolean timed, long startTime, long nanos) {
+ this.phaser = phaser;
+ this.phase = phase;
+ this.timed = timed;
+ this.interruptible = interruptible;
+ this.startTime = startTime;
+ this.nanos = nanos;
+ thread = Thread.currentThread();
+ }
+ public boolean isReleasable() {
+ return (thread == null ||
+ phaser.getPhase() != phase ||
+ (interruptible && wasInterrupted) ||
+ (timed && (nanos - (System.nanoTime() - startTime)) <= 0));
+ }
+ public boolean block() {
+ if (Thread.interrupted()) {
+ wasInterrupted = true;
+ if (interruptible)
+ return true;
+ }
+ if (!timed)
+ LockSupport.park(this);
+ else {
+ long waitTime = nanos - (System.nanoTime() - startTime);
+ if (waitTime <= 0)
+ return true;
+ LockSupport.parkNanos(this, waitTime);
}
+ return isReleasable();
}
- return p;
- }
-
- private int timedHelpingWait(int phase, long nanos) throws TimeoutException {
- final AtomicLong state = this.state;
- long lastTime = System.nanoTime();
- int p;
- while ((p = phaseOf(state.get())) == phase) {
- long now = System.nanoTime();
- nanos -= now - lastTime;
- lastTime = now;
- if (nanos <= 0) {
- if ((p = phaseOf(state.get())) == phase)
- throw new TimeoutException();
- else
- break;
- }
- ForkJoinTask> t = ForkJoinWorkerThread.pollTask();
+ void signal() {
+ Thread t = thread;
if (t != null) {
- if ((p = phaseOf(state.get())) == phase)
- t.exec();
- else { // push task and exit if barrier advanced
- t.fork();
- break;
+ thread = null;
+ LockSupport.unpark(t);
+ }
+ }
+ boolean doWait() {
+ if (thread != null) {
+ try {
+ ForkJoinPool.managedBlock(this, false);
+ } catch (InterruptedException ie) {
}
}
+ return wasInterrupted;
}
- return p;
+
}
/**
- * Wait nodes for Treiber stack representing wait queue for non-FJ
- * tasks. The waiting scheme is an adaptation of the one used in
- * forkjoin.PoolBarrier.
+ * Removes and signals waiting threads from wait queue.
*/
- static final class QNode {
- QNode next;
- volatile Thread thread; // nulled to cancel wait
- final int phase;
- QNode(Thread t, int c) {
- thread = t;
- phase = c;
+ private void releaseWaiters(int phase) {
+ AtomicReference head = queueFor(phase);
+ QNode q;
+ while ((q = head.get()) != null) {
+ if (head.compareAndSet(q, q.next))
+ q.signal();
}
}
- private void releaseWaiters(int currentPhase) {
- final AtomicReference head = this.head;
- QNode p;
- while ((p = head.get()) != null && p.phase != currentPhase) {
- if (head.compareAndSet(p, null)) {
- do {
- Thread t = p.thread;
- if (t != null) {
- p.thread = null;
- LockSupport.unpark(t);
- }
- } while ((p = p.next) != null);
- }
- }
- }
-
- /** The number of CPUs, for spin control */
- static final int NCPUS = Runtime.getRuntime().availableProcessors();
-
- /**
- * The number of times to spin before blocking in timed waits.
- * The value is empirically derived
- */
- static final int maxTimedSpins = (NCPUS < 2)? 0 : 32;
-
/**
- * The number of times to spin before blocking in untimed waits.
- * This is greater than timed value because untimed waits spin
- * faster since they don't need to check times on each spin.
+ * Tries to enqueue given node in the appropriate wait queue.
+ *
+ * @return true if successful
*/
- static final int maxUntimedSpins = maxTimedSpins * 32;
+ private boolean tryEnqueue(QNode node) {
+ AtomicReference head = queueFor(node.phase);
+ return head.compareAndSet(node.next = head.get(), node);
+ }
/**
- * The number of nanoseconds for which it is faster to spin
- * rather than to use timed park. A rough estimate suffices.
+ * Enqueues node and waits unless aborted or signalled.
+ *
+ * @return current phase
*/
- static final long spinForTimeoutThreshold = 1000L;
+ private int untimedWait(int phase) {
+ QNode node = null;
+ boolean queued = false;
+ boolean interrupted = false;
+ int p;
+ while ((p = getPhase()) == phase) {
+ if (Thread.interrupted())
+ interrupted = true;
+ else if (node == null)
+ node = new QNode(this, phase, false, false, 0, 0);
+ else if (!queued)
+ queued = tryEnqueue(node);
+ else
+ interrupted = node.doWait();
+ }
+ if (node != null)
+ node.thread = null;
+ releaseWaiters(phase);
+ if (interrupted)
+ Thread.currentThread().interrupt();
+ return p;
+ }
/**
- * Enqueues node and waits unless aborted or signalled.
+ * Interruptible version
+ * @return current phase
*/
- private boolean untimedWait(Thread thread, int currentPhase,
- boolean abortOnInterrupt) {
- final AtomicReference head = this.head;
- final AtomicLong state = this.state;
- boolean wasInterrupted = false;
+ private int interruptibleWait(int phase) throws InterruptedException {
QNode node = null;
boolean queued = false;
- int spins = maxUntimedSpins;
- while (phaseOf(state.get()) == currentPhase) {
- QNode h;
- if (node != null && queued) {
- if (node.thread != null) {
- LockSupport.park();
- if (Thread.interrupted()) {
- wasInterrupted = true;
- if (abortOnInterrupt)
- break;
- }
- }
- }
- else if ((h = head.get()) != null && h.phase != currentPhase) {
- if (phaseOf(state.get()) == currentPhase) { // must recheck
- if (head.compareAndSet(h, h.next)) {
- Thread t = h.thread; // help clear out old waiters
- if (t != null) {
- h.thread = null;
- LockSupport.unpark(t);
- }
- }
- }
- else
- break;
- }
- else if (node != null)
- queued = head.compareAndSet(node.next = h, node);
- else if (spins <= 0)
- node = new QNode(thread, currentPhase);
+ boolean interrupted = false;
+ int p;
+ while ((p = getPhase()) == phase && !interrupted) {
+ if (Thread.interrupted())
+ interrupted = true;
+ else if (node == null)
+ node = new QNode(this, phase, true, false, 0, 0);
+ else if (!queued)
+ queued = tryEnqueue(node);
else
- --spins;
+ interrupted = node.doWait();
}
if (node != null)
node.thread = null;
- return wasInterrupted;
+ if (p != phase || (p = getPhase()) != phase)
+ releaseWaiters(phase);
+ if (interrupted)
+ throw new InterruptedException();
+ return p;
}
/**
- * Messier timeout version
+ * Timeout version.
+ * @return current phase
*/
- private void timedWait(Thread thread, int currentPhase, long nanos)
+ private int timedWait(int phase, long nanos)
throws InterruptedException, TimeoutException {
- final AtomicReference head = this.head;
- final AtomicLong state = this.state;
- long lastTime = System.nanoTime();
+ long startTime = System.nanoTime();
QNode node = null;
boolean queued = false;
- int spins = maxTimedSpins;
- while (phaseOf(state.get()) == currentPhase) {
- QNode h;
- long now = System.nanoTime();
- nanos -= now - lastTime;
- lastTime = now;
- if (nanos <= 0) {
- if (node != null)
- node.thread = null;
- if (phaseOf(state.get()) == currentPhase)
- throw new TimeoutException();
- else
- break;
- }
- else if (node != null && queued) {
- if (node.thread != null &&
- nanos > spinForTimeoutThreshold) {
- // LockSupport.parkNanos(this, nanos);
- LockSupport.parkNanos(nanos);
- if (Thread.interrupted()) {
- node.thread = null;
- throw new InterruptedException();
- }
- }
- }
- else if ((h = head.get()) != null && h.phase != currentPhase) {
- if (phaseOf(state.get()) == currentPhase) { // must recheck
- if (head.compareAndSet(h, h.next)) {
- Thread t = h.thread; // help clear out old waiters
- if (t != null) {
- h.thread = null;
- LockSupport.unpark(t);
- }
- }
- }
- else
- break;
- }
- else if (node != null)
- queued = head.compareAndSet(node.next = h, node);
- else if (spins <= 0)
- node = new QNode(thread, currentPhase);
+ boolean interrupted = false;
+ int p;
+ while ((p = getPhase()) == phase && !interrupted) {
+ if (Thread.interrupted())
+ interrupted = true;
+ else if (nanos - (System.nanoTime() - startTime) <= 0)
+ break;
+ else if (node == null)
+ node = new QNode(this, phase, true, true, startTime, nanos);
+ else if (!queued)
+ queued = tryEnqueue(node);
else
- --spins;
+ interrupted = node.doWait();
}
if (node != null)
node.thread = null;
+ if (p != phase || (p = getPhase()) != phase)
+ releaseWaiters(phase);
+ if (interrupted)
+ throw new InterruptedException();
+ if (p == phase)
+ throw new TimeoutException();
+ return p;
}
-}
+ // Temporary Unsafe mechanics for preliminary release
+ private static Unsafe getUnsafe() throws Throwable {
+ try {
+ return Unsafe.getUnsafe();
+ } catch (SecurityException se) {
+ try {
+ return java.security.AccessController.doPrivileged
+ (new java.security.PrivilegedExceptionAction() {
+ public Unsafe run() throws Exception {
+ return getUnsafePrivileged();
+ }});
+ } catch (java.security.PrivilegedActionException e) {
+ throw e.getCause();
+ }
+ }
+ }
+
+ private static Unsafe getUnsafePrivileged()
+ throws NoSuchFieldException, IllegalAccessException {
+ Field f = Unsafe.class.getDeclaredField("theUnsafe");
+ f.setAccessible(true);
+ return (Unsafe) f.get(null);
+ }
+
+ private static long fieldOffset(String fieldName)
+ throws NoSuchFieldException {
+ return _unsafe.objectFieldOffset
+ (Phaser.class.getDeclaredField(fieldName));
+ }
+ static final Unsafe _unsafe;
+ static final long stateOffset;
+
+ static {
+ try {
+ _unsafe = getUnsafe();
+ stateOffset = fieldOffset("state");
+ } catch (Throwable e) {
+ throw new RuntimeException("Could not initialize intrinsics", e);
+ }
+ }
+
+ final boolean casState(long cmp, long val) {
+ return _unsafe.compareAndSwapLong(this, stateOffset, cmp, val);
+ }
+}