| /external/libcxx/test/std/containers/associative/map/map.ops/ |
| lower_bound.pass.cpp | 47 assert(r == next(m.begin()));
49 assert(r == next(m.begin(), 2));
51 assert(r == next(m.begin(), 3));
53 assert(r == next(m.begin(), 4));
55 assert(r == next(m.begin(), 5));
57 assert(r == next(m.begin(), 6));
59 assert(r == next(m.begin(), 7));
61 assert(r == next(m.begin(), 0));
63 assert(r == next(m.begin(), 1));
65 assert(r == next(m.begin(), 2))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.ops/ |
| lower_bound.pass.cpp | 47 assert(r == next(m.begin()));
49 assert(r == next(m.begin(), 2));
51 assert(r == next(m.begin(), 3));
53 assert(r == next(m.begin(), 4));
55 assert(r == next(m.begin(), 5));
57 assert(r == next(m.begin(), 6));
59 assert(r == next(m.begin(), 7));
61 assert(r == next(m.begin(), 0));
63 assert(r == next(m.begin(), 1));
65 assert(r == next(m.begin(), 2))
[all...] |
| /external/mesa3d/src/util/ |
| list.h | 23 * next paragraph) shall be included in all copies or substantial portions
49 struct list_head *next; member in struct:list_head
55 item->next = item;
61 item->next = list->next;
62 list->next->prev = item;
63 list->next = item;
68 item->next = list;
70 list->prev->next = item;
82 to->next = from->next
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_heap.c | 75 r->next = heap->next;
76 if (heap->next)
77 heap->next->prev = r;
79 heap->next = r;
85 heap = heap->next;
103 if (r->next && !r->next->in_use) {
104 struct nouveau_heap *new = r->next;
108 r->prev->next = new
[all...] |
| /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...] |
| /external/v8/src/profiler/ |
| unbound-queue-inl.h | 16 : value(value), next(NULL) {
20 Node* next; member in struct:v8::internal::UnboundQueue::Node
40 first_ = tmp->next;
48 Node* next = reinterpret_cast<Node*>(divider_)->next;
49 *rec = next->value;
50 base::Release_Store(÷r_, reinterpret_cast<base::AtomicWord>(next));
57 Node*& next = reinterpret_cast<Node*>(last_)->next; local
58 next = new Node(rec)
[all...] |
| /external/webrtc/webrtc/modules/audio_coding/neteq/ |
| delay_peak_detector_unittest.cc | 62 int next = 1; // Start with the second packet to get a proper IAT. local
63 while (next < kNumPackets) {
64 while (next < kNumPackets && arrival_times_ms[next] <= time) {
65 int iat_packets = (arrival_times_ms[next] - arrival_times_ms[next - 1]) /
75 ++next;
108 int next = 1; // Start with the second packet to get a proper IAT. local
109 while (next < kNumPackets) {
110 while (next < kNumPackets && arrival_times_ms[next] <= time)
[all...] |
| /external/wpa_supplicant_8/src/utils/ |
| list.h | 16 struct dl_list *next; member in struct:dl_list
24 list->next = list;
30 item->next = list->next;
32 list->next->prev = item;
33 list->next = item;
43 item->next->prev = item->prev;
44 item->prev->next = item->next;
45 item->next = NULL
[all...] |
| /external/libcxx/test/std/containers/associative/set/ |
| equal_range.pass.cpp | 44 assert(r.first == next(m.begin(), 0));
45 assert(r.second == next(m.begin(), 1));
47 assert(r.first == next(m.begin(), 1));
48 assert(r.second == next(m.begin(), 2));
50 assert(r.first == next(m.begin(), 2));
51 assert(r.second == next(m.begin(), 3));
53 assert(r.first == next(m.begin(), 3));
54 assert(r.second == next(m.begin(), 4));
56 assert(r.first == next(m.begin(), 4));
57 assert(r.second == next(m.begin(), 5))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/set/ |
| equal_range.pass.cpp | 44 assert(r.first == next(m.begin(), 0));
45 assert(r.second == next(m.begin(), 1));
47 assert(r.first == next(m.begin(), 1));
48 assert(r.second == next(m.begin(), 2));
50 assert(r.first == next(m.begin(), 2));
51 assert(r.second == next(m.begin(), 3));
53 assert(r.first == next(m.begin(), 3));
54 assert(r.second == next(m.begin(), 4));
56 assert(r.first == next(m.begin(), 4));
57 assert(r.second == next(m.begin(), 5))
[all...] |
| /external/libdrm/ |
| util_double_list.h | 23 * next paragraph) shall be included in all copies or substantial portions
44 struct list_head *next; member in struct:list_head
50 item->next = item;
56 item->next = list->next;
57 list->next->prev = item;
58 list->next = item;
63 item->next = list;
65 list->prev->next = item;
72 to->next = from->next
[all...] |
| /external/syslinux/com32/include/linux/ |
| list.h | 15 * sometimes we already know the next/prev entries and we can
24 struct list_head *next, *prev; member in struct:list_head
34 list->next = list;
42 * the prev/next entries already!
46 struct list_head *next)
48 next->prev = new;
49 new->next = next;
51 prev->next = new;
64 __list_add(new, head, head->next);
200 struct list_head *next = head->next; local
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/ |
| lower_bound.pass.cpp | 45 assert(r == next(m.begin(), 0));
47 assert(r == next(m.begin(), 0));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 3));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 9));
75 assert(r == next(m.begin(), 0));
77 assert(r == next(m.begin(), 0));
79 assert(r == next(m.begin(), 3))
[all...] |
| upper_bound.pass.cpp | 45 assert(r == next(m.begin(), 0));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 6));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 9));
57 assert(r == next(m.begin(), 9));
75 assert(r == next(m.begin(), 0));
77 assert(r == next(m.begin(), 3));
79 assert(r == next(m.begin(), 3))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multiset/ |
| lower_bound.pass.cpp | 45 assert(r == next(m.begin(), 0));
47 assert(r == next(m.begin(), 0));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 3));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 9));
75 assert(r == next(m.begin(), 0));
77 assert(r == next(m.begin(), 0));
79 assert(r == next(m.begin(), 3))
[all...] |
| upper_bound.pass.cpp | 45 assert(r == next(m.begin(), 0));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 6));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 9));
57 assert(r == next(m.begin(), 9));
75 assert(r == next(m.begin(), 0));
77 assert(r == next(m.begin(), 3));
79 assert(r == next(m.begin(), 3))
[all...] |
| /external/selinux/libsepol/cil/test/unit/ |
| test_cil_resolve_ast.c | 145 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next->next, args);
165 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args);
184 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args);
204 int rc = cil_resolve_classmapping(test_db->ast->root->cl_head->next->next, args);
228 int rc2 = cil_resolve_call1(test_db->ast->root->cl_head->next->next->next, args);
232 int rc3 = cil_resolve_call2(test_db->ast->root->cl_head->next->next->next, args)
[all...] |
| /external/ltp/testcases/realtime/include/ |
| list.h | 55 * sometimes we already know the next/prev entries and we can
61 struct list_head *next, *prev; member in struct:list_head
71 list->next = list;
79 * the prev/next entries already!
83 struct list_head *next)
85 next->prev = new;
86 new->next = next;
88 prev->next = new;
101 __list_add(new, head, head->next);
199 struct list_head *next = head->next; local
[all...] |
| /external/curl/lib/ |
| llist.c | 65 list->head->next = NULL;
70 ne->next = e?e->next:list->head;
76 else if(e->next) {
77 e->next->prev = ne;
83 e->next = ne;
101 list->head = e->next;
106 e->next->prev = NULL;
110 list->head = e->next;
112 e->prev->next = e->next
[all...] |
| slist.c | 44 while(item->next) {
45 item = item->next;
70 new_item->next = NULL;
78 last->next = new_item;
123 inlist = inlist->next;
131 struct curl_slist *next; local
139 next = item->next;
142 item = next;
143 } while(next);
[all...] |
| /external/iproute2/include/ |
| list.h | 12 struct list_head *next, *prev; member in struct:list_head
17 list->next = list;
23 struct list_head *next)
25 next->prev = new;
26 new->next = next;
28 prev->next = new;
33 __list_add(new, head, head->next);
41 static inline void __list_del(struct list_head *prev, struct list_head *next)
43 next->prev = prev
88 struct hlist_node *next, **pprev; member in struct:hlist_node
93 struct hlist_node *next = n->next; local
[all...] |
| /external/cn-cbor/src/ |
| cn-get.c | 10 for (cp = cb->first_child; cp && cp->next; cp = cp->next->next) {
14 return cp->next;
19 return cp->next;
35 for (cp = cb->first_child; cp && cp->next; cp = cp->next->next) {
43 return cp->next;
56 for (cp = cb->first_child; cp; cp = cp->next) {
[all...] |
| /external/libnl/python/netlink/ |
| utils.h | 2 struct list_head *next; member in struct:list_head
10 return head->next == head;
15 new->next = head->next;
16 head->next = new;
21 prev->next = entry->next;
22 entry->next = entry;
26 for (n = (head), pos = (head)->next; pos != (head); \
27 n = pos, pos = n->next)
[all...] |
| /hardware/interfaces/wifi/1.0/ |
| IWifi.hal | 43 @callflow(next={"*"})
66 @callflow(next={"registerEventCallback", "start", "stop", "getChip"})
87 @callflow(next={"registerEventCallback", "start", "stop"})
102 @callflow(next={"*"})
116 @callflow(next={"*"})
|
| /hardware/interfaces/wifi/offload/1.0/ |
| IOffload.hal | 34 @callflow(next={"setEventCallback", "subscribeScanResults"})
48 @callflow(next={"subscribeScanResults", "unsubscribeScanResults", "getScanStats"})
65 @callflow(next={"unsubscribeScanResults", "getScanStats"})
73 @callflow(next={"*"})
85 @callflow(next={"subscribeScanStats", "configureScans"})
|
