/external/chromium_org/v8/test/mjsunit/es6/ |
H A D | array-iterator.js | 62 assertIteratorResult('a', false, iterator.next()); 63 assertIteratorResult('b', false, iterator.next()); 64 assertIteratorResult('c', false, iterator.next()); 65 assertIteratorResult(void 0, true, iterator.next()); 68 assertIteratorResult(void 0, true, iterator.next()); 76 assertIteratorResult('a', false, iterator.next()); 77 assertIteratorResult('b', false, iterator.next()); 78 assertIteratorResult('c', false, iterator.next()); 80 assertIteratorResult('d', false, iterator.next()); 81 assertIteratorResult(void 0, true, iterator.next()); [all...] |
H A D | generators-iteration.js | 39 assertIteratorResult(undefined, true, iter.next()); 40 assertDoesNotThrow(function() { iter.next(); }); 53 var result = iter.next(); 70 // var v3 = iter.next(); 71 assertIteratorResult(v1, v2, iter.next()); 80 iter.next(send_val)); 90 iter.next()); 367 assertIteratorResult(1, false, iter.next()); 368 assertIteratorResult(2, false, iter.next()); 369 assertIteratorResult(3, false, iter.next()); [all...] |
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/mesa3d/src/glx/ |
H A D | glxconfig.c | 12 * The above copyright notice and this permission notice (including the next 228 struct glx_config **next; local 231 next = &base; 233 *next = (struct glx_config *) malloc(size); 234 if (*next == NULL) { 240 (void) memset(*next, 0, size); 241 (*next)->visualID = GLX_DONT_CARE; 242 (*next)->visualType = GLX_DONT_CARE; 243 (*next)->visualRating = GLX_NONE; 244 (*next) 270 struct glx_config *const next = configs->next; local [all...] |
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | brw_fs_cfg.cpp | 11 * The above copyright notice and this permission notice (including the next 81 fs_bblock *next; local 114 next = new_block(); 115 next->start = (fs_inst *)inst->next; 116 cur_if->add_successor(mem_ctx, next); 118 set_next_block(next); 124 next = new_block(); 125 next->start = (fs_inst *)inst->next; [all...] |
/external/chromium_org/media/midi/ |
H A D | midi_message_queue.cc | 52 const uint8 next = queue_.front(); local 59 if (IsSystemRealTimeMessage(next)) { 60 message->push_back(next); 68 ((next_message_[0] == kSysEx && IsFirstStatusByte(next)) || 69 (next_message_[0] != kSysEx && !IsDataByte(next)))) { 76 if (IsFirstStatusByte(next)) { 77 next_message_.push_back(next); 88 next_message_.push_back(next); 91 if (next == kEndOfSysEx) { 99 DCHECK(IsDataByte(next)); [all...] |
/external/libcxx/test/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/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/chromium_org/third_party/mesa/src/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/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/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/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
H A D | ptw32_MCS_lock.c | 165 node->next = 0; /* initially, no successor */ 174 pred->next = node; 195 ptw32_mcs_local_node_t *next = local 197 PTW32_INTERLOCKED_EXCHANGE_ADD_SIZE((PTW32_INTERLOCKED_SIZEPTR)&node->next, (PTW32_INTERLOCKED_SIZE)0); /* MBR fence */ 199 if (0 == next) 214 next = (ptw32_mcs_local_node_t *) 215 PTW32_INTERLOCKED_EXCHANGE_ADD_SIZE((PTW32_INTERLOCKED_SIZEPTR)&node->next, (PTW32_INTERLOCKED_SIZE)0); /* MBR fence */ 219 ptw32_mcs_flag_set(&next->readyFlag); 234 node->next = 0; /* initially, no successor */ 262 new_node->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/qemu/distrib/libsparse/src/ |
H A D | backed_block.c | 46 struct backed_block *next; member in struct:backed_block 62 return bb->next; 135 struct backed_block *next = bb->next; local 137 bb = next; 155 for (end = start; end && end->next; end = end->next) 166 from->data_blocks = end->next; 168 for (bb = from->data_blocks; bb; bb = bb->next) { 169 if (bb->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/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/chromium_org/net/disk_cache/memory/ |
H A D | mem_rankings.cc | 30 MemEntryImpl* next = node->next(); local 33 head_ = next; 39 prev->set_next(next); 41 if (next) 42 next->set_prev(prev); 57 return node->next();
|
/external/chromium_org/third_party/WebKit/Source/core/css/ |
H A D | CSSSelectorList.h | 48 static const CSSSelector* next(const CSSSelector&); 49 bool hasOneSelector() const { return m_selectorArray && !next(*m_selectorArray); } 55 const CSSSelector* next = this->next(current); local 56 if (!next) 58 return next - m_selectorArray; 80 inline const CSSSelector* CSSSelectorList::next(const CSSSelector& current) function in class:blink::CSSSelectorList
|
/external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
H A D | HTMLInputStream.h | 36 // [--current--][--next--][--next--] ... [--next--] 93 void splitInto(SegmentedString& next) argument 95 next = m_first; 100 // the m_last string, |next| is now the last one. 101 m_last = &next; 105 void mergeFrom(SegmentedString& next) argument 107 m_first.append(next); 108 if (m_last == &next) { [all...] |
/external/chromium_org/third_party/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/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/main/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/smack/src/org/xbill/DNS/ |
H A D | NXTRecord.java | 21 private Name next; field in class:NXTRecord 33 * @param next The following name in an ordered list of the zone 37 NXTRecord(Name name, int dclass, long ttl, Name next, BitSet bitmap) { argument 39 this.next = checkName("next", next); 45 next = new Name(in); 58 next = st.getName(origin); 76 sb.append(next); 86 /** Returns the next nam [all...] |
/external/chromium_org/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...] |