author | dl |
Sat, 02 Dec 2017 10:03:41 -0800 | |
changeset 48046 | 98801bd22f5b |
parent 47302 | f517fa4f4dc6 |
child 48540 | 221cf8307606 |
permissions | -rw-r--r-- |
2 | 1 |
/* |
2 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
|
3 |
* |
|
4 |
* This code is free software; you can redistribute it and/or modify it |
|
5 |
* under the terms of the GNU General Public License version 2 only, as |
|
5506 | 6 |
* published by the Free Software Foundation. Oracle designates this |
2 | 7 |
* particular file as subject to the "Classpath" exception as provided |
5506 | 8 |
* by Oracle in the LICENSE file that accompanied this code. |
2 | 9 |
* |
10 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
|
11 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
12 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
13 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
14 |
* accompanied this code). |
|
15 |
* |
|
16 |
* You should have received a copy of the GNU General Public License version |
|
17 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
18 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
19 |
* |
|
5506 | 20 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
21 |
* or visit www.oracle.com if you need additional information or have any |
|
22 |
* questions. |
|
2 | 23 |
*/ |
24 |
||
25 |
/* |
|
26 |
* This file is available under and governed by the GNU General Public |
|
27 |
* License version 2 only, as published by the Free Software Foundation. |
|
28 |
* However, the following notice accompanied the original version of this |
|
29 |
* file: |
|
30 |
* |
|
31 |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
|
32 |
* Expert Group and released to the public domain, as explained at |
|
9242
ef138d47df58
7034657: Update Creative Commons license URL in legal notices
dl
parents:
7518
diff
changeset
|
33 |
* http://creativecommons.org/publicdomain/zero/1.0/ |
2 | 34 |
*/ |
35 |
||
36 |
package java.util.concurrent.locks; |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
37 |
|
39725
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
38 |
import java.lang.invoke.MethodHandles; |
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
39 |
import java.lang.invoke.VarHandle; |
14325
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
40 |
import java.util.ArrayList; |
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
41 |
import java.util.Collection; |
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
42 |
import java.util.Date; |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
43 |
import java.util.concurrent.TimeUnit; |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
44 |
import java.util.concurrent.locks.AbstractQueuedSynchronizer.Node; |
2 | 45 |
|
46 |
/** |
|
47 |
* A version of {@link AbstractQueuedSynchronizer} in |
|
18576 | 48 |
* which synchronization state is maintained as a {@code long}. |
2 | 49 |
* This class has exactly the same structure, properties, and methods |
18576 | 50 |
* as {@code AbstractQueuedSynchronizer} with the exception |
2 | 51 |
* that all state-related parameters and results are defined |
18576 | 52 |
* as {@code long} rather than {@code int}. This class |
2 | 53 |
* may be useful when creating synchronizers such as |
54 |
* multilevel locks and barriers that require |
|
55 |
* 64 bits of state. |
|
56 |
* |
|
57 |
* <p>See {@link AbstractQueuedSynchronizer} for usage |
|
58 |
* notes and examples. |
|
59 |
* |
|
60 |
* @since 1.6 |
|
61 |
* @author Doug Lea |
|
62 |
*/ |
|
63 |
public abstract class AbstractQueuedLongSynchronizer |
|
64 |
extends AbstractOwnableSynchronizer |
|
65 |
implements java.io.Serializable { |
|
66 |
||
67 |
private static final long serialVersionUID = 7373984972572414692L; |
|
68 |
||
69 |
/* |
|
47302
f517fa4f4dc6
8187408: AbstractQueuedSynchronizer wait queue corrupted when thread awaits without holding the lock
dl
parents:
47216
diff
changeset
|
70 |
* To keep sources in sync, the remainder of this source file is |
f517fa4f4dc6
8187408: AbstractQueuedSynchronizer wait queue corrupted when thread awaits without holding the lock
dl
parents:
47216
diff
changeset
|
71 |
* exactly cloned from AbstractQueuedSynchronizer, replacing class |
f517fa4f4dc6
8187408: AbstractQueuedSynchronizer wait queue corrupted when thread awaits without holding the lock
dl
parents:
47216
diff
changeset
|
72 |
* name and changing ints related with sync state to longs. Please |
f517fa4f4dc6
8187408: AbstractQueuedSynchronizer wait queue corrupted when thread awaits without holding the lock
dl
parents:
47216
diff
changeset
|
73 |
* keep it that way. |
f517fa4f4dc6
8187408: AbstractQueuedSynchronizer wait queue corrupted when thread awaits without holding the lock
dl
parents:
47216
diff
changeset
|
74 |
*/ |
2 | 75 |
|
76 |
/** |
|
18576 | 77 |
* Creates a new {@code AbstractQueuedLongSynchronizer} instance |
2 | 78 |
* with initial synchronization state of zero. |
79 |
*/ |
|
80 |
protected AbstractQueuedLongSynchronizer() { } |
|
81 |
||
82 |
/** |
|
83 |
* Head of the wait queue, lazily initialized. Except for |
|
84 |
* initialization, it is modified only via method setHead. Note: |
|
85 |
* If head exists, its waitStatus is guaranteed not to be |
|
86 |
* CANCELLED. |
|
87 |
*/ |
|
88 |
private transient volatile Node head; |
|
89 |
||
90 |
/** |
|
91 |
* Tail of the wait queue, lazily initialized. Modified only via |
|
92 |
* method enq to add new wait node. |
|
93 |
*/ |
|
94 |
private transient volatile Node tail; |
|
95 |
||
96 |
/** |
|
97 |
* The synchronization state. |
|
98 |
*/ |
|
99 |
private volatile long state; |
|
100 |
||
101 |
/** |
|
102 |
* Returns the current value of synchronization state. |
|
18576 | 103 |
* This operation has memory semantics of a {@code volatile} read. |
2 | 104 |
* @return current state value |
105 |
*/ |
|
106 |
protected final long getState() { |
|
107 |
return state; |
|
108 |
} |
|
109 |
||
110 |
/** |
|
111 |
* Sets the value of synchronization state. |
|
18576 | 112 |
* This operation has memory semantics of a {@code volatile} write. |
2 | 113 |
* @param newState the new state value |
114 |
*/ |
|
115 |
protected final void setState(long newState) { |
|
45937
646816090183
8178409: Miscellaneous changes imported from jsr166 CVS 2017-07
dl
parents:
39725
diff
changeset
|
116 |
// See JDK-8180620: Clarify VarHandle mixed-access subtleties |
39725
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
117 |
STATE.setVolatile(this, newState); |
2 | 118 |
} |
119 |
||
120 |
/** |
|
121 |
* Atomically sets synchronization state to the given updated |
|
122 |
* value if the current state value equals the expected value. |
|
18576 | 123 |
* This operation has memory semantics of a {@code volatile} read |
2 | 124 |
* and write. |
125 |
* |
|
126 |
* @param expect the expected value |
|
127 |
* @param update the new value |
|
18576 | 128 |
* @return {@code true} if successful. False return indicates that the actual |
2 | 129 |
* value was not equal to the expected value. |
130 |
*/ |
|
131 |
protected final boolean compareAndSetState(long expect, long update) { |
|
39725
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
132 |
return STATE.compareAndSet(this, expect, update); |
2 | 133 |
} |
134 |
||
135 |
// Queuing utilities |
|
136 |
||
137 |
/** |
|
138 |
* The number of nanoseconds for which it is faster to spin |
|
139 |
* rather than to use timed park. A rough estimate suffices |
|
140 |
* to improve responsiveness with very short timeouts. |
|
141 |
*/ |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
142 |
static final long SPIN_FOR_TIMEOUT_THRESHOLD = 1000L; |
2 | 143 |
|
144 |
/** |
|
145 |
* Inserts node into queue, initializing if necessary. See picture above. |
|
146 |
* @param node the node to insert |
|
147 |
* @return node's predecessor |
|
148 |
*/ |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
149 |
private Node enq(Node node) { |
2 | 150 |
for (;;) { |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
151 |
Node oldTail = tail; |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
152 |
if (oldTail != null) { |
39725
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
153 |
node.setPrevRelaxed(oldTail); |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
154 |
if (compareAndSetTail(oldTail, node)) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
155 |
oldTail.next = node; |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
156 |
return oldTail; |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
157 |
} |
2 | 158 |
} else { |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
159 |
initializeSyncQueue(); |
2 | 160 |
} |
161 |
} |
|
162 |
} |
|
163 |
||
164 |
/** |
|
165 |
* Creates and enqueues node for current thread and given mode. |
|
166 |
* |
|
167 |
* @param mode Node.EXCLUSIVE for exclusive, Node.SHARED for shared |
|
168 |
* @return the new node |
|
169 |
*/ |
|
170 |
private Node addWaiter(Node mode) { |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
171 |
Node node = new Node(mode); |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
172 |
|
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
173 |
for (;;) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
174 |
Node oldTail = tail; |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
175 |
if (oldTail != null) { |
39725
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
176 |
node.setPrevRelaxed(oldTail); |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
177 |
if (compareAndSetTail(oldTail, node)) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
178 |
oldTail.next = node; |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
179 |
return node; |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
180 |
} |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
181 |
} else { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
182 |
initializeSyncQueue(); |
2 | 183 |
} |
184 |
} |
|
185 |
} |
|
186 |
||
187 |
/** |
|
188 |
* Sets head of queue to be node, thus dequeuing. Called only by |
|
189 |
* acquire methods. Also nulls out unused fields for sake of GC |
|
190 |
* and to suppress unnecessary signals and traversals. |
|
191 |
* |
|
192 |
* @param node the node |
|
193 |
*/ |
|
194 |
private void setHead(Node node) { |
|
195 |
head = node; |
|
196 |
node.thread = null; |
|
197 |
node.prev = null; |
|
198 |
} |
|
199 |
||
200 |
/** |
|
201 |
* Wakes up node's successor, if one exists. |
|
202 |
* |
|
203 |
* @param node the node |
|
204 |
*/ |
|
205 |
private void unparkSuccessor(Node node) { |
|
206 |
/* |
|
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
207 |
* If status is negative (i.e., possibly needing signal) try |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
208 |
* to clear in anticipation of signalling. It is OK if this |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
209 |
* fails or if status is changed by waiting thread. |
2 | 210 |
*/ |
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
211 |
int ws = node.waitStatus; |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
212 |
if (ws < 0) |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
213 |
node.compareAndSetWaitStatus(ws, 0); |
2 | 214 |
|
215 |
/* |
|
216 |
* Thread to unpark is held in successor, which is normally |
|
217 |
* just the next node. But if cancelled or apparently null, |
|
218 |
* traverse backwards from tail to find the actual |
|
219 |
* non-cancelled successor. |
|
220 |
*/ |
|
221 |
Node s = node.next; |
|
222 |
if (s == null || s.waitStatus > 0) { |
|
223 |
s = null; |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
224 |
for (Node p = tail; p != node && p != null; p = p.prev) |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
225 |
if (p.waitStatus <= 0) |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
226 |
s = p; |
2 | 227 |
} |
228 |
if (s != null) |
|
229 |
LockSupport.unpark(s.thread); |
|
230 |
} |
|
231 |
||
232 |
/** |
|
18576 | 233 |
* Release action for shared mode -- signals successor and ensures |
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
234 |
* propagation. (Note: For exclusive mode, release just amounts |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
235 |
* to calling unparkSuccessor of head if it needs signal.) |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
236 |
*/ |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
237 |
private void doReleaseShared() { |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
238 |
/* |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
239 |
* Ensure that a release propagates, even if there are other |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
240 |
* in-progress acquires/releases. This proceeds in the usual |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
241 |
* way of trying to unparkSuccessor of head if it needs |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
242 |
* signal. But if it does not, status is set to PROPAGATE to |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
243 |
* ensure that upon release, propagation continues. |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
244 |
* Additionally, we must loop in case a new node is added |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
245 |
* while we are doing this. Also, unlike other uses of |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
246 |
* unparkSuccessor, we need to know if CAS to reset status |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
247 |
* fails, if so rechecking. |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
248 |
*/ |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
249 |
for (;;) { |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
250 |
Node h = head; |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
251 |
if (h != null && h != tail) { |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
252 |
int ws = h.waitStatus; |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
253 |
if (ws == Node.SIGNAL) { |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
254 |
if (!h.compareAndSetWaitStatus(Node.SIGNAL, 0)) |
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
255 |
continue; // loop to recheck cases |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
256 |
unparkSuccessor(h); |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
257 |
} |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
258 |
else if (ws == 0 && |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
259 |
!h.compareAndSetWaitStatus(0, Node.PROPAGATE)) |
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
260 |
continue; // loop on failed CAS |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
261 |
} |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
262 |
if (h == head) // loop if head changed |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
263 |
break; |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
264 |
} |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
265 |
} |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
266 |
|
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
267 |
/** |
2 | 268 |
* Sets head of queue, and checks if successor may be waiting |
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
269 |
* in shared mode, if so propagating if either propagate > 0 or |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
270 |
* PROPAGATE status was set. |
2 | 271 |
* |
272 |
* @param node the node |
|
273 |
* @param propagate the return value from a tryAcquireShared |
|
274 |
*/ |
|
275 |
private void setHeadAndPropagate(Node node, long propagate) { |
|
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
276 |
Node h = head; // Record old head for check below |
2 | 277 |
setHead(node); |
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
278 |
/* |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
279 |
* Try to signal next queued node if: |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
280 |
* Propagation was indicated by caller, |
20766
d94cb38041e6
7011859: java/util/concurrent/Semaphore/RacingReleases.java failing
dl
parents:
18576
diff
changeset
|
281 |
* or was recorded (as h.waitStatus either before |
d94cb38041e6
7011859: java/util/concurrent/Semaphore/RacingReleases.java failing
dl
parents:
18576
diff
changeset
|
282 |
* or after setHead) by a previous operation |
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
283 |
* (note: this uses sign-check of waitStatus because |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
284 |
* PROPAGATE status may transition to SIGNAL.) |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
285 |
* and |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
286 |
* The next node is waiting in shared mode, |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
287 |
* or we don't know, because it appears null |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
288 |
* |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
289 |
* The conservatism in both of these checks may cause |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
290 |
* unnecessary wake-ups, but only when there are multiple |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
291 |
* racing acquires/releases, so most need signals now or soon |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
292 |
* anyway. |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
293 |
*/ |
20766
d94cb38041e6
7011859: java/util/concurrent/Semaphore/RacingReleases.java failing
dl
parents:
18576
diff
changeset
|
294 |
if (propagate > 0 || h == null || h.waitStatus < 0 || |
d94cb38041e6
7011859: java/util/concurrent/Semaphore/RacingReleases.java failing
dl
parents:
18576
diff
changeset
|
295 |
(h = head) == null || h.waitStatus < 0) { |
2 | 296 |
Node s = node.next; |
297 |
if (s == null || s.isShared()) |
|
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
298 |
doReleaseShared(); |
2 | 299 |
} |
300 |
} |
|
301 |
||
302 |
// Utilities for various versions of acquire |
|
303 |
||
304 |
/** |
|
305 |
* Cancels an ongoing attempt to acquire. |
|
306 |
* |
|
307 |
* @param node the node |
|
308 |
*/ |
|
309 |
private void cancelAcquire(Node node) { |
|
310 |
// Ignore if node doesn't exist |
|
311 |
if (node == null) |
|
312 |
return; |
|
313 |
||
314 |
node.thread = null; |
|
315 |
||
316 |
// Skip cancelled predecessors |
|
317 |
Node pred = node.prev; |
|
318 |
while (pred.waitStatus > 0) |
|
319 |
node.prev = pred = pred.prev; |
|
320 |
||
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
321 |
// predNext is the apparent node to unsplice. CASes below will |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
322 |
// fail if not, in which case, we lost race vs another cancel |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
323 |
// or signal, so no further action is necessary. |
2 | 324 |
Node predNext = pred.next; |
325 |
||
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
326 |
// Can use unconditional write instead of CAS here. |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
327 |
// After this atomic step, other Nodes can skip past us. |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
328 |
// Before, we are free of interference from other threads. |
2 | 329 |
node.waitStatus = Node.CANCELLED; |
330 |
||
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
331 |
// If we are the tail, remove ourselves. |
2 | 332 |
if (node == tail && compareAndSetTail(node, pred)) { |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
333 |
pred.compareAndSetNext(predNext, null); |
2 | 334 |
} else { |
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
335 |
// If successor needs signal, try to set pred's next-link |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
336 |
// so it will get one. Otherwise wake it up to propagate. |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
337 |
int ws; |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
338 |
if (pred != head && |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
339 |
((ws = pred.waitStatus) == Node.SIGNAL || |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
340 |
(ws <= 0 && pred.compareAndSetWaitStatus(ws, Node.SIGNAL))) && |
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
341 |
pred.thread != null) { |
2 | 342 |
Node next = node.next; |
343 |
if (next != null && next.waitStatus <= 0) |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
344 |
pred.compareAndSetNext(predNext, next); |
2 | 345 |
} else { |
346 |
unparkSuccessor(node); |
|
347 |
} |
|
348 |
||
349 |
node.next = node; // help GC |
|
350 |
} |
|
351 |
} |
|
352 |
||
353 |
/** |
|
354 |
* Checks and updates status for a node that failed to acquire. |
|
355 |
* Returns true if thread should block. This is the main signal |
|
18576 | 356 |
* control in all acquire loops. Requires that pred == node.prev. |
2 | 357 |
* |
358 |
* @param pred node's predecessor holding status |
|
359 |
* @param node the node |
|
360 |
* @return {@code true} if thread should block |
|
361 |
*/ |
|
362 |
private static boolean shouldParkAfterFailedAcquire(Node pred, Node node) { |
|
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
363 |
int ws = pred.waitStatus; |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
364 |
if (ws == Node.SIGNAL) |
2 | 365 |
/* |
366 |
* This node has already set status asking a release |
|
367 |
* to signal it, so it can safely park. |
|
368 |
*/ |
|
369 |
return true; |
|
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
370 |
if (ws > 0) { |
2 | 371 |
/* |
372 |
* Predecessor was cancelled. Skip over predecessors and |
|
373 |
* indicate retry. |
|
374 |
*/ |
|
375 |
do { |
|
376 |
node.prev = pred = pred.prev; |
|
377 |
} while (pred.waitStatus > 0); |
|
378 |
pred.next = node; |
|
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
379 |
} else { |
2 | 380 |
/* |
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
381 |
* waitStatus must be 0 or PROPAGATE. Indicate that we |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
382 |
* need a signal, but don't park yet. Caller will need to |
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
383 |
* retry to make sure it cannot acquire before parking. |
2 | 384 |
*/ |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
385 |
pred.compareAndSetWaitStatus(ws, Node.SIGNAL); |
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
386 |
} |
2 | 387 |
return false; |
388 |
} |
|
389 |
||
390 |
/** |
|
391 |
* Convenience method to interrupt current thread. |
|
392 |
*/ |
|
14325
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
393 |
static void selfInterrupt() { |
2 | 394 |
Thread.currentThread().interrupt(); |
395 |
} |
|
396 |
||
397 |
/** |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
398 |
* Convenience method to park and then check if interrupted. |
2 | 399 |
* |
400 |
* @return {@code true} if interrupted |
|
401 |
*/ |
|
402 |
private final boolean parkAndCheckInterrupt() { |
|
403 |
LockSupport.park(this); |
|
404 |
return Thread.interrupted(); |
|
405 |
} |
|
406 |
||
407 |
/* |
|
408 |
* Various flavors of acquire, varying in exclusive/shared and |
|
409 |
* control modes. Each is mostly the same, but annoyingly |
|
410 |
* different. Only a little bit of factoring is possible due to |
|
411 |
* interactions of exception mechanics (including ensuring that we |
|
412 |
* cancel if tryAcquire throws exception) and other control, at |
|
413 |
* least not without hurting performance too much. |
|
414 |
*/ |
|
415 |
||
416 |
/** |
|
417 |
* Acquires in exclusive uninterruptible mode for thread already in |
|
418 |
* queue. Used by condition wait methods as well as acquire. |
|
419 |
* |
|
420 |
* @param node the node |
|
421 |
* @param arg the acquire argument |
|
422 |
* @return {@code true} if interrupted while waiting |
|
423 |
*/ |
|
424 |
final boolean acquireQueued(final Node node, long arg) { |
|
48046
98801bd22f5b
8191937: Lost interrupt in AbstractQueuedSynchronizer when tryAcquire methods throw
dl
parents:
47302
diff
changeset
|
425 |
boolean interrupted = false; |
2 | 426 |
try { |
427 |
for (;;) { |
|
428 |
final Node p = node.predecessor(); |
|
429 |
if (p == head && tryAcquire(arg)) { |
|
430 |
setHead(node); |
|
431 |
p.next = null; // help GC |
|
432 |
return interrupted; |
|
433 |
} |
|
48046
98801bd22f5b
8191937: Lost interrupt in AbstractQueuedSynchronizer when tryAcquire methods throw
dl
parents:
47302
diff
changeset
|
434 |
if (shouldParkAfterFailedAcquire(p, node)) |
98801bd22f5b
8191937: Lost interrupt in AbstractQueuedSynchronizer when tryAcquire methods throw
dl
parents:
47302
diff
changeset
|
435 |
interrupted |= parkAndCheckInterrupt(); |
2 | 436 |
} |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
437 |
} catch (Throwable t) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
438 |
cancelAcquire(node); |
48046
98801bd22f5b
8191937: Lost interrupt in AbstractQueuedSynchronizer when tryAcquire methods throw
dl
parents:
47302
diff
changeset
|
439 |
if (interrupted) |
98801bd22f5b
8191937: Lost interrupt in AbstractQueuedSynchronizer when tryAcquire methods throw
dl
parents:
47302
diff
changeset
|
440 |
selfInterrupt(); |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
441 |
throw t; |
2 | 442 |
} |
443 |
} |
|
444 |
||
445 |
/** |
|
446 |
* Acquires in exclusive interruptible mode. |
|
447 |
* @param arg the acquire argument |
|
448 |
*/ |
|
449 |
private void doAcquireInterruptibly(long arg) |
|
450 |
throws InterruptedException { |
|
451 |
final Node node = addWaiter(Node.EXCLUSIVE); |
|
452 |
try { |
|
453 |
for (;;) { |
|
454 |
final Node p = node.predecessor(); |
|
455 |
if (p == head && tryAcquire(arg)) { |
|
456 |
setHead(node); |
|
457 |
p.next = null; // help GC |
|
458 |
return; |
|
459 |
} |
|
460 |
if (shouldParkAfterFailedAcquire(p, node) && |
|
461 |
parkAndCheckInterrupt()) |
|
462 |
throw new InterruptedException(); |
|
463 |
} |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
464 |
} catch (Throwable t) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
465 |
cancelAcquire(node); |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
466 |
throw t; |
2 | 467 |
} |
468 |
} |
|
469 |
||
470 |
/** |
|
471 |
* Acquires in exclusive timed mode. |
|
472 |
* |
|
473 |
* @param arg the acquire argument |
|
474 |
* @param nanosTimeout max wait time |
|
475 |
* @return {@code true} if acquired |
|
476 |
*/ |
|
477 |
private boolean doAcquireNanos(long arg, long nanosTimeout) |
|
14325
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
478 |
throws InterruptedException { |
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
479 |
if (nanosTimeout <= 0L) |
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
480 |
return false; |
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
481 |
final long deadline = System.nanoTime() + nanosTimeout; |
2 | 482 |
final Node node = addWaiter(Node.EXCLUSIVE); |
483 |
try { |
|
484 |
for (;;) { |
|
485 |
final Node p = node.predecessor(); |
|
486 |
if (p == head && tryAcquire(arg)) { |
|
487 |
setHead(node); |
|
488 |
p.next = null; // help GC |
|
489 |
return true; |
|
490 |
} |
|
14325
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
491 |
nanosTimeout = deadline - System.nanoTime(); |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
492 |
if (nanosTimeout <= 0L) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
493 |
cancelAcquire(node); |
2 | 494 |
return false; |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
495 |
} |
2 | 496 |
if (shouldParkAfterFailedAcquire(p, node) && |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
497 |
nanosTimeout > SPIN_FOR_TIMEOUT_THRESHOLD) |
2 | 498 |
LockSupport.parkNanos(this, nanosTimeout); |
499 |
if (Thread.interrupted()) |
|
500 |
throw new InterruptedException(); |
|
501 |
} |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
502 |
} catch (Throwable t) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
503 |
cancelAcquire(node); |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
504 |
throw t; |
2 | 505 |
} |
506 |
} |
|
507 |
||
508 |
/** |
|
509 |
* Acquires in shared uninterruptible mode. |
|
510 |
* @param arg the acquire argument |
|
511 |
*/ |
|
512 |
private void doAcquireShared(long arg) { |
|
513 |
final Node node = addWaiter(Node.SHARED); |
|
48046
98801bd22f5b
8191937: Lost interrupt in AbstractQueuedSynchronizer when tryAcquire methods throw
dl
parents:
47302
diff
changeset
|
514 |
boolean interrupted = false; |
2 | 515 |
try { |
516 |
for (;;) { |
|
517 |
final Node p = node.predecessor(); |
|
518 |
if (p == head) { |
|
519 |
long r = tryAcquireShared(arg); |
|
520 |
if (r >= 0) { |
|
521 |
setHeadAndPropagate(node, r); |
|
522 |
p.next = null; // help GC |
|
523 |
return; |
|
524 |
} |
|
525 |
} |
|
48046
98801bd22f5b
8191937: Lost interrupt in AbstractQueuedSynchronizer when tryAcquire methods throw
dl
parents:
47302
diff
changeset
|
526 |
if (shouldParkAfterFailedAcquire(p, node)) |
98801bd22f5b
8191937: Lost interrupt in AbstractQueuedSynchronizer when tryAcquire methods throw
dl
parents:
47302
diff
changeset
|
527 |
interrupted |= parkAndCheckInterrupt(); |
2 | 528 |
} |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
529 |
} catch (Throwable t) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
530 |
cancelAcquire(node); |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
531 |
throw t; |
48046
98801bd22f5b
8191937: Lost interrupt in AbstractQueuedSynchronizer when tryAcquire methods throw
dl
parents:
47302
diff
changeset
|
532 |
} finally { |
98801bd22f5b
8191937: Lost interrupt in AbstractQueuedSynchronizer when tryAcquire methods throw
dl
parents:
47302
diff
changeset
|
533 |
if (interrupted) |
98801bd22f5b
8191937: Lost interrupt in AbstractQueuedSynchronizer when tryAcquire methods throw
dl
parents:
47302
diff
changeset
|
534 |
selfInterrupt(); |
2 | 535 |
} |
536 |
} |
|
537 |
||
538 |
/** |
|
539 |
* Acquires in shared interruptible mode. |
|
540 |
* @param arg the acquire argument |
|
541 |
*/ |
|
542 |
private void doAcquireSharedInterruptibly(long arg) |
|
543 |
throws InterruptedException { |
|
544 |
final Node node = addWaiter(Node.SHARED); |
|
545 |
try { |
|
546 |
for (;;) { |
|
547 |
final Node p = node.predecessor(); |
|
548 |
if (p == head) { |
|
549 |
long r = tryAcquireShared(arg); |
|
550 |
if (r >= 0) { |
|
551 |
setHeadAndPropagate(node, r); |
|
552 |
p.next = null; // help GC |
|
553 |
return; |
|
554 |
} |
|
555 |
} |
|
556 |
if (shouldParkAfterFailedAcquire(p, node) && |
|
557 |
parkAndCheckInterrupt()) |
|
558 |
throw new InterruptedException(); |
|
559 |
} |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
560 |
} catch (Throwable t) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
561 |
cancelAcquire(node); |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
562 |
throw t; |
2 | 563 |
} |
564 |
} |
|
565 |
||
566 |
/** |
|
567 |
* Acquires in shared timed mode. |
|
568 |
* |
|
569 |
* @param arg the acquire argument |
|
570 |
* @param nanosTimeout max wait time |
|
571 |
* @return {@code true} if acquired |
|
572 |
*/ |
|
573 |
private boolean doAcquireSharedNanos(long arg, long nanosTimeout) |
|
14325
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
574 |
throws InterruptedException { |
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
575 |
if (nanosTimeout <= 0L) |
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
576 |
return false; |
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
577 |
final long deadline = System.nanoTime() + nanosTimeout; |
2 | 578 |
final Node node = addWaiter(Node.SHARED); |
579 |
try { |
|
580 |
for (;;) { |
|
581 |
final Node p = node.predecessor(); |
|
582 |
if (p == head) { |
|
583 |
long r = tryAcquireShared(arg); |
|
584 |
if (r >= 0) { |
|
585 |
setHeadAndPropagate(node, r); |
|
586 |
p.next = null; // help GC |
|
587 |
return true; |
|
588 |
} |
|
589 |
} |
|
14325
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
590 |
nanosTimeout = deadline - System.nanoTime(); |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
591 |
if (nanosTimeout <= 0L) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
592 |
cancelAcquire(node); |
2 | 593 |
return false; |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
594 |
} |
2 | 595 |
if (shouldParkAfterFailedAcquire(p, node) && |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
596 |
nanosTimeout > SPIN_FOR_TIMEOUT_THRESHOLD) |
2 | 597 |
LockSupport.parkNanos(this, nanosTimeout); |
598 |
if (Thread.interrupted()) |
|
599 |
throw new InterruptedException(); |
|
600 |
} |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
601 |
} catch (Throwable t) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
602 |
cancelAcquire(node); |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
603 |
throw t; |
2 | 604 |
} |
605 |
} |
|
606 |
||
607 |
// Main exported methods |
|
608 |
||
609 |
/** |
|
610 |
* Attempts to acquire in exclusive mode. This method should query |
|
611 |
* if the state of the object permits it to be acquired in the |
|
612 |
* exclusive mode, and if so to acquire it. |
|
613 |
* |
|
614 |
* <p>This method is always invoked by the thread performing |
|
615 |
* acquire. If this method reports failure, the acquire method |
|
616 |
* may queue the thread, if it is not already queued, until it is |
|
617 |
* signalled by a release from some other thread. This can be used |
|
618 |
* to implement method {@link Lock#tryLock()}. |
|
619 |
* |
|
620 |
* <p>The default |
|
621 |
* implementation throws {@link UnsupportedOperationException}. |
|
622 |
* |
|
623 |
* @param arg the acquire argument. This value is always the one |
|
624 |
* passed to an acquire method, or is the value saved on entry |
|
625 |
* to a condition wait. The value is otherwise uninterpreted |
|
626 |
* and can represent anything you like. |
|
627 |
* @return {@code true} if successful. Upon success, this object has |
|
628 |
* been acquired. |
|
629 |
* @throws IllegalMonitorStateException if acquiring would place this |
|
630 |
* synchronizer in an illegal state. This exception must be |
|
631 |
* thrown in a consistent fashion for synchronization to work |
|
632 |
* correctly. |
|
633 |
* @throws UnsupportedOperationException if exclusive mode is not supported |
|
634 |
*/ |
|
635 |
protected boolean tryAcquire(long arg) { |
|
636 |
throw new UnsupportedOperationException(); |
|
637 |
} |
|
638 |
||
639 |
/** |
|
640 |
* Attempts to set the state to reflect a release in exclusive |
|
641 |
* mode. |
|
642 |
* |
|
643 |
* <p>This method is always invoked by the thread performing release. |
|
644 |
* |
|
645 |
* <p>The default implementation throws |
|
646 |
* {@link UnsupportedOperationException}. |
|
647 |
* |
|
648 |
* @param arg the release argument. This value is always the one |
|
649 |
* passed to a release method, or the current state value upon |
|
650 |
* entry to a condition wait. The value is otherwise |
|
651 |
* uninterpreted and can represent anything you like. |
|
652 |
* @return {@code true} if this object is now in a fully released |
|
653 |
* state, so that any waiting threads may attempt to acquire; |
|
654 |
* and {@code false} otherwise. |
|
655 |
* @throws IllegalMonitorStateException if releasing would place this |
|
656 |
* synchronizer in an illegal state. This exception must be |
|
657 |
* thrown in a consistent fashion for synchronization to work |
|
658 |
* correctly. |
|
659 |
* @throws UnsupportedOperationException if exclusive mode is not supported |
|
660 |
*/ |
|
661 |
protected boolean tryRelease(long arg) { |
|
662 |
throw new UnsupportedOperationException(); |
|
663 |
} |
|
664 |
||
665 |
/** |
|
666 |
* Attempts to acquire in shared mode. This method should query if |
|
667 |
* the state of the object permits it to be acquired in the shared |
|
668 |
* mode, and if so to acquire it. |
|
669 |
* |
|
670 |
* <p>This method is always invoked by the thread performing |
|
671 |
* acquire. If this method reports failure, the acquire method |
|
672 |
* may queue the thread, if it is not already queued, until it is |
|
673 |
* signalled by a release from some other thread. |
|
674 |
* |
|
675 |
* <p>The default implementation throws {@link |
|
676 |
* UnsupportedOperationException}. |
|
677 |
* |
|
678 |
* @param arg the acquire argument. This value is always the one |
|
679 |
* passed to an acquire method, or is the value saved on entry |
|
680 |
* to a condition wait. The value is otherwise uninterpreted |
|
681 |
* and can represent anything you like. |
|
682 |
* @return a negative value on failure; zero if acquisition in shared |
|
683 |
* mode succeeded but no subsequent shared-mode acquire can |
|
684 |
* succeed; and a positive value if acquisition in shared |
|
685 |
* mode succeeded and subsequent shared-mode acquires might |
|
686 |
* also succeed, in which case a subsequent waiting thread |
|
687 |
* must check availability. (Support for three different |
|
688 |
* return values enables this method to be used in contexts |
|
689 |
* where acquires only sometimes act exclusively.) Upon |
|
690 |
* success, this object has been acquired. |
|
691 |
* @throws IllegalMonitorStateException if acquiring would place this |
|
692 |
* synchronizer in an illegal state. This exception must be |
|
693 |
* thrown in a consistent fashion for synchronization to work |
|
694 |
* correctly. |
|
695 |
* @throws UnsupportedOperationException if shared mode is not supported |
|
696 |
*/ |
|
697 |
protected long tryAcquireShared(long arg) { |
|
698 |
throw new UnsupportedOperationException(); |
|
699 |
} |
|
700 |
||
701 |
/** |
|
702 |
* Attempts to set the state to reflect a release in shared mode. |
|
703 |
* |
|
704 |
* <p>This method is always invoked by the thread performing release. |
|
705 |
* |
|
706 |
* <p>The default implementation throws |
|
707 |
* {@link UnsupportedOperationException}. |
|
708 |
* |
|
709 |
* @param arg the release argument. This value is always the one |
|
710 |
* passed to a release method, or the current state value upon |
|
711 |
* entry to a condition wait. The value is otherwise |
|
712 |
* uninterpreted and can represent anything you like. |
|
713 |
* @return {@code true} if this release of shared mode may permit a |
|
714 |
* waiting acquire (shared or exclusive) to succeed; and |
|
715 |
* {@code false} otherwise |
|
716 |
* @throws IllegalMonitorStateException if releasing would place this |
|
717 |
* synchronizer in an illegal state. This exception must be |
|
718 |
* thrown in a consistent fashion for synchronization to work |
|
719 |
* correctly. |
|
720 |
* @throws UnsupportedOperationException if shared mode is not supported |
|
721 |
*/ |
|
722 |
protected boolean tryReleaseShared(long arg) { |
|
723 |
throw new UnsupportedOperationException(); |
|
724 |
} |
|
725 |
||
726 |
/** |
|
727 |
* Returns {@code true} if synchronization is held exclusively with |
|
728 |
* respect to the current (calling) thread. This method is invoked |
|
47302
f517fa4f4dc6
8187408: AbstractQueuedSynchronizer wait queue corrupted when thread awaits without holding the lock
dl
parents:
47216
diff
changeset
|
729 |
* upon each call to a {@link ConditionObject} method. |
2 | 730 |
* |
731 |
* <p>The default implementation throws {@link |
|
732 |
* UnsupportedOperationException}. This method is invoked |
|
733 |
* internally only within {@link ConditionObject} methods, so need |
|
734 |
* not be defined if conditions are not used. |
|
735 |
* |
|
736 |
* @return {@code true} if synchronization is held exclusively; |
|
737 |
* {@code false} otherwise |
|
738 |
* @throws UnsupportedOperationException if conditions are not supported |
|
739 |
*/ |
|
740 |
protected boolean isHeldExclusively() { |
|
741 |
throw new UnsupportedOperationException(); |
|
742 |
} |
|
743 |
||
744 |
/** |
|
745 |
* Acquires in exclusive mode, ignoring interrupts. Implemented |
|
746 |
* by invoking at least once {@link #tryAcquire}, |
|
747 |
* returning on success. Otherwise the thread is queued, possibly |
|
748 |
* repeatedly blocking and unblocking, invoking {@link |
|
749 |
* #tryAcquire} until success. This method can be used |
|
750 |
* to implement method {@link Lock#lock}. |
|
751 |
* |
|
752 |
* @param arg the acquire argument. This value is conveyed to |
|
753 |
* {@link #tryAcquire} but is otherwise uninterpreted and |
|
754 |
* can represent anything you like. |
|
755 |
*/ |
|
756 |
public final void acquire(long arg) { |
|
757 |
if (!tryAcquire(arg) && |
|
758 |
acquireQueued(addWaiter(Node.EXCLUSIVE), arg)) |
|
759 |
selfInterrupt(); |
|
760 |
} |
|
761 |
||
762 |
/** |
|
763 |
* Acquires in exclusive mode, aborting if interrupted. |
|
764 |
* Implemented by first checking interrupt status, then invoking |
|
765 |
* at least once {@link #tryAcquire}, returning on |
|
766 |
* success. Otherwise the thread is queued, possibly repeatedly |
|
767 |
* blocking and unblocking, invoking {@link #tryAcquire} |
|
768 |
* until success or the thread is interrupted. This method can be |
|
769 |
* used to implement method {@link Lock#lockInterruptibly}. |
|
770 |
* |
|
771 |
* @param arg the acquire argument. This value is conveyed to |
|
772 |
* {@link #tryAcquire} but is otherwise uninterpreted and |
|
773 |
* can represent anything you like. |
|
774 |
* @throws InterruptedException if the current thread is interrupted |
|
775 |
*/ |
|
7518 | 776 |
public final void acquireInterruptibly(long arg) |
777 |
throws InterruptedException { |
|
2 | 778 |
if (Thread.interrupted()) |
779 |
throw new InterruptedException(); |
|
780 |
if (!tryAcquire(arg)) |
|
781 |
doAcquireInterruptibly(arg); |
|
782 |
} |
|
783 |
||
784 |
/** |
|
785 |
* Attempts to acquire in exclusive mode, aborting if interrupted, |
|
786 |
* and failing if the given timeout elapses. Implemented by first |
|
787 |
* checking interrupt status, then invoking at least once {@link |
|
788 |
* #tryAcquire}, returning on success. Otherwise, the thread is |
|
789 |
* queued, possibly repeatedly blocking and unblocking, invoking |
|
790 |
* {@link #tryAcquire} until success or the thread is interrupted |
|
791 |
* or the timeout elapses. This method can be used to implement |
|
792 |
* method {@link Lock#tryLock(long, TimeUnit)}. |
|
793 |
* |
|
794 |
* @param arg the acquire argument. This value is conveyed to |
|
795 |
* {@link #tryAcquire} but is otherwise uninterpreted and |
|
796 |
* can represent anything you like. |
|
797 |
* @param nanosTimeout the maximum number of nanoseconds to wait |
|
798 |
* @return {@code true} if acquired; {@code false} if timed out |
|
799 |
* @throws InterruptedException if the current thread is interrupted |
|
800 |
*/ |
|
7518 | 801 |
public final boolean tryAcquireNanos(long arg, long nanosTimeout) |
802 |
throws InterruptedException { |
|
2 | 803 |
if (Thread.interrupted()) |
804 |
throw new InterruptedException(); |
|
805 |
return tryAcquire(arg) || |
|
806 |
doAcquireNanos(arg, nanosTimeout); |
|
807 |
} |
|
808 |
||
809 |
/** |
|
810 |
* Releases in exclusive mode. Implemented by unblocking one or |
|
811 |
* more threads if {@link #tryRelease} returns true. |
|
812 |
* This method can be used to implement method {@link Lock#unlock}. |
|
813 |
* |
|
814 |
* @param arg the release argument. This value is conveyed to |
|
815 |
* {@link #tryRelease} but is otherwise uninterpreted and |
|
816 |
* can represent anything you like. |
|
817 |
* @return the value returned from {@link #tryRelease} |
|
818 |
*/ |
|
819 |
public final boolean release(long arg) { |
|
820 |
if (tryRelease(arg)) { |
|
821 |
Node h = head; |
|
822 |
if (h != null && h.waitStatus != 0) |
|
823 |
unparkSuccessor(h); |
|
824 |
return true; |
|
825 |
} |
|
826 |
return false; |
|
827 |
} |
|
828 |
||
829 |
/** |
|
830 |
* Acquires in shared mode, ignoring interrupts. Implemented by |
|
831 |
* first invoking at least once {@link #tryAcquireShared}, |
|
832 |
* returning on success. Otherwise the thread is queued, possibly |
|
833 |
* repeatedly blocking and unblocking, invoking {@link |
|
834 |
* #tryAcquireShared} until success. |
|
835 |
* |
|
836 |
* @param arg the acquire argument. This value is conveyed to |
|
837 |
* {@link #tryAcquireShared} but is otherwise uninterpreted |
|
838 |
* and can represent anything you like. |
|
839 |
*/ |
|
840 |
public final void acquireShared(long arg) { |
|
841 |
if (tryAcquireShared(arg) < 0) |
|
842 |
doAcquireShared(arg); |
|
843 |
} |
|
844 |
||
845 |
/** |
|
846 |
* Acquires in shared mode, aborting if interrupted. Implemented |
|
847 |
* by first checking interrupt status, then invoking at least once |
|
848 |
* {@link #tryAcquireShared}, returning on success. Otherwise the |
|
849 |
* thread is queued, possibly repeatedly blocking and unblocking, |
|
850 |
* invoking {@link #tryAcquireShared} until success or the thread |
|
851 |
* is interrupted. |
|
18576 | 852 |
* @param arg the acquire argument. |
2 | 853 |
* This value is conveyed to {@link #tryAcquireShared} but is |
854 |
* otherwise uninterpreted and can represent anything |
|
855 |
* you like. |
|
856 |
* @throws InterruptedException if the current thread is interrupted |
|
857 |
*/ |
|
7518 | 858 |
public final void acquireSharedInterruptibly(long arg) |
859 |
throws InterruptedException { |
|
2 | 860 |
if (Thread.interrupted()) |
861 |
throw new InterruptedException(); |
|
862 |
if (tryAcquireShared(arg) < 0) |
|
863 |
doAcquireSharedInterruptibly(arg); |
|
864 |
} |
|
865 |
||
866 |
/** |
|
867 |
* Attempts to acquire in shared mode, aborting if interrupted, and |
|
868 |
* failing if the given timeout elapses. Implemented by first |
|
869 |
* checking interrupt status, then invoking at least once {@link |
|
870 |
* #tryAcquireShared}, returning on success. Otherwise, the |
|
871 |
* thread is queued, possibly repeatedly blocking and unblocking, |
|
872 |
* invoking {@link #tryAcquireShared} until success or the thread |
|
873 |
* is interrupted or the timeout elapses. |
|
874 |
* |
|
875 |
* @param arg the acquire argument. This value is conveyed to |
|
876 |
* {@link #tryAcquireShared} but is otherwise uninterpreted |
|
877 |
* and can represent anything you like. |
|
878 |
* @param nanosTimeout the maximum number of nanoseconds to wait |
|
879 |
* @return {@code true} if acquired; {@code false} if timed out |
|
880 |
* @throws InterruptedException if the current thread is interrupted |
|
881 |
*/ |
|
7518 | 882 |
public final boolean tryAcquireSharedNanos(long arg, long nanosTimeout) |
883 |
throws InterruptedException { |
|
2 | 884 |
if (Thread.interrupted()) |
885 |
throw new InterruptedException(); |
|
886 |
return tryAcquireShared(arg) >= 0 || |
|
887 |
doAcquireSharedNanos(arg, nanosTimeout); |
|
888 |
} |
|
889 |
||
890 |
/** |
|
891 |
* Releases in shared mode. Implemented by unblocking one or more |
|
892 |
* threads if {@link #tryReleaseShared} returns true. |
|
893 |
* |
|
894 |
* @param arg the release argument. This value is conveyed to |
|
895 |
* {@link #tryReleaseShared} but is otherwise uninterpreted |
|
896 |
* and can represent anything you like. |
|
897 |
* @return the value returned from {@link #tryReleaseShared} |
|
898 |
*/ |
|
899 |
public final boolean releaseShared(long arg) { |
|
900 |
if (tryReleaseShared(arg)) { |
|
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
901 |
doReleaseShared(); |
2 | 902 |
return true; |
903 |
} |
|
904 |
return false; |
|
905 |
} |
|
906 |
||
907 |
// Queue inspection methods |
|
908 |
||
909 |
/** |
|
910 |
* Queries whether any threads are waiting to acquire. Note that |
|
911 |
* because cancellations due to interrupts and timeouts may occur |
|
912 |
* at any time, a {@code true} return does not guarantee that any |
|
913 |
* other thread will ever acquire. |
|
914 |
* |
|
915 |
* <p>In this implementation, this operation returns in |
|
916 |
* constant time. |
|
917 |
* |
|
918 |
* @return {@code true} if there may be other threads waiting to acquire |
|
919 |
*/ |
|
920 |
public final boolean hasQueuedThreads() { |
|
921 |
return head != tail; |
|
922 |
} |
|
923 |
||
924 |
/** |
|
925 |
* Queries whether any threads have ever contended to acquire this |
|
34348
ba5c2f2fc9d7
8143087: Miscellaneous changes imported from jsr166 CVS 2015-11
dl
parents:
33674
diff
changeset
|
926 |
* synchronizer; that is, if an acquire method has ever blocked. |
2 | 927 |
* |
928 |
* <p>In this implementation, this operation returns in |
|
929 |
* constant time. |
|
930 |
* |
|
931 |
* @return {@code true} if there has ever been contention |
|
932 |
*/ |
|
933 |
public final boolean hasContended() { |
|
934 |
return head != null; |
|
935 |
} |
|
936 |
||
937 |
/** |
|
938 |
* Returns the first (longest-waiting) thread in the queue, or |
|
939 |
* {@code null} if no threads are currently queued. |
|
940 |
* |
|
941 |
* <p>In this implementation, this operation normally returns in |
|
942 |
* constant time, but may iterate upon contention if other threads are |
|
943 |
* concurrently modifying the queue. |
|
944 |
* |
|
945 |
* @return the first (longest-waiting) thread in the queue, or |
|
946 |
* {@code null} if no threads are currently queued |
|
947 |
*/ |
|
948 |
public final Thread getFirstQueuedThread() { |
|
949 |
// handle only fast path, else relay |
|
950 |
return (head == tail) ? null : fullGetFirstQueuedThread(); |
|
951 |
} |
|
952 |
||
953 |
/** |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
954 |
* Version of getFirstQueuedThread called when fastpath fails. |
2 | 955 |
*/ |
956 |
private Thread fullGetFirstQueuedThread() { |
|
957 |
/* |
|
958 |
* The first node is normally head.next. Try to get its |
|
959 |
* thread field, ensuring consistent reads: If thread |
|
960 |
* field is nulled out or s.prev is no longer head, then |
|
961 |
* some other thread(s) concurrently performed setHead in |
|
962 |
* between some of our reads. We try this twice before |
|
963 |
* resorting to traversal. |
|
964 |
*/ |
|
965 |
Node h, s; |
|
966 |
Thread st; |
|
967 |
if (((h = head) != null && (s = h.next) != null && |
|
968 |
s.prev == head && (st = s.thread) != null) || |
|
969 |
((h = head) != null && (s = h.next) != null && |
|
970 |
s.prev == head && (st = s.thread) != null)) |
|
971 |
return st; |
|
972 |
||
973 |
/* |
|
974 |
* Head's next field might not have been set yet, or may have |
|
975 |
* been unset after setHead. So we must check to see if tail |
|
976 |
* is actually first node. If not, we continue on, safely |
|
977 |
* traversing from tail back to head to find first, |
|
978 |
* guaranteeing termination. |
|
979 |
*/ |
|
980 |
||
981 |
Thread firstThread = null; |
|
34348
ba5c2f2fc9d7
8143087: Miscellaneous changes imported from jsr166 CVS 2015-11
dl
parents:
33674
diff
changeset
|
982 |
for (Node p = tail; p != null && p != head; p = p.prev) { |
ba5c2f2fc9d7
8143087: Miscellaneous changes imported from jsr166 CVS 2015-11
dl
parents:
33674
diff
changeset
|
983 |
Thread t = p.thread; |
ba5c2f2fc9d7
8143087: Miscellaneous changes imported from jsr166 CVS 2015-11
dl
parents:
33674
diff
changeset
|
984 |
if (t != null) |
ba5c2f2fc9d7
8143087: Miscellaneous changes imported from jsr166 CVS 2015-11
dl
parents:
33674
diff
changeset
|
985 |
firstThread = t; |
2 | 986 |
} |
987 |
return firstThread; |
|
988 |
} |
|
989 |
||
990 |
/** |
|
991 |
* Returns true if the given thread is currently queued. |
|
992 |
* |
|
993 |
* <p>This implementation traverses the queue to determine |
|
994 |
* presence of the given thread. |
|
995 |
* |
|
996 |
* @param thread the thread |
|
997 |
* @return {@code true} if the given thread is on the queue |
|
998 |
* @throws NullPointerException if the thread is null |
|
999 |
*/ |
|
1000 |
public final boolean isQueued(Thread thread) { |
|
1001 |
if (thread == null) |
|
1002 |
throw new NullPointerException(); |
|
1003 |
for (Node p = tail; p != null; p = p.prev) |
|
1004 |
if (p.thread == thread) |
|
1005 |
return true; |
|
1006 |
return false; |
|
1007 |
} |
|
1008 |
||
1009 |
/** |
|
1010 |
* Returns {@code true} if the apparent first queued thread, if one |
|
1011 |
* exists, is waiting in exclusive mode. If this method returns |
|
1012 |
* {@code true}, and the current thread is attempting to acquire in |
|
1013 |
* shared mode (that is, this method is invoked from {@link |
|
1014 |
* #tryAcquireShared}) then it is guaranteed that the current thread |
|
1015 |
* is not the first queued thread. Used only as a heuristic in |
|
1016 |
* ReentrantReadWriteLock. |
|
1017 |
*/ |
|
1018 |
final boolean apparentlyFirstQueuedIsExclusive() { |
|
1019 |
Node h, s; |
|
1020 |
return (h = head) != null && |
|
1021 |
(s = h.next) != null && |
|
1022 |
!s.isShared() && |
|
1023 |
s.thread != null; |
|
1024 |
} |
|
1025 |
||
1026 |
/** |
|
1027 |
* Queries whether any threads have been waiting to acquire longer |
|
1028 |
* than the current thread. |
|
1029 |
* |
|
1030 |
* <p>An invocation of this method is equivalent to (but may be |
|
1031 |
* more efficient than): |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1032 |
* <pre> {@code |
34348
ba5c2f2fc9d7
8143087: Miscellaneous changes imported from jsr166 CVS 2015-11
dl
parents:
33674
diff
changeset
|
1033 |
* getFirstQueuedThread() != Thread.currentThread() |
ba5c2f2fc9d7
8143087: Miscellaneous changes imported from jsr166 CVS 2015-11
dl
parents:
33674
diff
changeset
|
1034 |
* && hasQueuedThreads()}</pre> |
2 | 1035 |
* |
1036 |
* <p>Note that because cancellations due to interrupts and |
|
1037 |
* timeouts may occur at any time, a {@code true} return does not |
|
1038 |
* guarantee that some other thread will acquire before the current |
|
1039 |
* thread. Likewise, it is possible for another thread to win a |
|
1040 |
* race to enqueue after this method has returned {@code false}, |
|
1041 |
* due to the queue being empty. |
|
1042 |
* |
|
1043 |
* <p>This method is designed to be used by a fair synchronizer to |
|
14325
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
1044 |
* avoid <a href="AbstractQueuedSynchronizer.html#barging">barging</a>. |
2 | 1045 |
* Such a synchronizer's {@link #tryAcquire} method should return |
1046 |
* {@code false}, and its {@link #tryAcquireShared} method should |
|
1047 |
* return a negative value, if this method returns {@code true} |
|
1048 |
* (unless this is a reentrant acquire). For example, the {@code |
|
1049 |
* tryAcquire} method for a fair, reentrant, exclusive mode |
|
1050 |
* synchronizer might look like this: |
|
1051 |
* |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1052 |
* <pre> {@code |
2 | 1053 |
* protected boolean tryAcquire(int arg) { |
1054 |
* if (isHeldExclusively()) { |
|
1055 |
* // A reentrant acquire; increment hold count |
|
1056 |
* return true; |
|
1057 |
* } else if (hasQueuedPredecessors()) { |
|
1058 |
* return false; |
|
1059 |
* } else { |
|
1060 |
* // try to acquire normally |
|
1061 |
* } |
|
1062 |
* }}</pre> |
|
1063 |
* |
|
1064 |
* @return {@code true} if there is a queued thread preceding the |
|
1065 |
* current thread, and {@code false} if the current thread |
|
1066 |
* is at the head of the queue or the queue is empty |
|
1067 |
* @since 1.7 |
|
1068 |
*/ |
|
1069 |
public final boolean hasQueuedPredecessors() { |
|
1070 |
// The correctness of this depends on head being initialized |
|
1071 |
// before tail and on head.next being accurate if the current |
|
1072 |
// thread is first in queue. |
|
2165 | 1073 |
Node t = tail; // Read fields in reverse initialization order |
1074 |
Node h = head; |
|
1075 |
Node s; |
|
1076 |
return h != t && |
|
2 | 1077 |
((s = h.next) == null || s.thread != Thread.currentThread()); |
1078 |
} |
|
1079 |
||
1080 |
||
1081 |
// Instrumentation and monitoring methods |
|
1082 |
||
1083 |
/** |
|
1084 |
* Returns an estimate of the number of threads waiting to |
|
1085 |
* acquire. The value is only an estimate because the number of |
|
1086 |
* threads may change dynamically while this method traverses |
|
1087 |
* internal data structures. This method is designed for use in |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1088 |
* monitoring system state, not for synchronization control. |
2 | 1089 |
* |
1090 |
* @return the estimated number of threads waiting to acquire |
|
1091 |
*/ |
|
1092 |
public final int getQueueLength() { |
|
1093 |
int n = 0; |
|
1094 |
for (Node p = tail; p != null; p = p.prev) { |
|
1095 |
if (p.thread != null) |
|
1096 |
++n; |
|
1097 |
} |
|
1098 |
return n; |
|
1099 |
} |
|
1100 |
||
1101 |
/** |
|
1102 |
* Returns a collection containing threads that may be waiting to |
|
1103 |
* acquire. Because the actual set of threads may change |
|
1104 |
* dynamically while constructing this result, the returned |
|
1105 |
* collection is only a best-effort estimate. The elements of the |
|
1106 |
* returned collection are in no particular order. This method is |
|
1107 |
* designed to facilitate construction of subclasses that provide |
|
1108 |
* more extensive monitoring facilities. |
|
1109 |
* |
|
1110 |
* @return the collection of threads |
|
1111 |
*/ |
|
1112 |
public final Collection<Thread> getQueuedThreads() { |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1113 |
ArrayList<Thread> list = new ArrayList<>(); |
2 | 1114 |
for (Node p = tail; p != null; p = p.prev) { |
1115 |
Thread t = p.thread; |
|
1116 |
if (t != null) |
|
1117 |
list.add(t); |
|
1118 |
} |
|
1119 |
return list; |
|
1120 |
} |
|
1121 |
||
1122 |
/** |
|
1123 |
* Returns a collection containing threads that may be waiting to |
|
1124 |
* acquire in exclusive mode. This has the same properties |
|
1125 |
* as {@link #getQueuedThreads} except that it only returns |
|
1126 |
* those threads waiting due to an exclusive acquire. |
|
1127 |
* |
|
1128 |
* @return the collection of threads |
|
1129 |
*/ |
|
1130 |
public final Collection<Thread> getExclusiveQueuedThreads() { |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1131 |
ArrayList<Thread> list = new ArrayList<>(); |
2 | 1132 |
for (Node p = tail; p != null; p = p.prev) { |
1133 |
if (!p.isShared()) { |
|
1134 |
Thread t = p.thread; |
|
1135 |
if (t != null) |
|
1136 |
list.add(t); |
|
1137 |
} |
|
1138 |
} |
|
1139 |
return list; |
|
1140 |
} |
|
1141 |
||
1142 |
/** |
|
1143 |
* Returns a collection containing threads that may be waiting to |
|
1144 |
* acquire in shared mode. This has the same properties |
|
1145 |
* as {@link #getQueuedThreads} except that it only returns |
|
1146 |
* those threads waiting due to a shared acquire. |
|
1147 |
* |
|
1148 |
* @return the collection of threads |
|
1149 |
*/ |
|
1150 |
public final Collection<Thread> getSharedQueuedThreads() { |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1151 |
ArrayList<Thread> list = new ArrayList<>(); |
2 | 1152 |
for (Node p = tail; p != null; p = p.prev) { |
1153 |
if (p.isShared()) { |
|
1154 |
Thread t = p.thread; |
|
1155 |
if (t != null) |
|
1156 |
list.add(t); |
|
1157 |
} |
|
1158 |
} |
|
1159 |
return list; |
|
1160 |
} |
|
1161 |
||
1162 |
/** |
|
1163 |
* Returns a string identifying this synchronizer, as well as its state. |
|
1164 |
* The state, in brackets, includes the String {@code "State ="} |
|
1165 |
* followed by the current value of {@link #getState}, and either |
|
1166 |
* {@code "nonempty"} or {@code "empty"} depending on whether the |
|
1167 |
* queue is empty. |
|
1168 |
* |
|
1169 |
* @return a string identifying this synchronizer, as well as its state |
|
1170 |
*/ |
|
1171 |
public String toString() { |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1172 |
return super.toString() |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1173 |
+ "[State = " + getState() + ", " |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1174 |
+ (hasQueuedThreads() ? "non" : "") + "empty queue]"; |
2 | 1175 |
} |
1176 |
||
1177 |
||
1178 |
// Internal support methods for Conditions |
|
1179 |
||
1180 |
/** |
|
1181 |
* Returns true if a node, always one that was initially placed on |
|
1182 |
* a condition queue, is now waiting to reacquire on sync queue. |
|
1183 |
* @param node the node |
|
1184 |
* @return true if is reacquiring |
|
1185 |
*/ |
|
1186 |
final boolean isOnSyncQueue(Node node) { |
|
1187 |
if (node.waitStatus == Node.CONDITION || node.prev == null) |
|
1188 |
return false; |
|
1189 |
if (node.next != null) // If has successor, it must be on queue |
|
1190 |
return true; |
|
1191 |
/* |
|
1192 |
* node.prev can be non-null, but not yet on queue because |
|
1193 |
* the CAS to place it on queue can fail. So we have to |
|
1194 |
* traverse from tail to make sure it actually made it. It |
|
1195 |
* will always be near the tail in calls to this method, and |
|
1196 |
* unless the CAS failed (which is unlikely), it will be |
|
1197 |
* there, so we hardly ever traverse much. |
|
1198 |
*/ |
|
1199 |
return findNodeFromTail(node); |
|
1200 |
} |
|
1201 |
||
1202 |
/** |
|
1203 |
* Returns true if node is on sync queue by searching backwards from tail. |
|
1204 |
* Called only when needed by isOnSyncQueue. |
|
1205 |
* @return true if present |
|
1206 |
*/ |
|
1207 |
private boolean findNodeFromTail(Node node) { |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1208 |
// We check for node first, since it's likely to be at or near tail. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1209 |
// tail is known to be non-null, so we could re-order to "save" |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1210 |
// one null check, but we leave it this way to help the VM. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1211 |
for (Node p = tail;;) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1212 |
if (p == node) |
2 | 1213 |
return true; |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1214 |
if (p == null) |
2 | 1215 |
return false; |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1216 |
p = p.prev; |
2 | 1217 |
} |
1218 |
} |
|
1219 |
||
1220 |
/** |
|
1221 |
* Transfers a node from a condition queue onto sync queue. |
|
1222 |
* Returns true if successful. |
|
1223 |
* @param node the node |
|
1224 |
* @return true if successfully transferred (else the node was |
|
18576 | 1225 |
* cancelled before signal) |
2 | 1226 |
*/ |
1227 |
final boolean transferForSignal(Node node) { |
|
1228 |
/* |
|
1229 |
* If cannot change waitStatus, the node has been cancelled. |
|
1230 |
*/ |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1231 |
if (!node.compareAndSetWaitStatus(Node.CONDITION, 0)) |
2 | 1232 |
return false; |
1233 |
||
1234 |
/* |
|
1235 |
* Splice onto queue and try to set waitStatus of predecessor to |
|
1236 |
* indicate that thread is (probably) waiting. If cancelled or |
|
1237 |
* attempt to set waitStatus fails, wake up to resync (in which |
|
1238 |
* case the waitStatus can be transiently and harmlessly wrong). |
|
1239 |
*/ |
|
1240 |
Node p = enq(node); |
|
2430
975a98680ae8
6801020: Concurrent Semaphore release may cause some require thread not signaled
dl
parents:
2165
diff
changeset
|
1241 |
int ws = p.waitStatus; |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1242 |
if (ws > 0 || !p.compareAndSetWaitStatus(ws, Node.SIGNAL)) |
2 | 1243 |
LockSupport.unpark(node.thread); |
1244 |
return true; |
|
1245 |
} |
|
1246 |
||
1247 |
/** |
|
18576 | 1248 |
* Transfers node, if necessary, to sync queue after a cancelled wait. |
1249 |
* Returns true if thread was cancelled before being signalled. |
|
1250 |
* |
|
1251 |
* @param node the node |
|
2 | 1252 |
* @return true if cancelled before the node was signalled |
1253 |
*/ |
|
1254 |
final boolean transferAfterCancelledWait(Node node) { |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1255 |
if (node.compareAndSetWaitStatus(Node.CONDITION, 0)) { |
2 | 1256 |
enq(node); |
1257 |
return true; |
|
1258 |
} |
|
1259 |
/* |
|
1260 |
* If we lost out to a signal(), then we can't proceed |
|
1261 |
* until it finishes its enq(). Cancelling during an |
|
1262 |
* incomplete transfer is both rare and transient, so just |
|
1263 |
* spin. |
|
1264 |
*/ |
|
1265 |
while (!isOnSyncQueue(node)) |
|
1266 |
Thread.yield(); |
|
1267 |
return false; |
|
1268 |
} |
|
1269 |
||
1270 |
/** |
|
1271 |
* Invokes release with current state value; returns saved state. |
|
1272 |
* Cancels node and throws exception on failure. |
|
1273 |
* @param node the condition node for this wait |
|
1274 |
* @return previous sync state |
|
1275 |
*/ |
|
1276 |
final long fullyRelease(Node node) { |
|
1277 |
try { |
|
1278 |
long savedState = getState(); |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1279 |
if (release(savedState)) |
2 | 1280 |
return savedState; |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1281 |
throw new IllegalMonitorStateException(); |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1282 |
} catch (Throwable t) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1283 |
node.waitStatus = Node.CANCELLED; |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1284 |
throw t; |
2 | 1285 |
} |
1286 |
} |
|
1287 |
||
1288 |
// Instrumentation methods for conditions |
|
1289 |
||
1290 |
/** |
|
1291 |
* Queries whether the given ConditionObject |
|
1292 |
* uses this synchronizer as its lock. |
|
1293 |
* |
|
1294 |
* @param condition the condition |
|
18576 | 1295 |
* @return {@code true} if owned |
2 | 1296 |
* @throws NullPointerException if the condition is null |
1297 |
*/ |
|
1298 |
public final boolean owns(ConditionObject condition) { |
|
1299 |
return condition.isOwnedBy(this); |
|
1300 |
} |
|
1301 |
||
1302 |
/** |
|
1303 |
* Queries whether any threads are waiting on the given condition |
|
1304 |
* associated with this synchronizer. Note that because timeouts |
|
18576 | 1305 |
* and interrupts may occur at any time, a {@code true} return |
1306 |
* does not guarantee that a future {@code signal} will awaken |
|
2 | 1307 |
* any threads. This method is designed primarily for use in |
1308 |
* monitoring of the system state. |
|
1309 |
* |
|
1310 |
* @param condition the condition |
|
18576 | 1311 |
* @return {@code true} if there are any waiting threads |
2 | 1312 |
* @throws IllegalMonitorStateException if exclusive synchronization |
1313 |
* is not held |
|
1314 |
* @throws IllegalArgumentException if the given condition is |
|
1315 |
* not associated with this synchronizer |
|
1316 |
* @throws NullPointerException if the condition is null |
|
1317 |
*/ |
|
1318 |
public final boolean hasWaiters(ConditionObject condition) { |
|
1319 |
if (!owns(condition)) |
|
1320 |
throw new IllegalArgumentException("Not owner"); |
|
1321 |
return condition.hasWaiters(); |
|
1322 |
} |
|
1323 |
||
1324 |
/** |
|
1325 |
* Returns an estimate of the number of threads waiting on the |
|
1326 |
* given condition associated with this synchronizer. Note that |
|
1327 |
* because timeouts and interrupts may occur at any time, the |
|
1328 |
* estimate serves only as an upper bound on the actual number of |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1329 |
* waiters. This method is designed for use in monitoring system |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1330 |
* state, not for synchronization control. |
2 | 1331 |
* |
1332 |
* @param condition the condition |
|
1333 |
* @return the estimated number of waiting threads |
|
1334 |
* @throws IllegalMonitorStateException if exclusive synchronization |
|
1335 |
* is not held |
|
1336 |
* @throws IllegalArgumentException if the given condition is |
|
1337 |
* not associated with this synchronizer |
|
1338 |
* @throws NullPointerException if the condition is null |
|
1339 |
*/ |
|
1340 |
public final int getWaitQueueLength(ConditionObject condition) { |
|
1341 |
if (!owns(condition)) |
|
1342 |
throw new IllegalArgumentException("Not owner"); |
|
1343 |
return condition.getWaitQueueLength(); |
|
1344 |
} |
|
1345 |
||
1346 |
/** |
|
1347 |
* Returns a collection containing those threads that may be |
|
1348 |
* waiting on the given condition associated with this |
|
1349 |
* synchronizer. Because the actual set of threads may change |
|
1350 |
* dynamically while constructing this result, the returned |
|
1351 |
* collection is only a best-effort estimate. The elements of the |
|
1352 |
* returned collection are in no particular order. |
|
1353 |
* |
|
1354 |
* @param condition the condition |
|
1355 |
* @return the collection of threads |
|
1356 |
* @throws IllegalMonitorStateException if exclusive synchronization |
|
1357 |
* is not held |
|
1358 |
* @throws IllegalArgumentException if the given condition is |
|
1359 |
* not associated with this synchronizer |
|
1360 |
* @throws NullPointerException if the condition is null |
|
1361 |
*/ |
|
1362 |
public final Collection<Thread> getWaitingThreads(ConditionObject condition) { |
|
1363 |
if (!owns(condition)) |
|
1364 |
throw new IllegalArgumentException("Not owner"); |
|
1365 |
return condition.getWaitingThreads(); |
|
1366 |
} |
|
1367 |
||
1368 |
/** |
|
47302
f517fa4f4dc6
8187408: AbstractQueuedSynchronizer wait queue corrupted when thread awaits without holding the lock
dl
parents:
47216
diff
changeset
|
1369 |
* Condition implementation for a {@link AbstractQueuedLongSynchronizer} |
f517fa4f4dc6
8187408: AbstractQueuedSynchronizer wait queue corrupted when thread awaits without holding the lock
dl
parents:
47216
diff
changeset
|
1370 |
* serving as the basis of a {@link Lock} implementation. |
2 | 1371 |
* |
1372 |
* <p>Method documentation for this class describes mechanics, |
|
1373 |
* not behavioral specifications from the point of view of Lock |
|
1374 |
* and Condition users. Exported versions of this class will in |
|
1375 |
* general need to be accompanied by documentation describing |
|
1376 |
* condition semantics that rely on those of the associated |
|
18576 | 1377 |
* {@code AbstractQueuedLongSynchronizer}. |
2 | 1378 |
* |
1379 |
* <p>This class is Serializable, but all fields are transient, |
|
1380 |
* so deserialized conditions have no waiters. |
|
1381 |
* |
|
1382 |
* @since 1.6 |
|
1383 |
*/ |
|
1384 |
public class ConditionObject implements Condition, java.io.Serializable { |
|
1385 |
private static final long serialVersionUID = 1173984872572414699L; |
|
1386 |
/** First node of condition queue. */ |
|
1387 |
private transient Node firstWaiter; |
|
1388 |
/** Last node of condition queue. */ |
|
1389 |
private transient Node lastWaiter; |
|
1390 |
||
1391 |
/** |
|
18576 | 1392 |
* Creates a new {@code ConditionObject} instance. |
2 | 1393 |
*/ |
1394 |
public ConditionObject() { } |
|
1395 |
||
1396 |
// Internal methods |
|
1397 |
||
1398 |
/** |
|
1399 |
* Adds a new waiter to wait queue. |
|
1400 |
* @return its new wait node |
|
1401 |
*/ |
|
1402 |
private Node addConditionWaiter() { |
|
47302
f517fa4f4dc6
8187408: AbstractQueuedSynchronizer wait queue corrupted when thread awaits without holding the lock
dl
parents:
47216
diff
changeset
|
1403 |
if (!isHeldExclusively()) |
f517fa4f4dc6
8187408: AbstractQueuedSynchronizer wait queue corrupted when thread awaits without holding the lock
dl
parents:
47216
diff
changeset
|
1404 |
throw new IllegalMonitorStateException(); |
2 | 1405 |
Node t = lastWaiter; |
1406 |
// If lastWaiter is cancelled, clean out. |
|
1407 |
if (t != null && t.waitStatus != Node.CONDITION) { |
|
1408 |
unlinkCancelledWaiters(); |
|
1409 |
t = lastWaiter; |
|
1410 |
} |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1411 |
|
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1412 |
Node node = new Node(Node.CONDITION); |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1413 |
|
2 | 1414 |
if (t == null) |
1415 |
firstWaiter = node; |
|
1416 |
else |
|
1417 |
t.nextWaiter = node; |
|
1418 |
lastWaiter = node; |
|
1419 |
return node; |
|
1420 |
} |
|
1421 |
||
1422 |
/** |
|
1423 |
* Removes and transfers nodes until hit non-cancelled one or |
|
1424 |
* null. Split out from signal in part to encourage compilers |
|
1425 |
* to inline the case of no waiters. |
|
1426 |
* @param first (non-null) the first node on condition queue |
|
1427 |
*/ |
|
1428 |
private void doSignal(Node first) { |
|
1429 |
do { |
|
1430 |
if ( (firstWaiter = first.nextWaiter) == null) |
|
1431 |
lastWaiter = null; |
|
1432 |
first.nextWaiter = null; |
|
1433 |
} while (!transferForSignal(first) && |
|
1434 |
(first = firstWaiter) != null); |
|
1435 |
} |
|
1436 |
||
1437 |
/** |
|
1438 |
* Removes and transfers all nodes. |
|
1439 |
* @param first (non-null) the first node on condition queue |
|
1440 |
*/ |
|
1441 |
private void doSignalAll(Node first) { |
|
1442 |
lastWaiter = firstWaiter = null; |
|
1443 |
do { |
|
1444 |
Node next = first.nextWaiter; |
|
1445 |
first.nextWaiter = null; |
|
1446 |
transferForSignal(first); |
|
1447 |
first = next; |
|
1448 |
} while (first != null); |
|
1449 |
} |
|
1450 |
||
1451 |
/** |
|
1452 |
* Unlinks cancelled waiter nodes from condition queue. |
|
1453 |
* Called only while holding lock. This is called when |
|
1454 |
* cancellation occurred during condition wait, and upon |
|
1455 |
* insertion of a new waiter when lastWaiter is seen to have |
|
1456 |
* been cancelled. This method is needed to avoid garbage |
|
1457 |
* retention in the absence of signals. So even though it may |
|
1458 |
* require a full traversal, it comes into play only when |
|
1459 |
* timeouts or cancellations occur in the absence of |
|
1460 |
* signals. It traverses all nodes rather than stopping at a |
|
1461 |
* particular target to unlink all pointers to garbage nodes |
|
1462 |
* without requiring many re-traversals during cancellation |
|
1463 |
* storms. |
|
1464 |
*/ |
|
1465 |
private void unlinkCancelledWaiters() { |
|
1466 |
Node t = firstWaiter; |
|
1467 |
Node trail = null; |
|
1468 |
while (t != null) { |
|
1469 |
Node next = t.nextWaiter; |
|
1470 |
if (t.waitStatus != Node.CONDITION) { |
|
1471 |
t.nextWaiter = null; |
|
1472 |
if (trail == null) |
|
1473 |
firstWaiter = next; |
|
1474 |
else |
|
1475 |
trail.nextWaiter = next; |
|
1476 |
if (next == null) |
|
1477 |
lastWaiter = trail; |
|
1478 |
} |
|
1479 |
else |
|
1480 |
trail = t; |
|
1481 |
t = next; |
|
1482 |
} |
|
1483 |
} |
|
1484 |
||
1485 |
// public methods |
|
1486 |
||
1487 |
/** |
|
1488 |
* Moves the longest-waiting thread, if one exists, from the |
|
1489 |
* wait queue for this condition to the wait queue for the |
|
1490 |
* owning lock. |
|
1491 |
* |
|
1492 |
* @throws IllegalMonitorStateException if {@link #isHeldExclusively} |
|
1493 |
* returns {@code false} |
|
1494 |
*/ |
|
1495 |
public final void signal() { |
|
1496 |
if (!isHeldExclusively()) |
|
1497 |
throw new IllegalMonitorStateException(); |
|
1498 |
Node first = firstWaiter; |
|
1499 |
if (first != null) |
|
1500 |
doSignal(first); |
|
1501 |
} |
|
1502 |
||
1503 |
/** |
|
1504 |
* Moves all threads from the wait queue for this condition to |
|
1505 |
* the wait queue for the owning lock. |
|
1506 |
* |
|
1507 |
* @throws IllegalMonitorStateException if {@link #isHeldExclusively} |
|
1508 |
* returns {@code false} |
|
1509 |
*/ |
|
1510 |
public final void signalAll() { |
|
1511 |
if (!isHeldExclusively()) |
|
1512 |
throw new IllegalMonitorStateException(); |
|
1513 |
Node first = firstWaiter; |
|
1514 |
if (first != null) |
|
1515 |
doSignalAll(first); |
|
1516 |
} |
|
1517 |
||
1518 |
/** |
|
1519 |
* Implements uninterruptible condition wait. |
|
1520 |
* <ol> |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1521 |
* <li>Save lock state returned by {@link #getState}. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1522 |
* <li>Invoke {@link #release} with saved state as argument, |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1523 |
* throwing IllegalMonitorStateException if it fails. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1524 |
* <li>Block until signalled. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1525 |
* <li>Reacquire by invoking specialized version of |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1526 |
* {@link #acquire} with saved state as argument. |
2 | 1527 |
* </ol> |
1528 |
*/ |
|
1529 |
public final void awaitUninterruptibly() { |
|
1530 |
Node node = addConditionWaiter(); |
|
1531 |
long savedState = fullyRelease(node); |
|
1532 |
boolean interrupted = false; |
|
1533 |
while (!isOnSyncQueue(node)) { |
|
1534 |
LockSupport.park(this); |
|
1535 |
if (Thread.interrupted()) |
|
1536 |
interrupted = true; |
|
1537 |
} |
|
1538 |
if (acquireQueued(node, savedState) || interrupted) |
|
1539 |
selfInterrupt(); |
|
1540 |
} |
|
1541 |
||
1542 |
/* |
|
1543 |
* For interruptible waits, we need to track whether to throw |
|
1544 |
* InterruptedException, if interrupted while blocked on |
|
1545 |
* condition, versus reinterrupt current thread, if |
|
1546 |
* interrupted while blocked waiting to re-acquire. |
|
1547 |
*/ |
|
1548 |
||
1549 |
/** Mode meaning to reinterrupt on exit from wait */ |
|
1550 |
private static final int REINTERRUPT = 1; |
|
1551 |
/** Mode meaning to throw InterruptedException on exit from wait */ |
|
1552 |
private static final int THROW_IE = -1; |
|
1553 |
||
1554 |
/** |
|
1555 |
* Checks for interrupt, returning THROW_IE if interrupted |
|
1556 |
* before signalled, REINTERRUPT if after signalled, or |
|
1557 |
* 0 if not interrupted. |
|
1558 |
*/ |
|
1559 |
private int checkInterruptWhileWaiting(Node node) { |
|
1560 |
return Thread.interrupted() ? |
|
1561 |
(transferAfterCancelledWait(node) ? THROW_IE : REINTERRUPT) : |
|
1562 |
0; |
|
1563 |
} |
|
1564 |
||
1565 |
/** |
|
1566 |
* Throws InterruptedException, reinterrupts current thread, or |
|
1567 |
* does nothing, depending on mode. |
|
1568 |
*/ |
|
1569 |
private void reportInterruptAfterWait(int interruptMode) |
|
1570 |
throws InterruptedException { |
|
1571 |
if (interruptMode == THROW_IE) |
|
1572 |
throw new InterruptedException(); |
|
1573 |
else if (interruptMode == REINTERRUPT) |
|
1574 |
selfInterrupt(); |
|
1575 |
} |
|
1576 |
||
1577 |
/** |
|
1578 |
* Implements interruptible condition wait. |
|
1579 |
* <ol> |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1580 |
* <li>If current thread is interrupted, throw InterruptedException. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1581 |
* <li>Save lock state returned by {@link #getState}. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1582 |
* <li>Invoke {@link #release} with saved state as argument, |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1583 |
* throwing IllegalMonitorStateException if it fails. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1584 |
* <li>Block until signalled or interrupted. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1585 |
* <li>Reacquire by invoking specialized version of |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1586 |
* {@link #acquire} with saved state as argument. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1587 |
* <li>If interrupted while blocked in step 4, throw InterruptedException. |
2 | 1588 |
* </ol> |
1589 |
*/ |
|
1590 |
public final void await() throws InterruptedException { |
|
1591 |
if (Thread.interrupted()) |
|
1592 |
throw new InterruptedException(); |
|
1593 |
Node node = addConditionWaiter(); |
|
1594 |
long savedState = fullyRelease(node); |
|
1595 |
int interruptMode = 0; |
|
1596 |
while (!isOnSyncQueue(node)) { |
|
1597 |
LockSupport.park(this); |
|
1598 |
if ((interruptMode = checkInterruptWhileWaiting(node)) != 0) |
|
1599 |
break; |
|
1600 |
} |
|
1601 |
if (acquireQueued(node, savedState) && interruptMode != THROW_IE) |
|
1602 |
interruptMode = REINTERRUPT; |
|
1603 |
if (node.nextWaiter != null) // clean up if cancelled |
|
1604 |
unlinkCancelledWaiters(); |
|
1605 |
if (interruptMode != 0) |
|
1606 |
reportInterruptAfterWait(interruptMode); |
|
1607 |
} |
|
1608 |
||
1609 |
/** |
|
1610 |
* Implements timed condition wait. |
|
1611 |
* <ol> |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1612 |
* <li>If current thread is interrupted, throw InterruptedException. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1613 |
* <li>Save lock state returned by {@link #getState}. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1614 |
* <li>Invoke {@link #release} with saved state as argument, |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1615 |
* throwing IllegalMonitorStateException if it fails. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1616 |
* <li>Block until signalled, interrupted, or timed out. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1617 |
* <li>Reacquire by invoking specialized version of |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1618 |
* {@link #acquire} with saved state as argument. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1619 |
* <li>If interrupted while blocked in step 4, throw InterruptedException. |
2 | 1620 |
* </ol> |
1621 |
*/ |
|
7518 | 1622 |
public final long awaitNanos(long nanosTimeout) |
1623 |
throws InterruptedException { |
|
2 | 1624 |
if (Thread.interrupted()) |
1625 |
throw new InterruptedException(); |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1626 |
// We don't check for nanosTimeout <= 0L here, to allow |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1627 |
// awaitNanos(0) as a way to "yield the lock". |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1628 |
final long deadline = System.nanoTime() + nanosTimeout; |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1629 |
long initialNanos = nanosTimeout; |
2 | 1630 |
Node node = addConditionWaiter(); |
1631 |
long savedState = fullyRelease(node); |
|
1632 |
int interruptMode = 0; |
|
1633 |
while (!isOnSyncQueue(node)) { |
|
1634 |
if (nanosTimeout <= 0L) { |
|
1635 |
transferAfterCancelledWait(node); |
|
1636 |
break; |
|
1637 |
} |
|
34348
ba5c2f2fc9d7
8143087: Miscellaneous changes imported from jsr166 CVS 2015-11
dl
parents:
33674
diff
changeset
|
1638 |
if (nanosTimeout > SPIN_FOR_TIMEOUT_THRESHOLD) |
14325
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
1639 |
LockSupport.parkNanos(this, nanosTimeout); |
2 | 1640 |
if ((interruptMode = checkInterruptWhileWaiting(node)) != 0) |
1641 |
break; |
|
14325
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
1642 |
nanosTimeout = deadline - System.nanoTime(); |
2 | 1643 |
} |
1644 |
if (acquireQueued(node, savedState) && interruptMode != THROW_IE) |
|
1645 |
interruptMode = REINTERRUPT; |
|
1646 |
if (node.nextWaiter != null) |
|
1647 |
unlinkCancelledWaiters(); |
|
1648 |
if (interruptMode != 0) |
|
1649 |
reportInterruptAfterWait(interruptMode); |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1650 |
long remaining = deadline - System.nanoTime(); // avoid overflow |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1651 |
return (remaining <= initialNanos) ? remaining : Long.MIN_VALUE; |
2 | 1652 |
} |
1653 |
||
1654 |
/** |
|
1655 |
* Implements absolute timed condition wait. |
|
1656 |
* <ol> |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1657 |
* <li>If current thread is interrupted, throw InterruptedException. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1658 |
* <li>Save lock state returned by {@link #getState}. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1659 |
* <li>Invoke {@link #release} with saved state as argument, |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1660 |
* throwing IllegalMonitorStateException if it fails. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1661 |
* <li>Block until signalled, interrupted, or timed out. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1662 |
* <li>Reacquire by invoking specialized version of |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1663 |
* {@link #acquire} with saved state as argument. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1664 |
* <li>If interrupted while blocked in step 4, throw InterruptedException. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1665 |
* <li>If timed out while blocked in step 4, return false, else true. |
2 | 1666 |
* </ol> |
1667 |
*/ |
|
7518 | 1668 |
public final boolean awaitUntil(Date deadline) |
1669 |
throws InterruptedException { |
|
2 | 1670 |
long abstime = deadline.getTime(); |
1671 |
if (Thread.interrupted()) |
|
1672 |
throw new InterruptedException(); |
|
1673 |
Node node = addConditionWaiter(); |
|
1674 |
long savedState = fullyRelease(node); |
|
1675 |
boolean timedout = false; |
|
1676 |
int interruptMode = 0; |
|
1677 |
while (!isOnSyncQueue(node)) { |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1678 |
if (System.currentTimeMillis() >= abstime) { |
2 | 1679 |
timedout = transferAfterCancelledWait(node); |
1680 |
break; |
|
1681 |
} |
|
1682 |
LockSupport.parkUntil(this, abstime); |
|
1683 |
if ((interruptMode = checkInterruptWhileWaiting(node)) != 0) |
|
1684 |
break; |
|
1685 |
} |
|
1686 |
if (acquireQueued(node, savedState) && interruptMode != THROW_IE) |
|
1687 |
interruptMode = REINTERRUPT; |
|
1688 |
if (node.nextWaiter != null) |
|
1689 |
unlinkCancelledWaiters(); |
|
1690 |
if (interruptMode != 0) |
|
1691 |
reportInterruptAfterWait(interruptMode); |
|
1692 |
return !timedout; |
|
1693 |
} |
|
1694 |
||
1695 |
/** |
|
1696 |
* Implements timed condition wait. |
|
1697 |
* <ol> |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1698 |
* <li>If current thread is interrupted, throw InterruptedException. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1699 |
* <li>Save lock state returned by {@link #getState}. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1700 |
* <li>Invoke {@link #release} with saved state as argument, |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1701 |
* throwing IllegalMonitorStateException if it fails. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1702 |
* <li>Block until signalled, interrupted, or timed out. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1703 |
* <li>Reacquire by invoking specialized version of |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1704 |
* {@link #acquire} with saved state as argument. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1705 |
* <li>If interrupted while blocked in step 4, throw InterruptedException. |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1706 |
* <li>If timed out while blocked in step 4, return false, else true. |
2 | 1707 |
* </ol> |
1708 |
*/ |
|
7518 | 1709 |
public final boolean await(long time, TimeUnit unit) |
1710 |
throws InterruptedException { |
|
2 | 1711 |
long nanosTimeout = unit.toNanos(time); |
1712 |
if (Thread.interrupted()) |
|
1713 |
throw new InterruptedException(); |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1714 |
// We don't check for nanosTimeout <= 0L here, to allow |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1715 |
// await(0, unit) as a way to "yield the lock". |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1716 |
final long deadline = System.nanoTime() + nanosTimeout; |
2 | 1717 |
Node node = addConditionWaiter(); |
1718 |
long savedState = fullyRelease(node); |
|
1719 |
boolean timedout = false; |
|
1720 |
int interruptMode = 0; |
|
1721 |
while (!isOnSyncQueue(node)) { |
|
1722 |
if (nanosTimeout <= 0L) { |
|
1723 |
timedout = transferAfterCancelledWait(node); |
|
1724 |
break; |
|
1725 |
} |
|
34348
ba5c2f2fc9d7
8143087: Miscellaneous changes imported from jsr166 CVS 2015-11
dl
parents:
33674
diff
changeset
|
1726 |
if (nanosTimeout > SPIN_FOR_TIMEOUT_THRESHOLD) |
2 | 1727 |
LockSupport.parkNanos(this, nanosTimeout); |
1728 |
if ((interruptMode = checkInterruptWhileWaiting(node)) != 0) |
|
1729 |
break; |
|
14325
622c473a21aa
8001575: Minor/sync/cleanup j.u.c with Dougs CVS - Oct 2012
dl
parents:
9242
diff
changeset
|
1730 |
nanosTimeout = deadline - System.nanoTime(); |
2 | 1731 |
} |
1732 |
if (acquireQueued(node, savedState) && interruptMode != THROW_IE) |
|
1733 |
interruptMode = REINTERRUPT; |
|
1734 |
if (node.nextWaiter != null) |
|
1735 |
unlinkCancelledWaiters(); |
|
1736 |
if (interruptMode != 0) |
|
1737 |
reportInterruptAfterWait(interruptMode); |
|
1738 |
return !timedout; |
|
1739 |
} |
|
1740 |
||
1741 |
// support for instrumentation |
|
1742 |
||
1743 |
/** |
|
1744 |
* Returns true if this condition was created by the given |
|
1745 |
* synchronization object. |
|
1746 |
* |
|
1747 |
* @return {@code true} if owned |
|
1748 |
*/ |
|
1749 |
final boolean isOwnedBy(AbstractQueuedLongSynchronizer sync) { |
|
1750 |
return sync == AbstractQueuedLongSynchronizer.this; |
|
1751 |
} |
|
1752 |
||
1753 |
/** |
|
1754 |
* Queries whether any threads are waiting on this condition. |
|
18576 | 1755 |
* Implements {@link AbstractQueuedLongSynchronizer#hasWaiters(ConditionObject)}. |
2 | 1756 |
* |
1757 |
* @return {@code true} if there are any waiting threads |
|
1758 |
* @throws IllegalMonitorStateException if {@link #isHeldExclusively} |
|
1759 |
* returns {@code false} |
|
1760 |
*/ |
|
1761 |
protected final boolean hasWaiters() { |
|
1762 |
if (!isHeldExclusively()) |
|
1763 |
throw new IllegalMonitorStateException(); |
|
1764 |
for (Node w = firstWaiter; w != null; w = w.nextWaiter) { |
|
1765 |
if (w.waitStatus == Node.CONDITION) |
|
1766 |
return true; |
|
1767 |
} |
|
1768 |
return false; |
|
1769 |
} |
|
1770 |
||
1771 |
/** |
|
1772 |
* Returns an estimate of the number of threads waiting on |
|
1773 |
* this condition. |
|
18576 | 1774 |
* Implements {@link AbstractQueuedLongSynchronizer#getWaitQueueLength(ConditionObject)}. |
2 | 1775 |
* |
1776 |
* @return the estimated number of waiting threads |
|
1777 |
* @throws IllegalMonitorStateException if {@link #isHeldExclusively} |
|
1778 |
* returns {@code false} |
|
1779 |
*/ |
|
1780 |
protected final int getWaitQueueLength() { |
|
1781 |
if (!isHeldExclusively()) |
|
1782 |
throw new IllegalMonitorStateException(); |
|
1783 |
int n = 0; |
|
1784 |
for (Node w = firstWaiter; w != null; w = w.nextWaiter) { |
|
1785 |
if (w.waitStatus == Node.CONDITION) |
|
1786 |
++n; |
|
1787 |
} |
|
1788 |
return n; |
|
1789 |
} |
|
1790 |
||
1791 |
/** |
|
1792 |
* Returns a collection containing those threads that may be |
|
1793 |
* waiting on this Condition. |
|
18576 | 1794 |
* Implements {@link AbstractQueuedLongSynchronizer#getWaitingThreads(ConditionObject)}. |
2 | 1795 |
* |
1796 |
* @return the collection of threads |
|
1797 |
* @throws IllegalMonitorStateException if {@link #isHeldExclusively} |
|
1798 |
* returns {@code false} |
|
1799 |
*/ |
|
1800 |
protected final Collection<Thread> getWaitingThreads() { |
|
1801 |
if (!isHeldExclusively()) |
|
1802 |
throw new IllegalMonitorStateException(); |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1803 |
ArrayList<Thread> list = new ArrayList<>(); |
2 | 1804 |
for (Node w = firstWaiter; w != null; w = w.nextWaiter) { |
1805 |
if (w.waitStatus == Node.CONDITION) { |
|
1806 |
Thread t = w.thread; |
|
1807 |
if (t != null) |
|
1808 |
list.add(t); |
|
1809 |
} |
|
1810 |
} |
|
1811 |
return list; |
|
1812 |
} |
|
1813 |
} |
|
1814 |
||
39725
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
1815 |
// VarHandle mechanics |
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
1816 |
private static final VarHandle STATE; |
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
1817 |
private static final VarHandle HEAD; |
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
1818 |
private static final VarHandle TAIL; |
2 | 1819 |
|
1820 |
static { |
|
1821 |
try { |
|
39725
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
1822 |
MethodHandles.Lookup l = MethodHandles.lookup(); |
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
1823 |
STATE = l.findVarHandle(AbstractQueuedLongSynchronizer.class, "state", long.class); |
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
1824 |
HEAD = l.findVarHandle(AbstractQueuedLongSynchronizer.class, "head", Node.class); |
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
1825 |
TAIL = l.findVarHandle(AbstractQueuedLongSynchronizer.class, "tail", Node.class); |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1826 |
} catch (ReflectiveOperationException e) { |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1827 |
throw new Error(e); |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1828 |
} |
2 | 1829 |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1830 |
// Reduce the risk of rare disastrous classloading in first call to |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1831 |
// LockSupport.park: https://bugs.openjdk.java.net/browse/JDK-8074773 |
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1832 |
Class<?> ensureLoaded = LockSupport.class; |
2 | 1833 |
} |
1834 |
||
1835 |
/** |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1836 |
* Initializes head and tail fields on first contention. |
2 | 1837 |
*/ |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1838 |
private final void initializeSyncQueue() { |
34348
ba5c2f2fc9d7
8143087: Miscellaneous changes imported from jsr166 CVS 2015-11
dl
parents:
33674
diff
changeset
|
1839 |
Node h; |
39725
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
1840 |
if (HEAD.compareAndSet(this, null, (h = new Node()))) |
34348
ba5c2f2fc9d7
8143087: Miscellaneous changes imported from jsr166 CVS 2015-11
dl
parents:
33674
diff
changeset
|
1841 |
tail = h; |
2 | 1842 |
} |
1843 |
||
1844 |
/** |
|
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1845 |
* CASes tail field. |
2 | 1846 |
*/ |
32990
299a81977f48
8134855: Bulk integration of java.util.concurrent.locks classes
dl
parents:
25859
diff
changeset
|
1847 |
private final boolean compareAndSetTail(Node expect, Node update) { |
39725
9548f8d846e9
8080603: Replace Unsafe with VarHandle in java.util.concurrent classes
dl
parents:
34348
diff
changeset
|
1848 |
return TAIL.compareAndSet(this, expect, update); |
2 | 1849 |
} |
1850 |
} |