80 	struct node *child;  in build_node()  local
87 	for_each_child(new, child) {  in build_node()
88 		child->parent = new;  in build_node()
191 void add_child(struct node *parent, struct node *child)  in add_child()  argument
195 	child->next_sibling = NULL;  in add_child()
196 	child->parent = parent;  in add_child()
202 	*p = child;  in add_child()
342 	struct node *child;  in get_subnode()  local
344 	for_each_child(node, child)  in get_subnode()
345 		if (streq(child->name, nodename))  in get_subnode()
346 			return child;  in get_subnode()
354 	struct node *child;  in get_node_by_path()  local
364 	for_each_child(tree, child) {  in get_node_by_path()
365 		if (p && strneq(path, child->name, p-path))  in get_node_by_path()
366 			return get_node_by_path(child, p+1);  in get_node_by_path()
367 		else if (!p && streq(path, child->name))  in get_node_by_path()
368 			return child;  in get_node_by_path()
376 	struct node *child, *node;  in get_node_by_label()  local
385 	for_each_child(tree, child) {  in get_node_by_label()
386 		node = get_node_by_label(child, label);  in get_node_by_label()
396 	struct node *child, *node;  in get_node_by_phandle()  local
403 	for_each_child(tree, child) {  in get_node_by_phandle()
404 		node = get_node_by_phandle(child, phandle);  in get_node_by_phandle()