| /external/swiftshader/third_party/LLVM/include/llvm/TableGen/ |
| Record.h | [all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedDeque.java | 148 * The deque object has two node references, "head" and "tail".
149 * The head and tail are only approximations to the first and last
151 * following prev pointers from head; likewise for tail. However,
152 * it is permissible for head and tail to be referring to deleted
184 * head or tail.
203 * the nodes pointed at by head/tail never get gc-unlinked, since
204 * head/tail are needed to get "back on track" by other nodes that
227 * restart traversal from tail.
261 * - head may not be reachable from the first or last node, or from tail
269 * - the last node is always O(1) reachable from tail via next link
277 private transient volatile Node<E> tail; field in class:ConcurrentLinkedDeque
[all...] |
| LinkedTransferQueue.java | 58 * producer. The <em>tail</em> of the queue is that element that has
114 * (unmatched) queue node (or null if empty); and "tail" that
119 * head tail
126 * tail pointers. This has led to the development of
162 * updates on head/tail fields.
165 * never versus always updating queue (head and tail) pointers.
172 * head tail
179 * similarly for "tail") is an empirical matter. We have found
186 * virtue of only sometimes updating head or tail pointers when
211 * known first unmatched node, and similarly for tail. Again, thi
563 private transient volatile Node tail; field in class:LinkedTransferQueue
[all...] |
| SynchronousQueue.java | 150 * cancelled. But if it may be pinned as the current tail, it must
596 /** Tail of queue */
597 transient volatile QNode tail; field in class:SynchronousQueue.TransferQueue
608 tail = h;
622 * Tries to cas nt as new tail.
625 if (tail == t)
626 U.compareAndSwapObject(this, TAIL, t, nt);
655 * advance head and tail on behalf of other stalled/slow
659 * seeing uninitialized head or tail values. This never
671 QNode t = tail;
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 89 * Tail of the wait queue, lazily initialized. Modified only via
92 private transient volatile Node tail; field in class:AbstractQueuedLongSynchronizer
150 Node oldTail = tail;
173 Node oldTail = tail;
217 * traverse backwards from tail to find the actual
223 for (Node p = tail; p != node && p != null; p = p.prev)
250 if (h != null && h != tail) {
330 // If we are the tail, remove ourselves.
331 if (node == tail && compareAndSetTail(node, pred)) {
[all...] |
| AbstractQueuedSynchronizer.java | 320 * tail. To dequeue, you just set the head field.
323 * head | | <---- | | <---- | | tail
328 * operation on "tail", so there is a simple atomic point of
349 * updated "tail" when a node's successor appears to be null.
364 * is constructed and head and tail pointers are set upon first
455 * to be null, we can scan prev's from the tail to
557 * Tail of the wait queue, lazily initialized. Modified only via
560 private transient volatile Node tail; field in class:AbstractQueuedSynchronizer
616 Node oldTail = tail;
639 Node oldTail = tail;
[all...] |
| /prebuilts/misc/common/robolectric/android-all/ |
| android-all-7.0.0_r1-robolectric-0.jar | |
| android-all-7.0.0_r1-robolectric-r1.jar | |
| android-all-7.1.0_r7-robolectric-0.jar | |
| android-all-7.1.0_r7-robolectric-r1.jar | |
| /external/testng/ant/ |
| ivy-2.1.0.jar | |
