Home
last modified time | relevance | path

Searched refs:for_each_child (Results 1 – 6 of 6) sorted by relevance

/u-boot/scripts/dtc/
A Dlivetree.c110 for_each_child(new, child) { in build_node()
335 for_each_child(node, child) in delete_node()
464 for_each_child(tree, c) { in get_property_by_label()
491 for_each_child(tree, c) { in get_marker_label()
506 for_each_child(node, child) in get_subnode()
818 for_each_child(node, c) in any_label_tree()
861 for_each_child(node, c) in generate_label_tree_internal()
879 for_each_child(node, c) { in any_fixup_tree()
926 for_each_child(node, c) in generate_fixups_tree_internal()
944 for_each_child(node, c) { in any_local_fixup_tree()
[all …]
A Dchecks.c123 for_each_child(node, child) in check_nodes_props()
253 for_each_child(node, child) in check_duplicate_node_names()
1027 for_each_child(node, child) { in check_avoid_unnecessary_addr_size()
1049 for_each_child(node, childa) { in check_unique_unit_address()
1056 for_each_child(node, childb) { in check_unique_unit_address()
1421 for_each_child(node, child) { in check_graph_nodes()
1448 for_each_child(node, child) { in check_graph_child_address()
A Ddtc.c57 for_each_child(tree, child) in fill_fullpaths()
A Dtreesource.c257 for_each_child(tree, child) { in write_tree_source_node()
A Ddtc.h192 #define for_each_child(n, c) \ macro
A Dflattree.c301 for_each_child(tree, child) { in flatten_tree()

Completed in 16 milliseconds