| /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/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)
[all...] |
| test-ast.cc | 7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
37 TEST(List) {
39 List<AstNode*>* list = new List<AstNode*>(0); local
40 CHECK_EQ(0, list->length());
44 list->Add(node);
45 CHECK_EQ(1, list->length());
46 CHECK_EQ(node, list->at(0))
63 List<int>* list = new List<int>(0); local
[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 | 37 #define list_for_each(node, list) \
38 for (node = (list)->next; node != (list); node = node->next)
40 #define list_for_each_reverse(node, list) \
41 for (node = (list)->prev; node != (list); node = node->prev)
43 void list_init(struct listnode *list);
44 void list_add_tail(struct listnode *list, struct listnode *item);
47 #define list_empty(list) ((list) == (list)->next
[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).
46 * Remove an element from list.
57 * Insert an element to the list head.
59 * \param list list.
62 #define insert_at_head(list, elem) \
64 (elem)->prev = list; \
65 (elem)->next = (list)->next; \
66 (list)->next->prev = elem;
[all...] |
| /external/bluetooth/glib/gio/xdgmime/ |
| xdgmimealias.c | 65 XdgAliasList *list; local
67 list = malloc (sizeof (XdgAliasList));
69 list->aliases = NULL;
70 list->n_aliases = 0;
72 return list;
76 _xdg_mime_alias_list_free (XdgAliasList *list)
80 if (list->aliases)
82 for (i = 0; i < list->n_aliases; i++)
84 free (list->aliases[i].alias);
85 free (list->aliases[i].mime_type)
[all...] |
| xdgmimeicon.c | 64 XdgIconList *list; local
66 list = malloc (sizeof (XdgIconList));
68 list->icons = NULL;
69 list->n_icons = 0;
71 return list;
75 _xdg_mime_icon_list_free (XdgIconList *list)
79 if (list->icons)
81 for (i = 0; i < list->n_icons; i++)
83 free (list->icons[i].mime_type);
84 free (list->icons[i].icon_name)
[all...] |
| xdgmimeparent.c | 66 XdgParentList *list; local
68 list = malloc (sizeof (XdgParentList));
70 list->parents = NULL;
71 list->n_mimes = 0;
73 return list;
77 _xdg_mime_parent_list_free (XdgParentList *list)
82 if (list->parents)
84 for (i = 0; i < list->n_mimes; i++)
86 for (p = list->parents[i].parents; *p; p++)
89 free (list->parents[i].parents)
[all...] |
| /external/bluetooth/glib/glib/ |
| glist.c | 22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
42 #define _g_list_free1(list) g_slice_free (GList, list)
52 * @list: a #GList
58 * If list elements contain dynamically-allocated memory,
63 g_list_free (GList *list)
65 g_slice_free_chain (GList, list, next);
70 * @list: a #GList element
76 g_list_free_1 (GList *list)
898 GList list, *l, *lprev; local
[all...] |
| glist.h | 22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
50 void g_list_free (GList *list);
51 void g_list_free_1 (GList *list);
53 GList* g_list_append (GList *list,
55 GList* g_list_prepend (GList *list,
57 GList* g_list_insert (GList *list,
60 GList* g_list_insert_sorted (GList *list,
63 GList* g_list_insert_sorted_with_data (GList *list,
67 GList* g_list_insert_before (GList *list,
[all...] |
| gslist.c | 22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
52 * @list: a #GSList
58 g_slist_free (GSList *list)
60 g_slice_free_chain (GSList, list, next);
65 * @list: a #GSList element
71 g_slist_free_1 (GSList *list)
73 _g_slist_free1 (list);
78 * @list: a #GSList
81 * Adds a new element on to the end of the list
854 GSList list, *l; 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...] |
| /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...] |
| /external/srec/seti/sltsEngine/src/ |
| linklist_impl.c | 33 1. pool of linked list nodes - from static allocated array
121 For now, dynamically allocate a new list node with the data
123 LListResult Insert(LList *list, void *data)
131 if(list->head == NULL){
132 /* if list is empty, assign to head */
133 list->head = newnode;
134 (list->head)->next = NULL;
135 (list->head)->prev = NULL;
138 list->curr = list->head
[all...] |
| /external/wpa_supplicant_8/src/utils/ |
| list.h | 2 * Doubly-linked list
19 * struct dl_list - Doubly-linked list
26 static inline void dl_list_init(struct dl_list *list)
28 list->next = list;
29 list->prev = list;
32 static inline void dl_list_add(struct dl_list *list, struct dl_list *item)
34 item->next = list->next;
35 item->prev = list;
[all...] |
| /external/webkit/Source/WebKit2/UIProcess/API/C/ |
| WKBackForwardList.h | 8 * notice, this list of conditions and the following disclaimer.
10 * notice, this list of conditions and the following disclaimer in the
37 WK_EXPORT WKBackForwardListItemRef WKBackForwardListGetCurrentItem(WKBackForwardListRef list);
38 WK_EXPORT WKBackForwardListItemRef WKBackForwardListGetBackItem(WKBackForwardListRef list);
39 WK_EXPORT WKBackForwardListItemRef WKBackForwardListGetForwardItem(WKBackForwardListRef list);
40 WK_EXPORT WKBackForwardListItemRef WKBackForwardListGetItemAtIndex(WKBackForwardListRef list, int index);
42 WK_EXPORT unsigned WKBackForwardListGetBackListCount(WKBackForwardListRef list);
43 WK_EXPORT unsigned WKBackForwardListGetForwardListCount(WKBackForwardListRef list);
45 WK_EXPORT WKArrayRef WKBackForwardListCopyBackListWithLimit(WKBackForwardListRef list, unsigned limit);
46 WK_EXPORT WKArrayRef WKBackForwardListCopyForwardListWithLimit(WKBackForwardListRef list, unsigned limit)
[all...] |
| /external/dbus/bus/ |
| expirelist.c | 2 /* expirelist.c List of items that expire
33 DBusList *items; /**< List of BusExpireItem */
57 BusExpireList *list; local
59 list = dbus_new0 (BusExpireList, 1);
60 if (list == NULL)
63 list->expire_func = expire_func;
64 list->data = data;
65 list->loop = loop;
66 list->expire_after = expire_after;
68 list->timeout = _dbus_timeout_new (100, /* irrelevant *
219 BusExpireList *list = data; local
335 BusExpireList *list; local
[all...] |
| /external/dbus/dbus/ |
| dbus-list.h | 2 /* dbus-list.h Generic linked list utility (internal to D-Bus implementation)
36 DBusList *prev; /**< Previous list node. */
37 DBusList *next; /**< Next list node. */
40 dbus_bool_t _dbus_list_append (DBusList **list,
42 dbus_bool_t _dbus_list_prepend (DBusList **list,
44 dbus_bool_t _dbus_list_insert_before (DBusList **list,
47 dbus_bool_t _dbus_list_insert_after (DBusList **list,
50 void _dbus_list_insert_before_link (DBusList **list,
53 void _dbus_list_insert_after_link (DBusList **list,
[all...] |
