| /external/libcxx/test/containers/sequences/forwardlist/forwardlist.spec/ |
| 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(c2.begin(), 0) == 0)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/ |
| 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/ |
| 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...] |
| /bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
| list.h | 28 #define LINK(type) struct { type *prev, *next; }
32 (elt)->link.next = (type *)(-1); \
37 (void *)((elt)->link.next) != (void *)(-1))
51 (elt)->link.next = (list).head; \
59 (list).tail->link.next = (elt); \
63 (elt)->link.next = NULL; \
70 if ((elt)->link.next != NULL) \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
77 (elt)->link.prev->link.next = (elt)->link.next; \
[all...] |
| /external/e2fsprogs/e2fsck/ |
| 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->start
[all...] |
| /external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
| 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 = 0
[all...] |
| /external/mksh/src/ |
| 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...] |
| /bionic/tests/ |
| search_test.cpp | 141 q_node* next; member in struct:q_node
159 for (q_node* q = &zero; q != NULL; q = q->next) {
175 ASSERT_EQ(2, head->next->i);
176 ASSERT_EQ(nullptr, head->next->next);
180 ASSERT_EQ(nullptr, head->next);
186 zero.next = &zero;
193 ASSERT_EQ(1, head->next->i);
194 ASSERT_EQ(2, head->next->next->i)
[all...] |
| /external/javassist/src/main/javassist/ |
| 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/ |
| 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(m.begin(), 0) == 1)
[all...] |
| /external/chromium_org/net/disk_cache/memory/ |
| 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/ |
| 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/ |
| HTMLInputStream.h | 36 // [--current--][--next--][--next--] ... [--next--]
93 void splitInto(SegmentedString& next)
95 next = m_first;
100 // the m_last string, |next| is now the last one.
101 m_last = &next;
105 void mergeFrom(SegmentedString& next)
107 m_first.append(next);
108 if (m_last == &next) {
[all...] |
| /external/chromium_org/third_party/freetype/src/cache/ |
| 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/ |
| 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...] |
| /bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
| quick_exit.c | 38 struct quick_exit_handler *next; member in struct:quick_exit_handler
62 h->next = handlers;
77 for (h = handlers; NULL != h; h = h->next)
|
| /external/chromium_org/v8/test/mjsunit/es6/ |
| arguments-iterator.js | 41 assertIteratorResult(a, false, iterator.next());
42 assertIteratorResult(b, false, iterator.next());
43 assertIteratorResult(c, false, iterator.next());
44 assertIteratorResult(undefined, true, iterator.next());
52 assertIteratorResult(a, false, iterator.next());
53 assertIteratorResult(b, false, iterator.next());
54 assertIteratorResult(c, false, iterator.next());
55 assertIteratorResult(undefined, true, iterator.next());
62 assertIteratorResult(a, false, iterator.next());
63 assertIteratorResult(b, false, iterator.next());
[all...] |
| collection-iterator.js | 18 assertArrayEquals(['next'], propertyNames);
32 assertEquals({value: 1, done: false}, iter.next());
33 assertEquals({value: 2, done: false}, iter.next());
34 assertEquals({value: 3, done: false}, iter.next());
35 assertEquals({value: undefined, done: true}, iter.next());
36 assertEquals({value: undefined, done: true}, iter.next());
52 assertEquals({value: [1, 1], done: false}, iter.next());
53 assertEquals({value: [2, 2], done: false}, iter.next());
54 assertEquals({value: [3, 3], done: false}, iter.next());
55 assertEquals({value: undefined, done: true}, iter.next());
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| 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...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| 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...] |
| /development/ndk/platforms/android-3/include/linux/raid/ |
| xor.h | 20 struct xor_block_template *next; member in struct:xor_block_template
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| SelfIteratorNoPredicate.java | 66 * Returns the next node in the set and advances the position of the
70 * @return The next <code>Node</code> in the set being iterated over, or
78 int next; local
80 m_lastFetched = next = (DTM.NULL == m_lastFetched)
84 // m_lastFetched = next;
85 if (DTM.NULL != next)
89 return next;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/trace/ |
| tr_screen.h | 15 * next paragraph) shall be included in all copies or substantial portions
42 struct tr_list *next; member in struct:tr_list
|
| /external/chromium_org/third_party/polymer/components/core-animated-pages/transitions/ |
| hero-transition.css | 2 polyfill-next-selector { content: ':host > [animate] [hero]'; }
7 polyfill-next-selector { content: ':host > .core-selected[animate] [hero]'; }
|
| /external/chromium_org/third_party/polymer/components/core-pages/ |
| core-pages.css | 15 polyfill-next-selector { content: ':host > *'; }
26 polyfill-next-selector { content: ':host > .core-selected'; }
|
