Lines Matching full:fn
57 struct fib6_node *fn);
60 struct fib6_node *fn);
108 struct fib6_node *fn; in fib6_update_sernum() local
110 fn = rcu_dereference_protected(f6i->fib6_node, in fib6_update_sernum()
112 if (fn) in fib6_update_sernum()
113 fn->fn_sernum = fib6_new_sernum(net); in fib6_update_sernum()
183 struct fib6_node *fn; in node_alloc() local
185 fn = kmem_cache_zalloc(fib6_node_kmem, GFP_ATOMIC); in node_alloc()
186 if (fn) in node_alloc()
189 return fn; in node_alloc()
192 static void node_free_immediate(struct net *net, struct fib6_node *fn) in node_free_immediate() argument
194 kmem_cache_free(fib6_node_kmem, fn); in node_free_immediate()
200 struct fib6_node *fn = container_of(head, struct fib6_node, rcu); in node_free_rcu() local
202 kmem_cache_free(fib6_node_kmem, fn); in node_free_rcu()
205 static void node_free(struct net *net, struct fib6_node *fn) in node_free() argument
207 call_rcu(&fn->rcu, node_free_rcu); in node_free()
745 struct fib6_node *fn, *in, *ln; in fib6_add_1() local
755 fn = root; in fib6_add_1()
758 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1()
765 if (plen < fn->fn_bit || in fib6_add_1()
766 !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) { in fib6_add_1()
783 if (plen == fn->fn_bit) { in fib6_add_1()
785 if (!(fn->fn_flags & RTN_RTINFO)) { in fib6_add_1()
786 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
789 } else if (fn->fn_flags & RTN_TL_ROOT && in fib6_add_1()
790 rcu_access_pointer(fn->leaf) == in fib6_add_1()
792 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
795 return fn; in fib6_add_1()
803 dir = addr_bit_set(addr, fn->fn_bit); in fib6_add_1()
804 pn = fn; in fib6_add_1()
805 fn = dir ? in fib6_add_1()
806 rcu_dereference_protected(fn->right, in fib6_add_1()
808 rcu_dereference_protected(fn->left, in fib6_add_1()
810 } while (fn); in fib6_add_1()
859 pn = rcu_dereference_protected(fn->parent, in fib6_add_1()
873 * (new leaf node)[ln] (old node)[fn] in fib6_add_1()
898 in->leaf = fn->leaf; in fib6_add_1()
911 rcu_assign_pointer(fn->parent, in); in fib6_add_1()
915 rcu_assign_pointer(in->left, fn); in fib6_add_1()
918 rcu_assign_pointer(in->right, fn); in fib6_add_1()
925 * (old node)[fn] NULL in fib6_add_1()
938 RCU_INIT_POINTER(ln->right, fn); in fib6_add_1()
940 RCU_INIT_POINTER(ln->left, fn); in fib6_add_1()
942 rcu_assign_pointer(fn->parent, ln); in fib6_add_1()
1023 static void fib6_purge_rt(struct fib6_info *rt, struct fib6_node *fn, in fib6_purge_rt() argument
1040 while (fn) { in fib6_purge_rt()
1041 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_purge_rt()
1044 if (!(fn->fn_flags & RTN_RTINFO) && leaf == rt) { in fib6_purge_rt()
1045 new_leaf = fib6_find_prefix(net, table, fn); in fib6_purge_rt()
1048 rcu_assign_pointer(fn->leaf, new_leaf); in fib6_purge_rt()
1051 fn = rcu_dereference_protected(fn->parent, in fib6_purge_rt()
1061 static int fib6_add_rt2node(struct fib6_node *fn, struct fib6_info *rt, in fib6_add_rt2node() argument
1065 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_rt2node()
1083 ins = &fn->leaf; in fib6_add_rt2node()
1159 if (ins == &fn->leaf) in fib6_add_rt2node()
1160 fn->rr_ptr = NULL; in fib6_add_rt2node()
1211 (notify_sibling_rt || ins == &fn->leaf)) { in fib6_add_rt2node()
1243 rcu_assign_pointer(rt->fib6_node, fn); in fib6_add_rt2node()
1249 if (!(fn->fn_flags & RTN_RTINFO)) { in fib6_add_rt2node()
1251 fn->fn_flags |= RTN_RTINFO; in fib6_add_rt2node()
1264 if (!info->skip_notify_kernel && ins == &fn->leaf) { in fib6_add_rt2node()
1273 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()
1284 fib6_purge_rt(iter, fn, info->nl_net); in fib6_add_rt2node()
1285 if (rcu_access_pointer(fn->rr_ptr) == iter) in fib6_add_rt2node()
1286 fn->rr_ptr = NULL; in fib6_add_rt2node()
1300 fib6_purge_rt(iter, fn, info->nl_net); in fib6_add_rt2node()
1301 if (rcu_access_pointer(fn->rr_ptr) == iter) in fib6_add_rt2node()
1302 fn->rr_ptr = NULL; in fib6_add_rt2node()
1337 struct fib6_node *fn = rcu_dereference_protected(rt->fib6_node, in __fib6_update_sernum_upto_root() local
1342 while (fn) { in __fib6_update_sernum_upto_root()
1343 fn->fn_sernum = sernum; in __fib6_update_sernum_upto_root()
1344 fn = rcu_dereference_protected(fn->parent, in __fib6_update_sernum_upto_root()
1373 struct fib6_node *fn, *pn = NULL; in fib6_add() local
1388 fn = fib6_add_1(info->nl_net, table, root, in fib6_add()
1392 if (IS_ERR(fn)) { in fib6_add()
1393 err = PTR_ERR(fn); in fib6_add()
1394 fn = NULL; in fib6_add()
1398 pn = fn; in fib6_add()
1404 if (!rcu_access_pointer(fn->subtree)) { in fib6_add()
1410 * fn[main tree] in fib6_add()
1445 rcu_assign_pointer(sfn->parent, fn); in fib6_add()
1446 rcu_assign_pointer(fn->subtree, sfn); in fib6_add()
1448 sn = fib6_add_1(info->nl_net, table, FIB6_SUBTREE(fn), in fib6_add()
1459 if (!rcu_access_pointer(fn->leaf)) { in fib6_add()
1460 if (fn->fn_flags & RTN_TL_ROOT) { in fib6_add()
1462 rcu_assign_pointer(fn->leaf, in fib6_add()
1466 rcu_assign_pointer(fn->leaf, rt); in fib6_add()
1469 fn = sn; in fib6_add()
1473 err = fib6_add_rt2node(fn, rt, info, extack); in fib6_add()
1488 if (pn != fn) { in fib6_add()
1519 /* fn->leaf could be NULL and fib6_repair_tree() needs to be called if: in fib6_add()
1520 * 1. fn is an intermediate node and we failed to add the new in fib6_add()
1523 * 2. fn is the root node in the table and we fail to add the first in fib6_add()
1526 if (fn && in fib6_add()
1527 (!(fn->fn_flags & (RTN_RTINFO|RTN_ROOT)) || in fib6_add()
1528 (fn->fn_flags & RTN_TL_ROOT && in fib6_add()
1529 !rcu_access_pointer(fn->leaf)))) in fib6_add()
1530 fib6_repair_tree(info->nl_net, table, fn); in fib6_add()
1547 struct fib6_node *fn; in fib6_node_lookup_1() local
1557 fn = root; in fib6_node_lookup_1()
1562 dir = addr_bit_set(args->addr, fn->fn_bit); in fib6_node_lookup_1()
1564 next = dir ? rcu_dereference(fn->right) : in fib6_node_lookup_1()
1565 rcu_dereference(fn->left); in fib6_node_lookup_1()
1568 fn = next; in fib6_node_lookup_1()
1574 while (fn) { in fib6_node_lookup_1()
1575 struct fib6_node *subtree = FIB6_SUBTREE(fn); in fib6_node_lookup_1()
1577 if (subtree || fn->fn_flags & RTN_RTINFO) { in fib6_node_lookup_1()
1578 struct fib6_info *leaf = rcu_dereference(fn->leaf); in fib6_node_lookup_1()
1594 fn = sfn; in fib6_node_lookup_1()
1597 if (fn->fn_flags & RTN_RTINFO) in fib6_node_lookup_1()
1598 return fn; in fib6_node_lookup_1()
1602 if (fn->fn_flags & RTN_ROOT) in fib6_node_lookup_1()
1605 fn = rcu_dereference(fn->parent); in fib6_node_lookup_1()
1617 struct fib6_node *fn; in fib6_node_lookup() local
1634 fn = fib6_node_lookup_1(root, daddr ? args : args + 1); in fib6_node_lookup()
1635 if (!fn || fn->fn_flags & RTN_TL_ROOT) in fib6_node_lookup()
1636 fn = root; in fib6_node_lookup()
1638 return fn; in fib6_node_lookup()
1644 * exact_match == true means we try to find fn with exact match of
1646 * exact_match == false means we try to find fn with longest prefix
1647 * match of the passed in prefix addr. This is useful for finding fn
1658 struct fib6_node *fn, *prev = NULL; in fib6_locate_1() local
1660 for (fn = root; fn ; ) { in fib6_locate_1()
1661 struct fib6_info *leaf = rcu_dereference(fn->leaf); in fib6_locate_1()
1666 if (plen <= fn->fn_bit) in fib6_locate_1()
1677 if (plen < fn->fn_bit || in fib6_locate_1()
1678 !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) in fib6_locate_1()
1681 if (plen == fn->fn_bit) in fib6_locate_1()
1682 return fn; in fib6_locate_1()
1684 if (fn->fn_flags & RTN_RTINFO) in fib6_locate_1()
1685 prev = fn; in fib6_locate_1()
1691 if (addr_bit_set(addr, fn->fn_bit)) in fib6_locate_1()
1692 fn = rcu_dereference(fn->right); in fib6_locate_1()
1694 fn = rcu_dereference(fn->left); in fib6_locate_1()
1708 struct fib6_node *fn; in fib6_locate() local
1710 fn = fib6_locate_1(root, daddr, dst_len, in fib6_locate()
1717 if (fn) { in fib6_locate()
1718 struct fib6_node *subtree = FIB6_SUBTREE(fn); in fib6_locate()
1721 fn = fib6_locate_1(subtree, saddr, src_len, in fib6_locate()
1729 if (fn && fn->fn_flags & RTN_RTINFO) in fib6_locate()
1730 return fn; in fib6_locate()
1743 struct fib6_node *fn) in fib6_find_prefix() argument
1747 if (fn->fn_flags & RTN_ROOT) in fib6_find_prefix()
1750 while (fn) { in fib6_find_prefix()
1751 child_left = rcu_dereference_protected(fn->left, in fib6_find_prefix()
1753 child_right = rcu_dereference_protected(fn->right, in fib6_find_prefix()
1762 fn = FIB6_SUBTREE(fn); in fib6_find_prefix()
1768 * Called to trim the tree of intermediate nodes when possible. "fn"
1775 struct fib6_node *fn) in fib6_repair_tree() argument
1783 /* Set fn->leaf to null_entry for root node. */ in fib6_repair_tree()
1784 if (fn->fn_flags & RTN_TL_ROOT) { in fib6_repair_tree()
1785 rcu_assign_pointer(fn->leaf, net->ipv6.fib6_null_entry); in fib6_repair_tree()
1786 return fn; in fib6_repair_tree()
1790 struct fib6_node *fn_r = rcu_dereference_protected(fn->right, in fib6_repair_tree()
1792 struct fib6_node *fn_l = rcu_dereference_protected(fn->left, in fib6_repair_tree()
1794 struct fib6_node *pn = rcu_dereference_protected(fn->parent, in fib6_repair_tree()
1800 struct fib6_info *fn_leaf = rcu_dereference_protected(fn->leaf, in fib6_repair_tree()
1806 RT6_TRACE("fixing tree: plen=%d iter=%d\n", fn->fn_bit, iter); in fib6_repair_tree()
1809 WARN_ON(fn->fn_flags & RTN_RTINFO); in fib6_repair_tree()
1810 WARN_ON(fn->fn_flags & RTN_TL_ROOT); in fib6_repair_tree()
1824 if (children == 3 || FIB6_SUBTREE(fn) in fib6_repair_tree()
1826 /* Subtree root (i.e. fn) may have one child */ in fib6_repair_tree()
1827 || (children && fn->fn_flags & RTN_ROOT) in fib6_repair_tree()
1830 new_fn_leaf = fib6_find_prefix(net, table, fn); in fib6_repair_tree()
1838 rcu_assign_pointer(fn->leaf, new_fn_leaf); in fib6_repair_tree()
1843 if (FIB6_SUBTREE(pn) == fn) { in fib6_repair_tree()
1844 WARN_ON(!(fn->fn_flags & RTN_ROOT)); in fib6_repair_tree()
1848 WARN_ON(fn->fn_flags & RTN_ROOT); in fib6_repair_tree()
1850 if (pn_r == fn) in fib6_repair_tree()
1852 else if (pn_l == fn) in fib6_repair_tree()
1868 if (w->node == fn) { in fib6_repair_tree()
1874 if (w->node == fn) { in fib6_repair_tree()
1888 node_free(net, fn); in fib6_repair_tree()
1894 fn = pn; in fib6_repair_tree()
1898 static void fib6_del_route(struct fib6_table *table, struct fib6_node *fn, in fib6_del_route() argument
1914 leaf = rcu_dereference_protected(fn->leaf, in fib6_del_route()
1934 if (rcu_access_pointer(fn->rr_ptr) == rt) in fib6_del_route()
1935 fn->rr_ptr = NULL; in fib6_del_route()
1974 if (!rcu_access_pointer(fn->leaf)) { in fib6_del_route()
1975 if (!(fn->fn_flags & RTN_TL_ROOT)) { in fib6_del_route()
1976 fn->fn_flags &= ~RTN_RTINFO; in fib6_del_route()
1979 fn = fib6_repair_tree(net, table, fn); in fib6_del_route()
1982 fib6_purge_rt(rt, fn, net); in fib6_del_route()
2004 struct fib6_node *fn; in fib6_del() local
2010 fn = rcu_dereference_protected(rt->fib6_node, in fib6_del()
2012 if (!fn) in fib6_del()
2015 WARN_ON(!(fn->fn_flags & RTN_RTINFO)); in fib6_del()
2021 for (rtp = &fn->leaf; *rtp; rtp = rtp_next) { in fib6_del()
2027 fib6_del_route(table, fn, rtp, info); in fib6_del()
2063 struct fib6_node *fn, *pn, *left, *right; in fib6_walk_continue() local
2069 fn = w->node; in fib6_walk_continue()
2070 if (!fn) in fib6_walk_continue()
2076 if (FIB6_SUBTREE(fn)) { in fib6_walk_continue()
2077 w->node = FIB6_SUBTREE(fn); in fib6_walk_continue()
2084 left = rcu_dereference_protected(fn->left, 1); in fib6_walk_continue()
2093 right = rcu_dereference_protected(fn->right, 1); in fib6_walk_continue()
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()
2122 if (fn == w->root) in fib6_walk_continue()
2124 pn = rcu_dereference_protected(fn->parent, 1); in fib6_walk_continue()
2129 if (FIB6_SUBTREE(pn) == fn) { in fib6_walk_continue()
2130 WARN_ON(!(fn->fn_flags & RTN_ROOT)); in fib6_walk_continue()
2135 if (left == fn) { in fib6_walk_continue()
2139 if (right == fn) { in fib6_walk_continue()