12 |
|
import java.util.concurrent.locks.LockSupport; |
13 |
|
|
14 |
|
/** |
15 |
< |
* A reusable synchronization barrier, similar in functionality to a |
15 |
> |
* A reusable synchronization barrier, similar in functionality to |
16 |
|
* {@link java.util.concurrent.CyclicBarrier CyclicBarrier} and |
17 |
|
* {@link java.util.concurrent.CountDownLatch CountDownLatch} |
18 |
|
* but supporting more flexible usage. |
19 |
|
* |
20 |
< |
* <ul> |
21 |
< |
* |
22 |
< |
* <li> The number of parties <em>registered</em> to synchronize on a |
23 |
< |
* phaser may vary over time. Tasks may be registered at any time |
24 |
< |
* (using methods {@link #register}, {@link #bulkRegister}, or forms |
25 |
< |
* of constructors establishing initial numbers of parties), and may |
26 |
< |
* optionally be deregistered upon any arrival (using {@link |
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 |
24 |
> |
* constructors establishing initial numbers of parties), and |
25 |
> |
* optionally deregistered upon any arrival (using {@link |
26 |
|
* #arriveAndDeregister}). As is the case with most basic |
27 |
|
* synchronization constructs, registration and deregistration affect |
28 |
|
* only internal counts; they do not establish any further internal |
29 |
< |
* bookkeeping, so tasks cannot query whether they are |
30 |
< |
* registered. (However, you can introduce such bookkeeping by |
31 |
< |
* subclassing this class.) |
32 |
< |
* |
33 |
< |
* <li> Each generation has an associated phase value, starting at |
34 |
< |
* zero, and advancing when all parties arrive at the barrier |
35 |
< |
* (wrapping around to zero after reaching {@code Integer.MAX_VALUE}). |
36 |
< |
* |
37 |
< |
* <li> Like a {@code CyclicBarrier}, a phaser may be repeatedly |
38 |
< |
* awaited. Method {@link #arriveAndAwaitAdvance} has effect |
39 |
< |
* analogous to {@link java.util.concurrent.CyclicBarrier#await |
40 |
< |
* CyclicBarrier.await}. However, phasers separate two aspects of |
41 |
< |
* coordination, which may also be invoked independently: |
29 |
> |
* bookkeeping, so tasks cannot query whether they are registered. |
30 |
> |
* (However, you can introduce such bookkeeping by subclassing this |
31 |
> |
* class.) |
32 |
> |
* |
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 |
37 |
> |
* generation of a {@code Phaser} has an associated phase number. The |
38 |
> |
* phase number starts at zero, and advances when all parties arrive |
39 |
> |
* at the barrier, wrapping around to zero after reaching {@code |
40 |
> |
* Integer.MAX_VALUE}. The use of phase numbers enables independent |
41 |
> |
* control of actions upon arrival at a barrier and upon awaiting |
42 |
> |
* others, via two kinds of methods that may be invoked by any |
43 |
> |
* registered party: |
44 |
|
* |
45 |
|
* <ul> |
46 |
|
* |
47 |
< |
* <li> Arriving at a barrier. Methods {@link #arrive} and |
48 |
< |
* {@link #arriveAndDeregister} do not block, but return |
49 |
< |
* an associated <em>arrival phase number</em>; |
50 |
< |
* that is, the phase number of the barrier to which the |
51 |
< |
* arrival applied. |
52 |
< |
* |
53 |
< |
* <li> Awaiting others. Method {@link #awaitAdvance} requires an |
54 |
< |
* argument indicating an arrival phase number, and returns |
55 |
< |
* when the barrier advances to a new phase. |
56 |
< |
* </ul> |
47 |
> |
* <li> <b>Arrival.</b> Methods {@link #arrive} and |
48 |
> |
* {@link #arriveAndDeregister} record arrival at a |
49 |
> |
* barrier. These methods do not block, but return an associated |
50 |
> |
* <em>arrival phase number</em>; that is, the phase number of |
51 |
> |
* the barrier to which the arrival applied. When the final |
52 |
> |
* party for a given phase arrives, an optional barrier action |
53 |
> |
* is performed and the phase advances. Barrier actions, |
54 |
> |
* performed by the party triggering a phase advance, are |
55 |
> |
* arranged by overriding method {@link #onAdvance(int, int)}, |
56 |
> |
* which also controls termination. Overriding this method is |
57 |
> |
* similar to, but more flexible than, providing a barrier |
58 |
> |
* action to a {@code CyclicBarrier}. |
59 |
> |
* |
60 |
> |
* <li> <b>Waiting.</b> Method {@link #awaitAdvance} requires an |
61 |
> |
* argument indicating an arrival phase number, and returns when |
62 |
> |
* the barrier advances to (or is already at) a different phase. |
63 |
> |
* Unlike similar constructions using {@code CyclicBarrier}, |
64 |
> |
* method {@code awaitAdvance} continues to wait even if the |
65 |
> |
* waiting thread is interrupted. Interruptible and timeout |
66 |
> |
* versions are also available, but exceptions encountered while |
67 |
> |
* tasks wait interruptibly or with timeout do not change the |
68 |
> |
* state of the barrier. If necessary, you can perform any |
69 |
> |
* associated recovery within handlers of those exceptions, |
70 |
> |
* often after invoking {@code forceTermination}. Phasers may |
71 |
> |
* also be used by tasks executing in a {@link ForkJoinPool}, |
72 |
> |
* which will ensure sufficient parallelism to execute tasks |
73 |
> |
* when others are blocked waiting for a phase to advance. |
74 |
|
* |
75 |
+ |
* </ul> |
76 |
|
* |
77 |
< |
* <li> Barrier actions, performed by the task triggering a phase |
78 |
< |
* advance, are arranged by overriding method {@link #onAdvance(int, |
79 |
< |
* int)}, which also controls termination. Overriding this method is |
80 |
< |
* similar to, but more flexible than, providing a barrier action to a |
81 |
< |
* {@code CyclicBarrier}. |
82 |
< |
* |
83 |
< |
* <li> Phasers may enter a <em>termination</em> state in which all |
65 |
< |
* actions immediately return without updating phaser state or waiting |
66 |
< |
* for advance, and indicating (via a negative phase value) that |
67 |
< |
* execution is complete. Termination is triggered when an invocation |
68 |
< |
* of {@code onAdvance} returns {@code true}. When a phaser is |
69 |
< |
* controlling an action with a fixed number of iterations, it is |
77 |
> |
* <p> <b>Termination.</b> A {@code Phaser} may enter a |
78 |
> |
* <em>termination</em> state in which all synchronization methods |
79 |
> |
* immediately return without updating phaser state or waiting for |
80 |
> |
* advance, and indicating (via a negative phase value) that execution |
81 |
> |
* is complete. Termination is triggered when an invocation of {@code |
82 |
> |
* onAdvance} returns {@code true}. As illustrated below, when |
83 |
> |
* phasers control actions with a fixed number of iterations, it is |
84 |
|
* often convenient to override this method to cause termination when |
85 |
|
* the current phase number reaches a threshold. Method {@link |
86 |
|
* #forceTermination} is also available to abruptly release waiting |
87 |
|
* threads and allow them to terminate. |
88 |
|
* |
89 |
< |
* <li> Phasers may be tiered to reduce contention. Phasers with large |
89 |
> |
* <p> <b>Tiering.</b> Phasers may be <em>tiered</em> (i.e., arranged |
90 |
> |
* in tree structures) to reduce contention. Phasers with large |
91 |
|
* numbers of parties that would otherwise experience heavy |
92 |
< |
* synchronization contention costs may instead be arranged in trees. |
93 |
< |
* This will typically greatly increase throughput even though it |
94 |
< |
* incurs somewhat greater per-operation overhead. |
95 |
< |
* |
96 |
< |
* <li> By default, {@code awaitAdvance} continues to wait even if |
97 |
< |
* the waiting thread is interrupted. And unlike the case in |
98 |
< |
* {@code CyclicBarrier}, exceptions encountered while tasks wait |
99 |
< |
* interruptibly or with timeout do not change the state of the |
100 |
< |
* barrier. If necessary, you can perform any associated recovery |
101 |
< |
* within handlers of those exceptions, often after invoking |
102 |
< |
* {@code forceTermination}. |
103 |
< |
* |
104 |
< |
* <li>Phasers may be used to coordinate tasks executing in a {@link |
105 |
< |
* ForkJoinPool}, which will ensure sufficient parallelism to execute |
106 |
< |
* tasks when others are blocked waiting for a phase to advance. |
107 |
< |
* |
108 |
< |
* </ul> |
92 |
> |
* synchronization contention costs may instead be set up so that |
93 |
> |
* groups of sub-phasers share a common parent. This may greatly |
94 |
> |
* increase throughput even though it incurs greater per-operation |
95 |
> |
* overhead. |
96 |
> |
* |
97 |
> |
* <p><b>Monitoring.</b> While synchronization methods may be invoked |
98 |
> |
* only by registered parties, the current state of a phaser may be |
99 |
> |
* monitored by any caller. At any given moment there are {@link |
100 |
> |
* #getRegisteredParties} parties in total, of which {@link |
101 |
> |
* #getArrivedParties} have arrived at the current phase ({@link |
102 |
> |
* #getPhase}). When the remaining ({@link #getUnarrivedParties}) |
103 |
> |
* parties arrive, the phase advances; thus, this value is always |
104 |
> |
* greater than zero if there are any registered parties. The values |
105 |
> |
* returned by these methods may reflect transient states and so are |
106 |
> |
* not in general useful for synchronization control. Method {@link |
107 |
> |
* #toString} returns snapshots of these state queries in a form |
108 |
> |
* convenient for informal monitoring. |
109 |
|
* |
110 |
|
* <p><b>Sample usages:</b> |
111 |
|
* |
138 |
|
* <pre> {@code |
139 |
|
* void startTasks(List<Runnable> tasks, final int iterations) { |
140 |
|
* final Phaser phaser = new Phaser() { |
141 |
< |
* public boolean onAdvance(int phase, int registeredParties) { |
141 |
> |
* protected boolean onAdvance(int phase, int registeredParties) { |
142 |
|
* return phase >= iterations || registeredParties == 0; |
143 |
|
* } |
144 |
|
* }; |
157 |
|
* phaser.arriveAndDeregister(); // deregister self, don't wait |
158 |
|
* }}</pre> |
159 |
|
* |
160 |
+ |
* If the main task must later await termination, it |
161 |
+ |
* may re-register and then execute a similar loop: |
162 |
+ |
* <pre> {@code |
163 |
+ |
* // ... |
164 |
+ |
* phaser.register(); |
165 |
+ |
* while (!phaser.isTerminated()) |
166 |
+ |
* phaser.arriveAndAwaitAdvance(); |
167 |
+ |
* }</pre> |
168 |
+ |
* |
169 |
+ |
* Related constructions may be used to await particular phase numbers |
170 |
+ |
* in contexts where you are sure that the phase will never wrap around |
171 |
+ |
* {@code Integer.MAX_VALUE}. For example: |
172 |
+ |
* |
173 |
+ |
* <pre> {@code |
174 |
+ |
* void awaitPhase(Phaser phaser, int phase) { |
175 |
+ |
* int p = phaser.register(); // assumes caller not already registered |
176 |
+ |
* while (p < phase) { |
177 |
+ |
* if (phaser.isTerminated()) |
178 |
+ |
* // ... deal with unexpected termination |
179 |
+ |
* else |
180 |
+ |
* p = phaser.arriveAndAwaitAdvance(); |
181 |
+ |
* } |
182 |
+ |
* phaser.arriveAndDeregister(); |
183 |
+ |
* } |
184 |
+ |
* }</pre> |
185 |
+ |
* |
186 |
+ |
* |
187 |
|
* <p>To create a set of tasks using a tree of phasers, |
188 |
|
* you could use code of the following form, assuming a |
189 |
|
* Task class with a constructor accepting a phaser that |
460 |
|
|
461 |
|
/** |
462 |
|
* Arrives at the barrier, but does not wait for others. (You can |
463 |
< |
* in turn wait for others via {@link #awaitAdvance}). |
463 |
> |
* in turn wait for others via {@link #awaitAdvance}). It is an |
464 |
> |
* unenforced usage error for an unregistered party to invoke this |
465 |
> |
* method. |
466 |
|
* |
467 |
|
* @return the arrival phase number, or a negative value if terminated |
468 |
|
* @throws IllegalStateException if not terminated and the number |
514 |
|
* required to trip the barrier in future phases. If this phaser |
515 |
|
* has a parent, and deregistration causes this phaser to have |
516 |
|
* zero parties, this phaser also arrives at and is deregistered |
517 |
< |
* from its parent. |
517 |
> |
* from its parent. It is an unenforced usage error for an |
518 |
> |
* unregistered party to invoke this method. |
519 |
|
* |
520 |
|
* @return the arrival phase number, or a negative value if terminated |
521 |
|
* @throws IllegalStateException if not terminated and the number |
571 |
|
* interruption or timeout, you can arrange this with an analogous |
572 |
|
* construction using one of the other forms of the awaitAdvance |
573 |
|
* method. If instead you need to deregister upon arrival use |
574 |
< |
* {@code arriveAndDeregister}. |
574 |
> |
* {@code arriveAndDeregister}. It is an unenforced usage error |
575 |
> |
* for an unregistered party to invoke this method. |
576 |
|
* |
577 |
|
* @return the arrival phase number, or a negative number if terminated |
578 |
|
* @throws IllegalStateException if not terminated and the number |
586 |
|
* Awaits the phase of the barrier to advance from the given phase |
587 |
|
* value, returning immediately if the current phase of the |
588 |
|
* barrier is not equal to the given phase value or this barrier |
589 |
< |
* is terminated. |
589 |
> |
* is terminated. It is an unenforced usage error for an |
590 |
> |
* unregistered party to invoke this method. |
591 |
|
* |
592 |
|
* @param phase an arrival phase number, or negative value if |
593 |
|
* terminated; this argument is normally the value returned by a |
610 |
|
|
611 |
|
/** |
612 |
|
* Awaits the phase of the barrier to advance from the given phase |
613 |
< |
* value, throwing {@code InterruptedException} if interrupted while |
614 |
< |
* waiting, or returning immediately if the current phase of the |
615 |
< |
* barrier is not equal to the given phase value or this barrier |
616 |
< |
* is terminated. |
613 |
> |
* value, throwing {@code InterruptedException} if interrupted |
614 |
> |
* while waiting, or returning immediately if the current phase of |
615 |
> |
* the barrier is not equal to the given phase value or this |
616 |
> |
* barrier is terminated. It is an unenforced usage error for an |
617 |
> |
* unregistered party to invoke this method. |
618 |
|
* |
619 |
|
* @param phase an arrival phase number, or negative value if |
620 |
|
* terminated; this argument is normally the value returned by a |
638 |
|
|
639 |
|
/** |
640 |
|
* Awaits the phase of the barrier to advance from the given phase |
641 |
< |
* value or the given timeout to elapse, throwing |
642 |
< |
* {@code InterruptedException} if interrupted while waiting, or |
643 |
< |
* returning immediately if the current phase of the barrier is not |
644 |
< |
* equal to the given phase value or this barrier is terminated. |
641 |
> |
* value or the given timeout to elapse, throwing {@code |
642 |
> |
* InterruptedException} if interrupted while waiting, or |
643 |
> |
* returning immediately if the current phase of the barrier is |
644 |
> |
* not equal to the given phase value or this barrier is |
645 |
> |
* terminated. It is an unenforced usage error for an |
646 |
> |
* unregistered party to invoke this method. |
647 |
|
* |
648 |
|
* @param phase an arrival phase number, or negative value if |
649 |
|
* terminated; this argument is normally the value returned by a |
716 |
|
} |
717 |
|
|
718 |
|
/** |
719 |
< |
* Returns the number of parties that have arrived at the current |
720 |
< |
* phase of this barrier. |
719 |
> |
* Returns the number of registered parties that have arrived at |
720 |
> |
* the current phase of this barrier. |
721 |
|
* |
722 |
|
* @return the number of arrived parties |
723 |
|
*/ |