Home
last modified time | relevance | path

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

/scripts/dtc/
A Dlivetree.c100 for_each_child(new, child) { in build_node()
332 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()
851 for_each_child(node, c) in any_label_tree()
895 for_each_child(node, c) in generate_label_tree_internal()
913 for_each_child(node, c) { in any_fixup_tree()
966 for_each_child(node, c) in generate_fixups_tree_internal()
984 for_each_child(node, c) { in any_local_fixup_tree()
[all …]
A Dchecks.c143 for_each_child(node, child) in check_nodes_props()
281 for_each_child(node, child) in check_duplicate_node_names()
1026 for_each_child(node, child) { in check_i2c_bus_bridge()
1110 for_each_child(node, child) { in check_spi_bus_bridge()
1230 for_each_child(node, child) { in check_avoid_unnecessary_addr_size()
1268 for_each_child(node, childa) { in check_unique_unit_address_common()
1278 for_each_child(node, childb) { in check_unique_unit_address_common()
1769 for_each_child(node, child) { in check_graph_nodes()
1899 for_each_child(node, child) { in check_graph_child_address()
A Dyamltree.c195 for_each_child(tree, child) { in yaml_tree()
A Ddtc.c44 for_each_child(tree, child) in fill_fullpaths()
A Dtreesource.c330 for_each_child(tree, child) { in write_tree_source_node()
A Ddtc.h256 #define for_each_child(n, c) \ macro
A Dflattree.c287 for_each_child(tree, child) { in flatten_tree()

Completed in 45 milliseconds