| /system/libufdt/ |
| D | ufdt_node.c | 44 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool) { 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()
94 struct ufdt_node *ufdt_node_get_subnode_by_name(const struct ufdt_node *node, 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()
110 struct ufdt_node *ufdt_node_get_property_by_name(const struct ufdt_node *node, in ufdt_node_get_property_by_name()
115 char *ufdt_node_get_fdt_prop_data(const struct ufdt_node *node, int *out_len) { in ufdt_node_get_fdt_prop_data()
126 char *ufdt_node_get_fdt_prop_data_by_name_len(const struct ufdt_node *node, in ufdt_node_get_fdt_prop_data_by_name_len()
133 char *ufdt_node_get_fdt_prop_data_by_name(const struct ufdt_node *node, in ufdt_node_get_fdt_prop_data_by_name()
147 uint32_t ufdt_node_get_phandle(const struct ufdt_node *node) { in ufdt_node_get_phandle()
162 struct ufdt_node *ufdt_node_get_node_by_path_len(const struct ufdt_node *node, in ufdt_node_get_node_by_path_len()
[all …]
|
| D | ufdt_node_pool.c | 134 void *node) { in _ufdt_node_pool_block_free()
189 void *node = _ufdt_node_pool_block_alloc(block); in ufdt_node_pool_alloc() local
201 struct ufdt_node_pool *pool, void *node) { in _ufdt_node_pool_search_block()
218 void ufdt_node_pool_free(struct ufdt_node_pool *pool, void *node) { in ufdt_node_pool_free()
|
| /system/bt/osi/src/ |
| D | list.cc | 55 for (const list_node_t* node = list_begin(list); node != list_end(list); in list_contains() local
94 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); in list_insert_after() local
109 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); in list_prepend() local
123 list_node_t* node = (list_node_t*)list->allocator->alloc(sizeof(list_node_t)); in list_append() local
151 for (list_node_t *prev = list->head, *node = list->head->next; node; in list_remove() local
164 for (list_node_t* node = list->head; node;) in list_clear() local
176 for (list_node_t* node = list->head; node;) { in list_foreach() local
194 list_node_t* list_next(const list_node_t* node) { in list_next()
199 void* list_node(const list_node_t* node) { in list_node()
204 static list_node_t* list_free_node_(list_t* list, list_node_t* node) { in list_free_node_()
|
| /system/libufdt/include/ |
| D | ufdt_types.h | 23 #define for_each(it, node) \ argument
28 #define for_each_child(it, node) \ argument
33 #define for_each_prop(it, node) \ argument
36 #define for_each_node(it, node) \ argument
45 #define ufdt_node_name(node) \ argument
50 #define ufdt_node_tag(node) \ argument
71 struct ufdt_node *node; member
|
| /system/bt/gd/packet/parser/ |
| D | struct_parser_generator.cc | 27 for (const auto& node : variable_struct_fields_) { in StructParserGenerator() local
38 void StructParserGenerator::explore_children(const TreeNode& node, std::ostream& s) const { in explore_children() argument
68 for (const auto& node : variable_struct_fields_) { in Generate() local
|
| /system/core/libcutils/ |
| D | config_utils.cpp | 29 cnode* node = static_cast<cnode*>(calloc(sizeof(cnode), 1)); in config_node() local
40 cnode *node, *match = NULL; in config_find() local
52 cnode *node; in _config_create() local
68 cnode *node; in config_bool() local
86 cnode *node; in config_str() local
96 cnode *node; in config_set() local
244 static int parse_block(cstate *cs, cnode *node) in parse_block()
263 cnode *node; in parse_expr() local
|
| /system/core/libcutils/include/cutils/ |
| D | list.h | 32 #define node_to_item(node, container, member) \ argument
41 #define list_for_each(node, list) \ argument
44 #define list_for_each_reverse(node, list) \ argument
47 #define list_for_each_safe(node, n, list) \ argument
52 static inline void list_init(struct listnode *node) in list_init()
|
| /system/core/libcutils/include_vndk/cutils/ |
| D | list.h | 32 #define node_to_item(node, container, member) \ argument
41 #define list_for_each(node, list) \ argument
44 #define list_for_each_reverse(node, list) \ argument
47 #define list_for_each_safe(node, n, list) \ argument
52 static inline void list_init(struct listnode *node) in list_init()
|
| /system/extras/ioshark/ |
| D | compile_ioshark.h | 45 files_db_update_size(void *node, u_int64_t new_size) in files_db_update_size()
54 files_db_add_to_size(void *node, u_int64_t size_incr) in files_db_add_to_size()
60 files_db_get_fileno(void *node) in files_db_get_fileno()
66 files_db_get_filename(void *node) in files_db_get_filename()
|
| D | ioshark_bench.h | 68 files_db_update_size(void *node, u_int64_t new_size) in files_db_update_size()
77 files_db_update_filename(void *node, char *filename) in files_db_update_filename()
83 files_db_get_fileno(void *node) in files_db_get_fileno()
89 files_db_get_fd(void *node) in files_db_get_fd()
95 files_db_get_filename(void *node) in files_db_get_filename()
101 files_db_readonly(void *node) in files_db_readonly()
|
| /system/bt/btif/src/ |
| D | btif_uid.cc | 48 uid_set_node_t* node = set->head; in uid_set_destroy() local
61 uid_set_node_t* node = set->head; in uid_set_find_or_create_node() local
79 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); in uid_set_add_tx() local
87 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); in uid_set_add_rx() local
96 uid_set_node_t* node = set->head; in uid_set_read_and_clear() local
|
| D | btif_profile_queue.cc | 100 for (const auto& node : connect_queue) { in queue_int_add() local
131 const ConnectNode& node = *it_prev; in queue_int_cleanup() local
|
| /system/extras/simpleperf/ |
| D | CallChainJoiner.h | 95 CacheNode* GetParent(CacheNode* node) { in GetParent()
99 int GetNodeIndex(CacheNode* node) { in GetNodeIndex()
103 void RemoveNodeFromLRUList(CacheNode* node) { in RemoveNodeFromLRUList()
110 void AppendNodeToLRUList(CacheNode* node) { in AppendNodeToLRUList()
118 void DecreaseChildCountOfNode(CacheNode* node) { in DecreaseChildCountOfNode()
|
| D | read_apk.cpp | 40 ApkNode& node = embedded_elf_cache_[apk_path]; in FindElfInApkByOffset() local
56 ApkNode& node = embedded_elf_cache_[apk_path]; in FindElfInApkByName() local
|
| D | CallChainJoiner.cpp | 49 CacheNode* node = GetNode(tid, ips[i], sps[i]); in AddCallChain() local
113 CacheNode* node = FindNode(tid, ip, sp); in GetNode() local
139 CacheNode* node = &nodes_[nodes_->leaf_link_next]; in AllocNode() local
|
| /system/bt/stack/btm/ |
| D | btm_main.cc | 85 list_node_t* node = list_begin(btm_cb.sec_dev_rec); in btm_free() local
|
| /system/update_engine/payload_generator/ |
| D | topological_sort.cc | 33 Vertex::Index node) { in TopologicalSortVisit()
|
| /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
|
| /system/media/camera/docs/ |
| D | metadata_helpers.py | 79 def find_unique_entries(node): argument
109 def path_name(node): argument
216 def has_descendants_with_enums(node): argument
229 def get_children_by_throwing_away_kind(node, member='entries'): argument
847 def javadoc_crossref_filter(node): argument
945 def ndkdoc_crossref_filter(node): argument
1044 def hidldoc_crossref_filter(node): argument
|
| D | metadata_helpers_test.py | 137 def filter_test(node): argument
|
| /system/memory/libmemunreachable/ |
| D | LinkedList.h | 28 void insert(LinkedList<T>& node) { in insert()
|
| /system/core/property_service/libpropertyinfoserializer/ |
| D | trie_builder_test.cpp | 91 auto expect_empty_one_child = [](auto* node) { in TEST()
|
| /system/chre/core/tests/ |
| D | memory_manager_test.cc | 27 struct node { struct
28 node *next;
|
| /system/extras/simpleperf/scripts/ |
| D | report.py | 60 def add_child(self, node): argument
248 def display_call_tree(self, tree, parent_id, node, indent): argument
|
| /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()
470 public void visit(ZoneNode node) { in validateNoPriorityClashes()
501 public void visit(ZoneNode node) { in calculateCountryZoneUsage()
555 public void visit(ZoneNode node) { in createGraphvizFile()
|