/cts/tests/tests/graphics/src/android/graphics/cts/ |
RegionIteratorTest.java | 37 regionIterator.next(null); 41 assertTrue(regionIterator.next(rect)); 47 assertFalse(regionIterator.next(rect)); 58 assertTrue(regionIterator.next(rect)); 63 assertTrue(regionIterator.next(rect)); 68 assertTrue(regionIterator.next(rect)); 74 assertFalse(regionIterator.next(rect)); 85 assertTrue(regionIterator.next(rect)); 90 assertTrue(regionIterator.next(rect)); 96 assertFalse(regionIterator.next(rect)) [all...] |
/external/bluetooth/bluedroid/osi/src/ |
list.c | 7 struct list_node_t *next; member in struct:list_node_t 83 node->next = prev_node->next; 85 prev_node->next = node; 103 node->next = list->head; 123 node->next = NULL; 129 list->tail->next = node; 149 list_node_t *next = list_free_node_(list, list->head); local 151 list->tail = next; 152 list->head = next; 188 list_node_t *next = node->next; local 231 list_node_t *next = node->next; local [all...] |
/external/chromium_org/native_client_sdk/src/libraries/xray/ |
stringpool.c | 22 struct XRayStringPoolNode* next; member in struct:XRayStringPoolNode 37 s->next = NULL; 60 pool->current->next = XRayStringPoolAllocNode(); 61 pool->current = pool->current->next; 87 n = n->next;
|
/external/chromium_org/net/quic/test_tools/ |
test_task_runner.cc | 41 // Find the next task to run, advance the time to the correct time 43 std::vector<PostedTask>::iterator next = FindNextTask(); local 44 DCHECK(next != tasks_.end()); 46 (next->GetTimeToRun() - clock_->NowInTicks()).InMicroseconds())); 47 PostedTask task = *next; 48 tasks_.erase(next);
|
/external/e2fsprogs/lib/ss/ |
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/junit/src/org/junit/experimental/theories/internal/ |
ParameterizedAssertionError.java | 33 Object next = iter.next(); local 34 buffer.append(stringValueOf(next)); 42 private static String stringValueOf(Object next) { 44 return String.valueOf(next);
|
/external/mockito/src/org/mockito/internal/verification/checkers/ |
NonGreedyNumberOfInvocationsInOrderChecker.java | 39 Invocation next = finder.findFirstMatchingUnverifiedInvocation( invocations, wanted, context ); local 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/ |
ContactParser.java | 61 final char next = lexer.lookAhead(1); local 62 if (next == ' ' || next == '\t' || next == '\r' || next == '\n') {
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
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 = p 478 Instruction *insn, *next; local [all...] |
nv50_ir_graph.cpp | 40 for (IteratorRef it = safeIteratorDFS(); !it->end(); it->next()) 56 prev[0]->next[0] = next[0]; 57 next[0]->prev[0] = prev[0]; 59 origin->out = (next[0] == this) ? NULL : next[0]; 64 prev[1]->next[1] = next[1]; 65 next[1]->prev[1] = prev[1]; 67 target->in = (next[1] == this) ? NULL : next[1] 234 virtual void next() { if (pos < count) ++pos; } function in class:nv50_ir::DFSIterator 280 virtual void next() { if (pos < count) ++pos; } function in class:nv50_ir::CFGIterator 418 Node *next = NULL; local [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
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 = p 478 Instruction *insn, *next; local [all...] |
nv50_ir_graph.cpp | 40 for (IteratorRef it = safeIteratorDFS(); !it->end(); it->next()) 56 prev[0]->next[0] = next[0]; 57 next[0]->prev[0] = prev[0]; 59 origin->out = (next[0] == this) ? NULL : next[0]; 64 prev[1]->next[1] = next[1]; 65 next[1]->prev[1] = prev[1]; 67 target->in = (next[1] == this) ? NULL : next[1] 234 virtual void next() { if (pos < count) ++pos; } function in class:nv50_ir::DFSIterator 280 virtual void next() { if (pos < count) ++pos; } function in class:nv50_ir::CFGIterator 418 Node *next = NULL; local [all...] |
/art/test/080-oom-throw/src/ |
Main.java | 35 InstanceMemEater next; field in class:Main.InstanceMemEater 60 lastMemEater.next = InstanceMemEater.allocate(); 61 lastMemEater = lastMemEater.next;
|
/development/ndk/platforms/android-9/arch-mips/include/asm/ |
system.h | 14 *** Any manual change here will be lost the next time this script will 34 #define switch_to(prev, next, last) do { __mips_mt_fpaff_switch_to(prev); if (cpu_has_dsp) __save_dsp(prev); (last) = resume(prev, next, task_thread_info(next)); } while (0)
|
/external/bison/src/ |
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/chromium_org/third_party/boringssl/src/crypto/lhash/ |
lhash_test.c | 26 struct dummy_lhash_node *next; member in struct:dummy_lhash_node 34 struct dummy_lhash_node *cur, *next; local 36 for (cur = lh->head; cur != NULL; cur = next) { 37 next = cur->next; 47 for (cur = lh->head; cur != NULL; cur = cur->next) { 57 for (cur = lh->head; cur != NULL; cur = cur->next) { 69 for (cur = lh->head; cur != NULL; cur = cur->next) { 80 node->next = lh->head; 90 for (cur = lh->head; cur != NULL; cur = cur->next) { [all...] |
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
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.prev = entry.prev 117 LinkedEntry<K, V> next; field in class:GroupedLinkedMap.LinkedEntry [all...] |
/external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
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 n characters 176 public String next(int n) throws JSONException { method in class:JSONTokener [all...] |
/external/javassist/src/main/javassist/bytecode/analysis/ |
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/ |
Transformer.java | 34 private Transformer next; field in class:Transformer 37 next = t; 40 public Transformer getNext() { return next; }
|
/external/libcxx/test/containers/associative/map/map.cons/ |
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(m.begin(), 2) == V(3, 1)) [all...] |
/external/mockito/cglib-and-asm/src/org/mockito/cglib/transform/ |
ClassTransformerChain.java | 29 ClassVisitor next = v; local 31 chain[i].setTarget(next); 32 next = chain[i];
|
/cts/tools/tradefed-host/tests/src/com/android/cts/tradefed/result/ |
TestResultsTest.java | 67 TestPackageResult pkg = parser.getPackages().iterator().next(); 94 TestPackageResult pkg = parser.getPackages().iterator().next(); 95 TestSuite comSuite = pkg.getTestSuites().iterator().next(); 97 TestSuite exampleSuite = comSuite.getTestSuites().iterator().next(); 99 TestCase exampleCase = exampleSuite.getTestCases().iterator().next(); 101 Test exampleTest = exampleCase.getTests().iterator().next();
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
PaintInvalidationState.cpp | 36 PaintInvalidationState::PaintInvalidationState(const PaintInvalidationState& next, RenderLayerModelObject& renderer, const RenderLayerModelObject& paintInvalidationContainer) 39 , m_forceCheckForPaintInvalidation(next.m_forceCheckForPaintInvalidation) 52 if (!renderer.supportsPaintInvalidationStateCachedOffsets() || !next.m_cachedOffsetsEnabled) { 60 m_paintOffset = next.m_paintOffset + offset; 74 m_clipped = !fixed && next.m_clipped; 76 m_clipRect = next.m_clipRect;
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/ |
pb_bufmgr_cache.c | 15 * next paragraph) shall be included in all copies or substantial portions 127 struct list_head *curr, *next; local 133 curr = mgr->delayed.next; 134 next = curr->next; 143 curr = next; 144 next = curr->next; 267 struct list_head *curr, *next; local 274 curr = mgr->delayed.next; 360 struct list_head *curr, *next; local [all...] |