Searched refs:ufdt_node (Results 1 – 8 of 8) sorted by relevance
| /system/libufdt/include/ |
| D | libufdt.h | 36 struct ufdt_node *ufdt_node_construct(void *fdtp, fdt32_t *fdt_tag_ptr,
42 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool);
54 int ufdt_node_add_child(struct ufdt_node *parent, struct ufdt_node *child);
66 struct ufdt_node *ufdt_node_get_property_by_name_len(
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,
[all …]
|
| D | ufdt_types.h | 53 struct ufdt_node { struct
55 struct ufdt_node *sibling; argument
59 struct ufdt_node parent;
64 struct ufdt_node parent;
65 struct ufdt_node *child;
66 struct ufdt_node **last_child_p;
71 struct ufdt_node *node;
84 struct ufdt_node *root;
|
| D | ufdt_overlay_internal.h | 38 struct ufdt_node *frag_node,
39 struct ufdt_node **target_node);
|
| /system/libufdt/ |
| D | ufdt_node.c | 21 struct ufdt_node *ufdt_node_construct(void *fdtp, fdt32_t *fdt_tag_ptr, in ufdt_node_construct()
32 return (struct ufdt_node *)res; in ufdt_node_construct()
40 return (struct ufdt_node *)res; in ufdt_node_construct()
44 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool) { in ufdt_node_destruct()
48 struct ufdt_node *it = ((struct ufdt_node_fdt_node *)node)->child; in ufdt_node_destruct()
50 struct ufdt_node *next = it->sibling; in ufdt_node_destruct()
59 int ufdt_node_add_child(struct ufdt_node *parent, struct ufdt_node *child) { in ufdt_node_add_child()
85 struct ufdt_node *ufdt_node_get_subnode_by_name_len(const struct ufdt_node *node, in ufdt_node_get_subnode_by_name_len()
87 struct ufdt_node **it = NULL; 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()
[all …]
|
| D | ufdt_overlay.c | 82 static void ufdt_node_try_increase_phandle(struct ufdt_node *node, in ufdt_node_try_increase_phandle()
104 struct ufdt_node *target_node = sorted_table.data[i].node; in ufdt_try_increase_phandle()
170 struct ufdt_node *target_node; in ufdt_get_fixup_location()
234 struct ufdt_node *overlay_fixups_node = in ufdt_overlay_do_fixups()
241 struct ufdt_node *main_symbols_node = in ufdt_overlay_do_fixups()
244 struct ufdt_node **it; in ufdt_overlay_do_fixups()
265 struct ufdt_node *fixups = *it; in ufdt_overlay_do_fixups()
275 struct ufdt_node *symbol_node; in ufdt_overlay_do_fixups()
315 static int ufdt_overlay_node(struct ufdt_node *target_node, in ufdt_overlay_node()
316 struct ufdt_node *overlay_node, in ufdt_overlay_node()
[all …]
|
| D | ufdt_convert.c | 111 static struct ufdt_node *ufdt_new_node(void *fdtp, int node_offset, in ufdt_new_node()
120 struct ufdt_node *res = ufdt_node_construct(fdtp, fdt_tag_ptr, pool); in ufdt_new_node()
124 static struct ufdt_node *fdt_to_ufdt_tree(void *fdtp, int cur_fdt_tag_offset, in fdt_to_ufdt_tree()
131 struct ufdt_node *res, *child_node; in fdt_to_ufdt_tree()
170 struct ufdt_node *ufdt_get_node_by_path_len(struct ufdt *tree, const char *path, in ufdt_get_node_by_path_len()
190 struct ufdt_node *aliases_node = in ufdt_get_node_by_path_len()
204 struct ufdt_node *target_node = in ufdt_get_node_by_path_len()
213 struct ufdt_node *ufdt_get_node_by_path(struct ufdt *tree, const char *path) { in ufdt_get_node_by_path()
217 struct ufdt_node *ufdt_get_node_by_phandle(struct ufdt *tree, in ufdt_get_node_by_phandle()
219 struct ufdt_node *res = NULL; in ufdt_get_node_by_phandle()
[all …]
|
| D | Android.bp | 26 "ufdt_node.c",
|
| /system/libufdt/tests/libufdt_verify/ |
| D | ufdt_test_overlay.cpp | 31 static bool ufdt_node_compare(struct ufdt_node *node_a, struct ufdt_node *node_b,
38 static bool compare_child_nodes(struct ufdt_node *node_a, struct ufdt_node *node_b, in compare_child_nodes()
41 struct ufdt_node *it; in compare_child_nodes()
44 struct ufdt_node *cur_node = it; in compare_child_nodes()
45 struct ufdt_node *target_node = NULL; in compare_child_nodes()
73 static bool ufdt_compare_property(struct ufdt_node* node_final, struct ufdt_node* node_overlay, in ufdt_compare_property()
103 struct ufdt_node * target_node_a = ufdt_get_node_by_phandle(tree_final, in ufdt_compare_property()
105 struct ufdt_node * target_node_b = ufdt_get_node_by_phandle(tree_overlay, in ufdt_compare_property()
127 static bool ufdt_node_compare(struct ufdt_node *node_final, struct ufdt_node *node_overlay, in ufdt_node_compare()
142 struct ufdt_node **prev_node, struct ufdt_node_pool *node_pool) { in ufdt_combine_fixup()
[all …]
|