| /external/stlport/test/unit/ |
| list_header_test.cpp | 8 #include <list>
|
| /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/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/chromium_org/net/spdy/ |
| write_blocked_list_test.cc | 17 IntWriteBlockedList list; local
18 EXPECT_FALSE(list.HasWriteBlockedStreams());
19 list.PushBack(1, 1);
20 EXPECT_TRUE(list.HasWriteBlockedStreams());
21 EXPECT_EQ(1, list.GetHighestPriorityWriteBlockedList());
22 list.PushBack(1, 0);
23 EXPECT_TRUE(list.HasWriteBlockedStreams());
24 EXPECT_EQ(0, list.GetHighestPriorityWriteBlockedList());
28 IntWriteBlockedList list; local
29 list.PushBack(1, 4)
38 IntWriteBlockedList list; local
57 IntWriteBlockedList list; local
[all...] |
| /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/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
54 // Check that we can add (a reference to) an element of the list
57 // Add elements to the list to grow it to its capacity.
58 List<int, ZeroingAllocationPolicy> list(4);
59 list.Add(1);
60 list.Add(2);
61 list.Add(3);
62 list.Add(4)
145 List<int>* list = new List<int>(0); local
[all...] |
| /external/chromium_org/gpu/config/ |
| gpu_blacklist.cc | 20 GpuBlacklist* list = new GpuBlacklist(); local
21 list->AddSupportedFeature("accelerated_2d_canvas",
23 list->AddSupportedFeature("accelerated_compositing",
25 list->AddSupportedFeature("webgl",
27 list->AddSupportedFeature("multisampling",
29 list->AddSupportedFeature("flash_3d",
31 list->AddSupportedFeature("flash_stage3d",
33 list->AddSupportedFeature("flash_stage3d_baseline",
35 list->AddSupportedFeature("texture_sharing",
37 list->AddSupportedFeature("accelerated_video_decode"
[all...] |
| /external/qemu/ |
| notify.c | 17 void notifier_list_init(NotifierList *list)
19 QTAILQ_INIT(&list->notifiers);
22 void notifier_list_add(NotifierList *list, Notifier *notifier)
24 QTAILQ_INSERT_HEAD(&list->notifiers, notifier, node);
27 void notifier_list_remove(NotifierList *list, Notifier *notifier)
29 QTAILQ_REMOVE(&list->notifiers, notifier, node);
32 void notifier_list_notify(NotifierList *list)
36 QTAILQ_FOREACH_SAFE(notifier, &list->notifiers, node, next) {
|
| /system/core/include/cutils/ |
| list.h | 41 #define list_for_each(node, list) \
42 for (node = (list)->next; node != (list); node = node->next)
44 #define list_for_each_reverse(node, list) \
45 for (node = (list)->prev; node != (list); node = node->prev)
47 void list_init(struct listnode *list);
48 void list_add_tail(struct listnode *list, struct listnode *item);
51 #define list_empty(list) ((list) == (list)->next
[all...] |
| /external/chromium_org/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/chromium_org/third_party/mesa/src/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/chromium_org/third_party/mesa/src/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...] |
| /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...] |
| /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...] |
| /external/libppp/src/ |
| iplist.c | 9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
56 iplist_first(struct iplist *list)
58 list->cur.pos = -1;
62 iplist_setrange(struct iplist *list, char *range)
67 if (!inet_aton(range, &list->cur.ip))
69 list->cur.lstart = ntohl(list->cur.ip.s_addr);
70 list->cur.nItems = 1;
72 if (!do_inet_aton(range, ptr, &list->cur.ip)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| ListHashSetTest.cpp | 8 * notice, this list of conditions and the following disclaimer.
10 * notice, this list of conditions and the following disclaimer in the
35 ListHashSet<int> list; local
36 list.add(1);
37 list.add(2);
38 list.add(3);
40 ASSERT_EQ(1, list.first());
42 list.removeFirst();
43 ASSERT_EQ(2, list.first());
45 list.removeFirst()
54 ListHashSet<int> list; local
76 ListHashSet<int> list; local
115 ListHashSet<int> list; local
137 ListHashSet<int> list; local
[all...] |
| /external/chromium/base/ |
| linked_list_unittest.cc | 34 // Checks that when iterating |list| (either from head to tail, or from
37 void ExpectListContentsForDirection(const LinkedList<Node>& list,
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
41 node != list.end();
51 void ExpectListContents(const LinkedList<Node>& list,
56 ExpectListContentsForDirection(list, num_nodes, node_ids, true);
60 ExpectListContentsForDirection(list, num_nodes, node_ids, false);
65 LinkedList<Node> list; local
66 EXPECT_EQ(list.end(), list.head())
72 LinkedList<Node> list; local
107 LinkedList<Node> list; local
182 LinkedList<Node> list; local
219 LinkedList<Node> list; local
[all...] |
| /external/chromium_org/base/containers/ |
| linked_list_unittest.cc | 34 // Checks that when iterating |list| (either from head to tail, or from
37 void ExpectListContentsForDirection(const LinkedList<Node>& list,
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
41 node != list.end();
51 void ExpectListContents(const LinkedList<Node>& list,
56 ExpectListContentsForDirection(list, num_nodes, node_ids, true);
60 ExpectListContentsForDirection(list, num_nodes, node_ids, false);
65 LinkedList<Node> list; local
66 EXPECT_EQ(list.end(), list.head())
72 LinkedList<Node> list; local
107 LinkedList<Node> list; local
182 LinkedList<Node> list; local
219 LinkedList<Node> list; local
[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/qemu/android/utils/ |
| list.h | 17 /* Encapsulates a double-linked, circular list.
18 * The list is organized in the following way:
19 * - List entries contain references to the next, and the previous entry in the
20 * list.
21 * - The list is circular, i.e. the "last" list entry references the "list head"
22 * in its 'next' reference, and the "list head" references the "last" entry in
24 * - The list is empty if its 'next' and 'previous' references are addressing the
25 * head of the list
[all...] |
| /external/chromium/net/websockets/ |
| websocket_net_log_params_unittest.cc | 14 ListValue* list = new ListValue(); local
15 list->Append(new StringValue("GET /demo HTTP/1.1"));
16 list->Append(new StringValue("Host: example.com"));
17 list->Append(new StringValue("Connection: Upgrade"));
18 list->Append(new StringValue("Sec-WebSocket-Key2: 12998 5 Y3 1 .P00"));
19 list->Append(new StringValue("Sec-WebSocket-Protocol: sample"));
20 list->Append(new StringValue("Upgrade: WebSocket"));
21 list->Append(new StringValue("Sec-WebSocket-Key1: 4 @1 46546xW%0l 1 5"));
22 list->Append(new StringValue("Origin: http://example.com"));
23 list->Append(new StringValue(""))
[all...] |
