Searched defs:list (Results 1 - 25 of 39) sorted by relevance

12

/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/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 Dlog_event_list.c36 unsigned list[ANDROID_MAX_LIST_NEST_DEPTH + 1]; /* pos for list counter */ member in struct:__anon1617
62 /* Everything is a list */
64 context->list[0] = context->pos + 1;
130 context->list[context->list_nest_depth] = context->pos + 1;
288 if (context->list[context->list_nest_depth] <= 0) {
293 context->storage[context->list[context->list_nest_depth]] =
300 * Logs the list of elements to the event log.
323 /* it'snot a list */
H A Dpmsg_reader.c105 gid_t list[i]; local
107 getgroups(i, list);
109 if (uid_has_log_permission(list[i])) {
110 return last_uid = list[i];
310 /* Initialize name list */
/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/connectivity/shill/net/
H A Dattribute_list.h68 // Prints the attribute list with each attribute using no less than 1 line.
80 // Decode an attribute list starting from |offset| within |payload|. Use
160 explicit AttributeIdIterator(const AttributeList& list) argument
161 : iter_(list.attributes_.begin()),
162 end_(list.attributes_.end()) {
H A Dnetlink_message_unittest.cc477 vector<uint32_t>list; local
478 EXPECT_TRUE(GetScanFrequenciesFromMessage(*message, &list));
479 EXPECT_EQ(list.size(), arraysize(kScanFrequencyTrigger));
481 vector<uint32_t>::const_iterator j = list.begin();
482 while (j != list.end()) {
530 vector<uint32_t>list; local
531 EXPECT_TRUE(GetScanFrequenciesFromMessage(*message, &list));
532 EXPECT_EQ(arraysize(kScanFrequencyResults), list.size());
534 vector<uint32_t>::const_iterator j = list.begin();
535 while (j != list
[all...]
H A Dnetlink_attribute.cc891 const AttributeListRefPtr& list,
902 templates.cbegin()->second, list));
907 templates, list));
914 const AttributeListRefPtr& list, int id, const ByteString& value) {
918 array_template, attribute_name, list, id, value);
924 const AttributeListRefPtr& list, int id, const ByteString& value) {
932 nested_template, nested_template.attribute_name, list, id, value);
938 const string& attribute_name, const AttributeListRefPtr& list,
940 CHECK(list);
943 list
890 InitNestedFromValue( const AttributeListRefPtr& list, const NetlinkNestedAttribute::NestedData::NestedDataMap& templates, const ByteString& value) argument
912 AddAttributeToNestedArray( const NetlinkNestedAttribute::NestedData& array_template, const AttributeListRefPtr& list, int id, const ByteString& value) argument
922 AddAttributeToNestedMap( const NetlinkNestedAttribute::NestedData::NestedDataMap& templates, const AttributeListRefPtr& list, int id, const ByteString& value) argument
936 AddAttributeToNestedInner( const NetlinkNestedAttribute::NestedData& nested_template, const string& attribute_name, const AttributeListRefPtr& list, int id, const ByteString& value) argument
[all...]
/system/security/keystore/
H A Dkeystore_cli.cpp196 static int list(sp<IKeystoreService> service, const String16& name, int uid) { function
198 int32_t ret = service->list(name, uid, &matches);
200 fprintf(stderr, "list: could not connect: %d\n", ret);
203 fprintf(stderr, "list: %s (%d)\n", responses[ret], ret);
244 if (strcmp(argv[1], "list") == 0) {
245 return list(service, argc < 3 ? String16("") : String16(argv[2]),
/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/btif/src/
H A Dbtif_sock_sdp.c100 // Adds a protocol list and service name (if provided) to an SDP record given by
104 // at the end of the protocol list.
112 // Setup the protocol list and add it.
143 uint16_t list = UUID_SERVCLASS_PUBLIC_BROWSE_GROUP; local
145 if (!SDP_AddUuidSequence(sdp_handle, ATTR_ID_BROWSE_GROUP_LIST, 1, &list))
/system/bt/osi/src/
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...]
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...]
/system/core/libcutils/
H A Dandroid_reboot.c34 #include <cutils/list.h>
41 struct listnode list; member in struct:__anon1611
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/extras/ext4_utils/
H A Dallocate.h40 struct region_list list; member in struct:block_allocation
96 void region_list_append(struct region_list *list, struct region *reg);
/system/connectivity/shill/
H A Dkey_file_store.cc360 vector<const char*> list; local
362 list.push_back(string_entry.c_str());
367 list.data(),
368 list.size());
/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);
H A Dadb_auth_host.cpp38 #include <cutils/list.h>
263 static int read_key(const char *file, struct listnode *list) argument
285 list_add_tail(list, &key->node);
310 static int get_user_key(struct listnode *list) argument
331 return read_key(path, list);
H A Dsockets.cpp49 /* the the list of currently closing local sockets.
57 // Parse the global list of sockets to find one with id |local_id|.
78 static void insert_local_socket(asocket* s, asocket* list) { argument
79 s->next = list;
113 ** the list out from under you, your options are limited.
185 // be sure to hold the socket list lock when calling this
239 /* otherwise, put on the closing list
352 ** socket will be placed on the closing socket 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/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/bt/stack/gatt/
H A Dgatt_sr.c157 list_t *list = NULL; local
160 list = fixed_queue_get_list(p_cmd->multi_rsp_q);
165 if (list != NULL) {
167 node = list_begin(list);
170 if (node != list_end(list))
/system/core/logcat/tests/
H A Dlogcat_test.cpp420 // duplicate test for get_size, but use comma-separated list of buffers
934 static bool get_white_black(char **list) { argument
946 char *hold = *list;
959 asprintf(list, "%s %s", hold, buf);
962 asprintf(list, "%s", buf);
966 return *list != NULL;
969 static bool set_white_black(const char *list) { argument
974 snprintf(buffer, sizeof(buffer), "logcat -P '%s' 2>&1", list ? list : "");
1001 char *list local
[all...]

Completed in 548 milliseconds

12