Home
last modified time | relevance | path

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

/scripts/
Dasn1_compiler.c686 struct element *children; member
942 element->children = alloc_elem(); in parse_type()
943 element = element->children; in parse_type()
1027 element->children = parse_compound(&cursor, end, 1); in parse_type()
1041 element->children = parse_type(&cursor, end, NULL); in parse_type()
1043 element->children = parse_compound(&cursor, end, 0); in parse_type()
1058 element->children = parse_type(&cursor, end, NULL); in parse_type()
1060 element->children = parse_compound(&cursor, end, 1); in parse_type()
1150 struct element *children, **child_p = &children, *element; in parse_compound() local
1193 children->flags &= ~ELEMENT_CONDITIONAL; in parse_compound()
[all …]
Dspelling.txt321 childern||children
322 childs||children
/scripts/dtc/
Dlivetree.c88 struct node *build_node(struct property *proplist, struct node *children, in build_node() argument
97 new->children = children; in build_node()
192 while (new_node->children) { in merge_nodes()
194 new_child = new_node->children; in merge_nodes()
195 new_node->children = new_child->next_sibling; in merge_nodes()
306 p = &parent->children; in add_child()
315 struct node *node = parent->children; in delete_node_by_name()
668 bootcpu = cpus->children; in guess_boot_cpuid()
794 node->children = tbl[0]; in sort_subnodes()
Ddtc.h221 struct node *children; member
254 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
269 struct node *build_node(struct property *proplist, struct node *children,
Dchecks.c1034 if (!node->children) in check_i2c_bus_bridge()
1125 if (node->bus != &spi_bus || !node->children) in check_spi_bus_bridge()
1227 if (get_property(node, "ranges") || get_property(node, "dma-ranges") || !node->children) in check_avoid_unnecessary_addr_size()
1265 if (!node->children) in check_unique_unit_address_common()
1911 node->children->name); in check_graph_child_address()
Dflattree.c756 if (node->children) in unflatten_tree()