blob: 026f309c51e9b6143e74efe2d31c8c5e7a7a3c26 [file] [log] [blame]
Robert Olsson19baf832005-06-21 12:43:18 -07001/*
2 * This program is free software; you can redistribute it and/or
3 * modify it under the terms of the GNU General Public License
4 * as published by the Free Software Foundation; either version
5 * 2 of the License, or (at your option) any later version.
6 *
7 * Robert Olsson <robert.olsson@its.uu.se> Uppsala Universitet
8 * & Swedish University of Agricultural Sciences.
9 *
YOSHIFUJI Hideakie905a9e2007-02-09 23:24:47 +090010 * Jens Laas <jens.laas@data.slu.se> Swedish University of
Robert Olsson19baf832005-06-21 12:43:18 -070011 * Agricultural Sciences.
YOSHIFUJI Hideakie905a9e2007-02-09 23:24:47 +090012 *
Robert Olsson19baf832005-06-21 12:43:18 -070013 * Hans Liss <hans.liss@its.uu.se> Uppsala Universitet
14 *
Lucas De Marchi25985ed2011-03-30 22:57:33 -030015 * This work is based on the LPC-trie which is originally described in:
YOSHIFUJI Hideakie905a9e2007-02-09 23:24:47 +090016 *
Robert Olsson19baf832005-06-21 12:43:18 -070017 * An experimental study of compression methods for dynamic tries
18 * Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002.
Justin P. Mattock631dd1a2010-10-18 11:03:14 +020019 * http://www.csc.kth.se/~snilsson/software/dyntrie2/
Robert Olsson19baf832005-06-21 12:43:18 -070020 *
21 *
22 * IP-address lookup using LC-tries. Stefan Nilsson and Gunnar Karlsson
23 * IEEE Journal on Selected Areas in Communications, 17(6):1083-1092, June 1999
24 *
Robert Olsson19baf832005-06-21 12:43:18 -070025 *
26 * Code from fib_hash has been reused which includes the following header:
27 *
28 *
29 * INET An implementation of the TCP/IP protocol suite for the LINUX
30 * operating system. INET is implemented using the BSD Socket
31 * interface as the means of communication with the user level.
32 *
33 * IPv4 FIB: lookup engine and maintenance routines.
34 *
35 *
36 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
37 *
38 * This program is free software; you can redistribute it and/or
39 * modify it under the terms of the GNU General Public License
40 * as published by the Free Software Foundation; either version
41 * 2 of the License, or (at your option) any later version.
Robert Olssonfd966252005-12-22 11:25:10 -080042 *
43 * Substantial contributions to this work comes from:
44 *
45 * David S. Miller, <davem@davemloft.net>
46 * Stephen Hemminger <shemminger@osdl.org>
47 * Paul E. McKenney <paulmck@us.ibm.com>
48 * Patrick McHardy <kaber@trash.net>
Robert Olsson19baf832005-06-21 12:43:18 -070049 */
50
Jens Låås80b71b82009-08-28 23:57:15 -070051#define VERSION "0.409"
Robert Olsson19baf832005-06-21 12:43:18 -070052
Robert Olsson19baf832005-06-21 12:43:18 -070053#include <asm/uaccess.h>
Jiri Slaby1977f032007-10-18 23:40:25 -070054#include <linux/bitops.h>
Robert Olsson19baf832005-06-21 12:43:18 -070055#include <linux/types.h>
56#include <linux/kernel.h>
Robert Olsson19baf832005-06-21 12:43:18 -070057#include <linux/mm.h>
58#include <linux/string.h>
59#include <linux/socket.h>
60#include <linux/sockios.h>
61#include <linux/errno.h>
62#include <linux/in.h>
63#include <linux/inet.h>
Stephen Hemmingercd8787a2006-01-03 14:38:34 -080064#include <linux/inetdevice.h>
Robert Olsson19baf832005-06-21 12:43:18 -070065#include <linux/netdevice.h>
66#include <linux/if_arp.h>
67#include <linux/proc_fs.h>
Robert Olsson2373ce12005-08-25 13:01:29 -070068#include <linux/rcupdate.h>
Robert Olsson19baf832005-06-21 12:43:18 -070069#include <linux/skbuff.h>
70#include <linux/netlink.h>
71#include <linux/init.h>
72#include <linux/list.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090073#include <linux/slab.h>
Paul Gortmakerbc3b2d72011-07-15 11:47:34 -040074#include <linux/export.h>
David S. Millerffa915d2015-05-27 00:19:03 -040075#include <linux/vmalloc.h>
Jiri Pirkob90eb752016-09-26 12:52:29 +020076#include <linux/notifier.h>
Eric W. Biederman457c4cb2007-09-12 12:01:34 +020077#include <net/net_namespace.h>
Robert Olsson19baf832005-06-21 12:43:18 -070078#include <net/ip.h>
79#include <net/protocol.h>
80#include <net/route.h>
81#include <net/tcp.h>
82#include <net/sock.h>
83#include <net/ip_fib.h>
David Ahernf6d3c192015-08-28 08:42:09 -070084#include <trace/events/fib.h>
Robert Olsson19baf832005-06-21 12:43:18 -070085#include "fib_lookup.h"
86
Jiri Pirkob90eb752016-09-26 12:52:29 +020087static BLOCKING_NOTIFIER_HEAD(fib_chain);
88
89int register_fib_notifier(struct notifier_block *nb)
90{
91 return blocking_notifier_chain_register(&fib_chain, nb);
92}
93EXPORT_SYMBOL(register_fib_notifier);
94
95int unregister_fib_notifier(struct notifier_block *nb)
96{
97 return blocking_notifier_chain_unregister(&fib_chain, nb);
98}
99EXPORT_SYMBOL(unregister_fib_notifier);
100
101int call_fib_notifiers(struct net *net, enum fib_event_type event_type,
102 struct fib_notifier_info *info)
103{
104 info->net = net;
105 return blocking_notifier_call_chain(&fib_chain, event_type, info);
106}
107
108static int call_fib_entry_notifiers(struct net *net,
109 enum fib_event_type event_type, u32 dst,
110 int dst_len, struct fib_info *fi,
111 u8 tos, u8 type, u32 tb_id, u32 nlflags)
112{
113 struct fib_entry_notifier_info info = {
114 .dst = dst,
115 .dst_len = dst_len,
116 .fi = fi,
117 .tos = tos,
118 .type = type,
119 .tb_id = tb_id,
120 .nlflags = nlflags,
121 };
122 return call_fib_notifiers(net, event_type, &info.info);
123}
124
Robert Olsson06ef9212006-03-20 21:35:01 -0800125#define MAX_STAT_DEPTH 32
Robert Olsson19baf832005-06-21 12:43:18 -0700126
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800127#define KEYLENGTH (8*sizeof(t_key))
128#define KEY_MAX ((t_key)~0)
Robert Olsson19baf832005-06-21 12:43:18 -0700129
Robert Olsson19baf832005-06-21 12:43:18 -0700130typedef unsigned int t_key;
131
Alexander Duyck88bae712015-03-06 09:54:52 -0800132#define IS_TRIE(n) ((n)->pos >= KEYLENGTH)
133#define IS_TNODE(n) ((n)->bits)
134#define IS_LEAF(n) (!(n)->bits)
Robert Olsson2373ce12005-08-25 13:01:29 -0700135
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800136struct key_vector {
Alexander Duyck41b489f2015-03-04 15:02:33 -0800137 t_key key;
138 unsigned char pos; /* 2log(KEYLENGTH) bits needed */
139 unsigned char bits; /* 2log(KEYLENGTH) bits needed */
140 unsigned char slen;
Alexander Duyckadaf9812014-12-31 10:55:47 -0800141 union {
Alexander Duyck41b489f2015-03-04 15:02:33 -0800142 /* This list pointer if valid if (pos | bits) == 0 (LEAF) */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800143 struct hlist_head leaf;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800144 /* This array is valid if (pos | bits) > 0 (TNODE) */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800145 struct key_vector __rcu *tnode[0];
Alexander Duyckadaf9812014-12-31 10:55:47 -0800146 };
Robert Olsson19baf832005-06-21 12:43:18 -0700147};
148
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800149struct tnode {
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800150 struct rcu_head rcu;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800151 t_key empty_children; /* KEYLENGTH bits needed */
152 t_key full_children; /* KEYLENGTH bits needed */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800153 struct key_vector __rcu *parent;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800154 struct key_vector kv[1];
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800155#define tn_bits kv[0].bits
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800156};
157
158#define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n])
Alexander Duyck41b489f2015-03-04 15:02:33 -0800159#define LEAF_SIZE TNODE_SIZE(1)
160
Robert Olsson19baf832005-06-21 12:43:18 -0700161#ifdef CONFIG_IP_FIB_TRIE_STATS
162struct trie_use_stats {
163 unsigned int gets;
164 unsigned int backtrack;
165 unsigned int semantic_match_passed;
166 unsigned int semantic_match_miss;
167 unsigned int null_node_hit;
Robert Olsson2f368952005-07-05 15:02:40 -0700168 unsigned int resize_node_skipped;
Robert Olsson19baf832005-06-21 12:43:18 -0700169};
170#endif
171
172struct trie_stat {
173 unsigned int totdepth;
174 unsigned int maxdepth;
175 unsigned int tnodes;
176 unsigned int leaves;
177 unsigned int nullpointers;
Stephen Hemminger93672292008-01-22 21:54:05 -0800178 unsigned int prefixes;
Robert Olsson06ef9212006-03-20 21:35:01 -0800179 unsigned int nodesizes[MAX_STAT_DEPTH];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700180};
Robert Olsson19baf832005-06-21 12:43:18 -0700181
182struct trie {
Alexander Duyck88bae712015-03-06 09:54:52 -0800183 struct key_vector kv[1];
Robert Olsson19baf832005-06-21 12:43:18 -0700184#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -0800185 struct trie_use_stats __percpu *stats;
Robert Olsson19baf832005-06-21 12:43:18 -0700186#endif
Robert Olsson19baf832005-06-21 12:43:18 -0700187};
188
Alexander Duyck88bae712015-03-06 09:54:52 -0800189static struct key_vector *resize(struct trie *t, struct key_vector *tn);
Jarek Poplawskic3059472009-07-14 08:33:08 +0000190static size_t tnode_free_size;
191
192/*
193 * synchronize_rcu after call_rcu for that many pages; it should be especially
194 * useful before resizing the root node with PREEMPT_NONE configs; the value was
195 * obtained experimentally, aiming to avoid visible slowdown.
196 */
197static const int sync_pages = 128;
Robert Olsson19baf832005-06-21 12:43:18 -0700198
Christoph Lametere18b8902006-12-06 20:33:20 -0800199static struct kmem_cache *fn_alias_kmem __read_mostly;
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -0800200static struct kmem_cache *trie_leaf_kmem __read_mostly;
Robert Olsson19baf832005-06-21 12:43:18 -0700201
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800202static inline struct tnode *tn_info(struct key_vector *kv)
203{
204 return container_of(kv, struct tnode, kv[0]);
205}
206
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800207/* caller must hold RTNL */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800208#define node_parent(tn) rtnl_dereference(tn_info(tn)->parent)
Alexander Duyck754baf82015-03-06 09:54:14 -0800209#define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700210
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800211/* caller must hold RCU read lock or RTNL */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800212#define node_parent_rcu(tn) rcu_dereference_rtnl(tn_info(tn)->parent)
Alexander Duyck754baf82015-03-06 09:54:14 -0800213#define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700214
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800215/* wrapper for rcu_assign_pointer */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800216static inline void node_set_parent(struct key_vector *n, struct key_vector *tp)
Stephen Hemminger06801912007-08-10 15:22:13 -0700217{
Alexander Duyckadaf9812014-12-31 10:55:47 -0800218 if (n)
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800219 rcu_assign_pointer(tn_info(n)->parent, tp);
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800220}
221
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800222#define NODE_INIT_PARENT(n, p) RCU_INIT_POINTER(tn_info(n)->parent, p)
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800223
224/* This provides us with the number of children in this node, in the case of a
225 * leaf this will return 0 meaning none of the children are accessible.
226 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800227static inline unsigned long child_length(const struct key_vector *tn)
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800228{
229 return (1ul << tn->bits) & ~(1ul);
Stephen Hemminger06801912007-08-10 15:22:13 -0700230}
Robert Olsson2373ce12005-08-25 13:01:29 -0700231
Alexander Duyck88bae712015-03-06 09:54:52 -0800232#define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos)
233
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800234static inline unsigned long get_index(t_key key, struct key_vector *kv)
235{
236 unsigned long index = key ^ kv->key;
237
Alexander Duyck88bae712015-03-06 09:54:52 -0800238 if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos))
239 return 0;
240
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800241 return index >> kv->pos;
242}
243
Alexander Duycke9b44012014-12-31 10:56:12 -0800244/* To understand this stuff, an understanding of keys and all their bits is
245 * necessary. Every node in the trie has a key associated with it, but not
246 * all of the bits in that key are significant.
247 *
248 * Consider a node 'n' and its parent 'tp'.
249 *
250 * If n is a leaf, every bit in its key is significant. Its presence is
251 * necessitated by path compression, since during a tree traversal (when
252 * searching for a leaf - unless we are doing an insertion) we will completely
253 * ignore all skipped bits we encounter. Thus we need to verify, at the end of
254 * a potentially successful search, that we have indeed been walking the
255 * correct key path.
256 *
257 * Note that we can never "miss" the correct key in the tree if present by
258 * following the wrong path. Path compression ensures that segments of the key
259 * that are the same for all keys with a given prefix are skipped, but the
260 * skipped part *is* identical for each node in the subtrie below the skipped
261 * bit! trie_insert() in this implementation takes care of that.
262 *
263 * if n is an internal node - a 'tnode' here, the various parts of its key
264 * have many different meanings.
265 *
266 * Example:
267 * _________________________________________________________________
268 * | i | i | i | i | i | i | i | N | N | N | S | S | S | S | S | C |
269 * -----------------------------------------------------------------
270 * 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16
271 *
272 * _________________________________________________________________
273 * | C | C | C | u | u | u | u | u | u | u | u | u | u | u | u | u |
274 * -----------------------------------------------------------------
275 * 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
276 *
277 * tp->pos = 22
278 * tp->bits = 3
279 * n->pos = 13
280 * n->bits = 4
281 *
282 * First, let's just ignore the bits that come before the parent tp, that is
283 * the bits from (tp->pos + tp->bits) to 31. They are *known* but at this
284 * point we do not use them for anything.
285 *
286 * The bits from (tp->pos) to (tp->pos + tp->bits - 1) - "N", above - are the
287 * index into the parent's child array. That is, they will be used to find
288 * 'n' among tp's children.
289 *
Xunlei Pang98a384e2016-08-18 12:33:28 +0800290 * The bits from (n->pos + n->bits) to (tp->pos - 1) - "S" - are skipped bits
Alexander Duycke9b44012014-12-31 10:56:12 -0800291 * for the node n.
292 *
293 * All the bits we have seen so far are significant to the node n. The rest
294 * of the bits are really not needed or indeed known in n->key.
295 *
296 * The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into
297 * n's child array, and will of course be different for each child.
298 *
Xunlei Pang98a384e2016-08-18 12:33:28 +0800299 * The rest of the bits, from 0 to (n->pos -1) - "u" - are completely unknown
Alexander Duycke9b44012014-12-31 10:56:12 -0800300 * at this point.
301 */
Robert Olsson19baf832005-06-21 12:43:18 -0700302
Denis V. Lunevf5026fa2007-12-13 09:47:57 -0800303static const int halve_threshold = 25;
304static const int inflate_threshold = 50;
Jarek Poplawski345aa032009-07-07 19:39:16 -0700305static const int halve_threshold_root = 15;
Jens Låås80b71b82009-08-28 23:57:15 -0700306static const int inflate_threshold_root = 30;
Robert Olsson2373ce12005-08-25 13:01:29 -0700307
308static void __alias_free_mem(struct rcu_head *head)
309{
310 struct fib_alias *fa = container_of(head, struct fib_alias, rcu);
311 kmem_cache_free(fn_alias_kmem, fa);
312}
313
314static inline void alias_free_mem_rcu(struct fib_alias *fa)
315{
316 call_rcu(&fa->rcu, __alias_free_mem);
317}
318
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800319#define TNODE_KMALLOC_MAX \
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800320 ilog2((PAGE_SIZE - TNODE_SIZE(0)) / sizeof(struct key_vector *))
Alexander Duyck1de3d872015-03-04 15:04:46 -0800321#define TNODE_VMALLOC_MAX \
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800322 ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800323
324static void __node_free_rcu(struct rcu_head *head)
Robert Olsson2373ce12005-08-25 13:01:29 -0700325{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800326 struct tnode *n = container_of(head, struct tnode, rcu);
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800327
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800328 if (!n->tn_bits)
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800329 kmem_cache_free(trie_leaf_kmem, n);
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800330 else
Tetsuo Handa1d5cfdb2016-01-22 15:11:02 -0800331 kvfree(n);
Robert Olsson2373ce12005-08-25 13:01:29 -0700332}
333
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800334#define node_free(n) call_rcu(&tn_info(n)->rcu, __node_free_rcu)
Stephen Hemminger387a5482008-04-10 03:47:34 -0700335
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800336static struct tnode *tnode_alloc(int bits)
Robert Olsson2373ce12005-08-25 13:01:29 -0700337{
Alexander Duyck1de3d872015-03-04 15:04:46 -0800338 size_t size;
339
340 /* verify bits is within bounds */
341 if (bits > TNODE_VMALLOC_MAX)
342 return NULL;
343
344 /* determine size and verify it is non-zero and didn't overflow */
345 size = TNODE_SIZE(1ul << bits);
346
Robert Olsson2373ce12005-08-25 13:01:29 -0700347 if (size <= PAGE_SIZE)
Eric Dumazet8d965442008-01-13 22:31:44 -0800348 return kzalloc(size, GFP_KERNEL);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700349 else
Eric Dumazet7a1c8e52010-11-20 07:46:35 +0000350 return vzalloc(size);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700351}
Robert Olsson2373ce12005-08-25 13:01:29 -0700352
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800353static inline void empty_child_inc(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800354{
Alexander Duyck6e22d172015-03-06 09:54:39 -0800355 ++tn_info(n)->empty_children ? : ++tn_info(n)->full_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800356}
357
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800358static inline void empty_child_dec(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800359{
Alexander Duyck6e22d172015-03-06 09:54:39 -0800360 tn_info(n)->empty_children-- ? : tn_info(n)->full_children--;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800361}
362
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800363static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)
Robert Olsson19baf832005-06-21 12:43:18 -0700364{
Firo Yangf38b24c2015-06-08 11:54:51 +0800365 struct key_vector *l;
366 struct tnode *kv;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800367
Firo Yangf38b24c2015-06-08 11:54:51 +0800368 kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800369 if (!kv)
370 return NULL;
371
372 /* initialize key vector */
Firo Yangf38b24c2015-06-08 11:54:51 +0800373 l = kv->kv;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800374 l->key = key;
375 l->pos = 0;
376 l->bits = 0;
377 l->slen = fa->fa_slen;
378
379 /* link leaf to fib alias */
380 INIT_HLIST_HEAD(&l->leaf);
381 hlist_add_head(&fa->fa_list, &l->leaf);
382
Robert Olsson19baf832005-06-21 12:43:18 -0700383 return l;
384}
385
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800386static struct key_vector *tnode_new(t_key key, int pos, int bits)
Robert Olsson19baf832005-06-21 12:43:18 -0700387{
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800388 unsigned int shift = pos + bits;
Firo Yangf38b24c2015-06-08 11:54:51 +0800389 struct key_vector *tn;
390 struct tnode *tnode;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800391
392 /* verify bits and pos their msb bits clear and values are valid */
393 BUG_ON(!bits || (shift > KEYLENGTH));
Robert Olsson19baf832005-06-21 12:43:18 -0700394
Firo Yangf38b24c2015-06-08 11:54:51 +0800395 tnode = tnode_alloc(bits);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800396 if (!tnode)
397 return NULL;
398
Firo Yangf38b24c2015-06-08 11:54:51 +0800399 pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0),
400 sizeof(struct key_vector *) << bits);
401
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800402 if (bits == KEYLENGTH)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800403 tnode->full_children = 1;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800404 else
Alexander Duyck6e22d172015-03-06 09:54:39 -0800405 tnode->empty_children = 1ul << bits;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800406
Firo Yangf38b24c2015-06-08 11:54:51 +0800407 tn = tnode->kv;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800408 tn->key = (shift < KEYLENGTH) ? (key >> shift) << shift : 0;
409 tn->pos = pos;
410 tn->bits = bits;
411 tn->slen = pos;
412
Robert Olsson19baf832005-06-21 12:43:18 -0700413 return tn;
414}
415
Alexander Duycke9b44012014-12-31 10:56:12 -0800416/* Check whether a tnode 'n' is "full", i.e. it is an internal node
Robert Olsson19baf832005-06-21 12:43:18 -0700417 * and no bits are skipped. See discussion in dyntree paper p. 6
418 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800419static inline int tnode_full(struct key_vector *tn, struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700420{
Alexander Duycke9b44012014-12-31 10:56:12 -0800421 return n && ((n->pos + n->bits) == tn->pos) && IS_TNODE(n);
Robert Olsson19baf832005-06-21 12:43:18 -0700422}
423
Alexander Duyckff181ed2014-12-31 10:56:43 -0800424/* Add a child at position i overwriting the old value.
425 * Update the value of full_children and empty_children.
426 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800427static void put_child(struct key_vector *tn, unsigned long i,
428 struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700429{
Alexander Duyck754baf82015-03-06 09:54:14 -0800430 struct key_vector *chi = get_child(tn, i);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800431 int isfull, wasfull;
Robert Olsson19baf832005-06-21 12:43:18 -0700432
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800433 BUG_ON(i >= child_length(tn));
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700434
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800435 /* update emptyChildren, overflow into fullChildren */
Ian Morris00db4122015-04-03 09:17:27 +0100436 if (!n && chi)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800437 empty_child_inc(tn);
Ian Morris00db4122015-04-03 09:17:27 +0100438 if (n && !chi)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800439 empty_child_dec(tn);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700440
Robert Olsson19baf832005-06-21 12:43:18 -0700441 /* update fullChildren */
Alexander Duyckff181ed2014-12-31 10:56:43 -0800442 wasfull = tnode_full(tn, chi);
Robert Olsson19baf832005-06-21 12:43:18 -0700443 isfull = tnode_full(tn, n);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800444
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700445 if (wasfull && !isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800446 tn_info(tn)->full_children--;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700447 else if (!wasfull && isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800448 tn_info(tn)->full_children++;
Olof Johansson91b9a272005-08-09 20:24:39 -0700449
Alexander Duyck5405afd2014-12-31 10:57:08 -0800450 if (n && (tn->slen < n->slen))
451 tn->slen = n->slen;
452
Alexander Duyck41b489f2015-03-04 15:02:33 -0800453 rcu_assign_pointer(tn->tnode[i], n);
Robert Olsson19baf832005-06-21 12:43:18 -0700454}
455
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800456static void update_children(struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800457{
458 unsigned long i;
459
460 /* update all of the child parent pointers */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800461 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800462 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800463
464 if (!inode)
465 continue;
466
467 /* Either update the children of a tnode that
468 * already belongs to us or update the child
469 * to point to ourselves.
470 */
471 if (node_parent(inode) == tn)
472 update_children(inode);
473 else
474 node_set_parent(inode, tn);
475 }
476}
477
Alexander Duyck88bae712015-03-06 09:54:52 -0800478static inline void put_child_root(struct key_vector *tp, t_key key,
479 struct key_vector *n)
Alexander Duyck836a0122014-12-31 10:56:06 -0800480{
Alexander Duyck88bae712015-03-06 09:54:52 -0800481 if (IS_TRIE(tp))
482 rcu_assign_pointer(tp->tnode[0], n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800483 else
Alexander Duyck88bae712015-03-06 09:54:52 -0800484 put_child(tp, get_index(key, tp), n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800485}
486
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800487static inline void tnode_free_init(struct key_vector *tn)
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700488{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800489 tn_info(tn)->rcu.next = NULL;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800490}
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700491
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800492static inline void tnode_free_append(struct key_vector *tn,
493 struct key_vector *n)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800494{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800495 tn_info(n)->rcu.next = tn_info(tn)->rcu.next;
496 tn_info(tn)->rcu.next = &tn_info(n)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800497}
498
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800499static void tnode_free(struct key_vector *tn)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800500{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800501 struct callback_head *head = &tn_info(tn)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800502
503 while (head) {
504 head = head->next;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800505 tnode_free_size += TNODE_SIZE(1ul << tn->bits);
Alexander Duyckfc86a932014-12-31 10:56:49 -0800506 node_free(tn);
507
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800508 tn = container_of(head, struct tnode, rcu)->kv;
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700509 }
Alexander Duyckfc86a932014-12-31 10:56:49 -0800510
511 if (tnode_free_size >= PAGE_SIZE * sync_pages) {
512 tnode_free_size = 0;
513 synchronize_rcu();
514 }
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700515}
516
Alexander Duyck88bae712015-03-06 09:54:52 -0800517static struct key_vector *replace(struct trie *t,
518 struct key_vector *oldtnode,
519 struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800520{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800521 struct key_vector *tp = node_parent(oldtnode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800522 unsigned long i;
523
524 /* setup the parent pointer out of and back into this node */
525 NODE_INIT_PARENT(tn, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -0800526 put_child_root(tp, tn->key, tn);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800527
528 /* update all of the child parent pointers */
529 update_children(tn);
530
531 /* all pointers should be clean so we are done */
532 tnode_free(oldtnode);
533
534 /* resize children now that oldtnode is freed */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800535 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800536 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800537
538 /* resize child node */
539 if (tnode_full(tn, inode))
Alexander Duyck88bae712015-03-06 09:54:52 -0800540 tn = resize(t, inode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800541 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800542
Alexander Duyck88bae712015-03-06 09:54:52 -0800543 return tp;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800544}
545
Alexander Duyck88bae712015-03-06 09:54:52 -0800546static struct key_vector *inflate(struct trie *t,
547 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700548{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800549 struct key_vector *tn;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800550 unsigned long i;
Alexander Duycke9b44012014-12-31 10:56:12 -0800551 t_key m;
Robert Olsson19baf832005-06-21 12:43:18 -0700552
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700553 pr_debug("In inflate\n");
Robert Olsson19baf832005-06-21 12:43:18 -0700554
Alexander Duycke9b44012014-12-31 10:56:12 -0800555 tn = tnode_new(oldtnode->key, oldtnode->pos - 1, oldtnode->bits + 1);
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700556 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800557 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700558
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800559 /* prepare oldtnode to be freed */
560 tnode_free_init(oldtnode);
561
Alexander Duyck12c081a2014-12-31 10:56:55 -0800562 /* Assemble all of the pointers in our cluster, in this case that
563 * represents all of the pointers out of our allocated nodes that
564 * point to existing tnodes and the links between our allocated
565 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700566 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800567 for (i = child_length(oldtnode), m = 1u << tn->pos; i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800568 struct key_vector *inode = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800569 struct key_vector *node0, *node1;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800570 unsigned long j, k;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700571
Robert Olsson19baf832005-06-21 12:43:18 -0700572 /* An empty child */
Ian Morris51456b22015-04-03 09:17:26 +0100573 if (!inode)
Robert Olsson19baf832005-06-21 12:43:18 -0700574 continue;
575
576 /* A leaf or an internal node with skipped bits */
Alexander Duyckadaf9812014-12-31 10:55:47 -0800577 if (!tnode_full(oldtnode, inode)) {
Alexander Duycke9b44012014-12-31 10:56:12 -0800578 put_child(tn, get_index(inode->key, tn), inode);
Robert Olsson19baf832005-06-21 12:43:18 -0700579 continue;
580 }
581
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800582 /* drop the node in the old tnode free list */
583 tnode_free_append(oldtnode, inode);
584
Robert Olsson19baf832005-06-21 12:43:18 -0700585 /* An internal node with two children */
Robert Olsson19baf832005-06-21 12:43:18 -0700586 if (inode->bits == 1) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800587 put_child(tn, 2 * i + 1, get_child(inode, 1));
588 put_child(tn, 2 * i, get_child(inode, 0));
Olof Johansson91b9a272005-08-09 20:24:39 -0700589 continue;
Robert Olsson19baf832005-06-21 12:43:18 -0700590 }
591
Olof Johansson91b9a272005-08-09 20:24:39 -0700592 /* We will replace this node 'inode' with two new
Alexander Duyck12c081a2014-12-31 10:56:55 -0800593 * ones, 'node0' and 'node1', each with half of the
Olof Johansson91b9a272005-08-09 20:24:39 -0700594 * original children. The two new nodes will have
595 * a position one bit further down the key and this
596 * means that the "significant" part of their keys
597 * (see the discussion near the top of this file)
598 * will differ by one bit, which will be "0" in
Alexander Duyck12c081a2014-12-31 10:56:55 -0800599 * node0's key and "1" in node1's key. Since we are
Olof Johansson91b9a272005-08-09 20:24:39 -0700600 * moving the key position by one step, the bit that
601 * we are moving away from - the bit at position
Alexander Duyck12c081a2014-12-31 10:56:55 -0800602 * (tn->pos) - is the one that will differ between
603 * node0 and node1. So... we synthesize that bit in the
604 * two new keys.
Olof Johansson91b9a272005-08-09 20:24:39 -0700605 */
Alexander Duyck12c081a2014-12-31 10:56:55 -0800606 node1 = tnode_new(inode->key | m, inode->pos, inode->bits - 1);
607 if (!node1)
608 goto nomem;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800609 node0 = tnode_new(inode->key, inode->pos, inode->bits - 1);
Robert Olsson19baf832005-06-21 12:43:18 -0700610
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800611 tnode_free_append(tn, node1);
Alexander Duyck12c081a2014-12-31 10:56:55 -0800612 if (!node0)
613 goto nomem;
614 tnode_free_append(tn, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700615
Alexander Duyck12c081a2014-12-31 10:56:55 -0800616 /* populate child pointers in new nodes */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800617 for (k = child_length(inode), j = k / 2; j;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800618 put_child(node1, --j, get_child(inode, --k));
619 put_child(node0, j, get_child(inode, j));
620 put_child(node1, --j, get_child(inode, --k));
621 put_child(node0, j, get_child(inode, j));
Robert Olsson19baf832005-06-21 12:43:18 -0700622 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800623
Alexander Duyck12c081a2014-12-31 10:56:55 -0800624 /* link new nodes to parent */
625 NODE_INIT_PARENT(node1, tn);
626 NODE_INIT_PARENT(node0, tn);
Olof Johansson91b9a272005-08-09 20:24:39 -0700627
Alexander Duyck12c081a2014-12-31 10:56:55 -0800628 /* link parent to nodes */
629 put_child(tn, 2 * i + 1, node1);
630 put_child(tn, 2 * i, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700631 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800632
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800633 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800634 return replace(t, oldtnode, tn);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700635nomem:
Alexander Duyckfc86a932014-12-31 10:56:49 -0800636 /* all pointers should be clean so we are done */
637 tnode_free(tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800638notnode:
639 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700640}
641
Alexander Duyck88bae712015-03-06 09:54:52 -0800642static struct key_vector *halve(struct trie *t,
643 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700644{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800645 struct key_vector *tn;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800646 unsigned long i;
Robert Olsson19baf832005-06-21 12:43:18 -0700647
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700648 pr_debug("In halve\n");
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700649
Alexander Duycke9b44012014-12-31 10:56:12 -0800650 tn = tnode_new(oldtnode->key, oldtnode->pos + 1, oldtnode->bits - 1);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700651 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800652 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700653
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800654 /* prepare oldtnode to be freed */
655 tnode_free_init(oldtnode);
656
Alexander Duyck12c081a2014-12-31 10:56:55 -0800657 /* Assemble all of the pointers in our cluster, in this case that
658 * represents all of the pointers out of our allocated nodes that
659 * point to existing tnodes and the links between our allocated
660 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700661 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800662 for (i = child_length(oldtnode); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800663 struct key_vector *node1 = get_child(oldtnode, --i);
664 struct key_vector *node0 = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800665 struct key_vector *inode;
Robert Olsson2f368952005-07-05 15:02:40 -0700666
Alexander Duyck12c081a2014-12-31 10:56:55 -0800667 /* At least one of the children is empty */
668 if (!node1 || !node0) {
669 put_child(tn, i / 2, node1 ? : node0);
670 continue;
Robert Olsson2f368952005-07-05 15:02:40 -0700671 }
Robert Olsson2f368952005-07-05 15:02:40 -0700672
Alexander Duyck12c081a2014-12-31 10:56:55 -0800673 /* Two nonempty children */
674 inode = tnode_new(node0->key, oldtnode->pos, 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800675 if (!inode)
676 goto nomem;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800677 tnode_free_append(tn, inode);
678
679 /* initialize pointers out of node */
680 put_child(inode, 1, node1);
681 put_child(inode, 0, node0);
682 NODE_INIT_PARENT(inode, tn);
683
684 /* link parent to node */
685 put_child(tn, i / 2, inode);
Robert Olsson2f368952005-07-05 15:02:40 -0700686 }
Robert Olsson19baf832005-06-21 12:43:18 -0700687
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800688 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800689 return replace(t, oldtnode, tn);
690nomem:
691 /* all pointers should be clean so we are done */
692 tnode_free(tn);
693notnode:
694 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700695}
696
Alexander Duyck88bae712015-03-06 09:54:52 -0800697static struct key_vector *collapse(struct trie *t,
698 struct key_vector *oldtnode)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800699{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800700 struct key_vector *n, *tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800701 unsigned long i;
702
703 /* scan the tnode looking for that one child that might still exist */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800704 for (n = NULL, i = child_length(oldtnode); !n && i;)
Alexander Duyck754baf82015-03-06 09:54:14 -0800705 n = get_child(oldtnode, --i);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800706
707 /* compress one level */
708 tp = node_parent(oldtnode);
Alexander Duyck88bae712015-03-06 09:54:52 -0800709 put_child_root(tp, oldtnode->key, n);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800710 node_set_parent(n, tp);
711
712 /* drop dead node */
713 node_free(oldtnode);
Alexander Duyck88bae712015-03-06 09:54:52 -0800714
715 return tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800716}
717
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800718static unsigned char update_suffix(struct key_vector *tn)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800719{
720 unsigned char slen = tn->pos;
721 unsigned long stride, i;
722
723 /* search though the list of children looking for nodes that might
724 * have a suffix greater than the one we currently have. This is
725 * why we start with a stride of 2 since a stride of 1 would
726 * represent the nodes with suffix length equal to tn->pos
727 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800728 for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800729 struct key_vector *n = get_child(tn, i);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800730
731 if (!n || (n->slen <= slen))
732 continue;
733
734 /* update stride and slen based on new value */
735 stride <<= (n->slen - slen);
736 slen = n->slen;
737 i &= ~(stride - 1);
738
739 /* if slen covers all but the last bit we can stop here
740 * there will be nothing longer than that since only node
741 * 0 and 1 << (bits - 1) could have that as their suffix
742 * length.
743 */
744 if ((slen + 1) >= (tn->pos + tn->bits))
745 break;
746 }
747
748 tn->slen = slen;
749
750 return slen;
751}
752
Alexander Duyckf05a4812014-12-31 10:56:37 -0800753/* From "Implementing a dynamic compressed trie" by Stefan Nilsson of
754 * the Helsinki University of Technology and Matti Tikkanen of Nokia
755 * Telecommunications, page 6:
756 * "A node is doubled if the ratio of non-empty children to all
757 * children in the *doubled* node is at least 'high'."
758 *
759 * 'high' in this instance is the variable 'inflate_threshold'. It
760 * is expressed as a percentage, so we multiply it with
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800761 * child_length() and instead of multiplying by 2 (since the
Alexander Duyckf05a4812014-12-31 10:56:37 -0800762 * child array will be doubled by inflate()) and multiplying
763 * the left-hand side by 100 (to handle the percentage thing) we
764 * multiply the left-hand side by 50.
765 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800766 * The left-hand side may look a bit weird: child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800767 * - tn->empty_children is of course the number of non-null children
768 * in the current node. tn->full_children is the number of "full"
769 * children, that is non-null tnodes with a skip value of 0.
770 * All of those will be doubled in the resulting inflated tnode, so
771 * we just count them one extra time here.
772 *
773 * A clearer way to write this would be:
774 *
775 * to_be_doubled = tn->full_children;
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800776 * not_to_be_doubled = child_length(tn) - tn->empty_children -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800777 * tn->full_children;
778 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800779 * new_child_length = child_length(tn) * 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800780 *
781 * new_fill_factor = 100 * (not_to_be_doubled + 2*to_be_doubled) /
782 * new_child_length;
783 * if (new_fill_factor >= inflate_threshold)
784 *
785 * ...and so on, tho it would mess up the while () loop.
786 *
787 * anyway,
788 * 100 * (not_to_be_doubled + 2*to_be_doubled) / new_child_length >=
789 * inflate_threshold
790 *
791 * avoid a division:
792 * 100 * (not_to_be_doubled + 2*to_be_doubled) >=
793 * inflate_threshold * new_child_length
794 *
795 * expand not_to_be_doubled and to_be_doubled, and shorten:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800796 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800797 * tn->full_children) >= inflate_threshold * new_child_length
798 *
799 * expand new_child_length:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800800 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800801 * tn->full_children) >=
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800802 * inflate_threshold * child_length(tn) * 2
Alexander Duyckf05a4812014-12-31 10:56:37 -0800803 *
804 * shorten again:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800805 * 50 * (tn->full_children + child_length(tn) -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800806 * tn->empty_children) >= inflate_threshold *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800807 * child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800808 *
809 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800810static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800811{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800812 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800813 unsigned long threshold = used;
814
815 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800816 threshold *= IS_TRIE(tp) ? inflate_threshold_root : inflate_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800817 used -= tn_info(tn)->empty_children;
818 used += tn_info(tn)->full_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800819
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800820 /* if bits == KEYLENGTH then pos = 0, and will fail below */
821
822 return (used > 1) && tn->pos && ((50 * used) >= threshold);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800823}
824
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800825static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800826{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800827 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800828 unsigned long threshold = used;
829
830 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800831 threshold *= IS_TRIE(tp) ? halve_threshold_root : halve_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800832 used -= tn_info(tn)->empty_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800833
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800834 /* if bits == KEYLENGTH then used = 100% on wrap, and will fail below */
835
836 return (used > 1) && (tn->bits > 1) && ((100 * used) < threshold);
837}
838
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800839static inline bool should_collapse(struct key_vector *tn)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800840{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800841 unsigned long used = child_length(tn);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800842
Alexander Duyck6e22d172015-03-06 09:54:39 -0800843 used -= tn_info(tn)->empty_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800844
845 /* account for bits == KEYLENGTH case */
Alexander Duyck6e22d172015-03-06 09:54:39 -0800846 if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800847 used -= KEY_MAX;
848
849 /* One child or none, time to drop us from the trie */
850 return used < 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800851}
852
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800853#define MAX_WORK 10
Alexander Duyck88bae712015-03-06 09:54:52 -0800854static struct key_vector *resize(struct trie *t, struct key_vector *tn)
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800855{
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800856#ifdef CONFIG_IP_FIB_TRIE_STATS
857 struct trie_use_stats __percpu *stats = t->stats;
858#endif
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800859 struct key_vector *tp = node_parent(tn);
Alexander Duyck88bae712015-03-06 09:54:52 -0800860 unsigned long cindex = get_index(tn->key, tp);
Alexander Duycka80e89d2015-01-22 15:51:20 -0800861 int max_work = MAX_WORK;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800862
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800863 pr_debug("In tnode_resize %p inflate_threshold=%d threshold=%d\n",
864 tn, inflate_threshold, halve_threshold);
865
Alexander Duyckff181ed2014-12-31 10:56:43 -0800866 /* track the tnode via the pointer from the parent instead of
867 * doing it ourselves. This way we can let RCU fully do its
868 * thing without us interfering
869 */
Alexander Duyck88bae712015-03-06 09:54:52 -0800870 BUG_ON(tn != get_child(tp, cindex));
Alexander Duyckff181ed2014-12-31 10:56:43 -0800871
Alexander Duyckf05a4812014-12-31 10:56:37 -0800872 /* Double as long as the resulting node has a number of
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800873 * nonempty nodes that are above the threshold.
874 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700875 while (should_inflate(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800876 tp = inflate(t, tn);
877 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800878#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800879 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800880#endif
881 break;
882 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800883
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700884 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800885 tn = get_child(tp, cindex);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800886 }
887
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700888 /* update parent in case inflate failed */
889 tp = node_parent(tn);
890
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800891 /* Return if at least one inflate is run */
892 if (max_work != MAX_WORK)
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700893 return tp;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800894
Alexander Duyckf05a4812014-12-31 10:56:37 -0800895 /* Halve as long as the number of empty children in this
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800896 * node is above threshold.
897 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700898 while (should_halve(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800899 tp = halve(t, tn);
900 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800901#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800902 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800903#endif
904 break;
905 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800906
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700907 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800908 tn = get_child(tp, cindex);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800909 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800910
911 /* Only one child remains */
Alexander Duyck88bae712015-03-06 09:54:52 -0800912 if (should_collapse(tn))
913 return collapse(t, tn);
914
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700915 /* update parent in case halve failed */
Alexander Duyck88bae712015-03-06 09:54:52 -0800916 tp = node_parent(tn);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800917
918 /* Return if at least one deflate was run */
919 if (max_work != MAX_WORK)
Alexander Duyck88bae712015-03-06 09:54:52 -0800920 return tp;
Alexander Duyck5405afd2014-12-31 10:57:08 -0800921
922 /* push the suffix length to the parent node */
923 if (tn->slen > tn->pos) {
924 unsigned char slen = update_suffix(tn);
925
Alexander Duyck88bae712015-03-06 09:54:52 -0800926 if (slen > tp->slen)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800927 tp->slen = slen;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800928 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800929
Alexander Duyck88bae712015-03-06 09:54:52 -0800930 return tp;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800931}
932
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800933static void leaf_pull_suffix(struct key_vector *tp, struct key_vector *l)
Robert Olsson19baf832005-06-21 12:43:18 -0700934{
Alexander Duyck88bae712015-03-06 09:54:52 -0800935 while ((tp->slen > tp->pos) && (tp->slen > l->slen)) {
Alexander Duyck5405afd2014-12-31 10:57:08 -0800936 if (update_suffix(tp) > l->slen)
937 break;
938 tp = node_parent(tp);
939 }
940}
941
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800942static void leaf_push_suffix(struct key_vector *tn, struct key_vector *l)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800943{
Alexander Duyck5405afd2014-12-31 10:57:08 -0800944 /* if this is a new leaf then tn will be NULL and we can sort
945 * out parent suffix lengths as a part of trie_rebalance
946 */
Alexander Duyck88bae712015-03-06 09:54:52 -0800947 while (tn->slen < l->slen) {
Alexander Duyck5405afd2014-12-31 10:57:08 -0800948 tn->slen = l->slen;
949 tn = node_parent(tn);
950 }
951}
952
Robert Olsson2373ce12005-08-25 13:01:29 -0700953/* rcu_read_lock needs to be hold by caller from readside */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800954static struct key_vector *fib_find_node(struct trie *t,
955 struct key_vector **tp, u32 key)
Robert Olsson19baf832005-06-21 12:43:18 -0700956{
Alexander Duyck88bae712015-03-06 09:54:52 -0800957 struct key_vector *pn, *n = t->kv;
958 unsigned long index = 0;
Robert Olsson19baf832005-06-21 12:43:18 -0700959
Alexander Duyck88bae712015-03-06 09:54:52 -0800960 do {
961 pn = n;
962 n = get_child_rcu(n, index);
963
964 if (!n)
965 break;
966
967 index = get_cindex(key, n);
Alexander Duyck939afb02014-12-31 10:56:00 -0800968
969 /* This bit of code is a bit tricky but it combines multiple
970 * checks into a single check. The prefix consists of the
971 * prefix plus zeros for the bits in the cindex. The index
972 * is the difference between the key and this value. From
973 * this we can actually derive several pieces of data.
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800974 * if (index >= (1ul << bits))
Alexander Duyck939afb02014-12-31 10:56:00 -0800975 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -0800976 * else
977 * we know the value is cindex
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800978 *
979 * This check is safe even if bits == KEYLENGTH due to the
980 * fact that we can only allocate a node with 32 bits if a
981 * long is greater than 32 bits.
Alexander Duyck939afb02014-12-31 10:56:00 -0800982 */
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800983 if (index >= (1ul << n->bits)) {
984 n = NULL;
985 break;
986 }
Alexander Duyck939afb02014-12-31 10:56:00 -0800987
Alexander Duyck88bae712015-03-06 09:54:52 -0800988 /* keep searching until we find a perfect match leaf or NULL */
989 } while (IS_TNODE(n));
Robert Olsson19baf832005-06-21 12:43:18 -0700990
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800991 *tp = pn;
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800992
Alexander Duyck939afb02014-12-31 10:56:00 -0800993 return n;
Robert Olsson19baf832005-06-21 12:43:18 -0700994}
995
Alexander Duyck02525362015-01-22 15:51:39 -0800996/* Return the first fib alias matching TOS with
997 * priority less than or equal to PRIO.
998 */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800999static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen,
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001000 u8 tos, u32 prio, u32 tb_id)
Alexander Duyck02525362015-01-22 15:51:39 -08001001{
1002 struct fib_alias *fa;
1003
1004 if (!fah)
1005 return NULL;
1006
Alexander Duyck56315f92015-02-25 15:31:31 -08001007 hlist_for_each_entry(fa, fah, fa_list) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001008 if (fa->fa_slen < slen)
1009 continue;
1010 if (fa->fa_slen != slen)
1011 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001012 if (fa->tb_id > tb_id)
1013 continue;
1014 if (fa->tb_id != tb_id)
1015 break;
Alexander Duyck02525362015-01-22 15:51:39 -08001016 if (fa->fa_tos > tos)
1017 continue;
1018 if (fa->fa_info->fib_priority >= prio || fa->fa_tos < tos)
1019 return fa;
1020 }
1021
1022 return NULL;
1023}
1024
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001025static void trie_rebalance(struct trie *t, struct key_vector *tn)
Robert Olsson19baf832005-06-21 12:43:18 -07001026{
Alexander Duyck88bae712015-03-06 09:54:52 -08001027 while (!IS_TRIE(tn))
1028 tn = resize(t, tn);
Robert Olsson19baf832005-06-21 12:43:18 -07001029}
1030
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001031static int fib_insert_node(struct trie *t, struct key_vector *tp,
Alexander Duyckd5d64872015-03-04 15:02:18 -08001032 struct fib_alias *new, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -07001033{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001034 struct key_vector *n, *l;
Alexander Duyck836a0122014-12-31 10:56:06 -08001035
Alexander Duyckd5d64872015-03-04 15:02:18 -08001036 l = leaf_new(key, new);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001037 if (!l)
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001038 goto noleaf;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001039
1040 /* retrieve child from parent node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001041 n = get_child(tp, get_index(key, tp));
Alexander Duyck836a0122014-12-31 10:56:06 -08001042
1043 /* Case 2: n is a LEAF or a TNODE and the key doesn't match.
1044 *
1045 * Add a new tnode here
1046 * first tnode need some special handling
1047 * leaves us in position for handling as case 3
1048 */
1049 if (n) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001050 struct key_vector *tn;
Alexander Duyck836a0122014-12-31 10:56:06 -08001051
Alexander Duycke9b44012014-12-31 10:56:12 -08001052 tn = tnode_new(key, __fls(key ^ n->key), 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001053 if (!tn)
1054 goto notnode;
Olof Johansson91b9a272005-08-09 20:24:39 -07001055
Alexander Duyck836a0122014-12-31 10:56:06 -08001056 /* initialize routes out of node */
1057 NODE_INIT_PARENT(tn, tp);
1058 put_child(tn, get_index(key, tn) ^ 1, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001059
Alexander Duyck836a0122014-12-31 10:56:06 -08001060 /* start adding routes into the node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001061 put_child_root(tp, key, tn);
Alexander Duyck836a0122014-12-31 10:56:06 -08001062 node_set_parent(n, tn);
Robert Olsson19baf832005-06-21 12:43:18 -07001063
Alexander Duyck836a0122014-12-31 10:56:06 -08001064 /* parent now has a NULL spot where the leaf can go */
Alexander Duycke962f302014-12-10 21:49:22 -08001065 tp = tn;
Robert Olsson19baf832005-06-21 12:43:18 -07001066 }
Olof Johansson91b9a272005-08-09 20:24:39 -07001067
Alexander Duyck836a0122014-12-31 10:56:06 -08001068 /* Case 3: n is NULL, and will just insert a new leaf */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001069 NODE_INIT_PARENT(l, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -08001070 put_child_root(tp, key, l);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001071 trie_rebalance(t, tp);
Olof Johansson91b9a272005-08-09 20:24:39 -07001072
Alexander Duyckd5d64872015-03-04 15:02:18 -08001073 return 0;
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001074notnode:
1075 node_free(l);
1076noleaf:
1077 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07001078}
1079
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001080static int fib_insert_alias(struct trie *t, struct key_vector *tp,
1081 struct key_vector *l, struct fib_alias *new,
Alexander Duyckd5d64872015-03-04 15:02:18 -08001082 struct fib_alias *fa, t_key key)
1083{
1084 if (!l)
1085 return fib_insert_node(t, tp, new, key);
1086
1087 if (fa) {
1088 hlist_add_before_rcu(&new->fa_list, &fa->fa_list);
1089 } else {
1090 struct fib_alias *last;
1091
1092 hlist_for_each_entry(last, &l->leaf, fa_list) {
1093 if (new->fa_slen < last->fa_slen)
1094 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001095 if ((new->fa_slen == last->fa_slen) &&
1096 (new->tb_id > last->tb_id))
1097 break;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001098 fa = last;
1099 }
1100
1101 if (fa)
1102 hlist_add_behind_rcu(&new->fa_list, &fa->fa_list);
1103 else
1104 hlist_add_head_rcu(&new->fa_list, &l->leaf);
1105 }
1106
1107 /* if we added to the tail node then we need to update slen */
1108 if (l->slen < new->fa_slen) {
1109 l->slen = new->fa_slen;
1110 leaf_push_suffix(tp, l);
1111 }
1112
1113 return 0;
1114}
1115
1116/* Caller must hold RTNL. */
Jiri Pirkob90eb752016-09-26 12:52:29 +02001117int fib_table_insert(struct net *net, struct fib_table *tb,
1118 struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001119{
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001120 struct trie *t = (struct trie *)tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001121 struct fib_alias *fa, *new_fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001122 struct key_vector *l, *tp;
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001123 u16 nlflags = NLM_F_EXCL;
Robert Olsson19baf832005-06-21 12:43:18 -07001124 struct fib_info *fi;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001125 u8 plen = cfg->fc_dst_len;
1126 u8 slen = KEYLENGTH - plen;
Thomas Graf4e902c52006-08-17 18:14:52 -07001127 u8 tos = cfg->fc_tos;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001128 u32 key;
Robert Olsson19baf832005-06-21 12:43:18 -07001129 int err;
Robert Olsson19baf832005-06-21 12:43:18 -07001130
Alexander Duyck5786ec62015-02-25 15:31:37 -08001131 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001132 return -EINVAL;
1133
Thomas Graf4e902c52006-08-17 18:14:52 -07001134 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001135
Patrick McHardy2dfe55b2006-08-10 23:08:33 -07001136 pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen);
Robert Olsson19baf832005-06-21 12:43:18 -07001137
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001138 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001139 return -EINVAL;
1140
Thomas Graf4e902c52006-08-17 18:14:52 -07001141 fi = fib_create_info(cfg);
1142 if (IS_ERR(fi)) {
1143 err = PTR_ERR(fi);
Robert Olsson19baf832005-06-21 12:43:18 -07001144 goto err;
Thomas Graf4e902c52006-08-17 18:14:52 -07001145 }
Robert Olsson19baf832005-06-21 12:43:18 -07001146
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001147 l = fib_find_node(t, &tp, key);
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001148 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority,
1149 tb->tb_id) : NULL;
Robert Olsson19baf832005-06-21 12:43:18 -07001150
1151 /* Now fa, if non-NULL, points to the first fib alias
1152 * with the same keys [prefix,tos,priority], if such key already
1153 * exists or to the node before which we will insert new one.
1154 *
1155 * If fa is NULL, we will need to allocate a new one and
Alexander Duyck56315f92015-02-25 15:31:31 -08001156 * insert to the tail of the section matching the suffix length
1157 * of the new alias.
Robert Olsson19baf832005-06-21 12:43:18 -07001158 */
1159
Julian Anastasov936f6f82008-01-28 21:18:06 -08001160 if (fa && fa->fa_tos == tos &&
1161 fa->fa_info->fib_priority == fi->fib_priority) {
1162 struct fib_alias *fa_first, *fa_match;
Robert Olsson19baf832005-06-21 12:43:18 -07001163
1164 err = -EEXIST;
Thomas Graf4e902c52006-08-17 18:14:52 -07001165 if (cfg->fc_nlflags & NLM_F_EXCL)
Robert Olsson19baf832005-06-21 12:43:18 -07001166 goto out;
1167
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001168 nlflags &= ~NLM_F_EXCL;
1169
Julian Anastasov936f6f82008-01-28 21:18:06 -08001170 /* We have 2 goals:
1171 * 1. Find exact match for type, scope, fib_info to avoid
1172 * duplicate routes
1173 * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it
1174 */
1175 fa_match = NULL;
1176 fa_first = fa;
Alexander Duyck56315f92015-02-25 15:31:31 -08001177 hlist_for_each_entry_from(fa, fa_list) {
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001178 if ((fa->fa_slen != slen) ||
1179 (fa->tb_id != tb->tb_id) ||
1180 (fa->fa_tos != tos))
Julian Anastasov936f6f82008-01-28 21:18:06 -08001181 break;
1182 if (fa->fa_info->fib_priority != fi->fib_priority)
1183 break;
1184 if (fa->fa_type == cfg->fc_type &&
Julian Anastasov936f6f82008-01-28 21:18:06 -08001185 fa->fa_info == fi) {
1186 fa_match = fa;
1187 break;
1188 }
1189 }
1190
Thomas Graf4e902c52006-08-17 18:14:52 -07001191 if (cfg->fc_nlflags & NLM_F_REPLACE) {
Robert Olsson19baf832005-06-21 12:43:18 -07001192 struct fib_info *fi_drop;
1193 u8 state;
1194
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001195 nlflags |= NLM_F_REPLACE;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001196 fa = fa_first;
1197 if (fa_match) {
1198 if (fa == fa_match)
1199 err = 0;
Joonwoo Park67250332008-01-18 03:45:18 -08001200 goto out;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001201 }
Robert Olsson2373ce12005-08-25 13:01:29 -07001202 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001203 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001204 if (!new_fa)
Robert Olsson2373ce12005-08-25 13:01:29 -07001205 goto out;
Robert Olsson19baf832005-06-21 12:43:18 -07001206
1207 fi_drop = fa->fa_info;
Robert Olsson2373ce12005-08-25 13:01:29 -07001208 new_fa->fa_tos = fa->fa_tos;
1209 new_fa->fa_info = fi;
Thomas Graf4e902c52006-08-17 18:14:52 -07001210 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001211 state = fa->fa_state;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001212 new_fa->fa_state = state & ~FA_S_ACCESSED;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001213 new_fa->fa_slen = fa->fa_slen;
Michal Kubečekd4e64c22015-05-22 13:40:09 +02001214 new_fa->tb_id = tb->tb_id;
Julian Anastasov2392deb2015-07-22 10:43:23 +03001215 new_fa->fa_default = -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001216
Alexander Duyck56315f92015-02-25 15:31:31 -08001217 hlist_replace_rcu(&fa->fa_list, &new_fa->fa_list);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001218
Robert Olsson2373ce12005-08-25 13:01:29 -07001219 alias_free_mem_rcu(fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001220
1221 fib_release_info(fi_drop);
1222 if (state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001223 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Jiri Pirkob90eb752016-09-26 12:52:29 +02001224
1225 call_fib_entry_notifiers(net, FIB_EVENT_ENTRY_ADD,
1226 key, plen, fi,
1227 new_fa->fa_tos, cfg->fc_type,
1228 tb->tb_id, cfg->fc_nlflags);
Milan Kocianb8f55832007-05-23 14:55:06 -07001229 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen,
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001230 tb->tb_id, &cfg->fc_nlinfo, nlflags);
Robert Olsson19baf832005-06-21 12:43:18 -07001231
Olof Johansson91b9a272005-08-09 20:24:39 -07001232 goto succeeded;
Robert Olsson19baf832005-06-21 12:43:18 -07001233 }
1234 /* Error if we find a perfect match which
1235 * uses the same scope, type, and nexthop
1236 * information.
1237 */
Julian Anastasov936f6f82008-01-28 21:18:06 -08001238 if (fa_match)
1239 goto out;
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001240
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001241 if (cfg->fc_nlflags & NLM_F_APPEND)
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001242 nlflags |= NLM_F_APPEND;
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001243 else
Julian Anastasov936f6f82008-01-28 21:18:06 -08001244 fa = fa_first;
Robert Olsson19baf832005-06-21 12:43:18 -07001245 }
1246 err = -ENOENT;
Thomas Graf4e902c52006-08-17 18:14:52 -07001247 if (!(cfg->fc_nlflags & NLM_F_CREATE))
Robert Olsson19baf832005-06-21 12:43:18 -07001248 goto out;
1249
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001250 nlflags |= NLM_F_CREATE;
Robert Olsson19baf832005-06-21 12:43:18 -07001251 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001252 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001253 if (!new_fa)
Robert Olsson19baf832005-06-21 12:43:18 -07001254 goto out;
1255
1256 new_fa->fa_info = fi;
1257 new_fa->fa_tos = tos;
Thomas Graf4e902c52006-08-17 18:14:52 -07001258 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001259 new_fa->fa_state = 0;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001260 new_fa->fa_slen = slen;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001261 new_fa->tb_id = tb->tb_id;
Julian Anastasov2392deb2015-07-22 10:43:23 +03001262 new_fa->fa_default = -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001263
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001264 /* Insert new entry to the list. */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001265 err = fib_insert_alias(t, tp, l, new_fa, fa, key);
1266 if (err)
Jiri Pirko347e3b22016-09-26 12:52:33 +02001267 goto out_free_new_fa;
Robert Olsson19baf832005-06-21 12:43:18 -07001268
David S. Miller21d8c492011-04-14 14:49:37 -07001269 if (!plen)
1270 tb->tb_num_default++;
1271
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001272 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Jiri Pirkob90eb752016-09-26 12:52:29 +02001273 call_fib_entry_notifiers(net, FIB_EVENT_ENTRY_ADD, key, plen, fi, tos,
1274 cfg->fc_type, tb->tb_id, cfg->fc_nlflags);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001275 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, new_fa->tb_id,
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001276 &cfg->fc_nlinfo, nlflags);
Robert Olsson19baf832005-06-21 12:43:18 -07001277succeeded:
1278 return 0;
Robert Olssonf835e472005-06-28 15:00:39 -07001279
1280out_free_new_fa:
1281 kmem_cache_free(fn_alias_kmem, new_fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001282out:
1283 fib_release_info(fi);
Olof Johansson91b9a272005-08-09 20:24:39 -07001284err:
Robert Olsson19baf832005-06-21 12:43:18 -07001285 return err;
1286}
1287
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001288static inline t_key prefix_mismatch(t_key key, struct key_vector *n)
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001289{
1290 t_key prefix = n->key;
1291
1292 return (key ^ prefix) & (prefix | -prefix);
1293}
1294
Alexander Duyck345e9b52014-12-31 10:56:24 -08001295/* should be called with rcu_read_lock */
David S. Miller22bd5b92011-03-11 19:54:08 -05001296int fib_table_lookup(struct fib_table *tb, const struct flowi4 *flp,
Eric Dumazetebc0ffa2010-10-05 10:41:36 +00001297 struct fib_result *res, int fib_flags)
Robert Olsson19baf832005-06-21 12:43:18 -07001298{
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001299 struct trie *t = (struct trie *) tb->tb_data;
Alexander Duyck8274a972014-12-31 10:55:29 -08001300#ifdef CONFIG_IP_FIB_TRIE_STATS
1301 struct trie_use_stats __percpu *stats = t->stats;
1302#endif
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001303 const t_key key = ntohl(flp->daddr);
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001304 struct key_vector *n, *pn;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001305 struct fib_alias *fa;
Alexander Duyck71e8b672015-03-04 15:04:03 -08001306 unsigned long index;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001307 t_key cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001308
David Ahernf6d3c192015-08-28 08:42:09 -07001309 trace_fib_table_lookup(tb->tb_id, flp);
1310
Alexander Duyck88bae712015-03-06 09:54:52 -08001311 pn = t->kv;
1312 cindex = 0;
1313
1314 n = get_child_rcu(pn, cindex);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001315 if (!n)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001316 return -EAGAIN;
Robert Olsson19baf832005-06-21 12:43:18 -07001317
1318#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08001319 this_cpu_inc(stats->gets);
Robert Olsson19baf832005-06-21 12:43:18 -07001320#endif
1321
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001322 /* Step 1: Travel to the longest prefix match in the trie */
1323 for (;;) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001324 index = get_cindex(key, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001325
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001326 /* This bit of code is a bit tricky but it combines multiple
1327 * checks into a single check. The prefix consists of the
1328 * prefix plus zeros for the "bits" in the prefix. The index
1329 * is the difference between the key and this value. From
1330 * this we can actually derive several pieces of data.
Alexander Duyck71e8b672015-03-04 15:04:03 -08001331 * if (index >= (1ul << bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001332 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -08001333 * else
1334 * we know the value is cindex
Alexander Duyck71e8b672015-03-04 15:04:03 -08001335 *
1336 * This check is safe even if bits == KEYLENGTH due to the
1337 * fact that we can only allocate a node with 32 bits if a
1338 * long is greater than 32 bits.
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001339 */
Alexander Duyck71e8b672015-03-04 15:04:03 -08001340 if (index >= (1ul << n->bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001341 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001342
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001343 /* we have found a leaf. Prefixes have already been compared */
1344 if (IS_LEAF(n))
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001345 goto found;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001346
1347 /* only record pn and cindex if we are going to be chopping
1348 * bits later. Otherwise we are just wasting cycles.
1349 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001350 if (n->slen > n->pos) {
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001351 pn = n;
1352 cindex = index;
Olof Johansson91b9a272005-08-09 20:24:39 -07001353 }
1354
Alexander Duyck754baf82015-03-06 09:54:14 -08001355 n = get_child_rcu(n, index);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001356 if (unlikely(!n))
Robert Olsson19baf832005-06-21 12:43:18 -07001357 goto backtrace;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001358 }
1359
1360 /* Step 2: Sort out leaves and begin backtracing for longest prefix */
1361 for (;;) {
1362 /* record the pointer where our next node pointer is stored */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001363 struct key_vector __rcu **cptr = n->tnode;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001364
1365 /* This test verifies that none of the bits that differ
1366 * between the key and the prefix exist in the region of
1367 * the lsb and higher in the prefix.
1368 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001369 if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001370 goto backtrace;
1371
1372 /* exit out and process leaf */
1373 if (unlikely(IS_LEAF(n)))
1374 break;
1375
1376 /* Don't bother recording parent info. Since we are in
1377 * prefix match mode we will have to come back to wherever
1378 * we started this traversal anyway
1379 */
1380
1381 while ((n = rcu_dereference(*cptr)) == NULL) {
1382backtrace:
1383#ifdef CONFIG_IP_FIB_TRIE_STATS
1384 if (!n)
1385 this_cpu_inc(stats->null_node_hit);
1386#endif
1387 /* If we are at cindex 0 there are no more bits for
1388 * us to strip at this level so we must ascend back
1389 * up one level to see if there are any more bits to
1390 * be stripped there.
1391 */
1392 while (!cindex) {
1393 t_key pkey = pn->key;
1394
Alexander Duyck88bae712015-03-06 09:54:52 -08001395 /* If we don't have a parent then there is
1396 * nothing for us to do as we do not have any
1397 * further nodes to parse.
1398 */
1399 if (IS_TRIE(pn))
Alexander Duyck345e9b52014-12-31 10:56:24 -08001400 return -EAGAIN;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001401#ifdef CONFIG_IP_FIB_TRIE_STATS
1402 this_cpu_inc(stats->backtrack);
1403#endif
1404 /* Get Child's index */
Alexander Duyck88bae712015-03-06 09:54:52 -08001405 pn = node_parent_rcu(pn);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001406 cindex = get_index(pkey, pn);
1407 }
1408
1409 /* strip the least significant bit from the cindex */
1410 cindex &= cindex - 1;
1411
1412 /* grab pointer for next child node */
Alexander Duyck41b489f2015-03-04 15:02:33 -08001413 cptr = &pn->tnode[cindex];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001414 }
Robert Olsson19baf832005-06-21 12:43:18 -07001415 }
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001416
Robert Olsson19baf832005-06-21 12:43:18 -07001417found:
Alexander Duyck71e8b672015-03-04 15:04:03 -08001418 /* this line carries forward the xor from earlier in the function */
1419 index = key ^ n->key;
1420
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001421 /* Step 3: Process the leaf, if that fails fall back to backtracing */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001422 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
1423 struct fib_info *fi = fa->fa_info;
1424 int nhsel, err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001425
Alexander Duycka5829f52016-01-28 13:42:24 -08001426 if ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen < KEYLENGTH)) {
1427 if (index >= (1ul << fa->fa_slen))
1428 continue;
1429 }
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001430 if (fa->fa_tos && fa->fa_tos != flp->flowi4_tos)
1431 continue;
1432 if (fi->fib_dead)
1433 continue;
1434 if (fa->fa_info->fib_scope < flp->flowi4_scope)
1435 continue;
1436 fib_alias_accessed(fa);
1437 err = fib_props[fa->fa_type].error;
1438 if (unlikely(err < 0)) {
Alexander Duyck345e9b52014-12-31 10:56:24 -08001439#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001440 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001441#endif
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001442 return err;
1443 }
1444 if (fi->fib_flags & RTNH_F_DEAD)
1445 continue;
1446 for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) {
1447 const struct fib_nh *nh = &fi->fib_nh[nhsel];
Andy Gospodarek0eeb0752015-06-23 13:45:37 -04001448 struct in_device *in_dev = __in_dev_get_rcu(nh->nh_dev);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001449
1450 if (nh->nh_flags & RTNH_F_DEAD)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001451 continue;
Andy Gospodarek0eeb0752015-06-23 13:45:37 -04001452 if (in_dev &&
1453 IN_DEV_IGNORE_ROUTES_WITH_LINKDOWN(in_dev) &&
1454 nh->nh_flags & RTNH_F_LINKDOWN &&
1455 !(fib_flags & FIB_LOOKUP_IGNORE_LINKSTATE))
1456 continue;
David Ahern58189ca2015-09-15 15:10:50 -07001457 if (!(flp->flowi4_flags & FLOWI_FLAG_SKIP_NH_OIF)) {
David Ahern613d09b2015-08-13 14:59:02 -06001458 if (flp->flowi4_oif &&
1459 flp->flowi4_oif != nh->nh_oif)
1460 continue;
1461 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001462
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001463 if (!(fib_flags & FIB_LOOKUP_NOREF))
1464 atomic_inc(&fi->fib_clntref);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001465
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001466 res->prefixlen = KEYLENGTH - fa->fa_slen;
1467 res->nh_sel = nhsel;
1468 res->type = fa->fa_type;
1469 res->scope = fi->fib_scope;
1470 res->fi = fi;
1471 res->table = tb;
1472 res->fa_head = &n->leaf;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001473#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001474 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001475#endif
David Ahernf6d3c192015-08-28 08:42:09 -07001476 trace_fib_table_lookup_nh(nh);
1477
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001478 return err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001479 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001480 }
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001481#ifdef CONFIG_IP_FIB_TRIE_STATS
1482 this_cpu_inc(stats->semantic_match_miss);
1483#endif
Alexander Duyck345e9b52014-12-31 10:56:24 -08001484 goto backtrace;
Robert Olsson19baf832005-06-21 12:43:18 -07001485}
Florian Westphal6fc01432011-08-25 13:46:12 +02001486EXPORT_SYMBOL_GPL(fib_table_lookup);
Robert Olsson19baf832005-06-21 12:43:18 -07001487
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001488static void fib_remove_alias(struct trie *t, struct key_vector *tp,
1489 struct key_vector *l, struct fib_alias *old)
Alexander Duyckd5d64872015-03-04 15:02:18 -08001490{
1491 /* record the location of the previous list_info entry */
1492 struct hlist_node **pprev = old->fa_list.pprev;
1493 struct fib_alias *fa = hlist_entry(pprev, typeof(*fa), fa_list.next);
1494
1495 /* remove the fib_alias from the list */
1496 hlist_del_rcu(&old->fa_list);
1497
1498 /* if we emptied the list this leaf will be freed and we can sort
1499 * out parent suffix lengths as a part of trie_rebalance
1500 */
1501 if (hlist_empty(&l->leaf)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001502 put_child_root(tp, l->key, NULL);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001503 node_free(l);
1504 trie_rebalance(t, tp);
1505 return;
1506 }
1507
1508 /* only access fa if it is pointing at the last valid hlist_node */
1509 if (*pprev)
1510 return;
1511
1512 /* update the trie with the latest suffix length */
1513 l->slen = fa->fa_slen;
1514 leaf_pull_suffix(tp, l);
1515}
1516
1517/* Caller must hold RTNL. */
Jiri Pirkob90eb752016-09-26 12:52:29 +02001518int fib_table_delete(struct net *net, struct fib_table *tb,
1519 struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001520{
1521 struct trie *t = (struct trie *) tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001522 struct fib_alias *fa, *fa_to_delete;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001523 struct key_vector *l, *tp;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001524 u8 plen = cfg->fc_dst_len;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001525 u8 slen = KEYLENGTH - plen;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001526 u8 tos = cfg->fc_tos;
1527 u32 key;
Olof Johansson91b9a272005-08-09 20:24:39 -07001528
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001529 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001530 return -EINVAL;
1531
Thomas Graf4e902c52006-08-17 18:14:52 -07001532 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001533
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001534 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001535 return -EINVAL;
1536
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001537 l = fib_find_node(t, &tp, key);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001538 if (!l)
Robert Olsson19baf832005-06-21 12:43:18 -07001539 return -ESRCH;
1540
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001541 fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id);
Robert Olsson19baf832005-06-21 12:43:18 -07001542 if (!fa)
1543 return -ESRCH;
1544
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001545 pr_debug("Deleting %08x/%d tos=%d t=%p\n", key, plen, tos, t);
Robert Olsson19baf832005-06-21 12:43:18 -07001546
1547 fa_to_delete = NULL;
Alexander Duyck56315f92015-02-25 15:31:31 -08001548 hlist_for_each_entry_from(fa, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001549 struct fib_info *fi = fa->fa_info;
1550
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001551 if ((fa->fa_slen != slen) ||
1552 (fa->tb_id != tb->tb_id) ||
1553 (fa->fa_tos != tos))
Robert Olsson19baf832005-06-21 12:43:18 -07001554 break;
1555
Thomas Graf4e902c52006-08-17 18:14:52 -07001556 if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) &&
1557 (cfg->fc_scope == RT_SCOPE_NOWHERE ||
David S. Miller37e826c2011-03-24 18:06:47 -07001558 fa->fa_info->fib_scope == cfg->fc_scope) &&
Julian Anastasov74cb3c12011-03-19 12:13:46 +00001559 (!cfg->fc_prefsrc ||
1560 fi->fib_prefsrc == cfg->fc_prefsrc) &&
Thomas Graf4e902c52006-08-17 18:14:52 -07001561 (!cfg->fc_protocol ||
1562 fi->fib_protocol == cfg->fc_protocol) &&
1563 fib_nh_match(cfg, fi) == 0) {
Robert Olsson19baf832005-06-21 12:43:18 -07001564 fa_to_delete = fa;
1565 break;
1566 }
1567 }
1568
Olof Johansson91b9a272005-08-09 20:24:39 -07001569 if (!fa_to_delete)
1570 return -ESRCH;
Robert Olsson19baf832005-06-21 12:43:18 -07001571
Jiri Pirkob90eb752016-09-26 12:52:29 +02001572 call_fib_entry_notifiers(net, FIB_EVENT_ENTRY_DEL, key, plen,
1573 fa_to_delete->fa_info, tos, cfg->fc_type,
1574 tb->tb_id, 0);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001575 rtmsg_fib(RTM_DELROUTE, htonl(key), fa_to_delete, plen, tb->tb_id,
Milan Kocianb8f55832007-05-23 14:55:06 -07001576 &cfg->fc_nlinfo, 0);
Robert Olsson19baf832005-06-21 12:43:18 -07001577
David S. Miller21d8c492011-04-14 14:49:37 -07001578 if (!plen)
1579 tb->tb_num_default--;
1580
Alexander Duyckd5d64872015-03-04 15:02:18 -08001581 fib_remove_alias(t, tp, l, fa_to_delete);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001582
Alexander Duyckd5d64872015-03-04 15:02:18 -08001583 if (fa_to_delete->fa_state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001584 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Olof Johansson91b9a272005-08-09 20:24:39 -07001585
Alexander Duyckd5d64872015-03-04 15:02:18 -08001586 fib_release_info(fa_to_delete->fa_info);
1587 alias_free_mem_rcu(fa_to_delete);
Olof Johansson91b9a272005-08-09 20:24:39 -07001588 return 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001589}
1590
Alexander Duyck8be33e92015-03-04 14:59:19 -08001591/* Scan for the next leaf starting at the provided key value */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001592static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -07001593{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001594 struct key_vector *pn, *n = *tn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001595 unsigned long cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001596
Alexander Duyck8be33e92015-03-04 14:59:19 -08001597 /* this loop is meant to try and find the key in the trie */
Alexander Duyck88bae712015-03-06 09:54:52 -08001598 do {
1599 /* record parent and next child index */
1600 pn = n;
Alexander Duyckc2229fe2015-10-27 15:06:45 -07001601 cindex = (key > pn->key) ? get_index(key, pn) : 0;
Alexander Duyck88bae712015-03-06 09:54:52 -08001602
1603 if (cindex >> pn->bits)
1604 break;
1605
1606 /* descend into the next child */
1607 n = get_child_rcu(pn, cindex++);
1608 if (!n)
1609 break;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001610
Alexander Duyck8be33e92015-03-04 14:59:19 -08001611 /* guarantee forward progress on the keys */
1612 if (IS_LEAF(n) && (n->key >= key))
1613 goto found;
Alexander Duyck88bae712015-03-06 09:54:52 -08001614 } while (IS_TNODE(n));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001615
1616 /* this loop will search for the next leaf with a greater key */
Alexander Duyck88bae712015-03-06 09:54:52 -08001617 while (!IS_TRIE(pn)) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001618 /* if we exhausted the parent node we will need to climb */
1619 if (cindex >= (1ul << pn->bits)) {
1620 t_key pkey = pn->key;
1621
1622 pn = node_parent_rcu(pn);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001623 cindex = get_index(pkey, pn) + 1;
1624 continue;
Robert Olsson19baf832005-06-21 12:43:18 -07001625 }
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001626
Alexander Duyck8be33e92015-03-04 14:59:19 -08001627 /* grab the next available node */
Alexander Duyck754baf82015-03-06 09:54:14 -08001628 n = get_child_rcu(pn, cindex++);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001629 if (!n)
1630 continue;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001631
Alexander Duyck8be33e92015-03-04 14:59:19 -08001632 /* no need to compare keys since we bumped the index */
1633 if (IS_LEAF(n))
1634 goto found;
1635
1636 /* Rescan start scanning in new node */
1637 pn = n;
1638 cindex = 0;
1639 }
1640
1641 *tn = pn;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001642 return NULL; /* Root of trie */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001643found:
1644 /* if we are at the limit for keys just return NULL for the tnode */
Alexander Duyck88bae712015-03-06 09:54:52 -08001645 *tn = pn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001646 return n;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001647}
1648
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001649static void fib_trie_free(struct fib_table *tb)
1650{
1651 struct trie *t = (struct trie *)tb->tb_data;
1652 struct key_vector *pn = t->kv;
1653 unsigned long cindex = 1;
1654 struct hlist_node *tmp;
1655 struct fib_alias *fa;
1656
1657 /* walk trie in reverse order and free everything */
1658 for (;;) {
1659 struct key_vector *n;
1660
1661 if (!(cindex--)) {
1662 t_key pkey = pn->key;
1663
1664 if (IS_TRIE(pn))
1665 break;
1666
1667 n = pn;
1668 pn = node_parent(pn);
1669
1670 /* drop emptied tnode */
1671 put_child_root(pn, n->key, NULL);
1672 node_free(n);
1673
1674 cindex = get_index(pkey, pn);
1675
1676 continue;
1677 }
1678
1679 /* grab the next available node */
1680 n = get_child(pn, cindex);
1681 if (!n)
1682 continue;
1683
1684 if (IS_TNODE(n)) {
1685 /* record pn and cindex for leaf walking */
1686 pn = n;
1687 cindex = 1ul << n->bits;
1688
1689 continue;
1690 }
1691
1692 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1693 hlist_del_rcu(&fa->fa_list);
1694 alias_free_mem_rcu(fa);
1695 }
1696
1697 put_child_root(pn, n->key, NULL);
1698 node_free(n);
1699 }
1700
1701#ifdef CONFIG_IP_FIB_TRIE_STATS
1702 free_percpu(t->stats);
1703#endif
1704 kfree(tb);
1705}
1706
1707struct fib_table *fib_trie_unmerge(struct fib_table *oldtb)
1708{
1709 struct trie *ot = (struct trie *)oldtb->tb_data;
1710 struct key_vector *l, *tp = ot->kv;
1711 struct fib_table *local_tb;
1712 struct fib_alias *fa;
1713 struct trie *lt;
1714 t_key key = 0;
1715
1716 if (oldtb->tb_data == oldtb->__data)
1717 return oldtb;
1718
1719 local_tb = fib_trie_table(RT_TABLE_LOCAL, NULL);
1720 if (!local_tb)
1721 return NULL;
1722
1723 lt = (struct trie *)local_tb->tb_data;
1724
1725 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
1726 struct key_vector *local_l = NULL, *local_tp;
1727
1728 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
1729 struct fib_alias *new_fa;
1730
1731 if (local_tb->tb_id != fa->tb_id)
1732 continue;
1733
1734 /* clone fa for new local table */
1735 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
1736 if (!new_fa)
1737 goto out;
1738
1739 memcpy(new_fa, fa, sizeof(*fa));
1740
1741 /* insert clone into table */
1742 if (!local_l)
1743 local_l = fib_find_node(lt, &local_tp, l->key);
1744
1745 if (fib_insert_alias(lt, local_tp, local_l, new_fa,
Alexander Duyck3114cdf2016-11-15 05:46:12 -05001746 NULL, l->key)) {
1747 kmem_cache_free(fn_alias_kmem, new_fa);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001748 goto out;
Alexander Duyck3114cdf2016-11-15 05:46:12 -05001749 }
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001750 }
1751
1752 /* stop loop if key wrapped back to 0 */
1753 key = l->key + 1;
1754 if (key < l->key)
1755 break;
1756 }
1757
1758 return local_tb;
1759out:
1760 fib_trie_free(local_tb);
1761
1762 return NULL;
1763}
1764
Alexander Duyck3b709332016-11-15 05:46:06 -05001765/* Caller must hold RTNL */
1766void fib_table_flush_external(struct fib_table *tb)
1767{
1768 struct trie *t = (struct trie *)tb->tb_data;
1769 struct key_vector *pn = t->kv;
1770 unsigned long cindex = 1;
1771 struct hlist_node *tmp;
1772 struct fib_alias *fa;
1773
1774 /* walk trie in reverse order */
1775 for (;;) {
1776 unsigned char slen = 0;
1777 struct key_vector *n;
1778
1779 if (!(cindex--)) {
1780 t_key pkey = pn->key;
1781
1782 /* cannot resize the trie vector */
1783 if (IS_TRIE(pn))
1784 break;
1785
1786 /* resize completed node */
1787 pn = resize(t, pn);
1788 cindex = get_index(pkey, pn);
1789
1790 continue;
1791 }
1792
1793 /* grab the next available node */
1794 n = get_child(pn, cindex);
1795 if (!n)
1796 continue;
1797
1798 if (IS_TNODE(n)) {
1799 /* record pn and cindex for leaf walking */
1800 pn = n;
1801 cindex = 1ul << n->bits;
1802
1803 continue;
1804 }
1805
1806 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1807 /* if alias was cloned to local then we just
1808 * need to remove the local copy from main
1809 */
1810 if (tb->tb_id != fa->tb_id) {
1811 hlist_del_rcu(&fa->fa_list);
1812 alias_free_mem_rcu(fa);
1813 continue;
1814 }
1815
1816 /* record local slen */
1817 slen = fa->fa_slen;
1818 }
1819
1820 /* update leaf slen */
1821 n->slen = slen;
1822
1823 if (hlist_empty(&n->leaf)) {
1824 put_child_root(pn, n->key, NULL);
1825 node_free(n);
1826 }
1827 }
1828}
1829
Alexander Duyck8be33e92015-03-04 14:59:19 -08001830/* Caller must hold RTNL. */
Jiri Pirkob90eb752016-09-26 12:52:29 +02001831int fib_table_flush(struct net *net, struct fib_table *tb)
Robert Olsson19baf832005-06-21 12:43:18 -07001832{
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001833 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001834 struct key_vector *pn = t->kv;
1835 unsigned long cindex = 1;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001836 struct hlist_node *tmp;
1837 struct fib_alias *fa;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001838 int found = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001839
Alexander Duyck88bae712015-03-06 09:54:52 -08001840 /* walk trie in reverse order */
1841 for (;;) {
1842 unsigned char slen = 0;
1843 struct key_vector *n;
Robert Olsson19baf832005-06-21 12:43:18 -07001844
Alexander Duyck88bae712015-03-06 09:54:52 -08001845 if (!(cindex--)) {
1846 t_key pkey = pn->key;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001847
Alexander Duyck88bae712015-03-06 09:54:52 -08001848 /* cannot resize the trie vector */
1849 if (IS_TRIE(pn))
1850 break;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001851
Alexander Duyck88bae712015-03-06 09:54:52 -08001852 /* resize completed node */
1853 pn = resize(t, pn);
1854 cindex = get_index(pkey, pn);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001855
Alexander Duyck88bae712015-03-06 09:54:52 -08001856 continue;
1857 }
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001858
Alexander Duyck88bae712015-03-06 09:54:52 -08001859 /* grab the next available node */
1860 n = get_child(pn, cindex);
1861 if (!n)
1862 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001863
Alexander Duyck88bae712015-03-06 09:54:52 -08001864 if (IS_TNODE(n)) {
1865 /* record pn and cindex for leaf walking */
1866 pn = n;
1867 cindex = 1ul << n->bits;
1868
1869 continue;
1870 }
1871
1872 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1873 struct fib_info *fi = fa->fa_info;
1874
1875 if (!fi || !(fi->fib_flags & RTNH_F_DEAD)) {
1876 slen = fa->fa_slen;
1877 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001878 }
1879
Jiri Pirkob90eb752016-09-26 12:52:29 +02001880 call_fib_entry_notifiers(net, FIB_EVENT_ENTRY_DEL,
1881 n->key,
1882 KEYLENGTH - fa->fa_slen,
1883 fi, fa->fa_tos, fa->fa_type,
1884 tb->tb_id, 0);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001885 hlist_del_rcu(&fa->fa_list);
1886 fib_release_info(fa->fa_info);
1887 alias_free_mem_rcu(fa);
1888 found++;
Alexander Duyck64c62722015-01-22 15:51:45 -08001889 }
1890
Alexander Duyck88bae712015-03-06 09:54:52 -08001891 /* update leaf slen */
1892 n->slen = slen;
1893
1894 if (hlist_empty(&n->leaf)) {
1895 put_child_root(pn, n->key, NULL);
1896 node_free(n);
Alexander Duyck88bae712015-03-06 09:54:52 -08001897 }
Robert Olsson19baf832005-06-21 12:43:18 -07001898 }
1899
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001900 pr_debug("trie_flush found=%d\n", found);
Robert Olsson19baf832005-06-21 12:43:18 -07001901 return found;
1902}
1903
Alexander Duycka7e53532015-03-04 15:02:44 -08001904static void __trie_free_rcu(struct rcu_head *head)
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001905{
Alexander Duycka7e53532015-03-04 15:02:44 -08001906 struct fib_table *tb = container_of(head, struct fib_table, rcu);
Alexander Duyck8274a972014-12-31 10:55:29 -08001907#ifdef CONFIG_IP_FIB_TRIE_STATS
1908 struct trie *t = (struct trie *)tb->tb_data;
1909
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001910 if (tb->tb_data == tb->__data)
1911 free_percpu(t->stats);
Alexander Duyck8274a972014-12-31 10:55:29 -08001912#endif /* CONFIG_IP_FIB_TRIE_STATS */
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001913 kfree(tb);
1914}
1915
Alexander Duycka7e53532015-03-04 15:02:44 -08001916void fib_free_table(struct fib_table *tb)
1917{
1918 call_rcu(&tb->rcu, __trie_free_rcu);
1919}
1920
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001921static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001922 struct sk_buff *skb, struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001923{
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001924 __be32 xkey = htonl(l->key);
Robert Olsson19baf832005-06-21 12:43:18 -07001925 struct fib_alias *fa;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001926 int i, s_i;
Robert Olsson19baf832005-06-21 12:43:18 -07001927
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001928 s_i = cb->args[4];
Robert Olsson19baf832005-06-21 12:43:18 -07001929 i = 0;
1930
Robert Olsson2373ce12005-08-25 13:01:29 -07001931 /* rcu_read_lock is hold by caller */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001932 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001933 if (i < s_i) {
1934 i++;
1935 continue;
1936 }
Robert Olsson19baf832005-06-21 12:43:18 -07001937
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001938 if (tb->tb_id != fa->tb_id) {
1939 i++;
1940 continue;
1941 }
1942
Eric W. Biederman15e47302012-09-07 20:12:54 +00001943 if (fib_dump_info(skb, NETLINK_CB(cb->skb).portid,
Robert Olsson19baf832005-06-21 12:43:18 -07001944 cb->nlh->nlmsg_seq,
1945 RTM_NEWROUTE,
1946 tb->tb_id,
1947 fa->fa_type,
Thomas Grafbe403ea2006-08-17 18:15:17 -07001948 xkey,
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001949 KEYLENGTH - fa->fa_slen,
Robert Olsson19baf832005-06-21 12:43:18 -07001950 fa->fa_tos,
Stephen Hemminger64347f72008-01-22 21:55:01 -08001951 fa->fa_info, NLM_F_MULTI) < 0) {
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001952 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001953 return -1;
1954 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001955 i++;
Robert Olsson19baf832005-06-21 12:43:18 -07001956 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001957
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001958 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001959 return skb->len;
1960}
1961
Alexander Duycka7e53532015-03-04 15:02:44 -08001962/* rcu_read_lock needs to be hold by caller from readside */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001963int fib_table_dump(struct fib_table *tb, struct sk_buff *skb,
1964 struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001965{
Alexander Duyck8be33e92015-03-04 14:59:19 -08001966 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001967 struct key_vector *l, *tp = t->kv;
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001968 /* Dump starting at last key.
1969 * Note: 0.0.0.0/0 (ie default) is first key.
1970 */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001971 int count = cb->args[2];
1972 t_key key = cb->args[3];
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001973
Alexander Duyck8be33e92015-03-04 14:59:19 -08001974 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001975 if (fn_trie_dump_leaf(l, tb, skb, cb) < 0) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001976 cb->args[3] = key;
1977 cb->args[2] = count;
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001978 return -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001979 }
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001980
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001981 ++count;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001982 key = l->key + 1;
1983
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001984 memset(&cb->args[4], 0,
1985 sizeof(cb->args) - 4*sizeof(cb->args[0]));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001986
1987 /* stop loop if key wrapped back to 0 */
1988 if (key < l->key)
1989 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001990 }
Alexander Duyck8be33e92015-03-04 14:59:19 -08001991
Alexander Duyck8be33e92015-03-04 14:59:19 -08001992 cb->args[3] = key;
1993 cb->args[2] = count;
1994
Robert Olsson19baf832005-06-21 12:43:18 -07001995 return skb->len;
Robert Olsson19baf832005-06-21 12:43:18 -07001996}
1997
David S. Miller5348ba82011-02-01 15:30:56 -08001998void __init fib_trie_init(void)
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001999{
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002000 fn_alias_kmem = kmem_cache_create("ip_fib_alias",
2001 sizeof(struct fib_alias),
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08002002 0, SLAB_PANIC, NULL);
2003
2004 trie_leaf_kmem = kmem_cache_create("ip_fib_trie",
Alexander Duyck41b489f2015-03-04 15:02:33 -08002005 LEAF_SIZE,
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08002006 0, SLAB_PANIC, NULL);
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08002007}
Robert Olsson19baf832005-06-21 12:43:18 -07002008
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002009struct fib_table *fib_trie_table(u32 id, struct fib_table *alias)
Robert Olsson19baf832005-06-21 12:43:18 -07002010{
2011 struct fib_table *tb;
2012 struct trie *t;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002013 size_t sz = sizeof(*tb);
Robert Olsson19baf832005-06-21 12:43:18 -07002014
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002015 if (!alias)
2016 sz += sizeof(struct trie);
2017
2018 tb = kzalloc(sz, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01002019 if (!tb)
Robert Olsson19baf832005-06-21 12:43:18 -07002020 return NULL;
2021
2022 tb->tb_id = id;
David S. Miller21d8c492011-04-14 14:49:37 -07002023 tb->tb_num_default = 0;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002024 tb->tb_data = (alias ? alias->__data : tb->__data);
2025
2026 if (alias)
2027 return tb;
Robert Olsson19baf832005-06-21 12:43:18 -07002028
2029 t = (struct trie *) tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002030 t->kv[0].pos = KEYLENGTH;
2031 t->kv[0].slen = KEYLENGTH;
Alexander Duyck8274a972014-12-31 10:55:29 -08002032#ifdef CONFIG_IP_FIB_TRIE_STATS
2033 t->stats = alloc_percpu(struct trie_use_stats);
2034 if (!t->stats) {
2035 kfree(tb);
2036 tb = NULL;
2037 }
2038#endif
Robert Olsson19baf832005-06-21 12:43:18 -07002039
Robert Olsson19baf832005-06-21 12:43:18 -07002040 return tb;
2041}
2042
Robert Olsson19baf832005-06-21 12:43:18 -07002043#ifdef CONFIG_PROC_FS
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002044/* Depth first Trie walk iterator */
2045struct fib_trie_iter {
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002046 struct seq_net_private p;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002047 struct fib_table *tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002048 struct key_vector *tnode;
Eric Dumazeta034ee32010-09-09 23:32:28 +00002049 unsigned int index;
2050 unsigned int depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002051};
Robert Olsson19baf832005-06-21 12:43:18 -07002052
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002053static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)
Robert Olsson19baf832005-06-21 12:43:18 -07002054{
Alexander Duyck98293e82014-12-31 10:56:18 -08002055 unsigned long cindex = iter->index;
Alexander Duyck88bae712015-03-06 09:54:52 -08002056 struct key_vector *pn = iter->tnode;
2057 t_key pkey;
Eric W. Biederman6640e692007-01-24 14:42:04 -08002058
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002059 pr_debug("get_next iter={node=%p index=%d depth=%d}\n",
2060 iter->tnode, iter->index, iter->depth);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002061
Alexander Duyck88bae712015-03-06 09:54:52 -08002062 while (!IS_TRIE(pn)) {
2063 while (cindex < child_length(pn)) {
2064 struct key_vector *n = get_child_rcu(pn, cindex++);
2065
2066 if (!n)
2067 continue;
2068
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002069 if (IS_LEAF(n)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08002070 iter->tnode = pn;
2071 iter->index = cindex;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002072 } else {
2073 /* push down one level */
Alexander Duyckadaf9812014-12-31 10:55:47 -08002074 iter->tnode = n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002075 iter->index = 0;
2076 ++iter->depth;
2077 }
Alexander Duyck88bae712015-03-06 09:54:52 -08002078
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002079 return n;
2080 }
2081
Alexander Duyck88bae712015-03-06 09:54:52 -08002082 /* Current node exhausted, pop back up */
2083 pkey = pn->key;
2084 pn = node_parent_rcu(pn);
2085 cindex = get_index(pkey, pn) + 1;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002086 --iter->depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002087 }
2088
Alexander Duyck88bae712015-03-06 09:54:52 -08002089 /* record root node so further searches know we are done */
2090 iter->tnode = pn;
2091 iter->index = 0;
2092
Robert Olsson19baf832005-06-21 12:43:18 -07002093 return NULL;
2094}
2095
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002096static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,
2097 struct trie *t)
Robert Olsson19baf832005-06-21 12:43:18 -07002098{
Firo Yangf38b24c2015-06-08 11:54:51 +08002099 struct key_vector *n, *pn;
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002100
Stephen Hemminger132adf52007-03-08 20:44:43 -08002101 if (!t)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002102 return NULL;
2103
Firo Yangf38b24c2015-06-08 11:54:51 +08002104 pn = t->kv;
Alexander Duyck88bae712015-03-06 09:54:52 -08002105 n = rcu_dereference(pn->tnode[0]);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002106 if (!n)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002107 return NULL;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002108
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002109 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002110 iter->tnode = n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002111 iter->index = 0;
2112 iter->depth = 1;
2113 } else {
Alexander Duyck88bae712015-03-06 09:54:52 -08002114 iter->tnode = pn;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002115 iter->index = 0;
2116 iter->depth = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002117 }
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002118
2119 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002120}
2121
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002122static void trie_collect_stats(struct trie *t, struct trie_stat *s)
Robert Olsson19baf832005-06-21 12:43:18 -07002123{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002124 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002125 struct fib_trie_iter iter;
Robert Olsson19baf832005-06-21 12:43:18 -07002126
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002127 memset(s, 0, sizeof(*s));
Robert Olsson19baf832005-06-21 12:43:18 -07002128
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002129 rcu_read_lock();
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002130 for (n = fib_trie_get_first(&iter, t); n; n = fib_trie_get_next(&iter)) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002131 if (IS_LEAF(n)) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002132 struct fib_alias *fa;
Stephen Hemminger93672292008-01-22 21:54:05 -08002133
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002134 s->leaves++;
2135 s->totdepth += iter.depth;
2136 if (iter.depth > s->maxdepth)
2137 s->maxdepth = iter.depth;
Stephen Hemminger93672292008-01-22 21:54:05 -08002138
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002139 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list)
Stephen Hemminger93672292008-01-22 21:54:05 -08002140 ++s->prefixes;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002141 } else {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002142 s->tnodes++;
Alexander Duyckadaf9812014-12-31 10:55:47 -08002143 if (n->bits < MAX_STAT_DEPTH)
2144 s->nodesizes[n->bits]++;
Alexander Duyck6e22d172015-03-06 09:54:39 -08002145 s->nullpointers += tn_info(n)->empty_children;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002146 }
2147 }
2148 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002149}
2150
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002151/*
Robert Olsson19baf832005-06-21 12:43:18 -07002152 * This outputs /proc/net/fib_triestats
Robert Olsson19baf832005-06-21 12:43:18 -07002153 */
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002154static void trie_show_stats(struct seq_file *seq, struct trie_stat *stat)
Robert Olsson19baf832005-06-21 12:43:18 -07002155{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002156 unsigned int i, max, pointers, bytes, avdepth;
Robert Olsson19baf832005-06-21 12:43:18 -07002157
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002158 if (stat->leaves)
2159 avdepth = stat->totdepth*100 / stat->leaves;
2160 else
2161 avdepth = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07002162
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002163 seq_printf(seq, "\tAver depth: %u.%02d\n",
2164 avdepth / 100, avdepth % 100);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002165 seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth);
Robert Olsson19baf832005-06-21 12:43:18 -07002166
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002167 seq_printf(seq, "\tLeaves: %u\n", stat->leaves);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002168 bytes = LEAF_SIZE * stat->leaves;
Stephen Hemminger93672292008-01-22 21:54:05 -08002169
2170 seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002171 bytes += sizeof(struct fib_alias) * stat->prefixes;
Stephen Hemminger93672292008-01-22 21:54:05 -08002172
Stephen Hemminger187b5182008-01-12 20:55:55 -08002173 seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002174 bytes += TNODE_SIZE(0) * stat->tnodes;
Robert Olsson19baf832005-06-21 12:43:18 -07002175
Robert Olsson06ef9212006-03-20 21:35:01 -08002176 max = MAX_STAT_DEPTH;
2177 while (max > 0 && stat->nodesizes[max-1] == 0)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002178 max--;
Robert Olsson19baf832005-06-21 12:43:18 -07002179
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002180 pointers = 0;
Jerry Snitselaarf585a992013-07-22 12:01:58 -07002181 for (i = 1; i < max; i++)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002182 if (stat->nodesizes[i] != 0) {
Stephen Hemminger187b5182008-01-12 20:55:55 -08002183 seq_printf(seq, " %u: %u", i, stat->nodesizes[i]);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002184 pointers += (1<<i) * stat->nodesizes[i];
2185 }
2186 seq_putc(seq, '\n');
Stephen Hemminger187b5182008-01-12 20:55:55 -08002187 seq_printf(seq, "\tPointers: %u\n", pointers);
Robert Olsson19baf832005-06-21 12:43:18 -07002188
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002189 bytes += sizeof(struct key_vector *) * pointers;
Stephen Hemminger187b5182008-01-12 20:55:55 -08002190 seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers);
2191 seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024);
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002192}
Robert Olsson19baf832005-06-21 12:43:18 -07002193
2194#ifdef CONFIG_IP_FIB_TRIE_STATS
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002195static void trie_show_usage(struct seq_file *seq,
Alexander Duyck8274a972014-12-31 10:55:29 -08002196 const struct trie_use_stats __percpu *stats)
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002197{
Alexander Duyck8274a972014-12-31 10:55:29 -08002198 struct trie_use_stats s = { 0 };
2199 int cpu;
2200
2201 /* loop through all of the CPUs and gather up the stats */
2202 for_each_possible_cpu(cpu) {
2203 const struct trie_use_stats *pcpu = per_cpu_ptr(stats, cpu);
2204
2205 s.gets += pcpu->gets;
2206 s.backtrack += pcpu->backtrack;
2207 s.semantic_match_passed += pcpu->semantic_match_passed;
2208 s.semantic_match_miss += pcpu->semantic_match_miss;
2209 s.null_node_hit += pcpu->null_node_hit;
2210 s.resize_node_skipped += pcpu->resize_node_skipped;
2211 }
2212
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002213 seq_printf(seq, "\nCounters:\n---------\n");
Alexander Duyck8274a972014-12-31 10:55:29 -08002214 seq_printf(seq, "gets = %u\n", s.gets);
2215 seq_printf(seq, "backtracks = %u\n", s.backtrack);
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002216 seq_printf(seq, "semantic match passed = %u\n",
Alexander Duyck8274a972014-12-31 10:55:29 -08002217 s.semantic_match_passed);
2218 seq_printf(seq, "semantic match miss = %u\n", s.semantic_match_miss);
2219 seq_printf(seq, "null node hit= %u\n", s.null_node_hit);
2220 seq_printf(seq, "skipped node resize = %u\n\n", s.resize_node_skipped);
Robert Olsson19baf832005-06-21 12:43:18 -07002221}
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002222#endif /* CONFIG_IP_FIB_TRIE_STATS */
2223
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002224static void fib_table_print(struct seq_file *seq, struct fib_table *tb)
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002225{
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002226 if (tb->tb_id == RT_TABLE_LOCAL)
2227 seq_puts(seq, "Local:\n");
2228 else if (tb->tb_id == RT_TABLE_MAIN)
2229 seq_puts(seq, "Main:\n");
2230 else
2231 seq_printf(seq, "Id %d:\n", tb->tb_id);
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002232}
Robert Olsson19baf832005-06-21 12:43:18 -07002233
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002234
Robert Olsson19baf832005-06-21 12:43:18 -07002235static int fib_triestat_seq_show(struct seq_file *seq, void *v)
2236{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002237 struct net *net = (struct net *)seq->private;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002238 unsigned int h;
Eric W. Biederman877a9bf2007-12-07 00:47:47 -08002239
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002240 seq_printf(seq,
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002241 "Basic info: size of leaf:"
2242 " %Zd bytes, size of tnode: %Zd bytes.\n",
Alexander Duyck41b489f2015-03-04 15:02:33 -08002243 LEAF_SIZE, TNODE_SIZE(0));
Olof Johansson91b9a272005-08-09 20:24:39 -07002244
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002245 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2246 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002247 struct fib_table *tb;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002248
Sasha Levinb67bfe02013-02-27 17:06:00 -08002249 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002250 struct trie *t = (struct trie *) tb->tb_data;
2251 struct trie_stat stat;
2252
2253 if (!t)
2254 continue;
2255
2256 fib_table_print(seq, tb);
2257
2258 trie_collect_stats(t, &stat);
2259 trie_show_stats(seq, &stat);
2260#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08002261 trie_show_usage(seq, t->stats);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002262#endif
2263 }
2264 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002265
Robert Olsson19baf832005-06-21 12:43:18 -07002266 return 0;
2267}
2268
Robert Olsson19baf832005-06-21 12:43:18 -07002269static int fib_triestat_seq_open(struct inode *inode, struct file *file)
2270{
Pavel Emelyanovde05c552008-07-18 04:07:21 -07002271 return single_open_net(inode, file, fib_triestat_seq_show);
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002272}
2273
Arjan van de Ven9a321442007-02-12 00:55:35 -08002274static const struct file_operations fib_triestat_fops = {
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002275 .owner = THIS_MODULE,
2276 .open = fib_triestat_seq_open,
2277 .read = seq_read,
2278 .llseek = seq_lseek,
Pavel Emelyanovb6fcbdb2008-07-18 04:07:44 -07002279 .release = single_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002280};
2281
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002282static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)
Robert Olsson19baf832005-06-21 12:43:18 -07002283{
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002284 struct fib_trie_iter *iter = seq->private;
2285 struct net *net = seq_file_net(seq);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002286 loff_t idx = 0;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002287 unsigned int h;
Robert Olsson19baf832005-06-21 12:43:18 -07002288
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002289 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2290 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002291 struct fib_table *tb;
2292
Sasha Levinb67bfe02013-02-27 17:06:00 -08002293 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002294 struct key_vector *n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002295
2296 for (n = fib_trie_get_first(iter,
2297 (struct trie *) tb->tb_data);
2298 n; n = fib_trie_get_next(iter))
2299 if (pos == idx++) {
2300 iter->tb = tb;
2301 return n;
2302 }
2303 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002304 }
Robert Olsson19baf832005-06-21 12:43:18 -07002305
Robert Olsson19baf832005-06-21 12:43:18 -07002306 return NULL;
2307}
2308
2309static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002310 __acquires(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002311{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002312 rcu_read_lock();
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002313 return fib_trie_get_idx(seq, *pos);
Robert Olsson19baf832005-06-21 12:43:18 -07002314}
2315
2316static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2317{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002318 struct fib_trie_iter *iter = seq->private;
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002319 struct net *net = seq_file_net(seq);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002320 struct fib_table *tb = iter->tb;
2321 struct hlist_node *tb_node;
2322 unsigned int h;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002323 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002324
Robert Olsson19baf832005-06-21 12:43:18 -07002325 ++*pos;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002326 /* next node in same table */
2327 n = fib_trie_get_next(iter);
2328 if (n)
2329 return n;
Olof Johansson91b9a272005-08-09 20:24:39 -07002330
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002331 /* walk rest of this hash chain */
2332 h = tb->tb_id & (FIB_TABLE_HASHSZ - 1);
Eric Dumazet0a5c0472011-03-31 01:51:35 -07002333 while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002334 tb = hlist_entry(tb_node, struct fib_table, tb_hlist);
2335 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2336 if (n)
2337 goto found;
2338 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002339
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002340 /* new hash chain */
2341 while (++h < FIB_TABLE_HASHSZ) {
2342 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Sasha Levinb67bfe02013-02-27 17:06:00 -08002343 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002344 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2345 if (n)
2346 goto found;
2347 }
2348 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002349 return NULL;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002350
2351found:
2352 iter->tb = tb;
2353 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002354}
2355
2356static void fib_trie_seq_stop(struct seq_file *seq, void *v)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002357 __releases(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002358{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002359 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002360}
2361
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002362static void seq_indent(struct seq_file *seq, int n)
2363{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002364 while (n-- > 0)
2365 seq_puts(seq, " ");
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002366}
Robert Olsson19baf832005-06-21 12:43:18 -07002367
Eric Dumazet28d36e32008-01-14 23:09:56 -08002368static inline const char *rtn_scope(char *buf, size_t len, enum rt_scope_t s)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002369{
Stephen Hemminger132adf52007-03-08 20:44:43 -08002370 switch (s) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002371 case RT_SCOPE_UNIVERSE: return "universe";
2372 case RT_SCOPE_SITE: return "site";
2373 case RT_SCOPE_LINK: return "link";
2374 case RT_SCOPE_HOST: return "host";
2375 case RT_SCOPE_NOWHERE: return "nowhere";
2376 default:
Eric Dumazet28d36e32008-01-14 23:09:56 -08002377 snprintf(buf, len, "scope=%d", s);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002378 return buf;
2379 }
2380}
2381
Jan Engelhardt36cbd3d2009-08-05 10:42:58 -07002382static const char *const rtn_type_names[__RTN_MAX] = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002383 [RTN_UNSPEC] = "UNSPEC",
2384 [RTN_UNICAST] = "UNICAST",
2385 [RTN_LOCAL] = "LOCAL",
2386 [RTN_BROADCAST] = "BROADCAST",
2387 [RTN_ANYCAST] = "ANYCAST",
2388 [RTN_MULTICAST] = "MULTICAST",
2389 [RTN_BLACKHOLE] = "BLACKHOLE",
2390 [RTN_UNREACHABLE] = "UNREACHABLE",
2391 [RTN_PROHIBIT] = "PROHIBIT",
2392 [RTN_THROW] = "THROW",
2393 [RTN_NAT] = "NAT",
2394 [RTN_XRESOLVE] = "XRESOLVE",
2395};
2396
Eric Dumazeta034ee32010-09-09 23:32:28 +00002397static inline const char *rtn_type(char *buf, size_t len, unsigned int t)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002398{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002399 if (t < __RTN_MAX && rtn_type_names[t])
2400 return rtn_type_names[t];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002401 snprintf(buf, len, "type %u", t);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002402 return buf;
2403}
2404
2405/* Pretty print the trie */
Robert Olsson19baf832005-06-21 12:43:18 -07002406static int fib_trie_seq_show(struct seq_file *seq, void *v)
2407{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002408 const struct fib_trie_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002409 struct key_vector *n = v;
Robert Olsson19baf832005-06-21 12:43:18 -07002410
Alexander Duyck88bae712015-03-06 09:54:52 -08002411 if (IS_TRIE(node_parent_rcu(n)))
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002412 fib_table_print(seq, iter->tb);
Robert Olsson095b8502007-01-26 19:06:01 -08002413
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002414 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002415 __be32 prf = htonl(n->key);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002416
Alexander Duycke9b44012014-12-31 10:56:12 -08002417 seq_indent(seq, iter->depth-1);
2418 seq_printf(seq, " +-- %pI4/%zu %u %u %u\n",
2419 &prf, KEYLENGTH - n->pos - n->bits, n->bits,
Alexander Duyck6e22d172015-03-06 09:54:39 -08002420 tn_info(n)->full_children,
2421 tn_info(n)->empty_children);
Olof Johansson91b9a272005-08-09 20:24:39 -07002422 } else {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002423 __be32 val = htonl(n->key);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002424 struct fib_alias *fa;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002425
2426 seq_indent(seq, iter->depth);
Harvey Harrison673d57e2008-10-31 00:53:57 -07002427 seq_printf(seq, " |-- %pI4\n", &val);
Eric Dumazet28d36e32008-01-14 23:09:56 -08002428
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002429 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
2430 char buf1[32], buf2[32];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002431
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002432 seq_indent(seq, iter->depth + 1);
2433 seq_printf(seq, " /%zu %s %s",
2434 KEYLENGTH - fa->fa_slen,
2435 rtn_scope(buf1, sizeof(buf1),
2436 fa->fa_info->fib_scope),
2437 rtn_type(buf2, sizeof(buf2),
2438 fa->fa_type));
2439 if (fa->fa_tos)
2440 seq_printf(seq, " tos=%d", fa->fa_tos);
2441 seq_putc(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002442 }
Robert Olsson19baf832005-06-21 12:43:18 -07002443 }
2444
2445 return 0;
2446}
2447
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002448static const struct seq_operations fib_trie_seq_ops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002449 .start = fib_trie_seq_start,
2450 .next = fib_trie_seq_next,
2451 .stop = fib_trie_seq_stop,
2452 .show = fib_trie_seq_show,
Robert Olsson19baf832005-06-21 12:43:18 -07002453};
2454
2455static int fib_trie_seq_open(struct inode *inode, struct file *file)
2456{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002457 return seq_open_net(inode, file, &fib_trie_seq_ops,
2458 sizeof(struct fib_trie_iter));
Robert Olsson19baf832005-06-21 12:43:18 -07002459}
2460
Arjan van de Ven9a321442007-02-12 00:55:35 -08002461static const struct file_operations fib_trie_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002462 .owner = THIS_MODULE,
2463 .open = fib_trie_seq_open,
2464 .read = seq_read,
2465 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002466 .release = seq_release_net,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002467};
2468
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002469struct fib_route_iter {
2470 struct seq_net_private p;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002471 struct fib_table *main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002472 struct key_vector *tnode;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002473 loff_t pos;
2474 t_key key;
2475};
2476
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002477static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,
2478 loff_t pos)
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002479{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002480 struct key_vector *l, **tp = &iter->tnode;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002481 t_key key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002482
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002483 /* use cached location of previously found key */
Alexander Duyck8be33e92015-03-04 14:59:19 -08002484 if (iter->pos > 0 && pos >= iter->pos) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08002485 key = iter->key;
2486 } else {
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002487 iter->pos = 1;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002488 key = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002489 }
2490
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002491 pos -= iter->pos;
2492
2493 while ((l = leaf_walk_rcu(tp, key)) && (pos-- > 0)) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08002494 key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002495 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002496 l = NULL;
2497
2498 /* handle unlikely case of a key wrap */
2499 if (!key)
2500 break;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002501 }
2502
2503 if (l)
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002504 iter->key = l->key; /* remember it */
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002505 else
2506 iter->pos = 0; /* forget it */
2507
2508 return l;
2509}
2510
2511static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos)
2512 __acquires(RCU)
2513{
2514 struct fib_route_iter *iter = seq->private;
2515 struct fib_table *tb;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002516 struct trie *t;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002517
2518 rcu_read_lock();
Alexander Duyck8be33e92015-03-04 14:59:19 -08002519
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002520 tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN);
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002521 if (!tb)
2522 return NULL;
2523
Alexander Duyck8be33e92015-03-04 14:59:19 -08002524 iter->main_tb = tb;
David Forster94d9f1c2016-08-03 15:13:01 +01002525 t = (struct trie *)tb->tb_data;
2526 iter->tnode = t->kv;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002527
2528 if (*pos != 0)
2529 return fib_route_get_idx(iter, *pos);
2530
Alexander Duyck8be33e92015-03-04 14:59:19 -08002531 iter->pos = 0;
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002532 iter->key = KEY_MAX;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002533
2534 return SEQ_START_TOKEN;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002535}
2536
2537static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2538{
2539 struct fib_route_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002540 struct key_vector *l = NULL;
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002541 t_key key = iter->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002542
2543 ++*pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002544
2545 /* only allow key of 0 for start of sequence */
2546 if ((v == SEQ_START_TOKEN) || key)
2547 l = leaf_walk_rcu(&iter->tnode, key);
2548
2549 if (l) {
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002550 iter->key = l->key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002551 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002552 } else {
2553 iter->pos = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002554 }
2555
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002556 return l;
2557}
2558
2559static void fib_route_seq_stop(struct seq_file *seq, void *v)
2560 __releases(RCU)
2561{
2562 rcu_read_unlock();
2563}
2564
Eric Dumazeta034ee32010-09-09 23:32:28 +00002565static unsigned int fib_flag_trans(int type, __be32 mask, const struct fib_info *fi)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002566{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002567 unsigned int flags = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002568
Eric Dumazeta034ee32010-09-09 23:32:28 +00002569 if (type == RTN_UNREACHABLE || type == RTN_PROHIBIT)
2570 flags = RTF_REJECT;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002571 if (fi && fi->fib_nh->nh_gw)
2572 flags |= RTF_GATEWAY;
Al Viro32ab5f82006-09-26 22:21:45 -07002573 if (mask == htonl(0xFFFFFFFF))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002574 flags |= RTF_HOST;
2575 flags |= RTF_UP;
2576 return flags;
2577}
2578
2579/*
2580 * This outputs /proc/net/route.
2581 * The format of the file is not supposed to be changed
Eric Dumazeta034ee32010-09-09 23:32:28 +00002582 * and needs to be same as fib_hash output to avoid breaking
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002583 * legacy utilities
2584 */
2585static int fib_route_seq_show(struct seq_file *seq, void *v)
2586{
Alexander Duyck654eff42015-03-11 16:36:08 -07002587 struct fib_route_iter *iter = seq->private;
2588 struct fib_table *tb = iter->main_tb;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002589 struct fib_alias *fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002590 struct key_vector *l = v;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002591 __be32 prefix;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002592
2593 if (v == SEQ_START_TOKEN) {
2594 seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway "
2595 "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU"
2596 "\tWindow\tIRTT");
2597 return 0;
2598 }
2599
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002600 prefix = htonl(l->key);
2601
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002602 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2603 const struct fib_info *fi = fa->fa_info;
2604 __be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen);
2605 unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002606
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002607 if ((fa->fa_type == RTN_BROADCAST) ||
2608 (fa->fa_type == RTN_MULTICAST))
2609 continue;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002610
Alexander Duyck654eff42015-03-11 16:36:08 -07002611 if (fa->tb_id != tb->tb_id)
2612 continue;
2613
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002614 seq_setwidth(seq, 127);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002615
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002616 if (fi)
2617 seq_printf(seq,
2618 "%s\t%08X\t%08X\t%04X\t%d\t%u\t"
2619 "%d\t%08X\t%d\t%u\t%u",
2620 fi->fib_dev ? fi->fib_dev->name : "*",
2621 prefix,
2622 fi->fib_nh->nh_gw, flags, 0, 0,
2623 fi->fib_priority,
2624 mask,
2625 (fi->fib_advmss ?
2626 fi->fib_advmss + 40 : 0),
2627 fi->fib_window,
2628 fi->fib_rtt >> 3);
2629 else
2630 seq_printf(seq,
2631 "*\t%08X\t%08X\t%04X\t%d\t%u\t"
2632 "%d\t%08X\t%d\t%u\t%u",
2633 prefix, 0, flags, 0, 0, 0,
2634 mask, 0, 0, 0);
Tetsuo Handa652586d2013-11-14 14:31:57 -08002635
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002636 seq_pad(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002637 }
2638
2639 return 0;
2640}
2641
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002642static const struct seq_operations fib_route_seq_ops = {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002643 .start = fib_route_seq_start,
2644 .next = fib_route_seq_next,
2645 .stop = fib_route_seq_stop,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002646 .show = fib_route_seq_show,
2647};
2648
2649static int fib_route_seq_open(struct inode *inode, struct file *file)
2650{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002651 return seq_open_net(inode, file, &fib_route_seq_ops,
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002652 sizeof(struct fib_route_iter));
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002653}
2654
Arjan van de Ven9a321442007-02-12 00:55:35 -08002655static const struct file_operations fib_route_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002656 .owner = THIS_MODULE,
2657 .open = fib_route_seq_open,
2658 .read = seq_read,
2659 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002660 .release = seq_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002661};
2662
Denis V. Lunev61a02652008-01-10 03:21:09 -08002663int __net_init fib_proc_init(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002664{
Gao fengd4beaa62013-02-18 01:34:54 +00002665 if (!proc_create("fib_trie", S_IRUGO, net->proc_net, &fib_trie_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002666 goto out1;
2667
Gao fengd4beaa62013-02-18 01:34:54 +00002668 if (!proc_create("fib_triestat", S_IRUGO, net->proc_net,
2669 &fib_triestat_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002670 goto out2;
2671
Gao fengd4beaa62013-02-18 01:34:54 +00002672 if (!proc_create("route", S_IRUGO, net->proc_net, &fib_route_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002673 goto out3;
2674
Robert Olsson19baf832005-06-21 12:43:18 -07002675 return 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002676
2677out3:
Gao fengece31ff2013-02-18 01:34:56 +00002678 remove_proc_entry("fib_triestat", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002679out2:
Gao fengece31ff2013-02-18 01:34:56 +00002680 remove_proc_entry("fib_trie", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002681out1:
2682 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07002683}
2684
Denis V. Lunev61a02652008-01-10 03:21:09 -08002685void __net_exit fib_proc_exit(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002686{
Gao fengece31ff2013-02-18 01:34:56 +00002687 remove_proc_entry("fib_trie", net->proc_net);
2688 remove_proc_entry("fib_triestat", net->proc_net);
2689 remove_proc_entry("route", net->proc_net);
Robert Olsson19baf832005-06-21 12:43:18 -07002690}
2691
2692#endif /* CONFIG_PROC_FS */