| /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...] |
| /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/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| 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...] |
| 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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| 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...] |
| 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/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...] |
| /libcore/luni/src/main/java/java/util/concurrent/atomic/ |
| AtomicInteger.java | 133 int next = current + 1; local
134 if (compareAndSet(current, next))
147 int next = current - 1; local
148 if (compareAndSet(current, next))
162 int next = current + delta; local
163 if (compareAndSet(current, next))
176 int next = current + 1; local
177 if (compareAndSet(current, next))
178 return next;
190 int next = current - 1 local
205 int next = current + delta; local
[all...] |
| AtomicLong.java | 147 long next = current + 1; local
148 if (compareAndSet(current, next))
161 long next = current - 1; local
162 if (compareAndSet(current, next))
176 long next = current + delta; local
177 if (compareAndSet(current, next))
190 long next = current + 1; local
191 if (compareAndSet(current, next))
192 return next;
204 long next = current - 1 local
219 long next = current + delta; local
[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/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;
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/ |
| next_prior.hpp | 23 BOOST_MPL_AUX_COMMON_NAME_WKND(next)
29 struct next struct in namespace:boost::mpl
31 typedef typename T::next type;
32 BOOST_MPL_AUX_LAMBDA_SUPPORT(1,next,(T))
44 BOOST_MPL_AUX_NA_SPEC(1, 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...] |
