/system/update_engine/payload_generator/ |
H A D | topological_sort.cc | 33 Vertex::Index node) { 34 if (visited_nodes->find(node) != visited_nodes->end()) 37 visited_nodes->insert(node); 39 for (Vertex::EdgeMap::const_iterator it = graph[node].out_edges.begin(); 40 it != graph[node].out_edges.end(); ++it) { 43 // Visit this node. 44 nodes->push_back(node); 30 TopologicalSortVisit(const Graph& graph, set<Vertex::Index>* visited_nodes, vector<Vertex::Index>* nodes, Vertex::Index node) argument
|
H A D | cycle_breaker_unittest.cc | 135 Graph graph(kGroups * kNodesPerGroup + 1); // + 1 for the root node 151 const Vertex::Index node = counter++; local 152 graph[last_hub].out_edges.insert(EdgeWithWeight(node, weight)); 153 graph[node].out_edges.insert(EdgeWithWeight(next_hub, weight));
|
/system/bt/btif/src/ |
H A D | btif_uid.c | 50 uid_set_node_t* node = set->head; local 51 while (node) { 52 uid_set_node_t* temp = node; 53 node = node->next; 64 uid_set_node_t* node = set->head; local 65 while (node && node->data.app_uid != app_uid) { 66 node = node 84 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); local 95 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); local 105 uid_set_node_t* node = set->head; local [all...] |
H A D | btif_profile_queue.c | 77 for (const list_node_t *node = list_begin(connect_queue); node != list_end(connect_queue); node = list_next(node)) { 78 if (((connect_node_t *)list_node(node))->uuid == p_param->uuid) { 120 connect_node_t node; local 121 memset(&node, 0, sizeof(connect_node_t)); 122 memcpy(&node.bda, bda, sizeof(bt_bdaddr_t)); 123 node.uuid = uuid; 124 node [all...] |
/system/core/include/cutils/ |
H A D | list.h | 32 #define node_to_item(node, container, member) \ 33 (container *) (((char*) (node)) - offsetof(container, member)) 41 #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 ! 52 list_init(struct listnode *node) argument [all...] |
/system/core/libmemunreachable/ |
H A D | LinkedList.h | 28 void insert(LinkedList<T>& node) { argument 29 assert(node.empty()); 30 node.next_ = this->next_; 31 node.next_->prev_ = &node; 32 this->next_ = &node; 33 node.prev_ = this;
|
H A D | LeakFolding.h | 46 Node<SCCInfo> node; member in struct:LeakFolding::SCCInfo 57 SCCInfo(Allocator<SCCInfo> allocator) : node(this, allocator), 67 Node<LeakInfo> node; member in struct:LeakFolding::LeakInfo 74 : node(this, allocator), range(range),
|
/system/bt/device/src/ |
H A D | interop.c | 138 const list_node_t *node = list_begin(interop_list); local 139 while (node != list_end(interop_list)) { 140 interop_addr_entry_t *entry = list_node(node); 146 node = list_next(node);
|
/system/sepolicy/tools/sepolicy-analyze/ |
H A D | dups.c | 20 avtab_ptr_t node; local 56 for (node = avtab_search_node(&policydb->te_avtab, &avkey); 57 node != NULL; 58 node = avtab_search_node_next(node, avkey.specified)) { 59 uint32_t perms = node->datum.data & d->data; 60 if ((attrib1 && perms == node->datum.data) || 68 display_allow(policydb, &node->key, i, node->datum.data);
|
H A D | neverallow.c | 193 class_perm_node_t *classperms = NULL, *node = NULL; local 257 node = calloc(1, sizeof *node); 258 if (!node) 260 node->tclass = cls->s.value; 261 node->next = classperms; 262 classperms = node; 329 for (node = classperms; node; node [all...] |
/system/tools/aidl/ |
H A D | ast_cpp_unittest.cpp | 94 void CompareGeneratedCode(const AstNode& node, argument 98 node.Write(writer.get());
|
/system/bt/osi/src/ |
H A D | list.c | 20 static list_node_t *list_free_node_(list_t *list, list_node_t *node); 55 for (const list_node_t *node = list_begin(list); node != list_end(list); node = list_next(node)) { 56 if (list_node(node) == data) 94 list_node_t *node = (list_node_t *)list->allocator->alloc(sizeof(list_node_t)); local 95 if (!node) 98 node->next = prev_node->next; 99 node 111 list_node_t *node = (list_node_t *)list->allocator->alloc(sizeof(list_node_t)); local 127 list_node_t *node = (list_node_t *)list->allocator->alloc(sizeof(list_node_t)); local 201 list_next(const list_node_t *node) argument 206 list_node(const list_node_t *node) argument 211 list_free_node_(list_t *list, list_node_t *node) argument [all...] |
H A D | config.c | 111 for (const list_node_t *node = list_begin(src->sections); 112 node != list_end(src->sections); 113 node = list_next(node)) { 114 section_t *sec = list_node(node); 219 for (const list_node_t *node = list_begin(sec->entries); node != list_end(sec->entries); node = list_next(node)) { 220 entry_t *entry = list_node(node); 266 config_section_next(const config_section_node_t *node) argument 271 config_section_name(const config_section_node_t *node) argument [all...] |
/system/core/init/ |
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/core/libcutils/ |
H A D | android_reboot.c | 97 struct listnode* node; local 99 list_for_each_safe(node, n, entries) { 100 mntent_list* item = node_to_item(node, mntent_list, list); 111 struct listnode* node; local 112 list_for_each(node, rw_entries) { 113 mntent_list* item = node_to_item(node, mntent_list, list); 137 struct listnode* node; local 194 list_for_each(node, &rw_entries) { 195 mntent_list* item = node_to_item(node, mntent_list, list); 201 list_for_each(node, [all...] |
H A D | config_utils.c | 28 cnode *node; local 30 node = calloc(sizeof(cnode), 1); 31 if(node) { 32 node->name = name ? name : ""; 33 node->value = value ? value : ""; 36 return node; 41 cnode *node, *match = NULL; local 44 for(node = root->first_child; node; node 53 cnode *node; local 69 cnode *node; local 87 cnode *node; local 97 cnode *node; local 245 parse_block(cstate *cs, cnode *node) argument 264 cnode *node; local [all...] |
/system/core/liblog/ |
H A D | logger.h | 37 struct listnode *node; member in union:android_log_context 41 struct listnode node; member in struct:android_log_transport_write 57 struct listnode node; member in struct:android_log_transport_read 108 struct listnode node; member in struct:android_log_logger 115 struct listnode node; member in struct:android_log_transport_context 129 node); \ 132 node)) && \ 134 transp = node_to_item(transp->node.next, \ 135 struct android_log_transport_context, node)) 139 struct android_log_logger, node); \ [all...] |
H A D | logger_read.c | 46 list_remove(&logger_internal->node); 62 struct listnode *node; local 84 node = (logger_list->mode & ANDROID_LOG_PSTORE) ? 87 read_transport_for_each(transport, node) { 116 list_add_tail(&logger_list->transport, &transp->node); 302 list_add_tail(&logger_list_internal->logger, &logger->node); 307 struct listnode *node = list_head(&logger_list_internal->transport); local 309 node_to_item(node, struct android_log_transport_context, node); 311 list_remove(&transp->node); 460 struct listnode *node = list_head(&logger_list_internal->transport); local 472 struct listnode *node = list_head(&logger_list_internal->logger); local [all...] |
H A D | logger_write.c | 100 struct android_log_transport_write *node) 104 if (node->logMask) { 109 if (node->write && 113 (!node->available || ((*node->available)(i) >= 0))) { 114 node->logMask |= 1 << i; 121 struct android_log_transport_write *node; local 127 write_transport_for_each(node, &__android_log_transport_write) { 128 __android_log_cache_available(node); 129 if (node 99 __android_log_cache_available( struct android_log_transport_write *node) argument 191 struct android_log_transport_write *node; local [all...] |
/system/extras/simpleperf/ |
H A D | callchain.cpp | 30 static size_t GetMatchingLengthInNode(const CallChainNode* node, argument 33 for (i = 0, j = chain_start; i < node->chain.size() && j < chain.size(); ++i, ++j) { 34 if (!MatchSampleByName(node->chain[i], chain[j])) { 43 for (auto& node : nodes) { 44 if (MatchSampleByName(node->chain.front(), sample)) { 45 return node.get(); 54 std::unique_ptr<CallChainNode> node(new CallChainNode); 56 node->chain.push_back(chain[i]); 58 node->period = period; 59 node [all...] |
/system/connectivity/shill/net/ |
H A D | nl80211_message.cc | 719 map<uint8_t, bool>::const_iterator node; local 720 node = need_to_print.find(message.command()); 721 if (node == need_to_print.end() || !node->second)
|
/system/core/adb/ |
H A D | adb_auth_client.cpp | 36 struct listnode node; member in struct:adb_public_key 94 list_add_tail(list, &key->node); 107 free(node_to_item(item, struct adb_public_key, node)); 154 adb_public_key* key = node_to_item(item, struct adb_public_key, node);
|
H A D | adb_auth_host.cpp | 54 struct listnode node; member in struct:adb_private_key 285 list_add_tail(list, &key->node); 347 int adb_auth_sign(void *node, const unsigned char* token, size_t token_size, argument 351 struct adb_private_key *key = node_to_item(node, struct adb_private_key, node);
|
H A D | fdevent.cpp | 175 PollNode& node = it->second; local 177 node.pollfd.events |= POLLIN; 179 node.pollfd.events &= ~POLLIN; 183 node.pollfd.events |= POLLOUT; 185 node.pollfd.events &= ~POLLOUT;
|
/system/bt/stack/gatt/ |
H A D | gatt_sr.c | 155 const list_node_t *node = NULL; local 164 node = list_begin(list); 166 node = list_next(node); 167 if (node != list_end(list)) 168 p_rsp = (tGATTS_RSP *)list_node(node);
|