Searched refs:for_each_child (Results 1 – 6 of 6) sorted by relevance
| /scripts/dtc/ |
| A D | livetree.c | 110 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()
844 for_each_child(node, c) in any_label_tree()
887 for_each_child(node, c) in generate_label_tree_internal()
905 for_each_child(node, c) { in any_fixup_tree()
952 for_each_child(node, c) in generate_fixups_tree_internal()
970 for_each_child(node, c) { in any_local_fixup_tree()
[all …]
|
| A D | checks.c | 122 for_each_child(node, child) in check_nodes_props()
252 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()
1419 for_each_child(node, child) { in check_graph_nodes()
1446 for_each_child(node, child) { in check_graph_child_address()
|
| A D | dtc.c | 57 for_each_child(tree, child) in fill_fullpaths()
|
| A D | treesource.c | 257 for_each_child(tree, child) { in write_tree_source_node()
|
| A D | dtc.h | 190 #define for_each_child(n, c) \ macro
|
| A D | flattree.c | 301 for_each_child(tree, child) { in flatten_tree()
|
Completed in 16 milliseconds