| /ndk/tests/device/test-gnustl-full/unit/ |
| list_header_test.cpp | 8 #include <list>
|
| /ndk/tests/device/test-stlport/unit/ |
| list_header_test.cpp | 8 #include <list>
|
| /external/chromium-trace/catapult/telemetry/third_party/modulegraph/modulegraph_tests/testpkg-regr6/ |
| module.py | 4 list(1)
5 + list(2)
6 + list(2)
7 + list(2)
8 + list(2)
9 + list(2)
10 + list(2)
11 + list(2)
12 + list(2)
13 + list(2
[all...] |
| /external/clang/test/CodeGen/ |
| 2002-08-19-RecursiveLocals.c | 5 struct list { struct
7 struct list *Next;
10 static struct list B; /* Forward declare static */
11 static struct list A = { 7, &B };
12 static struct list B = { 8, &A };
14 extern struct list D; /* forward declare normal var */
16 struct list C = { 7, &D };
17 struct list D = { 8, &C };
|
| /hardware/intel/common/wrs_omxil_core/utils/src/ |
| list.c | 2 * list.c, list
21 #include <list.h>
23 void __list_init(struct list *entry)
32 struct list *__list_alloc(void)
34 struct list *new;
36 new = malloc(sizeof(struct list));
42 struct list *list_alloc(void *data)
44 struct list *new;
53 void __list_free(struct list *entry
[all...] |
| /hardware/intel/common/wrs_omxil_core/utils/inc/ |
| list.h | 2 * list.h, list
26 struct list { struct
27 struct list *next;
28 struct list *prev;
33 void __list_init(struct list *);
35 struct list *__list_alloc(void);
36 struct list *list_alloc(void *);
38 void __list_free(struct list *);
39 void list_free_all(struct list *);
[all...] |
| /external/libcxx/test/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/ |
| container.fail.cpp | 19 #include <list>
23 std::front_insert_iterator<std::list<int> > i = std::list<int>();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/ |
| container.fail.cpp | 19 #include <list>
23 std::front_insert_iterator<std::list<int> > i = std::list<int>();
|
| /external/smali/util/src/test/java/org/jf/util/ |
| LinearSearchTest.java | 10 * notice, this list of conditions and the following disclaimer.
12 * copyright notice, this list of conditions and the following disclaimer
39 import java.util.List;
44 List<Integer> list = Lists.newArrayList(0, 1, 3, 4); local
46 doTest(list, 5, 10);
47 doTest(list, 5, 4);
48 doTest(list, 5, 3);
49 doTest(list, 5, 2);
50 doTest(list, 5, 1)
[all...] |
| /toolchain/binutils/binutils-2.25/binutils/ |
| arsup.h | 21 struct list { struct
23 struct list *next;
32 void ar_replace (struct list *);
34 void ar_delete (struct list *);
42 void ar_directory (char *, struct list *, char *);
44 void ar_addmod (struct list *);
46 void ar_addlib (char *, struct list *);
50 void ar_extract (struct list *);
|
| /external/clang/test/Analysis/ |
| kmalloc-linux.c | 16 struct test **list, *t; local
19 list = kmalloc(sizeof(*list) * 10, __GFP_ZERO);
20 if (list == NULL)
24 t = list[i];
27 free(list); // no-warning
31 struct test **list, *t; local
34 list = kmalloc(sizeof(*list) * 10, 0);
35 if (list == NULL
46 struct test **list, *t; local
[all...] |
| malloc-three-arg.c | 16 struct test **list, *t; local
19 list = malloc(sizeof(*list) * 10, NULL, M_ZERO);
20 if (list == NULL)
24 t = list[i];
27 free(list); // no-warning
31 struct test **list, *t; local
34 list = malloc(sizeof(*list) * 10, NULL, 0);
35 if (list == NULL
46 struct test **list, *t; local
[all...] |
| /external/parameter-framework/upstream/parameter/ |
| Results.h | 9 * list of conditions and the following disclaimer.
12 * this list of conditions and the following disclaimer in the documentation and/or
32 #include <list>
38 /** String list type which can hold list of error/info */
39 typedef std::list<std::string> Results;
|
| /external/strace/ |
| generate_mpers_am.sh | 3 list="$(sed -n '/^strace_SOURCES[[:space:]]*=/,/^[[:space:]]*# end of strace_SOURCES/ s/^[[:space:]]*\([[:alnum:]][^.]*\.c\)[[:space:]]*\\$/\1/p' Makefile.am |
9 mpers_source_files = $list
13 $list > mpers_xlat.h
|
| /system/bt/osi/src/ |
| list.c | 4 #include "osi/include/list.h"
20 static list_node_t *list_free_node_(list_t *list, list_node_t *node);
25 list_t *list = (list_t *)zeroed_allocator->alloc(sizeof(list_t)); local
26 if (!list)
29 list->free_cb = callback;
30 list->allocator = zeroed_allocator;
31 return list;
38 void list_free(list_t *list) {
39 if (!list)
42 list_clear(list);
[all...] |
| /external/v8/test/cctest/ |
| test-list.cc | 7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
55 // Check that we can add (a reference to) an element of the list
58 // Add elements to the list to grow it to its capacity.
59 List<int, ZeroingAllocationPolicy> list(4);
60 list.Add(1);
61 list.Add(2);
62 list.Add(3);
63 list.Add(4)
159 List<int>* list = new List<int>(0); local
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_simple_list.h | 5 * Intended to work with a list sentinal which is created as an empty
6 * list. Insert & delete are O(1).
41 * Remove an element from list.
54 * Insert an element to the list head.
56 * \param list list.
59 #define insert_at_head(list, elem) \
61 (elem)->prev = list; \
62 (elem)->next = (list)->next; \
63 (list)->next->prev = elem;
[all...] |
| /external/mesa3d/src/mesa/main/ |
| simple_list.h | 5 * Intended to work with a list sentinal which is created as an empty
6 * list. Insert & delete are O(1).
50 * Remove an element from list.
61 * Insert an element to the list head.
63 * \param list list.
66 #define insert_at_head(list, elem) \
68 (elem)->prev = list; \
69 (elem)->next = (list)->next; \
70 (list)->next->prev = elem;
[all...] |
| /device/google/contexthub/firmware/inc/ |
| list.h | 27 #define list_iterate(list, cur_link, tmp_link) \
28 for ((cur_link) = (list)->next, \
30 (cur_link) != NULL && (cur_link) != (list); \
33 #define DECLARE_LIST(list) \
34 link_t list = { .prev = &list, .next = &list }
36 static inline void list_init(struct link_t *list)
38 list->prev = list->next = list
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/preprocessor/list/ |
| adt.hpp | 32 # define BOOST_PP_LIST_FIRST(list) BOOST_PP_LIST_FIRST_D(list)
35 # define BOOST_PP_LIST_FIRST_D(list) BOOST_PP_LIST_FIRST_I list
37 # define BOOST_PP_LIST_FIRST_D(list) BOOST_PP_LIST_FIRST_I ## list
44 # define BOOST_PP_LIST_REST(list) BOOST_PP_LIST_REST_D(list)
47 # define BOOST_PP_LIST_REST_D(list) BOOST_PP_LIST_REST_I list
[all...] |
| reverse.hpp | 18 # include <boost/preprocessor/list/fold_left.hpp>
23 # define BOOST_PP_LIST_REVERSE(list) BOOST_PP_LIST_FOLD_LEFT(BOOST_PP_LIST_REVERSE_O, BOOST_PP_NIL, list)
25 # define BOOST_PP_LIST_REVERSE(list) BOOST_PP_LIST_REVERSE_I(list)
26 # define BOOST_PP_LIST_REVERSE_I(list) BOOST_PP_LIST_FOLD_LEFT(BOOST_PP_LIST_REVERSE_O, BOOST_PP_NIL, list)
34 # define BOOST_PP_LIST_REVERSE_D(d, list) BOOST_PP_LIST_FOLD_LEFT_ ## d(BOOST_PP_LIST_REVERSE_O, BOOST_PP_NIL, list)
36 # define BOOST_PP_LIST_REVERSE_D(d, list) BOOST_PP_LIST_REVERSE_D_I(d, list
[all...] |
| /system/bt/osi/test/ |
| list_test.cpp | 6 #include "osi/include/list.h"
13 list_t *list = list_new(NULL); local
14 ASSERT_TRUE(list != NULL);
15 list_free(list);
24 list_t *list = list_new(NULL); local
25 EXPECT_TRUE(list_is_empty(list));
26 list_free(list);
30 list_t *list = list_new(NULL); local
31 EXPECT_EQ(list_length(list), 0U);
32 list_free(list);
36 list_t *list = list_new(NULL); local
44 list_t *list = list_new(NULL); local
52 list_t *list = list_new(NULL); local
62 list_t *list = list_new(NULL); local
72 list_t *list = list_new(NULL); local
84 list_t *list = list_new(NULL); local
96 list_t *list = list_new(NULL); local
110 list_t *list = list_new(NULL); local
124 list_t *list = list_new(NULL); local
137 list_t *list = list_new(NULL); local
143 list_t *list = list_new(NULL); local
166 list_t *list = list_new(NULL); local
184 list_t *list = list_new(NULL); local
[all...] |
| /external/toybox/lib/ |
| llist.c | 1 /* llist.c - Linked list functions
3 * Linked list structures have a next pointer as their first element.
26 // Call a function (such as free()) on each element of a linked list.
27 void llist_traverse(void *list, void (*using)(void *node))
29 void *old = list;
31 while (list) {
32 void *pop = llist_pop(&list);
35 // End doubly linked list too.
36 if (old == list) break;
40 // Return the first item from the list, advancing the list (which must be calle
[all...] |
| /packages/apps/Email/tests/src/com/android/email/mail/store/imap/ |
| ImapListTest.java | 37 ImapList list = new ImapList(); local
39 assertTrue(list.isList());
40 assertFalse(list.isString());
42 assertTrue(list.isEmpty());
43 assertEquals(0, list.size());
45 list.add(STRING_1);
46 assertFalse(list.isEmpty());
47 assertEquals(1, list.size());
49 list.add(STRING_2);
50 assertEquals(2, list.size())
65 ImapList list = buildList(ImapList.EMPTY, ABC, LIST_1, ImapString.EMPTY); local
96 ImapList list = buildList(ImapList.EMPTY, STRING_1, LIST_1, ImapString.EMPTY); local
109 ImapList list = buildList(ImapList.EMPTY, STRING_1, LIST_1, ImapString.EMPTY); local
122 ImapList list = buildList(ImapList.EMPTY, STRING_1, LIST_1, ImapString.EMPTY); local
139 ImapList list = buildList( local
166 ImapList list = buildList(K1, LIST_1); local
179 ImapList list = buildList(K1, STRING_1); local
195 ImapList list = buildList(K1, K2, K3); local
[all...] |
| /external/toybox/toys/other/ |
| tac.c | 20 struct arg_list *list = NULL; local
31 temp->next = list;
33 list = temp;
37 while (list) {
38 struct arg_list *temp = list->next;
39 xprintf("%s", list->arg);
40 free(list->arg);
41 free(list);
42 list = temp;
|
