Home
last modified time | relevance | path

Searched refs:head (Results 1 – 25 of 25) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
DArrayDeque.java107 transient int head; field in ArrayDeque
152 assert head == tail; in doubleCapacity()
153 int p = head; in doubleCapacity()
169 head = 0; in doubleCapacity()
219 elements[head = (head - 1) & (elements.length - 1)] = e; in addFirst()
220 if (head == tail) in addFirst()
236 if ( (tail = (tail + 1) & (elements.length - 1)) == head) in addLast()
286 final int h = head; in pollFirst()
292 head = (h + 1) & (elements.length - 1); in pollFirst()
314 E result = (E) elements[head]; in getFirst()
[all …]
DLinkedHashMap.java228 transient LinkedHashMapEntry<K,V> head; field in LinkedHashMap
250 head = p; in linkNodeLast()
263 head = dst; in transferLinks()
276 head = tail = null; in reinitialize()
312 head = a; in afterNodeRemoval()
323 if (evict && (first = head) != null && removeEldestEntry(first)) { in afterNodeInsertion()
336 head = a; in afterNodeAccess()
344 head = p; in afterNodeAccess()
355 for (LinkedHashMapEntry<K,V> e = head; e != null; e = e.after) { in internalWriteEntries()
439 for (LinkedHashMapEntry<K,V> e = head; e != null; e = e.after) { in containsValue()
[all …]
/libcore/ojluni/src/main/java/java/lang/ref/
DReferenceQueue.java48 private Reference<? extends T> head = null; field in ReferenceQueue
86 head = r; in enqueueLocked()
124 if (head != null) { in reallyPollLocked()
125 Reference<? extends T> r = head; in reallyPollLocked()
126 if (head == tail) { in reallyPollLocked()
128 head = null; in reallyPollLocked()
130 head = head.queueNext; in reallyPollLocked()
152 if (head == null) in poll()
/libcore/luni/src/main/java/java/lang/ref/
DFinalizerReference.java36 private static FinalizerReference<?> head = null; field in FinalizerReference
64 reference.next = head; in add()
65 if (head != null) { in add()
66 head.prev = reference; in add()
68 head = reference; in add()
82 head = next; in remove()
110 for (FinalizerReference<?> r = head; r != null; r = r.next) { in enqueueSentinelReference()
/libcore/ojluni/src/main/java/java/util/concurrent/
DLinkedBlockingQueue.java146 transient Node<E> head; field in LinkedBlockingQueue
212 Node<E> h = head; in dequeue()
215 head = first; in dequeue()
263 last = head = new Node<E>(null); in LinkedBlockingQueue()
510 return (count.get() > 0) ? head.next.item : null; in peek()
546 for (Node<E> trail = head, p = trail.next; in remove()
572 for (Node<E> p = head.next; p != null; p = p.next) in contains()
600 for (Node<E> p = head.next; p != null; p = p.next) in toArray()
653 for (Node<E> p = head.next; p != null; p = p.next) in toArray()
674 for (Node<E> p, h = head; (p = h.next) != null; h = p) { in clear()
[all …]
DLinkedTransferQueue.java560 transient volatile Node head; field in LinkedTransferQueue
607 for (Node h = head, p = h; p != null;) { // find & match first node in xfer()
616 if (head == h && casHead(h, n == null ? q : n)) { in xfer()
620 if ((h = head) == null || in xfer()
630 p = (p != n) ? n : (h = head); // Use head if p offlist in xfer()
658 if (p == null && (p = head) == null) { in tryAppend()
760 return (p == next) ? head : next; in succ()
770 for (Node p = head; p != null;) { in firstDataNode()
792 for (Node p = head; p != null;) { in countOfMode()
811 for (Node p = head; p != null;) { in toString()
[all …]
DSynchronousQueue.java303 volatile SNode head; field in SynchronousQueue.TransferStack
306 return h == head && in casHead()
354 SNode h = head; in transfer()
367 if ((h = head) != null && h.next == s) in transfer()
470 SNode h = head; in shouldSpin()
498 while ((p = head) != null && p != past && p.isCancelled()) in clean()
595 transient volatile QNode head; field in SynchronousQueue.TransferQueue
607 head = h; in TransferQueue()
616 if (h == head && in advanceHead()
672 QNode h = head; in transfer()
[all …]
DArrayBlockingQueue.java790 private Node head; field in ArrayBlockingQueue.Itrs
820 p = head; in doSomeSweeping()
833 p = head; in doSomeSweeping()
845 head = next; in doSomeSweeping()
868 head = new Node(itr, head); in register()
879 for (Node o = null, p = head; p != null;) { in takeIndexWrapped()
888 head = next; in takeIndexWrapped()
896 if (head == null) // no more iterators to track in takeIndexWrapped()
906 for (Node o = null, p = head; p != null;) { in removedAt()
915 head = next; in removedAt()
[all …]
DPhaser.java971 AtomicReference<QNode> head = (phase & 1) == 0 ? evenQ : oddQ; in releaseWaiters() local
972 while ((q = head.get()) != null && in releaseWaiters()
974 if (head.compareAndSet(q, q.next) && in releaseWaiters()
992 AtomicReference<QNode> head = (phase & 1) == 0 ? evenQ : oddQ; in abortWait() local
995 QNode q = head.get(); in abortWait()
999 if (head.compareAndSet(q, q.next) && t != null) { in abortWait()
1054 AtomicReference<QNode> head = (phase & 1) == 0 ? evenQ : oddQ; in internalAwaitAdvance() local
1055 QNode q = node.next = head.get(); in internalAwaitAdvance()
1058 queued = head.compareAndSet(q, node); in internalAwaitAdvance()
DConcurrentLinkedQueue.java220 transient volatile Node<E> head; field in ConcurrentLinkedQueue
240 head = tail = newNode(null); in ConcurrentLinkedQueue()
265 head = h; in ConcurrentLinkedQueue()
300 return (p == next) ? head : next; in succ()
332 p = (t != (t = tail)) ? t : head; in offer()
342 for (Node<E> h = head, p = h, q;;) { in poll()
367 for (Node<E> h = head, p = h, q;;) { in peek()
392 for (Node<E> h = head, p = h, q;;) { in first()
554 p = (t != (t = tail)) ? t : head; in addAll()
710 for (p = h = head;; p = q) { in Itr()
[all …]
DConcurrentLinkedDeque.java263 private transient volatile Node<E> head; field in ConcurrentLinkedDeque
356 for (Node<E> h = head, p = h, q;;) { in linkFirst()
361 p = (h != (h = head)) ? h : q; in linkFirst()
604 while ((h = head).item == null && (p = h.prev) != null) { in updateHead()
615 else if (h != head) in updateHead()
745 for (Node<E> h = head, p = h, q;;) { in first()
750 p = (h != (h = head)) ? h : q; in first()
805 head = tail = new Node<E>(null); in ConcurrentLinkedDeque()
848 head = h; in initHeadTail()
DConcurrentSkipListMap.java367 private transient volatile HeadIndex<K,V> head; field in ConcurrentSkipListMap
396 head = new HeadIndex<K,V>(new Node<K,V>(null, BASE_HEADER, null), in initialize()
667 for (Index<K,V> q = head, r = q.right, d;;) { in findPredecessor()
858 HeadIndex<K,V> h = head; in doPut()
870 h = head; in doPut()
983 if (head.right == null) in doRemove()
1014 HeadIndex<K,V> h = head; in tryReduceLevel()
1036 if ((n = (b = head.node).next) == null) in findFirst()
1050 if ((n = (b = head.node).next) == null) in doRemoveFirstEntry()
1075 for (Index<K,V> q = head;;) { in clearIndexToFirst()
[all …]
DScheduledThreadPoolExecutor.java540 Delayed head = (Delayed) super.getQueue().peek(); in overflowFree() local
541 if (head != null) { in overflowFree()
542 long headDelay = head.getDelay(NANOSECONDS); in overflowFree()
/libcore/ojluni/src/main/java/java/util/concurrent/locks/
DAbstractQueuedLongSynchronizer.java86 private transient volatile Node head; field in AbstractQueuedLongSynchronizer
194 head = node; in setHead()
249 Node h = head; in doReleaseShared()
261 if (h == head) // loop if head changed in doReleaseShared()
275 Node h = head; // Record old head for check below in setHeadAndPropagate()
294 (h = head) == null || h.waitStatus < 0) { in setHeadAndPropagate()
337 if (pred != head && in cancelAcquire()
428 if (p == head && tryAcquire(arg)) { in acquireQueued()
453 if (p == head && tryAcquire(arg)) { in doAcquireInterruptibly()
484 if (p == head && tryAcquire(arg)) { in doAcquireNanos()
[all …]
DAbstractQueuedSynchronizer.java554 private transient volatile Node head; field in AbstractQueuedSynchronizer
660 head = node; in setHead()
715 Node h = head; in doReleaseShared()
727 if (h == head) // loop if head changed in doReleaseShared()
741 Node h = head; // Record old head for check below in setHeadAndPropagate()
760 (h = head) == null || h.waitStatus < 0) { in setHeadAndPropagate()
803 if (pred != head && in cancelAcquire()
896 if (p == head && tryAcquire(arg)) { in acquireQueued()
921 if (p == head && tryAcquire(arg)) { in doAcquireInterruptibly()
952 if (p == head && tryAcquire(arg)) { in doAcquireNanos()
[all …]
/libcore/dom/src/test/resources/
Dhc_nodtdstaff.svg1 …="0" y="0" width="100" height="100"/><head xmlns='http://www.w3.org/1999/xhtml'><title>hc_nodtdsta…
/libcore/luni/src/test/java/libcore/java/util/
DOldTreeMapTest.java213 Map head = tm.headMap("100"); in test_headMapLjava_lang_Object() local
214 assertEquals("Returned map of incorrect size", 3, head.size()); in test_headMapLjava_lang_Object()
215 assertTrue("Returned incorrect elements", head.containsKey("0") in test_headMapLjava_lang_Object()
216 && head.containsValue(new Integer("1")) in test_headMapLjava_lang_Object()
217 && head.containsKey("10")); in test_headMapLjava_lang_Object()
262 assertTrue(head instanceof Serializable); in test_headMapLjava_lang_Object()
/libcore/tools/testmapping/
Dsave_logs.py81 (head, tail) = os.path.split(name)
83 name = head
/libcore/ojluni/annotations/hiddenapi/java/lang/ref/
DReferenceQueue.java76 private java.lang.ref.Reference<? extends T> head; field in ReferenceQueue
/libcore/ojluni/src/main/java/java/util/logging/
DLogManager.java872 String head; in getNode() local
874 head = name.substring(0, ix); in getNode()
877 head = name; in getNode()
883 LogNode child = node.children.get(head); in getNode()
886 node.children.put(head, child); in getNode()
/libcore/ojluni/annotations/hiddenapi/java/util/
DArrayDeque.java218 transient int head; field in ArrayDeque
DLinkedHashMap.java155 transient java.util.LinkedHashMap.LinkedHashMapEntry<K, V> head; field in LinkedHashMap
/libcore/ojluni/annotations/hiddenapi/java/util/concurrent/
DLinkedBlockingQueue.java187 transient java.util.concurrent.LinkedBlockingQueue.Node<E> head; field in LinkedBlockingQueue
/libcore/ojluni/src/test/java/util/concurrent/tck/
DCompletableFutureTest.java4336 CompletableFuture<Integer> head = new CompletableFuture<>(); in testRecursiveChains() local
4337 CompletableFuture<Integer> tail = head; in testRecursiveChains()
4346 head.complete(val); in testRecursiveChains()
4356 final CompletableFuture<Void> head = new CompletableFuture<>(); in testManyDependents() local
4360 head.thenRun(() -> count.getAndIncrement()); in testManyDependents()
4361 head.thenAccept(x -> count.getAndIncrement()); in testManyDependents()
4362 head.thenApply(x -> count.getAndIncrement()); in testManyDependents()
4364 head.runAfterBoth(complete, () -> count.getAndIncrement()); in testManyDependents()
4365 head.thenAcceptBoth(complete, (x, y) -> count.getAndIncrement()); in testManyDependents()
4366 head.thenCombine(complete, (x, y) -> count.getAndIncrement()); in testManyDependents()
[all …]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DTreeMapTest.java294 Map head = tm.headMap("100"); in test_headMapLjava_lang_Object() local
295 assertEquals("Returned map of incorrect size", 3, head.size()); in test_headMapLjava_lang_Object()
296 assertTrue("Returned incorrect elements", head.containsKey("0") in test_headMapLjava_lang_Object()
297 && head.containsValue(new Integer("1")) in test_headMapLjava_lang_Object()
298 && head.containsKey("10")); in test_headMapLjava_lang_Object()
322 assertTrue(head instanceof Serializable); in test_headMapLjava_lang_Object()