Home
last modified time | relevance | path

Searched refs:node_a (Results 1 – 3 of 3) sorted by relevance

/system/libufdt/
Dufdt_node.c205 static int merge_children(struct ufdt_node *node_a, struct ufdt_node *node_b, in merge_children() argument
216 ufdt_node_get_subnode_by_name(node_a, ufdt_node_name(cur_node)); in merge_children()
219 ufdt_node_get_property_by_name(node_a, ufdt_node_name(cur_node)); in merge_children()
222 err = ufdt_node_add_child(node_a, cur_node); in merge_children()
241 int ufdt_node_merge_into(struct ufdt_node *node_a, struct ufdt_node *node_b, in ufdt_node_merge_into() argument
243 if (ufdt_node_tag(node_a) == FDT_PROP) { in ufdt_node_merge_into()
244 node_a->fdt_tag_ptr = node_b->fdt_tag_ptr; in ufdt_node_merge_into()
249 err = merge_children(node_a, node_b, pool); in ufdt_node_merge_into()
/system/libufdt/tests/libufdt_verify/
Dufdt_test_overlay.cpp31 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() argument
49 ufdt_node_get_subnode_by_name(node_a, ufdt_node_name(cur_node)); in compare_child_nodes()
52 ufdt_node_get_property_by_name(node_a, ufdt_node_name(cur_node)); in compare_child_nodes()
/system/libufdt/include/
Dlibufdt.h269 int ufdt_node_merge_into(struct ufdt_node *node_a, struct ufdt_node *node_b,