Searched refs:cur_node (Results 1 – 2 of 2) sorted by relevance
| /system/libufdt/ |
| D | ufdt_node.c | 210 struct ufdt_node *cur_node = it; in merge_children() local
212 cur_node->sibling = NULL; in merge_children()
214 if (ufdt_node_tag(cur_node) == FDT_BEGIN_NODE) { in merge_children()
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()
224 err = ufdt_node_merge_into(target_node, cur_node, pool); in merge_children()
225 ufdt_node_pool_free(pool, cur_node); in merge_children()
|
| /system/libufdt/tests/libufdt_verify/ |
| D | ufdt_test_overlay.cpp | 44 struct ufdt_node *cur_node = it; in compare_child_nodes() local
47 if (ufdt_node_tag(cur_node) == FDT_BEGIN_NODE) { in compare_child_nodes()
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()
58 result = ufdt_node_compare(target_node, cur_node, tree_a, tree_b); in compare_child_nodes()
|