| /external/clang/test/CodeGen/ |
| disable-tail-calls.c | 4 struct List *next; member in struct:List
15 return find(head->next, data);
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| insert_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 1);
46 assert(next(m.begin())->second == 1.5);
47 assert(next(m.begin(), 2)->first == 1);
48 assert(next(m.begin(), 2)->second == 2);
49 assert(next(m.begin(), 3)->first == 2);
50 assert(next(m.begin(), 3)->second == 1);
51 assert(next(m.begin(), 4)->first == 2);
52 assert(next(m.begin(), 4)->second == 1.5);
53 assert(next(m.begin(), 5)->first == 2);
54 assert(next(m.begin(), 5)->second == 2)
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| erase_after_one.pass.cpp | 27 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4));
30 assert(*next(c.begin(), 0) == 0);
31 assert(*next(c.begin(), 1) == 1);
32 assert(*next(c.begin(), 2) == 2);
33 assert(*next(c.begin(), 3) == 3);
35 i = c.erase_after(next(c.cbefore_begin(), 0));
38 assert(*next(c.begin(), 0) == 1);
39 assert(*next(c.begin(), 1) == 2);
40 assert(*next(c.begin(), 2) == 3);
42 i = c.erase_after(next(c.cbefore_begin(), 1))
[all...] |
| resize_size.pass.cpp | 45 assert(*next(c.begin(), 0) == 0);
46 assert(*next(c.begin(), 1) == 1);
47 assert(*next(c.begin(), 2) == 2);
51 assert(*next(c.begin(), 0) == 0);
52 assert(*next(c.begin(), 1) == 1);
53 assert(*next(c.begin(), 2) == 2);
54 assert(*next(c.begin(), 3) == 0);
55 assert(*next(c.begin(), 4) == 0);
56 assert(*next(c.begin(), 5) == 0);
60 assert(*next(c.begin(), 0) == 0)
[all...] |
| insert_after_init.pass.cpp | 32 assert(i == next(c.before_begin(), 3));
34 assert(*next(c.begin(), 0) == 0);
35 assert(*next(c.begin(), 1) == 1);
36 assert(*next(c.begin(), 2) == 2);
39 assert(i == next(c.begin(), 2));
41 assert(*next(c.begin(), 0) == 0);
42 assert(*next(c.begin(), 1) == 3);
43 assert(*next(c.begin(), 2) == 4);
44 assert(*next(c.begin(), 3) == 1);
45 assert(*next(c.begin(), 4) == 2)
[all...] |
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_validate.c | 15 * next paragraph) shall be included in all copies or substantial portions
161 struct draw_stage *next = draw->pipeline.rasterize; local
167 /* Set the validate's next stage to the rasterize stage, so that it
170 stage->next = next;
196 draw->pipeline.aaline->next = next;
197 next = draw->pipeline.aaline;
202 draw->pipeline.aapoint->next = next;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| insert_iter_iter.pass.cpp | 45 assert(next(m.begin())->first == 1);
46 assert(next(m.begin())->second == 1.5);
47 assert(next(m.begin(), 2)->first == 1);
48 assert(next(m.begin(), 2)->second == 2);
49 assert(next(m.begin(), 3)->first == 2);
50 assert(next(m.begin(), 3)->second == 1);
51 assert(next(m.begin(), 4)->first == 2);
52 assert(next(m.begin(), 4)->second == 1.5);
53 assert(next(m.begin(), 5)->first == 2);
54 assert(next(m.begin(), 5)->second == 2)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| erase_after_one.pass.cpp | 27 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4));
30 assert(*next(c.begin(), 0) == 0);
31 assert(*next(c.begin(), 1) == 1);
32 assert(*next(c.begin(), 2) == 2);
33 assert(*next(c.begin(), 3) == 3);
35 i = c.erase_after(next(c.cbefore_begin(), 0));
38 assert(*next(c.begin(), 0) == 1);
39 assert(*next(c.begin(), 1) == 2);
40 assert(*next(c.begin(), 2) == 3);
42 i = c.erase_after(next(c.cbefore_begin(), 1))
[all...] |
| resize_size.pass.cpp | 45 assert(*next(c.begin(), 0) == 0);
46 assert(*next(c.begin(), 1) == 1);
47 assert(*next(c.begin(), 2) == 2);
51 assert(*next(c.begin(), 0) == 0);
52 assert(*next(c.begin(), 1) == 1);
53 assert(*next(c.begin(), 2) == 2);
54 assert(*next(c.begin(), 3) == 0);
55 assert(*next(c.begin(), 4) == 0);
56 assert(*next(c.begin(), 5) == 0);
60 assert(*next(c.begin(), 0) == 0)
[all...] |
| /external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/serialization/ |
| FwdRef.java | 28 FwdRef next; field in class:FwdRef
|
| /external/tcpdump/ |
| cpack.c | 53 /* Advance to the next wordsize boundary. Return NULL if fewer than
60 uint8_t *next; local
63 next = cpack_next_boundary(cs->c_buf, cs->c_next, wordsize);
66 if (next - cs->c_buf + wordsize > cs->c_len)
69 return next;
99 uint8_t *next; local
101 if ((next = cpack_align_and_reserve(cs, sizeof(*u))) == NULL)
104 *u = EXTRACT_LE_64BITS(next);
107 cs->c_next = next + sizeof(*u);
115 uint8_t *next; local
131 uint8_t *next; local
[all...] |
| /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
| InsnList.java | 133 i = i.next;
172 insn = insn.next;
206 elem = elem.next;
225 AbstractInsnNode next = location.next;
local
226 insn.next = next;
227 if (next != null) {
228 next.prev = insn;
235 prev.next = insn;
373 AbstractInsnNode next = location.next; local
406 AbstractInsnNode next = location.next; local
495 AbstractInsnNode next = insn.next; local
530 AbstractInsnNode next = insn.next; local
566 AbstractInsnNode next; field in class:InsnList.InsnListIterator
583 public Object next() { method in class:InsnList.InsnListIterator
[all...] |
| /device/huawei/angler/camera/QCamera2/stack/common/ |
| cam_list.h | 45 struct cam_list *next, *prev; member in struct:cam_list
50 ptr->next = ptr;
60 item->next = head;
62 prev->next = item;
68 item->next = node;
70 item->prev->next = item;
77 struct cam_list *next = ptr->next; local
79 next->prev = ptr->prev;
80 prev->next = ptr->next
[all...] |
| /device/lge/bullhead/camera/QCamera2/stack/common/ |
| cam_list.h | 45 struct cam_list *next, *prev; member in struct:cam_list
50 ptr->next = ptr;
60 item->next = head;
62 prev->next = item;
68 item->next = node;
70 item->prev->next = item;
77 struct cam_list *next = ptr->next; local
79 next->prev = ptr->prev;
80 prev->next = ptr->next
[all...] |
| /device/moto/shamu/camera/QCamera2/stack/common/ |
| cam_list.h | 43 struct cam_list *next, *prev; member in struct:cam_list
48 ptr->next = ptr;
58 item->next = head;
60 prev->next = item;
66 item->next = node;
68 item->prev->next = item;
75 struct cam_list *next = ptr->next; local
77 next->prev = ptr->prev;
78 prev->next = ptr->next
[all...] |
| /external/libunwind/src/mi/ |
| dyn-register.c | 37 di->next = _U_dyn_info_list.first;
39 if (di->next)
40 di->next->prev = di;
|
| /external/toybox/lib/ |
| llist.c | 3 * Linked list structures have a next pointer as their first element.
48 void **next = (void **)*llist; local
49 *llist = *next;
51 return (void *)next;
58 if (dlist->next == dlist) *pdlist = 0;
60 dlist->next->prev = dlist->prev;
61 dlist->prev->next = *pdlist = dlist->next;
70 new->next = *list;
72 (*list)->prev->next = new
[all...] |
| /hardware/qcom/camera/QCamera2/stack/common/ |
| cam_list.h | 44 struct cam_list *next, *prev; member in struct:cam_list
49 ptr->next = ptr;
59 item->next = head;
61 prev->next = item;
67 item->next = node;
69 item->prev->next = item;
76 struct cam_list *next = ptr->next; local
78 next->prev = ptr->prev;
79 prev->next = ptr->next
[all...] |
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-sh/sh64/ |
| shcmp-1.s | 5 mova next,r0
7 next: label
15 .long next
|
| /external/libcxx/test/std/containers/associative/multiset/ |
| equal_range.pass.cpp | 44 assert(r.first == next(m.begin(), 0));
45 assert(r.second == next(m.begin(), 0));
47 assert(r.first == next(m.begin(), 0));
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))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| equal_range.pass.cpp | 44 assert(r.first == next(m.begin(), 0));
45 assert(r.second == next(m.begin(), 0));
47 assert(r.first == next(m.begin(), 0));
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))
[all...] |
| /external/blktrace/btt/ |
| list.h | 35 struct list_head *next, *prev; member in struct:list_head
45 list->next = list;
53 * the prev/next entries already!
57 struct list_head *next)
59 next->prev = new;
60 new->next = next;
62 prev->next = new;
75 __list_add(new, head, head->next);
92 * Delete a list entry by making the prev/next entrie
[all...] |
| /external/fio/ |
| flist.h | 22 * sometimes we already know the next/prev entries and we can
28 struct flist_head *next, *prev; member in struct:flist_head
37 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
44 * the prev/next entries already!
48 struct flist_head *next)
50 next->prev = new_entry;
51 new_entry->next = next;
53 prev->next = new_entry;
67 __flist_add(new_entry, head, head->next);
[all...] |
| /external/mesa3d/src/glsl/ |
| list.h | 11 * The above copyright notice and this permission notice (including the next
31 * \c next pointer being \c NULL.
33 * A list is empty if either the head sentinel's \c next pointer points to the
43 * - A \c head pointer that represents the \c next pointer of the
46 * sentinel node and the \c next pointer of the tail sentinel node. This
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
75 struct exec_node *next; member in struct:exec_node
98 exec_node() : next(NULL), prev(NULL)
105 return next;
110 return next;
229 void next() function in class:iterator
251 void next() function in class:exec_list_iterator
[all...] |
| /device/google/dragon/audio/hal/ |
| utlist.h | 38 * To use singly-linked lists, your structure must have a "next" pointer.
39 * To use doubly-linked lists, your structure must "prev" and "next" pointers.
45 * struct item *prev, *next;
66 (add)->next = head; \
75 while (_tmp->next) \
76 _tmp = _tmp->next; \
77 _tmp->next = (head2); \
85 (add)->next = NULL; \
88 while (_tmp->next) \
89 _tmp = _tmp->next; \
[all...] |
