HomeSort by relevance Sort by last modified time
    Searched refs:NEXT (Results 251 - 275 of 322) sorted by null

<<111213

  /prebuilts/devtools/tools/lib/
objenesis-2.1.jar 
  /prebuilts/misc/common/robolectric/3.1.1/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 
  /toolchain/binutils/binutils-2.27/ld/
ldgram.y 142 %token <integer> NEXT
543 n->next = NULL;
561 n->next = $1;
585 tmp->next = $1;
594 tmp->next = NULL;
604 tmp->next = $1;
613 tmp->next = NULL;
899 n->next = $2;
908 n->next = $3;
923 | NEXT '(' exp ')' %prec UNAR
    [all...]
ldexp.c 111 { NEXT, "NEXT" },
359 case NEXT:
360 /* Return next place aligned to value. */
417 for (seg = segments; seg; seg = seg->next)
745 if (h->u.undef.next == NULL && h != link_info.hash->undefs_tail)
    [all...]
ldlex.l 266 <EXPRESSION,BOTH,SCRIPT>"NEXT" { RTOKEN(NEXT);}
  /external/mesa3d/src/compiler/glsl/glcpp/
glcpp-parse.y 12 * The above copyright notice and this permission notice (including the next
782 node->next = NULL;
787 list->tail->next = node;
802 for (i = 0, node = list->head; node; i++, node = node->next) {
822 for (node = list->head; node; node = node->next) {
823 for (dup = node->next; dup; dup = dup->next) {
841 for (node = list->head; node; node = node->next)
860 node_a = node_a->next, node_b = node_b->next)
    [all...]
  /external/opencv/cv/src/
mycvHaarDetectObjects.cpp 93 struct MyCvHidHaarStageClassifier* next; member in struct:MyCvHidHaarStageClassifier
277 hid_stage_classifier->next = (stage_classifier->next == -1)
278 ? NULL : out->stage_classifier + stage_classifier->next;
282 out->is_tree |= hid_stage_classifier->next != NULL;
456 #define NEXT(n, i) (((n) + (i)/(n)) >> 1)
460 unsigned int n1 = NEXT(n, (unsigned int)number);
464 n1 = NEXT(n, number);
540 // while( ptr && ptr->next == NULL ) ptr = ptr->parent;
546 // ptr = ptr->next;
    [all...]
  /external/libxaac/decoder/armv8/
ixheaacd_post_twiddle.s 54 BLT NEXT
61 NEXT:
ixheaacd_post_twiddle_overlap.s 160 BLT NEXT
211 NEXT:
    [all...]
  /prebuilts/tools/common/m2/repository/org/objenesis/objenesis/2.4/
objenesis-2.4.jar 
  /prebuilts/tools/common/m2/repository/org/objenesis/objenesis/2.5/
objenesis-2.5.jar 
  /libcore/ojluni/src/main/java/java/util/concurrent/
CompletableFuture.java 437 volatile Completion next; // Treiber stack link field in class:CompletableFuture.Completion
456 static void lazySetNext(Completion c, Completion next) {
457 U.putOrderedObject(c, NEXT, next);
474 if (f.casStack(h, t = h.next)) {
480 h.next = null; // detach
490 Completion s = q.next;
500 p.next = s;
    [all...]
ConcurrentSkipListMap.java 138 * Nodes next v v v v v
150 * basic idea in these lists is to mark the "next" pointers of
158 * use direct CAS'able next pointers. On deletion, instead of
172 * algorithm of changing the next-pointer of a deleted node so
208 * n's next pointer.
210 * 2. CAS n's next pointer to point to a new marker node.
218 * 3. CAS b's next pointer over both n and its marker.
233 * just (b, n, f), although the next field of a marker is
234 * immutable, and once a next field is CAS'ed to point to a
245 * Index levels are maintained as lists with volatile next fields
419 volatile Node<K,V> next; field in class:ConcurrentSkipListMap.Node
2271 Node<K,V> next; field in class:ConcurrentSkipListMap.Iter
2319 public V next() { method in class:ConcurrentSkipListMap.ValueIterator
2327 public K next() { method in class:ConcurrentSkipListMap.KeyIterator
2335 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.EntryIterator
3083 Node<K,V> next; field in class:ConcurrentSkipListMap.SubMap.SubMapIter
3172 action.accept(next()); method
3180 action.accept(next()); method
3190 public V next() { method in class:ConcurrentSkipListMap.SubMap.SubMapValueIterator
3201 public K next() { method in class:ConcurrentSkipListMap.SubMap.SubMapKeyIterator
3216 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.SubMap.SubMapEntryIterator
    [all...]
  /external/libxaac/decoder/armv7/
ixheaacd_post_twiddle_overlap.s 90 BLT NEXT
116 NEXT:
  /external/python/cpython3/Modules/cjkcodecs/
_codecs_iso2022.c 176 NEXT(1, 1);
    [all...]
  /toolchain/binutils/binutils-2.27/gas/config/
tc-arc.c 535 #define RELAX_TABLE_ENTRY(BITS, ISSIGNED, SIZE, NEXT) \
539 (NEXT) } \
541 #define RELAX_TABLE_ENTRY_MAX(ISSIGNED, SIZE, NEXT) \
545 (NEXT) } \
669 /* Return the next ARC_OPCODE from ENTRY, using ITER to hold state between
819 in the next fragment. This will be fine; both relocations will still
    [all...]
  /toolchain/binutils/binutils-2.27/gold/
yyscript.y 156 %token NEXT
234 /* Read the special token to see what to read next. */
script.cc 228 // Return the next token.
274 // next character, since we sometimes need that.
320 // Read the next token.
388 // Return whether C can be the start of a name, if the next character
755 // Return the next token at *PP. Update *PP. General guideline: we
862 // Return the next token.
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
debug_test.go 50 // to next through the generated executable, recording each line landed at, and
60 // and for both gdb and dlv by default repeated lines in the next stream are ignored
227 t.Fatalf("step/next histories differ, diff command %s failed with error=%v", line, err)
229 t.Fatalf("step/next histories differ, diff=\n%s", string(bytes))
236 stepnext(s string) bool // step or next, possible with parameter, gets line etc. returns true for success, false for unsure response
507 fmt.Printf("DID NOT MATCH EXPECTED NEXT OUTPUT\nO='%s'\nE='%s'\n", x.o, x.e)
688 // found between lookfor and the next ")".
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
debug_test.go 50 // to next through the generated executable, recording each line landed at, and
60 // and for both gdb and dlv by default repeated lines in the next stream are ignored
227 t.Fatalf("step/next histories differ, diff command %s failed with error=%v", line, err)
229 t.Fatalf("step/next histories differ, diff=\n%s", string(bytes))
236 stepnext(s string) bool // step or next, possible with parameter, gets line etc. returns true for success, false for unsure response
507 fmt.Printf("DID NOT MATCH EXPECTED NEXT OUTPUT\nO='%s'\nE='%s'\n", x.o, x.e)
688 // found between lookfor and the next ")".
  /external/one-true-awk/
run.c 111 /* round up to next multiple of quantum */
186 FATAL("illegal break, continue, next or nextfile from BEGIN");
202 FATAL("illegal break, continue, next or nextfile from END");
348 Cell *jump(Node **a, int n) /* break, continue, next, nextfile, return */
377 case NEXT:
392 Cell *awkgetline(Node **a, int n) /* get next line from specific input */
922 *p = '\0'; /* next output will start here */
    [all...]
  /prebuilts/tools/common/m2/repository/jdom/jdom/1.0/
jdom-1.0.jar 

Completed in 1337 milliseconds

<<111213