| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | SynchronousQueue.java | 248 boolean casNext(SNode cmp, SNode val) { in casNext() method in SynchronousQueue.TransferStack.SNode
387 s.casNext(m, mn); // help unlink in transfer()
399 h.casNext(m, mn); // help unlink in transfer()
505 p.casNext(n, n.next); in clean()
547 boolean casNext(QNode cmp, QNode val) { in casNext() method in SynchronousQueue.TransferQueue.QNode
688 if (!t.casNext(null, s)) // failed to link in in transfer()
798 if (sn == s || pred.casNext(s, sn)) in clean()
811 dp.casNext(d, dn))) // d unspliced in clean()
|
| D | ConcurrentLinkedQueue.java | 204 static <E> boolean casNext(Node<E> node, Node<E> cmp, Node<E> val) { in casNext() method in ConcurrentLinkedQueue
317 if (casNext(p, null, newNode)) { in offer()
491 casNext(pred, p, next); in remove()
535 if (casNext(p, null, beginningOfTheEnd)) { in addAll()
747 casNext(pred, p, q); in next()
|
| D | LinkedTransferQueue.java | 458 final boolean casNext(Node cmp, Node val) { in casNext() method in LinkedTransferQueue.Node
667 else if (!p.casNext(null, s)) in tryAppend()
956 b.casNext(s, n); in advance()
988 p.casNext(s, n); in advance()
1147 (n != s && pred.casNext(s, n) && pred.isMatched())) { in unsplice()
1192 p.casNext(s, n); in sweep()
|
| D | ConcurrentLinkedDeque.java | 315 boolean casNext(Node<E> cmp, Node<E> val) { in casNext() method in ConcurrentLinkedDeque.Node
399 if (p.casNext(null, newNode)) { in linkLast()
534 if (o != null && p.prev != p && first.casNext(next, p)) { in unlinkFirst()
709 if (next == p || x.casNext(next, p)) in skipDeletedSuccessors()
1188 if (p.casNext(null, beginningOfTheEnd)) { in addAll()
|
| D | ConcurrentSkipListMap.java | 453 boolean casNext(Node<K,V> cmp, Node<K,V> val) { in casNext() method in ConcurrentSkipListMap.Node
484 return casNext(f, new Node<K,V>(f)); in appendMarker()
502 casNext(f, new Node<K,V>(f)); in helpDelete()
504 b.casNext(this, f.next); in helpDelete()
846 if (!b.casNext(n, z)) in doPut()
979 if (!n.appendMarker(f) || !b.casNext(n, f)) in doRemove()
1062 if (!n.appendMarker(f) || !b.casNext(n, f)) in doRemoveFirstEntry()
1122 if (!n.appendMarker(f) || !b.casNext(n, f)) in doRemoveLastEntry()
|