Home
last modified time | relevance | path

Searched refs:next_sibling (Results 1 – 5 of 5) sorted by relevance

/kernel/linux/linux-5.10/scripts/dtc/
Dlivetree.c195 new_node->children = new_child->next_sibling; in merge_nodes()
197 new_child->next_sibling = NULL; in merge_nodes()
260 assert(first->next_sibling == NULL); in chain_node()
262 first->next_sibling = list; in chain_node()
302 child->next_sibling = NULL; in add_child()
307 p = &((*p)->next_sibling); in add_child()
321 node = node->next_sibling; in delete_node_by_name()
761 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()
762 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
Ddtc.h188 struct node *next_sibling; member
218 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
Dchecks.c273 for (child2 = child->next_sibling; in check_duplicate_node_names()
275 child2 = child2->next_sibling) in check_duplicate_node_names()
/kernel/linux/linux-5.10/net/ipv6/
Dip6_fib.c1226 struct fib6_info *sibling, *next_sibling; in fib6_add_rt2node() local
1234 list_for_each_entry_safe(sibling, next_sibling, in fib6_add_rt2node()
1240 rt6_multipath_rebalance(next_sibling); in fib6_add_rt2node()
1939 struct fib6_info *sibling, *next_sibling; in fib6_del_route() local
1949 list_for_each_entry_safe(sibling, next_sibling, in fib6_del_route()
1954 rt6_multipath_rebalance(next_sibling); in fib6_del_route()
Droute.c415 struct fib6_info *sibling, *next_sibling; in fib6_select_path() local
439 list_for_each_entry_safe(sibling, next_sibling, &match->fib6_siblings, in fib6_select_path()
3812 struct fib6_info *sibling, *next_sibling; in __ip6_del_rt_siblings() local
3855 list_for_each_entry_safe(sibling, next_sibling, in __ip6_del_rt_siblings()
5608 struct fib6_info *sibling, *next_sibling; in rt6_fill_node() local
5620 list_for_each_entry_safe(sibling, next_sibling, in rt6_fill_node()
5701 struct fib6_info *sibling, *next_sibling; in fib6_info_uses_dev() local
5703 list_for_each_entry_safe(sibling, next_sibling, in fib6_info_uses_dev()