Home
last modified time | relevance | path

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

/Linux-v5.4/scripts/dtc/
Dlivetree.c100 for_each_child(new, child) { in build_node()
331 for_each_child(node, child) in delete_node()
463 for_each_child(tree, c) { in get_property_by_label()
490 for_each_child(tree, c) { in get_marker_label()
505 for_each_child(node, child) in get_subnode()
528 for_each_child(tree, child) { in get_node_by_path()
550 for_each_child(tree, child) { in get_node_by_label()
574 for_each_child(tree, child) { in get_node_by_phandle()
817 for_each_child(node, c) in any_label_tree()
861 for_each_child(node, c) in generate_label_tree_internal()
[all …]
Dchecks.c142 for_each_child(node, child) in check_nodes_props()
272 for_each_child(node, child) in check_duplicate_node_names()
998 for_each_child(node, child) { in check_i2c_bus_bridge()
1071 for_each_child(node, child) { in check_spi_bus_bridge()
1191 for_each_child(node, child) { in check_avoid_unnecessary_addr_size()
1229 for_each_child(node, childa) { in check_unique_unit_address_common()
1239 for_each_child(node, childb) { in check_unique_unit_address_common()
1625 for_each_child(node, child) { in check_graph_nodes()
1652 for_each_child(node, child) { in check_graph_child_address()
Ddtc.c44 for_each_child(tree, child) in fill_fullpaths()
Dyamltree.c193 for_each_child(tree, child) { in yaml_tree()
Ddtc.h189 #define for_each_child(n, c) \ macro
Dtreesource.c312 for_each_child(tree, child) { in write_tree_source_node()
Dflattree.c286 for_each_child(tree, child) { in flatten_tree()