| /system/bt/btif/src/ |
| D | btif_uid.cc | 48 uid_set_node_t* node = set->head; in uid_set_destroy() local
49 while (node) { in uid_set_destroy()
50 uid_set_node_t* temp = node; in uid_set_destroy()
51 node = node->next; in uid_set_destroy()
61 uid_set_node_t* node = set->head; in uid_set_find_or_create_node() local
62 while (node && node->data.app_uid != app_uid) { in uid_set_find_or_create_node()
63 node = node->next; in uid_set_find_or_create_node()
66 if (!node) { in uid_set_find_or_create_node()
67 node = (uid_set_node_t*)osi_calloc(sizeof(uid_set_node_t)); in uid_set_find_or_create_node()
68 node->data.app_uid = app_uid; in uid_set_find_or_create_node()
[all …]
|
| /system/bt/osi/src/ |
| D | list.cc | 20 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); in list_contains() local
56 node = list_next(node)) { in list_contains()
57 if (list_node(node) == data) return true; in list_contains()
94 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); in list_insert_after() local
95 if (!node) return false; in list_insert_after()
97 node->next = prev_node->next; in list_insert_after()
98 node->data = data; in list_insert_after()
99 prev_node->next = node; in list_insert_after()
100 if (list->tail == prev_node) list->tail = node; in list_insert_after()
[all …]
|
| /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 | 32 #define node_to_item(node, container, member) \ argument
33 (container *) (((char*) (node)) - offsetof(container, member))
41 #define list_for_each(node, list) \ argument
42 for ((node) = (list)->next; (node) != (list); (node) = (node)->next)
44 #define list_for_each_reverse(node, list) \ argument
45 for ((node) = (list)->prev; (node) != (list); (node) = (node)->prev)
47 #define list_for_each_safe(node, n, list) \ argument
48 for ((node) = (list)->next, (n) = (node)->next; \
49 (node) != (list); \
50 (node) = (n), (n) = (node)->next)
[all …]
|
| /system/core/libcutils/include_vndk/cutils/ |
| D | list.h | 32 #define node_to_item(node, container, member) \ argument
33 (container *) (((char*) (node)) - offsetof(container, member))
41 #define list_for_each(node, list) \ argument
42 for ((node) = (list)->next; (node) != (list); (node) = (node)->next)
44 #define list_for_each_reverse(node, list) \ argument
45 for ((node) = (list)->prev; (node) != (list); (node) = (node)->prev)
47 #define list_for_each_safe(node, n, list) \ argument
48 for ((node) = (list)->next, (n) = (node)->next; \
49 (node) != (list); \
50 (node) = (n), (n) = (node)->next)
[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()
|
| /system/bt/gd/packet/parser/ |
| D | struct_parser_generator.cc | 27 for (const auto& node : variable_struct_fields_) { in StructParserGenerator() local
28 if (node.struct_def_->parent_ != nullptr) { in StructParserGenerator()
30 if (node.struct_def_->parent_->name_ == parent.struct_def_->name_) { in StructParserGenerator()
31 parent.children_.push_back(&node); in StructParserGenerator()
38 void StructParserGenerator::explore_children(const TreeNode& node, std::ostream& s) const { in explore_children() argument
39 auto field = node.packet_field_; in explore_children()
40 if (!node.children_.empty()) { in explore_children()
43 for (const auto& child : node.children_) { in explore_children()
68 for (const auto& node : variable_struct_fields_) { in Generate() local
69 if (node.children_.empty()) { in Generate()
[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 | 45 files_db_update_size(void *node, u_int64_t new_size) in files_db_update_size() argument
47 struct files_db_s *db_node = (struct files_db_s *)node; in files_db_update_size()
54 files_db_add_to_size(void *node, u_int64_t size_incr) in files_db_add_to_size() argument
56 ((struct files_db_s *)node)->size += size_incr; in files_db_add_to_size()
60 files_db_get_fileno(void *node) in files_db_get_fileno() argument
62 return (((struct files_db_s *)node)->fileno); in files_db_get_fileno()
66 files_db_get_filename(void *node) in files_db_get_filename() argument
68 return (((struct files_db_s *)node)->filename); in files_db_get_filename()
|
| /system/extras/simpleperf/ |
| D | CallChainJoiner.h | 95 CacheNode* GetParent(CacheNode* node) { in GetParent() argument
96 return node->parent_index == 0u ? nullptr : nodes_ + node->parent_index; in GetParent()
99 int GetNodeIndex(CacheNode* node) { in GetNodeIndex() argument
100 return node - nodes_; in GetNodeIndex()
103 void RemoveNodeFromLRUList(CacheNode* node) { in RemoveNodeFromLRUList() argument
104 CacheNode* prev = &nodes_[node->leaf_link_prev]; in RemoveNodeFromLRUList()
105 CacheNode* next = &nodes_[node->leaf_link_next]; in RemoveNodeFromLRUList()
106 prev->leaf_link_next = node->leaf_link_next; in RemoveNodeFromLRUList()
107 next->leaf_link_prev = node->leaf_link_prev; in RemoveNodeFromLRUList()
110 void AppendNodeToLRUList(CacheNode* node) { in AppendNodeToLRUList() argument
[all …]
|
| D | callchain.h | 97 for (auto& node : *v) { in SortByPeriod()
98 if (!node->children.empty()) { in SortByPeriod()
99 queue.push(&node->children); in SortByPeriod()
109 for (auto& node : nodes) { in FindMatchingNode()
110 if (is_same_sample(node->chain.front(), sample)) { in FindMatchingNode()
111 return node.get(); in FindMatchingNode()
118 NodeT* node, const std::vector<EntryT*>& chain, size_t chain_start, in GetMatchingLengthInNode()
121 for (i = 0, j = chain_start; i < node->chain.size() && j < chain.size(); in GetMatchingLengthInNode()
123 if (!is_same_sample(node->chain[i], chain[j])) { in GetMatchingLengthInNode()
144 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 | 135 const std::unique_ptr<CallChainNodeT>& node, in DisplayCallGraphEntry() argument
141 if (node->period + node->children_period != parent_period) { in DisplayCallGraphEntry()
143 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 …]
|
| /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/media/camera/docs/ |
| D | metadata_helpers.py | 79 def find_unique_entries(node): argument
93 if not isinstance(node, metadata_model.Section) and \
94 not isinstance(node, metadata_model.InnerNamespace):
100 search_path = isinstance(node, metadata_model.Section) and node.kinds \
101 or [node]
109 def path_name(node): argument
126 path = node.find_parents(fltr)
129 path.append(node)
216 def has_descendants_with_enums(node): argument
227 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/update_engine/payload_generator/ |
| D | topological_sort.cc | 33 Vertex::Index node) { in TopologicalSortVisit() argument
34 if (visited_nodes->find(node) != visited_nodes->end()) in TopologicalSortVisit()
37 visited_nodes->insert(node); in TopologicalSortVisit()
39 for (Vertex::EdgeMap::const_iterator it = graph[node].out_edges.begin(); in TopologicalSortVisit()
40 it != graph[node].out_edges.end(); in TopologicalSortVisit()
45 nodes->push_back(node); in TopologicalSortVisit()
|
| /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/timezone/input_tools/android/tzlookup_generator/src/main/java/com/android/libcore/timezone/tzlookup/zonetree/ |
| D | CountryZoneTree.java | 429 public void visit(ZoneNode node) { in compressTree() argument
430 if (node.isRoot()) { in compressTree()
436 if (node.getChildrenCount() == 1) { in compressTree()
437 ZoneNode child = node.getChildren().get(0); in compressTree()
440 node.removeChild(child); in compressTree()
453 node.addChild(newChild); in compressTree()
457 node.adjustPeriodCount(periodCountAdjustment); in compressTree()
470 public void visit(ZoneNode node) { in validateNoPriorityClashes() argument
471 if (node.isRoot()) { in validateNoPriorityClashes()
477 if (node.hasPriorityClash()) { in validateNoPriorityClashes()
[all …]
|
| /system/core/liblog/ |
| D | pmsg_reader.cpp | 167 struct listnode node; in __android_log_pmsg_file_read() member
171 struct listnode node; in __android_log_pmsg_file_read() member
178 struct listnode *node, *n; in __android_log_pmsg_file_read() local
282 list_for_each(node, &name_list) { in __android_log_pmsg_file_read()
283 names = node_to_item(node, struct names, node); in __android_log_pmsg_file_read()
291 if (node == &name_list) { in __android_log_pmsg_file_read()
329 list_for_each_reverse(node, &name_list) { in __android_log_pmsg_file_read()
330 struct names* a_name = node_to_item(node, struct names, node); in __android_log_pmsg_file_read()
349 list_add_head(node, &names->node); in __android_log_pmsg_file_read()
353 list_for_each_safe(node, n, &names->content) { in __android_log_pmsg_file_read()
[all …]
|