Lines Matching +full:se +full:- +full:pos
1 // SPDX-License-Identifier: GPL-2.0-or-later
4 * Robert Olsson <robert.olsson@its.uu.se> Uppsala Universitet
7 * Jens Laas <jens.laas@data.slu.se> Swedish University of
10 * Hans Liss <hans.liss@its.uu.se> Uppsala Universitet
12 * This work is based on the LPC-trie which is originally described in:
15 * Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002.
16 * https://www.csc.kth.se/~snilsson/software/dyntrie2/
18 * IP-address lookup using LC-tries. Stefan Nilsson and Gunnar Karlsson
19 * IEEE Journal on Selected Areas in Communications, 17(6):1083-1092, June 1999
84 .fi = fa->fa_info, in call_fib_entry_notifier()
85 .dscp = fa->fa_dscp, in call_fib_entry_notifier()
86 .type = fa->fa_type, in call_fib_entry_notifier()
87 .tb_id = fa->tb_id, in call_fib_entry_notifier()
101 .fi = fa->fa_info, in call_fib_entry_notifiers()
102 .dscp = fa->fa_dscp, in call_fib_entry_notifiers()
103 .type = fa->fa_type, in call_fib_entry_notifiers()
104 .tb_id = fa->tb_id, in call_fib_entry_notifiers()
116 #define IS_TRIE(n) ((n)->pos >= KEYLENGTH)
117 #define IS_TNODE(n) ((n)->bits)
118 #define IS_LEAF(n) (!(n)->bits)
122 unsigned char pos; /* 2log(KEYLENGTH) bits needed */ member
126 /* This list pointer if valid if (pos | bits) == 0 (LEAF) */
128 /* This array is valid if (pos | bits) > 0 (TNODE) */
194 #define node_parent(tn) rtnl_dereference(tn_info(tn)->parent)
195 #define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
198 #define node_parent_rcu(tn) rcu_dereference_rtnl(tn_info(tn)->parent)
199 #define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
205 rcu_assign_pointer(tn_info(n)->parent, tp); in node_set_parent()
208 #define NODE_INIT_PARENT(n, p) RCU_INIT_POINTER(tn_info(n)->parent, p)
215 return (1ul << tn->bits) & ~(1ul); in child_length()
218 #define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos)
222 unsigned long index = key ^ kv->key; in get_index()
224 if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos)) in get_index()
227 return index >> kv->pos; in get_index()
238 * searching for a leaf - unless we are doing an insertion) we will completely
249 * if n is an internal node - a 'tnode' here, the various parts of its key
255 * -----------------------------------------------------------------
260 * -----------------------------------------------------------------
263 * tp->pos = 22
264 * tp->bits = 3
265 * n->pos = 13
266 * n->bits = 4
269 * the bits from (tp->pos + tp->bits) to 31. They are *known* but at this
272 * The bits from (tp->pos) to (tp->pos + tp->bits - 1) - "N", above - are the
276 * The bits from (n->pos + n->bits) to (tp->pos - 1) - "S" - are skipped bits
280 * of the bits are really not needed or indeed known in n->key.
282 * The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into
285 * The rest of the bits, from 0 to (n->pos -1) - "u" - are completely unknown
302 call_rcu(&fa->rcu, __alias_free_mem); in alias_free_mem_rcu()
306 ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
312 if (!n->tn_bits) in __node_free_rcu()
318 #define node_free(n) call_rcu(&tn_info(n)->rcu, __node_free_rcu)
328 /* determine size and verify it is non-zero and didn't overflow */ in tnode_alloc()
339 tn_info(n)->empty_children++; in empty_child_inc()
341 if (!tn_info(n)->empty_children) in empty_child_inc()
342 tn_info(n)->full_children++; in empty_child_inc()
347 if (!tn_info(n)->empty_children) in empty_child_dec()
348 tn_info(n)->full_children--; in empty_child_dec()
350 tn_info(n)->empty_children--; in empty_child_dec()
363 l = kv->kv; in leaf_new()
364 l->key = key; in leaf_new()
365 l->pos = 0; in leaf_new()
366 l->bits = 0; in leaf_new()
367 l->slen = fa->fa_slen; in leaf_new()
370 INIT_HLIST_HEAD(&l->leaf); in leaf_new()
371 hlist_add_head(&fa->fa_list, &l->leaf); in leaf_new()
376 static struct key_vector *tnode_new(t_key key, int pos, int bits) in tnode_new() argument
378 unsigned int shift = pos + bits; in tnode_new()
382 /* verify bits and pos their msb bits clear and values are valid */ in tnode_new()
393 tnode->full_children = 1; in tnode_new()
395 tnode->empty_children = 1ul << bits; in tnode_new()
397 tn = tnode->kv; in tnode_new()
398 tn->key = (shift < KEYLENGTH) ? (key >> shift) << shift : 0; in tnode_new()
399 tn->pos = pos; in tnode_new()
400 tn->bits = bits; in tnode_new()
401 tn->slen = pos; in tnode_new()
411 return n && ((n->pos + n->bits) == tn->pos) && IS_TNODE(n); in tnode_full()
436 tn_info(tn)->full_children--; in put_child()
438 tn_info(tn)->full_children++; in put_child()
440 if (n && (tn->slen < n->slen)) in put_child()
441 tn->slen = n->slen; in put_child()
443 rcu_assign_pointer(tn->tnode[i], n); in put_child()
452 struct key_vector *inode = get_child(tn, --i); in update_children()
472 rcu_assign_pointer(tp->tnode[0], n); in put_child_root()
479 tn_info(tn)->rcu.next = NULL; in tnode_free_init()
485 tn_info(n)->rcu.next = tn_info(tn)->rcu.next; in tnode_free_append()
486 tn_info(tn)->rcu.next = &tn_info(n)->rcu; in tnode_free_append()
491 struct callback_head *head = &tn_info(tn)->rcu; in tnode_free()
494 head = head->next; in tnode_free()
495 tnode_free_size += TNODE_SIZE(1ul << tn->bits); in tnode_free()
498 tn = container_of(head, struct tnode, rcu)->kv; in tnode_free()
516 put_child_root(tp, tn->key, tn); in replace()
526 struct key_vector *inode = get_child(tn, --i); in replace()
545 tn = tnode_new(oldtnode->key, oldtnode->pos - 1, oldtnode->bits + 1); in inflate()
557 for (i = child_length(oldtnode), m = 1u << tn->pos; i;) { in inflate()
558 struct key_vector *inode = get_child(oldtnode, --i); in inflate()
568 put_child(tn, get_index(inode->key, tn), inode); in inflate()
576 if (inode->bits == 1) { in inflate()
591 * we are moving away from - the bit at position in inflate()
592 * (tn->pos) - is the one that will differ between in inflate()
596 node1 = tnode_new(inode->key | m, inode->pos, inode->bits - 1); in inflate()
599 node0 = tnode_new(inode->key, inode->pos, inode->bits - 1); in inflate()
608 put_child(node1, --j, get_child(inode, --k)); in inflate()
610 put_child(node1, --j, get_child(inode, --k)); in inflate()
640 tn = tnode_new(oldtnode->key, oldtnode->pos + 1, oldtnode->bits - 1); in halve()
653 struct key_vector *node1 = get_child(oldtnode, --i); in halve()
654 struct key_vector *node0 = get_child(oldtnode, --i); in halve()
664 inode = tnode_new(node0->key, oldtnode->pos, 1); in halve()
695 n = get_child(oldtnode, --i); in collapse()
699 put_child_root(tp, oldtnode->key, n); in collapse()
710 unsigned char slen = tn->pos; in update_suffix()
715 * tn->pos + tn->bits, the second highest node will have a suffix in update_suffix()
716 * length at most of tn->pos + tn->bits - 1 in update_suffix()
718 slen_max = min_t(unsigned char, tn->pos + tn->bits - 1, tn->slen); in update_suffix()
723 * represent the nodes with suffix length equal to tn->pos in update_suffix()
728 if (!n || (n->slen <= slen)) in update_suffix()
732 stride <<= (n->slen - slen); in update_suffix()
733 slen = n->slen; in update_suffix()
734 i &= ~(stride - 1); in update_suffix()
741 tn->slen = slen; in update_suffix()
749 * "A node is doubled if the ratio of non-empty children to all
756 * the left-hand side by 100 (to handle the percentage thing) we
757 * multiply the left-hand side by 50.
759 * The left-hand side may look a bit weird: child_length(tn)
760 * - tn->empty_children is of course the number of non-null children
761 * in the current node. tn->full_children is the number of "full"
762 * children, that is non-null tnodes with a skip value of 0.
768 * to_be_doubled = tn->full_children;
769 * not_to_be_doubled = child_length(tn) - tn->empty_children -
770 * tn->full_children;
789 * 100 * (child_length(tn) - tn->empty_children +
790 * tn->full_children) >= inflate_threshold * new_child_length
793 * 100 * (child_length(tn) - tn->empty_children +
794 * tn->full_children) >=
798 * 50 * (tn->full_children + child_length(tn) -
799 * tn->empty_children) >= inflate_threshold *
810 used -= tn_info(tn)->empty_children; in should_inflate()
811 used += tn_info(tn)->full_children; in should_inflate()
813 /* if bits == KEYLENGTH then pos = 0, and will fail below */ in should_inflate()
815 return (used > 1) && tn->pos && ((50 * used) >= threshold); in should_inflate()
825 used -= tn_info(tn)->empty_children; in should_halve()
829 return (used > 1) && (tn->bits > 1) && ((100 * used) < threshold); in should_halve()
836 used -= tn_info(tn)->empty_children; in should_collapse()
839 if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children) in should_collapse()
840 used -= KEY_MAX; in should_collapse()
850 struct trie_use_stats __percpu *stats = t->stats; in resize()
853 unsigned long cindex = get_index(tn->key, tp); in resize()
872 this_cpu_inc(stats->resize_node_skipped); in resize()
877 max_work--; in resize()
895 this_cpu_inc(stats->resize_node_skipped); in resize()
900 max_work--; in resize()
914 unsigned char node_slen = tn->slen; in node_pull_suffix()
916 while ((node_slen > tn->pos) && (node_slen > slen)) { in node_pull_suffix()
922 node_slen = tn->slen; in node_pull_suffix()
928 while (tn->slen < slen) { in node_push_suffix()
929 tn->slen = slen; in node_push_suffix()
938 struct key_vector *pn, *n = t->kv; in fib_find_node()
964 if (index >= (1ul << n->bits)) { in fib_find_node()
993 u8 __fa_dscp = inet_dscp_to_dsfield(fa->fa_dscp); in fib_find_alias()
996 if (fa->fa_slen < slen) in fib_find_alias()
998 if (fa->fa_slen != slen) in fib_find_alias()
1000 if (fa->tb_id > tb_id) in fib_find_alias()
1002 if (fa->tb_id != tb_id) in fib_find_alias()
1008 if (fa->fa_info->fib_priority >= prio || __fa_dscp < __dscp) in fib_find_alias()
1018 u8 slen = KEYLENGTH - fri->dst_len; in fib_find_matching_alias()
1024 tb = fib_get_table(net, fri->tb_id); in fib_find_matching_alias()
1028 t = (struct trie *)tb->tb_data; in fib_find_matching_alias()
1029 l = fib_find_node(t, &tp, be32_to_cpu(fri->dst)); in fib_find_matching_alias()
1033 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) { in fib_find_matching_alias()
1034 if (fa->fa_slen == slen && fa->tb_id == fri->tb_id && in fib_find_matching_alias()
1035 fa->fa_dscp == fri->dscp && fa->fa_info == fri->fi && in fib_find_matching_alias()
1036 fa->fa_type == fri->type) in fib_find_matching_alias()
1059 if (READ_ONCE(fa_match->offload) == fri->offload && in fib_alias_hw_flags_set()
1060 READ_ONCE(fa_match->trap) == fri->trap && in fib_alias_hw_flags_set()
1061 READ_ONCE(fa_match->offload_failed) == fri->offload_failed) in fib_alias_hw_flags_set()
1064 WRITE_ONCE(fa_match->offload, fri->offload); in fib_alias_hw_flags_set()
1065 WRITE_ONCE(fa_match->trap, fri->trap); in fib_alias_hw_flags_set()
1067 fib_notify_on_flag_change = READ_ONCE(net->ipv4.sysctl_fib_notify_on_flag_change); in fib_alias_hw_flags_set()
1071 READ_ONCE(fa_match->offload_failed) == fri->offload_failed) in fib_alias_hw_flags_set()
1074 WRITE_ONCE(fa_match->offload_failed, fri->offload_failed); in fib_alias_hw_flags_set()
1079 skb = nlmsg_new(fib_nlmsg_size(fa_match->fa_info), GFP_ATOMIC); in fib_alias_hw_flags_set()
1081 err = -ENOBUFS; in fib_alias_hw_flags_set()
1087 /* -EMSGSIZE implies BUG in fib_nlmsg_size() */ in fib_alias_hw_flags_set()
1088 WARN_ON(err == -EMSGSIZE); in fib_alias_hw_flags_set()
1130 tn = tnode_new(key, __fls(key ^ n->key), 1); in fib_insert_node()
1147 node_push_suffix(tp, new->fa_slen); in fib_insert_node()
1156 return -ENOMEM; in fib_insert_node()
1167 hlist_add_before_rcu(&new->fa_list, &fa->fa_list); in fib_insert_alias()
1171 hlist_for_each_entry(last, &l->leaf, fa_list) { in fib_insert_alias()
1172 if (new->fa_slen < last->fa_slen) in fib_insert_alias()
1174 if ((new->fa_slen == last->fa_slen) && in fib_insert_alias()
1175 (new->tb_id > last->tb_id)) in fib_insert_alias()
1181 hlist_add_behind_rcu(&new->fa_list, &fa->fa_list); in fib_insert_alias()
1183 hlist_add_head_rcu(&new->fa_list, &l->leaf); in fib_insert_alias()
1187 if (l->slen < new->fa_slen) { in fib_insert_alias()
1188 l->slen = new->fa_slen; in fib_insert_alias()
1189 node_push_suffix(tp, new->fa_slen); in fib_insert_alias()
1218 struct trie *t = (struct trie *)tb->tb_data; in fib_table_insert()
1223 u8 plen = cfg->fc_dst_len; in fib_table_insert()
1224 u8 slen = KEYLENGTH - plen; in fib_table_insert()
1229 key = ntohl(cfg->fc_dst); in fib_table_insert()
1232 return -EINVAL; in fib_table_insert()
1234 pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen); in fib_table_insert()
1242 dscp = cfg->fc_dscp; in fib_table_insert()
1244 fa = l ? fib_find_alias(&l->leaf, slen, dscp, fi->fib_priority, in fib_table_insert()
1245 tb->tb_id, false) : NULL; in fib_table_insert()
1247 /* Now fa, if non-NULL, points to the first fib alias in fib_table_insert()
1256 if (fa && fa->fa_dscp == dscp && in fib_table_insert()
1257 fa->fa_info->fib_priority == fi->fib_priority) { in fib_table_insert()
1260 err = -EEXIST; in fib_table_insert()
1261 if (cfg->fc_nlflags & NLM_F_EXCL) in fib_table_insert()
1274 if ((fa->fa_slen != slen) || in fib_table_insert()
1275 (fa->tb_id != tb->tb_id) || in fib_table_insert()
1276 (fa->fa_dscp != dscp)) in fib_table_insert()
1278 if (fa->fa_info->fib_priority != fi->fib_priority) in fib_table_insert()
1280 if (fa->fa_type == cfg->fc_type && in fib_table_insert()
1281 fa->fa_info == fi) { in fib_table_insert()
1287 if (cfg->fc_nlflags & NLM_F_REPLACE) { in fib_table_insert()
1298 err = -ENOBUFS; in fib_table_insert()
1303 fi_drop = fa->fa_info; in fib_table_insert()
1304 new_fa->fa_dscp = fa->fa_dscp; in fib_table_insert()
1305 new_fa->fa_info = fi; in fib_table_insert()
1306 new_fa->fa_type = cfg->fc_type; in fib_table_insert()
1307 state = fa->fa_state; in fib_table_insert()
1308 new_fa->fa_state = state & ~FA_S_ACCESSED; in fib_table_insert()
1309 new_fa->fa_slen = fa->fa_slen; in fib_table_insert()
1310 new_fa->tb_id = tb->tb_id; in fib_table_insert()
1311 new_fa->fa_default = -1; in fib_table_insert()
1312 new_fa->offload = 0; in fib_table_insert()
1313 new_fa->trap = 0; in fib_table_insert()
1314 new_fa->offload_failed = 0; in fib_table_insert()
1316 hlist_replace_rcu(&fa->fa_list, &new_fa->fa_list); in fib_table_insert()
1318 if (fib_find_alias(&l->leaf, fa->fa_slen, 0, 0, in fib_table_insert()
1319 tb->tb_id, true) == new_fa) { in fib_table_insert()
1327 hlist_replace_rcu(&new_fa->fa_list, in fib_table_insert()
1328 &fa->fa_list); in fib_table_insert()
1334 tb->tb_id, &cfg->fc_nlinfo, nlflags); in fib_table_insert()
1340 rt_cache_flush(cfg->fc_nlinfo.nl_net); in fib_table_insert()
1351 if (cfg->fc_nlflags & NLM_F_APPEND) in fib_table_insert()
1356 err = -ENOENT; in fib_table_insert()
1357 if (!(cfg->fc_nlflags & NLM_F_CREATE)) in fib_table_insert()
1361 err = -ENOBUFS; in fib_table_insert()
1366 new_fa->fa_info = fi; in fib_table_insert()
1367 new_fa->fa_dscp = dscp; in fib_table_insert()
1368 new_fa->fa_type = cfg->fc_type; in fib_table_insert()
1369 new_fa->fa_state = 0; in fib_table_insert()
1370 new_fa->fa_slen = slen; in fib_table_insert()
1371 new_fa->tb_id = tb->tb_id; in fib_table_insert()
1372 new_fa->fa_default = -1; in fib_table_insert()
1373 new_fa->offload = 0; in fib_table_insert()
1374 new_fa->trap = 0; in fib_table_insert()
1375 new_fa->offload_failed = 0; in fib_table_insert()
1385 err = -ENOENT; in fib_table_insert()
1389 if (fib_find_alias(&l->leaf, new_fa->fa_slen, 0, 0, tb->tb_id, true) == in fib_table_insert()
1401 tb->tb_num_default++; in fib_table_insert()
1403 rt_cache_flush(cfg->fc_nlinfo.nl_net); in fib_table_insert()
1404 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, new_fa->tb_id, in fib_table_insert()
1405 &cfg->fc_nlinfo, nlflags); in fib_table_insert()
1421 t_key prefix = n->key; in prefix_mismatch()
1423 return (key ^ prefix) & (prefix | -prefix); in prefix_mismatch()
1429 if (nhc->nhc_flags & RTNH_F_DEAD) in fib_lookup_good_nhc()
1432 if (ip_ignore_linkdown(nhc->nhc_dev) && in fib_lookup_good_nhc()
1433 nhc->nhc_flags & RTNH_F_LINKDOWN && in fib_lookup_good_nhc()
1437 if (flp->flowi4_oif && flp->flowi4_oif != nhc->nhc_oif) in fib_lookup_good_nhc()
1447 struct trie *t = (struct trie *) tb->tb_data; in fib_table_lookup()
1449 struct trie_use_stats __percpu *stats = t->stats; in fib_table_lookup()
1451 const t_key key = ntohl(flp->daddr); in fib_table_lookup()
1457 pn = t->kv; in fib_table_lookup()
1462 trace_fib_table_lookup(tb->tb_id, flp, NULL, -EAGAIN); in fib_table_lookup()
1463 return -EAGAIN; in fib_table_lookup()
1467 this_cpu_inc(stats->gets); in fib_table_lookup()
1488 if (index >= (1ul << n->bits)) in fib_table_lookup()
1498 if (n->slen > n->pos) { in fib_table_lookup()
1511 struct key_vector __rcu **cptr = n->tnode; in fib_table_lookup()
1517 if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos)) in fib_table_lookup()
1533 this_cpu_inc(stats->null_node_hit); in fib_table_lookup()
1541 t_key pkey = pn->key; in fib_table_lookup()
1548 trace_fib_table_lookup(tb->tb_id, flp, in fib_table_lookup()
1549 NULL, -EAGAIN); in fib_table_lookup()
1550 return -EAGAIN; in fib_table_lookup()
1553 this_cpu_inc(stats->backtrack); in fib_table_lookup()
1561 cindex &= cindex - 1; in fib_table_lookup()
1564 cptr = &pn->tnode[cindex]; in fib_table_lookup()
1570 index = key ^ n->key; in fib_table_lookup()
1573 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) { in fib_table_lookup()
1574 struct fib_info *fi = fa->fa_info; in fib_table_lookup()
1578 if ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen < KEYLENGTH)) { in fib_table_lookup()
1579 if (index >= (1ul << fa->fa_slen)) in fib_table_lookup()
1582 if (fa->fa_dscp && in fib_table_lookup()
1583 inet_dscp_to_dsfield(fa->fa_dscp) != flp->flowi4_tos) in fib_table_lookup()
1586 if (READ_ONCE(fi->fib_dead)) in fib_table_lookup()
1588 if (fa->fa_info->fib_scope < flp->flowi4_scope) in fib_table_lookup()
1591 err = fib_props[fa->fa_type].error; in fib_table_lookup()
1595 this_cpu_inc(stats->semantic_match_passed); in fib_table_lookup()
1597 trace_fib_table_lookup(tb->tb_id, flp, NULL, err); in fib_table_lookup()
1600 if (fi->fib_flags & RTNH_F_DEAD) in fib_table_lookup()
1603 if (unlikely(fi->nh)) { in fib_table_lookup()
1604 if (nexthop_is_blackhole(fi->nh)) { in fib_table_lookup()
1609 nhc = nexthop_get_nhc_lookup(fi->nh, fib_flags, flp, in fib_table_lookup()
1623 refcount_inc(&fi->fib_clntref); in fib_table_lookup()
1625 res->prefix = htonl(n->key); in fib_table_lookup()
1626 res->prefixlen = KEYLENGTH - fa->fa_slen; in fib_table_lookup()
1627 res->nh_sel = nhsel; in fib_table_lookup()
1628 res->nhc = nhc; in fib_table_lookup()
1629 res->type = fa->fa_type; in fib_table_lookup()
1630 res->scope = fi->fib_scope; in fib_table_lookup()
1631 res->dscp = fa->fa_dscp; in fib_table_lookup()
1632 res->fi = fi; in fib_table_lookup()
1633 res->table = tb; in fib_table_lookup()
1634 res->fa_head = &n->leaf; in fib_table_lookup()
1636 this_cpu_inc(stats->semantic_match_passed); in fib_table_lookup()
1638 trace_fib_table_lookup(tb->tb_id, flp, nhc, err); in fib_table_lookup()
1645 this_cpu_inc(stats->semantic_match_miss); in fib_table_lookup()
1655 struct hlist_node **pprev = old->fa_list.pprev; in fib_remove_alias()
1659 hlist_del_rcu(&old->fa_list); in fib_remove_alias()
1664 if (hlist_empty(&l->leaf)) { in fib_remove_alias()
1665 if (tp->slen == l->slen) in fib_remove_alias()
1666 node_pull_suffix(tp, tp->pos); in fib_remove_alias()
1667 put_child_root(tp, l->key, NULL); in fib_remove_alias()
1678 l->slen = fa->fa_slen; in fib_remove_alias()
1679 node_pull_suffix(tp, fa->fa_slen); in fib_remove_alias()
1688 u32 tb_id = fa_to_delete->tb_id; in fib_notify_alias_delete()
1689 u8 slen = fa_to_delete->fa_slen; in fib_notify_alias_delete()
1699 fa_next = hlist_entry_safe(fa_to_delete->fa_list.next, in fib_notify_alias_delete()
1701 if (fa_next && fa_next->fa_slen == slen && fa_next->tb_id == tb_id) { in fib_notify_alias_delete()
1708 call_fib_entry_notifiers(net, fib_event, key, KEYLENGTH - slen, in fib_notify_alias_delete()
1716 struct trie *t = (struct trie *) tb->tb_data; in fib_table_delete()
1719 u8 plen = cfg->fc_dst_len; in fib_table_delete()
1720 u8 slen = KEYLENGTH - plen; in fib_table_delete()
1724 key = ntohl(cfg->fc_dst); in fib_table_delete()
1727 return -EINVAL; in fib_table_delete()
1731 return -ESRCH; in fib_table_delete()
1733 dscp = cfg->fc_dscp; in fib_table_delete()
1734 fa = fib_find_alias(&l->leaf, slen, dscp, 0, tb->tb_id, false); in fib_table_delete()
1736 return -ESRCH; in fib_table_delete()
1743 struct fib_info *fi = fa->fa_info; in fib_table_delete()
1745 if ((fa->fa_slen != slen) || in fib_table_delete()
1746 (fa->tb_id != tb->tb_id) || in fib_table_delete()
1747 (fa->fa_dscp != dscp)) in fib_table_delete()
1750 if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) && in fib_table_delete()
1751 (cfg->fc_scope == RT_SCOPE_NOWHERE || in fib_table_delete()
1752 fa->fa_info->fib_scope == cfg->fc_scope) && in fib_table_delete()
1753 (!cfg->fc_prefsrc || in fib_table_delete()
1754 fi->fib_prefsrc == cfg->fc_prefsrc) && in fib_table_delete()
1755 (!cfg->fc_protocol || in fib_table_delete()
1756 fi->fib_protocol == cfg->fc_protocol) && in fib_table_delete()
1765 return -ESRCH; in fib_table_delete()
1767 fib_notify_alias_delete(net, key, &l->leaf, fa_to_delete, extack); in fib_table_delete()
1768 rtmsg_fib(RTM_DELROUTE, htonl(key), fa_to_delete, plen, tb->tb_id, in fib_table_delete()
1769 &cfg->fc_nlinfo, 0); in fib_table_delete()
1772 tb->tb_num_default--; in fib_table_delete()
1776 if (fa_to_delete->fa_state & FA_S_ACCESSED) in fib_table_delete()
1777 rt_cache_flush(cfg->fc_nlinfo.nl_net); in fib_table_delete()
1779 fib_release_info(fa_to_delete->fa_info); in fib_table_delete()
1794 cindex = (key > pn->key) ? get_index(key, pn) : 0; in leaf_walk_rcu()
1796 if (cindex >> pn->bits) in leaf_walk_rcu()
1805 if (IS_LEAF(n) && (n->key >= key)) in leaf_walk_rcu()
1812 if (cindex >= (1ul << pn->bits)) { in leaf_walk_rcu()
1813 t_key pkey = pn->key; in leaf_walk_rcu()
1844 struct trie *t = (struct trie *)tb->tb_data; in fib_trie_free()
1845 struct key_vector *pn = t->kv; in fib_trie_free()
1854 if (!(cindex--)) { in fib_trie_free()
1855 t_key pkey = pn->key; in fib_trie_free()
1864 put_child_root(pn, n->key, NULL); in fib_trie_free()
1880 cindex = 1ul << n->bits; in fib_trie_free()
1885 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) { in fib_trie_free()
1886 hlist_del_rcu(&fa->fa_list); in fib_trie_free()
1890 put_child_root(pn, n->key, NULL); in fib_trie_free()
1895 free_percpu(t->stats); in fib_trie_free()
1902 struct trie *ot = (struct trie *)oldtb->tb_data; in fib_trie_unmerge()
1903 struct key_vector *l, *tp = ot->kv; in fib_trie_unmerge()
1909 if (oldtb->tb_data == oldtb->__data) in fib_trie_unmerge()
1916 lt = (struct trie *)local_tb->tb_data; in fib_trie_unmerge()
1921 hlist_for_each_entry(fa, &l->leaf, fa_list) { in fib_trie_unmerge()
1924 if (local_tb->tb_id != fa->tb_id) in fib_trie_unmerge()
1936 local_l = fib_find_node(lt, &local_tp, l->key); in fib_trie_unmerge()
1939 NULL, l->key)) { in fib_trie_unmerge()
1946 key = l->key + 1; in fib_trie_unmerge()
1947 if (key < l->key) in fib_trie_unmerge()
1961 struct trie *t = (struct trie *)tb->tb_data; in fib_table_flush_external()
1962 struct key_vector *pn = t->kv; in fib_table_flush_external()
1972 if (!(cindex--)) { in fib_table_flush_external()
1973 t_key pkey = pn->key; in fib_table_flush_external()
1980 if (pn->slen > pn->pos) in fib_table_flush_external()
1998 cindex = 1ul << n->bits; in fib_table_flush_external()
2003 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) { in fib_table_flush_external()
2007 if (tb->tb_id != fa->tb_id) { in fib_table_flush_external()
2008 hlist_del_rcu(&fa->fa_list); in fib_table_flush_external()
2014 slen = fa->fa_slen; in fib_table_flush_external()
2018 n->slen = slen; in fib_table_flush_external()
2020 if (hlist_empty(&n->leaf)) { in fib_table_flush_external()
2021 put_child_root(pn, n->key, NULL); in fib_table_flush_external()
2030 struct trie *t = (struct trie *)tb->tb_data; in fib_table_flush()
2032 struct key_vector *pn = t->kv; in fib_table_flush()
2043 if (!(cindex--)) { in fib_table_flush()
2044 t_key pkey = pn->key; in fib_table_flush()
2051 if (pn->slen > pn->pos) in fib_table_flush()
2069 cindex = 1ul << n->bits; in fib_table_flush()
2074 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) { in fib_table_flush()
2075 struct fib_info *fi = fa->fa_info; in fib_table_flush()
2077 if (!fi || tb->tb_id != fa->tb_id || in fib_table_flush()
2078 (!(fi->fib_flags & RTNH_F_DEAD) && in fib_table_flush()
2079 !fib_props[fa->fa_type].error)) { in fib_table_flush()
2080 slen = fa->fa_slen; in fib_table_flush()
2087 if (!flush_all && fib_props[fa->fa_type].error) { in fib_table_flush()
2088 slen = fa->fa_slen; in fib_table_flush()
2092 fib_notify_alias_delete(net, n->key, &n->leaf, fa, in fib_table_flush()
2094 if (fi->pfsrc_removed) in fib_table_flush()
2095 rtmsg_fib(RTM_DELROUTE, htonl(n->key), fa, in fib_table_flush()
2096 KEYLENGTH - fa->fa_slen, tb->tb_id, &info, 0); in fib_table_flush()
2097 hlist_del_rcu(&fa->fa_list); in fib_table_flush()
2098 fib_release_info(fa->fa_info); in fib_table_flush()
2104 n->slen = slen; in fib_table_flush()
2106 if (hlist_empty(&n->leaf)) { in fib_table_flush()
2107 put_child_root(pn, n->key, NULL); in fib_table_flush()
2120 struct trie *t = (struct trie *)tb->tb_data; in __fib_info_notify_update()
2121 struct key_vector *pn = t->kv; in __fib_info_notify_update()
2128 if (!(cindex--)) { in __fib_info_notify_update()
2129 t_key pkey = pn->key; in __fib_info_notify_update()
2147 cindex = 1ul << n->bits; in __fib_info_notify_update()
2152 hlist_for_each_entry(fa, &n->leaf, fa_list) { in __fib_info_notify_update()
2153 struct fib_info *fi = fa->fa_info; in __fib_info_notify_update()
2155 if (!fi || !fi->nh_updated || fa->tb_id != tb->tb_id) in __fib_info_notify_update()
2158 rtmsg_fib(RTM_NEWROUTE, htonl(n->key), fa, in __fib_info_notify_update()
2159 KEYLENGTH - fa->fa_slen, tb->tb_id, in __fib_info_notify_update()
2170 struct hlist_head *head = &net->ipv4.fib_table_hash[h]; in fib_info_notify_update()
2184 int last_slen = -1; in fib_leaf_notify()
2187 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) { in fib_leaf_notify()
2188 struct fib_info *fi = fa->fa_info; in fib_leaf_notify()
2196 if (tb->tb_id != fa->tb_id) in fib_leaf_notify()
2199 if (fa->fa_slen == last_slen) in fib_leaf_notify()
2202 last_slen = fa->fa_slen; in fib_leaf_notify()
2204 l->key, KEYLENGTH - fa->fa_slen, in fib_leaf_notify()
2215 struct trie *t = (struct trie *)tb->tb_data; in fib_table_notify()
2216 struct key_vector *l, *tp = t->kv; in fib_table_notify()
2225 key = l->key + 1; in fib_table_notify()
2227 if (key < l->key) in fib_table_notify()
2240 struct hlist_head *head = &net->ipv4.fib_table_hash[h]; in fib_notify()
2256 struct trie *t = (struct trie *)tb->tb_data; in __trie_free_rcu()
2258 if (tb->tb_data == tb->__data) in __trie_free_rcu()
2259 free_percpu(t->stats); in __trie_free_rcu()
2266 call_rcu(&tb->rcu, __trie_free_rcu); in fib_free_table()
2274 __be32 xkey = htonl(l->key); in fn_trie_dump_leaf()
2278 if (filter->filter_set || in fn_trie_dump_leaf()
2279 !filter->dump_exceptions || !filter->dump_routes) in fn_trie_dump_leaf()
2282 s_i = cb->args[4]; in fn_trie_dump_leaf()
2283 s_fa = cb->args[5]; in fn_trie_dump_leaf()
2287 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) { in fn_trie_dump_leaf()
2288 struct fib_info *fi = fa->fa_info; in fn_trie_dump_leaf()
2295 if (tb->tb_id != fa->tb_id) in fn_trie_dump_leaf()
2298 if (filter->filter_set) { in fn_trie_dump_leaf()
2299 if (filter->rt_type && fa->fa_type != filter->rt_type) in fn_trie_dump_leaf()
2302 if ((filter->protocol && in fn_trie_dump_leaf()
2303 fi->fib_protocol != filter->protocol)) in fn_trie_dump_leaf()
2306 if (filter->dev && in fn_trie_dump_leaf()
2307 !fib_info_nh_uses_dev(fi, filter->dev)) in fn_trie_dump_leaf()
2311 if (filter->dump_routes) { in fn_trie_dump_leaf()
2316 fri.tb_id = tb->tb_id; in fn_trie_dump_leaf()
2318 fri.dst_len = KEYLENGTH - fa->fa_slen; in fn_trie_dump_leaf()
2319 fri.dscp = fa->fa_dscp; in fn_trie_dump_leaf()
2320 fri.type = fa->fa_type; in fn_trie_dump_leaf()
2321 fri.offload = READ_ONCE(fa->offload); in fn_trie_dump_leaf()
2322 fri.trap = READ_ONCE(fa->trap); in fn_trie_dump_leaf()
2323 fri.offload_failed = READ_ONCE(fa->offload_failed); in fn_trie_dump_leaf()
2325 NETLINK_CB(cb->skb).portid, in fn_trie_dump_leaf()
2326 cb->nlh->nlmsg_seq, in fn_trie_dump_leaf()
2335 if (filter->dump_exceptions) { in fn_trie_dump_leaf()
2336 err = fib_dump_info_fnhe(skb, cb, tb->tb_id, fi, in fn_trie_dump_leaf()
2346 cb->args[4] = i; in fn_trie_dump_leaf()
2347 return skb->len; in fn_trie_dump_leaf()
2350 cb->args[4] = i; in fn_trie_dump_leaf()
2351 cb->args[5] = i_fa; in fn_trie_dump_leaf()
2359 struct trie *t = (struct trie *)tb->tb_data; in fib_table_dump()
2360 struct key_vector *l, *tp = t->kv; in fib_table_dump()
2364 int count = cb->args[2]; in fib_table_dump()
2365 t_key key = cb->args[3]; in fib_table_dump()
2371 return skb->len; in fib_table_dump()
2378 cb->args[3] = key; in fib_table_dump()
2379 cb->args[2] = count; in fib_table_dump()
2384 key = l->key + 1; in fib_table_dump()
2386 memset(&cb->args[4], 0, in fib_table_dump()
2387 sizeof(cb->args) - 4*sizeof(cb->args[0])); in fib_table_dump()
2390 if (key < l->key) in fib_table_dump()
2394 cb->args[3] = key; in fib_table_dump()
2395 cb->args[2] = count; in fib_table_dump()
2397 return skb->len; in fib_table_dump()
2424 tb->tb_id = id; in fib_trie_table()
2425 tb->tb_num_default = 0; in fib_trie_table()
2426 tb->tb_data = (alias ? alias->__data : tb->__data); in fib_trie_table()
2431 t = (struct trie *) tb->tb_data; in fib_trie_table()
2432 t->kv[0].pos = KEYLENGTH; in fib_trie_table()
2433 t->kv[0].slen = KEYLENGTH; in fib_trie_table()
2435 t->stats = alloc_percpu(struct trie_use_stats); in fib_trie_table()
2436 if (!t->stats) { in fib_trie_table()
2457 unsigned long cindex = iter->index; in fib_trie_get_next()
2458 struct key_vector *pn = iter->tnode; in fib_trie_get_next()
2462 iter->tnode, iter->index, iter->depth); in fib_trie_get_next()
2472 iter->tnode = pn; in fib_trie_get_next()
2473 iter->index = cindex; in fib_trie_get_next()
2476 iter->tnode = n; in fib_trie_get_next()
2477 iter->index = 0; in fib_trie_get_next()
2478 ++iter->depth; in fib_trie_get_next()
2485 pkey = pn->key; in fib_trie_get_next()
2488 --iter->depth; in fib_trie_get_next()
2492 iter->tnode = pn; in fib_trie_get_next()
2493 iter->index = 0; in fib_trie_get_next()
2506 pn = t->kv; in fib_trie_get_first()
2507 n = rcu_dereference(pn->tnode[0]); in fib_trie_get_first()
2512 iter->tnode = n; in fib_trie_get_first()
2513 iter->index = 0; in fib_trie_get_first()
2514 iter->depth = 1; in fib_trie_get_first()
2516 iter->tnode = pn; in fib_trie_get_first()
2517 iter->index = 0; in fib_trie_get_first()
2518 iter->depth = 0; in fib_trie_get_first()
2536 s->leaves++; in trie_collect_stats()
2537 s->totdepth += iter.depth; in trie_collect_stats()
2538 if (iter.depth > s->maxdepth) in trie_collect_stats()
2539 s->maxdepth = iter.depth; in trie_collect_stats()
2541 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) in trie_collect_stats()
2542 ++s->prefixes; in trie_collect_stats()
2544 s->tnodes++; in trie_collect_stats()
2545 if (n->bits < MAX_STAT_DEPTH) in trie_collect_stats()
2546 s->nodesizes[n->bits]++; in trie_collect_stats()
2547 s->nullpointers += tn_info(n)->empty_children; in trie_collect_stats()
2560 if (stat->leaves) in trie_show_stats()
2561 avdepth = stat->totdepth*100 / stat->leaves; in trie_show_stats()
2567 seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth); in trie_show_stats()
2569 seq_printf(seq, "\tLeaves: %u\n", stat->leaves); in trie_show_stats()
2570 bytes = LEAF_SIZE * stat->leaves; in trie_show_stats()
2572 seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes); in trie_show_stats()
2573 bytes += sizeof(struct fib_alias) * stat->prefixes; in trie_show_stats()
2575 seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes); in trie_show_stats()
2576 bytes += TNODE_SIZE(0) * stat->tnodes; in trie_show_stats()
2579 while (max > 0 && stat->nodesizes[max-1] == 0) in trie_show_stats()
2580 max--; in trie_show_stats()
2584 if (stat->nodesizes[i] != 0) { in trie_show_stats()
2585 seq_printf(seq, " %u: %u", i, stat->nodesizes[i]); in trie_show_stats()
2586 pointers += (1<<i) * stat->nodesizes[i]; in trie_show_stats()
2592 seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers); in trie_show_stats()
2607 s.gets += pcpu->gets; in trie_show_usage()
2608 s.backtrack += pcpu->backtrack; in trie_show_usage()
2609 s.semantic_match_passed += pcpu->semantic_match_passed; in trie_show_usage()
2610 s.semantic_match_miss += pcpu->semantic_match_miss; in trie_show_usage()
2611 s.null_node_hit += pcpu->null_node_hit; in trie_show_usage()
2612 s.resize_node_skipped += pcpu->resize_node_skipped; in trie_show_usage()
2615 seq_printf(seq, "\nCounters:\n---------\n"); in trie_show_usage()
2628 if (tb->tb_id == RT_TABLE_LOCAL) in fib_table_print()
2630 else if (tb->tb_id == RT_TABLE_MAIN) in fib_table_print()
2633 seq_printf(seq, "Id %d:\n", tb->tb_id); in fib_table_print()
2639 struct net *net = seq->private; in fib_triestat_seq_show()
2649 struct hlist_head *head = &net->ipv4.fib_table_hash[h]; in fib_triestat_seq_show()
2653 struct trie *t = (struct trie *) tb->tb_data; in fib_triestat_seq_show()
2664 trie_show_usage(seq, t->stats); in fib_triestat_seq_show()
2674 static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos) in fib_trie_get_idx() argument
2676 struct fib_trie_iter *iter = seq->private; in fib_trie_get_idx()
2682 struct hlist_head *head = &net->ipv4.fib_table_hash[h]; in fib_trie_get_idx()
2689 (struct trie *) tb->tb_data); in fib_trie_get_idx()
2691 if (pos == idx++) { in fib_trie_get_idx()
2692 iter->tb = tb; in fib_trie_get_idx()
2701 static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos) in fib_trie_seq_start() argument
2705 return fib_trie_get_idx(seq, *pos); in fib_trie_seq_start()
2708 static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos) in fib_trie_seq_next() argument
2710 struct fib_trie_iter *iter = seq->private; in fib_trie_seq_next()
2712 struct fib_table *tb = iter->tb; in fib_trie_seq_next()
2717 ++*pos; in fib_trie_seq_next()
2724 h = tb->tb_id & (FIB_TABLE_HASHSZ - 1); in fib_trie_seq_next()
2725 while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) { in fib_trie_seq_next()
2727 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data); in fib_trie_seq_next()
2734 struct hlist_head *head = &net->ipv4.fib_table_hash[h]; in fib_trie_seq_next()
2736 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data); in fib_trie_seq_next()
2744 iter->tb = tb; in fib_trie_seq_next()
2756 while (n-- > 0) in seq_indent()
2800 const struct fib_trie_iter *iter = seq->private; in fib_trie_seq_show()
2804 fib_table_print(seq, iter->tb); in fib_trie_seq_show()
2807 __be32 prf = htonl(n->key); in fib_trie_seq_show()
2809 seq_indent(seq, iter->depth-1); in fib_trie_seq_show()
2810 seq_printf(seq, " +-- %pI4/%zu %u %u %u\n", in fib_trie_seq_show()
2811 &prf, KEYLENGTH - n->pos - n->bits, n->bits, in fib_trie_seq_show()
2812 tn_info(n)->full_children, in fib_trie_seq_show()
2813 tn_info(n)->empty_children); in fib_trie_seq_show()
2815 __be32 val = htonl(n->key); in fib_trie_seq_show()
2818 seq_indent(seq, iter->depth); in fib_trie_seq_show()
2819 seq_printf(seq, " |-- %pI4\n", &val); in fib_trie_seq_show()
2821 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) { in fib_trie_seq_show()
2824 seq_indent(seq, iter->depth + 1); in fib_trie_seq_show()
2826 KEYLENGTH - fa->fa_slen, in fib_trie_seq_show()
2828 fa->fa_info->fib_scope), in fib_trie_seq_show()
2830 fa->fa_type)); in fib_trie_seq_show()
2831 if (fa->fa_dscp) in fib_trie_seq_show()
2833 inet_dscp_to_dsfield(fa->fa_dscp)); in fib_trie_seq_show()
2852 loff_t pos; member
2857 loff_t pos) in fib_route_get_idx() argument
2859 struct key_vector *l, **tp = &iter->tnode; in fib_route_get_idx()
2863 if (iter->pos > 0 && pos >= iter->pos) { in fib_route_get_idx()
2864 key = iter->key; in fib_route_get_idx()
2866 iter->pos = 1; in fib_route_get_idx()
2870 pos -= iter->pos; in fib_route_get_idx()
2872 while ((l = leaf_walk_rcu(tp, key)) && (pos-- > 0)) { in fib_route_get_idx()
2873 key = l->key + 1; in fib_route_get_idx()
2874 iter->pos++; in fib_route_get_idx()
2883 iter->key = l->key; /* remember it */ in fib_route_get_idx()
2885 iter->pos = 0; /* forget it */ in fib_route_get_idx()
2890 static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos) in fib_route_seq_start() argument
2893 struct fib_route_iter *iter = seq->private; in fib_route_seq_start()
2903 iter->main_tb = tb; in fib_route_seq_start()
2904 t = (struct trie *)tb->tb_data; in fib_route_seq_start()
2905 iter->tnode = t->kv; in fib_route_seq_start()
2907 if (*pos != 0) in fib_route_seq_start()
2908 return fib_route_get_idx(iter, *pos); in fib_route_seq_start()
2910 iter->pos = 0; in fib_route_seq_start()
2911 iter->key = KEY_MAX; in fib_route_seq_start()
2916 static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos) in fib_route_seq_next() argument
2918 struct fib_route_iter *iter = seq->private; in fib_route_seq_next()
2920 t_key key = iter->key + 1; in fib_route_seq_next()
2922 ++*pos; in fib_route_seq_next()
2926 l = leaf_walk_rcu(&iter->tnode, key); in fib_route_seq_next()
2929 iter->key = l->key; in fib_route_seq_next()
2930 iter->pos++; in fib_route_seq_next()
2932 iter->pos = 0; in fib_route_seq_next()
2953 if (nhc->nhc_gw.ipv4) in fib_flag_trans()
2970 struct fib_route_iter *iter = seq->private; in fib_route_seq_show()
2971 struct fib_table *tb = iter->main_tb; in fib_route_seq_show()
2977 seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway " in fib_route_seq_show()
2983 prefix = htonl(l->key); in fib_route_seq_show()
2985 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) { in fib_route_seq_show()
2986 struct fib_info *fi = fa->fa_info; in fib_route_seq_show()
2987 __be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen); in fib_route_seq_show()
2988 unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi); in fib_route_seq_show()
2990 if ((fa->fa_type == RTN_BROADCAST) || in fib_route_seq_show()
2991 (fa->fa_type == RTN_MULTICAST)) in fib_route_seq_show()
2994 if (fa->tb_id != tb->tb_id) in fib_route_seq_show()
3003 if (nhc->nhc_gw_family == AF_INET) in fib_route_seq_show()
3004 gw = nhc->nhc_gw.ipv4; in fib_route_seq_show()
3009 nhc->nhc_dev ? nhc->nhc_dev->name : "*", in fib_route_seq_show()
3011 fi->fib_priority, in fib_route_seq_show()
3013 (fi->fib_advmss ? in fib_route_seq_show()
3014 fi->fib_advmss + 40 : 0), in fib_route_seq_show()
3015 fi->fib_window, in fib_route_seq_show()
3016 fi->fib_rtt >> 3); in fib_route_seq_show()
3039 if (!proc_create_net("fib_trie", 0444, net->proc_net, &fib_trie_seq_ops, in fib_proc_init()
3043 if (!proc_create_net_single("fib_triestat", 0444, net->proc_net, in fib_proc_init()
3047 if (!proc_create_net("route", 0444, net->proc_net, &fib_route_seq_ops, in fib_proc_init()
3054 remove_proc_entry("fib_triestat", net->proc_net); in fib_proc_init()
3056 remove_proc_entry("fib_trie", net->proc_net); in fib_proc_init()
3058 return -ENOMEM; in fib_proc_init()
3063 remove_proc_entry("fib_trie", net->proc_net); in fib_proc_exit()
3064 remove_proc_entry("fib_triestat", net->proc_net); in fib_proc_exit()
3065 remove_proc_entry("route", net->proc_net); in fib_proc_exit()