| /external/dhcpcd/ |
| if-pref.c | 81 if (!ifaces || !ifaces->next)
84 ifaces = ifaces->next;
85 sorted->next = NULL;
86 for (ifp = ifaces; ifp && (ifn = ifp->next, 1); ifp = ifn) {
89 ifp->next = sorted;
94 for (ift = sorted; ift->next; ift = ift->next) {
95 if (ifcmp(ifp, ift->next) == -1) {
96 ifp->next = ift->next;
[all...] |
| /external/libcxx/test/containers/associative/multiset/multiset.cons/ |
| copy_alloc.pass.cpp | 45 assert(*next(m.begin(), 0) == 1);
46 assert(*next(m.begin(), 1) == 1);
47 assert(*next(m.begin(), 2) == 1);
48 assert(*next(m.begin(), 3) == 2);
49 assert(*next(m.begin(), 4) == 2);
50 assert(*next(m.begin(), 5) == 2);
51 assert(*next(m.begin(), 6) == 3);
52 assert(*next(m.begin(), 7) == 3);
53 assert(*next(m.begin(), 8) == 3);
59 assert(*next(mo.begin(), 0) == 1)
[all...] |
| iter_iter_alloc.pass.cpp | 49 assert(*next(m.begin(), 0) == 1);
50 assert(*next(m.begin(), 1) == 1);
51 assert(*next(m.begin(), 2) == 1);
52 assert(*next(m.begin(), 3) == 2);
53 assert(*next(m.begin(), 4) == 2);
54 assert(*next(m.begin(), 5) == 2);
55 assert(*next(m.begin(), 6) == 3);
56 assert(*next(m.begin(), 7) == 3);
57 assert(*next(m.begin(), 8) == 3);
80 assert(*next(m.begin(), 0) == 1)
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev; member in struct:list_head
31 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
38 * the prev/next entries already!
42 struct list_head * next)
44 next->prev = add;
45 add->next = next;
47 prev->next = add;
60 __list_add(add, head, head->next);
[all...] |
| /external/oprofile/libutil/ |
| op_list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head * next, * prev; member in struct:list_head
36 ptr->next = ptr;
44 * the prev/next entries already!
48 struct list_head * next)
50 next->prev = new_entry;
51 new_entry->next = next;
53 prev->next = new_entry;
66 __list_add(new_entry, head, head->next);
[all...] |
| /external/openssl/crypto/pqueue/ |
| pqueue.c | 79 item->next = NULL;
113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
122 next != NULL;
123 curr = next, next = next->next)
127 int cmp = memcmp(next->priority, item->priority,8);
128 if (cmp > 0) /* next > item *
170 pitem *next; local
[all...] |
| /external/fio/lib/ |
| flist_sort.c | 23 tail->next = a;
24 a = a->next;
26 tail->next = b;
27 b = b->next;
29 tail = tail->next;
31 tail->next = a?:b;
32 return head.next;
53 tail->next = a;
55 a = a->next;
57 tail->next = b
[all...] |
| /external/libcxx/test/containers/associative/map/map.ops/ |
| equal_range.pass.cpp | 43 assert(r.first == next(m.begin(), 0));
44 assert(r.second == next(m.begin(), 1));
46 assert(r.first == next(m.begin(), 1));
47 assert(r.second == next(m.begin(), 2));
49 assert(r.first == next(m.begin(), 2));
50 assert(r.second == next(m.begin(), 3));
52 assert(r.first == next(m.begin(), 3));
53 assert(r.second == next(m.begin(), 4));
55 assert(r.first == next(m.begin(), 4));
56 assert(r.second == next(m.begin(), 5))
[all...] |
| /external/chromium_org/third_party/mesa/src/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...] |
| /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/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/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/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...] |
| /external/chromium_org/third_party/WebKit/Source/platform/fonts/ |
| FontFamily.cpp | 37 for (ap = a.next(), bp = b.next(); ap != bp; ap = ap->next(), bp = bp->next()) {
|
| /external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/serialization/ |
| FwdRef.java | 28 FwdRef next; field in class:FwdRef
|
| /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/asus/flo/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...] |
| /device/lge/hammerhead/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...] |
| /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/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/chromium_org/third_party/mesa/src/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...] |
| /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...] |
