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

/linux-master/scripts/dtc/
H A Dlivetree.c195 new_node->children = new_child->next_sibling;
197 new_child->next_sibling = NULL;
260 assert(first->next_sibling == NULL);
262 first->next_sibling = list;
302 child->next_sibling = NULL;
307 p = &((*p)->next_sibling);
321 node = node->next_sibling;
788 tbl[i]->next_sibling = tbl[i+1];
789 tbl[n-1]->next_sibling = NULL;
H A Ddtc.h224 struct node *next_sibling; member in struct:node
254 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
H A Dchecks.c281 for (child2 = child->next_sibling;
283 child2 = child2->next_sibling)
/linux-master/drivers/of/
H A Dunittest.c3233 struct device_node *prev_sibling, *next_sibling; local
3343 next_sibling = prev_sibling->sibling;
3345 np->child = next_sibling;
3346 next_sibling = next_sibling->sibling;
3348 while (next_sibling) {
3349 if (!strcmp(next_sibling->full_name, "refcount-node"))
3350 prev_sibling->sibling = next_sibling->sibling;
3351 prev_sibling = next_sibling;
3352 next_sibling
[all...]
/linux-master/net/ipv6/
H A Dip6_fib.c1237 struct fib6_info *sibling, *next_sibling; local
1245 list_for_each_entry_safe(sibling, next_sibling,
1251 rt6_multipath_rebalance(next_sibling);
1954 struct fib6_info *sibling, *next_sibling; local
1964 list_for_each_entry_safe(sibling, next_sibling,
1969 rt6_multipath_rebalance(next_sibling);
H A Droute.c417 struct fib6_info *sibling, *next_sibling; local
444 list_for_each_entry_safe(sibling, next_sibling, &match->fib6_siblings,
3906 struct fib6_info *sibling, *next_sibling; local
3949 list_for_each_entry_safe(sibling, next_sibling,
5545 struct fib6_info *sibling, *next_sibling; local
5552 list_for_each_entry_safe(sibling, next_sibling,
5719 struct fib6_info *sibling, *next_sibling; local
5731 list_for_each_entry_safe(sibling, next_sibling,
5814 struct fib6_info *sibling, *next_sibling; local
5816 list_for_each_entry_safe(sibling, next_sibling,
[all...]

Completed in 326 milliseconds