blob: 15d32612e3c6f134a533034aa4d7f74fa52da51b [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>
Eric W. Biederman457c4cb2007-09-12 12:01:34 +020076#include <net/net_namespace.h>
Robert Olsson19baf832005-06-21 12:43:18 -070077#include <net/ip.h>
78#include <net/protocol.h>
79#include <net/route.h>
80#include <net/tcp.h>
81#include <net/sock.h>
82#include <net/ip_fib.h>
Scott Feldman8e05fd72015-03-05 21:21:19 -080083#include <net/switchdev.h>
Robert Olsson19baf832005-06-21 12:43:18 -070084#include "fib_lookup.h"
85
Robert Olsson06ef9212006-03-20 21:35:01 -080086#define MAX_STAT_DEPTH 32
Robert Olsson19baf832005-06-21 12:43:18 -070087
Alexander Duyck95f60ea2015-01-22 15:51:26 -080088#define KEYLENGTH (8*sizeof(t_key))
89#define KEY_MAX ((t_key)~0)
Robert Olsson19baf832005-06-21 12:43:18 -070090
Robert Olsson19baf832005-06-21 12:43:18 -070091typedef unsigned int t_key;
92
Alexander Duyck88bae712015-03-06 09:54:52 -080093#define IS_TRIE(n) ((n)->pos >= KEYLENGTH)
94#define IS_TNODE(n) ((n)->bits)
95#define IS_LEAF(n) (!(n)->bits)
Robert Olsson2373ce12005-08-25 13:01:29 -070096
Alexander Duyck35c6eda2015-03-06 09:54:08 -080097struct key_vector {
Alexander Duyck41b489f2015-03-04 15:02:33 -080098 t_key key;
99 unsigned char pos; /* 2log(KEYLENGTH) bits needed */
100 unsigned char bits; /* 2log(KEYLENGTH) bits needed */
101 unsigned char slen;
Alexander Duyckadaf9812014-12-31 10:55:47 -0800102 union {
Alexander Duyck41b489f2015-03-04 15:02:33 -0800103 /* This list pointer if valid if (pos | bits) == 0 (LEAF) */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800104 struct hlist_head leaf;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800105 /* This array is valid if (pos | bits) > 0 (TNODE) */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800106 struct key_vector __rcu *tnode[0];
Alexander Duyckadaf9812014-12-31 10:55:47 -0800107 };
Robert Olsson19baf832005-06-21 12:43:18 -0700108};
109
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800110struct tnode {
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800111 struct rcu_head rcu;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800112 t_key empty_children; /* KEYLENGTH bits needed */
113 t_key full_children; /* KEYLENGTH bits needed */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800114 struct key_vector __rcu *parent;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800115 struct key_vector kv[1];
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800116#define tn_bits kv[0].bits
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800117};
118
119#define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n])
Alexander Duyck41b489f2015-03-04 15:02:33 -0800120#define LEAF_SIZE TNODE_SIZE(1)
121
Robert Olsson19baf832005-06-21 12:43:18 -0700122#ifdef CONFIG_IP_FIB_TRIE_STATS
123struct trie_use_stats {
124 unsigned int gets;
125 unsigned int backtrack;
126 unsigned int semantic_match_passed;
127 unsigned int semantic_match_miss;
128 unsigned int null_node_hit;
Robert Olsson2f368952005-07-05 15:02:40 -0700129 unsigned int resize_node_skipped;
Robert Olsson19baf832005-06-21 12:43:18 -0700130};
131#endif
132
133struct trie_stat {
134 unsigned int totdepth;
135 unsigned int maxdepth;
136 unsigned int tnodes;
137 unsigned int leaves;
138 unsigned int nullpointers;
Stephen Hemminger93672292008-01-22 21:54:05 -0800139 unsigned int prefixes;
Robert Olsson06ef9212006-03-20 21:35:01 -0800140 unsigned int nodesizes[MAX_STAT_DEPTH];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700141};
Robert Olsson19baf832005-06-21 12:43:18 -0700142
143struct trie {
Alexander Duyck88bae712015-03-06 09:54:52 -0800144 struct key_vector kv[1];
Robert Olsson19baf832005-06-21 12:43:18 -0700145#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -0800146 struct trie_use_stats __percpu *stats;
Robert Olsson19baf832005-06-21 12:43:18 -0700147#endif
Robert Olsson19baf832005-06-21 12:43:18 -0700148};
149
Alexander Duyck88bae712015-03-06 09:54:52 -0800150static struct key_vector *resize(struct trie *t, struct key_vector *tn);
Jarek Poplawskic3059472009-07-14 08:33:08 +0000151static size_t tnode_free_size;
152
153/*
154 * synchronize_rcu after call_rcu for that many pages; it should be especially
155 * useful before resizing the root node with PREEMPT_NONE configs; the value was
156 * obtained experimentally, aiming to avoid visible slowdown.
157 */
158static const int sync_pages = 128;
Robert Olsson19baf832005-06-21 12:43:18 -0700159
Christoph Lametere18b8902006-12-06 20:33:20 -0800160static struct kmem_cache *fn_alias_kmem __read_mostly;
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -0800161static struct kmem_cache *trie_leaf_kmem __read_mostly;
Robert Olsson19baf832005-06-21 12:43:18 -0700162
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800163static inline struct tnode *tn_info(struct key_vector *kv)
164{
165 return container_of(kv, struct tnode, kv[0]);
166}
167
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800168/* caller must hold RTNL */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800169#define node_parent(tn) rtnl_dereference(tn_info(tn)->parent)
Alexander Duyck754baf82015-03-06 09:54:14 -0800170#define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700171
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800172/* caller must hold RCU read lock or RTNL */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800173#define node_parent_rcu(tn) rcu_dereference_rtnl(tn_info(tn)->parent)
Alexander Duyck754baf82015-03-06 09:54:14 -0800174#define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700175
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800176/* wrapper for rcu_assign_pointer */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800177static inline void node_set_parent(struct key_vector *n, struct key_vector *tp)
Stephen Hemminger06801912007-08-10 15:22:13 -0700178{
Alexander Duyckadaf9812014-12-31 10:55:47 -0800179 if (n)
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800180 rcu_assign_pointer(tn_info(n)->parent, tp);
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800181}
182
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800183#define NODE_INIT_PARENT(n, p) RCU_INIT_POINTER(tn_info(n)->parent, p)
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800184
185/* This provides us with the number of children in this node, in the case of a
186 * leaf this will return 0 meaning none of the children are accessible.
187 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800188static inline unsigned long child_length(const struct key_vector *tn)
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800189{
190 return (1ul << tn->bits) & ~(1ul);
Stephen Hemminger06801912007-08-10 15:22:13 -0700191}
Robert Olsson2373ce12005-08-25 13:01:29 -0700192
Alexander Duyck88bae712015-03-06 09:54:52 -0800193#define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos)
194
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800195static inline unsigned long get_index(t_key key, struct key_vector *kv)
196{
197 unsigned long index = key ^ kv->key;
198
Alexander Duyck88bae712015-03-06 09:54:52 -0800199 if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos))
200 return 0;
201
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800202 return index >> kv->pos;
203}
204
Alexander Duycke9b44012014-12-31 10:56:12 -0800205/* To understand this stuff, an understanding of keys and all their bits is
206 * necessary. Every node in the trie has a key associated with it, but not
207 * all of the bits in that key are significant.
208 *
209 * Consider a node 'n' and its parent 'tp'.
210 *
211 * If n is a leaf, every bit in its key is significant. Its presence is
212 * necessitated by path compression, since during a tree traversal (when
213 * searching for a leaf - unless we are doing an insertion) we will completely
214 * ignore all skipped bits we encounter. Thus we need to verify, at the end of
215 * a potentially successful search, that we have indeed been walking the
216 * correct key path.
217 *
218 * Note that we can never "miss" the correct key in the tree if present by
219 * following the wrong path. Path compression ensures that segments of the key
220 * that are the same for all keys with a given prefix are skipped, but the
221 * skipped part *is* identical for each node in the subtrie below the skipped
222 * bit! trie_insert() in this implementation takes care of that.
223 *
224 * if n is an internal node - a 'tnode' here, the various parts of its key
225 * have many different meanings.
226 *
227 * Example:
228 * _________________________________________________________________
229 * | i | i | i | i | i | i | i | N | N | N | S | S | S | S | S | C |
230 * -----------------------------------------------------------------
231 * 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16
232 *
233 * _________________________________________________________________
234 * | C | C | C | u | u | u | u | u | u | u | u | u | u | u | u | u |
235 * -----------------------------------------------------------------
236 * 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
237 *
238 * tp->pos = 22
239 * tp->bits = 3
240 * n->pos = 13
241 * n->bits = 4
242 *
243 * First, let's just ignore the bits that come before the parent tp, that is
244 * the bits from (tp->pos + tp->bits) to 31. They are *known* but at this
245 * point we do not use them for anything.
246 *
247 * The bits from (tp->pos) to (tp->pos + tp->bits - 1) - "N", above - are the
248 * index into the parent's child array. That is, they will be used to find
249 * 'n' among tp's children.
250 *
251 * The bits from (n->pos + n->bits) to (tn->pos - 1) - "S" - are skipped bits
252 * for the node n.
253 *
254 * All the bits we have seen so far are significant to the node n. The rest
255 * of the bits are really not needed or indeed known in n->key.
256 *
257 * The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into
258 * n's child array, and will of course be different for each child.
259 *
260 * The rest of the bits, from 0 to (n->pos + n->bits), are completely unknown
261 * at this point.
262 */
Robert Olsson19baf832005-06-21 12:43:18 -0700263
Denis V. Lunevf5026fa2007-12-13 09:47:57 -0800264static const int halve_threshold = 25;
265static const int inflate_threshold = 50;
Jarek Poplawski345aa032009-07-07 19:39:16 -0700266static const int halve_threshold_root = 15;
Jens Låås80b71b82009-08-28 23:57:15 -0700267static const int inflate_threshold_root = 30;
Robert Olsson2373ce12005-08-25 13:01:29 -0700268
269static void __alias_free_mem(struct rcu_head *head)
270{
271 struct fib_alias *fa = container_of(head, struct fib_alias, rcu);
272 kmem_cache_free(fn_alias_kmem, fa);
273}
274
275static inline void alias_free_mem_rcu(struct fib_alias *fa)
276{
277 call_rcu(&fa->rcu, __alias_free_mem);
278}
279
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800280#define TNODE_KMALLOC_MAX \
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800281 ilog2((PAGE_SIZE - TNODE_SIZE(0)) / sizeof(struct key_vector *))
Alexander Duyck1de3d872015-03-04 15:04:46 -0800282#define TNODE_VMALLOC_MAX \
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800283 ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800284
285static void __node_free_rcu(struct rcu_head *head)
Robert Olsson2373ce12005-08-25 13:01:29 -0700286{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800287 struct tnode *n = container_of(head, struct tnode, rcu);
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800288
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800289 if (!n->tn_bits)
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800290 kmem_cache_free(trie_leaf_kmem, n);
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800291 else if (n->tn_bits <= TNODE_KMALLOC_MAX)
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800292 kfree(n);
293 else
294 vfree(n);
Robert Olsson2373ce12005-08-25 13:01:29 -0700295}
296
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800297#define node_free(n) call_rcu(&tn_info(n)->rcu, __node_free_rcu)
Stephen Hemminger387a5482008-04-10 03:47:34 -0700298
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800299static struct tnode *tnode_alloc(int bits)
Robert Olsson2373ce12005-08-25 13:01:29 -0700300{
Alexander Duyck1de3d872015-03-04 15:04:46 -0800301 size_t size;
302
303 /* verify bits is within bounds */
304 if (bits > TNODE_VMALLOC_MAX)
305 return NULL;
306
307 /* determine size and verify it is non-zero and didn't overflow */
308 size = TNODE_SIZE(1ul << bits);
309
Robert Olsson2373ce12005-08-25 13:01:29 -0700310 if (size <= PAGE_SIZE)
Eric Dumazet8d965442008-01-13 22:31:44 -0800311 return kzalloc(size, GFP_KERNEL);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700312 else
Eric Dumazet7a1c8e52010-11-20 07:46:35 +0000313 return vzalloc(size);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700314}
Robert Olsson2373ce12005-08-25 13:01:29 -0700315
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800316static inline void empty_child_inc(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800317{
Alexander Duyck6e22d172015-03-06 09:54:39 -0800318 ++tn_info(n)->empty_children ? : ++tn_info(n)->full_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800319}
320
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800321static inline void empty_child_dec(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800322{
Alexander Duyck6e22d172015-03-06 09:54:39 -0800323 tn_info(n)->empty_children-- ? : tn_info(n)->full_children--;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800324}
325
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800326static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)
Robert Olsson19baf832005-06-21 12:43:18 -0700327{
Firo Yangf38b24c2015-06-08 11:54:51 +0800328 struct key_vector *l;
329 struct tnode *kv;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800330
Firo Yangf38b24c2015-06-08 11:54:51 +0800331 kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800332 if (!kv)
333 return NULL;
334
335 /* initialize key vector */
Firo Yangf38b24c2015-06-08 11:54:51 +0800336 l = kv->kv;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800337 l->key = key;
338 l->pos = 0;
339 l->bits = 0;
340 l->slen = fa->fa_slen;
341
342 /* link leaf to fib alias */
343 INIT_HLIST_HEAD(&l->leaf);
344 hlist_add_head(&fa->fa_list, &l->leaf);
345
Robert Olsson19baf832005-06-21 12:43:18 -0700346 return l;
347}
348
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800349static struct key_vector *tnode_new(t_key key, int pos, int bits)
Robert Olsson19baf832005-06-21 12:43:18 -0700350{
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800351 unsigned int shift = pos + bits;
Firo Yangf38b24c2015-06-08 11:54:51 +0800352 struct key_vector *tn;
353 struct tnode *tnode;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800354
355 /* verify bits and pos their msb bits clear and values are valid */
356 BUG_ON(!bits || (shift > KEYLENGTH));
Robert Olsson19baf832005-06-21 12:43:18 -0700357
Firo Yangf38b24c2015-06-08 11:54:51 +0800358 tnode = tnode_alloc(bits);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800359 if (!tnode)
360 return NULL;
361
Firo Yangf38b24c2015-06-08 11:54:51 +0800362 pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0),
363 sizeof(struct key_vector *) << bits);
364
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800365 if (bits == KEYLENGTH)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800366 tnode->full_children = 1;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800367 else
Alexander Duyck6e22d172015-03-06 09:54:39 -0800368 tnode->empty_children = 1ul << bits;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800369
Firo Yangf38b24c2015-06-08 11:54:51 +0800370 tn = tnode->kv;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800371 tn->key = (shift < KEYLENGTH) ? (key >> shift) << shift : 0;
372 tn->pos = pos;
373 tn->bits = bits;
374 tn->slen = pos;
375
Robert Olsson19baf832005-06-21 12:43:18 -0700376 return tn;
377}
378
Alexander Duycke9b44012014-12-31 10:56:12 -0800379/* Check whether a tnode 'n' is "full", i.e. it is an internal node
Robert Olsson19baf832005-06-21 12:43:18 -0700380 * and no bits are skipped. See discussion in dyntree paper p. 6
381 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800382static inline int tnode_full(struct key_vector *tn, struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700383{
Alexander Duycke9b44012014-12-31 10:56:12 -0800384 return n && ((n->pos + n->bits) == tn->pos) && IS_TNODE(n);
Robert Olsson19baf832005-06-21 12:43:18 -0700385}
386
Alexander Duyckff181ed2014-12-31 10:56:43 -0800387/* Add a child at position i overwriting the old value.
388 * Update the value of full_children and empty_children.
389 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800390static void put_child(struct key_vector *tn, unsigned long i,
391 struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700392{
Alexander Duyck754baf82015-03-06 09:54:14 -0800393 struct key_vector *chi = get_child(tn, i);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800394 int isfull, wasfull;
Robert Olsson19baf832005-06-21 12:43:18 -0700395
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800396 BUG_ON(i >= child_length(tn));
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700397
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800398 /* update emptyChildren, overflow into fullChildren */
Ian Morris00db4122015-04-03 09:17:27 +0100399 if (!n && chi)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800400 empty_child_inc(tn);
Ian Morris00db4122015-04-03 09:17:27 +0100401 if (n && !chi)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800402 empty_child_dec(tn);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700403
Robert Olsson19baf832005-06-21 12:43:18 -0700404 /* update fullChildren */
Alexander Duyckff181ed2014-12-31 10:56:43 -0800405 wasfull = tnode_full(tn, chi);
Robert Olsson19baf832005-06-21 12:43:18 -0700406 isfull = tnode_full(tn, n);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800407
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700408 if (wasfull && !isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800409 tn_info(tn)->full_children--;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700410 else if (!wasfull && isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800411 tn_info(tn)->full_children++;
Olof Johansson91b9a272005-08-09 20:24:39 -0700412
Alexander Duyck5405afd2014-12-31 10:57:08 -0800413 if (n && (tn->slen < n->slen))
414 tn->slen = n->slen;
415
Alexander Duyck41b489f2015-03-04 15:02:33 -0800416 rcu_assign_pointer(tn->tnode[i], n);
Robert Olsson19baf832005-06-21 12:43:18 -0700417}
418
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800419static void update_children(struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800420{
421 unsigned long i;
422
423 /* update all of the child parent pointers */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800424 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800425 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800426
427 if (!inode)
428 continue;
429
430 /* Either update the children of a tnode that
431 * already belongs to us or update the child
432 * to point to ourselves.
433 */
434 if (node_parent(inode) == tn)
435 update_children(inode);
436 else
437 node_set_parent(inode, tn);
438 }
439}
440
Alexander Duyck88bae712015-03-06 09:54:52 -0800441static inline void put_child_root(struct key_vector *tp, t_key key,
442 struct key_vector *n)
Alexander Duyck836a0122014-12-31 10:56:06 -0800443{
Alexander Duyck88bae712015-03-06 09:54:52 -0800444 if (IS_TRIE(tp))
445 rcu_assign_pointer(tp->tnode[0], n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800446 else
Alexander Duyck88bae712015-03-06 09:54:52 -0800447 put_child(tp, get_index(key, tp), n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800448}
449
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800450static inline void tnode_free_init(struct key_vector *tn)
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700451{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800452 tn_info(tn)->rcu.next = NULL;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800453}
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700454
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800455static inline void tnode_free_append(struct key_vector *tn,
456 struct key_vector *n)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800457{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800458 tn_info(n)->rcu.next = tn_info(tn)->rcu.next;
459 tn_info(tn)->rcu.next = &tn_info(n)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800460}
461
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800462static void tnode_free(struct key_vector *tn)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800463{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800464 struct callback_head *head = &tn_info(tn)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800465
466 while (head) {
467 head = head->next;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800468 tnode_free_size += TNODE_SIZE(1ul << tn->bits);
Alexander Duyckfc86a932014-12-31 10:56:49 -0800469 node_free(tn);
470
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800471 tn = container_of(head, struct tnode, rcu)->kv;
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700472 }
Alexander Duyckfc86a932014-12-31 10:56:49 -0800473
474 if (tnode_free_size >= PAGE_SIZE * sync_pages) {
475 tnode_free_size = 0;
476 synchronize_rcu();
477 }
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700478}
479
Alexander Duyck88bae712015-03-06 09:54:52 -0800480static struct key_vector *replace(struct trie *t,
481 struct key_vector *oldtnode,
482 struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800483{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800484 struct key_vector *tp = node_parent(oldtnode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800485 unsigned long i;
486
487 /* setup the parent pointer out of and back into this node */
488 NODE_INIT_PARENT(tn, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -0800489 put_child_root(tp, tn->key, tn);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800490
491 /* update all of the child parent pointers */
492 update_children(tn);
493
494 /* all pointers should be clean so we are done */
495 tnode_free(oldtnode);
496
497 /* resize children now that oldtnode is freed */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800498 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800499 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800500
501 /* resize child node */
502 if (tnode_full(tn, inode))
Alexander Duyck88bae712015-03-06 09:54:52 -0800503 tn = resize(t, inode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800504 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800505
Alexander Duyck88bae712015-03-06 09:54:52 -0800506 return tp;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800507}
508
Alexander Duyck88bae712015-03-06 09:54:52 -0800509static struct key_vector *inflate(struct trie *t,
510 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700511{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800512 struct key_vector *tn;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800513 unsigned long i;
Alexander Duycke9b44012014-12-31 10:56:12 -0800514 t_key m;
Robert Olsson19baf832005-06-21 12:43:18 -0700515
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700516 pr_debug("In inflate\n");
Robert Olsson19baf832005-06-21 12:43:18 -0700517
Alexander Duycke9b44012014-12-31 10:56:12 -0800518 tn = tnode_new(oldtnode->key, oldtnode->pos - 1, oldtnode->bits + 1);
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700519 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800520 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700521
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800522 /* prepare oldtnode to be freed */
523 tnode_free_init(oldtnode);
524
Alexander Duyck12c081a2014-12-31 10:56:55 -0800525 /* Assemble all of the pointers in our cluster, in this case that
526 * represents all of the pointers out of our allocated nodes that
527 * point to existing tnodes and the links between our allocated
528 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700529 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800530 for (i = child_length(oldtnode), m = 1u << tn->pos; i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800531 struct key_vector *inode = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800532 struct key_vector *node0, *node1;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800533 unsigned long j, k;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700534
Robert Olsson19baf832005-06-21 12:43:18 -0700535 /* An empty child */
Ian Morris51456b22015-04-03 09:17:26 +0100536 if (!inode)
Robert Olsson19baf832005-06-21 12:43:18 -0700537 continue;
538
539 /* A leaf or an internal node with skipped bits */
Alexander Duyckadaf9812014-12-31 10:55:47 -0800540 if (!tnode_full(oldtnode, inode)) {
Alexander Duycke9b44012014-12-31 10:56:12 -0800541 put_child(tn, get_index(inode->key, tn), inode);
Robert Olsson19baf832005-06-21 12:43:18 -0700542 continue;
543 }
544
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800545 /* drop the node in the old tnode free list */
546 tnode_free_append(oldtnode, inode);
547
Robert Olsson19baf832005-06-21 12:43:18 -0700548 /* An internal node with two children */
Robert Olsson19baf832005-06-21 12:43:18 -0700549 if (inode->bits == 1) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800550 put_child(tn, 2 * i + 1, get_child(inode, 1));
551 put_child(tn, 2 * i, get_child(inode, 0));
Olof Johansson91b9a272005-08-09 20:24:39 -0700552 continue;
Robert Olsson19baf832005-06-21 12:43:18 -0700553 }
554
Olof Johansson91b9a272005-08-09 20:24:39 -0700555 /* We will replace this node 'inode' with two new
Alexander Duyck12c081a2014-12-31 10:56:55 -0800556 * ones, 'node0' and 'node1', each with half of the
Olof Johansson91b9a272005-08-09 20:24:39 -0700557 * original children. The two new nodes will have
558 * a position one bit further down the key and this
559 * means that the "significant" part of their keys
560 * (see the discussion near the top of this file)
561 * will differ by one bit, which will be "0" in
Alexander Duyck12c081a2014-12-31 10:56:55 -0800562 * node0's key and "1" in node1's key. Since we are
Olof Johansson91b9a272005-08-09 20:24:39 -0700563 * moving the key position by one step, the bit that
564 * we are moving away from - the bit at position
Alexander Duyck12c081a2014-12-31 10:56:55 -0800565 * (tn->pos) - is the one that will differ between
566 * node0 and node1. So... we synthesize that bit in the
567 * two new keys.
Olof Johansson91b9a272005-08-09 20:24:39 -0700568 */
Alexander Duyck12c081a2014-12-31 10:56:55 -0800569 node1 = tnode_new(inode->key | m, inode->pos, inode->bits - 1);
570 if (!node1)
571 goto nomem;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800572 node0 = tnode_new(inode->key, inode->pos, inode->bits - 1);
Robert Olsson19baf832005-06-21 12:43:18 -0700573
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800574 tnode_free_append(tn, node1);
Alexander Duyck12c081a2014-12-31 10:56:55 -0800575 if (!node0)
576 goto nomem;
577 tnode_free_append(tn, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700578
Alexander Duyck12c081a2014-12-31 10:56:55 -0800579 /* populate child pointers in new nodes */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800580 for (k = child_length(inode), j = k / 2; j;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800581 put_child(node1, --j, get_child(inode, --k));
582 put_child(node0, j, get_child(inode, j));
583 put_child(node1, --j, get_child(inode, --k));
584 put_child(node0, j, get_child(inode, j));
Robert Olsson19baf832005-06-21 12:43:18 -0700585 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800586
Alexander Duyck12c081a2014-12-31 10:56:55 -0800587 /* link new nodes to parent */
588 NODE_INIT_PARENT(node1, tn);
589 NODE_INIT_PARENT(node0, tn);
Olof Johansson91b9a272005-08-09 20:24:39 -0700590
Alexander Duyck12c081a2014-12-31 10:56:55 -0800591 /* link parent to nodes */
592 put_child(tn, 2 * i + 1, node1);
593 put_child(tn, 2 * i, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700594 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800595
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800596 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800597 return replace(t, oldtnode, tn);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700598nomem:
Alexander Duyckfc86a932014-12-31 10:56:49 -0800599 /* all pointers should be clean so we are done */
600 tnode_free(tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800601notnode:
602 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700603}
604
Alexander Duyck88bae712015-03-06 09:54:52 -0800605static struct key_vector *halve(struct trie *t,
606 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700607{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800608 struct key_vector *tn;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800609 unsigned long i;
Robert Olsson19baf832005-06-21 12:43:18 -0700610
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700611 pr_debug("In halve\n");
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700612
Alexander Duycke9b44012014-12-31 10:56:12 -0800613 tn = tnode_new(oldtnode->key, oldtnode->pos + 1, oldtnode->bits - 1);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700614 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800615 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700616
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800617 /* prepare oldtnode to be freed */
618 tnode_free_init(oldtnode);
619
Alexander Duyck12c081a2014-12-31 10:56:55 -0800620 /* Assemble all of the pointers in our cluster, in this case that
621 * represents all of the pointers out of our allocated nodes that
622 * point to existing tnodes and the links between our allocated
623 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700624 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800625 for (i = child_length(oldtnode); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800626 struct key_vector *node1 = get_child(oldtnode, --i);
627 struct key_vector *node0 = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800628 struct key_vector *inode;
Robert Olsson2f368952005-07-05 15:02:40 -0700629
Alexander Duyck12c081a2014-12-31 10:56:55 -0800630 /* At least one of the children is empty */
631 if (!node1 || !node0) {
632 put_child(tn, i / 2, node1 ? : node0);
633 continue;
Robert Olsson2f368952005-07-05 15:02:40 -0700634 }
Robert Olsson2f368952005-07-05 15:02:40 -0700635
Alexander Duyck12c081a2014-12-31 10:56:55 -0800636 /* Two nonempty children */
637 inode = tnode_new(node0->key, oldtnode->pos, 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800638 if (!inode)
639 goto nomem;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800640 tnode_free_append(tn, inode);
641
642 /* initialize pointers out of node */
643 put_child(inode, 1, node1);
644 put_child(inode, 0, node0);
645 NODE_INIT_PARENT(inode, tn);
646
647 /* link parent to node */
648 put_child(tn, i / 2, inode);
Robert Olsson2f368952005-07-05 15:02:40 -0700649 }
Robert Olsson19baf832005-06-21 12:43:18 -0700650
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800651 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800652 return replace(t, oldtnode, tn);
653nomem:
654 /* all pointers should be clean so we are done */
655 tnode_free(tn);
656notnode:
657 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700658}
659
Alexander Duyck88bae712015-03-06 09:54:52 -0800660static struct key_vector *collapse(struct trie *t,
661 struct key_vector *oldtnode)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800662{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800663 struct key_vector *n, *tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800664 unsigned long i;
665
666 /* scan the tnode looking for that one child that might still exist */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800667 for (n = NULL, i = child_length(oldtnode); !n && i;)
Alexander Duyck754baf82015-03-06 09:54:14 -0800668 n = get_child(oldtnode, --i);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800669
670 /* compress one level */
671 tp = node_parent(oldtnode);
Alexander Duyck88bae712015-03-06 09:54:52 -0800672 put_child_root(tp, oldtnode->key, n);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800673 node_set_parent(n, tp);
674
675 /* drop dead node */
676 node_free(oldtnode);
Alexander Duyck88bae712015-03-06 09:54:52 -0800677
678 return tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800679}
680
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800681static unsigned char update_suffix(struct key_vector *tn)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800682{
683 unsigned char slen = tn->pos;
684 unsigned long stride, i;
685
686 /* search though the list of children looking for nodes that might
687 * have a suffix greater than the one we currently have. This is
688 * why we start with a stride of 2 since a stride of 1 would
689 * represent the nodes with suffix length equal to tn->pos
690 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800691 for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800692 struct key_vector *n = get_child(tn, i);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800693
694 if (!n || (n->slen <= slen))
695 continue;
696
697 /* update stride and slen based on new value */
698 stride <<= (n->slen - slen);
699 slen = n->slen;
700 i &= ~(stride - 1);
701
702 /* if slen covers all but the last bit we can stop here
703 * there will be nothing longer than that since only node
704 * 0 and 1 << (bits - 1) could have that as their suffix
705 * length.
706 */
707 if ((slen + 1) >= (tn->pos + tn->bits))
708 break;
709 }
710
711 tn->slen = slen;
712
713 return slen;
714}
715
Alexander Duyckf05a4812014-12-31 10:56:37 -0800716/* From "Implementing a dynamic compressed trie" by Stefan Nilsson of
717 * the Helsinki University of Technology and Matti Tikkanen of Nokia
718 * Telecommunications, page 6:
719 * "A node is doubled if the ratio of non-empty children to all
720 * children in the *doubled* node is at least 'high'."
721 *
722 * 'high' in this instance is the variable 'inflate_threshold'. It
723 * is expressed as a percentage, so we multiply it with
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800724 * child_length() and instead of multiplying by 2 (since the
Alexander Duyckf05a4812014-12-31 10:56:37 -0800725 * child array will be doubled by inflate()) and multiplying
726 * the left-hand side by 100 (to handle the percentage thing) we
727 * multiply the left-hand side by 50.
728 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800729 * The left-hand side may look a bit weird: child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800730 * - tn->empty_children is of course the number of non-null children
731 * in the current node. tn->full_children is the number of "full"
732 * children, that is non-null tnodes with a skip value of 0.
733 * All of those will be doubled in the resulting inflated tnode, so
734 * we just count them one extra time here.
735 *
736 * A clearer way to write this would be:
737 *
738 * to_be_doubled = tn->full_children;
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800739 * not_to_be_doubled = child_length(tn) - tn->empty_children -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800740 * tn->full_children;
741 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800742 * new_child_length = child_length(tn) * 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800743 *
744 * new_fill_factor = 100 * (not_to_be_doubled + 2*to_be_doubled) /
745 * new_child_length;
746 * if (new_fill_factor >= inflate_threshold)
747 *
748 * ...and so on, tho it would mess up the while () loop.
749 *
750 * anyway,
751 * 100 * (not_to_be_doubled + 2*to_be_doubled) / new_child_length >=
752 * inflate_threshold
753 *
754 * avoid a division:
755 * 100 * (not_to_be_doubled + 2*to_be_doubled) >=
756 * inflate_threshold * new_child_length
757 *
758 * expand not_to_be_doubled and to_be_doubled, and shorten:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800759 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800760 * tn->full_children) >= inflate_threshold * new_child_length
761 *
762 * expand new_child_length:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800763 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800764 * tn->full_children) >=
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800765 * inflate_threshold * child_length(tn) * 2
Alexander Duyckf05a4812014-12-31 10:56:37 -0800766 *
767 * shorten again:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800768 * 50 * (tn->full_children + child_length(tn) -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800769 * tn->empty_children) >= inflate_threshold *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800770 * child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800771 *
772 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800773static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800774{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800775 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800776 unsigned long threshold = used;
777
778 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800779 threshold *= IS_TRIE(tp) ? inflate_threshold_root : inflate_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800780 used -= tn_info(tn)->empty_children;
781 used += tn_info(tn)->full_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800782
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800783 /* if bits == KEYLENGTH then pos = 0, and will fail below */
784
785 return (used > 1) && tn->pos && ((50 * used) >= threshold);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800786}
787
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800788static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800789{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800790 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800791 unsigned long threshold = used;
792
793 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800794 threshold *= IS_TRIE(tp) ? halve_threshold_root : halve_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800795 used -= tn_info(tn)->empty_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800796
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800797 /* if bits == KEYLENGTH then used = 100% on wrap, and will fail below */
798
799 return (used > 1) && (tn->bits > 1) && ((100 * used) < threshold);
800}
801
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800802static inline bool should_collapse(struct key_vector *tn)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800803{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800804 unsigned long used = child_length(tn);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800805
Alexander Duyck6e22d172015-03-06 09:54:39 -0800806 used -= tn_info(tn)->empty_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800807
808 /* account for bits == KEYLENGTH case */
Alexander Duyck6e22d172015-03-06 09:54:39 -0800809 if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800810 used -= KEY_MAX;
811
812 /* One child or none, time to drop us from the trie */
813 return used < 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800814}
815
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800816#define MAX_WORK 10
Alexander Duyck88bae712015-03-06 09:54:52 -0800817static struct key_vector *resize(struct trie *t, struct key_vector *tn)
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800818{
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800819#ifdef CONFIG_IP_FIB_TRIE_STATS
820 struct trie_use_stats __percpu *stats = t->stats;
821#endif
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800822 struct key_vector *tp = node_parent(tn);
Alexander Duyck88bae712015-03-06 09:54:52 -0800823 unsigned long cindex = get_index(tn->key, tp);
Alexander Duycka80e89d2015-01-22 15:51:20 -0800824 int max_work = MAX_WORK;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800825
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800826 pr_debug("In tnode_resize %p inflate_threshold=%d threshold=%d\n",
827 tn, inflate_threshold, halve_threshold);
828
Alexander Duyckff181ed2014-12-31 10:56:43 -0800829 /* track the tnode via the pointer from the parent instead of
830 * doing it ourselves. This way we can let RCU fully do its
831 * thing without us interfering
832 */
Alexander Duyck88bae712015-03-06 09:54:52 -0800833 BUG_ON(tn != get_child(tp, cindex));
Alexander Duyckff181ed2014-12-31 10:56:43 -0800834
Alexander Duyckf05a4812014-12-31 10:56:37 -0800835 /* Double as long as the resulting node has a number of
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800836 * nonempty nodes that are above the threshold.
837 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700838 while (should_inflate(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800839 tp = inflate(t, tn);
840 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800841#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800842 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800843#endif
844 break;
845 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800846
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700847 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800848 tn = get_child(tp, cindex);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800849 }
850
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700851 /* update parent in case inflate failed */
852 tp = node_parent(tn);
853
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800854 /* Return if at least one inflate is run */
855 if (max_work != MAX_WORK)
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700856 return tp;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800857
Alexander Duyckf05a4812014-12-31 10:56:37 -0800858 /* Halve as long as the number of empty children in this
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800859 * node is above threshold.
860 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700861 while (should_halve(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800862 tp = halve(t, tn);
863 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800864#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800865 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800866#endif
867 break;
868 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800869
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700870 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800871 tn = get_child(tp, cindex);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800872 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800873
874 /* Only one child remains */
Alexander Duyck88bae712015-03-06 09:54:52 -0800875 if (should_collapse(tn))
876 return collapse(t, tn);
877
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700878 /* update parent in case halve failed */
Alexander Duyck88bae712015-03-06 09:54:52 -0800879 tp = node_parent(tn);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800880
881 /* Return if at least one deflate was run */
882 if (max_work != MAX_WORK)
Alexander Duyck88bae712015-03-06 09:54:52 -0800883 return tp;
Alexander Duyck5405afd2014-12-31 10:57:08 -0800884
885 /* push the suffix length to the parent node */
886 if (tn->slen > tn->pos) {
887 unsigned char slen = update_suffix(tn);
888
Alexander Duyck88bae712015-03-06 09:54:52 -0800889 if (slen > tp->slen)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800890 tp->slen = slen;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800891 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800892
Alexander Duyck88bae712015-03-06 09:54:52 -0800893 return tp;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800894}
895
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800896static void leaf_pull_suffix(struct key_vector *tp, struct key_vector *l)
Robert Olsson19baf832005-06-21 12:43:18 -0700897{
Alexander Duyck88bae712015-03-06 09:54:52 -0800898 while ((tp->slen > tp->pos) && (tp->slen > l->slen)) {
Alexander Duyck5405afd2014-12-31 10:57:08 -0800899 if (update_suffix(tp) > l->slen)
900 break;
901 tp = node_parent(tp);
902 }
903}
904
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800905static void leaf_push_suffix(struct key_vector *tn, struct key_vector *l)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800906{
Alexander Duyck5405afd2014-12-31 10:57:08 -0800907 /* if this is a new leaf then tn will be NULL and we can sort
908 * out parent suffix lengths as a part of trie_rebalance
909 */
Alexander Duyck88bae712015-03-06 09:54:52 -0800910 while (tn->slen < l->slen) {
Alexander Duyck5405afd2014-12-31 10:57:08 -0800911 tn->slen = l->slen;
912 tn = node_parent(tn);
913 }
914}
915
Robert Olsson2373ce12005-08-25 13:01:29 -0700916/* rcu_read_lock needs to be hold by caller from readside */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800917static struct key_vector *fib_find_node(struct trie *t,
918 struct key_vector **tp, u32 key)
Robert Olsson19baf832005-06-21 12:43:18 -0700919{
Alexander Duyck88bae712015-03-06 09:54:52 -0800920 struct key_vector *pn, *n = t->kv;
921 unsigned long index = 0;
Robert Olsson19baf832005-06-21 12:43:18 -0700922
Alexander Duyck88bae712015-03-06 09:54:52 -0800923 do {
924 pn = n;
925 n = get_child_rcu(n, index);
926
927 if (!n)
928 break;
929
930 index = get_cindex(key, n);
Alexander Duyck939afb02014-12-31 10:56:00 -0800931
932 /* This bit of code is a bit tricky but it combines multiple
933 * checks into a single check. The prefix consists of the
934 * prefix plus zeros for the bits in the cindex. The index
935 * is the difference between the key and this value. From
936 * this we can actually derive several pieces of data.
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800937 * if (index >= (1ul << bits))
Alexander Duyck939afb02014-12-31 10:56:00 -0800938 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -0800939 * else
940 * we know the value is cindex
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800941 *
942 * This check is safe even if bits == KEYLENGTH due to the
943 * fact that we can only allocate a node with 32 bits if a
944 * long is greater than 32 bits.
Alexander Duyck939afb02014-12-31 10:56:00 -0800945 */
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800946 if (index >= (1ul << n->bits)) {
947 n = NULL;
948 break;
949 }
Alexander Duyck939afb02014-12-31 10:56:00 -0800950
Alexander Duyck88bae712015-03-06 09:54:52 -0800951 /* keep searching until we find a perfect match leaf or NULL */
952 } while (IS_TNODE(n));
Robert Olsson19baf832005-06-21 12:43:18 -0700953
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800954 *tp = pn;
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800955
Alexander Duyck939afb02014-12-31 10:56:00 -0800956 return n;
Robert Olsson19baf832005-06-21 12:43:18 -0700957}
958
Alexander Duyck02525362015-01-22 15:51:39 -0800959/* Return the first fib alias matching TOS with
960 * priority less than or equal to PRIO.
961 */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800962static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen,
Alexander Duyck0b65bd92015-03-12 14:46:29 -0700963 u8 tos, u32 prio, u32 tb_id)
Alexander Duyck02525362015-01-22 15:51:39 -0800964{
965 struct fib_alias *fa;
966
967 if (!fah)
968 return NULL;
969
Alexander Duyck56315f92015-02-25 15:31:31 -0800970 hlist_for_each_entry(fa, fah, fa_list) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800971 if (fa->fa_slen < slen)
972 continue;
973 if (fa->fa_slen != slen)
974 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -0700975 if (fa->tb_id > tb_id)
976 continue;
977 if (fa->tb_id != tb_id)
978 break;
Alexander Duyck02525362015-01-22 15:51:39 -0800979 if (fa->fa_tos > tos)
980 continue;
981 if (fa->fa_info->fib_priority >= prio || fa->fa_tos < tos)
982 return fa;
983 }
984
985 return NULL;
986}
987
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800988static void trie_rebalance(struct trie *t, struct key_vector *tn)
Robert Olsson19baf832005-06-21 12:43:18 -0700989{
Alexander Duyck88bae712015-03-06 09:54:52 -0800990 while (!IS_TRIE(tn))
991 tn = resize(t, tn);
Robert Olsson19baf832005-06-21 12:43:18 -0700992}
993
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800994static int fib_insert_node(struct trie *t, struct key_vector *tp,
Alexander Duyckd5d64872015-03-04 15:02:18 -0800995 struct fib_alias *new, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -0700996{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800997 struct key_vector *n, *l;
Alexander Duyck836a0122014-12-31 10:56:06 -0800998
Alexander Duyckd5d64872015-03-04 15:02:18 -0800999 l = leaf_new(key, new);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001000 if (!l)
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001001 goto noleaf;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001002
1003 /* retrieve child from parent node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001004 n = get_child(tp, get_index(key, tp));
Alexander Duyck836a0122014-12-31 10:56:06 -08001005
1006 /* Case 2: n is a LEAF or a TNODE and the key doesn't match.
1007 *
1008 * Add a new tnode here
1009 * first tnode need some special handling
1010 * leaves us in position for handling as case 3
1011 */
1012 if (n) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001013 struct key_vector *tn;
Alexander Duyck836a0122014-12-31 10:56:06 -08001014
Alexander Duycke9b44012014-12-31 10:56:12 -08001015 tn = tnode_new(key, __fls(key ^ n->key), 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001016 if (!tn)
1017 goto notnode;
Olof Johansson91b9a272005-08-09 20:24:39 -07001018
Alexander Duyck836a0122014-12-31 10:56:06 -08001019 /* initialize routes out of node */
1020 NODE_INIT_PARENT(tn, tp);
1021 put_child(tn, get_index(key, tn) ^ 1, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001022
Alexander Duyck836a0122014-12-31 10:56:06 -08001023 /* start adding routes into the node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001024 put_child_root(tp, key, tn);
Alexander Duyck836a0122014-12-31 10:56:06 -08001025 node_set_parent(n, tn);
Robert Olsson19baf832005-06-21 12:43:18 -07001026
Alexander Duyck836a0122014-12-31 10:56:06 -08001027 /* parent now has a NULL spot where the leaf can go */
Alexander Duycke962f302014-12-10 21:49:22 -08001028 tp = tn;
Robert Olsson19baf832005-06-21 12:43:18 -07001029 }
Olof Johansson91b9a272005-08-09 20:24:39 -07001030
Alexander Duyck836a0122014-12-31 10:56:06 -08001031 /* Case 3: n is NULL, and will just insert a new leaf */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001032 NODE_INIT_PARENT(l, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -08001033 put_child_root(tp, key, l);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001034 trie_rebalance(t, tp);
Olof Johansson91b9a272005-08-09 20:24:39 -07001035
Alexander Duyckd5d64872015-03-04 15:02:18 -08001036 return 0;
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001037notnode:
1038 node_free(l);
1039noleaf:
1040 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07001041}
1042
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001043static int fib_insert_alias(struct trie *t, struct key_vector *tp,
1044 struct key_vector *l, struct fib_alias *new,
Alexander Duyckd5d64872015-03-04 15:02:18 -08001045 struct fib_alias *fa, t_key key)
1046{
1047 if (!l)
1048 return fib_insert_node(t, tp, new, key);
1049
1050 if (fa) {
1051 hlist_add_before_rcu(&new->fa_list, &fa->fa_list);
1052 } else {
1053 struct fib_alias *last;
1054
1055 hlist_for_each_entry(last, &l->leaf, fa_list) {
1056 if (new->fa_slen < last->fa_slen)
1057 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001058 if ((new->fa_slen == last->fa_slen) &&
1059 (new->tb_id > last->tb_id))
1060 break;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001061 fa = last;
1062 }
1063
1064 if (fa)
1065 hlist_add_behind_rcu(&new->fa_list, &fa->fa_list);
1066 else
1067 hlist_add_head_rcu(&new->fa_list, &l->leaf);
1068 }
1069
1070 /* if we added to the tail node then we need to update slen */
1071 if (l->slen < new->fa_slen) {
1072 l->slen = new->fa_slen;
1073 leaf_push_suffix(tp, l);
1074 }
1075
1076 return 0;
1077}
1078
1079/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001080int fib_table_insert(struct fib_table *tb, struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001081{
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001082 struct trie *t = (struct trie *)tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001083 struct fib_alias *fa, *new_fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001084 struct key_vector *l, *tp;
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001085 unsigned int nlflags = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001086 struct fib_info *fi;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001087 u8 plen = cfg->fc_dst_len;
1088 u8 slen = KEYLENGTH - plen;
Thomas Graf4e902c52006-08-17 18:14:52 -07001089 u8 tos = cfg->fc_tos;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001090 u32 key;
Robert Olsson19baf832005-06-21 12:43:18 -07001091 int err;
Robert Olsson19baf832005-06-21 12:43:18 -07001092
Alexander Duyck5786ec62015-02-25 15:31:37 -08001093 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001094 return -EINVAL;
1095
Thomas Graf4e902c52006-08-17 18:14:52 -07001096 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001097
Patrick McHardy2dfe55b2006-08-10 23:08:33 -07001098 pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen);
Robert Olsson19baf832005-06-21 12:43:18 -07001099
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001100 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001101 return -EINVAL;
1102
Thomas Graf4e902c52006-08-17 18:14:52 -07001103 fi = fib_create_info(cfg);
1104 if (IS_ERR(fi)) {
1105 err = PTR_ERR(fi);
Robert Olsson19baf832005-06-21 12:43:18 -07001106 goto err;
Thomas Graf4e902c52006-08-17 18:14:52 -07001107 }
Robert Olsson19baf832005-06-21 12:43:18 -07001108
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001109 l = fib_find_node(t, &tp, key);
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001110 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority,
1111 tb->tb_id) : NULL;
Robert Olsson19baf832005-06-21 12:43:18 -07001112
1113 /* Now fa, if non-NULL, points to the first fib alias
1114 * with the same keys [prefix,tos,priority], if such key already
1115 * exists or to the node before which we will insert new one.
1116 *
1117 * If fa is NULL, we will need to allocate a new one and
Alexander Duyck56315f92015-02-25 15:31:31 -08001118 * insert to the tail of the section matching the suffix length
1119 * of the new alias.
Robert Olsson19baf832005-06-21 12:43:18 -07001120 */
1121
Julian Anastasov936f6f82008-01-28 21:18:06 -08001122 if (fa && fa->fa_tos == tos &&
1123 fa->fa_info->fib_priority == fi->fib_priority) {
1124 struct fib_alias *fa_first, *fa_match;
Robert Olsson19baf832005-06-21 12:43:18 -07001125
1126 err = -EEXIST;
Thomas Graf4e902c52006-08-17 18:14:52 -07001127 if (cfg->fc_nlflags & NLM_F_EXCL)
Robert Olsson19baf832005-06-21 12:43:18 -07001128 goto out;
1129
Julian Anastasov936f6f82008-01-28 21:18:06 -08001130 /* We have 2 goals:
1131 * 1. Find exact match for type, scope, fib_info to avoid
1132 * duplicate routes
1133 * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it
1134 */
1135 fa_match = NULL;
1136 fa_first = fa;
Alexander Duyck56315f92015-02-25 15:31:31 -08001137 hlist_for_each_entry_from(fa, fa_list) {
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001138 if ((fa->fa_slen != slen) ||
1139 (fa->tb_id != tb->tb_id) ||
1140 (fa->fa_tos != tos))
Julian Anastasov936f6f82008-01-28 21:18:06 -08001141 break;
1142 if (fa->fa_info->fib_priority != fi->fib_priority)
1143 break;
1144 if (fa->fa_type == cfg->fc_type &&
Julian Anastasov936f6f82008-01-28 21:18:06 -08001145 fa->fa_info == fi) {
1146 fa_match = fa;
1147 break;
1148 }
1149 }
1150
Thomas Graf4e902c52006-08-17 18:14:52 -07001151 if (cfg->fc_nlflags & NLM_F_REPLACE) {
Robert Olsson19baf832005-06-21 12:43:18 -07001152 struct fib_info *fi_drop;
1153 u8 state;
1154
Julian Anastasov936f6f82008-01-28 21:18:06 -08001155 fa = fa_first;
1156 if (fa_match) {
1157 if (fa == fa_match)
1158 err = 0;
Joonwoo Park67250332008-01-18 03:45:18 -08001159 goto out;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001160 }
Robert Olsson2373ce12005-08-25 13:01:29 -07001161 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001162 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001163 if (!new_fa)
Robert Olsson2373ce12005-08-25 13:01:29 -07001164 goto out;
Robert Olsson19baf832005-06-21 12:43:18 -07001165
1166 fi_drop = fa->fa_info;
Robert Olsson2373ce12005-08-25 13:01:29 -07001167 new_fa->fa_tos = fa->fa_tos;
1168 new_fa->fa_info = fi;
Thomas Graf4e902c52006-08-17 18:14:52 -07001169 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001170 state = fa->fa_state;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001171 new_fa->fa_state = state & ~FA_S_ACCESSED;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001172 new_fa->fa_slen = fa->fa_slen;
Michal Kubečekd4e64c22015-05-22 13:40:09 +02001173 new_fa->tb_id = tb->tb_id;
Robert Olsson19baf832005-06-21 12:43:18 -07001174
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001175 err = switchdev_fib_ipv4_add(key, plen, fi,
1176 new_fa->fa_tos,
1177 cfg->fc_type,
1178 cfg->fc_nlflags,
1179 tb->tb_id);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001180 if (err) {
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001181 switchdev_fib_ipv4_abort(fi);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001182 kmem_cache_free(fn_alias_kmem, new_fa);
1183 goto out;
1184 }
1185
Alexander Duyck56315f92015-02-25 15:31:31 -08001186 hlist_replace_rcu(&fa->fa_list, &new_fa->fa_list);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001187
Robert Olsson2373ce12005-08-25 13:01:29 -07001188 alias_free_mem_rcu(fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001189
1190 fib_release_info(fi_drop);
1191 if (state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001192 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Milan Kocianb8f55832007-05-23 14:55:06 -07001193 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen,
1194 tb->tb_id, &cfg->fc_nlinfo, NLM_F_REPLACE);
Robert Olsson19baf832005-06-21 12:43:18 -07001195
Olof Johansson91b9a272005-08-09 20:24:39 -07001196 goto succeeded;
Robert Olsson19baf832005-06-21 12:43:18 -07001197 }
1198 /* Error if we find a perfect match which
1199 * uses the same scope, type, and nexthop
1200 * information.
1201 */
Julian Anastasov936f6f82008-01-28 21:18:06 -08001202 if (fa_match)
1203 goto out;
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001204
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001205 if (cfg->fc_nlflags & NLM_F_APPEND)
1206 nlflags = NLM_F_APPEND;
1207 else
Julian Anastasov936f6f82008-01-28 21:18:06 -08001208 fa = fa_first;
Robert Olsson19baf832005-06-21 12:43:18 -07001209 }
1210 err = -ENOENT;
Thomas Graf4e902c52006-08-17 18:14:52 -07001211 if (!(cfg->fc_nlflags & NLM_F_CREATE))
Robert Olsson19baf832005-06-21 12:43:18 -07001212 goto out;
1213
1214 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001215 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001216 if (!new_fa)
Robert Olsson19baf832005-06-21 12:43:18 -07001217 goto out;
1218
1219 new_fa->fa_info = fi;
1220 new_fa->fa_tos = tos;
Thomas Graf4e902c52006-08-17 18:14:52 -07001221 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001222 new_fa->fa_state = 0;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001223 new_fa->fa_slen = slen;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001224 new_fa->tb_id = tb->tb_id;
Robert Olsson19baf832005-06-21 12:43:18 -07001225
Scott Feldman8e05fd72015-03-05 21:21:19 -08001226 /* (Optionally) offload fib entry to switch hardware. */
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001227 err = switchdev_fib_ipv4_add(key, plen, fi, tos, cfg->fc_type,
1228 cfg->fc_nlflags, tb->tb_id);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001229 if (err) {
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001230 switchdev_fib_ipv4_abort(fi);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001231 goto out_free_new_fa;
1232 }
1233
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001234 /* Insert new entry to the list. */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001235 err = fib_insert_alias(t, tp, l, new_fa, fa, key);
1236 if (err)
Scott Feldman8e05fd72015-03-05 21:21:19 -08001237 goto out_sw_fib_del;
Robert Olsson19baf832005-06-21 12:43:18 -07001238
David S. Miller21d8c492011-04-14 14:49:37 -07001239 if (!plen)
1240 tb->tb_num_default++;
1241
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001242 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001243 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, new_fa->tb_id,
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001244 &cfg->fc_nlinfo, nlflags);
Robert Olsson19baf832005-06-21 12:43:18 -07001245succeeded:
1246 return 0;
Robert Olssonf835e472005-06-28 15:00:39 -07001247
Scott Feldman8e05fd72015-03-05 21:21:19 -08001248out_sw_fib_del:
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001249 switchdev_fib_ipv4_del(key, plen, fi, tos, cfg->fc_type, tb->tb_id);
Robert Olssonf835e472005-06-28 15:00:39 -07001250out_free_new_fa:
1251 kmem_cache_free(fn_alias_kmem, new_fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001252out:
1253 fib_release_info(fi);
Olof Johansson91b9a272005-08-09 20:24:39 -07001254err:
Robert Olsson19baf832005-06-21 12:43:18 -07001255 return err;
1256}
1257
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001258static inline t_key prefix_mismatch(t_key key, struct key_vector *n)
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001259{
1260 t_key prefix = n->key;
1261
1262 return (key ^ prefix) & (prefix | -prefix);
1263}
1264
Alexander Duyck345e9b52014-12-31 10:56:24 -08001265/* should be called with rcu_read_lock */
David S. Miller22bd5b92011-03-11 19:54:08 -05001266int fib_table_lookup(struct fib_table *tb, const struct flowi4 *flp,
Eric Dumazetebc0ffa2010-10-05 10:41:36 +00001267 struct fib_result *res, int fib_flags)
Robert Olsson19baf832005-06-21 12:43:18 -07001268{
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001269 struct trie *t = (struct trie *) tb->tb_data;
Alexander Duyck8274a972014-12-31 10:55:29 -08001270#ifdef CONFIG_IP_FIB_TRIE_STATS
1271 struct trie_use_stats __percpu *stats = t->stats;
1272#endif
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001273 const t_key key = ntohl(flp->daddr);
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001274 struct key_vector *n, *pn;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001275 struct fib_alias *fa;
Alexander Duyck71e8b672015-03-04 15:04:03 -08001276 unsigned long index;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001277 t_key cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001278
Alexander Duyck88bae712015-03-06 09:54:52 -08001279 pn = t->kv;
1280 cindex = 0;
1281
1282 n = get_child_rcu(pn, cindex);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001283 if (!n)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001284 return -EAGAIN;
Robert Olsson19baf832005-06-21 12:43:18 -07001285
1286#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08001287 this_cpu_inc(stats->gets);
Robert Olsson19baf832005-06-21 12:43:18 -07001288#endif
1289
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001290 /* Step 1: Travel to the longest prefix match in the trie */
1291 for (;;) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001292 index = get_cindex(key, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001293
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001294 /* This bit of code is a bit tricky but it combines multiple
1295 * checks into a single check. The prefix consists of the
1296 * prefix plus zeros for the "bits" in the prefix. The index
1297 * is the difference between the key and this value. From
1298 * this we can actually derive several pieces of data.
Alexander Duyck71e8b672015-03-04 15:04:03 -08001299 * if (index >= (1ul << bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001300 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -08001301 * else
1302 * we know the value is cindex
Alexander Duyck71e8b672015-03-04 15:04:03 -08001303 *
1304 * This check is safe even if bits == KEYLENGTH due to the
1305 * fact that we can only allocate a node with 32 bits if a
1306 * long is greater than 32 bits.
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001307 */
Alexander Duyck71e8b672015-03-04 15:04:03 -08001308 if (index >= (1ul << n->bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001309 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001310
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001311 /* we have found a leaf. Prefixes have already been compared */
1312 if (IS_LEAF(n))
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001313 goto found;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001314
1315 /* only record pn and cindex if we are going to be chopping
1316 * bits later. Otherwise we are just wasting cycles.
1317 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001318 if (n->slen > n->pos) {
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001319 pn = n;
1320 cindex = index;
Olof Johansson91b9a272005-08-09 20:24:39 -07001321 }
1322
Alexander Duyck754baf82015-03-06 09:54:14 -08001323 n = get_child_rcu(n, index);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001324 if (unlikely(!n))
Robert Olsson19baf832005-06-21 12:43:18 -07001325 goto backtrace;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001326 }
1327
1328 /* Step 2: Sort out leaves and begin backtracing for longest prefix */
1329 for (;;) {
1330 /* record the pointer where our next node pointer is stored */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001331 struct key_vector __rcu **cptr = n->tnode;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001332
1333 /* This test verifies that none of the bits that differ
1334 * between the key and the prefix exist in the region of
1335 * the lsb and higher in the prefix.
1336 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001337 if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001338 goto backtrace;
1339
1340 /* exit out and process leaf */
1341 if (unlikely(IS_LEAF(n)))
1342 break;
1343
1344 /* Don't bother recording parent info. Since we are in
1345 * prefix match mode we will have to come back to wherever
1346 * we started this traversal anyway
1347 */
1348
1349 while ((n = rcu_dereference(*cptr)) == NULL) {
1350backtrace:
1351#ifdef CONFIG_IP_FIB_TRIE_STATS
1352 if (!n)
1353 this_cpu_inc(stats->null_node_hit);
1354#endif
1355 /* If we are at cindex 0 there are no more bits for
1356 * us to strip at this level so we must ascend back
1357 * up one level to see if there are any more bits to
1358 * be stripped there.
1359 */
1360 while (!cindex) {
1361 t_key pkey = pn->key;
1362
Alexander Duyck88bae712015-03-06 09:54:52 -08001363 /* If we don't have a parent then there is
1364 * nothing for us to do as we do not have any
1365 * further nodes to parse.
1366 */
1367 if (IS_TRIE(pn))
Alexander Duyck345e9b52014-12-31 10:56:24 -08001368 return -EAGAIN;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001369#ifdef CONFIG_IP_FIB_TRIE_STATS
1370 this_cpu_inc(stats->backtrack);
1371#endif
1372 /* Get Child's index */
Alexander Duyck88bae712015-03-06 09:54:52 -08001373 pn = node_parent_rcu(pn);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001374 cindex = get_index(pkey, pn);
1375 }
1376
1377 /* strip the least significant bit from the cindex */
1378 cindex &= cindex - 1;
1379
1380 /* grab pointer for next child node */
Alexander Duyck41b489f2015-03-04 15:02:33 -08001381 cptr = &pn->tnode[cindex];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001382 }
Robert Olsson19baf832005-06-21 12:43:18 -07001383 }
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001384
Robert Olsson19baf832005-06-21 12:43:18 -07001385found:
Alexander Duyck71e8b672015-03-04 15:04:03 -08001386 /* this line carries forward the xor from earlier in the function */
1387 index = key ^ n->key;
1388
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001389 /* Step 3: Process the leaf, if that fails fall back to backtracing */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001390 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
1391 struct fib_info *fi = fa->fa_info;
1392 int nhsel, err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001393
Alexander Duyck71e8b672015-03-04 15:04:03 -08001394 if ((index >= (1ul << fa->fa_slen)) &&
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001395 ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen != KEYLENGTH)))
Alexander Duyck71e8b672015-03-04 15:04:03 -08001396 continue;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001397 if (fa->fa_tos && fa->fa_tos != flp->flowi4_tos)
1398 continue;
1399 if (fi->fib_dead)
1400 continue;
1401 if (fa->fa_info->fib_scope < flp->flowi4_scope)
1402 continue;
1403 fib_alias_accessed(fa);
1404 err = fib_props[fa->fa_type].error;
1405 if (unlikely(err < 0)) {
Alexander Duyck345e9b52014-12-31 10:56:24 -08001406#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001407 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001408#endif
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001409 return err;
1410 }
1411 if (fi->fib_flags & RTNH_F_DEAD)
1412 continue;
1413 for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) {
1414 const struct fib_nh *nh = &fi->fib_nh[nhsel];
Andy Gospodarek0eeb0752015-06-23 13:45:37 -04001415 struct in_device *in_dev = __in_dev_get_rcu(nh->nh_dev);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001416
1417 if (nh->nh_flags & RTNH_F_DEAD)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001418 continue;
Andy Gospodarek0eeb0752015-06-23 13:45:37 -04001419 if (in_dev &&
1420 IN_DEV_IGNORE_ROUTES_WITH_LINKDOWN(in_dev) &&
1421 nh->nh_flags & RTNH_F_LINKDOWN &&
1422 !(fib_flags & FIB_LOOKUP_IGNORE_LINKSTATE))
1423 continue;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001424 if (flp->flowi4_oif && flp->flowi4_oif != nh->nh_oif)
1425 continue;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001426
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001427 if (!(fib_flags & FIB_LOOKUP_NOREF))
1428 atomic_inc(&fi->fib_clntref);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001429
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001430 res->prefixlen = KEYLENGTH - fa->fa_slen;
1431 res->nh_sel = nhsel;
1432 res->type = fa->fa_type;
1433 res->scope = fi->fib_scope;
1434 res->fi = fi;
1435 res->table = tb;
1436 res->fa_head = &n->leaf;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001437#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001438 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001439#endif
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001440 return err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001441 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001442 }
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001443#ifdef CONFIG_IP_FIB_TRIE_STATS
1444 this_cpu_inc(stats->semantic_match_miss);
1445#endif
Alexander Duyck345e9b52014-12-31 10:56:24 -08001446 goto backtrace;
Robert Olsson19baf832005-06-21 12:43:18 -07001447}
Florian Westphal6fc01432011-08-25 13:46:12 +02001448EXPORT_SYMBOL_GPL(fib_table_lookup);
Robert Olsson19baf832005-06-21 12:43:18 -07001449
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001450static void fib_remove_alias(struct trie *t, struct key_vector *tp,
1451 struct key_vector *l, struct fib_alias *old)
Alexander Duyckd5d64872015-03-04 15:02:18 -08001452{
1453 /* record the location of the previous list_info entry */
1454 struct hlist_node **pprev = old->fa_list.pprev;
1455 struct fib_alias *fa = hlist_entry(pprev, typeof(*fa), fa_list.next);
1456
1457 /* remove the fib_alias from the list */
1458 hlist_del_rcu(&old->fa_list);
1459
1460 /* if we emptied the list this leaf will be freed and we can sort
1461 * out parent suffix lengths as a part of trie_rebalance
1462 */
1463 if (hlist_empty(&l->leaf)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001464 put_child_root(tp, l->key, NULL);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001465 node_free(l);
1466 trie_rebalance(t, tp);
1467 return;
1468 }
1469
1470 /* only access fa if it is pointing at the last valid hlist_node */
1471 if (*pprev)
1472 return;
1473
1474 /* update the trie with the latest suffix length */
1475 l->slen = fa->fa_slen;
1476 leaf_pull_suffix(tp, l);
1477}
1478
1479/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001480int fib_table_delete(struct fib_table *tb, struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001481{
1482 struct trie *t = (struct trie *) tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001483 struct fib_alias *fa, *fa_to_delete;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001484 struct key_vector *l, *tp;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001485 u8 plen = cfg->fc_dst_len;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001486 u8 slen = KEYLENGTH - plen;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001487 u8 tos = cfg->fc_tos;
1488 u32 key;
Olof Johansson91b9a272005-08-09 20:24:39 -07001489
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001490 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001491 return -EINVAL;
1492
Thomas Graf4e902c52006-08-17 18:14:52 -07001493 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001494
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001495 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001496 return -EINVAL;
1497
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001498 l = fib_find_node(t, &tp, key);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001499 if (!l)
Robert Olsson19baf832005-06-21 12:43:18 -07001500 return -ESRCH;
1501
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001502 fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id);
Robert Olsson19baf832005-06-21 12:43:18 -07001503 if (!fa)
1504 return -ESRCH;
1505
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001506 pr_debug("Deleting %08x/%d tos=%d t=%p\n", key, plen, tos, t);
Robert Olsson19baf832005-06-21 12:43:18 -07001507
1508 fa_to_delete = NULL;
Alexander Duyck56315f92015-02-25 15:31:31 -08001509 hlist_for_each_entry_from(fa, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001510 struct fib_info *fi = fa->fa_info;
1511
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001512 if ((fa->fa_slen != slen) ||
1513 (fa->tb_id != tb->tb_id) ||
1514 (fa->fa_tos != tos))
Robert Olsson19baf832005-06-21 12:43:18 -07001515 break;
1516
Thomas Graf4e902c52006-08-17 18:14:52 -07001517 if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) &&
1518 (cfg->fc_scope == RT_SCOPE_NOWHERE ||
David S. Miller37e826c2011-03-24 18:06:47 -07001519 fa->fa_info->fib_scope == cfg->fc_scope) &&
Julian Anastasov74cb3c12011-03-19 12:13:46 +00001520 (!cfg->fc_prefsrc ||
1521 fi->fib_prefsrc == cfg->fc_prefsrc) &&
Thomas Graf4e902c52006-08-17 18:14:52 -07001522 (!cfg->fc_protocol ||
1523 fi->fib_protocol == cfg->fc_protocol) &&
1524 fib_nh_match(cfg, fi) == 0) {
Robert Olsson19baf832005-06-21 12:43:18 -07001525 fa_to_delete = fa;
1526 break;
1527 }
1528 }
1529
Olof Johansson91b9a272005-08-09 20:24:39 -07001530 if (!fa_to_delete)
1531 return -ESRCH;
Robert Olsson19baf832005-06-21 12:43:18 -07001532
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001533 switchdev_fib_ipv4_del(key, plen, fa_to_delete->fa_info, tos,
1534 cfg->fc_type, tb->tb_id);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001535
Alexander Duyckd5d64872015-03-04 15:02:18 -08001536 rtmsg_fib(RTM_DELROUTE, htonl(key), fa_to_delete, plen, tb->tb_id,
Milan Kocianb8f55832007-05-23 14:55:06 -07001537 &cfg->fc_nlinfo, 0);
Robert Olsson19baf832005-06-21 12:43:18 -07001538
David S. Miller21d8c492011-04-14 14:49:37 -07001539 if (!plen)
1540 tb->tb_num_default--;
1541
Alexander Duyckd5d64872015-03-04 15:02:18 -08001542 fib_remove_alias(t, tp, l, fa_to_delete);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001543
Alexander Duyckd5d64872015-03-04 15:02:18 -08001544 if (fa_to_delete->fa_state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001545 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Olof Johansson91b9a272005-08-09 20:24:39 -07001546
Alexander Duyckd5d64872015-03-04 15:02:18 -08001547 fib_release_info(fa_to_delete->fa_info);
1548 alias_free_mem_rcu(fa_to_delete);
Olof Johansson91b9a272005-08-09 20:24:39 -07001549 return 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001550}
1551
Alexander Duyck8be33e92015-03-04 14:59:19 -08001552/* Scan for the next leaf starting at the provided key value */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001553static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -07001554{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001555 struct key_vector *pn, *n = *tn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001556 unsigned long cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001557
Alexander Duyck8be33e92015-03-04 14:59:19 -08001558 /* this loop is meant to try and find the key in the trie */
Alexander Duyck88bae712015-03-06 09:54:52 -08001559 do {
1560 /* record parent and next child index */
1561 pn = n;
Alexander Duyck3ec320d2015-03-10 11:25:41 -07001562 cindex = key ? get_index(key, pn) : 0;
Alexander Duyck88bae712015-03-06 09:54:52 -08001563
1564 if (cindex >> pn->bits)
1565 break;
1566
1567 /* descend into the next child */
1568 n = get_child_rcu(pn, cindex++);
1569 if (!n)
1570 break;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001571
Alexander Duyck8be33e92015-03-04 14:59:19 -08001572 /* guarantee forward progress on the keys */
1573 if (IS_LEAF(n) && (n->key >= key))
1574 goto found;
Alexander Duyck88bae712015-03-06 09:54:52 -08001575 } while (IS_TNODE(n));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001576
1577 /* this loop will search for the next leaf with a greater key */
Alexander Duyck88bae712015-03-06 09:54:52 -08001578 while (!IS_TRIE(pn)) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001579 /* if we exhausted the parent node we will need to climb */
1580 if (cindex >= (1ul << pn->bits)) {
1581 t_key pkey = pn->key;
1582
1583 pn = node_parent_rcu(pn);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001584 cindex = get_index(pkey, pn) + 1;
1585 continue;
Robert Olsson19baf832005-06-21 12:43:18 -07001586 }
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001587
Alexander Duyck8be33e92015-03-04 14:59:19 -08001588 /* grab the next available node */
Alexander Duyck754baf82015-03-06 09:54:14 -08001589 n = get_child_rcu(pn, cindex++);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001590 if (!n)
1591 continue;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001592
Alexander Duyck8be33e92015-03-04 14:59:19 -08001593 /* no need to compare keys since we bumped the index */
1594 if (IS_LEAF(n))
1595 goto found;
1596
1597 /* Rescan start scanning in new node */
1598 pn = n;
1599 cindex = 0;
1600 }
1601
1602 *tn = pn;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001603 return NULL; /* Root of trie */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001604found:
1605 /* if we are at the limit for keys just return NULL for the tnode */
Alexander Duyck88bae712015-03-06 09:54:52 -08001606 *tn = pn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001607 return n;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001608}
1609
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001610static void fib_trie_free(struct fib_table *tb)
1611{
1612 struct trie *t = (struct trie *)tb->tb_data;
1613 struct key_vector *pn = t->kv;
1614 unsigned long cindex = 1;
1615 struct hlist_node *tmp;
1616 struct fib_alias *fa;
1617
1618 /* walk trie in reverse order and free everything */
1619 for (;;) {
1620 struct key_vector *n;
1621
1622 if (!(cindex--)) {
1623 t_key pkey = pn->key;
1624
1625 if (IS_TRIE(pn))
1626 break;
1627
1628 n = pn;
1629 pn = node_parent(pn);
1630
1631 /* drop emptied tnode */
1632 put_child_root(pn, n->key, NULL);
1633 node_free(n);
1634
1635 cindex = get_index(pkey, pn);
1636
1637 continue;
1638 }
1639
1640 /* grab the next available node */
1641 n = get_child(pn, cindex);
1642 if (!n)
1643 continue;
1644
1645 if (IS_TNODE(n)) {
1646 /* record pn and cindex for leaf walking */
1647 pn = n;
1648 cindex = 1ul << n->bits;
1649
1650 continue;
1651 }
1652
1653 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1654 hlist_del_rcu(&fa->fa_list);
1655 alias_free_mem_rcu(fa);
1656 }
1657
1658 put_child_root(pn, n->key, NULL);
1659 node_free(n);
1660 }
1661
1662#ifdef CONFIG_IP_FIB_TRIE_STATS
1663 free_percpu(t->stats);
1664#endif
1665 kfree(tb);
1666}
1667
1668struct fib_table *fib_trie_unmerge(struct fib_table *oldtb)
1669{
1670 struct trie *ot = (struct trie *)oldtb->tb_data;
1671 struct key_vector *l, *tp = ot->kv;
1672 struct fib_table *local_tb;
1673 struct fib_alias *fa;
1674 struct trie *lt;
1675 t_key key = 0;
1676
1677 if (oldtb->tb_data == oldtb->__data)
1678 return oldtb;
1679
1680 local_tb = fib_trie_table(RT_TABLE_LOCAL, NULL);
1681 if (!local_tb)
1682 return NULL;
1683
1684 lt = (struct trie *)local_tb->tb_data;
1685
1686 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
1687 struct key_vector *local_l = NULL, *local_tp;
1688
1689 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
1690 struct fib_alias *new_fa;
1691
1692 if (local_tb->tb_id != fa->tb_id)
1693 continue;
1694
1695 /* clone fa for new local table */
1696 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
1697 if (!new_fa)
1698 goto out;
1699
1700 memcpy(new_fa, fa, sizeof(*fa));
1701
1702 /* insert clone into table */
1703 if (!local_l)
1704 local_l = fib_find_node(lt, &local_tp, l->key);
1705
1706 if (fib_insert_alias(lt, local_tp, local_l, new_fa,
1707 NULL, l->key))
1708 goto out;
1709 }
1710
1711 /* stop loop if key wrapped back to 0 */
1712 key = l->key + 1;
1713 if (key < l->key)
1714 break;
1715 }
1716
1717 return local_tb;
1718out:
1719 fib_trie_free(local_tb);
1720
1721 return NULL;
1722}
1723
Scott Feldman104616e2015-03-05 21:21:16 -08001724/* Caller must hold RTNL */
1725void fib_table_flush_external(struct fib_table *tb)
1726{
1727 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001728 struct key_vector *pn = t->kv;
1729 unsigned long cindex = 1;
1730 struct hlist_node *tmp;
Scott Feldman104616e2015-03-05 21:21:16 -08001731 struct fib_alias *fa;
Scott Feldman104616e2015-03-05 21:21:16 -08001732
Alexander Duyck88bae712015-03-06 09:54:52 -08001733 /* walk trie in reverse order */
1734 for (;;) {
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001735 unsigned char slen = 0;
Alexander Duyck88bae712015-03-06 09:54:52 -08001736 struct key_vector *n;
Scott Feldman104616e2015-03-05 21:21:16 -08001737
Alexander Duyck88bae712015-03-06 09:54:52 -08001738 if (!(cindex--)) {
1739 t_key pkey = pn->key;
Scott Feldman104616e2015-03-05 21:21:16 -08001740
Alexander Duyck88bae712015-03-06 09:54:52 -08001741 /* cannot resize the trie vector */
1742 if (IS_TRIE(pn))
1743 break;
Scott Feldman104616e2015-03-05 21:21:16 -08001744
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001745 /* resize completed node */
1746 pn = resize(t, pn);
Alexander Duyck88bae712015-03-06 09:54:52 -08001747 cindex = get_index(pkey, pn);
Scott Feldman104616e2015-03-05 21:21:16 -08001748
Alexander Duyck88bae712015-03-06 09:54:52 -08001749 continue;
1750 }
Scott Feldman104616e2015-03-05 21:21:16 -08001751
Alexander Duyck88bae712015-03-06 09:54:52 -08001752 /* grab the next available node */
1753 n = get_child(pn, cindex);
1754 if (!n)
Alexander Duyck72be7262015-03-06 09:53:56 -08001755 continue;
1756
Alexander Duyck88bae712015-03-06 09:54:52 -08001757 if (IS_TNODE(n)) {
1758 /* record pn and cindex for leaf walking */
1759 pn = n;
1760 cindex = 1ul << n->bits;
Scott Feldman104616e2015-03-05 21:21:16 -08001761
Alexander Duyck88bae712015-03-06 09:54:52 -08001762 continue;
1763 }
1764
1765 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1766 struct fib_info *fi = fa->fa_info;
1767
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001768 /* if alias was cloned to local then we just
1769 * need to remove the local copy from main
1770 */
1771 if (tb->tb_id != fa->tb_id) {
1772 hlist_del_rcu(&fa->fa_list);
1773 alias_free_mem_rcu(fa);
1774 continue;
1775 }
1776
1777 /* record local slen */
1778 slen = fa->fa_slen;
1779
Roopa Prabhueea39942015-05-13 21:17:41 -07001780 if (!fi || !(fi->fib_flags & RTNH_F_OFFLOAD))
Alexander Duyck88bae712015-03-06 09:54:52 -08001781 continue;
1782
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001783 switchdev_fib_ipv4_del(n->key, KEYLENGTH - fa->fa_slen,
1784 fi, fa->fa_tos, fa->fa_type,
1785 tb->tb_id);
Alexander Duyck88bae712015-03-06 09:54:52 -08001786 }
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001787
1788 /* update leaf slen */
1789 n->slen = slen;
1790
1791 if (hlist_empty(&n->leaf)) {
1792 put_child_root(pn, n->key, NULL);
1793 node_free(n);
1794 } else {
1795 leaf_pull_suffix(pn, n);
1796 }
Alexander Duyck88bae712015-03-06 09:54:52 -08001797 }
Scott Feldman104616e2015-03-05 21:21:16 -08001798}
1799
Alexander Duyck8be33e92015-03-04 14:59:19 -08001800/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001801int fib_table_flush(struct fib_table *tb)
Robert Olsson19baf832005-06-21 12:43:18 -07001802{
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001803 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001804 struct key_vector *pn = t->kv;
1805 unsigned long cindex = 1;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001806 struct hlist_node *tmp;
1807 struct fib_alias *fa;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001808 int found = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001809
Alexander Duyck88bae712015-03-06 09:54:52 -08001810 /* walk trie in reverse order */
1811 for (;;) {
1812 unsigned char slen = 0;
1813 struct key_vector *n;
Robert Olsson19baf832005-06-21 12:43:18 -07001814
Alexander Duyck88bae712015-03-06 09:54:52 -08001815 if (!(cindex--)) {
1816 t_key pkey = pn->key;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001817
Alexander Duyck88bae712015-03-06 09:54:52 -08001818 /* cannot resize the trie vector */
1819 if (IS_TRIE(pn))
1820 break;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001821
Alexander Duyck88bae712015-03-06 09:54:52 -08001822 /* resize completed node */
1823 pn = resize(t, pn);
1824 cindex = get_index(pkey, pn);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001825
Alexander Duyck88bae712015-03-06 09:54:52 -08001826 continue;
1827 }
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001828
Alexander Duyck88bae712015-03-06 09:54:52 -08001829 /* grab the next available node */
1830 n = get_child(pn, cindex);
1831 if (!n)
1832 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001833
Alexander Duyck88bae712015-03-06 09:54:52 -08001834 if (IS_TNODE(n)) {
1835 /* record pn and cindex for leaf walking */
1836 pn = n;
1837 cindex = 1ul << n->bits;
1838
1839 continue;
1840 }
1841
1842 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1843 struct fib_info *fi = fa->fa_info;
1844
1845 if (!fi || !(fi->fib_flags & RTNH_F_DEAD)) {
1846 slen = fa->fa_slen;
1847 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001848 }
1849
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001850 switchdev_fib_ipv4_del(n->key, KEYLENGTH - fa->fa_slen,
1851 fi, fa->fa_tos, fa->fa_type,
1852 tb->tb_id);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001853 hlist_del_rcu(&fa->fa_list);
1854 fib_release_info(fa->fa_info);
1855 alias_free_mem_rcu(fa);
1856 found++;
Alexander Duyck64c62722015-01-22 15:51:45 -08001857 }
1858
Alexander Duyck88bae712015-03-06 09:54:52 -08001859 /* update leaf slen */
1860 n->slen = slen;
1861
1862 if (hlist_empty(&n->leaf)) {
1863 put_child_root(pn, n->key, NULL);
1864 node_free(n);
1865 } else {
1866 leaf_pull_suffix(pn, n);
1867 }
Robert Olsson19baf832005-06-21 12:43:18 -07001868 }
1869
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001870 pr_debug("trie_flush found=%d\n", found);
Robert Olsson19baf832005-06-21 12:43:18 -07001871 return found;
1872}
1873
Alexander Duycka7e53532015-03-04 15:02:44 -08001874static void __trie_free_rcu(struct rcu_head *head)
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001875{
Alexander Duycka7e53532015-03-04 15:02:44 -08001876 struct fib_table *tb = container_of(head, struct fib_table, rcu);
Alexander Duyck8274a972014-12-31 10:55:29 -08001877#ifdef CONFIG_IP_FIB_TRIE_STATS
1878 struct trie *t = (struct trie *)tb->tb_data;
1879
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001880 if (tb->tb_data == tb->__data)
1881 free_percpu(t->stats);
Alexander Duyck8274a972014-12-31 10:55:29 -08001882#endif /* CONFIG_IP_FIB_TRIE_STATS */
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001883 kfree(tb);
1884}
1885
Alexander Duycka7e53532015-03-04 15:02:44 -08001886void fib_free_table(struct fib_table *tb)
1887{
1888 call_rcu(&tb->rcu, __trie_free_rcu);
1889}
1890
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001891static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001892 struct sk_buff *skb, struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001893{
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001894 __be32 xkey = htonl(l->key);
Robert Olsson19baf832005-06-21 12:43:18 -07001895 struct fib_alias *fa;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001896 int i, s_i;
Robert Olsson19baf832005-06-21 12:43:18 -07001897
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001898 s_i = cb->args[4];
Robert Olsson19baf832005-06-21 12:43:18 -07001899 i = 0;
1900
Robert Olsson2373ce12005-08-25 13:01:29 -07001901 /* rcu_read_lock is hold by caller */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001902 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001903 if (i < s_i) {
1904 i++;
1905 continue;
1906 }
Robert Olsson19baf832005-06-21 12:43:18 -07001907
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001908 if (tb->tb_id != fa->tb_id) {
1909 i++;
1910 continue;
1911 }
1912
Eric W. Biederman15e47302012-09-07 20:12:54 +00001913 if (fib_dump_info(skb, NETLINK_CB(cb->skb).portid,
Robert Olsson19baf832005-06-21 12:43:18 -07001914 cb->nlh->nlmsg_seq,
1915 RTM_NEWROUTE,
1916 tb->tb_id,
1917 fa->fa_type,
Thomas Grafbe403ea2006-08-17 18:15:17 -07001918 xkey,
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001919 KEYLENGTH - fa->fa_slen,
Robert Olsson19baf832005-06-21 12:43:18 -07001920 fa->fa_tos,
Stephen Hemminger64347f72008-01-22 21:55:01 -08001921 fa->fa_info, NLM_F_MULTI) < 0) {
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001922 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001923 return -1;
1924 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001925 i++;
Robert Olsson19baf832005-06-21 12:43:18 -07001926 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001927
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001928 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001929 return skb->len;
1930}
1931
Alexander Duycka7e53532015-03-04 15:02:44 -08001932/* rcu_read_lock needs to be hold by caller from readside */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001933int fib_table_dump(struct fib_table *tb, struct sk_buff *skb,
1934 struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001935{
Alexander Duyck8be33e92015-03-04 14:59:19 -08001936 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001937 struct key_vector *l, *tp = t->kv;
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001938 /* Dump starting at last key.
1939 * Note: 0.0.0.0/0 (ie default) is first key.
1940 */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001941 int count = cb->args[2];
1942 t_key key = cb->args[3];
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001943
Alexander Duyck8be33e92015-03-04 14:59:19 -08001944 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001945 if (fn_trie_dump_leaf(l, tb, skb, cb) < 0) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001946 cb->args[3] = key;
1947 cb->args[2] = count;
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001948 return -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001949 }
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001950
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001951 ++count;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001952 key = l->key + 1;
1953
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001954 memset(&cb->args[4], 0,
1955 sizeof(cb->args) - 4*sizeof(cb->args[0]));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001956
1957 /* stop loop if key wrapped back to 0 */
1958 if (key < l->key)
1959 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001960 }
Alexander Duyck8be33e92015-03-04 14:59:19 -08001961
Alexander Duyck8be33e92015-03-04 14:59:19 -08001962 cb->args[3] = key;
1963 cb->args[2] = count;
1964
Robert Olsson19baf832005-06-21 12:43:18 -07001965 return skb->len;
Robert Olsson19baf832005-06-21 12:43:18 -07001966}
1967
David S. Miller5348ba82011-02-01 15:30:56 -08001968void __init fib_trie_init(void)
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001969{
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001970 fn_alias_kmem = kmem_cache_create("ip_fib_alias",
1971 sizeof(struct fib_alias),
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08001972 0, SLAB_PANIC, NULL);
1973
1974 trie_leaf_kmem = kmem_cache_create("ip_fib_trie",
Alexander Duyck41b489f2015-03-04 15:02:33 -08001975 LEAF_SIZE,
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08001976 0, SLAB_PANIC, NULL);
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001977}
Robert Olsson19baf832005-06-21 12:43:18 -07001978
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001979struct fib_table *fib_trie_table(u32 id, struct fib_table *alias)
Robert Olsson19baf832005-06-21 12:43:18 -07001980{
1981 struct fib_table *tb;
1982 struct trie *t;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001983 size_t sz = sizeof(*tb);
Robert Olsson19baf832005-06-21 12:43:18 -07001984
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001985 if (!alias)
1986 sz += sizeof(struct trie);
1987
1988 tb = kzalloc(sz, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001989 if (!tb)
Robert Olsson19baf832005-06-21 12:43:18 -07001990 return NULL;
1991
1992 tb->tb_id = id;
Denis V. Lunev971b8932007-12-08 00:32:23 -08001993 tb->tb_default = -1;
David S. Miller21d8c492011-04-14 14:49:37 -07001994 tb->tb_num_default = 0;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001995 tb->tb_data = (alias ? alias->__data : tb->__data);
1996
1997 if (alias)
1998 return tb;
Robert Olsson19baf832005-06-21 12:43:18 -07001999
2000 t = (struct trie *) tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002001 t->kv[0].pos = KEYLENGTH;
2002 t->kv[0].slen = KEYLENGTH;
Alexander Duyck8274a972014-12-31 10:55:29 -08002003#ifdef CONFIG_IP_FIB_TRIE_STATS
2004 t->stats = alloc_percpu(struct trie_use_stats);
2005 if (!t->stats) {
2006 kfree(tb);
2007 tb = NULL;
2008 }
2009#endif
Robert Olsson19baf832005-06-21 12:43:18 -07002010
Robert Olsson19baf832005-06-21 12:43:18 -07002011 return tb;
2012}
2013
Robert Olsson19baf832005-06-21 12:43:18 -07002014#ifdef CONFIG_PROC_FS
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002015/* Depth first Trie walk iterator */
2016struct fib_trie_iter {
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002017 struct seq_net_private p;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002018 struct fib_table *tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002019 struct key_vector *tnode;
Eric Dumazeta034ee32010-09-09 23:32:28 +00002020 unsigned int index;
2021 unsigned int depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002022};
Robert Olsson19baf832005-06-21 12:43:18 -07002023
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002024static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)
Robert Olsson19baf832005-06-21 12:43:18 -07002025{
Alexander Duyck98293e82014-12-31 10:56:18 -08002026 unsigned long cindex = iter->index;
Alexander Duyck88bae712015-03-06 09:54:52 -08002027 struct key_vector *pn = iter->tnode;
2028 t_key pkey;
Eric W. Biederman6640e692007-01-24 14:42:04 -08002029
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002030 pr_debug("get_next iter={node=%p index=%d depth=%d}\n",
2031 iter->tnode, iter->index, iter->depth);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002032
Alexander Duyck88bae712015-03-06 09:54:52 -08002033 while (!IS_TRIE(pn)) {
2034 while (cindex < child_length(pn)) {
2035 struct key_vector *n = get_child_rcu(pn, cindex++);
2036
2037 if (!n)
2038 continue;
2039
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002040 if (IS_LEAF(n)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08002041 iter->tnode = pn;
2042 iter->index = cindex;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002043 } else {
2044 /* push down one level */
Alexander Duyckadaf9812014-12-31 10:55:47 -08002045 iter->tnode = n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002046 iter->index = 0;
2047 ++iter->depth;
2048 }
Alexander Duyck88bae712015-03-06 09:54:52 -08002049
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002050 return n;
2051 }
2052
Alexander Duyck88bae712015-03-06 09:54:52 -08002053 /* Current node exhausted, pop back up */
2054 pkey = pn->key;
2055 pn = node_parent_rcu(pn);
2056 cindex = get_index(pkey, pn) + 1;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002057 --iter->depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002058 }
2059
Alexander Duyck88bae712015-03-06 09:54:52 -08002060 /* record root node so further searches know we are done */
2061 iter->tnode = pn;
2062 iter->index = 0;
2063
Robert Olsson19baf832005-06-21 12:43:18 -07002064 return NULL;
2065}
2066
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002067static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,
2068 struct trie *t)
Robert Olsson19baf832005-06-21 12:43:18 -07002069{
Firo Yangf38b24c2015-06-08 11:54:51 +08002070 struct key_vector *n, *pn;
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002071
Stephen Hemminger132adf52007-03-08 20:44:43 -08002072 if (!t)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002073 return NULL;
2074
Firo Yangf38b24c2015-06-08 11:54:51 +08002075 pn = t->kv;
Alexander Duyck88bae712015-03-06 09:54:52 -08002076 n = rcu_dereference(pn->tnode[0]);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002077 if (!n)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002078 return NULL;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002079
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002080 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002081 iter->tnode = n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002082 iter->index = 0;
2083 iter->depth = 1;
2084 } else {
Alexander Duyck88bae712015-03-06 09:54:52 -08002085 iter->tnode = pn;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002086 iter->index = 0;
2087 iter->depth = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002088 }
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002089
2090 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002091}
2092
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002093static void trie_collect_stats(struct trie *t, struct trie_stat *s)
Robert Olsson19baf832005-06-21 12:43:18 -07002094{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002095 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002096 struct fib_trie_iter iter;
Robert Olsson19baf832005-06-21 12:43:18 -07002097
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002098 memset(s, 0, sizeof(*s));
Robert Olsson19baf832005-06-21 12:43:18 -07002099
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002100 rcu_read_lock();
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002101 for (n = fib_trie_get_first(&iter, t); n; n = fib_trie_get_next(&iter)) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002102 if (IS_LEAF(n)) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002103 struct fib_alias *fa;
Stephen Hemminger93672292008-01-22 21:54:05 -08002104
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002105 s->leaves++;
2106 s->totdepth += iter.depth;
2107 if (iter.depth > s->maxdepth)
2108 s->maxdepth = iter.depth;
Stephen Hemminger93672292008-01-22 21:54:05 -08002109
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002110 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list)
Stephen Hemminger93672292008-01-22 21:54:05 -08002111 ++s->prefixes;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002112 } else {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002113 s->tnodes++;
Alexander Duyckadaf9812014-12-31 10:55:47 -08002114 if (n->bits < MAX_STAT_DEPTH)
2115 s->nodesizes[n->bits]++;
Alexander Duyck6e22d172015-03-06 09:54:39 -08002116 s->nullpointers += tn_info(n)->empty_children;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002117 }
2118 }
2119 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002120}
2121
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002122/*
Robert Olsson19baf832005-06-21 12:43:18 -07002123 * This outputs /proc/net/fib_triestats
Robert Olsson19baf832005-06-21 12:43:18 -07002124 */
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002125static void trie_show_stats(struct seq_file *seq, struct trie_stat *stat)
Robert Olsson19baf832005-06-21 12:43:18 -07002126{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002127 unsigned int i, max, pointers, bytes, avdepth;
Robert Olsson19baf832005-06-21 12:43:18 -07002128
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002129 if (stat->leaves)
2130 avdepth = stat->totdepth*100 / stat->leaves;
2131 else
2132 avdepth = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07002133
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002134 seq_printf(seq, "\tAver depth: %u.%02d\n",
2135 avdepth / 100, avdepth % 100);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002136 seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth);
Robert Olsson19baf832005-06-21 12:43:18 -07002137
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002138 seq_printf(seq, "\tLeaves: %u\n", stat->leaves);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002139 bytes = LEAF_SIZE * stat->leaves;
Stephen Hemminger93672292008-01-22 21:54:05 -08002140
2141 seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002142 bytes += sizeof(struct fib_alias) * stat->prefixes;
Stephen Hemminger93672292008-01-22 21:54:05 -08002143
Stephen Hemminger187b5182008-01-12 20:55:55 -08002144 seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002145 bytes += TNODE_SIZE(0) * stat->tnodes;
Robert Olsson19baf832005-06-21 12:43:18 -07002146
Robert Olsson06ef9212006-03-20 21:35:01 -08002147 max = MAX_STAT_DEPTH;
2148 while (max > 0 && stat->nodesizes[max-1] == 0)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002149 max--;
Robert Olsson19baf832005-06-21 12:43:18 -07002150
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002151 pointers = 0;
Jerry Snitselaarf585a992013-07-22 12:01:58 -07002152 for (i = 1; i < max; i++)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002153 if (stat->nodesizes[i] != 0) {
Stephen Hemminger187b5182008-01-12 20:55:55 -08002154 seq_printf(seq, " %u: %u", i, stat->nodesizes[i]);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002155 pointers += (1<<i) * stat->nodesizes[i];
2156 }
2157 seq_putc(seq, '\n');
Stephen Hemminger187b5182008-01-12 20:55:55 -08002158 seq_printf(seq, "\tPointers: %u\n", pointers);
Robert Olsson19baf832005-06-21 12:43:18 -07002159
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002160 bytes += sizeof(struct key_vector *) * pointers;
Stephen Hemminger187b5182008-01-12 20:55:55 -08002161 seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers);
2162 seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024);
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002163}
Robert Olsson19baf832005-06-21 12:43:18 -07002164
2165#ifdef CONFIG_IP_FIB_TRIE_STATS
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002166static void trie_show_usage(struct seq_file *seq,
Alexander Duyck8274a972014-12-31 10:55:29 -08002167 const struct trie_use_stats __percpu *stats)
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002168{
Alexander Duyck8274a972014-12-31 10:55:29 -08002169 struct trie_use_stats s = { 0 };
2170 int cpu;
2171
2172 /* loop through all of the CPUs and gather up the stats */
2173 for_each_possible_cpu(cpu) {
2174 const struct trie_use_stats *pcpu = per_cpu_ptr(stats, cpu);
2175
2176 s.gets += pcpu->gets;
2177 s.backtrack += pcpu->backtrack;
2178 s.semantic_match_passed += pcpu->semantic_match_passed;
2179 s.semantic_match_miss += pcpu->semantic_match_miss;
2180 s.null_node_hit += pcpu->null_node_hit;
2181 s.resize_node_skipped += pcpu->resize_node_skipped;
2182 }
2183
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002184 seq_printf(seq, "\nCounters:\n---------\n");
Alexander Duyck8274a972014-12-31 10:55:29 -08002185 seq_printf(seq, "gets = %u\n", s.gets);
2186 seq_printf(seq, "backtracks = %u\n", s.backtrack);
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002187 seq_printf(seq, "semantic match passed = %u\n",
Alexander Duyck8274a972014-12-31 10:55:29 -08002188 s.semantic_match_passed);
2189 seq_printf(seq, "semantic match miss = %u\n", s.semantic_match_miss);
2190 seq_printf(seq, "null node hit= %u\n", s.null_node_hit);
2191 seq_printf(seq, "skipped node resize = %u\n\n", s.resize_node_skipped);
Robert Olsson19baf832005-06-21 12:43:18 -07002192}
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002193#endif /* CONFIG_IP_FIB_TRIE_STATS */
2194
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002195static void fib_table_print(struct seq_file *seq, struct fib_table *tb)
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002196{
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002197 if (tb->tb_id == RT_TABLE_LOCAL)
2198 seq_puts(seq, "Local:\n");
2199 else if (tb->tb_id == RT_TABLE_MAIN)
2200 seq_puts(seq, "Main:\n");
2201 else
2202 seq_printf(seq, "Id %d:\n", tb->tb_id);
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002203}
Robert Olsson19baf832005-06-21 12:43:18 -07002204
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002205
Robert Olsson19baf832005-06-21 12:43:18 -07002206static int fib_triestat_seq_show(struct seq_file *seq, void *v)
2207{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002208 struct net *net = (struct net *)seq->private;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002209 unsigned int h;
Eric W. Biederman877a9bf2007-12-07 00:47:47 -08002210
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002211 seq_printf(seq,
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002212 "Basic info: size of leaf:"
2213 " %Zd bytes, size of tnode: %Zd bytes.\n",
Alexander Duyck41b489f2015-03-04 15:02:33 -08002214 LEAF_SIZE, TNODE_SIZE(0));
Olof Johansson91b9a272005-08-09 20:24:39 -07002215
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002216 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2217 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002218 struct fib_table *tb;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002219
Sasha Levinb67bfe02013-02-27 17:06:00 -08002220 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002221 struct trie *t = (struct trie *) tb->tb_data;
2222 struct trie_stat stat;
2223
2224 if (!t)
2225 continue;
2226
2227 fib_table_print(seq, tb);
2228
2229 trie_collect_stats(t, &stat);
2230 trie_show_stats(seq, &stat);
2231#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08002232 trie_show_usage(seq, t->stats);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002233#endif
2234 }
2235 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002236
Robert Olsson19baf832005-06-21 12:43:18 -07002237 return 0;
2238}
2239
Robert Olsson19baf832005-06-21 12:43:18 -07002240static int fib_triestat_seq_open(struct inode *inode, struct file *file)
2241{
Pavel Emelyanovde05c552008-07-18 04:07:21 -07002242 return single_open_net(inode, file, fib_triestat_seq_show);
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002243}
2244
Arjan van de Ven9a321442007-02-12 00:55:35 -08002245static const struct file_operations fib_triestat_fops = {
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002246 .owner = THIS_MODULE,
2247 .open = fib_triestat_seq_open,
2248 .read = seq_read,
2249 .llseek = seq_lseek,
Pavel Emelyanovb6fcbdb2008-07-18 04:07:44 -07002250 .release = single_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002251};
2252
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002253static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)
Robert Olsson19baf832005-06-21 12:43:18 -07002254{
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002255 struct fib_trie_iter *iter = seq->private;
2256 struct net *net = seq_file_net(seq);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002257 loff_t idx = 0;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002258 unsigned int h;
Robert Olsson19baf832005-06-21 12:43:18 -07002259
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002260 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2261 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002262 struct fib_table *tb;
2263
Sasha Levinb67bfe02013-02-27 17:06:00 -08002264 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002265 struct key_vector *n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002266
2267 for (n = fib_trie_get_first(iter,
2268 (struct trie *) tb->tb_data);
2269 n; n = fib_trie_get_next(iter))
2270 if (pos == idx++) {
2271 iter->tb = tb;
2272 return n;
2273 }
2274 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002275 }
Robert Olsson19baf832005-06-21 12:43:18 -07002276
Robert Olsson19baf832005-06-21 12:43:18 -07002277 return NULL;
2278}
2279
2280static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002281 __acquires(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002282{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002283 rcu_read_lock();
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002284 return fib_trie_get_idx(seq, *pos);
Robert Olsson19baf832005-06-21 12:43:18 -07002285}
2286
2287static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2288{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002289 struct fib_trie_iter *iter = seq->private;
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002290 struct net *net = seq_file_net(seq);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002291 struct fib_table *tb = iter->tb;
2292 struct hlist_node *tb_node;
2293 unsigned int h;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002294 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002295
Robert Olsson19baf832005-06-21 12:43:18 -07002296 ++*pos;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002297 /* next node in same table */
2298 n = fib_trie_get_next(iter);
2299 if (n)
2300 return n;
Olof Johansson91b9a272005-08-09 20:24:39 -07002301
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002302 /* walk rest of this hash chain */
2303 h = tb->tb_id & (FIB_TABLE_HASHSZ - 1);
Eric Dumazet0a5c0472011-03-31 01:51:35 -07002304 while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002305 tb = hlist_entry(tb_node, struct fib_table, tb_hlist);
2306 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2307 if (n)
2308 goto found;
2309 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002310
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002311 /* new hash chain */
2312 while (++h < FIB_TABLE_HASHSZ) {
2313 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Sasha Levinb67bfe02013-02-27 17:06:00 -08002314 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002315 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2316 if (n)
2317 goto found;
2318 }
2319 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002320 return NULL;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002321
2322found:
2323 iter->tb = tb;
2324 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002325}
2326
2327static void fib_trie_seq_stop(struct seq_file *seq, void *v)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002328 __releases(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002329{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002330 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002331}
2332
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002333static void seq_indent(struct seq_file *seq, int n)
2334{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002335 while (n-- > 0)
2336 seq_puts(seq, " ");
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002337}
Robert Olsson19baf832005-06-21 12:43:18 -07002338
Eric Dumazet28d36e32008-01-14 23:09:56 -08002339static inline const char *rtn_scope(char *buf, size_t len, enum rt_scope_t s)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002340{
Stephen Hemminger132adf52007-03-08 20:44:43 -08002341 switch (s) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002342 case RT_SCOPE_UNIVERSE: return "universe";
2343 case RT_SCOPE_SITE: return "site";
2344 case RT_SCOPE_LINK: return "link";
2345 case RT_SCOPE_HOST: return "host";
2346 case RT_SCOPE_NOWHERE: return "nowhere";
2347 default:
Eric Dumazet28d36e32008-01-14 23:09:56 -08002348 snprintf(buf, len, "scope=%d", s);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002349 return buf;
2350 }
2351}
2352
Jan Engelhardt36cbd3d2009-08-05 10:42:58 -07002353static const char *const rtn_type_names[__RTN_MAX] = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002354 [RTN_UNSPEC] = "UNSPEC",
2355 [RTN_UNICAST] = "UNICAST",
2356 [RTN_LOCAL] = "LOCAL",
2357 [RTN_BROADCAST] = "BROADCAST",
2358 [RTN_ANYCAST] = "ANYCAST",
2359 [RTN_MULTICAST] = "MULTICAST",
2360 [RTN_BLACKHOLE] = "BLACKHOLE",
2361 [RTN_UNREACHABLE] = "UNREACHABLE",
2362 [RTN_PROHIBIT] = "PROHIBIT",
2363 [RTN_THROW] = "THROW",
2364 [RTN_NAT] = "NAT",
2365 [RTN_XRESOLVE] = "XRESOLVE",
2366};
2367
Eric Dumazeta034ee32010-09-09 23:32:28 +00002368static inline const char *rtn_type(char *buf, size_t len, unsigned int t)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002369{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002370 if (t < __RTN_MAX && rtn_type_names[t])
2371 return rtn_type_names[t];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002372 snprintf(buf, len, "type %u", t);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002373 return buf;
2374}
2375
2376/* Pretty print the trie */
Robert Olsson19baf832005-06-21 12:43:18 -07002377static int fib_trie_seq_show(struct seq_file *seq, void *v)
2378{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002379 const struct fib_trie_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002380 struct key_vector *n = v;
Robert Olsson19baf832005-06-21 12:43:18 -07002381
Alexander Duyck88bae712015-03-06 09:54:52 -08002382 if (IS_TRIE(node_parent_rcu(n)))
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002383 fib_table_print(seq, iter->tb);
Robert Olsson095b8502007-01-26 19:06:01 -08002384
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002385 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002386 __be32 prf = htonl(n->key);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002387
Alexander Duycke9b44012014-12-31 10:56:12 -08002388 seq_indent(seq, iter->depth-1);
2389 seq_printf(seq, " +-- %pI4/%zu %u %u %u\n",
2390 &prf, KEYLENGTH - n->pos - n->bits, n->bits,
Alexander Duyck6e22d172015-03-06 09:54:39 -08002391 tn_info(n)->full_children,
2392 tn_info(n)->empty_children);
Olof Johansson91b9a272005-08-09 20:24:39 -07002393 } else {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002394 __be32 val = htonl(n->key);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002395 struct fib_alias *fa;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002396
2397 seq_indent(seq, iter->depth);
Harvey Harrison673d57e2008-10-31 00:53:57 -07002398 seq_printf(seq, " |-- %pI4\n", &val);
Eric Dumazet28d36e32008-01-14 23:09:56 -08002399
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002400 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
2401 char buf1[32], buf2[32];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002402
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002403 seq_indent(seq, iter->depth + 1);
2404 seq_printf(seq, " /%zu %s %s",
2405 KEYLENGTH - fa->fa_slen,
2406 rtn_scope(buf1, sizeof(buf1),
2407 fa->fa_info->fib_scope),
2408 rtn_type(buf2, sizeof(buf2),
2409 fa->fa_type));
2410 if (fa->fa_tos)
2411 seq_printf(seq, " tos=%d", fa->fa_tos);
2412 seq_putc(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002413 }
Robert Olsson19baf832005-06-21 12:43:18 -07002414 }
2415
2416 return 0;
2417}
2418
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002419static const struct seq_operations fib_trie_seq_ops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002420 .start = fib_trie_seq_start,
2421 .next = fib_trie_seq_next,
2422 .stop = fib_trie_seq_stop,
2423 .show = fib_trie_seq_show,
Robert Olsson19baf832005-06-21 12:43:18 -07002424};
2425
2426static int fib_trie_seq_open(struct inode *inode, struct file *file)
2427{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002428 return seq_open_net(inode, file, &fib_trie_seq_ops,
2429 sizeof(struct fib_trie_iter));
Robert Olsson19baf832005-06-21 12:43:18 -07002430}
2431
Arjan van de Ven9a321442007-02-12 00:55:35 -08002432static const struct file_operations fib_trie_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002433 .owner = THIS_MODULE,
2434 .open = fib_trie_seq_open,
2435 .read = seq_read,
2436 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002437 .release = seq_release_net,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002438};
2439
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002440struct fib_route_iter {
2441 struct seq_net_private p;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002442 struct fib_table *main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002443 struct key_vector *tnode;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002444 loff_t pos;
2445 t_key key;
2446};
2447
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002448static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,
2449 loff_t pos)
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002450{
Alexander Duyck8be33e92015-03-04 14:59:19 -08002451 struct fib_table *tb = iter->main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002452 struct key_vector *l, **tp = &iter->tnode;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002453 struct trie *t;
2454 t_key key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002455
Alexander Duyck8be33e92015-03-04 14:59:19 -08002456 /* use cache location of next-to-find key */
2457 if (iter->pos > 0 && pos >= iter->pos) {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002458 pos -= iter->pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002459 key = iter->key;
2460 } else {
2461 t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002462 iter->tnode = t->kv;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002463 iter->pos = 0;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002464 key = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002465 }
2466
Alexander Duyck8be33e92015-03-04 14:59:19 -08002467 while ((l = leaf_walk_rcu(tp, key)) != NULL) {
2468 key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002469 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002470
2471 if (pos-- <= 0)
2472 break;
2473
2474 l = NULL;
2475
2476 /* handle unlikely case of a key wrap */
2477 if (!key)
2478 break;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002479 }
2480
2481 if (l)
Alexander Duyck8be33e92015-03-04 14:59:19 -08002482 iter->key = key; /* remember it */
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002483 else
2484 iter->pos = 0; /* forget it */
2485
2486 return l;
2487}
2488
2489static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos)
2490 __acquires(RCU)
2491{
2492 struct fib_route_iter *iter = seq->private;
2493 struct fib_table *tb;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002494 struct trie *t;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002495
2496 rcu_read_lock();
Alexander Duyck8be33e92015-03-04 14:59:19 -08002497
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002498 tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN);
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002499 if (!tb)
2500 return NULL;
2501
Alexander Duyck8be33e92015-03-04 14:59:19 -08002502 iter->main_tb = tb;
2503
2504 if (*pos != 0)
2505 return fib_route_get_idx(iter, *pos);
2506
2507 t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002508 iter->tnode = t->kv;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002509 iter->pos = 0;
2510 iter->key = 0;
2511
2512 return SEQ_START_TOKEN;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002513}
2514
2515static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2516{
2517 struct fib_route_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002518 struct key_vector *l = NULL;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002519 t_key key = iter->key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002520
2521 ++*pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002522
2523 /* only allow key of 0 for start of sequence */
2524 if ((v == SEQ_START_TOKEN) || key)
2525 l = leaf_walk_rcu(&iter->tnode, key);
2526
2527 if (l) {
2528 iter->key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002529 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002530 } else {
2531 iter->pos = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002532 }
2533
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002534 return l;
2535}
2536
2537static void fib_route_seq_stop(struct seq_file *seq, void *v)
2538 __releases(RCU)
2539{
2540 rcu_read_unlock();
2541}
2542
Eric Dumazeta034ee32010-09-09 23:32:28 +00002543static unsigned int fib_flag_trans(int type, __be32 mask, const struct fib_info *fi)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002544{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002545 unsigned int flags = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002546
Eric Dumazeta034ee32010-09-09 23:32:28 +00002547 if (type == RTN_UNREACHABLE || type == RTN_PROHIBIT)
2548 flags = RTF_REJECT;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002549 if (fi && fi->fib_nh->nh_gw)
2550 flags |= RTF_GATEWAY;
Al Viro32ab5f82006-09-26 22:21:45 -07002551 if (mask == htonl(0xFFFFFFFF))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002552 flags |= RTF_HOST;
2553 flags |= RTF_UP;
2554 return flags;
2555}
2556
2557/*
2558 * This outputs /proc/net/route.
2559 * The format of the file is not supposed to be changed
Eric Dumazeta034ee32010-09-09 23:32:28 +00002560 * and needs to be same as fib_hash output to avoid breaking
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002561 * legacy utilities
2562 */
2563static int fib_route_seq_show(struct seq_file *seq, void *v)
2564{
Alexander Duyck654eff42015-03-11 16:36:08 -07002565 struct fib_route_iter *iter = seq->private;
2566 struct fib_table *tb = iter->main_tb;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002567 struct fib_alias *fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002568 struct key_vector *l = v;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002569 __be32 prefix;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002570
2571 if (v == SEQ_START_TOKEN) {
2572 seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway "
2573 "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU"
2574 "\tWindow\tIRTT");
2575 return 0;
2576 }
2577
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002578 prefix = htonl(l->key);
2579
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002580 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2581 const struct fib_info *fi = fa->fa_info;
2582 __be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen);
2583 unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002584
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002585 if ((fa->fa_type == RTN_BROADCAST) ||
2586 (fa->fa_type == RTN_MULTICAST))
2587 continue;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002588
Alexander Duyck654eff42015-03-11 16:36:08 -07002589 if (fa->tb_id != tb->tb_id)
2590 continue;
2591
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002592 seq_setwidth(seq, 127);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002593
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002594 if (fi)
2595 seq_printf(seq,
2596 "%s\t%08X\t%08X\t%04X\t%d\t%u\t"
2597 "%d\t%08X\t%d\t%u\t%u",
2598 fi->fib_dev ? fi->fib_dev->name : "*",
2599 prefix,
2600 fi->fib_nh->nh_gw, flags, 0, 0,
2601 fi->fib_priority,
2602 mask,
2603 (fi->fib_advmss ?
2604 fi->fib_advmss + 40 : 0),
2605 fi->fib_window,
2606 fi->fib_rtt >> 3);
2607 else
2608 seq_printf(seq,
2609 "*\t%08X\t%08X\t%04X\t%d\t%u\t"
2610 "%d\t%08X\t%d\t%u\t%u",
2611 prefix, 0, flags, 0, 0, 0,
2612 mask, 0, 0, 0);
Tetsuo Handa652586d2013-11-14 14:31:57 -08002613
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002614 seq_pad(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002615 }
2616
2617 return 0;
2618}
2619
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002620static const struct seq_operations fib_route_seq_ops = {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002621 .start = fib_route_seq_start,
2622 .next = fib_route_seq_next,
2623 .stop = fib_route_seq_stop,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002624 .show = fib_route_seq_show,
2625};
2626
2627static int fib_route_seq_open(struct inode *inode, struct file *file)
2628{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002629 return seq_open_net(inode, file, &fib_route_seq_ops,
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002630 sizeof(struct fib_route_iter));
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002631}
2632
Arjan van de Ven9a321442007-02-12 00:55:35 -08002633static const struct file_operations fib_route_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002634 .owner = THIS_MODULE,
2635 .open = fib_route_seq_open,
2636 .read = seq_read,
2637 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002638 .release = seq_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002639};
2640
Denis V. Lunev61a02652008-01-10 03:21:09 -08002641int __net_init fib_proc_init(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002642{
Gao fengd4beaa62013-02-18 01:34:54 +00002643 if (!proc_create("fib_trie", S_IRUGO, net->proc_net, &fib_trie_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002644 goto out1;
2645
Gao fengd4beaa62013-02-18 01:34:54 +00002646 if (!proc_create("fib_triestat", S_IRUGO, net->proc_net,
2647 &fib_triestat_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002648 goto out2;
2649
Gao fengd4beaa62013-02-18 01:34:54 +00002650 if (!proc_create("route", S_IRUGO, net->proc_net, &fib_route_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002651 goto out3;
2652
Robert Olsson19baf832005-06-21 12:43:18 -07002653 return 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002654
2655out3:
Gao fengece31ff2013-02-18 01:34:56 +00002656 remove_proc_entry("fib_triestat", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002657out2:
Gao fengece31ff2013-02-18 01:34:56 +00002658 remove_proc_entry("fib_trie", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002659out1:
2660 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07002661}
2662
Denis V. Lunev61a02652008-01-10 03:21:09 -08002663void __net_exit fib_proc_exit(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002664{
Gao fengece31ff2013-02-18 01:34:56 +00002665 remove_proc_entry("fib_trie", net->proc_net);
2666 remove_proc_entry("fib_triestat", net->proc_net);
2667 remove_proc_entry("route", net->proc_net);
Robert Olsson19baf832005-06-21 12:43:18 -07002668}
2669
2670#endif /* CONFIG_PROC_FS */