| /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>();
|
| /prebuilts/ndk/r11/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>();
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/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>();
|
| /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...] |
| /external/curl/src/ |
| slist_wc.c | 33 * slist_wc_append() appends a string to the linked list. This function can be
36 struct slist_wc *slist_wc_append(struct slist_wc *list,
44 if(!list) {
45 list = malloc(sizeof(struct slist_wc));
47 if(!list) {
52 list->first = new_item;
53 list->last = new_item;
54 return list;
57 list->last->next = new_item;
58 list->last = list->last->next
[all...] |
| /external/libcxx/test/std/containers/sequences/list/ |
| allocator_mismatch.fail.cpp | 10 // <list>
13 #include <list>
17 std::list<int, std::allocator<long> > l;
|
| incomplete_type.pass.cpp | 10 // <list>
12 // Check that std::list and its iterators can be instantiated with an incomplete
15 #include <list>
18 std::list<A> l;
19 std::list<A>::iterator it;
20 std::list<A>::const_iterator cit;
21 std::list<A>::reverse_iterator rit;
22 std::list<A>::const_reverse_iterator crit;
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/ |
| allocator_mismatch.fail.cpp | 10 // <list>
13 #include <list>
17 std::list<int, std::allocator<long> > l;
|
| incomplete_type.pass.cpp | 10 // <list>
12 // Check that std::list and it's iterators can be instantiated with an incomplete
15 #include <list>
18 std::list<A> l;
19 std::list<A>::iterator it;
20 std::list<A>::const_iterator cit;
21 std::list<A>::reverse_iterator rit;
22 std::list<A>::const_reverse_iterator crit;
|
| /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/syslinux/com32/lib/syslinux/ |
| freelist.c | 37 void syslinux_free_movelist(struct syslinux_movelist *list)
41 while (list) {
42 m = list;
43 list = list->next;
|
| /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/protobuf/java/core/src/test/java/com/google/protobuf/ |
| IntArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
52 private IntArrayList list; field in class:IntArrayListTest
56 list = new IntArrayList();
68 list.addInt(2);
69 list.addInt(4);
70 list.addInt(6);
71 list.addInt(8);
72 list.makeImmutable();
73 assertImmutable(list);
282 assertEquals(asList(), list); local
452 IntArrayList list = new IntArrayList(); local
[all...] |
| BooleanArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
52 private BooleanArrayList list; field in class:BooleanArrayListTest
56 list = new BooleanArrayList();
68 list.addBoolean(true);
69 list.addBoolean(false);
70 list.addBoolean(true);
71 list.addBoolean(true);
72 list.makeImmutable();
73 assertImmutable(list);
215 assertEquals(asList(true), list); local
219 assertEquals(asList(false, true, false), list); local
227 assertEquals(asList(true, false, false, true, false, true, true, true, true, true, true), list); local
246 assertEquals(asList(true), list); local
249 assertEquals(asList(true, false), list); local
261 assertEquals(asList(false, true, false, false, false, true), list); local
264 assertEquals(asList(false, true, false, false, false, true, true, true, false), list); local
273 assertEquals(asList(true, false), list); local
276 assertEquals(asList(false), list); local
279 assertEquals(asList(false), list); local
282 assertEquals(asList(), list); local
448 BooleanArrayList list = new BooleanArrayList(); local
[all...] |
| ProtobufArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
40 import java.util.List;
51 private ProtobufArrayList<Integer> list; field in class:ProtobufArrayListTest
55 list = new ProtobufArrayList<Integer>();
67 list.addAll(asList(1, 2, 3, 4));
68 Iterator<Integer> iterator = list.iterator();
69 assertEquals(4, list.size());
70 assertEquals(1, (int) list.get(0));
73 list.remove(0)
121 assertEquals(asList(), list); local
282 ProtobufArrayList<Integer> list = new ProtobufArrayList<Integer>(); 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;
|
| /system/bt/osi/src/ |
| list.cc | 4 #include "osi/include/list.h"
20 static list_node_t* list_free_node_(list_t* list, list_node_t* node);
27 list_t* list = (list_t*)zeroed_allocator->alloc(sizeof(list_t)); local
28 if (!list) return NULL;
30 list->free_cb = callback;
31 list->allocator = zeroed_allocator;
32 return list;
39 void list_free(list_t* list) {
40 if (!list) return;
42 list_clear(list);
[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/os/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...] |
