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

12

/system/extras/simpleperf/
H A DSampleDisplayer.h127 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/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...]
H A Dufdt_overlay.c42 * certain operations (e.g., merge 2 subtrees, search for a node by path) in
79 * Tries to increase the phandle value of a node
82 static void ufdt_node_try_increase_phandle(struct ufdt_node *node, argument
85 char *prop_data = ufdt_node_get_fdt_prop_data_by_name(node, "phandle", &len);
89 prop_data = ufdt_node_get_fdt_prop_data_by_name(node, "linux,phandle", &len);
104 struct ufdt_node *target_node = sorted_table.data[i].node;
123 * /path/to/node:property:offset.
127 * "property"=<1, 2, &ref, 4>, we can use /path/to/node:property:8 to get ref,
174 dto_error("Property '%s' not found in '%s' node\n", prop_ptr, path);
194 * Process one entry in __fixups__ { } node
[all...]
H A Dufdt_convert.c171 * 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/sepolicy/tools/sepolicy-analyze/
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/bt/osi/src/
H A Dconfig.cc112 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...]
/system/bt/stack/gatt/
H A Dgatt_sr.cc150 const list_node_t* node = NULL; local
158 node = list_begin(list);
160 node = list_next(node);
161 if (node != list_end(list)) p_rsp = (tGATTS_RSP*)list_node(node);
/system/core/liblog/
H A Dpmsg_reader.c43 .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 Dlogprint.c251 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/netd/tests/
H A Dnetd_test.cpp87 AddrInfo(const char* node, const char* service, const addrinfo& hints) : ai_(nullptr) { argument
88 init(node, service, hints);
91 AddrInfo(const char* node, const char* service) : ai_(nullptr) { argument
92 init(node, service);
97 int init(const char* node, const char* service, const addrinfo& hints) { argument
99 error_ = getaddrinfo(node, service, &hints, &ai_);
103 int init(const char* node, const char* service) { argument
105 error_ = getaddrinfo(node, service, nullptr, &ai_);
/system/extras/ioshark/
H A Dioshark_bench_subr.c151 files_db_update_fd(void *node, int fd) argument
153 struct files_db_s *db_node = (struct files_db_s *)node;
159 files_db_close_fd(void *node) argument
161 struct files_db_s *db_node = (struct files_db_s *)node;
/system/libvintf/
H A Dparse_xml.cpp175 inline bool operator()(Object *o, NodeType *node) const {
176 return deserialize(o, node);
339 inline bool parseText(NodeType *node, std::string *s) const { argument
340 *s = getText(node);
345 inline bool parseText(NodeType *node, T *s) const { argument
346 std::string text = getText(node);
/system/update_engine/payload_generator/
H A Dinplace_generator.cc166 // a real file node to a temp copy node:
170 // make node depend on the copy operation
184 // make the dest node read from the scratch space
216 // Don't have a node depend on itself
255 Vertex::Index node = op_indexes[i]; local
256 if (table.size() < (node + 1)) {
257 table.resize(node + 1);
259 table[node] = i;
393 // See if this node ha
[all...]
/system/core/adb/
H A Dtransport.cpp318 device_tracker* node = *pnode; local
321 while (node) {
322 if (node == tracker) {
323 *pnode = node->next;
326 pnode = &node->next;
327 node = *pnode;
/system/core/init/
H A Ddevices.cpp97 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...]
/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/tools/hidl/test/
H A Dhidl_test_client.cpp1605 IGraph::Node node; node.data = 10; local
1606 EXPECT_OK(graphInterface->passANode(node));
/system/bt/stack/btm/
H A Dbtm_sec.cc3004 list_node_t* node = local
3006 if (node != NULL) {
3007 p_dev_rec = static_cast<tBTM_SEC_DEV_REC*>(list_node(node));
5962 for (const list_node_t* node = list_begin(list); node != list_end(list);) {
5963 tBTM_SEC_QUEUE_ENTRY* p_e = (tBTM_SEC_QUEUE_ENTRY*)list_node(node);
5964 node = list_next(node);
/system/extras/perfprofd/quipper/
H A Dperf_reader.cc1353 PerfNodeTopologyMetadata node; local
1354 if (!ReadDataFromBuffer(data, sizeof(node.id), "node id",
1355 &offset, &node.id) ||
1356 !ReadDataFromBuffer(data, sizeof(node.total_memory),
1357 "node total memory", &offset,
1358 &node.total_memory) ||
1359 !ReadDataFromBuffer(data, sizeof(node.free_memory),
1360 "node free memory", &offset, &node
1624 const PerfNodeTopologyMetadata& node = numa_topology_[i]; local
[all...]
/system/media/audio/include/system/
H A Daudio.h965 uint8_t node[6]; member in struct:audio_uuid_s

Completed in 1069 milliseconds

12