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()
186 struct fib6_node *fn; in node_alloc() local
188 fn = kmem_cache_zalloc(fib6_node_kmem, GFP_ATOMIC); in node_alloc()
189 if (fn) in node_alloc()
192 return fn; in node_alloc()
195 static void node_free_immediate(struct net *net, struct fib6_node *fn) in node_free_immediate() argument
197 kmem_cache_free(fib6_node_kmem, fn); in node_free_immediate()
201 static void node_free(struct net *net, struct fib6_node *fn) in node_free() argument
203 kfree_rcu(fn, rcu); in node_free()
762 struct fib6_node *fn, *in, *ln; in fib6_add_1() local
770 fn = root; in fib6_add_1()
773 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1()
780 if (plen < fn->fn_bit || in fib6_add_1()
781 !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) { in fib6_add_1()
798 if (plen == fn->fn_bit) { in fib6_add_1()
800 if (!(fn->fn_flags & RTN_RTINFO)) { in fib6_add_1()
801 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
804 } else if (fn->fn_flags & RTN_TL_ROOT && in fib6_add_1()
805 rcu_access_pointer(fn->leaf) == in fib6_add_1()
807 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
810 return fn; in fib6_add_1()
818 dir = addr_bit_set(addr, fn->fn_bit); in fib6_add_1()
819 pn = fn; in fib6_add_1()
820 fn = dir ? in fib6_add_1()
821 rcu_dereference_protected(fn->right, in fib6_add_1()
823 rcu_dereference_protected(fn->left, in fib6_add_1()
825 } while (fn); in fib6_add_1()
874 pn = rcu_dereference_protected(fn->parent, in fib6_add_1()
888 * (new leaf node)[ln] (old node)[fn] in fib6_add_1()
913 in->leaf = fn->leaf; in fib6_add_1()
926 rcu_assign_pointer(fn->parent, in); in fib6_add_1()
930 rcu_assign_pointer(in->left, fn); in fib6_add_1()
933 rcu_assign_pointer(in->right, fn); in fib6_add_1()
940 * (old node)[fn] NULL in fib6_add_1()
953 RCU_INIT_POINTER(ln->right, fn); in fib6_add_1()
955 RCU_INIT_POINTER(ln->left, fn); in fib6_add_1()
957 rcu_assign_pointer(fn->parent, ln); in fib6_add_1()
1031 static void fib6_purge_rt(struct fib6_info *rt, struct fib6_node *fn, in fib6_purge_rt() argument
1056 while (fn) { in fib6_purge_rt()
1057 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_purge_rt()
1060 if (!(fn->fn_flags & RTN_RTINFO) && leaf == rt) { in fib6_purge_rt()
1061 new_leaf = fib6_find_prefix(net, table, fn); in fib6_purge_rt()
1064 rcu_assign_pointer(fn->leaf, new_leaf); in fib6_purge_rt()
1067 fn = rcu_dereference_protected(fn->parent, in fib6_purge_rt()
1080 static int fib6_add_rt2node(struct fib6_node *fn, struct fib6_info *rt, in fib6_add_rt2node() argument
1084 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_rt2node()
1102 ins = &fn->leaf; in fib6_add_rt2node()
1182 if (ins == &fn->leaf) in fib6_add_rt2node()
1183 fn->rr_ptr = NULL; in fib6_add_rt2node()
1237 (notify_sibling_rt || ins == &fn->leaf)) { in fib6_add_rt2node()
1272 rcu_assign_pointer(rt->fib6_node, fn); in fib6_add_rt2node()
1278 if (!(fn->fn_flags & RTN_RTINFO)) { in fib6_add_rt2node()
1280 fn->fn_flags |= RTN_RTINFO; in fib6_add_rt2node()
1293 if (!info->skip_notify_kernel && ins == &fn->leaf) { in fib6_add_rt2node()
1302 rcu_assign_pointer(rt->fib6_node, fn); in fib6_add_rt2node()
1307 if (!(fn->fn_flags & RTN_RTINFO)) { in fib6_add_rt2node()
1309 fn->fn_flags |= RTN_RTINFO; in fib6_add_rt2node()
1314 if (rcu_access_pointer(fn->rr_ptr) == iter) in fib6_add_rt2node()
1315 fn->rr_ptr = NULL; in fib6_add_rt2node()
1329 if (rcu_access_pointer(fn->rr_ptr) == iter) in fib6_add_rt2node()
1330 fn->rr_ptr = NULL; in fib6_add_rt2node()
1346 static int fib6_add_rt2node_nh(struct fib6_node *fn, struct fib6_info *rt, in fib6_add_rt2node_nh() argument
1358 err = fib6_add_rt2node(fn, rt, info, extack, purge_list); in fib6_add_rt2node_nh()
1386 struct fib6_node *fn = rcu_dereference_protected(rt->fib6_node, in __fib6_update_sernum_upto_root() local
1391 while (fn) { in __fib6_update_sernum_upto_root()
1392 WRITE_ONCE(fn->fn_sernum, sernum); in __fib6_update_sernum_upto_root()
1393 fn = rcu_dereference_protected(fn->parent, in __fib6_update_sernum_upto_root()
1423 struct fib6_node *fn; in fib6_add() local
1440 fn = fib6_add_1(info->nl_net, table, root, in fib6_add()
1444 if (IS_ERR(fn)) { in fib6_add()
1445 err = PTR_ERR(fn); in fib6_add()
1446 fn = NULL; in fib6_add()
1451 pn = fn; in fib6_add()
1456 if (!rcu_access_pointer(fn->subtree)) { in fib6_add()
1462 * fn[main tree] in fib6_add()
1497 rcu_assign_pointer(sfn->parent, fn); in fib6_add()
1498 rcu_assign_pointer(fn->subtree, sfn); in fib6_add()
1500 sn = fib6_add_1(info->nl_net, table, FIB6_SUBTREE(fn), in fib6_add()
1511 if (!rcu_access_pointer(fn->leaf)) { in fib6_add()
1512 if (fn->fn_flags & RTN_TL_ROOT) { in fib6_add()
1514 rcu_assign_pointer(fn->leaf, in fib6_add()
1518 rcu_assign_pointer(fn->leaf, rt); in fib6_add()
1521 fn = sn; in fib6_add()
1526 err = fib6_add_rt2node_nh(fn, rt, info, extack, &purge_list); in fib6_add()
1528 err = fib6_add_rt2node(fn, rt, info, extack, &purge_list); in fib6_add()
1534 fib6_purge_rt(iter, fn, info->nl_net); in fib6_add()
1553 if (pn != fn) { in fib6_add()
1580 /* fn->leaf could be NULL and fib6_repair_tree() needs to be called if: in fib6_add()
1581 * 1. fn is an intermediate node and we failed to add the new in fib6_add()
1584 * 2. fn is the root node in the table and we fail to add the first in fib6_add()
1587 if (fn && in fib6_add()
1588 (!(fn->fn_flags & (RTN_RTINFO|RTN_ROOT)) || in fib6_add()
1589 (fn->fn_flags & RTN_TL_ROOT && in fib6_add()
1590 !rcu_access_pointer(fn->leaf)))) in fib6_add()
1591 fib6_repair_tree(info->nl_net, table, fn); in fib6_add()
1608 struct fib6_node *fn; in fib6_node_lookup_1() local
1618 fn = root; in fib6_node_lookup_1()
1623 dir = addr_bit_set(args->addr, fn->fn_bit); in fib6_node_lookup_1()
1625 next = dir ? rcu_dereference(fn->right) : in fib6_node_lookup_1()
1626 rcu_dereference(fn->left); in fib6_node_lookup_1()
1629 fn = next; in fib6_node_lookup_1()
1635 while (fn) { in fib6_node_lookup_1()
1636 struct fib6_node *subtree = FIB6_SUBTREE(fn); in fib6_node_lookup_1()
1638 if (subtree || fn->fn_flags & RTN_RTINFO) { in fib6_node_lookup_1()
1639 struct fib6_info *leaf = rcu_dereference(fn->leaf); in fib6_node_lookup_1()
1655 fn = sfn; in fib6_node_lookup_1()
1658 if (fn->fn_flags & RTN_RTINFO) in fib6_node_lookup_1()
1659 return fn; in fib6_node_lookup_1()
1663 if (fn->fn_flags & RTN_ROOT) in fib6_node_lookup_1()
1666 fn = rcu_dereference(fn->parent); in fib6_node_lookup_1()
1678 struct fib6_node *fn; in fib6_node_lookup() local
1695 fn = fib6_node_lookup_1(root, daddr ? args : args + 1); in fib6_node_lookup()
1696 if (!fn || fn->fn_flags & RTN_TL_ROOT) in fib6_node_lookup()
1697 fn = root; in fib6_node_lookup()
1699 return fn; in fib6_node_lookup()
1705 * exact_match == true means we try to find fn with exact match of
1707 * exact_match == false means we try to find fn with longest prefix
1708 * match of the passed in prefix addr. This is useful for finding fn
1719 struct fib6_node *fn, *prev = NULL; in fib6_locate_1() local
1721 for (fn = root; fn ; ) { in fib6_locate_1()
1722 struct fib6_info *leaf = rcu_dereference(fn->leaf); in fib6_locate_1()
1727 if (plen <= fn->fn_bit) in fib6_locate_1()
1738 if (plen < fn->fn_bit || in fib6_locate_1()
1739 !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) in fib6_locate_1()
1742 if (plen == fn->fn_bit) in fib6_locate_1()
1743 return fn; in fib6_locate_1()
1745 if (fn->fn_flags & RTN_RTINFO) in fib6_locate_1()
1746 prev = fn; in fib6_locate_1()
1752 if (addr_bit_set(addr, fn->fn_bit)) in fib6_locate_1()
1753 fn = rcu_dereference(fn->right); in fib6_locate_1()
1755 fn = rcu_dereference(fn->left); in fib6_locate_1()
1769 struct fib6_node *fn; in fib6_locate() local
1771 fn = fib6_locate_1(root, daddr, dst_len, in fib6_locate()
1778 if (fn) { in fib6_locate()
1779 struct fib6_node *subtree = FIB6_SUBTREE(fn); in fib6_locate()
1782 fn = fib6_locate_1(subtree, saddr, src_len, in fib6_locate()
1790 if (fn && fn->fn_flags & RTN_RTINFO) in fib6_locate()
1791 return fn; in fib6_locate()
1804 struct fib6_node *fn) in fib6_find_prefix() argument
1808 if (fn->fn_flags & RTN_ROOT) in fib6_find_prefix()
1811 while (fn) { in fib6_find_prefix()
1812 child_left = rcu_dereference_protected(fn->left, in fib6_find_prefix()
1814 child_right = rcu_dereference_protected(fn->right, in fib6_find_prefix()
1823 fn = FIB6_SUBTREE(fn); in fib6_find_prefix()
1829 * Called to trim the tree of intermediate nodes when possible. "fn"
1836 struct fib6_node *fn) in fib6_repair_tree() argument
1844 /* Set fn->leaf to null_entry for root node. */ in fib6_repair_tree()
1845 if (fn->fn_flags & RTN_TL_ROOT) { in fib6_repair_tree()
1846 rcu_assign_pointer(fn->leaf, net->ipv6.fib6_null_entry); in fib6_repair_tree()
1847 return fn; in fib6_repair_tree()
1851 struct fib6_node *fn_r = rcu_dereference_protected(fn->right, in fib6_repair_tree()
1853 struct fib6_node *fn_l = rcu_dereference_protected(fn->left, in fib6_repair_tree()
1855 struct fib6_node *pn = rcu_dereference_protected(fn->parent, in fib6_repair_tree()
1861 struct fib6_info *fn_leaf = rcu_dereference_protected(fn->leaf, in fib6_repair_tree()
1867 pr_debug("fixing tree: plen=%d iter=%d\n", fn->fn_bit, iter); in fib6_repair_tree()
1870 WARN_ON(fn->fn_flags & RTN_RTINFO); in fib6_repair_tree()
1871 WARN_ON(fn->fn_flags & RTN_TL_ROOT); in fib6_repair_tree()
1885 if (children == 3 || FIB6_SUBTREE(fn) in fib6_repair_tree()
1887 /* Subtree root (i.e. fn) may have one child */ in fib6_repair_tree()
1888 || (children && fn->fn_flags & RTN_ROOT) in fib6_repair_tree()
1891 new_fn_leaf = fib6_find_prefix(net, table, fn); in fib6_repair_tree()
1899 rcu_assign_pointer(fn->leaf, new_fn_leaf); in fib6_repair_tree()
1904 if (FIB6_SUBTREE(pn) == fn) { in fib6_repair_tree()
1905 WARN_ON(!(fn->fn_flags & RTN_ROOT)); in fib6_repair_tree()
1909 WARN_ON(fn->fn_flags & RTN_ROOT); in fib6_repair_tree()
1911 if (pn_r == fn) in fib6_repair_tree()
1913 else if (pn_l == fn) in fib6_repair_tree()
1929 if (w->node == fn) { in fib6_repair_tree()
1936 if (w->node == fn) { in fib6_repair_tree()
1952 node_free(net, fn); in fib6_repair_tree()
1958 fn = pn; in fib6_repair_tree()
1962 static void fib6_del_route(struct fib6_table *table, struct fib6_node *fn, in fib6_del_route() argument
1976 leaf = rcu_dereference_protected(fn->leaf, in fib6_del_route()
1993 if (rcu_access_pointer(fn->rr_ptr) == rt) in fib6_del_route()
1994 fn->rr_ptr = NULL; in fib6_del_route()
2034 if (!rcu_access_pointer(fn->leaf)) { in fib6_del_route()
2035 if (!(fn->fn_flags & RTN_TL_ROOT)) { in fib6_del_route()
2036 fn->fn_flags &= ~RTN_RTINFO; in fib6_del_route()
2039 fn = fib6_repair_tree(net, table, fn); in fib6_del_route()
2042 fib6_purge_rt(rt, fn, net); in fib6_del_route()
2064 struct fib6_node *fn; in fib6_del() local
2070 fn = rcu_dereference_protected(rt->fib6_node, in fib6_del()
2072 if (!fn) in fib6_del()
2075 WARN_ON(!(fn->fn_flags & RTN_RTINFO)); in fib6_del()
2081 for (rtp = &fn->leaf; *rtp; rtp = rtp_next) { in fib6_del()
2087 fib6_del_route(table, fn, rtp, info); in fib6_del()
2123 struct fib6_node *fn, *pn, *left, *right; in fib6_walk_continue() local
2129 fn = w->node; in fib6_walk_continue()
2130 if (!fn) in fib6_walk_continue()
2136 if (FIB6_SUBTREE(fn)) { in fib6_walk_continue()
2137 w->node = FIB6_SUBTREE(fn); in fib6_walk_continue()
2144 left = rcu_dereference_protected(fn->left, 1); in fib6_walk_continue()
2153 right = rcu_dereference_protected(fn->right, 1); in fib6_walk_continue()
2160 w->leaf = rcu_dereference_protected(fn->leaf, 1); in fib6_walk_continue()
2163 if (w->leaf && fn->fn_flags & RTN_RTINFO) { in fib6_walk_continue()
2182 if (fn == w->root) in fib6_walk_continue()
2184 pn = rcu_dereference_protected(fn->parent, 1); in fib6_walk_continue()
2189 if (FIB6_SUBTREE(pn) == fn) { in fib6_walk_continue()
2190 WARN_ON(!(fn->fn_flags & RTN_ROOT)); in fib6_walk_continue()
2195 if (left == fn) { in fib6_walk_continue()
2199 if (right == fn) { in fib6_walk_continue()