HomeSort by relevance Sort by last modified time
    Searched refs:NEXT (Results 201 - 225 of 266) sorted by null

1 2 3 4 5 6 7 891011

  /external/llvm/test/MC/ARM/
eh-directive-section-multiple-func.s 58 @ CHECK-NEXT: Name: .TEST1
  /libcore/ojluni/src/main/java/java/util/concurrent/
ConcurrentLinkedDeque.java 114 * ("prev") and successor ("next") nodes:
116 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
125 * "last" node terminating any chain of next references starting at
130 * next reference in the first or last node to a fresh node
137 * A "self-link" is a next or prev reference that is the same node:
138 * p.prev == p or p.next == p
145 * (p.prev == null && p.next != p) ||
146 * (p.next == null && p.prev != p)
169 * any time, the set of live nodes maintained by prev and next
170 * links are identical, that is, the live nodes found via next
294 volatile Node<E> next; field in class:ConcurrentLinkedDeque.Node
424 final Node<E> next = x.next; local
687 Node<E> next = x.next; local
1411 public E next() { method in class:ConcurrentLinkedDeque.AbstractItr
    [all...]
LinkedTransferQueue.java 158 * first unmatched node on match and CASing the next field of the
209 * pointer updates: Threads may sometimes shortcut the "next" link
215 * of costly-to-reclaim garbage caused by the sequential "next"
223 * pointer, we set the "next" link of the previous head to point
227 * adds some further complexity to traversal: If any "next"
356 * to be removed, we can unsplice s by CASing the next field of
361 * (i.e., with null next), then it is pinned as the target node
454 volatile Node next; field in class:LinkedTransferQueue.Node
459 return U.compareAndSwapObject(this, NEXT, cmp, val);
481 U.putObject(this, NEXT, this)
759 Node next = p.next; local
1002 public final E next() { method in class:LinkedTransferQueue.Itr
    [all...]
  /frameworks/compile/mclinker/lib/Script/
ScriptParser.yy 135 %token NEXT
870 | NEXT '(' exp ')'
873 &Operator::create<Operator::NEXT>());
ScriptScanner.ll 124 <EXPRESSION>"NEXT" { return token::NEXT; }
  /external/pdfium/xfa/fxfa/fm2js/
xfa_lexer.cpp 445 goto NEXT;
450 NEXT:
  /libcore/luni/src/main/java/libcore/icu/
RelativeDateTimeFormatter.java 131 direction = android.icu.text.RelativeDateTimeFormatter.Direction.NEXT;
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/epiphany/
regression.d 70 64: 05e0 b 6e \<NEXT\>
78 0000006e \<NEXT\>:
  /external/llvm/test/MC/Mips/mips32r2/
valid.s 163 # CHECK-NEXT: .set mips32r2
164 # CHECK-NEXT: rdhwr $sp, $11
165 # CHECK-NEXT: .set pop # encoding: [0x7c,0x1d,0x58,0x3b]
  /external/llvm/test/MC/Mips/mips32r3/
valid.s 163 # CHECK-NEXT: .set mips32r2
164 # CHECK-NEXT: rdhwr $sp, $11
165 # CHECK-NEXT: .set pop # encoding: [0x7c,0x1d,0x58,0x3b]
  /external/llvm/test/MC/Mips/mips32r5/
valid.s 164 # CHECK-NEXT: .set mips32r2
165 # CHECK-NEXT: rdhwr $sp, $11
166 # CHECK-NEXT: .set pop # encoding: [0x7c,0x1d,0x58,0x3b]
  /libcore/ojluni/src/main/java/java/util/concurrent/locks/
AbstractQueuedSynchronizer.java 72 * mechanical sense that when a shared mode acquire succeeds, the next
342 * <p>We also use "next" links to implement blocking mechanics.
344 * predecessor signals the next node to wake up by traversing
345 * next link to determine which thread it is. Determination of
347 * the "next" fields of their predecessors. This is solved
350 * (Or, said differently, the next-links are an optimization
393 * waitStatus value to indicate the next acquireShared should
452 * assign next field of a predecessor until after attachment,
453 * so seeing a null next field does not necessarily mean that
454 * node is at end of queue. However, if a next field appear
460 volatile Node next; field in class:AbstractQueuedSynchronizer.Node
807 Node next = node.next; local
1906 Node next = first.nextWaiter; local
1931 Node next = t.nextWaiter; local
    [all...]
  /external/libxml2/
catalog.c 135 struct _xmlCatalogEntry *next; member in struct:_xmlCatalogEntry
285 ret->next = NULL;
366 xmlCatalogEntryPtr next; local
369 next = ret->next;
371 ret = next;
384 xmlCatalogEntryPtr children, next; local
391 next = children->next;
395 children = next;
    [all...]
  /external/llvm/test/MC/Mips/mips64r2/
valid.s 230 # CHECK-NEXT: .set mips32r2
231 # CHECK-NEXT: rdhwr $sp, $11
232 # CHECK-NEXT: .set pop # encoding: [0x7c,0x1d,0x58,0x3b]
  /external/llvm/test/MC/Mips/mips64r3/
valid.s 230 # CHECK-NEXT: .set mips32r2
231 # CHECK-NEXT: rdhwr $sp, $11
232 # CHECK-NEXT: .set pop # encoding: [0x7c,0x1d,0x58,0x3b]
  /external/llvm/test/MC/Mips/mips64r5/
valid.s 231 # CHECK-NEXT: .set mips32r2
232 # CHECK-NEXT: rdhwr $sp, $11
233 # CHECK-NEXT: .set pop # encoding: [0x7c,0x1d,0x58,0x3b]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/cjkcodecs/
cjkcodecs.h 109 #define NEXT(i, o) \
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/cjkcodecs/
cjkcodecs.h 109 #define NEXT(i, o) \
  /prebuilts/devtools/tools/lib/
objenesis-2.1.jar 
  /prebuilts/misc/common/robolectric/lib/
objenesis-2.1.jar 
  /prebuilts/tools/common/m2/repository/org/objenesis/objenesis/1.0/
objenesis-1.0.jar 
  /prebuilts/tools/common/m2/repository/org/objenesis/objenesis/1.2/
objenesis-1.2.jar 
  /prebuilts/tools/common/m2/repository/org/objenesis/objenesis/2.1/
objenesis-2.1.jar 
  /prebuilts/tools/common/objenesis/
objenesis-1.2.jar 
  /toolchain/binutils/binutils-2.25/ld/
ldgram.y 142 %token <integer> NEXT
539 n->next = NULL;
557 n->next = $1;
581 tmp->next = $1;
590 tmp->next = NULL;
600 tmp->next = $1;
609 tmp->next = NULL;
895 n->next = $2;
904 n->next = $3;
919 | NEXT '(' exp ')' %prec UNAR
    [all...]

Completed in 791 milliseconds

1 2 3 4 5 6 7 891011