HomeSort by relevance Sort by last modified time
    Searched refs:list (Results 1 - 25 of 7747) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /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 };
2002-07-14-MiscListTests.c 3 // Test list stuff
7 // Test opaque structure support. the list type is defined later
8 struct list;
10 struct list *PassThroughList(struct list *L) {
17 typedef struct list { struct
19 struct list *Next;
20 } list; typedef in typeref:struct:list
22 list *Data;
28 Data = (list*)malloc(12); // This is not a proper list allocatio
    [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>();
  /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;
  /external/libcxx/test/std/containers/sequences/list/list.capacity/
empty.fail.cpp 11 // <list>
13 // class list
20 #include <list>
26 std::list<int> c;
  /external/libcxx/test/std/utilities/optional/optional.syn/
optional_includes_initializer_list.pass.cpp 21 std::initializer_list<int> list;
22 (void)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/grpc-grpc/src/core/lib/channel/
handshaker_registry.cc 32 grpc_handshaker_factory** list; member in struct:__anon23074
37 grpc_handshaker_factory_list* list, bool at_start,
39 list->list = static_cast<grpc_handshaker_factory**>(gpr_realloc(
40 list->list,
41 (list->num_factories + 1) * sizeof(grpc_handshaker_factory*)));
43 memmove(list->list + 1, list->list
    [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...]
DoubleArrayListTest.java 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
52 private DoubleArrayList list; field in class:DoubleArrayListTest
56 list = new DoubleArrayList();
68 list.addDouble(2);
69 list.addDouble(4);
70 list.addDouble(6);
71 list.addDouble(8);
72 list.makeImmutable();
73 assertImmutable(list);
282 assertEquals(asList(), list); local
452 DoubleArrayList list = new DoubleArrayList(); local
    [all...]
FloatArrayListTest.java 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
52 private FloatArrayList list; field in class:FloatArrayListTest
56 list = new FloatArrayList();
68 list.addFloat(2);
69 list.addFloat(4);
70 list.addFloat(6);
71 list.addFloat(8);
72 list.makeImmutable();
73 assertImmutable(list);
282 assertEquals(asList(), list); local
452 FloatArrayList list = new FloatArrayList(); local
    [all...]
LongArrayListTest.java 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
52 private LongArrayList list; field in class:LongArrayListTest
56 list = new LongArrayList();
68 list.addLong(2);
69 list.addLong(4);
70 list.addLong(6);
71 list.addLong(8);
72 list.makeImmutable();
73 assertImmutable(list);
282 assertEquals(asList(), list); local
452 LongArrayList list = new LongArrayList(); local
    [all...]
  /external/grpc-grpc/src/core/ext/filters/client_channel/
proxy_mapper_registry.cc 32 grpc_proxy_mapper** list; member in struct:__anon22981
36 static void grpc_proxy_mapper_list_register(grpc_proxy_mapper_list* list,
39 list->list = static_cast<grpc_proxy_mapper**>(gpr_realloc(
40 list->list, (list->num_mappers + 1) * sizeof(grpc_proxy_mapper*)));
42 memmove(list->list + 1, list->list
    [all...]
  /external/adhd/cras/src/server/
stream_list.c 26 struct stream_list *list = (struct stream_list *)data; local
29 DL_FOREACH(list->streams_to_delete, to_delete) {
32 drain_delay = list->stream_removed_cb(to_delete);
37 DL_DELETE(list->streams_to_delete, to_delete);
38 list->stream_destroy_cb(to_delete);
41 list->drain_timer = NULL;
43 list->drain_timer = cras_tm_create_timer(list->timer_manager,
44 MAX(max_drain_delay, 10), delete_streams, list);
57 struct stream_list *list = calloc(1, sizeof(struct stream_list)) 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/mesa3d/src/util/
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.
62 * Insert an element to the list head.
64 * \param list list.
67 #define insert_at_head(list, elem) \
69 (elem)->prev = list; \
70 (elem)->next = (list)->next; \
71 (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...]
  /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;
  /external/desugar/test/java/com/google/devtools/build/android/desugar/testdata/separate/
SeparateBaseClass.java 16 import java.util.List;
23 private final List<T> list; field in class:SeparateBaseClass
25 protected SeparateBaseClass(List<T> list) {
26 this.list = list;
30 return list.contains(elem);

Completed in 1047 milliseconds

1 2 3 4 5 6 7 8 91011>>