Lines Matching refs:leaf

240 		rcu_assign_pointer(table->tb6_root.leaf,  in fib6_alloc_table()
471 err = fib6_rt_dump(w->leaf, w->args); in fib6_node_dump()
472 w->leaf = NULL; in fib6_node_dump()
534 w->leaf = rt; in fib6_dump_node()
555 w->leaf = NULL; in fib6_dump_node()
781 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1() local
783 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_add_1()
809 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
810 fib6_info_release(leaf); in fib6_add_1()
813 rcu_access_pointer(fn->leaf) == in fib6_add_1()
815 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
921 in->leaf = fn->leaf; in fib6_add_1()
922 fib6_info_hold(rcu_dereference_protected(in->leaf, in fib6_add_1()
1065 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_purge_rt() local
1068 if (!(fn->fn_flags & RTN_RTINFO) && leaf == rt) { in fib6_purge_rt()
1072 rcu_assign_pointer(fn->leaf, new_leaf); in fib6_purge_rt()
1092 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_rt2node() local
1110 ins = &fn->leaf; in fib6_add_rt2node()
1112 for (iter = leaf; iter; in fib6_add_rt2node()
1195 if (ins == &fn->leaf) in fib6_add_rt2node()
1204 sibling = leaf; in fib6_add_rt2node()
1250 (notify_sibling_rt || ins == &fn->leaf)) { in fib6_add_rt2node()
1306 if (!info->skip_notify_kernel && ins == &fn->leaf) { in fib6_add_rt2node()
1488 rcu_assign_pointer(sfn->leaf, in fib6_add()
1524 if (!rcu_access_pointer(fn->leaf)) { in fib6_add()
1527 rcu_assign_pointer(fn->leaf, in fib6_add()
1531 rcu_assign_pointer(fn->leaf, rt); in fib6_add()
1568 rcu_dereference_protected(pn->leaf, in fib6_add()
1572 RCU_INIT_POINTER(pn->leaf, NULL); in fib6_add()
1582 rcu_assign_pointer(pn->leaf, pn_leaf); in fib6_add()
1603 !rcu_access_pointer(fn->leaf)))) in fib6_add()
1652 struct fib6_info *leaf = rcu_dereference(fn->leaf); in fib6_node_lookup_1() local
1655 if (!leaf) in fib6_node_lookup_1()
1658 key = (struct rt6key *) ((u8 *)leaf + args->offset); in fib6_node_lookup_1()
1735 struct fib6_info *leaf = rcu_dereference(fn->leaf); in fib6_locate_1() local
1739 if (!leaf) { in fib6_locate_1()
1746 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_locate_1()
1830 return rcu_dereference_protected(child_left->leaf, in fib6_find_prefix()
1833 return rcu_dereference_protected(child_right->leaf, in fib6_find_prefix()
1859 rcu_assign_pointer(fn->leaf, net->ipv6.fib6_null_entry); in fib6_repair_tree()
1874 struct fib6_info *fn_leaf = rcu_dereference_protected(fn->leaf, in fib6_repair_tree()
1876 struct fib6_info *pn_leaf = rcu_dereference_protected(pn->leaf, in fib6_repair_tree()
1912 rcu_assign_pointer(fn->leaf, new_fn_leaf); in fib6_repair_tree()
1969 RCU_INIT_POINTER(pn->leaf, NULL); in fib6_repair_tree()
1978 struct fib6_info *leaf, *replace_rt = NULL; in fib6_del_route() local
1989 leaf = rcu_dereference_protected(fn->leaf, in fib6_del_route()
1991 if (leaf == rt && !rt->fib6_nsiblings) { in fib6_del_route()
2018 if (rt->fib6_metric == leaf->fib6_metric && in fib6_del_route()
2019 rt6_qualify_for_ecmp(leaf)) in fib6_del_route()
2033 if (w->state == FWS_C && w->leaf == rt) { in fib6_del_route()
2035 w->leaf = rcu_dereference_protected(rt->fib6_next, in fib6_del_route()
2037 if (!w->leaf) in fib6_del_route()
2047 if (!rcu_access_pointer(fn->leaf)) { in fib6_del_route()
2094 for (rtp = &fn->leaf; *rtp; rtp = rtp_next) { in fib6_del()
2173 w->leaf = rcu_dereference_protected(fn->leaf, 1); in fib6_walk_continue()
2176 if (w->leaf && fn->fn_flags & RTN_RTINFO) { in fib6_walk_continue()
2214 w->leaf = rcu_dereference_protected(w->node->leaf, 1); in fib6_walk_continue()
2254 w->leaf = NULL; in fib6_clean_node()
2261 w->leaf = rt; in fib6_clean_node()
2282 w->leaf = rt; in fib6_clean_node()
2504 rcu_assign_pointer(net->ipv6.fib6_main_tbl->tb6_root.leaf, in fib6_net_init()
2516 rcu_assign_pointer(net->ipv6.fib6_local_tbl->tb6_root.leaf, in fib6_net_init()
2637 iter->w.leaf = NULL; in ipv6_route_native_seq_show()
2649 iter->w.leaf = rcu_dereference_protected( in ipv6_route_yield()
2650 iter->w.leaf->fib6_next, in ipv6_route_yield()
2653 if (!iter->skip && iter->w.leaf) in ipv6_route_yield()
2655 } while (iter->w.leaf); in ipv6_route_yield()
2729 return iter->w.leaf; in ipv6_route_seq_next()
2807 iter->w.leaf = NULL; in ipv6_route_seq_show()