| /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/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| 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...] |
| insert_after_range.pass.cpp | 36 assert(i == next(c.before_begin(), 3));
38 assert(*next(c.begin(), 0) == 0);
39 assert(*next(c.begin(), 1) == 1);
40 assert(*next(c.begin(), 2) == 2);
43 assert(i == next(c.begin(), 2));
45 assert(*next(c.begin(), 0) == 0);
46 assert(*next(c.begin(), 1) == 3);
47 assert(*next(c.begin(), 2) == 4);
48 assert(*next(c.begin(), 3) == 1);
49 assert(*next(c.begin(), 4) == 2)
[all...] |
| insert_after_size_value.pass.cpp | 31 assert(i == next(c.before_begin(), 3));
33 assert(*next(c.begin(), 0) == 3);
34 assert(*next(c.begin(), 1) == 3);
35 assert(*next(c.begin(), 2) == 3);
38 assert(i == next(c.begin(), 2));
40 assert(*next(c.begin(), 0) == 3);
41 assert(*next(c.begin(), 1) == 2);
42 assert(*next(c.begin(), 2) == 2);
43 assert(*next(c.begin(), 3) == 3);
44 assert(*next(c.begin(), 4) == 3)
[all...] |
| /external/libnl/include/netlink/ |
| list.h | 17 struct nl_list_head * next; member in struct:nl_list_head
23 list->next = list;
29 struct nl_list_head *next)
31 prev->next = obj;
33 next->prev = obj;
34 obj->next = next;
46 __nl_list_add(obj, head, head->next);
51 obj->next->prev = obj->prev;
52 obj->prev->next = obj->next
[all...] |
| /external/lldb/test/functionalities/recursion/ |
| main.cpp | 17 node* next; member in struct:node
18 node () : value(1),next(NULL) {}
19 node (int v) : value(v), next(NULL) {}
30 root->next = new node(++countdown);
31 root = root->next;
|
| /external/lldb/test/python_api/type/ |
| main.cpp | 14 Task *next; member in class:Task
17 next(n)
31 task_head->next = task1;
32 task1->next = task2;
33 task2->next = task4;
34 task4->next = task5;
41 t = t->next;
|
| /external/chromium_org/third_party/mesa/src/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/chromium_org/third_party/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/chromium_org/v8/src/ |
| 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/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/chromium_org/components/enhanced_bookmarks/ |
| item_position_unittest.cc | 18 ItemPosition next = ItemPosition::CreateBefore(current); local
19 EXPECT_LT(next.ToString(), current.ToString());
20 current = next;
29 ItemPosition next = ItemPosition::CreateAfter(current); local
30 EXPECT_GT(next.ToString(), current.ToString());
31 current = next;
41 ItemPosition next = ItemPosition::CreateBetween(before, after); local
42 EXPECT_GT(next.ToString(), before.ToString());
43 EXPECT_LT(next.ToString(), after.ToString());
44 after = next;
54 ItemPosition next = ItemPosition::CreateBetween(before, after); local
67 ItemPosition next = ItemPosition::CreateBetween(before, after); local
[all...] |
| /external/libcxx/test/containers/associative/set/ |
| 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...] |
| upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1))
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_double_list.h | 23 * 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 = from->next
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_double_list.h | 23 * 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 = from->next
[all...] |
| /external/libcxx/test/containers/associative/multiset/ |
| lower_bound.pass.cpp | 44 assert(r == next(m.begin(), 0));
46 assert(r == next(m.begin(), 0));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 6));
56 assert(r == next(m.begin(), 9));
74 assert(r == next(m.begin(), 0));
76 assert(r == next(m.begin(), 0));
78 assert(r == next(m.begin(), 3))
[all...] |
| upper_bound.pass.cpp | 44 assert(r == next(m.begin(), 0));
46 assert(r == next(m.begin(), 3));
48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 6));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 9));
56 assert(r == next(m.begin(), 9));
74 assert(r == next(m.begin(), 0));
76 assert(r == next(m.begin(), 3));
78 assert(r == next(m.begin(), 3))
[all...] |
| /external/chromium_org/third_party/boringssl/src/ssl/pqueue/ |
| pqueue.c | 77 item->next = NULL;
113 for (curr = pq->items; curr; curr = curr->next) {
128 item = item->next;
143 *item = (*item)->next;
149 pitem *curr, *next; local
156 for (curr = NULL, next = pq->items; next != NULL;
157 curr = next, next = next->next)
[all...] |
| /cts/common/host-side/native-scanner/tests/src/com/android/compatibility/common/scanner/ |
| NativeScannerTest.java | 37 assertEquals("suite:TestSuite", it.next());
38 assertEquals("case:FakeTestCase", it.next());
39 assertEquals("test:FakeTestName", it.next());
51 assertEquals("suite:TestSuite", it.next());
52 assertEquals("case:Case1", it.next());
53 assertEquals("test:Test1", it.next());
54 assertEquals("test:Test2", it.next());
55 assertEquals("case:Case2", it.next());
56 assertEquals("test:Test3", it.next());
57 assertEquals("test:Test4", it.next());
[all...] |
| /external/libcxx/test/containers/associative/map/map.ops/ |
| upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1))
[all...] |
| lower_bound.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1));
63 assert(r == next(m.begin(), 2))
[all...] |
| /external/linux-tools-perf/perf-3.12.0/include/linux/ |
| list.h | 14 * sometimes we already know the next/prev entries and we can
26 list->next = list;
34 * the prev/next entries already!
39 struct list_head *next)
41 next->prev = new;
42 new->next = next;
44 prev->next = new;
49 struct list_head *next);
62 __list_add(new, head, head->next);
206 struct list_head *next = head->next; local
588 struct hlist_node *next = n->next; local
[all...] |
| /external/chromium_org/third_party/skia/src/views/ |
| SkTagList.cpp | 38 SkTagList* next = rec->fNext;
43 prev->fNext = next;
45 *head = next;
50 rec = next;
58 SkTagList* next = rec->fNext;
60 rec = next;
|
| /external/libcxx/test/containers/associative/multimap/multimap.cons/ |
| iter_iter.pass.cpp | 42 assert(*next(m.begin()) == V(1, 1.5));
43 assert(*next(m.begin(), 2) == V(1, 2));
44 assert(*next(m.begin(), 3) == V(2, 1));
45 assert(*next(m.begin(), 4) == V(2, 1.5));
46 assert(*next(m.begin(), 5) == V(2, 2));
47 assert(*next(m.begin(), 6) == V(3, 1));
48 assert(*next(m.begin(), 7) == V(3, 1.5));
49 assert(*next(m.begin(), 8) == V(3, 2));
70 assert(*next(m.begin()) == V(1, 1.5));
71 assert(*next(m.begin(), 2) == V(1, 2))
[all...] |
