blob: e3b4aee4244e1702b9ad34ffc788a5268447e8e5 [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 Duyck88bae712015-03-06 09:54:52 -080092#define IS_TRIE(n) ((n)->pos >= KEYLENGTH)
93#define IS_TNODE(n) ((n)->bits)
94#define IS_LEAF(n) (!(n)->bits)
Robert Olsson2373ce12005-08-25 13:01:29 -070095
Alexander Duyck35c6eda2015-03-06 09:54:08 -080096struct key_vector {
Alexander Duyck41b489f2015-03-04 15:02:33 -080097 t_key key;
98 unsigned char pos; /* 2log(KEYLENGTH) bits needed */
99 unsigned char bits; /* 2log(KEYLENGTH) bits needed */
100 unsigned char slen;
Alexander Duyckadaf9812014-12-31 10:55:47 -0800101 union {
Alexander Duyck41b489f2015-03-04 15:02:33 -0800102 /* This list pointer if valid if (pos | bits) == 0 (LEAF) */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800103 struct hlist_head leaf;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800104 /* This array is valid if (pos | bits) > 0 (TNODE) */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800105 struct key_vector __rcu *tnode[0];
Alexander Duyckadaf9812014-12-31 10:55:47 -0800106 };
Robert Olsson19baf832005-06-21 12:43:18 -0700107};
108
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800109struct tnode {
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800110 struct rcu_head rcu;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800111 t_key empty_children; /* KEYLENGTH bits needed */
112 t_key full_children; /* KEYLENGTH bits needed */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800113 struct key_vector __rcu *parent;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800114 struct key_vector kv[1];
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800115#define tn_bits kv[0].bits
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800116};
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 Duyck88bae712015-03-06 09:54:52 -0800143 struct key_vector kv[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 Duyck88bae712015-03-06 09:54:52 -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 Duyck56ca2ad2015-03-06 09:54:33 -0800162static inline struct tnode *tn_info(struct key_vector *kv)
163{
164 return container_of(kv, struct tnode, kv[0]);
165}
166
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800167/* caller must hold RTNL */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800168#define node_parent(tn) rtnl_dereference(tn_info(tn)->parent)
Alexander Duyck754baf82015-03-06 09:54:14 -0800169#define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700170
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800171/* caller must hold RCU read lock or RTNL */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800172#define node_parent_rcu(tn) rcu_dereference_rtnl(tn_info(tn)->parent)
Alexander Duyck754baf82015-03-06 09:54:14 -0800173#define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700174
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800175/* wrapper for rcu_assign_pointer */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800176static inline void node_set_parent(struct key_vector *n, struct key_vector *tp)
Stephen Hemminger06801912007-08-10 15:22:13 -0700177{
Alexander Duyckadaf9812014-12-31 10:55:47 -0800178 if (n)
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800179 rcu_assign_pointer(tn_info(n)->parent, tp);
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800180}
181
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800182#define NODE_INIT_PARENT(n, p) RCU_INIT_POINTER(tn_info(n)->parent, p)
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800183
184/* This provides us with the number of children in this node, in the case of a
185 * leaf this will return 0 meaning none of the children are accessible.
186 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800187static inline unsigned long child_length(const struct key_vector *tn)
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800188{
189 return (1ul << tn->bits) & ~(1ul);
Stephen Hemminger06801912007-08-10 15:22:13 -0700190}
Robert Olsson2373ce12005-08-25 13:01:29 -0700191
Alexander Duyck88bae712015-03-06 09:54:52 -0800192#define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos)
193
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800194static inline unsigned long get_index(t_key key, struct key_vector *kv)
195{
196 unsigned long index = key ^ kv->key;
197
Alexander Duyck88bae712015-03-06 09:54:52 -0800198 if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos))
199 return 0;
200
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800201 return index >> kv->pos;
202}
203
Alexander Duycke9b44012014-12-31 10:56:12 -0800204/* To understand this stuff, an understanding of keys and all their bits is
205 * necessary. Every node in the trie has a key associated with it, but not
206 * all of the bits in that key are significant.
207 *
208 * Consider a node 'n' and its parent 'tp'.
209 *
210 * If n is a leaf, every bit in its key is significant. Its presence is
211 * necessitated by path compression, since during a tree traversal (when
212 * searching for a leaf - unless we are doing an insertion) we will completely
213 * ignore all skipped bits we encounter. Thus we need to verify, at the end of
214 * a potentially successful search, that we have indeed been walking the
215 * correct key path.
216 *
217 * Note that we can never "miss" the correct key in the tree if present by
218 * following the wrong path. Path compression ensures that segments of the key
219 * that are the same for all keys with a given prefix are skipped, but the
220 * skipped part *is* identical for each node in the subtrie below the skipped
221 * bit! trie_insert() in this implementation takes care of that.
222 *
223 * if n is an internal node - a 'tnode' here, the various parts of its key
224 * have many different meanings.
225 *
226 * Example:
227 * _________________________________________________________________
228 * | i | i | i | i | i | i | i | N | N | N | S | S | S | S | S | C |
229 * -----------------------------------------------------------------
230 * 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16
231 *
232 * _________________________________________________________________
233 * | C | C | C | u | u | u | u | u | u | u | u | u | u | u | u | u |
234 * -----------------------------------------------------------------
235 * 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
236 *
237 * tp->pos = 22
238 * tp->bits = 3
239 * n->pos = 13
240 * n->bits = 4
241 *
242 * First, let's just ignore the bits that come before the parent tp, that is
243 * the bits from (tp->pos + tp->bits) to 31. They are *known* but at this
244 * point we do not use them for anything.
245 *
246 * The bits from (tp->pos) to (tp->pos + tp->bits - 1) - "N", above - are the
247 * index into the parent's child array. That is, they will be used to find
248 * 'n' among tp's children.
249 *
250 * The bits from (n->pos + n->bits) to (tn->pos - 1) - "S" - are skipped bits
251 * for the node n.
252 *
253 * All the bits we have seen so far are significant to the node n. The rest
254 * of the bits are really not needed or indeed known in n->key.
255 *
256 * The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into
257 * n's child array, and will of course be different for each child.
258 *
259 * The rest of the bits, from 0 to (n->pos + n->bits), are completely unknown
260 * at this point.
261 */
Robert Olsson19baf832005-06-21 12:43:18 -0700262
Denis V. Lunevf5026fa2007-12-13 09:47:57 -0800263static const int halve_threshold = 25;
264static const int inflate_threshold = 50;
Jarek Poplawski345aa032009-07-07 19:39:16 -0700265static const int halve_threshold_root = 15;
Jens Låås80b71b82009-08-28 23:57:15 -0700266static const int inflate_threshold_root = 30;
Robert Olsson2373ce12005-08-25 13:01:29 -0700267
268static void __alias_free_mem(struct rcu_head *head)
269{
270 struct fib_alias *fa = container_of(head, struct fib_alias, rcu);
271 kmem_cache_free(fn_alias_kmem, fa);
272}
273
274static inline void alias_free_mem_rcu(struct fib_alias *fa)
275{
276 call_rcu(&fa->rcu, __alias_free_mem);
277}
278
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800279#define TNODE_KMALLOC_MAX \
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800280 ilog2((PAGE_SIZE - TNODE_SIZE(0)) / sizeof(struct key_vector *))
Alexander Duyck1de3d872015-03-04 15:04:46 -0800281#define TNODE_VMALLOC_MAX \
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800282 ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800283
284static void __node_free_rcu(struct rcu_head *head)
Robert Olsson2373ce12005-08-25 13:01:29 -0700285{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800286 struct tnode *n = container_of(head, struct tnode, rcu);
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800287
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800288 if (!n->tn_bits)
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800289 kmem_cache_free(trie_leaf_kmem, n);
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800290 else if (n->tn_bits <= TNODE_KMALLOC_MAX)
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800291 kfree(n);
292 else
293 vfree(n);
Robert Olsson2373ce12005-08-25 13:01:29 -0700294}
295
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800296#define node_free(n) call_rcu(&tn_info(n)->rcu, __node_free_rcu)
Stephen Hemminger387a5482008-04-10 03:47:34 -0700297
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800298static struct tnode *tnode_alloc(int bits)
Robert Olsson2373ce12005-08-25 13:01:29 -0700299{
Alexander Duyck1de3d872015-03-04 15:04:46 -0800300 size_t size;
301
302 /* verify bits is within bounds */
303 if (bits > TNODE_VMALLOC_MAX)
304 return NULL;
305
306 /* determine size and verify it is non-zero and didn't overflow */
307 size = TNODE_SIZE(1ul << bits);
308
Robert Olsson2373ce12005-08-25 13:01:29 -0700309 if (size <= PAGE_SIZE)
Eric Dumazet8d965442008-01-13 22:31:44 -0800310 return kzalloc(size, GFP_KERNEL);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700311 else
Eric Dumazet7a1c8e52010-11-20 07:46:35 +0000312 return vzalloc(size);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700313}
Robert Olsson2373ce12005-08-25 13:01:29 -0700314
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800315static inline void empty_child_inc(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800316{
Alexander Duyck6e22d172015-03-06 09:54:39 -0800317 ++tn_info(n)->empty_children ? : ++tn_info(n)->full_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800318}
319
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800320static inline void empty_child_dec(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800321{
Alexander Duyck6e22d172015-03-06 09:54:39 -0800322 tn_info(n)->empty_children-- ? : tn_info(n)->full_children--;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800323}
324
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800325static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)
Robert Olsson19baf832005-06-21 12:43:18 -0700326{
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800327 struct tnode *kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL);
328 struct key_vector *l = kv->kv;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800329
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800330 if (!kv)
331 return NULL;
332
333 /* initialize key vector */
334 l->key = key;
335 l->pos = 0;
336 l->bits = 0;
337 l->slen = fa->fa_slen;
338
339 /* link leaf to fib alias */
340 INIT_HLIST_HEAD(&l->leaf);
341 hlist_add_head(&fa->fa_list, &l->leaf);
342
Robert Olsson19baf832005-06-21 12:43:18 -0700343 return l;
344}
345
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800346static struct key_vector *tnode_new(t_key key, int pos, int bits)
Robert Olsson19baf832005-06-21 12:43:18 -0700347{
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800348 struct tnode *tnode = tnode_alloc(bits);
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800349 unsigned int shift = pos + bits;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800350 struct key_vector *tn = tnode->kv;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800351
352 /* verify bits and pos their msb bits clear and values are valid */
353 BUG_ON(!bits || (shift > KEYLENGTH));
Robert Olsson19baf832005-06-21 12:43:18 -0700354
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800355 pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0),
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800356 sizeof(struct key_vector *) << bits);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800357
358 if (!tnode)
359 return NULL;
360
361 if (bits == KEYLENGTH)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800362 tnode->full_children = 1;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800363 else
Alexander Duyck6e22d172015-03-06 09:54:39 -0800364 tnode->empty_children = 1ul << bits;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800365
366 tn->key = (shift < KEYLENGTH) ? (key >> shift) << shift : 0;
367 tn->pos = pos;
368 tn->bits = bits;
369 tn->slen = pos;
370
Robert Olsson19baf832005-06-21 12:43:18 -0700371 return tn;
372}
373
Alexander Duycke9b44012014-12-31 10:56:12 -0800374/* Check whether a tnode 'n' is "full", i.e. it is an internal node
Robert Olsson19baf832005-06-21 12:43:18 -0700375 * and no bits are skipped. See discussion in dyntree paper p. 6
376 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800377static inline int tnode_full(struct key_vector *tn, struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700378{
Alexander Duycke9b44012014-12-31 10:56:12 -0800379 return n && ((n->pos + n->bits) == tn->pos) && IS_TNODE(n);
Robert Olsson19baf832005-06-21 12:43:18 -0700380}
381
Alexander Duyckff181ed2014-12-31 10:56:43 -0800382/* Add a child at position i overwriting the old value.
383 * Update the value of full_children and empty_children.
384 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800385static void put_child(struct key_vector *tn, unsigned long i,
386 struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700387{
Alexander Duyck754baf82015-03-06 09:54:14 -0800388 struct key_vector *chi = get_child(tn, i);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800389 int isfull, wasfull;
Robert Olsson19baf832005-06-21 12:43:18 -0700390
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800391 BUG_ON(i >= child_length(tn));
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700392
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800393 /* update emptyChildren, overflow into fullChildren */
Robert Olsson19baf832005-06-21 12:43:18 -0700394 if (n == NULL && chi != NULL)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800395 empty_child_inc(tn);
396 if (n != NULL && chi == NULL)
397 empty_child_dec(tn);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700398
Robert Olsson19baf832005-06-21 12:43:18 -0700399 /* update fullChildren */
Alexander Duyckff181ed2014-12-31 10:56:43 -0800400 wasfull = tnode_full(tn, chi);
Robert Olsson19baf832005-06-21 12:43:18 -0700401 isfull = tnode_full(tn, n);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800402
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700403 if (wasfull && !isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800404 tn_info(tn)->full_children--;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700405 else if (!wasfull && isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800406 tn_info(tn)->full_children++;
Olof Johansson91b9a272005-08-09 20:24:39 -0700407
Alexander Duyck5405afd2014-12-31 10:57:08 -0800408 if (n && (tn->slen < n->slen))
409 tn->slen = n->slen;
410
Alexander Duyck41b489f2015-03-04 15:02:33 -0800411 rcu_assign_pointer(tn->tnode[i], n);
Robert Olsson19baf832005-06-21 12:43:18 -0700412}
413
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800414static void update_children(struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800415{
416 unsigned long i;
417
418 /* update all of the child parent pointers */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800419 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800420 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800421
422 if (!inode)
423 continue;
424
425 /* Either update the children of a tnode that
426 * already belongs to us or update the child
427 * to point to ourselves.
428 */
429 if (node_parent(inode) == tn)
430 update_children(inode);
431 else
432 node_set_parent(inode, tn);
433 }
434}
435
Alexander Duyck88bae712015-03-06 09:54:52 -0800436static inline void put_child_root(struct key_vector *tp, t_key key,
437 struct key_vector *n)
Alexander Duyck836a0122014-12-31 10:56:06 -0800438{
Alexander Duyck88bae712015-03-06 09:54:52 -0800439 if (IS_TRIE(tp))
440 rcu_assign_pointer(tp->tnode[0], n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800441 else
Alexander Duyck88bae712015-03-06 09:54:52 -0800442 put_child(tp, get_index(key, tp), n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800443}
444
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800445static inline void tnode_free_init(struct key_vector *tn)
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700446{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800447 tn_info(tn)->rcu.next = NULL;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800448}
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700449
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800450static inline void tnode_free_append(struct key_vector *tn,
451 struct key_vector *n)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800452{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800453 tn_info(n)->rcu.next = tn_info(tn)->rcu.next;
454 tn_info(tn)->rcu.next = &tn_info(n)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800455}
456
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800457static void tnode_free(struct key_vector *tn)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800458{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800459 struct callback_head *head = &tn_info(tn)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800460
461 while (head) {
462 head = head->next;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800463 tnode_free_size += TNODE_SIZE(1ul << tn->bits);
Alexander Duyckfc86a932014-12-31 10:56:49 -0800464 node_free(tn);
465
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800466 tn = container_of(head, struct tnode, rcu)->kv;
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700467 }
Alexander Duyckfc86a932014-12-31 10:56:49 -0800468
469 if (tnode_free_size >= PAGE_SIZE * sync_pages) {
470 tnode_free_size = 0;
471 synchronize_rcu();
472 }
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700473}
474
Alexander Duyck88bae712015-03-06 09:54:52 -0800475static struct key_vector *replace(struct trie *t,
476 struct key_vector *oldtnode,
477 struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800478{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800479 struct key_vector *tp = node_parent(oldtnode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800480 unsigned long i;
481
482 /* setup the parent pointer out of and back into this node */
483 NODE_INIT_PARENT(tn, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -0800484 put_child_root(tp, tn->key, tn);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800485
486 /* update all of the child parent pointers */
487 update_children(tn);
488
489 /* all pointers should be clean so we are done */
490 tnode_free(oldtnode);
491
492 /* resize children now that oldtnode is freed */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800493 for (i = child_length(tn); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800494 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800495
496 /* resize child node */
497 if (tnode_full(tn, inode))
Alexander Duyck88bae712015-03-06 09:54:52 -0800498 tn = resize(t, inode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800499 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800500
Alexander Duyck88bae712015-03-06 09:54:52 -0800501 return tp;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800502}
503
Alexander Duyck88bae712015-03-06 09:54:52 -0800504static struct key_vector *inflate(struct trie *t,
505 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700506{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800507 struct key_vector *tn;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800508 unsigned long i;
Alexander Duycke9b44012014-12-31 10:56:12 -0800509 t_key m;
Robert Olsson19baf832005-06-21 12:43:18 -0700510
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700511 pr_debug("In inflate\n");
Robert Olsson19baf832005-06-21 12:43:18 -0700512
Alexander Duycke9b44012014-12-31 10:56:12 -0800513 tn = tnode_new(oldtnode->key, oldtnode->pos - 1, oldtnode->bits + 1);
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700514 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800515 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700516
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800517 /* prepare oldtnode to be freed */
518 tnode_free_init(oldtnode);
519
Alexander Duyck12c081a2014-12-31 10:56:55 -0800520 /* Assemble all of the pointers in our cluster, in this case that
521 * represents all of the pointers out of our allocated nodes that
522 * point to existing tnodes and the links between our allocated
523 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700524 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800525 for (i = child_length(oldtnode), m = 1u << tn->pos; i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800526 struct key_vector *inode = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800527 struct key_vector *node0, *node1;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800528 unsigned long j, k;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700529
Robert Olsson19baf832005-06-21 12:43:18 -0700530 /* An empty child */
Alexander Duyckadaf9812014-12-31 10:55:47 -0800531 if (inode == NULL)
Robert Olsson19baf832005-06-21 12:43:18 -0700532 continue;
533
534 /* A leaf or an internal node with skipped bits */
Alexander Duyckadaf9812014-12-31 10:55:47 -0800535 if (!tnode_full(oldtnode, inode)) {
Alexander Duycke9b44012014-12-31 10:56:12 -0800536 put_child(tn, get_index(inode->key, tn), inode);
Robert Olsson19baf832005-06-21 12:43:18 -0700537 continue;
538 }
539
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800540 /* drop the node in the old tnode free list */
541 tnode_free_append(oldtnode, inode);
542
Robert Olsson19baf832005-06-21 12:43:18 -0700543 /* An internal node with two children */
Robert Olsson19baf832005-06-21 12:43:18 -0700544 if (inode->bits == 1) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800545 put_child(tn, 2 * i + 1, get_child(inode, 1));
546 put_child(tn, 2 * i, get_child(inode, 0));
Olof Johansson91b9a272005-08-09 20:24:39 -0700547 continue;
Robert Olsson19baf832005-06-21 12:43:18 -0700548 }
549
Olof Johansson91b9a272005-08-09 20:24:39 -0700550 /* We will replace this node 'inode' with two new
Alexander Duyck12c081a2014-12-31 10:56:55 -0800551 * ones, 'node0' and 'node1', each with half of the
Olof Johansson91b9a272005-08-09 20:24:39 -0700552 * original children. The two new nodes will have
553 * a position one bit further down the key and this
554 * means that the "significant" part of their keys
555 * (see the discussion near the top of this file)
556 * will differ by one bit, which will be "0" in
Alexander Duyck12c081a2014-12-31 10:56:55 -0800557 * node0's key and "1" in node1's key. Since we are
Olof Johansson91b9a272005-08-09 20:24:39 -0700558 * moving the key position by one step, the bit that
559 * we are moving away from - the bit at position
Alexander Duyck12c081a2014-12-31 10:56:55 -0800560 * (tn->pos) - is the one that will differ between
561 * node0 and node1. So... we synthesize that bit in the
562 * two new keys.
Olof Johansson91b9a272005-08-09 20:24:39 -0700563 */
Alexander Duyck12c081a2014-12-31 10:56:55 -0800564 node1 = tnode_new(inode->key | m, inode->pos, inode->bits - 1);
565 if (!node1)
566 goto nomem;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800567 node0 = tnode_new(inode->key, inode->pos, inode->bits - 1);
Robert Olsson19baf832005-06-21 12:43:18 -0700568
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800569 tnode_free_append(tn, node1);
Alexander Duyck12c081a2014-12-31 10:56:55 -0800570 if (!node0)
571 goto nomem;
572 tnode_free_append(tn, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700573
Alexander Duyck12c081a2014-12-31 10:56:55 -0800574 /* populate child pointers in new nodes */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800575 for (k = child_length(inode), j = k / 2; j;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800576 put_child(node1, --j, get_child(inode, --k));
577 put_child(node0, j, get_child(inode, j));
578 put_child(node1, --j, get_child(inode, --k));
579 put_child(node0, j, get_child(inode, j));
Robert Olsson19baf832005-06-21 12:43:18 -0700580 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800581
Alexander Duyck12c081a2014-12-31 10:56:55 -0800582 /* link new nodes to parent */
583 NODE_INIT_PARENT(node1, tn);
584 NODE_INIT_PARENT(node0, tn);
Olof Johansson91b9a272005-08-09 20:24:39 -0700585
Alexander Duyck12c081a2014-12-31 10:56:55 -0800586 /* link parent to nodes */
587 put_child(tn, 2 * i + 1, node1);
588 put_child(tn, 2 * i, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700589 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800590
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800591 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800592 return replace(t, oldtnode, tn);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700593nomem:
Alexander Duyckfc86a932014-12-31 10:56:49 -0800594 /* all pointers should be clean so we are done */
595 tnode_free(tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800596notnode:
597 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700598}
599
Alexander Duyck88bae712015-03-06 09:54:52 -0800600static struct key_vector *halve(struct trie *t,
601 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700602{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800603 struct key_vector *tn;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800604 unsigned long i;
Robert Olsson19baf832005-06-21 12:43:18 -0700605
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700606 pr_debug("In halve\n");
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700607
Alexander Duycke9b44012014-12-31 10:56:12 -0800608 tn = tnode_new(oldtnode->key, oldtnode->pos + 1, oldtnode->bits - 1);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700609 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800610 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700611
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800612 /* prepare oldtnode to be freed */
613 tnode_free_init(oldtnode);
614
Alexander Duyck12c081a2014-12-31 10:56:55 -0800615 /* Assemble all of the pointers in our cluster, in this case that
616 * represents all of the pointers out of our allocated nodes that
617 * point to existing tnodes and the links between our allocated
618 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700619 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800620 for (i = child_length(oldtnode); i;) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800621 struct key_vector *node1 = get_child(oldtnode, --i);
622 struct key_vector *node0 = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800623 struct key_vector *inode;
Robert Olsson2f368952005-07-05 15:02:40 -0700624
Alexander Duyck12c081a2014-12-31 10:56:55 -0800625 /* At least one of the children is empty */
626 if (!node1 || !node0) {
627 put_child(tn, i / 2, node1 ? : node0);
628 continue;
Robert Olsson2f368952005-07-05 15:02:40 -0700629 }
Robert Olsson2f368952005-07-05 15:02:40 -0700630
Alexander Duyck12c081a2014-12-31 10:56:55 -0800631 /* Two nonempty children */
632 inode = tnode_new(node0->key, oldtnode->pos, 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800633 if (!inode)
634 goto nomem;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800635 tnode_free_append(tn, inode);
636
637 /* initialize pointers out of node */
638 put_child(inode, 1, node1);
639 put_child(inode, 0, node0);
640 NODE_INIT_PARENT(inode, tn);
641
642 /* link parent to node */
643 put_child(tn, i / 2, inode);
Robert Olsson2f368952005-07-05 15:02:40 -0700644 }
Robert Olsson19baf832005-06-21 12:43:18 -0700645
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800646 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800647 return replace(t, oldtnode, tn);
648nomem:
649 /* all pointers should be clean so we are done */
650 tnode_free(tn);
651notnode:
652 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700653}
654
Alexander Duyck88bae712015-03-06 09:54:52 -0800655static struct key_vector *collapse(struct trie *t,
656 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);
Alexander Duyck88bae712015-03-06 09:54:52 -0800667 put_child_root(tp, oldtnode->key, n);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800668 node_set_parent(n, tp);
669
670 /* drop dead node */
671 node_free(oldtnode);
Alexander Duyck88bae712015-03-06 09:54:52 -0800672
673 return tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800674}
675
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800676static unsigned char update_suffix(struct key_vector *tn)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800677{
678 unsigned char slen = tn->pos;
679 unsigned long stride, i;
680
681 /* search though the list of children looking for nodes that might
682 * have a suffix greater than the one we currently have. This is
683 * why we start with a stride of 2 since a stride of 1 would
684 * represent the nodes with suffix length equal to tn->pos
685 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800686 for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) {
Alexander Duyck754baf82015-03-06 09:54:14 -0800687 struct key_vector *n = get_child(tn, i);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800688
689 if (!n || (n->slen <= slen))
690 continue;
691
692 /* update stride and slen based on new value */
693 stride <<= (n->slen - slen);
694 slen = n->slen;
695 i &= ~(stride - 1);
696
697 /* if slen covers all but the last bit we can stop here
698 * there will be nothing longer than that since only node
699 * 0 and 1 << (bits - 1) could have that as their suffix
700 * length.
701 */
702 if ((slen + 1) >= (tn->pos + tn->bits))
703 break;
704 }
705
706 tn->slen = slen;
707
708 return slen;
709}
710
Alexander Duyckf05a4812014-12-31 10:56:37 -0800711/* From "Implementing a dynamic compressed trie" by Stefan Nilsson of
712 * the Helsinki University of Technology and Matti Tikkanen of Nokia
713 * Telecommunications, page 6:
714 * "A node is doubled if the ratio of non-empty children to all
715 * children in the *doubled* node is at least 'high'."
716 *
717 * 'high' in this instance is the variable 'inflate_threshold'. It
718 * is expressed as a percentage, so we multiply it with
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800719 * child_length() and instead of multiplying by 2 (since the
Alexander Duyckf05a4812014-12-31 10:56:37 -0800720 * child array will be doubled by inflate()) and multiplying
721 * the left-hand side by 100 (to handle the percentage thing) we
722 * multiply the left-hand side by 50.
723 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800724 * The left-hand side may look a bit weird: child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800725 * - tn->empty_children is of course the number of non-null children
726 * in the current node. tn->full_children is the number of "full"
727 * children, that is non-null tnodes with a skip value of 0.
728 * All of those will be doubled in the resulting inflated tnode, so
729 * we just count them one extra time here.
730 *
731 * A clearer way to write this would be:
732 *
733 * to_be_doubled = tn->full_children;
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800734 * not_to_be_doubled = child_length(tn) - tn->empty_children -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800735 * tn->full_children;
736 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800737 * new_child_length = child_length(tn) * 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800738 *
739 * new_fill_factor = 100 * (not_to_be_doubled + 2*to_be_doubled) /
740 * new_child_length;
741 * if (new_fill_factor >= inflate_threshold)
742 *
743 * ...and so on, tho it would mess up the while () loop.
744 *
745 * anyway,
746 * 100 * (not_to_be_doubled + 2*to_be_doubled) / new_child_length >=
747 * inflate_threshold
748 *
749 * avoid a division:
750 * 100 * (not_to_be_doubled + 2*to_be_doubled) >=
751 * inflate_threshold * new_child_length
752 *
753 * expand not_to_be_doubled and to_be_doubled, and shorten:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800754 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800755 * tn->full_children) >= inflate_threshold * new_child_length
756 *
757 * expand new_child_length:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800758 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800759 * tn->full_children) >=
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800760 * inflate_threshold * child_length(tn) * 2
Alexander Duyckf05a4812014-12-31 10:56:37 -0800761 *
762 * shorten again:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800763 * 50 * (tn->full_children + child_length(tn) -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800764 * tn->empty_children) >= inflate_threshold *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800765 * child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800766 *
767 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800768static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800769{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800770 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800771 unsigned long threshold = used;
772
773 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800774 threshold *= IS_TRIE(tp) ? inflate_threshold_root : inflate_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800775 used -= tn_info(tn)->empty_children;
776 used += tn_info(tn)->full_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800777
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800778 /* if bits == KEYLENGTH then pos = 0, and will fail below */
779
780 return (used > 1) && tn->pos && ((50 * used) >= threshold);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800781}
782
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800783static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800784{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800785 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800786 unsigned long threshold = used;
787
788 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800789 threshold *= IS_TRIE(tp) ? halve_threshold_root : halve_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800790 used -= tn_info(tn)->empty_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800791
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800792 /* if bits == KEYLENGTH then used = 100% on wrap, and will fail below */
793
794 return (used > 1) && (tn->bits > 1) && ((100 * used) < threshold);
795}
796
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800797static inline bool should_collapse(struct key_vector *tn)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800798{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800799 unsigned long used = child_length(tn);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800800
Alexander Duyck6e22d172015-03-06 09:54:39 -0800801 used -= tn_info(tn)->empty_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800802
803 /* account for bits == KEYLENGTH case */
Alexander Duyck6e22d172015-03-06 09:54:39 -0800804 if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800805 used -= KEY_MAX;
806
807 /* One child or none, time to drop us from the trie */
808 return used < 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800809}
810
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800811#define MAX_WORK 10
Alexander Duyck88bae712015-03-06 09:54:52 -0800812static struct key_vector *resize(struct trie *t, struct key_vector *tn)
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800813{
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800814#ifdef CONFIG_IP_FIB_TRIE_STATS
815 struct trie_use_stats __percpu *stats = t->stats;
816#endif
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800817 struct key_vector *tp = node_parent(tn);
Alexander Duyck88bae712015-03-06 09:54:52 -0800818 unsigned long cindex = get_index(tn->key, tp);
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 Duyck88bae712015-03-06 09:54:52 -0800828 BUG_ON(tn != get_child(tp, 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 Duyckddb4b9a2015-03-10 14:39:34 -0700833 while (should_inflate(tp, tn) && max_work--) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800834 tp = inflate(t, tn);
835 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800836#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800837 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800838#endif
839 break;
840 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800841
Alexander Duyck88bae712015-03-06 09:54:52 -0800842 tn = get_child(tp, cindex);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800843 }
844
845 /* Return if at least one inflate is run */
846 if (max_work != MAX_WORK)
Alexander Duyck88bae712015-03-06 09:54:52 -0800847 return node_parent(tn);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800848
Alexander Duyckf05a4812014-12-31 10:56:37 -0800849 /* Halve as long as the number of empty children in this
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800850 * node is above threshold.
851 */
Alexander Duyckddb4b9a2015-03-10 14:39:34 -0700852 while (should_halve(tp, tn) && max_work--) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800853 tp = halve(t, tn);
854 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800855#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800856 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800857#endif
858 break;
859 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800860
Alexander Duyck88bae712015-03-06 09:54:52 -0800861 tn = get_child(tp, cindex);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800862 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800863
864 /* Only one child remains */
Alexander Duyck88bae712015-03-06 09:54:52 -0800865 if (should_collapse(tn))
866 return collapse(t, tn);
867
868 /* update parent in case inflate or halve failed */
869 tp = node_parent(tn);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800870
871 /* Return if at least one deflate was run */
872 if (max_work != MAX_WORK)
Alexander Duyck88bae712015-03-06 09:54:52 -0800873 return tp;
Alexander Duyck5405afd2014-12-31 10:57:08 -0800874
875 /* push the suffix length to the parent node */
876 if (tn->slen > tn->pos) {
877 unsigned char slen = update_suffix(tn);
878
Alexander Duyck88bae712015-03-06 09:54:52 -0800879 if (slen > tp->slen)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800880 tp->slen = slen;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800881 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800882
Alexander Duyck88bae712015-03-06 09:54:52 -0800883 return tp;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800884}
885
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800886static void leaf_pull_suffix(struct key_vector *tp, struct key_vector *l)
Robert Olsson19baf832005-06-21 12:43:18 -0700887{
Alexander Duyck88bae712015-03-06 09:54:52 -0800888 while ((tp->slen > tp->pos) && (tp->slen > l->slen)) {
Alexander Duyck5405afd2014-12-31 10:57:08 -0800889 if (update_suffix(tp) > l->slen)
890 break;
891 tp = node_parent(tp);
892 }
893}
894
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800895static void leaf_push_suffix(struct key_vector *tn, struct key_vector *l)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800896{
Alexander Duyck5405afd2014-12-31 10:57:08 -0800897 /* if this is a new leaf then tn will be NULL and we can sort
898 * out parent suffix lengths as a part of trie_rebalance
899 */
Alexander Duyck88bae712015-03-06 09:54:52 -0800900 while (tn->slen < l->slen) {
Alexander Duyck5405afd2014-12-31 10:57:08 -0800901 tn->slen = l->slen;
902 tn = node_parent(tn);
903 }
904}
905
Robert Olsson2373ce12005-08-25 13:01:29 -0700906/* rcu_read_lock needs to be hold by caller from readside */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800907static struct key_vector *fib_find_node(struct trie *t,
908 struct key_vector **tp, u32 key)
Robert Olsson19baf832005-06-21 12:43:18 -0700909{
Alexander Duyck88bae712015-03-06 09:54:52 -0800910 struct key_vector *pn, *n = t->kv;
911 unsigned long index = 0;
Robert Olsson19baf832005-06-21 12:43:18 -0700912
Alexander Duyck88bae712015-03-06 09:54:52 -0800913 do {
914 pn = n;
915 n = get_child_rcu(n, index);
916
917 if (!n)
918 break;
919
920 index = get_cindex(key, n);
Alexander Duyck939afb02014-12-31 10:56:00 -0800921
922 /* This bit of code is a bit tricky but it combines multiple
923 * checks into a single check. The prefix consists of the
924 * prefix plus zeros for the bits in the cindex. The index
925 * is the difference between the key and this value. From
926 * this we can actually derive several pieces of data.
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800927 * if (index >= (1ul << bits))
Alexander Duyck939afb02014-12-31 10:56:00 -0800928 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -0800929 * else
930 * we know the value is cindex
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800931 *
932 * This check is safe even if bits == KEYLENGTH due to the
933 * fact that we can only allocate a node with 32 bits if a
934 * long is greater than 32 bits.
Alexander Duyck939afb02014-12-31 10:56:00 -0800935 */
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800936 if (index >= (1ul << n->bits)) {
937 n = NULL;
938 break;
939 }
Alexander Duyck939afb02014-12-31 10:56:00 -0800940
Alexander Duyck88bae712015-03-06 09:54:52 -0800941 /* keep searching until we find a perfect match leaf or NULL */
942 } while (IS_TNODE(n));
Robert Olsson19baf832005-06-21 12:43:18 -0700943
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800944 *tp = pn;
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800945
Alexander Duyck939afb02014-12-31 10:56:00 -0800946 return n;
Robert Olsson19baf832005-06-21 12:43:18 -0700947}
948
Alexander Duyck02525362015-01-22 15:51:39 -0800949/* Return the first fib alias matching TOS with
950 * priority less than or equal to PRIO.
951 */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800952static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen,
Alexander Duyck0b65bd92015-03-12 14:46:29 -0700953 u8 tos, u32 prio, u32 tb_id)
Alexander Duyck02525362015-01-22 15:51:39 -0800954{
955 struct fib_alias *fa;
956
957 if (!fah)
958 return NULL;
959
Alexander Duyck56315f92015-02-25 15:31:31 -0800960 hlist_for_each_entry(fa, fah, fa_list) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800961 if (fa->fa_slen < slen)
962 continue;
963 if (fa->fa_slen != slen)
964 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -0700965 if (fa->tb_id > tb_id)
966 continue;
967 if (fa->tb_id != tb_id)
968 break;
Alexander Duyck02525362015-01-22 15:51:39 -0800969 if (fa->fa_tos > tos)
970 continue;
971 if (fa->fa_info->fib_priority >= prio || fa->fa_tos < tos)
972 return fa;
973 }
974
975 return NULL;
976}
977
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800978static void trie_rebalance(struct trie *t, struct key_vector *tn)
Robert Olsson19baf832005-06-21 12:43:18 -0700979{
Alexander Duyck88bae712015-03-06 09:54:52 -0800980 while (!IS_TRIE(tn))
981 tn = resize(t, tn);
Robert Olsson19baf832005-06-21 12:43:18 -0700982}
983
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800984static int fib_insert_node(struct trie *t, struct key_vector *tp,
Alexander Duyckd5d64872015-03-04 15:02:18 -0800985 struct fib_alias *new, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -0700986{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800987 struct key_vector *n, *l;
Alexander Duyck836a0122014-12-31 10:56:06 -0800988
Alexander Duyckd5d64872015-03-04 15:02:18 -0800989 l = leaf_new(key, new);
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800990 if (!l)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800991 goto noleaf;
Alexander Duyckd5d64872015-03-04 15:02:18 -0800992
993 /* retrieve child from parent node */
Alexander Duyck88bae712015-03-06 09:54:52 -0800994 n = get_child(tp, get_index(key, tp));
Alexander Duyck836a0122014-12-31 10:56:06 -0800995
996 /* Case 2: n is a LEAF or a TNODE and the key doesn't match.
997 *
998 * Add a new tnode here
999 * first tnode need some special handling
1000 * leaves us in position for handling as case 3
1001 */
1002 if (n) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001003 struct key_vector *tn;
Alexander Duyck836a0122014-12-31 10:56:06 -08001004
Alexander Duycke9b44012014-12-31 10:56:12 -08001005 tn = tnode_new(key, __fls(key ^ n->key), 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001006 if (!tn)
1007 goto notnode;
Olof Johansson91b9a272005-08-09 20:24:39 -07001008
Alexander Duyck836a0122014-12-31 10:56:06 -08001009 /* initialize routes out of node */
1010 NODE_INIT_PARENT(tn, tp);
1011 put_child(tn, get_index(key, tn) ^ 1, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001012
Alexander Duyck836a0122014-12-31 10:56:06 -08001013 /* start adding routes into the node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001014 put_child_root(tp, key, tn);
Alexander Duyck836a0122014-12-31 10:56:06 -08001015 node_set_parent(n, tn);
Robert Olsson19baf832005-06-21 12:43:18 -07001016
Alexander Duyck836a0122014-12-31 10:56:06 -08001017 /* parent now has a NULL spot where the leaf can go */
Alexander Duycke962f302014-12-10 21:49:22 -08001018 tp = tn;
Robert Olsson19baf832005-06-21 12:43:18 -07001019 }
Olof Johansson91b9a272005-08-09 20:24:39 -07001020
Alexander Duyck836a0122014-12-31 10:56:06 -08001021 /* Case 3: n is NULL, and will just insert a new leaf */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001022 NODE_INIT_PARENT(l, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -08001023 put_child_root(tp, key, l);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001024 trie_rebalance(t, tp);
Olof Johansson91b9a272005-08-09 20:24:39 -07001025
Alexander Duyckd5d64872015-03-04 15:02:18 -08001026 return 0;
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001027notnode:
1028 node_free(l);
1029noleaf:
1030 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07001031}
1032
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001033static int fib_insert_alias(struct trie *t, struct key_vector *tp,
1034 struct key_vector *l, struct fib_alias *new,
Alexander Duyckd5d64872015-03-04 15:02:18 -08001035 struct fib_alias *fa, t_key key)
1036{
1037 if (!l)
1038 return fib_insert_node(t, tp, new, key);
1039
1040 if (fa) {
1041 hlist_add_before_rcu(&new->fa_list, &fa->fa_list);
1042 } else {
1043 struct fib_alias *last;
1044
1045 hlist_for_each_entry(last, &l->leaf, fa_list) {
1046 if (new->fa_slen < last->fa_slen)
1047 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001048 if ((new->fa_slen == last->fa_slen) &&
1049 (new->tb_id > last->tb_id))
1050 break;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001051 fa = last;
1052 }
1053
1054 if (fa)
1055 hlist_add_behind_rcu(&new->fa_list, &fa->fa_list);
1056 else
1057 hlist_add_head_rcu(&new->fa_list, &l->leaf);
1058 }
1059
1060 /* if we added to the tail node then we need to update slen */
1061 if (l->slen < new->fa_slen) {
1062 l->slen = new->fa_slen;
1063 leaf_push_suffix(tp, l);
1064 }
1065
1066 return 0;
1067}
1068
1069/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001070int fib_table_insert(struct fib_table *tb, struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001071{
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001072 struct trie *t = (struct trie *)tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001073 struct fib_alias *fa, *new_fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001074 struct key_vector *l, *tp;
Robert Olsson19baf832005-06-21 12:43:18 -07001075 struct fib_info *fi;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001076 u8 plen = cfg->fc_dst_len;
1077 u8 slen = KEYLENGTH - plen;
Thomas Graf4e902c52006-08-17 18:14:52 -07001078 u8 tos = cfg->fc_tos;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001079 u32 key;
Robert Olsson19baf832005-06-21 12:43:18 -07001080 int err;
Robert Olsson19baf832005-06-21 12:43:18 -07001081
Alexander Duyck5786ec62015-02-25 15:31:37 -08001082 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001083 return -EINVAL;
1084
Thomas Graf4e902c52006-08-17 18:14:52 -07001085 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001086
Patrick McHardy2dfe55b2006-08-10 23:08:33 -07001087 pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen);
Robert Olsson19baf832005-06-21 12:43:18 -07001088
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001089 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001090 return -EINVAL;
1091
Thomas Graf4e902c52006-08-17 18:14:52 -07001092 fi = fib_create_info(cfg);
1093 if (IS_ERR(fi)) {
1094 err = PTR_ERR(fi);
Robert Olsson19baf832005-06-21 12:43:18 -07001095 goto err;
Thomas Graf4e902c52006-08-17 18:14:52 -07001096 }
Robert Olsson19baf832005-06-21 12:43:18 -07001097
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001098 l = fib_find_node(t, &tp, key);
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001099 fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority,
1100 tb->tb_id) : NULL;
Robert Olsson19baf832005-06-21 12:43:18 -07001101
1102 /* Now fa, if non-NULL, points to the first fib alias
1103 * with the same keys [prefix,tos,priority], if such key already
1104 * exists or to the node before which we will insert new one.
1105 *
1106 * If fa is NULL, we will need to allocate a new one and
Alexander Duyck56315f92015-02-25 15:31:31 -08001107 * insert to the tail of the section matching the suffix length
1108 * of the new alias.
Robert Olsson19baf832005-06-21 12:43:18 -07001109 */
1110
Julian Anastasov936f6f82008-01-28 21:18:06 -08001111 if (fa && fa->fa_tos == tos &&
1112 fa->fa_info->fib_priority == fi->fib_priority) {
1113 struct fib_alias *fa_first, *fa_match;
Robert Olsson19baf832005-06-21 12:43:18 -07001114
1115 err = -EEXIST;
Thomas Graf4e902c52006-08-17 18:14:52 -07001116 if (cfg->fc_nlflags & NLM_F_EXCL)
Robert Olsson19baf832005-06-21 12:43:18 -07001117 goto out;
1118
Julian Anastasov936f6f82008-01-28 21:18:06 -08001119 /* We have 2 goals:
1120 * 1. Find exact match for type, scope, fib_info to avoid
1121 * duplicate routes
1122 * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it
1123 */
1124 fa_match = NULL;
1125 fa_first = fa;
Alexander Duyck56315f92015-02-25 15:31:31 -08001126 hlist_for_each_entry_from(fa, fa_list) {
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001127 if ((fa->fa_slen != slen) ||
1128 (fa->tb_id != tb->tb_id) ||
1129 (fa->fa_tos != tos))
Julian Anastasov936f6f82008-01-28 21:18:06 -08001130 break;
1131 if (fa->fa_info->fib_priority != fi->fib_priority)
1132 break;
1133 if (fa->fa_type == cfg->fc_type &&
Julian Anastasov936f6f82008-01-28 21:18:06 -08001134 fa->fa_info == fi) {
1135 fa_match = fa;
1136 break;
1137 }
1138 }
1139
Thomas Graf4e902c52006-08-17 18:14:52 -07001140 if (cfg->fc_nlflags & NLM_F_REPLACE) {
Robert Olsson19baf832005-06-21 12:43:18 -07001141 struct fib_info *fi_drop;
1142 u8 state;
1143
Julian Anastasov936f6f82008-01-28 21:18:06 -08001144 fa = fa_first;
1145 if (fa_match) {
1146 if (fa == fa_match)
1147 err = 0;
Joonwoo Park67250332008-01-18 03:45:18 -08001148 goto out;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001149 }
Robert Olsson2373ce12005-08-25 13:01:29 -07001150 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001151 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Robert Olsson2373ce12005-08-25 13:01:29 -07001152 if (new_fa == NULL)
1153 goto out;
Robert Olsson19baf832005-06-21 12:43:18 -07001154
1155 fi_drop = fa->fa_info;
Robert Olsson2373ce12005-08-25 13:01:29 -07001156 new_fa->fa_tos = fa->fa_tos;
1157 new_fa->fa_info = fi;
Thomas Graf4e902c52006-08-17 18:14:52 -07001158 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001159 state = fa->fa_state;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001160 new_fa->fa_state = state & ~FA_S_ACCESSED;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001161 new_fa->fa_slen = fa->fa_slen;
Robert Olsson19baf832005-06-21 12:43:18 -07001162
Scott Feldman8e05fd72015-03-05 21:21:19 -08001163 err = netdev_switch_fib_ipv4_add(key, plen, fi,
1164 new_fa->fa_tos,
1165 cfg->fc_type,
Scott Feldmanf8f21472015-03-09 13:59:09 -07001166 cfg->fc_nlflags,
Scott Feldman8e05fd72015-03-05 21:21:19 -08001167 tb->tb_id);
1168 if (err) {
1169 netdev_switch_fib_ipv4_abort(fi);
1170 kmem_cache_free(fn_alias_kmem, new_fa);
1171 goto out;
1172 }
1173
Alexander Duyck56315f92015-02-25 15:31:31 -08001174 hlist_replace_rcu(&fa->fa_list, &new_fa->fa_list);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001175
Robert Olsson2373ce12005-08-25 13:01:29 -07001176 alias_free_mem_rcu(fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001177
1178 fib_release_info(fi_drop);
1179 if (state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001180 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Milan Kocianb8f55832007-05-23 14:55:06 -07001181 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen,
1182 tb->tb_id, &cfg->fc_nlinfo, NLM_F_REPLACE);
Robert Olsson19baf832005-06-21 12:43:18 -07001183
Olof Johansson91b9a272005-08-09 20:24:39 -07001184 goto succeeded;
Robert Olsson19baf832005-06-21 12:43:18 -07001185 }
1186 /* Error if we find a perfect match which
1187 * uses the same scope, type, and nexthop
1188 * information.
1189 */
Julian Anastasov936f6f82008-01-28 21:18:06 -08001190 if (fa_match)
1191 goto out;
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001192
Thomas Graf4e902c52006-08-17 18:14:52 -07001193 if (!(cfg->fc_nlflags & NLM_F_APPEND))
Julian Anastasov936f6f82008-01-28 21:18:06 -08001194 fa = fa_first;
Robert Olsson19baf832005-06-21 12:43:18 -07001195 }
1196 err = -ENOENT;
Thomas Graf4e902c52006-08-17 18:14:52 -07001197 if (!(cfg->fc_nlflags & NLM_F_CREATE))
Robert Olsson19baf832005-06-21 12:43:18 -07001198 goto out;
1199
1200 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001201 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Robert Olsson19baf832005-06-21 12:43:18 -07001202 if (new_fa == NULL)
1203 goto out;
1204
1205 new_fa->fa_info = fi;
1206 new_fa->fa_tos = tos;
Thomas Graf4e902c52006-08-17 18:14:52 -07001207 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001208 new_fa->fa_state = 0;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001209 new_fa->fa_slen = slen;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001210 new_fa->tb_id = tb->tb_id;
Robert Olsson19baf832005-06-21 12:43:18 -07001211
Scott Feldman8e05fd72015-03-05 21:21:19 -08001212 /* (Optionally) offload fib entry to switch hardware. */
1213 err = netdev_switch_fib_ipv4_add(key, plen, fi, tos,
Scott Feldmanf8f21472015-03-09 13:59:09 -07001214 cfg->fc_type,
1215 cfg->fc_nlflags,
1216 tb->tb_id);
Scott Feldman8e05fd72015-03-05 21:21:19 -08001217 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);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001231 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, new_fa->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 Duyck0ddcf432015-03-06 13:47:00 -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 Duyck88bae712015-03-06 09:54:52 -08001267 pn = t->kv;
1268 cindex = 0;
1269
1270 n = get_child_rcu(pn, cindex);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001271 if (!n)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001272 return -EAGAIN;
Robert Olsson19baf832005-06-21 12:43:18 -07001273
1274#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08001275 this_cpu_inc(stats->gets);
Robert Olsson19baf832005-06-21 12:43:18 -07001276#endif
1277
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001278 /* Step 1: Travel to the longest prefix match in the trie */
1279 for (;;) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001280 index = get_cindex(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
Alexander Duyck88bae712015-03-06 09:54:52 -08001351 /* If we don't have a parent then there is
1352 * nothing for us to do as we do not have any
1353 * further nodes to parse.
1354 */
1355 if (IS_TRIE(pn))
Alexander Duyck345e9b52014-12-31 10:56:24 -08001356 return -EAGAIN;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001357#ifdef CONFIG_IP_FIB_TRIE_STATS
1358 this_cpu_inc(stats->backtrack);
1359#endif
1360 /* Get Child's index */
Alexander Duyck88bae712015-03-06 09:54:52 -08001361 pn = node_parent_rcu(pn);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001362 cindex = get_index(pkey, pn);
1363 }
1364
1365 /* strip the least significant bit from the cindex */
1366 cindex &= cindex - 1;
1367
1368 /* grab pointer for next child node */
Alexander Duyck41b489f2015-03-04 15:02:33 -08001369 cptr = &pn->tnode[cindex];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001370 }
Robert Olsson19baf832005-06-21 12:43:18 -07001371 }
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001372
Robert Olsson19baf832005-06-21 12:43:18 -07001373found:
Alexander Duyck71e8b672015-03-04 15:04:03 -08001374 /* this line carries forward the xor from earlier in the function */
1375 index = key ^ n->key;
1376
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001377 /* Step 3: Process the leaf, if that fails fall back to backtracing */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001378 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
1379 struct fib_info *fi = fa->fa_info;
1380 int nhsel, err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001381
Alexander Duyck71e8b672015-03-04 15:04:03 -08001382 if ((index >= (1ul << fa->fa_slen)) &&
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001383 ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen != KEYLENGTH)))
Alexander Duyck71e8b672015-03-04 15:04:03 -08001384 continue;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001385 if (fa->fa_tos && fa->fa_tos != flp->flowi4_tos)
1386 continue;
1387 if (fi->fib_dead)
1388 continue;
1389 if (fa->fa_info->fib_scope < flp->flowi4_scope)
1390 continue;
1391 fib_alias_accessed(fa);
1392 err = fib_props[fa->fa_type].error;
1393 if (unlikely(err < 0)) {
Alexander Duyck345e9b52014-12-31 10:56:24 -08001394#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001395 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001396#endif
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001397 return err;
1398 }
1399 if (fi->fib_flags & RTNH_F_DEAD)
1400 continue;
1401 for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) {
1402 const struct fib_nh *nh = &fi->fib_nh[nhsel];
1403
1404 if (nh->nh_flags & RTNH_F_DEAD)
Alexander Duyck345e9b52014-12-31 10:56:24 -08001405 continue;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001406 if (flp->flowi4_oif && flp->flowi4_oif != nh->nh_oif)
1407 continue;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001408
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001409 if (!(fib_flags & FIB_LOOKUP_NOREF))
1410 atomic_inc(&fi->fib_clntref);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001411
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001412 res->prefixlen = KEYLENGTH - fa->fa_slen;
1413 res->nh_sel = nhsel;
1414 res->type = fa->fa_type;
1415 res->scope = fi->fib_scope;
1416 res->fi = fi;
1417 res->table = tb;
1418 res->fa_head = &n->leaf;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001419#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001420 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001421#endif
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001422 return err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001423 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001424 }
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001425#ifdef CONFIG_IP_FIB_TRIE_STATS
1426 this_cpu_inc(stats->semantic_match_miss);
1427#endif
Alexander Duyck345e9b52014-12-31 10:56:24 -08001428 goto backtrace;
Robert Olsson19baf832005-06-21 12:43:18 -07001429}
Florian Westphal6fc01432011-08-25 13:46:12 +02001430EXPORT_SYMBOL_GPL(fib_table_lookup);
Robert Olsson19baf832005-06-21 12:43:18 -07001431
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001432static void fib_remove_alias(struct trie *t, struct key_vector *tp,
1433 struct key_vector *l, struct fib_alias *old)
Alexander Duyckd5d64872015-03-04 15:02:18 -08001434{
1435 /* record the location of the previous list_info entry */
1436 struct hlist_node **pprev = old->fa_list.pprev;
1437 struct fib_alias *fa = hlist_entry(pprev, typeof(*fa), fa_list.next);
1438
1439 /* remove the fib_alias from the list */
1440 hlist_del_rcu(&old->fa_list);
1441
1442 /* if we emptied the list this leaf will be freed and we can sort
1443 * out parent suffix lengths as a part of trie_rebalance
1444 */
1445 if (hlist_empty(&l->leaf)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001446 put_child_root(tp, l->key, NULL);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001447 node_free(l);
1448 trie_rebalance(t, tp);
1449 return;
1450 }
1451
1452 /* only access fa if it is pointing at the last valid hlist_node */
1453 if (*pprev)
1454 return;
1455
1456 /* update the trie with the latest suffix length */
1457 l->slen = fa->fa_slen;
1458 leaf_pull_suffix(tp, l);
1459}
1460
1461/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001462int fib_table_delete(struct fib_table *tb, struct fib_config *cfg)
Robert Olsson19baf832005-06-21 12:43:18 -07001463{
1464 struct trie *t = (struct trie *) tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001465 struct fib_alias *fa, *fa_to_delete;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001466 struct key_vector *l, *tp;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001467 u8 plen = cfg->fc_dst_len;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001468 u8 slen = KEYLENGTH - plen;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001469 u8 tos = cfg->fc_tos;
1470 u32 key;
Olof Johansson91b9a272005-08-09 20:24:39 -07001471
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001472 if (plen > KEYLENGTH)
Robert Olsson19baf832005-06-21 12:43:18 -07001473 return -EINVAL;
1474
Thomas Graf4e902c52006-08-17 18:14:52 -07001475 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001476
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001477 if ((plen < KEYLENGTH) && (key << plen))
Robert Olsson19baf832005-06-21 12:43:18 -07001478 return -EINVAL;
1479
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001480 l = fib_find_node(t, &tp, key);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001481 if (!l)
Robert Olsson19baf832005-06-21 12:43:18 -07001482 return -ESRCH;
1483
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001484 fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id);
Robert Olsson19baf832005-06-21 12:43:18 -07001485 if (!fa)
1486 return -ESRCH;
1487
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001488 pr_debug("Deleting %08x/%d tos=%d t=%p\n", key, plen, tos, t);
Robert Olsson19baf832005-06-21 12:43:18 -07001489
1490 fa_to_delete = NULL;
Alexander Duyck56315f92015-02-25 15:31:31 -08001491 hlist_for_each_entry_from(fa, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001492 struct fib_info *fi = fa->fa_info;
1493
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001494 if ((fa->fa_slen != slen) ||
1495 (fa->tb_id != tb->tb_id) ||
1496 (fa->fa_tos != tos))
Robert Olsson19baf832005-06-21 12:43:18 -07001497 break;
1498
Thomas Graf4e902c52006-08-17 18:14:52 -07001499 if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) &&
1500 (cfg->fc_scope == RT_SCOPE_NOWHERE ||
David S. Miller37e826c2011-03-24 18:06:47 -07001501 fa->fa_info->fib_scope == cfg->fc_scope) &&
Julian Anastasov74cb3c12011-03-19 12:13:46 +00001502 (!cfg->fc_prefsrc ||
1503 fi->fib_prefsrc == cfg->fc_prefsrc) &&
Thomas Graf4e902c52006-08-17 18:14:52 -07001504 (!cfg->fc_protocol ||
1505 fi->fib_protocol == cfg->fc_protocol) &&
1506 fib_nh_match(cfg, fi) == 0) {
Robert Olsson19baf832005-06-21 12:43:18 -07001507 fa_to_delete = fa;
1508 break;
1509 }
1510 }
1511
Olof Johansson91b9a272005-08-09 20:24:39 -07001512 if (!fa_to_delete)
1513 return -ESRCH;
Robert Olsson19baf832005-06-21 12:43:18 -07001514
Scott Feldman8e05fd72015-03-05 21:21:19 -08001515 netdev_switch_fib_ipv4_del(key, plen, fa_to_delete->fa_info, tos,
1516 cfg->fc_type, tb->tb_id);
1517
Alexander Duyckd5d64872015-03-04 15:02:18 -08001518 rtmsg_fib(RTM_DELROUTE, htonl(key), fa_to_delete, plen, tb->tb_id,
Milan Kocianb8f55832007-05-23 14:55:06 -07001519 &cfg->fc_nlinfo, 0);
Robert Olsson19baf832005-06-21 12:43:18 -07001520
David S. Miller21d8c492011-04-14 14:49:37 -07001521 if (!plen)
1522 tb->tb_num_default--;
1523
Alexander Duyckd5d64872015-03-04 15:02:18 -08001524 fib_remove_alias(t, tp, l, fa_to_delete);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001525
Alexander Duyckd5d64872015-03-04 15:02:18 -08001526 if (fa_to_delete->fa_state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001527 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Olof Johansson91b9a272005-08-09 20:24:39 -07001528
Alexander Duyckd5d64872015-03-04 15:02:18 -08001529 fib_release_info(fa_to_delete->fa_info);
1530 alias_free_mem_rcu(fa_to_delete);
Olof Johansson91b9a272005-08-09 20:24:39 -07001531 return 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001532}
1533
Alexander Duyck8be33e92015-03-04 14:59:19 -08001534/* Scan for the next leaf starting at the provided key value */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001535static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -07001536{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001537 struct key_vector *pn, *n = *tn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001538 unsigned long cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001539
Alexander Duyck8be33e92015-03-04 14:59:19 -08001540 /* this loop is meant to try and find the key in the trie */
Alexander Duyck88bae712015-03-06 09:54:52 -08001541 do {
1542 /* record parent and next child index */
1543 pn = n;
Alexander Duyck3ec320d2015-03-10 11:25:41 -07001544 cindex = key ? get_index(key, pn) : 0;
Alexander Duyck88bae712015-03-06 09:54:52 -08001545
1546 if (cindex >> pn->bits)
1547 break;
1548
1549 /* descend into the next child */
1550 n = get_child_rcu(pn, cindex++);
1551 if (!n)
1552 break;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001553
Alexander Duyck8be33e92015-03-04 14:59:19 -08001554 /* guarantee forward progress on the keys */
1555 if (IS_LEAF(n) && (n->key >= key))
1556 goto found;
Alexander Duyck88bae712015-03-06 09:54:52 -08001557 } while (IS_TNODE(n));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001558
1559 /* this loop will search for the next leaf with a greater key */
Alexander Duyck88bae712015-03-06 09:54:52 -08001560 while (!IS_TRIE(pn)) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001561 /* if we exhausted the parent node we will need to climb */
1562 if (cindex >= (1ul << pn->bits)) {
1563 t_key pkey = pn->key;
1564
1565 pn = node_parent_rcu(pn);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001566 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 */
Alexander Duyck88bae712015-03-06 09:54:52 -08001588 *tn = pn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001589 return n;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001590}
1591
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001592static void fib_trie_free(struct fib_table *tb)
1593{
1594 struct trie *t = (struct trie *)tb->tb_data;
1595 struct key_vector *pn = t->kv;
1596 unsigned long cindex = 1;
1597 struct hlist_node *tmp;
1598 struct fib_alias *fa;
1599
1600 /* walk trie in reverse order and free everything */
1601 for (;;) {
1602 struct key_vector *n;
1603
1604 if (!(cindex--)) {
1605 t_key pkey = pn->key;
1606
1607 if (IS_TRIE(pn))
1608 break;
1609
1610 n = pn;
1611 pn = node_parent(pn);
1612
1613 /* drop emptied tnode */
1614 put_child_root(pn, n->key, NULL);
1615 node_free(n);
1616
1617 cindex = get_index(pkey, pn);
1618
1619 continue;
1620 }
1621
1622 /* grab the next available node */
1623 n = get_child(pn, cindex);
1624 if (!n)
1625 continue;
1626
1627 if (IS_TNODE(n)) {
1628 /* record pn and cindex for leaf walking */
1629 pn = n;
1630 cindex = 1ul << n->bits;
1631
1632 continue;
1633 }
1634
1635 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1636 hlist_del_rcu(&fa->fa_list);
1637 alias_free_mem_rcu(fa);
1638 }
1639
1640 put_child_root(pn, n->key, NULL);
1641 node_free(n);
1642 }
1643
1644#ifdef CONFIG_IP_FIB_TRIE_STATS
1645 free_percpu(t->stats);
1646#endif
1647 kfree(tb);
1648}
1649
1650struct fib_table *fib_trie_unmerge(struct fib_table *oldtb)
1651{
1652 struct trie *ot = (struct trie *)oldtb->tb_data;
1653 struct key_vector *l, *tp = ot->kv;
1654 struct fib_table *local_tb;
1655 struct fib_alias *fa;
1656 struct trie *lt;
1657 t_key key = 0;
1658
1659 if (oldtb->tb_data == oldtb->__data)
1660 return oldtb;
1661
1662 local_tb = fib_trie_table(RT_TABLE_LOCAL, NULL);
1663 if (!local_tb)
1664 return NULL;
1665
1666 lt = (struct trie *)local_tb->tb_data;
1667
1668 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
1669 struct key_vector *local_l = NULL, *local_tp;
1670
1671 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
1672 struct fib_alias *new_fa;
1673
1674 if (local_tb->tb_id != fa->tb_id)
1675 continue;
1676
1677 /* clone fa for new local table */
1678 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
1679 if (!new_fa)
1680 goto out;
1681
1682 memcpy(new_fa, fa, sizeof(*fa));
1683
1684 /* insert clone into table */
1685 if (!local_l)
1686 local_l = fib_find_node(lt, &local_tp, l->key);
1687
1688 if (fib_insert_alias(lt, local_tp, local_l, new_fa,
1689 NULL, l->key))
1690 goto out;
1691 }
1692
1693 /* stop loop if key wrapped back to 0 */
1694 key = l->key + 1;
1695 if (key < l->key)
1696 break;
1697 }
1698
1699 return local_tb;
1700out:
1701 fib_trie_free(local_tb);
1702
1703 return NULL;
1704}
1705
Scott Feldman104616e2015-03-05 21:21:16 -08001706/* Caller must hold RTNL */
1707void fib_table_flush_external(struct fib_table *tb)
1708{
1709 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001710 struct key_vector *pn = t->kv;
1711 unsigned long cindex = 1;
1712 struct hlist_node *tmp;
Scott Feldman104616e2015-03-05 21:21:16 -08001713 struct fib_alias *fa;
Scott Feldman104616e2015-03-05 21:21:16 -08001714
Alexander Duyck88bae712015-03-06 09:54:52 -08001715 /* walk trie in reverse order */
1716 for (;;) {
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001717 unsigned char slen = 0;
Alexander Duyck88bae712015-03-06 09:54:52 -08001718 struct key_vector *n;
Scott Feldman104616e2015-03-05 21:21:16 -08001719
Alexander Duyck88bae712015-03-06 09:54:52 -08001720 if (!(cindex--)) {
1721 t_key pkey = pn->key;
Scott Feldman104616e2015-03-05 21:21:16 -08001722
Alexander Duyck88bae712015-03-06 09:54:52 -08001723 /* cannot resize the trie vector */
1724 if (IS_TRIE(pn))
1725 break;
Scott Feldman104616e2015-03-05 21:21:16 -08001726
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001727 /* resize completed node */
1728 pn = resize(t, pn);
Alexander Duyck88bae712015-03-06 09:54:52 -08001729 cindex = get_index(pkey, pn);
Scott Feldman104616e2015-03-05 21:21:16 -08001730
Alexander Duyck88bae712015-03-06 09:54:52 -08001731 continue;
1732 }
Scott Feldman104616e2015-03-05 21:21:16 -08001733
Alexander Duyck88bae712015-03-06 09:54:52 -08001734 /* grab the next available node */
1735 n = get_child(pn, cindex);
1736 if (!n)
Alexander Duyck72be7262015-03-06 09:53:56 -08001737 continue;
1738
Alexander Duyck88bae712015-03-06 09:54:52 -08001739 if (IS_TNODE(n)) {
1740 /* record pn and cindex for leaf walking */
1741 pn = n;
1742 cindex = 1ul << n->bits;
Scott Feldman104616e2015-03-05 21:21:16 -08001743
Alexander Duyck88bae712015-03-06 09:54:52 -08001744 continue;
1745 }
1746
1747 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1748 struct fib_info *fi = fa->fa_info;
1749
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001750 /* if alias was cloned to local then we just
1751 * need to remove the local copy from main
1752 */
1753 if (tb->tb_id != fa->tb_id) {
1754 hlist_del_rcu(&fa->fa_list);
1755 alias_free_mem_rcu(fa);
1756 continue;
1757 }
1758
1759 /* record local slen */
1760 slen = fa->fa_slen;
1761
Alexander Duyck88bae712015-03-06 09:54:52 -08001762 if (!fi || !(fi->fib_flags & RTNH_F_EXTERNAL))
1763 continue;
1764
1765 netdev_switch_fib_ipv4_del(n->key,
1766 KEYLENGTH - fa->fa_slen,
1767 fi, fa->fa_tos,
1768 fa->fa_type, tb->tb_id);
1769 }
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001770
1771 /* update leaf slen */
1772 n->slen = slen;
1773
1774 if (hlist_empty(&n->leaf)) {
1775 put_child_root(pn, n->key, NULL);
1776 node_free(n);
1777 } else {
1778 leaf_pull_suffix(pn, n);
1779 }
Alexander Duyck88bae712015-03-06 09:54:52 -08001780 }
Scott Feldman104616e2015-03-05 21:21:16 -08001781}
1782
Alexander Duyck8be33e92015-03-04 14:59:19 -08001783/* Caller must hold RTNL. */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001784int fib_table_flush(struct fib_table *tb)
Robert Olsson19baf832005-06-21 12:43:18 -07001785{
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001786 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001787 struct key_vector *pn = t->kv;
1788 unsigned long cindex = 1;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001789 struct hlist_node *tmp;
1790 struct fib_alias *fa;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001791 int found = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001792
Alexander Duyck88bae712015-03-06 09:54:52 -08001793 /* walk trie in reverse order */
1794 for (;;) {
1795 unsigned char slen = 0;
1796 struct key_vector *n;
Robert Olsson19baf832005-06-21 12:43:18 -07001797
Alexander Duyck88bae712015-03-06 09:54:52 -08001798 if (!(cindex--)) {
1799 t_key pkey = pn->key;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001800
Alexander Duyck88bae712015-03-06 09:54:52 -08001801 /* cannot resize the trie vector */
1802 if (IS_TRIE(pn))
1803 break;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001804
Alexander Duyck88bae712015-03-06 09:54:52 -08001805 /* resize completed node */
1806 pn = resize(t, pn);
1807 cindex = get_index(pkey, pn);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001808
Alexander Duyck88bae712015-03-06 09:54:52 -08001809 continue;
1810 }
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001811
Alexander Duyck88bae712015-03-06 09:54:52 -08001812 /* grab the next available node */
1813 n = get_child(pn, cindex);
1814 if (!n)
1815 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001816
Alexander Duyck88bae712015-03-06 09:54:52 -08001817 if (IS_TNODE(n)) {
1818 /* record pn and cindex for leaf walking */
1819 pn = n;
1820 cindex = 1ul << n->bits;
1821
1822 continue;
1823 }
1824
1825 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1826 struct fib_info *fi = fa->fa_info;
1827
1828 if (!fi || !(fi->fib_flags & RTNH_F_DEAD)) {
1829 slen = fa->fa_slen;
1830 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001831 }
1832
Scott Feldman8e05fd72015-03-05 21:21:19 -08001833 netdev_switch_fib_ipv4_del(n->key,
1834 KEYLENGTH - fa->fa_slen,
1835 fi, fa->fa_tos,
1836 fa->fa_type, tb->tb_id);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001837 hlist_del_rcu(&fa->fa_list);
1838 fib_release_info(fa->fa_info);
1839 alias_free_mem_rcu(fa);
1840 found++;
Alexander Duyck64c62722015-01-22 15:51:45 -08001841 }
1842
Alexander Duyck88bae712015-03-06 09:54:52 -08001843 /* update leaf slen */
1844 n->slen = slen;
1845
1846 if (hlist_empty(&n->leaf)) {
1847 put_child_root(pn, n->key, NULL);
1848 node_free(n);
1849 } else {
1850 leaf_pull_suffix(pn, n);
1851 }
Robert Olsson19baf832005-06-21 12:43:18 -07001852 }
1853
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07001854 pr_debug("trie_flush found=%d\n", found);
Robert Olsson19baf832005-06-21 12:43:18 -07001855 return found;
1856}
1857
Alexander Duycka7e53532015-03-04 15:02:44 -08001858static void __trie_free_rcu(struct rcu_head *head)
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001859{
Alexander Duycka7e53532015-03-04 15:02:44 -08001860 struct fib_table *tb = container_of(head, struct fib_table, rcu);
Alexander Duyck8274a972014-12-31 10:55:29 -08001861#ifdef CONFIG_IP_FIB_TRIE_STATS
1862 struct trie *t = (struct trie *)tb->tb_data;
1863
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001864 if (tb->tb_data == tb->__data)
1865 free_percpu(t->stats);
Alexander Duyck8274a972014-12-31 10:55:29 -08001866#endif /* CONFIG_IP_FIB_TRIE_STATS */
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00001867 kfree(tb);
1868}
1869
Alexander Duycka7e53532015-03-04 15:02:44 -08001870void fib_free_table(struct fib_table *tb)
1871{
1872 call_rcu(&tb->rcu, __trie_free_rcu);
1873}
1874
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001875static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001876 struct sk_buff *skb, struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001877{
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001878 __be32 xkey = htonl(l->key);
Robert Olsson19baf832005-06-21 12:43:18 -07001879 struct fib_alias *fa;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001880 int i, s_i;
Robert Olsson19baf832005-06-21 12:43:18 -07001881
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001882 s_i = cb->args[4];
Robert Olsson19baf832005-06-21 12:43:18 -07001883 i = 0;
1884
Robert Olsson2373ce12005-08-25 13:01:29 -07001885 /* rcu_read_lock is hold by caller */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001886 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001887 if (i < s_i) {
1888 i++;
1889 continue;
1890 }
Robert Olsson19baf832005-06-21 12:43:18 -07001891
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001892 if (tb->tb_id != fa->tb_id) {
1893 i++;
1894 continue;
1895 }
1896
Eric W. Biederman15e47302012-09-07 20:12:54 +00001897 if (fib_dump_info(skb, NETLINK_CB(cb->skb).portid,
Robert Olsson19baf832005-06-21 12:43:18 -07001898 cb->nlh->nlmsg_seq,
1899 RTM_NEWROUTE,
1900 tb->tb_id,
1901 fa->fa_type,
Thomas Grafbe403ea2006-08-17 18:15:17 -07001902 xkey,
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001903 KEYLENGTH - fa->fa_slen,
Robert Olsson19baf832005-06-21 12:43:18 -07001904 fa->fa_tos,
Stephen Hemminger64347f72008-01-22 21:55:01 -08001905 fa->fa_info, NLM_F_MULTI) < 0) {
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001906 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001907 return -1;
1908 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001909 i++;
Robert Olsson19baf832005-06-21 12:43:18 -07001910 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001911
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001912 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07001913 return skb->len;
1914}
1915
Alexander Duycka7e53532015-03-04 15:02:44 -08001916/* rcu_read_lock needs to be hold by caller from readside */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00001917int fib_table_dump(struct fib_table *tb, struct sk_buff *skb,
1918 struct netlink_callback *cb)
Robert Olsson19baf832005-06-21 12:43:18 -07001919{
Alexander Duyck8be33e92015-03-04 14:59:19 -08001920 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001921 struct key_vector *l, *tp = t->kv;
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001922 /* Dump starting at last key.
1923 * Note: 0.0.0.0/0 (ie default) is first key.
1924 */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001925 int count = cb->args[2];
1926 t_key key = cb->args[3];
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001927
Alexander Duyck8be33e92015-03-04 14:59:19 -08001928 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001929 if (fn_trie_dump_leaf(l, tb, skb, cb) < 0) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001930 cb->args[3] = key;
1931 cb->args[2] = count;
Stephen Hemmingera88ee222008-01-22 21:56:11 -08001932 return -1;
Robert Olsson19baf832005-06-21 12:43:18 -07001933 }
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08001934
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001935 ++count;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001936 key = l->key + 1;
1937
Stephen Hemminger71d67e62008-01-31 16:45:47 -08001938 memset(&cb->args[4], 0,
1939 sizeof(cb->args) - 4*sizeof(cb->args[0]));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001940
1941 /* stop loop if key wrapped back to 0 */
1942 if (key < l->key)
1943 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001944 }
Alexander Duyck8be33e92015-03-04 14:59:19 -08001945
Alexander Duyck8be33e92015-03-04 14:59:19 -08001946 cb->args[3] = key;
1947 cb->args[2] = count;
1948
Robert Olsson19baf832005-06-21 12:43:18 -07001949 return skb->len;
Robert Olsson19baf832005-06-21 12:43:18 -07001950}
1951
David S. Miller5348ba82011-02-01 15:30:56 -08001952void __init fib_trie_init(void)
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001953{
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001954 fn_alias_kmem = kmem_cache_create("ip_fib_alias",
1955 sizeof(struct fib_alias),
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08001956 0, SLAB_PANIC, NULL);
1957
1958 trie_leaf_kmem = kmem_cache_create("ip_fib_trie",
Alexander Duyck41b489f2015-03-04 15:02:33 -08001959 LEAF_SIZE,
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08001960 0, SLAB_PANIC, NULL);
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08001961}
Robert Olsson19baf832005-06-21 12:43:18 -07001962
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001963struct fib_table *fib_trie_table(u32 id, struct fib_table *alias)
Robert Olsson19baf832005-06-21 12:43:18 -07001964{
1965 struct fib_table *tb;
1966 struct trie *t;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001967 size_t sz = sizeof(*tb);
Robert Olsson19baf832005-06-21 12:43:18 -07001968
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001969 if (!alias)
1970 sz += sizeof(struct trie);
1971
1972 tb = kzalloc(sz, GFP_KERNEL);
Robert Olsson19baf832005-06-21 12:43:18 -07001973 if (tb == NULL)
1974 return NULL;
1975
1976 tb->tb_id = id;
Denis V. Lunev971b8932007-12-08 00:32:23 -08001977 tb->tb_default = -1;
David S. Miller21d8c492011-04-14 14:49:37 -07001978 tb->tb_num_default = 0;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001979 tb->tb_data = (alias ? alias->__data : tb->__data);
1980
1981 if (alias)
1982 return tb;
Robert Olsson19baf832005-06-21 12:43:18 -07001983
1984 t = (struct trie *) tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08001985 t->kv[0].pos = KEYLENGTH;
1986 t->kv[0].slen = KEYLENGTH;
Alexander Duyck8274a972014-12-31 10:55:29 -08001987#ifdef CONFIG_IP_FIB_TRIE_STATS
1988 t->stats = alloc_percpu(struct trie_use_stats);
1989 if (!t->stats) {
1990 kfree(tb);
1991 tb = NULL;
1992 }
1993#endif
Robert Olsson19baf832005-06-21 12:43:18 -07001994
Robert Olsson19baf832005-06-21 12:43:18 -07001995 return tb;
1996}
1997
Robert Olsson19baf832005-06-21 12:43:18 -07001998#ifdef CONFIG_PROC_FS
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07001999/* Depth first Trie walk iterator */
2000struct fib_trie_iter {
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002001 struct seq_net_private p;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002002 struct fib_table *tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002003 struct key_vector *tnode;
Eric Dumazeta034ee32010-09-09 23:32:28 +00002004 unsigned int index;
2005 unsigned int depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002006};
Robert Olsson19baf832005-06-21 12:43:18 -07002007
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002008static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)
Robert Olsson19baf832005-06-21 12:43:18 -07002009{
Alexander Duyck98293e82014-12-31 10:56:18 -08002010 unsigned long cindex = iter->index;
Alexander Duyck88bae712015-03-06 09:54:52 -08002011 struct key_vector *pn = iter->tnode;
2012 t_key pkey;
Eric W. Biederman6640e692007-01-24 14:42:04 -08002013
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002014 pr_debug("get_next iter={node=%p index=%d depth=%d}\n",
2015 iter->tnode, iter->index, iter->depth);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002016
Alexander Duyck88bae712015-03-06 09:54:52 -08002017 while (!IS_TRIE(pn)) {
2018 while (cindex < child_length(pn)) {
2019 struct key_vector *n = get_child_rcu(pn, cindex++);
2020
2021 if (!n)
2022 continue;
2023
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002024 if (IS_LEAF(n)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08002025 iter->tnode = pn;
2026 iter->index = cindex;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002027 } else {
2028 /* push down one level */
Alexander Duyckadaf9812014-12-31 10:55:47 -08002029 iter->tnode = n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002030 iter->index = 0;
2031 ++iter->depth;
2032 }
Alexander Duyck88bae712015-03-06 09:54:52 -08002033
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002034 return n;
2035 }
2036
Alexander Duyck88bae712015-03-06 09:54:52 -08002037 /* Current node exhausted, pop back up */
2038 pkey = pn->key;
2039 pn = node_parent_rcu(pn);
2040 cindex = get_index(pkey, pn) + 1;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002041 --iter->depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002042 }
2043
Alexander Duyck88bae712015-03-06 09:54:52 -08002044 /* record root node so further searches know we are done */
2045 iter->tnode = pn;
2046 iter->index = 0;
2047
Robert Olsson19baf832005-06-21 12:43:18 -07002048 return NULL;
2049}
2050
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002051static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,
2052 struct trie *t)
Robert Olsson19baf832005-06-21 12:43:18 -07002053{
Alexander Duyck88bae712015-03-06 09:54:52 -08002054 struct key_vector *n, *pn = t->kv;
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002055
Stephen Hemminger132adf52007-03-08 20:44:43 -08002056 if (!t)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002057 return NULL;
2058
Alexander Duyck88bae712015-03-06 09:54:52 -08002059 n = rcu_dereference(pn->tnode[0]);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002060 if (!n)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002061 return NULL;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002062
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002063 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002064 iter->tnode = n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002065 iter->index = 0;
2066 iter->depth = 1;
2067 } else {
Alexander Duyck88bae712015-03-06 09:54:52 -08002068 iter->tnode = pn;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002069 iter->index = 0;
2070 iter->depth = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002071 }
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002072
2073 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002074}
2075
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002076static void trie_collect_stats(struct trie *t, struct trie_stat *s)
Robert Olsson19baf832005-06-21 12:43:18 -07002077{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002078 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002079 struct fib_trie_iter iter;
Robert Olsson19baf832005-06-21 12:43:18 -07002080
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002081 memset(s, 0, sizeof(*s));
Robert Olsson19baf832005-06-21 12:43:18 -07002082
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002083 rcu_read_lock();
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002084 for (n = fib_trie_get_first(&iter, t); n; n = fib_trie_get_next(&iter)) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002085 if (IS_LEAF(n)) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002086 struct fib_alias *fa;
Stephen Hemminger93672292008-01-22 21:54:05 -08002087
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002088 s->leaves++;
2089 s->totdepth += iter.depth;
2090 if (iter.depth > s->maxdepth)
2091 s->maxdepth = iter.depth;
Stephen Hemminger93672292008-01-22 21:54:05 -08002092
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002093 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list)
Stephen Hemminger93672292008-01-22 21:54:05 -08002094 ++s->prefixes;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002095 } else {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002096 s->tnodes++;
Alexander Duyckadaf9812014-12-31 10:55:47 -08002097 if (n->bits < MAX_STAT_DEPTH)
2098 s->nodesizes[n->bits]++;
Alexander Duyck6e22d172015-03-06 09:54:39 -08002099 s->nullpointers += tn_info(n)->empty_children;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002100 }
2101 }
2102 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002103}
2104
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002105/*
Robert Olsson19baf832005-06-21 12:43:18 -07002106 * This outputs /proc/net/fib_triestats
Robert Olsson19baf832005-06-21 12:43:18 -07002107 */
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002108static void trie_show_stats(struct seq_file *seq, struct trie_stat *stat)
Robert Olsson19baf832005-06-21 12:43:18 -07002109{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002110 unsigned int i, max, pointers, bytes, avdepth;
Robert Olsson19baf832005-06-21 12:43:18 -07002111
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002112 if (stat->leaves)
2113 avdepth = stat->totdepth*100 / stat->leaves;
2114 else
2115 avdepth = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07002116
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002117 seq_printf(seq, "\tAver depth: %u.%02d\n",
2118 avdepth / 100, avdepth % 100);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002119 seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth);
Robert Olsson19baf832005-06-21 12:43:18 -07002120
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002121 seq_printf(seq, "\tLeaves: %u\n", stat->leaves);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002122 bytes = LEAF_SIZE * stat->leaves;
Stephen Hemminger93672292008-01-22 21:54:05 -08002123
2124 seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002125 bytes += sizeof(struct fib_alias) * stat->prefixes;
Stephen Hemminger93672292008-01-22 21:54:05 -08002126
Stephen Hemminger187b5182008-01-12 20:55:55 -08002127 seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002128 bytes += TNODE_SIZE(0) * stat->tnodes;
Robert Olsson19baf832005-06-21 12:43:18 -07002129
Robert Olsson06ef9212006-03-20 21:35:01 -08002130 max = MAX_STAT_DEPTH;
2131 while (max > 0 && stat->nodesizes[max-1] == 0)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002132 max--;
Robert Olsson19baf832005-06-21 12:43:18 -07002133
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002134 pointers = 0;
Jerry Snitselaarf585a992013-07-22 12:01:58 -07002135 for (i = 1; i < max; i++)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002136 if (stat->nodesizes[i] != 0) {
Stephen Hemminger187b5182008-01-12 20:55:55 -08002137 seq_printf(seq, " %u: %u", i, stat->nodesizes[i]);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002138 pointers += (1<<i) * stat->nodesizes[i];
2139 }
2140 seq_putc(seq, '\n');
Stephen Hemminger187b5182008-01-12 20:55:55 -08002141 seq_printf(seq, "\tPointers: %u\n", pointers);
Robert Olsson19baf832005-06-21 12:43:18 -07002142
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002143 bytes += sizeof(struct key_vector *) * pointers;
Stephen Hemminger187b5182008-01-12 20:55:55 -08002144 seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers);
2145 seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024);
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002146}
Robert Olsson19baf832005-06-21 12:43:18 -07002147
2148#ifdef CONFIG_IP_FIB_TRIE_STATS
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002149static void trie_show_usage(struct seq_file *seq,
Alexander Duyck8274a972014-12-31 10:55:29 -08002150 const struct trie_use_stats __percpu *stats)
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002151{
Alexander Duyck8274a972014-12-31 10:55:29 -08002152 struct trie_use_stats s = { 0 };
2153 int cpu;
2154
2155 /* loop through all of the CPUs and gather up the stats */
2156 for_each_possible_cpu(cpu) {
2157 const struct trie_use_stats *pcpu = per_cpu_ptr(stats, cpu);
2158
2159 s.gets += pcpu->gets;
2160 s.backtrack += pcpu->backtrack;
2161 s.semantic_match_passed += pcpu->semantic_match_passed;
2162 s.semantic_match_miss += pcpu->semantic_match_miss;
2163 s.null_node_hit += pcpu->null_node_hit;
2164 s.resize_node_skipped += pcpu->resize_node_skipped;
2165 }
2166
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002167 seq_printf(seq, "\nCounters:\n---------\n");
Alexander Duyck8274a972014-12-31 10:55:29 -08002168 seq_printf(seq, "gets = %u\n", s.gets);
2169 seq_printf(seq, "backtracks = %u\n", s.backtrack);
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002170 seq_printf(seq, "semantic match passed = %u\n",
Alexander Duyck8274a972014-12-31 10:55:29 -08002171 s.semantic_match_passed);
2172 seq_printf(seq, "semantic match miss = %u\n", s.semantic_match_miss);
2173 seq_printf(seq, "null node hit= %u\n", s.null_node_hit);
2174 seq_printf(seq, "skipped node resize = %u\n\n", s.resize_node_skipped);
Robert Olsson19baf832005-06-21 12:43:18 -07002175}
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002176#endif /* CONFIG_IP_FIB_TRIE_STATS */
2177
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002178static void fib_table_print(struct seq_file *seq, struct fib_table *tb)
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002179{
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002180 if (tb->tb_id == RT_TABLE_LOCAL)
2181 seq_puts(seq, "Local:\n");
2182 else if (tb->tb_id == RT_TABLE_MAIN)
2183 seq_puts(seq, "Main:\n");
2184 else
2185 seq_printf(seq, "Id %d:\n", tb->tb_id);
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002186}
Robert Olsson19baf832005-06-21 12:43:18 -07002187
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002188
Robert Olsson19baf832005-06-21 12:43:18 -07002189static int fib_triestat_seq_show(struct seq_file *seq, void *v)
2190{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002191 struct net *net = (struct net *)seq->private;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002192 unsigned int h;
Eric W. Biederman877a9bf2007-12-07 00:47:47 -08002193
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002194 seq_printf(seq,
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002195 "Basic info: size of leaf:"
2196 " %Zd bytes, size of tnode: %Zd bytes.\n",
Alexander Duyck41b489f2015-03-04 15:02:33 -08002197 LEAF_SIZE, TNODE_SIZE(0));
Olof Johansson91b9a272005-08-09 20:24:39 -07002198
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002199 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2200 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002201 struct fib_table *tb;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002202
Sasha Levinb67bfe02013-02-27 17:06:00 -08002203 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002204 struct trie *t = (struct trie *) tb->tb_data;
2205 struct trie_stat stat;
2206
2207 if (!t)
2208 continue;
2209
2210 fib_table_print(seq, tb);
2211
2212 trie_collect_stats(t, &stat);
2213 trie_show_stats(seq, &stat);
2214#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08002215 trie_show_usage(seq, t->stats);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002216#endif
2217 }
2218 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002219
Robert Olsson19baf832005-06-21 12:43:18 -07002220 return 0;
2221}
2222
Robert Olsson19baf832005-06-21 12:43:18 -07002223static int fib_triestat_seq_open(struct inode *inode, struct file *file)
2224{
Pavel Emelyanovde05c552008-07-18 04:07:21 -07002225 return single_open_net(inode, file, fib_triestat_seq_show);
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002226}
2227
Arjan van de Ven9a321442007-02-12 00:55:35 -08002228static const struct file_operations fib_triestat_fops = {
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002229 .owner = THIS_MODULE,
2230 .open = fib_triestat_seq_open,
2231 .read = seq_read,
2232 .llseek = seq_lseek,
Pavel Emelyanovb6fcbdb2008-07-18 04:07:44 -07002233 .release = single_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002234};
2235
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002236static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)
Robert Olsson19baf832005-06-21 12:43:18 -07002237{
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002238 struct fib_trie_iter *iter = seq->private;
2239 struct net *net = seq_file_net(seq);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002240 loff_t idx = 0;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002241 unsigned int h;
Robert Olsson19baf832005-06-21 12:43:18 -07002242
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002243 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2244 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002245 struct fib_table *tb;
2246
Sasha Levinb67bfe02013-02-27 17:06:00 -08002247 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002248 struct key_vector *n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002249
2250 for (n = fib_trie_get_first(iter,
2251 (struct trie *) tb->tb_data);
2252 n; n = fib_trie_get_next(iter))
2253 if (pos == idx++) {
2254 iter->tb = tb;
2255 return n;
2256 }
2257 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002258 }
Robert Olsson19baf832005-06-21 12:43:18 -07002259
Robert Olsson19baf832005-06-21 12:43:18 -07002260 return NULL;
2261}
2262
2263static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002264 __acquires(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002265{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002266 rcu_read_lock();
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002267 return fib_trie_get_idx(seq, *pos);
Robert Olsson19baf832005-06-21 12:43:18 -07002268}
2269
2270static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2271{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002272 struct fib_trie_iter *iter = seq->private;
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002273 struct net *net = seq_file_net(seq);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002274 struct fib_table *tb = iter->tb;
2275 struct hlist_node *tb_node;
2276 unsigned int h;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002277 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002278
Robert Olsson19baf832005-06-21 12:43:18 -07002279 ++*pos;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002280 /* next node in same table */
2281 n = fib_trie_get_next(iter);
2282 if (n)
2283 return n;
Olof Johansson91b9a272005-08-09 20:24:39 -07002284
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002285 /* walk rest of this hash chain */
2286 h = tb->tb_id & (FIB_TABLE_HASHSZ - 1);
Eric Dumazet0a5c0472011-03-31 01:51:35 -07002287 while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002288 tb = hlist_entry(tb_node, struct fib_table, tb_hlist);
2289 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2290 if (n)
2291 goto found;
2292 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002293
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002294 /* new hash chain */
2295 while (++h < FIB_TABLE_HASHSZ) {
2296 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Sasha Levinb67bfe02013-02-27 17:06:00 -08002297 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002298 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2299 if (n)
2300 goto found;
2301 }
2302 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002303 return NULL;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002304
2305found:
2306 iter->tb = tb;
2307 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002308}
2309
2310static void fib_trie_seq_stop(struct seq_file *seq, void *v)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002311 __releases(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002312{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002313 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002314}
2315
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002316static void seq_indent(struct seq_file *seq, int n)
2317{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002318 while (n-- > 0)
2319 seq_puts(seq, " ");
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002320}
Robert Olsson19baf832005-06-21 12:43:18 -07002321
Eric Dumazet28d36e32008-01-14 23:09:56 -08002322static inline const char *rtn_scope(char *buf, size_t len, enum rt_scope_t s)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002323{
Stephen Hemminger132adf52007-03-08 20:44:43 -08002324 switch (s) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002325 case RT_SCOPE_UNIVERSE: return "universe";
2326 case RT_SCOPE_SITE: return "site";
2327 case RT_SCOPE_LINK: return "link";
2328 case RT_SCOPE_HOST: return "host";
2329 case RT_SCOPE_NOWHERE: return "nowhere";
2330 default:
Eric Dumazet28d36e32008-01-14 23:09:56 -08002331 snprintf(buf, len, "scope=%d", s);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002332 return buf;
2333 }
2334}
2335
Jan Engelhardt36cbd3d2009-08-05 10:42:58 -07002336static const char *const rtn_type_names[__RTN_MAX] = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002337 [RTN_UNSPEC] = "UNSPEC",
2338 [RTN_UNICAST] = "UNICAST",
2339 [RTN_LOCAL] = "LOCAL",
2340 [RTN_BROADCAST] = "BROADCAST",
2341 [RTN_ANYCAST] = "ANYCAST",
2342 [RTN_MULTICAST] = "MULTICAST",
2343 [RTN_BLACKHOLE] = "BLACKHOLE",
2344 [RTN_UNREACHABLE] = "UNREACHABLE",
2345 [RTN_PROHIBIT] = "PROHIBIT",
2346 [RTN_THROW] = "THROW",
2347 [RTN_NAT] = "NAT",
2348 [RTN_XRESOLVE] = "XRESOLVE",
2349};
2350
Eric Dumazeta034ee32010-09-09 23:32:28 +00002351static inline const char *rtn_type(char *buf, size_t len, unsigned int t)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002352{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002353 if (t < __RTN_MAX && rtn_type_names[t])
2354 return rtn_type_names[t];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002355 snprintf(buf, len, "type %u", t);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002356 return buf;
2357}
2358
2359/* Pretty print the trie */
Robert Olsson19baf832005-06-21 12:43:18 -07002360static int fib_trie_seq_show(struct seq_file *seq, void *v)
2361{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002362 const struct fib_trie_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002363 struct key_vector *n = v;
Robert Olsson19baf832005-06-21 12:43:18 -07002364
Alexander Duyck88bae712015-03-06 09:54:52 -08002365 if (IS_TRIE(node_parent_rcu(n)))
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002366 fib_table_print(seq, iter->tb);
Robert Olsson095b8502007-01-26 19:06:01 -08002367
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002368 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002369 __be32 prf = htonl(n->key);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002370
Alexander Duycke9b44012014-12-31 10:56:12 -08002371 seq_indent(seq, iter->depth-1);
2372 seq_printf(seq, " +-- %pI4/%zu %u %u %u\n",
2373 &prf, KEYLENGTH - n->pos - n->bits, n->bits,
Alexander Duyck6e22d172015-03-06 09:54:39 -08002374 tn_info(n)->full_children,
2375 tn_info(n)->empty_children);
Olof Johansson91b9a272005-08-09 20:24:39 -07002376 } else {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002377 __be32 val = htonl(n->key);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002378 struct fib_alias *fa;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002379
2380 seq_indent(seq, iter->depth);
Harvey Harrison673d57e2008-10-31 00:53:57 -07002381 seq_printf(seq, " |-- %pI4\n", &val);
Eric Dumazet28d36e32008-01-14 23:09:56 -08002382
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002383 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
2384 char buf1[32], buf2[32];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002385
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002386 seq_indent(seq, iter->depth + 1);
2387 seq_printf(seq, " /%zu %s %s",
2388 KEYLENGTH - fa->fa_slen,
2389 rtn_scope(buf1, sizeof(buf1),
2390 fa->fa_info->fib_scope),
2391 rtn_type(buf2, sizeof(buf2),
2392 fa->fa_type));
2393 if (fa->fa_tos)
2394 seq_printf(seq, " tos=%d", fa->fa_tos);
2395 seq_putc(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002396 }
Robert Olsson19baf832005-06-21 12:43:18 -07002397 }
2398
2399 return 0;
2400}
2401
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002402static const struct seq_operations fib_trie_seq_ops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002403 .start = fib_trie_seq_start,
2404 .next = fib_trie_seq_next,
2405 .stop = fib_trie_seq_stop,
2406 .show = fib_trie_seq_show,
Robert Olsson19baf832005-06-21 12:43:18 -07002407};
2408
2409static int fib_trie_seq_open(struct inode *inode, struct file *file)
2410{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002411 return seq_open_net(inode, file, &fib_trie_seq_ops,
2412 sizeof(struct fib_trie_iter));
Robert Olsson19baf832005-06-21 12:43:18 -07002413}
2414
Arjan van de Ven9a321442007-02-12 00:55:35 -08002415static const struct file_operations fib_trie_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002416 .owner = THIS_MODULE,
2417 .open = fib_trie_seq_open,
2418 .read = seq_read,
2419 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002420 .release = seq_release_net,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002421};
2422
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002423struct fib_route_iter {
2424 struct seq_net_private p;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002425 struct fib_table *main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002426 struct key_vector *tnode;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002427 loff_t pos;
2428 t_key key;
2429};
2430
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002431static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,
2432 loff_t pos)
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002433{
Alexander Duyck8be33e92015-03-04 14:59:19 -08002434 struct fib_table *tb = iter->main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002435 struct key_vector *l, **tp = &iter->tnode;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002436 struct trie *t;
2437 t_key key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002438
Alexander Duyck8be33e92015-03-04 14:59:19 -08002439 /* use cache location of next-to-find key */
2440 if (iter->pos > 0 && pos >= iter->pos) {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002441 pos -= iter->pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002442 key = iter->key;
2443 } else {
2444 t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002445 iter->tnode = t->kv;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002446 iter->pos = 0;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002447 key = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002448 }
2449
Alexander Duyck8be33e92015-03-04 14:59:19 -08002450 while ((l = leaf_walk_rcu(tp, key)) != NULL) {
2451 key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002452 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002453
2454 if (pos-- <= 0)
2455 break;
2456
2457 l = NULL;
2458
2459 /* handle unlikely case of a key wrap */
2460 if (!key)
2461 break;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002462 }
2463
2464 if (l)
Alexander Duyck8be33e92015-03-04 14:59:19 -08002465 iter->key = key; /* remember it */
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002466 else
2467 iter->pos = 0; /* forget it */
2468
2469 return l;
2470}
2471
2472static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos)
2473 __acquires(RCU)
2474{
2475 struct fib_route_iter *iter = seq->private;
2476 struct fib_table *tb;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002477 struct trie *t;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002478
2479 rcu_read_lock();
Alexander Duyck8be33e92015-03-04 14:59:19 -08002480
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002481 tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN);
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002482 if (!tb)
2483 return NULL;
2484
Alexander Duyck8be33e92015-03-04 14:59:19 -08002485 iter->main_tb = tb;
2486
2487 if (*pos != 0)
2488 return fib_route_get_idx(iter, *pos);
2489
2490 t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002491 iter->tnode = t->kv;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002492 iter->pos = 0;
2493 iter->key = 0;
2494
2495 return SEQ_START_TOKEN;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002496}
2497
2498static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2499{
2500 struct fib_route_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002501 struct key_vector *l = NULL;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002502 t_key key = iter->key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002503
2504 ++*pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002505
2506 /* only allow key of 0 for start of sequence */
2507 if ((v == SEQ_START_TOKEN) || key)
2508 l = leaf_walk_rcu(&iter->tnode, key);
2509
2510 if (l) {
2511 iter->key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002512 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002513 } else {
2514 iter->pos = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002515 }
2516
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002517 return l;
2518}
2519
2520static void fib_route_seq_stop(struct seq_file *seq, void *v)
2521 __releases(RCU)
2522{
2523 rcu_read_unlock();
2524}
2525
Eric Dumazeta034ee32010-09-09 23:32:28 +00002526static unsigned int fib_flag_trans(int type, __be32 mask, const struct fib_info *fi)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002527{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002528 unsigned int flags = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002529
Eric Dumazeta034ee32010-09-09 23:32:28 +00002530 if (type == RTN_UNREACHABLE || type == RTN_PROHIBIT)
2531 flags = RTF_REJECT;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002532 if (fi && fi->fib_nh->nh_gw)
2533 flags |= RTF_GATEWAY;
Al Viro32ab5f82006-09-26 22:21:45 -07002534 if (mask == htonl(0xFFFFFFFF))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002535 flags |= RTF_HOST;
2536 flags |= RTF_UP;
2537 return flags;
2538}
2539
2540/*
2541 * This outputs /proc/net/route.
2542 * The format of the file is not supposed to be changed
Eric Dumazeta034ee32010-09-09 23:32:28 +00002543 * and needs to be same as fib_hash output to avoid breaking
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002544 * legacy utilities
2545 */
2546static int fib_route_seq_show(struct seq_file *seq, void *v)
2547{
Alexander Duyck654eff42015-03-11 16:36:08 -07002548 struct fib_route_iter *iter = seq->private;
2549 struct fib_table *tb = iter->main_tb;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002550 struct fib_alias *fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002551 struct key_vector *l = v;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002552 __be32 prefix;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002553
2554 if (v == SEQ_START_TOKEN) {
2555 seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway "
2556 "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU"
2557 "\tWindow\tIRTT");
2558 return 0;
2559 }
2560
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002561 prefix = htonl(l->key);
2562
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002563 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2564 const struct fib_info *fi = fa->fa_info;
2565 __be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen);
2566 unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002567
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002568 if ((fa->fa_type == RTN_BROADCAST) ||
2569 (fa->fa_type == RTN_MULTICAST))
2570 continue;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002571
Alexander Duyck654eff42015-03-11 16:36:08 -07002572 if (fa->tb_id != tb->tb_id)
2573 continue;
2574
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002575 seq_setwidth(seq, 127);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002576
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002577 if (fi)
2578 seq_printf(seq,
2579 "%s\t%08X\t%08X\t%04X\t%d\t%u\t"
2580 "%d\t%08X\t%d\t%u\t%u",
2581 fi->fib_dev ? fi->fib_dev->name : "*",
2582 prefix,
2583 fi->fib_nh->nh_gw, flags, 0, 0,
2584 fi->fib_priority,
2585 mask,
2586 (fi->fib_advmss ?
2587 fi->fib_advmss + 40 : 0),
2588 fi->fib_window,
2589 fi->fib_rtt >> 3);
2590 else
2591 seq_printf(seq,
2592 "*\t%08X\t%08X\t%04X\t%d\t%u\t"
2593 "%d\t%08X\t%d\t%u\t%u",
2594 prefix, 0, flags, 0, 0, 0,
2595 mask, 0, 0, 0);
Tetsuo Handa652586d2013-11-14 14:31:57 -08002596
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002597 seq_pad(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002598 }
2599
2600 return 0;
2601}
2602
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002603static const struct seq_operations fib_route_seq_ops = {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002604 .start = fib_route_seq_start,
2605 .next = fib_route_seq_next,
2606 .stop = fib_route_seq_stop,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002607 .show = fib_route_seq_show,
2608};
2609
2610static int fib_route_seq_open(struct inode *inode, struct file *file)
2611{
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002612 return seq_open_net(inode, file, &fib_route_seq_ops,
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002613 sizeof(struct fib_route_iter));
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002614}
2615
Arjan van de Ven9a321442007-02-12 00:55:35 -08002616static const struct file_operations fib_route_fops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002617 .owner = THIS_MODULE,
2618 .open = fib_route_seq_open,
2619 .read = seq_read,
2620 .llseek = seq_lseek,
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002621 .release = seq_release_net,
Robert Olsson19baf832005-06-21 12:43:18 -07002622};
2623
Denis V. Lunev61a02652008-01-10 03:21:09 -08002624int __net_init fib_proc_init(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002625{
Gao fengd4beaa62013-02-18 01:34:54 +00002626 if (!proc_create("fib_trie", S_IRUGO, net->proc_net, &fib_trie_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002627 goto out1;
2628
Gao fengd4beaa62013-02-18 01:34:54 +00002629 if (!proc_create("fib_triestat", S_IRUGO, net->proc_net,
2630 &fib_triestat_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002631 goto out2;
2632
Gao fengd4beaa62013-02-18 01:34:54 +00002633 if (!proc_create("route", S_IRUGO, net->proc_net, &fib_route_fops))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002634 goto out3;
2635
Robert Olsson19baf832005-06-21 12:43:18 -07002636 return 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002637
2638out3:
Gao fengece31ff2013-02-18 01:34:56 +00002639 remove_proc_entry("fib_triestat", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002640out2:
Gao fengece31ff2013-02-18 01:34:56 +00002641 remove_proc_entry("fib_trie", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002642out1:
2643 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07002644}
2645
Denis V. Lunev61a02652008-01-10 03:21:09 -08002646void __net_exit fib_proc_exit(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07002647{
Gao fengece31ff2013-02-18 01:34:56 +00002648 remove_proc_entry("fib_trie", net->proc_net);
2649 remove_proc_entry("fib_triestat", net->proc_net);
2650 remove_proc_entry("route", net->proc_net);
Robert Olsson19baf832005-06-21 12:43:18 -07002651}
2652
2653#endif /* CONFIG_PROC_FS */