Lines Matching refs:leaf

245 		rcu_assign_pointer(table->tb6_root.leaf,  in fib6_alloc_table()
461 err = fib6_rt_dump(w->leaf, w->args); in fib6_node_dump()
462 w->leaf = NULL; in fib6_node_dump()
524 w->leaf = rt; in fib6_dump_node()
545 w->leaf = NULL; in fib6_dump_node()
760 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1() local
762 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_add_1()
788 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
789 fib6_info_release(leaf); in fib6_add_1()
792 rcu_access_pointer(fn->leaf) == in fib6_add_1()
794 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
900 in->leaf = fn->leaf; in fib6_add_1()
901 fib6_info_hold(rcu_dereference_protected(in->leaf, in fib6_add_1()
1045 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_purge_rt() local
1048 if (!(fn->fn_flags & RTN_RTINFO) && leaf == rt) { in fib6_purge_rt()
1052 rcu_assign_pointer(fn->leaf, new_leaf); in fib6_purge_rt()
1069 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_rt2node() local
1087 ins = &fn->leaf; in fib6_add_rt2node()
1089 for (iter = leaf; iter; in fib6_add_rt2node()
1163 if (ins == &fn->leaf) in fib6_add_rt2node()
1172 sibling = leaf; in fib6_add_rt2node()
1215 (notify_sibling_rt || ins == &fn->leaf)) { in fib6_add_rt2node()
1268 if (!info->skip_notify_kernel && ins == &fn->leaf) { in fib6_add_rt2node()
1426 rcu_assign_pointer(sfn->leaf, in fib6_add()
1462 if (!rcu_access_pointer(fn->leaf)) { in fib6_add()
1465 rcu_assign_pointer(fn->leaf, in fib6_add()
1469 rcu_assign_pointer(fn->leaf, rt); in fib6_add()
1493 rcu_dereference_protected(pn->leaf, in fib6_add()
1497 RCU_INIT_POINTER(pn->leaf, NULL); in fib6_add()
1511 rcu_assign_pointer(pn->leaf, pn_leaf); in fib6_add()
1532 !rcu_access_pointer(fn->leaf)))) in fib6_add()
1581 struct fib6_info *leaf = rcu_dereference(fn->leaf); in fib6_node_lookup_1() local
1584 if (!leaf) in fib6_node_lookup_1()
1587 key = (struct rt6key *) ((u8 *)leaf + args->offset); in fib6_node_lookup_1()
1664 struct fib6_info *leaf = rcu_dereference(fn->leaf); in fib6_locate_1() local
1668 if (!leaf) { in fib6_locate_1()
1675 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_locate_1()
1759 return rcu_dereference_protected(child_left->leaf, in fib6_find_prefix()
1762 return rcu_dereference_protected(child_right->leaf, in fib6_find_prefix()
1788 rcu_assign_pointer(fn->leaf, net->ipv6.fib6_null_entry); in fib6_repair_tree()
1803 struct fib6_info *fn_leaf = rcu_dereference_protected(fn->leaf, in fib6_repair_tree()
1805 struct fib6_info *pn_leaf = rcu_dereference_protected(pn->leaf, in fib6_repair_tree()
1841 rcu_assign_pointer(fn->leaf, new_fn_leaf); in fib6_repair_tree()
1895 RCU_INIT_POINTER(pn->leaf, NULL); in fib6_repair_tree()
1904 struct fib6_info *leaf, *replace_rt = NULL; in fib6_del_route() local
1917 leaf = rcu_dereference_protected(fn->leaf, in fib6_del_route()
1919 if (leaf == rt && !rt->fib6_nsiblings) { in fib6_del_route()
1946 if (rt->fib6_metric == leaf->fib6_metric && in fib6_del_route()
1947 rt6_qualify_for_ecmp(leaf)) in fib6_del_route()
1960 if (w->state == FWS_C && w->leaf == rt) { in fib6_del_route()
1962 w->leaf = rcu_dereference_protected(rt->fib6_next, in fib6_del_route()
1964 if (!w->leaf) in fib6_del_route()
1974 if (!rcu_access_pointer(fn->leaf)) { in fib6_del_route()
2021 for (rtp = &fn->leaf; *rtp; rtp = rtp_next) { in fib6_del()
2100 w->leaf = rcu_dereference_protected(fn->leaf, 1); in fib6_walk_continue()
2103 if (w->leaf && fn->fn_flags & RTN_RTINFO) { in fib6_walk_continue()
2141 w->leaf = rcu_dereference_protected(w->node->leaf, 1); in fib6_walk_continue()
2181 w->leaf = NULL; in fib6_clean_node()
2188 w->leaf = rt; in fib6_clean_node()
2209 w->leaf = rt; in fib6_clean_node()
2384 rcu_assign_pointer(net->ipv6.fib6_main_tbl->tb6_root.leaf, in fib6_net_init()
2396 rcu_assign_pointer(net->ipv6.fib6_local_tbl->tb6_root.leaf, in fib6_net_init()
2513 iter->w.leaf = NULL; in ipv6_route_native_seq_show()
2525 iter->w.leaf = rcu_dereference_protected( in ipv6_route_yield()
2526 iter->w.leaf->fib6_next, in ipv6_route_yield()
2529 if (!iter->skip && iter->w.leaf) in ipv6_route_yield()
2531 } while (iter->w.leaf); in ipv6_route_yield()
2603 return iter->w.leaf; in ipv6_route_seq_next()
2681 iter->w.leaf = NULL; in ipv6_route_seq_show()