Searched refs:next_sibling (Results 1 – 5 of 5) sorted by relevance
195 new_node->children = new_child->next_sibling; in merge_nodes()197 new_child->next_sibling = NULL; in merge_nodes()261 assert(first->next_sibling == NULL); in chain_node()263 first->next_sibling = list; in chain_node()303 child->next_sibling = NULL; in add_child()308 p = &((*p)->next_sibling); in add_child()322 node = node->next_sibling; in delete_node_by_name()796 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()797 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
224 struct node *next_sibling; member254 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
282 for (child2 = child->next_sibling; in check_duplicate_node_names()284 child2 = child2->next_sibling) in check_duplicate_node_names()
3455 struct device_node *prev_sibling, *next_sibling; in of_unittest_lifecycle() local3565 next_sibling = prev_sibling->sibling; in of_unittest_lifecycle()3567 np->child = next_sibling; in of_unittest_lifecycle()3568 next_sibling = next_sibling->sibling; in of_unittest_lifecycle()3570 while (next_sibling) { in of_unittest_lifecycle()3571 if (!strcmp(next_sibling->full_name, "refcount-node")) in of_unittest_lifecycle()3572 prev_sibling->sibling = next_sibling->sibling; in of_unittest_lifecycle()3573 prev_sibling = next_sibling; in of_unittest_lifecycle()3574 next_sibling = next_sibling->sibling; in of_unittest_lifecycle()
3913 struct fib6_info *sibling, *next_sibling; in __ip6_del_rt_siblings() local3956 list_for_each_entry_safe(sibling, next_sibling, in __ip6_del_rt_siblings()5846 struct fib6_info *sibling, *next_sibling; in fib6_info_uses_dev() local5848 list_for_each_entry_safe(sibling, next_sibling, in fib6_info_uses_dev()