/external/stlport/test/unit/ |
H A D | list_header_test.cpp | 8 #include <list>
|
/external/clang/test/CodeGen/ |
H A D | 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 };
|
H A D | 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*)mallo [all...] |
/external/v8/test/cctest/ |
H A D | 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); 65 list 145 List<int>* list = new List<int>(0); local [all...] |
H A D | test-ast.cc | 7 // notice, this list of conditions and the following disclaimer. 9 // copyright notice, this list of conditions and the following 39 List<AstNode*>* list = new List<AstNode*>(0); local 40 CHECK_EQ(0, list->length()); 45 list->Add(node); 46 CHECK_EQ(1, list->length()); 47 CHECK_EQ(node, list->at(0)); 48 CHECK_EQ(node, list->last()); 52 list->Add(node); 54 CHECK_EQ(1 + kElements, list [all...] |
/external/qemu/ |
H A D | notify.c | 17 void notifier_list_init(NotifierList *list) argument 19 QTAILQ_INIT(&list->notifiers); 22 void notifier_list_add(NotifierList *list, Notifier *notifier) argument 24 QTAILQ_INSERT_HEAD(&list->notifiers, notifier, node); 27 void notifier_list_remove(NotifierList *list, Notifier *notifier) argument 29 QTAILQ_REMOVE(&list->notifiers, notifier, node); 32 void notifier_list_notify(NotifierList *list) argument 36 QTAILQ_FOREACH_SAFE(notifier, &list->notifiers, node, next) {
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
H A D | ListExtensions.cs | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 47 public static bool add( this IList list, object value ) argument 49 int count = list.Count; 50 list.Add( value ); 51 return list.Count == count + 1; 55 public static void add<T>( this ICollection<T> list, T value ) argument 57 list.Add( value ); 61 public static void add<T>( this List<T> list, T value ) argument 63 list 67 add( this IList list, int index, object value ) argument 73 addAll( this List<object> list, IEnumerable items ) argument 79 addAll( this IList list, IEnumerable items ) argument 85 addAll( this ICollection<T> list, IEnumerable<T> items ) argument 93 addElement( this List<object> list, object value ) argument 105 contains( this IList list, object value ) argument 111 contains( this ICollection<T> list, T value ) argument 117 elementAt( this IList<T> list, int index ) argument 123 get( this IList list, int index ) argument 129 get( this IList<T> list, int index ) argument 136 get( this List<T> list, int index ) argument 142 remove( this IList list, int index ) argument 150 remove( this IList<T> list, T item ) argument 156 set( this IList list, int index, object value ) argument 162 set( this IList<T> list, int index, T value ) argument 168 set( this List<T> list, int index, T value ) argument 174 setSize( this List<T> list, int size ) argument 206 subList( this IList list, int fromIndex, int toIndex ) argument 217 subList( this IList<T> list, int fromIndex, int toIndex ) argument 227 subList( this List<T> list, int fromIndex, int toIndex ) argument [all...] |
/external/mesa3d/src/mesa/main/ |
H A D | 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) [all...] |
/external/bluetooth/glib/gio/xdgmime/ |
H A D | 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) argument 80 if (list->aliases) 82 for (i = 0; i < list->n_aliases; i++) 84 free (list->aliases[i].alias); 85 free (list 99 _xdg_mime_alias_list_lookup(XdgAliasList *list, const char *alias) argument 120 _xdg_mime_alias_read_from_file(XdgAliasList *list, const char *file_name) argument 169 _xdg_mime_alias_list_dump(XdgAliasList *list) argument [all...] |
H A D | 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) argument 79 if (list->icons) 81 for (i = 0; i < list->n_icons; i++) 83 free (list->icons[i].mime_type); 84 free (list 98 _xdg_mime_icon_list_lookup(XdgIconList *list, const char *mime_type) argument 119 _xdg_mime_icon_read_from_file(XdgIconList *list, const char *file_name) argument 168 _xdg_mime_icon_list_dump(XdgIconList *list) argument [all...] |
H A D | 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) argument 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 104 _xdg_mime_parent_list_lookup(XdgParentList *list, const char *mime) argument 125 _xdg_mime_parent_read_from_file(XdgParentList *list, const char *file_name) argument 204 _xdg_mime_parent_list_dump(XdgParentList *list) argument [all...] |
/external/bluetooth/glib/glib/ |
H A D | 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) argument 65 g_slice_free_chain (GList, list, next); 70 * @list: a #GList element 76 g_list_free_1 (GList *list) argument 116 g_list_append(GList *list, gpointer data) argument 164 g_list_prepend(GList *list, gpointer data) argument 199 g_list_insert(GList *list, gpointer data, gint position) argument 241 g_list_insert_before(GList *list, GList *sibling, gpointer data) argument 330 g_list_remove(GList *list, gconstpointer data) argument 371 g_list_remove_all(GList *list, gconstpointer data) argument 399 _g_list_remove_link(GList *list, GList *link) argument 431 g_list_remove_link(GList *list, GList *llink) argument 449 g_list_delete_link(GList *list, GList *link_) argument 473 g_list_copy(GList *list) argument 510 g_list_reverse(GList *list) argument 537 g_list_nth(GList *list, guint n) argument 557 g_list_nth_prev(GList *list, guint n) argument 577 g_list_nth_data(GList *list, guint n) argument 598 g_list_find(GList *list, gconstpointer data) argument 628 g_list_find_custom(GList *list, gconstpointer data, GCompareFunc func) argument 657 g_list_position(GList *list, GList *llink) argument 686 g_list_index(GList *list, gconstpointer data) argument 713 g_list_last(GList *list) argument 734 g_list_first(GList *list) argument 759 g_list_length(GList *list) argument 782 g_list_foreach(GList *list, GFunc func, gpointer user_data) argument 795 g_list_insert_sorted_real(GList *list, gpointer data, GFunc func, gpointer user_data) argument 860 g_list_insert_sorted(GList *list, gpointer data, GCompareFunc func) argument 884 g_list_insert_sorted_with_data(GList *list, gpointer data, GCompareDataFunc func, gpointer user_data) argument 898 GList list, *l, *lprev; local 929 g_list_sort_real(GList *list, GFunc compare_func, gpointer user_data) argument 972 g_list_sort(GList *list, GCompareFunc compare_func) argument 991 g_list_sort_with_data(GList *list, GCompareDataFunc compare_func, gpointer user_data) argument [all...] |
H A D | 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...] |
H A D | 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) argument 60 g_slice_free_chain (GSList, list, next); 65 * @list: a #GSList element 71 g_slist_free_1 (GSList *list) argument 73 _g_slist_free1 (list); 78 * @list: a #GSList 81 * Adds a new element on to the end of the list 111 g_slist_append(GSList *list, gpointer data) argument 155 g_slist_prepend(GSList *list, gpointer data) argument 181 g_slist_insert(GSList *list, gpointer data, gint position) argument 313 g_slist_remove(GSList *list, gconstpointer data) argument 351 g_slist_remove_all(GSList *list, gconstpointer data) argument 382 _g_slist_remove_link(GSList *list, GSList *link) argument 424 g_slist_remove_link(GSList *list, GSList *link_) argument 442 g_slist_delete_link(GSList *list, GSList *link_) argument 466 g_slist_copy(GSList *list) argument 500 g_slist_reverse(GSList *list) argument 528 g_slist_nth(GSList *list, guint n) argument 548 g_slist_nth_data(GSList *list, guint n) argument 569 g_slist_find(GSList *list, gconstpointer data) argument 600 g_slist_find_custom(GSList *list, gconstpointer data, GCompareFunc func) argument 628 g_slist_position(GSList *list, GSList *llink) argument 657 g_slist_index(GSList *list, gconstpointer data) argument 688 g_slist_last(GSList *list) argument 713 g_slist_length(GSList *list) argument 736 g_slist_foreach(GSList *list, GFunc func, gpointer user_data) argument 749 g_slist_insert_sorted_real(GSList *list, gpointer data, GFunc func, gpointer user_data) argument 816 g_slist_insert_sorted(GSList *list, gpointer data, GCompareFunc func) argument 840 g_slist_insert_sorted_with_data(GSList *list, gpointer data, GCompareDataFunc func, gpointer user_data) argument 854 GSList list, *l; local 880 g_slist_sort_real(GSList *list, GFunc compare_func, gpointer user_data) argument 923 g_slist_sort(GSList *list, GCompareFunc compare_func) argument 940 g_slist_sort_with_data(GSList *list, GCompareDataFunc compare_func, gpointer user_data) argument [all...] |
/external/chromium/base/ |
H A D | linked_list_unittest.cc | 34 // Checks that when iterating |list| (either from head to tail, or from 37 void ExpectListContentsForDirection(const LinkedList<Node>& list, argument 40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); 41 node != list.end(); 51 void ExpectListContents(const LinkedList<Node>& list, argument 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 72 LinkedList<Node> list; local 107 LinkedList<Node> list; local 182 LinkedList<Node> list; local 219 LinkedList<Node> list; local [all...] |
/external/qemu/android/utils/ |
H A D | list.h | 17 /* Encapsulates a double-linked, circular list. 18 * The list is organized in the following way: 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. 29 /* Next entry in the list */ 37 alist_init(ACList* list) argument 44 alist_is_empty(const ACList* list) argument 51 alist_insert_head(ACList* list, ACList* entry) argument 61 alist_insert_tail(ACList* list, ACList* entry) argument 85 alist_remove_head(ACList* list) argument 100 alist_remove_tail(ACList* list) argument [all...] |
/external/chromium/net/websockets/ |
H A D | 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 [all...] |
/external/srec/seti/sltsEngine/src/ |
H A D | 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) argument 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 192 Delete(LList *list) argument [all...] |
/external/wpa_supplicant_8/hostapd/src/utils/ |
H A D | list.h | 2 * Doubly-linked list 13 * struct dl_list - Doubly-linked list 20 static inline void dl_list_init(struct dl_list *list) argument 22 list->next = list; 23 list->prev = list; 26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 28 item->next = list->next; 29 item->prev = list; 34 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 47 dl_list_empty(struct dl_list *list) argument 52 dl_list_len(struct dl_list *list) argument [all...] |
/external/wpa_supplicant_8/src/utils/ |
H A D | list.h | 2 * Doubly-linked list 13 * struct dl_list - Doubly-linked list 20 static inline void dl_list_init(struct dl_list *list) argument 22 list->next = list; 23 list->prev = list; 26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 28 item->next = list->next; 29 item->prev = list; 34 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 47 dl_list_empty(struct dl_list *list) argument 52 dl_list_len(struct dl_list *list) argument [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/utils/ |
H A D | list.h | 2 * Doubly-linked list 13 * struct dl_list - Doubly-linked list 20 static inline void dl_list_init(struct dl_list *list) argument 22 list->next = list; 23 list->prev = list; 26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 28 item->next = list->next; 29 item->prev = list; 34 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 47 dl_list_empty(struct dl_list *list) argument 52 dl_list_len(struct dl_list *list) argument [all...] |
/external/webkit/Source/WebKit2/UIProcess/API/C/ |
H A D | 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, unsigne [all...] |
/external/dbus/bus/ |
H A D | expirelist.c | 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 */ 70 list, NULL); 71 if (list 93 bus_expire_list_free(BusExpireList *list) argument 129 bus_expire_list_recheck_immediately(BusExpireList *list) argument 137 do_expiration_with_current_time(BusExpireList *list, long tv_sec, long tv_usec) argument 198 bus_expirelist_expire(BusExpireList *list) argument 219 BusExpireList *list = data; local 230 bus_expire_list_remove_link(BusExpireList *list, DBusList *link) argument 237 bus_expire_list_remove(BusExpireList *list, BusExpireItem *item) argument 244 bus_expire_list_unlink(BusExpireList *list, DBusList *link) argument 251 bus_expire_list_add(BusExpireList *list, BusExpireItem *item) argument 264 bus_expire_list_add_link(BusExpireList *list, DBusList *link) argument 276 bus_expire_list_get_first_link(BusExpireList *list) argument 282 bus_expire_list_get_next_link(BusExpireList *list, DBusList *link) argument 289 bus_expire_list_contains_item(BusExpireList *list, BusExpireItem *item) argument 304 test_expire_func(BusExpireList *list, DBusList *link, void *data) argument 335 BusExpireList *list; local [all...] |
/external/dbus/dbus/ |
H A D | 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...] |
/external/webkit/Source/WebKit2/WebProcess/InjectedBundle/API/c/ |
H A D | WKBundleBackForwardList.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 WKBundleBackForwardListItemRef WKBundleBackForwardListCopyItemAtIndex(WKBundleBackForwardListRef list, int index); 39 WK_EXPORT unsigned WKBundleBackForwardListGetBackListCount(WKBundleBackForwardListRef list); 40 WK_EXPORT unsigned WKBundleBackForwardListGetForwardListCount(WKBundleBackForwardListRef list); 42 WK_EXPORT void WKBundleBackForwardListClear(WKBundleBackForwardListRef list);
|