Searched refs:next (Results 76 - 100 of 5298) sorted by relevance

1234567891011>>

/external/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_heap.c75 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
[all...]
/external/v8/src/profiler/
H A Dunbound-queue-inl.h16 : 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(&divider_, reinterpret_cast<base::AtomicWord>(next));
57 Node*& next = reinterpret_cast<Node*>(last_)->next; local
58 next
[all...]
/external/webrtc/webrtc/modules/audio_coding/neteq/
H A Ddelay_peak_detector_unittest.cc62 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 < kNumPacket
[all...]
/external/wpa_supplicant_8/hostapd/src/utils/
H A Dlist.h16 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
[all...]
/external/wpa_supplicant_8/src/utils/
H A Dlist.h16 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
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/utils/
H A Dlist.h16 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
[all...]
/external/libcxx/test/std/containers/associative/set/
H A Dequal_range.pass.cpp44 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(
[all...]
H A Dupper_bound.pass.cpp44 assert(r == next(m.begin(), 1));
46 assert(r == next(m.begin(), 2));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 4));
52 assert(r == next(m.begin(), 5));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 7));
58 assert(r == next(m.begin(), 8));
60 assert(r == next(m.begin(), 0));
62 assert(r == next(
[all...]
H A Dlower_bound.pass.cpp46 assert(r == next(m.begin()));
48 assert(r == next(m.begin(), 2));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 4));
54 assert(r == next(m.begin(), 5));
56 assert(r == next(m.begin(), 6));
58 assert(r == next(m.begin(), 7));
60 assert(r == next(m.begin(), 0));
62 assert(r == next(m.begin(), 1));
64 assert(r == next(
[all...]
H A Dfind.pass.cpp46 assert(r == next(m.begin()));
48 assert(r == next(m.begin(), 2));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 4));
54 assert(r == next(m.begin(), 5));
56 assert(r == next(m.begin(), 6));
58 assert(r == next(m.begin(), 7));
60 assert(r == next(m.begin(), 8));
79 assert(r == next(m.begin()));
81 assert(r == next(
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_double_list.h23 * next paragraph) shall be included in all copies or substantial portions
48 struct list_head *next; member in struct:list_head
54 item->next = item;
60 item->next = list->next;
61 list->next->prev = item;
62 list->next = item;
67 item->next = list;
69 list->prev->next = item;
76 to->next
[all...]
/external/syslinux/com32/include/linux/
H A Dlist.h15 * 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);
44 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
90 __list_del(struct list_head * prev, struct list_head * next) argument
200 struct list_head *next = head->next; local
[all...]
/external/libcxx/test/std/containers/associative/multiset/
H A Dlower_bound.pass.cpp45 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(
[all...]
H A Dupper_bound.pass.cpp45 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(
[all...]
H A Dfind.pass.cpp46 assert(r == next(m.begin()));
48 assert(r == next(m.begin(), 2));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 4));
54 assert(r == next(m.begin(), 5));
56 assert(r == next(m.begin(), 6));
58 assert(r == next(m.begin(), 7));
60 assert(r == next(m.begin(), 8));
79 assert(r == next(m.begin()));
81 assert(r == next(
[all...]
/external/selinux/libsepol/cil/test/unit/
H A Dtest_cil_resolve_ast.c145 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
[all...]
/external/ltp/testcases/realtime/include/
H A Dlist.h55 * 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);
81 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
124 __list_del(struct list_head * prev, struct list_head * next) argument
199 struct list_head *next = head->next; local
[all...]
/external/libdrm/
H A Dutil_double_list.h23 * 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
[all...]
/external/curl/lib/
H A Dslist.c44 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...]
H A Dllist.c82 list->head->next = NULL;
87 ne->next = e?e->next:list->head;
93 else if(e->next) {
94 e->next->prev = ne;
100 e->next = ne;
119 list->head = e->next;
124 e->next->prev = NULL;
127 e->prev->next = e->next;
[all...]
/external/libnl/python/netlink/
H A Dutils.h2 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...]
/external/libcxx/test/std/containers/associative/map/map.ops/
H A Dupper_bound.pass.cpp44 assert(r == next(m.begin(), 1));
46 assert(r == next(m.begin(), 2));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 4));
52 assert(r == next(m.begin(), 5));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 7));
58 assert(r == next(m.begin(), 8));
60 assert(r == next(m.begin(), 0));
62 assert(r == next(
[all...]
/external/libcxx/test/std/containers/associative/multimap/multimap.cons/
H A Diter_iter.pass.cpp43 assert(*next(m.begin()) == V(1, 1.5));
44 assert(*next(m.begin(), 2) == V(1, 2));
45 assert(*next(m.begin(), 3) == V(2, 1));
46 assert(*next(m.begin(), 4) == V(2, 1.5));
47 assert(*next(m.begin(), 5) == V(2, 2));
48 assert(*next(m.begin(), 6) == V(3, 1));
49 assert(*next(m.begin(), 7) == V(3, 1.5));
50 assert(*next(m.begin(), 8) == V(3, 2));
71 assert(*next(m.begin()) == V(1, 1.5));
72 assert(*next(
[all...]
H A Diter_iter_comp_alloc.pass.cpp49 assert(*next(m.begin()) == V(1, 1.5));
50 assert(*next(m.begin(), 2) == V(1, 2));
51 assert(*next(m.begin(), 3) == V(2, 1));
52 assert(*next(m.begin(), 4) == V(2, 1.5));
53 assert(*next(m.begin(), 5) == V(2, 2));
54 assert(*next(m.begin(), 6) == V(3, 1));
55 assert(*next(m.begin(), 7) == V(3, 1.5));
56 assert(*next(m.begin(), 8) == V(3, 2));
81 assert(*next(m.begin()) == V(1, 1.5));
82 assert(*next(
[all...]
/external/skia/src/views/
H A DSkTagList.cpp37 SkTagList* next = rec->fNext;
42 prev->fNext = next;
44 *head = next;
49 rec = next;
57 SkTagList* next = rec->fNext;
59 rec = next;

Completed in 3163 milliseconds

1234567891011>>