Searched refs:list (Results 1 - 25 of 59) sorted by relevance

123

/system/bt/osi/test/
H A Dlist_test.cpp6 #include "list.h"
13 list_t *list = list_new(NULL); local
14 ASSERT_TRUE(list != NULL);
15 list_free(list);
24 list_t *list = list_new(NULL); local
25 EXPECT_TRUE(list_is_empty(list));
26 list_free(list);
30 list_t *list = list_new(NULL); local
31 EXPECT_EQ(list_length(list), 0U);
32 list_free(list);
36 list_t *list = list_new(NULL); local
44 list_t *list = list_new(NULL); local
52 list_t *list = list_new(NULL); local
62 list_t *list = list_new(NULL); local
72 list_t *list = list_new(NULL); local
84 list_t *list = list_new(NULL); local
96 list_t *list = list_new(NULL); local
110 list_t *list = list_new(NULL); local
124 list_t *list = list_new(NULL); local
137 list_t *list = list_new(NULL); local
143 list_t *list = list_new(NULL); local
[all...]
/system/bt/osi/src/
H A Dlist.c4 #include "osi/include/list.h"
20 static list_node_t *list_free_node_(list_t *list, list_node_t *node);
25 list_t *list = (list_t *)zeroed_allocator->alloc(sizeof(list_t)); local
26 if (!list)
29 list->free_cb = callback;
30 list->allocator = zeroed_allocator;
31 return list;
38 void list_free(list_t *list) { argument
39 if (!list)
42 list_clear(list);
46 list_is_empty(const list_t *list) argument
51 list_contains(const list_t *list, const void *data) argument
63 list_length(const list_t *list) argument
68 list_front(const list_t *list) argument
75 list_back(const list_t *list) argument
82 list_insert_after(list_t *list, list_node_t *prev_node, void *data) argument
100 list_prepend(list_t *list, void *data) argument
116 list_append(list_t *list, void *data) argument
136 list_remove(list_t *list, void *data) argument
162 list_clear(list_t *list) argument
171 list_foreach(const list_t *list, list_iter_cb callback) argument
182 list_begin(const list_t *list) argument
187 list_end(UNUSED_ATTR const list_t *list) argument
202 list_free_node_(list_t *list, list_node_t *node) argument
[all...]
H A Dfixed_queue.c25 #include "osi/include/list.h"
31 list_t *list; member in struct:fixed_queue_t
52 ret->list = list_new(NULL);
53 if (!ret->list)
78 for (const list_node_t *node = list_begin(queue->list); node != list_end(queue->list); node = list_next(node))
81 list_free(queue->list);
92 bool is_empty = list_is_empty(queue->list);
111 list_append(queue->list, data);
123 void *ret = list_front(queue->list);
[all...]
H A Dhash_map.c20 #include <list.h>
28 list_t *list; member in struct:hash_map_bucket_t
42 // Hidden constructor for list, only to be used by us.
118 list_t *hash_bucket_list = hash_map->bucket[hash_key].list;
130 if (hash_map->bucket[hash_key].list == NULL) {
131 hash_map->bucket[hash_key].list = list_new_internal(bucket_free_, hash_map->allocator);
132 if (hash_map->bucket[hash_key].list == NULL)
135 list_t *hash_bucket_list = hash_map->bucket[hash_key].list;
161 list_t *hash_bucket_list = hash_map->bucket[hash_key].list;
177 list_t *hash_bucket_list = hash_map->bucket[hash_key].list;
[all...]
/system/bt/osi/include/
H A Dlist.h15 // Returns a new, empty list. Returns NULL if not enough memory could be allocated
16 // for the list structure. The returned list must be freed with |list_free|. The
17 // |callback| specifies a function to be called whenever a list element is removed
18 // from the list. It can be used to release resources held by the list element, e.g.
23 // Frees the list. This function accepts NULL as an argument, in which case it
25 void list_free(list_t *list);
27 // Returns true if |list| is empty (has no elements), false otherwise.
28 // |list| ma
[all...]
/system/core/include/cutils/
H A Dlist.h41 #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 #define list_for_each_safe(node, n, list) \
48 for (node = (list)->next, n = node->next; \
49 node != (list); \
80 #define list_empty(list) ((lis
[all...]
/system/vold/
H A DTrimTask.h23 #include <list>
42 std::list<std::string> mPaths;
H A DDisk.h68 void listVolumes(VolumeBase::Type type, std::list<std::string>& list);
H A DVolumeManager.h26 #include <list>
121 void listVolumes(android::vold::VolumeBase::Type type, std::list<std::string>& list);
208 std::list<std::shared_ptr<DiskSource>> mDiskSources;
209 std::list<std::shared_ptr<android::vold::Disk>> mDisks;
/system/extras/showslab/
H A Dshowslab.c58 * Returns the head of the new list of slab_info structures, or NULL on error.
158 * provided slab_info linked list
160 static void free_slablist(struct slab_info *list) argument
162 while (list) {
163 struct slab_info *temp = list->next;
164 free(list);
165 list = temp;
171 struct slab_info list; local
172 struct slab_info *p = &list;
187 return list
193 slabsort(struct slab_info *list) argument
272 struct slab_info *list, *p; local
[all...]
/system/netd/server/
H A DNatController.h21 #include <list>
39 std::list<std::string> ifacePairList;
H A DBandwidthController.h19 #include <list>
88 * Sends out to the cli the single stat (TetheringStatsReluts) or a list of stats
125 std::list<int /*appUid*/> &specialAppUids,
186 std::list<std::string> sharedQuotaIfaces;
200 std::list<QuotaInfo> quotaIfaces;
201 std::list<int /*appUid*/> naughtyAppUids;
202 std::list<int /*appUid*/> niceAppUids;
H A DNetdConstants.h21 #include <list>
/system/core/init/
H A Dueventd.h20 #include <cutils/list.h>
/system/extras/ext4_utils/
H A Dallocate.c59 alloc->list.first = NULL;
60 alloc->list.last = NULL;
63 alloc->list.iter = NULL;
64 alloc->list.partial_iter = 0;
91 static void region_list_remove(struct region_list *list, struct region *reg) argument
99 if (list->first == reg)
100 list->first = reg->next;
102 if (list->last == reg)
103 list->last = reg->prev;
109 static void region_list_append(struct region_list *list, struc argument
610 advance_list_ptr(struct region_list *list, int blocks) argument
[all...]
/system/core/adb/
H A Dadb_auth_client.cpp26 #include "cutils/list.h"
54 static void read_keys(const char *file, struct listnode *list) argument
93 list_add_tail(list, &key->node);
99 static void free_keys(struct listnode *list) argument
103 while (!list_empty(list)) {
104 item = list_head(list);
110 static void load_keys(struct listnode *list) argument
116 list_init(list);
121 read_keys(path, list);
/system/core/toolbox/
H A Dls.c34 * to/from the list during iteration.
75 void strlist_init( strlist_t *list ) {
76 list->count = list->capacity = 0;
77 list->items = NULL;
82 void strlist_append_b( strlist_t *list, const void* str, size_t slen ) { argument
86 if (list->count >= list->capacity)
87 dynarray_reserve_more(list, 1);
88 list
92 strlist_append_dup( strlist_t *list, const char *str) argument
[all...]
/system/core/toolbox/upstream-netbsd/usr.bin/grep/
H A Dqueue.c11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
50 STAILQ_ENTRY(qentry) list;
72 STAILQ_INSERT_TAIL(&queue, item, list);
90 STAILQ_REMOVE_HEAD(&queue, list);
/system/extras/latencytop/
H A Dlatencytop.c44 static struct latency_entry *read_global_stats(struct latency_entry *list, int erase);
45 static struct latency_entry *read_process_stats(struct latency_entry *list, int erase, int pid);
46 static struct latency_entry *read_thread_stats(struct latency_entry *list, int erase, int pid, int tid, int fatal);
52 static struct latency_entry *read_latency_file(FILE *f, struct latency_entry *list);
175 static struct latency_entry *read_global_stats(struct latency_entry *list, int erase) { argument
195 e = read_latency_file(f, list);
202 static struct latency_entry *read_process_stats(struct latency_entry *list, int erase, int pid) { argument
217 e = list;
232 static struct latency_entry *read_thread_stats(struct latency_entry *list, int erase, int pid, int tid, int fatal) { argument
247 return list;
326 read_latency_file(FILE *f, struct latency_entry *list) argument
[all...]
/system/core/logd/
H A DLogWhiteBlackList.cpp23 // White and Black list
92 PruneCollection *list; local
110 list = &mNaughty;
112 list = &mNice;
142 // insert sequentially into list
143 PruneCollection::iterator it = list->begin();
144 while (it != list->end()) {
152 it = list->erase(it);
159 list->insert(it, new Prune(uid,pid));
165 if (it == list
[all...]
/system/core/base/
H A Dstrings_test.cpp105 std::vector<std::string> list = {}; local
106 ASSERT_EQ("", android::base::Join(list, ','));
110 std::vector<std::string> list = {"foo"}; local
111 ASSERT_EQ("foo", android::base::Join(list, ','));
115 std::vector<std::string> list = {"foo", "bar", "baz"}; local
116 ASSERT_EQ("foo,bar,baz", android::base::Join(list, ','));
120 std::vector<std::string> list = {",", ","}; local
121 ASSERT_EQ(",,,", android::base::Join(list, ','));
/system/extras/perfprofd/quipper/
H A Daddress_mapper.h10 #include <list>
114 typedef std::list<MappedRange> MappingList;
/system/core/logcat/tests/
H A Dlogcat_test.cpp659 static bool get_white_black(char **list) { argument
671 char *hold = *list;
684 asprintf(list, "%s %s", hold, buf);
687 asprintf(list, "%s", buf);
691 return *list != NULL;
694 static bool set_white_black(const char *list) { argument
699 snprintf(buffer, sizeof(buffer), "logcat -P '%s' 2>&1", list ? list : "");
726 char *list = NULL; local
729 get_white_black(&list);
[all...]
/system/security/keystore/
H A Dkeystore_cli.cpp166 static int list(sp<IKeystoreService> service, const String16& name, int uid) { function
168 int32_t ret = service->list(name, uid, &matches);
170 fprintf(stderr, "list: could not connect: %d\n", ret);
173 fprintf(stderr, "list: %s (%d)\n", responses[ret], ret);
214 if (strcmp(argv[1], "list") == 0) {
215 return list(service, argc < 3 ? String16("") : String16(argv[2]),
/system/extras/tests/net_test/
H A Dcstruct.py79 super(CStruct, self).__setattr__("_values", list(values))
83 values = list(struct.unpack(self._format, data))

Completed in 381 milliseconds

123