blob: d07fc076bea0a4bc96f68075fb3bb79b95007e63 [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>
David Ahernf6d3c192015-08-28 08:42:09 -070084#include <trace/events/fib.h>
Robert Olsson19baf832005-06-21 12:43:18 -070085#include "fib_lookup.h"
86
Robert Olsson06ef9212006-03-20 21:35:01 -080087#define MAX_STAT_DEPTH 32
Robert Olsson19baf832005-06-21 12:43:18 -070088
Alexander Duyck95f60ea2015-01-22 15:51:26 -080089#define KEYLENGTH (8*sizeof(t_key))
90#define KEY_MAX ((t_key)~0)
Robert Olsson19baf832005-06-21 12:43:18 -070091
Robert Olsson19baf832005-06-21 12:43:18 -070092typedef unsigned int t_key;
93
Alexander Duyck88bae712015-03-06 09:54:52 -080094#define IS_TRIE(n) ((n)->pos >= KEYLENGTH)
95#define IS_TNODE(n) ((n)->bits)
96#define IS_LEAF(n) (!(n)->bits)
Robert Olsson2373ce12005-08-25 13:01:29 -070097
Alexander Duyck35c6eda2015-03-06 09:54:08 -080098struct key_vector {
Alexander Duyck41b489f2015-03-04 15:02:33 -080099 t_key key;
100 unsigned char pos; /* 2log(KEYLENGTH) bits needed */
101 unsigned char bits; /* 2log(KEYLENGTH) bits needed */
102 unsigned char slen;
Alexander Duyckadaf9812014-12-31 10:55:47 -0800103 union {
Alexander Duyck41b489f2015-03-04 15:02:33 -0800104 /* This list pointer if valid if (pos | bits) == 0 (LEAF) */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800105 struct hlist_head leaf;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800106 /* This array is valid if (pos | bits) > 0 (TNODE) */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800107 struct key_vector __rcu *tnode[0];
Alexander Duyckadaf9812014-12-31 10:55:47 -0800108 };
Robert Olsson19baf832005-06-21 12:43:18 -0700109};
110
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800111struct tnode {
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800112 struct rcu_head rcu;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800113 t_key empty_children; /* KEYLENGTH bits needed */
114 t_key full_children; /* KEYLENGTH bits needed */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800115 struct key_vector __rcu *parent;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800116 struct key_vector kv[1];
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800117#define tn_bits kv[0].bits
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800118};
119
120#define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n])
Alexander Duyck41b489f2015-03-04 15:02:33 -0800121#define LEAF_SIZE TNODE_SIZE(1)
122
Robert Olsson19baf832005-06-21 12:43:18 -0700123#ifdef CONFIG_IP_FIB_TRIE_STATS
124struct trie_use_stats {
125 unsigned int gets;
126 unsigned int backtrack;
127 unsigned int semantic_match_passed;
128 unsigned int semantic_match_miss;
129 unsigned int null_node_hit;
Robert Olsson2f368952005-07-05 15:02:40 -0700130 unsigned int resize_node_skipped;
Robert Olsson19baf832005-06-21 12:43:18 -0700131};
132#endif
133
134struct trie_stat {
135 unsigned int totdepth;
136 unsigned int maxdepth;
137 unsigned int tnodes;
138 unsigned int leaves;
139 unsigned int nullpointers;
Stephen Hemminger93672292008-01-22 21:54:05 -0800140 unsigned int prefixes;
Robert Olsson06ef9212006-03-20 21:35:01 -0800141 unsigned int nodesizes[MAX_STAT_DEPTH];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700142};
Robert Olsson19baf832005-06-21 12:43:18 -0700143
144struct trie {
Alexander Duyck88bae712015-03-06 09:54:52 -0800145 struct key_vector kv[1];
Robert Olsson19baf832005-06-21 12:43:18 -0700146#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -0800147 struct trie_use_stats __percpu *stats;
Robert Olsson19baf832005-06-21 12:43:18 -0700148#endif
Robert Olsson19baf832005-06-21 12:43:18 -0700149};
150
Alexander Duyck88bae712015-03-06 09:54:52 -0800151static struct key_vector *resize(struct trie *t, struct key_vector *tn);
Jarek Poplawskic3059472009-07-14 08:33:08 +0000152static size_t tnode_free_size;
153
154/*
155 * synchronize_rcu after call_rcu for that many pages; it should be especially
156 * useful before resizing the root node with PREEMPT_NONE configs; the value was
157 * obtained experimentally, aiming to avoid visible slowdown.
158 */
159static const int sync_pages = 128;
Robert Olsson19baf832005-06-21 12:43:18 -0700160
Christoph Lametere18b8902006-12-06 20:33:20 -0800161static struct kmem_cache *fn_alias_kmem __read_mostly;
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -0800162static struct kmem_cache *trie_leaf_kmem __read_mostly;
Robert Olsson19baf832005-06-21 12:43:18 -0700163
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800164static inline struct tnode *tn_info(struct key_vector *kv)
165{
166 return container_of(kv, struct tnode, kv[0]);
167}
168
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800169/* caller must hold RTNL */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800170#define node_parent(tn) rtnl_dereference(tn_info(tn)->parent)
Alexander Duyck754baf82015-03-06 09:54:14 -0800171#define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700172
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800173/* caller must hold RCU read lock or RTNL */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800174#define node_parent_rcu(tn) rcu_dereference_rtnl(tn_info(tn)->parent)
Alexander Duyck754baf82015-03-06 09:54:14 -0800175#define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700176
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800177/* wrapper for rcu_assign_pointer */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800178static inline void node_set_parent(struct key_vector *n, struct key_vector *tp)
Stephen Hemminger06801912007-08-10 15:22:13 -0700179{
Alexander Duyckadaf9812014-12-31 10:55:47 -0800180 if (n)
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800181 rcu_assign_pointer(tn_info(n)->parent, tp);
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800182}
183
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800184#define NODE_INIT_PARENT(n, p) RCU_INIT_POINTER(tn_info(n)->parent, p)
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800185
186/* This provides us with the number of children in this node, in the case of a
187 * leaf this will return 0 meaning none of the children are accessible.
188 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800189static inline unsigned long child_length(const struct key_vector *tn)
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800190{
191 return (1ul << tn->bits) & ~(1ul);
Stephen Hemminger06801912007-08-10 15:22:13 -0700192}
Robert Olsson2373ce12005-08-25 13:01:29 -0700193
Alexander Duyck88bae712015-03-06 09:54:52 -0800194#define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos)
195
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800196static inline unsigned long get_index(t_key key, struct key_vector *kv)
197{
198 unsigned long index = key ^ kv->key;
199
Alexander Duyck88bae712015-03-06 09:54:52 -0800200 if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos))
201 return 0;
202
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800203 return index >> kv->pos;
204}
205
Alexander Duycke9b44012014-12-31 10:56:12 -0800206/* To understand this stuff, an understanding of keys and all their bits is
207 * necessary. Every node in the trie has a key associated with it, but not
208 * all of the bits in that key are significant.
209 *
210 * Consider a node 'n' and its parent 'tp'.
211 *
212 * If n is a leaf, every bit in its key is significant. Its presence is
213 * necessitated by path compression, since during a tree traversal (when
214 * searching for a leaf - unless we are doing an insertion) we will completely
215 * ignore all skipped bits we encounter. Thus we need to verify, at the end of
216 * a potentially successful search, that we have indeed been walking the
217 * correct key path.
218 *
219 * Note that we can never "miss" the correct key in the tree if present by
220 * following the wrong path. Path compression ensures that segments of the key
221 * that are the same for all keys with a given prefix are skipped, but the
222 * skipped part *is* identical for each node in the subtrie below the skipped
223 * bit! trie_insert() in this implementation takes care of that.
224 *
225 * if n is an internal node - a 'tnode' here, the various parts of its key
226 * have many different meanings.
227 *
228 * Example:
229 * _________________________________________________________________
230 * | i | i | i | i | i | i | i | N | N | N | S | S | S | S | S | C |
231 * -----------------------------------------------------------------
232 * 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16
233 *
234 * _________________________________________________________________
235 * | C | C | C | u | u | u | u | u | u | u | u | u | u | u | u | u |
236 * -----------------------------------------------------------------
237 * 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
238 *
239 * tp->pos = 22
240 * tp->bits = 3
241 * n->pos = 13
242 * n->bits = 4
243 *
244 * First, let's just ignore the bits that come before the parent tp, that is
245 * the bits from (tp->pos + tp->bits) to 31. They are *known* but at this
246 * point we do not use them for anything.
247 *
248 * The bits from (tp->pos) to (tp->pos + tp->bits - 1) - "N", above - are the
249 * index into the parent's child array. That is, they will be used to find
250 * 'n' among tp's children.
251 *
252 * The bits from (n->pos + n->bits) to (tn->pos - 1) - "S" - are skipped bits
253 * for the node n.
254 *
255 * All the bits we have seen so far are significant to the node n. The rest
256 * of the bits are really not needed or indeed known in n->key.
257 *
258 * The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into
259 * n's child array, and will of course be different for each child.
260 *
261 * The rest of the bits, from 0 to (n->pos + n->bits), are completely unknown
262 * at this point.
263 */
Robert Olsson19baf832005-06-21 12:43:18 -0700264
Denis V. Lunevf5026fa2007-12-13 09:47:57 -0800265static const int halve_threshold = 25;
266static const int inflate_threshold = 50;
Jarek Poplawski345aa032009-07-07 19:39:16 -0700267static const int halve_threshold_root = 15;
Jens Låås80b71b82009-08-28 23:57:15 -0700268static const int inflate_threshold_root = 30;
Robert Olsson2373ce12005-08-25 13:01:29 -0700269
270static void __alias_free_mem(struct rcu_head *head)
271{
272 struct fib_alias *fa = container_of(head, struct fib_alias, rcu);
273 kmem_cache_free(fn_alias_kmem, fa);
274}
275
276static inline void alias_free_mem_rcu(struct fib_alias *fa)
277{
278 call_rcu(&fa->rcu, __alias_free_mem);
279}
280
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800281#define TNODE_KMALLOC_MAX \
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800282 ilog2((PAGE_SIZE - TNODE_SIZE(0)) / sizeof(struct key_vector *))
Alexander Duyck1de3d872015-03-04 15:04:46 -0800283#define TNODE_VMALLOC_MAX \
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800284 ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800285
286static void __node_free_rcu(struct rcu_head *head)
Robert Olsson2373ce12005-08-25 13:01:29 -0700287{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800288 struct tnode *n = container_of(head, struct tnode, rcu);
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800289
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800290 if (!n->tn_bits)
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800291 kmem_cache_free(trie_leaf_kmem, n);
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800292 else
Tetsuo Handa1d5cfdb2016-01-22 15:11:02 -0800293 kvfree(n);
Robert Olsson2373ce12005-08-25 13:01:29 -0700294}
295
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800296#define node_free(n) call_rcu(&tn_info(n)->rcu, __node_free_rcu)
Stephen Hemminger387a5482008-04-10 03:47:34 -0700297
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800298static struct tnode *tnode_alloc(int bits)
Robert Olsson2373ce12005-08-25 13:01:29 -0700299{
Alexander Duyck1de3d872015-03-04 15:04:46 -0800300 size_t size;
301
302 /* verify bits is within bounds */
303 if (bits > TNODE_VMALLOC_MAX)
304 return NULL;
305
306 /* determine size and verify it is non-zero and didn't overflow */
307 size = TNODE_SIZE(1ul << bits);
308
Robert Olsson2373ce12005-08-25 13:01:29 -0700309 if (size <= PAGE_SIZE)
Eric Dumazet8d965442008-01-13 22:31:44 -0800310 return kzalloc(size, GFP_KERNEL);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700311 else
Eric Dumazet7a1c8e52010-11-20 07:46:35 +0000312 return vzalloc(size);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700313}
Robert Olsson2373ce12005-08-25 13:01:29 -0700314
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800315static inline void empty_child_inc(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800316{
Alexander Duyck6e22d172015-03-06 09:54:39 -0800317 ++tn_info(n)->empty_children ? : ++tn_info(n)->full_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800318}
319
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800320static inline void empty_child_dec(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800321{
Alexander Duyck6e22d172015-03-06 09:54:39 -0800322 tn_info(n)->empty_children-- ? : tn_info(n)->full_children--;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800323}
324
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800325static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)
Robert Olsson19baf832005-06-21 12:43:18 -0700326{
Firo Yangf38b24c2015-06-08 11:54:51 +0800327 struct key_vector *l;
328 struct tnode *kv;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800329
Firo Yangf38b24c2015-06-08 11:54:51 +0800330 kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800331 if (!kv)
332 return NULL;
333
334 /* initialize key vector */
Firo Yangf38b24c2015-06-08 11:54:51 +0800335 l = kv->kv;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800336 l->key = key;
337 l->pos = 0;
338 l->bits = 0;
339 l->slen = fa->fa_slen;
340
341 /* link leaf to fib alias */
342 INIT_HLIST_HEAD(&l->leaf);
343 hlist_add_head(&fa->fa_list, &l->leaf);
344
Robert Olsson19baf832005-06-21 12:43:18 -0700345 return l;
346}
347
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800348static struct key_vector *tnode_new(t_key key, int pos, int bits)
Robert Olsson19baf832005-06-21 12:43:18 -0700349{
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800350 unsigned int shift = pos + bits;
Firo Yangf38b24c2015-06-08 11:54:51 +0800351 struct key_vector *tn;
352 struct tnode *tnode;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800353
354 /* verify bits and pos their msb bits clear and values are valid */
355 BUG_ON(!bits || (shift > KEYLENGTH));
Robert Olsson19baf832005-06-21 12:43:18 -0700356
Firo Yangf38b24c2015-06-08 11:54:51 +0800357 tnode = tnode_alloc(bits);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800358 if (!tnode)
359 return NULL;
360
Firo Yangf38b24c2015-06-08 11:54:51 +0800361 pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0),
362 sizeof(struct key_vector *) << bits);
363
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800364 if (bits == KEYLENGTH)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800365 tnode->full_children = 1;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800366 else
Alexander Duyck6e22d172015-03-06 09:54:39 -0800367 tnode->empty_children = 1ul << bits;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800368
Firo Yangf38b24c2015-06-08 11:54:51 +0800369 tn = tnode->kv;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800370 tn->key = (shift < KEYLENGTH) ? (key >> shift) << shift : 0;
371 tn->pos = pos;
372 tn->bits = bits;
373 tn->slen = pos;
374
Robert Olsson19baf832005-06-21 12:43:18 -0700375 return tn;
376}
377
Alexander Duycke9b44012014-12-31 10:56:12 -0800378/* Check whether a tnode 'n' is "full", i.e. it is an internal node
Robert Olsson19baf832005-06-21 12:43:18 -0700379 * and no bits are skipped. See discussion in dyntree paper p. 6
380 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800381static inline int tnode_full(struct key_vector *tn, struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700382{
Alexander Duycke9b44012014-12-31 10:56:12 -0800383 return n && ((n->pos + n->bits) == tn->pos) && IS_TNODE(n);
Robert Olsson19baf832005-06-21 12:43:18 -0700384}
385
Alexander Duyckff181ed2014-12-31 10:56:43 -0800386/* Add a child at position i overwriting the old value.
387 * Update the value of full_children and empty_children.
388 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800389static void put_child(struct key_vector *tn, unsigned long i,
390 struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700391{
Alexander Duyck754baf82015-03-06 09:54:14 -0800392 struct key_vector *chi = get_child(tn, i);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800393 int isfull, wasfull;
Robert Olsson19baf832005-06-21 12:43:18 -0700394
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800395 BUG_ON(i >= child_length(tn));
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700396
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800397 /* update emptyChildren, overflow into fullChildren */
Ian Morris00db4122015-04-03 09:17:27 +0100398 if (!n && chi)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800399 empty_child_inc(tn);
Ian Morris00db4122015-04-03 09:17:27 +0100400 if (n && !chi)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800401 empty_child_dec(tn);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700402
Robert Olsson19baf832005-06-21 12:43:18 -0700403 /* update fullChildren */
Alexander Duyckff181ed2014-12-31 10:56:43 -0800404 wasfull = tnode_full(tn, chi);
Robert Olsson19baf832005-06-21 12:43:18 -0700405 isfull = tnode_full(tn, n);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800406
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700407 if (wasfull && !isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800408 tn_info(tn)->full_children--;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700409 else if (!wasfull && isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800410 tn_info(tn)->full_children++;
Olof Johansson91b9a272005-08-09 20:24:39 -0700411
Alexander Duyck5405afd2014-12-31 10:57:08 -0800412 if (n && (tn->slen < n->slen))
413 tn->slen = n->slen;
414
Alexander Duyck41b489f2015-03-04 15:02:33 -0800415 rcu_assign_pointer(tn->tnode[i], n);
Robert Olsson19baf832005-06-21 12:43:18 -0700416}
417
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800418static void update_children(struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800419{
420 unsigned long i;
421
422 /* update all of the child parent pointers */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800423 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800424 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800425
426 if (!inode)
427 continue;
428
429 /* Either update the children of a tnode that
430 * already belongs to us or update the child
431 * to point to ourselves.
432 */
433 if (node_parent(inode) == tn)
434 update_children(inode);
435 else
436 node_set_parent(inode, tn);
437 }
438}
439
Alexander Duyck88bae712015-03-06 09:54:52 -0800440static inline void put_child_root(struct key_vector *tp, t_key key,
441 struct key_vector *n)
Alexander Duyck836a0122014-12-31 10:56:06 -0800442{
Alexander Duyck88bae712015-03-06 09:54:52 -0800443 if (IS_TRIE(tp))
444 rcu_assign_pointer(tp->tnode[0], n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800445 else
Alexander Duyck88bae712015-03-06 09:54:52 -0800446 put_child(tp, get_index(key, tp), n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800447}
448
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800449static inline void tnode_free_init(struct key_vector *tn)
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700450{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800451 tn_info(tn)->rcu.next = NULL;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800452}
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700453
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800454static inline void tnode_free_append(struct key_vector *tn,
455 struct key_vector *n)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800456{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800457 tn_info(n)->rcu.next = tn_info(tn)->rcu.next;
458 tn_info(tn)->rcu.next = &tn_info(n)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800459}
460
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800461static void tnode_free(struct key_vector *tn)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800462{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800463 struct callback_head *head = &tn_info(tn)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800464
465 while (head) {
466 head = head->next;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800467 tnode_free_size += TNODE_SIZE(1ul << tn->bits);
Alexander Duyckfc86a932014-12-31 10:56:49 -0800468 node_free(tn);
469
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800470 tn = container_of(head, struct tnode, rcu)->kv;
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700471 }
Alexander Duyckfc86a932014-12-31 10:56:49 -0800472
473 if (tnode_free_size >= PAGE_SIZE * sync_pages) {
474 tnode_free_size = 0;
475 synchronize_rcu();
476 }
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700477}
478
Alexander Duyck88bae712015-03-06 09:54:52 -0800479static struct key_vector *replace(struct trie *t,
480 struct key_vector *oldtnode,
481 struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800482{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800483 struct key_vector *tp = node_parent(oldtnode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800484 unsigned long i;
485
486 /* setup the parent pointer out of and back into this node */
487 NODE_INIT_PARENT(tn, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -0800488 put_child_root(tp, tn->key, tn);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800489
490 /* update all of the child parent pointers */
491 update_children(tn);
492
493 /* all pointers should be clean so we are done */
494 tnode_free(oldtnode);
495
496 /* resize children now that oldtnode is freed */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800497 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800498 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800499
500 /* resize child node */
501 if (tnode_full(tn, inode))
Alexander Duyck88bae712015-03-06 09:54:52 -0800502 tn = resize(t, inode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800503 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800504
Alexander Duyck88bae712015-03-06 09:54:52 -0800505 return tp;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800506}
507
Alexander Duyck88bae712015-03-06 09:54:52 -0800508static struct key_vector *inflate(struct trie *t,
509 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700510{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800511 struct key_vector *tn;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800512 unsigned long i;
Alexander Duycke9b44012014-12-31 10:56:12 -0800513 t_key m;
Robert Olsson19baf832005-06-21 12:43:18 -0700514
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700515 pr_debug("In inflate\n");
Robert Olsson19baf832005-06-21 12:43:18 -0700516
Alexander Duycke9b44012014-12-31 10:56:12 -0800517 tn = tnode_new(oldtnode->key, oldtnode->pos - 1, oldtnode->bits + 1);
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700518 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800519 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700520
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800521 /* prepare oldtnode to be freed */
522 tnode_free_init(oldtnode);
523
Alexander Duyck12c081a2014-12-31 10:56:55 -0800524 /* Assemble all of the pointers in our cluster, in this case that
525 * represents all of the pointers out of our allocated nodes that
526 * point to existing tnodes and the links between our allocated
527 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700528 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800529 for (i = child_length(oldtnode), m = 1u << tn->pos; i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800530 struct key_vector *inode = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800531 struct key_vector *node0, *node1;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800532 unsigned long j, k;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700533
Robert Olsson19baf832005-06-21 12:43:18 -0700534 /* An empty child */
Ian Morris51456b22015-04-03 09:17:26 +0100535 if (!inode)
Robert Olsson19baf832005-06-21 12:43:18 -0700536 continue;
537
538 /* A leaf or an internal node with skipped bits */
Alexander Duyckadaf9812014-12-31 10:55:47 -0800539 if (!tnode_full(oldtnode, inode)) {
Alexander Duycke9b44012014-12-31 10:56:12 -0800540 put_child(tn, get_index(inode->key, tn), inode);
Robert Olsson19baf832005-06-21 12:43:18 -0700541 continue;
542 }
543
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800544 /* drop the node in the old tnode free list */
545 tnode_free_append(oldtnode, inode);
546
Robert Olsson19baf832005-06-21 12:43:18 -0700547 /* An internal node with two children */
Robert Olsson19baf832005-06-21 12:43:18 -0700548 if (inode->bits == 1) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800549 put_child(tn, 2 * i + 1, get_child(inode, 1));
550 put_child(tn, 2 * i, get_child(inode, 0));
Olof Johansson91b9a272005-08-09 20:24:39 -0700551 continue;
Robert Olsson19baf832005-06-21 12:43:18 -0700552 }
553
Olof Johansson91b9a272005-08-09 20:24:39 -0700554 /* We will replace this node 'inode' with two new
Alexander Duyck12c081a2014-12-31 10:56:55 -0800555 * ones, 'node0' and 'node1', each with half of the
Olof Johansson91b9a272005-08-09 20:24:39 -0700556 * original children. The two new nodes will have
557 * a position one bit further down the key and this
558 * means that the "significant" part of their keys
559 * (see the discussion near the top of this file)
560 * will differ by one bit, which will be "0" in
Alexander Duyck12c081a2014-12-31 10:56:55 -0800561 * node0's key and "1" in node1's key. Since we are
Olof Johansson91b9a272005-08-09 20:24:39 -0700562 * moving the key position by one step, the bit that
563 * we are moving away from - the bit at position
Alexander Duyck12c081a2014-12-31 10:56:55 -0800564 * (tn->pos) - is the one that will differ between
565 * node0 and node1. So... we synthesize that bit in the
566 * two new keys.
Olof Johansson91b9a272005-08-09 20:24:39 -0700567 */
Alexander Duyck12c081a2014-12-31 10:56:55 -0800568 node1 = tnode_new(inode->key | m, inode->pos, inode->bits - 1);
569 if (!node1)
570 goto nomem;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800571 node0 = tnode_new(inode->key, inode->pos, inode->bits - 1);
Robert Olsson19baf832005-06-21 12:43:18 -0700572
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800573 tnode_free_append(tn, node1);
Alexander Duyck12c081a2014-12-31 10:56:55 -0800574 if (!node0)
575 goto nomem;
576 tnode_free_append(tn, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700577
Alexander Duyck12c081a2014-12-31 10:56:55 -0800578 /* populate child pointers in new nodes */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800579 for (k = child_length(inode), j = k / 2; j;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800580 put_child(node1, --j, get_child(inode, --k));
581 put_child(node0, j, get_child(inode, j));
582 put_child(node1, --j, get_child(inode, --k));
583 put_child(node0, j, get_child(inode, j));
Robert Olsson19baf832005-06-21 12:43:18 -0700584 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800585
Alexander Duyck12c081a2014-12-31 10:56:55 -0800586 /* link new nodes to parent */
587 NODE_INIT_PARENT(node1, tn);
588 NODE_INIT_PARENT(node0, tn);
Olof Johansson91b9a272005-08-09 20:24:39 -0700589
Alexander Duyck12c081a2014-12-31 10:56:55 -0800590 /* link parent to nodes */
591 put_child(tn, 2 * i + 1, node1);
592 put_child(tn, 2 * i, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700593 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800594
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800595 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800596 return replace(t, oldtnode, tn);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700597nomem:
Alexander Duyckfc86a932014-12-31 10:56:49 -0800598 /* all pointers should be clean so we are done */
599 tnode_free(tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800600notnode:
601 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700602}
603
Alexander Duyck88bae712015-03-06 09:54:52 -0800604static struct key_vector *halve(struct trie *t,
605 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700606{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800607 struct key_vector *tn;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800608 unsigned long i;
Robert Olsson19baf832005-06-21 12:43:18 -0700609
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700610 pr_debug("In halve\n");
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700611
Alexander Duycke9b44012014-12-31 10:56:12 -0800612 tn = tnode_new(oldtnode->key, oldtnode->pos + 1, oldtnode->bits - 1);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700613 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800614 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700615
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800616 /* prepare oldtnode to be freed */
617 tnode_free_init(oldtnode);
618
Alexander Duyck12c081a2014-12-31 10:56:55 -0800619 /* Assemble all of the pointers in our cluster, in this case that
620 * represents all of the pointers out of our allocated nodes that
621 * point to existing tnodes and the links between our allocated
622 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700623 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800624 for (i = child_length(oldtnode); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800625 struct key_vector *node1 = get_child(oldtnode, --i);
626 struct key_vector *node0 = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800627 struct key_vector *inode;
Robert Olsson2f368952005-07-05 15:02:40 -0700628
Alexander Duyck12c081a2014-12-31 10:56:55 -0800629 /* At least one of the children is empty */
630 if (!node1 || !node0) {
631 put_child(tn, i / 2, node1 ? : node0);
632 continue;
Robert Olsson2f368952005-07-05 15:02:40 -0700633 }
Robert Olsson2f368952005-07-05 15:02:40 -0700634
Alexander Duyck12c081a2014-12-31 10:56:55 -0800635 /* Two nonempty children */
636 inode = tnode_new(node0->key, oldtnode->pos, 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800637 if (!inode)
638 goto nomem;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800639 tnode_free_append(tn, inode);
640
641 /* initialize pointers out of node */
642 put_child(inode, 1, node1);
643 put_child(inode, 0, node0);
644 NODE_INIT_PARENT(inode, tn);
645
646 /* link parent to node */
647 put_child(tn, i / 2, inode);
Robert Olsson2f368952005-07-05 15:02:40 -0700648 }
Robert Olsson19baf832005-06-21 12:43:18 -0700649
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800650 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800651 return replace(t, oldtnode, tn);
652nomem:
653 /* all pointers should be clean so we are done */
654 tnode_free(tn);
655notnode:
656 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700657}
658
Alexander Duyck88bae712015-03-06 09:54:52 -0800659static struct key_vector *collapse(struct trie *t,
660 struct key_vector *oldtnode)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800661{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800662 struct key_vector *n, *tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800663 unsigned long i;
664
665 /* scan the tnode looking for that one child that might still exist */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800666 for (n = NULL, i = child_length(oldtnode); !n && i;)
Alexander Duyck754baf82015-03-06 09:54:14 -0800667 n = get_child(oldtnode, --i);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800668
669 /* compress one level */
670 tp = node_parent(oldtnode);
Alexander Duyck88bae712015-03-06 09:54:52 -0800671 put_child_root(tp, oldtnode->key, n);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800672 node_set_parent(n, tp);
673
674 /* drop dead node */
675 node_free(oldtnode);
Alexander Duyck88bae712015-03-06 09:54:52 -0800676
677 return tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800678}
679
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800680static unsigned char update_suffix(struct key_vector *tn)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800681{
682 unsigned char slen = tn->pos;
683 unsigned long stride, i;
684
685 /* search though the list of children looking for nodes that might
686 * have a suffix greater than the one we currently have. This is
687 * why we start with a stride of 2 since a stride of 1 would
688 * represent the nodes with suffix length equal to tn->pos
689 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800690 for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800691 struct key_vector *n = get_child(tn, i);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800692
693 if (!n || (n->slen <= slen))
694 continue;
695
696 /* update stride and slen based on new value */
697 stride <<= (n->slen - slen);
698 slen = n->slen;
699 i &= ~(stride - 1);
700
701 /* if slen covers all but the last bit we can stop here
702 * there will be nothing longer than that since only node
703 * 0 and 1 << (bits - 1) could have that as their suffix
704 * length.
705 */
706 if ((slen + 1) >= (tn->pos + tn->bits))
707 break;
708 }
709
710 tn->slen = slen;
711
712 return slen;
713}
714
Alexander Duyckf05a4812014-12-31 10:56:37 -0800715/* From "Implementing a dynamic compressed trie" by Stefan Nilsson of
716 * the Helsinki University of Technology and Matti Tikkanen of Nokia
717 * Telecommunications, page 6:
718 * "A node is doubled if the ratio of non-empty children to all
719 * children in the *doubled* node is at least 'high'."
720 *
721 * 'high' in this instance is the variable 'inflate_threshold'. It
722 * is expressed as a percentage, so we multiply it with
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800723 * child_length() and instead of multiplying by 2 (since the
Alexander Duyckf05a4812014-12-31 10:56:37 -0800724 * child array will be doubled by inflate()) and multiplying
725 * the left-hand side by 100 (to handle the percentage thing) we
726 * multiply the left-hand side by 50.
727 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800728 * The left-hand side may look a bit weird: child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800729 * - tn->empty_children is of course the number of non-null children
730 * in the current node. tn->full_children is the number of "full"
731 * children, that is non-null tnodes with a skip value of 0.
732 * All of those will be doubled in the resulting inflated tnode, so
733 * we just count them one extra time here.
734 *
735 * A clearer way to write this would be:
736 *
737 * to_be_doubled = tn->full_children;
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800738 * not_to_be_doubled = child_length(tn) - tn->empty_children -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800739 * tn->full_children;
740 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800741 * new_child_length = child_length(tn) * 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800742 *
743 * new_fill_factor = 100 * (not_to_be_doubled + 2*to_be_doubled) /
744 * new_child_length;
745 * if (new_fill_factor >= inflate_threshold)
746 *
747 * ...and so on, tho it would mess up the while () loop.
748 *
749 * anyway,
750 * 100 * (not_to_be_doubled + 2*to_be_doubled) / new_child_length >=
751 * inflate_threshold
752 *
753 * avoid a division:
754 * 100 * (not_to_be_doubled + 2*to_be_doubled) >=
755 * inflate_threshold * new_child_length
756 *
757 * expand not_to_be_doubled and to_be_doubled, and shorten:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800758 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800759 * tn->full_children) >= inflate_threshold * new_child_length
760 *
761 * expand new_child_length:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800762 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800763 * tn->full_children) >=
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800764 * inflate_threshold * child_length(tn) * 2
Alexander Duyckf05a4812014-12-31 10:56:37 -0800765 *
766 * shorten again:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800767 * 50 * (tn->full_children + child_length(tn) -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800768 * tn->empty_children) >= inflate_threshold *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800769 * child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800770 *
771 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800772static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800773{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800774 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800775 unsigned long threshold = used;
776
777 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800778 threshold *= IS_TRIE(tp) ? inflate_threshold_root : inflate_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800779 used -= tn_info(tn)->empty_children;
780 used += tn_info(tn)->full_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800781
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800782 /* if bits == KEYLENGTH then pos = 0, and will fail below */
783
784 return (used > 1) && tn->pos && ((50 * used) >= threshold);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800785}
786
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800787static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800788{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800789 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800790 unsigned long threshold = used;
791
792 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800793 threshold *= IS_TRIE(tp) ? halve_threshold_root : halve_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800794 used -= tn_info(tn)->empty_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800795
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800796 /* if bits == KEYLENGTH then used = 100% on wrap, and will fail below */
797
798 return (used > 1) && (tn->bits > 1) && ((100 * used) < threshold);
799}
800
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800801static inline bool should_collapse(struct key_vector *tn)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800802{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800803 unsigned long used = child_length(tn);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800804
Alexander Duyck6e22d172015-03-06 09:54:39 -0800805 used -= tn_info(tn)->empty_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800806
807 /* account for bits == KEYLENGTH case */
Alexander Duyck6e22d172015-03-06 09:54:39 -0800808 if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800809 used -= KEY_MAX;
810
811 /* One child or none, time to drop us from the trie */
812 return used < 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800813}
814
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800815#define MAX_WORK 10
Alexander Duyck88bae712015-03-06 09:54:52 -0800816static struct key_vector *resize(struct trie *t, struct key_vector *tn)
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800817{
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800818#ifdef CONFIG_IP_FIB_TRIE_STATS
819 struct trie_use_stats __percpu *stats = t->stats;
820#endif
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800821 struct key_vector *tp = node_parent(tn);
Alexander Duyck88bae712015-03-06 09:54:52 -0800822 unsigned long cindex = get_index(tn->key, tp);
Alexander Duycka80e89d2015-01-22 15:51:20 -0800823 int max_work = MAX_WORK;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800824
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800825 pr_debug("In tnode_resize %p inflate_threshold=%d threshold=%d\n",
826 tn, inflate_threshold, halve_threshold);
827
Alexander Duyckff181ed2014-12-31 10:56:43 -0800828 /* track the tnode via the pointer from the parent instead of
829 * doing it ourselves. This way we can let RCU fully do its
830 * thing without us interfering
831 */
Alexander Duyck88bae712015-03-06 09:54:52 -0800832 BUG_ON(tn != get_child(tp, cindex));
Alexander Duyckff181ed2014-12-31 10:56:43 -0800833
Alexander Duyckf05a4812014-12-31 10:56:37 -0800834 /* Double as long as the resulting node has a number of
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800835 * nonempty nodes that are above the threshold.
836 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700837 while (should_inflate(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800838 tp = inflate(t, tn);
839 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800840#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800841 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800842#endif
843 break;
844 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800845
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700846 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800847 tn = get_child(tp, cindex);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800848 }
849
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700850 /* update parent in case inflate failed */
851 tp = node_parent(tn);
852
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800853 /* Return if at least one inflate is run */
854 if (max_work != MAX_WORK)
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700855 return tp;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800856
Alexander Duyckf05a4812014-12-31 10:56:37 -0800857 /* Halve as long as the number of empty children in this
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800858 * node is above threshold.
859 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700860 while (should_halve(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800861 tp = halve(t, tn);
862 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800863#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800864 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800865#endif
866 break;
867 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800868
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700869 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800870 tn = get_child(tp, cindex);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800871 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800872
873 /* Only one child remains */
Alexander Duyck88bae712015-03-06 09:54:52 -0800874 if (should_collapse(tn))
875 return collapse(t, tn);
876
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700877 /* update parent in case halve failed */
Alexander Duyck88bae712015-03-06 09:54:52 -0800878 tp = node_parent(tn);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800879
880 /* Return if at least one deflate was run */
881 if (max_work != MAX_WORK)
Alexander Duyck88bae712015-03-06 09:54:52 -0800882 return tp;
Alexander Duyck5405afd2014-12-31 10:57:08 -0800883
884 /* push the suffix length to the parent node */
885 if (tn->slen > tn->pos) {
886 unsigned char slen = update_suffix(tn);
887
Alexander Duyck88bae712015-03-06 09:54:52 -0800888 if (slen > tp->slen)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800889 tp->slen = slen;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800890 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800891
Alexander Duyck88bae712015-03-06 09:54:52 -0800892 return tp;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800893}
894
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800895static void leaf_pull_suffix(struct key_vector *tp, struct key_vector *l)
Robert Olsson19baf832005-06-21 12:43:18 -0700896{
Alexander Duyck88bae712015-03-06 09:54:52 -0800897 while ((tp->slen > tp->pos) && (tp->slen > l->slen)) {
Alexander Duyck5405afd2014-12-31 10:57:08 -0800898 if (update_suffix(tp) > l->slen)
899 break;
900 tp = node_parent(tp);
901 }
902}
903
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800904static void leaf_push_suffix(struct key_vector *tn, struct key_vector *l)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800905{
Alexander Duyck5405afd2014-12-31 10:57:08 -0800906 /* if this is a new leaf then tn will be NULL and we can sort
907 * out parent suffix lengths as a part of trie_rebalance
908 */
Alexander Duyck88bae712015-03-06 09:54:52 -0800909 while (tn->slen < l->slen) {
Alexander Duyck5405afd2014-12-31 10:57:08 -0800910 tn->slen = l->slen;
911 tn = node_parent(tn);
912 }
913}
914
Robert Olsson2373ce12005-08-25 13:01:29 -0700915/* rcu_read_lock needs to be hold by caller from readside */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800916static struct key_vector *fib_find_node(struct trie *t,
917 struct key_vector **tp, u32 key)
Robert Olsson19baf832005-06-21 12:43:18 -0700918{
Alexander Duyck88bae712015-03-06 09:54:52 -0800919 struct key_vector *pn, *n = t->kv;
920 unsigned long index = 0;
Robert Olsson19baf832005-06-21 12:43:18 -0700921
Alexander Duyck88bae712015-03-06 09:54:52 -0800922 do {
923 pn = n;
924 n = get_child_rcu(n, index);
925
926 if (!n)
927 break;
928
929 index = get_cindex(key, n);
Alexander Duyck939afb02014-12-31 10:56:00 -0800930
931 /* This bit of code is a bit tricky but it combines multiple
932 * checks into a single check. The prefix consists of the
933 * prefix plus zeros for the bits in the cindex. The index
934 * is the difference between the key and this value. From
935 * this we can actually derive several pieces of data.
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800936 * if (index >= (1ul << bits))
Alexander Duyck939afb02014-12-31 10:56:00 -0800937 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -0800938 * else
939 * we know the value is cindex
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800940 *
941 * This check is safe even if bits == KEYLENGTH due to the
942 * fact that we can only allocate a node with 32 bits if a
943 * long is greater than 32 bits.
Alexander Duyck939afb02014-12-31 10:56:00 -0800944 */
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800945 if (index >= (1ul << n->bits)) {
946 n = NULL;
947 break;
948 }
Alexander Duyck939afb02014-12-31 10:56:00 -0800949
Alexander Duyck88bae712015-03-06 09:54:52 -0800950 /* keep searching until we find a perfect match leaf or NULL */
951 } while (IS_TNODE(n));
Robert Olsson19baf832005-06-21 12:43:18 -0700952
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800953 *tp = pn;
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800954
Alexander Duyck939afb02014-12-31 10:56:00 -0800955 return n;
Robert Olsson19baf832005-06-21 12:43:18 -0700956}
957
Alexander Duyck02525362015-01-22 15:51:39 -0800958/* Return the first fib alias matching TOS with
959 * priority less than or equal to PRIO.
960 */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800961static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen,
Alexander Duyck0b65bd92015-03-12 14:46:29 -0700962 u8 tos, u32 prio, u32 tb_id)
Alexander Duyck02525362015-01-22 15:51:39 -0800963{
964 struct fib_alias *fa;
965
966 if (!fah)
967 return NULL;
968
Alexander Duyck56315f92015-02-25 15:31:31 -0800969 hlist_for_each_entry(fa, fah, fa_list) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800970 if (fa->fa_slen < slen)
971 continue;
972 if (fa->fa_slen != slen)
973 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -0700974 if (fa->tb_id > tb_id)
975 continue;
976 if (fa->tb_id != tb_id)
977 break;
Alexander Duyck02525362015-01-22 15:51:39 -0800978 if (fa->fa_tos > tos)
979 continue;
980 if (fa->fa_info->fib_priority >= prio || fa->fa_tos < tos)
981 return fa;
982 }
983
984 return NULL;
985}
986
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800987static void trie_rebalance(struct trie *t, struct key_vector *tn)
Robert Olsson19baf832005-06-21 12:43:18 -0700988{
Alexander Duyck88bae712015-03-06 09:54:52 -0800989 while (!IS_TRIE(tn))
990 tn = resize(t, tn);
Robert Olsson19baf832005-06-21 12:43:18 -0700991}
992
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800993static int fib_insert_node(struct trie *t, struct key_vector *tp,
Alexander Duyckd5d64872015-03-04 15:02:18 -0800994 struct fib_alias *new, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -0700995{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800996 struct key_vector *n, *l;
Alexander Duyck836a0122014-12-31 10:56:06 -0800997
Alexander Duyckd5d64872015-03-04 15:02:18 -0800998 l = leaf_new(key, new);
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800999 if (!l)
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001000 goto noleaf;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001001
1002 /* retrieve child from parent node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001003 n = get_child(tp, get_index(key, tp));
Alexander Duyck836a0122014-12-31 10:56:06 -08001004
1005 /* Case 2: n is a LEAF or a TNODE and the key doesn't match.
1006 *
1007 * Add a new tnode here
1008 * first tnode need some special handling
1009 * leaves us in position for handling as case 3
1010 */
1011 if (n) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001012 struct key_vector *tn;
Alexander Duyck836a0122014-12-31 10:56:06 -08001013
Alexander Duycke9b44012014-12-31 10:56:12 -08001014 tn = tnode_new(key, __fls(key ^ n->key), 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001015 if (!tn)
1016 goto notnode;
Olof Johansson91b9a272005-08-09 20:24:39 -07001017
Alexander Duyck836a0122014-12-31 10:56:06 -08001018 /* initialize routes out of node */
1019 NODE_INIT_PARENT(tn, tp);
1020 put_child(tn, get_index(key, tn) ^ 1, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001021
Alexander Duyck836a0122014-12-31 10:56:06 -08001022 /* start adding routes into the node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001023 put_child_root(tp, key, tn);
Alexander Duyck836a0122014-12-31 10:56:06 -08001024 node_set_parent(n, tn);
Robert Olsson19baf832005-06-21 12:43:18 -07001025
Alexander Duyck836a0122014-12-31 10:56:06 -08001026 /* parent now has a NULL spot where the leaf can go */
Alexander Duycke962f302014-12-10 21:49:22 -08001027 tp = tn;
Robert Olsson19baf832005-06-21 12:43:18 -07001028 }
Olof Johansson91b9a272005-08-09 20:24:39 -07001029
Alexander Duyck836a0122014-12-31 10:56:06 -08001030 /* Case 3: n is NULL, and will just insert a new leaf */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001031 NODE_INIT_PARENT(l, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -08001032 put_child_root(tp, key, l);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001033 trie_rebalance(t, tp);
Olof Johansson91b9a272005-08-09 20:24:39 -07001034
Alexander Duyckd5d64872015-03-04 15:02:18 -08001035 return 0;
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001036notnode:
1037 node_free(l);
1038noleaf:
1039 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07001040}
1041
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001042static int fib_insert_alias(struct trie *t, struct key_vector *tp,
1043 struct key_vector *l, struct fib_alias *new,
Alexander Duyckd5d64872015-03-04 15:02:18 -08001044 struct fib_alias *fa, t_key key)
1045{
1046 if (!l)
1047 return fib_insert_node(t, tp, new, key);
1048
1049 if (fa) {
1050 hlist_add_before_rcu(&new->fa_list, &fa->fa_list);
1051 } else {
1052 struct fib_alias *last;
1053
1054 hlist_for_each_entry(last, &l->leaf, fa_list) {
1055 if (new->fa_slen < last->fa_slen)
1056 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001057 if ((new->fa_slen == last->fa_slen) &&
1058 (new->tb_id > last->tb_id))
1059 break;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001060 fa = last;
1061 }
1062
1063 if (fa)
1064 hlist_add_behind_rcu(&new->fa_list, &fa->fa_list);
1065 else
1066 hlist_add_head_rcu(&new->fa_list, &l->leaf);
1067 }
1068
1069 /* if we added to the tail node then we need to update slen */
1070 if (l->slen < new->fa_slen) {
1071 l->slen = new->fa_slen;
1072 leaf_push_suffix(tp, l);
1073 }
1074
1075 return 0;
1076}
1077
1078/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001079int fib_table_insert(struct fib_table *tb, struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001080{
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001081 struct trie *t = (struct trie *)tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001082 struct fib_alias *fa, *new_fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001083 struct key_vector *l, *tp;
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001084 unsigned int nlflags = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001085 struct fib_info *fi;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001086 u8 plen = cfg->fc_dst_len;
1087 u8 slen = KEYLENGTH - plen;
Thomas Graf4e902c52006-08-17 18:14:52 -07001088 u8 tos = cfg->fc_tos;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001089 u32 key;
Robert Olsson19baf832005-06-21 12:43:18 -07001090 int err;
Robert Olsson19baf832005-06-21 12:43:18 -07001091
Alexander Duyck5786ec62015-02-25 15:31:37 -08001092 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001093 return -EINVAL;
1094
Thomas Graf4e902c52006-08-17 18:14:52 -07001095 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001096
Patrick McHardy2dfe55b2006-08-10 23:08:33 -07001097 pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen);
Robert Olsson19baf832005-06-21 12:43:18 -07001098
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001099 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001100 return -EINVAL;
1101
Thomas Graf4e902c52006-08-17 18:14:52 -07001102 fi = fib_create_info(cfg);
1103 if (IS_ERR(fi)) {
1104 err = PTR_ERR(fi);
Robert Olsson19baf832005-06-21 12:43:18 -07001105 goto err;
Thomas Graf4e902c52006-08-17 18:14:52 -07001106 }
Robert Olsson19baf832005-06-21 12:43:18 -07001107
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001108 l = fib_find_node(t, &tp, key);
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001109 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority,
1110 tb->tb_id) : NULL;
Robert Olsson19baf832005-06-21 12:43:18 -07001111
1112 /* Now fa, if non-NULL, points to the first fib alias
1113 * with the same keys [prefix,tos,priority], if such key already
1114 * exists or to the node before which we will insert new one.
1115 *
1116 * If fa is NULL, we will need to allocate a new one and
Alexander Duyck56315f92015-02-25 15:31:31 -08001117 * insert to the tail of the section matching the suffix length
1118 * of the new alias.
Robert Olsson19baf832005-06-21 12:43:18 -07001119 */
1120
Julian Anastasov936f6f82008-01-28 21:18:06 -08001121 if (fa && fa->fa_tos == tos &&
1122 fa->fa_info->fib_priority == fi->fib_priority) {
1123 struct fib_alias *fa_first, *fa_match;
Robert Olsson19baf832005-06-21 12:43:18 -07001124
1125 err = -EEXIST;
Thomas Graf4e902c52006-08-17 18:14:52 -07001126 if (cfg->fc_nlflags & NLM_F_EXCL)
Robert Olsson19baf832005-06-21 12:43:18 -07001127 goto out;
1128
Julian Anastasov936f6f82008-01-28 21:18:06 -08001129 /* We have 2 goals:
1130 * 1. Find exact match for type, scope, fib_info to avoid
1131 * duplicate routes
1132 * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it
1133 */
1134 fa_match = NULL;
1135 fa_first = fa;
Alexander Duyck56315f92015-02-25 15:31:31 -08001136 hlist_for_each_entry_from(fa, fa_list) {
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001137 if ((fa->fa_slen != slen) ||
1138 (fa->tb_id != tb->tb_id) ||
1139 (fa->fa_tos != tos))
Julian Anastasov936f6f82008-01-28 21:18:06 -08001140 break;
1141 if (fa->fa_info->fib_priority != fi->fib_priority)
1142 break;
1143 if (fa->fa_type == cfg->fc_type &&
Julian Anastasov936f6f82008-01-28 21:18:06 -08001144 fa->fa_info == fi) {
1145 fa_match = fa;
1146 break;
1147 }
1148 }
1149
Thomas Graf4e902c52006-08-17 18:14:52 -07001150 if (cfg->fc_nlflags & NLM_F_REPLACE) {
Robert Olsson19baf832005-06-21 12:43:18 -07001151 struct fib_info *fi_drop;
1152 u8 state;
1153
Julian Anastasov936f6f82008-01-28 21:18:06 -08001154 fa = fa_first;
1155 if (fa_match) {
1156 if (fa == fa_match)
1157 err = 0;
Joonwoo Park67250332008-01-18 03:45:18 -08001158 goto out;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001159 }
Robert Olsson2373ce12005-08-25 13:01:29 -07001160 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001161 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001162 if (!new_fa)
Robert Olsson2373ce12005-08-25 13:01:29 -07001163 goto out;
Robert Olsson19baf832005-06-21 12:43:18 -07001164
1165 fi_drop = fa->fa_info;
Robert Olsson2373ce12005-08-25 13:01:29 -07001166 new_fa->fa_tos = fa->fa_tos;
1167 new_fa->fa_info = fi;
Thomas Graf4e902c52006-08-17 18:14:52 -07001168 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001169 state = fa->fa_state;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001170 new_fa->fa_state = state & ~FA_S_ACCESSED;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001171 new_fa->fa_slen = fa->fa_slen;
Michal Kubečekd4e64c22015-05-22 13:40:09 +02001172 new_fa->tb_id = tb->tb_id;
Julian Anastasov2392deb2015-07-22 10:43:23 +03001173 new_fa->fa_default = -1;
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;
Julian Anastasov2392deb2015-07-22 10:43:23 +03001225 new_fa->fa_default = -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001226
Scott Feldman8e05fd72015-03-05 21:21:19 -08001227 /* (Optionally) offload fib entry to switch hardware. */
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001228 err = switchdev_fib_ipv4_add(key, plen, fi, tos, cfg->fc_type,
1229 cfg->fc_nlflags, tb->tb_id);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001230 if (err) {
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001231 switchdev_fib_ipv4_abort(fi);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001232 goto out_free_new_fa;
1233 }
1234
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001235 /* Insert new entry to the list. */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001236 err = fib_insert_alias(t, tp, l, new_fa, fa, key);
1237 if (err)
Scott Feldman8e05fd72015-03-05 21:21:19 -08001238 goto out_sw_fib_del;
Robert Olsson19baf832005-06-21 12:43:18 -07001239
David S. Miller21d8c492011-04-14 14:49:37 -07001240 if (!plen)
1241 tb->tb_num_default++;
1242
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001243 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001244 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, new_fa->tb_id,
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001245 &cfg->fc_nlinfo, nlflags);
Robert Olsson19baf832005-06-21 12:43:18 -07001246succeeded:
1247 return 0;
Robert Olssonf835e472005-06-28 15:00:39 -07001248
Scott Feldman8e05fd72015-03-05 21:21:19 -08001249out_sw_fib_del:
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001250 switchdev_fib_ipv4_del(key, plen, fi, tos, cfg->fc_type, tb->tb_id);
Robert Olssonf835e472005-06-28 15:00:39 -07001251out_free_new_fa:
1252 kmem_cache_free(fn_alias_kmem, new_fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001253out:
1254 fib_release_info(fi);
Olof Johansson91b9a272005-08-09 20:24:39 -07001255err:
Robert Olsson19baf832005-06-21 12:43:18 -07001256 return err;
1257}
1258
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001259static inline t_key prefix_mismatch(t_key key, struct key_vector *n)
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001260{
1261 t_key prefix = n->key;
1262
1263 return (key ^ prefix) & (prefix | -prefix);
1264}
1265
Alexander Duyck345e9b52014-12-31 10:56:24 -08001266/* should be called with rcu_read_lock */
David S. Miller22bd5b92011-03-11 19:54:08 -05001267int fib_table_lookup(struct fib_table *tb, const struct flowi4 *flp,
Eric Dumazetebc0ffa2010-10-05 10:41:36 +00001268 struct fib_result *res, int fib_flags)
Robert Olsson19baf832005-06-21 12:43:18 -07001269{
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001270 struct trie *t = (struct trie *) tb->tb_data;
Alexander Duyck8274a972014-12-31 10:55:29 -08001271#ifdef CONFIG_IP_FIB_TRIE_STATS
1272 struct trie_use_stats __percpu *stats = t->stats;
1273#endif
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001274 const t_key key = ntohl(flp->daddr);
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001275 struct key_vector *n, *pn;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001276 struct fib_alias *fa;
Alexander Duyck71e8b672015-03-04 15:04:03 -08001277 unsigned long index;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001278 t_key cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001279
David Ahernf6d3c192015-08-28 08:42:09 -07001280 trace_fib_table_lookup(tb->tb_id, flp);
1281
Alexander Duyck88bae712015-03-06 09:54:52 -08001282 pn = t->kv;
1283 cindex = 0;
1284
1285 n = get_child_rcu(pn, cindex);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001286 if (!n)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001287 return -EAGAIN;
Robert Olsson19baf832005-06-21 12:43:18 -07001288
1289#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08001290 this_cpu_inc(stats->gets);
Robert Olsson19baf832005-06-21 12:43:18 -07001291#endif
1292
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001293 /* Step 1: Travel to the longest prefix match in the trie */
1294 for (;;) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001295 index = get_cindex(key, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001296
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001297 /* This bit of code is a bit tricky but it combines multiple
1298 * checks into a single check. The prefix consists of the
1299 * prefix plus zeros for the "bits" in the prefix. The index
1300 * is the difference between the key and this value. From
1301 * this we can actually derive several pieces of data.
Alexander Duyck71e8b672015-03-04 15:04:03 -08001302 * if (index >= (1ul << bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001303 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -08001304 * else
1305 * we know the value is cindex
Alexander Duyck71e8b672015-03-04 15:04:03 -08001306 *
1307 * This check is safe even if bits == KEYLENGTH due to the
1308 * fact that we can only allocate a node with 32 bits if a
1309 * long is greater than 32 bits.
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001310 */
Alexander Duyck71e8b672015-03-04 15:04:03 -08001311 if (index >= (1ul << n->bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001312 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001313
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001314 /* we have found a leaf. Prefixes have already been compared */
1315 if (IS_LEAF(n))
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001316 goto found;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001317
1318 /* only record pn and cindex if we are going to be chopping
1319 * bits later. Otherwise we are just wasting cycles.
1320 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001321 if (n->slen > n->pos) {
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001322 pn = n;
1323 cindex = index;
Olof Johansson91b9a272005-08-09 20:24:39 -07001324 }
1325
Alexander Duyck754baf82015-03-06 09:54:14 -08001326 n = get_child_rcu(n, index);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001327 if (unlikely(!n))
Robert Olsson19baf832005-06-21 12:43:18 -07001328 goto backtrace;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001329 }
1330
1331 /* Step 2: Sort out leaves and begin backtracing for longest prefix */
1332 for (;;) {
1333 /* record the pointer where our next node pointer is stored */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001334 struct key_vector __rcu **cptr = n->tnode;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001335
1336 /* This test verifies that none of the bits that differ
1337 * between the key and the prefix exist in the region of
1338 * the lsb and higher in the prefix.
1339 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001340 if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001341 goto backtrace;
1342
1343 /* exit out and process leaf */
1344 if (unlikely(IS_LEAF(n)))
1345 break;
1346
1347 /* Don't bother recording parent info. Since we are in
1348 * prefix match mode we will have to come back to wherever
1349 * we started this traversal anyway
1350 */
1351
1352 while ((n = rcu_dereference(*cptr)) == NULL) {
1353backtrace:
1354#ifdef CONFIG_IP_FIB_TRIE_STATS
1355 if (!n)
1356 this_cpu_inc(stats->null_node_hit);
1357#endif
1358 /* If we are at cindex 0 there are no more bits for
1359 * us to strip at this level so we must ascend back
1360 * up one level to see if there are any more bits to
1361 * be stripped there.
1362 */
1363 while (!cindex) {
1364 t_key pkey = pn->key;
1365
Alexander Duyck88bae712015-03-06 09:54:52 -08001366 /* If we don't have a parent then there is
1367 * nothing for us to do as we do not have any
1368 * further nodes to parse.
1369 */
1370 if (IS_TRIE(pn))
Alexander Duyck345e9b52014-12-31 10:56:24 -08001371 return -EAGAIN;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001372#ifdef CONFIG_IP_FIB_TRIE_STATS
1373 this_cpu_inc(stats->backtrack);
1374#endif
1375 /* Get Child's index */
Alexander Duyck88bae712015-03-06 09:54:52 -08001376 pn = node_parent_rcu(pn);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001377 cindex = get_index(pkey, pn);
1378 }
1379
1380 /* strip the least significant bit from the cindex */
1381 cindex &= cindex - 1;
1382
1383 /* grab pointer for next child node */
Alexander Duyck41b489f2015-03-04 15:02:33 -08001384 cptr = &pn->tnode[cindex];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001385 }
Robert Olsson19baf832005-06-21 12:43:18 -07001386 }
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001387
Robert Olsson19baf832005-06-21 12:43:18 -07001388found:
Alexander Duyck71e8b672015-03-04 15:04:03 -08001389 /* this line carries forward the xor from earlier in the function */
1390 index = key ^ n->key;
1391
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001392 /* Step 3: Process the leaf, if that fails fall back to backtracing */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001393 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
1394 struct fib_info *fi = fa->fa_info;
1395 int nhsel, err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001396
Alexander Duycka5829f52016-01-28 13:42:24 -08001397 if ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen < KEYLENGTH)) {
1398 if (index >= (1ul << fa->fa_slen))
1399 continue;
1400 }
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001401 if (fa->fa_tos && fa->fa_tos != flp->flowi4_tos)
1402 continue;
1403 if (fi->fib_dead)
1404 continue;
1405 if (fa->fa_info->fib_scope < flp->flowi4_scope)
1406 continue;
1407 fib_alias_accessed(fa);
1408 err = fib_props[fa->fa_type].error;
1409 if (unlikely(err < 0)) {
Alexander Duyck345e9b52014-12-31 10:56:24 -08001410#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001411 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001412#endif
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001413 return err;
1414 }
1415 if (fi->fib_flags & RTNH_F_DEAD)
1416 continue;
1417 for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) {
1418 const struct fib_nh *nh = &fi->fib_nh[nhsel];
Andy Gospodarek0eeb0752015-06-23 13:45:37 -04001419 struct in_device *in_dev = __in_dev_get_rcu(nh->nh_dev);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001420
1421 if (nh->nh_flags & RTNH_F_DEAD)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001422 continue;
Andy Gospodarek0eeb0752015-06-23 13:45:37 -04001423 if (in_dev &&
1424 IN_DEV_IGNORE_ROUTES_WITH_LINKDOWN(in_dev) &&
1425 nh->nh_flags & RTNH_F_LINKDOWN &&
1426 !(fib_flags & FIB_LOOKUP_IGNORE_LINKSTATE))
1427 continue;
David Ahern58189ca2015-09-15 15:10:50 -07001428 if (!(flp->flowi4_flags & FLOWI_FLAG_SKIP_NH_OIF)) {
David Ahern613d09b2015-08-13 14:59:02 -06001429 if (flp->flowi4_oif &&
1430 flp->flowi4_oif != nh->nh_oif)
1431 continue;
1432 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001433
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001434 if (!(fib_flags & FIB_LOOKUP_NOREF))
1435 atomic_inc(&fi->fib_clntref);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001436
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001437 res->prefixlen = KEYLENGTH - fa->fa_slen;
1438 res->nh_sel = nhsel;
1439 res->type = fa->fa_type;
1440 res->scope = fi->fib_scope;
1441 res->fi = fi;
1442 res->table = tb;
1443 res->fa_head = &n->leaf;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001444#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001445 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001446#endif
David Ahernf6d3c192015-08-28 08:42:09 -07001447 trace_fib_table_lookup_nh(nh);
1448
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001449 return err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001450 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001451 }
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001452#ifdef CONFIG_IP_FIB_TRIE_STATS
1453 this_cpu_inc(stats->semantic_match_miss);
1454#endif
Alexander Duyck345e9b52014-12-31 10:56:24 -08001455 goto backtrace;
Robert Olsson19baf832005-06-21 12:43:18 -07001456}
Florian Westphal6fc01432011-08-25 13:46:12 +02001457EXPORT_SYMBOL_GPL(fib_table_lookup);
Robert Olsson19baf832005-06-21 12:43:18 -07001458
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001459static void fib_remove_alias(struct trie *t, struct key_vector *tp,
1460 struct key_vector *l, struct fib_alias *old)
Alexander Duyckd5d64872015-03-04 15:02:18 -08001461{
1462 /* record the location of the previous list_info entry */
1463 struct hlist_node **pprev = old->fa_list.pprev;
1464 struct fib_alias *fa = hlist_entry(pprev, typeof(*fa), fa_list.next);
1465
1466 /* remove the fib_alias from the list */
1467 hlist_del_rcu(&old->fa_list);
1468
1469 /* if we emptied the list this leaf will be freed and we can sort
1470 * out parent suffix lengths as a part of trie_rebalance
1471 */
1472 if (hlist_empty(&l->leaf)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001473 put_child_root(tp, l->key, NULL);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001474 node_free(l);
1475 trie_rebalance(t, tp);
1476 return;
1477 }
1478
1479 /* only access fa if it is pointing at the last valid hlist_node */
1480 if (*pprev)
1481 return;
1482
1483 /* update the trie with the latest suffix length */
1484 l->slen = fa->fa_slen;
1485 leaf_pull_suffix(tp, l);
1486}
1487
1488/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001489int fib_table_delete(struct fib_table *tb, struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001490{
1491 struct trie *t = (struct trie *) tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001492 struct fib_alias *fa, *fa_to_delete;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001493 struct key_vector *l, *tp;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001494 u8 plen = cfg->fc_dst_len;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001495 u8 slen = KEYLENGTH - plen;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001496 u8 tos = cfg->fc_tos;
1497 u32 key;
Olof Johansson91b9a272005-08-09 20:24:39 -07001498
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001499 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001500 return -EINVAL;
1501
Thomas Graf4e902c52006-08-17 18:14:52 -07001502 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001503
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001504 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001505 return -EINVAL;
1506
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001507 l = fib_find_node(t, &tp, key);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001508 if (!l)
Robert Olsson19baf832005-06-21 12:43:18 -07001509 return -ESRCH;
1510
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001511 fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id);
Robert Olsson19baf832005-06-21 12:43:18 -07001512 if (!fa)
1513 return -ESRCH;
1514
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001515 pr_debug("Deleting %08x/%d tos=%d t=%p\n", key, plen, tos, t);
Robert Olsson19baf832005-06-21 12:43:18 -07001516
1517 fa_to_delete = NULL;
Alexander Duyck56315f92015-02-25 15:31:31 -08001518 hlist_for_each_entry_from(fa, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001519 struct fib_info *fi = fa->fa_info;
1520
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001521 if ((fa->fa_slen != slen) ||
1522 (fa->tb_id != tb->tb_id) ||
1523 (fa->fa_tos != tos))
Robert Olsson19baf832005-06-21 12:43:18 -07001524 break;
1525
Thomas Graf4e902c52006-08-17 18:14:52 -07001526 if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) &&
1527 (cfg->fc_scope == RT_SCOPE_NOWHERE ||
David S. Miller37e826c2011-03-24 18:06:47 -07001528 fa->fa_info->fib_scope == cfg->fc_scope) &&
Julian Anastasov74cb3c12011-03-19 12:13:46 +00001529 (!cfg->fc_prefsrc ||
1530 fi->fib_prefsrc == cfg->fc_prefsrc) &&
Thomas Graf4e902c52006-08-17 18:14:52 -07001531 (!cfg->fc_protocol ||
1532 fi->fib_protocol == cfg->fc_protocol) &&
1533 fib_nh_match(cfg, fi) == 0) {
Robert Olsson19baf832005-06-21 12:43:18 -07001534 fa_to_delete = fa;
1535 break;
1536 }
1537 }
1538
Olof Johansson91b9a272005-08-09 20:24:39 -07001539 if (!fa_to_delete)
1540 return -ESRCH;
Robert Olsson19baf832005-06-21 12:43:18 -07001541
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001542 switchdev_fib_ipv4_del(key, plen, fa_to_delete->fa_info, tos,
1543 cfg->fc_type, tb->tb_id);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001544
Alexander Duyckd5d64872015-03-04 15:02:18 -08001545 rtmsg_fib(RTM_DELROUTE, htonl(key), fa_to_delete, plen, tb->tb_id,
Milan Kocianb8f55832007-05-23 14:55:06 -07001546 &cfg->fc_nlinfo, 0);
Robert Olsson19baf832005-06-21 12:43:18 -07001547
David S. Miller21d8c492011-04-14 14:49:37 -07001548 if (!plen)
1549 tb->tb_num_default--;
1550
Alexander Duyckd5d64872015-03-04 15:02:18 -08001551 fib_remove_alias(t, tp, l, fa_to_delete);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001552
Alexander Duyckd5d64872015-03-04 15:02:18 -08001553 if (fa_to_delete->fa_state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001554 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Olof Johansson91b9a272005-08-09 20:24:39 -07001555
Alexander Duyckd5d64872015-03-04 15:02:18 -08001556 fib_release_info(fa_to_delete->fa_info);
1557 alias_free_mem_rcu(fa_to_delete);
Olof Johansson91b9a272005-08-09 20:24:39 -07001558 return 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001559}
1560
Alexander Duyck8be33e92015-03-04 14:59:19 -08001561/* Scan for the next leaf starting at the provided key value */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001562static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -07001563{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001564 struct key_vector *pn, *n = *tn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001565 unsigned long cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001566
Alexander Duyck8be33e92015-03-04 14:59:19 -08001567 /* this loop is meant to try and find the key in the trie */
Alexander Duyck88bae712015-03-06 09:54:52 -08001568 do {
1569 /* record parent and next child index */
1570 pn = n;
Alexander Duyckc2229fe2015-10-27 15:06:45 -07001571 cindex = (key > pn->key) ? get_index(key, pn) : 0;
Alexander Duyck88bae712015-03-06 09:54:52 -08001572
1573 if (cindex >> pn->bits)
1574 break;
1575
1576 /* descend into the next child */
1577 n = get_child_rcu(pn, cindex++);
1578 if (!n)
1579 break;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001580
Alexander Duyck8be33e92015-03-04 14:59:19 -08001581 /* guarantee forward progress on the keys */
1582 if (IS_LEAF(n) && (n->key >= key))
1583 goto found;
Alexander Duyck88bae712015-03-06 09:54:52 -08001584 } while (IS_TNODE(n));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001585
1586 /* this loop will search for the next leaf with a greater key */
Alexander Duyck88bae712015-03-06 09:54:52 -08001587 while (!IS_TRIE(pn)) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001588 /* if we exhausted the parent node we will need to climb */
1589 if (cindex >= (1ul << pn->bits)) {
1590 t_key pkey = pn->key;
1591
1592 pn = node_parent_rcu(pn);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001593 cindex = get_index(pkey, pn) + 1;
1594 continue;
Robert Olsson19baf832005-06-21 12:43:18 -07001595 }
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001596
Alexander Duyck8be33e92015-03-04 14:59:19 -08001597 /* grab the next available node */
Alexander Duyck754baf82015-03-06 09:54:14 -08001598 n = get_child_rcu(pn, cindex++);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001599 if (!n)
1600 continue;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001601
Alexander Duyck8be33e92015-03-04 14:59:19 -08001602 /* no need to compare keys since we bumped the index */
1603 if (IS_LEAF(n))
1604 goto found;
1605
1606 /* Rescan start scanning in new node */
1607 pn = n;
1608 cindex = 0;
1609 }
1610
1611 *tn = pn;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001612 return NULL; /* Root of trie */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001613found:
1614 /* if we are at the limit for keys just return NULL for the tnode */
Alexander Duyck88bae712015-03-06 09:54:52 -08001615 *tn = pn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001616 return n;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001617}
1618
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001619static void fib_trie_free(struct fib_table *tb)
1620{
1621 struct trie *t = (struct trie *)tb->tb_data;
1622 struct key_vector *pn = t->kv;
1623 unsigned long cindex = 1;
1624 struct hlist_node *tmp;
1625 struct fib_alias *fa;
1626
1627 /* walk trie in reverse order and free everything */
1628 for (;;) {
1629 struct key_vector *n;
1630
1631 if (!(cindex--)) {
1632 t_key pkey = pn->key;
1633
1634 if (IS_TRIE(pn))
1635 break;
1636
1637 n = pn;
1638 pn = node_parent(pn);
1639
1640 /* drop emptied tnode */
1641 put_child_root(pn, n->key, NULL);
1642 node_free(n);
1643
1644 cindex = get_index(pkey, pn);
1645
1646 continue;
1647 }
1648
1649 /* grab the next available node */
1650 n = get_child(pn, cindex);
1651 if (!n)
1652 continue;
1653
1654 if (IS_TNODE(n)) {
1655 /* record pn and cindex for leaf walking */
1656 pn = n;
1657 cindex = 1ul << n->bits;
1658
1659 continue;
1660 }
1661
1662 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1663 hlist_del_rcu(&fa->fa_list);
1664 alias_free_mem_rcu(fa);
1665 }
1666
1667 put_child_root(pn, n->key, NULL);
1668 node_free(n);
1669 }
1670
1671#ifdef CONFIG_IP_FIB_TRIE_STATS
1672 free_percpu(t->stats);
1673#endif
1674 kfree(tb);
1675}
1676
1677struct fib_table *fib_trie_unmerge(struct fib_table *oldtb)
1678{
1679 struct trie *ot = (struct trie *)oldtb->tb_data;
1680 struct key_vector *l, *tp = ot->kv;
1681 struct fib_table *local_tb;
1682 struct fib_alias *fa;
1683 struct trie *lt;
1684 t_key key = 0;
1685
1686 if (oldtb->tb_data == oldtb->__data)
1687 return oldtb;
1688
1689 local_tb = fib_trie_table(RT_TABLE_LOCAL, NULL);
1690 if (!local_tb)
1691 return NULL;
1692
1693 lt = (struct trie *)local_tb->tb_data;
1694
1695 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
1696 struct key_vector *local_l = NULL, *local_tp;
1697
1698 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
1699 struct fib_alias *new_fa;
1700
1701 if (local_tb->tb_id != fa->tb_id)
1702 continue;
1703
1704 /* clone fa for new local table */
1705 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
1706 if (!new_fa)
1707 goto out;
1708
1709 memcpy(new_fa, fa, sizeof(*fa));
1710
1711 /* insert clone into table */
1712 if (!local_l)
1713 local_l = fib_find_node(lt, &local_tp, l->key);
1714
1715 if (fib_insert_alias(lt, local_tp, local_l, new_fa,
1716 NULL, l->key))
1717 goto out;
1718 }
1719
1720 /* stop loop if key wrapped back to 0 */
1721 key = l->key + 1;
1722 if (key < l->key)
1723 break;
1724 }
1725
1726 return local_tb;
1727out:
1728 fib_trie_free(local_tb);
1729
1730 return NULL;
1731}
1732
Scott Feldman104616e2015-03-05 21:21:16 -08001733/* Caller must hold RTNL */
1734void fib_table_flush_external(struct fib_table *tb)
1735{
1736 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001737 struct key_vector *pn = t->kv;
1738 unsigned long cindex = 1;
1739 struct hlist_node *tmp;
Scott Feldman104616e2015-03-05 21:21:16 -08001740 struct fib_alias *fa;
Scott Feldman104616e2015-03-05 21:21:16 -08001741
Alexander Duyck88bae712015-03-06 09:54:52 -08001742 /* walk trie in reverse order */
1743 for (;;) {
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001744 unsigned char slen = 0;
Alexander Duyck88bae712015-03-06 09:54:52 -08001745 struct key_vector *n;
Scott Feldman104616e2015-03-05 21:21:16 -08001746
Alexander Duyck88bae712015-03-06 09:54:52 -08001747 if (!(cindex--)) {
1748 t_key pkey = pn->key;
Scott Feldman104616e2015-03-05 21:21:16 -08001749
Alexander Duyck88bae712015-03-06 09:54:52 -08001750 /* cannot resize the trie vector */
1751 if (IS_TRIE(pn))
1752 break;
Scott Feldman104616e2015-03-05 21:21:16 -08001753
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001754 /* resize completed node */
1755 pn = resize(t, pn);
Alexander Duyck88bae712015-03-06 09:54:52 -08001756 cindex = get_index(pkey, pn);
Scott Feldman104616e2015-03-05 21:21:16 -08001757
Alexander Duyck88bae712015-03-06 09:54:52 -08001758 continue;
1759 }
Scott Feldman104616e2015-03-05 21:21:16 -08001760
Alexander Duyck88bae712015-03-06 09:54:52 -08001761 /* grab the next available node */
1762 n = get_child(pn, cindex);
1763 if (!n)
Alexander Duyck72be7262015-03-06 09:53:56 -08001764 continue;
1765
Alexander Duyck88bae712015-03-06 09:54:52 -08001766 if (IS_TNODE(n)) {
1767 /* record pn and cindex for leaf walking */
1768 pn = n;
1769 cindex = 1ul << n->bits;
Scott Feldman104616e2015-03-05 21:21:16 -08001770
Alexander Duyck88bae712015-03-06 09:54:52 -08001771 continue;
1772 }
1773
1774 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1775 struct fib_info *fi = fa->fa_info;
1776
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001777 /* if alias was cloned to local then we just
1778 * need to remove the local copy from main
1779 */
1780 if (tb->tb_id != fa->tb_id) {
1781 hlist_del_rcu(&fa->fa_list);
1782 alias_free_mem_rcu(fa);
1783 continue;
1784 }
1785
1786 /* record local slen */
1787 slen = fa->fa_slen;
1788
Roopa Prabhueea39942015-05-13 21:17:41 -07001789 if (!fi || !(fi->fib_flags & RTNH_F_OFFLOAD))
Alexander Duyck88bae712015-03-06 09:54:52 -08001790 continue;
1791
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001792 switchdev_fib_ipv4_del(n->key, KEYLENGTH - fa->fa_slen,
1793 fi, fa->fa_tos, fa->fa_type,
1794 tb->tb_id);
Alexander Duyck88bae712015-03-06 09:54:52 -08001795 }
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001796
1797 /* update leaf slen */
1798 n->slen = slen;
1799
1800 if (hlist_empty(&n->leaf)) {
1801 put_child_root(pn, n->key, NULL);
1802 node_free(n);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001803 }
Alexander Duyck88bae712015-03-06 09:54:52 -08001804 }
Scott Feldman104616e2015-03-05 21:21:16 -08001805}
1806
Alexander Duyck8be33e92015-03-04 14:59:19 -08001807/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001808int fib_table_flush(struct fib_table *tb)
Robert Olsson19baf832005-06-21 12:43:18 -07001809{
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001810 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001811 struct key_vector *pn = t->kv;
1812 unsigned long cindex = 1;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001813 struct hlist_node *tmp;
1814 struct fib_alias *fa;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001815 int found = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001816
Alexander Duyck88bae712015-03-06 09:54:52 -08001817 /* walk trie in reverse order */
1818 for (;;) {
1819 unsigned char slen = 0;
1820 struct key_vector *n;
Robert Olsson19baf832005-06-21 12:43:18 -07001821
Alexander Duyck88bae712015-03-06 09:54:52 -08001822 if (!(cindex--)) {
1823 t_key pkey = pn->key;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001824
Alexander Duyck88bae712015-03-06 09:54:52 -08001825 /* cannot resize the trie vector */
1826 if (IS_TRIE(pn))
1827 break;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001828
Alexander Duyck88bae712015-03-06 09:54:52 -08001829 /* resize completed node */
1830 pn = resize(t, pn);
1831 cindex = get_index(pkey, pn);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001832
Alexander Duyck88bae712015-03-06 09:54:52 -08001833 continue;
1834 }
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001835
Alexander Duyck88bae712015-03-06 09:54:52 -08001836 /* grab the next available node */
1837 n = get_child(pn, cindex);
1838 if (!n)
1839 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001840
Alexander Duyck88bae712015-03-06 09:54:52 -08001841 if (IS_TNODE(n)) {
1842 /* record pn and cindex for leaf walking */
1843 pn = n;
1844 cindex = 1ul << n->bits;
1845
1846 continue;
1847 }
1848
1849 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1850 struct fib_info *fi = fa->fa_info;
1851
1852 if (!fi || !(fi->fib_flags & RTNH_F_DEAD)) {
1853 slen = fa->fa_slen;
1854 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001855 }
1856
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001857 switchdev_fib_ipv4_del(n->key, KEYLENGTH - fa->fa_slen,
1858 fi, fa->fa_tos, fa->fa_type,
1859 tb->tb_id);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001860 hlist_del_rcu(&fa->fa_list);
1861 fib_release_info(fa->fa_info);
1862 alias_free_mem_rcu(fa);
1863 found++;
Alexander Duyck64c62722015-01-22 15:51:45 -08001864 }
1865
Alexander Duyck88bae712015-03-06 09:54:52 -08001866 /* update leaf slen */
1867 n->slen = slen;
1868
1869 if (hlist_empty(&n->leaf)) {
1870 put_child_root(pn, n->key, NULL);
1871 node_free(n);
Alexander Duyck88bae712015-03-06 09:54:52 -08001872 }
Robert Olsson19baf832005-06-21 12:43:18 -07001873 }
1874
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001875 pr_debug("trie_flush found=%d\n", found);
Robert Olsson19baf832005-06-21 12:43:18 -07001876 return found;
1877}
1878
Alexander Duycka7e53532015-03-04 15:02:44 -08001879static void __trie_free_rcu(struct rcu_head *head)
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001880{
Alexander Duycka7e53532015-03-04 15:02:44 -08001881 struct fib_table *tb = container_of(head, struct fib_table, rcu);
Alexander Duyck8274a972014-12-31 10:55:29 -08001882#ifdef CONFIG_IP_FIB_TRIE_STATS
1883 struct trie *t = (struct trie *)tb->tb_data;
1884
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001885 if (tb->tb_data == tb->__data)
1886 free_percpu(t->stats);
Alexander Duyck8274a972014-12-31 10:55:29 -08001887#endif /* CONFIG_IP_FIB_TRIE_STATS */
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001888 kfree(tb);
1889}
1890
Alexander Duycka7e53532015-03-04 15:02:44 -08001891void fib_free_table(struct fib_table *tb)
1892{
1893 call_rcu(&tb->rcu, __trie_free_rcu);
1894}
1895
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001896static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001897 struct sk_buff *skb, struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001898{
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001899 __be32 xkey = htonl(l->key);
Robert Olsson19baf832005-06-21 12:43:18 -07001900 struct fib_alias *fa;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001901 int i, s_i;
Robert Olsson19baf832005-06-21 12:43:18 -07001902
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001903 s_i = cb->args[4];
Robert Olsson19baf832005-06-21 12:43:18 -07001904 i = 0;
1905
Robert Olsson2373ce12005-08-25 13:01:29 -07001906 /* rcu_read_lock is hold by caller */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001907 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001908 if (i < s_i) {
1909 i++;
1910 continue;
1911 }
Robert Olsson19baf832005-06-21 12:43:18 -07001912
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001913 if (tb->tb_id != fa->tb_id) {
1914 i++;
1915 continue;
1916 }
1917
Eric W. Biederman15e47302012-09-07 20:12:54 +00001918 if (fib_dump_info(skb, NETLINK_CB(cb->skb).portid,
Robert Olsson19baf832005-06-21 12:43:18 -07001919 cb->nlh->nlmsg_seq,
1920 RTM_NEWROUTE,
1921 tb->tb_id,
1922 fa->fa_type,
Thomas Grafbe403ea2006-08-17 18:15:17 -07001923 xkey,
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001924 KEYLENGTH - fa->fa_slen,
Robert Olsson19baf832005-06-21 12:43:18 -07001925 fa->fa_tos,
Stephen Hemminger64347f72008-01-22 21:55:01 -08001926 fa->fa_info, NLM_F_MULTI) < 0) {
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001927 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001928 return -1;
1929 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001930 i++;
Robert Olsson19baf832005-06-21 12:43:18 -07001931 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001932
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001933 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001934 return skb->len;
1935}
1936
Alexander Duycka7e53532015-03-04 15:02:44 -08001937/* rcu_read_lock needs to be hold by caller from readside */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001938int fib_table_dump(struct fib_table *tb, struct sk_buff *skb,
1939 struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001940{
Alexander Duyck8be33e92015-03-04 14:59:19 -08001941 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001942 struct key_vector *l, *tp = t->kv;
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001943 /* Dump starting at last key.
1944 * Note: 0.0.0.0/0 (ie default) is first key.
1945 */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001946 int count = cb->args[2];
1947 t_key key = cb->args[3];
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001948
Alexander Duyck8be33e92015-03-04 14:59:19 -08001949 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001950 if (fn_trie_dump_leaf(l, tb, skb, cb) < 0) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001951 cb->args[3] = key;
1952 cb->args[2] = count;
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001953 return -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001954 }
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001955
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001956 ++count;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001957 key = l->key + 1;
1958
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001959 memset(&cb->args[4], 0,
1960 sizeof(cb->args) - 4*sizeof(cb->args[0]));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001961
1962 /* stop loop if key wrapped back to 0 */
1963 if (key < l->key)
1964 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001965 }
Alexander Duyck8be33e92015-03-04 14:59:19 -08001966
Alexander Duyck8be33e92015-03-04 14:59:19 -08001967 cb->args[3] = key;
1968 cb->args[2] = count;
1969
Robert Olsson19baf832005-06-21 12:43:18 -07001970 return skb->len;
Robert Olsson19baf832005-06-21 12:43:18 -07001971}
1972
David S. Miller5348ba82011-02-01 15:30:56 -08001973void __init fib_trie_init(void)
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001974{
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001975 fn_alias_kmem = kmem_cache_create("ip_fib_alias",
1976 sizeof(struct fib_alias),
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08001977 0, SLAB_PANIC, NULL);
1978
1979 trie_leaf_kmem = kmem_cache_create("ip_fib_trie",
Alexander Duyck41b489f2015-03-04 15:02:33 -08001980 LEAF_SIZE,
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08001981 0, SLAB_PANIC, NULL);
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001982}
Robert Olsson19baf832005-06-21 12:43:18 -07001983
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001984struct fib_table *fib_trie_table(u32 id, struct fib_table *alias)
Robert Olsson19baf832005-06-21 12:43:18 -07001985{
1986 struct fib_table *tb;
1987 struct trie *t;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001988 size_t sz = sizeof(*tb);
Robert Olsson19baf832005-06-21 12:43:18 -07001989
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001990 if (!alias)
1991 sz += sizeof(struct trie);
1992
1993 tb = kzalloc(sz, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001994 if (!tb)
Robert Olsson19baf832005-06-21 12:43:18 -07001995 return NULL;
1996
1997 tb->tb_id = id;
David S. Miller21d8c492011-04-14 14:49:37 -07001998 tb->tb_num_default = 0;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001999 tb->tb_data = (alias ? alias->__data : tb->__data);
2000
2001 if (alias)
2002 return tb;
Robert Olsson19baf832005-06-21 12:43:18 -07002003
2004 t = (struct trie *) tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002005 t->kv[0].pos = KEYLENGTH;
2006 t->kv[0].slen = KEYLENGTH;
Alexander Duyck8274a972014-12-31 10:55:29 -08002007#ifdef CONFIG_IP_FIB_TRIE_STATS
2008 t->stats = alloc_percpu(struct trie_use_stats);
2009 if (!t->stats) {
2010 kfree(tb);
2011 tb = NULL;
2012 }
2013#endif
Robert Olsson19baf832005-06-21 12:43:18 -07002014
Robert Olsson19baf832005-06-21 12:43:18 -07002015 return tb;
2016}
2017
Robert Olsson19baf832005-06-21 12:43:18 -07002018#ifdef CONFIG_PROC_FS
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002019/* Depth first Trie walk iterator */
2020struct fib_trie_iter {
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002021 struct seq_net_private p;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002022 struct fib_table *tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002023 struct key_vector *tnode;
Eric Dumazeta034ee32010-09-09 23:32:28 +00002024 unsigned int index;
2025 unsigned int depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002026};
Robert Olsson19baf832005-06-21 12:43:18 -07002027
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002028static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)
Robert Olsson19baf832005-06-21 12:43:18 -07002029{
Alexander Duyck98293e82014-12-31 10:56:18 -08002030 unsigned long cindex = iter->index;
Alexander Duyck88bae712015-03-06 09:54:52 -08002031 struct key_vector *pn = iter->tnode;
2032 t_key pkey;
Eric W. Biederman6640e692007-01-24 14:42:04 -08002033
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002034 pr_debug("get_next iter={node=%p index=%d depth=%d}\n",
2035 iter->tnode, iter->index, iter->depth);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002036
Alexander Duyck88bae712015-03-06 09:54:52 -08002037 while (!IS_TRIE(pn)) {
2038 while (cindex < child_length(pn)) {
2039 struct key_vector *n = get_child_rcu(pn, cindex++);
2040
2041 if (!n)
2042 continue;
2043
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002044 if (IS_LEAF(n)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08002045 iter->tnode = pn;
2046 iter->index = cindex;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002047 } else {
2048 /* push down one level */
Alexander Duyckadaf9812014-12-31 10:55:47 -08002049 iter->tnode = n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002050 iter->index = 0;
2051 ++iter->depth;
2052 }
Alexander Duyck88bae712015-03-06 09:54:52 -08002053
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002054 return n;
2055 }
2056
Alexander Duyck88bae712015-03-06 09:54:52 -08002057 /* Current node exhausted, pop back up */
2058 pkey = pn->key;
2059 pn = node_parent_rcu(pn);
2060 cindex = get_index(pkey, pn) + 1;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002061 --iter->depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002062 }
2063
Alexander Duyck88bae712015-03-06 09:54:52 -08002064 /* record root node so further searches know we are done */
2065 iter->tnode = pn;
2066 iter->index = 0;
2067
Robert Olsson19baf832005-06-21 12:43:18 -07002068 return NULL;
2069}
2070
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002071static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,
2072 struct trie *t)
Robert Olsson19baf832005-06-21 12:43:18 -07002073{
Firo Yangf38b24c2015-06-08 11:54:51 +08002074 struct key_vector *n, *pn;
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002075
Stephen Hemminger132adf52007-03-08 20:44:43 -08002076 if (!t)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002077 return NULL;
2078
Firo Yangf38b24c2015-06-08 11:54:51 +08002079 pn = t->kv;
Alexander Duyck88bae712015-03-06 09:54:52 -08002080 n = rcu_dereference(pn->tnode[0]);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002081 if (!n)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002082 return NULL;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002083
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002084 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002085 iter->tnode = n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002086 iter->index = 0;
2087 iter->depth = 1;
2088 } else {
Alexander Duyck88bae712015-03-06 09:54:52 -08002089 iter->tnode = pn;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002090 iter->index = 0;
2091 iter->depth = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002092 }
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002093
2094 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002095}
2096
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002097static void trie_collect_stats(struct trie *t, struct trie_stat *s)
Robert Olsson19baf832005-06-21 12:43:18 -07002098{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002099 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002100 struct fib_trie_iter iter;
Robert Olsson19baf832005-06-21 12:43:18 -07002101
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002102 memset(s, 0, sizeof(*s));
Robert Olsson19baf832005-06-21 12:43:18 -07002103
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002104 rcu_read_lock();
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002105 for (n = fib_trie_get_first(&iter, t); n; n = fib_trie_get_next(&iter)) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002106 if (IS_LEAF(n)) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002107 struct fib_alias *fa;
Stephen Hemminger93672292008-01-22 21:54:05 -08002108
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002109 s->leaves++;
2110 s->totdepth += iter.depth;
2111 if (iter.depth > s->maxdepth)
2112 s->maxdepth = iter.depth;
Stephen Hemminger93672292008-01-22 21:54:05 -08002113
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002114 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list)
Stephen Hemminger93672292008-01-22 21:54:05 -08002115 ++s->prefixes;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002116 } else {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002117 s->tnodes++;
Alexander Duyckadaf9812014-12-31 10:55:47 -08002118 if (n->bits < MAX_STAT_DEPTH)
2119 s->nodesizes[n->bits]++;
Alexander Duyck6e22d172015-03-06 09:54:39 -08002120 s->nullpointers += tn_info(n)->empty_children;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002121 }
2122 }
2123 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002124}
2125
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002126/*
Robert Olsson19baf832005-06-21 12:43:18 -07002127 * This outputs /proc/net/fib_triestats
Robert Olsson19baf832005-06-21 12:43:18 -07002128 */
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002129static void trie_show_stats(struct seq_file *seq, struct trie_stat *stat)
Robert Olsson19baf832005-06-21 12:43:18 -07002130{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002131 unsigned int i, max, pointers, bytes, avdepth;
Robert Olsson19baf832005-06-21 12:43:18 -07002132
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002133 if (stat->leaves)
2134 avdepth = stat->totdepth*100 / stat->leaves;
2135 else
2136 avdepth = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07002137
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002138 seq_printf(seq, "\tAver depth: %u.%02d\n",
2139 avdepth / 100, avdepth % 100);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002140 seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth);
Robert Olsson19baf832005-06-21 12:43:18 -07002141
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002142 seq_printf(seq, "\tLeaves: %u\n", stat->leaves);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002143 bytes = LEAF_SIZE * stat->leaves;
Stephen Hemminger93672292008-01-22 21:54:05 -08002144
2145 seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002146 bytes += sizeof(struct fib_alias) * stat->prefixes;
Stephen Hemminger93672292008-01-22 21:54:05 -08002147
Stephen Hemminger187b5182008-01-12 20:55:55 -08002148 seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002149 bytes += TNODE_SIZE(0) * stat->tnodes;
Robert Olsson19baf832005-06-21 12:43:18 -07002150
Robert Olsson06ef9212006-03-20 21:35:01 -08002151 max = MAX_STAT_DEPTH;
2152 while (max > 0 && stat->nodesizes[max-1] == 0)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002153 max--;
Robert Olsson19baf832005-06-21 12:43:18 -07002154
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002155 pointers = 0;
Jerry Snitselaarf585a992013-07-22 12:01:58 -07002156 for (i = 1; i < max; i++)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002157 if (stat->nodesizes[i] != 0) {
Stephen Hemminger187b5182008-01-12 20:55:55 -08002158 seq_printf(seq, " %u: %u", i, stat->nodesizes[i]);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002159 pointers += (1<<i) * stat->nodesizes[i];
2160 }
2161 seq_putc(seq, '\n');
Stephen Hemminger187b5182008-01-12 20:55:55 -08002162 seq_printf(seq, "\tPointers: %u\n", pointers);
Robert Olsson19baf832005-06-21 12:43:18 -07002163
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002164 bytes += sizeof(struct key_vector *) * pointers;
Stephen Hemminger187b5182008-01-12 20:55:55 -08002165 seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers);
2166 seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024);
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002167}
Robert Olsson19baf832005-06-21 12:43:18 -07002168
2169#ifdef CONFIG_IP_FIB_TRIE_STATS
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002170static void trie_show_usage(struct seq_file *seq,
Alexander Duyck8274a972014-12-31 10:55:29 -08002171 const struct trie_use_stats __percpu *stats)
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002172{
Alexander Duyck8274a972014-12-31 10:55:29 -08002173 struct trie_use_stats s = { 0 };
2174 int cpu;
2175
2176 /* loop through all of the CPUs and gather up the stats */
2177 for_each_possible_cpu(cpu) {
2178 const struct trie_use_stats *pcpu = per_cpu_ptr(stats, cpu);
2179
2180 s.gets += pcpu->gets;
2181 s.backtrack += pcpu->backtrack;
2182 s.semantic_match_passed += pcpu->semantic_match_passed;
2183 s.semantic_match_miss += pcpu->semantic_match_miss;
2184 s.null_node_hit += pcpu->null_node_hit;
2185 s.resize_node_skipped += pcpu->resize_node_skipped;
2186 }
2187
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002188 seq_printf(seq, "\nCounters:\n---------\n");
Alexander Duyck8274a972014-12-31 10:55:29 -08002189 seq_printf(seq, "gets = %u\n", s.gets);
2190 seq_printf(seq, "backtracks = %u\n", s.backtrack);
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002191 seq_printf(seq, "semantic match passed = %u\n",
Alexander Duyck8274a972014-12-31 10:55:29 -08002192 s.semantic_match_passed);
2193 seq_printf(seq, "semantic match miss = %u\n", s.semantic_match_miss);
2194 seq_printf(seq, "null node hit= %u\n", s.null_node_hit);
2195 seq_printf(seq, "skipped node resize = %u\n\n", s.resize_node_skipped);
Robert Olsson19baf832005-06-21 12:43:18 -07002196}
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002197#endif /* CONFIG_IP_FIB_TRIE_STATS */
2198
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002199static void fib_table_print(struct seq_file *seq, struct fib_table *tb)
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002200{
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002201 if (tb->tb_id == RT_TABLE_LOCAL)
2202 seq_puts(seq, "Local:\n");
2203 else if (tb->tb_id == RT_TABLE_MAIN)
2204 seq_puts(seq, "Main:\n");
2205 else
2206 seq_printf(seq, "Id %d:\n", tb->tb_id);
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002207}
Robert Olsson19baf832005-06-21 12:43:18 -07002208
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002209
Robert Olsson19baf832005-06-21 12:43:18 -07002210static int fib_triestat_seq_show(struct seq_file *seq, void *v)
2211{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002212 struct net *net = (struct net *)seq->private;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002213 unsigned int h;
Eric W. Biederman877a9bf2007-12-07 00:47:47 -08002214
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002215 seq_printf(seq,
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002216 "Basic info: size of leaf:"
2217 " %Zd bytes, size of tnode: %Zd bytes.\n",
Alexander Duyck41b489f2015-03-04 15:02:33 -08002218 LEAF_SIZE, TNODE_SIZE(0));
Olof Johansson91b9a272005-08-09 20:24:39 -07002219
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002220 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2221 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002222 struct fib_table *tb;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002223
Sasha Levinb67bfe02013-02-27 17:06:00 -08002224 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002225 struct trie *t = (struct trie *) tb->tb_data;
2226 struct trie_stat stat;
2227
2228 if (!t)
2229 continue;
2230
2231 fib_table_print(seq, tb);
2232
2233 trie_collect_stats(t, &stat);
2234 trie_show_stats(seq, &stat);
2235#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08002236 trie_show_usage(seq, t->stats);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002237#endif
2238 }
2239 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002240
Robert Olsson19baf832005-06-21 12:43:18 -07002241 return 0;
2242}
2243
Robert Olsson19baf832005-06-21 12:43:18 -07002244static int fib_triestat_seq_open(struct inode *inode, struct file *file)
2245{
Pavel Emelyanovde05c552008-07-18 04:07:21 -07002246 return single_open_net(inode, file, fib_triestat_seq_show);
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002247}
2248
Arjan van de Ven9a321442007-02-12 00:55:35 -08002249static const struct file_operations fib_triestat_fops = {
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002250 .owner = THIS_MODULE,
2251 .open = fib_triestat_seq_open,
2252 .read = seq_read,
2253 .llseek = seq_lseek,
Pavel Emelyanovb6fcbdb2008-07-18 04:07:44 -07002254 .release = single_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002255};
2256
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002257static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)
Robert Olsson19baf832005-06-21 12:43:18 -07002258{
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002259 struct fib_trie_iter *iter = seq->private;
2260 struct net *net = seq_file_net(seq);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002261 loff_t idx = 0;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002262 unsigned int h;
Robert Olsson19baf832005-06-21 12:43:18 -07002263
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002264 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2265 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002266 struct fib_table *tb;
2267
Sasha Levinb67bfe02013-02-27 17:06:00 -08002268 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002269 struct key_vector *n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002270
2271 for (n = fib_trie_get_first(iter,
2272 (struct trie *) tb->tb_data);
2273 n; n = fib_trie_get_next(iter))
2274 if (pos == idx++) {
2275 iter->tb = tb;
2276 return n;
2277 }
2278 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002279 }
Robert Olsson19baf832005-06-21 12:43:18 -07002280
Robert Olsson19baf832005-06-21 12:43:18 -07002281 return NULL;
2282}
2283
2284static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002285 __acquires(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002286{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002287 rcu_read_lock();
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002288 return fib_trie_get_idx(seq, *pos);
Robert Olsson19baf832005-06-21 12:43:18 -07002289}
2290
2291static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2292{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002293 struct fib_trie_iter *iter = seq->private;
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002294 struct net *net = seq_file_net(seq);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002295 struct fib_table *tb = iter->tb;
2296 struct hlist_node *tb_node;
2297 unsigned int h;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002298 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002299
Robert Olsson19baf832005-06-21 12:43:18 -07002300 ++*pos;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002301 /* next node in same table */
2302 n = fib_trie_get_next(iter);
2303 if (n)
2304 return n;
Olof Johansson91b9a272005-08-09 20:24:39 -07002305
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002306 /* walk rest of this hash chain */
2307 h = tb->tb_id & (FIB_TABLE_HASHSZ - 1);
Eric Dumazet0a5c0472011-03-31 01:51:35 -07002308 while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002309 tb = hlist_entry(tb_node, struct fib_table, tb_hlist);
2310 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2311 if (n)
2312 goto found;
2313 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002314
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002315 /* new hash chain */
2316 while (++h < FIB_TABLE_HASHSZ) {
2317 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Sasha Levinb67bfe02013-02-27 17:06:00 -08002318 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002319 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2320 if (n)
2321 goto found;
2322 }
2323 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002324 return NULL;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002325
2326found:
2327 iter->tb = tb;
2328 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002329}
2330
2331static void fib_trie_seq_stop(struct seq_file *seq, void *v)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002332 __releases(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002333{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002334 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002335}
2336
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002337static void seq_indent(struct seq_file *seq, int n)
2338{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002339 while (n-- > 0)
2340 seq_puts(seq, " ");
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002341}
Robert Olsson19baf832005-06-21 12:43:18 -07002342
Eric Dumazet28d36e32008-01-14 23:09:56 -08002343static inline const char *rtn_scope(char *buf, size_t len, enum rt_scope_t s)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002344{
Stephen Hemminger132adf52007-03-08 20:44:43 -08002345 switch (s) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002346 case RT_SCOPE_UNIVERSE: return "universe";
2347 case RT_SCOPE_SITE: return "site";
2348 case RT_SCOPE_LINK: return "link";
2349 case RT_SCOPE_HOST: return "host";
2350 case RT_SCOPE_NOWHERE: return "nowhere";
2351 default:
Eric Dumazet28d36e32008-01-14 23:09:56 -08002352 snprintf(buf, len, "scope=%d", s);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002353 return buf;
2354 }
2355}
2356
Jan Engelhardt36cbd3d2009-08-05 10:42:58 -07002357static const char *const rtn_type_names[__RTN_MAX] = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002358 [RTN_UNSPEC] = "UNSPEC",
2359 [RTN_UNICAST] = "UNICAST",
2360 [RTN_LOCAL] = "LOCAL",
2361 [RTN_BROADCAST] = "BROADCAST",
2362 [RTN_ANYCAST] = "ANYCAST",
2363 [RTN_MULTICAST] = "MULTICAST",
2364 [RTN_BLACKHOLE] = "BLACKHOLE",
2365 [RTN_UNREACHABLE] = "UNREACHABLE",
2366 [RTN_PROHIBIT] = "PROHIBIT",
2367 [RTN_THROW] = "THROW",
2368 [RTN_NAT] = "NAT",
2369 [RTN_XRESOLVE] = "XRESOLVE",
2370};
2371
Eric Dumazeta034ee32010-09-09 23:32:28 +00002372static inline const char *rtn_type(char *buf, size_t len, unsigned int t)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002373{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002374 if (t < __RTN_MAX && rtn_type_names[t])
2375 return rtn_type_names[t];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002376 snprintf(buf, len, "type %u", t);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002377 return buf;
2378}
2379
2380/* Pretty print the trie */
Robert Olsson19baf832005-06-21 12:43:18 -07002381static int fib_trie_seq_show(struct seq_file *seq, void *v)
2382{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002383 const struct fib_trie_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002384 struct key_vector *n = v;
Robert Olsson19baf832005-06-21 12:43:18 -07002385
Alexander Duyck88bae712015-03-06 09:54:52 -08002386 if (IS_TRIE(node_parent_rcu(n)))
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002387 fib_table_print(seq, iter->tb);
Robert Olsson095b8502007-01-26 19:06:01 -08002388
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002389 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002390 __be32 prf = htonl(n->key);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002391
Alexander Duycke9b44012014-12-31 10:56:12 -08002392 seq_indent(seq, iter->depth-1);
2393 seq_printf(seq, " +-- %pI4/%zu %u %u %u\n",
2394 &prf, KEYLENGTH - n->pos - n->bits, n->bits,
Alexander Duyck6e22d172015-03-06 09:54:39 -08002395 tn_info(n)->full_children,
2396 tn_info(n)->empty_children);
Olof Johansson91b9a272005-08-09 20:24:39 -07002397 } else {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002398 __be32 val = htonl(n->key);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002399 struct fib_alias *fa;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002400
2401 seq_indent(seq, iter->depth);
Harvey Harrison673d57e2008-10-31 00:53:57 -07002402 seq_printf(seq, " |-- %pI4\n", &val);
Eric Dumazet28d36e32008-01-14 23:09:56 -08002403
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002404 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
2405 char buf1[32], buf2[32];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002406
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002407 seq_indent(seq, iter->depth + 1);
2408 seq_printf(seq, " /%zu %s %s",
2409 KEYLENGTH - fa->fa_slen,
2410 rtn_scope(buf1, sizeof(buf1),
2411 fa->fa_info->fib_scope),
2412 rtn_type(buf2, sizeof(buf2),
2413 fa->fa_type));
2414 if (fa->fa_tos)
2415 seq_printf(seq, " tos=%d", fa->fa_tos);
2416 seq_putc(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002417 }
Robert Olsson19baf832005-06-21 12:43:18 -07002418 }
2419
2420 return 0;
2421}
2422
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002423static const struct seq_operations fib_trie_seq_ops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002424 .start = fib_trie_seq_start,
2425 .next = fib_trie_seq_next,
2426 .stop = fib_trie_seq_stop,
2427 .show = fib_trie_seq_show,
Robert Olsson19baf832005-06-21 12:43:18 -07002428};
2429
2430static int fib_trie_seq_open(struct inode *inode, struct file *file)
2431{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002432 return seq_open_net(inode, file, &fib_trie_seq_ops,
2433 sizeof(struct fib_trie_iter));
Robert Olsson19baf832005-06-21 12:43:18 -07002434}
2435
Arjan van de Ven9a321442007-02-12 00:55:35 -08002436static const struct file_operations fib_trie_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002437 .owner = THIS_MODULE,
2438 .open = fib_trie_seq_open,
2439 .read = seq_read,
2440 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002441 .release = seq_release_net,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002442};
2443
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002444struct fib_route_iter {
2445 struct seq_net_private p;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002446 struct fib_table *main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002447 struct key_vector *tnode;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002448 loff_t pos;
2449 t_key key;
2450};
2451
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002452static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,
2453 loff_t pos)
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002454{
Alexander Duyck8be33e92015-03-04 14:59:19 -08002455 struct fib_table *tb = iter->main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002456 struct key_vector *l, **tp = &iter->tnode;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002457 struct trie *t;
2458 t_key key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002459
Alexander Duyck8be33e92015-03-04 14:59:19 -08002460 /* use cache location of next-to-find key */
2461 if (iter->pos > 0 && pos >= iter->pos) {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002462 pos -= iter->pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002463 key = iter->key;
2464 } else {
2465 t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002466 iter->tnode = t->kv;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002467 iter->pos = 0;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002468 key = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002469 }
2470
Alexander Duyck8be33e92015-03-04 14:59:19 -08002471 while ((l = leaf_walk_rcu(tp, key)) != NULL) {
2472 key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002473 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002474
Andy Whitcroft25b97c02015-08-13 20:49:01 +01002475 if (--pos <= 0)
Alexander Duyck8be33e92015-03-04 14:59:19 -08002476 break;
2477
2478 l = NULL;
2479
2480 /* handle unlikely case of a key wrap */
2481 if (!key)
2482 break;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002483 }
2484
2485 if (l)
Alexander Duyck8be33e92015-03-04 14:59:19 -08002486 iter->key = key; /* remember it */
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002487 else
2488 iter->pos = 0; /* forget it */
2489
2490 return l;
2491}
2492
2493static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos)
2494 __acquires(RCU)
2495{
2496 struct fib_route_iter *iter = seq->private;
2497 struct fib_table *tb;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002498 struct trie *t;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002499
2500 rcu_read_lock();
Alexander Duyck8be33e92015-03-04 14:59:19 -08002501
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002502 tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN);
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002503 if (!tb)
2504 return NULL;
2505
Alexander Duyck8be33e92015-03-04 14:59:19 -08002506 iter->main_tb = tb;
2507
2508 if (*pos != 0)
2509 return fib_route_get_idx(iter, *pos);
2510
2511 t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002512 iter->tnode = t->kv;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002513 iter->pos = 0;
2514 iter->key = 0;
2515
2516 return SEQ_START_TOKEN;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002517}
2518
2519static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2520{
2521 struct fib_route_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002522 struct key_vector *l = NULL;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002523 t_key key = iter->key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002524
2525 ++*pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002526
2527 /* only allow key of 0 for start of sequence */
2528 if ((v == SEQ_START_TOKEN) || key)
2529 l = leaf_walk_rcu(&iter->tnode, key);
2530
2531 if (l) {
2532 iter->key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002533 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002534 } else {
2535 iter->pos = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002536 }
2537
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002538 return l;
2539}
2540
2541static void fib_route_seq_stop(struct seq_file *seq, void *v)
2542 __releases(RCU)
2543{
2544 rcu_read_unlock();
2545}
2546
Eric Dumazeta034ee32010-09-09 23:32:28 +00002547static unsigned int fib_flag_trans(int type, __be32 mask, const struct fib_info *fi)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002548{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002549 unsigned int flags = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002550
Eric Dumazeta034ee32010-09-09 23:32:28 +00002551 if (type == RTN_UNREACHABLE || type == RTN_PROHIBIT)
2552 flags = RTF_REJECT;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002553 if (fi && fi->fib_nh->nh_gw)
2554 flags |= RTF_GATEWAY;
Al Viro32ab5f82006-09-26 22:21:45 -07002555 if (mask == htonl(0xFFFFFFFF))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002556 flags |= RTF_HOST;
2557 flags |= RTF_UP;
2558 return flags;
2559}
2560
2561/*
2562 * This outputs /proc/net/route.
2563 * The format of the file is not supposed to be changed
Eric Dumazeta034ee32010-09-09 23:32:28 +00002564 * and needs to be same as fib_hash output to avoid breaking
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002565 * legacy utilities
2566 */
2567static int fib_route_seq_show(struct seq_file *seq, void *v)
2568{
Alexander Duyck654eff42015-03-11 16:36:08 -07002569 struct fib_route_iter *iter = seq->private;
2570 struct fib_table *tb = iter->main_tb;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002571 struct fib_alias *fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002572 struct key_vector *l = v;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002573 __be32 prefix;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002574
2575 if (v == SEQ_START_TOKEN) {
2576 seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway "
2577 "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU"
2578 "\tWindow\tIRTT");
2579 return 0;
2580 }
2581
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002582 prefix = htonl(l->key);
2583
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002584 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2585 const struct fib_info *fi = fa->fa_info;
2586 __be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen);
2587 unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002588
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002589 if ((fa->fa_type == RTN_BROADCAST) ||
2590 (fa->fa_type == RTN_MULTICAST))
2591 continue;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002592
Alexander Duyck654eff42015-03-11 16:36:08 -07002593 if (fa->tb_id != tb->tb_id)
2594 continue;
2595
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002596 seq_setwidth(seq, 127);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002597
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002598 if (fi)
2599 seq_printf(seq,
2600 "%s\t%08X\t%08X\t%04X\t%d\t%u\t"
2601 "%d\t%08X\t%d\t%u\t%u",
2602 fi->fib_dev ? fi->fib_dev->name : "*",
2603 prefix,
2604 fi->fib_nh->nh_gw, flags, 0, 0,
2605 fi->fib_priority,
2606 mask,
2607 (fi->fib_advmss ?
2608 fi->fib_advmss + 40 : 0),
2609 fi->fib_window,
2610 fi->fib_rtt >> 3);
2611 else
2612 seq_printf(seq,
2613 "*\t%08X\t%08X\t%04X\t%d\t%u\t"
2614 "%d\t%08X\t%d\t%u\t%u",
2615 prefix, 0, flags, 0, 0, 0,
2616 mask, 0, 0, 0);
Tetsuo Handa652586d2013-11-14 14:31:57 -08002617
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002618 seq_pad(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002619 }
2620
2621 return 0;
2622}
2623
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002624static const struct seq_operations fib_route_seq_ops = {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002625 .start = fib_route_seq_start,
2626 .next = fib_route_seq_next,
2627 .stop = fib_route_seq_stop,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002628 .show = fib_route_seq_show,
2629};
2630
2631static int fib_route_seq_open(struct inode *inode, struct file *file)
2632{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002633 return seq_open_net(inode, file, &fib_route_seq_ops,
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002634 sizeof(struct fib_route_iter));
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002635}
2636
Arjan van de Ven9a321442007-02-12 00:55:35 -08002637static const struct file_operations fib_route_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002638 .owner = THIS_MODULE,
2639 .open = fib_route_seq_open,
2640 .read = seq_read,
2641 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002642 .release = seq_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002643};
2644
Denis V. Lunev61a02652008-01-10 03:21:09 -08002645int __net_init fib_proc_init(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002646{
Gao fengd4beaa62013-02-18 01:34:54 +00002647 if (!proc_create("fib_trie", S_IRUGO, net->proc_net, &fib_trie_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002648 goto out1;
2649
Gao fengd4beaa62013-02-18 01:34:54 +00002650 if (!proc_create("fib_triestat", S_IRUGO, net->proc_net,
2651 &fib_triestat_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002652 goto out2;
2653
Gao fengd4beaa62013-02-18 01:34:54 +00002654 if (!proc_create("route", S_IRUGO, net->proc_net, &fib_route_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002655 goto out3;
2656
Robert Olsson19baf832005-06-21 12:43:18 -07002657 return 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002658
2659out3:
Gao fengece31ff2013-02-18 01:34:56 +00002660 remove_proc_entry("fib_triestat", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002661out2:
Gao fengece31ff2013-02-18 01:34:56 +00002662 remove_proc_entry("fib_trie", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002663out1:
2664 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07002665}
2666
Denis V. Lunev61a02652008-01-10 03:21:09 -08002667void __net_exit fib_proc_exit(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002668{
Gao fengece31ff2013-02-18 01:34:56 +00002669 remove_proc_entry("fib_trie", net->proc_net);
2670 remove_proc_entry("fib_triestat", net->proc_net);
2671 remove_proc_entry("route", net->proc_net);
Robert Olsson19baf832005-06-21 12:43:18 -07002672}
2673
2674#endif /* CONFIG_PROC_FS */