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

1234

/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...]
H A Dlibufdt.h28 * Allocates spaces for new ufdt_node who represents a fdt node at fdt_tag_ptr.
39 * Frees all nodes in the subtree rooted at *node.
41 void ufdt_node_destruct(struct ufdt_node *node);
58 * Gets pointer to FDT_PROP subnode of node with name equals to name[0..len-1]
66 const struct ufdt_node *node, const char *name, int len);
67 struct ufdt_node *ufdt_node_get_property_by_name(const struct ufdt_node *node,
71 * Gets the pointer to the FDT_PROP node's data in the corresponding fdt.
75 * NULL if *node is not a FDT_PROP
77 char *ufdt_node_get_fdt_prop_data(const struct ufdt_node *node, int *out_len);
80 * Gets pointer to FDT_PROP 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)); \
36 (transp) = node_to_item((transp)->node.next, \
37 struct android_log_transport_read, node))
41 struct android_log_transport_read, node), \
42 (n) = (transp)->node.next; \
44 struct android_log_transport_read, node)) && \
46 node_to_item((n), struct android_log_transport_read, node)); \
[all...]
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)); \
36 (transp) = node_to_item((transp)->node.next, \
37 struct android_log_transport_write, node))
41 struct android_log_transport_write, node), \
42 (n) = (transp)->node.next; \
44 struct android_log_transport_write, node)) && \
46 node_to_item((n), struct android_log_transport_write, node)); \
[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 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 Dconfig_read.c39 list_add_tail(list, &transport->node);
49 list_add_tail(list, &transport->node);
81 list_remove(&transport->node);
84 list_remove(&transport->node);
H A Dconfig_write.c39 list_add_tail(list, &transport->node);
49 list_add_tail(list, &transport->node);
112 list_remove(&transport->node);
116 list_remove(&transport->node);
/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/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/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/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/libufdt/
H A Dufdt_node.c25 bool node_name_eq(const struct ufdt_node *node, const char *name, int len) { argument
26 if (!node) return false;
28 if (dto_strncmp(name_of(node), name, len) != 0) return false;
29 if (name_of(node)[len] != '\0') return false;
58 void ufdt_node_destruct(struct ufdt_node *node) { argument
59 if (node == NULL) return;
61 if (tag_of(node) == FDT_BEGIN_NODE) {
62 ufdt_node_destruct(((struct fdt_node_ufdt_node *)node)->child);
65 ufdt_node_destruct(node->sibling);
66 dto_free(node);
98 ufdt_node_get_subnode_by_name_len(const struct ufdt_node *node, const char *name, int len) argument
107 ufdt_node_get_subnode_by_name(const struct ufdt_node *node, const char *name) argument
112 ufdt_node_get_property_by_name_len( const struct ufdt_node *node, const char *name, int len) argument
123 ufdt_node_get_property_by_name(const struct ufdt_node *node, const char *name) argument
128 ufdt_node_get_fdt_prop_data(const struct ufdt_node *node, int *out_len) argument
139 ufdt_node_get_fdt_prop_data_by_name_len(const struct ufdt_node *node, const char *name, int len, int *out_len) argument
146 ufdt_node_get_fdt_prop_data_by_name(const struct ufdt_node *node, const char *name, int *out_len) argument
160 ufdt_node_get_phandle(const struct ufdt_node *node) argument
175 ufdt_node_get_node_by_path_len(const struct ufdt_node *node, const char *path, int len) argument
201 ufdt_node_get_node_by_path(const struct ufdt_node *node, const char *path) argument
212 ufdt_node_print(const struct ufdt_node *node, int depth) argument
250 ufdt_node_map(struct ufdt_node *node, struct ufdt_node_closure closure) 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/sdcard/
H A Dfuse.cpp46 static void acquire_node_locked(struct node* node) argument
48 node->refcount++;
49 DLOG(INFO) << "ACQUIRE " << std::hex << node << std::dec
50 << " (" << node->name << ") rc=" << node->refcount;
53 static void remove_node_from_parent_locked(struct node* node);
55 static void release_node_locked(struct node* node) argument
77 add_node_to_parent_locked(struct node *node, struct node *parent) argument
84 remove_node_from_parent_locked(struct node* node) argument
107 get_node_path_locked(struct node* node, char* buf, size_t bufsize) argument
182 attr_from_stat(struct fuse* fuse, struct fuse_attr *attr, const struct stat *s, const struct node* node) argument
244 derive_permissions_locked(struct fuse* fuse, struct node *parent, struct node *node) argument
300 struct node *node; local
334 check_caller_access_to_node(struct fuse* fuse, const struct fuse_in_header *hdr, const struct node* node, int mode) argument
342 struct node *node; local
384 rename_node_locked(struct node *node, const char *name, const char* actual_name) argument
437 struct node* node = lookup_node_by_id_locked(fuse, nid); local
444 lookup_child_by_name_locked(struct node *node, const char *name) argument
512 struct node* node; local
537 fuse_reply_attr(struct fuse* fuse, __u64 unique, const struct node* node, const char* path) argument
616 struct node* node; local
637 struct node* node; local
660 struct node* node; local
998 struct node* node; local
1163 struct node* node; local
1281 struct node* node; local
[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.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...]
/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.c190 class_perm_node_t *classperms = NULL, *node = NULL; local
254 node = calloc(1, sizeof *node);
255 if (!node)
257 node->tclass = cls->s.value;
258 node->next = classperms;
259 classperms = node;
326 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...]

Completed in 567 milliseconds

1234