Searched defs:node (Results 1 - 25 of 45) sorted by relevance

12

/system/update_engine/payload_generator/
H A Dtopological_sort.cc33 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 Dcycle_breaker_unittest.cc135 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 Dbtif_uid.cc47 uid_set_node_t* node = set->head; local
48 while (node) {
49 uid_set_node_t* temp = node;
50 node = node->next;
60 uid_set_node_t* node = set->head; local
61 while (node && node->data.app_uid != app_uid) {
62 node = node
78 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); local
86 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); local
95 uid_set_node_t* node = set->head; local
[all...]
H A Dbtif_profile_queue.cc77 for (const list_node_t* node = list_begin(connect_queue);
78 node != list_end(connect_queue); node = list_next(node)) {
79 if (((connect_node_t*)list_node(node))->uuid == p_param->uuid) {
123 connect_node_t node; local
124 memset(&node, 0, sizeof(connect_node_t));
125 memcpy(&node.bda, bda, sizeof(bt_bdaddr_t));
126 node.uuid = uuid;
127 node
[all...]
/system/core/include/cutils/
H A Dlist.h32 #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/libcutils/include/cutils/
H A Dlist.h32 #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/libcutils/include_vndk/cutils/
H A Dlist.h32 #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 DLinkedList.h28 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 DLeakFolding.h46 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),
/system/extras/ioshark/
H A Dcompile_ioshark.h45 files_db_update_size(void *node, u_int64_t new_size) argument
47 struct files_db_s *db_node = (struct files_db_s *)node;
54 files_db_add_to_size(void *node, u_int64_t size_incr) argument
56 ((struct files_db_s *)node)->size += size_incr;
60 files_db_get_fileno(void *node) argument
62 return (((struct files_db_s *)node)->fileno);
66 files_db_get_filename(void *node) argument
68 return (((struct files_db_s *)node)->filename);
H A Dioshark_bench.h68 files_db_update_size(void *node, u_int64_t new_size) argument
70 struct files_db_s *db_node = (struct files_db_s *)node;
77 files_db_update_filename(void *node, char *filename) argument
79 ((struct files_db_s *)node)->filename = strdup(filename);
83 files_db_get_fileno(void *node) argument
85 return (((struct files_db_s *)node)->fileno);
89 files_db_get_fd(void *node) argument
91 return (((struct files_db_s *)node)->fd);
95 files_db_get_filename(void *node) argument
97 return (((struct files_db_s *)node)
101 files_db_readonly(void *node) argument
[all...]
/system/bt/device/src/
H A Dinterop.cc150 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/sepolicy/tools/sepolicy-analyze/
H A Ddups.c20 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);
/system/tools/aidl/
H A Dast_cpp_unittest.cpp95 void CompareGeneratedCode(const AstNode& node, argument
99 node.Write(writer.get());
/system/bt/osi/src/
H A Dlist.cc20 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);
56 node = list_next(node)) {
57 if (list_node(node) == data) return true;
94 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); local
95 if (!node) return false;
97 node->next = prev_node->next;
98 node
109 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); local
123 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); local
194 list_next(const list_node_t* node) argument
199 list_node(const list_node_t* node) argument
204 list_free_node_(list_t* list, list_node_t* node) argument
[all...]
/system/core/init/
H A Dueventd_parser.cpp86 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 Dconfig_utils.c28 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/extras/simpleperf/
H A Dcallchain.h65 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...]
/system/libufdt/include/
H A Dufdt_types.h23 #define for_each(it, node) \
24 if ((node) != NULL) \
25 for (it = (node)->nodes; it != (node)->nodes + (node)->mem_size; ++it) \
28 #define for_each_child(it, node) \
29 if (tag_of(node) == FDT_BEGIN_NODE) \
30 for ((it) = &(((struct fdt_node_ufdt_node *)node)->child); *it; \
33 #define for_each_prop(it, node) \
34 for_each_child(it, node) i
68 struct ufdt_node *node; member in struct:phandle_table_entry
92 tag_of(const struct ufdt_node *node) argument
[all...]
/system/core/adb/
H A Dfdevent.cpp175 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/core/liblog/
H A Dlocal_logger.c49 .node = { &localLoggerWrite.node, &localLoggerWrite.node },
79 .node = { &localLoggerRead.node, &localLoggerRead.node },
96 struct listnode node; member in struct:LogBufferElement
160 struct listnode* node; local
167 while ((node = list_head(&log->head)) != &log->head) {
170 element = node_to_item(node, struc
198 struct listnode* node = log->last[logId]; local
348 struct listnode* node; local
383 struct listnode* node; local
435 struct listnode* node = writeToLocalNode(logger_list, transp); local
466 struct listnode *node, *n; local
[all...]
H A Dlogger.h36 struct listnode* node; member in union:android_log_context
41 struct listnode node; member in struct:android_log_transport_write
59 struct listnode node; member in struct:android_log_transport_read
101 struct listnode node; member in struct:android_log_logger_list
111 struct listnode node; member in struct:android_log_logger
118 struct listnode node; member in struct:android_log_transport_context
131 struct android_log_transport_context, node); \
133 struct android_log_transport_context, node)) && \
135 (transp) = node_to_item((transp)->node.next, \
136 struct android_log_transport_context, node))
[all...]
H A Dlogger_read.c44 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 Dlogger_write.c97 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...]
/system/core/sdcard/
H A Dfuse.h76 /* 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...]

Completed in 584 milliseconds

12