Searched refs:next_sibling (Results 1 – 5 of 5) sorted by relevance
188 new_node->children = new_child->next_sibling; in merge_nodes()190 new_child->next_sibling = NULL; in merge_nodes()221 assert(first->next_sibling == NULL); in chain_node()223 first->next_sibling = list; in chain_node()263 child->next_sibling = NULL; in add_child()268 p = &((*p)->next_sibling); in add_child()282 node = node->next_sibling; in delete_node_by_name()691 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()692 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
152 struct node *next_sibling; member178 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
246 for (child2 = child->next_sibling; in check_duplicate_node_names()248 child2 = child2->next_sibling) in check_duplicate_node_names()
1404 struct rt6_info *sibling, *next_sibling; in fib6_del_route() local1406 list_for_each_entry_safe(sibling, next_sibling, in fib6_del_route()
440 struct rt6_info *sibling, *next_sibling; in rt6_multipath_select() local448 list_for_each_entry_safe(sibling, next_sibling, in rt6_multipath_select()