blob: 3a062370fc32c68c33df750f02ca975d8c110de4 [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>
Eric W. Biederman457c4cb2007-09-12 12:01:34 +020075#include <net/net_namespace.h>
Robert Olsson19baf832005-06-21 12:43:18 -070076#include <net/ip.h>
77#include <net/protocol.h>
78#include <net/route.h>
79#include <net/tcp.h>
80#include <net/sock.h>
81#include <net/ip_fib.h>
Scott Feldman8e05fd72015-03-05 21:21:19 -080082#include <net/switchdev.h>
Robert Olsson19baf832005-06-21 12:43:18 -070083#include "fib_lookup.h"
84
Robert Olsson06ef9212006-03-20 21:35:01 -080085#define MAX_STAT_DEPTH 32
Robert Olsson19baf832005-06-21 12:43:18 -070086
Alexander Duyck95f60ea2015-01-22 15:51:26 -080087#define KEYLENGTH (8*sizeof(t_key))
88#define KEY_MAX ((t_key)~0)
Robert Olsson19baf832005-06-21 12:43:18 -070089
Robert Olsson19baf832005-06-21 12:43:18 -070090typedef unsigned int t_key;
91
Alexander Duyck64c9b6f2014-12-31 10:55:35 -080092#define IS_TNODE(n) ((n)->bits)
93#define IS_LEAF(n) (!(n)->bits)
Robert Olsson2373ce12005-08-25 13:01:29 -070094
Alexander Duyck35c6eda2015-03-06 09:54:08 -080095struct key_vector {
Alexander Duyck37fd30f2014-12-31 10:55:41 -080096 struct rcu_head rcu;
Alexander Duyck41b489f2015-03-04 15:02:33 -080097
98 t_key empty_children; /* KEYLENGTH bits needed */
99 t_key full_children; /* KEYLENGTH bits needed */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800100 struct key_vector __rcu *parent;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800101
102 t_key key;
103 unsigned char pos; /* 2log(KEYLENGTH) bits needed */
104 unsigned char bits; /* 2log(KEYLENGTH) bits needed */
105 unsigned char slen;
Alexander Duyckadaf9812014-12-31 10:55:47 -0800106 union {
Alexander Duyck41b489f2015-03-04 15:02:33 -0800107 /* This list pointer if valid if (pos | bits) == 0 (LEAF) */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800108 struct hlist_head leaf;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800109 /* This array is valid if (pos | bits) > 0 (TNODE) */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800110 struct key_vector __rcu *tnode[0];
Alexander Duyckadaf9812014-12-31 10:55:47 -0800111 };
Robert Olsson19baf832005-06-21 12:43:18 -0700112};
113
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800114struct tnode {
115 struct key_vector kv[1];
116};
117
118#define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n])
Alexander Duyck41b489f2015-03-04 15:02:33 -0800119#define LEAF_SIZE TNODE_SIZE(1)
120
Robert Olsson19baf832005-06-21 12:43:18 -0700121#ifdef CONFIG_IP_FIB_TRIE_STATS
122struct trie_use_stats {
123 unsigned int gets;
124 unsigned int backtrack;
125 unsigned int semantic_match_passed;
126 unsigned int semantic_match_miss;
127 unsigned int null_node_hit;
Robert Olsson2f368952005-07-05 15:02:40 -0700128 unsigned int resize_node_skipped;
Robert Olsson19baf832005-06-21 12:43:18 -0700129};
130#endif
131
132struct trie_stat {
133 unsigned int totdepth;
134 unsigned int maxdepth;
135 unsigned int tnodes;
136 unsigned int leaves;
137 unsigned int nullpointers;
Stephen Hemminger93672292008-01-22 21:54:05 -0800138 unsigned int prefixes;
Robert Olsson06ef9212006-03-20 21:35:01 -0800139 unsigned int nodesizes[MAX_STAT_DEPTH];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700140};
Robert Olsson19baf832005-06-21 12:43:18 -0700141
142struct trie {
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800143 struct key_vector __rcu *tnode[1];
Robert Olsson19baf832005-06-21 12:43:18 -0700144#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -0800145 struct trie_use_stats __percpu *stats;
Robert Olsson19baf832005-06-21 12:43:18 -0700146#endif
Robert Olsson19baf832005-06-21 12:43:18 -0700147};
148
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800149static struct key_vector **resize(struct trie *t, struct key_vector *tn);
Jarek Poplawskic3059472009-07-14 08:33:08 +0000150static size_t tnode_free_size;
151
152/*
153 * synchronize_rcu after call_rcu for that many pages; it should be especially
154 * useful before resizing the root node with PREEMPT_NONE configs; the value was
155 * obtained experimentally, aiming to avoid visible slowdown.
156 */
157static const int sync_pages = 128;
Robert Olsson19baf832005-06-21 12:43:18 -0700158
Christoph Lametere18b8902006-12-06 20:33:20 -0800159static struct kmem_cache *fn_alias_kmem __read_mostly;
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -0800160static struct kmem_cache *trie_leaf_kmem __read_mostly;
Robert Olsson19baf832005-06-21 12:43:18 -0700161
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800162/* caller must hold RTNL */
163#define node_parent(n) rtnl_dereference((n)->parent)
Alexander Duyck754baf82015-03-06 09:54:14 -0800164#define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700165
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800166/* caller must hold RCU read lock or RTNL */
167#define node_parent_rcu(n) rcu_dereference_rtnl((n)->parent)
Alexander Duyck754baf82015-03-06 09:54:14 -0800168#define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700169
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800170/* wrapper for rcu_assign_pointer */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800171static inline void node_set_parent(struct key_vector *n, struct key_vector *tp)
Stephen Hemminger06801912007-08-10 15:22:13 -0700172{
Alexander Duyckadaf9812014-12-31 10:55:47 -0800173 if (n)
174 rcu_assign_pointer(n->parent, tp);
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800175}
176
177#define NODE_INIT_PARENT(n, p) RCU_INIT_POINTER((n)->parent, p)
178
179/* This provides us with the number of children in this node, in the case of a
180 * leaf this will return 0 meaning none of the children are accessible.
181 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800182static inline unsigned long child_length(const struct key_vector *tn)
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800183{
184 return (1ul << tn->bits) & ~(1ul);
Stephen Hemminger06801912007-08-10 15:22:13 -0700185}
Robert Olsson2373ce12005-08-25 13:01:29 -0700186
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800187static inline unsigned long get_index(t_key key, struct key_vector *kv)
188{
189 unsigned long index = key ^ kv->key;
190
191 return index >> kv->pos;
192}
193
Alexander Duycka7e53532015-03-04 15:02:44 -0800194static inline struct fib_table *trie_get_table(struct trie *t)
195{
196 unsigned long *tb_data = (unsigned long *)t;
197
198 return container_of(tb_data, struct fib_table, tb_data[0]);
199}
200
Alexander Duycke9b44012014-12-31 10:56:12 -0800201/* To understand this stuff, an understanding of keys and all their bits is
202 * necessary. Every node in the trie has a key associated with it, but not
203 * all of the bits in that key are significant.
204 *
205 * Consider a node 'n' and its parent 'tp'.
206 *
207 * If n is a leaf, every bit in its key is significant. Its presence is
208 * necessitated by path compression, since during a tree traversal (when
209 * searching for a leaf - unless we are doing an insertion) we will completely
210 * ignore all skipped bits we encounter. Thus we need to verify, at the end of
211 * a potentially successful search, that we have indeed been walking the
212 * correct key path.
213 *
214 * Note that we can never "miss" the correct key in the tree if present by
215 * following the wrong path. Path compression ensures that segments of the key
216 * that are the same for all keys with a given prefix are skipped, but the
217 * skipped part *is* identical for each node in the subtrie below the skipped
218 * bit! trie_insert() in this implementation takes care of that.
219 *
220 * if n is an internal node - a 'tnode' here, the various parts of its key
221 * have many different meanings.
222 *
223 * Example:
224 * _________________________________________________________________
225 * | i | i | i | i | i | i | i | N | N | N | S | S | S | S | S | C |
226 * -----------------------------------------------------------------
227 * 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16
228 *
229 * _________________________________________________________________
230 * | C | C | C | u | u | u | u | u | u | u | u | u | u | u | u | u |
231 * -----------------------------------------------------------------
232 * 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
233 *
234 * tp->pos = 22
235 * tp->bits = 3
236 * n->pos = 13
237 * n->bits = 4
238 *
239 * First, let's just ignore the bits that come before the parent tp, that is
240 * the bits from (tp->pos + tp->bits) to 31. They are *known* but at this
241 * point we do not use them for anything.
242 *
243 * The bits from (tp->pos) to (tp->pos + tp->bits - 1) - "N", above - are the
244 * index into the parent's child array. That is, they will be used to find
245 * 'n' among tp's children.
246 *
247 * The bits from (n->pos + n->bits) to (tn->pos - 1) - "S" - are skipped bits
248 * for the node n.
249 *
250 * All the bits we have seen so far are significant to the node n. The rest
251 * of the bits are really not needed or indeed known in n->key.
252 *
253 * The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into
254 * n's child array, and will of course be different for each child.
255 *
256 * The rest of the bits, from 0 to (n->pos + n->bits), are completely unknown
257 * at this point.
258 */
Robert Olsson19baf832005-06-21 12:43:18 -0700259
Denis V. Lunevf5026fa2007-12-13 09:47:57 -0800260static const int halve_threshold = 25;
261static const int inflate_threshold = 50;
Jarek Poplawski345aa032009-07-07 19:39:16 -0700262static const int halve_threshold_root = 15;
Jens Låås80b71b82009-08-28 23:57:15 -0700263static const int inflate_threshold_root = 30;
Robert Olsson2373ce12005-08-25 13:01:29 -0700264
265static void __alias_free_mem(struct rcu_head *head)
266{
267 struct fib_alias *fa = container_of(head, struct fib_alias, rcu);
268 kmem_cache_free(fn_alias_kmem, fa);
269}
270
271static inline void alias_free_mem_rcu(struct fib_alias *fa)
272{
273 call_rcu(&fa->rcu, __alias_free_mem);
274}
275
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800276#define TNODE_KMALLOC_MAX \
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800277 ilog2((PAGE_SIZE - TNODE_SIZE(0)) / sizeof(struct key_vector *))
Alexander Duyck1de3d872015-03-04 15:04:46 -0800278#define TNODE_VMALLOC_MAX \
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800279 ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800280
281static void __node_free_rcu(struct rcu_head *head)
Robert Olsson2373ce12005-08-25 13:01:29 -0700282{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800283 struct key_vector *n = container_of(head, struct key_vector, rcu);
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800284
285 if (IS_LEAF(n))
286 kmem_cache_free(trie_leaf_kmem, n);
287 else if (n->bits <= TNODE_KMALLOC_MAX)
288 kfree(n);
289 else
290 vfree(n);
Robert Olsson2373ce12005-08-25 13:01:29 -0700291}
292
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800293#define node_free(n) call_rcu(&n->rcu, __node_free_rcu)
Stephen Hemminger387a5482008-04-10 03:47:34 -0700294
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800295static struct tnode *tnode_alloc(int bits)
Robert Olsson2373ce12005-08-25 13:01:29 -0700296{
Alexander Duyck1de3d872015-03-04 15:04:46 -0800297 size_t size;
298
299 /* verify bits is within bounds */
300 if (bits > TNODE_VMALLOC_MAX)
301 return NULL;
302
303 /* determine size and verify it is non-zero and didn't overflow */
304 size = TNODE_SIZE(1ul << bits);
305
Robert Olsson2373ce12005-08-25 13:01:29 -0700306 if (size <= PAGE_SIZE)
Eric Dumazet8d965442008-01-13 22:31:44 -0800307 return kzalloc(size, GFP_KERNEL);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700308 else
Eric Dumazet7a1c8e52010-11-20 07:46:35 +0000309 return vzalloc(size);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700310}
Robert Olsson2373ce12005-08-25 13:01:29 -0700311
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800312static inline void empty_child_inc(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800313{
314 ++n->empty_children ? : ++n->full_children;
315}
316
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800317static inline void empty_child_dec(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800318{
319 n->empty_children-- ? : n->full_children--;
320}
321
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800322static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)
Robert Olsson19baf832005-06-21 12:43:18 -0700323{
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800324 struct tnode *kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL);
325 struct key_vector *l = kv->kv;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800326
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800327 if (!kv)
328 return NULL;
329
330 /* initialize key vector */
331 l->key = key;
332 l->pos = 0;
333 l->bits = 0;
334 l->slen = fa->fa_slen;
335
336 /* link leaf to fib alias */
337 INIT_HLIST_HEAD(&l->leaf);
338 hlist_add_head(&fa->fa_list, &l->leaf);
339
Robert Olsson19baf832005-06-21 12:43:18 -0700340 return l;
341}
342
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800343static struct key_vector *tnode_new(t_key key, int pos, int bits)
Robert Olsson19baf832005-06-21 12:43:18 -0700344{
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800345 struct tnode *tnode = tnode_alloc(bits);
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800346 unsigned int shift = pos + bits;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800347 struct key_vector *tn = tnode->kv;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800348
349 /* verify bits and pos their msb bits clear and values are valid */
350 BUG_ON(!bits || (shift > KEYLENGTH));
Robert Olsson19baf832005-06-21 12:43:18 -0700351
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800352 pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0),
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800353 sizeof(struct key_vector *) << bits);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800354
355 if (!tnode)
356 return NULL;
357
358 if (bits == KEYLENGTH)
359 tn->full_children = 1;
360 else
361 tn->empty_children = 1ul << bits;
362
363 tn->key = (shift < KEYLENGTH) ? (key >> shift) << shift : 0;
364 tn->pos = pos;
365 tn->bits = bits;
366 tn->slen = pos;
367
Robert Olsson19baf832005-06-21 12:43:18 -0700368 return tn;
369}
370
Alexander Duycke9b44012014-12-31 10:56:12 -0800371/* Check whether a tnode 'n' is "full", i.e. it is an internal node
Robert Olsson19baf832005-06-21 12:43:18 -0700372 * and no bits are skipped. See discussion in dyntree paper p. 6
373 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800374static inline int tnode_full(struct key_vector *tn, struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700375{
Alexander Duycke9b44012014-12-31 10:56:12 -0800376 return n && ((n->pos + n->bits) == tn->pos) && IS_TNODE(n);
Robert Olsson19baf832005-06-21 12:43:18 -0700377}
378
Alexander Duyckff181ed2014-12-31 10:56:43 -0800379/* Add a child at position i overwriting the old value.
380 * Update the value of full_children and empty_children.
381 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800382static void put_child(struct key_vector *tn, unsigned long i,
383 struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700384{
Alexander Duyck754baf82015-03-06 09:54:14 -0800385 struct key_vector *chi = get_child(tn, i);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800386 int isfull, wasfull;
Robert Olsson19baf832005-06-21 12:43:18 -0700387
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800388 BUG_ON(i >= child_length(tn));
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700389
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800390 /* update emptyChildren, overflow into fullChildren */
Robert Olsson19baf832005-06-21 12:43:18 -0700391 if (n == NULL && chi != NULL)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800392 empty_child_inc(tn);
393 if (n != NULL && chi == NULL)
394 empty_child_dec(tn);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700395
Robert Olsson19baf832005-06-21 12:43:18 -0700396 /* update fullChildren */
Alexander Duyckff181ed2014-12-31 10:56:43 -0800397 wasfull = tnode_full(tn, chi);
Robert Olsson19baf832005-06-21 12:43:18 -0700398 isfull = tnode_full(tn, n);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800399
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700400 if (wasfull && !isfull)
Robert Olsson19baf832005-06-21 12:43:18 -0700401 tn->full_children--;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700402 else if (!wasfull && isfull)
Robert Olsson19baf832005-06-21 12:43:18 -0700403 tn->full_children++;
Olof Johansson91b9a272005-08-09 20:24:39 -0700404
Alexander Duyck5405afd2014-12-31 10:57:08 -0800405 if (n && (tn->slen < n->slen))
406 tn->slen = n->slen;
407
Alexander Duyck41b489f2015-03-04 15:02:33 -0800408 rcu_assign_pointer(tn->tnode[i], n);
Robert Olsson19baf832005-06-21 12:43:18 -0700409}
410
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800411static void update_children(struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800412{
413 unsigned long i;
414
415 /* update all of the child parent pointers */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800416 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800417 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800418
419 if (!inode)
420 continue;
421
422 /* Either update the children of a tnode that
423 * already belongs to us or update the child
424 * to point to ourselves.
425 */
426 if (node_parent(inode) == tn)
427 update_children(inode);
428 else
429 node_set_parent(inode, tn);
430 }
431}
432
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800433static inline void put_child_root(struct key_vector *tp, struct trie *t,
434 t_key key, struct key_vector *n)
Alexander Duyck836a0122014-12-31 10:56:06 -0800435{
436 if (tp)
437 put_child(tp, get_index(key, tp), n);
438 else
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800439 rcu_assign_pointer(t->tnode[0], n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800440}
441
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800442static inline void tnode_free_init(struct key_vector *tn)
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700443{
Alexander Duyckfc86a932014-12-31 10:56:49 -0800444 tn->rcu.next = NULL;
445}
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700446
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800447static inline void tnode_free_append(struct key_vector *tn,
448 struct key_vector *n)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800449{
450 n->rcu.next = tn->rcu.next;
451 tn->rcu.next = &n->rcu;
452}
453
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800454static void tnode_free(struct key_vector *tn)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800455{
456 struct callback_head *head = &tn->rcu;
457
458 while (head) {
459 head = head->next;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800460 tnode_free_size += TNODE_SIZE(1ul << tn->bits);
Alexander Duyckfc86a932014-12-31 10:56:49 -0800461 node_free(tn);
462
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800463 tn = container_of(head, struct key_vector, rcu);
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700464 }
Alexander Duyckfc86a932014-12-31 10:56:49 -0800465
466 if (tnode_free_size >= PAGE_SIZE * sync_pages) {
467 tnode_free_size = 0;
468 synchronize_rcu();
469 }
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700470}
471
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800472static struct key_vector __rcu **replace(struct trie *t,
473 struct key_vector *oldtnode,
474 struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800475{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800476 struct key_vector *tp = node_parent(oldtnode);
477 struct key_vector **cptr;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800478 unsigned long i;
479
480 /* setup the parent pointer out of and back into this node */
481 NODE_INIT_PARENT(tn, tp);
482 put_child_root(tp, t, tn->key, tn);
483
484 /* update all of the child parent pointers */
485 update_children(tn);
486
487 /* all pointers should be clean so we are done */
488 tnode_free(oldtnode);
489
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800490 /* record the pointer that is pointing to this node */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800491 cptr = tp ? tp->tnode : t->tnode;
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800492
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800493 /* resize children now that oldtnode is freed */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800494 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800495 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800496
497 /* resize child node */
498 if (tnode_full(tn, inode))
499 resize(t, inode);
500 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800501
502 return cptr;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800503}
504
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800505static struct key_vector __rcu **inflate(struct trie *t,
506 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700507{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800508 struct key_vector *tn;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800509 unsigned long i;
Alexander Duycke9b44012014-12-31 10:56:12 -0800510 t_key m;
Robert Olsson19baf832005-06-21 12:43:18 -0700511
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700512 pr_debug("In inflate\n");
Robert Olsson19baf832005-06-21 12:43:18 -0700513
Alexander Duycke9b44012014-12-31 10:56:12 -0800514 tn = tnode_new(oldtnode->key, oldtnode->pos - 1, oldtnode->bits + 1);
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700515 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800516 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700517
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800518 /* prepare oldtnode to be freed */
519 tnode_free_init(oldtnode);
520
Alexander Duyck12c081a2014-12-31 10:56:55 -0800521 /* Assemble all of the pointers in our cluster, in this case that
522 * represents all of the pointers out of our allocated nodes that
523 * point to existing tnodes and the links between our allocated
524 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700525 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800526 for (i = child_length(oldtnode), m = 1u << tn->pos; i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800527 struct key_vector *inode = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800528 struct key_vector *node0, *node1;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800529 unsigned long j, k;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700530
Robert Olsson19baf832005-06-21 12:43:18 -0700531 /* An empty child */
Alexander Duyckadaf9812014-12-31 10:55:47 -0800532 if (inode == NULL)
Robert Olsson19baf832005-06-21 12:43:18 -0700533 continue;
534
535 /* A leaf or an internal node with skipped bits */
Alexander Duyckadaf9812014-12-31 10:55:47 -0800536 if (!tnode_full(oldtnode, inode)) {
Alexander Duycke9b44012014-12-31 10:56:12 -0800537 put_child(tn, get_index(inode->key, tn), inode);
Robert Olsson19baf832005-06-21 12:43:18 -0700538 continue;
539 }
540
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800541 /* drop the node in the old tnode free list */
542 tnode_free_append(oldtnode, inode);
543
Robert Olsson19baf832005-06-21 12:43:18 -0700544 /* An internal node with two children */
Robert Olsson19baf832005-06-21 12:43:18 -0700545 if (inode->bits == 1) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800546 put_child(tn, 2 * i + 1, get_child(inode, 1));
547 put_child(tn, 2 * i, get_child(inode, 0));
Olof Johansson91b9a272005-08-09 20:24:39 -0700548 continue;
Robert Olsson19baf832005-06-21 12:43:18 -0700549 }
550
Olof Johansson91b9a272005-08-09 20:24:39 -0700551 /* We will replace this node 'inode' with two new
Alexander Duyck12c081a2014-12-31 10:56:55 -0800552 * ones, 'node0' and 'node1', each with half of the
Olof Johansson91b9a272005-08-09 20:24:39 -0700553 * original children. The two new nodes will have
554 * a position one bit further down the key and this
555 * means that the "significant" part of their keys
556 * (see the discussion near the top of this file)
557 * will differ by one bit, which will be "0" in
Alexander Duyck12c081a2014-12-31 10:56:55 -0800558 * node0's key and "1" in node1's key. Since we are
Olof Johansson91b9a272005-08-09 20:24:39 -0700559 * moving the key position by one step, the bit that
560 * we are moving away from - the bit at position
Alexander Duyck12c081a2014-12-31 10:56:55 -0800561 * (tn->pos) - is the one that will differ between
562 * node0 and node1. So... we synthesize that bit in the
563 * two new keys.
Olof Johansson91b9a272005-08-09 20:24:39 -0700564 */
Alexander Duyck12c081a2014-12-31 10:56:55 -0800565 node1 = tnode_new(inode->key | m, inode->pos, inode->bits - 1);
566 if (!node1)
567 goto nomem;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800568 node0 = tnode_new(inode->key, inode->pos, inode->bits - 1);
Robert Olsson19baf832005-06-21 12:43:18 -0700569
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800570 tnode_free_append(tn, node1);
Alexander Duyck12c081a2014-12-31 10:56:55 -0800571 if (!node0)
572 goto nomem;
573 tnode_free_append(tn, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700574
Alexander Duyck12c081a2014-12-31 10:56:55 -0800575 /* populate child pointers in new nodes */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800576 for (k = child_length(inode), j = k / 2; j;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800577 put_child(node1, --j, get_child(inode, --k));
578 put_child(node0, j, get_child(inode, j));
579 put_child(node1, --j, get_child(inode, --k));
580 put_child(node0, j, get_child(inode, j));
Robert Olsson19baf832005-06-21 12:43:18 -0700581 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800582
Alexander Duyck12c081a2014-12-31 10:56:55 -0800583 /* link new nodes to parent */
584 NODE_INIT_PARENT(node1, tn);
585 NODE_INIT_PARENT(node0, tn);
Olof Johansson91b9a272005-08-09 20:24:39 -0700586
Alexander Duyck12c081a2014-12-31 10:56:55 -0800587 /* link parent to nodes */
588 put_child(tn, 2 * i + 1, node1);
589 put_child(tn, 2 * i, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700590 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800591
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800592 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800593 return replace(t, oldtnode, tn);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700594nomem:
Alexander Duyckfc86a932014-12-31 10:56:49 -0800595 /* all pointers should be clean so we are done */
596 tnode_free(tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800597notnode:
598 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700599}
600
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800601static struct key_vector __rcu **halve(struct trie *t,
602 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700603{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800604 struct key_vector *tn;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800605 unsigned long i;
Robert Olsson19baf832005-06-21 12:43:18 -0700606
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700607 pr_debug("In halve\n");
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700608
Alexander Duycke9b44012014-12-31 10:56:12 -0800609 tn = tnode_new(oldtnode->key, oldtnode->pos + 1, oldtnode->bits - 1);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700610 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800611 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700612
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800613 /* prepare oldtnode to be freed */
614 tnode_free_init(oldtnode);
615
Alexander Duyck12c081a2014-12-31 10:56:55 -0800616 /* Assemble all of the pointers in our cluster, in this case that
617 * represents all of the pointers out of our allocated nodes that
618 * point to existing tnodes and the links between our allocated
619 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700620 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800621 for (i = child_length(oldtnode); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800622 struct key_vector *node1 = get_child(oldtnode, --i);
623 struct key_vector *node0 = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800624 struct key_vector *inode;
Robert Olsson2f368952005-07-05 15:02:40 -0700625
Alexander Duyck12c081a2014-12-31 10:56:55 -0800626 /* At least one of the children is empty */
627 if (!node1 || !node0) {
628 put_child(tn, i / 2, node1 ? : node0);
629 continue;
Robert Olsson2f368952005-07-05 15:02:40 -0700630 }
Robert Olsson2f368952005-07-05 15:02:40 -0700631
Alexander Duyck12c081a2014-12-31 10:56:55 -0800632 /* Two nonempty children */
633 inode = tnode_new(node0->key, oldtnode->pos, 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800634 if (!inode)
635 goto nomem;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800636 tnode_free_append(tn, inode);
637
638 /* initialize pointers out of node */
639 put_child(inode, 1, node1);
640 put_child(inode, 0, node0);
641 NODE_INIT_PARENT(inode, tn);
642
643 /* link parent to node */
644 put_child(tn, i / 2, inode);
Robert Olsson2f368952005-07-05 15:02:40 -0700645 }
Robert Olsson19baf832005-06-21 12:43:18 -0700646
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800647 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800648 return replace(t, oldtnode, tn);
649nomem:
650 /* all pointers should be clean so we are done */
651 tnode_free(tn);
652notnode:
653 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700654}
655
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800656static void collapse(struct trie *t, struct key_vector *oldtnode)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800657{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800658 struct key_vector *n, *tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800659 unsigned long i;
660
661 /* scan the tnode looking for that one child that might still exist */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800662 for (n = NULL, i = child_length(oldtnode); !n && i;)
Alexander Duyck754baf82015-03-06 09:54:14 -0800663 n = get_child(oldtnode, --i);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800664
665 /* compress one level */
666 tp = node_parent(oldtnode);
667 put_child_root(tp, t, oldtnode->key, n);
668 node_set_parent(n, tp);
669
670 /* drop dead node */
671 node_free(oldtnode);
672}
673
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800674static unsigned char update_suffix(struct key_vector *tn)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800675{
676 unsigned char slen = tn->pos;
677 unsigned long stride, i;
678
679 /* search though the list of children looking for nodes that might
680 * have a suffix greater than the one we currently have. This is
681 * why we start with a stride of 2 since a stride of 1 would
682 * represent the nodes with suffix length equal to tn->pos
683 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800684 for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800685 struct key_vector *n = get_child(tn, i);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800686
687 if (!n || (n->slen <= slen))
688 continue;
689
690 /* update stride and slen based on new value */
691 stride <<= (n->slen - slen);
692 slen = n->slen;
693 i &= ~(stride - 1);
694
695 /* if slen covers all but the last bit we can stop here
696 * there will be nothing longer than that since only node
697 * 0 and 1 << (bits - 1) could have that as their suffix
698 * length.
699 */
700 if ((slen + 1) >= (tn->pos + tn->bits))
701 break;
702 }
703
704 tn->slen = slen;
705
706 return slen;
707}
708
Alexander Duyckf05a4812014-12-31 10:56:37 -0800709/* From "Implementing a dynamic compressed trie" by Stefan Nilsson of
710 * the Helsinki University of Technology and Matti Tikkanen of Nokia
711 * Telecommunications, page 6:
712 * "A node is doubled if the ratio of non-empty children to all
713 * children in the *doubled* node is at least 'high'."
714 *
715 * 'high' in this instance is the variable 'inflate_threshold'. It
716 * is expressed as a percentage, so we multiply it with
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800717 * child_length() and instead of multiplying by 2 (since the
Alexander Duyckf05a4812014-12-31 10:56:37 -0800718 * child array will be doubled by inflate()) and multiplying
719 * the left-hand side by 100 (to handle the percentage thing) we
720 * multiply the left-hand side by 50.
721 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800722 * The left-hand side may look a bit weird: child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800723 * - tn->empty_children is of course the number of non-null children
724 * in the current node. tn->full_children is the number of "full"
725 * children, that is non-null tnodes with a skip value of 0.
726 * All of those will be doubled in the resulting inflated tnode, so
727 * we just count them one extra time here.
728 *
729 * A clearer way to write this would be:
730 *
731 * to_be_doubled = tn->full_children;
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800732 * not_to_be_doubled = child_length(tn) - tn->empty_children -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800733 * tn->full_children;
734 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800735 * new_child_length = child_length(tn) * 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800736 *
737 * new_fill_factor = 100 * (not_to_be_doubled + 2*to_be_doubled) /
738 * new_child_length;
739 * if (new_fill_factor >= inflate_threshold)
740 *
741 * ...and so on, tho it would mess up the while () loop.
742 *
743 * anyway,
744 * 100 * (not_to_be_doubled + 2*to_be_doubled) / new_child_length >=
745 * inflate_threshold
746 *
747 * avoid a division:
748 * 100 * (not_to_be_doubled + 2*to_be_doubled) >=
749 * inflate_threshold * new_child_length
750 *
751 * expand not_to_be_doubled and to_be_doubled, and shorten:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800752 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800753 * tn->full_children) >= inflate_threshold * new_child_length
754 *
755 * expand new_child_length:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800756 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800757 * tn->full_children) >=
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800758 * inflate_threshold * child_length(tn) * 2
Alexander Duyckf05a4812014-12-31 10:56:37 -0800759 *
760 * shorten again:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800761 * 50 * (tn->full_children + child_length(tn) -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800762 * tn->empty_children) >= inflate_threshold *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800763 * child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800764 *
765 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800766static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800767{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800768 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800769 unsigned long threshold = used;
770
771 /* Keep root node larger */
Alexander Duyckff181ed2014-12-31 10:56:43 -0800772 threshold *= tp ? inflate_threshold : inflate_threshold_root;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800773 used -= tn->empty_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800774 used += tn->full_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800775
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800776 /* if bits == KEYLENGTH then pos = 0, and will fail below */
777
778 return (used > 1) && tn->pos && ((50 * used) >= threshold);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800779}
780
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800781static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800782{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800783 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800784 unsigned long threshold = used;
785
786 /* Keep root node larger */
Alexander Duyckff181ed2014-12-31 10:56:43 -0800787 threshold *= tp ? halve_threshold : halve_threshold_root;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800788 used -= tn->empty_children;
789
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800790 /* if bits == KEYLENGTH then used = 100% on wrap, and will fail below */
791
792 return (used > 1) && (tn->bits > 1) && ((100 * used) < threshold);
793}
794
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800795static inline bool should_collapse(struct key_vector *tn)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800796{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800797 unsigned long used = child_length(tn);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800798
799 used -= tn->empty_children;
800
801 /* account for bits == KEYLENGTH case */
802 if ((tn->bits == KEYLENGTH) && tn->full_children)
803 used -= KEY_MAX;
804
805 /* One child or none, time to drop us from the trie */
806 return used < 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800807}
808
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800809#define MAX_WORK 10
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800810static struct key_vector __rcu **resize(struct trie *t,
811 struct key_vector *tn)
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800812{
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800813#ifdef CONFIG_IP_FIB_TRIE_STATS
814 struct trie_use_stats __percpu *stats = t->stats;
815#endif
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800816 struct key_vector *tp = node_parent(tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800817 unsigned long cindex = tp ? get_index(tn->key, tp) : 0;
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800818 struct key_vector __rcu **cptr = tp ? tp->tnode : t->tnode;
Alexander Duycka80e89d2015-01-22 15:51:20 -0800819 int max_work = MAX_WORK;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800820
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800821 pr_debug("In tnode_resize %p inflate_threshold=%d threshold=%d\n",
822 tn, inflate_threshold, halve_threshold);
823
Alexander Duyckff181ed2014-12-31 10:56:43 -0800824 /* track the tnode via the pointer from the parent instead of
825 * doing it ourselves. This way we can let RCU fully do its
826 * thing without us interfering
827 */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800828 BUG_ON(tn != rtnl_dereference(cptr[cindex]));
Alexander Duyckff181ed2014-12-31 10:56:43 -0800829
Alexander Duyckf05a4812014-12-31 10:56:37 -0800830 /* Double as long as the resulting node has a number of
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800831 * nonempty nodes that are above the threshold.
832 */
Alexander Duycka80e89d2015-01-22 15:51:20 -0800833 while (should_inflate(tp, tn) && max_work) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800834 struct key_vector __rcu **tcptr = inflate(t, tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800835
836 if (!tcptr) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800837#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800838 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800839#endif
840 break;
841 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800842
Alexander Duycka80e89d2015-01-22 15:51:20 -0800843 max_work--;
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800844 cptr = tcptr;
845 tn = rtnl_dereference(cptr[cindex]);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800846 }
847
848 /* Return if at least one inflate is run */
849 if (max_work != MAX_WORK)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800850 return cptr;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800851
Alexander Duyckf05a4812014-12-31 10:56:37 -0800852 /* Halve as long as the number of empty children in this
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800853 * node is above threshold.
854 */
Alexander Duycka80e89d2015-01-22 15:51:20 -0800855 while (should_halve(tp, tn) && max_work) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800856 struct key_vector __rcu **tcptr = halve(t, tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800857
858 if (!tcptr) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800859#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800860 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800861#endif
862 break;
863 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800864
Alexander Duycka80e89d2015-01-22 15:51:20 -0800865 max_work--;
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800866 cptr = tcptr;
867 tn = rtnl_dereference(cptr[cindex]);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800868 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800869
870 /* Only one child remains */
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800871 if (should_collapse(tn)) {
872 collapse(t, tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800873 return cptr;
Alexander Duyck5405afd2014-12-31 10:57:08 -0800874 }
875
876 /* Return if at least one deflate was run */
877 if (max_work != MAX_WORK)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800878 return cptr;
Alexander Duyck5405afd2014-12-31 10:57:08 -0800879
880 /* push the suffix length to the parent node */
881 if (tn->slen > tn->pos) {
882 unsigned char slen = update_suffix(tn);
883
884 if (tp && (slen > tp->slen))
885 tp->slen = slen;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800886 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800887
888 return cptr;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800889}
890
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800891static void leaf_pull_suffix(struct key_vector *tp, struct key_vector *l)
Robert Olsson19baf832005-06-21 12:43:18 -0700892{
Alexander Duyck5405afd2014-12-31 10:57:08 -0800893 while (tp && (tp->slen > tp->pos) && (tp->slen > l->slen)) {
894 if (update_suffix(tp) > l->slen)
895 break;
896 tp = node_parent(tp);
897 }
898}
899
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800900static void leaf_push_suffix(struct key_vector *tn, struct key_vector *l)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800901{
Alexander Duyck5405afd2014-12-31 10:57:08 -0800902 /* if this is a new leaf then tn will be NULL and we can sort
903 * out parent suffix lengths as a part of trie_rebalance
904 */
905 while (tn && (tn->slen < l->slen)) {
906 tn->slen = l->slen;
907 tn = node_parent(tn);
908 }
909}
910
Robert Olsson2373ce12005-08-25 13:01:29 -0700911/* rcu_read_lock needs to be hold by caller from readside */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800912static struct key_vector *fib_find_node(struct trie *t,
913 struct key_vector **tp, u32 key)
Robert Olsson19baf832005-06-21 12:43:18 -0700914{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800915 struct key_vector *pn = NULL, *n = rcu_dereference_rtnl(t->tnode[0]);
Robert Olsson19baf832005-06-21 12:43:18 -0700916
Alexander Duyck939afb02014-12-31 10:56:00 -0800917 while (n) {
918 unsigned long index = get_index(key, n);
919
920 /* This bit of code is a bit tricky but it combines multiple
921 * checks into a single check. The prefix consists of the
922 * prefix plus zeros for the bits in the cindex. The index
923 * is the difference between the key and this value. From
924 * this we can actually derive several pieces of data.
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800925 * if (index >= (1ul << bits))
Alexander Duyck939afb02014-12-31 10:56:00 -0800926 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -0800927 * else
928 * we know the value is cindex
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800929 *
930 * This check is safe even if bits == KEYLENGTH due to the
931 * fact that we can only allocate a node with 32 bits if a
932 * long is greater than 32 bits.
Alexander Duyck939afb02014-12-31 10:56:00 -0800933 */
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800934 if (index >= (1ul << n->bits)) {
935 n = NULL;
936 break;
937 }
Alexander Duyck939afb02014-12-31 10:56:00 -0800938
939 /* we have found a leaf. Prefixes have already been compared */
940 if (IS_LEAF(n))
Robert Olsson19baf832005-06-21 12:43:18 -0700941 break;
Alexander Duyck939afb02014-12-31 10:56:00 -0800942
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800943 pn = n;
Alexander Duyck754baf82015-03-06 09:54:14 -0800944 n = get_child_rcu(n, index);
Robert Olsson19baf832005-06-21 12:43:18 -0700945 }
Robert Olsson19baf832005-06-21 12:43:18 -0700946
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800947 *tp = pn;
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800948
Alexander Duyck939afb02014-12-31 10:56:00 -0800949 return n;
Robert Olsson19baf832005-06-21 12:43:18 -0700950}
951
Alexander Duyck02525362015-01-22 15:51:39 -0800952/* Return the first fib alias matching TOS with
953 * priority less than or equal to PRIO.
954 */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800955static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen,
956 u8 tos, u32 prio)
Alexander Duyck02525362015-01-22 15:51:39 -0800957{
958 struct fib_alias *fa;
959
960 if (!fah)
961 return NULL;
962
Alexander Duyck56315f92015-02-25 15:31:31 -0800963 hlist_for_each_entry(fa, fah, fa_list) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800964 if (fa->fa_slen < slen)
965 continue;
966 if (fa->fa_slen != slen)
967 break;
Alexander Duyck02525362015-01-22 15:51:39 -0800968 if (fa->fa_tos > tos)
969 continue;
970 if (fa->fa_info->fib_priority >= prio || fa->fa_tos < tos)
971 return fa;
972 }
973
974 return NULL;
975}
976
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800977static void trie_rebalance(struct trie *t, struct key_vector *tn)
Robert Olsson19baf832005-06-21 12:43:18 -0700978{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800979 struct key_vector __rcu **cptr = t->tnode;
Robert Olsson19baf832005-06-21 12:43:18 -0700980
Alexander Duyckd5d64872015-03-04 15:02:18 -0800981 while (tn) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800982 struct key_vector *tp = node_parent(tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800983
984 cptr = resize(t, tn);
985 if (!tp)
986 break;
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800987 tn = container_of(cptr, struct key_vector, tnode[0]);
Robert Olsson19baf832005-06-21 12:43:18 -0700988 }
Robert Olsson19baf832005-06-21 12:43:18 -0700989}
990
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800991static int fib_insert_node(struct trie *t, struct key_vector *tp,
Alexander Duyckd5d64872015-03-04 15:02:18 -0800992 struct fib_alias *new, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -0700993{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800994 struct key_vector *n, *l;
Alexander Duyck836a0122014-12-31 10:56:06 -0800995
Alexander Duyckd5d64872015-03-04 15:02:18 -0800996 l = leaf_new(key, new);
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800997 if (!l)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800998 goto noleaf;
Alexander Duyckd5d64872015-03-04 15:02:18 -0800999
1000 /* retrieve child from parent node */
1001 if (tp)
Alexander Duyck754baf82015-03-06 09:54:14 -08001002 n = get_child(tp, get_index(key, tp));
Alexander Duyckd5d64872015-03-04 15:02:18 -08001003 else
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001004 n = rcu_dereference_rtnl(t->tnode[0]);
Alexander Duyck836a0122014-12-31 10:56:06 -08001005
1006 /* Case 2: n is a LEAF or a TNODE and the key doesn't match.
1007 *
1008 * Add a new tnode here
1009 * first tnode need some special handling
1010 * leaves us in position for handling as case 3
1011 */
1012 if (n) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001013 struct key_vector *tn;
Alexander Duyck836a0122014-12-31 10:56:06 -08001014
Alexander Duycke9b44012014-12-31 10:56:12 -08001015 tn = tnode_new(key, __fls(key ^ n->key), 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001016 if (!tn)
1017 goto notnode;
Olof Johansson91b9a272005-08-09 20:24:39 -07001018
Alexander Duyck836a0122014-12-31 10:56:06 -08001019 /* initialize routes out of node */
1020 NODE_INIT_PARENT(tn, tp);
1021 put_child(tn, get_index(key, tn) ^ 1, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001022
Alexander Duyck836a0122014-12-31 10:56:06 -08001023 /* start adding routes into the node */
1024 put_child_root(tp, t, key, tn);
1025 node_set_parent(n, tn);
Robert Olsson19baf832005-06-21 12:43:18 -07001026
Alexander Duyck836a0122014-12-31 10:56:06 -08001027 /* parent now has a NULL spot where the leaf can go */
Alexander Duycke962f302014-12-10 21:49:22 -08001028 tp = tn;
Robert Olsson19baf832005-06-21 12:43:18 -07001029 }
Olof Johansson91b9a272005-08-09 20:24:39 -07001030
Alexander Duyck836a0122014-12-31 10:56:06 -08001031 /* Case 3: n is NULL, and will just insert a new leaf */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001032 NODE_INIT_PARENT(l, tp);
1033 put_child_root(tp, t, key, l);
1034 trie_rebalance(t, tp);
Olof Johansson91b9a272005-08-09 20:24:39 -07001035
Alexander Duyckd5d64872015-03-04 15:02:18 -08001036 return 0;
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001037notnode:
1038 node_free(l);
1039noleaf:
1040 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07001041}
1042
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001043static int fib_insert_alias(struct trie *t, struct key_vector *tp,
1044 struct key_vector *l, struct fib_alias *new,
Alexander Duyckd5d64872015-03-04 15:02:18 -08001045 struct fib_alias *fa, t_key key)
1046{
1047 if (!l)
1048 return fib_insert_node(t, tp, new, key);
1049
1050 if (fa) {
1051 hlist_add_before_rcu(&new->fa_list, &fa->fa_list);
1052 } else {
1053 struct fib_alias *last;
1054
1055 hlist_for_each_entry(last, &l->leaf, fa_list) {
1056 if (new->fa_slen < last->fa_slen)
1057 break;
1058 fa = last;
1059 }
1060
1061 if (fa)
1062 hlist_add_behind_rcu(&new->fa_list, &fa->fa_list);
1063 else
1064 hlist_add_head_rcu(&new->fa_list, &l->leaf);
1065 }
1066
1067 /* if we added to the tail node then we need to update slen */
1068 if (l->slen < new->fa_slen) {
1069 l->slen = new->fa_slen;
1070 leaf_push_suffix(tp, l);
1071 }
1072
1073 return 0;
1074}
1075
1076/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001077int fib_table_insert(struct fib_table *tb, struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001078{
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001079 struct trie *t = (struct trie *)tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001080 struct fib_alias *fa, *new_fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001081 struct key_vector *l, *tp;
Robert Olsson19baf832005-06-21 12:43:18 -07001082 struct fib_info *fi;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001083 u8 plen = cfg->fc_dst_len;
1084 u8 slen = KEYLENGTH - plen;
Thomas Graf4e902c52006-08-17 18:14:52 -07001085 u8 tos = cfg->fc_tos;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001086 u32 key;
Robert Olsson19baf832005-06-21 12:43:18 -07001087 int err;
Robert Olsson19baf832005-06-21 12:43:18 -07001088
Alexander Duyck5786ec62015-02-25 15:31:37 -08001089 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001090 return -EINVAL;
1091
Thomas Graf4e902c52006-08-17 18:14:52 -07001092 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001093
Patrick McHardy2dfe55b2006-08-10 23:08:33 -07001094 pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen);
Robert Olsson19baf832005-06-21 12:43:18 -07001095
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001096 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001097 return -EINVAL;
1098
Thomas Graf4e902c52006-08-17 18:14:52 -07001099 fi = fib_create_info(cfg);
1100 if (IS_ERR(fi)) {
1101 err = PTR_ERR(fi);
Robert Olsson19baf832005-06-21 12:43:18 -07001102 goto err;
Thomas Graf4e902c52006-08-17 18:14:52 -07001103 }
Robert Olsson19baf832005-06-21 12:43:18 -07001104
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001105 l = fib_find_node(t, &tp, key);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001106 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority) : NULL;
Robert Olsson19baf832005-06-21 12:43:18 -07001107
1108 /* Now fa, if non-NULL, points to the first fib alias
1109 * with the same keys [prefix,tos,priority], if such key already
1110 * exists or to the node before which we will insert new one.
1111 *
1112 * If fa is NULL, we will need to allocate a new one and
Alexander Duyck56315f92015-02-25 15:31:31 -08001113 * insert to the tail of the section matching the suffix length
1114 * of the new alias.
Robert Olsson19baf832005-06-21 12:43:18 -07001115 */
1116
Julian Anastasov936f6f82008-01-28 21:18:06 -08001117 if (fa && fa->fa_tos == tos &&
1118 fa->fa_info->fib_priority == fi->fib_priority) {
1119 struct fib_alias *fa_first, *fa_match;
Robert Olsson19baf832005-06-21 12:43:18 -07001120
1121 err = -EEXIST;
Thomas Graf4e902c52006-08-17 18:14:52 -07001122 if (cfg->fc_nlflags & NLM_F_EXCL)
Robert Olsson19baf832005-06-21 12:43:18 -07001123 goto out;
1124
Julian Anastasov936f6f82008-01-28 21:18:06 -08001125 /* We have 2 goals:
1126 * 1. Find exact match for type, scope, fib_info to avoid
1127 * duplicate routes
1128 * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it
1129 */
1130 fa_match = NULL;
1131 fa_first = fa;
Alexander Duyck56315f92015-02-25 15:31:31 -08001132 hlist_for_each_entry_from(fa, fa_list) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001133 if ((fa->fa_slen != slen) || (fa->fa_tos != tos))
Julian Anastasov936f6f82008-01-28 21:18:06 -08001134 break;
1135 if (fa->fa_info->fib_priority != fi->fib_priority)
1136 break;
1137 if (fa->fa_type == cfg->fc_type &&
Julian Anastasov936f6f82008-01-28 21:18:06 -08001138 fa->fa_info == fi) {
1139 fa_match = fa;
1140 break;
1141 }
1142 }
1143
Thomas Graf4e902c52006-08-17 18:14:52 -07001144 if (cfg->fc_nlflags & NLM_F_REPLACE) {
Robert Olsson19baf832005-06-21 12:43:18 -07001145 struct fib_info *fi_drop;
1146 u8 state;
1147
Julian Anastasov936f6f82008-01-28 21:18:06 -08001148 fa = fa_first;
1149 if (fa_match) {
1150 if (fa == fa_match)
1151 err = 0;
Joonwoo Park67250332008-01-18 03:45:18 -08001152 goto out;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001153 }
Robert Olsson2373ce12005-08-25 13:01:29 -07001154 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001155 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Robert Olsson2373ce12005-08-25 13:01:29 -07001156 if (new_fa == NULL)
1157 goto out;
Robert Olsson19baf832005-06-21 12:43:18 -07001158
1159 fi_drop = fa->fa_info;
Robert Olsson2373ce12005-08-25 13:01:29 -07001160 new_fa->fa_tos = fa->fa_tos;
1161 new_fa->fa_info = fi;
Thomas Graf4e902c52006-08-17 18:14:52 -07001162 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001163 state = fa->fa_state;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001164 new_fa->fa_state = state & ~FA_S_ACCESSED;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001165 new_fa->fa_slen = fa->fa_slen;
Robert Olsson19baf832005-06-21 12:43:18 -07001166
Scott Feldman8e05fd72015-03-05 21:21:19 -08001167 err = netdev_switch_fib_ipv4_add(key, plen, fi,
1168 new_fa->fa_tos,
1169 cfg->fc_type,
1170 tb->tb_id);
1171 if (err) {
1172 netdev_switch_fib_ipv4_abort(fi);
1173 kmem_cache_free(fn_alias_kmem, new_fa);
1174 goto out;
1175 }
1176
Alexander Duyck56315f92015-02-25 15:31:31 -08001177 hlist_replace_rcu(&fa->fa_list, &new_fa->fa_list);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001178
Robert Olsson2373ce12005-08-25 13:01:29 -07001179 alias_free_mem_rcu(fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001180
1181 fib_release_info(fi_drop);
1182 if (state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001183 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Milan Kocianb8f55832007-05-23 14:55:06 -07001184 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen,
1185 tb->tb_id, &cfg->fc_nlinfo, NLM_F_REPLACE);
Robert Olsson19baf832005-06-21 12:43:18 -07001186
Olof Johansson91b9a272005-08-09 20:24:39 -07001187 goto succeeded;
Robert Olsson19baf832005-06-21 12:43:18 -07001188 }
1189 /* Error if we find a perfect match which
1190 * uses the same scope, type, and nexthop
1191 * information.
1192 */
Julian Anastasov936f6f82008-01-28 21:18:06 -08001193 if (fa_match)
1194 goto out;
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001195
Thomas Graf4e902c52006-08-17 18:14:52 -07001196 if (!(cfg->fc_nlflags & NLM_F_APPEND))
Julian Anastasov936f6f82008-01-28 21:18:06 -08001197 fa = fa_first;
Robert Olsson19baf832005-06-21 12:43:18 -07001198 }
1199 err = -ENOENT;
Thomas Graf4e902c52006-08-17 18:14:52 -07001200 if (!(cfg->fc_nlflags & NLM_F_CREATE))
Robert Olsson19baf832005-06-21 12:43:18 -07001201 goto out;
1202
1203 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001204 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Robert Olsson19baf832005-06-21 12:43:18 -07001205 if (new_fa == NULL)
1206 goto out;
1207
1208 new_fa->fa_info = fi;
1209 new_fa->fa_tos = tos;
Thomas Graf4e902c52006-08-17 18:14:52 -07001210 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001211 new_fa->fa_state = 0;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001212 new_fa->fa_slen = slen;
Robert Olsson19baf832005-06-21 12:43:18 -07001213
Scott Feldman8e05fd72015-03-05 21:21:19 -08001214 /* (Optionally) offload fib entry to switch hardware. */
1215 err = netdev_switch_fib_ipv4_add(key, plen, fi, tos,
1216 cfg->fc_type, tb->tb_id);
1217 if (err) {
1218 netdev_switch_fib_ipv4_abort(fi);
1219 goto out_free_new_fa;
1220 }
1221
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001222 /* Insert new entry to the list. */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001223 err = fib_insert_alias(t, tp, l, new_fa, fa, key);
1224 if (err)
Scott Feldman8e05fd72015-03-05 21:21:19 -08001225 goto out_sw_fib_del;
Robert Olsson19baf832005-06-21 12:43:18 -07001226
David S. Miller21d8c492011-04-14 14:49:37 -07001227 if (!plen)
1228 tb->tb_num_default++;
1229
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001230 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Thomas Graf4e902c52006-08-17 18:14:52 -07001231 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, tb->tb_id,
Milan Kocianb8f55832007-05-23 14:55:06 -07001232 &cfg->fc_nlinfo, 0);
Robert Olsson19baf832005-06-21 12:43:18 -07001233succeeded:
1234 return 0;
Robert Olssonf835e472005-06-28 15:00:39 -07001235
Scott Feldman8e05fd72015-03-05 21:21:19 -08001236out_sw_fib_del:
1237 netdev_switch_fib_ipv4_del(key, plen, fi, tos, cfg->fc_type, tb->tb_id);
Robert Olssonf835e472005-06-28 15:00:39 -07001238out_free_new_fa:
1239 kmem_cache_free(fn_alias_kmem, new_fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001240out:
1241 fib_release_info(fi);
Olof Johansson91b9a272005-08-09 20:24:39 -07001242err:
Robert Olsson19baf832005-06-21 12:43:18 -07001243 return err;
1244}
1245
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001246static inline t_key prefix_mismatch(t_key key, struct key_vector *n)
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001247{
1248 t_key prefix = n->key;
1249
1250 return (key ^ prefix) & (prefix | -prefix);
1251}
1252
Alexander Duyck345e9b52014-12-31 10:56:24 -08001253/* should be called with rcu_read_lock */
David S. Miller22bd5b92011-03-11 19:54:08 -05001254int fib_table_lookup(struct fib_table *tb, const struct flowi4 *flp,
Eric Dumazetebc0ffa2010-10-05 10:41:36 +00001255 struct fib_result *res, int fib_flags)
Robert Olsson19baf832005-06-21 12:43:18 -07001256{
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001257 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck8274a972014-12-31 10:55:29 -08001258#ifdef CONFIG_IP_FIB_TRIE_STATS
1259 struct trie_use_stats __percpu *stats = t->stats;
1260#endif
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001261 const t_key key = ntohl(flp->daddr);
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001262 struct key_vector *n, *pn;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001263 struct fib_alias *fa;
Alexander Duyck71e8b672015-03-04 15:04:03 -08001264 unsigned long index;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001265 t_key cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001266
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001267 n = rcu_dereference(t->tnode[0]);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001268 if (!n)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001269 return -EAGAIN;
Robert Olsson19baf832005-06-21 12:43:18 -07001270
1271#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08001272 this_cpu_inc(stats->gets);
Robert Olsson19baf832005-06-21 12:43:18 -07001273#endif
1274
Alexander Duyckadaf9812014-12-31 10:55:47 -08001275 pn = n;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001276 cindex = 0;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001277
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001278 /* Step 1: Travel to the longest prefix match in the trie */
1279 for (;;) {
Alexander Duyck71e8b672015-03-04 15:04:03 -08001280 index = get_index(key, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001281
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001282 /* This bit of code is a bit tricky but it combines multiple
1283 * checks into a single check. The prefix consists of the
1284 * prefix plus zeros for the "bits" in the prefix. The index
1285 * is the difference between the key and this value. From
1286 * this we can actually derive several pieces of data.
Alexander Duyck71e8b672015-03-04 15:04:03 -08001287 * if (index >= (1ul << bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001288 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -08001289 * else
1290 * we know the value is cindex
Alexander Duyck71e8b672015-03-04 15:04:03 -08001291 *
1292 * This check is safe even if bits == KEYLENGTH due to the
1293 * fact that we can only allocate a node with 32 bits if a
1294 * long is greater than 32 bits.
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001295 */
Alexander Duyck71e8b672015-03-04 15:04:03 -08001296 if (index >= (1ul << n->bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001297 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001298
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001299 /* we have found a leaf. Prefixes have already been compared */
1300 if (IS_LEAF(n))
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001301 goto found;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001302
1303 /* only record pn and cindex if we are going to be chopping
1304 * bits later. Otherwise we are just wasting cycles.
1305 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001306 if (n->slen > n->pos) {
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001307 pn = n;
1308 cindex = index;
Olof Johansson91b9a272005-08-09 20:24:39 -07001309 }
1310
Alexander Duyck754baf82015-03-06 09:54:14 -08001311 n = get_child_rcu(n, index);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001312 if (unlikely(!n))
Robert Olsson19baf832005-06-21 12:43:18 -07001313 goto backtrace;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001314 }
1315
1316 /* Step 2: Sort out leaves and begin backtracing for longest prefix */
1317 for (;;) {
1318 /* record the pointer where our next node pointer is stored */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001319 struct key_vector __rcu **cptr = n->tnode;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001320
1321 /* This test verifies that none of the bits that differ
1322 * between the key and the prefix exist in the region of
1323 * the lsb and higher in the prefix.
1324 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001325 if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001326 goto backtrace;
1327
1328 /* exit out and process leaf */
1329 if (unlikely(IS_LEAF(n)))
1330 break;
1331
1332 /* Don't bother recording parent info. Since we are in
1333 * prefix match mode we will have to come back to wherever
1334 * we started this traversal anyway
1335 */
1336
1337 while ((n = rcu_dereference(*cptr)) == NULL) {
1338backtrace:
1339#ifdef CONFIG_IP_FIB_TRIE_STATS
1340 if (!n)
1341 this_cpu_inc(stats->null_node_hit);
1342#endif
1343 /* If we are at cindex 0 there are no more bits for
1344 * us to strip at this level so we must ascend back
1345 * up one level to see if there are any more bits to
1346 * be stripped there.
1347 */
1348 while (!cindex) {
1349 t_key pkey = pn->key;
1350
1351 pn = node_parent_rcu(pn);
1352 if (unlikely(!pn))
Alexander Duyck345e9b52014-12-31 10:56:24 -08001353 return -EAGAIN;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001354#ifdef CONFIG_IP_FIB_TRIE_STATS
1355 this_cpu_inc(stats->backtrack);
1356#endif
1357 /* Get Child's index */
1358 cindex = get_index(pkey, pn);
1359 }
1360
1361 /* strip the least significant bit from the cindex */
1362 cindex &= cindex - 1;
1363
1364 /* grab pointer for next child node */
Alexander Duyck41b489f2015-03-04 15:02:33 -08001365 cptr = &pn->tnode[cindex];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001366 }
Robert Olsson19baf832005-06-21 12:43:18 -07001367 }
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001368
Robert Olsson19baf832005-06-21 12:43:18 -07001369found:
Alexander Duyck71e8b672015-03-04 15:04:03 -08001370 /* this line carries forward the xor from earlier in the function */
1371 index = key ^ n->key;
1372
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001373 /* Step 3: Process the leaf, if that fails fall back to backtracing */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001374 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
1375 struct fib_info *fi = fa->fa_info;
1376 int nhsel, err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001377
Alexander Duyck71e8b672015-03-04 15:04:03 -08001378 if ((index >= (1ul << fa->fa_slen)) &&
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001379 ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen != KEYLENGTH)))
Alexander Duyck71e8b672015-03-04 15:04:03 -08001380 continue;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001381 if (fa->fa_tos && fa->fa_tos != flp->flowi4_tos)
1382 continue;
1383 if (fi->fib_dead)
1384 continue;
1385 if (fa->fa_info->fib_scope < flp->flowi4_scope)
1386 continue;
1387 fib_alias_accessed(fa);
1388 err = fib_props[fa->fa_type].error;
1389 if (unlikely(err < 0)) {
Alexander Duyck345e9b52014-12-31 10:56:24 -08001390#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001391 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001392#endif
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001393 return err;
1394 }
1395 if (fi->fib_flags & RTNH_F_DEAD)
1396 continue;
1397 for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) {
1398 const struct fib_nh *nh = &fi->fib_nh[nhsel];
1399
1400 if (nh->nh_flags & RTNH_F_DEAD)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001401 continue;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001402 if (flp->flowi4_oif && flp->flowi4_oif != nh->nh_oif)
1403 continue;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001404
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001405 if (!(fib_flags & FIB_LOOKUP_NOREF))
1406 atomic_inc(&fi->fib_clntref);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001407
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001408 res->prefixlen = KEYLENGTH - fa->fa_slen;
1409 res->nh_sel = nhsel;
1410 res->type = fa->fa_type;
1411 res->scope = fi->fib_scope;
1412 res->fi = fi;
1413 res->table = tb;
1414 res->fa_head = &n->leaf;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001415#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001416 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001417#endif
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001418 return err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001419 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001420 }
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001421#ifdef CONFIG_IP_FIB_TRIE_STATS
1422 this_cpu_inc(stats->semantic_match_miss);
1423#endif
Alexander Duyck345e9b52014-12-31 10:56:24 -08001424 goto backtrace;
Robert Olsson19baf832005-06-21 12:43:18 -07001425}
Florian Westphal6fc01432011-08-25 13:46:12 +02001426EXPORT_SYMBOL_GPL(fib_table_lookup);
Robert Olsson19baf832005-06-21 12:43:18 -07001427
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001428static void fib_remove_alias(struct trie *t, struct key_vector *tp,
1429 struct key_vector *l, struct fib_alias *old)
Alexander Duyckd5d64872015-03-04 15:02:18 -08001430{
1431 /* record the location of the previous list_info entry */
1432 struct hlist_node **pprev = old->fa_list.pprev;
1433 struct fib_alias *fa = hlist_entry(pprev, typeof(*fa), fa_list.next);
1434
1435 /* remove the fib_alias from the list */
1436 hlist_del_rcu(&old->fa_list);
1437
1438 /* if we emptied the list this leaf will be freed and we can sort
1439 * out parent suffix lengths as a part of trie_rebalance
1440 */
1441 if (hlist_empty(&l->leaf)) {
1442 put_child_root(tp, t, l->key, NULL);
1443 node_free(l);
1444 trie_rebalance(t, tp);
1445 return;
1446 }
1447
1448 /* only access fa if it is pointing at the last valid hlist_node */
1449 if (*pprev)
1450 return;
1451
1452 /* update the trie with the latest suffix length */
1453 l->slen = fa->fa_slen;
1454 leaf_pull_suffix(tp, l);
1455}
1456
1457/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001458int fib_table_delete(struct fib_table *tb, struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001459{
1460 struct trie *t = (struct trie *) tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001461 struct fib_alias *fa, *fa_to_delete;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001462 struct key_vector *l, *tp;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001463 u8 plen = cfg->fc_dst_len;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001464 u8 slen = KEYLENGTH - plen;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001465 u8 tos = cfg->fc_tos;
1466 u32 key;
Olof Johansson91b9a272005-08-09 20:24:39 -07001467
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001468 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001469 return -EINVAL;
1470
Thomas Graf4e902c52006-08-17 18:14:52 -07001471 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001472
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001473 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001474 return -EINVAL;
1475
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001476 l = fib_find_node(t, &tp, key);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001477 if (!l)
Robert Olsson19baf832005-06-21 12:43:18 -07001478 return -ESRCH;
1479
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001480 fa = fib_find_alias(&l->leaf, slen, tos, 0);
Robert Olsson19baf832005-06-21 12:43:18 -07001481 if (!fa)
1482 return -ESRCH;
1483
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001484 pr_debug("Deleting %08x/%d tos=%d t=%p\n", key, plen, tos, t);
Robert Olsson19baf832005-06-21 12:43:18 -07001485
1486 fa_to_delete = NULL;
Alexander Duyck56315f92015-02-25 15:31:31 -08001487 hlist_for_each_entry_from(fa, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001488 struct fib_info *fi = fa->fa_info;
1489
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001490 if ((fa->fa_slen != slen) || (fa->fa_tos != tos))
Robert Olsson19baf832005-06-21 12:43:18 -07001491 break;
1492
Thomas Graf4e902c52006-08-17 18:14:52 -07001493 if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) &&
1494 (cfg->fc_scope == RT_SCOPE_NOWHERE ||
David S. Miller37e826c2011-03-24 18:06:47 -07001495 fa->fa_info->fib_scope == cfg->fc_scope) &&
Julian Anastasov74cb3c12011-03-19 12:13:46 +00001496 (!cfg->fc_prefsrc ||
1497 fi->fib_prefsrc == cfg->fc_prefsrc) &&
Thomas Graf4e902c52006-08-17 18:14:52 -07001498 (!cfg->fc_protocol ||
1499 fi->fib_protocol == cfg->fc_protocol) &&
1500 fib_nh_match(cfg, fi) == 0) {
Robert Olsson19baf832005-06-21 12:43:18 -07001501 fa_to_delete = fa;
1502 break;
1503 }
1504 }
1505
Olof Johansson91b9a272005-08-09 20:24:39 -07001506 if (!fa_to_delete)
1507 return -ESRCH;
Robert Olsson19baf832005-06-21 12:43:18 -07001508
Scott Feldman8e05fd72015-03-05 21:21:19 -08001509 netdev_switch_fib_ipv4_del(key, plen, fa_to_delete->fa_info, tos,
1510 cfg->fc_type, tb->tb_id);
1511
Alexander Duyckd5d64872015-03-04 15:02:18 -08001512 rtmsg_fib(RTM_DELROUTE, htonl(key), fa_to_delete, plen, tb->tb_id,
Milan Kocianb8f55832007-05-23 14:55:06 -07001513 &cfg->fc_nlinfo, 0);
Robert Olsson19baf832005-06-21 12:43:18 -07001514
David S. Miller21d8c492011-04-14 14:49:37 -07001515 if (!plen)
1516 tb->tb_num_default--;
1517
Alexander Duyckd5d64872015-03-04 15:02:18 -08001518 fib_remove_alias(t, tp, l, fa_to_delete);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001519
Alexander Duyckd5d64872015-03-04 15:02:18 -08001520 if (fa_to_delete->fa_state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001521 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Olof Johansson91b9a272005-08-09 20:24:39 -07001522
Alexander Duyckd5d64872015-03-04 15:02:18 -08001523 fib_release_info(fa_to_delete->fa_info);
1524 alias_free_mem_rcu(fa_to_delete);
Olof Johansson91b9a272005-08-09 20:24:39 -07001525 return 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001526}
1527
Alexander Duyck8be33e92015-03-04 14:59:19 -08001528/* Scan for the next leaf starting at the provided key value */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001529static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -07001530{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001531 struct key_vector *pn, *n = *tn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001532 unsigned long cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001533
Alexander Duyck8be33e92015-03-04 14:59:19 -08001534 /* record parent node for backtracing */
1535 pn = n;
1536 cindex = n ? get_index(key, n) : 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001537
Alexander Duyck8be33e92015-03-04 14:59:19 -08001538 /* this loop is meant to try and find the key in the trie */
1539 while (n) {
1540 unsigned long idx = get_index(key, n);
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001541
Alexander Duyck8be33e92015-03-04 14:59:19 -08001542 /* guarantee forward progress on the keys */
1543 if (IS_LEAF(n) && (n->key >= key))
1544 goto found;
1545 if (idx >= (1ul << n->bits))
1546 break;
1547
1548 /* record parent and next child index */
1549 pn = n;
1550 cindex = idx;
1551
1552 /* descend into the next child */
Alexander Duyck754baf82015-03-06 09:54:14 -08001553 n = get_child_rcu(pn, cindex++);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001554 }
1555
1556 /* this loop will search for the next leaf with a greater key */
1557 while (pn) {
1558 /* if we exhausted the parent node we will need to climb */
1559 if (cindex >= (1ul << pn->bits)) {
1560 t_key pkey = pn->key;
1561
1562 pn = node_parent_rcu(pn);
1563 if (!pn)
1564 break;
1565
1566 cindex = get_index(pkey, pn) + 1;
1567 continue;
Robert Olsson19baf832005-06-21 12:43:18 -07001568 }
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001569
Alexander Duyck8be33e92015-03-04 14:59:19 -08001570 /* grab the next available node */
Alexander Duyck754baf82015-03-06 09:54:14 -08001571 n = get_child_rcu(pn, cindex++);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001572 if (!n)
1573 continue;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001574
Alexander Duyck8be33e92015-03-04 14:59:19 -08001575 /* no need to compare keys since we bumped the index */
1576 if (IS_LEAF(n))
1577 goto found;
1578
1579 /* Rescan start scanning in new node */
1580 pn = n;
1581 cindex = 0;
1582 }
1583
1584 *tn = pn;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001585 return NULL; /* Root of trie */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001586found:
1587 /* if we are at the limit for keys just return NULL for the tnode */
1588 *tn = (n->key == KEY_MAX) ? NULL : pn;
1589 return n;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001590}
1591
Scott Feldman104616e2015-03-05 21:21:16 -08001592/* Caller must hold RTNL */
1593void fib_table_flush_external(struct fib_table *tb)
1594{
1595 struct trie *t = (struct trie *)tb->tb_data;
1596 struct fib_alias *fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001597 struct key_vector *n, *pn;
Scott Feldman104616e2015-03-05 21:21:16 -08001598 unsigned long cindex;
Scott Feldman104616e2015-03-05 21:21:16 -08001599
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001600 n = rcu_dereference(t->tnode[0]);
Scott Feldman104616e2015-03-05 21:21:16 -08001601 if (!n)
1602 return;
1603
1604 pn = NULL;
1605 cindex = 0;
1606
1607 while (IS_TNODE(n)) {
1608 /* record pn and cindex for leaf walking */
1609 pn = n;
1610 cindex = 1ul << n->bits;
1611backtrace:
1612 /* walk trie in reverse order */
1613 do {
1614 while (!(cindex--)) {
1615 t_key pkey = pn->key;
1616
Scott Feldman104616e2015-03-05 21:21:16 -08001617 /* if we got the root we are done */
Alexander Duyck72be7262015-03-06 09:53:56 -08001618 pn = node_parent(pn);
Scott Feldman104616e2015-03-05 21:21:16 -08001619 if (!pn)
1620 return;
1621
1622 cindex = get_index(pkey, pn);
1623 }
1624
1625 /* grab the next available node */
Alexander Duyck754baf82015-03-06 09:54:14 -08001626 n = get_child(pn, cindex);
Scott Feldman104616e2015-03-05 21:21:16 -08001627 } while (!n);
1628 }
1629
1630 hlist_for_each_entry(fa, &n->leaf, fa_list) {
1631 struct fib_info *fi = fa->fa_info;
1632
Alexander Duyck72be7262015-03-06 09:53:56 -08001633 if (!fi || !(fi->fib_flags & RTNH_F_EXTERNAL))
1634 continue;
1635
1636 netdev_switch_fib_ipv4_del(n->key,
1637 KEYLENGTH - fa->fa_slen,
1638 fi, fa->fa_tos,
1639 fa->fa_type, tb->tb_id);
Scott Feldman104616e2015-03-05 21:21:16 -08001640 }
1641
1642 /* if trie is leaf only loop is completed */
1643 if (pn)
1644 goto backtrace;
1645}
1646
Alexander Duyck8be33e92015-03-04 14:59:19 -08001647/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001648int fib_table_flush(struct fib_table *tb)
Robert Olsson19baf832005-06-21 12:43:18 -07001649{
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001650 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001651 struct key_vector *n, *pn;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001652 struct hlist_node *tmp;
1653 struct fib_alias *fa;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001654 unsigned long cindex;
1655 unsigned char slen;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001656 int found = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001657
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001658 n = rcu_dereference(t->tnode[0]);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001659 if (!n)
1660 goto flush_complete;
Robert Olsson19baf832005-06-21 12:43:18 -07001661
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001662 pn = NULL;
1663 cindex = 0;
1664
1665 while (IS_TNODE(n)) {
1666 /* record pn and cindex for leaf walking */
1667 pn = n;
1668 cindex = 1ul << n->bits;
1669backtrace:
1670 /* walk trie in reverse order */
1671 do {
1672 while (!(cindex--)) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001673 struct key_vector __rcu **cptr;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001674 t_key pkey = pn->key;
1675
1676 n = pn;
1677 pn = node_parent(n);
1678
1679 /* resize completed node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001680 cptr = resize(t, n);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001681
1682 /* if we got the root we are done */
1683 if (!pn)
1684 goto flush_complete;
1685
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001686 pn = container_of(cptr, struct key_vector,
1687 tnode[0]);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001688 cindex = get_index(pkey, pn);
1689 }
1690
1691 /* grab the next available node */
Alexander Duyck754baf82015-03-06 09:54:14 -08001692 n = get_child(pn, cindex);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001693 } while (!n);
1694 }
1695
1696 /* track slen in case any prefixes survive */
1697 slen = 0;
1698
1699 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1700 struct fib_info *fi = fa->fa_info;
1701
1702 if (fi && (fi->fib_flags & RTNH_F_DEAD)) {
Scott Feldman8e05fd72015-03-05 21:21:19 -08001703 netdev_switch_fib_ipv4_del(n->key,
1704 KEYLENGTH - fa->fa_slen,
1705 fi, fa->fa_tos,
1706 fa->fa_type, tb->tb_id);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001707 hlist_del_rcu(&fa->fa_list);
1708 fib_release_info(fa->fa_info);
1709 alias_free_mem_rcu(fa);
1710 found++;
1711
1712 continue;
Alexander Duyck64c62722015-01-22 15:51:45 -08001713 }
1714
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001715 slen = fa->fa_slen;
Robert Olsson19baf832005-06-21 12:43:18 -07001716 }
1717
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001718 /* update leaf slen */
1719 n->slen = slen;
1720
1721 if (hlist_empty(&n->leaf)) {
1722 put_child_root(pn, t, n->key, NULL);
1723 node_free(n);
1724 } else {
Alexander Duyckd5d64872015-03-04 15:02:18 -08001725 leaf_pull_suffix(pn, n);
Alexander Duyck64c62722015-01-22 15:51:45 -08001726 }
Robert Olsson19baf832005-06-21 12:43:18 -07001727
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001728 /* if trie is leaf only loop is completed */
1729 if (pn)
1730 goto backtrace;
1731flush_complete:
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001732 pr_debug("trie_flush found=%d\n", found);
Robert Olsson19baf832005-06-21 12:43:18 -07001733 return found;
1734}
1735
Alexander Duycka7e53532015-03-04 15:02:44 -08001736static void __trie_free_rcu(struct rcu_head *head)
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001737{
Alexander Duycka7e53532015-03-04 15:02:44 -08001738 struct fib_table *tb = container_of(head, struct fib_table, rcu);
Alexander Duyck8274a972014-12-31 10:55:29 -08001739#ifdef CONFIG_IP_FIB_TRIE_STATS
1740 struct trie *t = (struct trie *)tb->tb_data;
1741
1742 free_percpu(t->stats);
1743#endif /* CONFIG_IP_FIB_TRIE_STATS */
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001744 kfree(tb);
1745}
1746
Alexander Duycka7e53532015-03-04 15:02:44 -08001747void fib_free_table(struct fib_table *tb)
1748{
1749 call_rcu(&tb->rcu, __trie_free_rcu);
1750}
1751
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001752static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001753 struct sk_buff *skb, struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001754{
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001755 __be32 xkey = htonl(l->key);
Robert Olsson19baf832005-06-21 12:43:18 -07001756 struct fib_alias *fa;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001757 int i, s_i;
Robert Olsson19baf832005-06-21 12:43:18 -07001758
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001759 s_i = cb->args[4];
Robert Olsson19baf832005-06-21 12:43:18 -07001760 i = 0;
1761
Robert Olsson2373ce12005-08-25 13:01:29 -07001762 /* rcu_read_lock is hold by caller */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001763 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001764 if (i < s_i) {
1765 i++;
1766 continue;
1767 }
Robert Olsson19baf832005-06-21 12:43:18 -07001768
Eric W. Biederman15e47302012-09-07 20:12:54 +00001769 if (fib_dump_info(skb, NETLINK_CB(cb->skb).portid,
Robert Olsson19baf832005-06-21 12:43:18 -07001770 cb->nlh->nlmsg_seq,
1771 RTM_NEWROUTE,
1772 tb->tb_id,
1773 fa->fa_type,
Thomas Grafbe403ea2006-08-17 18:15:17 -07001774 xkey,
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001775 KEYLENGTH - fa->fa_slen,
Robert Olsson19baf832005-06-21 12:43:18 -07001776 fa->fa_tos,
Stephen Hemminger64347f72008-01-22 21:55:01 -08001777 fa->fa_info, NLM_F_MULTI) < 0) {
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001778 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001779 return -1;
1780 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001781 i++;
Robert Olsson19baf832005-06-21 12:43:18 -07001782 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001783
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001784 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001785 return skb->len;
1786}
1787
Alexander Duycka7e53532015-03-04 15:02:44 -08001788/* rcu_read_lock needs to be hold by caller from readside */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001789int fib_table_dump(struct fib_table *tb, struct sk_buff *skb,
1790 struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001791{
Alexander Duyck8be33e92015-03-04 14:59:19 -08001792 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001793 struct key_vector *l, *tp;
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001794 /* Dump starting at last key.
1795 * Note: 0.0.0.0/0 (ie default) is first key.
1796 */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001797 int count = cb->args[2];
1798 t_key key = cb->args[3];
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001799
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001800 tp = rcu_dereference_rtnl(t->tnode[0]);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001801
1802 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001803 if (fn_trie_dump_leaf(l, tb, skb, cb) < 0) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001804 cb->args[3] = key;
1805 cb->args[2] = count;
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001806 return -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001807 }
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001808
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001809 ++count;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001810 key = l->key + 1;
1811
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001812 memset(&cb->args[4], 0,
1813 sizeof(cb->args) - 4*sizeof(cb->args[0]));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001814
1815 /* stop loop if key wrapped back to 0 */
1816 if (key < l->key)
1817 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001818 }
Alexander Duyck8be33e92015-03-04 14:59:19 -08001819
Alexander Duyck8be33e92015-03-04 14:59:19 -08001820 cb->args[3] = key;
1821 cb->args[2] = count;
1822
Robert Olsson19baf832005-06-21 12:43:18 -07001823 return skb->len;
Robert Olsson19baf832005-06-21 12:43:18 -07001824}
1825
David S. Miller5348ba82011-02-01 15:30:56 -08001826void __init fib_trie_init(void)
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001827{
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001828 fn_alias_kmem = kmem_cache_create("ip_fib_alias",
1829 sizeof(struct fib_alias),
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08001830 0, SLAB_PANIC, NULL);
1831
1832 trie_leaf_kmem = kmem_cache_create("ip_fib_trie",
Alexander Duyck41b489f2015-03-04 15:02:33 -08001833 LEAF_SIZE,
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08001834 0, SLAB_PANIC, NULL);
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001835}
Robert Olsson19baf832005-06-21 12:43:18 -07001836
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001837
David S. Miller5348ba82011-02-01 15:30:56 -08001838struct fib_table *fib_trie_table(u32 id)
Robert Olsson19baf832005-06-21 12:43:18 -07001839{
1840 struct fib_table *tb;
1841 struct trie *t;
1842
Robert Olsson19baf832005-06-21 12:43:18 -07001843 tb = kmalloc(sizeof(struct fib_table) + sizeof(struct trie),
1844 GFP_KERNEL);
1845 if (tb == NULL)
1846 return NULL;
1847
1848 tb->tb_id = id;
Denis V. Lunev971b8932007-12-08 00:32:23 -08001849 tb->tb_default = -1;
David S. Miller21d8c492011-04-14 14:49:37 -07001850 tb->tb_num_default = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001851
1852 t = (struct trie *) tb->tb_data;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001853 RCU_INIT_POINTER(t->tnode[0], NULL);
Alexander Duyck8274a972014-12-31 10:55:29 -08001854#ifdef CONFIG_IP_FIB_TRIE_STATS
1855 t->stats = alloc_percpu(struct trie_use_stats);
1856 if (!t->stats) {
1857 kfree(tb);
1858 tb = NULL;
1859 }
1860#endif
Robert Olsson19baf832005-06-21 12:43:18 -07001861
Robert Olsson19baf832005-06-21 12:43:18 -07001862 return tb;
1863}
1864
Robert Olsson19baf832005-06-21 12:43:18 -07001865#ifdef CONFIG_PROC_FS
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001866/* Depth first Trie walk iterator */
1867struct fib_trie_iter {
Denis V. Lunev1c340b22008-01-10 03:27:17 -08001868 struct seq_net_private p;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07001869 struct fib_table *tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001870 struct key_vector *tnode;
Eric Dumazeta034ee32010-09-09 23:32:28 +00001871 unsigned int index;
1872 unsigned int depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001873};
Robert Olsson19baf832005-06-21 12:43:18 -07001874
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001875static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)
Robert Olsson19baf832005-06-21 12:43:18 -07001876{
Alexander Duyck98293e82014-12-31 10:56:18 -08001877 unsigned long cindex = iter->index;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001878 struct key_vector *tn = iter->tnode;
1879 struct key_vector *p;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001880
Eric W. Biederman6640e692007-01-24 14:42:04 -08001881 /* A single entry routing table */
1882 if (!tn)
1883 return NULL;
1884
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001885 pr_debug("get_next iter={node=%p index=%d depth=%d}\n",
1886 iter->tnode, iter->index, iter->depth);
1887rescan:
Alexander Duyck2e1ac882015-03-06 09:54:21 -08001888 while (cindex < child_length(tn)) {
Alexander Duyck754baf82015-03-06 09:54:14 -08001889 struct key_vector *n = get_child_rcu(tn, cindex);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001890
1891 if (n) {
1892 if (IS_LEAF(n)) {
1893 iter->tnode = tn;
1894 iter->index = cindex + 1;
1895 } else {
1896 /* push down one level */
Alexander Duyckadaf9812014-12-31 10:55:47 -08001897 iter->tnode = n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001898 iter->index = 0;
1899 ++iter->depth;
1900 }
1901 return n;
1902 }
1903
1904 ++cindex;
1905 }
1906
1907 /* Current node exhausted, pop back up */
Alexander Duyckadaf9812014-12-31 10:55:47 -08001908 p = node_parent_rcu(tn);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001909 if (p) {
Alexander Duycke9b44012014-12-31 10:56:12 -08001910 cindex = get_index(tn->key, p) + 1;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001911 tn = p;
1912 --iter->depth;
1913 goto rescan;
1914 }
1915
1916 /* got root? */
Robert Olsson19baf832005-06-21 12:43:18 -07001917 return NULL;
1918}
1919
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001920static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,
1921 struct trie *t)
Robert Olsson19baf832005-06-21 12:43:18 -07001922{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001923 struct key_vector *n;
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08001924
Stephen Hemminger132adf52007-03-08 20:44:43 -08001925 if (!t)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08001926 return NULL;
1927
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001928 n = rcu_dereference(t->tnode[0]);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07001929 if (!n)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08001930 return NULL;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001931
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07001932 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08001933 iter->tnode = n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07001934 iter->index = 0;
1935 iter->depth = 1;
1936 } else {
1937 iter->tnode = NULL;
1938 iter->index = 0;
1939 iter->depth = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001940 }
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07001941
1942 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07001943}
1944
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001945static void trie_collect_stats(struct trie *t, struct trie_stat *s)
Robert Olsson19baf832005-06-21 12:43:18 -07001946{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001947 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001948 struct fib_trie_iter iter;
Robert Olsson19baf832005-06-21 12:43:18 -07001949
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001950 memset(s, 0, sizeof(*s));
Robert Olsson19baf832005-06-21 12:43:18 -07001951
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001952 rcu_read_lock();
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07001953 for (n = fib_trie_get_first(&iter, t); n; n = fib_trie_get_next(&iter)) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001954 if (IS_LEAF(n)) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001955 struct fib_alias *fa;
Stephen Hemminger93672292008-01-22 21:54:05 -08001956
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001957 s->leaves++;
1958 s->totdepth += iter.depth;
1959 if (iter.depth > s->maxdepth)
1960 s->maxdepth = iter.depth;
Stephen Hemminger93672292008-01-22 21:54:05 -08001961
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001962 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list)
Stephen Hemminger93672292008-01-22 21:54:05 -08001963 ++s->prefixes;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001964 } else {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001965 s->tnodes++;
Alexander Duyckadaf9812014-12-31 10:55:47 -08001966 if (n->bits < MAX_STAT_DEPTH)
1967 s->nodesizes[n->bits]++;
Alexander Duyck30cfe7c2015-01-22 15:51:33 -08001968 s->nullpointers += n->empty_children;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001969 }
1970 }
1971 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07001972}
1973
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001974/*
Robert Olsson19baf832005-06-21 12:43:18 -07001975 * This outputs /proc/net/fib_triestats
Robert Olsson19baf832005-06-21 12:43:18 -07001976 */
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001977static void trie_show_stats(struct seq_file *seq, struct trie_stat *stat)
Robert Olsson19baf832005-06-21 12:43:18 -07001978{
Eric Dumazeta034ee32010-09-09 23:32:28 +00001979 unsigned int i, max, pointers, bytes, avdepth;
Robert Olsson19baf832005-06-21 12:43:18 -07001980
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001981 if (stat->leaves)
1982 avdepth = stat->totdepth*100 / stat->leaves;
1983 else
1984 avdepth = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001985
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001986 seq_printf(seq, "\tAver depth: %u.%02d\n",
1987 avdepth / 100, avdepth % 100);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001988 seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth);
Robert Olsson19baf832005-06-21 12:43:18 -07001989
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001990 seq_printf(seq, "\tLeaves: %u\n", stat->leaves);
Alexander Duyck41b489f2015-03-04 15:02:33 -08001991 bytes = LEAF_SIZE * stat->leaves;
Stephen Hemminger93672292008-01-22 21:54:05 -08001992
1993 seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001994 bytes += sizeof(struct fib_alias) * stat->prefixes;
Stephen Hemminger93672292008-01-22 21:54:05 -08001995
Stephen Hemminger187b5182008-01-12 20:55:55 -08001996 seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes);
Alexander Duyck41b489f2015-03-04 15:02:33 -08001997 bytes += TNODE_SIZE(0) * stat->tnodes;
Robert Olsson19baf832005-06-21 12:43:18 -07001998
Robert Olsson06ef9212006-03-20 21:35:01 -08001999 max = MAX_STAT_DEPTH;
2000 while (max > 0 && stat->nodesizes[max-1] == 0)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002001 max--;
Robert Olsson19baf832005-06-21 12:43:18 -07002002
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002003 pointers = 0;
Jerry Snitselaarf585a992013-07-22 12:01:58 -07002004 for (i = 1; i < max; i++)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002005 if (stat->nodesizes[i] != 0) {
Stephen Hemminger187b5182008-01-12 20:55:55 -08002006 seq_printf(seq, " %u: %u", i, stat->nodesizes[i]);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002007 pointers += (1<<i) * stat->nodesizes[i];
2008 }
2009 seq_putc(seq, '\n');
Stephen Hemminger187b5182008-01-12 20:55:55 -08002010 seq_printf(seq, "\tPointers: %u\n", pointers);
Robert Olsson19baf832005-06-21 12:43:18 -07002011
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002012 bytes += sizeof(struct key_vector *) * pointers;
Stephen Hemminger187b5182008-01-12 20:55:55 -08002013 seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers);
2014 seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024);
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002015}
Robert Olsson19baf832005-06-21 12:43:18 -07002016
2017#ifdef CONFIG_IP_FIB_TRIE_STATS
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002018static void trie_show_usage(struct seq_file *seq,
Alexander Duyck8274a972014-12-31 10:55:29 -08002019 const struct trie_use_stats __percpu *stats)
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002020{
Alexander Duyck8274a972014-12-31 10:55:29 -08002021 struct trie_use_stats s = { 0 };
2022 int cpu;
2023
2024 /* loop through all of the CPUs and gather up the stats */
2025 for_each_possible_cpu(cpu) {
2026 const struct trie_use_stats *pcpu = per_cpu_ptr(stats, cpu);
2027
2028 s.gets += pcpu->gets;
2029 s.backtrack += pcpu->backtrack;
2030 s.semantic_match_passed += pcpu->semantic_match_passed;
2031 s.semantic_match_miss += pcpu->semantic_match_miss;
2032 s.null_node_hit += pcpu->null_node_hit;
2033 s.resize_node_skipped += pcpu->resize_node_skipped;
2034 }
2035
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002036 seq_printf(seq, "\nCounters:\n---------\n");
Alexander Duyck8274a972014-12-31 10:55:29 -08002037 seq_printf(seq, "gets = %u\n", s.gets);
2038 seq_printf(seq, "backtracks = %u\n", s.backtrack);
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002039 seq_printf(seq, "semantic match passed = %u\n",
Alexander Duyck8274a972014-12-31 10:55:29 -08002040 s.semantic_match_passed);
2041 seq_printf(seq, "semantic match miss = %u\n", s.semantic_match_miss);
2042 seq_printf(seq, "null node hit= %u\n", s.null_node_hit);
2043 seq_printf(seq, "skipped node resize = %u\n\n", s.resize_node_skipped);
Robert Olsson19baf832005-06-21 12:43:18 -07002044}
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002045#endif /* CONFIG_IP_FIB_TRIE_STATS */
2046
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002047static void fib_table_print(struct seq_file *seq, struct fib_table *tb)
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002048{
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002049 if (tb->tb_id == RT_TABLE_LOCAL)
2050 seq_puts(seq, "Local:\n");
2051 else if (tb->tb_id == RT_TABLE_MAIN)
2052 seq_puts(seq, "Main:\n");
2053 else
2054 seq_printf(seq, "Id %d:\n", tb->tb_id);
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002055}
Robert Olsson19baf832005-06-21 12:43:18 -07002056
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002057
Robert Olsson19baf832005-06-21 12:43:18 -07002058static int fib_triestat_seq_show(struct seq_file *seq, void *v)
2059{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002060 struct net *net = (struct net *)seq->private;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002061 unsigned int h;
Eric W. Biederman877a9bf2007-12-07 00:47:47 -08002062
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002063 seq_printf(seq,
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002064 "Basic info: size of leaf:"
2065 " %Zd bytes, size of tnode: %Zd bytes.\n",
Alexander Duyck41b489f2015-03-04 15:02:33 -08002066 LEAF_SIZE, TNODE_SIZE(0));
Olof Johansson91b9a272005-08-09 20:24:39 -07002067
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002068 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2069 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002070 struct fib_table *tb;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002071
Sasha Levinb67bfe02013-02-27 17:06:00 -08002072 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002073 struct trie *t = (struct trie *) tb->tb_data;
2074 struct trie_stat stat;
2075
2076 if (!t)
2077 continue;
2078
2079 fib_table_print(seq, tb);
2080
2081 trie_collect_stats(t, &stat);
2082 trie_show_stats(seq, &stat);
2083#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08002084 trie_show_usage(seq, t->stats);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002085#endif
2086 }
2087 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002088
Robert Olsson19baf832005-06-21 12:43:18 -07002089 return 0;
2090}
2091
Robert Olsson19baf832005-06-21 12:43:18 -07002092static int fib_triestat_seq_open(struct inode *inode, struct file *file)
2093{
Pavel Emelyanovde05c552008-07-18 04:07:21 -07002094 return single_open_net(inode, file, fib_triestat_seq_show);
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002095}
2096
Arjan van de Ven9a321442007-02-12 00:55:35 -08002097static const struct file_operations fib_triestat_fops = {
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002098 .owner = THIS_MODULE,
2099 .open = fib_triestat_seq_open,
2100 .read = seq_read,
2101 .llseek = seq_lseek,
Pavel Emelyanovb6fcbdb2008-07-18 04:07:44 -07002102 .release = single_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002103};
2104
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002105static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)
Robert Olsson19baf832005-06-21 12:43:18 -07002106{
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002107 struct fib_trie_iter *iter = seq->private;
2108 struct net *net = seq_file_net(seq);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002109 loff_t idx = 0;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002110 unsigned int h;
Robert Olsson19baf832005-06-21 12:43:18 -07002111
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002112 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2113 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002114 struct fib_table *tb;
2115
Sasha Levinb67bfe02013-02-27 17:06:00 -08002116 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002117 struct key_vector *n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002118
2119 for (n = fib_trie_get_first(iter,
2120 (struct trie *) tb->tb_data);
2121 n; n = fib_trie_get_next(iter))
2122 if (pos == idx++) {
2123 iter->tb = tb;
2124 return n;
2125 }
2126 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002127 }
Robert Olsson19baf832005-06-21 12:43:18 -07002128
Robert Olsson19baf832005-06-21 12:43:18 -07002129 return NULL;
2130}
2131
2132static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002133 __acquires(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002134{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002135 rcu_read_lock();
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002136 return fib_trie_get_idx(seq, *pos);
Robert Olsson19baf832005-06-21 12:43:18 -07002137}
2138
2139static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2140{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002141 struct fib_trie_iter *iter = seq->private;
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002142 struct net *net = seq_file_net(seq);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002143 struct fib_table *tb = iter->tb;
2144 struct hlist_node *tb_node;
2145 unsigned int h;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002146 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002147
Robert Olsson19baf832005-06-21 12:43:18 -07002148 ++*pos;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002149 /* next node in same table */
2150 n = fib_trie_get_next(iter);
2151 if (n)
2152 return n;
Olof Johansson91b9a272005-08-09 20:24:39 -07002153
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002154 /* walk rest of this hash chain */
2155 h = tb->tb_id & (FIB_TABLE_HASHSZ - 1);
Eric Dumazet0a5c0472011-03-31 01:51:35 -07002156 while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002157 tb = hlist_entry(tb_node, struct fib_table, tb_hlist);
2158 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2159 if (n)
2160 goto found;
2161 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002162
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002163 /* new hash chain */
2164 while (++h < FIB_TABLE_HASHSZ) {
2165 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Sasha Levinb67bfe02013-02-27 17:06:00 -08002166 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002167 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2168 if (n)
2169 goto found;
2170 }
2171 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002172 return NULL;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002173
2174found:
2175 iter->tb = tb;
2176 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002177}
2178
2179static void fib_trie_seq_stop(struct seq_file *seq, void *v)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002180 __releases(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002181{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002182 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002183}
2184
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002185static void seq_indent(struct seq_file *seq, int n)
2186{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002187 while (n-- > 0)
2188 seq_puts(seq, " ");
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002189}
Robert Olsson19baf832005-06-21 12:43:18 -07002190
Eric Dumazet28d36e32008-01-14 23:09:56 -08002191static inline const char *rtn_scope(char *buf, size_t len, enum rt_scope_t s)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002192{
Stephen Hemminger132adf52007-03-08 20:44:43 -08002193 switch (s) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002194 case RT_SCOPE_UNIVERSE: return "universe";
2195 case RT_SCOPE_SITE: return "site";
2196 case RT_SCOPE_LINK: return "link";
2197 case RT_SCOPE_HOST: return "host";
2198 case RT_SCOPE_NOWHERE: return "nowhere";
2199 default:
Eric Dumazet28d36e32008-01-14 23:09:56 -08002200 snprintf(buf, len, "scope=%d", s);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002201 return buf;
2202 }
2203}
2204
Jan Engelhardt36cbd3d2009-08-05 10:42:58 -07002205static const char *const rtn_type_names[__RTN_MAX] = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002206 [RTN_UNSPEC] = "UNSPEC",
2207 [RTN_UNICAST] = "UNICAST",
2208 [RTN_LOCAL] = "LOCAL",
2209 [RTN_BROADCAST] = "BROADCAST",
2210 [RTN_ANYCAST] = "ANYCAST",
2211 [RTN_MULTICAST] = "MULTICAST",
2212 [RTN_BLACKHOLE] = "BLACKHOLE",
2213 [RTN_UNREACHABLE] = "UNREACHABLE",
2214 [RTN_PROHIBIT] = "PROHIBIT",
2215 [RTN_THROW] = "THROW",
2216 [RTN_NAT] = "NAT",
2217 [RTN_XRESOLVE] = "XRESOLVE",
2218};
2219
Eric Dumazeta034ee32010-09-09 23:32:28 +00002220static inline const char *rtn_type(char *buf, size_t len, unsigned int t)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002221{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002222 if (t < __RTN_MAX && rtn_type_names[t])
2223 return rtn_type_names[t];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002224 snprintf(buf, len, "type %u", t);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002225 return buf;
2226}
2227
2228/* Pretty print the trie */
Robert Olsson19baf832005-06-21 12:43:18 -07002229static int fib_trie_seq_show(struct seq_file *seq, void *v)
2230{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002231 const struct fib_trie_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002232 struct key_vector *n = v;
Robert Olsson19baf832005-06-21 12:43:18 -07002233
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002234 if (!node_parent_rcu(n))
2235 fib_table_print(seq, iter->tb);
Robert Olsson095b8502007-01-26 19:06:01 -08002236
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002237 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002238 __be32 prf = htonl(n->key);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002239
Alexander Duycke9b44012014-12-31 10:56:12 -08002240 seq_indent(seq, iter->depth-1);
2241 seq_printf(seq, " +-- %pI4/%zu %u %u %u\n",
2242 &prf, KEYLENGTH - n->pos - n->bits, n->bits,
2243 n->full_children, n->empty_children);
Olof Johansson91b9a272005-08-09 20:24:39 -07002244 } else {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002245 __be32 val = htonl(n->key);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002246 struct fib_alias *fa;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002247
2248 seq_indent(seq, iter->depth);
Harvey Harrison673d57e2008-10-31 00:53:57 -07002249 seq_printf(seq, " |-- %pI4\n", &val);
Eric Dumazet28d36e32008-01-14 23:09:56 -08002250
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002251 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
2252 char buf1[32], buf2[32];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002253
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002254 seq_indent(seq, iter->depth + 1);
2255 seq_printf(seq, " /%zu %s %s",
2256 KEYLENGTH - fa->fa_slen,
2257 rtn_scope(buf1, sizeof(buf1),
2258 fa->fa_info->fib_scope),
2259 rtn_type(buf2, sizeof(buf2),
2260 fa->fa_type));
2261 if (fa->fa_tos)
2262 seq_printf(seq, " tos=%d", fa->fa_tos);
2263 seq_putc(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002264 }
Robert Olsson19baf832005-06-21 12:43:18 -07002265 }
2266
2267 return 0;
2268}
2269
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002270static const struct seq_operations fib_trie_seq_ops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002271 .start = fib_trie_seq_start,
2272 .next = fib_trie_seq_next,
2273 .stop = fib_trie_seq_stop,
2274 .show = fib_trie_seq_show,
Robert Olsson19baf832005-06-21 12:43:18 -07002275};
2276
2277static int fib_trie_seq_open(struct inode *inode, struct file *file)
2278{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002279 return seq_open_net(inode, file, &fib_trie_seq_ops,
2280 sizeof(struct fib_trie_iter));
Robert Olsson19baf832005-06-21 12:43:18 -07002281}
2282
Arjan van de Ven9a321442007-02-12 00:55:35 -08002283static const struct file_operations fib_trie_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002284 .owner = THIS_MODULE,
2285 .open = fib_trie_seq_open,
2286 .read = seq_read,
2287 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002288 .release = seq_release_net,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002289};
2290
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002291struct fib_route_iter {
2292 struct seq_net_private p;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002293 struct fib_table *main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002294 struct key_vector *tnode;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002295 loff_t pos;
2296 t_key key;
2297};
2298
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002299static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,
2300 loff_t pos)
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002301{
Alexander Duyck8be33e92015-03-04 14:59:19 -08002302 struct fib_table *tb = iter->main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002303 struct key_vector *l, **tp = &iter->tnode;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002304 struct trie *t;
2305 t_key key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002306
Alexander Duyck8be33e92015-03-04 14:59:19 -08002307 /* use cache location of next-to-find key */
2308 if (iter->pos > 0 && pos >= iter->pos) {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002309 pos -= iter->pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002310 key = iter->key;
2311 } else {
2312 t = (struct trie *)tb->tb_data;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002313 iter->tnode = rcu_dereference_rtnl(t->tnode[0]);
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002314 iter->pos = 0;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002315 key = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002316 }
2317
Alexander Duyck8be33e92015-03-04 14:59:19 -08002318 while ((l = leaf_walk_rcu(tp, key)) != NULL) {
2319 key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002320 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002321
2322 if (pos-- <= 0)
2323 break;
2324
2325 l = NULL;
2326
2327 /* handle unlikely case of a key wrap */
2328 if (!key)
2329 break;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002330 }
2331
2332 if (l)
Alexander Duyck8be33e92015-03-04 14:59:19 -08002333 iter->key = key; /* remember it */
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002334 else
2335 iter->pos = 0; /* forget it */
2336
2337 return l;
2338}
2339
2340static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos)
2341 __acquires(RCU)
2342{
2343 struct fib_route_iter *iter = seq->private;
2344 struct fib_table *tb;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002345 struct trie *t;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002346
2347 rcu_read_lock();
Alexander Duyck8be33e92015-03-04 14:59:19 -08002348
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002349 tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN);
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002350 if (!tb)
2351 return NULL;
2352
Alexander Duyck8be33e92015-03-04 14:59:19 -08002353 iter->main_tb = tb;
2354
2355 if (*pos != 0)
2356 return fib_route_get_idx(iter, *pos);
2357
2358 t = (struct trie *)tb->tb_data;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002359 iter->tnode = rcu_dereference_rtnl(t->tnode[0]);
Alexander Duyck8be33e92015-03-04 14:59:19 -08002360 iter->pos = 0;
2361 iter->key = 0;
2362
2363 return SEQ_START_TOKEN;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002364}
2365
2366static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2367{
2368 struct fib_route_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002369 struct key_vector *l = NULL;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002370 t_key key = iter->key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002371
2372 ++*pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002373
2374 /* only allow key of 0 for start of sequence */
2375 if ((v == SEQ_START_TOKEN) || key)
2376 l = leaf_walk_rcu(&iter->tnode, key);
2377
2378 if (l) {
2379 iter->key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002380 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002381 } else {
2382 iter->pos = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002383 }
2384
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002385 return l;
2386}
2387
2388static void fib_route_seq_stop(struct seq_file *seq, void *v)
2389 __releases(RCU)
2390{
2391 rcu_read_unlock();
2392}
2393
Eric Dumazeta034ee32010-09-09 23:32:28 +00002394static unsigned int fib_flag_trans(int type, __be32 mask, const struct fib_info *fi)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002395{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002396 unsigned int flags = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002397
Eric Dumazeta034ee32010-09-09 23:32:28 +00002398 if (type == RTN_UNREACHABLE || type == RTN_PROHIBIT)
2399 flags = RTF_REJECT;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002400 if (fi && fi->fib_nh->nh_gw)
2401 flags |= RTF_GATEWAY;
Al Viro32ab5f82006-09-26 22:21:45 -07002402 if (mask == htonl(0xFFFFFFFF))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002403 flags |= RTF_HOST;
2404 flags |= RTF_UP;
2405 return flags;
2406}
2407
2408/*
2409 * This outputs /proc/net/route.
2410 * The format of the file is not supposed to be changed
Eric Dumazeta034ee32010-09-09 23:32:28 +00002411 * and needs to be same as fib_hash output to avoid breaking
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002412 * legacy utilities
2413 */
2414static int fib_route_seq_show(struct seq_file *seq, void *v)
2415{
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002416 struct fib_alias *fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002417 struct key_vector *l = v;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002418 __be32 prefix;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002419
2420 if (v == SEQ_START_TOKEN) {
2421 seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway "
2422 "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU"
2423 "\tWindow\tIRTT");
2424 return 0;
2425 }
2426
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002427 prefix = htonl(l->key);
2428
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002429 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2430 const struct fib_info *fi = fa->fa_info;
2431 __be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen);
2432 unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002433
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002434 if ((fa->fa_type == RTN_BROADCAST) ||
2435 (fa->fa_type == RTN_MULTICAST))
2436 continue;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002437
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002438 seq_setwidth(seq, 127);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002439
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002440 if (fi)
2441 seq_printf(seq,
2442 "%s\t%08X\t%08X\t%04X\t%d\t%u\t"
2443 "%d\t%08X\t%d\t%u\t%u",
2444 fi->fib_dev ? fi->fib_dev->name : "*",
2445 prefix,
2446 fi->fib_nh->nh_gw, flags, 0, 0,
2447 fi->fib_priority,
2448 mask,
2449 (fi->fib_advmss ?
2450 fi->fib_advmss + 40 : 0),
2451 fi->fib_window,
2452 fi->fib_rtt >> 3);
2453 else
2454 seq_printf(seq,
2455 "*\t%08X\t%08X\t%04X\t%d\t%u\t"
2456 "%d\t%08X\t%d\t%u\t%u",
2457 prefix, 0, flags, 0, 0, 0,
2458 mask, 0, 0, 0);
Tetsuo Handa652586d2013-11-14 14:31:57 -08002459
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002460 seq_pad(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002461 }
2462
2463 return 0;
2464}
2465
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002466static const struct seq_operations fib_route_seq_ops = {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002467 .start = fib_route_seq_start,
2468 .next = fib_route_seq_next,
2469 .stop = fib_route_seq_stop,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002470 .show = fib_route_seq_show,
2471};
2472
2473static int fib_route_seq_open(struct inode *inode, struct file *file)
2474{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002475 return seq_open_net(inode, file, &fib_route_seq_ops,
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002476 sizeof(struct fib_route_iter));
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002477}
2478
Arjan van de Ven9a321442007-02-12 00:55:35 -08002479static const struct file_operations fib_route_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002480 .owner = THIS_MODULE,
2481 .open = fib_route_seq_open,
2482 .read = seq_read,
2483 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002484 .release = seq_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002485};
2486
Denis V. Lunev61a02652008-01-10 03:21:09 -08002487int __net_init fib_proc_init(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002488{
Gao fengd4beaa62013-02-18 01:34:54 +00002489 if (!proc_create("fib_trie", S_IRUGO, net->proc_net, &fib_trie_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002490 goto out1;
2491
Gao fengd4beaa62013-02-18 01:34:54 +00002492 if (!proc_create("fib_triestat", S_IRUGO, net->proc_net,
2493 &fib_triestat_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002494 goto out2;
2495
Gao fengd4beaa62013-02-18 01:34:54 +00002496 if (!proc_create("route", S_IRUGO, net->proc_net, &fib_route_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002497 goto out3;
2498
Robert Olsson19baf832005-06-21 12:43:18 -07002499 return 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002500
2501out3:
Gao fengece31ff2013-02-18 01:34:56 +00002502 remove_proc_entry("fib_triestat", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002503out2:
Gao fengece31ff2013-02-18 01:34:56 +00002504 remove_proc_entry("fib_trie", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002505out1:
2506 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07002507}
2508
Denis V. Lunev61a02652008-01-10 03:21:09 -08002509void __net_exit fib_proc_exit(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002510{
Gao fengece31ff2013-02-18 01:34:56 +00002511 remove_proc_entry("fib_trie", net->proc_net);
2512 remove_proc_entry("fib_triestat", net->proc_net);
2513 remove_proc_entry("route", net->proc_net);
Robert Olsson19baf832005-06-21 12:43:18 -07002514}
2515
2516#endif /* CONFIG_PROC_FS */