Home
last modified time | relevance | path

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

/Linux-v6.6/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()
788 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()
789 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
Ddtc.h224 struct node *next_sibling; member
254 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
Dchecks.c281 for (child2 = child->next_sibling; in check_duplicate_node_names()
283 child2 = child2->next_sibling) in check_duplicate_node_names()
/Linux-v6.6/drivers/of/
Dunittest.c3148 struct device_node *prev_sibling, *next_sibling; in of_unittest_lifecycle() local
3258 next_sibling = prev_sibling->sibling; in of_unittest_lifecycle()
3260 np->child = next_sibling; in of_unittest_lifecycle()
3261 next_sibling = next_sibling->sibling; in of_unittest_lifecycle()
3263 while (next_sibling) { in of_unittest_lifecycle()
3264 if (!strcmp(next_sibling->full_name, "refcount-node")) in of_unittest_lifecycle()
3265 prev_sibling->sibling = next_sibling->sibling; in of_unittest_lifecycle()
3266 prev_sibling = next_sibling; in of_unittest_lifecycle()
3267 next_sibling = next_sibling->sibling; in of_unittest_lifecycle()
/Linux-v6.6/net/ipv6/
Dip6_fib.c1233 struct fib6_info *sibling, *next_sibling; in fib6_add_rt2node() local
1241 list_for_each_entry_safe(sibling, next_sibling, in fib6_add_rt2node()
1247 rt6_multipath_rebalance(next_sibling); in fib6_add_rt2node()
1950 struct fib6_info *sibling, *next_sibling; in fib6_del_route() local
1960 list_for_each_entry_safe(sibling, next_sibling, in fib6_del_route()
1965 rt6_multipath_rebalance(next_sibling); in fib6_del_route()
Droute.c417 struct fib6_info *sibling, *next_sibling; in fib6_select_path() local
444 list_for_each_entry_safe(sibling, next_sibling, &match->fib6_siblings, in fib6_select_path()
3898 struct fib6_info *sibling, *next_sibling; in __ip6_del_rt_siblings() local
3941 list_for_each_entry_safe(sibling, next_sibling, in __ip6_del_rt_siblings()
5541 struct fib6_info *sibling, *next_sibling; in rt6_nlmsg_size() local
5548 list_for_each_entry_safe(sibling, next_sibling, in rt6_nlmsg_size()
5715 struct fib6_info *sibling, *next_sibling; in rt6_fill_node() local
5727 list_for_each_entry_safe(sibling, next_sibling, in rt6_fill_node()
5810 struct fib6_info *sibling, *next_sibling; in fib6_info_uses_dev() local
5812 list_for_each_entry_safe(sibling, next_sibling, in fib6_info_uses_dev()