blob: 744e5936c10d7ec555d1ca621f5bd4be57f1c72b [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 Duyck56ca2ad2015-03-06 09:54:33 -0800292 else if (n->tn_bits <= TNODE_KMALLOC_MAX)
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800293 kfree(n);
294 else
295 vfree(n);
Robert Olsson2373ce12005-08-25 13:01:29 -0700296}
297
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800298#define node_free(n) call_rcu(&tn_info(n)->rcu, __node_free_rcu)
Stephen Hemminger387a5482008-04-10 03:47:34 -0700299
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800300static struct tnode *tnode_alloc(int bits)
Robert Olsson2373ce12005-08-25 13:01:29 -0700301{
Alexander Duyck1de3d872015-03-04 15:04:46 -0800302 size_t size;
303
304 /* verify bits is within bounds */
305 if (bits > TNODE_VMALLOC_MAX)
306 return NULL;
307
308 /* determine size and verify it is non-zero and didn't overflow */
309 size = TNODE_SIZE(1ul << bits);
310
Robert Olsson2373ce12005-08-25 13:01:29 -0700311 if (size <= PAGE_SIZE)
Eric Dumazet8d965442008-01-13 22:31:44 -0800312 return kzalloc(size, GFP_KERNEL);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700313 else
Eric Dumazet7a1c8e52010-11-20 07:46:35 +0000314 return vzalloc(size);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700315}
Robert Olsson2373ce12005-08-25 13:01:29 -0700316
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800317static inline void empty_child_inc(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800318{
Alexander Duyck6e22d172015-03-06 09:54:39 -0800319 ++tn_info(n)->empty_children ? : ++tn_info(n)->full_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800320}
321
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800322static inline void empty_child_dec(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800323{
Alexander Duyck6e22d172015-03-06 09:54:39 -0800324 tn_info(n)->empty_children-- ? : tn_info(n)->full_children--;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800325}
326
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800327static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)
Robert Olsson19baf832005-06-21 12:43:18 -0700328{
Firo Yangf38b24c2015-06-08 11:54:51 +0800329 struct key_vector *l;
330 struct tnode *kv;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800331
Firo Yangf38b24c2015-06-08 11:54:51 +0800332 kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800333 if (!kv)
334 return NULL;
335
336 /* initialize key vector */
Firo Yangf38b24c2015-06-08 11:54:51 +0800337 l = kv->kv;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800338 l->key = key;
339 l->pos = 0;
340 l->bits = 0;
341 l->slen = fa->fa_slen;
342
343 /* link leaf to fib alias */
344 INIT_HLIST_HEAD(&l->leaf);
345 hlist_add_head(&fa->fa_list, &l->leaf);
346
Robert Olsson19baf832005-06-21 12:43:18 -0700347 return l;
348}
349
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800350static struct key_vector *tnode_new(t_key key, int pos, int bits)
Robert Olsson19baf832005-06-21 12:43:18 -0700351{
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800352 unsigned int shift = pos + bits;
Firo Yangf38b24c2015-06-08 11:54:51 +0800353 struct key_vector *tn;
354 struct tnode *tnode;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800355
356 /* verify bits and pos their msb bits clear and values are valid */
357 BUG_ON(!bits || (shift > KEYLENGTH));
Robert Olsson19baf832005-06-21 12:43:18 -0700358
Firo Yangf38b24c2015-06-08 11:54:51 +0800359 tnode = tnode_alloc(bits);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800360 if (!tnode)
361 return NULL;
362
Firo Yangf38b24c2015-06-08 11:54:51 +0800363 pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0),
364 sizeof(struct key_vector *) << bits);
365
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800366 if (bits == KEYLENGTH)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800367 tnode->full_children = 1;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800368 else
Alexander Duyck6e22d172015-03-06 09:54:39 -0800369 tnode->empty_children = 1ul << bits;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800370
Firo Yangf38b24c2015-06-08 11:54:51 +0800371 tn = tnode->kv;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800372 tn->key = (shift < KEYLENGTH) ? (key >> shift) << shift : 0;
373 tn->pos = pos;
374 tn->bits = bits;
375 tn->slen = pos;
376
Robert Olsson19baf832005-06-21 12:43:18 -0700377 return tn;
378}
379
Alexander Duycke9b44012014-12-31 10:56:12 -0800380/* Check whether a tnode 'n' is "full", i.e. it is an internal node
Robert Olsson19baf832005-06-21 12:43:18 -0700381 * and no bits are skipped. See discussion in dyntree paper p. 6
382 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800383static inline int tnode_full(struct key_vector *tn, struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700384{
Alexander Duycke9b44012014-12-31 10:56:12 -0800385 return n && ((n->pos + n->bits) == tn->pos) && IS_TNODE(n);
Robert Olsson19baf832005-06-21 12:43:18 -0700386}
387
Alexander Duyckff181ed2014-12-31 10:56:43 -0800388/* Add a child at position i overwriting the old value.
389 * Update the value of full_children and empty_children.
390 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800391static void put_child(struct key_vector *tn, unsigned long i,
392 struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700393{
Alexander Duyck754baf82015-03-06 09:54:14 -0800394 struct key_vector *chi = get_child(tn, i);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800395 int isfull, wasfull;
Robert Olsson19baf832005-06-21 12:43:18 -0700396
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800397 BUG_ON(i >= child_length(tn));
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700398
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800399 /* update emptyChildren, overflow into fullChildren */
Ian Morris00db4122015-04-03 09:17:27 +0100400 if (!n && chi)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800401 empty_child_inc(tn);
Ian Morris00db4122015-04-03 09:17:27 +0100402 if (n && !chi)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800403 empty_child_dec(tn);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700404
Robert Olsson19baf832005-06-21 12:43:18 -0700405 /* update fullChildren */
Alexander Duyckff181ed2014-12-31 10:56:43 -0800406 wasfull = tnode_full(tn, chi);
Robert Olsson19baf832005-06-21 12:43:18 -0700407 isfull = tnode_full(tn, n);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800408
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700409 if (wasfull && !isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800410 tn_info(tn)->full_children--;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700411 else if (!wasfull && isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800412 tn_info(tn)->full_children++;
Olof Johansson91b9a272005-08-09 20:24:39 -0700413
Alexander Duyck5405afd2014-12-31 10:57:08 -0800414 if (n && (tn->slen < n->slen))
415 tn->slen = n->slen;
416
Alexander Duyck41b489f2015-03-04 15:02:33 -0800417 rcu_assign_pointer(tn->tnode[i], n);
Robert Olsson19baf832005-06-21 12:43:18 -0700418}
419
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800420static void update_children(struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800421{
422 unsigned long i;
423
424 /* update all of the child parent pointers */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800425 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800426 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800427
428 if (!inode)
429 continue;
430
431 /* Either update the children of a tnode that
432 * already belongs to us or update the child
433 * to point to ourselves.
434 */
435 if (node_parent(inode) == tn)
436 update_children(inode);
437 else
438 node_set_parent(inode, tn);
439 }
440}
441
Alexander Duyck88bae712015-03-06 09:54:52 -0800442static inline void put_child_root(struct key_vector *tp, t_key key,
443 struct key_vector *n)
Alexander Duyck836a0122014-12-31 10:56:06 -0800444{
Alexander Duyck88bae712015-03-06 09:54:52 -0800445 if (IS_TRIE(tp))
446 rcu_assign_pointer(tp->tnode[0], n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800447 else
Alexander Duyck88bae712015-03-06 09:54:52 -0800448 put_child(tp, get_index(key, tp), n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800449}
450
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800451static inline void tnode_free_init(struct key_vector *tn)
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700452{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800453 tn_info(tn)->rcu.next = NULL;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800454}
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700455
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800456static inline void tnode_free_append(struct key_vector *tn,
457 struct key_vector *n)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800458{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800459 tn_info(n)->rcu.next = tn_info(tn)->rcu.next;
460 tn_info(tn)->rcu.next = &tn_info(n)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800461}
462
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800463static void tnode_free(struct key_vector *tn)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800464{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800465 struct callback_head *head = &tn_info(tn)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800466
467 while (head) {
468 head = head->next;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800469 tnode_free_size += TNODE_SIZE(1ul << tn->bits);
Alexander Duyckfc86a932014-12-31 10:56:49 -0800470 node_free(tn);
471
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800472 tn = container_of(head, struct tnode, rcu)->kv;
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700473 }
Alexander Duyckfc86a932014-12-31 10:56:49 -0800474
475 if (tnode_free_size >= PAGE_SIZE * sync_pages) {
476 tnode_free_size = 0;
477 synchronize_rcu();
478 }
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700479}
480
Alexander Duyck88bae712015-03-06 09:54:52 -0800481static struct key_vector *replace(struct trie *t,
482 struct key_vector *oldtnode,
483 struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800484{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800485 struct key_vector *tp = node_parent(oldtnode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800486 unsigned long i;
487
488 /* setup the parent pointer out of and back into this node */
489 NODE_INIT_PARENT(tn, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -0800490 put_child_root(tp, tn->key, tn);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800491
492 /* update all of the child parent pointers */
493 update_children(tn);
494
495 /* all pointers should be clean so we are done */
496 tnode_free(oldtnode);
497
498 /* resize children now that oldtnode is freed */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800499 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800500 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800501
502 /* resize child node */
503 if (tnode_full(tn, inode))
Alexander Duyck88bae712015-03-06 09:54:52 -0800504 tn = resize(t, inode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800505 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800506
Alexander Duyck88bae712015-03-06 09:54:52 -0800507 return tp;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800508}
509
Alexander Duyck88bae712015-03-06 09:54:52 -0800510static struct key_vector *inflate(struct trie *t,
511 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700512{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800513 struct key_vector *tn;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800514 unsigned long i;
Alexander Duycke9b44012014-12-31 10:56:12 -0800515 t_key m;
Robert Olsson19baf832005-06-21 12:43:18 -0700516
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700517 pr_debug("In inflate\n");
Robert Olsson19baf832005-06-21 12:43:18 -0700518
Alexander Duycke9b44012014-12-31 10:56:12 -0800519 tn = tnode_new(oldtnode->key, oldtnode->pos - 1, oldtnode->bits + 1);
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700520 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800521 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700522
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800523 /* prepare oldtnode to be freed */
524 tnode_free_init(oldtnode);
525
Alexander Duyck12c081a2014-12-31 10:56:55 -0800526 /* Assemble all of the pointers in our cluster, in this case that
527 * represents all of the pointers out of our allocated nodes that
528 * point to existing tnodes and the links between our allocated
529 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700530 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800531 for (i = child_length(oldtnode), m = 1u << tn->pos; i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800532 struct key_vector *inode = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800533 struct key_vector *node0, *node1;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800534 unsigned long j, k;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700535
Robert Olsson19baf832005-06-21 12:43:18 -0700536 /* An empty child */
Ian Morris51456b22015-04-03 09:17:26 +0100537 if (!inode)
Robert Olsson19baf832005-06-21 12:43:18 -0700538 continue;
539
540 /* A leaf or an internal node with skipped bits */
Alexander Duyckadaf9812014-12-31 10:55:47 -0800541 if (!tnode_full(oldtnode, inode)) {
Alexander Duycke9b44012014-12-31 10:56:12 -0800542 put_child(tn, get_index(inode->key, tn), inode);
Robert Olsson19baf832005-06-21 12:43:18 -0700543 continue;
544 }
545
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800546 /* drop the node in the old tnode free list */
547 tnode_free_append(oldtnode, inode);
548
Robert Olsson19baf832005-06-21 12:43:18 -0700549 /* An internal node with two children */
Robert Olsson19baf832005-06-21 12:43:18 -0700550 if (inode->bits == 1) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800551 put_child(tn, 2 * i + 1, get_child(inode, 1));
552 put_child(tn, 2 * i, get_child(inode, 0));
Olof Johansson91b9a272005-08-09 20:24:39 -0700553 continue;
Robert Olsson19baf832005-06-21 12:43:18 -0700554 }
555
Olof Johansson91b9a272005-08-09 20:24:39 -0700556 /* We will replace this node 'inode' with two new
Alexander Duyck12c081a2014-12-31 10:56:55 -0800557 * ones, 'node0' and 'node1', each with half of the
Olof Johansson91b9a272005-08-09 20:24:39 -0700558 * original children. The two new nodes will have
559 * a position one bit further down the key and this
560 * means that the "significant" part of their keys
561 * (see the discussion near the top of this file)
562 * will differ by one bit, which will be "0" in
Alexander Duyck12c081a2014-12-31 10:56:55 -0800563 * node0's key and "1" in node1's key. Since we are
Olof Johansson91b9a272005-08-09 20:24:39 -0700564 * moving the key position by one step, the bit that
565 * we are moving away from - the bit at position
Alexander Duyck12c081a2014-12-31 10:56:55 -0800566 * (tn->pos) - is the one that will differ between
567 * node0 and node1. So... we synthesize that bit in the
568 * two new keys.
Olof Johansson91b9a272005-08-09 20:24:39 -0700569 */
Alexander Duyck12c081a2014-12-31 10:56:55 -0800570 node1 = tnode_new(inode->key | m, inode->pos, inode->bits - 1);
571 if (!node1)
572 goto nomem;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800573 node0 = tnode_new(inode->key, inode->pos, inode->bits - 1);
Robert Olsson19baf832005-06-21 12:43:18 -0700574
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800575 tnode_free_append(tn, node1);
Alexander Duyck12c081a2014-12-31 10:56:55 -0800576 if (!node0)
577 goto nomem;
578 tnode_free_append(tn, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700579
Alexander Duyck12c081a2014-12-31 10:56:55 -0800580 /* populate child pointers in new nodes */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800581 for (k = child_length(inode), j = k / 2; j;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800582 put_child(node1, --j, get_child(inode, --k));
583 put_child(node0, j, get_child(inode, j));
584 put_child(node1, --j, get_child(inode, --k));
585 put_child(node0, j, get_child(inode, j));
Robert Olsson19baf832005-06-21 12:43:18 -0700586 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800587
Alexander Duyck12c081a2014-12-31 10:56:55 -0800588 /* link new nodes to parent */
589 NODE_INIT_PARENT(node1, tn);
590 NODE_INIT_PARENT(node0, tn);
Olof Johansson91b9a272005-08-09 20:24:39 -0700591
Alexander Duyck12c081a2014-12-31 10:56:55 -0800592 /* link parent to nodes */
593 put_child(tn, 2 * i + 1, node1);
594 put_child(tn, 2 * i, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700595 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800596
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800597 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800598 return replace(t, oldtnode, tn);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700599nomem:
Alexander Duyckfc86a932014-12-31 10:56:49 -0800600 /* all pointers should be clean so we are done */
601 tnode_free(tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800602notnode:
603 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700604}
605
Alexander Duyck88bae712015-03-06 09:54:52 -0800606static struct key_vector *halve(struct trie *t,
607 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700608{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800609 struct key_vector *tn;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800610 unsigned long i;
Robert Olsson19baf832005-06-21 12:43:18 -0700611
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700612 pr_debug("In halve\n");
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700613
Alexander Duycke9b44012014-12-31 10:56:12 -0800614 tn = tnode_new(oldtnode->key, oldtnode->pos + 1, oldtnode->bits - 1);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700615 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800616 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700617
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800618 /* prepare oldtnode to be freed */
619 tnode_free_init(oldtnode);
620
Alexander Duyck12c081a2014-12-31 10:56:55 -0800621 /* Assemble all of the pointers in our cluster, in this case that
622 * represents all of the pointers out of our allocated nodes that
623 * point to existing tnodes and the links between our allocated
624 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700625 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800626 for (i = child_length(oldtnode); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800627 struct key_vector *node1 = get_child(oldtnode, --i);
628 struct key_vector *node0 = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800629 struct key_vector *inode;
Robert Olsson2f368952005-07-05 15:02:40 -0700630
Alexander Duyck12c081a2014-12-31 10:56:55 -0800631 /* At least one of the children is empty */
632 if (!node1 || !node0) {
633 put_child(tn, i / 2, node1 ? : node0);
634 continue;
Robert Olsson2f368952005-07-05 15:02:40 -0700635 }
Robert Olsson2f368952005-07-05 15:02:40 -0700636
Alexander Duyck12c081a2014-12-31 10:56:55 -0800637 /* Two nonempty children */
638 inode = tnode_new(node0->key, oldtnode->pos, 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800639 if (!inode)
640 goto nomem;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800641 tnode_free_append(tn, inode);
642
643 /* initialize pointers out of node */
644 put_child(inode, 1, node1);
645 put_child(inode, 0, node0);
646 NODE_INIT_PARENT(inode, tn);
647
648 /* link parent to node */
649 put_child(tn, i / 2, inode);
Robert Olsson2f368952005-07-05 15:02:40 -0700650 }
Robert Olsson19baf832005-06-21 12:43:18 -0700651
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800652 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800653 return replace(t, oldtnode, tn);
654nomem:
655 /* all pointers should be clean so we are done */
656 tnode_free(tn);
657notnode:
658 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700659}
660
Alexander Duyck88bae712015-03-06 09:54:52 -0800661static struct key_vector *collapse(struct trie *t,
662 struct key_vector *oldtnode)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800663{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800664 struct key_vector *n, *tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800665 unsigned long i;
666
667 /* scan the tnode looking for that one child that might still exist */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800668 for (n = NULL, i = child_length(oldtnode); !n && i;)
Alexander Duyck754baf82015-03-06 09:54:14 -0800669 n = get_child(oldtnode, --i);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800670
671 /* compress one level */
672 tp = node_parent(oldtnode);
Alexander Duyck88bae712015-03-06 09:54:52 -0800673 put_child_root(tp, oldtnode->key, n);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800674 node_set_parent(n, tp);
675
676 /* drop dead node */
677 node_free(oldtnode);
Alexander Duyck88bae712015-03-06 09:54:52 -0800678
679 return tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800680}
681
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800682static unsigned char update_suffix(struct key_vector *tn)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800683{
684 unsigned char slen = tn->pos;
685 unsigned long stride, i;
686
687 /* search though the list of children looking for nodes that might
688 * have a suffix greater than the one we currently have. This is
689 * why we start with a stride of 2 since a stride of 1 would
690 * represent the nodes with suffix length equal to tn->pos
691 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800692 for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800693 struct key_vector *n = get_child(tn, i);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800694
695 if (!n || (n->slen <= slen))
696 continue;
697
698 /* update stride and slen based on new value */
699 stride <<= (n->slen - slen);
700 slen = n->slen;
701 i &= ~(stride - 1);
702
703 /* if slen covers all but the last bit we can stop here
704 * there will be nothing longer than that since only node
705 * 0 and 1 << (bits - 1) could have that as their suffix
706 * length.
707 */
708 if ((slen + 1) >= (tn->pos + tn->bits))
709 break;
710 }
711
712 tn->slen = slen;
713
714 return slen;
715}
716
Alexander Duyckf05a4812014-12-31 10:56:37 -0800717/* From "Implementing a dynamic compressed trie" by Stefan Nilsson of
718 * the Helsinki University of Technology and Matti Tikkanen of Nokia
719 * Telecommunications, page 6:
720 * "A node is doubled if the ratio of non-empty children to all
721 * children in the *doubled* node is at least 'high'."
722 *
723 * 'high' in this instance is the variable 'inflate_threshold'. It
724 * is expressed as a percentage, so we multiply it with
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800725 * child_length() and instead of multiplying by 2 (since the
Alexander Duyckf05a4812014-12-31 10:56:37 -0800726 * child array will be doubled by inflate()) and multiplying
727 * the left-hand side by 100 (to handle the percentage thing) we
728 * multiply the left-hand side by 50.
729 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800730 * The left-hand side may look a bit weird: child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800731 * - tn->empty_children is of course the number of non-null children
732 * in the current node. tn->full_children is the number of "full"
733 * children, that is non-null tnodes with a skip value of 0.
734 * All of those will be doubled in the resulting inflated tnode, so
735 * we just count them one extra time here.
736 *
737 * A clearer way to write this would be:
738 *
739 * to_be_doubled = tn->full_children;
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800740 * not_to_be_doubled = child_length(tn) - tn->empty_children -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800741 * tn->full_children;
742 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800743 * new_child_length = child_length(tn) * 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800744 *
745 * new_fill_factor = 100 * (not_to_be_doubled + 2*to_be_doubled) /
746 * new_child_length;
747 * if (new_fill_factor >= inflate_threshold)
748 *
749 * ...and so on, tho it would mess up the while () loop.
750 *
751 * anyway,
752 * 100 * (not_to_be_doubled + 2*to_be_doubled) / new_child_length >=
753 * inflate_threshold
754 *
755 * avoid a division:
756 * 100 * (not_to_be_doubled + 2*to_be_doubled) >=
757 * inflate_threshold * new_child_length
758 *
759 * expand not_to_be_doubled and to_be_doubled, and shorten:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800760 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800761 * tn->full_children) >= inflate_threshold * new_child_length
762 *
763 * expand new_child_length:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800764 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800765 * tn->full_children) >=
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800766 * inflate_threshold * child_length(tn) * 2
Alexander Duyckf05a4812014-12-31 10:56:37 -0800767 *
768 * shorten again:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800769 * 50 * (tn->full_children + child_length(tn) -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800770 * tn->empty_children) >= inflate_threshold *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800771 * child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800772 *
773 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800774static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800775{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800776 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800777 unsigned long threshold = used;
778
779 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800780 threshold *= IS_TRIE(tp) ? inflate_threshold_root : inflate_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800781 used -= tn_info(tn)->empty_children;
782 used += tn_info(tn)->full_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800783
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800784 /* if bits == KEYLENGTH then pos = 0, and will fail below */
785
786 return (used > 1) && tn->pos && ((50 * used) >= threshold);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800787}
788
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800789static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800790{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800791 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800792 unsigned long threshold = used;
793
794 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800795 threshold *= IS_TRIE(tp) ? halve_threshold_root : halve_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800796 used -= tn_info(tn)->empty_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800797
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800798 /* if bits == KEYLENGTH then used = 100% on wrap, and will fail below */
799
800 return (used > 1) && (tn->bits > 1) && ((100 * used) < threshold);
801}
802
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800803static inline bool should_collapse(struct key_vector *tn)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800804{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800805 unsigned long used = child_length(tn);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800806
Alexander Duyck6e22d172015-03-06 09:54:39 -0800807 used -= tn_info(tn)->empty_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800808
809 /* account for bits == KEYLENGTH case */
Alexander Duyck6e22d172015-03-06 09:54:39 -0800810 if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800811 used -= KEY_MAX;
812
813 /* One child or none, time to drop us from the trie */
814 return used < 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800815}
816
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800817#define MAX_WORK 10
Alexander Duyck88bae712015-03-06 09:54:52 -0800818static struct key_vector *resize(struct trie *t, struct key_vector *tn)
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800819{
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800820#ifdef CONFIG_IP_FIB_TRIE_STATS
821 struct trie_use_stats __percpu *stats = t->stats;
822#endif
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800823 struct key_vector *tp = node_parent(tn);
Alexander Duyck88bae712015-03-06 09:54:52 -0800824 unsigned long cindex = get_index(tn->key, tp);
Alexander Duycka80e89d2015-01-22 15:51:20 -0800825 int max_work = MAX_WORK;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800826
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800827 pr_debug("In tnode_resize %p inflate_threshold=%d threshold=%d\n",
828 tn, inflate_threshold, halve_threshold);
829
Alexander Duyckff181ed2014-12-31 10:56:43 -0800830 /* track the tnode via the pointer from the parent instead of
831 * doing it ourselves. This way we can let RCU fully do its
832 * thing without us interfering
833 */
Alexander Duyck88bae712015-03-06 09:54:52 -0800834 BUG_ON(tn != get_child(tp, cindex));
Alexander Duyckff181ed2014-12-31 10:56:43 -0800835
Alexander Duyckf05a4812014-12-31 10:56:37 -0800836 /* Double as long as the resulting node has a number of
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800837 * nonempty nodes that are above the threshold.
838 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700839 while (should_inflate(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800840 tp = inflate(t, tn);
841 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800842#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800843 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800844#endif
845 break;
846 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800847
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700848 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800849 tn = get_child(tp, cindex);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800850 }
851
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700852 /* update parent in case inflate failed */
853 tp = node_parent(tn);
854
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800855 /* Return if at least one inflate is run */
856 if (max_work != MAX_WORK)
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700857 return tp;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800858
Alexander Duyckf05a4812014-12-31 10:56:37 -0800859 /* Halve as long as the number of empty children in this
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800860 * node is above threshold.
861 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700862 while (should_halve(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800863 tp = halve(t, tn);
864 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800865#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800866 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800867#endif
868 break;
869 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800870
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700871 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800872 tn = get_child(tp, cindex);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800873 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800874
875 /* Only one child remains */
Alexander Duyck88bae712015-03-06 09:54:52 -0800876 if (should_collapse(tn))
877 return collapse(t, tn);
878
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700879 /* update parent in case halve failed */
Alexander Duyck88bae712015-03-06 09:54:52 -0800880 tp = node_parent(tn);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800881
882 /* Return if at least one deflate was run */
883 if (max_work != MAX_WORK)
Alexander Duyck88bae712015-03-06 09:54:52 -0800884 return tp;
Alexander Duyck5405afd2014-12-31 10:57:08 -0800885
886 /* push the suffix length to the parent node */
887 if (tn->slen > tn->pos) {
888 unsigned char slen = update_suffix(tn);
889
Alexander Duyck88bae712015-03-06 09:54:52 -0800890 if (slen > tp->slen)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800891 tp->slen = slen;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800892 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800893
Alexander Duyck88bae712015-03-06 09:54:52 -0800894 return tp;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800895}
896
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800897static void leaf_pull_suffix(struct key_vector *tp, struct key_vector *l)
Robert Olsson19baf832005-06-21 12:43:18 -0700898{
Alexander Duyck88bae712015-03-06 09:54:52 -0800899 while ((tp->slen > tp->pos) && (tp->slen > l->slen)) {
Alexander Duyck5405afd2014-12-31 10:57:08 -0800900 if (update_suffix(tp) > l->slen)
901 break;
902 tp = node_parent(tp);
903 }
904}
905
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800906static void leaf_push_suffix(struct key_vector *tn, struct key_vector *l)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800907{
Alexander Duyck5405afd2014-12-31 10:57:08 -0800908 /* if this is a new leaf then tn will be NULL and we can sort
909 * out parent suffix lengths as a part of trie_rebalance
910 */
Alexander Duyck88bae712015-03-06 09:54:52 -0800911 while (tn->slen < l->slen) {
Alexander Duyck5405afd2014-12-31 10:57:08 -0800912 tn->slen = l->slen;
913 tn = node_parent(tn);
914 }
915}
916
Robert Olsson2373ce12005-08-25 13:01:29 -0700917/* rcu_read_lock needs to be hold by caller from readside */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800918static struct key_vector *fib_find_node(struct trie *t,
919 struct key_vector **tp, u32 key)
Robert Olsson19baf832005-06-21 12:43:18 -0700920{
Alexander Duyck88bae712015-03-06 09:54:52 -0800921 struct key_vector *pn, *n = t->kv;
922 unsigned long index = 0;
Robert Olsson19baf832005-06-21 12:43:18 -0700923
Alexander Duyck88bae712015-03-06 09:54:52 -0800924 do {
925 pn = n;
926 n = get_child_rcu(n, index);
927
928 if (!n)
929 break;
930
931 index = get_cindex(key, n);
Alexander Duyck939afb02014-12-31 10:56:00 -0800932
933 /* This bit of code is a bit tricky but it combines multiple
934 * checks into a single check. The prefix consists of the
935 * prefix plus zeros for the bits in the cindex. The index
936 * is the difference between the key and this value. From
937 * this we can actually derive several pieces of data.
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800938 * if (index >= (1ul << bits))
Alexander Duyck939afb02014-12-31 10:56:00 -0800939 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -0800940 * else
941 * we know the value is cindex
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800942 *
943 * This check is safe even if bits == KEYLENGTH due to the
944 * fact that we can only allocate a node with 32 bits if a
945 * long is greater than 32 bits.
Alexander Duyck939afb02014-12-31 10:56:00 -0800946 */
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800947 if (index >= (1ul << n->bits)) {
948 n = NULL;
949 break;
950 }
Alexander Duyck939afb02014-12-31 10:56:00 -0800951
Alexander Duyck88bae712015-03-06 09:54:52 -0800952 /* keep searching until we find a perfect match leaf or NULL */
953 } while (IS_TNODE(n));
Robert Olsson19baf832005-06-21 12:43:18 -0700954
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800955 *tp = pn;
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800956
Alexander Duyck939afb02014-12-31 10:56:00 -0800957 return n;
Robert Olsson19baf832005-06-21 12:43:18 -0700958}
959
Alexander Duyck02525362015-01-22 15:51:39 -0800960/* Return the first fib alias matching TOS with
961 * priority less than or equal to PRIO.
962 */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800963static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen,
Alexander Duyck0b65bd92015-03-12 14:46:29 -0700964 u8 tos, u32 prio, u32 tb_id)
Alexander Duyck02525362015-01-22 15:51:39 -0800965{
966 struct fib_alias *fa;
967
968 if (!fah)
969 return NULL;
970
Alexander Duyck56315f92015-02-25 15:31:31 -0800971 hlist_for_each_entry(fa, fah, fa_list) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800972 if (fa->fa_slen < slen)
973 continue;
974 if (fa->fa_slen != slen)
975 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -0700976 if (fa->tb_id > tb_id)
977 continue;
978 if (fa->tb_id != tb_id)
979 break;
Alexander Duyck02525362015-01-22 15:51:39 -0800980 if (fa->fa_tos > tos)
981 continue;
982 if (fa->fa_info->fib_priority >= prio || fa->fa_tos < tos)
983 return fa;
984 }
985
986 return NULL;
987}
988
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800989static void trie_rebalance(struct trie *t, struct key_vector *tn)
Robert Olsson19baf832005-06-21 12:43:18 -0700990{
Alexander Duyck88bae712015-03-06 09:54:52 -0800991 while (!IS_TRIE(tn))
992 tn = resize(t, tn);
Robert Olsson19baf832005-06-21 12:43:18 -0700993}
994
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800995static int fib_insert_node(struct trie *t, struct key_vector *tp,
Alexander Duyckd5d64872015-03-04 15:02:18 -0800996 struct fib_alias *new, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -0700997{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800998 struct key_vector *n, *l;
Alexander Duyck836a0122014-12-31 10:56:06 -0800999
Alexander Duyckd5d64872015-03-04 15:02:18 -08001000 l = leaf_new(key, new);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001001 if (!l)
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001002 goto noleaf;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001003
1004 /* retrieve child from parent node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001005 n = get_child(tp, get_index(key, tp));
Alexander Duyck836a0122014-12-31 10:56:06 -08001006
1007 /* Case 2: n is a LEAF or a TNODE and the key doesn't match.
1008 *
1009 * Add a new tnode here
1010 * first tnode need some special handling
1011 * leaves us in position for handling as case 3
1012 */
1013 if (n) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001014 struct key_vector *tn;
Alexander Duyck836a0122014-12-31 10:56:06 -08001015
Alexander Duycke9b44012014-12-31 10:56:12 -08001016 tn = tnode_new(key, __fls(key ^ n->key), 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001017 if (!tn)
1018 goto notnode;
Olof Johansson91b9a272005-08-09 20:24:39 -07001019
Alexander Duyck836a0122014-12-31 10:56:06 -08001020 /* initialize routes out of node */
1021 NODE_INIT_PARENT(tn, tp);
1022 put_child(tn, get_index(key, tn) ^ 1, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001023
Alexander Duyck836a0122014-12-31 10:56:06 -08001024 /* start adding routes into the node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001025 put_child_root(tp, key, tn);
Alexander Duyck836a0122014-12-31 10:56:06 -08001026 node_set_parent(n, tn);
Robert Olsson19baf832005-06-21 12:43:18 -07001027
Alexander Duyck836a0122014-12-31 10:56:06 -08001028 /* parent now has a NULL spot where the leaf can go */
Alexander Duycke962f302014-12-10 21:49:22 -08001029 tp = tn;
Robert Olsson19baf832005-06-21 12:43:18 -07001030 }
Olof Johansson91b9a272005-08-09 20:24:39 -07001031
Alexander Duyck836a0122014-12-31 10:56:06 -08001032 /* Case 3: n is NULL, and will just insert a new leaf */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001033 NODE_INIT_PARENT(l, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -08001034 put_child_root(tp, key, l);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001035 trie_rebalance(t, tp);
Olof Johansson91b9a272005-08-09 20:24:39 -07001036
Alexander Duyckd5d64872015-03-04 15:02:18 -08001037 return 0;
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001038notnode:
1039 node_free(l);
1040noleaf:
1041 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07001042}
1043
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001044static int fib_insert_alias(struct trie *t, struct key_vector *tp,
1045 struct key_vector *l, struct fib_alias *new,
Alexander Duyckd5d64872015-03-04 15:02:18 -08001046 struct fib_alias *fa, t_key key)
1047{
1048 if (!l)
1049 return fib_insert_node(t, tp, new, key);
1050
1051 if (fa) {
1052 hlist_add_before_rcu(&new->fa_list, &fa->fa_list);
1053 } else {
1054 struct fib_alias *last;
1055
1056 hlist_for_each_entry(last, &l->leaf, fa_list) {
1057 if (new->fa_slen < last->fa_slen)
1058 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001059 if ((new->fa_slen == last->fa_slen) &&
1060 (new->tb_id > last->tb_id))
1061 break;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001062 fa = last;
1063 }
1064
1065 if (fa)
1066 hlist_add_behind_rcu(&new->fa_list, &fa->fa_list);
1067 else
1068 hlist_add_head_rcu(&new->fa_list, &l->leaf);
1069 }
1070
1071 /* if we added to the tail node then we need to update slen */
1072 if (l->slen < new->fa_slen) {
1073 l->slen = new->fa_slen;
1074 leaf_push_suffix(tp, l);
1075 }
1076
1077 return 0;
1078}
1079
1080/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001081int fib_table_insert(struct fib_table *tb, struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001082{
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001083 struct trie *t = (struct trie *)tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001084 struct fib_alias *fa, *new_fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001085 struct key_vector *l, *tp;
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001086 unsigned int nlflags = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001087 struct fib_info *fi;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001088 u8 plen = cfg->fc_dst_len;
1089 u8 slen = KEYLENGTH - plen;
Thomas Graf4e902c52006-08-17 18:14:52 -07001090 u8 tos = cfg->fc_tos;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001091 u32 key;
Robert Olsson19baf832005-06-21 12:43:18 -07001092 int err;
Robert Olsson19baf832005-06-21 12:43:18 -07001093
Alexander Duyck5786ec62015-02-25 15:31:37 -08001094 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001095 return -EINVAL;
1096
Thomas Graf4e902c52006-08-17 18:14:52 -07001097 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001098
Patrick McHardy2dfe55b2006-08-10 23:08:33 -07001099 pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen);
Robert Olsson19baf832005-06-21 12:43:18 -07001100
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001101 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001102 return -EINVAL;
1103
Thomas Graf4e902c52006-08-17 18:14:52 -07001104 fi = fib_create_info(cfg);
1105 if (IS_ERR(fi)) {
1106 err = PTR_ERR(fi);
Robert Olsson19baf832005-06-21 12:43:18 -07001107 goto err;
Thomas Graf4e902c52006-08-17 18:14:52 -07001108 }
Robert Olsson19baf832005-06-21 12:43:18 -07001109
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001110 l = fib_find_node(t, &tp, key);
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001111 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority,
1112 tb->tb_id) : NULL;
Robert Olsson19baf832005-06-21 12:43:18 -07001113
1114 /* Now fa, if non-NULL, points to the first fib alias
1115 * with the same keys [prefix,tos,priority], if such key already
1116 * exists or to the node before which we will insert new one.
1117 *
1118 * If fa is NULL, we will need to allocate a new one and
Alexander Duyck56315f92015-02-25 15:31:31 -08001119 * insert to the tail of the section matching the suffix length
1120 * of the new alias.
Robert Olsson19baf832005-06-21 12:43:18 -07001121 */
1122
Julian Anastasov936f6f82008-01-28 21:18:06 -08001123 if (fa && fa->fa_tos == tos &&
1124 fa->fa_info->fib_priority == fi->fib_priority) {
1125 struct fib_alias *fa_first, *fa_match;
Robert Olsson19baf832005-06-21 12:43:18 -07001126
1127 err = -EEXIST;
Thomas Graf4e902c52006-08-17 18:14:52 -07001128 if (cfg->fc_nlflags & NLM_F_EXCL)
Robert Olsson19baf832005-06-21 12:43:18 -07001129 goto out;
1130
Julian Anastasov936f6f82008-01-28 21:18:06 -08001131 /* We have 2 goals:
1132 * 1. Find exact match for type, scope, fib_info to avoid
1133 * duplicate routes
1134 * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it
1135 */
1136 fa_match = NULL;
1137 fa_first = fa;
Alexander Duyck56315f92015-02-25 15:31:31 -08001138 hlist_for_each_entry_from(fa, fa_list) {
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001139 if ((fa->fa_slen != slen) ||
1140 (fa->tb_id != tb->tb_id) ||
1141 (fa->fa_tos != tos))
Julian Anastasov936f6f82008-01-28 21:18:06 -08001142 break;
1143 if (fa->fa_info->fib_priority != fi->fib_priority)
1144 break;
1145 if (fa->fa_type == cfg->fc_type &&
Julian Anastasov936f6f82008-01-28 21:18:06 -08001146 fa->fa_info == fi) {
1147 fa_match = fa;
1148 break;
1149 }
1150 }
1151
Thomas Graf4e902c52006-08-17 18:14:52 -07001152 if (cfg->fc_nlflags & NLM_F_REPLACE) {
Robert Olsson19baf832005-06-21 12:43:18 -07001153 struct fib_info *fi_drop;
1154 u8 state;
1155
Julian Anastasov936f6f82008-01-28 21:18:06 -08001156 fa = fa_first;
1157 if (fa_match) {
1158 if (fa == fa_match)
1159 err = 0;
Joonwoo Park67250332008-01-18 03:45:18 -08001160 goto out;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001161 }
Robert Olsson2373ce12005-08-25 13:01:29 -07001162 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001163 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001164 if (!new_fa)
Robert Olsson2373ce12005-08-25 13:01:29 -07001165 goto out;
Robert Olsson19baf832005-06-21 12:43:18 -07001166
1167 fi_drop = fa->fa_info;
Robert Olsson2373ce12005-08-25 13:01:29 -07001168 new_fa->fa_tos = fa->fa_tos;
1169 new_fa->fa_info = fi;
Thomas Graf4e902c52006-08-17 18:14:52 -07001170 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001171 state = fa->fa_state;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001172 new_fa->fa_state = state & ~FA_S_ACCESSED;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001173 new_fa->fa_slen = fa->fa_slen;
Michal Kubečekd4e64c22015-05-22 13:40:09 +02001174 new_fa->tb_id = tb->tb_id;
Julian Anastasov2392deb2015-07-22 10:43:23 +03001175 new_fa->fa_default = -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001176
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001177 err = switchdev_fib_ipv4_add(key, plen, fi,
1178 new_fa->fa_tos,
1179 cfg->fc_type,
1180 cfg->fc_nlflags,
1181 tb->tb_id);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001182 if (err) {
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001183 switchdev_fib_ipv4_abort(fi);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001184 kmem_cache_free(fn_alias_kmem, new_fa);
1185 goto out;
1186 }
1187
Alexander Duyck56315f92015-02-25 15:31:31 -08001188 hlist_replace_rcu(&fa->fa_list, &new_fa->fa_list);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001189
Robert Olsson2373ce12005-08-25 13:01:29 -07001190 alias_free_mem_rcu(fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001191
1192 fib_release_info(fi_drop);
1193 if (state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001194 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Milan Kocianb8f55832007-05-23 14:55:06 -07001195 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen,
1196 tb->tb_id, &cfg->fc_nlinfo, NLM_F_REPLACE);
Robert Olsson19baf832005-06-21 12:43:18 -07001197
Olof Johansson91b9a272005-08-09 20:24:39 -07001198 goto succeeded;
Robert Olsson19baf832005-06-21 12:43:18 -07001199 }
1200 /* Error if we find a perfect match which
1201 * uses the same scope, type, and nexthop
1202 * information.
1203 */
Julian Anastasov936f6f82008-01-28 21:18:06 -08001204 if (fa_match)
1205 goto out;
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001206
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001207 if (cfg->fc_nlflags & NLM_F_APPEND)
1208 nlflags = NLM_F_APPEND;
1209 else
Julian Anastasov936f6f82008-01-28 21:18:06 -08001210 fa = fa_first;
Robert Olsson19baf832005-06-21 12:43:18 -07001211 }
1212 err = -ENOENT;
Thomas Graf4e902c52006-08-17 18:14:52 -07001213 if (!(cfg->fc_nlflags & NLM_F_CREATE))
Robert Olsson19baf832005-06-21 12:43:18 -07001214 goto out;
1215
1216 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001217 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001218 if (!new_fa)
Robert Olsson19baf832005-06-21 12:43:18 -07001219 goto out;
1220
1221 new_fa->fa_info = fi;
1222 new_fa->fa_tos = tos;
Thomas Graf4e902c52006-08-17 18:14:52 -07001223 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001224 new_fa->fa_state = 0;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001225 new_fa->fa_slen = slen;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001226 new_fa->tb_id = tb->tb_id;
Julian Anastasov2392deb2015-07-22 10:43:23 +03001227 new_fa->fa_default = -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001228
Scott Feldman8e05fd72015-03-05 21:21:19 -08001229 /* (Optionally) offload fib entry to switch hardware. */
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001230 err = switchdev_fib_ipv4_add(key, plen, fi, tos, cfg->fc_type,
1231 cfg->fc_nlflags, tb->tb_id);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001232 if (err) {
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001233 switchdev_fib_ipv4_abort(fi);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001234 goto out_free_new_fa;
1235 }
1236
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001237 /* Insert new entry to the list. */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001238 err = fib_insert_alias(t, tp, l, new_fa, fa, key);
1239 if (err)
Scott Feldman8e05fd72015-03-05 21:21:19 -08001240 goto out_sw_fib_del;
Robert Olsson19baf832005-06-21 12:43:18 -07001241
David S. Miller21d8c492011-04-14 14:49:37 -07001242 if (!plen)
1243 tb->tb_num_default++;
1244
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001245 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001246 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, new_fa->tb_id,
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001247 &cfg->fc_nlinfo, nlflags);
Robert Olsson19baf832005-06-21 12:43:18 -07001248succeeded:
1249 return 0;
Robert Olssonf835e472005-06-28 15:00:39 -07001250
Scott Feldman8e05fd72015-03-05 21:21:19 -08001251out_sw_fib_del:
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001252 switchdev_fib_ipv4_del(key, plen, fi, tos, cfg->fc_type, tb->tb_id);
Robert Olssonf835e472005-06-28 15:00:39 -07001253out_free_new_fa:
1254 kmem_cache_free(fn_alias_kmem, new_fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001255out:
1256 fib_release_info(fi);
Olof Johansson91b9a272005-08-09 20:24:39 -07001257err:
Robert Olsson19baf832005-06-21 12:43:18 -07001258 return err;
1259}
1260
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001261static inline t_key prefix_mismatch(t_key key, struct key_vector *n)
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001262{
1263 t_key prefix = n->key;
1264
1265 return (key ^ prefix) & (prefix | -prefix);
1266}
1267
Alexander Duyck345e9b52014-12-31 10:56:24 -08001268/* should be called with rcu_read_lock */
David S. Miller22bd5b92011-03-11 19:54:08 -05001269int fib_table_lookup(struct fib_table *tb, const struct flowi4 *flp,
Eric Dumazetebc0ffa2010-10-05 10:41:36 +00001270 struct fib_result *res, int fib_flags)
Robert Olsson19baf832005-06-21 12:43:18 -07001271{
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001272 struct trie *t = (struct trie *) tb->tb_data;
Alexander Duyck8274a972014-12-31 10:55:29 -08001273#ifdef CONFIG_IP_FIB_TRIE_STATS
1274 struct trie_use_stats __percpu *stats = t->stats;
1275#endif
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001276 const t_key key = ntohl(flp->daddr);
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001277 struct key_vector *n, *pn;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001278 struct fib_alias *fa;
Alexander Duyck71e8b672015-03-04 15:04:03 -08001279 unsigned long index;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001280 t_key cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001281
David Ahernf6d3c192015-08-28 08:42:09 -07001282 trace_fib_table_lookup(tb->tb_id, flp);
1283
Alexander Duyck88bae712015-03-06 09:54:52 -08001284 pn = t->kv;
1285 cindex = 0;
1286
1287 n = get_child_rcu(pn, cindex);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001288 if (!n)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001289 return -EAGAIN;
Robert Olsson19baf832005-06-21 12:43:18 -07001290
1291#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08001292 this_cpu_inc(stats->gets);
Robert Olsson19baf832005-06-21 12:43:18 -07001293#endif
1294
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001295 /* Step 1: Travel to the longest prefix match in the trie */
1296 for (;;) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001297 index = get_cindex(key, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001298
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001299 /* This bit of code is a bit tricky but it combines multiple
1300 * checks into a single check. The prefix consists of the
1301 * prefix plus zeros for the "bits" in the prefix. The index
1302 * is the difference between the key and this value. From
1303 * this we can actually derive several pieces of data.
Alexander Duyck71e8b672015-03-04 15:04:03 -08001304 * if (index >= (1ul << bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001305 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -08001306 * else
1307 * we know the value is cindex
Alexander Duyck71e8b672015-03-04 15:04:03 -08001308 *
1309 * This check is safe even if bits == KEYLENGTH due to the
1310 * fact that we can only allocate a node with 32 bits if a
1311 * long is greater than 32 bits.
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001312 */
Alexander Duyck71e8b672015-03-04 15:04:03 -08001313 if (index >= (1ul << n->bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001314 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001315
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001316 /* we have found a leaf. Prefixes have already been compared */
1317 if (IS_LEAF(n))
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001318 goto found;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001319
1320 /* only record pn and cindex if we are going to be chopping
1321 * bits later. Otherwise we are just wasting cycles.
1322 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001323 if (n->slen > n->pos) {
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001324 pn = n;
1325 cindex = index;
Olof Johansson91b9a272005-08-09 20:24:39 -07001326 }
1327
Alexander Duyck754baf82015-03-06 09:54:14 -08001328 n = get_child_rcu(n, index);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001329 if (unlikely(!n))
Robert Olsson19baf832005-06-21 12:43:18 -07001330 goto backtrace;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001331 }
1332
1333 /* Step 2: Sort out leaves and begin backtracing for longest prefix */
1334 for (;;) {
1335 /* record the pointer where our next node pointer is stored */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001336 struct key_vector __rcu **cptr = n->tnode;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001337
1338 /* This test verifies that none of the bits that differ
1339 * between the key and the prefix exist in the region of
1340 * the lsb and higher in the prefix.
1341 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001342 if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001343 goto backtrace;
1344
1345 /* exit out and process leaf */
1346 if (unlikely(IS_LEAF(n)))
1347 break;
1348
1349 /* Don't bother recording parent info. Since we are in
1350 * prefix match mode we will have to come back to wherever
1351 * we started this traversal anyway
1352 */
1353
1354 while ((n = rcu_dereference(*cptr)) == NULL) {
1355backtrace:
1356#ifdef CONFIG_IP_FIB_TRIE_STATS
1357 if (!n)
1358 this_cpu_inc(stats->null_node_hit);
1359#endif
1360 /* If we are at cindex 0 there are no more bits for
1361 * us to strip at this level so we must ascend back
1362 * up one level to see if there are any more bits to
1363 * be stripped there.
1364 */
1365 while (!cindex) {
1366 t_key pkey = pn->key;
1367
Alexander Duyck88bae712015-03-06 09:54:52 -08001368 /* If we don't have a parent then there is
1369 * nothing for us to do as we do not have any
1370 * further nodes to parse.
1371 */
1372 if (IS_TRIE(pn))
Alexander Duyck345e9b52014-12-31 10:56:24 -08001373 return -EAGAIN;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001374#ifdef CONFIG_IP_FIB_TRIE_STATS
1375 this_cpu_inc(stats->backtrack);
1376#endif
1377 /* Get Child's index */
Alexander Duyck88bae712015-03-06 09:54:52 -08001378 pn = node_parent_rcu(pn);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001379 cindex = get_index(pkey, pn);
1380 }
1381
1382 /* strip the least significant bit from the cindex */
1383 cindex &= cindex - 1;
1384
1385 /* grab pointer for next child node */
Alexander Duyck41b489f2015-03-04 15:02:33 -08001386 cptr = &pn->tnode[cindex];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001387 }
Robert Olsson19baf832005-06-21 12:43:18 -07001388 }
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001389
Robert Olsson19baf832005-06-21 12:43:18 -07001390found:
Alexander Duyck71e8b672015-03-04 15:04:03 -08001391 /* this line carries forward the xor from earlier in the function */
1392 index = key ^ n->key;
1393
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001394 /* Step 3: Process the leaf, if that fails fall back to backtracing */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001395 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
1396 struct fib_info *fi = fa->fa_info;
1397 int nhsel, err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001398
Alexander Duyck71e8b672015-03-04 15:04:03 -08001399 if ((index >= (1ul << fa->fa_slen)) &&
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001400 ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen != KEYLENGTH)))
Alexander Duyck71e8b672015-03-04 15:04:03 -08001401 continue;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001402 if (fa->fa_tos && fa->fa_tos != flp->flowi4_tos)
1403 continue;
1404 if (fi->fib_dead)
1405 continue;
1406 if (fa->fa_info->fib_scope < flp->flowi4_scope)
1407 continue;
1408 fib_alias_accessed(fa);
1409 err = fib_props[fa->fa_type].error;
1410 if (unlikely(err < 0)) {
Alexander Duyck345e9b52014-12-31 10:56:24 -08001411#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001412 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001413#endif
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001414 return err;
1415 }
1416 if (fi->fib_flags & RTNH_F_DEAD)
1417 continue;
1418 for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) {
1419 const struct fib_nh *nh = &fi->fib_nh[nhsel];
Andy Gospodarek0eeb0752015-06-23 13:45:37 -04001420 struct in_device *in_dev = __in_dev_get_rcu(nh->nh_dev);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001421
1422 if (nh->nh_flags & RTNH_F_DEAD)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001423 continue;
Andy Gospodarek0eeb0752015-06-23 13:45:37 -04001424 if (in_dev &&
1425 IN_DEV_IGNORE_ROUTES_WITH_LINKDOWN(in_dev) &&
1426 nh->nh_flags & RTNH_F_LINKDOWN &&
1427 !(fib_flags & FIB_LOOKUP_IGNORE_LINKSTATE))
1428 continue;
David Ahern58189ca2015-09-15 15:10:50 -07001429 if (!(flp->flowi4_flags & FLOWI_FLAG_SKIP_NH_OIF)) {
David Ahern613d09b2015-08-13 14:59:02 -06001430 if (flp->flowi4_oif &&
1431 flp->flowi4_oif != nh->nh_oif)
1432 continue;
1433 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001434
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001435 if (!(fib_flags & FIB_LOOKUP_NOREF))
1436 atomic_inc(&fi->fib_clntref);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001437
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001438 res->prefixlen = KEYLENGTH - fa->fa_slen;
1439 res->nh_sel = nhsel;
1440 res->type = fa->fa_type;
1441 res->scope = fi->fib_scope;
1442 res->fi = fi;
1443 res->table = tb;
1444 res->fa_head = &n->leaf;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001445#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001446 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001447#endif
David Ahernf6d3c192015-08-28 08:42:09 -07001448 trace_fib_table_lookup_nh(nh);
1449
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001450 return err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001451 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001452 }
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001453#ifdef CONFIG_IP_FIB_TRIE_STATS
1454 this_cpu_inc(stats->semantic_match_miss);
1455#endif
Alexander Duyck345e9b52014-12-31 10:56:24 -08001456 goto backtrace;
Robert Olsson19baf832005-06-21 12:43:18 -07001457}
Florian Westphal6fc01432011-08-25 13:46:12 +02001458EXPORT_SYMBOL_GPL(fib_table_lookup);
Robert Olsson19baf832005-06-21 12:43:18 -07001459
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001460static void fib_remove_alias(struct trie *t, struct key_vector *tp,
1461 struct key_vector *l, struct fib_alias *old)
Alexander Duyckd5d64872015-03-04 15:02:18 -08001462{
1463 /* record the location of the previous list_info entry */
1464 struct hlist_node **pprev = old->fa_list.pprev;
1465 struct fib_alias *fa = hlist_entry(pprev, typeof(*fa), fa_list.next);
1466
1467 /* remove the fib_alias from the list */
1468 hlist_del_rcu(&old->fa_list);
1469
1470 /* if we emptied the list this leaf will be freed and we can sort
1471 * out parent suffix lengths as a part of trie_rebalance
1472 */
1473 if (hlist_empty(&l->leaf)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001474 put_child_root(tp, l->key, NULL);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001475 node_free(l);
1476 trie_rebalance(t, tp);
1477 return;
1478 }
1479
1480 /* only access fa if it is pointing at the last valid hlist_node */
1481 if (*pprev)
1482 return;
1483
1484 /* update the trie with the latest suffix length */
1485 l->slen = fa->fa_slen;
1486 leaf_pull_suffix(tp, l);
1487}
1488
1489/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001490int fib_table_delete(struct fib_table *tb, struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001491{
1492 struct trie *t = (struct trie *) tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001493 struct fib_alias *fa, *fa_to_delete;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001494 struct key_vector *l, *tp;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001495 u8 plen = cfg->fc_dst_len;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001496 u8 slen = KEYLENGTH - plen;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001497 u8 tos = cfg->fc_tos;
1498 u32 key;
Olof Johansson91b9a272005-08-09 20:24:39 -07001499
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001500 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001501 return -EINVAL;
1502
Thomas Graf4e902c52006-08-17 18:14:52 -07001503 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001504
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001505 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001506 return -EINVAL;
1507
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001508 l = fib_find_node(t, &tp, key);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001509 if (!l)
Robert Olsson19baf832005-06-21 12:43:18 -07001510 return -ESRCH;
1511
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001512 fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id);
Robert Olsson19baf832005-06-21 12:43:18 -07001513 if (!fa)
1514 return -ESRCH;
1515
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001516 pr_debug("Deleting %08x/%d tos=%d t=%p\n", key, plen, tos, t);
Robert Olsson19baf832005-06-21 12:43:18 -07001517
1518 fa_to_delete = NULL;
Alexander Duyck56315f92015-02-25 15:31:31 -08001519 hlist_for_each_entry_from(fa, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001520 struct fib_info *fi = fa->fa_info;
1521
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001522 if ((fa->fa_slen != slen) ||
1523 (fa->tb_id != tb->tb_id) ||
1524 (fa->fa_tos != tos))
Robert Olsson19baf832005-06-21 12:43:18 -07001525 break;
1526
Thomas Graf4e902c52006-08-17 18:14:52 -07001527 if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) &&
1528 (cfg->fc_scope == RT_SCOPE_NOWHERE ||
David S. Miller37e826c2011-03-24 18:06:47 -07001529 fa->fa_info->fib_scope == cfg->fc_scope) &&
Julian Anastasov74cb3c12011-03-19 12:13:46 +00001530 (!cfg->fc_prefsrc ||
1531 fi->fib_prefsrc == cfg->fc_prefsrc) &&
Thomas Graf4e902c52006-08-17 18:14:52 -07001532 (!cfg->fc_protocol ||
1533 fi->fib_protocol == cfg->fc_protocol) &&
1534 fib_nh_match(cfg, fi) == 0) {
Robert Olsson19baf832005-06-21 12:43:18 -07001535 fa_to_delete = fa;
1536 break;
1537 }
1538 }
1539
Olof Johansson91b9a272005-08-09 20:24:39 -07001540 if (!fa_to_delete)
1541 return -ESRCH;
Robert Olsson19baf832005-06-21 12:43:18 -07001542
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001543 switchdev_fib_ipv4_del(key, plen, fa_to_delete->fa_info, tos,
1544 cfg->fc_type, tb->tb_id);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001545
Alexander Duyckd5d64872015-03-04 15:02:18 -08001546 rtmsg_fib(RTM_DELROUTE, htonl(key), fa_to_delete, plen, tb->tb_id,
Milan Kocianb8f55832007-05-23 14:55:06 -07001547 &cfg->fc_nlinfo, 0);
Robert Olsson19baf832005-06-21 12:43:18 -07001548
David S. Miller21d8c492011-04-14 14:49:37 -07001549 if (!plen)
1550 tb->tb_num_default--;
1551
Alexander Duyckd5d64872015-03-04 15:02:18 -08001552 fib_remove_alias(t, tp, l, fa_to_delete);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001553
Alexander Duyckd5d64872015-03-04 15:02:18 -08001554 if (fa_to_delete->fa_state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001555 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Olof Johansson91b9a272005-08-09 20:24:39 -07001556
Alexander Duyckd5d64872015-03-04 15:02:18 -08001557 fib_release_info(fa_to_delete->fa_info);
1558 alias_free_mem_rcu(fa_to_delete);
Olof Johansson91b9a272005-08-09 20:24:39 -07001559 return 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001560}
1561
Alexander Duyck8be33e92015-03-04 14:59:19 -08001562/* Scan for the next leaf starting at the provided key value */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001563static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -07001564{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001565 struct key_vector *pn, *n = *tn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001566 unsigned long cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001567
Alexander Duyck8be33e92015-03-04 14:59:19 -08001568 /* this loop is meant to try and find the key in the trie */
Alexander Duyck88bae712015-03-06 09:54:52 -08001569 do {
1570 /* record parent and next child index */
1571 pn = n;
Alexander Duyckc2229fe2015-10-27 15:06:45 -07001572 cindex = (key > pn->key) ? get_index(key, pn) : 0;
Alexander Duyck88bae712015-03-06 09:54:52 -08001573
1574 if (cindex >> pn->bits)
1575 break;
1576
1577 /* descend into the next child */
1578 n = get_child_rcu(pn, cindex++);
1579 if (!n)
1580 break;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001581
Alexander Duyck8be33e92015-03-04 14:59:19 -08001582 /* guarantee forward progress on the keys */
1583 if (IS_LEAF(n) && (n->key >= key))
1584 goto found;
Alexander Duyck88bae712015-03-06 09:54:52 -08001585 } while (IS_TNODE(n));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001586
1587 /* this loop will search for the next leaf with a greater key */
Alexander Duyck88bae712015-03-06 09:54:52 -08001588 while (!IS_TRIE(pn)) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001589 /* if we exhausted the parent node we will need to climb */
1590 if (cindex >= (1ul << pn->bits)) {
1591 t_key pkey = pn->key;
1592
1593 pn = node_parent_rcu(pn);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001594 cindex = get_index(pkey, pn) + 1;
1595 continue;
Robert Olsson19baf832005-06-21 12:43:18 -07001596 }
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001597
Alexander Duyck8be33e92015-03-04 14:59:19 -08001598 /* grab the next available node */
Alexander Duyck754baf82015-03-06 09:54:14 -08001599 n = get_child_rcu(pn, cindex++);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001600 if (!n)
1601 continue;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001602
Alexander Duyck8be33e92015-03-04 14:59:19 -08001603 /* no need to compare keys since we bumped the index */
1604 if (IS_LEAF(n))
1605 goto found;
1606
1607 /* Rescan start scanning in new node */
1608 pn = n;
1609 cindex = 0;
1610 }
1611
1612 *tn = pn;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001613 return NULL; /* Root of trie */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001614found:
1615 /* if we are at the limit for keys just return NULL for the tnode */
Alexander Duyck88bae712015-03-06 09:54:52 -08001616 *tn = pn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001617 return n;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001618}
1619
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001620static void fib_trie_free(struct fib_table *tb)
1621{
1622 struct trie *t = (struct trie *)tb->tb_data;
1623 struct key_vector *pn = t->kv;
1624 unsigned long cindex = 1;
1625 struct hlist_node *tmp;
1626 struct fib_alias *fa;
1627
1628 /* walk trie in reverse order and free everything */
1629 for (;;) {
1630 struct key_vector *n;
1631
1632 if (!(cindex--)) {
1633 t_key pkey = pn->key;
1634
1635 if (IS_TRIE(pn))
1636 break;
1637
1638 n = pn;
1639 pn = node_parent(pn);
1640
1641 /* drop emptied tnode */
1642 put_child_root(pn, n->key, NULL);
1643 node_free(n);
1644
1645 cindex = get_index(pkey, pn);
1646
1647 continue;
1648 }
1649
1650 /* grab the next available node */
1651 n = get_child(pn, cindex);
1652 if (!n)
1653 continue;
1654
1655 if (IS_TNODE(n)) {
1656 /* record pn and cindex for leaf walking */
1657 pn = n;
1658 cindex = 1ul << n->bits;
1659
1660 continue;
1661 }
1662
1663 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1664 hlist_del_rcu(&fa->fa_list);
1665 alias_free_mem_rcu(fa);
1666 }
1667
1668 put_child_root(pn, n->key, NULL);
1669 node_free(n);
1670 }
1671
1672#ifdef CONFIG_IP_FIB_TRIE_STATS
1673 free_percpu(t->stats);
1674#endif
1675 kfree(tb);
1676}
1677
1678struct fib_table *fib_trie_unmerge(struct fib_table *oldtb)
1679{
1680 struct trie *ot = (struct trie *)oldtb->tb_data;
1681 struct key_vector *l, *tp = ot->kv;
1682 struct fib_table *local_tb;
1683 struct fib_alias *fa;
1684 struct trie *lt;
1685 t_key key = 0;
1686
1687 if (oldtb->tb_data == oldtb->__data)
1688 return oldtb;
1689
1690 local_tb = fib_trie_table(RT_TABLE_LOCAL, NULL);
1691 if (!local_tb)
1692 return NULL;
1693
1694 lt = (struct trie *)local_tb->tb_data;
1695
1696 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
1697 struct key_vector *local_l = NULL, *local_tp;
1698
1699 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
1700 struct fib_alias *new_fa;
1701
1702 if (local_tb->tb_id != fa->tb_id)
1703 continue;
1704
1705 /* clone fa for new local table */
1706 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
1707 if (!new_fa)
1708 goto out;
1709
1710 memcpy(new_fa, fa, sizeof(*fa));
1711
1712 /* insert clone into table */
1713 if (!local_l)
1714 local_l = fib_find_node(lt, &local_tp, l->key);
1715
1716 if (fib_insert_alias(lt, local_tp, local_l, new_fa,
1717 NULL, l->key))
1718 goto out;
1719 }
1720
1721 /* stop loop if key wrapped back to 0 */
1722 key = l->key + 1;
1723 if (key < l->key)
1724 break;
1725 }
1726
1727 return local_tb;
1728out:
1729 fib_trie_free(local_tb);
1730
1731 return NULL;
1732}
1733
Scott Feldman104616e2015-03-05 21:21:16 -08001734/* Caller must hold RTNL */
1735void fib_table_flush_external(struct fib_table *tb)
1736{
1737 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001738 struct key_vector *pn = t->kv;
1739 unsigned long cindex = 1;
1740 struct hlist_node *tmp;
Scott Feldman104616e2015-03-05 21:21:16 -08001741 struct fib_alias *fa;
Scott Feldman104616e2015-03-05 21:21:16 -08001742
Alexander Duyck88bae712015-03-06 09:54:52 -08001743 /* walk trie in reverse order */
1744 for (;;) {
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001745 unsigned char slen = 0;
Alexander Duyck88bae712015-03-06 09:54:52 -08001746 struct key_vector *n;
Scott Feldman104616e2015-03-05 21:21:16 -08001747
Alexander Duyck88bae712015-03-06 09:54:52 -08001748 if (!(cindex--)) {
1749 t_key pkey = pn->key;
Scott Feldman104616e2015-03-05 21:21:16 -08001750
Alexander Duyck88bae712015-03-06 09:54:52 -08001751 /* cannot resize the trie vector */
1752 if (IS_TRIE(pn))
1753 break;
Scott Feldman104616e2015-03-05 21:21:16 -08001754
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001755 /* resize completed node */
1756 pn = resize(t, pn);
Alexander Duyck88bae712015-03-06 09:54:52 -08001757 cindex = get_index(pkey, pn);
Scott Feldman104616e2015-03-05 21:21:16 -08001758
Alexander Duyck88bae712015-03-06 09:54:52 -08001759 continue;
1760 }
Scott Feldman104616e2015-03-05 21:21:16 -08001761
Alexander Duyck88bae712015-03-06 09:54:52 -08001762 /* grab the next available node */
1763 n = get_child(pn, cindex);
1764 if (!n)
Alexander Duyck72be7262015-03-06 09:53:56 -08001765 continue;
1766
Alexander Duyck88bae712015-03-06 09:54:52 -08001767 if (IS_TNODE(n)) {
1768 /* record pn and cindex for leaf walking */
1769 pn = n;
1770 cindex = 1ul << n->bits;
Scott Feldman104616e2015-03-05 21:21:16 -08001771
Alexander Duyck88bae712015-03-06 09:54:52 -08001772 continue;
1773 }
1774
1775 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1776 struct fib_info *fi = fa->fa_info;
1777
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001778 /* if alias was cloned to local then we just
1779 * need to remove the local copy from main
1780 */
1781 if (tb->tb_id != fa->tb_id) {
1782 hlist_del_rcu(&fa->fa_list);
1783 alias_free_mem_rcu(fa);
1784 continue;
1785 }
1786
1787 /* record local slen */
1788 slen = fa->fa_slen;
1789
Roopa Prabhueea39942015-05-13 21:17:41 -07001790 if (!fi || !(fi->fib_flags & RTNH_F_OFFLOAD))
Alexander Duyck88bae712015-03-06 09:54:52 -08001791 continue;
1792
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001793 switchdev_fib_ipv4_del(n->key, KEYLENGTH - fa->fa_slen,
1794 fi, fa->fa_tos, fa->fa_type,
1795 tb->tb_id);
Alexander Duyck88bae712015-03-06 09:54:52 -08001796 }
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001797
1798 /* update leaf slen */
1799 n->slen = slen;
1800
1801 if (hlist_empty(&n->leaf)) {
1802 put_child_root(pn, n->key, NULL);
1803 node_free(n);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001804 }
Alexander Duyck88bae712015-03-06 09:54:52 -08001805 }
Scott Feldman104616e2015-03-05 21:21:16 -08001806}
1807
Alexander Duyck8be33e92015-03-04 14:59:19 -08001808/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001809int fib_table_flush(struct fib_table *tb)
Robert Olsson19baf832005-06-21 12:43:18 -07001810{
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001811 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001812 struct key_vector *pn = t->kv;
1813 unsigned long cindex = 1;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001814 struct hlist_node *tmp;
1815 struct fib_alias *fa;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001816 int found = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001817
Alexander Duyck88bae712015-03-06 09:54:52 -08001818 /* walk trie in reverse order */
1819 for (;;) {
1820 unsigned char slen = 0;
1821 struct key_vector *n;
Robert Olsson19baf832005-06-21 12:43:18 -07001822
Alexander Duyck88bae712015-03-06 09:54:52 -08001823 if (!(cindex--)) {
1824 t_key pkey = pn->key;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001825
Alexander Duyck88bae712015-03-06 09:54:52 -08001826 /* cannot resize the trie vector */
1827 if (IS_TRIE(pn))
1828 break;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001829
Alexander Duyck88bae712015-03-06 09:54:52 -08001830 /* resize completed node */
1831 pn = resize(t, pn);
1832 cindex = get_index(pkey, pn);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001833
Alexander Duyck88bae712015-03-06 09:54:52 -08001834 continue;
1835 }
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001836
Alexander Duyck88bae712015-03-06 09:54:52 -08001837 /* grab the next available node */
1838 n = get_child(pn, cindex);
1839 if (!n)
1840 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001841
Alexander Duyck88bae712015-03-06 09:54:52 -08001842 if (IS_TNODE(n)) {
1843 /* record pn and cindex for leaf walking */
1844 pn = n;
1845 cindex = 1ul << n->bits;
1846
1847 continue;
1848 }
1849
1850 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1851 struct fib_info *fi = fa->fa_info;
1852
1853 if (!fi || !(fi->fib_flags & RTNH_F_DEAD)) {
1854 slen = fa->fa_slen;
1855 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001856 }
1857
Jiri Pirkoebb9a032015-05-10 09:47:46 -07001858 switchdev_fib_ipv4_del(n->key, KEYLENGTH - fa->fa_slen,
1859 fi, fa->fa_tos, fa->fa_type,
1860 tb->tb_id);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001861 hlist_del_rcu(&fa->fa_list);
1862 fib_release_info(fa->fa_info);
1863 alias_free_mem_rcu(fa);
1864 found++;
Alexander Duyck64c62722015-01-22 15:51:45 -08001865 }
1866
Alexander Duyck88bae712015-03-06 09:54:52 -08001867 /* update leaf slen */
1868 n->slen = slen;
1869
1870 if (hlist_empty(&n->leaf)) {
1871 put_child_root(pn, n->key, NULL);
1872 node_free(n);
Alexander Duyck88bae712015-03-06 09:54:52 -08001873 }
Robert Olsson19baf832005-06-21 12:43:18 -07001874 }
1875
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001876 pr_debug("trie_flush found=%d\n", found);
Robert Olsson19baf832005-06-21 12:43:18 -07001877 return found;
1878}
1879
Alexander Duycka7e53532015-03-04 15:02:44 -08001880static void __trie_free_rcu(struct rcu_head *head)
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001881{
Alexander Duycka7e53532015-03-04 15:02:44 -08001882 struct fib_table *tb = container_of(head, struct fib_table, rcu);
Alexander Duyck8274a972014-12-31 10:55:29 -08001883#ifdef CONFIG_IP_FIB_TRIE_STATS
1884 struct trie *t = (struct trie *)tb->tb_data;
1885
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001886 if (tb->tb_data == tb->__data)
1887 free_percpu(t->stats);
Alexander Duyck8274a972014-12-31 10:55:29 -08001888#endif /* CONFIG_IP_FIB_TRIE_STATS */
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001889 kfree(tb);
1890}
1891
Alexander Duycka7e53532015-03-04 15:02:44 -08001892void fib_free_table(struct fib_table *tb)
1893{
1894 call_rcu(&tb->rcu, __trie_free_rcu);
1895}
1896
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001897static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001898 struct sk_buff *skb, struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001899{
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001900 __be32 xkey = htonl(l->key);
Robert Olsson19baf832005-06-21 12:43:18 -07001901 struct fib_alias *fa;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001902 int i, s_i;
Robert Olsson19baf832005-06-21 12:43:18 -07001903
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001904 s_i = cb->args[4];
Robert Olsson19baf832005-06-21 12:43:18 -07001905 i = 0;
1906
Robert Olsson2373ce12005-08-25 13:01:29 -07001907 /* rcu_read_lock is hold by caller */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001908 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001909 if (i < s_i) {
1910 i++;
1911 continue;
1912 }
Robert Olsson19baf832005-06-21 12:43:18 -07001913
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001914 if (tb->tb_id != fa->tb_id) {
1915 i++;
1916 continue;
1917 }
1918
Eric W. Biederman15e47302012-09-07 20:12:54 +00001919 if (fib_dump_info(skb, NETLINK_CB(cb->skb).portid,
Robert Olsson19baf832005-06-21 12:43:18 -07001920 cb->nlh->nlmsg_seq,
1921 RTM_NEWROUTE,
1922 tb->tb_id,
1923 fa->fa_type,
Thomas Grafbe403ea2006-08-17 18:15:17 -07001924 xkey,
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001925 KEYLENGTH - fa->fa_slen,
Robert Olsson19baf832005-06-21 12:43:18 -07001926 fa->fa_tos,
Stephen Hemminger64347f72008-01-22 21:55:01 -08001927 fa->fa_info, NLM_F_MULTI) < 0) {
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001928 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001929 return -1;
1930 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001931 i++;
Robert Olsson19baf832005-06-21 12:43:18 -07001932 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001933
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001934 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001935 return skb->len;
1936}
1937
Alexander Duycka7e53532015-03-04 15:02:44 -08001938/* rcu_read_lock needs to be hold by caller from readside */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001939int fib_table_dump(struct fib_table *tb, struct sk_buff *skb,
1940 struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001941{
Alexander Duyck8be33e92015-03-04 14:59:19 -08001942 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001943 struct key_vector *l, *tp = t->kv;
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001944 /* Dump starting at last key.
1945 * Note: 0.0.0.0/0 (ie default) is first key.
1946 */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001947 int count = cb->args[2];
1948 t_key key = cb->args[3];
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001949
Alexander Duyck8be33e92015-03-04 14:59:19 -08001950 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001951 if (fn_trie_dump_leaf(l, tb, skb, cb) < 0) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001952 cb->args[3] = key;
1953 cb->args[2] = count;
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001954 return -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001955 }
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001956
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001957 ++count;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001958 key = l->key + 1;
1959
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001960 memset(&cb->args[4], 0,
1961 sizeof(cb->args) - 4*sizeof(cb->args[0]));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001962
1963 /* stop loop if key wrapped back to 0 */
1964 if (key < l->key)
1965 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001966 }
Alexander Duyck8be33e92015-03-04 14:59:19 -08001967
Alexander Duyck8be33e92015-03-04 14:59:19 -08001968 cb->args[3] = key;
1969 cb->args[2] = count;
1970
Robert Olsson19baf832005-06-21 12:43:18 -07001971 return skb->len;
Robert Olsson19baf832005-06-21 12:43:18 -07001972}
1973
David S. Miller5348ba82011-02-01 15:30:56 -08001974void __init fib_trie_init(void)
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001975{
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001976 fn_alias_kmem = kmem_cache_create("ip_fib_alias",
1977 sizeof(struct fib_alias),
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08001978 0, SLAB_PANIC, NULL);
1979
1980 trie_leaf_kmem = kmem_cache_create("ip_fib_trie",
Alexander Duyck41b489f2015-03-04 15:02:33 -08001981 LEAF_SIZE,
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08001982 0, SLAB_PANIC, NULL);
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001983}
Robert Olsson19baf832005-06-21 12:43:18 -07001984
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001985struct fib_table *fib_trie_table(u32 id, struct fib_table *alias)
Robert Olsson19baf832005-06-21 12:43:18 -07001986{
1987 struct fib_table *tb;
1988 struct trie *t;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001989 size_t sz = sizeof(*tb);
Robert Olsson19baf832005-06-21 12:43:18 -07001990
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001991 if (!alias)
1992 sz += sizeof(struct trie);
1993
1994 tb = kzalloc(sz, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001995 if (!tb)
Robert Olsson19baf832005-06-21 12:43:18 -07001996 return NULL;
1997
1998 tb->tb_id = id;
David S. Miller21d8c492011-04-14 14:49:37 -07001999 tb->tb_num_default = 0;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002000 tb->tb_data = (alias ? alias->__data : tb->__data);
2001
2002 if (alias)
2003 return tb;
Robert Olsson19baf832005-06-21 12:43:18 -07002004
2005 t = (struct trie *) tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002006 t->kv[0].pos = KEYLENGTH;
2007 t->kv[0].slen = KEYLENGTH;
Alexander Duyck8274a972014-12-31 10:55:29 -08002008#ifdef CONFIG_IP_FIB_TRIE_STATS
2009 t->stats = alloc_percpu(struct trie_use_stats);
2010 if (!t->stats) {
2011 kfree(tb);
2012 tb = NULL;
2013 }
2014#endif
Robert Olsson19baf832005-06-21 12:43:18 -07002015
Robert Olsson19baf832005-06-21 12:43:18 -07002016 return tb;
2017}
2018
Robert Olsson19baf832005-06-21 12:43:18 -07002019#ifdef CONFIG_PROC_FS
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002020/* Depth first Trie walk iterator */
2021struct fib_trie_iter {
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002022 struct seq_net_private p;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002023 struct fib_table *tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002024 struct key_vector *tnode;
Eric Dumazeta034ee32010-09-09 23:32:28 +00002025 unsigned int index;
2026 unsigned int depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002027};
Robert Olsson19baf832005-06-21 12:43:18 -07002028
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002029static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)
Robert Olsson19baf832005-06-21 12:43:18 -07002030{
Alexander Duyck98293e82014-12-31 10:56:18 -08002031 unsigned long cindex = iter->index;
Alexander Duyck88bae712015-03-06 09:54:52 -08002032 struct key_vector *pn = iter->tnode;
2033 t_key pkey;
Eric W. Biederman6640e692007-01-24 14:42:04 -08002034
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002035 pr_debug("get_next iter={node=%p index=%d depth=%d}\n",
2036 iter->tnode, iter->index, iter->depth);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002037
Alexander Duyck88bae712015-03-06 09:54:52 -08002038 while (!IS_TRIE(pn)) {
2039 while (cindex < child_length(pn)) {
2040 struct key_vector *n = get_child_rcu(pn, cindex++);
2041
2042 if (!n)
2043 continue;
2044
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002045 if (IS_LEAF(n)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08002046 iter->tnode = pn;
2047 iter->index = cindex;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002048 } else {
2049 /* push down one level */
Alexander Duyckadaf9812014-12-31 10:55:47 -08002050 iter->tnode = n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002051 iter->index = 0;
2052 ++iter->depth;
2053 }
Alexander Duyck88bae712015-03-06 09:54:52 -08002054
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002055 return n;
2056 }
2057
Alexander Duyck88bae712015-03-06 09:54:52 -08002058 /* Current node exhausted, pop back up */
2059 pkey = pn->key;
2060 pn = node_parent_rcu(pn);
2061 cindex = get_index(pkey, pn) + 1;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002062 --iter->depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002063 }
2064
Alexander Duyck88bae712015-03-06 09:54:52 -08002065 /* record root node so further searches know we are done */
2066 iter->tnode = pn;
2067 iter->index = 0;
2068
Robert Olsson19baf832005-06-21 12:43:18 -07002069 return NULL;
2070}
2071
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002072static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,
2073 struct trie *t)
Robert Olsson19baf832005-06-21 12:43:18 -07002074{
Firo Yangf38b24c2015-06-08 11:54:51 +08002075 struct key_vector *n, *pn;
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002076
Stephen Hemminger132adf52007-03-08 20:44:43 -08002077 if (!t)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002078 return NULL;
2079
Firo Yangf38b24c2015-06-08 11:54:51 +08002080 pn = t->kv;
Alexander Duyck88bae712015-03-06 09:54:52 -08002081 n = rcu_dereference(pn->tnode[0]);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002082 if (!n)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002083 return NULL;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002084
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002085 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002086 iter->tnode = n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002087 iter->index = 0;
2088 iter->depth = 1;
2089 } else {
Alexander Duyck88bae712015-03-06 09:54:52 -08002090 iter->tnode = pn;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002091 iter->index = 0;
2092 iter->depth = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002093 }
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002094
2095 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002096}
2097
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002098static void trie_collect_stats(struct trie *t, struct trie_stat *s)
Robert Olsson19baf832005-06-21 12:43:18 -07002099{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002100 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002101 struct fib_trie_iter iter;
Robert Olsson19baf832005-06-21 12:43:18 -07002102
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002103 memset(s, 0, sizeof(*s));
Robert Olsson19baf832005-06-21 12:43:18 -07002104
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002105 rcu_read_lock();
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002106 for (n = fib_trie_get_first(&iter, t); n; n = fib_trie_get_next(&iter)) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002107 if (IS_LEAF(n)) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002108 struct fib_alias *fa;
Stephen Hemminger93672292008-01-22 21:54:05 -08002109
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002110 s->leaves++;
2111 s->totdepth += iter.depth;
2112 if (iter.depth > s->maxdepth)
2113 s->maxdepth = iter.depth;
Stephen Hemminger93672292008-01-22 21:54:05 -08002114
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002115 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list)
Stephen Hemminger93672292008-01-22 21:54:05 -08002116 ++s->prefixes;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002117 } else {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002118 s->tnodes++;
Alexander Duyckadaf9812014-12-31 10:55:47 -08002119 if (n->bits < MAX_STAT_DEPTH)
2120 s->nodesizes[n->bits]++;
Alexander Duyck6e22d172015-03-06 09:54:39 -08002121 s->nullpointers += tn_info(n)->empty_children;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002122 }
2123 }
2124 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002125}
2126
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002127/*
Robert Olsson19baf832005-06-21 12:43:18 -07002128 * This outputs /proc/net/fib_triestats
Robert Olsson19baf832005-06-21 12:43:18 -07002129 */
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002130static void trie_show_stats(struct seq_file *seq, struct trie_stat *stat)
Robert Olsson19baf832005-06-21 12:43:18 -07002131{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002132 unsigned int i, max, pointers, bytes, avdepth;
Robert Olsson19baf832005-06-21 12:43:18 -07002133
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002134 if (stat->leaves)
2135 avdepth = stat->totdepth*100 / stat->leaves;
2136 else
2137 avdepth = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07002138
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002139 seq_printf(seq, "\tAver depth: %u.%02d\n",
2140 avdepth / 100, avdepth % 100);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002141 seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth);
Robert Olsson19baf832005-06-21 12:43:18 -07002142
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002143 seq_printf(seq, "\tLeaves: %u\n", stat->leaves);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002144 bytes = LEAF_SIZE * stat->leaves;
Stephen Hemminger93672292008-01-22 21:54:05 -08002145
2146 seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002147 bytes += sizeof(struct fib_alias) * stat->prefixes;
Stephen Hemminger93672292008-01-22 21:54:05 -08002148
Stephen Hemminger187b5182008-01-12 20:55:55 -08002149 seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002150 bytes += TNODE_SIZE(0) * stat->tnodes;
Robert Olsson19baf832005-06-21 12:43:18 -07002151
Robert Olsson06ef9212006-03-20 21:35:01 -08002152 max = MAX_STAT_DEPTH;
2153 while (max > 0 && stat->nodesizes[max-1] == 0)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002154 max--;
Robert Olsson19baf832005-06-21 12:43:18 -07002155
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002156 pointers = 0;
Jerry Snitselaarf585a992013-07-22 12:01:58 -07002157 for (i = 1; i < max; i++)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002158 if (stat->nodesizes[i] != 0) {
Stephen Hemminger187b5182008-01-12 20:55:55 -08002159 seq_printf(seq, " %u: %u", i, stat->nodesizes[i]);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002160 pointers += (1<<i) * stat->nodesizes[i];
2161 }
2162 seq_putc(seq, '\n');
Stephen Hemminger187b5182008-01-12 20:55:55 -08002163 seq_printf(seq, "\tPointers: %u\n", pointers);
Robert Olsson19baf832005-06-21 12:43:18 -07002164
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002165 bytes += sizeof(struct key_vector *) * pointers;
Stephen Hemminger187b5182008-01-12 20:55:55 -08002166 seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers);
2167 seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024);
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002168}
Robert Olsson19baf832005-06-21 12:43:18 -07002169
2170#ifdef CONFIG_IP_FIB_TRIE_STATS
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002171static void trie_show_usage(struct seq_file *seq,
Alexander Duyck8274a972014-12-31 10:55:29 -08002172 const struct trie_use_stats __percpu *stats)
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002173{
Alexander Duyck8274a972014-12-31 10:55:29 -08002174 struct trie_use_stats s = { 0 };
2175 int cpu;
2176
2177 /* loop through all of the CPUs and gather up the stats */
2178 for_each_possible_cpu(cpu) {
2179 const struct trie_use_stats *pcpu = per_cpu_ptr(stats, cpu);
2180
2181 s.gets += pcpu->gets;
2182 s.backtrack += pcpu->backtrack;
2183 s.semantic_match_passed += pcpu->semantic_match_passed;
2184 s.semantic_match_miss += pcpu->semantic_match_miss;
2185 s.null_node_hit += pcpu->null_node_hit;
2186 s.resize_node_skipped += pcpu->resize_node_skipped;
2187 }
2188
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002189 seq_printf(seq, "\nCounters:\n---------\n");
Alexander Duyck8274a972014-12-31 10:55:29 -08002190 seq_printf(seq, "gets = %u\n", s.gets);
2191 seq_printf(seq, "backtracks = %u\n", s.backtrack);
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002192 seq_printf(seq, "semantic match passed = %u\n",
Alexander Duyck8274a972014-12-31 10:55:29 -08002193 s.semantic_match_passed);
2194 seq_printf(seq, "semantic match miss = %u\n", s.semantic_match_miss);
2195 seq_printf(seq, "null node hit= %u\n", s.null_node_hit);
2196 seq_printf(seq, "skipped node resize = %u\n\n", s.resize_node_skipped);
Robert Olsson19baf832005-06-21 12:43:18 -07002197}
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002198#endif /* CONFIG_IP_FIB_TRIE_STATS */
2199
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002200static void fib_table_print(struct seq_file *seq, struct fib_table *tb)
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002201{
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002202 if (tb->tb_id == RT_TABLE_LOCAL)
2203 seq_puts(seq, "Local:\n");
2204 else if (tb->tb_id == RT_TABLE_MAIN)
2205 seq_puts(seq, "Main:\n");
2206 else
2207 seq_printf(seq, "Id %d:\n", tb->tb_id);
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002208}
Robert Olsson19baf832005-06-21 12:43:18 -07002209
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002210
Robert Olsson19baf832005-06-21 12:43:18 -07002211static int fib_triestat_seq_show(struct seq_file *seq, void *v)
2212{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002213 struct net *net = (struct net *)seq->private;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002214 unsigned int h;
Eric W. Biederman877a9bf2007-12-07 00:47:47 -08002215
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002216 seq_printf(seq,
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002217 "Basic info: size of leaf:"
2218 " %Zd bytes, size of tnode: %Zd bytes.\n",
Alexander Duyck41b489f2015-03-04 15:02:33 -08002219 LEAF_SIZE, TNODE_SIZE(0));
Olof Johansson91b9a272005-08-09 20:24:39 -07002220
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002221 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2222 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002223 struct fib_table *tb;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002224
Sasha Levinb67bfe02013-02-27 17:06:00 -08002225 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002226 struct trie *t = (struct trie *) tb->tb_data;
2227 struct trie_stat stat;
2228
2229 if (!t)
2230 continue;
2231
2232 fib_table_print(seq, tb);
2233
2234 trie_collect_stats(t, &stat);
2235 trie_show_stats(seq, &stat);
2236#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08002237 trie_show_usage(seq, t->stats);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002238#endif
2239 }
2240 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002241
Robert Olsson19baf832005-06-21 12:43:18 -07002242 return 0;
2243}
2244
Robert Olsson19baf832005-06-21 12:43:18 -07002245static int fib_triestat_seq_open(struct inode *inode, struct file *file)
2246{
Pavel Emelyanovde05c552008-07-18 04:07:21 -07002247 return single_open_net(inode, file, fib_triestat_seq_show);
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002248}
2249
Arjan van de Ven9a321442007-02-12 00:55:35 -08002250static const struct file_operations fib_triestat_fops = {
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002251 .owner = THIS_MODULE,
2252 .open = fib_triestat_seq_open,
2253 .read = seq_read,
2254 .llseek = seq_lseek,
Pavel Emelyanovb6fcbdb2008-07-18 04:07:44 -07002255 .release = single_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002256};
2257
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002258static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)
Robert Olsson19baf832005-06-21 12:43:18 -07002259{
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002260 struct fib_trie_iter *iter = seq->private;
2261 struct net *net = seq_file_net(seq);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002262 loff_t idx = 0;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002263 unsigned int h;
Robert Olsson19baf832005-06-21 12:43:18 -07002264
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002265 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2266 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002267 struct fib_table *tb;
2268
Sasha Levinb67bfe02013-02-27 17:06:00 -08002269 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002270 struct key_vector *n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002271
2272 for (n = fib_trie_get_first(iter,
2273 (struct trie *) tb->tb_data);
2274 n; n = fib_trie_get_next(iter))
2275 if (pos == idx++) {
2276 iter->tb = tb;
2277 return n;
2278 }
2279 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002280 }
Robert Olsson19baf832005-06-21 12:43:18 -07002281
Robert Olsson19baf832005-06-21 12:43:18 -07002282 return NULL;
2283}
2284
2285static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002286 __acquires(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002287{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002288 rcu_read_lock();
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002289 return fib_trie_get_idx(seq, *pos);
Robert Olsson19baf832005-06-21 12:43:18 -07002290}
2291
2292static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2293{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002294 struct fib_trie_iter *iter = seq->private;
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002295 struct net *net = seq_file_net(seq);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002296 struct fib_table *tb = iter->tb;
2297 struct hlist_node *tb_node;
2298 unsigned int h;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002299 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002300
Robert Olsson19baf832005-06-21 12:43:18 -07002301 ++*pos;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002302 /* next node in same table */
2303 n = fib_trie_get_next(iter);
2304 if (n)
2305 return n;
Olof Johansson91b9a272005-08-09 20:24:39 -07002306
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002307 /* walk rest of this hash chain */
2308 h = tb->tb_id & (FIB_TABLE_HASHSZ - 1);
Eric Dumazet0a5c0472011-03-31 01:51:35 -07002309 while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002310 tb = hlist_entry(tb_node, struct fib_table, tb_hlist);
2311 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2312 if (n)
2313 goto found;
2314 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002315
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002316 /* new hash chain */
2317 while (++h < FIB_TABLE_HASHSZ) {
2318 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Sasha Levinb67bfe02013-02-27 17:06:00 -08002319 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002320 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2321 if (n)
2322 goto found;
2323 }
2324 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002325 return NULL;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002326
2327found:
2328 iter->tb = tb;
2329 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002330}
2331
2332static void fib_trie_seq_stop(struct seq_file *seq, void *v)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002333 __releases(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002334{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002335 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002336}
2337
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002338static void seq_indent(struct seq_file *seq, int n)
2339{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002340 while (n-- > 0)
2341 seq_puts(seq, " ");
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002342}
Robert Olsson19baf832005-06-21 12:43:18 -07002343
Eric Dumazet28d36e32008-01-14 23:09:56 -08002344static inline const char *rtn_scope(char *buf, size_t len, enum rt_scope_t s)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002345{
Stephen Hemminger132adf52007-03-08 20:44:43 -08002346 switch (s) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002347 case RT_SCOPE_UNIVERSE: return "universe";
2348 case RT_SCOPE_SITE: return "site";
2349 case RT_SCOPE_LINK: return "link";
2350 case RT_SCOPE_HOST: return "host";
2351 case RT_SCOPE_NOWHERE: return "nowhere";
2352 default:
Eric Dumazet28d36e32008-01-14 23:09:56 -08002353 snprintf(buf, len, "scope=%d", s);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002354 return buf;
2355 }
2356}
2357
Jan Engelhardt36cbd3d2009-08-05 10:42:58 -07002358static const char *const rtn_type_names[__RTN_MAX] = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002359 [RTN_UNSPEC] = "UNSPEC",
2360 [RTN_UNICAST] = "UNICAST",
2361 [RTN_LOCAL] = "LOCAL",
2362 [RTN_BROADCAST] = "BROADCAST",
2363 [RTN_ANYCAST] = "ANYCAST",
2364 [RTN_MULTICAST] = "MULTICAST",
2365 [RTN_BLACKHOLE] = "BLACKHOLE",
2366 [RTN_UNREACHABLE] = "UNREACHABLE",
2367 [RTN_PROHIBIT] = "PROHIBIT",
2368 [RTN_THROW] = "THROW",
2369 [RTN_NAT] = "NAT",
2370 [RTN_XRESOLVE] = "XRESOLVE",
2371};
2372
Eric Dumazeta034ee32010-09-09 23:32:28 +00002373static inline const char *rtn_type(char *buf, size_t len, unsigned int t)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002374{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002375 if (t < __RTN_MAX && rtn_type_names[t])
2376 return rtn_type_names[t];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002377 snprintf(buf, len, "type %u", t);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002378 return buf;
2379}
2380
2381/* Pretty print the trie */
Robert Olsson19baf832005-06-21 12:43:18 -07002382static int fib_trie_seq_show(struct seq_file *seq, void *v)
2383{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002384 const struct fib_trie_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002385 struct key_vector *n = v;
Robert Olsson19baf832005-06-21 12:43:18 -07002386
Alexander Duyck88bae712015-03-06 09:54:52 -08002387 if (IS_TRIE(node_parent_rcu(n)))
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002388 fib_table_print(seq, iter->tb);
Robert Olsson095b8502007-01-26 19:06:01 -08002389
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002390 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002391 __be32 prf = htonl(n->key);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002392
Alexander Duycke9b44012014-12-31 10:56:12 -08002393 seq_indent(seq, iter->depth-1);
2394 seq_printf(seq, " +-- %pI4/%zu %u %u %u\n",
2395 &prf, KEYLENGTH - n->pos - n->bits, n->bits,
Alexander Duyck6e22d172015-03-06 09:54:39 -08002396 tn_info(n)->full_children,
2397 tn_info(n)->empty_children);
Olof Johansson91b9a272005-08-09 20:24:39 -07002398 } else {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002399 __be32 val = htonl(n->key);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002400 struct fib_alias *fa;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002401
2402 seq_indent(seq, iter->depth);
Harvey Harrison673d57e2008-10-31 00:53:57 -07002403 seq_printf(seq, " |-- %pI4\n", &val);
Eric Dumazet28d36e32008-01-14 23:09:56 -08002404
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002405 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
2406 char buf1[32], buf2[32];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002407
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002408 seq_indent(seq, iter->depth + 1);
2409 seq_printf(seq, " /%zu %s %s",
2410 KEYLENGTH - fa->fa_slen,
2411 rtn_scope(buf1, sizeof(buf1),
2412 fa->fa_info->fib_scope),
2413 rtn_type(buf2, sizeof(buf2),
2414 fa->fa_type));
2415 if (fa->fa_tos)
2416 seq_printf(seq, " tos=%d", fa->fa_tos);
2417 seq_putc(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002418 }
Robert Olsson19baf832005-06-21 12:43:18 -07002419 }
2420
2421 return 0;
2422}
2423
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002424static const struct seq_operations fib_trie_seq_ops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002425 .start = fib_trie_seq_start,
2426 .next = fib_trie_seq_next,
2427 .stop = fib_trie_seq_stop,
2428 .show = fib_trie_seq_show,
Robert Olsson19baf832005-06-21 12:43:18 -07002429};
2430
2431static int fib_trie_seq_open(struct inode *inode, struct file *file)
2432{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002433 return seq_open_net(inode, file, &fib_trie_seq_ops,
2434 sizeof(struct fib_trie_iter));
Robert Olsson19baf832005-06-21 12:43:18 -07002435}
2436
Arjan van de Ven9a321442007-02-12 00:55:35 -08002437static const struct file_operations fib_trie_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002438 .owner = THIS_MODULE,
2439 .open = fib_trie_seq_open,
2440 .read = seq_read,
2441 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002442 .release = seq_release_net,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002443};
2444
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002445struct fib_route_iter {
2446 struct seq_net_private p;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002447 struct fib_table *main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002448 struct key_vector *tnode;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002449 loff_t pos;
2450 t_key key;
2451};
2452
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002453static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,
2454 loff_t pos)
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002455{
Alexander Duyck8be33e92015-03-04 14:59:19 -08002456 struct fib_table *tb = iter->main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002457 struct key_vector *l, **tp = &iter->tnode;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002458 struct trie *t;
2459 t_key key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002460
Alexander Duyck8be33e92015-03-04 14:59:19 -08002461 /* use cache location of next-to-find key */
2462 if (iter->pos > 0 && pos >= iter->pos) {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002463 pos -= iter->pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002464 key = iter->key;
2465 } else {
2466 t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002467 iter->tnode = t->kv;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002468 iter->pos = 0;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002469 key = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002470 }
2471
Alexander Duyck8be33e92015-03-04 14:59:19 -08002472 while ((l = leaf_walk_rcu(tp, key)) != NULL) {
2473 key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002474 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002475
Andy Whitcroft25b97c02015-08-13 20:49:01 +01002476 if (--pos <= 0)
Alexander Duyck8be33e92015-03-04 14:59:19 -08002477 break;
2478
2479 l = NULL;
2480
2481 /* handle unlikely case of a key wrap */
2482 if (!key)
2483 break;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002484 }
2485
2486 if (l)
Alexander Duyck8be33e92015-03-04 14:59:19 -08002487 iter->key = key; /* remember it */
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002488 else
2489 iter->pos = 0; /* forget it */
2490
2491 return l;
2492}
2493
2494static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos)
2495 __acquires(RCU)
2496{
2497 struct fib_route_iter *iter = seq->private;
2498 struct fib_table *tb;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002499 struct trie *t;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002500
2501 rcu_read_lock();
Alexander Duyck8be33e92015-03-04 14:59:19 -08002502
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002503 tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN);
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002504 if (!tb)
2505 return NULL;
2506
Alexander Duyck8be33e92015-03-04 14:59:19 -08002507 iter->main_tb = tb;
2508
2509 if (*pos != 0)
2510 return fib_route_get_idx(iter, *pos);
2511
2512 t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002513 iter->tnode = t->kv;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002514 iter->pos = 0;
2515 iter->key = 0;
2516
2517 return SEQ_START_TOKEN;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002518}
2519
2520static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2521{
2522 struct fib_route_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002523 struct key_vector *l = NULL;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002524 t_key key = iter->key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002525
2526 ++*pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002527
2528 /* only allow key of 0 for start of sequence */
2529 if ((v == SEQ_START_TOKEN) || key)
2530 l = leaf_walk_rcu(&iter->tnode, key);
2531
2532 if (l) {
2533 iter->key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002534 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002535 } else {
2536 iter->pos = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002537 }
2538
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002539 return l;
2540}
2541
2542static void fib_route_seq_stop(struct seq_file *seq, void *v)
2543 __releases(RCU)
2544{
2545 rcu_read_unlock();
2546}
2547
Eric Dumazeta034ee32010-09-09 23:32:28 +00002548static unsigned int fib_flag_trans(int type, __be32 mask, const struct fib_info *fi)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002549{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002550 unsigned int flags = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002551
Eric Dumazeta034ee32010-09-09 23:32:28 +00002552 if (type == RTN_UNREACHABLE || type == RTN_PROHIBIT)
2553 flags = RTF_REJECT;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002554 if (fi && fi->fib_nh->nh_gw)
2555 flags |= RTF_GATEWAY;
Al Viro32ab5f82006-09-26 22:21:45 -07002556 if (mask == htonl(0xFFFFFFFF))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002557 flags |= RTF_HOST;
2558 flags |= RTF_UP;
2559 return flags;
2560}
2561
2562/*
2563 * This outputs /proc/net/route.
2564 * The format of the file is not supposed to be changed
Eric Dumazeta034ee32010-09-09 23:32:28 +00002565 * and needs to be same as fib_hash output to avoid breaking
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002566 * legacy utilities
2567 */
2568static int fib_route_seq_show(struct seq_file *seq, void *v)
2569{
Alexander Duyck654eff42015-03-11 16:36:08 -07002570 struct fib_route_iter *iter = seq->private;
2571 struct fib_table *tb = iter->main_tb;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002572 struct fib_alias *fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002573 struct key_vector *l = v;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002574 __be32 prefix;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002575
2576 if (v == SEQ_START_TOKEN) {
2577 seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway "
2578 "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU"
2579 "\tWindow\tIRTT");
2580 return 0;
2581 }
2582
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002583 prefix = htonl(l->key);
2584
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002585 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2586 const struct fib_info *fi = fa->fa_info;
2587 __be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen);
2588 unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002589
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002590 if ((fa->fa_type == RTN_BROADCAST) ||
2591 (fa->fa_type == RTN_MULTICAST))
2592 continue;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002593
Alexander Duyck654eff42015-03-11 16:36:08 -07002594 if (fa->tb_id != tb->tb_id)
2595 continue;
2596
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002597 seq_setwidth(seq, 127);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002598
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002599 if (fi)
2600 seq_printf(seq,
2601 "%s\t%08X\t%08X\t%04X\t%d\t%u\t"
2602 "%d\t%08X\t%d\t%u\t%u",
2603 fi->fib_dev ? fi->fib_dev->name : "*",
2604 prefix,
2605 fi->fib_nh->nh_gw, flags, 0, 0,
2606 fi->fib_priority,
2607 mask,
2608 (fi->fib_advmss ?
2609 fi->fib_advmss + 40 : 0),
2610 fi->fib_window,
2611 fi->fib_rtt >> 3);
2612 else
2613 seq_printf(seq,
2614 "*\t%08X\t%08X\t%04X\t%d\t%u\t"
2615 "%d\t%08X\t%d\t%u\t%u",
2616 prefix, 0, flags, 0, 0, 0,
2617 mask, 0, 0, 0);
Tetsuo Handa652586d2013-11-14 14:31:57 -08002618
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002619 seq_pad(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002620 }
2621
2622 return 0;
2623}
2624
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002625static const struct seq_operations fib_route_seq_ops = {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002626 .start = fib_route_seq_start,
2627 .next = fib_route_seq_next,
2628 .stop = fib_route_seq_stop,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002629 .show = fib_route_seq_show,
2630};
2631
2632static int fib_route_seq_open(struct inode *inode, struct file *file)
2633{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002634 return seq_open_net(inode, file, &fib_route_seq_ops,
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002635 sizeof(struct fib_route_iter));
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002636}
2637
Arjan van de Ven9a321442007-02-12 00:55:35 -08002638static const struct file_operations fib_route_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002639 .owner = THIS_MODULE,
2640 .open = fib_route_seq_open,
2641 .read = seq_read,
2642 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002643 .release = seq_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002644};
2645
Denis V. Lunev61a02652008-01-10 03:21:09 -08002646int __net_init fib_proc_init(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002647{
Gao fengd4beaa62013-02-18 01:34:54 +00002648 if (!proc_create("fib_trie", S_IRUGO, net->proc_net, &fib_trie_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002649 goto out1;
2650
Gao fengd4beaa62013-02-18 01:34:54 +00002651 if (!proc_create("fib_triestat", S_IRUGO, net->proc_net,
2652 &fib_triestat_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002653 goto out2;
2654
Gao fengd4beaa62013-02-18 01:34:54 +00002655 if (!proc_create("route", S_IRUGO, net->proc_net, &fib_route_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002656 goto out3;
2657
Robert Olsson19baf832005-06-21 12:43:18 -07002658 return 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002659
2660out3:
Gao fengece31ff2013-02-18 01:34:56 +00002661 remove_proc_entry("fib_triestat", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002662out2:
Gao fengece31ff2013-02-18 01:34:56 +00002663 remove_proc_entry("fib_trie", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002664out1:
2665 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07002666}
2667
Denis V. Lunev61a02652008-01-10 03:21:09 -08002668void __net_exit fib_proc_exit(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002669{
Gao fengece31ff2013-02-18 01:34:56 +00002670 remove_proc_entry("fib_trie", net->proc_net);
2671 remove_proc_entry("fib_triestat", net->proc_net);
2672 remove_proc_entry("route", net->proc_net);
Robert Olsson19baf832005-06-21 12:43:18 -07002673}
2674
2675#endif /* CONFIG_PROC_FS */