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

12345

/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_back_node(const list_t *list) argument
89 list_insert_after(list_t *list, list_node_t *prev_node, void *data) argument
107 list_prepend(list_t *list, void *data) argument
123 list_append(list_t *list, void *data) argument
143 list_remove(list_t *list, void *data) argument
169 list_clear(list_t *list) argument
178 list_foreach(const list_t *list, list_iter_cb callback, void *context) argument
191 list_begin(const list_t *list) argument
196 list_end(UNUSED_ATTR const list_t *list) argument
211 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
50 ret->list = list_new(NULL);
51 if (!ret->list)
76 for (const list_node_t *node = list_begin(queue->list); node != list_end(queue->list); node = list_next(node))
79 list_free(queue->list);
91 bool is_empty = list_is_empty(queue->list);
102 size_t length = list_length(queue->list);
121 list_append(queue->list, dat
[all...]
H A Dhash_map.c23 #include "osi/include/list.h"
29 list_t *list; member in struct:hash_map_bucket_t
43 // Hidden constructor for list, only to be used by us.
119 list_t *hash_bucket_list = hash_map->bucket[hash_key].list;
131 if (hash_map->bucket[hash_key].list == NULL) {
132 hash_map->bucket[hash_key].list = list_new_internal(bucket_free_, hash_map->allocator);
133 if (hash_map->bucket[hash_key].list == NULL)
136 list_t *hash_bucket_list = hash_map->bucket[hash_key].list;
162 list_t *hash_bucket_list = hash_map->bucket[hash_key].list;
178 list_t *hash_bucket_list = hash_map->bucket[hash_key].list;
[all...]
/system/bt/osi/test/
H A Dlist_test.cpp6 #include "osi/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
166 list_t *list = list_new(NULL); local
184 list_t *list = list_new(NULL); local
[all...]
/system/bt/osi/include/
H A Dlist.h15 // |data| represents the list item currently being iterated, |context| is a
20 // Returns a new, empty list. Returns NULL if not enough memory could be allocated
21 // for the list structure. The returned list must be freed with |list_free|. The
22 // |callback| specifies a function to be called whenever a list element is removed
23 // from the list. It can be used to release resources held by the list element, e.g.
28 // Frees the list. This function accepts NULL as an argument, in which case it
30 void list_free(list_t *list);
32 // Returns true if |list| i
[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/core/liblog/
H A Dconfig_read.c26 struct listnode *list, struct android_log_transport_read *transport) {
33 if (list_empty(list)) {
35 list_add_tail(list, &transport->node);
39 read_transport_for_each(transp, list) {
46 list_add_tail(list, &transport->node);
25 __android_log_add_transport( struct listnode *list, struct android_log_transport_read *transport) argument
H A Dconfig_write.c26 struct listnode *list, struct android_log_transport_write *transport) {
33 if (list_empty(list)) {
35 list_add_tail(list, &transport->node);
39 write_transport_for_each(transp, list) {
46 list_add_tail(list, &transport->node);
25 __android_log_add_transport( struct listnode *list, struct android_log_transport_write *transport) argument
H A Dlogprint.c32 #include <cutils/list.h>
1031 } *list, *next; local
1034 /* If we do not have a conversion list, build one up */
1128 list = calloc(1, sizeof(struct conversionList));
1129 list_init(&list->node);
1130 list->time = time;
1131 subTimespec(&list->convert, &time, &monotonic);
1132 list_add_tail(&convertHead, &list->node);
1135 list = node_to_item(list_tail(&convertHead),
1139 &list
[all...]
/system/netd/server/
H A DTetherController.h22 #include <list>
29 std::list<std::string> mInterfaces;
33 std::list<std::string> mDnsForwarders;
52 const std::list<std::string> &getDnsForwarders() const;
56 const std::list<std::string> &getTetheredInterfaceList() const;
H A DPppController.h22 #include <list>
24 typedef std::list<char *> TtyCollection;
H A DNatController.h21 #include <list>
40 std::list<std::string> ifacePairList;
/system/vold/
H A DTrimTask.h23 #include <list>
42 std::list<std::string> mPaths;
/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/core/init/
H A Dueventd.h20 #include <cutils/list.h>
/system/extras/ext4_utils/
H A Dallocate.c34 alloc->list.first = NULL;
35 alloc->list.last = NULL;
38 alloc->list.iter = NULL;
39 alloc->list.partial_iter = 0;
66 static void region_list_remove(struct region_list *list, struct region *reg) argument
74 if (list->first == reg)
75 list->first = reg->next;
77 if (list->last == reg)
78 list->last = reg->prev;
84 void region_list_append(struct region_list *list, struc argument
614 advance_list_ptr(struct region_list *list, int blocks) argument
[all...]
/system/connectivity/shill/net/
H A Dattribute_list_unittest.cc74 AttributeListRefPtr list(new AttributeList());
75 EXPECT_TRUE(list->IterateAttributes(
101 AttributeListRefPtr list(new AttributeList());
102 EXPECT_TRUE(list->IterateAttributes(
114 EXPECT_TRUE(list->IterateAttributes(
125 EXPECT_FALSE(list->IterateAttributes(
134 AttributeListRefPtr list(new AttributeList());
135 EXPECT_FALSE(list->IterateAttributes(
143 EXPECT_TRUE(list->IterateAttributes(
152 EXPECT_FALSE(list
[all...]
/system/core/base/
H A Dstrings_test.cpp107 std::vector<std::string> list = {}; local
108 ASSERT_EQ("", android::base::Join(list, ','));
112 std::vector<std::string> list = {"foo"}; local
113 ASSERT_EQ("foo", android::base::Join(list, ','));
117 std::vector<std::string> list = {"foo", "bar", "baz"}; local
118 ASSERT_EQ("foo,bar,baz", android::base::Join(list, ','));
122 std::vector<std::string> list = {",", ","}; local
123 ASSERT_EQ(",,,", android::base::Join(list, ','));
127 std::set<int> list = {1, 2, 3}; local
128 ASSERT_EQ("1,2,3", android::base::Join(list, ','));
132 std::unordered_set<int> list = {1, 2}; local
[all...]
/system/core/adb/
H A Dadb_auth_client.cpp26 #include "cutils/list.h"
55 static void read_keys(const char *file, struct listnode *list) argument
94 list_add_tail(list, &key->node);
100 static void free_keys(struct listnode *list) argument
104 while (!list_empty(list)) {
105 item = list_head(list);
111 static void load_keys(struct listnode *list) argument
117 list_init(list);
122 read_keys(path, list);
/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/libcutils/
H A Dandroid_reboot.c34 #include <cutils/list.h>
41 struct listnode list; member in struct:__anon1608
89 list_add_tail(rw_entries, &item->list);
100 mntent_list* item = node_to_item(node, mntent_list, list);
113 mntent_list* item = node_to_item(node, mntent_list, list);
180 list_remove(&item->list);
181 list_add_tail(&ro_entries, &item->list);
195 mntent_list* item = node_to_item(node, mntent_list, list);
202 mntent_list* item = node_to_item(node, mntent_list, list);
/system/core/logd/
H A DLogWhiteBlackList.cpp24 // White and Black list
121 PruneCollection *list; local
152 list = &mNaughty;
154 list = &mNice;
184 // insert sequentially into list
185 PruneCollection::iterator it = list->begin();
186 while (it != list->end()) {
194 it = list->erase(it);
201 list->insert(it, Prune(uid,pid));
207 if (it == list
[all...]
/system/bt/vendor_libs/test_vendor_lib/include/
H A Dhci_transport.h21 #include <list>
110 std::list<std::unique_ptr<TimeStampedEvent>> outbound_events_;
/system/connectivity/shill/bin/
H A Dwpa_debug49 # separated list of tags
79 --list*)

Completed in 1044 milliseconds

12345