Home
last modified time | relevance | path

Searched defs:node (Results 1 – 25 of 55) sorted by relevance

123

/system/libufdt/
Dufdt_node.c44 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()
132 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()
139 char *ufdt_node_get_fdt_prop_data_by_name(const struct ufdt_node *node, in ufdt_node_get_fdt_prop_data_by_name()
153 uint32_t ufdt_node_get_phandle(const struct ufdt_node *node) { in ufdt_node_get_phandle()
168 struct ufdt_node *ufdt_node_get_node_by_path_len(const struct ufdt_node *node, in ufdt_node_get_node_by_path_len()
[all …]
Dufdt_node_pool.c134 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/libufdt/include/
Dufdt_types.h23 #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/core/libcutils/
Dconfig_utils.cpp29 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/
Dlist.h31 #define node_to_item(node, container, member) \ argument
40 #define list_for_each_reverse(node, list) \ argument
43 #define list_for_each_safe(node, n, list) \ argument
48 #define list_for_each(node, list) \ argument
52 static inline void list_init(struct listnode *node) in list_init()
/system/core/libcutils/include_outside_system/cutils/
Dlist.h31 #define node_to_item(node, container, member) \ argument
40 #define list_for_each_reverse(node, list) \ argument
43 #define list_for_each_safe(node, n, list) \ argument
48 #define list_for_each(node, list) \ argument
52 static inline void list_init(struct listnode *node) in list_init()
/system/extras/ioshark/
Dcompile_ioshark.h51 files_db_update_size(void *node, u_int64_t new_size) in files_db_update_size()
60 files_db_add_to_size(void *node, u_int64_t size_incr) in files_db_add_to_size()
66 files_db_get_fileno(void *node) in files_db_get_fileno()
72 files_db_get_filename(void *node) in files_db_get_filename()
Dioshark_bench.h68 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/security/diced/src/
Ddiced_client_test.rs47 let node = get_dice_node(); in equivalence_test() localVariable
73 let node = get_dice_node(); in sign_and_verify() localVariable
85 let node = get_dice_node(); in demote_test() localVariable
143 let node = get_dice_node(); in demote_self_test() localVariable
Ddiced_main.rs62 let node = DiceNode::new_as_binder(node_impl.clone()) in main() localVariable
/system/extras/simpleperf/
DCallChainJoiner.h93 CacheNode* GetParent(CacheNode* node) { in GetParent()
97 int GetNodeIndex(CacheNode* node) { return node - nodes_; } in GetNodeIndex()
99 void RemoveNodeFromLRUList(CacheNode* node) { in RemoveNodeFromLRUList()
106 void AppendNodeToLRUList(CacheNode* node) { in AppendNodeToLRUList()
114 void DecreaseChildCountOfNode(CacheNode* node) { in DecreaseChildCountOfNode()
Dread_apk.cpp42 ApkNode& node = embedded_elf_cache_[apk_path]; in FindElfInApkByOffset() local
58 ApkNode& node = embedded_elf_cache_[apk_path]; in FindElfInApkByName() local
DCallChainJoiner.cpp49 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/tools/aidl/
Dlogging.h34 AidlErrorLog(Severity severity, const AidlNode* node) : AidlErrorLog(severity, *node) {} in AidlErrorLog()
37 AidlErrorLog(Severity severity, const std::unique_ptr<T>& node) : AidlErrorLog(severity, *node) {} in AidlErrorLog()
Dlogging.cpp33 AidlErrorLog::AidlErrorLog(Severity severity, const AidlNode& node) in AidlErrorLog()
/system/media/camera/docs/
Dmetadata_helpers.py83 def find_unique_entries(node): argument
113 def path_name(node): argument
223 def has_descendants_with_enums(node): argument
236 def get_children_by_throwing_away_kind(node, member='entries'): argument
854 def javadoc_crossref_filter(node): argument
957 def ndkdoc_crossref_filter(node): argument
1056 def hidldoc_crossref_filter(node): argument
Dmetadata_helpers_test.py137 def filter_test(node): argument
/system/logging/liblog/
Dpmsg_reader.cpp166 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
/system/chre/core/tests/
Dmemory_manager_test.cc27 struct node { struct
28 node *next;
/system/core/property_service/libpropertyinfoserializer/
Dtrie_builder_test.cpp91 auto expect_empty_one_child = [](auto* node) { in TEST()
/system/memory/libmemunreachable/
DLinkedList.h28 void insert(LinkedList<T>& node) { in insert()
/system/timezone/input_tools/android/tzlookup_generator/src/main/java/com/android/libcore/timezone/tzlookup/zonetree/
DCountryZoneTree.java430 public void visit(ZoneNode node) { in compressTree()
471 public void visit(ZoneNode node) { in validateNoPriorityClashes()
502 public void visit(ZoneNode node) { in calculateCountryZoneUsage()
532 private String getReplacementTimeZoneIdOrNull(ZoneNode node) { in calculateCountryZoneUsage()
585 public void visit(ZoneNode node) { in createGraphvizFile()
DTreeNode.java115 void visit(N node); in visit()
/system/extras/simpleperf/scripts/
Dreport.py61 def add_child(self, node): argument
250 def display_call_tree(self, tree, parent_id, node, indent): argument
/system/sepolicy/tools/sepolicy-analyze/
Ddups.c20 avtab_ptr_t node; in find_dups_helper() local

123