Searched refs:node (Results 1 - 25 of 72) sorted by relevance

123

/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/bt/btif/src/
H A Dbtif_uid.c50 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 Dbtif_profile_queue.c77 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/liblog/
H A Dconfig_read.h31 struct android_log_transport_read, node); \
33 struct android_log_transport_read, node)); \
34 transp = node_to_item(transp->node.next, \
35 struct android_log_transport_read, node)) \
39 struct android_log_transport_read, node), \
40 n = transp->node.next; \
42 struct android_log_transport_read, node)); \
43 transp = node_to_item(n, struct android_log_transport_read, node), \
44 n = transp->node.next)
H A Dconfig_write.h31 struct android_log_transport_write, node); \
33 struct android_log_transport_write, node)); \
34 transp = node_to_item(transp->node.next, \
35 struct android_log_transport_write, node)) \
39 struct android_log_transport_write, node), \
40 n = transp->node.next; \
42 struct android_log_transport_write, node)); \
43 transp = node_to_item(n, struct android_log_transport_write, node), \
44 n = transp->node.next)
H A Dlogger.h37 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 Dlogger_read.c46 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 Dconfig_read.c35 list_add_tail(list, &transport->node);
46 list_add_tail(list, &transport->node);
H A Dconfig_write.c35 list_add_tail(list, &transport->node);
46 list_add_tail(list, &transport->node);
H A Dfake_writer.c36 .node = { &fakeLoggerWrite.node, &fakeLoggerWrite.node },
H A Dlogger_write.c100 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
226 struct android_log_transport_write *node; local
[all...]
/system/bt/osi/src/
H A Dlist.c20 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 Dconfig.c111 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/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/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
/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.cpp27 // of each node in the component.
38 for (auto& node: scc_nodes) {
39 node->ptr->scc = leak_scc.get();
41 leak_scc->size += node->ptr->range.size();
49 for (auto& ref: leak.node.references_out) {
51 leak.scc->node.Edge(&ref->ptr->scc->node);
64 scc->node.Foreach([&](SCCInfo* ref) {
83 leak_graph_.push_back(&leak.node);
94 leak.node
[all...]
H A DLeakFolding.h46 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/core/sdcard/
H A Dsdcard.c71 * CREAT) must bump that node's refcount
119 /* Permission mode for a specific node. Controls how file permissions
122 /* Nothing special; this node should just inherit from its parent. */
124 /* This node is one level above a normal root; used for legacy layouts
127 /* This node is "/" */
129 /* This node is "/Android" */
131 /* This node is "/Android/data" */
133 /* This node is "/Android/obb" */
135 /* This node is "/Android/media" */
147 struct node { struct
268 acquire_node_locked(struct node* node) argument
276 release_node_locked(struct node* node) argument
297 add_node_to_parent_locked(struct node *node, struct node *parent) argument
304 remove_node_from_parent_locked(struct node* node) argument
327 get_node_path_locked(struct node* node, char* buf, size_t bufsize) argument
402 attr_from_stat(struct fuse* fuse, struct fuse_attr *attr, const struct stat *s, const struct node* node) argument
463 derive_permissions_locked(struct fuse* fuse, struct node *parent, struct node *node) argument
518 struct node *node; local
552 check_caller_access_to_node(struct fuse* fuse, const struct fuse_in_header *hdr, const struct node* node, int mode) argument
560 struct node *node; local
602 rename_node_locked(struct node *node, const char *name, const char* actual_name) argument
655 struct node* node = lookup_node_by_id_locked(fuse, nid); local
662 lookup_child_by_name_locked(struct node *node, const char *name) argument
723 struct node* node; local
748 fuse_reply_attr(struct fuse* fuse, __u64 unique, const struct node* node, const char* path) argument
824 struct node* node; local
843 struct node* node; local
865 struct node* node; local
1194 struct node* node; local
1365 struct node* node; local
1497 struct node* node; local
[all...]
/system/extras/simpleperf/
H A Dcallchain.cpp30 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...]
H A Dreport.py41 """Representing a node in call-graph."""
51 def add_child(self, node):
52 self.children.append(node)
129 node = CallTreeNode(percentage, function_name)
131 cur_report_item.call_tree = node
133 call_tree_stack[depth - 1].add_child(node)
134 call_tree_stack[depth] = node
135 last_node = node
197 def display_call_tree(self, tree, parent_id, node, indent):
201 if node
[all...]
/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);
H A Dneverallow.c193 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/media/camera/docs/
H A Dmetadata_helpers.py69 entry: an Entry or Clone node
77 def find_unique_entries(node):
82 node: a Section or InnerNamespace instance
91 if not isinstance(node, metadata_model.Section) and \
92 not isinstance(node, metadata_model.InnerNamespace):
93 raise TypeError("expected node to be a Section or InnerNamespace")
98 search_path = isinstance(node, metadata_model.Section) and node.kinds \
99 or [node]
107 def path_name(node)
[all...]
/system/connectivity/shill/mobile_operator_db/
H A Dserviceproviders_converter.py132 for node in self._dropped_nodes:
133 logging.info(self._PPrintXML(node).encode(FILE_ENCODING))
214 def _EnrichNode(self, node, country_code, primary, roaming_required, names,
217 Adds the information passed in as children of |node|.
219 @param node: The XML node to enrich.
220 @param country_code: The country code for node. Type: str.
221 @param primary: Is this node a primary provider. Type: str
224 @param provider_type: Is this node 'gsm'/'cdma'. Type: str.
227 ElementTree.SubElement(node,
[all...]

Completed in 302 milliseconds

123