| /kernel/linux/linux-5.10/scripts/dtc/ |
| H A D | livetree.c | 195 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()
|
| H A D | dtc.h | 188 struct node *next_sibling; member
218 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
|
| H A D | checks.c | 273 for (child2 = child->next_sibling; in check_duplicate_node_names()
275 child2 = child2->next_sibling) in check_duplicate_node_names()
|
| /kernel/linux/linux-6.6/scripts/dtc/ |
| H A D | livetree.c | 195 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()
|
| H A D | dtc.h | 224 struct node *next_sibling; member
254 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
|
| H A D | checks.c | 281 for (child2 = child->next_sibling; in check_duplicate_node_names()
283 child2 = child2->next_sibling) in check_duplicate_node_names()
|
| /kernel/linux/linux-6.6/drivers/of/ |
| H A D | unittest.c | 3166 struct device_node *prev_sibling, *next_sibling; in of_unittest_lifecycle() local
3276 next_sibling = prev_sibling->sibling; in of_unittest_lifecycle()
3278 np->child = next_sibling; in of_unittest_lifecycle()
3279 next_sibling = next_sibling->sibling; in of_unittest_lifecycle()
3281 while (next_sibling) { in of_unittest_lifecycle()
3282 if (!strcmp(next_sibling->full_name, "refcount-node")) in of_unittest_lifecycle()
3283 prev_sibling->sibling = next_sibling->sibling; in of_unittest_lifecycle()
3284 prev_sibling = next_sibling; in of_unittest_lifecycle()
3285 next_sibling in of_unittest_lifecycle()
[all...] |
| /kernel/linux/linux-5.10/net/ipv6/ |
| H A D | ip6_fib.c | 1230 struct fib6_info *sibling, *next_sibling; in fib6_add_rt2node() local
1238 list_for_each_entry_safe(sibling, next_sibling, in fib6_add_rt2node()
1244 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()
|
| H A D | route.c | 416 struct fib6_info *sibling, *next_sibling; in fib6_select_path() local
440 list_for_each_entry_safe(sibling, next_sibling, &match->fib6_siblings, in fib6_select_path()
3814 struct fib6_info *sibling, *next_sibling; in __ip6_del_rt_siblings() local
3857 list_for_each_entry_safe(sibling, next_sibling, in __ip6_del_rt_siblings()
5441 struct fib6_info *sibling, *next_sibling; in rt6_nlmsg_size() local
5448 list_for_each_entry_safe(sibling, next_sibling, in rt6_nlmsg_size()
5611 struct fib6_info *sibling, *next_sibling; in rt6_fill_node() local
5623 list_for_each_entry_safe(sibling, next_sibling, in rt6_fill_node()
5704 struct fib6_info *sibling, *next_sibling; in fib6_info_uses_dev() local
5706 list_for_each_entry_safe(sibling, next_sibling, in fib6_info_uses_dev()
[all...] |
| /kernel/linux/linux-6.6/net/ipv6/ |
| H A D | ip6_fib.c | 1227 struct fib6_info *sibling, *next_sibling; in fib6_add_rt2node() local
1235 list_for_each_entry_safe(sibling, next_sibling, in fib6_add_rt2node()
1241 rt6_multipath_rebalance(next_sibling); in fib6_add_rt2node()
1936 struct fib6_info *sibling, *next_sibling; in fib6_del_route() local
1946 list_for_each_entry_safe(sibling, next_sibling, in fib6_del_route()
1951 rt6_multipath_rebalance(next_sibling); in fib6_del_route()
|
| H A D | route.c | 417 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()
5534 struct fib6_info *sibling, *next_sibling; in rt6_nlmsg_size() local
5541 list_for_each_entry_safe(sibling, next_sibling, in rt6_nlmsg_size()
5708 struct fib6_info *sibling, *next_sibling; in rt6_fill_node() local
5720 list_for_each_entry_safe(sibling, next_sibling, in rt6_fill_node()
5803 struct fib6_info *sibling, *next_sibling; in fib6_info_uses_dev() local
5805 list_for_each_entry_safe(sibling, next_sibling, in fib6_info_uses_dev()
[all...] |