| /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 | 52 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool) { in ufdt_node_destruct() argument
53 if (node == NULL) return; in ufdt_node_destruct()
55 if (ufdt_node_tag(node) == FDT_BEGIN_NODE) { in ufdt_node_destruct()
56 struct ufdt_node *it = ((struct ufdt_node_fdt_node *)node)->child; in ufdt_node_destruct()
64 ufdt_node_pool_free(pool, node); in ufdt_node_destruct()
93 struct ufdt_node *ufdt_node_get_subnode_by_name_len(const struct ufdt_node *node, in ufdt_node_get_subnode_by_name_len() argument
96 for_each_node(it, node) { in ufdt_node_get_subnode_by_name_len()
102 struct ufdt_node *ufdt_node_get_subnode_by_name(const struct ufdt_node *node, in ufdt_node_get_subnode_by_name() argument
104 return ufdt_node_get_subnode_by_name_len(node, name, strlen(name)); in ufdt_node_get_subnode_by_name()
108 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/chre/util/tests/ |
| D | intrusive_list_test.cc | 83 for (auto &node : testInput) { in TEST() local
84 testLinkedList.link_back(&node); in TEST()
88 for (auto const &node : testLinkedList) { in TEST() local
89 EXPECT_EQ(node.item, idx++); in TEST()
93 for (auto &node : testInput) { in TEST() local
94 EXPECT_EQ(node.node.next, nullptr); in TEST()
95 EXPECT_EQ(node.node.prev, nullptr); in TEST()
109 for (auto &node : testListIntNodes) { in TEST() local
110 testLinkedList.link_back(&node); in TEST()
114 EXPECT_EQ(testListIntNodes[0].node.next, &testListIntNodes[2].node); in TEST()
[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 …]
|
| /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/audio/include/system/ |
| D | audio_aidl_utils.h | 37 uuid.timeMid, uuid.timeHiAndVersion, uuid.clockSeq, uuid.node[0], in toString()
38 uuid.node[1], uuid.node[2], uuid.node[3], uuid.node[4], uuid.node[5]); in toString()
|
| /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/media/camera/docs/ |
| D | metadata_helpers.py | 110 def find_unique_entries(node): argument
124 if not isinstance(node, metadata_model.Section) and \
125 not isinstance(node, metadata_model.InnerNamespace):
131 search_path = isinstance(node, metadata_model.Section) and node.kinds \
132 or [node]
140 def path_name(node): argument
157 path = node.find_parents(fltr)
160 path.append(node)
253 def has_descendants_with_enums(node): argument
264 return bool(node.find_first(lambda x: isinstance(x, metadata_model.Enum)))
[all …]
|
| /system/chre/util/include/chre/util/ |
| D | intrusive_list.h | 42 intrusive_list_internal::Node node; member
61 CHRE_ASSERT(node.prev == nullptr && node.next == nullptr); in ~ListNode()
70 return node.prev != nullptr && node.next != nullptr; in isLinked()
105 static_assert(offsetof(ListNode<ElementType>, node) == 0,
113 Iterator(Node *node) : mNode(node) {} in Iterator() argument
223 void unlink_node(ListNode<ElementType> *node);
|
| D | intrusive_list_impl.h | 34 return IntrusiveListBase::doLinkFront(&newNode->node); in link_front()
39 return IntrusiveListBase::doLinkBack(&newNode->node); in link_back()
79 void IntrusiveList<ElementType>::unlink_node(ListNode<ElementType> *node) { in unlink_node() argument
81 IntrusiveListBase::doUnlinkNode(&node->node); in unlink_node()
87 IntrusiveListBase::doLinkAfter(&frontNode->node, &newNode->node); in link_after()
|
| /system/logging/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
279 list_for_each(node, &name_list) { in __android_log_pmsg_file_read()
280 names = node_to_item(node, struct names, node); in __android_log_pmsg_file_read()
288 if (node == &name_list) { in __android_log_pmsg_file_read()
326 list_for_each_reverse(node, &name_list) { in __android_log_pmsg_file_read()
327 struct names* a_name = node_to_item(node, struct names, node); in __android_log_pmsg_file_read()
346 list_add_head(node, &names->node); in __android_log_pmsg_file_read()
350 list_for_each_safe(node, n, &names->content) { in __android_log_pmsg_file_read()
[all …]
|
| /system/chre/core/tests/ |
| D | memory_manager_test.cc | 29 struct node { struct
30 node *next; argument
80 node *head = static_cast<node *>(manager.nanoappAlloc(&app, sizeof(node))); in TEST()
81 node *curr = nullptr, *prev = head; in TEST()
83 curr = static_cast<node *>(manager.nanoappAlloc(&app, sizeof(node))); in TEST()
88 EXPECT_EQ(manager.getTotalAllocatedBytes(), maxCount * sizeof(node)); in TEST()
94 node *temp = curr->next; in TEST()
|
| /system/chre/util/ |
| D | intrusive_list_base.cc | 42 void IntrusiveListBase::doUnlinkNode(Node *node) { in doUnlinkNode() argument
43 node->prev->next = node->next; in doUnlinkNode()
44 node->next->prev = node->prev; in doUnlinkNode()
45 node->next = nullptr; in doUnlinkNode()
46 node->prev = nullptr; in doUnlinkNode()
|