1 |
/* |
2 |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
* Expert Group and released to the public domain, as explained at |
4 |
* http://creativecommons.org/licenses/publicdomain |
5 |
*/ |
6 |
|
7 |
package jsr166y; |
8 |
import java.util.concurrent.*; |
9 |
import java.util.concurrent.locks.*; |
10 |
import java.util.concurrent.atomic.*; |
11 |
import java.util.*; |
12 |
import java.io.*; |
13 |
import sun.misc.Unsafe; |
14 |
import java.lang.reflect.*; |
15 |
|
16 |
/** |
17 |
* An unbounded {@linkplain TransferQueue} based on linked nodes. |
18 |
* This queue orders elements FIFO (first-in-first-out) with respect |
19 |
* to any given producer. The <em>head</em> of the queue is that |
20 |
* element that has been on the queue the longest time for some |
21 |
* producer. The <em>tail</em> of the queue is that element that has |
22 |
* been on the queue the shortest time for some producer. |
23 |
* |
24 |
* <p>Beware that, unlike in most collections, the {@code size} |
25 |
* method is <em>NOT</em> a constant-time operation. Because of the |
26 |
* asynchronous nature of these queues, determining the current number |
27 |
* of elements requires a traversal of the elements. |
28 |
* |
29 |
* <p>This class and its iterator implement all of the |
30 |
* <em>optional</em> methods of the {@link Collection} and {@link |
31 |
* Iterator} interfaces. |
32 |
* |
33 |
* <p>Memory consistency effects: As with other concurrent |
34 |
* collections, actions in a thread prior to placing an object into a |
35 |
* {@code LinkedTransferQueue} |
36 |
* <a href="package-summary.html#MemoryVisibility"><i>happen-before</i></a> |
37 |
* actions subsequent to the access or removal of that element from |
38 |
* the {@code LinkedTransferQueue} in another thread. |
39 |
* |
40 |
* <p>This class is a member of the |
41 |
* <a href="{@docRoot}/../technotes/guides/collections/index.html"> |
42 |
* Java Collections Framework</a>. |
43 |
* |
44 |
* @since 1.7 |
45 |
* @author Doug Lea |
46 |
* @param <E> the type of elements held in this collection |
47 |
*/ |
48 |
public class LinkedTransferQueue<E> extends AbstractQueue<E> |
49 |
implements TransferQueue<E>, java.io.Serializable { |
50 |
private static final long serialVersionUID = -3223113410248163686L; |
51 |
|
52 |
/* |
53 |
* This class extends the approach used in FIFO-mode |
54 |
* SynchronousQueues. See the internal documentation, as well as |
55 |
* the PPoPP 2006 paper "Scalable Synchronous Queues" by Scherer, |
56 |
* Lea & Scott |
57 |
* (http://www.cs.rice.edu/~wns1/papers/2006-PPoPP-SQ.pdf) |
58 |
* |
59 |
* The main extension is to provide different Wait modes for the |
60 |
* main "xfer" method that puts or takes items. These don't |
61 |
* impact the basic dual-queue logic, but instead control whether |
62 |
* or how threads block upon insertion of request or data nodes |
63 |
* into the dual queue. It also uses slightly different |
64 |
* conventions for tracking whether nodes are off-list or |
65 |
* cancelled. |
66 |
*/ |
67 |
|
68 |
// Wait modes for xfer method |
69 |
static final int NOWAIT = 0; |
70 |
static final int TIMEOUT = 1; |
71 |
static final int WAIT = 2; |
72 |
|
73 |
/** The number of CPUs, for spin control */ |
74 |
static final int NCPUS = Runtime.getRuntime().availableProcessors(); |
75 |
|
76 |
/** |
77 |
* The number of times to spin before blocking in timed waits. |
78 |
* The value is empirically derived -- it works well across a |
79 |
* variety of processors and OSes. Empirically, the best value |
80 |
* seems not to vary with number of CPUs (beyond 2) so is just |
81 |
* a constant. |
82 |
*/ |
83 |
static final int maxTimedSpins = (NCPUS < 2) ? 0 : 32; |
84 |
|
85 |
/** |
86 |
* The number of times to spin before blocking in untimed waits. |
87 |
* This is greater than timed value because untimed waits spin |
88 |
* faster since they don't need to check times on each spin. |
89 |
*/ |
90 |
static final int maxUntimedSpins = maxTimedSpins * 16; |
91 |
|
92 |
/** |
93 |
* The number of nanoseconds for which it is faster to spin |
94 |
* rather than to use timed park. A rough estimate suffices. |
95 |
*/ |
96 |
static final long spinForTimeoutThreshold = 1000L; |
97 |
|
98 |
/** |
99 |
* Node class for LinkedTransferQueue. Opportunistically |
100 |
* subclasses from AtomicReference to represent item. Uses Object, |
101 |
* not E, to allow setting item to "this" after use, to avoid |
102 |
* garbage retention. Similarly, setting the next field to this is |
103 |
* used as sentinel that node is off list. |
104 |
*/ |
105 |
static final class QNode extends AtomicReference<Object> { |
106 |
volatile QNode next; |
107 |
volatile Thread waiter; // to control park/unpark |
108 |
final boolean isData; |
109 |
QNode(Object item, boolean isData) { |
110 |
super(item); |
111 |
this.isData = isData; |
112 |
} |
113 |
|
114 |
static final AtomicReferenceFieldUpdater<QNode, QNode> |
115 |
nextUpdater = AtomicReferenceFieldUpdater.newUpdater |
116 |
(QNode.class, QNode.class, "next"); |
117 |
|
118 |
final boolean casNext(QNode cmp, QNode val) { |
119 |
return nextUpdater.compareAndSet(this, cmp, val); |
120 |
} |
121 |
|
122 |
final void clearNext() { |
123 |
nextUpdater.lazySet(this, this); |
124 |
} |
125 |
|
126 |
} |
127 |
|
128 |
/** |
129 |
* Padded version of AtomicReference used for head, tail and |
130 |
* cleanMe, to alleviate contention across threads CASing one vs |
131 |
* the other. |
132 |
*/ |
133 |
static final class PaddedAtomicReference<T> extends AtomicReference<T> { |
134 |
// enough padding for 64bytes with 4byte refs |
135 |
Object p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, pa, pb, pc, pd, pe; |
136 |
PaddedAtomicReference(T r) { super(r); } |
137 |
} |
138 |
|
139 |
|
140 |
/** head of the queue */ |
141 |
private transient final PaddedAtomicReference<QNode> head; |
142 |
|
143 |
/** tail of the queue */ |
144 |
private transient final PaddedAtomicReference<QNode> tail; |
145 |
|
146 |
/** |
147 |
* Reference to a cancelled node that might not yet have been |
148 |
* unlinked from queue because it was the last inserted node |
149 |
* when it cancelled. |
150 |
*/ |
151 |
private transient final PaddedAtomicReference<QNode> cleanMe; |
152 |
|
153 |
/** |
154 |
* Tries to cas nh as new head; if successful, unlink |
155 |
* old head's next node to avoid garbage retention. |
156 |
*/ |
157 |
private boolean advanceHead(QNode h, QNode nh) { |
158 |
if (h == head.get() && head.compareAndSet(h, nh)) { |
159 |
h.clearNext(); // forget old next |
160 |
return true; |
161 |
} |
162 |
return false; |
163 |
} |
164 |
|
165 |
/** |
166 |
* Puts or takes an item. Used for most queue operations (except |
167 |
* poll() and tryTransfer()). See the similar code in |
168 |
* SynchronousQueue for detailed explanation. |
169 |
* |
170 |
* @param e the item or if null, signifies that this is a take |
171 |
* @param mode the wait mode: NOWAIT, TIMEOUT, WAIT |
172 |
* @param nanos timeout in nanosecs, used only if mode is TIMEOUT |
173 |
* @return an item, or null on failure |
174 |
*/ |
175 |
private Object xfer(Object e, int mode, long nanos) { |
176 |
boolean isData = (e != null); |
177 |
QNode s = null; |
178 |
final PaddedAtomicReference<QNode> head = this.head; |
179 |
final PaddedAtomicReference<QNode> tail = this.tail; |
180 |
|
181 |
for (;;) { |
182 |
QNode t = tail.get(); |
183 |
QNode h = head.get(); |
184 |
|
185 |
if (t != null && (t == h || t.isData == isData)) { |
186 |
if (s == null) |
187 |
s = new QNode(e, isData); |
188 |
QNode last = t.next; |
189 |
if (last != null) { |
190 |
if (t == tail.get()) |
191 |
tail.compareAndSet(t, last); |
192 |
} |
193 |
else if (t.casNext(null, s)) { |
194 |
tail.compareAndSet(t, s); |
195 |
return awaitFulfill(t, s, e, mode, nanos); |
196 |
} |
197 |
} |
198 |
|
199 |
else if (h != null) { |
200 |
QNode first = h.next; |
201 |
if (t == tail.get() && first != null && |
202 |
advanceHead(h, first)) { |
203 |
Object x = first.get(); |
204 |
if (x != first && first.compareAndSet(x, e)) { |
205 |
LockSupport.unpark(first.waiter); |
206 |
return isData ? e : x; |
207 |
} |
208 |
} |
209 |
} |
210 |
} |
211 |
} |
212 |
|
213 |
|
214 |
/** |
215 |
* Version of xfer for poll() and tryTransfer, which |
216 |
* simplifies control paths both here and in xfer. |
217 |
*/ |
218 |
private Object fulfill(Object e) { |
219 |
boolean isData = (e != null); |
220 |
final PaddedAtomicReference<QNode> head = this.head; |
221 |
final PaddedAtomicReference<QNode> tail = this.tail; |
222 |
|
223 |
for (;;) { |
224 |
QNode t = tail.get(); |
225 |
QNode h = head.get(); |
226 |
|
227 |
if (t != null && (t == h || t.isData == isData)) { |
228 |
QNode last = t.next; |
229 |
if (t == tail.get()) { |
230 |
if (last != null) |
231 |
tail.compareAndSet(t, last); |
232 |
else |
233 |
return null; |
234 |
} |
235 |
} |
236 |
else if (h != null) { |
237 |
QNode first = h.next; |
238 |
if (t == tail.get() && |
239 |
first != null && |
240 |
advanceHead(h, first)) { |
241 |
Object x = first.get(); |
242 |
if (x != first && first.compareAndSet(x, e)) { |
243 |
LockSupport.unpark(first.waiter); |
244 |
return isData ? e : x; |
245 |
} |
246 |
} |
247 |
} |
248 |
} |
249 |
} |
250 |
|
251 |
/** |
252 |
* Spins/blocks until node s is fulfilled or caller gives up, |
253 |
* depending on wait mode. |
254 |
* |
255 |
* @param pred the predecessor of waiting node |
256 |
* @param s the waiting node |
257 |
* @param e the comparison value for checking match |
258 |
* @param mode mode |
259 |
* @param nanos timeout value |
260 |
* @return matched item, or s if cancelled |
261 |
*/ |
262 |
private Object awaitFulfill(QNode pred, QNode s, Object e, |
263 |
int mode, long nanos) { |
264 |
if (mode == NOWAIT) |
265 |
return null; |
266 |
|
267 |
long lastTime = (mode == TIMEOUT) ? System.nanoTime() : 0; |
268 |
Thread w = Thread.currentThread(); |
269 |
int spins = -1; // set to desired spin count below |
270 |
for (;;) { |
271 |
if (w.isInterrupted()) |
272 |
s.compareAndSet(e, s); |
273 |
Object x = s.get(); |
274 |
if (x != e) { // Node was matched or cancelled |
275 |
advanceHead(pred, s); // unlink if head |
276 |
if (x == s) { // was cancelled |
277 |
clean(pred, s); |
278 |
return null; |
279 |
} |
280 |
else if (x != null) { |
281 |
s.set(s); // avoid garbage retention |
282 |
return x; |
283 |
} |
284 |
else |
285 |
return e; |
286 |
} |
287 |
if (mode == TIMEOUT) { |
288 |
long now = System.nanoTime(); |
289 |
nanos -= now - lastTime; |
290 |
lastTime = now; |
291 |
if (nanos <= 0) { |
292 |
s.compareAndSet(e, s); // try to cancel |
293 |
continue; |
294 |
} |
295 |
} |
296 |
if (spins < 0) { |
297 |
QNode h = head.get(); // only spin if at head |
298 |
spins = ((h != null && h.next == s) ? |
299 |
((mode == TIMEOUT) ? |
300 |
maxTimedSpins : maxUntimedSpins) : 0); |
301 |
} |
302 |
if (spins > 0) |
303 |
--spins; |
304 |
else if (s.waiter == null) |
305 |
s.waiter = w; |
306 |
else if (mode != TIMEOUT) { |
307 |
LockSupport.park(this); |
308 |
s.waiter = null; |
309 |
spins = -1; |
310 |
} |
311 |
else if (nanos > spinForTimeoutThreshold) { |
312 |
LockSupport.parkNanos(this, nanos); |
313 |
s.waiter = null; |
314 |
spins = -1; |
315 |
} |
316 |
} |
317 |
} |
318 |
|
319 |
/** |
320 |
* Returns validated tail for use in cleaning methods. |
321 |
*/ |
322 |
private QNode getValidatedTail() { |
323 |
for (;;) { |
324 |
QNode h = head.get(); |
325 |
QNode first = h.next; |
326 |
if (first != null && first.next == first) { // help advance |
327 |
advanceHead(h, first); |
328 |
continue; |
329 |
} |
330 |
QNode t = tail.get(); |
331 |
QNode last = t.next; |
332 |
if (t == tail.get()) { |
333 |
if (last != null) |
334 |
tail.compareAndSet(t, last); // help advance |
335 |
else |
336 |
return t; |
337 |
} |
338 |
} |
339 |
} |
340 |
|
341 |
/** |
342 |
* Gets rid of cancelled node s with original predecessor pred. |
343 |
* |
344 |
* @param pred predecessor of cancelled node |
345 |
* @param s the cancelled node |
346 |
*/ |
347 |
private void clean(QNode pred, QNode s) { |
348 |
Thread w = s.waiter; |
349 |
if (w != null) { // Wake up thread |
350 |
s.waiter = null; |
351 |
if (w != Thread.currentThread()) |
352 |
LockSupport.unpark(w); |
353 |
} |
354 |
|
355 |
if (pred == null) |
356 |
return; |
357 |
|
358 |
/* |
359 |
* At any given time, exactly one node on list cannot be |
360 |
* deleted -- the last inserted node. To accommodate this, if |
361 |
* we cannot delete s, we save its predecessor as "cleanMe", |
362 |
* processing the previously saved version first. At least one |
363 |
* of node s or the node previously saved can always be |
364 |
* processed, so this always terminates. |
365 |
*/ |
366 |
while (pred.next == s) { |
367 |
QNode oldpred = reclean(); // First, help get rid of cleanMe |
368 |
QNode t = getValidatedTail(); |
369 |
if (s != t) { // If not tail, try to unsplice |
370 |
QNode sn = s.next; // s.next == s means s already off list |
371 |
if (sn == s || pred.casNext(s, sn)) |
372 |
break; |
373 |
} |
374 |
else if (oldpred == pred || // Already saved |
375 |
(oldpred == null && cleanMe.compareAndSet(null, pred))) |
376 |
break; // Postpone cleaning |
377 |
} |
378 |
} |
379 |
|
380 |
/** |
381 |
* Tries to unsplice the cancelled node held in cleanMe that was |
382 |
* previously uncleanable because it was at tail. |
383 |
* |
384 |
* @return current cleanMe node (or null) |
385 |
*/ |
386 |
private QNode reclean() { |
387 |
/* |
388 |
* cleanMe is, or at one time was, predecessor of cancelled |
389 |
* node s that was the tail so could not be unspliced. If s |
390 |
* is no longer the tail, try to unsplice if necessary and |
391 |
* make cleanMe slot available. This differs from similar |
392 |
* code in clean() because we must check that pred still |
393 |
* points to a cancelled node that must be unspliced -- if |
394 |
* not, we can (must) clear cleanMe without unsplicing. |
395 |
* This can loop only due to contention on casNext or |
396 |
* clearing cleanMe. |
397 |
*/ |
398 |
QNode pred; |
399 |
while ((pred = cleanMe.get()) != null) { |
400 |
QNode t = getValidatedTail(); |
401 |
QNode s = pred.next; |
402 |
if (s != t) { |
403 |
QNode sn; |
404 |
if (s == null || s == pred || s.get() != s || |
405 |
(sn = s.next) == s || pred.casNext(s, sn)) |
406 |
cleanMe.compareAndSet(pred, null); |
407 |
} |
408 |
else // s is still tail; cannot clean |
409 |
break; |
410 |
} |
411 |
return pred; |
412 |
} |
413 |
|
414 |
/** |
415 |
* Creates an initially empty {@code LinkedTransferQueue}. |
416 |
*/ |
417 |
public LinkedTransferQueue() { |
418 |
QNode dummy = new QNode(null, false); |
419 |
head = new PaddedAtomicReference<QNode>(dummy); |
420 |
tail = new PaddedAtomicReference<QNode>(dummy); |
421 |
cleanMe = new PaddedAtomicReference<QNode>(null); |
422 |
} |
423 |
|
424 |
/** |
425 |
* Creates a {@code LinkedTransferQueue} |
426 |
* initially containing the elements of the given collection, |
427 |
* added in traversal order of the collection's iterator. |
428 |
* |
429 |
* @param c the collection of elements to initially contain |
430 |
* @throws NullPointerException if the specified collection or any |
431 |
* of its elements are null |
432 |
*/ |
433 |
public LinkedTransferQueue(Collection<? extends E> c) { |
434 |
this(); |
435 |
addAll(c); |
436 |
} |
437 |
|
438 |
public void put(E e) throws InterruptedException { |
439 |
if (e == null) throw new NullPointerException(); |
440 |
if (Thread.interrupted()) throw new InterruptedException(); |
441 |
xfer(e, NOWAIT, 0); |
442 |
} |
443 |
|
444 |
public boolean offer(E e, long timeout, TimeUnit unit) |
445 |
throws InterruptedException { |
446 |
if (e == null) throw new NullPointerException(); |
447 |
if (Thread.interrupted()) throw new InterruptedException(); |
448 |
xfer(e, NOWAIT, 0); |
449 |
return true; |
450 |
} |
451 |
|
452 |
public boolean offer(E e) { |
453 |
if (e == null) throw new NullPointerException(); |
454 |
xfer(e, NOWAIT, 0); |
455 |
return true; |
456 |
} |
457 |
|
458 |
public boolean add(E e) { |
459 |
if (e == null) throw new NullPointerException(); |
460 |
xfer(e, NOWAIT, 0); |
461 |
return true; |
462 |
} |
463 |
|
464 |
public void transfer(E e) throws InterruptedException { |
465 |
if (e == null) throw new NullPointerException(); |
466 |
if (xfer(e, WAIT, 0) == null) { |
467 |
Thread.interrupted(); |
468 |
throw new InterruptedException(); |
469 |
} |
470 |
} |
471 |
|
472 |
public boolean tryTransfer(E e, long timeout, TimeUnit unit) |
473 |
throws InterruptedException { |
474 |
if (e == null) throw new NullPointerException(); |
475 |
if (xfer(e, TIMEOUT, unit.toNanos(timeout)) != null) |
476 |
return true; |
477 |
if (!Thread.interrupted()) |
478 |
return false; |
479 |
throw new InterruptedException(); |
480 |
} |
481 |
|
482 |
public boolean tryTransfer(E e) { |
483 |
if (e == null) throw new NullPointerException(); |
484 |
return fulfill(e) != null; |
485 |
} |
486 |
|
487 |
public E take() throws InterruptedException { |
488 |
Object e = xfer(null, WAIT, 0); |
489 |
if (e != null) |
490 |
return (E) e; |
491 |
Thread.interrupted(); |
492 |
throw new InterruptedException(); |
493 |
} |
494 |
|
495 |
public E poll(long timeout, TimeUnit unit) throws InterruptedException { |
496 |
Object e = xfer(null, TIMEOUT, unit.toNanos(timeout)); |
497 |
if (e != null || !Thread.interrupted()) |
498 |
return (E) e; |
499 |
throw new InterruptedException(); |
500 |
} |
501 |
|
502 |
public E poll() { |
503 |
return (E) fulfill(null); |
504 |
} |
505 |
|
506 |
public int drainTo(Collection<? super E> c) { |
507 |
if (c == null) |
508 |
throw new NullPointerException(); |
509 |
if (c == this) |
510 |
throw new IllegalArgumentException(); |
511 |
int n = 0; |
512 |
E e; |
513 |
while ( (e = poll()) != null) { |
514 |
c.add(e); |
515 |
++n; |
516 |
} |
517 |
return n; |
518 |
} |
519 |
|
520 |
public int drainTo(Collection<? super E> c, int maxElements) { |
521 |
if (c == null) |
522 |
throw new NullPointerException(); |
523 |
if (c == this) |
524 |
throw new IllegalArgumentException(); |
525 |
int n = 0; |
526 |
E e; |
527 |
while (n < maxElements && (e = poll()) != null) { |
528 |
c.add(e); |
529 |
++n; |
530 |
} |
531 |
return n; |
532 |
} |
533 |
|
534 |
// Traversal-based methods |
535 |
|
536 |
/** |
537 |
* Returns head after performing any outstanding helping steps. |
538 |
*/ |
539 |
private QNode traversalHead() { |
540 |
for (;;) { |
541 |
QNode t = tail.get(); |
542 |
QNode h = head.get(); |
543 |
if (h != null && t != null) { |
544 |
QNode last = t.next; |
545 |
QNode first = h.next; |
546 |
if (t == tail.get()) { |
547 |
if (last != null) |
548 |
tail.compareAndSet(t, last); |
549 |
else if (first != null) { |
550 |
Object x = first.get(); |
551 |
if (x == first) |
552 |
advanceHead(h, first); |
553 |
else |
554 |
return h; |
555 |
} |
556 |
else |
557 |
return h; |
558 |
} |
559 |
} |
560 |
reclean(); |
561 |
} |
562 |
} |
563 |
|
564 |
|
565 |
public Iterator<E> iterator() { |
566 |
return new Itr(); |
567 |
} |
568 |
|
569 |
/** |
570 |
* Iterators. Basic strategy is to traverse list, treating |
571 |
* non-data (i.e., request) nodes as terminating list. |
572 |
* Once a valid data node is found, the item is cached |
573 |
* so that the next call to next() will return it even |
574 |
* if subsequently removed. |
575 |
*/ |
576 |
class Itr implements Iterator<E> { |
577 |
QNode next; // node to return next |
578 |
QNode pnext; // predecessor of next |
579 |
QNode snext; // successor of next |
580 |
QNode curr; // last returned node, for remove() |
581 |
QNode pcurr; // predecessor of curr, for remove() |
582 |
E nextItem; // Cache of next item, once committed to in next |
583 |
|
584 |
Itr() { |
585 |
findNext(); |
586 |
} |
587 |
|
588 |
/** |
589 |
* Ensures next points to next valid node, or null if none. |
590 |
*/ |
591 |
void findNext() { |
592 |
for (;;) { |
593 |
QNode pred = pnext; |
594 |
QNode q = next; |
595 |
if (pred == null || pred == q) { |
596 |
pred = traversalHead(); |
597 |
q = pred.next; |
598 |
} |
599 |
if (q == null || !q.isData) { |
600 |
next = null; |
601 |
return; |
602 |
} |
603 |
Object x = q.get(); |
604 |
QNode s = q.next; |
605 |
if (x != null && q != x && q != s) { |
606 |
nextItem = (E) x; |
607 |
snext = s; |
608 |
pnext = pred; |
609 |
next = q; |
610 |
return; |
611 |
} |
612 |
pnext = q; |
613 |
next = s; |
614 |
} |
615 |
} |
616 |
|
617 |
public boolean hasNext() { |
618 |
return next != null; |
619 |
} |
620 |
|
621 |
public E next() { |
622 |
if (next == null) throw new NoSuchElementException(); |
623 |
pcurr = pnext; |
624 |
curr = next; |
625 |
pnext = next; |
626 |
next = snext; |
627 |
E x = nextItem; |
628 |
findNext(); |
629 |
return x; |
630 |
} |
631 |
|
632 |
public void remove() { |
633 |
QNode p = curr; |
634 |
if (p == null) |
635 |
throw new IllegalStateException(); |
636 |
Object x = p.get(); |
637 |
if (x != null && x != p && p.compareAndSet(x, p)) |
638 |
clean(pcurr, p); |
639 |
} |
640 |
} |
641 |
|
642 |
public E peek() { |
643 |
for (;;) { |
644 |
QNode h = traversalHead(); |
645 |
QNode p = h.next; |
646 |
if (p == null) |
647 |
return null; |
648 |
Object x = p.get(); |
649 |
if (p != x) { |
650 |
if (!p.isData) |
651 |
return null; |
652 |
if (x != null) |
653 |
return (E) x; |
654 |
} |
655 |
} |
656 |
} |
657 |
|
658 |
public boolean isEmpty() { |
659 |
for (;;) { |
660 |
QNode h = traversalHead(); |
661 |
QNode p = h.next; |
662 |
if (p == null) |
663 |
return true; |
664 |
Object x = p.get(); |
665 |
if (p != x) { |
666 |
if (!p.isData) |
667 |
return true; |
668 |
if (x != null) |
669 |
return false; |
670 |
} |
671 |
} |
672 |
} |
673 |
|
674 |
public boolean hasWaitingConsumer() { |
675 |
for (;;) { |
676 |
QNode h = traversalHead(); |
677 |
QNode p = h.next; |
678 |
if (p == null) |
679 |
return false; |
680 |
Object x = p.get(); |
681 |
if (p != x) |
682 |
return !p.isData; |
683 |
} |
684 |
} |
685 |
|
686 |
/** |
687 |
* Returns the number of elements in this queue. If this queue |
688 |
* contains more than {@code Integer.MAX_VALUE} elements, returns |
689 |
* {@code Integer.MAX_VALUE}. |
690 |
* |
691 |
* <p>Beware that, unlike in most collections, this method is |
692 |
* <em>NOT</em> a constant-time operation. Because of the |
693 |
* asynchronous nature of these queues, determining the current |
694 |
* number of elements requires an O(n) traversal. |
695 |
* |
696 |
* @return the number of elements in this queue |
697 |
*/ |
698 |
public int size() { |
699 |
int count = 0; |
700 |
QNode h = traversalHead(); |
701 |
for (QNode p = h.next; p != null && p.isData; p = p.next) { |
702 |
Object x = p.get(); |
703 |
if (x != null && x != p) { |
704 |
if (++count == Integer.MAX_VALUE) // saturated |
705 |
break; |
706 |
} |
707 |
} |
708 |
return count; |
709 |
} |
710 |
|
711 |
public int getWaitingConsumerCount() { |
712 |
int count = 0; |
713 |
QNode h = traversalHead(); |
714 |
for (QNode p = h.next; p != null && !p.isData; p = p.next) { |
715 |
if (p.get() == null) { |
716 |
if (++count == Integer.MAX_VALUE) |
717 |
break; |
718 |
} |
719 |
} |
720 |
return count; |
721 |
} |
722 |
|
723 |
public int remainingCapacity() { |
724 |
return Integer.MAX_VALUE; |
725 |
} |
726 |
|
727 |
public boolean remove(Object o) { |
728 |
if (o == null) |
729 |
return false; |
730 |
for (;;) { |
731 |
QNode pred = traversalHead(); |
732 |
for (;;) { |
733 |
QNode q = pred.next; |
734 |
if (q == null || !q.isData) |
735 |
return false; |
736 |
if (q == pred) // restart |
737 |
break; |
738 |
Object x = q.get(); |
739 |
if (x != null && x != q && o.equals(x) && |
740 |
q.compareAndSet(x, q)) { |
741 |
clean(pred, q); |
742 |
return true; |
743 |
} |
744 |
pred = q; |
745 |
} |
746 |
} |
747 |
} |
748 |
|
749 |
/** |
750 |
* Save the state to a stream (that is, serialize it). |
751 |
* |
752 |
* @serialData All of the elements (each an {@code E}) in |
753 |
* the proper order, followed by a null |
754 |
* @param s the stream |
755 |
*/ |
756 |
private void writeObject(java.io.ObjectOutputStream s) |
757 |
throws java.io.IOException { |
758 |
s.defaultWriteObject(); |
759 |
for (E e : this) |
760 |
s.writeObject(e); |
761 |
// Use trailing null as sentinel |
762 |
s.writeObject(null); |
763 |
} |
764 |
|
765 |
/** |
766 |
* Reconstitute the Queue instance from a stream (that is, |
767 |
* deserialize it). |
768 |
* |
769 |
* @param s the stream |
770 |
*/ |
771 |
private void readObject(java.io.ObjectInputStream s) |
772 |
throws java.io.IOException, ClassNotFoundException { |
773 |
s.defaultReadObject(); |
774 |
resetHeadAndTail(); |
775 |
for (;;) { |
776 |
E item = (E) s.readObject(); |
777 |
if (item == null) |
778 |
break; |
779 |
else |
780 |
offer(item); |
781 |
} |
782 |
} |
783 |
|
784 |
|
785 |
// Support for resetting head/tail while deserializing |
786 |
private void resetHeadAndTail() { |
787 |
QNode dummy = new QNode(null, false); |
788 |
UNSAFE.putObjectVolatile(this, headOffset, |
789 |
new PaddedAtomicReference<QNode>(dummy)); |
790 |
UNSAFE.putObjectVolatile(this, tailOffset, |
791 |
new PaddedAtomicReference<QNode>(dummy)); |
792 |
UNSAFE.putObjectVolatile(this, cleanMeOffset, |
793 |
new PaddedAtomicReference<QNode>(null)); |
794 |
} |
795 |
|
796 |
// Temporary Unsafe mechanics for preliminary release |
797 |
private static Unsafe getUnsafe() throws Throwable { |
798 |
try { |
799 |
return Unsafe.getUnsafe(); |
800 |
} catch (SecurityException se) { |
801 |
try { |
802 |
return java.security.AccessController.doPrivileged |
803 |
(new java.security.PrivilegedExceptionAction<Unsafe>() { |
804 |
public Unsafe run() throws Exception { |
805 |
return getUnsafePrivileged(); |
806 |
}}); |
807 |
} catch (java.security.PrivilegedActionException e) { |
808 |
throw e.getCause(); |
809 |
} |
810 |
} |
811 |
} |
812 |
|
813 |
private static Unsafe getUnsafePrivileged() |
814 |
throws NoSuchFieldException, IllegalAccessException { |
815 |
Field f = Unsafe.class.getDeclaredField("theUnsafe"); |
816 |
f.setAccessible(true); |
817 |
return (Unsafe) f.get(null); |
818 |
} |
819 |
|
820 |
private static long fieldOffset(String fieldName) |
821 |
throws NoSuchFieldException { |
822 |
return UNSAFE.objectFieldOffset |
823 |
(LinkedTransferQueue.class.getDeclaredField(fieldName)); |
824 |
} |
825 |
|
826 |
private static final Unsafe UNSAFE; |
827 |
private static final long headOffset; |
828 |
private static final long tailOffset; |
829 |
private static final long cleanMeOffset; |
830 |
static { |
831 |
try { |
832 |
UNSAFE = getUnsafe(); |
833 |
headOffset = fieldOffset("head"); |
834 |
tailOffset = fieldOffset("tail"); |
835 |
cleanMeOffset = fieldOffset("cleanMe"); |
836 |
} catch (Throwable e) { |
837 |
throw new RuntimeException("Could not initialize intrinsics", e); |
838 |
} |
839 |
} |
840 |
|
841 |
} |