/system/core/libmemunreachable/ |
H A D | LeakFolding.h | 46 Node<SCCInfo> node; member in struct:LeakFolding::SCCInfo 57 explicit SCCInfo(Allocator<SCCInfo> allocator) : node(this, allocator), 67 Node<LeakInfo> node; member in struct:LeakFolding::LeakInfo 74 : node(this, allocator), range(range),
|
H A D | Allocator.cpp | 440 LinkedList<Chunk*> *node = head; 442 while (node->next() != head && node->data() != nullptr 443 && node->data()->free_count() < chunk->free_count()) 444 node = node->next(); 446 node->insert(chunk->node_);
|
/system/core/liblog/ |
H A D | logger_read.c | 44 list_remove(&logger_internal->node); 58 struct listnode* node; local 80 node = (logger_list->mode & ANDROID_LOG_PSTORE) 84 read_transport_for_each(transport, node) { 111 list_add_tail(&logger_list->transport, &transp->node); 239 list_add_tail(&__android_log_readers, &logger_list->node); 261 list_add_tail(&__android_log_readers, &logger_list->node); 293 list_add_tail(&logger_list_internal->logger, &logger->node); 298 struct listnode* node = list_head(&logger_list_internal->transport); local 300 node_to_item(node, struc 480 struct listnode* node = list_head(&logger_list_internal->transport); local 492 struct listnode* node = list_head(&logger_list_internal->logger); local [all...] |
H A D | fake_writer.c | 36 .node = { &fakeLoggerWrite.node, &fakeLoggerWrite.node },
|
H A D | pmsg_reader.c | 43 .node = { &pmsgLoggerRead.node, &pmsgLoggerRead.node }, 279 struct listnode node; member in struct:content 289 struct listnode node; member in struct:names 296 struct listnode *node, *n; local 406 list_for_each(node, &name_list) { 407 names = node_to_item(node, struct names, node); 415 if (node [all...] |
H A D | logger_write.c | 97 struct android_log_transport_write* node) { 100 if (node->logMask) { 105 if (node->write && (i != LOG_ID_KERNEL) && 107 (!node->available || ((*node->available)(i) >= 0))) { 108 node->logMask |= 1 << i; 114 struct android_log_transport_write* node; local 120 write_transport_for_each(node, &__android_log_transport_write) { 121 __android_log_cache_available(node); 122 if (node 96 __android_log_cache_available( struct android_log_transport_write* node) argument 245 struct android_log_transport_write* node; local [all...] |
H A D | logprint.c | 251 struct listnode* node = list_head(&convertHead); local 252 list_remove(node); 253 free(node); 1274 struct listnode* node; local 1276 struct listnode node; /* first */ member in struct:conversionList 1377 list_init(&list->node); 1380 list_add_tail(&convertHead, &list->node); 1384 node); 1398 list_init(&list->node); 1401 list_add_tail(&convertHead, &list->node); [all...] |
/system/extras/simpleperf/ |
H A D | callchain.h | 65 find_child = false; // No need to find matching node in p->children. 94 for (auto& node : *v) { 95 if (!node->children.empty()) { 96 queue.push(&node->children); 106 for (auto& node : nodes) { 107 if (is_same_sample(node->chain.front(), sample)) { 108 return node.get(); 115 NodeT* node, const std::vector<EntryT*>& chain, size_t chain_start, 118 for (i = 0, j = chain_start; i < node->chain.size() && j < chain.size(); 120 if (!is_same_sample(node 114 GetMatchingLengthInNode( NodeT* node, const std::vector<EntryT*>& chain, size_t chain_start, std::function<bool(const EntryT*, const EntryT*)> is_same_sample) argument [all...] |
H A D | SampleDisplayer.h | 127 const std::unique_ptr<CallChainNodeT>& node, 133 if (node->period + node->children_period != parent_period) { 135 100.0 * (node->period + node->children_period) / parent_period; 147 PrintSampleName(node->chain[0]).c_str()); 148 for (size_t i = 1; i < node->chain.size(); ++i) { 150 PrintSampleName(node->chain[i]).c_str()); 153 if (!node->children.empty() && node 126 DisplayCallGraphEntry(FILE* fp, size_t depth, std::string prefix, const std::unique_ptr<CallChainNodeT>& node, uint64_t parent_period, bool last) argument [all...] |
/system/core/sdcard/ |
H A D | fuse.h | 76 /* Permission mode for a specific node. Controls how file permissions 79 /* Nothing special; this node should just inherit from its parent. */ 81 /* This node is one level above a normal root; used for legacy layouts 84 /* This node is "/" */ 86 /* This node is "/Android" */ 88 /* This node is "/Android/data" */ 90 /* This node is "/Android/obb" */ 92 /* This node is "/Android/media" */ 104 struct node { struct 109 * The inode number for this FUSE node [all...] |
/system/bt/osi/src/ |
H A D | config.cc | 112 for (const list_node_t* node = list_begin(src->sections); 113 node != list_end(src->sections); node = list_next(node)) { 114 section_t* sec = static_cast<section_t*>(list_node(node)); 220 for (const list_node_t* node = list_begin(sec->entries); 221 node != list_end(sec->entries); node = list_next(node)) { 222 entry_t* entry = static_cast<entry_t*>(list_node(node)); 266 config_section_next( const config_section_node_t* node) argument 272 config_section_name(const config_section_node_t* node) argument [all...] |
H A D | alarm.cc | 402 for (list_node_t* node = list_begin(alarms); node != list_end(alarms); 403 node = list_next(node)) { 404 list_node_t* next = list_next(node); 407 list_insert_after(alarms, node, alarm); 528 for (list_node_t* node = list_begin(alarms); node != list_end(alarms);) { 529 alarm_t* alarm = (alarm_t*)list_node(node); 530 node [all...] |
H A D | fixed_queue.cc | 74 for (const list_node_t* node = list_begin(queue->list); 75 node != list_end(queue->list); node = list_next(node)) 76 free_cb(list_node(node));
|
/system/extras/simpleperf/scripts/ |
H A D | report.py | 42 """Representing a node in call-graph.""" 52 def add_child(self, node): 53 self.children.append(node) 163 node = CallTreeNode(percentage, function_name) 165 cur_report_item.call_tree = node 167 call_tree_stack[depth - 1].add_child(node) 168 call_tree_stack[depth] = node 169 last_node = node 231 def display_call_tree(self, tree, parent_id, node, indent): 235 if node [all...] |
/system/libufdt/ |
H A D | ufdt_convert.c | 171 * these relation in "/aliases" node. 172 * The node has the form: 218 * [s, e) means the possible range which contains target node. 230 res = tree->phandle_table.data[s].node; 260 * ufdt_apply_overlay(), set this node in node_b 285 static int count_phandle_node(struct ufdt_node *node) { argument 286 if (node == NULL) return 0; 287 if (tag_of(node) != FDT_BEGIN_NODE) return 0; 289 if (ufdt_node_get_phandle(node) > 0) res++; 291 for_each_child(it, node) { re 295 set_phandle_table_entry(struct ufdt_node *node, struct phandle_table_entry *data, int *cur) argument 400 _ufdt_output_node_to_fdt(const struct ufdt *tree, void *fdtp, const struct ufdt_node *node, struct ufdt_prop_dict *dict) argument [all...] |
/system/bt/osi/test/ |
H A D | list_test.cc | 112 for (const list_node_t *node = list_begin(list); node != list_end(list); 113 node = list_next(node), ++i) 114 EXPECT_EQ(list_node(node), &x[i]); 126 for (const list_node_t *node = list_begin(list); node != list_end(list); 127 node = list_next(node), --i) 128 EXPECT_EQ(list_node(node), [all...] |
/system/core/init/ |
H A D | devices.cpp | 97 struct perm_node *node = (perm_node*) calloc(1, sizeof(*node)); local 98 if (!node) 101 node->dp.name = strdup(name); 102 if (!node->dp.name) { 103 free(node); 108 node->dp.attr = strdup(attr); 109 if (!node->dp.attr) { 110 free(node->dp.name); 111 free(node); 161 listnode* node; local 188 struct listnode *node; local 318 struct listnode *node; local 334 struct listnode *node; local 350 struct listnode* node; local [all...] |
H A D | ueventd_parser.cpp | 86 struct listnode *node; local 89 list_for_each(node, &subsystem_list) { 90 s = node_to_item(node, struct ueventd_subsystem, slist);
|
/system/bt/osi/include/ |
H A D | list.h | 69 // Returns the last node in the list without removing it. |list| may not 114 // the list inside the callback. If an element is added before the node being 115 // visited, there will be no callback for the newly-inserted node. Neither 131 // Given a valid iterator |node|, this function returns the next value for the 135 list_node_t* list_next(const list_node_t* node); 137 // Returns the value stored at the location pointed to by the iterator |node|. 138 // |node| must not equal the value returned by |list_end|. 139 void* list_node(const list_node_t* node);
|
/system/bt/device/src/ |
H A D | interop.cc | 150 const list_node_t* node = list_begin(interop_list); local 151 while (node != list_end(interop_list)) { 153 static_cast<interop_addr_entry_t*>(list_node(node)); 160 node = list_next(node);
|
/system/bt/stack/btm/ |
H A D | btm_dev.cc | 399 for (list_node_t* node = list_begin(btm_cb.sec_dev_rec); node != end; 400 node = list_next(node)) { 402 static_cast<tBTM_SEC_DEV_REC*>(list_node(node)); 479 for (list_node_t* node = list_begin(btm_cb.sec_dev_rec); node != end; 480 node = list_next(node)) { 482 static_cast<tBTM_SEC_DEV_REC*>(list_node(node)); [all...] |
/system/bt/stack/l2cap/ |
H A D | l2cap_client.cc | 163 for (const list_node_t* node = list_begin(client->outbound_fragments); 164 node != list_end(client->outbound_fragments); node = list_next(node)) 165 osi_free(list_node(node)); 455 for (const list_node_t* node = list_begin(l2cap_clients); 456 node != list_end(l2cap_clients); node = list_next(node)) { 457 l2cap_client_t* client = (l2cap_client_t*)list_node(node); [all...] |
/system/bt/btif/src/ |
H A D | btif_sock_sco.cc | 204 for (const list_node_t* node = list_begin(sco_sockets); 205 node != list_end(sco_sockets); node = list_next(node)) { 206 sco_socket_t* sco_socket = (sco_socket_t*)list_node(node);
|
/system/extras/simpleperf/runtest/ |
H A D | runtest.py | 156 for node in call_tree.children: 157 if child.check_relation(node): 432 node = CallTreeNode(function_name) 433 last_node.add_child(node) 434 last_node = node 435 call_tree_stack[last_depth] = node 451 node = CallTreeNode(function_name) 453 cur_symbol.set_call_tree(node) 456 call_tree_stack[depth - 1].add_child(node) 457 call_tree_stack[depth] = node [all...] |
/system/bt/hci/src/ |
H A D | hci_layer.cc | 451 for (const list_node_t* node = list_begin(commands_pending_response); 452 node != list_end(commands_pending_response); node = list_next(node)) { 454 reinterpret_cast<waiting_command_t*>(list_node(node)); 640 for (const list_node_t* node = list_begin(commands_pending_response); 641 node != list_end(commands_pending_response); node = list_next(node)) { 643 reinterpret_cast<waiting_command_t*>(list_node(node)); [all...] |