| /system/bt/osi/src/ |
| D | list.c | 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)); in list_new_internal() local
26 if (!list) in list_new_internal()
29 list->free_cb = callback; in list_new_internal()
30 list->allocator = zeroed_allocator; in list_new_internal()
31 return list; in list_new_internal()
38 void list_free(list_t *list) { in list_free() argument
39 if (!list) in list_free()
42 list_clear(list); in list_free()
43 list->allocator->free(list); in list_free()
[all …]
|
| D | fixed_queue.c | 31 list_t *list; member
52 ret->list = list_new(NULL); in fixed_queue_new()
53 if (!ret->list) in fixed_queue_new()
78 …for (const list_node_t *node = list_begin(queue->list); node != list_end(queue->list); node = list… in fixed_queue_free()
81 list_free(queue->list); in fixed_queue_free()
92 bool is_empty = list_is_empty(queue->list); in fixed_queue_is_empty()
111 list_append(queue->list, data); in fixed_queue_enqueue()
123 void *ret = list_front(queue->list); in fixed_queue_dequeue()
124 list_remove(queue->list, ret); in fixed_queue_dequeue()
140 list_append(queue->list, data); in fixed_queue_try_enqueue()
[all …]
|
| D | hash_map.c | 28 list_t *list; member
118 list_t *hash_bucket_list = hash_map->bucket[hash_key].list; in hash_map_has_key()
130 if (hash_map->bucket[hash_key].list == NULL) { in hash_map_set()
131 hash_map->bucket[hash_key].list = list_new_internal(bucket_free_, hash_map->allocator); in hash_map_set()
132 if (hash_map->bucket[hash_key].list == NULL) in hash_map_set()
135 list_t *hash_bucket_list = hash_map->bucket[hash_key].list; in hash_map_set()
161 list_t *hash_bucket_list = hash_map->bucket[hash_key].list; in hash_map_erase()
177 list_t *hash_bucket_list = hash_map->bucket[hash_key].list; in hash_map_get()
190 if (hash_map->bucket[i].list == NULL) in hash_map_clear()
192 list_free(hash_map->bucket[i].list); in hash_map_clear()
[all …]
|
| /system/bt/osi/test/ |
| D | list_test.cpp | 13 list_t *list = list_new(NULL); in TEST_F() local
14 ASSERT_TRUE(list != NULL); in TEST_F()
15 list_free(list); in TEST_F()
24 list_t *list = list_new(NULL); in TEST_F() local
25 EXPECT_TRUE(list_is_empty(list)); in TEST_F()
26 list_free(list); in TEST_F()
30 list_t *list = list_new(NULL); in TEST_F() local
31 EXPECT_EQ(list_length(list), 0U); in TEST_F()
32 list_free(list); in TEST_F()
36 list_t *list = list_new(NULL); in TEST_F() local
[all …]
|
| /system/bt/osi/include/ |
| D | list.h | 25 void list_free(list_t *list);
29 bool list_is_empty(const list_t *list);
33 bool list_contains(const list_t *list, const void *data);
36 size_t list_length(const list_t *list);
40 void *list_front(const list_t *list);
44 void *list_back(const list_t *list);
51 bool list_insert_after(list_t *list, list_node_t *prev_node, void *data);
57 bool list_prepend(list_t *list, void *data);
63 bool list_append(list_t *list, void *data);
70 bool list_remove(list_t *list, void *data);
[all …]
|
| /system/core/include/cutils/ |
| D | list.h | 41 #define list_for_each(node, list) \ argument
42 for (node = (list)->next; node != (list); node = node->next)
44 #define list_for_each_reverse(node, list) \ argument
45 for (node = (list)->prev; node != (list); node = node->prev)
47 #define list_for_each_safe(node, n, list) \ argument
48 for (node = (list)->next, n = node->next; \
49 node != (list); \
80 #define list_empty(list) ((list) == (list)->next) argument
81 #define list_head(list) ((list)->next) argument
82 #define list_tail(list) ((list)->prev) argument
|
| /system/extras/ext4_utils/ |
| D | allocate.c | 59 alloc->list.first = NULL; in create_allocation()
60 alloc->list.last = NULL; in create_allocation()
63 alloc->list.iter = NULL; in create_allocation()
64 alloc->list.partial_iter = 0; in create_allocation()
91 static void region_list_remove(struct region_list *list, struct region *reg) in region_list_remove() argument
99 if (list->first == reg) in region_list_remove()
100 list->first = reg->next; in region_list_remove()
102 if (list->last == reg) in region_list_remove()
103 list->last = reg->prev; in region_list_remove()
109 static void region_list_append(struct region_list *list, struct region *reg) in region_list_append() argument
[all …]
|
| /system/extras/showslab/ |
| D | showslab.c | 160 static void free_slablist(struct slab_info *list) in free_slablist() argument
162 while (list) { in free_slablist()
163 struct slab_info *temp = list->next; in free_slablist()
164 free(list); in free_slablist()
165 list = temp; in free_slablist()
171 struct slab_info list; in merge_objs() local
172 struct slab_info *p = &list; in merge_objs()
187 return list.next; in merge_objs()
193 static struct slab_info *slabsort(struct slab_info *list) in slabsort() argument
197 if (!list || !list->next) in slabsort()
[all …]
|
| /system/core/toolbox/ |
| D | ls.c | 75 void strlist_init( strlist_t *list ) { in strlist_init() argument
76 list->count = list->capacity = 0; in strlist_init()
77 list->items = NULL; in strlist_init()
82 void strlist_append_b( strlist_t *list, const void* str, size_t slen ) { in strlist_append_b() argument
86 if (list->count >= list->capacity) in strlist_append_b()
87 dynarray_reserve_more(list, 1); in strlist_append_b()
88 list->items[list->count++] = copy; in strlist_append_b()
92 void strlist_append_dup( strlist_t *list, const char *str) { in strlist_append_dup() argument
93 strlist_append_b(list, str, strlen(str)); in strlist_append_dup()
97 void strlist_done( strlist_t *list ) { in strlist_done() argument
[all …]
|
| D | NOTICE | 24 notice, this list of conditions and the following disclaimer.
26 notice, this list of conditions and the following disclaimer in
52 notice, this list of conditions and the following disclaimer.
54 notice, this list of conditions and the following disclaimer in the
81 notice, this list of conditions and the following disclaimer.
83 notice, this list of conditions and the following disclaimer in the
113 notice, this list of conditions and the following disclaimer.
115 notice, this list of conditions and the following disclaimer in the
142 notice, this list of conditions and the following disclaimer.
144 notice, this list of conditions and the following disclaimer in the
[all …]
|
| /system/core/logd/ |
| D | LogWhiteBlackList.cpp | 92 PruneCollection *list; in init() local
110 list = &mNaughty; in init()
112 list = &mNice; in init()
143 PruneCollection::iterator it = list->begin(); in init()
144 while (it != list->end()) { in init()
152 it = list->erase(it); in init()
159 list->insert(it, new Prune(uid,pid)); in init()
165 if (it == list->end()) { in init()
166 list->push_back(new Prune(uid,pid)); in init()
|
| D | event.logtags | 23 # 4: list
25 # The data unit is a number taken from the following list:
|
| /system/extras/latencytop/ |
| D | latencytop.c | 44 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 …
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) { in read_global_stats() argument
195 e = read_latency_file(f, list); in read_global_stats()
202 static struct latency_entry *read_process_stats(struct latency_entry *list, int erase, int pid) { in read_process_stats() argument
217 e = list; in read_process_stats()
232 static struct latency_entry *read_thread_stats(struct latency_entry *list, int erase, int pid, int … in read_thread_stats() argument
247 return list; in read_thread_stats()
[all …]
|
| /system/core/adb/ |
| D | adb_auth_client.cpp | 54 static void read_keys(const char *file, struct listnode *list) in read_keys() argument
93 list_add_tail(list, &key->node); in read_keys()
99 static void free_keys(struct listnode *list) in free_keys() argument
103 while (!list_empty(list)) { in free_keys()
104 item = list_head(list); in free_keys()
110 static void load_keys(struct listnode *list) in load_keys() argument
116 list_init(list); in load_keys()
121 read_keys(path, list); in load_keys()
|
| D | fdevent.cpp | 472 fdevent *list = &list_pending; in fdevent_plist_enqueue() local
474 node->next = list; in fdevent_plist_enqueue()
475 node->prev = list->prev; in fdevent_plist_enqueue()
477 list->prev = node; in fdevent_plist_enqueue()
490 fdevent *list = &list_pending; in fdevent_plist_dequeue() local
491 fdevent *node = list->next; in fdevent_plist_dequeue()
493 if(node == list) return 0; in fdevent_plist_dequeue()
495 list->next = node->next; in fdevent_plist_dequeue()
496 list->next->prev = list; in fdevent_plist_dequeue()
|
| /system/core/base/ |
| D | strings_test.cpp | 105 std::vector<std::string> list = {}; in TEST() local
106 ASSERT_EQ("", android::base::Join(list, ',')); in TEST()
110 std::vector<std::string> list = {"foo"}; in TEST() local
111 ASSERT_EQ("foo", android::base::Join(list, ',')); in TEST()
115 std::vector<std::string> list = {"foo", "bar", "baz"}; in TEST() local
116 ASSERT_EQ("foo,bar,baz", android::base::Join(list, ',')); in TEST()
120 std::vector<std::string> list = {",", ","}; in TEST() local
121 ASSERT_EQ(",,,", android::base::Join(list, ',')); in TEST()
|
| /system/core/logcat/tests/ |
| D | logcat_test.cpp | 659 static bool get_white_black(char **list) { in get_white_black() argument
671 char *hold = *list; in get_white_black()
684 asprintf(list, "%s %s", hold, buf); in get_white_black()
687 asprintf(list, "%s", buf); in get_white_black()
691 return *list != NULL; in get_white_black()
694 static bool set_white_black(const char *list) { in set_white_black() argument
699 snprintf(buffer, sizeof(buffer), "logcat -P '%s' 2>&1", list ? list : ""); in set_white_black()
726 char *list = NULL; in TEST() local
729 get_white_black(&list); in TEST()
745 ASSERT_EQ(true, set_white_black(list)); in TEST()
[all …]
|
| /system/core/toolbox/upstream-netbsd/usr.bin/grep/ |
| D | queue.c | 50 STAILQ_ENTRY(qentry) list;
72 STAILQ_INSERT_TAIL(&queue, item, list); in enqueue()
90 STAILQ_REMOVE_HEAD(&queue, list); in dequeue()
|
| /system/netd/server/ |
| D | BandwidthController.h | 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;
|
| /system/vold/ |
| D | VolumeManager.h | 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;
|
| D | Disk.h | 68 void listVolumes(VolumeBase::Type type, std::list<std::string>& list);
|
| D | TrimTask.h | 42 std::list<std::string> mPaths;
|
| /system/security/keystore/ |
| D | keystore_cli.cpp | 166 static int list(sp<IKeystoreService> service, const String16& name, int uid) { in list() function
168 int32_t ret = service->list(name, uid, &matches); in list()
215 return list(service, argc < 3 ? String16("") : String16(argv[2]), in main()
|
| /system/core/liblog/ |
| D | event.logtags | 23 # 4: list
25 # The data unit is a number taken from the following list:
|
| /system/extras/tests/net_test/ |
| D | cstruct.py | 79 super(CStruct, self).__setattr__("_values", list(values))
83 values = list(struct.unpack(self._format, data))
|