| /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...] |
| /hardware/qcom/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/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...] |
| /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/libnl-headers/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...] |
| /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)
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| lower_bound.pass.cpp | 43 assert(r == next(m.begin(), 0));
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));
73 assert(r == next(m.begin(), 0));
75 assert(r == next(m.begin(), 0));
77 assert(r == next(m.begin(), 3))
[all...] |
| upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 0));
45 assert(r == next(m.begin(), 3));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 6));
51 assert(r == next(m.begin(), 6));
53 assert(r == next(m.begin(), 9));
55 assert(r == next(m.begin(), 9));
73 assert(r == next(m.begin(), 0));
75 assert(r == next(m.begin(), 3));
77 assert(r == next(m.begin(), 3))
[all...] |
| /external/linux-tools-perf/util/include/linux/added/ |
| list.h | 13 list->next = list;
21 * the prev/next entries already!
26 struct list_head *next)
28 next->prev = new;
29 new->next = next;
31 prev->next = new;
36 struct list_head *next);
49 __list_add(new, head, head->next);
67 * Delete a list entry by making the prev/next entrie
187 struct list_head *next = head->next; local
566 struct hlist_node *next = n->next; local
[all...] |
| /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/v8/src/ |
| unbound-queue-inl.h | 41 : value(value), next(NULL) {
45 Node* next; member in struct:v8::internal::UnboundQueue::Node
65 first_ = tmp->next;
73 Node* next = reinterpret_cast<Node*>(divider_)->next;
74 *rec = next->value;
75 Release_Store(÷r_, reinterpret_cast<AtomicWord>(next));
82 Node*& next = reinterpret_cast<Node*>(last_)->next; local
83 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...] |
| /system/extras/fatblock/ |
| fdpool.c | 31 .next = &fdpool_head
38 struct pooled_fd *next = prev->next; local
42 prev->next = node;
44 node->next = next;
45 next->prev = node;
53 struct pooled_fd *next = node->next; local
56 assert(next);
[all...] |
| /dalvik/vm/compiler/ |
| IntermediateRep.cpp | 37 mir->prev = mir->next = NULL;
39 bb->lastMIRInsn->next = mir;
41 mir->next = NULL;
52 mir->prev = mir->next = NULL;
55 mir->next = bb->firstMIRInsn;
65 newMIR->next = currentMIR->next;
66 currentMIR->next = newMIR;
68 if (newMIR->next) {
70 newMIR->next->prev = newMIR
[all...] |
| /external/wpa_supplicant_8/src/utils/ |
| list.h | 16 struct dl_list *next; member in struct:dl_list
22 list->next = list;
28 item->next = list->next;
30 list->next->prev = item;
31 list->next = item;
41 item->next->prev = item->prev;
42 item->prev->next = item->next;
43 item->next = NULL
[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/yaffs2/yaffs2/ |
| devextras.h | 49 * sometimes we already know the next/prev entries and we can
57 struct list_head *next, *prev; member in struct:list_head
66 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
73 * the prev/next entries already!
77 struct list_head *next)
79 next->prev = new;
80 new->next = next;
82 prev->next = new;
95 __list_add(new, head, head->next);
[all...] |
