Home
last modified time | relevance | path

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

/linux/scripts/dtc/
A Dlivetree.c195 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()
A Ddtc.h224 struct node *next_sibling; member
254 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
A Dchecks.c282 for (child2 = child->next_sibling; in check_duplicate_node_names()
284 child2 = child2->next_sibling) in check_duplicate_node_names()
/linux/drivers/of/
A Dunittest.c3394 struct device_node *prev_sibling, *next_sibling; in of_unittest_lifecycle() local
3504 next_sibling = prev_sibling->sibling; in of_unittest_lifecycle()
3506 np->child = next_sibling; in of_unittest_lifecycle()
3507 next_sibling = next_sibling->sibling; in of_unittest_lifecycle()
3509 while (next_sibling) { in of_unittest_lifecycle()
3510 if (!strcmp(next_sibling->full_name, "refcount-node")) in of_unittest_lifecycle()
3511 prev_sibling->sibling = next_sibling->sibling; in of_unittest_lifecycle()
3512 prev_sibling = next_sibling; in of_unittest_lifecycle()
3513 next_sibling = next_sibling->sibling; in of_unittest_lifecycle()
/linux/net/ipv6/
A Dip6_fib.c1242 struct fib6_info *sibling, *next_sibling; in fib6_add_rt2node() local
1250 list_for_each_entry_safe(sibling, next_sibling, in fib6_add_rt2node()
1256 rt6_multipath_rebalance(next_sibling); in fib6_add_rt2node()
1959 struct fib6_info *sibling, *next_sibling; in fib6_del_route() local
1969 list_for_each_entry_safe(sibling, next_sibling, in fib6_del_route()
1974 rt6_multipath_rebalance(next_sibling); in fib6_del_route()
A Droute.c416 struct fib6_info *sibling, *next_sibling; in fib6_select_path() local
443 list_for_each_entry_safe(sibling, next_sibling, &match->fib6_siblings, in fib6_select_path()
3908 struct fib6_info *sibling, *next_sibling; in __ip6_del_rt_siblings() local
3951 list_for_each_entry_safe(sibling, next_sibling, in __ip6_del_rt_siblings()
5550 struct fib6_info *sibling, *next_sibling; in rt6_nlmsg_size() local
5557 list_for_each_entry_safe(sibling, next_sibling, in rt6_nlmsg_size()
5724 struct fib6_info *sibling, *next_sibling; in rt6_fill_node() local
5736 list_for_each_entry_safe(sibling, next_sibling, in rt6_fill_node()
5819 struct fib6_info *sibling, *next_sibling; in fib6_info_uses_dev() local
5821 list_for_each_entry_safe(sibling, next_sibling, in fib6_info_uses_dev()

Completed in 39 milliseconds