Searched defs:list (Results 1 - 25 of 37) 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/debuggerd/libdebuggerd/test/
H A Dopen_files_list_test.cpp29 // Check that we can produce a list of open files for the current process, and
32 // Open a temporary file that we can check for in the list of open files.
35 // Get the list of open files for this process.
36 OpenFilesList list; local
37 populate_open_files_list(getpid(), &list); local
39 // Verify our open file is in the list.
41 for (auto& file : list) {
/system/bt/osi/test/
H A Dlist_test.cc7 #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
83 list_t* list = list_new(NULL); local
94 list_t* list = list_new(NULL); local
107 list_t* list = list_new(NULL); local
121 list_t* list = list_new(NULL); local
134 list_t* list = list_new(NULL); local
140 list_t* list = list_new(NULL); local
163 list_t* list = list_new(NULL); local
180 list_t* list = list_new(NULL); local
[all...]
/system/core/debuggerd/libdebuggerd/
H A Dopen_files_list.cpp38 void populate_open_files_list(pid_t pid, OpenFilesList* list) { argument
56 list->emplace_back(fd, target);
59 list->emplace_back(fd, "???");
/system/core/liblog/
H A Dconfig_read.c30 struct listnode* list, struct android_log_transport_read* transport) {
37 if (list_empty(list)) {
39 list_add_tail(list, &transport->node);
43 read_transport_for_each(transp, list) {
49 list_add_tail(list, &transport->node);
29 __android_log_add_transport( struct listnode* list, struct android_log_transport_read* transport) argument
H A Dconfig_write.c30 struct listnode* list, struct android_log_transport_write* transport) {
37 if (list_empty(list)) {
39 list_add_tail(list, &transport->node);
43 write_transport_for_each(transp, list) {
49 list_add_tail(list, &transport->node);
87 * already in the primary list. Otherwise land in the persist list.
29 __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:__anon1572
62 /* Everything is a list */
64 context->list[0] = context->pos + 1;
128 context->list[context->list_nest_depth] = context->pos + 1;
284 if (context->list[context->list_nest_depth] <= 0) {
289 context->storage[context->list[context->list_nest_depth]] =
296 * Logs the list of elements to the event log.
319 /* it's not a list */
352 /* it's not a list */
[all...]
H A Dpmsg_reader.c103 gid_t list[i]; local
105 getgroups(i, list);
107 if (uid_has_log_permission(list[i])) {
108 return last_uid = list[i];
319 /* Initialize name list */
/system/security/keystore/
H A Dkeystore_cli.cpp193 static int list(const sp<IKeystoreService>& service, const String16& name, int uid) { function
195 int32_t ret = service->list(name, uid, &matches);
197 fprintf(stderr, "list: could not connect: %d\n", ret);
200 fprintf(stderr, "list: %s (%d)\n", responses[ret], ret);
241 if (strcmp(argv[1], "list") == 0) {
242 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...]
H A DLogTags.cpp143 // unlikely except for dupes, or updates to uid list (more later)
728 // Add it to the uid list
737 // (system) adding a global one, erase the uid list
846 bool list = !name || all; local
849 if (!list) {
863 // first uid in list so as to manufacture an accurate reference
/system/sepolicy/tools/sepolicy-analyze/
H A Dattribute.c6 fprintf(stderr, "\tattribute [-l|--list] [-r|--reverse] <name>\n");
76 int list = 0; local
81 {"list", no_argument, NULL, 'l'},
89 list = 1;
100 if ((argc != 2 && !(reverse && argc == 3)) || (list && reverse)) {
104 if (list)
/system/bt/osi/src/
H A Dfixed_queue.cc26 #include "osi/include/list.h"
32 list_t* list; member in struct:fixed_queue_t
52 ret->list = list_new(NULL);
53 if (!ret->list) goto error;
74 for (const list_node_t* node = list_begin(queue->list);
75 node != list_end(queue->list); node = list_next(node))
78 list_free(queue->list);
100 return list_is_empty(queue->list);
107 return list_length(queue->list);
124 list_append(queue->list, dat
[all...]
H A Dlist.cc4 #include "osi/include/list.h"
20 static list_node_t* list_free_node_(list_t* list, list_node_t* node);
27 list_t* list = (list_t*)zeroed_allocator->alloc(sizeof(list_t)); local
28 if (!list) return NULL;
30 list->free_cb = callback;
31 list->allocator = zeroed_allocator;
32 return list;
39 void list_free(list_t* list) { argument
40 if (!list) return;
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
105 list_prepend(list_t* list, void* data) argument
119 list_append(list_t* list, void* data) argument
138 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, void* context) argument
184 list_begin(const list_t* list) argument
189 list_end(UNUSED_ATTR const list_t* list) argument
204 list_free_node_(list_t* list, list_node_t* node) argument
[all...]
/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);
H A Dallocate.c35 alloc->list.first = NULL;
36 alloc->list.last = NULL;
39 alloc->list.iter = NULL;
40 alloc->list.partial_iter = 0;
67 static void region_list_remove(struct region_list *list, struct region *reg) argument
75 if (list->first == reg)
76 list->first = reg->next;
78 if (list->last == reg)
79 list->last = reg->prev;
85 void region_list_append(struct region_list *list, struc argument
632 advance_list_ptr(struct region_list *list, int blocks) argument
[all...]
/system/nvram/messages/include/nvram/messages/
H A Dproto.hpp247 // declaration list for |StructType|. Having the index available simplifies
267 FieldSpecList list,
269 return list.kFieldSpec.kFieldNumber > previous_field_number &&
270 CheckFieldNumbersAscending(list.kTail, list.kFieldSpec.kFieldNumber);
286 // in the field declaration list.
266 CheckFieldNumbersAscending( FieldSpecList list, uint32_t previous_field_number) argument
/system/bt/btif/src/
H A Dbtif_sock_sdp.cc90 // Adds a protocol list and service name (if provided) to an SDP record given by
94 // at the end of the protocol list.
102 // Setup the protocol list and add it.
120 uint16_t list = UUID_SERVCLASS_PUBLIC_BROWSE_GROUP; local
135 if (!SDP_AddUuidSequence(sdp_handle, ATTR_ID_BROWSE_GROUP_LIST, 1, &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/hwservicemanager/
H A DServiceManager.cpp267 Return<void> ServiceManager::list(list_cb _hidl_cb) { function in class:android::hidl::manager::implementation::ServiceManager
274 hidl_vec<hidl_string> list; local
276 list.resize(countExistingService());
280 list[idx++] = service->string();
283 _hidl_cb(list);
303 hidl_vec<hidl_string> list; local
312 list.resize(total);
319 list[idx++] = service->getInstanceName();
322 _hidl_cb(list);
412 std::vector<IServiceManager::InstanceDebugInfo> list; local
[all...]
/system/bt/stack/gatt/
H A Dgatt_sr.cc146 list_t* list = NULL; local
149 list = fixed_queue_get_list(p_cmd->multi_rsp_q);
153 if (list != NULL) {
155 node = list_begin(list);
158 if (node != list_end(list)) p_rsp = (tGATTS_RSP*)list_node(node);
H A Dgatt_api.cc39 * Add an service handle range to the list in decending order of the start
173 /** Update the the last primary info for the service list info */
243 tGATT_HDL_LIST_ELEM& list = gatt_add_an_item_to_list(s_hdl); local
244 list.asgn_range.app_uuid128 = *p_app_uuid128;
245 list.asgn_range.svc_uuid = svc_uuid;
246 list.asgn_range.s_handle = s_hdl;
247 list.asgn_range.e_handle = s_hdl + num_handles - 1;
248 list.asgn_range.is_primary = is_pri;
252 (*gatt_cb.cb_info.p_nv_save_callback)(true, &list.asgn_range);
255 gatts_init_service_db(list
[all...]
/system/core/adb/
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/bt/stack/l2cap/
H A Dl2c_fcr.cc1594 // Iterate though list and flush the amount requested from
2393 list_t* list = NULL; local
2395 list = fixed_queue_get_list(p_ccb->fcrb.waiting_for_ack_q);
2396 if (list != NULL) {
2397 for (const list_node_t *node = list_begin(list), xx = 0;
2398 (node != list_end(list)) && (xx < num_bufs_acked);

Completed in 1659 milliseconds

12