/external/e2fsprogs/lib/ss/ |
H A D | get_readline.c | 47 char *tmp, *cp, *next; local 63 for (cp = tmp; cp; cp = next) { 64 next = strchr(cp, ':'); 65 if (next) 66 *next++ = 0;
|
/external/guava/guava/src/com/google/common/base/ |
H A D | AbstractIterator.java | 40 private T next; field in class:AbstractIterator 64 next = computeNext(); 73 public final T next() { method in class:AbstractIterator 78 T result = next; 79 next = null;
|
/external/junit/src/org/junit/experimental/theories/internal/ |
H A D | ParameterizedAssertionError.java | 33 Object next = iter.next(); 34 buffer.append(stringValueOf(next)); 42 private static String stringValueOf(Object next) { argument 44 return String.valueOf(next);
|
/external/libdrm/amdgpu/ |
H A D | amdgpu_vamgr.c | 172 hole = container_of(mgr->va_holes.next, hole, list); 180 struct amdgpu_bo_va_hole *next; local 183 LIST_FOR_EACH_ENTRY(next, &mgr->va_holes, list) { 184 if (next->offset < va) 186 hole = next; 195 if (next != hole 196 && &next->list != &mgr->va_holes 197 && (next->offset + next->size) == va) { 198 next [all...] |
/external/mockito/src/org/mockito/internal/verification/checkers/ |
H A D | NonGreedyNumberOfInvocationsInOrderChecker.java | 39 Invocation next = finder.findFirstMatchingUnverifiedInvocation( invocations, wanted, context ); 40 if( next == null ){ 43 marker.markVerified( next, wanted ); 44 context.markVerified( next ); 45 lastLocation = next.getLocation();
|
/external/nist-sip/java/gov/nist/javax/sip/parser/ |
H A D | ContactParser.java | 61 final char next = lexer.lookAhead(1); 62 if (next == ' ' || next == '\t' || next == '\r' || next == '\n') {
|
/external/selinux/libsepol/cil/src/ |
H A D | cil_list.c | 63 struct cil_list_item *next = NULL; local 66 next = item->next; 73 item = next; 82 new_item->next = NULL; 116 list->tail->next = item; 138 item->next = list->head; 164 item->next = curr->next; 166 curr->next [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 114 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node 116 Node<K, V> nextSibling; // the next node with the same key 226 tail.next = node; 245 node.next = nextSibling; 255 nextSibling.previous.next = node; 271 node.previous.next = node.next; 273 head = node.next; 275 if (node.next ! 318 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator 351 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator 412 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator 427 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator 451 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator 497 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 110 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node 112 Node<K, V> nextSibling; // the next node with the same key 222 tail.next = node; 241 node.next = nextSibling; 251 nextSibling.previous.next = node; 267 node.previous.next = node.next; 269 head = node.next; 271 if (node.next ! 314 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator 347 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator 408 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator 423 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator 447 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator 493 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator [all...] |
/external/opencv3/modules/core/src/ |
H A D | alloc.cpp | 208 Node* next; 219 next = _next; 233 prev->next = this; 234 next = _next; 235 if(next) 236 next->prev = this; 252 Block* next; 271 next = _next; 284 BigBlock* next; 300 BigBlock* nextBlock = pool->next; [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_bb.cpp | 60 for (ArrayList::Iterator it = allInsns.iterator(); !it.end(); it.next()) 63 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next()) 66 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next()) 97 for (Instruction *i = getFirst(); i; i = i->next) 102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) { 120 assert(inst->next == 0 && inst->prev == 0); 154 assert(inst->next == 0 && inst->prev == 0); 186 assert(p->next == 0 && p->prev == 0); 201 p->next = q; 204 p->prev->next 478 Instruction *insn, *next; local [all...] |
/external/chromium-trace/catapult/telemetry/third_party/webpagereplay/third_party/dns/rdtypes/ANY/ |
H A D | NSEC.py | 26 @ivar next: the next name 27 @type next: dns.name.Name object 31 __slots__ = ['next', 'windows'] 33 def __init__(self, rdclass, rdtype, next, windows): 35 self.next = next 39 next = self.next.choose_relativity(origin, relativize) 50 return '%s%s' % (next, tex [all...] |
/external/zlib/src/contrib/blast/ |
H A D | blast.c | 41 unsigned char *in; /* next input location */ 52 unsigned next; /* index of next write location in out[] */ member in struct:state 133 int left; /* bits left in next or left to process */ 134 short *next; /* next number of codes */ local 140 next = h->count + 1; 145 count = *next++; 151 index += count; /* else update for next length */ 256 * next, [all...] |
/external/autotest/tko/parsers/ |
H A D | base.py | 21 self.state.next() 29 return self.state.next() 49 return self.state.next()
|
/external/bison/src/ |
H A D | symlist.c | 53 res->next = NULL; 72 res->next = NULL; 90 res->next = NULL; 108 res->next = NULL; 121 for (/* Nothing. */; l && l->content.sym; l = l->next) 138 node->next = list; 150 symbol_list *node, *next; local 151 for (node = list; node; node = next) 153 next = node->next; [all...] |
/external/boringssl/src/crypto/lhash/ |
H A D | lhash_test.c | 28 struct dummy_lhash_node *next; member in struct:dummy_lhash_node 36 struct dummy_lhash_node *cur, *next; local 38 for (cur = lh->head; cur != NULL; cur = next) { 39 next = cur->next; 49 for (cur = lh->head; cur != NULL; cur = cur->next) { 59 for (cur = lh->head; cur != NULL; cur = cur->next) { 71 for (cur = lh->head; cur != NULL; cur = cur->next) { 82 node->next = lh->head; 92 for (cur = lh->head; cur != NULL; cur = cur->next) { [all...] |
/external/chromium-trace/catapult/third_party/py_vulcanize/py_vulcanize/ |
H A D | strip_js_comments.py | 54 t = token_stream.next() 61 t2 = token_stream.next() 70 t2 = token_stream.next()
|
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
H A D | GroupedLinkedMap.java | 75 LinkedEntry<K, V> current = head.next; 80 current = current.next; 92 entry.next = head.next; 100 entry.next = head; 105 entry.next.prev = entry; 106 entry.prev.next = entry; 110 entry.prev.next = entry.next; 111 entry.next 117 LinkedEntry<K, V> next; field in class:GroupedLinkedMap.LinkedEntry [all...] |
/external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
H A D | JSONTokener.java | 73 * the next number or identifier. 106 * Determine if the source string still contains characters that next() 111 char nextChar = next(); 121 * Get the next character in the source string. 123 * @return The next character, or 0 if past the end of the source string. 125 public char next() throws JSONException { method in class:JSONTokener 151 * Consume the next character, and check that it matches a specified 157 public char next(char c) throws JSONException { method in class:JSONTokener 158 char n = next(); 168 * Get the next 176 public String next(int n) throws JSONException { method in class:JSONTokener [all...] |
/external/jacoco/org.jacoco.core/src/org/jacoco/core/runtime/ |
H A D | WildcardMatcher.java | 34 boolean next = false; 36 if (next) { 40 next = true;
|
/external/javassist/src/main/javassist/bytecode/analysis/ |
H A D | IntQueue.java | 21 private IntQueue.Entry next; field in class:IntQueue.Entry 34 tail.next = entry; 50 head = head.next;
|
/external/javassist/src/main/javassist/convert/ |
H A D | Transformer.java | 34 private Transformer next; field in class:Transformer 37 next = t; 40 public Transformer getNext() { return next; }
|
/external/libcxx/test/std/containers/associative/map/map.cons/ |
H A D | copy.pass.cpp | 48 assert(*next(m.begin()) == V(2, 1)); 49 assert(*next(m.begin(), 2) == V(3, 1)); 56 assert(*next(mo.begin()) == V(2, 1)); 57 assert(*next(mo.begin(), 2) == V(3, 1)); 83 assert(*next(m.begin()) == V(2, 1)); 84 assert(*next(m.begin(), 2) == V(3, 1)); 91 assert(*next(mo.begin()) == V(2, 1)); 92 assert(*next(mo.begin(), 2) == V(3, 1)); 119 assert(*next(m.begin()) == V(2, 1)); 120 assert(*next( [all...] |
/external/mockito/cglib-and-asm/src/org/mockito/cglib/transform/ |
H A D | ClassTransformerChain.java | 29 ClassVisitor next = v; 31 chain[i].setTarget(next); 32 next = chain[i];
|
/external/toybox/toys/posix/ |
H A D | tee.c | 30 struct fd_list *next; member in struct:fd_list 41 temp->next = TT.outputs; 68 fdl = fdl->next;
|