Lines Matching refs:fn
58 struct fib6_node *fn);
61 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()
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()
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()
1026 static void fib6_purge_rt(struct fib6_info *rt, struct fib6_node *fn, in fib6_purge_rt() argument
1045 while (fn) { in fib6_purge_rt()
1046 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_purge_rt()
1049 if (!(fn->fn_flags & RTN_RTINFO) && leaf == rt) { in fib6_purge_rt()
1050 new_leaf = fib6_find_prefix(net, table, fn); in fib6_purge_rt()
1053 rcu_assign_pointer(fn->leaf, new_leaf); in fib6_purge_rt()
1056 fn = rcu_dereference_protected(fn->parent, in fib6_purge_rt()
1066 static int fib6_add_rt2node(struct fib6_node *fn, struct fib6_info *rt, in fib6_add_rt2node() argument
1070 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_rt2node()
1088 ins = &fn->leaf; in fib6_add_rt2node()
1164 if (ins == &fn->leaf) in fib6_add_rt2node()
1165 fn->rr_ptr = NULL; in fib6_add_rt2node()
1216 (notify_sibling_rt || ins == &fn->leaf)) { in fib6_add_rt2node()
1248 rcu_assign_pointer(rt->fib6_node, fn); in fib6_add_rt2node()
1254 if (!(fn->fn_flags & RTN_RTINFO)) { in fib6_add_rt2node()
1256 fn->fn_flags |= RTN_RTINFO; in fib6_add_rt2node()
1269 if (!info->skip_notify_kernel && ins == &fn->leaf) { in fib6_add_rt2node()
1278 rcu_assign_pointer(rt->fib6_node, fn); in fib6_add_rt2node()
1283 if (!(fn->fn_flags & RTN_RTINFO)) { in fib6_add_rt2node()
1285 fn->fn_flags |= RTN_RTINFO; in fib6_add_rt2node()
1289 fib6_purge_rt(iter, fn, info->nl_net); in fib6_add_rt2node()
1290 if (rcu_access_pointer(fn->rr_ptr) == iter) in fib6_add_rt2node()
1291 fn->rr_ptr = NULL; in fib6_add_rt2node()
1305 fib6_purge_rt(iter, fn, info->nl_net); in fib6_add_rt2node()
1306 if (rcu_access_pointer(fn->rr_ptr) == iter) in fib6_add_rt2node()
1307 fn->rr_ptr = NULL; in fib6_add_rt2node()
1342 struct fib6_node *fn = rcu_dereference_protected(rt->fib6_node, in __fib6_update_sernum_upto_root() local
1347 while (fn) { in __fib6_update_sernum_upto_root()
1348 WRITE_ONCE(fn->fn_sernum, sernum); in __fib6_update_sernum_upto_root()
1349 fn = rcu_dereference_protected(fn->parent, in __fib6_update_sernum_upto_root()
1378 struct fib6_node *fn, *pn = NULL; in fib6_add() local
1392 fn = fib6_add_1(info->nl_net, table, root, in fib6_add()
1396 if (IS_ERR(fn)) { in fib6_add()
1397 err = PTR_ERR(fn); in fib6_add()
1398 fn = NULL; in fib6_add()
1402 pn = fn; in fib6_add()
1408 if (!rcu_access_pointer(fn->subtree)) { in fib6_add()
1449 rcu_assign_pointer(sfn->parent, fn); in fib6_add()
1450 rcu_assign_pointer(fn->subtree, sfn); in fib6_add()
1452 sn = fib6_add_1(info->nl_net, table, FIB6_SUBTREE(fn), in fib6_add()
1463 if (!rcu_access_pointer(fn->leaf)) { in fib6_add()
1464 if (fn->fn_flags & RTN_TL_ROOT) { in fib6_add()
1466 rcu_assign_pointer(fn->leaf, in fib6_add()
1470 rcu_assign_pointer(fn->leaf, rt); in fib6_add()
1473 fn = sn; in fib6_add()
1477 err = fib6_add_rt2node(fn, rt, info, extack); in fib6_add()
1492 if (pn != fn) { 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()
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()
1775 struct fib6_node *fn) in fib6_repair_tree() argument
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()
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()
1931 if (rcu_access_pointer(fn->rr_ptr) == rt) in fib6_del_route()
1932 fn->rr_ptr = NULL; in fib6_del_route()
1971 if (!rcu_access_pointer(fn->leaf)) { in fib6_del_route()
1972 if (!(fn->fn_flags & RTN_TL_ROOT)) { in fib6_del_route()
1973 fn->fn_flags &= ~RTN_RTINFO; in fib6_del_route()
1976 fn = fib6_repair_tree(net, table, fn); in fib6_del_route()
1979 fib6_purge_rt(rt, fn, net); in fib6_del_route()
2001 struct fib6_node *fn; in fib6_del() local
2007 fn = rcu_dereference_protected(rt->fib6_node, in fib6_del()
2009 if (!fn) in fib6_del()
2012 WARN_ON(!(fn->fn_flags & RTN_RTINFO)); in fib6_del()
2018 for (rtp = &fn->leaf; *rtp; rtp = rtp_next) { in fib6_del()
2024 fib6_del_route(table, fn, rtp, info); in fib6_del()
2060 struct fib6_node *fn, *pn, *left, *right; in fib6_walk_continue() local
2066 fn = w->node; in fib6_walk_continue()
2067 if (!fn) in fib6_walk_continue()
2073 if (FIB6_SUBTREE(fn)) { in fib6_walk_continue()
2074 w->node = FIB6_SUBTREE(fn); in fib6_walk_continue()
2081 left = rcu_dereference_protected(fn->left, 1); in fib6_walk_continue()
2090 right = rcu_dereference_protected(fn->right, 1); in fib6_walk_continue()
2097 w->leaf = rcu_dereference_protected(fn->leaf, 1); in fib6_walk_continue()
2100 if (w->leaf && fn->fn_flags & RTN_RTINFO) { in fib6_walk_continue()
2119 if (fn == w->root) in fib6_walk_continue()
2121 pn = rcu_dereference_protected(fn->parent, 1); in fib6_walk_continue()
2126 if (FIB6_SUBTREE(pn) == fn) { in fib6_walk_continue()
2127 WARN_ON(!(fn->fn_flags & RTN_ROOT)); in fib6_walk_continue()
2132 if (left == fn) { in fib6_walk_continue()
2136 if (right == fn) { in fib6_walk_continue()