| /system/core/libcutils/ |
| D | config_utils.cpp | 29 cnode* node = static_cast<cnode*>(calloc(sizeof(cnode), 1)); in config_node() local
30 if(node) { in config_node()
31 node->name = name ? name : ""; in config_node()
32 node->value = value ? value : ""; in config_node()
35 return node; in config_node()
40 cnode *node, *match = NULL; in config_find() local
43 for(node = root->first_child; node; node = node->next) in config_find()
44 if(!strcmp(node->name, name)) in config_find()
45 match = node; in config_find()
52 cnode *node; in _config_create() local
[all …]
|
| /system/libufdt/include/ |
| D | ufdt_types.h | 23 #define for_each(it, node) \ argument
24 if ((node) != NULL) \
25 for ((it) = (node)->nodes; (it) != (node)->nodes + (node)->mem_size; ++(it)) \
28 #define for_each_child(it, node) \ argument
29 if (ufdt_node_tag(node) == FDT_BEGIN_NODE) \
30 for ((it) = &(((struct ufdt_node_fdt_node *)(node))->child); *(it); \
33 #define for_each_prop(it, node) \ argument
34 for_each_child(it, node) if (ufdt_node_tag(*(it)) == FDT_PROP)
36 #define for_each_node(it, node) \ argument
37 for_each_child(it, node) if (ufdt_node_tag(*(it)) == FDT_BEGIN_NODE)
[all …]
|
| D | libufdt.h | 42 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool);
67 const struct ufdt_node *node, const char *name, int len);
68 struct ufdt_node *ufdt_node_get_property_by_name(const struct ufdt_node *node,
78 char *ufdt_node_get_fdt_prop_data(const struct ufdt_node *node, int *out_len);
91 char *ufdt_node_get_fdt_prop_data_by_name_len(const struct ufdt_node *node,
94 char *ufdt_node_get_fdt_prop_data_by_name(const struct ufdt_node *node,
109 struct ufdt_node *ufdt_node_get_subnode_by_name_len(const struct ufdt_node *node,
111 struct ufdt_node *ufdt_node_get_subnode_by_name(const struct ufdt_node *node,
125 struct ufdt_node *ufdt_node_get_node_by_path_len(const struct ufdt_node *node,
127 struct ufdt_node *ufdt_node_get_node_by_path(const struct ufdt_node *node,
[all …]
|
| /system/core/libcutils/include/cutils/ |
| D | list.h | 31 #define node_to_item(node, container, member) \ argument
32 (container *) (((char*) (node)) - offsetof(container, member))
40 #define list_for_each_reverse(node, list) \ argument
41 for ((node) = (list)->prev; (node) != (list); (node) = (node)->prev)
43 #define list_for_each_safe(node, n, list) \ argument
44 for ((node) = (list)->next, (n) = (node)->next; \
45 (node) != (list); \
46 (node) = (n), (n) = (node)->next)
48 #define list_for_each(node, list) \ argument
49 for (struct listnode* __n = ((node) = (list)->next)->next; (node) != (list); \
[all …]
|
| /system/core/libcutils/include_outside_system/cutils/ |
| D | list.h | 31 #define node_to_item(node, container, member) \ argument
32 (container *) (((char*) (node)) - offsetof(container, member))
40 #define list_for_each_reverse(node, list) \ argument
41 for ((node) = (list)->prev; (node) != (list); (node) = (node)->prev)
43 #define list_for_each_safe(node, n, list) \ argument
44 for ((node) = (list)->next, (n) = (node)->next; \
45 (node) != (list); \
46 (node) = (n), (n) = (node)->next)
48 #define list_for_each(node, list) \ argument
49 for (struct listnode* __n = ((node) = (list)->next)->next; (node) != (list); \
[all …]
|
| /system/libufdt/ |
| D | ufdt_node.c | 44 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool) { in ufdt_node_destruct() argument
45 if (node == NULL) return; in ufdt_node_destruct()
47 if (ufdt_node_tag(node) == FDT_BEGIN_NODE) { in ufdt_node_destruct()
48 struct ufdt_node *it = ((struct ufdt_node_fdt_node *)node)->child; in ufdt_node_destruct()
56 ufdt_node_pool_free(pool, node); in ufdt_node_destruct()
85 struct ufdt_node *ufdt_node_get_subnode_by_name_len(const struct ufdt_node *node, in ufdt_node_get_subnode_by_name_len() argument
88 for_each_node(it, node) { in ufdt_node_get_subnode_by_name_len()
94 struct ufdt_node *ufdt_node_get_subnode_by_name(const struct ufdt_node *node, in ufdt_node_get_subnode_by_name() argument
96 return ufdt_node_get_subnode_by_name_len(node, name, strlen(name)); in ufdt_node_get_subnode_by_name()
100 const struct ufdt_node *node, const char *name, int len) { in ufdt_node_get_property_by_name_len() argument
[all …]
|
| D | ufdt_node_pool.c | 134 void *node) { in _ufdt_node_pool_block_free() argument
136 struct ufdt_node_pool_entry_header *entry = node; in _ufdt_node_pool_block_free()
189 void *node = _ufdt_node_pool_block_alloc(block); in ufdt_node_pool_alloc() local
197 return node; in ufdt_node_pool_alloc()
201 struct ufdt_node_pool *pool, void *node) { in _ufdt_node_pool_search_block() argument
209 if ((char *)node >= block_buf_start && (char *)node < block_buf_end) { in _ufdt_node_pool_search_block()
218 void ufdt_node_pool_free(struct ufdt_node_pool *pool, void *node) { in ufdt_node_pool_free() argument
220 return dto_free(node); in ufdt_node_pool_free()
224 _ufdt_node_pool_search_block(pool, node); in ufdt_node_pool_free()
231 _ufdt_node_pool_block_free(block, node); in ufdt_node_pool_free()
|
| D | ufdt_convert.c | 242 res = tree->phandle_table.data[s].node; in ufdt_get_node_by_phandle()
247 static int count_phandle_node(struct ufdt_node *node) { in count_phandle_node() argument
248 if (node == NULL) return 0; in count_phandle_node()
249 if (ufdt_node_tag(node) != FDT_BEGIN_NODE) return 0; in count_phandle_node()
251 if (ufdt_node_get_phandle(node) > 0) res++; in count_phandle_node()
253 for_each_child(it, node) { res += count_phandle_node(*it); } in count_phandle_node()
257 static void set_phandle_table_entry(struct ufdt_node *node, in set_phandle_table_entry() argument
260 if (node == NULL || ufdt_node_tag(node) != FDT_BEGIN_NODE) return; in set_phandle_table_entry()
261 int ph = ufdt_node_get_phandle(node); in set_phandle_table_entry()
264 data[*cur].node = node; in set_phandle_table_entry()
[all …]
|
| /system/extras/ioshark/ |
| D | ioshark_bench.h | 68 files_db_update_size(void *node, u_int64_t new_size) in files_db_update_size() argument
70 struct files_db_s *db_node = (struct files_db_s *)node; in files_db_update_size()
77 files_db_update_filename(void *node, char *filename) in files_db_update_filename() argument
79 ((struct files_db_s *)node)->filename = strdup(filename); in files_db_update_filename()
83 files_db_get_fileno(void *node) in files_db_get_fileno() argument
85 return (((struct files_db_s *)node)->fileno); in files_db_get_fileno()
89 files_db_get_fd(void *node) in files_db_get_fd() argument
91 return (((struct files_db_s *)node)->fd); in files_db_get_fd()
95 files_db_get_filename(void *node) in files_db_get_filename() argument
97 return (((struct files_db_s *)node)->filename); in files_db_get_filename()
[all …]
|
| D | compile_ioshark.h | 51 files_db_update_size(void *node, u_int64_t new_size) in files_db_update_size() argument
53 struct files_db_s *db_node = (struct files_db_s *)node; in files_db_update_size()
60 files_db_add_to_size(void *node, u_int64_t size_incr) in files_db_add_to_size() argument
62 ((struct files_db_s *)node)->size += size_incr; in files_db_add_to_size()
66 files_db_get_fileno(void *node) in files_db_get_fileno() argument
68 return (((struct files_db_s *)node)->fileno); in files_db_get_fileno()
72 files_db_get_filename(void *node) in files_db_get_filename() argument
74 return (((struct files_db_s *)node)->filename); in files_db_get_filename()
|
| /system/extras/simpleperf/ |
| D | CallChainJoiner.h | 93 CacheNode* GetParent(CacheNode* node) { in GetParent() argument
94 return node->parent_index == 0u ? nullptr : nodes_ + node->parent_index; in GetParent()
97 int GetNodeIndex(CacheNode* node) { return node - nodes_; } in GetNodeIndex() argument
99 void RemoveNodeFromLRUList(CacheNode* node) { in RemoveNodeFromLRUList() argument
100 CacheNode* prev = &nodes_[node->leaf_link_prev]; in RemoveNodeFromLRUList()
101 CacheNode* next = &nodes_[node->leaf_link_next]; in RemoveNodeFromLRUList()
102 prev->leaf_link_next = node->leaf_link_next; in RemoveNodeFromLRUList()
103 next->leaf_link_prev = node->leaf_link_prev; in RemoveNodeFromLRUList()
106 void AppendNodeToLRUList(CacheNode* node) { in AppendNodeToLRUList() argument
109 node->leaf_link_next = 0; in AppendNodeToLRUList()
[all …]
|
| D | callchain.h | 95 for (auto& node : *v) { in SortByPeriod()
96 if (!node->children.empty()) { in SortByPeriod()
97 queue.push(&node->children); in SortByPeriod()
106 for (auto& node : nodes) { in FindMatchingNode()
107 if (is_same_sample(node->chain.front(), sample)) { in FindMatchingNode()
108 return node.get(); in FindMatchingNode()
114 size_t GetMatchingLengthInNode(NodeT* node, const std::vector<EntryT*>& chain, size_t chain_start, in GetMatchingLengthInNode()
117 for (i = 0, j = chain_start; i < node->chain.size() && j < chain.size(); ++i, ++j) { in GetMatchingLengthInNode()
118 if (!is_same_sample(node->chain[i], chain[j])) { in GetMatchingLengthInNode()
138 std::unique_ptr<NodeT> node(new NodeT); in AllocateNode()
[all …]
|
| D | CallChainJoiner.cpp | 49 CacheNode* node = GetNode(tid, ips[i], sps[i]); in AddCallChain() local
50 chain.push_back(node); in AddCallChain()
113 CacheNode* node = FindNode(tid, ip, sp); in GetNode() local
114 if (node != nullptr) { in GetNode()
115 if (node->is_leaf) { in GetNode()
117 RemoveNodeFromLRUList(node); in GetNode()
118 AppendNodeToLRUList(node); in GetNode()
120 return node; in GetNode()
122 node = AllocNode(); in GetNode()
123 node->tid = tid; in GetNode()
[all …]
|
| D | SampleDisplayer.h | 136 const std::unique_ptr<CallChainNodeT>& node, uint64_t parent_period, in DisplayCallGraphEntry() argument
142 if (node->period + node->children_period != parent_period) { in DisplayCallGraphEntry()
143 double percentage = 100.0 * (node->period + node->children_period) / parent_period; in DisplayCallGraphEntry()
155 PrintSampleName(node->chain[0]).c_str()); in DisplayCallGraphEntry()
156 for (size_t i = 1; i < node->chain.size(); ++i) { in DisplayCallGraphEntry()
158 PrintSampleName(node->chain[i]).c_str()); in DisplayCallGraphEntry()
161 if (!node->children.empty() && node->period != 0) { in DisplayCallGraphEntry()
163 100.0 * node->period / (node->period + node->children_period)); in DisplayCallGraphEntry()
165 for (size_t i = 0; i < node->children.size(); ++i) { in DisplayCallGraphEntry()
166 DisplayCallGraphEntry(fp, depth + 1, prefix, node->children[i], in DisplayCallGraphEntry()
[all …]
|
| D | read_apk.cpp | 42 ApkNode& node = embedded_elf_cache_[apk_path]; in FindElfInApkByOffset() local
43 auto it = node.offset_map.find(file_offset); in FindElfInApkByOffset()
44 if (it != node.offset_map.end()) { in FindElfInApkByOffset()
49 node.offset_map[file_offset] = std::move(elf); in FindElfInApkByOffset()
51 node.name_map[result->entry_name()] = result; in FindElfInApkByOffset()
58 ApkNode& node = embedded_elf_cache_[apk_path]; in FindElfInApkByName() local
59 auto it = node.name_map.find(entry_name); in FindElfInApkByName()
60 if (it != node.name_map.end()) { in FindElfInApkByName()
65 node.name_map[entry_name] = result; in FindElfInApkByName()
67 node.offset_map[result->entry_offset()] = std::move(elf); in FindElfInApkByName()
|
| /system/sepolicy/tools/sepolicy-analyze/ |
| D | neverallow.c | 190 class_perm_node_t *classperms = NULL, *node = NULL; in read_classperms() local
254 node = calloc(1, sizeof *node); in read_classperms()
255 if (!node) in read_classperms()
257 node->tclass = cls->s.value; in read_classperms()
258 node->next = classperms; in read_classperms()
259 classperms = node; in read_classperms()
327 for (node = classperms; node; node = node->next) in read_classperms()
328 node->data = ~0; in read_classperms()
334 for (node = classperms; node; node = node->next) { in read_classperms()
335 cls = policydb->class_val_to_struct[node->tclass-1]; in read_classperms()
[all …]
|
| D | dups.c | 20 avtab_ptr_t node; in find_dups_helper() local
56 for (node = avtab_search_node(&policydb->te_avtab, &avkey); in find_dups_helper()
57 node != NULL; in find_dups_helper()
58 node = avtab_search_node_next(node, avkey.specified)) { in find_dups_helper()
59 uint32_t perms = node->datum.data & d->data; in find_dups_helper()
60 if ((attrib1 && perms == node->datum.data) || in find_dups_helper()
68 display_allow(policydb, &node->key, i, node->datum.data); in find_dups_helper()
|
| /system/timezone/input_tools/android/tzlookup_generator/src/main/java/com/android/libcore/timezone/tzlookup/zonetree/ |
| D | CountryZoneTree.java | 430 public void visit(ZoneNode node) { in compressTree() argument
431 if (node.isRoot()) { in compressTree()
437 if (node.getChildrenCount() == 1) { in compressTree()
438 ZoneNode child = node.getChildren().get(0); in compressTree()
441 node.removeChild(child); in compressTree()
454 node.addChild(newChild); in compressTree()
458 node.adjustPeriodCount(periodCountAdjustment); in compressTree()
471 public void visit(ZoneNode node) { in validateNoPriorityClashes() argument
472 if (node.isRoot()) { in validateNoPriorityClashes()
478 if (node.hasPriorityClash()) { in validateNoPriorityClashes()
[all …]
|
| /system/media/camera/docs/ |
| D | metadata_helpers.py | 83 def find_unique_entries(node): argument
97 if not isinstance(node, metadata_model.Section) and \
98 not isinstance(node, metadata_model.InnerNamespace):
104 search_path = isinstance(node, metadata_model.Section) and node.kinds \
105 or [node]
113 def path_name(node): argument
130 path = node.find_parents(fltr)
133 path.append(node)
223 def has_descendants_with_enums(node): argument
234 return bool(node.find_first(lambda x: isinstance(x, metadata_model.Enum)))
[all …]
|
| /system/memory/libmemunreachable/ |
| D | LeakFolding.cpp | 40 for (auto& node : scc_nodes) { in ComputeDAG() local
41 node->ptr->scc = leak_scc.get(); in ComputeDAG()
43 leak_scc->size += node->ptr->range.size(); in ComputeDAG()
51 for (auto& ref : leak.node.references_out) { in ComputeDAG()
53 leak.scc->node.Edge(&ref->ptr->scc->node); in ComputeDAG()
65 scc->node.Foreach([&](SCCInfo* ref) { walk(ref); }); in AccumulateLeaks()
80 leak_graph_.push_back(&leak.node); in FoldLeaks()
91 leak.node.Edge(&ptr_leak->node); in FoldLeaks()
101 if (scc->node.references_in.size() == 0) { in FoldLeaks()
|
| D | LinkedList.h | 28 void insert(LinkedList<T>& node) { in insert() argument
29 assert(node.empty()); in insert()
30 node.next_ = this->next_; in insert()
31 node.next_->prev_ = &node; in insert()
32 this->next_ = &node; in insert()
33 node.prev_ = this; in insert()
|
| /system/chre/core/tests/ |
| D | memory_manager_test.cc | 27 struct node { struct
28 node *next; argument
78 node *head = static_cast<node *>(manager.nanoappAlloc(&app, sizeof(node))); in TEST()
79 node *curr = nullptr, *prev = head; in TEST()
81 curr = static_cast<node *>(manager.nanoappAlloc(&app, sizeof(node))); in TEST()
86 EXPECT_EQ(manager.getTotalAllocatedBytes(), maxCount * sizeof(node)); in TEST()
92 node *temp = curr->next; in TEST()
|
| /system/logging/liblog/ |
| D | pmsg_reader.cpp | 166 struct listnode node; in __android_log_pmsg_file_read() member
170 struct listnode node; in __android_log_pmsg_file_read() member
177 struct listnode *node, *n; in __android_log_pmsg_file_read() local
280 list_for_each(node, &name_list) { in __android_log_pmsg_file_read()
281 names = node_to_item(node, struct names, node); in __android_log_pmsg_file_read()
289 if (node == &name_list) { in __android_log_pmsg_file_read()
327 list_for_each_reverse(node, &name_list) { in __android_log_pmsg_file_read()
328 struct names* a_name = node_to_item(node, struct names, node); in __android_log_pmsg_file_read()
347 list_add_head(node, &names->node); in __android_log_pmsg_file_read()
351 list_for_each_safe(node, n, &names->content) { in __android_log_pmsg_file_read()
[all …]
|
| /system/security/diced/src/ |
| D | diced_client_test.rs | 47 let node = get_dice_node(); in equivalence_test() localVariable
49 let former = node.derive(&[]).expect("Trying to call derive."); in equivalence_test()
50 let latter = node.derive(&input_values).expect("Trying to call derive with input values."); in equivalence_test()
73 let node = get_dice_node(); in sign_and_verify() localVariable
74 let _signature = node.sign(&[], TEST_MESSAGE).expect("Trying to call sign."); in sign_and_verify()
76 let _bcc = node.getAttestationChain(&[]).expect("Trying to call getAttestationChain."); in sign_and_verify()
85 let node = get_dice_node(); in demote_test() localVariable
87 let former = node.derive(&[]).expect("Trying to call derive."); in demote_test()
88 node.demote(&input_values).expect("Trying to call demote with input values."); in demote_test()
90 let latter = node.derive(&[]).expect("Trying to call derive after demote."); in demote_test()
[all …]
|
| /system/extras/simpleperf/scripts/ |
| D | report.py | 61 def add_child(self, node): argument
62 self.children.append(node)
179 node = CallTreeNode(percentage, function_name)
181 cur_report_item.call_tree = node
183 call_tree_stack[depth - 1].add_child(node)
184 call_tree_stack[depth] = node
185 last_node = node
250 def display_call_tree(self, tree, parent_id, node, indent): argument
254 if node.percentage != 100.0:
255 percentage_str = '%.2f%% ' % node.percentage
[all …]
|