Home
last modified time | relevance | path

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

/Linux-v4.19/scripts/dtc/
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()
529 for_each_child(tree, child) { in get_node_by_path()
551 for_each_child(tree, child) { in get_node_by_label()
575 for_each_child(tree, child) { in get_node_by_phandle()
818 for_each_child(node, c) in any_label_tree()
861 for_each_child(node, c) in generate_label_tree_internal()
[all …]
Dchecks.c123 for_each_child(node, child) in check_nodes_props()
253 for_each_child(node, child) in check_duplicate_node_names()
1026 for_each_child(node, child) { in check_avoid_unnecessary_addr_size()
1048 for_each_child(node, childa) { in check_unique_unit_address()
1055 for_each_child(node, childb) { in check_unique_unit_address()
1420 for_each_child(node, child) { in check_graph_nodes()
1447 for_each_child(node, child) { in check_graph_child_address()
Ddtc.c57 for_each_child(tree, child) in fill_fullpaths()
Dtreesource.c257 for_each_child(tree, child) { in write_tree_source_node()
Ddtc.h192 #define for_each_child(n, c) \ macro
Dflattree.c301 for_each_child(tree, child) { in flatten_tree()