blob: ef40bb659a7a7e5e9f60cb24bd6bb33bb5e45af8 [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;
Alexander Duycka52ca622016-12-01 07:27:57 -0500722 unsigned char slen_max;
723
724 /* only vector 0 can have a suffix length greater than or equal to
725 * tn->pos + tn->bits, the second highest node will have a suffix
726 * length at most of tn->pos + tn->bits - 1
727 */
728 slen_max = min_t(unsigned char, tn->pos + tn->bits - 1, tn->slen);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800729
730 /* search though the list of children looking for nodes that might
731 * have a suffix greater than the one we currently have. This is
732 * why we start with a stride of 2 since a stride of 1 would
733 * represent the nodes with suffix length equal to tn->pos
734 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800735 for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800736 struct key_vector *n = get_child(tn, i);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800737
738 if (!n || (n->slen <= slen))
739 continue;
740
741 /* update stride and slen based on new value */
742 stride <<= (n->slen - slen);
743 slen = n->slen;
744 i &= ~(stride - 1);
745
Alexander Duycka52ca622016-12-01 07:27:57 -0500746 /* stop searching if we have hit the maximum possible value */
747 if (slen >= slen_max)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800748 break;
749 }
750
751 tn->slen = slen;
752
753 return slen;
754}
755
Alexander Duyckf05a4812014-12-31 10:56:37 -0800756/* From "Implementing a dynamic compressed trie" by Stefan Nilsson of
757 * the Helsinki University of Technology and Matti Tikkanen of Nokia
758 * Telecommunications, page 6:
759 * "A node is doubled if the ratio of non-empty children to all
760 * children in the *doubled* node is at least 'high'."
761 *
762 * 'high' in this instance is the variable 'inflate_threshold'. It
763 * is expressed as a percentage, so we multiply it with
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800764 * child_length() and instead of multiplying by 2 (since the
Alexander Duyckf05a4812014-12-31 10:56:37 -0800765 * child array will be doubled by inflate()) and multiplying
766 * the left-hand side by 100 (to handle the percentage thing) we
767 * multiply the left-hand side by 50.
768 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800769 * The left-hand side may look a bit weird: child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800770 * - tn->empty_children is of course the number of non-null children
771 * in the current node. tn->full_children is the number of "full"
772 * children, that is non-null tnodes with a skip value of 0.
773 * All of those will be doubled in the resulting inflated tnode, so
774 * we just count them one extra time here.
775 *
776 * A clearer way to write this would be:
777 *
778 * to_be_doubled = tn->full_children;
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800779 * not_to_be_doubled = child_length(tn) - tn->empty_children -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800780 * tn->full_children;
781 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800782 * new_child_length = child_length(tn) * 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800783 *
784 * new_fill_factor = 100 * (not_to_be_doubled + 2*to_be_doubled) /
785 * new_child_length;
786 * if (new_fill_factor >= inflate_threshold)
787 *
788 * ...and so on, tho it would mess up the while () loop.
789 *
790 * anyway,
791 * 100 * (not_to_be_doubled + 2*to_be_doubled) / new_child_length >=
792 * inflate_threshold
793 *
794 * avoid a division:
795 * 100 * (not_to_be_doubled + 2*to_be_doubled) >=
796 * inflate_threshold * new_child_length
797 *
798 * expand not_to_be_doubled and to_be_doubled, and shorten:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800799 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800800 * tn->full_children) >= inflate_threshold * new_child_length
801 *
802 * expand new_child_length:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800803 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800804 * tn->full_children) >=
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800805 * inflate_threshold * child_length(tn) * 2
Alexander Duyckf05a4812014-12-31 10:56:37 -0800806 *
807 * shorten again:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800808 * 50 * (tn->full_children + child_length(tn) -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800809 * tn->empty_children) >= inflate_threshold *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800810 * child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800811 *
812 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800813static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800814{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800815 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800816 unsigned long threshold = used;
817
818 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800819 threshold *= IS_TRIE(tp) ? inflate_threshold_root : inflate_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800820 used -= tn_info(tn)->empty_children;
821 used += tn_info(tn)->full_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800822
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800823 /* if bits == KEYLENGTH then pos = 0, and will fail below */
824
825 return (used > 1) && tn->pos && ((50 * used) >= threshold);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800826}
827
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800828static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800829{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800830 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800831 unsigned long threshold = used;
832
833 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800834 threshold *= IS_TRIE(tp) ? halve_threshold_root : halve_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800835 used -= tn_info(tn)->empty_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800836
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800837 /* if bits == KEYLENGTH then used = 100% on wrap, and will fail below */
838
839 return (used > 1) && (tn->bits > 1) && ((100 * used) < threshold);
840}
841
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800842static inline bool should_collapse(struct key_vector *tn)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800843{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800844 unsigned long used = child_length(tn);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800845
Alexander Duyck6e22d172015-03-06 09:54:39 -0800846 used -= tn_info(tn)->empty_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800847
848 /* account for bits == KEYLENGTH case */
Alexander Duyck6e22d172015-03-06 09:54:39 -0800849 if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800850 used -= KEY_MAX;
851
852 /* One child or none, time to drop us from the trie */
853 return used < 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800854}
855
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800856#define MAX_WORK 10
Alexander Duyck88bae712015-03-06 09:54:52 -0800857static struct key_vector *resize(struct trie *t, struct key_vector *tn)
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800858{
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800859#ifdef CONFIG_IP_FIB_TRIE_STATS
860 struct trie_use_stats __percpu *stats = t->stats;
861#endif
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800862 struct key_vector *tp = node_parent(tn);
Alexander Duyck88bae712015-03-06 09:54:52 -0800863 unsigned long cindex = get_index(tn->key, tp);
Alexander Duycka80e89d2015-01-22 15:51:20 -0800864 int max_work = MAX_WORK;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800865
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800866 pr_debug("In tnode_resize %p inflate_threshold=%d threshold=%d\n",
867 tn, inflate_threshold, halve_threshold);
868
Alexander Duyckff181ed2014-12-31 10:56:43 -0800869 /* track the tnode via the pointer from the parent instead of
870 * doing it ourselves. This way we can let RCU fully do its
871 * thing without us interfering
872 */
Alexander Duyck88bae712015-03-06 09:54:52 -0800873 BUG_ON(tn != get_child(tp, cindex));
Alexander Duyckff181ed2014-12-31 10:56:43 -0800874
Alexander Duyckf05a4812014-12-31 10:56:37 -0800875 /* Double as long as the resulting node has a number of
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800876 * nonempty nodes that are above the threshold.
877 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700878 while (should_inflate(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800879 tp = inflate(t, tn);
880 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800881#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800882 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800883#endif
884 break;
885 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800886
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700887 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800888 tn = get_child(tp, cindex);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800889 }
890
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700891 /* update parent in case inflate failed */
892 tp = node_parent(tn);
893
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800894 /* Return if at least one inflate is run */
895 if (max_work != MAX_WORK)
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700896 return tp;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800897
Alexander Duyckf05a4812014-12-31 10:56:37 -0800898 /* Halve as long as the number of empty children in this
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800899 * node is above threshold.
900 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700901 while (should_halve(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800902 tp = halve(t, tn);
903 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800904#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800905 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800906#endif
907 break;
908 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800909
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700910 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800911 tn = get_child(tp, cindex);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800912 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800913
914 /* Only one child remains */
Alexander Duyck88bae712015-03-06 09:54:52 -0800915 if (should_collapse(tn))
916 return collapse(t, tn);
917
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700918 /* update parent in case halve failed */
Alexander Duycka52ca622016-12-01 07:27:57 -0500919 return node_parent(tn);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800920}
921
Alexander Duyck1a239172016-12-01 07:27:52 -0500922static void node_pull_suffix(struct key_vector *tn, unsigned char slen)
Robert Olsson19baf832005-06-21 12:43:18 -0700923{
Alexander Duyck1a239172016-12-01 07:27:52 -0500924 unsigned char node_slen = tn->slen;
925
926 while ((node_slen > tn->pos) && (node_slen > slen)) {
927 slen = update_suffix(tn);
928 if (node_slen == slen)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800929 break;
Alexander Duyck1a239172016-12-01 07:27:52 -0500930
931 tn = node_parent(tn);
932 node_slen = tn->slen;
Alexander Duyck5405afd2014-12-31 10:57:08 -0800933 }
934}
935
Alexander Duyck1a239172016-12-01 07:27:52 -0500936static void node_push_suffix(struct key_vector *tn, unsigned char slen)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800937{
Alexander Duyck1a239172016-12-01 07:27:52 -0500938 while (tn->slen < slen) {
939 tn->slen = slen;
Alexander Duyck5405afd2014-12-31 10:57:08 -0800940 tn = node_parent(tn);
941 }
942}
943
Robert Olsson2373ce12005-08-25 13:01:29 -0700944/* rcu_read_lock needs to be hold by caller from readside */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800945static struct key_vector *fib_find_node(struct trie *t,
946 struct key_vector **tp, u32 key)
Robert Olsson19baf832005-06-21 12:43:18 -0700947{
Alexander Duyck88bae712015-03-06 09:54:52 -0800948 struct key_vector *pn, *n = t->kv;
949 unsigned long index = 0;
Robert Olsson19baf832005-06-21 12:43:18 -0700950
Alexander Duyck88bae712015-03-06 09:54:52 -0800951 do {
952 pn = n;
953 n = get_child_rcu(n, index);
954
955 if (!n)
956 break;
957
958 index = get_cindex(key, n);
Alexander Duyck939afb02014-12-31 10:56:00 -0800959
960 /* This bit of code is a bit tricky but it combines multiple
961 * checks into a single check. The prefix consists of the
962 * prefix plus zeros for the bits in the cindex. The index
963 * is the difference between the key and this value. From
964 * this we can actually derive several pieces of data.
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800965 * if (index >= (1ul << bits))
Alexander Duyck939afb02014-12-31 10:56:00 -0800966 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -0800967 * else
968 * we know the value is cindex
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800969 *
970 * This check is safe even if bits == KEYLENGTH due to the
971 * fact that we can only allocate a node with 32 bits if a
972 * long is greater than 32 bits.
Alexander Duyck939afb02014-12-31 10:56:00 -0800973 */
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800974 if (index >= (1ul << n->bits)) {
975 n = NULL;
976 break;
977 }
Alexander Duyck939afb02014-12-31 10:56:00 -0800978
Alexander Duyck88bae712015-03-06 09:54:52 -0800979 /* keep searching until we find a perfect match leaf or NULL */
980 } while (IS_TNODE(n));
Robert Olsson19baf832005-06-21 12:43:18 -0700981
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800982 *tp = pn;
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800983
Alexander Duyck939afb02014-12-31 10:56:00 -0800984 return n;
Robert Olsson19baf832005-06-21 12:43:18 -0700985}
986
Alexander Duyck02525362015-01-22 15:51:39 -0800987/* Return the first fib alias matching TOS with
988 * priority less than or equal to PRIO.
989 */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800990static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen,
Alexander Duyck0b65bd92015-03-12 14:46:29 -0700991 u8 tos, u32 prio, u32 tb_id)
Alexander Duyck02525362015-01-22 15:51:39 -0800992{
993 struct fib_alias *fa;
994
995 if (!fah)
996 return NULL;
997
Alexander Duyck56315f92015-02-25 15:31:31 -0800998 hlist_for_each_entry(fa, fah, fa_list) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800999 if (fa->fa_slen < slen)
1000 continue;
1001 if (fa->fa_slen != slen)
1002 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001003 if (fa->tb_id > tb_id)
1004 continue;
1005 if (fa->tb_id != tb_id)
1006 break;
Alexander Duyck02525362015-01-22 15:51:39 -08001007 if (fa->fa_tos > tos)
1008 continue;
1009 if (fa->fa_info->fib_priority >= prio || fa->fa_tos < tos)
1010 return fa;
1011 }
1012
1013 return NULL;
1014}
1015
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001016static void trie_rebalance(struct trie *t, struct key_vector *tn)
Robert Olsson19baf832005-06-21 12:43:18 -07001017{
Alexander Duyck88bae712015-03-06 09:54:52 -08001018 while (!IS_TRIE(tn))
1019 tn = resize(t, tn);
Robert Olsson19baf832005-06-21 12:43:18 -07001020}
1021
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001022static int fib_insert_node(struct trie *t, struct key_vector *tp,
Alexander Duyckd5d64872015-03-04 15:02:18 -08001023 struct fib_alias *new, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -07001024{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001025 struct key_vector *n, *l;
Alexander Duyck836a0122014-12-31 10:56:06 -08001026
Alexander Duyckd5d64872015-03-04 15:02:18 -08001027 l = leaf_new(key, new);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001028 if (!l)
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001029 goto noleaf;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001030
1031 /* retrieve child from parent node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001032 n = get_child(tp, get_index(key, tp));
Alexander Duyck836a0122014-12-31 10:56:06 -08001033
1034 /* Case 2: n is a LEAF or a TNODE and the key doesn't match.
1035 *
1036 * Add a new tnode here
1037 * first tnode need some special handling
1038 * leaves us in position for handling as case 3
1039 */
1040 if (n) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001041 struct key_vector *tn;
Alexander Duyck836a0122014-12-31 10:56:06 -08001042
Alexander Duycke9b44012014-12-31 10:56:12 -08001043 tn = tnode_new(key, __fls(key ^ n->key), 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001044 if (!tn)
1045 goto notnode;
Olof Johansson91b9a272005-08-09 20:24:39 -07001046
Alexander Duyck836a0122014-12-31 10:56:06 -08001047 /* initialize routes out of node */
1048 NODE_INIT_PARENT(tn, tp);
1049 put_child(tn, get_index(key, tn) ^ 1, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001050
Alexander Duyck836a0122014-12-31 10:56:06 -08001051 /* start adding routes into the node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001052 put_child_root(tp, key, tn);
Alexander Duyck836a0122014-12-31 10:56:06 -08001053 node_set_parent(n, tn);
Robert Olsson19baf832005-06-21 12:43:18 -07001054
Alexander Duyck836a0122014-12-31 10:56:06 -08001055 /* parent now has a NULL spot where the leaf can go */
Alexander Duycke962f302014-12-10 21:49:22 -08001056 tp = tn;
Robert Olsson19baf832005-06-21 12:43:18 -07001057 }
Olof Johansson91b9a272005-08-09 20:24:39 -07001058
Alexander Duyck836a0122014-12-31 10:56:06 -08001059 /* Case 3: n is NULL, and will just insert a new leaf */
Alexander Duycka52ca622016-12-01 07:27:57 -05001060 node_push_suffix(tp, new->fa_slen);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001061 NODE_INIT_PARENT(l, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -08001062 put_child_root(tp, key, l);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001063 trie_rebalance(t, tp);
Olof Johansson91b9a272005-08-09 20:24:39 -07001064
Alexander Duyckd5d64872015-03-04 15:02:18 -08001065 return 0;
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001066notnode:
1067 node_free(l);
1068noleaf:
1069 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07001070}
1071
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001072static int fib_insert_alias(struct trie *t, struct key_vector *tp,
1073 struct key_vector *l, struct fib_alias *new,
Alexander Duyckd5d64872015-03-04 15:02:18 -08001074 struct fib_alias *fa, t_key key)
1075{
1076 if (!l)
1077 return fib_insert_node(t, tp, new, key);
1078
1079 if (fa) {
1080 hlist_add_before_rcu(&new->fa_list, &fa->fa_list);
1081 } else {
1082 struct fib_alias *last;
1083
1084 hlist_for_each_entry(last, &l->leaf, fa_list) {
1085 if (new->fa_slen < last->fa_slen)
1086 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001087 if ((new->fa_slen == last->fa_slen) &&
1088 (new->tb_id > last->tb_id))
1089 break;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001090 fa = last;
1091 }
1092
1093 if (fa)
1094 hlist_add_behind_rcu(&new->fa_list, &fa->fa_list);
1095 else
1096 hlist_add_head_rcu(&new->fa_list, &l->leaf);
1097 }
1098
1099 /* if we added to the tail node then we need to update slen */
1100 if (l->slen < new->fa_slen) {
1101 l->slen = new->fa_slen;
Alexander Duyck1a239172016-12-01 07:27:52 -05001102 node_push_suffix(tp, new->fa_slen);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001103 }
1104
1105 return 0;
1106}
1107
1108/* Caller must hold RTNL. */
Jiri Pirkob90eb752016-09-26 12:52:29 +02001109int fib_table_insert(struct net *net, struct fib_table *tb,
1110 struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001111{
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001112 struct trie *t = (struct trie *)tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001113 struct fib_alias *fa, *new_fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001114 struct key_vector *l, *tp;
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001115 u16 nlflags = NLM_F_EXCL;
Robert Olsson19baf832005-06-21 12:43:18 -07001116 struct fib_info *fi;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001117 u8 plen = cfg->fc_dst_len;
1118 u8 slen = KEYLENGTH - plen;
Thomas Graf4e902c52006-08-17 18:14:52 -07001119 u8 tos = cfg->fc_tos;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001120 u32 key;
Robert Olsson19baf832005-06-21 12:43:18 -07001121 int err;
Robert Olsson19baf832005-06-21 12:43:18 -07001122
Alexander Duyck5786ec62015-02-25 15:31:37 -08001123 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001124 return -EINVAL;
1125
Thomas Graf4e902c52006-08-17 18:14:52 -07001126 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001127
Patrick McHardy2dfe55b2006-08-10 23:08:33 -07001128 pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen);
Robert Olsson19baf832005-06-21 12:43:18 -07001129
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001130 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001131 return -EINVAL;
1132
Thomas Graf4e902c52006-08-17 18:14:52 -07001133 fi = fib_create_info(cfg);
1134 if (IS_ERR(fi)) {
1135 err = PTR_ERR(fi);
Robert Olsson19baf832005-06-21 12:43:18 -07001136 goto err;
Thomas Graf4e902c52006-08-17 18:14:52 -07001137 }
Robert Olsson19baf832005-06-21 12:43:18 -07001138
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001139 l = fib_find_node(t, &tp, key);
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001140 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority,
1141 tb->tb_id) : NULL;
Robert Olsson19baf832005-06-21 12:43:18 -07001142
1143 /* Now fa, if non-NULL, points to the first fib alias
1144 * with the same keys [prefix,tos,priority], if such key already
1145 * exists or to the node before which we will insert new one.
1146 *
1147 * If fa is NULL, we will need to allocate a new one and
Alexander Duyck56315f92015-02-25 15:31:31 -08001148 * insert to the tail of the section matching the suffix length
1149 * of the new alias.
Robert Olsson19baf832005-06-21 12:43:18 -07001150 */
1151
Julian Anastasov936f6f82008-01-28 21:18:06 -08001152 if (fa && fa->fa_tos == tos &&
1153 fa->fa_info->fib_priority == fi->fib_priority) {
1154 struct fib_alias *fa_first, *fa_match;
Robert Olsson19baf832005-06-21 12:43:18 -07001155
1156 err = -EEXIST;
Thomas Graf4e902c52006-08-17 18:14:52 -07001157 if (cfg->fc_nlflags & NLM_F_EXCL)
Robert Olsson19baf832005-06-21 12:43:18 -07001158 goto out;
1159
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001160 nlflags &= ~NLM_F_EXCL;
1161
Julian Anastasov936f6f82008-01-28 21:18:06 -08001162 /* We have 2 goals:
1163 * 1. Find exact match for type, scope, fib_info to avoid
1164 * duplicate routes
1165 * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it
1166 */
1167 fa_match = NULL;
1168 fa_first = fa;
Alexander Duyck56315f92015-02-25 15:31:31 -08001169 hlist_for_each_entry_from(fa, fa_list) {
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001170 if ((fa->fa_slen != slen) ||
1171 (fa->tb_id != tb->tb_id) ||
1172 (fa->fa_tos != tos))
Julian Anastasov936f6f82008-01-28 21:18:06 -08001173 break;
1174 if (fa->fa_info->fib_priority != fi->fib_priority)
1175 break;
1176 if (fa->fa_type == cfg->fc_type &&
Julian Anastasov936f6f82008-01-28 21:18:06 -08001177 fa->fa_info == fi) {
1178 fa_match = fa;
1179 break;
1180 }
1181 }
1182
Thomas Graf4e902c52006-08-17 18:14:52 -07001183 if (cfg->fc_nlflags & NLM_F_REPLACE) {
Robert Olsson19baf832005-06-21 12:43:18 -07001184 struct fib_info *fi_drop;
1185 u8 state;
1186
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001187 nlflags |= NLM_F_REPLACE;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001188 fa = fa_first;
1189 if (fa_match) {
1190 if (fa == fa_match)
1191 err = 0;
Joonwoo Park67250332008-01-18 03:45:18 -08001192 goto out;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001193 }
Robert Olsson2373ce12005-08-25 13:01:29 -07001194 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001195 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001196 if (!new_fa)
Robert Olsson2373ce12005-08-25 13:01:29 -07001197 goto out;
Robert Olsson19baf832005-06-21 12:43:18 -07001198
1199 fi_drop = fa->fa_info;
Robert Olsson2373ce12005-08-25 13:01:29 -07001200 new_fa->fa_tos = fa->fa_tos;
1201 new_fa->fa_info = fi;
Thomas Graf4e902c52006-08-17 18:14:52 -07001202 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001203 state = fa->fa_state;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001204 new_fa->fa_state = state & ~FA_S_ACCESSED;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001205 new_fa->fa_slen = fa->fa_slen;
Michal Kubečekd4e64c22015-05-22 13:40:09 +02001206 new_fa->tb_id = tb->tb_id;
Julian Anastasov2392deb2015-07-22 10:43:23 +03001207 new_fa->fa_default = -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001208
Alexander Duyck56315f92015-02-25 15:31:31 -08001209 hlist_replace_rcu(&fa->fa_list, &new_fa->fa_list);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001210
Robert Olsson2373ce12005-08-25 13:01:29 -07001211 alias_free_mem_rcu(fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001212
1213 fib_release_info(fi_drop);
1214 if (state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001215 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Jiri Pirkob90eb752016-09-26 12:52:29 +02001216
1217 call_fib_entry_notifiers(net, FIB_EVENT_ENTRY_ADD,
1218 key, plen, fi,
1219 new_fa->fa_tos, cfg->fc_type,
1220 tb->tb_id, cfg->fc_nlflags);
Milan Kocianb8f55832007-05-23 14:55:06 -07001221 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen,
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001222 tb->tb_id, &cfg->fc_nlinfo, nlflags);
Robert Olsson19baf832005-06-21 12:43:18 -07001223
Olof Johansson91b9a272005-08-09 20:24:39 -07001224 goto succeeded;
Robert Olsson19baf832005-06-21 12:43:18 -07001225 }
1226 /* Error if we find a perfect match which
1227 * uses the same scope, type, and nexthop
1228 * information.
1229 */
Julian Anastasov936f6f82008-01-28 21:18:06 -08001230 if (fa_match)
1231 goto out;
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001232
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001233 if (cfg->fc_nlflags & NLM_F_APPEND)
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001234 nlflags |= NLM_F_APPEND;
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001235 else
Julian Anastasov936f6f82008-01-28 21:18:06 -08001236 fa = fa_first;
Robert Olsson19baf832005-06-21 12:43:18 -07001237 }
1238 err = -ENOENT;
Thomas Graf4e902c52006-08-17 18:14:52 -07001239 if (!(cfg->fc_nlflags & NLM_F_CREATE))
Robert Olsson19baf832005-06-21 12:43:18 -07001240 goto out;
1241
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001242 nlflags |= NLM_F_CREATE;
Robert Olsson19baf832005-06-21 12:43:18 -07001243 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001244 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001245 if (!new_fa)
Robert Olsson19baf832005-06-21 12:43:18 -07001246 goto out;
1247
1248 new_fa->fa_info = fi;
1249 new_fa->fa_tos = tos;
Thomas Graf4e902c52006-08-17 18:14:52 -07001250 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001251 new_fa->fa_state = 0;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001252 new_fa->fa_slen = slen;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001253 new_fa->tb_id = tb->tb_id;
Julian Anastasov2392deb2015-07-22 10:43:23 +03001254 new_fa->fa_default = -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001255
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001256 /* Insert new entry to the list. */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001257 err = fib_insert_alias(t, tp, l, new_fa, fa, key);
1258 if (err)
Jiri Pirko347e3b22016-09-26 12:52:33 +02001259 goto out_free_new_fa;
Robert Olsson19baf832005-06-21 12:43:18 -07001260
David S. Miller21d8c492011-04-14 14:49:37 -07001261 if (!plen)
1262 tb->tb_num_default++;
1263
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001264 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Jiri Pirkob90eb752016-09-26 12:52:29 +02001265 call_fib_entry_notifiers(net, FIB_EVENT_ENTRY_ADD, key, plen, fi, tos,
1266 cfg->fc_type, tb->tb_id, cfg->fc_nlflags);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001267 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, new_fa->tb_id,
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001268 &cfg->fc_nlinfo, nlflags);
Robert Olsson19baf832005-06-21 12:43:18 -07001269succeeded:
1270 return 0;
Robert Olssonf835e472005-06-28 15:00:39 -07001271
1272out_free_new_fa:
1273 kmem_cache_free(fn_alias_kmem, new_fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001274out:
1275 fib_release_info(fi);
Olof Johansson91b9a272005-08-09 20:24:39 -07001276err:
Robert Olsson19baf832005-06-21 12:43:18 -07001277 return err;
1278}
1279
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001280static inline t_key prefix_mismatch(t_key key, struct key_vector *n)
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001281{
1282 t_key prefix = n->key;
1283
1284 return (key ^ prefix) & (prefix | -prefix);
1285}
1286
Alexander Duyck345e9b52014-12-31 10:56:24 -08001287/* should be called with rcu_read_lock */
David S. Miller22bd5b92011-03-11 19:54:08 -05001288int fib_table_lookup(struct fib_table *tb, const struct flowi4 *flp,
Eric Dumazetebc0ffa2010-10-05 10:41:36 +00001289 struct fib_result *res, int fib_flags)
Robert Olsson19baf832005-06-21 12:43:18 -07001290{
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001291 struct trie *t = (struct trie *) tb->tb_data;
Alexander Duyck8274a972014-12-31 10:55:29 -08001292#ifdef CONFIG_IP_FIB_TRIE_STATS
1293 struct trie_use_stats __percpu *stats = t->stats;
1294#endif
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001295 const t_key key = ntohl(flp->daddr);
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001296 struct key_vector *n, *pn;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001297 struct fib_alias *fa;
Alexander Duyck71e8b672015-03-04 15:04:03 -08001298 unsigned long index;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001299 t_key cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001300
David Ahernf6d3c192015-08-28 08:42:09 -07001301 trace_fib_table_lookup(tb->tb_id, flp);
1302
Alexander Duyck88bae712015-03-06 09:54:52 -08001303 pn = t->kv;
1304 cindex = 0;
1305
1306 n = get_child_rcu(pn, cindex);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001307 if (!n)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001308 return -EAGAIN;
Robert Olsson19baf832005-06-21 12:43:18 -07001309
1310#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08001311 this_cpu_inc(stats->gets);
Robert Olsson19baf832005-06-21 12:43:18 -07001312#endif
1313
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001314 /* Step 1: Travel to the longest prefix match in the trie */
1315 for (;;) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001316 index = get_cindex(key, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001317
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001318 /* This bit of code is a bit tricky but it combines multiple
1319 * checks into a single check. The prefix consists of the
1320 * prefix plus zeros for the "bits" in the prefix. The index
1321 * is the difference between the key and this value. From
1322 * this we can actually derive several pieces of data.
Alexander Duyck71e8b672015-03-04 15:04:03 -08001323 * if (index >= (1ul << bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001324 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -08001325 * else
1326 * we know the value is cindex
Alexander Duyck71e8b672015-03-04 15:04:03 -08001327 *
1328 * This check is safe even if bits == KEYLENGTH due to the
1329 * fact that we can only allocate a node with 32 bits if a
1330 * long is greater than 32 bits.
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001331 */
Alexander Duyck71e8b672015-03-04 15:04:03 -08001332 if (index >= (1ul << n->bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001333 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001334
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001335 /* we have found a leaf. Prefixes have already been compared */
1336 if (IS_LEAF(n))
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001337 goto found;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001338
1339 /* only record pn and cindex if we are going to be chopping
1340 * bits later. Otherwise we are just wasting cycles.
1341 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001342 if (n->slen > n->pos) {
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001343 pn = n;
1344 cindex = index;
Olof Johansson91b9a272005-08-09 20:24:39 -07001345 }
1346
Alexander Duyck754baf82015-03-06 09:54:14 -08001347 n = get_child_rcu(n, index);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001348 if (unlikely(!n))
Robert Olsson19baf832005-06-21 12:43:18 -07001349 goto backtrace;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001350 }
1351
1352 /* Step 2: Sort out leaves and begin backtracing for longest prefix */
1353 for (;;) {
1354 /* record the pointer where our next node pointer is stored */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001355 struct key_vector __rcu **cptr = n->tnode;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001356
1357 /* This test verifies that none of the bits that differ
1358 * between the key and the prefix exist in the region of
1359 * the lsb and higher in the prefix.
1360 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001361 if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001362 goto backtrace;
1363
1364 /* exit out and process leaf */
1365 if (unlikely(IS_LEAF(n)))
1366 break;
1367
1368 /* Don't bother recording parent info. Since we are in
1369 * prefix match mode we will have to come back to wherever
1370 * we started this traversal anyway
1371 */
1372
1373 while ((n = rcu_dereference(*cptr)) == NULL) {
1374backtrace:
1375#ifdef CONFIG_IP_FIB_TRIE_STATS
1376 if (!n)
1377 this_cpu_inc(stats->null_node_hit);
1378#endif
1379 /* If we are at cindex 0 there are no more bits for
1380 * us to strip at this level so we must ascend back
1381 * up one level to see if there are any more bits to
1382 * be stripped there.
1383 */
1384 while (!cindex) {
1385 t_key pkey = pn->key;
1386
Alexander Duyck88bae712015-03-06 09:54:52 -08001387 /* If we don't have a parent then there is
1388 * nothing for us to do as we do not have any
1389 * further nodes to parse.
1390 */
1391 if (IS_TRIE(pn))
Alexander Duyck345e9b52014-12-31 10:56:24 -08001392 return -EAGAIN;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001393#ifdef CONFIG_IP_FIB_TRIE_STATS
1394 this_cpu_inc(stats->backtrack);
1395#endif
1396 /* Get Child's index */
Alexander Duyck88bae712015-03-06 09:54:52 -08001397 pn = node_parent_rcu(pn);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001398 cindex = get_index(pkey, pn);
1399 }
1400
1401 /* strip the least significant bit from the cindex */
1402 cindex &= cindex - 1;
1403
1404 /* grab pointer for next child node */
Alexander Duyck41b489f2015-03-04 15:02:33 -08001405 cptr = &pn->tnode[cindex];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001406 }
Robert Olsson19baf832005-06-21 12:43:18 -07001407 }
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001408
Robert Olsson19baf832005-06-21 12:43:18 -07001409found:
Alexander Duyck71e8b672015-03-04 15:04:03 -08001410 /* this line carries forward the xor from earlier in the function */
1411 index = key ^ n->key;
1412
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001413 /* Step 3: Process the leaf, if that fails fall back to backtracing */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001414 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
1415 struct fib_info *fi = fa->fa_info;
1416 int nhsel, err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001417
Alexander Duycka5829f52016-01-28 13:42:24 -08001418 if ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen < KEYLENGTH)) {
1419 if (index >= (1ul << fa->fa_slen))
1420 continue;
1421 }
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001422 if (fa->fa_tos && fa->fa_tos != flp->flowi4_tos)
1423 continue;
1424 if (fi->fib_dead)
1425 continue;
1426 if (fa->fa_info->fib_scope < flp->flowi4_scope)
1427 continue;
1428 fib_alias_accessed(fa);
1429 err = fib_props[fa->fa_type].error;
1430 if (unlikely(err < 0)) {
Alexander Duyck345e9b52014-12-31 10:56:24 -08001431#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001432 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001433#endif
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001434 return err;
1435 }
1436 if (fi->fib_flags & RTNH_F_DEAD)
1437 continue;
1438 for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) {
1439 const struct fib_nh *nh = &fi->fib_nh[nhsel];
Andy Gospodarek0eeb0752015-06-23 13:45:37 -04001440 struct in_device *in_dev = __in_dev_get_rcu(nh->nh_dev);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001441
1442 if (nh->nh_flags & RTNH_F_DEAD)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001443 continue;
Andy Gospodarek0eeb0752015-06-23 13:45:37 -04001444 if (in_dev &&
1445 IN_DEV_IGNORE_ROUTES_WITH_LINKDOWN(in_dev) &&
1446 nh->nh_flags & RTNH_F_LINKDOWN &&
1447 !(fib_flags & FIB_LOOKUP_IGNORE_LINKSTATE))
1448 continue;
David Ahern58189ca2015-09-15 15:10:50 -07001449 if (!(flp->flowi4_flags & FLOWI_FLAG_SKIP_NH_OIF)) {
David Ahern613d09b2015-08-13 14:59:02 -06001450 if (flp->flowi4_oif &&
1451 flp->flowi4_oif != nh->nh_oif)
1452 continue;
1453 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001454
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001455 if (!(fib_flags & FIB_LOOKUP_NOREF))
1456 atomic_inc(&fi->fib_clntref);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001457
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001458 res->prefixlen = KEYLENGTH - fa->fa_slen;
1459 res->nh_sel = nhsel;
1460 res->type = fa->fa_type;
1461 res->scope = fi->fib_scope;
1462 res->fi = fi;
1463 res->table = tb;
1464 res->fa_head = &n->leaf;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001465#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001466 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001467#endif
David Ahernf6d3c192015-08-28 08:42:09 -07001468 trace_fib_table_lookup_nh(nh);
1469
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001470 return err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001471 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001472 }
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001473#ifdef CONFIG_IP_FIB_TRIE_STATS
1474 this_cpu_inc(stats->semantic_match_miss);
1475#endif
Alexander Duyck345e9b52014-12-31 10:56:24 -08001476 goto backtrace;
Robert Olsson19baf832005-06-21 12:43:18 -07001477}
Florian Westphal6fc01432011-08-25 13:46:12 +02001478EXPORT_SYMBOL_GPL(fib_table_lookup);
Robert Olsson19baf832005-06-21 12:43:18 -07001479
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001480static void fib_remove_alias(struct trie *t, struct key_vector *tp,
1481 struct key_vector *l, struct fib_alias *old)
Alexander Duyckd5d64872015-03-04 15:02:18 -08001482{
1483 /* record the location of the previous list_info entry */
1484 struct hlist_node **pprev = old->fa_list.pprev;
1485 struct fib_alias *fa = hlist_entry(pprev, typeof(*fa), fa_list.next);
1486
1487 /* remove the fib_alias from the list */
1488 hlist_del_rcu(&old->fa_list);
1489
1490 /* if we emptied the list this leaf will be freed and we can sort
1491 * out parent suffix lengths as a part of trie_rebalance
1492 */
1493 if (hlist_empty(&l->leaf)) {
Alexander Duycka52ca622016-12-01 07:27:57 -05001494 if (tp->slen == l->slen)
1495 node_pull_suffix(tp, tp->pos);
Alexander Duyck88bae712015-03-06 09:54:52 -08001496 put_child_root(tp, l->key, NULL);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001497 node_free(l);
1498 trie_rebalance(t, tp);
1499 return;
1500 }
1501
1502 /* only access fa if it is pointing at the last valid hlist_node */
1503 if (*pprev)
1504 return;
1505
1506 /* update the trie with the latest suffix length */
1507 l->slen = fa->fa_slen;
Alexander Duyck1a239172016-12-01 07:27:52 -05001508 node_pull_suffix(tp, fa->fa_slen);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001509}
1510
1511/* Caller must hold RTNL. */
Jiri Pirkob90eb752016-09-26 12:52:29 +02001512int fib_table_delete(struct net *net, struct fib_table *tb,
1513 struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001514{
1515 struct trie *t = (struct trie *) tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001516 struct fib_alias *fa, *fa_to_delete;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001517 struct key_vector *l, *tp;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001518 u8 plen = cfg->fc_dst_len;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001519 u8 slen = KEYLENGTH - plen;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001520 u8 tos = cfg->fc_tos;
1521 u32 key;
Olof Johansson91b9a272005-08-09 20:24:39 -07001522
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001523 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001524 return -EINVAL;
1525
Thomas Graf4e902c52006-08-17 18:14:52 -07001526 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001527
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001528 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001529 return -EINVAL;
1530
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001531 l = fib_find_node(t, &tp, key);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001532 if (!l)
Robert Olsson19baf832005-06-21 12:43:18 -07001533 return -ESRCH;
1534
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001535 fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id);
Robert Olsson19baf832005-06-21 12:43:18 -07001536 if (!fa)
1537 return -ESRCH;
1538
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001539 pr_debug("Deleting %08x/%d tos=%d t=%p\n", key, plen, tos, t);
Robert Olsson19baf832005-06-21 12:43:18 -07001540
1541 fa_to_delete = NULL;
Alexander Duyck56315f92015-02-25 15:31:31 -08001542 hlist_for_each_entry_from(fa, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001543 struct fib_info *fi = fa->fa_info;
1544
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001545 if ((fa->fa_slen != slen) ||
1546 (fa->tb_id != tb->tb_id) ||
1547 (fa->fa_tos != tos))
Robert Olsson19baf832005-06-21 12:43:18 -07001548 break;
1549
Thomas Graf4e902c52006-08-17 18:14:52 -07001550 if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) &&
1551 (cfg->fc_scope == RT_SCOPE_NOWHERE ||
David S. Miller37e826c2011-03-24 18:06:47 -07001552 fa->fa_info->fib_scope == cfg->fc_scope) &&
Julian Anastasov74cb3c12011-03-19 12:13:46 +00001553 (!cfg->fc_prefsrc ||
1554 fi->fib_prefsrc == cfg->fc_prefsrc) &&
Thomas Graf4e902c52006-08-17 18:14:52 -07001555 (!cfg->fc_protocol ||
1556 fi->fib_protocol == cfg->fc_protocol) &&
1557 fib_nh_match(cfg, fi) == 0) {
Robert Olsson19baf832005-06-21 12:43:18 -07001558 fa_to_delete = fa;
1559 break;
1560 }
1561 }
1562
Olof Johansson91b9a272005-08-09 20:24:39 -07001563 if (!fa_to_delete)
1564 return -ESRCH;
Robert Olsson19baf832005-06-21 12:43:18 -07001565
Jiri Pirkob90eb752016-09-26 12:52:29 +02001566 call_fib_entry_notifiers(net, FIB_EVENT_ENTRY_DEL, key, plen,
1567 fa_to_delete->fa_info, tos, cfg->fc_type,
1568 tb->tb_id, 0);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001569 rtmsg_fib(RTM_DELROUTE, htonl(key), fa_to_delete, plen, tb->tb_id,
Milan Kocianb8f55832007-05-23 14:55:06 -07001570 &cfg->fc_nlinfo, 0);
Robert Olsson19baf832005-06-21 12:43:18 -07001571
David S. Miller21d8c492011-04-14 14:49:37 -07001572 if (!plen)
1573 tb->tb_num_default--;
1574
Alexander Duyckd5d64872015-03-04 15:02:18 -08001575 fib_remove_alias(t, tp, l, fa_to_delete);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001576
Alexander Duyckd5d64872015-03-04 15:02:18 -08001577 if (fa_to_delete->fa_state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001578 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Olof Johansson91b9a272005-08-09 20:24:39 -07001579
Alexander Duyckd5d64872015-03-04 15:02:18 -08001580 fib_release_info(fa_to_delete->fa_info);
1581 alias_free_mem_rcu(fa_to_delete);
Olof Johansson91b9a272005-08-09 20:24:39 -07001582 return 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001583}
1584
Alexander Duyck8be33e92015-03-04 14:59:19 -08001585/* Scan for the next leaf starting at the provided key value */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001586static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -07001587{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001588 struct key_vector *pn, *n = *tn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001589 unsigned long cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001590
Alexander Duyck8be33e92015-03-04 14:59:19 -08001591 /* this loop is meant to try and find the key in the trie */
Alexander Duyck88bae712015-03-06 09:54:52 -08001592 do {
1593 /* record parent and next child index */
1594 pn = n;
Alexander Duyckc2229fe2015-10-27 15:06:45 -07001595 cindex = (key > pn->key) ? get_index(key, pn) : 0;
Alexander Duyck88bae712015-03-06 09:54:52 -08001596
1597 if (cindex >> pn->bits)
1598 break;
1599
1600 /* descend into the next child */
1601 n = get_child_rcu(pn, cindex++);
1602 if (!n)
1603 break;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001604
Alexander Duyck8be33e92015-03-04 14:59:19 -08001605 /* guarantee forward progress on the keys */
1606 if (IS_LEAF(n) && (n->key >= key))
1607 goto found;
Alexander Duyck88bae712015-03-06 09:54:52 -08001608 } while (IS_TNODE(n));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001609
1610 /* this loop will search for the next leaf with a greater key */
Alexander Duyck88bae712015-03-06 09:54:52 -08001611 while (!IS_TRIE(pn)) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001612 /* if we exhausted the parent node we will need to climb */
1613 if (cindex >= (1ul << pn->bits)) {
1614 t_key pkey = pn->key;
1615
1616 pn = node_parent_rcu(pn);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001617 cindex = get_index(pkey, pn) + 1;
1618 continue;
Robert Olsson19baf832005-06-21 12:43:18 -07001619 }
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001620
Alexander Duyck8be33e92015-03-04 14:59:19 -08001621 /* grab the next available node */
Alexander Duyck754baf82015-03-06 09:54:14 -08001622 n = get_child_rcu(pn, cindex++);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001623 if (!n)
1624 continue;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001625
Alexander Duyck8be33e92015-03-04 14:59:19 -08001626 /* no need to compare keys since we bumped the index */
1627 if (IS_LEAF(n))
1628 goto found;
1629
1630 /* Rescan start scanning in new node */
1631 pn = n;
1632 cindex = 0;
1633 }
1634
1635 *tn = pn;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001636 return NULL; /* Root of trie */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001637found:
1638 /* if we are at the limit for keys just return NULL for the tnode */
Alexander Duyck88bae712015-03-06 09:54:52 -08001639 *tn = pn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001640 return n;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001641}
1642
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001643static void fib_trie_free(struct fib_table *tb)
1644{
1645 struct trie *t = (struct trie *)tb->tb_data;
1646 struct key_vector *pn = t->kv;
1647 unsigned long cindex = 1;
1648 struct hlist_node *tmp;
1649 struct fib_alias *fa;
1650
1651 /* walk trie in reverse order and free everything */
1652 for (;;) {
1653 struct key_vector *n;
1654
1655 if (!(cindex--)) {
1656 t_key pkey = pn->key;
1657
1658 if (IS_TRIE(pn))
1659 break;
1660
1661 n = pn;
1662 pn = node_parent(pn);
1663
1664 /* drop emptied tnode */
1665 put_child_root(pn, n->key, NULL);
1666 node_free(n);
1667
1668 cindex = get_index(pkey, pn);
1669
1670 continue;
1671 }
1672
1673 /* grab the next available node */
1674 n = get_child(pn, cindex);
1675 if (!n)
1676 continue;
1677
1678 if (IS_TNODE(n)) {
1679 /* record pn and cindex for leaf walking */
1680 pn = n;
1681 cindex = 1ul << n->bits;
1682
1683 continue;
1684 }
1685
1686 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1687 hlist_del_rcu(&fa->fa_list);
1688 alias_free_mem_rcu(fa);
1689 }
1690
1691 put_child_root(pn, n->key, NULL);
1692 node_free(n);
1693 }
1694
1695#ifdef CONFIG_IP_FIB_TRIE_STATS
1696 free_percpu(t->stats);
1697#endif
1698 kfree(tb);
1699}
1700
1701struct fib_table *fib_trie_unmerge(struct fib_table *oldtb)
1702{
1703 struct trie *ot = (struct trie *)oldtb->tb_data;
1704 struct key_vector *l, *tp = ot->kv;
1705 struct fib_table *local_tb;
1706 struct fib_alias *fa;
1707 struct trie *lt;
1708 t_key key = 0;
1709
1710 if (oldtb->tb_data == oldtb->__data)
1711 return oldtb;
1712
1713 local_tb = fib_trie_table(RT_TABLE_LOCAL, NULL);
1714 if (!local_tb)
1715 return NULL;
1716
1717 lt = (struct trie *)local_tb->tb_data;
1718
1719 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
1720 struct key_vector *local_l = NULL, *local_tp;
1721
1722 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
1723 struct fib_alias *new_fa;
1724
1725 if (local_tb->tb_id != fa->tb_id)
1726 continue;
1727
1728 /* clone fa for new local table */
1729 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
1730 if (!new_fa)
1731 goto out;
1732
1733 memcpy(new_fa, fa, sizeof(*fa));
1734
1735 /* insert clone into table */
1736 if (!local_l)
1737 local_l = fib_find_node(lt, &local_tp, l->key);
1738
1739 if (fib_insert_alias(lt, local_tp, local_l, new_fa,
Alexander Duyck3114cdf2016-11-15 05:46:12 -05001740 NULL, l->key)) {
1741 kmem_cache_free(fn_alias_kmem, new_fa);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001742 goto out;
Alexander Duyck3114cdf2016-11-15 05:46:12 -05001743 }
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001744 }
1745
1746 /* stop loop if key wrapped back to 0 */
1747 key = l->key + 1;
1748 if (key < l->key)
1749 break;
1750 }
1751
1752 return local_tb;
1753out:
1754 fib_trie_free(local_tb);
1755
1756 return NULL;
1757}
1758
Alexander Duyck3b709332016-11-15 05:46:06 -05001759/* Caller must hold RTNL */
1760void fib_table_flush_external(struct fib_table *tb)
1761{
1762 struct trie *t = (struct trie *)tb->tb_data;
1763 struct key_vector *pn = t->kv;
1764 unsigned long cindex = 1;
1765 struct hlist_node *tmp;
1766 struct fib_alias *fa;
1767
1768 /* walk trie in reverse order */
1769 for (;;) {
1770 unsigned char slen = 0;
1771 struct key_vector *n;
1772
1773 if (!(cindex--)) {
1774 t_key pkey = pn->key;
1775
1776 /* cannot resize the trie vector */
1777 if (IS_TRIE(pn))
1778 break;
1779
Alexander Duycka52ca622016-12-01 07:27:57 -05001780 /* update the suffix to address pulled leaves */
1781 if (pn->slen > pn->pos)
1782 update_suffix(pn);
1783
Alexander Duyck3b709332016-11-15 05:46:06 -05001784 /* resize completed node */
1785 pn = resize(t, pn);
1786 cindex = get_index(pkey, pn);
1787
1788 continue;
1789 }
1790
1791 /* grab the next available node */
1792 n = get_child(pn, cindex);
1793 if (!n)
1794 continue;
1795
1796 if (IS_TNODE(n)) {
1797 /* record pn and cindex for leaf walking */
1798 pn = n;
1799 cindex = 1ul << n->bits;
1800
1801 continue;
1802 }
1803
1804 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1805 /* if alias was cloned to local then we just
1806 * need to remove the local copy from main
1807 */
1808 if (tb->tb_id != fa->tb_id) {
1809 hlist_del_rcu(&fa->fa_list);
1810 alias_free_mem_rcu(fa);
1811 continue;
1812 }
1813
1814 /* record local slen */
1815 slen = fa->fa_slen;
1816 }
1817
1818 /* update leaf slen */
1819 n->slen = slen;
1820
1821 if (hlist_empty(&n->leaf)) {
1822 put_child_root(pn, n->key, NULL);
1823 node_free(n);
1824 }
1825 }
1826}
1827
Alexander Duyck8be33e92015-03-04 14:59:19 -08001828/* Caller must hold RTNL. */
Jiri Pirkob90eb752016-09-26 12:52:29 +02001829int fib_table_flush(struct net *net, struct fib_table *tb)
Robert Olsson19baf832005-06-21 12:43:18 -07001830{
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001831 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001832 struct key_vector *pn = t->kv;
1833 unsigned long cindex = 1;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001834 struct hlist_node *tmp;
1835 struct fib_alias *fa;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001836 int found = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001837
Alexander Duyck88bae712015-03-06 09:54:52 -08001838 /* walk trie in reverse order */
1839 for (;;) {
1840 unsigned char slen = 0;
1841 struct key_vector *n;
Robert Olsson19baf832005-06-21 12:43:18 -07001842
Alexander Duyck88bae712015-03-06 09:54:52 -08001843 if (!(cindex--)) {
1844 t_key pkey = pn->key;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001845
Alexander Duyck88bae712015-03-06 09:54:52 -08001846 /* cannot resize the trie vector */
1847 if (IS_TRIE(pn))
1848 break;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001849
Alexander Duycka52ca622016-12-01 07:27:57 -05001850 /* update the suffix to address pulled leaves */
1851 if (pn->slen > pn->pos)
1852 update_suffix(pn);
1853
Alexander Duyck88bae712015-03-06 09:54:52 -08001854 /* resize completed node */
1855 pn = resize(t, pn);
1856 cindex = get_index(pkey, pn);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001857
Alexander Duyck88bae712015-03-06 09:54:52 -08001858 continue;
1859 }
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001860
Alexander Duyck88bae712015-03-06 09:54:52 -08001861 /* grab the next available node */
1862 n = get_child(pn, cindex);
1863 if (!n)
1864 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001865
Alexander Duyck88bae712015-03-06 09:54:52 -08001866 if (IS_TNODE(n)) {
1867 /* record pn and cindex for leaf walking */
1868 pn = n;
1869 cindex = 1ul << n->bits;
1870
1871 continue;
1872 }
1873
1874 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1875 struct fib_info *fi = fa->fa_info;
1876
1877 if (!fi || !(fi->fib_flags & RTNH_F_DEAD)) {
1878 slen = fa->fa_slen;
1879 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001880 }
1881
Jiri Pirkob90eb752016-09-26 12:52:29 +02001882 call_fib_entry_notifiers(net, FIB_EVENT_ENTRY_DEL,
1883 n->key,
1884 KEYLENGTH - fa->fa_slen,
1885 fi, fa->fa_tos, fa->fa_type,
1886 tb->tb_id, 0);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001887 hlist_del_rcu(&fa->fa_list);
1888 fib_release_info(fa->fa_info);
1889 alias_free_mem_rcu(fa);
1890 found++;
Alexander Duyck64c62722015-01-22 15:51:45 -08001891 }
1892
Alexander Duyck88bae712015-03-06 09:54:52 -08001893 /* update leaf slen */
1894 n->slen = slen;
1895
1896 if (hlist_empty(&n->leaf)) {
1897 put_child_root(pn, n->key, NULL);
1898 node_free(n);
Alexander Duyck88bae712015-03-06 09:54:52 -08001899 }
Robert Olsson19baf832005-06-21 12:43:18 -07001900 }
1901
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001902 pr_debug("trie_flush found=%d\n", found);
Robert Olsson19baf832005-06-21 12:43:18 -07001903 return found;
1904}
1905
Alexander Duycka7e53532015-03-04 15:02:44 -08001906static void __trie_free_rcu(struct rcu_head *head)
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001907{
Alexander Duycka7e53532015-03-04 15:02:44 -08001908 struct fib_table *tb = container_of(head, struct fib_table, rcu);
Alexander Duyck8274a972014-12-31 10:55:29 -08001909#ifdef CONFIG_IP_FIB_TRIE_STATS
1910 struct trie *t = (struct trie *)tb->tb_data;
1911
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001912 if (tb->tb_data == tb->__data)
1913 free_percpu(t->stats);
Alexander Duyck8274a972014-12-31 10:55:29 -08001914#endif /* CONFIG_IP_FIB_TRIE_STATS */
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001915 kfree(tb);
1916}
1917
Alexander Duycka7e53532015-03-04 15:02:44 -08001918void fib_free_table(struct fib_table *tb)
1919{
1920 call_rcu(&tb->rcu, __trie_free_rcu);
1921}
1922
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001923static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001924 struct sk_buff *skb, struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001925{
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001926 __be32 xkey = htonl(l->key);
Robert Olsson19baf832005-06-21 12:43:18 -07001927 struct fib_alias *fa;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001928 int i, s_i;
Robert Olsson19baf832005-06-21 12:43:18 -07001929
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001930 s_i = cb->args[4];
Robert Olsson19baf832005-06-21 12:43:18 -07001931 i = 0;
1932
Robert Olsson2373ce12005-08-25 13:01:29 -07001933 /* rcu_read_lock is hold by caller */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001934 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
David Ahern68647612017-05-15 23:19:17 -07001935 int err;
1936
Robert Olsson19baf832005-06-21 12:43:18 -07001937 if (i < s_i) {
1938 i++;
1939 continue;
1940 }
Robert Olsson19baf832005-06-21 12:43:18 -07001941
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001942 if (tb->tb_id != fa->tb_id) {
1943 i++;
1944 continue;
1945 }
1946
David Ahern68647612017-05-15 23:19:17 -07001947 err = fib_dump_info(skb, NETLINK_CB(cb->skb).portid,
1948 cb->nlh->nlmsg_seq, RTM_NEWROUTE,
1949 tb->tb_id, fa->fa_type,
1950 xkey, KEYLENGTH - fa->fa_slen,
1951 fa->fa_tos, fa->fa_info, NLM_F_MULTI);
1952 if (err < 0) {
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001953 cb->args[4] = i;
David Ahern68647612017-05-15 23:19:17 -07001954 return err;
Robert Olsson19baf832005-06-21 12:43:18 -07001955 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001956 i++;
Robert Olsson19baf832005-06-21 12:43:18 -07001957 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001958
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001959 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001960 return skb->len;
1961}
1962
Alexander Duycka7e53532015-03-04 15:02:44 -08001963/* rcu_read_lock needs to be hold by caller from readside */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001964int fib_table_dump(struct fib_table *tb, struct sk_buff *skb,
1965 struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001966{
Alexander Duyck8be33e92015-03-04 14:59:19 -08001967 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001968 struct key_vector *l, *tp = t->kv;
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001969 /* Dump starting at last key.
1970 * Note: 0.0.0.0/0 (ie default) is first key.
1971 */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001972 int count = cb->args[2];
1973 t_key key = cb->args[3];
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001974
Alexander Duyck8be33e92015-03-04 14:59:19 -08001975 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
David Ahern68647612017-05-15 23:19:17 -07001976 int err;
1977
1978 err = fn_trie_dump_leaf(l, tb, skb, cb);
1979 if (err < 0) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001980 cb->args[3] = key;
1981 cb->args[2] = count;
David Ahern68647612017-05-15 23:19:17 -07001982 return err;
Robert Olsson19baf832005-06-21 12:43:18 -07001983 }
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001984
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001985 ++count;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001986 key = l->key + 1;
1987
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001988 memset(&cb->args[4], 0,
1989 sizeof(cb->args) - 4*sizeof(cb->args[0]));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001990
1991 /* stop loop if key wrapped back to 0 */
1992 if (key < l->key)
1993 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001994 }
Alexander Duyck8be33e92015-03-04 14:59:19 -08001995
Alexander Duyck8be33e92015-03-04 14:59:19 -08001996 cb->args[3] = key;
1997 cb->args[2] = count;
1998
Robert Olsson19baf832005-06-21 12:43:18 -07001999 return skb->len;
Robert Olsson19baf832005-06-21 12:43:18 -07002000}
2001
David S. Miller5348ba82011-02-01 15:30:56 -08002002void __init fib_trie_init(void)
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08002003{
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002004 fn_alias_kmem = kmem_cache_create("ip_fib_alias",
2005 sizeof(struct fib_alias),
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08002006 0, SLAB_PANIC, NULL);
2007
2008 trie_leaf_kmem = kmem_cache_create("ip_fib_trie",
Alexander Duyck41b489f2015-03-04 15:02:33 -08002009 LEAF_SIZE,
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08002010 0, SLAB_PANIC, NULL);
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08002011}
Robert Olsson19baf832005-06-21 12:43:18 -07002012
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002013struct fib_table *fib_trie_table(u32 id, struct fib_table *alias)
Robert Olsson19baf832005-06-21 12:43:18 -07002014{
2015 struct fib_table *tb;
2016 struct trie *t;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002017 size_t sz = sizeof(*tb);
Robert Olsson19baf832005-06-21 12:43:18 -07002018
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002019 if (!alias)
2020 sz += sizeof(struct trie);
2021
2022 tb = kzalloc(sz, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01002023 if (!tb)
Robert Olsson19baf832005-06-21 12:43:18 -07002024 return NULL;
2025
2026 tb->tb_id = id;
David S. Miller21d8c492011-04-14 14:49:37 -07002027 tb->tb_num_default = 0;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002028 tb->tb_data = (alias ? alias->__data : tb->__data);
2029
2030 if (alias)
2031 return tb;
Robert Olsson19baf832005-06-21 12:43:18 -07002032
2033 t = (struct trie *) tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002034 t->kv[0].pos = KEYLENGTH;
2035 t->kv[0].slen = KEYLENGTH;
Alexander Duyck8274a972014-12-31 10:55:29 -08002036#ifdef CONFIG_IP_FIB_TRIE_STATS
2037 t->stats = alloc_percpu(struct trie_use_stats);
2038 if (!t->stats) {
2039 kfree(tb);
2040 tb = NULL;
2041 }
2042#endif
Robert Olsson19baf832005-06-21 12:43:18 -07002043
Robert Olsson19baf832005-06-21 12:43:18 -07002044 return tb;
2045}
2046
Robert Olsson19baf832005-06-21 12:43:18 -07002047#ifdef CONFIG_PROC_FS
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002048/* Depth first Trie walk iterator */
2049struct fib_trie_iter {
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002050 struct seq_net_private p;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002051 struct fib_table *tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002052 struct key_vector *tnode;
Eric Dumazeta034ee32010-09-09 23:32:28 +00002053 unsigned int index;
2054 unsigned int depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002055};
Robert Olsson19baf832005-06-21 12:43:18 -07002056
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002057static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)
Robert Olsson19baf832005-06-21 12:43:18 -07002058{
Alexander Duyck98293e82014-12-31 10:56:18 -08002059 unsigned long cindex = iter->index;
Alexander Duyck88bae712015-03-06 09:54:52 -08002060 struct key_vector *pn = iter->tnode;
2061 t_key pkey;
Eric W. Biederman6640e692007-01-24 14:42:04 -08002062
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002063 pr_debug("get_next iter={node=%p index=%d depth=%d}\n",
2064 iter->tnode, iter->index, iter->depth);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002065
Alexander Duyck88bae712015-03-06 09:54:52 -08002066 while (!IS_TRIE(pn)) {
2067 while (cindex < child_length(pn)) {
2068 struct key_vector *n = get_child_rcu(pn, cindex++);
2069
2070 if (!n)
2071 continue;
2072
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002073 if (IS_LEAF(n)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08002074 iter->tnode = pn;
2075 iter->index = cindex;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002076 } else {
2077 /* push down one level */
Alexander Duyckadaf9812014-12-31 10:55:47 -08002078 iter->tnode = n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002079 iter->index = 0;
2080 ++iter->depth;
2081 }
Alexander Duyck88bae712015-03-06 09:54:52 -08002082
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002083 return n;
2084 }
2085
Alexander Duyck88bae712015-03-06 09:54:52 -08002086 /* Current node exhausted, pop back up */
2087 pkey = pn->key;
2088 pn = node_parent_rcu(pn);
2089 cindex = get_index(pkey, pn) + 1;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002090 --iter->depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002091 }
2092
Alexander Duyck88bae712015-03-06 09:54:52 -08002093 /* record root node so further searches know we are done */
2094 iter->tnode = pn;
2095 iter->index = 0;
2096
Robert Olsson19baf832005-06-21 12:43:18 -07002097 return NULL;
2098}
2099
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002100static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,
2101 struct trie *t)
Robert Olsson19baf832005-06-21 12:43:18 -07002102{
Firo Yangf38b24c2015-06-08 11:54:51 +08002103 struct key_vector *n, *pn;
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002104
Stephen Hemminger132adf52007-03-08 20:44:43 -08002105 if (!t)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002106 return NULL;
2107
Firo Yangf38b24c2015-06-08 11:54:51 +08002108 pn = t->kv;
Alexander Duyck88bae712015-03-06 09:54:52 -08002109 n = rcu_dereference(pn->tnode[0]);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002110 if (!n)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002111 return NULL;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002112
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002113 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002114 iter->tnode = n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002115 iter->index = 0;
2116 iter->depth = 1;
2117 } else {
Alexander Duyck88bae712015-03-06 09:54:52 -08002118 iter->tnode = pn;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002119 iter->index = 0;
2120 iter->depth = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002121 }
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002122
2123 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002124}
2125
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002126static void trie_collect_stats(struct trie *t, struct trie_stat *s)
Robert Olsson19baf832005-06-21 12:43:18 -07002127{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002128 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002129 struct fib_trie_iter iter;
Robert Olsson19baf832005-06-21 12:43:18 -07002130
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002131 memset(s, 0, sizeof(*s));
Robert Olsson19baf832005-06-21 12:43:18 -07002132
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002133 rcu_read_lock();
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002134 for (n = fib_trie_get_first(&iter, t); n; n = fib_trie_get_next(&iter)) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002135 if (IS_LEAF(n)) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002136 struct fib_alias *fa;
Stephen Hemminger93672292008-01-22 21:54:05 -08002137
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002138 s->leaves++;
2139 s->totdepth += iter.depth;
2140 if (iter.depth > s->maxdepth)
2141 s->maxdepth = iter.depth;
Stephen Hemminger93672292008-01-22 21:54:05 -08002142
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002143 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list)
Stephen Hemminger93672292008-01-22 21:54:05 -08002144 ++s->prefixes;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002145 } else {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002146 s->tnodes++;
Alexander Duyckadaf9812014-12-31 10:55:47 -08002147 if (n->bits < MAX_STAT_DEPTH)
2148 s->nodesizes[n->bits]++;
Alexander Duyck6e22d172015-03-06 09:54:39 -08002149 s->nullpointers += tn_info(n)->empty_children;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002150 }
2151 }
2152 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002153}
2154
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002155/*
Robert Olsson19baf832005-06-21 12:43:18 -07002156 * This outputs /proc/net/fib_triestats
Robert Olsson19baf832005-06-21 12:43:18 -07002157 */
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002158static void trie_show_stats(struct seq_file *seq, struct trie_stat *stat)
Robert Olsson19baf832005-06-21 12:43:18 -07002159{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002160 unsigned int i, max, pointers, bytes, avdepth;
Robert Olsson19baf832005-06-21 12:43:18 -07002161
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002162 if (stat->leaves)
2163 avdepth = stat->totdepth*100 / stat->leaves;
2164 else
2165 avdepth = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07002166
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002167 seq_printf(seq, "\tAver depth: %u.%02d\n",
2168 avdepth / 100, avdepth % 100);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002169 seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth);
Robert Olsson19baf832005-06-21 12:43:18 -07002170
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002171 seq_printf(seq, "\tLeaves: %u\n", stat->leaves);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002172 bytes = LEAF_SIZE * stat->leaves;
Stephen Hemminger93672292008-01-22 21:54:05 -08002173
2174 seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002175 bytes += sizeof(struct fib_alias) * stat->prefixes;
Stephen Hemminger93672292008-01-22 21:54:05 -08002176
Stephen Hemminger187b5182008-01-12 20:55:55 -08002177 seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002178 bytes += TNODE_SIZE(0) * stat->tnodes;
Robert Olsson19baf832005-06-21 12:43:18 -07002179
Robert Olsson06ef9212006-03-20 21:35:01 -08002180 max = MAX_STAT_DEPTH;
2181 while (max > 0 && stat->nodesizes[max-1] == 0)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002182 max--;
Robert Olsson19baf832005-06-21 12:43:18 -07002183
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002184 pointers = 0;
Jerry Snitselaarf585a992013-07-22 12:01:58 -07002185 for (i = 1; i < max; i++)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002186 if (stat->nodesizes[i] != 0) {
Stephen Hemminger187b5182008-01-12 20:55:55 -08002187 seq_printf(seq, " %u: %u", i, stat->nodesizes[i]);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002188 pointers += (1<<i) * stat->nodesizes[i];
2189 }
2190 seq_putc(seq, '\n');
Stephen Hemminger187b5182008-01-12 20:55:55 -08002191 seq_printf(seq, "\tPointers: %u\n", pointers);
Robert Olsson19baf832005-06-21 12:43:18 -07002192
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002193 bytes += sizeof(struct key_vector *) * pointers;
Stephen Hemminger187b5182008-01-12 20:55:55 -08002194 seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers);
2195 seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024);
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002196}
Robert Olsson19baf832005-06-21 12:43:18 -07002197
2198#ifdef CONFIG_IP_FIB_TRIE_STATS
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002199static void trie_show_usage(struct seq_file *seq,
Alexander Duyck8274a972014-12-31 10:55:29 -08002200 const struct trie_use_stats __percpu *stats)
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002201{
Alexander Duyck8274a972014-12-31 10:55:29 -08002202 struct trie_use_stats s = { 0 };
2203 int cpu;
2204
2205 /* loop through all of the CPUs and gather up the stats */
2206 for_each_possible_cpu(cpu) {
2207 const struct trie_use_stats *pcpu = per_cpu_ptr(stats, cpu);
2208
2209 s.gets += pcpu->gets;
2210 s.backtrack += pcpu->backtrack;
2211 s.semantic_match_passed += pcpu->semantic_match_passed;
2212 s.semantic_match_miss += pcpu->semantic_match_miss;
2213 s.null_node_hit += pcpu->null_node_hit;
2214 s.resize_node_skipped += pcpu->resize_node_skipped;
2215 }
2216
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002217 seq_printf(seq, "\nCounters:\n---------\n");
Alexander Duyck8274a972014-12-31 10:55:29 -08002218 seq_printf(seq, "gets = %u\n", s.gets);
2219 seq_printf(seq, "backtracks = %u\n", s.backtrack);
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002220 seq_printf(seq, "semantic match passed = %u\n",
Alexander Duyck8274a972014-12-31 10:55:29 -08002221 s.semantic_match_passed);
2222 seq_printf(seq, "semantic match miss = %u\n", s.semantic_match_miss);
2223 seq_printf(seq, "null node hit= %u\n", s.null_node_hit);
2224 seq_printf(seq, "skipped node resize = %u\n\n", s.resize_node_skipped);
Robert Olsson19baf832005-06-21 12:43:18 -07002225}
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002226#endif /* CONFIG_IP_FIB_TRIE_STATS */
2227
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002228static void fib_table_print(struct seq_file *seq, struct fib_table *tb)
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002229{
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002230 if (tb->tb_id == RT_TABLE_LOCAL)
2231 seq_puts(seq, "Local:\n");
2232 else if (tb->tb_id == RT_TABLE_MAIN)
2233 seq_puts(seq, "Main:\n");
2234 else
2235 seq_printf(seq, "Id %d:\n", tb->tb_id);
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002236}
Robert Olsson19baf832005-06-21 12:43:18 -07002237
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002238
Robert Olsson19baf832005-06-21 12:43:18 -07002239static int fib_triestat_seq_show(struct seq_file *seq, void *v)
2240{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002241 struct net *net = (struct net *)seq->private;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002242 unsigned int h;
Eric W. Biederman877a9bf2007-12-07 00:47:47 -08002243
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002244 seq_printf(seq,
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002245 "Basic info: size of leaf:"
2246 " %Zd bytes, size of tnode: %Zd bytes.\n",
Alexander Duyck41b489f2015-03-04 15:02:33 -08002247 LEAF_SIZE, TNODE_SIZE(0));
Olof Johansson91b9a272005-08-09 20:24:39 -07002248
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002249 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2250 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002251 struct fib_table *tb;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002252
Sasha Levinb67bfe02013-02-27 17:06:00 -08002253 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002254 struct trie *t = (struct trie *) tb->tb_data;
2255 struct trie_stat stat;
2256
2257 if (!t)
2258 continue;
2259
2260 fib_table_print(seq, tb);
2261
2262 trie_collect_stats(t, &stat);
2263 trie_show_stats(seq, &stat);
2264#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08002265 trie_show_usage(seq, t->stats);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002266#endif
2267 }
2268 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002269
Robert Olsson19baf832005-06-21 12:43:18 -07002270 return 0;
2271}
2272
Robert Olsson19baf832005-06-21 12:43:18 -07002273static int fib_triestat_seq_open(struct inode *inode, struct file *file)
2274{
Pavel Emelyanovde05c552008-07-18 04:07:21 -07002275 return single_open_net(inode, file, fib_triestat_seq_show);
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002276}
2277
Arjan van de Ven9a321442007-02-12 00:55:35 -08002278static const struct file_operations fib_triestat_fops = {
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002279 .owner = THIS_MODULE,
2280 .open = fib_triestat_seq_open,
2281 .read = seq_read,
2282 .llseek = seq_lseek,
Pavel Emelyanovb6fcbdb2008-07-18 04:07:44 -07002283 .release = single_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002284};
2285
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002286static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)
Robert Olsson19baf832005-06-21 12:43:18 -07002287{
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002288 struct fib_trie_iter *iter = seq->private;
2289 struct net *net = seq_file_net(seq);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002290 loff_t idx = 0;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002291 unsigned int h;
Robert Olsson19baf832005-06-21 12:43:18 -07002292
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002293 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2294 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002295 struct fib_table *tb;
2296
Sasha Levinb67bfe02013-02-27 17:06:00 -08002297 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002298 struct key_vector *n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002299
2300 for (n = fib_trie_get_first(iter,
2301 (struct trie *) tb->tb_data);
2302 n; n = fib_trie_get_next(iter))
2303 if (pos == idx++) {
2304 iter->tb = tb;
2305 return n;
2306 }
2307 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002308 }
Robert Olsson19baf832005-06-21 12:43:18 -07002309
Robert Olsson19baf832005-06-21 12:43:18 -07002310 return NULL;
2311}
2312
2313static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002314 __acquires(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002315{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002316 rcu_read_lock();
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002317 return fib_trie_get_idx(seq, *pos);
Robert Olsson19baf832005-06-21 12:43:18 -07002318}
2319
2320static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2321{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002322 struct fib_trie_iter *iter = seq->private;
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002323 struct net *net = seq_file_net(seq);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002324 struct fib_table *tb = iter->tb;
2325 struct hlist_node *tb_node;
2326 unsigned int h;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002327 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002328
Robert Olsson19baf832005-06-21 12:43:18 -07002329 ++*pos;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002330 /* next node in same table */
2331 n = fib_trie_get_next(iter);
2332 if (n)
2333 return n;
Olof Johansson91b9a272005-08-09 20:24:39 -07002334
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002335 /* walk rest of this hash chain */
2336 h = tb->tb_id & (FIB_TABLE_HASHSZ - 1);
Eric Dumazet0a5c0472011-03-31 01:51:35 -07002337 while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002338 tb = hlist_entry(tb_node, struct fib_table, tb_hlist);
2339 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2340 if (n)
2341 goto found;
2342 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002343
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002344 /* new hash chain */
2345 while (++h < FIB_TABLE_HASHSZ) {
2346 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Sasha Levinb67bfe02013-02-27 17:06:00 -08002347 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002348 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2349 if (n)
2350 goto found;
2351 }
2352 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002353 return NULL;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002354
2355found:
2356 iter->tb = tb;
2357 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002358}
2359
2360static void fib_trie_seq_stop(struct seq_file *seq, void *v)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002361 __releases(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002362{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002363 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002364}
2365
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002366static void seq_indent(struct seq_file *seq, int n)
2367{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002368 while (n-- > 0)
2369 seq_puts(seq, " ");
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002370}
Robert Olsson19baf832005-06-21 12:43:18 -07002371
Eric Dumazet28d36e32008-01-14 23:09:56 -08002372static inline const char *rtn_scope(char *buf, size_t len, enum rt_scope_t s)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002373{
Stephen Hemminger132adf52007-03-08 20:44:43 -08002374 switch (s) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002375 case RT_SCOPE_UNIVERSE: return "universe";
2376 case RT_SCOPE_SITE: return "site";
2377 case RT_SCOPE_LINK: return "link";
2378 case RT_SCOPE_HOST: return "host";
2379 case RT_SCOPE_NOWHERE: return "nowhere";
2380 default:
Eric Dumazet28d36e32008-01-14 23:09:56 -08002381 snprintf(buf, len, "scope=%d", s);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002382 return buf;
2383 }
2384}
2385
Jan Engelhardt36cbd3d2009-08-05 10:42:58 -07002386static const char *const rtn_type_names[__RTN_MAX] = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002387 [RTN_UNSPEC] = "UNSPEC",
2388 [RTN_UNICAST] = "UNICAST",
2389 [RTN_LOCAL] = "LOCAL",
2390 [RTN_BROADCAST] = "BROADCAST",
2391 [RTN_ANYCAST] = "ANYCAST",
2392 [RTN_MULTICAST] = "MULTICAST",
2393 [RTN_BLACKHOLE] = "BLACKHOLE",
2394 [RTN_UNREACHABLE] = "UNREACHABLE",
2395 [RTN_PROHIBIT] = "PROHIBIT",
2396 [RTN_THROW] = "THROW",
2397 [RTN_NAT] = "NAT",
2398 [RTN_XRESOLVE] = "XRESOLVE",
2399};
2400
Eric Dumazeta034ee32010-09-09 23:32:28 +00002401static inline const char *rtn_type(char *buf, size_t len, unsigned int t)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002402{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002403 if (t < __RTN_MAX && rtn_type_names[t])
2404 return rtn_type_names[t];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002405 snprintf(buf, len, "type %u", t);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002406 return buf;
2407}
2408
2409/* Pretty print the trie */
Robert Olsson19baf832005-06-21 12:43:18 -07002410static int fib_trie_seq_show(struct seq_file *seq, void *v)
2411{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002412 const struct fib_trie_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002413 struct key_vector *n = v;
Robert Olsson19baf832005-06-21 12:43:18 -07002414
Alexander Duyck88bae712015-03-06 09:54:52 -08002415 if (IS_TRIE(node_parent_rcu(n)))
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002416 fib_table_print(seq, iter->tb);
Robert Olsson095b8502007-01-26 19:06:01 -08002417
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002418 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002419 __be32 prf = htonl(n->key);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002420
Alexander Duycke9b44012014-12-31 10:56:12 -08002421 seq_indent(seq, iter->depth-1);
2422 seq_printf(seq, " +-- %pI4/%zu %u %u %u\n",
2423 &prf, KEYLENGTH - n->pos - n->bits, n->bits,
Alexander Duyck6e22d172015-03-06 09:54:39 -08002424 tn_info(n)->full_children,
2425 tn_info(n)->empty_children);
Olof Johansson91b9a272005-08-09 20:24:39 -07002426 } else {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002427 __be32 val = htonl(n->key);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002428 struct fib_alias *fa;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002429
2430 seq_indent(seq, iter->depth);
Harvey Harrison673d57e2008-10-31 00:53:57 -07002431 seq_printf(seq, " |-- %pI4\n", &val);
Eric Dumazet28d36e32008-01-14 23:09:56 -08002432
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002433 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
2434 char buf1[32], buf2[32];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002435
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002436 seq_indent(seq, iter->depth + 1);
2437 seq_printf(seq, " /%zu %s %s",
2438 KEYLENGTH - fa->fa_slen,
2439 rtn_scope(buf1, sizeof(buf1),
2440 fa->fa_info->fib_scope),
2441 rtn_type(buf2, sizeof(buf2),
2442 fa->fa_type));
2443 if (fa->fa_tos)
2444 seq_printf(seq, " tos=%d", fa->fa_tos);
2445 seq_putc(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002446 }
Robert Olsson19baf832005-06-21 12:43:18 -07002447 }
2448
2449 return 0;
2450}
2451
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002452static const struct seq_operations fib_trie_seq_ops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002453 .start = fib_trie_seq_start,
2454 .next = fib_trie_seq_next,
2455 .stop = fib_trie_seq_stop,
2456 .show = fib_trie_seq_show,
Robert Olsson19baf832005-06-21 12:43:18 -07002457};
2458
2459static int fib_trie_seq_open(struct inode *inode, struct file *file)
2460{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002461 return seq_open_net(inode, file, &fib_trie_seq_ops,
2462 sizeof(struct fib_trie_iter));
Robert Olsson19baf832005-06-21 12:43:18 -07002463}
2464
Arjan van de Ven9a321442007-02-12 00:55:35 -08002465static const struct file_operations fib_trie_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002466 .owner = THIS_MODULE,
2467 .open = fib_trie_seq_open,
2468 .read = seq_read,
2469 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002470 .release = seq_release_net,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002471};
2472
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002473struct fib_route_iter {
2474 struct seq_net_private p;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002475 struct fib_table *main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002476 struct key_vector *tnode;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002477 loff_t pos;
2478 t_key key;
2479};
2480
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002481static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,
2482 loff_t pos)
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002483{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002484 struct key_vector *l, **tp = &iter->tnode;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002485 t_key key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002486
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002487 /* use cached location of previously found key */
Alexander Duyck8be33e92015-03-04 14:59:19 -08002488 if (iter->pos > 0 && pos >= iter->pos) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08002489 key = iter->key;
2490 } else {
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002491 iter->pos = 1;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002492 key = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002493 }
2494
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002495 pos -= iter->pos;
2496
2497 while ((l = leaf_walk_rcu(tp, key)) && (pos-- > 0)) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08002498 key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002499 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002500 l = NULL;
2501
2502 /* handle unlikely case of a key wrap */
2503 if (!key)
2504 break;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002505 }
2506
2507 if (l)
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002508 iter->key = l->key; /* remember it */
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002509 else
2510 iter->pos = 0; /* forget it */
2511
2512 return l;
2513}
2514
2515static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos)
2516 __acquires(RCU)
2517{
2518 struct fib_route_iter *iter = seq->private;
2519 struct fib_table *tb;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002520 struct trie *t;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002521
2522 rcu_read_lock();
Alexander Duyck8be33e92015-03-04 14:59:19 -08002523
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002524 tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN);
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002525 if (!tb)
2526 return NULL;
2527
Alexander Duyck8be33e92015-03-04 14:59:19 -08002528 iter->main_tb = tb;
David Forster94d9f1c2016-08-03 15:13:01 +01002529 t = (struct trie *)tb->tb_data;
2530 iter->tnode = t->kv;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002531
2532 if (*pos != 0)
2533 return fib_route_get_idx(iter, *pos);
2534
Alexander Duyck8be33e92015-03-04 14:59:19 -08002535 iter->pos = 0;
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002536 iter->key = KEY_MAX;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002537
2538 return SEQ_START_TOKEN;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002539}
2540
2541static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2542{
2543 struct fib_route_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002544 struct key_vector *l = NULL;
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002545 t_key key = iter->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002546
2547 ++*pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002548
2549 /* only allow key of 0 for start of sequence */
2550 if ((v == SEQ_START_TOKEN) || key)
2551 l = leaf_walk_rcu(&iter->tnode, key);
2552
2553 if (l) {
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002554 iter->key = l->key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002555 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002556 } else {
2557 iter->pos = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002558 }
2559
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002560 return l;
2561}
2562
2563static void fib_route_seq_stop(struct seq_file *seq, void *v)
2564 __releases(RCU)
2565{
2566 rcu_read_unlock();
2567}
2568
Eric Dumazeta034ee32010-09-09 23:32:28 +00002569static unsigned int fib_flag_trans(int type, __be32 mask, const struct fib_info *fi)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002570{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002571 unsigned int flags = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002572
Eric Dumazeta034ee32010-09-09 23:32:28 +00002573 if (type == RTN_UNREACHABLE || type == RTN_PROHIBIT)
2574 flags = RTF_REJECT;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002575 if (fi && fi->fib_nh->nh_gw)
2576 flags |= RTF_GATEWAY;
Al Viro32ab5f82006-09-26 22:21:45 -07002577 if (mask == htonl(0xFFFFFFFF))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002578 flags |= RTF_HOST;
2579 flags |= RTF_UP;
2580 return flags;
2581}
2582
2583/*
2584 * This outputs /proc/net/route.
2585 * The format of the file is not supposed to be changed
Eric Dumazeta034ee32010-09-09 23:32:28 +00002586 * and needs to be same as fib_hash output to avoid breaking
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002587 * legacy utilities
2588 */
2589static int fib_route_seq_show(struct seq_file *seq, void *v)
2590{
Alexander Duyck654eff42015-03-11 16:36:08 -07002591 struct fib_route_iter *iter = seq->private;
2592 struct fib_table *tb = iter->main_tb;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002593 struct fib_alias *fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002594 struct key_vector *l = v;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002595 __be32 prefix;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002596
2597 if (v == SEQ_START_TOKEN) {
2598 seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway "
2599 "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU"
2600 "\tWindow\tIRTT");
2601 return 0;
2602 }
2603
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002604 prefix = htonl(l->key);
2605
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002606 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2607 const struct fib_info *fi = fa->fa_info;
2608 __be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen);
2609 unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002610
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002611 if ((fa->fa_type == RTN_BROADCAST) ||
2612 (fa->fa_type == RTN_MULTICAST))
2613 continue;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002614
Alexander Duyck654eff42015-03-11 16:36:08 -07002615 if (fa->tb_id != tb->tb_id)
2616 continue;
2617
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002618 seq_setwidth(seq, 127);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002619
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002620 if (fi)
2621 seq_printf(seq,
2622 "%s\t%08X\t%08X\t%04X\t%d\t%u\t"
2623 "%d\t%08X\t%d\t%u\t%u",
2624 fi->fib_dev ? fi->fib_dev->name : "*",
2625 prefix,
2626 fi->fib_nh->nh_gw, flags, 0, 0,
2627 fi->fib_priority,
2628 mask,
2629 (fi->fib_advmss ?
2630 fi->fib_advmss + 40 : 0),
2631 fi->fib_window,
2632 fi->fib_rtt >> 3);
2633 else
2634 seq_printf(seq,
2635 "*\t%08X\t%08X\t%04X\t%d\t%u\t"
2636 "%d\t%08X\t%d\t%u\t%u",
2637 prefix, 0, flags, 0, 0, 0,
2638 mask, 0, 0, 0);
Tetsuo Handa652586d2013-11-14 14:31:57 -08002639
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002640 seq_pad(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002641 }
2642
2643 return 0;
2644}
2645
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002646static const struct seq_operations fib_route_seq_ops = {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002647 .start = fib_route_seq_start,
2648 .next = fib_route_seq_next,
2649 .stop = fib_route_seq_stop,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002650 .show = fib_route_seq_show,
2651};
2652
2653static int fib_route_seq_open(struct inode *inode, struct file *file)
2654{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002655 return seq_open_net(inode, file, &fib_route_seq_ops,
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002656 sizeof(struct fib_route_iter));
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002657}
2658
Arjan van de Ven9a321442007-02-12 00:55:35 -08002659static const struct file_operations fib_route_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002660 .owner = THIS_MODULE,
2661 .open = fib_route_seq_open,
2662 .read = seq_read,
2663 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002664 .release = seq_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002665};
2666
Denis V. Lunev61a02652008-01-10 03:21:09 -08002667int __net_init fib_proc_init(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002668{
Gao fengd4beaa62013-02-18 01:34:54 +00002669 if (!proc_create("fib_trie", S_IRUGO, net->proc_net, &fib_trie_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002670 goto out1;
2671
Gao fengd4beaa62013-02-18 01:34:54 +00002672 if (!proc_create("fib_triestat", S_IRUGO, net->proc_net,
2673 &fib_triestat_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002674 goto out2;
2675
Gao fengd4beaa62013-02-18 01:34:54 +00002676 if (!proc_create("route", S_IRUGO, net->proc_net, &fib_route_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002677 goto out3;
2678
Robert Olsson19baf832005-06-21 12:43:18 -07002679 return 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002680
2681out3:
Gao fengece31ff2013-02-18 01:34:56 +00002682 remove_proc_entry("fib_triestat", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002683out2:
Gao fengece31ff2013-02-18 01:34:56 +00002684 remove_proc_entry("fib_trie", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002685out1:
2686 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07002687}
2688
Denis V. Lunev61a02652008-01-10 03:21:09 -08002689void __net_exit fib_proc_exit(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002690{
Gao fengece31ff2013-02-18 01:34:56 +00002691 remove_proc_entry("fib_trie", net->proc_net);
2692 remove_proc_entry("fib_triestat", net->proc_net);
2693 remove_proc_entry("route", net->proc_net);
Robert Olsson19baf832005-06-21 12:43:18 -07002694}
2695
2696#endif /* CONFIG_PROC_FS */