| /external/e2fsprogs/tests/f_badorphan/ |
| name | 1 corrupted orphan list
|
| /frameworks/base/tests/CoreTests/android/core/ |
| LinkedListTest.java | 49 LinkedList<Integer> list = new LinkedList(); local
51 list.add(i);
52 list.add(i);
53 list.add(i);
54 list.add(i);
55 list.add(i);
56 list.add(i);
57 list.add(i);
58 list.add(i);
59 list.add(i)
65 LinkedList<Integer> list = new LinkedList(); local
82 LinkedList<Integer> list = mLinkedList; local
98 LinkedList<Integer> list = mLinkedList; local
116 LinkedList<Integer> list = mLinkedList; local
133 LinkedList<Integer> list = mLinkedList; local
151 LinkedList<Integer> list = mLinkedList; local
167 LinkedList<Integer> list = mLinkedList; local
185 LinkedList<Integer> list = mLinkedList; local
203 LinkedList<Integer> list = mLinkedList; local
220 LinkedList<Integer> list = new LinkedList(mLinkedList); local
237 LinkedList<Integer> list = new LinkedList(mLinkedList); local
254 LinkedList<Integer> list = new LinkedList(mLinkedList); local
271 LinkedList<Integer> list = new LinkedList(mLinkedList); local
289 LinkedList<Integer> list = new LinkedList(); local
305 LinkedList<String> list; local
331 LinkedList<Integer> list = mLinkedList; local
348 LinkedList<Integer> list = mLinkedList; local
365 LinkedList<Integer> list = mLinkedList; local
382 LinkedList<Integer> list = mLinkedList; local
399 LinkedList<Integer> list = mLinkedList; local
416 LinkedList<Integer> list = mLinkedList; local
432 LinkedList<Integer> list = new LinkedList(); local
449 LinkedList<Integer> list = mLinkedList; local
466 LinkedList<Integer> list = new LinkedList(mLinkedList); local
482 LinkedList<Integer> list = new LinkedList(); local
498 LinkedList<Integer> list = new LinkedList(); local
515 LinkedList<Integer> list = mLinkedList; local
[all...] |
| /external/bluetooth/glib/gobject/ |
| marshal-genstrings.pl | 3 open (List, "gmarshal.list");
5 while (<List>) {
|
| /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...] |
| dbus-list.c | 2 /* dbus-list.c Generic linked list utility (internal to D-Bus implementation)
25 #include "dbus-list.h"
30 * @defgroup DBusList Linked list
38 _DBUS_DEFINE_GLOBAL_LOCK (list); variable
41 * @defgroup DBusListInternals Linked list implementation details
58 _DBUS_LOCK (list);
66 _DBUS_UNLOCK (list);
75 _DBUS_UNLOCK (list);
87 _DBUS_UNLOCK (list);
[all...] |
| /external/clearsilver/man/man3/ |
| skipFreeList.3 | 14 skipFreeList - free a skip list.
20 void skipFreeList(skipList list);
25 list - list to free.
28 Release all resources used by <list> including all key/value
31 MT-Level: Safe for unique <list>.
|
| skipDelete.3 | 20 void skipDelete(skipList list, UINT32 key);
25 list - list to delete item from.
30 Delete the item associated with <key> from <list>.
32 MT-Level: Safe if <list> thread-safe.
|
| skipInsert.3 | 20 NEOERR *skipInsert(skipList list, UINT32 key, void *value, int allowUpdate);
25 list - list to add pair to.
32 Inserts the <key>/<value> pair into the <list>.
34 If key is already in list, and <allowUpdate> is true,
37 MT-Level: Safe if <list> thread-safe.
|
| /external/v8/test/cctest/ |
| 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) {
38 List<AstNode*>* list = new List<AstNode*>(0); local
39 CHECK_EQ(0, list->length());
43 list->Add(node);
44 CHECK_EQ(1, list->length());
45 CHECK_EQ(node, list->at(0))
91 List<int>* list = new List<int>(0); local
[all...] |
| 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...] |
| /external/clearsilver/util/ |
| skiplist.c | 61 /* list constants */
62 int threaded; /* TRUE if list needs to be thread safe */
64 INT32 maxLevel; /* max level list can reach */
70 static void readLock(skipList list) {
72 mLock(&list->read);
74 if(list->block)
75 cWait(&list->resume, &list->read);
77 list->readers++;
79 mUnlock(&list->read)
362 skipList list; local
[all...] |
| /dalvik/libcore/support/src/test/java/tests/support/ |
| Support_ListTest.java | 23 import java.util.List;
27 @TestTargetClass(List.class)
30 List<Integer> list; // must contain the Integers 0 to 99 in order field in class:Support_ListTest
36 public Support_ListTest(String p1, List<Integer> l) {
38 list = l;
46 elem = list.get(counter);
51 assertTrue("ListTest - hashCode failed", hashCode == list.hashCode());
53 list.add(50, new Integer(1000));
54 assertTrue("ListTest - a) add with index failed--did not insert", list
[all...] |
| /dalvik/tests/062-character-encodings/ |
| info.txt | 1 Test that the list of character encodings is what we expect.
|
| /external/bluetooth/glib/tests/ |
| list-test.c | 36 GList *list = NULL; local
42 list = g_list_append (list, GINT_TO_POINTER (array[i]));
45 list = g_list_sort (list, sort);
49 p1 = g_list_nth_data (list, i);
50 p2 = g_list_nth_data (list, i+1);
56 g_list_free (list);
62 GList *list = NULL; local
68 list = g_list_append (list, GINT_TO_POINTER (array[i]))
88 GList *list = NULL; local
113 GList *list = NULL; local
141 GList *list = NULL; local
165 GList *list = NULL; local
[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...] |
| /external/bluetooth/glib/glib/ |
| gslist.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
49 void g_slist_free (GSList *list);
50 void g_slist_free_1 (GSList *list);
52 GSList* g_slist_append (GSList *list,
54 GSList* g_slist_prepend (GSList *list,
56 GSList* g_slist_insert (GSList *list,
59 GSList* g_slist_insert_sorted (GSList *list,
62 GSList* g_slist_insert_sorted_with_data (GSList *list,
71 GSList* g_slist_remove (GSList *list,
[all...] |
| 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/e2fsprogs/e2fsck/ |
| profile_helpers.c | 8 * list of sections or relations, or accessing multiple values from a
31 * internal functions used to build up a null-terminated char ** list
35 * purposes to build up the list, which is returned in *ret_list by
38 * The publicly exported interface for freeing char** list is
43 char **list; member in struct:profile_string_list
49 * Initialize the string list abstraction.
51 static errcode_t init_list(struct profile_string_list *list)
53 list->num = 0;
54 list->max = 10;
55 list->list = malloc(list->max * sizeof(char *))
[all...] |
| /bionic/libc/private/isc/ |
| list.h | 1 /* $NetBSD: list.h,v 1.2 2004/05/20 19:51:55 christos Exp $ */
24 #define LIST(type) struct { type *head, *tail; }
25 #define INIT_LIST(list) \
26 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0)
38 #define HEAD(list) ((list).head)
39 #define TAIL(list) ((list).tail)
40 #define EMPTY(list) ((list).head == NULL
[all...] |
| /external/stlport/test/compiler/ |
| movable.cpp | 1 #include <list>
14 list<S> l;
|
| /external/dbus/bus/ |
| expirelist.c | 2 /* expirelist.c List of items that expire
46 BusExpireList *list; local
48 list = dbus_new0 (BusExpireList, 1);
49 if (list == NULL)
52 list->expire_func = expire_func;
53 list->data = data;
54 list->loop = loop;
55 list->expire_after = expire_after;
57 list->timeout = _dbus_timeout_new (100, /* irrelevant */
59 list, NULL)
194 BusExpireList *list = data; local
244 BusExpireList *list; local
[all...] |
| /external/icu4c/common/ |
| ulist.c | 33 static void ulist_addFirstItem(UList *list, UListNode *newItem);
58 * Function called by addItemEndList or addItemBeginList when the first item is added to the list.
61 static void ulist_addFirstItem(UList *list, UListNode *newItem) {
64 list->head = newItem;
65 list->tail = newItem;
66 list->currentIndex = 0;
69 U_CAPI void U_EXPORT2 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) {
72 if (U_FAILURE(*status) || list == NULL || data == NULL) {
84 if (list->size == 0) {
85 ulist_addFirstItem(list, newItem)
[all...] |
