Home
last modified time | relevance | path

Searched refs:casHead (Results 1 – 5 of 5) sorted by relevance

/libcore/ojluni/src/main/java/java/util/concurrent/
DSynchronousQueue.java305 boolean casHead(SNode h, SNode nh) { in casHead() method in SynchronousQueue.TransferStack
358 casHead(h, h.next); // pop cancelled node in transfer()
361 } else if (casHead(h, s = snode(s, e, h, mode))) { in transfer()
368 casHead(h, s.next); // help s's fulfiller in transfer()
373 casHead(h, h.next); // pop and retry in transfer()
374 else if (casHead(h, s=snode(s, e, h, FULFILLING|mode))) { in transfer()
378 casHead(s, null); // pop fulfill node in transfer()
384 casHead(s, mn); // pop both s and m in transfer()
393 casHead(h, null); // pop fulfilling node in transfer()
397 casHead(h, mn); // pop both h and m in transfer()
[all …]
DLinkedTransferQueue.java573 private boolean casHead(Node cmp, Node val) { in casHead() method in LinkedTransferQueue
616 if (head == h && casHead(h, n == null ? q : n)) { in xfer()
659 if (casHead(null, s)) in tryAppend()
1157 if (hn != h && casHead(h, hn)) in unsplice()
DConcurrentLinkedDeque.java372 casHead(h, newNode); // Failure is OK. in linkFirst()
610 if (casHead(h, p)) in updateHead()
754 || casHead(h, p)) in first()
1601 private boolean casHead(Node<E> cmp, Node<E> val) { in casHead() method in ConcurrentLinkedDeque
DConcurrentLinkedQueue.java289 if (h != p && casHead(h, p)) in updateHead()
926 private boolean casHead(Node<E> cmp, Node<E> val) { in casHead() method in ConcurrentLinkedQueue
DConcurrentSkipListMap.java403 private boolean casHead(HeadIndex<K,V> cmp, HeadIndex<K,V> val) { in casHead() method in ConcurrentSkipListMap
878 if (casHead(h, newh)) { in doPut()
1023 casHead(h, d) && // try to set in tryReduceLevel()
1025 casHead(d, h); // try to backout in tryReduceLevel()