/external/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
H A D | equal_range.pass.cpp | 48 assert(r.second == next(m.begin(), 3)); 50 assert(r.first == next(m.begin(), 3)); 51 assert(r.second == next(m.begin(), 3)); 53 assert(r.first == next(m.begin(), 3)); 54 assert(r.second == next(m.begin(), 6)); 56 assert(r.first == next(m.begin(), 6)); 57 assert(r.second == next(m.begin(), 6)); 59 assert(r.first == next(m.begin(), 6)); 60 assert(r.second == next(m.begin(), 9)); 85 assert(r.second == next( [all...] |
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.spec/ |
H A D | member_swap.pass.cpp | 33 assert(*next(c1.begin(), 0) == 10); 34 assert(*next(c1.begin(), 1) == 11); 35 assert(*next(c1.begin(), 2) == 12); 39 assert(*next(c2.begin(), 0) == 0); 40 assert(*next(c2.begin(), 1) == 1); 41 assert(*next(c2.begin(), 2) == 2); 42 assert(*next(c2.begin(), 3) == 3); 43 assert(*next(c2.begin(), 4) == 4); 44 assert(*next(c2.begin(), 5) == 5); 60 assert(*next(c [all...] |
H A D | non_member_swap.pass.cpp | 34 assert(*next(c1.begin(), 0) == 10); 35 assert(*next(c1.begin(), 1) == 11); 36 assert(*next(c1.begin(), 2) == 12); 40 assert(*next(c2.begin(), 0) == 0); 41 assert(*next(c2.begin(), 1) == 1); 42 assert(*next(c2.begin(), 2) == 2); 43 assert(*next(c2.begin(), 3) == 3); 44 assert(*next(c2.begin(), 4) == 4); 45 assert(*next(c2.begin(), 5) == 5); 61 assert(*next(c [all...] |
/external/mesa3d/src/gallium/drivers/r600/ |
H A D | compute_memory_pool.c | 9 * The above copyright notice and this permission notice (including the next 136 for (item = pool->item_list; item; item = item->next) { 166 for (item = pool->item_list; item; item = item->next) { 167 if (item->next) { 169 && item->next->start_in_dw > start_in_dw) { 239 chunk.prev = chunk.next = NULL; 251 struct compute_memory_item *item, *next; local 258 for (item = pool->item_list; item; item = item->next) { 259 COMPUTE_DBG("list: %i %p\n", item->start_in_dw, item->next); 262 for (item = pool->item_list; item; item = next) { 353 struct compute_memory_item *item, *next; local [all...] |
/external/skia/src/pathops/ |
H A D | SkOpSpan.cpp | 45 SkOpPtT* next = this; local 46 while ((next = next->fNext) != this) { 47 result = next; 56 SkOpPtT* next = prev->fNext; local 57 if (next == this) { 63 prev = next; 71 SkOpPtT* next = this->fNext; local 72 SkASSERT(this != next->fNext); 73 this->fNext = next 196 const SkOpSpanBase* next = this; local 236 SkOpPtT* next = remainder->next(); local 264 const SkOpSpan* next = fCoincident; local 277 SkOpSpanBase* next = this->next(); local [all...] |
/external/e2fsprogs/e2fsck/ |
H A D | region.c | 25 struct region_el *next; member in struct:region_el 49 struct region_el *r, *next; local 51 for (r = region->allocated; r; r = next) { 52 next = r->next; 61 struct region_el *r, *new_region, *prev, *next; local 77 for (r = region->allocated, prev=NULL; r; prev = r, r = r->next) { 87 if ((next = r->next)) { 88 if (end > next [all...] |
/external/mksh/src/ |
H A D | lalloc.c | 40 ap->next = NULL; 59 while (ap->next != lp) 60 if ((ap = ap->next) == NULL) { 94 pp->next = lp->next; 105 lp->next = ap->next; 106 ap->next = lp; 119 pp->next = lp->next; [all...] |
/external/javassist/src/main/javassist/ |
H A D | CtMember.java | 23 CtMember next; // for internal use field in class:CtMember 54 fieldTail.next = this; 65 method.next = methodTail.next; 66 methodTail.next = method; 79 cons.next = consTail.next; 80 consTail.next = cons; 88 field.next = this; // or fieldTail.next 131 final CtMember next() { return next; } method in class:CtMember [all...] |
/external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
H A D | move.pass.cpp | 64 assert(*next(m.begin(), 0) == 1); 65 assert(*next(m.begin(), 1) == 1); 66 assert(*next(m.begin(), 2) == 1); 67 assert(*next(m.begin(), 3) == 2); 68 assert(*next(m.begin(), 4) == 2); 69 assert(*next(m.begin(), 5) == 2); 70 assert(*next(m.begin(), 6) == 3); 71 assert(*next(m.begin(), 7) == 3); 72 assert(*next(m.begin(), 8) == 3); 103 assert(*next( [all...] |
/external/freetype/src/cache/ |
H A D | ftcmru.c | 52 cnode = cnode->next; 59 last->next = node; 60 node->next = first; 65 node->next = node; 83 FTC_MruNode prev, next, last; local 93 cnode = cnode->next; 103 next = node->next; 105 prev->next = next; 126 FTC_MruNode prev, next; local 331 FTC_MruNode first, node, next; local [all...] |
/external/valgrind/memcheck/tests/ |
H A D | leak-cases.c | 42 struct _Node* next; member in struct:_Node 48 Node* mk(Node* next) argument 53 x->next = next; 82 (p6->next)++; // 16/1 possibly lost 88 (p8->next)++; // 16/1 possibly lost 92 (p9->next)++; // 32(16d,16i)/1 definitely lost (double count!)
|
/external/v8/test/mjsunit/es6/ |
H A D | generators-debug-liveedit.js | 41 assertIteratorResult(undefined, false, iter.next()); 42 assertIteratorResult("Cat", true, iter.next()); 73 assertIteratorResult(undefined, false, iter.next()); 76 assertIteratorResult("Cat", true, iter.next()); 82 assertIteratorResult(undefined, false, iter.next()); 84 assertIteratorResult("Capybara", true, iter.next()); 88 assertIteratorResult(undefined, false, iter.next()); 91 assertIteratorResult("Capybara", true, iter.next()); 116 assertIteratorResult('Koala', false, iter.next());
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_list.h | 41 x->next = 0; 45 x->next = 0; 46 last_->next = x; 54 x->next = 0; 58 x->next = first_; 66 first_ = first_->next; 82 l->last_->next = first_; 96 last_->next = l->first_; 109 for (Item *i = first_; ; i = i->next) { 114 CHECK_EQ(last_->next, 123 ItemTy *next() { function in class:__sanitizer::IntrusiveList::IteratorBase [all...] |
/external/llvm/test/CodeGen/SystemZ/Large/ |
H A D | branch-range-01.py | 79 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 84 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 87 print '%s:' % next
|
H A D | branch-range-03.py | 79 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 85 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 88 print '%s:' % next
|
H A D | branch-range-04.py | 44 # ...as mentioned above, the next one could be a CGRJE instead... 83 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 89 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 92 print '%s:' % next
|
H A D | branch-range-05.py | 44 # ...as mentioned above, the next one could be a CIJL instead... 83 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 88 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 91 print '%s:' % next
|
H A D | branch-range-06.py | 44 # ...as mentioned above, the next one could be a CGIJL instead... 83 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 88 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 91 print '%s:' % next
|
H A D | branch-range-09.py | 79 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 85 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 88 print '%s:' % next
|
H A D | branch-range-10.py | 44 # ...as mentioned above, the next one could be a CLGRJL instead... 83 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 89 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 92 print '%s:' % next
|
H A D | branch-range-11.py | 49 # ...as mentioned above, the next one could be a CLIJL instead... 99 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 105 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 108 print '%s:' % next
|
H A D | branch-range-12.py | 49 # ...as mentioned above, the next one could be a CLGIJL instead... 99 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 105 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 108 print '%s:' % next
|
/external/v8/src/ |
H A D | weak-collection.js | 37 var next, done, nextItem; 38 while (!(next = iter.next()).done) { 39 if (!IS_SPEC_OBJECT(next)) { 40 throw MakeTypeError('iterator_result_not_an_object', [next]); 42 nextItem = next.value; 153 var next, done; 154 while (!(next = iter.next()).done) { 155 if (!IS_SPEC_OBJECT(next)) { [all...] |
/external/libxml2/doc/examples/ |
H A D | xpath1.c | 151 xmlChar* next; local 162 next = nsListDup; 163 while(next != NULL) { 165 while((*next) == ' ') next++; 166 if((*next) == '\0') break; 169 prefix = next; 170 next = (xmlChar*)xmlStrchr(next, '='); 171 if(next [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_util.cpp | 29 for (Item *next, *item = head.next; item != &head; item = next) { 30 next = item->next; 33 head.next = head.prev = &head; 43 pos = pos->next; 56 pos = pos->next; 67 ins->next = pos->next; [all...] |