Lines Matching full:fn
59 struct fib6_node *fn);
62 struct fib6_node *fn);
109 struct fib6_node *fn; in fib6_update_sernum() local
111 fn = rcu_dereference_protected(f6i->fib6_node, in fib6_update_sernum()
113 if (fn) in fib6_update_sernum()
114 WRITE_ONCE(fn->fn_sernum, fib6_new_sernum(net)); in fib6_update_sernum()
184 struct fib6_node *fn; in node_alloc() local
186 fn = kmem_cache_zalloc(fib6_node_kmem, GFP_ATOMIC); in node_alloc()
187 if (fn) in node_alloc()
190 return fn; in node_alloc()
193 static void node_free_immediate(struct net *net, struct fib6_node *fn) in node_free_immediate() argument
195 kmem_cache_free(fib6_node_kmem, fn); in node_free_immediate()
201 struct fib6_node *fn = container_of(head, struct fib6_node, rcu); in node_free_rcu() local
203 kmem_cache_free(fib6_node_kmem, fn); in node_free_rcu()
206 static void node_free(struct net *net, struct fib6_node *fn) in node_free() argument
208 call_rcu(&fn->rcu, node_free_rcu); in node_free()
748 struct fib6_node *fn, *in, *ln; in fib6_add_1() local
758 fn = root; in fib6_add_1()
761 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1()
768 if (plen < fn->fn_bit || in fib6_add_1()
769 !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) { in fib6_add_1()
786 if (plen == fn->fn_bit) { in fib6_add_1()
788 if (!(fn->fn_flags & RTN_RTINFO)) { in fib6_add_1()
789 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
792 } else if (fn->fn_flags & RTN_TL_ROOT && in fib6_add_1()
793 rcu_access_pointer(fn->leaf) == in fib6_add_1()
795 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
798 return fn; in fib6_add_1()
806 dir = addr_bit_set(addr, fn->fn_bit); in fib6_add_1()
807 pn = fn; in fib6_add_1()
808 fn = dir ? in fib6_add_1()
809 rcu_dereference_protected(fn->right, in fib6_add_1()
811 rcu_dereference_protected(fn->left, in fib6_add_1()
813 } while (fn); in fib6_add_1()
862 pn = rcu_dereference_protected(fn->parent, in fib6_add_1()
876 * (new leaf node)[ln] (old node)[fn] in fib6_add_1()
901 in->leaf = fn->leaf; in fib6_add_1()
914 rcu_assign_pointer(fn->parent, in); in fib6_add_1()
918 rcu_assign_pointer(in->left, fn); in fib6_add_1()
921 rcu_assign_pointer(in->right, fn); in fib6_add_1()
928 * (old node)[fn] NULL in fib6_add_1()
941 RCU_INIT_POINTER(ln->right, fn); in fib6_add_1()
943 RCU_INIT_POINTER(ln->left, fn); in fib6_add_1()
945 rcu_assign_pointer(fn->parent, ln); in fib6_add_1()
1030 static void fib6_purge_rt(struct fib6_info *rt, struct fib6_node *fn, in fib6_purge_rt() argument
1049 while (fn) { in fib6_purge_rt()
1050 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_purge_rt()
1053 if (!(fn->fn_flags & RTN_RTINFO) && leaf == rt) { in fib6_purge_rt()
1054 new_leaf = fib6_find_prefix(net, table, fn); in fib6_purge_rt()
1057 rcu_assign_pointer(fn->leaf, new_leaf); in fib6_purge_rt()
1060 fn = rcu_dereference_protected(fn->parent, in fib6_purge_rt()
1070 static int fib6_add_rt2node(struct fib6_node *fn, struct fib6_info *rt, in fib6_add_rt2node() argument
1074 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_rt2node()
1092 ins = &fn->leaf; in fib6_add_rt2node()
1168 if (ins == &fn->leaf) in fib6_add_rt2node()
1169 fn->rr_ptr = NULL; in fib6_add_rt2node()
1220 (notify_sibling_rt || ins == &fn->leaf)) { in fib6_add_rt2node()
1252 rcu_assign_pointer(rt->fib6_node, fn); in fib6_add_rt2node()
1258 if (!(fn->fn_flags & RTN_RTINFO)) { in fib6_add_rt2node()
1260 fn->fn_flags |= RTN_RTINFO; in fib6_add_rt2node()
1273 if (!info->skip_notify_kernel && ins == &fn->leaf) { in fib6_add_rt2node()
1282 rcu_assign_pointer(rt->fib6_node, fn); in fib6_add_rt2node()
1287 if (!(fn->fn_flags & RTN_RTINFO)) { in fib6_add_rt2node()
1289 fn->fn_flags |= RTN_RTINFO; in fib6_add_rt2node()
1293 fib6_purge_rt(iter, fn, info->nl_net); in fib6_add_rt2node()
1294 if (rcu_access_pointer(fn->rr_ptr) == iter) in fib6_add_rt2node()
1295 fn->rr_ptr = NULL; in fib6_add_rt2node()
1309 fib6_purge_rt(iter, fn, info->nl_net); in fib6_add_rt2node()
1310 if (rcu_access_pointer(fn->rr_ptr) == iter) in fib6_add_rt2node()
1311 fn->rr_ptr = NULL; in fib6_add_rt2node()
1346 struct fib6_node *fn = rcu_dereference_protected(rt->fib6_node, in __fib6_update_sernum_upto_root() local
1351 while (fn) { in __fib6_update_sernum_upto_root()
1352 WRITE_ONCE(fn->fn_sernum, sernum); in __fib6_update_sernum_upto_root()
1353 fn = rcu_dereference_protected(fn->parent, in __fib6_update_sernum_upto_root()
1382 struct fib6_node *fn; in fib6_add() local
1399 fn = fib6_add_1(info->nl_net, table, root, in fib6_add()
1403 if (IS_ERR(fn)) { in fib6_add()
1404 err = PTR_ERR(fn); in fib6_add()
1405 fn = NULL; in fib6_add()
1410 pn = fn; in fib6_add()
1415 if (!rcu_access_pointer(fn->subtree)) { in fib6_add()
1421 * fn[main tree] in fib6_add()
1456 rcu_assign_pointer(sfn->parent, fn); in fib6_add()
1457 rcu_assign_pointer(fn->subtree, sfn); in fib6_add()
1459 sn = fib6_add_1(info->nl_net, table, FIB6_SUBTREE(fn), in fib6_add()
1470 if (!rcu_access_pointer(fn->leaf)) { in fib6_add()
1471 if (fn->fn_flags & RTN_TL_ROOT) { in fib6_add()
1473 rcu_assign_pointer(fn->leaf, in fib6_add()
1477 rcu_assign_pointer(fn->leaf, rt); in fib6_add()
1480 fn = sn; in fib6_add()
1484 err = fib6_add_rt2node(fn, rt, info, extack); in fib6_add()
1499 if (pn != fn) { in fib6_add()
1526 /* fn->leaf could be NULL and fib6_repair_tree() needs to be called if: in fib6_add()
1527 * 1. fn is an intermediate node and we failed to add the new in fib6_add()
1530 * 2. fn is the root node in the table and we fail to add the first in fib6_add()
1533 if (fn && in fib6_add()
1534 (!(fn->fn_flags & (RTN_RTINFO|RTN_ROOT)) || in fib6_add()
1535 (fn->fn_flags & RTN_TL_ROOT && in fib6_add()
1536 !rcu_access_pointer(fn->leaf)))) in fib6_add()
1537 fib6_repair_tree(info->nl_net, table, fn); in fib6_add()
1554 struct fib6_node *fn; in fib6_node_lookup_1() local
1564 fn = root; in fib6_node_lookup_1()
1569 dir = addr_bit_set(args->addr, fn->fn_bit); in fib6_node_lookup_1()
1571 next = dir ? rcu_dereference(fn->right) : in fib6_node_lookup_1()
1572 rcu_dereference(fn->left); in fib6_node_lookup_1()
1575 fn = next; in fib6_node_lookup_1()
1581 while (fn) { in fib6_node_lookup_1()
1582 struct fib6_node *subtree = FIB6_SUBTREE(fn); in fib6_node_lookup_1()
1584 if (subtree || fn->fn_flags & RTN_RTINFO) { in fib6_node_lookup_1()
1585 struct fib6_info *leaf = rcu_dereference(fn->leaf); in fib6_node_lookup_1()
1601 fn = sfn; in fib6_node_lookup_1()
1604 if (fn->fn_flags & RTN_RTINFO) in fib6_node_lookup_1()
1605 return fn; in fib6_node_lookup_1()
1609 if (fn->fn_flags & RTN_ROOT) in fib6_node_lookup_1()
1612 fn = rcu_dereference(fn->parent); in fib6_node_lookup_1()
1624 struct fib6_node *fn; in fib6_node_lookup() local
1641 fn = fib6_node_lookup_1(root, daddr ? args : args + 1); in fib6_node_lookup()
1642 if (!fn || fn->fn_flags & RTN_TL_ROOT) in fib6_node_lookup()
1643 fn = root; in fib6_node_lookup()
1645 return fn; in fib6_node_lookup()
1651 * exact_match == true means we try to find fn with exact match of
1653 * exact_match == false means we try to find fn with longest prefix
1654 * match of the passed in prefix addr. This is useful for finding fn
1665 struct fib6_node *fn, *prev = NULL; in fib6_locate_1() local
1667 for (fn = root; fn ; ) { in fib6_locate_1()
1668 struct fib6_info *leaf = rcu_dereference(fn->leaf); in fib6_locate_1()
1673 if (plen <= fn->fn_bit) in fib6_locate_1()
1684 if (plen < fn->fn_bit || in fib6_locate_1()
1685 !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) in fib6_locate_1()
1688 if (plen == fn->fn_bit) in fib6_locate_1()
1689 return fn; in fib6_locate_1()
1691 if (fn->fn_flags & RTN_RTINFO) in fib6_locate_1()
1692 prev = fn; in fib6_locate_1()
1698 if (addr_bit_set(addr, fn->fn_bit)) in fib6_locate_1()
1699 fn = rcu_dereference(fn->right); in fib6_locate_1()
1701 fn = rcu_dereference(fn->left); in fib6_locate_1()
1715 struct fib6_node *fn; in fib6_locate() local
1717 fn = fib6_locate_1(root, daddr, dst_len, in fib6_locate()
1724 if (fn) { in fib6_locate()
1725 struct fib6_node *subtree = FIB6_SUBTREE(fn); in fib6_locate()
1728 fn = fib6_locate_1(subtree, saddr, src_len, in fib6_locate()
1736 if (fn && fn->fn_flags & RTN_RTINFO) in fib6_locate()
1737 return fn; in fib6_locate()
1750 struct fib6_node *fn) in fib6_find_prefix() argument
1754 if (fn->fn_flags & RTN_ROOT) in fib6_find_prefix()
1757 while (fn) { in fib6_find_prefix()
1758 child_left = rcu_dereference_protected(fn->left, in fib6_find_prefix()
1760 child_right = rcu_dereference_protected(fn->right, in fib6_find_prefix()
1769 fn = FIB6_SUBTREE(fn); in fib6_find_prefix()
1775 * Called to trim the tree of intermediate nodes when possible. "fn"
1782 struct fib6_node *fn) in fib6_repair_tree() argument
1790 /* Set fn->leaf to null_entry for root node. */ in fib6_repair_tree()
1791 if (fn->fn_flags & RTN_TL_ROOT) { in fib6_repair_tree()
1792 rcu_assign_pointer(fn->leaf, net->ipv6.fib6_null_entry); in fib6_repair_tree()
1793 return fn; in fib6_repair_tree()
1797 struct fib6_node *fn_r = rcu_dereference_protected(fn->right, in fib6_repair_tree()
1799 struct fib6_node *fn_l = rcu_dereference_protected(fn->left, in fib6_repair_tree()
1801 struct fib6_node *pn = rcu_dereference_protected(fn->parent, in fib6_repair_tree()
1807 struct fib6_info *fn_leaf = rcu_dereference_protected(fn->leaf, in fib6_repair_tree()
1813 RT6_TRACE("fixing tree: plen=%d iter=%d\n", fn->fn_bit, iter); in fib6_repair_tree()
1816 WARN_ON(fn->fn_flags & RTN_RTINFO); in fib6_repair_tree()
1817 WARN_ON(fn->fn_flags & RTN_TL_ROOT); in fib6_repair_tree()
1831 if (children == 3 || FIB6_SUBTREE(fn) in fib6_repair_tree()
1833 /* Subtree root (i.e. fn) may have one child */ in fib6_repair_tree()
1834 || (children && fn->fn_flags & RTN_ROOT) in fib6_repair_tree()
1837 new_fn_leaf = fib6_find_prefix(net, table, fn); in fib6_repair_tree()
1845 rcu_assign_pointer(fn->leaf, new_fn_leaf); in fib6_repair_tree()
1850 if (FIB6_SUBTREE(pn) == fn) { in fib6_repair_tree()
1851 WARN_ON(!(fn->fn_flags & RTN_ROOT)); in fib6_repair_tree()
1855 WARN_ON(fn->fn_flags & RTN_ROOT); in fib6_repair_tree()
1857 if (pn_r == fn) in fib6_repair_tree()
1859 else if (pn_l == fn) in fib6_repair_tree()
1875 if (w->node == fn) { in fib6_repair_tree()
1881 if (w->node == fn) { in fib6_repair_tree()
1895 node_free(net, fn); in fib6_repair_tree()
1901 fn = pn; in fib6_repair_tree()
1905 static void fib6_del_route(struct fib6_table *table, struct fib6_node *fn, in fib6_del_route() argument
1921 leaf = rcu_dereference_protected(fn->leaf, in fib6_del_route()
1938 if (rcu_access_pointer(fn->rr_ptr) == rt) in fib6_del_route()
1939 fn->rr_ptr = NULL; in fib6_del_route()
1978 if (!rcu_access_pointer(fn->leaf)) { in fib6_del_route()
1979 if (!(fn->fn_flags & RTN_TL_ROOT)) { in fib6_del_route()
1980 fn->fn_flags &= ~RTN_RTINFO; in fib6_del_route()
1983 fn = fib6_repair_tree(net, table, fn); in fib6_del_route()
1986 fib6_purge_rt(rt, fn, net); in fib6_del_route()
2008 struct fib6_node *fn; in fib6_del() local
2014 fn = rcu_dereference_protected(rt->fib6_node, in fib6_del()
2016 if (!fn) in fib6_del()
2019 WARN_ON(!(fn->fn_flags & RTN_RTINFO)); in fib6_del()
2025 for (rtp = &fn->leaf; *rtp; rtp = rtp_next) { in fib6_del()
2031 fib6_del_route(table, fn, rtp, info); in fib6_del()
2067 struct fib6_node *fn, *pn, *left, *right; in fib6_walk_continue() local
2073 fn = w->node; in fib6_walk_continue()
2074 if (!fn) in fib6_walk_continue()
2080 if (FIB6_SUBTREE(fn)) { in fib6_walk_continue()
2081 w->node = FIB6_SUBTREE(fn); in fib6_walk_continue()
2088 left = rcu_dereference_protected(fn->left, 1); in fib6_walk_continue()
2097 right = rcu_dereference_protected(fn->right, 1); in fib6_walk_continue()
2104 w->leaf = rcu_dereference_protected(fn->leaf, 1); in fib6_walk_continue()
2107 if (w->leaf && fn->fn_flags & RTN_RTINFO) { in fib6_walk_continue()
2126 if (fn == w->root) in fib6_walk_continue()
2128 pn = rcu_dereference_protected(fn->parent, 1); in fib6_walk_continue()
2133 if (FIB6_SUBTREE(pn) == fn) { in fib6_walk_continue()
2134 WARN_ON(!(fn->fn_flags & RTN_ROOT)); in fib6_walk_continue()
2139 if (left == fn) { in fib6_walk_continue()
2143 if (right == fn) { in fib6_walk_continue()