| /external/libvpx/libvpx/third_party/nestegg/halloc/src/ |
| hlist.h | 32 hlist_item_t * next; member in struct:hlist_head
37 hlist_item_t * next; member in struct:hlist_item
50 #define __hlist_init_item(i) { &hlist_null, &(i).next }
76 for (i = (h)->next; i != &hlist_null; i = i->next)
79 for (i = (h)->next, tmp = i->next; \
81 i = tmp, tmp = i->next)
89 h->next = &hlist_null;
95 i->prev = &i->next;
101 hlist_item_t * next; local
112 hlist_item_t * next; local
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/third_party/nestegg/halloc/src/ |
| hlist.h | 32 hlist_item_t * next; member in struct:hlist_head
37 hlist_item_t * next; member in struct:hlist_item
50 #define __hlist_init_item(i) { &hlist_null, &(i).next }
76 for (i = (h)->next; i != &hlist_null; i = i->next)
79 for (i = (h)->next, tmp = i->next; \
81 i = tmp, tmp = i->next)
89 h->next = &hlist_null;
95 i->prev = &i->next;
101 hlist_item_t * next; local
112 hlist_item_t * next; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/ |
| erase_key.pass.cpp | 45 assert(next(m.begin())->first == 2);
46 assert(next(m.begin())->second == 2.5);
47 assert(next(m.begin(), 2)->first == 3);
48 assert(next(m.begin(), 2)->second == 3.5);
49 assert(next(m.begin(), 3)->first == 4);
50 assert(next(m.begin(), 3)->second == 4.5);
51 assert(next(m.begin(), 4)->first == 5);
52 assert(next(m.begin(), 4)->second == 5.5);
53 assert(next(m.begin(), 5)->first == 6);
54 assert(next(m.begin(), 5)->second == 6.5)
[all...] |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
42 assert(i == next(m.begin(), 3));
45 assert(next(m.begin())->first == 2);
46 assert(next(m.begin())->second == 2.5);
47 assert(next(m.begin(), 2)->first == 3);
48 assert(next(m.begin(), 2)->second == 3.5);
49 assert(next(m.begin(), 3)->first == 5);
50 assert(next(m.begin(), 3)->second == 5.5);
51 assert(next(m.begin(), 4)->first == 6);
52 assert(next(m.begin(), 4)->second == 6.5)
[all...] |
| /device/lge/mako/camera/QCamera/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 struct cam_list *next = ptr->next; local
68 next->prev = ptr->prev;
69 prev->next = ptr->next;
70 ptr->next = ptr
[all...] |
| /device/moto/shamu/camera/QCamera/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 struct cam_list *next = ptr->next; local
68 next->prev = ptr->prev;
69 prev->next = ptr->next;
70 ptr->next = ptr
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| kernel-list.h | 9 * sometimes we already know the next/prev entries and we can
15 struct list_head *next, *prev; member in struct:list_head
21 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
32 * the prev/next entries already!
36 struct list_head * next)
38 next->prev = new;
39 new->next = next;
41 prev->next = new;
49 __list_add(new, head, head->next);
[all...] |
| /external/elfutils/0.153/lib/ |
| list.h | 57 assert (_newp->next == NULL); \
60 (first) = _newp->next = _newp->previous = _newp; \
63 _newp->next = (first); \
65 _newp->previous->next = _newp->next->previous = _newp; \
76 || ({ __typeof (elem) _runp = first->next; \
81 _runp = _runp->next; \
83 if (unlikely (_elem->next == _elem)) \
87 _elem->next->previous = _elem->previous; \
88 _elem->previous->next = _elem->next;
[all...] |
| /hardware/intel/common/libwsbm/src/ |
| wsbm_util.h | 18 struct _WsbmListHead *next; member in struct:_WsbmListHead
24 (__item)->next = (__item); \
30 (__item)->next = (__list)->next; \
31 (__list)->next->prev = (__item); \
32 (__list)->next = (__item); \
37 (__item)->next = (__list); \
39 (__list)->prev->next = (__item); \
45 (__item)->prev->next = (__item)->next; \
[all...] |
| /external/libcxx/test/containers/associative/map/map.modifiers/ |
| erase_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 3));
42 assert(i == next(m.begin(), 3));
45 assert(next(m.begin())->first == 2);
46 assert(next(m.begin())->second == 2.5);
47 assert(next(m.begin(), 2)->first == 3);
48 assert(next(m.begin(), 2)->second == 3.5);
49 assert(next(m.begin(), 3)->first == 5);
50 assert(next(m.begin(), 3)->second == 5.5);
51 assert(next(m.begin(), 4)->first == 6);
52 assert(next(m.begin(), 4)->second == 6.5)
[all...] |
| /external/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| erase_key.pass.cpp | 44 assert(next(m.begin(), 0)->first == 1);
45 assert(next(m.begin(), 0)->second == 1);
46 assert(next(m.begin(), 1)->first == 1);
47 assert(next(m.begin(), 1)->second == 1.5);
48 assert(next(m.begin(), 2)->first == 1);
49 assert(next(m.begin(), 2)->second == 2);
50 assert(next(m.begin(), 3)->first == 3);
51 assert(next(m.begin(), 3)->second == 1);
52 assert(next(m.begin(), 4)->first == 3);
53 assert(next(m.begin(), 4)->second == 1.5)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| erase_key.pass.cpp | 44 assert(next(m.begin(), 0)->first == 1);
45 assert(next(m.begin(), 0)->second == 1);
46 assert(next(m.begin(), 1)->first == 1);
47 assert(next(m.begin(), 1)->second == 1.5);
48 assert(next(m.begin(), 2)->first == 1);
49 assert(next(m.begin(), 2)->second == 2);
50 assert(next(m.begin(), 3)->first == 3);
51 assert(next(m.begin(), 3)->second == 1);
52 assert(next(m.begin(), 4)->first == 3);
53 assert(next(m.begin(), 4)->second == 1.5)
[all...] |
| /external/f2fs-tools/include/ |
| list.h | 14 struct list_head *next, *prev; member in struct:list_head
24 list->next = list;
30 struct list_head *next)
32 next->prev = new;
33 new->next = next;
35 prev->next = new;
40 __list_add(new, head, head->next);
48 static inline void __list_del(struct list_head * prev, struct list_head * next)
50 next->prev = prev
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
49 (elem)->next = elem; \
62 (elem)->next = (list)->next; \
63 (list)->next->prev = elem; \
64 (list)->next = elem; \
75 (elem)->next = list; \
77 (list)->prev->next = elem;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| simple_list.h | 45 struct simple_node *next; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
69 (elem)->next = (list)->next; \
70 (list)->next->prev = elem; \
71 (list)->next = elem; \
82 (elem)->next = list; \
84 (list)->prev->next = elem;
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
49 (elem)->next = elem; \
62 (elem)->next = (list)->next; \
63 (list)->next->prev = elem; \
64 (list)->next = elem; \
75 (elem)->next = list; \
77 (list)->prev->next = elem;
[all...] |
| /external/mesa3d/src/mesa/main/ |
| simple_list.h | 45 struct simple_node *next; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
69 (elem)->next = (list)->next; \
70 (list)->next->prev = elem; \
71 (list)->next = elem; \
82 (elem)->next = list; \
84 (list)->prev->next = elem;
[all...] |
| /system/core/include/cutils/ |
| list.h | 28 struct listnode *next; member in struct:listnode
37 .next = &name, \
42 for (node = (list)->next; node != (list); node = node->next)
48 for (node = (list)->next, n = node->next; \
50 node = n, n = node->next)
54 node->next = node;
60 item->next = head;
62 head->prev->next = item
[all...] |
| /external/libcxx/test/containers/associative/multiset/ |
| erase_key.pass.cpp | 44 assert(*next(m.begin(), 0) == 3);
45 assert(*next(m.begin(), 1) == 3);
46 assert(*next(m.begin(), 2) == 3);
47 assert(*next(m.begin(), 3) == 5);
48 assert(*next(m.begin(), 4) == 5);
49 assert(*next(m.begin(), 5) == 5);
50 assert(*next(m.begin(), 6) == 7);
51 assert(*next(m.begin(), 7) == 7);
52 assert(*next(m.begin(), 8) == 7);
57 assert(*next(m.begin(), 0) == 3)
[all...] |
| /external/libcxx/test/containers/associative/multiset/multiset.cons/ |
| copy.pass.cpp | 46 assert(*next(m.begin(), 0) == 1);
47 assert(*next(m.begin(), 1) == 1);
48 assert(*next(m.begin(), 2) == 1);
49 assert(*next(m.begin(), 3) == 2);
50 assert(*next(m.begin(), 4) == 2);
51 assert(*next(m.begin(), 5) == 2);
52 assert(*next(m.begin(), 6) == 3);
53 assert(*next(m.begin(), 7) == 3);
54 assert(*next(m.begin(), 8) == 3);
60 assert(*next(mo.begin(), 0) == 1)
[all...] |
| copy_assign.pass.cpp | 47 assert(*next(m.begin(), 0) == 1);
48 assert(*next(m.begin(), 1) == 1);
49 assert(*next(m.begin(), 2) == 1);
50 assert(*next(m.begin(), 3) == 2);
51 assert(*next(m.begin(), 4) == 2);
52 assert(*next(m.begin(), 5) == 2);
53 assert(*next(m.begin(), 6) == 3);
54 assert(*next(m.begin(), 7) == 3);
55 assert(*next(m.begin(), 8) == 3);
61 assert(*next(mo.begin(), 0) == 1)
[all...] |
| iter_iter_comp.pass.cpp | 44 assert(*next(m.begin(), 0) == 1);
45 assert(*next(m.begin(), 1) == 1);
46 assert(*next(m.begin(), 2) == 1);
47 assert(*next(m.begin(), 3) == 2);
48 assert(*next(m.begin(), 4) == 2);
49 assert(*next(m.begin(), 5) == 2);
50 assert(*next(m.begin(), 6) == 3);
51 assert(*next(m.begin(), 7) == 3);
52 assert(*next(m.begin(), 8) == 3);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| erase_key.pass.cpp | 44 assert(*next(m.begin(), 0) == 3);
45 assert(*next(m.begin(), 1) == 3);
46 assert(*next(m.begin(), 2) == 3);
47 assert(*next(m.begin(), 3) == 5);
48 assert(*next(m.begin(), 4) == 5);
49 assert(*next(m.begin(), 5) == 5);
50 assert(*next(m.begin(), 6) == 7);
51 assert(*next(m.begin(), 7) == 7);
52 assert(*next(m.begin(), 8) == 7);
57 assert(*next(m.begin(), 0) == 3)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| copy.pass.cpp | 46 assert(*next(m.begin(), 0) == 1);
47 assert(*next(m.begin(), 1) == 1);
48 assert(*next(m.begin(), 2) == 1);
49 assert(*next(m.begin(), 3) == 2);
50 assert(*next(m.begin(), 4) == 2);
51 assert(*next(m.begin(), 5) == 2);
52 assert(*next(m.begin(), 6) == 3);
53 assert(*next(m.begin(), 7) == 3);
54 assert(*next(m.begin(), 8) == 3);
60 assert(*next(mo.begin(), 0) == 1)
[all...] |
| copy_assign.pass.cpp | 47 assert(*next(m.begin(), 0) == 1);
48 assert(*next(m.begin(), 1) == 1);
49 assert(*next(m.begin(), 2) == 1);
50 assert(*next(m.begin(), 3) == 2);
51 assert(*next(m.begin(), 4) == 2);
52 assert(*next(m.begin(), 5) == 2);
53 assert(*next(m.begin(), 6) == 3);
54 assert(*next(m.begin(), 7) == 3);
55 assert(*next(m.begin(), 8) == 3);
61 assert(*next(mo.begin(), 0) == 1)
[all...] |
