103 	struct node *child;  in build_node()  local
110 	for_each_child(new, child) {  in build_node()
111 		child->parent = new;  in build_node()
281 void add_child(struct node *parent, struct node *child)  in add_child()  argument
285 	child->next_sibling = NULL;  in add_child()
286 	child->parent = parent;  in add_child()
292 	*p = child;  in add_child()
311 	struct node *child;  in delete_node()  local
314 	for_each_child(node, child)  in delete_node()
315 		delete_node(child);  in delete_node()
483 	struct node *child;  in get_subnode()  local
485 	for_each_child(node, child)  in get_subnode()
486 		if (streq(child->name, nodename))  in get_subnode()
487 			return child;  in get_subnode()
495 	struct node *child;  in get_node_by_path()  local
508 	for_each_child(tree, child) {  in get_node_by_path()
509 		if (p && (strlen(child->name) == p-path) &&  in get_node_by_path()
510 				strneq(path, child->name, p-path))  in get_node_by_path()
511 			return get_node_by_path(child, p+1);  in get_node_by_path()
512 		else if (!p && streq(path, child->name))  in get_node_by_path()
513 			return child;  in get_node_by_path()
521 	struct node *child, *node;  in get_node_by_label()  local
530 	for_each_child(tree, child) {  in get_node_by_label()
531 		node = get_node_by_label(child, label);  in get_node_by_label()
541 	struct node *child, *node;  in get_node_by_phandle()  local
551 	for_each_child(tree, child) {  in get_node_by_phandle()
552 		node = get_node_by_phandle(child, phandle);  in get_node_by_phandle()