blob: 9bdfdab906fe00cb048718eef932892181723a40 [file] [log] [blame]
Thomas Gleixner2874c5f2019-05-27 08:55:01 +02001// SPDX-License-Identifier: GPL-2.0-or-later
Robert Olsson19baf832005-06-21 12:43:18 -07002/*
Robert Olsson19baf832005-06-21 12:43:18 -07003 *
4 * Robert Olsson <robert.olsson@its.uu.se> Uppsala Universitet
5 * & Swedish University of Agricultural Sciences.
6 *
YOSHIFUJI Hideakie905a9e2007-02-09 23:24:47 +09007 * Jens Laas <jens.laas@data.slu.se> Swedish University of
Robert Olsson19baf832005-06-21 12:43:18 -07008 * Agricultural Sciences.
YOSHIFUJI Hideakie905a9e2007-02-09 23:24:47 +09009 *
Robert Olsson19baf832005-06-21 12:43:18 -070010 * Hans Liss <hans.liss@its.uu.se> Uppsala Universitet
11 *
Lucas De Marchi25985ed2011-03-30 22:57:33 -030012 * This work is based on the LPC-trie which is originally described in:
YOSHIFUJI Hideakie905a9e2007-02-09 23:24:47 +090013 *
Robert Olsson19baf832005-06-21 12:43:18 -070014 * An experimental study of compression methods for dynamic tries
15 * Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002.
Alexander A. Klimov7a6498e2020-07-06 19:38:50 +020016 * https://www.csc.kth.se/~snilsson/software/dyntrie2/
Robert Olsson19baf832005-06-21 12:43:18 -070017 *
Robert Olsson19baf832005-06-21 12:43:18 -070018 * IP-address lookup using LC-tries. Stefan Nilsson and Gunnar Karlsson
19 * IEEE Journal on Selected Areas in Communications, 17(6):1083-1092, June 1999
20 *
Robert Olsson19baf832005-06-21 12:43:18 -070021 * Code from fib_hash has been reused which includes the following header:
22 *
Robert Olsson19baf832005-06-21 12:43:18 -070023 * INET An implementation of the TCP/IP protocol suite for the LINUX
24 * operating system. INET is implemented using the BSD Socket
25 * interface as the means of communication with the user level.
26 *
27 * IPv4 FIB: lookup engine and maintenance routines.
28 *
Robert Olsson19baf832005-06-21 12:43:18 -070029 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
30 *
Robert Olssonfd966252005-12-22 11:25:10 -080031 * Substantial contributions to this work comes from:
32 *
33 * David S. Miller, <davem@davemloft.net>
34 * Stephen Hemminger <shemminger@osdl.org>
35 * Paul E. McKenney <paulmck@us.ibm.com>
36 * Patrick McHardy <kaber@trash.net>
Robert Olsson19baf832005-06-21 12:43:18 -070037 */
Alexey Dobriyan08009a72018-02-24 21:20:33 +030038#include <linux/cache.h>
Linus Torvalds7c0f6ba2016-12-24 11:46:01 -080039#include <linux/uaccess.h>
Jiri Slaby1977f032007-10-18 23:40:25 -070040#include <linux/bitops.h>
Robert Olsson19baf832005-06-21 12:43:18 -070041#include <linux/types.h>
42#include <linux/kernel.h>
Robert Olsson19baf832005-06-21 12:43:18 -070043#include <linux/mm.h>
44#include <linux/string.h>
45#include <linux/socket.h>
46#include <linux/sockios.h>
47#include <linux/errno.h>
48#include <linux/in.h>
49#include <linux/inet.h>
Stephen Hemmingercd8787a2006-01-03 14:38:34 -080050#include <linux/inetdevice.h>
Robert Olsson19baf832005-06-21 12:43:18 -070051#include <linux/netdevice.h>
52#include <linux/if_arp.h>
53#include <linux/proc_fs.h>
Robert Olsson2373ce12005-08-25 13:01:29 -070054#include <linux/rcupdate.h>
Robert Olsson19baf832005-06-21 12:43:18 -070055#include <linux/skbuff.h>
56#include <linux/netlink.h>
57#include <linux/init.h>
58#include <linux/list.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090059#include <linux/slab.h>
Paul Gortmakerbc3b2d72011-07-15 11:47:34 -040060#include <linux/export.h>
David S. Millerffa915d2015-05-27 00:19:03 -040061#include <linux/vmalloc.h>
Jiri Pirkob90eb752016-09-26 12:52:29 +020062#include <linux/notifier.h>
Eric W. Biederman457c4cb2007-09-12 12:01:34 +020063#include <net/net_namespace.h>
Guillaume Naultf55fbb62022-02-04 14:58:16 +010064#include <net/inet_dscp.h>
Robert Olsson19baf832005-06-21 12:43:18 -070065#include <net/ip.h>
66#include <net/protocol.h>
67#include <net/route.h>
68#include <net/tcp.h>
69#include <net/sock.h>
70#include <net/ip_fib.h>
Ido Schimmel04b1d4e2017-08-03 13:28:11 +020071#include <net/fib_notifier.h>
David Ahernf6d3c192015-08-28 08:42:09 -070072#include <trace/events/fib.h>
Robert Olsson19baf832005-06-21 12:43:18 -070073#include "fib_lookup.h"
74
Jiri Pirko7c550da2019-10-03 11:49:27 +020075static int call_fib_entry_notifier(struct notifier_block *nb,
Ido Schimmelc3852ef2016-12-03 16:45:07 +010076 enum fib_event_type event_type, u32 dst,
Jiri Pirkob7a59552019-10-03 11:49:30 +020077 int dst_len, struct fib_alias *fa,
78 struct netlink_ext_ack *extack)
Ido Schimmelc3852ef2016-12-03 16:45:07 +010079{
80 struct fib_entry_notifier_info info = {
Jiri Pirkob7a59552019-10-03 11:49:30 +020081 .info.extack = extack,
Ido Schimmelc3852ef2016-12-03 16:45:07 +010082 .dst = dst,
83 .dst_len = dst_len,
David Ahern6eba87c2017-10-18 11:39:13 -070084 .fi = fa->fa_info,
Guillaume Nault568a3f32022-04-08 22:08:40 +020085 .dscp = fa->fa_dscp,
David Ahern6eba87c2017-10-18 11:39:13 -070086 .type = fa->fa_type,
87 .tb_id = fa->tb_id,
Ido Schimmelc3852ef2016-12-03 16:45:07 +010088 };
Jiri Pirko7c550da2019-10-03 11:49:27 +020089 return call_fib4_notifier(nb, event_type, &info.info);
Ido Schimmelc3852ef2016-12-03 16:45:07 +010090}
91
Jiri Pirkob90eb752016-09-26 12:52:29 +020092static int call_fib_entry_notifiers(struct net *net,
93 enum fib_event_type event_type, u32 dst,
David Ahern6c31e5a2017-10-27 17:37:13 -070094 int dst_len, struct fib_alias *fa,
95 struct netlink_ext_ack *extack)
Jiri Pirkob90eb752016-09-26 12:52:29 +020096{
97 struct fib_entry_notifier_info info = {
David Ahern6c31e5a2017-10-27 17:37:13 -070098 .info.extack = extack,
Jiri Pirkob90eb752016-09-26 12:52:29 +020099 .dst = dst,
100 .dst_len = dst_len,
David Ahern6eba87c2017-10-18 11:39:13 -0700101 .fi = fa->fa_info,
Guillaume Nault568a3f32022-04-08 22:08:40 +0200102 .dscp = fa->fa_dscp,
David Ahern6eba87c2017-10-18 11:39:13 -0700103 .type = fa->fa_type,
104 .tb_id = fa->tb_id,
Jiri Pirkob90eb752016-09-26 12:52:29 +0200105 };
Ido Schimmel04b1d4e2017-08-03 13:28:11 +0200106 return call_fib4_notifiers(net, event_type, &info.info);
Jiri Pirkob90eb752016-09-26 12:52:29 +0200107}
108
Robert Olsson06ef9212006-03-20 21:35:01 -0800109#define MAX_STAT_DEPTH 32
Robert Olsson19baf832005-06-21 12:43:18 -0700110
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800111#define KEYLENGTH (8*sizeof(t_key))
112#define KEY_MAX ((t_key)~0)
Robert Olsson19baf832005-06-21 12:43:18 -0700113
Robert Olsson19baf832005-06-21 12:43:18 -0700114typedef unsigned int t_key;
115
Alexander Duyck88bae712015-03-06 09:54:52 -0800116#define IS_TRIE(n) ((n)->pos >= KEYLENGTH)
117#define IS_TNODE(n) ((n)->bits)
118#define IS_LEAF(n) (!(n)->bits)
Robert Olsson2373ce12005-08-25 13:01:29 -0700119
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800120struct key_vector {
Alexander Duyck41b489f2015-03-04 15:02:33 -0800121 t_key key;
122 unsigned char pos; /* 2log(KEYLENGTH) bits needed */
123 unsigned char bits; /* 2log(KEYLENGTH) bits needed */
124 unsigned char slen;
Alexander Duyckadaf9812014-12-31 10:55:47 -0800125 union {
Alexander Duyck41b489f2015-03-04 15:02:33 -0800126 /* This list pointer if valid if (pos | bits) == 0 (LEAF) */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800127 struct hlist_head leaf;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800128 /* This array is valid if (pos | bits) > 0 (TNODE) */
Kees Cook764f8482022-11-17 20:21:52 -0800129 DECLARE_FLEX_ARRAY(struct key_vector __rcu *, tnode);
Alexander Duyckadaf9812014-12-31 10:55:47 -0800130 };
Robert Olsson19baf832005-06-21 12:43:18 -0700131};
132
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800133struct tnode {
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800134 struct rcu_head rcu;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800135 t_key empty_children; /* KEYLENGTH bits needed */
136 t_key full_children; /* KEYLENGTH bits needed */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800137 struct key_vector __rcu *parent;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800138 struct key_vector kv[1];
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800139#define tn_bits kv[0].bits
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800140};
141
142#define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n])
Alexander Duyck41b489f2015-03-04 15:02:33 -0800143#define LEAF_SIZE TNODE_SIZE(1)
144
Robert Olsson19baf832005-06-21 12:43:18 -0700145#ifdef CONFIG_IP_FIB_TRIE_STATS
146struct trie_use_stats {
147 unsigned int gets;
148 unsigned int backtrack;
149 unsigned int semantic_match_passed;
150 unsigned int semantic_match_miss;
151 unsigned int null_node_hit;
Robert Olsson2f368952005-07-05 15:02:40 -0700152 unsigned int resize_node_skipped;
Robert Olsson19baf832005-06-21 12:43:18 -0700153};
154#endif
155
156struct trie_stat {
157 unsigned int totdepth;
158 unsigned int maxdepth;
159 unsigned int tnodes;
160 unsigned int leaves;
161 unsigned int nullpointers;
Stephen Hemminger93672292008-01-22 21:54:05 -0800162 unsigned int prefixes;
Robert Olsson06ef9212006-03-20 21:35:01 -0800163 unsigned int nodesizes[MAX_STAT_DEPTH];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700164};
Robert Olsson19baf832005-06-21 12:43:18 -0700165
166struct trie {
Alexander Duyck88bae712015-03-06 09:54:52 -0800167 struct key_vector kv[1];
Robert Olsson19baf832005-06-21 12:43:18 -0700168#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -0800169 struct trie_use_stats __percpu *stats;
Robert Olsson19baf832005-06-21 12:43:18 -0700170#endif
Robert Olsson19baf832005-06-21 12:43:18 -0700171};
172
Alexander Duyck88bae712015-03-06 09:54:52 -0800173static struct key_vector *resize(struct trie *t, struct key_vector *tn);
David Ahern9ab948a2019-03-20 09:18:59 -0700174static unsigned int tnode_free_size;
Jarek Poplawskic3059472009-07-14 08:33:08 +0000175
176/*
David Ahern9ab948a2019-03-20 09:18:59 -0700177 * synchronize_rcu after call_rcu for outstanding dirty memory; it should be
178 * especially useful before resizing the root node with PREEMPT_NONE configs;
179 * the value was obtained experimentally, aiming to avoid visible slowdown.
Jarek Poplawskic3059472009-07-14 08:33:08 +0000180 */
David Ahern9ab948a2019-03-20 09:18:59 -0700181unsigned int sysctl_fib_sync_mem = 512 * 1024;
182unsigned int sysctl_fib_sync_mem_min = 64 * 1024;
183unsigned int sysctl_fib_sync_mem_max = 64 * 1024 * 1024;
Robert Olsson19baf832005-06-21 12:43:18 -0700184
Alexey Dobriyan08009a72018-02-24 21:20:33 +0300185static struct kmem_cache *fn_alias_kmem __ro_after_init;
186static struct kmem_cache *trie_leaf_kmem __ro_after_init;
Robert Olsson19baf832005-06-21 12:43:18 -0700187
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800188static inline struct tnode *tn_info(struct key_vector *kv)
189{
190 return container_of(kv, struct tnode, kv[0]);
191}
192
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800193/* caller must hold RTNL */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800194#define node_parent(tn) rtnl_dereference(tn_info(tn)->parent)
Alexander Duyck754baf8d2015-03-06 09:54:14 -0800195#define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700196
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800197/* caller must hold RCU read lock or RTNL */
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800198#define node_parent_rcu(tn) rcu_dereference_rtnl(tn_info(tn)->parent)
Alexander Duyck754baf8d2015-03-06 09:54:14 -0800199#define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700200
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800201/* wrapper for rcu_assign_pointer */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800202static inline void node_set_parent(struct key_vector *n, struct key_vector *tp)
Stephen Hemminger06801912007-08-10 15:22:13 -0700203{
Alexander Duyckadaf9812014-12-31 10:55:47 -0800204 if (n)
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800205 rcu_assign_pointer(tn_info(n)->parent, tp);
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800206}
207
Alexander Duyckf23e59f2015-03-06 09:54:46 -0800208#define NODE_INIT_PARENT(n, p) RCU_INIT_POINTER(tn_info(n)->parent, p)
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800209
210/* This provides us with the number of children in this node, in the case of a
211 * leaf this will return 0 meaning none of the children are accessible.
212 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800213static inline unsigned long child_length(const struct key_vector *tn)
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800214{
215 return (1ul << tn->bits) & ~(1ul);
Stephen Hemminger06801912007-08-10 15:22:13 -0700216}
Robert Olsson2373ce12005-08-25 13:01:29 -0700217
Alexander Duyck88bae712015-03-06 09:54:52 -0800218#define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos)
219
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800220static inline unsigned long get_index(t_key key, struct key_vector *kv)
221{
222 unsigned long index = key ^ kv->key;
223
Alexander Duyck88bae712015-03-06 09:54:52 -0800224 if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos))
225 return 0;
226
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800227 return index >> kv->pos;
228}
229
Alexander Duycke9b44012014-12-31 10:56:12 -0800230/* To understand this stuff, an understanding of keys and all their bits is
231 * necessary. Every node in the trie has a key associated with it, but not
232 * all of the bits in that key are significant.
233 *
234 * Consider a node 'n' and its parent 'tp'.
235 *
236 * If n is a leaf, every bit in its key is significant. Its presence is
237 * necessitated by path compression, since during a tree traversal (when
238 * searching for a leaf - unless we are doing an insertion) we will completely
239 * ignore all skipped bits we encounter. Thus we need to verify, at the end of
240 * a potentially successful search, that we have indeed been walking the
241 * correct key path.
242 *
243 * Note that we can never "miss" the correct key in the tree if present by
244 * following the wrong path. Path compression ensures that segments of the key
245 * that are the same for all keys with a given prefix are skipped, but the
246 * skipped part *is* identical for each node in the subtrie below the skipped
247 * bit! trie_insert() in this implementation takes care of that.
248 *
249 * if n is an internal node - a 'tnode' here, the various parts of its key
250 * have many different meanings.
251 *
252 * Example:
253 * _________________________________________________________________
254 * | i | i | i | i | i | i | i | N | N | N | S | S | S | S | S | C |
255 * -----------------------------------------------------------------
256 * 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16
257 *
258 * _________________________________________________________________
259 * | C | C | C | u | u | u | u | u | u | u | u | u | u | u | u | u |
260 * -----------------------------------------------------------------
261 * 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
262 *
263 * tp->pos = 22
264 * tp->bits = 3
265 * n->pos = 13
266 * n->bits = 4
267 *
268 * First, let's just ignore the bits that come before the parent tp, that is
269 * the bits from (tp->pos + tp->bits) to 31. They are *known* but at this
270 * point we do not use them for anything.
271 *
272 * The bits from (tp->pos) to (tp->pos + tp->bits - 1) - "N", above - are the
273 * index into the parent's child array. That is, they will be used to find
274 * 'n' among tp's children.
275 *
Xunlei Pang98a384e2016-08-18 12:33:28 +0800276 * The bits from (n->pos + n->bits) to (tp->pos - 1) - "S" - are skipped bits
Alexander Duycke9b44012014-12-31 10:56:12 -0800277 * for the node n.
278 *
279 * All the bits we have seen so far are significant to the node n. The rest
280 * of the bits are really not needed or indeed known in n->key.
281 *
282 * The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into
283 * n's child array, and will of course be different for each child.
284 *
Xunlei Pang98a384e2016-08-18 12:33:28 +0800285 * The rest of the bits, from 0 to (n->pos -1) - "u" - are completely unknown
Alexander Duycke9b44012014-12-31 10:56:12 -0800286 * at this point.
287 */
Robert Olsson19baf832005-06-21 12:43:18 -0700288
Denis V. Lunevf5026fa2007-12-13 09:47:57 -0800289static const int halve_threshold = 25;
290static const int inflate_threshold = 50;
Jarek Poplawski345aa032009-07-07 19:39:16 -0700291static const int halve_threshold_root = 15;
Jens Låås80b71b82009-08-28 23:57:15 -0700292static const int inflate_threshold_root = 30;
Robert Olsson2373ce12005-08-25 13:01:29 -0700293
294static void __alias_free_mem(struct rcu_head *head)
295{
296 struct fib_alias *fa = container_of(head, struct fib_alias, rcu);
297 kmem_cache_free(fn_alias_kmem, fa);
298}
299
300static inline void alias_free_mem_rcu(struct fib_alias *fa)
301{
302 call_rcu(&fa->rcu, __alias_free_mem);
303}
304
Alexander Duyck1de3d872015-03-04 15:04:46 -0800305#define TNODE_VMALLOC_MAX \
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800306 ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800307
308static void __node_free_rcu(struct rcu_head *head)
Robert Olsson2373ce12005-08-25 13:01:29 -0700309{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800310 struct tnode *n = container_of(head, struct tnode, rcu);
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800311
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800312 if (!n->tn_bits)
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800313 kmem_cache_free(trie_leaf_kmem, n);
Alexander Duyck37fd30f2014-12-31 10:55:41 -0800314 else
Tetsuo Handa1d5cfdb2016-01-22 15:11:02 -0800315 kvfree(n);
Robert Olsson2373ce12005-08-25 13:01:29 -0700316}
317
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800318#define node_free(n) call_rcu(&tn_info(n)->rcu, __node_free_rcu)
Stephen Hemminger387a5482008-04-10 03:47:34 -0700319
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800320static struct tnode *tnode_alloc(int bits)
Robert Olsson2373ce12005-08-25 13:01:29 -0700321{
Alexander Duyck1de3d872015-03-04 15:04:46 -0800322 size_t size;
323
324 /* verify bits is within bounds */
325 if (bits > TNODE_VMALLOC_MAX)
326 return NULL;
327
328 /* determine size and verify it is non-zero and didn't overflow */
329 size = TNODE_SIZE(1ul << bits);
330
Robert Olsson2373ce12005-08-25 13:01:29 -0700331 if (size <= PAGE_SIZE)
Eric Dumazet8d9654442008-01-13 22:31:44 -0800332 return kzalloc(size, GFP_KERNEL);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700333 else
Eric Dumazet7a1c8e52010-11-20 07:46:35 +0000334 return vzalloc(size);
Stephen Hemminger15be75c2008-04-10 02:56:38 -0700335}
Robert Olsson2373ce12005-08-25 13:01:29 -0700336
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800337static inline void empty_child_inc(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800338{
Matthias Kaehlcke25cec752019-06-18 14:14:40 -0700339 tn_info(n)->empty_children++;
340
341 if (!tn_info(n)->empty_children)
342 tn_info(n)->full_children++;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800343}
344
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800345static inline void empty_child_dec(struct key_vector *n)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800346{
Matthias Kaehlcke25cec752019-06-18 14:14:40 -0700347 if (!tn_info(n)->empty_children)
348 tn_info(n)->full_children--;
349
350 tn_info(n)->empty_children--;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800351}
352
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800353static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)
Robert Olsson19baf832005-06-21 12:43:18 -0700354{
Firo Yangf38b24c2015-06-08 11:54:51 +0800355 struct key_vector *l;
356 struct tnode *kv;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800357
Firo Yangf38b24c2015-06-08 11:54:51 +0800358 kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800359 if (!kv)
360 return NULL;
361
362 /* initialize key vector */
Firo Yangf38b24c2015-06-08 11:54:51 +0800363 l = kv->kv;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800364 l->key = key;
365 l->pos = 0;
366 l->bits = 0;
367 l->slen = fa->fa_slen;
368
369 /* link leaf to fib alias */
370 INIT_HLIST_HEAD(&l->leaf);
371 hlist_add_head(&fa->fa_list, &l->leaf);
372
Robert Olsson19baf832005-06-21 12:43:18 -0700373 return l;
374}
375
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800376static struct key_vector *tnode_new(t_key key, int pos, int bits)
Robert Olsson19baf832005-06-21 12:43:18 -0700377{
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800378 unsigned int shift = pos + bits;
Firo Yangf38b24c2015-06-08 11:54:51 +0800379 struct key_vector *tn;
380 struct tnode *tnode;
Alexander Duyck64c9b6f2014-12-31 10:55:35 -0800381
382 /* verify bits and pos their msb bits clear and values are valid */
383 BUG_ON(!bits || (shift > KEYLENGTH));
Robert Olsson19baf832005-06-21 12:43:18 -0700384
Firo Yangf38b24c2015-06-08 11:54:51 +0800385 tnode = tnode_alloc(bits);
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800386 if (!tnode)
387 return NULL;
388
Firo Yangf38b24c2015-06-08 11:54:51 +0800389 pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0),
390 sizeof(struct key_vector *) << bits);
391
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800392 if (bits == KEYLENGTH)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800393 tnode->full_children = 1;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800394 else
Alexander Duyck6e22d172015-03-06 09:54:39 -0800395 tnode->empty_children = 1ul << bits;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800396
Firo Yangf38b24c2015-06-08 11:54:51 +0800397 tn = tnode->kv;
Alexander Duyckdc35dbe2015-03-06 09:54:27 -0800398 tn->key = (shift < KEYLENGTH) ? (key >> shift) << shift : 0;
399 tn->pos = pos;
400 tn->bits = bits;
401 tn->slen = pos;
402
Robert Olsson19baf832005-06-21 12:43:18 -0700403 return tn;
404}
405
Alexander Duycke9b44012014-12-31 10:56:12 -0800406/* Check whether a tnode 'n' is "full", i.e. it is an internal node
Robert Olsson19baf832005-06-21 12:43:18 -0700407 * and no bits are skipped. See discussion in dyntree paper p. 6
408 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800409static inline int tnode_full(struct key_vector *tn, struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700410{
Alexander Duycke9b44012014-12-31 10:56:12 -0800411 return n && ((n->pos + n->bits) == tn->pos) && IS_TNODE(n);
Robert Olsson19baf832005-06-21 12:43:18 -0700412}
413
Alexander Duyckff181ed2014-12-31 10:56:43 -0800414/* Add a child at position i overwriting the old value.
415 * Update the value of full_children and empty_children.
416 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800417static void put_child(struct key_vector *tn, unsigned long i,
418 struct key_vector *n)
Robert Olsson19baf832005-06-21 12:43:18 -0700419{
Alexander Duyck754baf8d2015-03-06 09:54:14 -0800420 struct key_vector *chi = get_child(tn, i);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800421 int isfull, wasfull;
Robert Olsson19baf832005-06-21 12:43:18 -0700422
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800423 BUG_ON(i >= child_length(tn));
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700424
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800425 /* update emptyChildren, overflow into fullChildren */
Ian Morris00db4122015-04-03 09:17:27 +0100426 if (!n && chi)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800427 empty_child_inc(tn);
Ian Morris00db4122015-04-03 09:17:27 +0100428 if (n && !chi)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800429 empty_child_dec(tn);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700430
Robert Olsson19baf832005-06-21 12:43:18 -0700431 /* update fullChildren */
Alexander Duyckff181ed2014-12-31 10:56:43 -0800432 wasfull = tnode_full(tn, chi);
Robert Olsson19baf832005-06-21 12:43:18 -0700433 isfull = tnode_full(tn, n);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800434
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700435 if (wasfull && !isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800436 tn_info(tn)->full_children--;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700437 else if (!wasfull && isfull)
Alexander Duyck6e22d172015-03-06 09:54:39 -0800438 tn_info(tn)->full_children++;
Olof Johansson91b9a272005-08-09 20:24:39 -0700439
Alexander Duyck5405afd2014-12-31 10:57:08 -0800440 if (n && (tn->slen < n->slen))
441 tn->slen = n->slen;
442
Alexander Duyck41b489f2015-03-04 15:02:33 -0800443 rcu_assign_pointer(tn->tnode[i], n);
Robert Olsson19baf832005-06-21 12:43:18 -0700444}
445
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800446static void update_children(struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800447{
448 unsigned long i;
449
450 /* update all of the child parent pointers */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800451 for (i = child_length(tn); i;) {
Alexander Duyck754baf8d2015-03-06 09:54:14 -0800452 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800453
454 if (!inode)
455 continue;
456
457 /* Either update the children of a tnode that
458 * already belongs to us or update the child
459 * to point to ourselves.
460 */
461 if (node_parent(inode) == tn)
462 update_children(inode);
463 else
464 node_set_parent(inode, tn);
465 }
466}
467
Alexander Duyck88bae712015-03-06 09:54:52 -0800468static inline void put_child_root(struct key_vector *tp, t_key key,
469 struct key_vector *n)
Alexander Duyck836a0122014-12-31 10:56:06 -0800470{
Alexander Duyck88bae712015-03-06 09:54:52 -0800471 if (IS_TRIE(tp))
472 rcu_assign_pointer(tp->tnode[0], n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800473 else
Alexander Duyck88bae712015-03-06 09:54:52 -0800474 put_child(tp, get_index(key, tp), n);
Alexander Duyck836a0122014-12-31 10:56:06 -0800475}
476
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800477static inline void tnode_free_init(struct key_vector *tn)
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700478{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800479 tn_info(tn)->rcu.next = NULL;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800480}
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700481
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800482static inline void tnode_free_append(struct key_vector *tn,
483 struct key_vector *n)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800484{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800485 tn_info(n)->rcu.next = tn_info(tn)->rcu.next;
486 tn_info(tn)->rcu.next = &tn_info(n)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800487}
488
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800489static void tnode_free(struct key_vector *tn)
Alexander Duyckfc86a932014-12-31 10:56:49 -0800490{
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800491 struct callback_head *head = &tn_info(tn)->rcu;
Alexander Duyckfc86a932014-12-31 10:56:49 -0800492
493 while (head) {
494 head = head->next;
Alexander Duyck41b489f2015-03-04 15:02:33 -0800495 tnode_free_size += TNODE_SIZE(1ul << tn->bits);
Alexander Duyckfc86a932014-12-31 10:56:49 -0800496 node_free(tn);
497
Alexander Duyck56ca2ad2015-03-06 09:54:33 -0800498 tn = container_of(head, struct tnode, rcu)->kv;
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700499 }
Alexander Duyckfc86a932014-12-31 10:56:49 -0800500
Kuniyuki Iwashima73318c42022-07-06 16:40:03 -0700501 if (tnode_free_size >= READ_ONCE(sysctl_fib_sync_mem)) {
Alexander Duyckfc86a932014-12-31 10:56:49 -0800502 tnode_free_size = 0;
503 synchronize_rcu();
504 }
Eric Dumazet0a5c0472011-03-31 01:51:35 -0700505}
506
Alexander Duyck88bae712015-03-06 09:54:52 -0800507static struct key_vector *replace(struct trie *t,
508 struct key_vector *oldtnode,
509 struct key_vector *tn)
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800510{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800511 struct key_vector *tp = node_parent(oldtnode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800512 unsigned long i;
513
514 /* setup the parent pointer out of and back into this node */
515 NODE_INIT_PARENT(tn, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -0800516 put_child_root(tp, tn->key, tn);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800517
518 /* update all of the child parent pointers */
519 update_children(tn);
520
521 /* all pointers should be clean so we are done */
522 tnode_free(oldtnode);
523
524 /* resize children now that oldtnode is freed */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800525 for (i = child_length(tn); i;) {
Alexander Duyck754baf8d2015-03-06 09:54:14 -0800526 struct key_vector *inode = get_child(tn, --i);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800527
528 /* resize child node */
529 if (tnode_full(tn, inode))
Alexander Duyck88bae712015-03-06 09:54:52 -0800530 tn = resize(t, inode);
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800531 }
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800532
Alexander Duyck88bae712015-03-06 09:54:52 -0800533 return tp;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800534}
535
Alexander Duyck88bae712015-03-06 09:54:52 -0800536static struct key_vector *inflate(struct trie *t,
537 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700538{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800539 struct key_vector *tn;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800540 unsigned long i;
Alexander Duycke9b44012014-12-31 10:56:12 -0800541 t_key m;
Robert Olsson19baf832005-06-21 12:43:18 -0700542
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700543 pr_debug("In inflate\n");
Robert Olsson19baf832005-06-21 12:43:18 -0700544
Alexander Duycke9b44012014-12-31 10:56:12 -0800545 tn = tnode_new(oldtnode->key, oldtnode->pos - 1, oldtnode->bits + 1);
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700546 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800547 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700548
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800549 /* prepare oldtnode to be freed */
550 tnode_free_init(oldtnode);
551
Alexander Duyck12c081a2014-12-31 10:56:55 -0800552 /* Assemble all of the pointers in our cluster, in this case that
553 * represents all of the pointers out of our allocated nodes that
554 * point to existing tnodes and the links between our allocated
555 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700556 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800557 for (i = child_length(oldtnode), m = 1u << tn->pos; i;) {
Alexander Duyck754baf8d2015-03-06 09:54:14 -0800558 struct key_vector *inode = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800559 struct key_vector *node0, *node1;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800560 unsigned long j, k;
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700561
Robert Olsson19baf832005-06-21 12:43:18 -0700562 /* An empty child */
Ian Morris51456b22015-04-03 09:17:26 +0100563 if (!inode)
Robert Olsson19baf832005-06-21 12:43:18 -0700564 continue;
565
566 /* A leaf or an internal node with skipped bits */
Alexander Duyckadaf9812014-12-31 10:55:47 -0800567 if (!tnode_full(oldtnode, inode)) {
Alexander Duycke9b44012014-12-31 10:56:12 -0800568 put_child(tn, get_index(inode->key, tn), inode);
Robert Olsson19baf832005-06-21 12:43:18 -0700569 continue;
570 }
571
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800572 /* drop the node in the old tnode free list */
573 tnode_free_append(oldtnode, inode);
574
Robert Olsson19baf832005-06-21 12:43:18 -0700575 /* An internal node with two children */
Robert Olsson19baf832005-06-21 12:43:18 -0700576 if (inode->bits == 1) {
Alexander Duyck754baf8d2015-03-06 09:54:14 -0800577 put_child(tn, 2 * i + 1, get_child(inode, 1));
578 put_child(tn, 2 * i, get_child(inode, 0));
Olof Johansson91b9a272005-08-09 20:24:39 -0700579 continue;
Robert Olsson19baf832005-06-21 12:43:18 -0700580 }
581
Olof Johansson91b9a272005-08-09 20:24:39 -0700582 /* We will replace this node 'inode' with two new
Alexander Duyck12c081a2014-12-31 10:56:55 -0800583 * ones, 'node0' and 'node1', each with half of the
Olof Johansson91b9a272005-08-09 20:24:39 -0700584 * original children. The two new nodes will have
585 * a position one bit further down the key and this
586 * means that the "significant" part of their keys
587 * (see the discussion near the top of this file)
588 * will differ by one bit, which will be "0" in
Alexander Duyck12c081a2014-12-31 10:56:55 -0800589 * node0's key and "1" in node1's key. Since we are
Olof Johansson91b9a272005-08-09 20:24:39 -0700590 * moving the key position by one step, the bit that
591 * we are moving away from - the bit at position
Alexander Duyck12c081a2014-12-31 10:56:55 -0800592 * (tn->pos) - is the one that will differ between
593 * node0 and node1. So... we synthesize that bit in the
594 * two new keys.
Olof Johansson91b9a272005-08-09 20:24:39 -0700595 */
Alexander Duyck12c081a2014-12-31 10:56:55 -0800596 node1 = tnode_new(inode->key | m, inode->pos, inode->bits - 1);
597 if (!node1)
598 goto nomem;
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800599 node0 = tnode_new(inode->key, inode->pos, inode->bits - 1);
Robert Olsson19baf832005-06-21 12:43:18 -0700600
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800601 tnode_free_append(tn, node1);
Alexander Duyck12c081a2014-12-31 10:56:55 -0800602 if (!node0)
603 goto nomem;
604 tnode_free_append(tn, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700605
Alexander Duyck12c081a2014-12-31 10:56:55 -0800606 /* populate child pointers in new nodes */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800607 for (k = child_length(inode), j = k / 2; j;) {
Alexander Duyck754baf8d2015-03-06 09:54:14 -0800608 put_child(node1, --j, get_child(inode, --k));
609 put_child(node0, j, get_child(inode, j));
610 put_child(node1, --j, get_child(inode, --k));
611 put_child(node0, j, get_child(inode, j));
Robert Olsson19baf832005-06-21 12:43:18 -0700612 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800613
Alexander Duyck12c081a2014-12-31 10:56:55 -0800614 /* link new nodes to parent */
615 NODE_INIT_PARENT(node1, tn);
616 NODE_INIT_PARENT(node0, tn);
Olof Johansson91b9a272005-08-09 20:24:39 -0700617
Alexander Duyck12c081a2014-12-31 10:56:55 -0800618 /* link parent to nodes */
619 put_child(tn, 2 * i + 1, node1);
620 put_child(tn, 2 * i, node0);
Robert Olsson19baf832005-06-21 12:43:18 -0700621 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800622
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800623 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800624 return replace(t, oldtnode, tn);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700625nomem:
Alexander Duyckfc86a932014-12-31 10:56:49 -0800626 /* all pointers should be clean so we are done */
627 tnode_free(tn);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800628notnode:
629 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700630}
631
Alexander Duyck88bae712015-03-06 09:54:52 -0800632static struct key_vector *halve(struct trie *t,
633 struct key_vector *oldtnode)
Robert Olsson19baf832005-06-21 12:43:18 -0700634{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800635 struct key_vector *tn;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800636 unsigned long i;
Robert Olsson19baf832005-06-21 12:43:18 -0700637
Stephen Hemminger0c7770c2005-08-23 21:59:41 -0700638 pr_debug("In halve\n");
Stephen Hemmingerc877efb2005-07-19 14:01:51 -0700639
Alexander Duycke9b44012014-12-31 10:56:12 -0800640 tn = tnode_new(oldtnode->key, oldtnode->pos + 1, oldtnode->bits - 1);
Robert Olsson2f80b3c2005-08-09 20:25:06 -0700641 if (!tn)
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800642 goto notnode;
Robert Olsson2f368952005-07-05 15:02:40 -0700643
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800644 /* prepare oldtnode to be freed */
645 tnode_free_init(oldtnode);
646
Alexander Duyck12c081a2014-12-31 10:56:55 -0800647 /* Assemble all of the pointers in our cluster, in this case that
648 * represents all of the pointers out of our allocated nodes that
649 * point to existing tnodes and the links between our allocated
650 * nodes.
Robert Olsson2f368952005-07-05 15:02:40 -0700651 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800652 for (i = child_length(oldtnode); i;) {
Alexander Duyck754baf8d2015-03-06 09:54:14 -0800653 struct key_vector *node1 = get_child(oldtnode, --i);
654 struct key_vector *node0 = get_child(oldtnode, --i);
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800655 struct key_vector *inode;
Robert Olsson2f368952005-07-05 15:02:40 -0700656
Alexander Duyck12c081a2014-12-31 10:56:55 -0800657 /* At least one of the children is empty */
658 if (!node1 || !node0) {
659 put_child(tn, i / 2, node1 ? : node0);
660 continue;
Robert Olsson2f368952005-07-05 15:02:40 -0700661 }
Robert Olsson2f368952005-07-05 15:02:40 -0700662
Alexander Duyck12c081a2014-12-31 10:56:55 -0800663 /* Two nonempty children */
664 inode = tnode_new(node0->key, oldtnode->pos, 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800665 if (!inode)
666 goto nomem;
Alexander Duyck12c081a2014-12-31 10:56:55 -0800667 tnode_free_append(tn, inode);
668
669 /* initialize pointers out of node */
670 put_child(inode, 1, node1);
671 put_child(inode, 0, node0);
672 NODE_INIT_PARENT(inode, tn);
673
674 /* link parent to node */
675 put_child(tn, i / 2, inode);
Robert Olsson2f368952005-07-05 15:02:40 -0700676 }
Robert Olsson19baf832005-06-21 12:43:18 -0700677
Alexander Duyck69fa57b2015-01-22 15:51:14 -0800678 /* setup the parent pointers into and out of this node */
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800679 return replace(t, oldtnode, tn);
680nomem:
681 /* all pointers should be clean so we are done */
682 tnode_free(tn);
683notnode:
684 return NULL;
Robert Olsson19baf832005-06-21 12:43:18 -0700685}
686
Alexander Duyck88bae712015-03-06 09:54:52 -0800687static struct key_vector *collapse(struct trie *t,
688 struct key_vector *oldtnode)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800689{
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800690 struct key_vector *n, *tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800691 unsigned long i;
692
693 /* scan the tnode looking for that one child that might still exist */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800694 for (n = NULL, i = child_length(oldtnode); !n && i;)
Alexander Duyck754baf8d2015-03-06 09:54:14 -0800695 n = get_child(oldtnode, --i);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800696
697 /* compress one level */
698 tp = node_parent(oldtnode);
Alexander Duyck88bae712015-03-06 09:54:52 -0800699 put_child_root(tp, oldtnode->key, n);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800700 node_set_parent(n, tp);
701
702 /* drop dead node */
703 node_free(oldtnode);
Alexander Duyck88bae712015-03-06 09:54:52 -0800704
705 return tp;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800706}
707
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800708static unsigned char update_suffix(struct key_vector *tn)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800709{
710 unsigned char slen = tn->pos;
711 unsigned long stride, i;
Alexander Duycka52ca622016-12-01 07:27:57 -0500712 unsigned char slen_max;
713
714 /* only vector 0 can have a suffix length greater than or equal to
715 * tn->pos + tn->bits, the second highest node will have a suffix
716 * length at most of tn->pos + tn->bits - 1
717 */
718 slen_max = min_t(unsigned char, tn->pos + tn->bits - 1, tn->slen);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800719
720 /* search though the list of children looking for nodes that might
721 * have a suffix greater than the one we currently have. This is
722 * why we start with a stride of 2 since a stride of 1 would
723 * represent the nodes with suffix length equal to tn->pos
724 */
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800725 for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) {
Alexander Duyck754baf8d2015-03-06 09:54:14 -0800726 struct key_vector *n = get_child(tn, i);
Alexander Duyck5405afd2014-12-31 10:57:08 -0800727
728 if (!n || (n->slen <= slen))
729 continue;
730
731 /* update stride and slen based on new value */
732 stride <<= (n->slen - slen);
733 slen = n->slen;
734 i &= ~(stride - 1);
735
Alexander Duycka52ca622016-12-01 07:27:57 -0500736 /* stop searching if we have hit the maximum possible value */
737 if (slen >= slen_max)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800738 break;
739 }
740
741 tn->slen = slen;
742
743 return slen;
744}
745
Alexander Duyckf05a4812014-12-31 10:56:37 -0800746/* From "Implementing a dynamic compressed trie" by Stefan Nilsson of
747 * the Helsinki University of Technology and Matti Tikkanen of Nokia
748 * Telecommunications, page 6:
749 * "A node is doubled if the ratio of non-empty children to all
750 * children in the *doubled* node is at least 'high'."
751 *
752 * 'high' in this instance is the variable 'inflate_threshold'. It
753 * is expressed as a percentage, so we multiply it with
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800754 * child_length() and instead of multiplying by 2 (since the
Alexander Duyckf05a4812014-12-31 10:56:37 -0800755 * child array will be doubled by inflate()) and multiplying
756 * the left-hand side by 100 (to handle the percentage thing) we
757 * multiply the left-hand side by 50.
758 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800759 * The left-hand side may look a bit weird: child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800760 * - tn->empty_children is of course the number of non-null children
761 * in the current node. tn->full_children is the number of "full"
762 * children, that is non-null tnodes with a skip value of 0.
763 * All of those will be doubled in the resulting inflated tnode, so
764 * we just count them one extra time here.
765 *
766 * A clearer way to write this would be:
767 *
768 * to_be_doubled = tn->full_children;
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800769 * not_to_be_doubled = child_length(tn) - tn->empty_children -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800770 * tn->full_children;
771 *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800772 * new_child_length = child_length(tn) * 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800773 *
774 * new_fill_factor = 100 * (not_to_be_doubled + 2*to_be_doubled) /
775 * new_child_length;
776 * if (new_fill_factor >= inflate_threshold)
777 *
778 * ...and so on, tho it would mess up the while () loop.
779 *
780 * anyway,
781 * 100 * (not_to_be_doubled + 2*to_be_doubled) / new_child_length >=
782 * inflate_threshold
783 *
784 * avoid a division:
785 * 100 * (not_to_be_doubled + 2*to_be_doubled) >=
786 * inflate_threshold * new_child_length
787 *
788 * expand not_to_be_doubled and to_be_doubled, and shorten:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800789 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800790 * tn->full_children) >= inflate_threshold * new_child_length
791 *
792 * expand new_child_length:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800793 * 100 * (child_length(tn) - tn->empty_children +
Alexander Duyckf05a4812014-12-31 10:56:37 -0800794 * tn->full_children) >=
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800795 * inflate_threshold * child_length(tn) * 2
Alexander Duyckf05a4812014-12-31 10:56:37 -0800796 *
797 * shorten again:
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800798 * 50 * (tn->full_children + child_length(tn) -
Alexander Duyckf05a4812014-12-31 10:56:37 -0800799 * tn->empty_children) >= inflate_threshold *
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800800 * child_length(tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800801 *
802 */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800803static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800804{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800805 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800806 unsigned long threshold = used;
807
808 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800809 threshold *= IS_TRIE(tp) ? inflate_threshold_root : inflate_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800810 used -= tn_info(tn)->empty_children;
811 used += tn_info(tn)->full_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800812
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800813 /* if bits == KEYLENGTH then pos = 0, and will fail below */
814
815 return (used > 1) && tn->pos && ((50 * used) >= threshold);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800816}
817
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800818static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)
Alexander Duyckf05a4812014-12-31 10:56:37 -0800819{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800820 unsigned long used = child_length(tn);
Alexander Duyckf05a4812014-12-31 10:56:37 -0800821 unsigned long threshold = used;
822
823 /* Keep root node larger */
Alexander Duyck88bae712015-03-06 09:54:52 -0800824 threshold *= IS_TRIE(tp) ? halve_threshold_root : halve_threshold;
Alexander Duyck6e22d172015-03-06 09:54:39 -0800825 used -= tn_info(tn)->empty_children;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800826
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800827 /* if bits == KEYLENGTH then used = 100% on wrap, and will fail below */
828
829 return (used > 1) && (tn->bits > 1) && ((100 * used) < threshold);
830}
831
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800832static inline bool should_collapse(struct key_vector *tn)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800833{
Alexander Duyck2e1ac882015-03-06 09:54:21 -0800834 unsigned long used = child_length(tn);
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800835
Alexander Duyck6e22d172015-03-06 09:54:39 -0800836 used -= tn_info(tn)->empty_children;
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800837
838 /* account for bits == KEYLENGTH case */
Alexander Duyck6e22d172015-03-06 09:54:39 -0800839 if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children)
Alexander Duyck95f60ea2015-01-22 15:51:26 -0800840 used -= KEY_MAX;
841
842 /* One child or none, time to drop us from the trie */
843 return used < 2;
Alexander Duyckf05a4812014-12-31 10:56:37 -0800844}
845
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800846#define MAX_WORK 10
Alexander Duyck88bae712015-03-06 09:54:52 -0800847static struct key_vector *resize(struct trie *t, struct key_vector *tn)
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800848{
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800849#ifdef CONFIG_IP_FIB_TRIE_STATS
850 struct trie_use_stats __percpu *stats = t->stats;
851#endif
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800852 struct key_vector *tp = node_parent(tn);
Alexander Duyck88bae712015-03-06 09:54:52 -0800853 unsigned long cindex = get_index(tn->key, tp);
Alexander Duycka80e89d2015-01-22 15:51:20 -0800854 int max_work = MAX_WORK;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800855
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800856 pr_debug("In tnode_resize %p inflate_threshold=%d threshold=%d\n",
857 tn, inflate_threshold, halve_threshold);
858
Alexander Duyckff181ed2014-12-31 10:56:43 -0800859 /* track the tnode via the pointer from the parent instead of
860 * doing it ourselves. This way we can let RCU fully do its
861 * thing without us interfering
862 */
Alexander Duyck88bae712015-03-06 09:54:52 -0800863 BUG_ON(tn != get_child(tp, cindex));
Alexander Duyckff181ed2014-12-31 10:56:43 -0800864
Alexander Duyckf05a4812014-12-31 10:56:37 -0800865 /* Double as long as the resulting node has a number of
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800866 * nonempty nodes that are above the threshold.
867 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700868 while (should_inflate(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800869 tp = inflate(t, tn);
870 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800871#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800872 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800873#endif
874 break;
875 }
Alexander Duyckff181ed2014-12-31 10:56:43 -0800876
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700877 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800878 tn = get_child(tp, cindex);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800879 }
880
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700881 /* update parent in case inflate failed */
882 tp = node_parent(tn);
883
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800884 /* Return if at least one inflate is run */
885 if (max_work != MAX_WORK)
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700886 return tp;
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800887
Alexander Duyckf05a4812014-12-31 10:56:37 -0800888 /* Halve as long as the number of empty children in this
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800889 * node is above threshold.
890 */
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700891 while (should_halve(tp, tn) && max_work) {
Alexander Duyck88bae712015-03-06 09:54:52 -0800892 tp = halve(t, tn);
893 if (!tp) {
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800894#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8d8e8102015-03-06 09:54:02 -0800895 this_cpu_inc(stats->resize_node_skipped);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800896#endif
897 break;
898 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800899
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700900 max_work--;
Alexander Duyck88bae712015-03-06 09:54:52 -0800901 tn = get_child(tp, cindex);
Alexander Duyckff181ed2014-12-31 10:56:43 -0800902 }
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800903
904 /* Only one child remains */
Alexander Duyck88bae712015-03-06 09:54:52 -0800905 if (should_collapse(tn))
906 return collapse(t, tn);
907
Alexander Duyckb6f15f82015-03-23 11:51:53 -0700908 /* update parent in case halve failed */
Alexander Duycka52ca622016-12-01 07:27:57 -0500909 return node_parent(tn);
Alexander Duyckcf3637b2014-12-31 10:56:31 -0800910}
911
Alexander Duyck1a239172016-12-01 07:27:52 -0500912static void node_pull_suffix(struct key_vector *tn, unsigned char slen)
Robert Olsson19baf832005-06-21 12:43:18 -0700913{
Alexander Duyck1a239172016-12-01 07:27:52 -0500914 unsigned char node_slen = tn->slen;
915
916 while ((node_slen > tn->pos) && (node_slen > slen)) {
917 slen = update_suffix(tn);
918 if (node_slen == slen)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800919 break;
Alexander Duyck1a239172016-12-01 07:27:52 -0500920
921 tn = node_parent(tn);
922 node_slen = tn->slen;
Alexander Duyck5405afd2014-12-31 10:57:08 -0800923 }
924}
925
Alexander Duyck1a239172016-12-01 07:27:52 -0500926static void node_push_suffix(struct key_vector *tn, unsigned char slen)
Alexander Duyck5405afd2014-12-31 10:57:08 -0800927{
Alexander Duyck1a239172016-12-01 07:27:52 -0500928 while (tn->slen < slen) {
929 tn->slen = slen;
Alexander Duyck5405afd2014-12-31 10:57:08 -0800930 tn = node_parent(tn);
931 }
932}
933
Robert Olsson2373ce12005-08-25 13:01:29 -0700934/* rcu_read_lock needs to be hold by caller from readside */
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800935static struct key_vector *fib_find_node(struct trie *t,
936 struct key_vector **tp, u32 key)
Robert Olsson19baf832005-06-21 12:43:18 -0700937{
Alexander Duyck88bae712015-03-06 09:54:52 -0800938 struct key_vector *pn, *n = t->kv;
939 unsigned long index = 0;
Robert Olsson19baf832005-06-21 12:43:18 -0700940
Alexander Duyck88bae712015-03-06 09:54:52 -0800941 do {
942 pn = n;
943 n = get_child_rcu(n, index);
944
945 if (!n)
946 break;
947
948 index = get_cindex(key, n);
Alexander Duyck939afb02014-12-31 10:56:00 -0800949
950 /* This bit of code is a bit tricky but it combines multiple
951 * checks into a single check. The prefix consists of the
952 * prefix plus zeros for the bits in the cindex. The index
953 * is the difference between the key and this value. From
954 * this we can actually derive several pieces of data.
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800955 * if (index >= (1ul << bits))
Alexander Duyck939afb02014-12-31 10:56:00 -0800956 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -0800957 * else
958 * we know the value is cindex
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800959 *
960 * This check is safe even if bits == KEYLENGTH due to the
961 * fact that we can only allocate a node with 32 bits if a
962 * long is greater than 32 bits.
Alexander Duyck939afb02014-12-31 10:56:00 -0800963 */
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800964 if (index >= (1ul << n->bits)) {
965 n = NULL;
966 break;
967 }
Alexander Duyck939afb02014-12-31 10:56:00 -0800968
Alexander Duyck88bae712015-03-06 09:54:52 -0800969 /* keep searching until we find a perfect match leaf or NULL */
970 } while (IS_TNODE(n));
Robert Olsson19baf832005-06-21 12:43:18 -0700971
Alexander Duyck35c6eda2015-03-06 09:54:08 -0800972 *tp = pn;
Alexander Duyckd4a975e2015-03-04 15:01:59 -0800973
Alexander Duyck939afb02014-12-31 10:56:00 -0800974 return n;
Robert Olsson19baf832005-06-21 12:43:18 -0700975}
976
Guillaume Nault32ccf112022-02-04 14:58:19 +0100977/* Return the first fib alias matching DSCP with
Alexander Duyck02525362015-01-22 15:51:39 -0800978 * priority less than or equal to PRIO.
Ido Schimmelb5fc0432019-12-14 17:53:08 +0200979 * If 'find_first' is set, return the first matching
Guillaume Nault32ccf112022-02-04 14:58:19 +0100980 * fib alias, regardless of DSCP and priority.
Alexander Duyck02525362015-01-22 15:51:39 -0800981 */
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800982static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen,
Guillaume Nault32ccf112022-02-04 14:58:19 +0100983 dscp_t dscp, u32 prio, u32 tb_id,
Ido Schimmelb5fc0432019-12-14 17:53:08 +0200984 bool find_first)
Alexander Duyck02525362015-01-22 15:51:39 -0800985{
986 struct fib_alias *fa;
987
988 if (!fah)
989 return NULL;
990
Alexander Duyck56315f92015-02-25 15:31:31 -0800991 hlist_for_each_entry(fa, fah, fa_list) {
Guillaume Nault32ccf112022-02-04 14:58:19 +0100992 /* Avoid Sparse warning when using dscp_t in inequalities */
993 u8 __fa_dscp = inet_dscp_to_dsfield(fa->fa_dscp);
994 u8 __dscp = inet_dscp_to_dsfield(dscp);
995
Alexander Duyck79e5ad22015-02-25 15:31:51 -0800996 if (fa->fa_slen < slen)
997 continue;
998 if (fa->fa_slen != slen)
999 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001000 if (fa->tb_id > tb_id)
1001 continue;
1002 if (fa->tb_id != tb_id)
1003 break;
Ido Schimmelb5fc0432019-12-14 17:53:08 +02001004 if (find_first)
1005 return fa;
Guillaume Nault32ccf112022-02-04 14:58:19 +01001006 if (__fa_dscp > __dscp)
Alexander Duyck02525362015-01-22 15:51:39 -08001007 continue;
Guillaume Nault32ccf112022-02-04 14:58:19 +01001008 if (fa->fa_info->fib_priority >= prio || __fa_dscp < __dscp)
Alexander Duyck02525362015-01-22 15:51:39 -08001009 return fa;
1010 }
1011
1012 return NULL;
1013}
1014
Ido Schimmel90b93f12020-01-14 13:23:11 +02001015static struct fib_alias *
1016fib_find_matching_alias(struct net *net, const struct fib_rt_info *fri)
1017{
1018 u8 slen = KEYLENGTH - fri->dst_len;
1019 struct key_vector *l, *tp;
1020 struct fib_table *tb;
1021 struct fib_alias *fa;
1022 struct trie *t;
1023
1024 tb = fib_get_table(net, fri->tb_id);
1025 if (!tb)
1026 return NULL;
1027
1028 t = (struct trie *)tb->tb_data;
1029 l = fib_find_node(t, &tp, be32_to_cpu(fri->dst));
1030 if (!l)
1031 return NULL;
1032
1033 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
1034 if (fa->fa_slen == slen && fa->tb_id == fri->tb_id &&
Guillaume Nault888ade82022-04-08 22:08:37 +02001035 fa->fa_dscp == fri->dscp && fa->fa_info == fri->fi &&
1036 fa->fa_type == fri->type)
Ido Schimmel90b93f12020-01-14 13:23:11 +02001037 return fa;
1038 }
1039
1040 return NULL;
1041}
1042
1043void fib_alias_hw_flags_set(struct net *net, const struct fib_rt_info *fri)
1044{
Kuniyuki Iwashima96b9bd82022-07-22 11:22:05 -07001045 u8 fib_notify_on_flag_change;
Ido Schimmel90b93f12020-01-14 13:23:11 +02001046 struct fib_alias *fa_match;
Amit Cohen680aea02021-02-01 21:47:52 +02001047 struct sk_buff *skb;
1048 int err;
Ido Schimmel90b93f12020-01-14 13:23:11 +02001049
1050 rcu_read_lock();
1051
1052 fa_match = fib_find_matching_alias(net, fri);
1053 if (!fa_match)
1054 goto out;
1055
Eric Dumazet9fcf9862022-02-16 09:32:16 -08001056 /* These are paired with the WRITE_ONCE() happening in this function.
1057 * The reason is that we are only protected by RCU at this point.
1058 */
1059 if (READ_ONCE(fa_match->offload) == fri->offload &&
1060 READ_ONCE(fa_match->trap) == fri->trap &&
1061 READ_ONCE(fa_match->offload_failed) == fri->offload_failed)
Amit Cohen680aea02021-02-01 21:47:52 +02001062 goto out;
1063
Eric Dumazet9fcf9862022-02-16 09:32:16 -08001064 WRITE_ONCE(fa_match->offload, fri->offload);
1065 WRITE_ONCE(fa_match->trap, fri->trap);
Amit Cohen648106c2021-02-07 10:22:51 +02001066
Kuniyuki Iwashima96b9bd82022-07-22 11:22:05 -07001067 fib_notify_on_flag_change = READ_ONCE(net->ipv4.sysctl_fib_notify_on_flag_change);
1068
Amit Cohen648106c2021-02-07 10:22:51 +02001069 /* 2 means send notifications only if offload_failed was changed. */
Kuniyuki Iwashima96b9bd82022-07-22 11:22:05 -07001070 if (fib_notify_on_flag_change == 2 &&
Eric Dumazet9fcf9862022-02-16 09:32:16 -08001071 READ_ONCE(fa_match->offload_failed) == fri->offload_failed)
Amit Cohen648106c2021-02-07 10:22:51 +02001072 goto out;
1073
Eric Dumazet9fcf9862022-02-16 09:32:16 -08001074 WRITE_ONCE(fa_match->offload_failed, fri->offload_failed);
Ido Schimmel90b93f12020-01-14 13:23:11 +02001075
Kuniyuki Iwashima96b9bd82022-07-22 11:22:05 -07001076 if (!fib_notify_on_flag_change)
Amit Cohen680aea02021-02-01 21:47:52 +02001077 goto out;
1078
1079 skb = nlmsg_new(fib_nlmsg_size(fa_match->fa_info), GFP_ATOMIC);
1080 if (!skb) {
1081 err = -ENOBUFS;
1082 goto errout;
1083 }
1084
1085 err = fib_dump_info(skb, 0, 0, RTM_NEWROUTE, fri, 0);
1086 if (err < 0) {
1087 /* -EMSGSIZE implies BUG in fib_nlmsg_size() */
1088 WARN_ON(err == -EMSGSIZE);
1089 kfree_skb(skb);
1090 goto errout;
1091 }
1092
1093 rtnl_notify(skb, net, 0, RTNLGRP_IPV4_ROUTE, NULL, GFP_ATOMIC);
1094 goto out;
1095
1096errout:
1097 rtnl_set_sk_err(net, RTNLGRP_IPV4_ROUTE, err);
Ido Schimmel90b93f12020-01-14 13:23:11 +02001098out:
1099 rcu_read_unlock();
1100}
1101EXPORT_SYMBOL_GPL(fib_alias_hw_flags_set);
1102
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001103static void trie_rebalance(struct trie *t, struct key_vector *tn)
Robert Olsson19baf832005-06-21 12:43:18 -07001104{
Alexander Duyck88bae712015-03-06 09:54:52 -08001105 while (!IS_TRIE(tn))
1106 tn = resize(t, tn);
Robert Olsson19baf832005-06-21 12:43:18 -07001107}
1108
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001109static int fib_insert_node(struct trie *t, struct key_vector *tp,
Alexander Duyckd5d64872015-03-04 15:02:18 -08001110 struct fib_alias *new, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -07001111{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001112 struct key_vector *n, *l;
Alexander Duyck836a0122014-12-31 10:56:06 -08001113
Alexander Duyckd5d64872015-03-04 15:02:18 -08001114 l = leaf_new(key, new);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001115 if (!l)
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001116 goto noleaf;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001117
1118 /* retrieve child from parent node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001119 n = get_child(tp, get_index(key, tp));
Alexander Duyck836a0122014-12-31 10:56:06 -08001120
1121 /* Case 2: n is a LEAF or a TNODE and the key doesn't match.
1122 *
1123 * Add a new tnode here
1124 * first tnode need some special handling
1125 * leaves us in position for handling as case 3
1126 */
1127 if (n) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001128 struct key_vector *tn;
Alexander Duyck836a0122014-12-31 10:56:06 -08001129
Alexander Duycke9b44012014-12-31 10:56:12 -08001130 tn = tnode_new(key, __fls(key ^ n->key), 1);
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001131 if (!tn)
1132 goto notnode;
Olof Johansson91b9a272005-08-09 20:24:39 -07001133
Alexander Duyck836a0122014-12-31 10:56:06 -08001134 /* initialize routes out of node */
1135 NODE_INIT_PARENT(tn, tp);
1136 put_child(tn, get_index(key, tn) ^ 1, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001137
Alexander Duyck836a0122014-12-31 10:56:06 -08001138 /* start adding routes into the node */
Alexander Duyck88bae712015-03-06 09:54:52 -08001139 put_child_root(tp, key, tn);
Alexander Duyck836a0122014-12-31 10:56:06 -08001140 node_set_parent(n, tn);
Robert Olsson19baf832005-06-21 12:43:18 -07001141
Alexander Duyck836a0122014-12-31 10:56:06 -08001142 /* parent now has a NULL spot where the leaf can go */
Alexander Duycke962f3022014-12-10 21:49:22 -08001143 tp = tn;
Robert Olsson19baf832005-06-21 12:43:18 -07001144 }
Olof Johansson91b9a272005-08-09 20:24:39 -07001145
Alexander Duyck836a0122014-12-31 10:56:06 -08001146 /* Case 3: n is NULL, and will just insert a new leaf */
Alexander Duycka52ca622016-12-01 07:27:57 -05001147 node_push_suffix(tp, new->fa_slen);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001148 NODE_INIT_PARENT(l, tp);
Alexander Duyck88bae712015-03-06 09:54:52 -08001149 put_child_root(tp, key, l);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001150 trie_rebalance(t, tp);
Olof Johansson91b9a272005-08-09 20:24:39 -07001151
Alexander Duyckd5d64872015-03-04 15:02:18 -08001152 return 0;
Alexander Duyck8d8e8102015-03-06 09:54:02 -08001153notnode:
1154 node_free(l);
1155noleaf:
1156 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07001157}
1158
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001159static int fib_insert_alias(struct trie *t, struct key_vector *tp,
1160 struct key_vector *l, struct fib_alias *new,
Alexander Duyckd5d64872015-03-04 15:02:18 -08001161 struct fib_alias *fa, t_key key)
1162{
1163 if (!l)
1164 return fib_insert_node(t, tp, new, key);
1165
1166 if (fa) {
1167 hlist_add_before_rcu(&new->fa_list, &fa->fa_list);
1168 } else {
1169 struct fib_alias *last;
1170
1171 hlist_for_each_entry(last, &l->leaf, fa_list) {
1172 if (new->fa_slen < last->fa_slen)
1173 break;
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001174 if ((new->fa_slen == last->fa_slen) &&
1175 (new->tb_id > last->tb_id))
1176 break;
Alexander Duyckd5d64872015-03-04 15:02:18 -08001177 fa = last;
1178 }
1179
1180 if (fa)
1181 hlist_add_behind_rcu(&new->fa_list, &fa->fa_list);
1182 else
1183 hlist_add_head_rcu(&new->fa_list, &l->leaf);
1184 }
1185
1186 /* if we added to the tail node then we need to update slen */
1187 if (l->slen < new->fa_slen) {
1188 l->slen = new->fa_slen;
Alexander Duyck1a239172016-12-01 07:27:52 -05001189 node_push_suffix(tp, new->fa_slen);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001190 }
1191
1192 return 0;
1193}
1194
David Ahern78055992017-05-27 16:19:26 -06001195static bool fib_valid_key_len(u32 key, u8 plen, struct netlink_ext_ack *extack)
David Ahernba277e82017-05-27 16:19:25 -06001196{
David Ahern78055992017-05-27 16:19:26 -06001197 if (plen > KEYLENGTH) {
1198 NL_SET_ERR_MSG(extack, "Invalid prefix length");
David Ahernba277e82017-05-27 16:19:25 -06001199 return false;
David Ahern78055992017-05-27 16:19:26 -06001200 }
David Ahernba277e82017-05-27 16:19:25 -06001201
David Ahern78055992017-05-27 16:19:26 -06001202 if ((plen < KEYLENGTH) && (key << plen)) {
1203 NL_SET_ERR_MSG(extack,
1204 "Invalid prefix for given prefix length");
David Ahernba277e82017-05-27 16:19:25 -06001205 return false;
David Ahern78055992017-05-27 16:19:26 -06001206 }
David Ahernba277e82017-05-27 16:19:25 -06001207
1208 return true;
1209}
1210
Ido Schimmela6c76c12019-12-14 17:53:07 +02001211static void fib_remove_alias(struct trie *t, struct key_vector *tp,
1212 struct key_vector *l, struct fib_alias *old);
1213
Alexander Duyckd5d64872015-03-04 15:02:18 -08001214/* Caller must hold RTNL. */
Jiri Pirkob90eb752016-09-26 12:52:29 +02001215int fib_table_insert(struct net *net, struct fib_table *tb,
David Ahern6d8422a12017-05-21 10:12:02 -06001216 struct fib_config *cfg, struct netlink_ext_ack *extack)
Robert Olsson19baf832005-06-21 12:43:18 -07001217{
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001218 struct trie *t = (struct trie *)tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001219 struct fib_alias *fa, *new_fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001220 struct key_vector *l, *tp;
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001221 u16 nlflags = NLM_F_EXCL;
Robert Olsson19baf832005-06-21 12:43:18 -07001222 struct fib_info *fi;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001223 u8 plen = cfg->fc_dst_len;
1224 u8 slen = KEYLENGTH - plen;
Guillaume Nault32ccf112022-02-04 14:58:19 +01001225 dscp_t dscp;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001226 u32 key;
Robert Olsson19baf832005-06-21 12:43:18 -07001227 int err;
Robert Olsson19baf832005-06-21 12:43:18 -07001228
Thomas Graf4e902c52006-08-17 18:14:52 -07001229 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001230
David Ahern78055992017-05-27 16:19:26 -06001231 if (!fib_valid_key_len(key, plen, extack))
Robert Olsson19baf832005-06-21 12:43:18 -07001232 return -EINVAL;
1233
David Ahernba277e82017-05-27 16:19:25 -06001234 pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen);
1235
David Ahern6d8422a12017-05-21 10:12:02 -06001236 fi = fib_create_info(cfg, extack);
Thomas Graf4e902c52006-08-17 18:14:52 -07001237 if (IS_ERR(fi)) {
1238 err = PTR_ERR(fi);
Robert Olsson19baf832005-06-21 12:43:18 -07001239 goto err;
Thomas Graf4e902c52006-08-17 18:14:52 -07001240 }
Robert Olsson19baf832005-06-21 12:43:18 -07001241
Guillaume Nault32ccf112022-02-04 14:58:19 +01001242 dscp = cfg->fc_dscp;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001243 l = fib_find_node(t, &tp, key);
Guillaume Nault32ccf112022-02-04 14:58:19 +01001244 fa = l ? fib_find_alias(&l->leaf, slen, dscp, fi->fib_priority,
Ido Schimmelb5fc0432019-12-14 17:53:08 +02001245 tb->tb_id, false) : NULL;
Robert Olsson19baf832005-06-21 12:43:18 -07001246
1247 /* Now fa, if non-NULL, points to the first fib alias
Guillaume Nault32ccf112022-02-04 14:58:19 +01001248 * with the same keys [prefix,dscp,priority], if such key already
Robert Olsson19baf832005-06-21 12:43:18 -07001249 * exists or to the node before which we will insert new one.
1250 *
1251 * If fa is NULL, we will need to allocate a new one and
Alexander Duyck56315f92015-02-25 15:31:31 -08001252 * insert to the tail of the section matching the suffix length
1253 * of the new alias.
Robert Olsson19baf832005-06-21 12:43:18 -07001254 */
1255
Guillaume Nault32ccf112022-02-04 14:58:19 +01001256 if (fa && fa->fa_dscp == dscp &&
Julian Anastasov936f6f82008-01-28 21:18:06 -08001257 fa->fa_info->fib_priority == fi->fib_priority) {
1258 struct fib_alias *fa_first, *fa_match;
Robert Olsson19baf832005-06-21 12:43:18 -07001259
1260 err = -EEXIST;
Thomas Graf4e902c52006-08-17 18:14:52 -07001261 if (cfg->fc_nlflags & NLM_F_EXCL)
Robert Olsson19baf832005-06-21 12:43:18 -07001262 goto out;
1263
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001264 nlflags &= ~NLM_F_EXCL;
1265
Julian Anastasov936f6f82008-01-28 21:18:06 -08001266 /* We have 2 goals:
1267 * 1. Find exact match for type, scope, fib_info to avoid
1268 * duplicate routes
1269 * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it
1270 */
1271 fa_match = NULL;
1272 fa_first = fa;
Alexander Duyck56315f92015-02-25 15:31:31 -08001273 hlist_for_each_entry_from(fa, fa_list) {
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001274 if ((fa->fa_slen != slen) ||
1275 (fa->tb_id != tb->tb_id) ||
Guillaume Nault32ccf112022-02-04 14:58:19 +01001276 (fa->fa_dscp != dscp))
Julian Anastasov936f6f82008-01-28 21:18:06 -08001277 break;
1278 if (fa->fa_info->fib_priority != fi->fib_priority)
1279 break;
1280 if (fa->fa_type == cfg->fc_type &&
Julian Anastasov936f6f82008-01-28 21:18:06 -08001281 fa->fa_info == fi) {
1282 fa_match = fa;
1283 break;
1284 }
1285 }
1286
Thomas Graf4e902c52006-08-17 18:14:52 -07001287 if (cfg->fc_nlflags & NLM_F_REPLACE) {
Robert Olsson19baf832005-06-21 12:43:18 -07001288 struct fib_info *fi_drop;
1289 u8 state;
1290
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001291 nlflags |= NLM_F_REPLACE;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001292 fa = fa_first;
1293 if (fa_match) {
1294 if (fa == fa_match)
1295 err = 0;
Joonwoo Park67250332008-01-18 03:45:18 -08001296 goto out;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001297 }
Robert Olsson2373ce12005-08-25 13:01:29 -07001298 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001299 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001300 if (!new_fa)
Robert Olsson2373ce12005-08-25 13:01:29 -07001301 goto out;
Robert Olsson19baf832005-06-21 12:43:18 -07001302
1303 fi_drop = fa->fa_info;
Guillaume Nault32ccf112022-02-04 14:58:19 +01001304 new_fa->fa_dscp = fa->fa_dscp;
Robert Olsson2373ce12005-08-25 13:01:29 -07001305 new_fa->fa_info = fi;
Thomas Graf4e902c52006-08-17 18:14:52 -07001306 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001307 state = fa->fa_state;
Julian Anastasov936f6f82008-01-28 21:18:06 -08001308 new_fa->fa_state = state & ~FA_S_ACCESSED;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001309 new_fa->fa_slen = fa->fa_slen;
Michal Kubečekd4e64c22015-05-22 13:40:09 +02001310 new_fa->tb_id = tb->tb_id;
Julian Anastasov2392deb2015-07-22 10:43:23 +03001311 new_fa->fa_default = -1;
Ido Schimmel90b93f12020-01-14 13:23:11 +02001312 new_fa->offload = 0;
1313 new_fa->trap = 0;
Amit Cohen36c51002021-02-07 10:22:50 +02001314 new_fa->offload_failed = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001315
Ido Schimmel6324d0f2020-01-14 13:23:09 +02001316 hlist_replace_rcu(&fa->fa_list, &new_fa->fa_list);
1317
Ido Schimmelee3936d2019-12-14 17:53:09 +02001318 if (fib_find_alias(&l->leaf, fa->fa_slen, 0, 0,
Ido Schimmel6324d0f2020-01-14 13:23:09 +02001319 tb->tb_id, true) == new_fa) {
Ido Schimmelee3936d2019-12-14 17:53:09 +02001320 enum fib_event_type fib_event;
1321
Ido Schimmel446f7392019-12-14 17:53:15 +02001322 fib_event = FIB_EVENT_ENTRY_REPLACE;
Ido Schimmelee3936d2019-12-14 17:53:09 +02001323 err = call_fib_entry_notifiers(net, fib_event,
1324 key, plen,
1325 new_fa, extack);
Ido Schimmel6324d0f2020-01-14 13:23:09 +02001326 if (err) {
1327 hlist_replace_rcu(&new_fa->fa_list,
1328 &fa->fa_list);
Ido Schimmelee3936d2019-12-14 17:53:09 +02001329 goto out_free_new_fa;
Ido Schimmel6324d0f2020-01-14 13:23:09 +02001330 }
Ido Schimmelee3936d2019-12-14 17:53:09 +02001331 }
David Ahernc1d7ee62018-03-27 18:21:58 -07001332
Ido Schimmel5b7d6162017-02-09 10:28:40 +01001333 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen,
1334 tb->tb_id, &cfg->fc_nlinfo, nlflags);
1335
Robert Olsson2373ce12005-08-25 13:01:29 -07001336 alias_free_mem_rcu(fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001337
1338 fib_release_info(fi_drop);
1339 if (state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001340 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Jiri Pirkob90eb752016-09-26 12:52:29 +02001341
Olof Johansson91b9a272005-08-09 20:24:39 -07001342 goto succeeded;
Robert Olsson19baf832005-06-21 12:43:18 -07001343 }
1344 /* Error if we find a perfect match which
1345 * uses the same scope, type, and nexthop
1346 * information.
1347 */
Julian Anastasov936f6f82008-01-28 21:18:06 -08001348 if (fa_match)
1349 goto out;
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001350
Ido Schimmel446f7392019-12-14 17:53:15 +02001351 if (cfg->fc_nlflags & NLM_F_APPEND)
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001352 nlflags |= NLM_F_APPEND;
Ido Schimmel446f7392019-12-14 17:53:15 +02001353 else
Julian Anastasov936f6f82008-01-28 21:18:06 -08001354 fa = fa_first;
Robert Olsson19baf832005-06-21 12:43:18 -07001355 }
1356 err = -ENOENT;
Thomas Graf4e902c52006-08-17 18:14:52 -07001357 if (!(cfg->fc_nlflags & NLM_F_CREATE))
Robert Olsson19baf832005-06-21 12:43:18 -07001358 goto out;
1359
Guillaume Naultb93e1fa2016-09-07 17:20:46 +02001360 nlflags |= NLM_F_CREATE;
Robert Olsson19baf832005-06-21 12:43:18 -07001361 err = -ENOBUFS;
Christoph Lametere94b1762006-12-06 20:33:17 -08001362 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01001363 if (!new_fa)
Robert Olsson19baf832005-06-21 12:43:18 -07001364 goto out;
1365
1366 new_fa->fa_info = fi;
Guillaume Nault32ccf112022-02-04 14:58:19 +01001367 new_fa->fa_dscp = dscp;
Thomas Graf4e902c52006-08-17 18:14:52 -07001368 new_fa->fa_type = cfg->fc_type;
Robert Olsson19baf832005-06-21 12:43:18 -07001369 new_fa->fa_state = 0;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001370 new_fa->fa_slen = slen;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001371 new_fa->tb_id = tb->tb_id;
Julian Anastasov2392deb2015-07-22 10:43:23 +03001372 new_fa->fa_default = -1;
Ido Schimmel90b93f12020-01-14 13:23:11 +02001373 new_fa->offload = 0;
1374 new_fa->trap = 0;
Amit Cohen36c51002021-02-07 10:22:50 +02001375 new_fa->offload_failed = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001376
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001377 /* Insert new entry to the list. */
Alexander Duyckd5d64872015-03-04 15:02:18 -08001378 err = fib_insert_alias(t, tp, l, new_fa, fa, key);
1379 if (err)
Ido Schimmela6c76c12019-12-14 17:53:07 +02001380 goto out_free_new_fa;
1381
1382 /* The alias was already inserted, so the node must exist. */
1383 l = l ? l : fib_find_node(t, &tp, key);
Ziyang Xuan568fe842022-11-20 15:28:38 +08001384 if (WARN_ON_ONCE(!l)) {
1385 err = -ENOENT;
Ido Schimmela6c76c12019-12-14 17:53:07 +02001386 goto out_free_new_fa;
Ziyang Xuan568fe842022-11-20 15:28:38 +08001387 }
Ido Schimmela6c76c12019-12-14 17:53:07 +02001388
Ido Schimmela8674f72019-12-14 17:53:10 +02001389 if (fib_find_alias(&l->leaf, new_fa->fa_slen, 0, 0, tb->tb_id, true) ==
1390 new_fa) {
1391 enum fib_event_type fib_event;
1392
Ido Schimmel446f7392019-12-14 17:53:15 +02001393 fib_event = FIB_EVENT_ENTRY_REPLACE;
Ido Schimmela8674f72019-12-14 17:53:10 +02001394 err = call_fib_entry_notifiers(net, fib_event, key, plen,
1395 new_fa, extack);
1396 if (err)
1397 goto out_remove_new_fa;
1398 }
Robert Olsson19baf832005-06-21 12:43:18 -07001399
David S. Miller21d8c492011-04-14 14:49:37 -07001400 if (!plen)
1401 tb->tb_num_default++;
1402
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001403 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001404 rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, new_fa->tb_id,
Roopa Prabhua2bb6d72015-06-17 11:07:01 -07001405 &cfg->fc_nlinfo, nlflags);
Robert Olsson19baf832005-06-21 12:43:18 -07001406succeeded:
1407 return 0;
Robert Olssonf835e472005-06-28 15:00:39 -07001408
Ido Schimmela6c76c12019-12-14 17:53:07 +02001409out_remove_new_fa:
1410 fib_remove_alias(t, tp, l, new_fa);
Robert Olssonf835e472005-06-28 15:00:39 -07001411out_free_new_fa:
1412 kmem_cache_free(fn_alias_kmem, new_fa);
Robert Olsson19baf832005-06-21 12:43:18 -07001413out:
1414 fib_release_info(fi);
Olof Johansson91b9a272005-08-09 20:24:39 -07001415err:
Robert Olsson19baf832005-06-21 12:43:18 -07001416 return err;
1417}
1418
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001419static inline t_key prefix_mismatch(t_key key, struct key_vector *n)
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001420{
1421 t_key prefix = n->key;
1422
1423 return (key ^ prefix) & (prefix | -prefix);
1424}
1425
David Ahernaf7888a2020-05-26 12:56:17 -06001426bool fib_lookup_good_nhc(const struct fib_nh_common *nhc, int fib_flags,
1427 const struct flowi4 *flp)
1428{
1429 if (nhc->nhc_flags & RTNH_F_DEAD)
1430 return false;
1431
1432 if (ip_ignore_linkdown(nhc->nhc_dev) &&
1433 nhc->nhc_flags & RTNH_F_LINKDOWN &&
1434 !(fib_flags & FIB_LOOKUP_IGNORE_LINKSTATE))
1435 return false;
1436
David Ahern40867d72022-03-14 14:45:51 -06001437 if (flp->flowi4_oif && flp->flowi4_oif != nhc->nhc_oif)
1438 return false;
David Ahernaf7888a2020-05-26 12:56:17 -06001439
1440 return true;
1441}
1442
Alexander Duyck345e9b52014-12-31 10:56:24 -08001443/* should be called with rcu_read_lock */
David S. Miller22bd5b92011-03-11 19:54:08 -05001444int fib_table_lookup(struct fib_table *tb, const struct flowi4 *flp,
Eric Dumazetebc0ffa2010-10-05 10:41:36 +00001445 struct fib_result *res, int fib_flags)
Robert Olsson19baf832005-06-21 12:43:18 -07001446{
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001447 struct trie *t = (struct trie *) tb->tb_data;
Alexander Duyck8274a972014-12-31 10:55:29 -08001448#ifdef CONFIG_IP_FIB_TRIE_STATS
1449 struct trie_use_stats __percpu *stats = t->stats;
1450#endif
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001451 const t_key key = ntohl(flp->daddr);
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001452 struct key_vector *n, *pn;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001453 struct fib_alias *fa;
Alexander Duyck71e8b672015-03-04 15:04:03 -08001454 unsigned long index;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001455 t_key cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001456
Alexander Duyck88bae712015-03-06 09:54:52 -08001457 pn = t->kv;
1458 cindex = 0;
1459
1460 n = get_child_rcu(pn, cindex);
David Ahern9f323972018-05-23 17:08:47 -07001461 if (!n) {
1462 trace_fib_table_lookup(tb->tb_id, flp, NULL, -EAGAIN);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001463 return -EAGAIN;
David Ahern9f323972018-05-23 17:08:47 -07001464 }
Robert Olsson19baf832005-06-21 12:43:18 -07001465
1466#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08001467 this_cpu_inc(stats->gets);
Robert Olsson19baf832005-06-21 12:43:18 -07001468#endif
1469
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001470 /* Step 1: Travel to the longest prefix match in the trie */
1471 for (;;) {
Alexander Duyck88bae712015-03-06 09:54:52 -08001472 index = get_cindex(key, n);
Robert Olsson19baf832005-06-21 12:43:18 -07001473
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001474 /* This bit of code is a bit tricky but it combines multiple
1475 * checks into a single check. The prefix consists of the
1476 * prefix plus zeros for the "bits" in the prefix. The index
1477 * is the difference between the key and this value. From
1478 * this we can actually derive several pieces of data.
Alexander Duyck71e8b672015-03-04 15:04:03 -08001479 * if (index >= (1ul << bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001480 * we have a mismatch in skip bits and failed
Alexander Duyckb3832112015-01-22 15:51:08 -08001481 * else
1482 * we know the value is cindex
Alexander Duyck71e8b672015-03-04 15:04:03 -08001483 *
1484 * This check is safe even if bits == KEYLENGTH due to the
1485 * fact that we can only allocate a node with 32 bits if a
1486 * long is greater than 32 bits.
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001487 */
Alexander Duyck71e8b672015-03-04 15:04:03 -08001488 if (index >= (1ul << n->bits))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001489 break;
Robert Olsson19baf832005-06-21 12:43:18 -07001490
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001491 /* we have found a leaf. Prefixes have already been compared */
1492 if (IS_LEAF(n))
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08001493 goto found;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001494
1495 /* only record pn and cindex if we are going to be chopping
1496 * bits later. Otherwise we are just wasting cycles.
1497 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001498 if (n->slen > n->pos) {
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001499 pn = n;
1500 cindex = index;
Olof Johansson91b9a272005-08-09 20:24:39 -07001501 }
1502
Alexander Duyck754baf8d2015-03-06 09:54:14 -08001503 n = get_child_rcu(n, index);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001504 if (unlikely(!n))
Robert Olsson19baf832005-06-21 12:43:18 -07001505 goto backtrace;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001506 }
1507
1508 /* Step 2: Sort out leaves and begin backtracing for longest prefix */
1509 for (;;) {
1510 /* record the pointer where our next node pointer is stored */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001511 struct key_vector __rcu **cptr = n->tnode;
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001512
1513 /* This test verifies that none of the bits that differ
1514 * between the key and the prefix exist in the region of
1515 * the lsb and higher in the prefix.
1516 */
Alexander Duyck5405afd2014-12-31 10:57:08 -08001517 if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos))
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001518 goto backtrace;
1519
1520 /* exit out and process leaf */
1521 if (unlikely(IS_LEAF(n)))
1522 break;
1523
1524 /* Don't bother recording parent info. Since we are in
1525 * prefix match mode we will have to come back to wherever
1526 * we started this traversal anyway
1527 */
1528
1529 while ((n = rcu_dereference(*cptr)) == NULL) {
1530backtrace:
1531#ifdef CONFIG_IP_FIB_TRIE_STATS
1532 if (!n)
1533 this_cpu_inc(stats->null_node_hit);
1534#endif
1535 /* If we are at cindex 0 there are no more bits for
1536 * us to strip at this level so we must ascend back
1537 * up one level to see if there are any more bits to
1538 * be stripped there.
1539 */
1540 while (!cindex) {
1541 t_key pkey = pn->key;
1542
Alexander Duyck88bae712015-03-06 09:54:52 -08001543 /* If we don't have a parent then there is
1544 * nothing for us to do as we do not have any
1545 * further nodes to parse.
1546 */
David Ahern9f323972018-05-23 17:08:47 -07001547 if (IS_TRIE(pn)) {
1548 trace_fib_table_lookup(tb->tb_id, flp,
1549 NULL, -EAGAIN);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001550 return -EAGAIN;
David Ahern9f323972018-05-23 17:08:47 -07001551 }
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001552#ifdef CONFIG_IP_FIB_TRIE_STATS
1553 this_cpu_inc(stats->backtrack);
1554#endif
1555 /* Get Child's index */
Alexander Duyck88bae712015-03-06 09:54:52 -08001556 pn = node_parent_rcu(pn);
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001557 cindex = get_index(pkey, pn);
1558 }
1559
1560 /* strip the least significant bit from the cindex */
1561 cindex &= cindex - 1;
1562
1563 /* grab pointer for next child node */
Alexander Duyck41b489f2015-03-04 15:02:33 -08001564 cptr = &pn->tnode[cindex];
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001565 }
Robert Olsson19baf832005-06-21 12:43:18 -07001566 }
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001567
Robert Olsson19baf832005-06-21 12:43:18 -07001568found:
Alexander Duyck71e8b672015-03-04 15:04:03 -08001569 /* this line carries forward the xor from earlier in the function */
1570 index = key ^ n->key;
1571
Alexander Duyck9f9e6362014-12-31 10:55:54 -08001572 /* Step 3: Process the leaf, if that fails fall back to backtracing */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001573 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
1574 struct fib_info *fi = fa->fa_info;
David Ahernaf7888a2020-05-26 12:56:17 -06001575 struct fib_nh_common *nhc;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001576 int nhsel, err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001577
Alexander Duycka5829f52016-01-28 13:42:24 -08001578 if ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen < KEYLENGTH)) {
1579 if (index >= (1ul << fa->fa_slen))
1580 continue;
1581 }
Guillaume Nault32ccf112022-02-04 14:58:19 +01001582 if (fa->fa_dscp &&
1583 inet_dscp_to_dsfield(fa->fa_dscp) != flp->flowi4_tos)
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001584 continue;
Eric Dumazetfce92af2023-08-30 09:55:20 +00001585 /* Paired with WRITE_ONCE() in fib_release_info() */
1586 if (READ_ONCE(fi->fib_dead))
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001587 continue;
1588 if (fa->fa_info->fib_scope < flp->flowi4_scope)
1589 continue;
1590 fib_alias_accessed(fa);
1591 err = fib_props[fa->fa_type].error;
1592 if (unlikely(err < 0)) {
David Ahern4c7e8082019-06-03 20:19:51 -07001593out_reject:
Alexander Duyck345e9b52014-12-31 10:56:24 -08001594#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001595 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001596#endif
David Ahern9f323972018-05-23 17:08:47 -07001597 trace_fib_table_lookup(tb->tb_id, flp, NULL, err);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001598 return err;
1599 }
1600 if (fi->fib_flags & RTNH_F_DEAD)
1601 continue;
David Ahern4c7e8082019-06-03 20:19:51 -07001602
David Ahernaf7888a2020-05-26 12:56:17 -06001603 if (unlikely(fi->nh)) {
1604 if (nexthop_is_blackhole(fi->nh)) {
1605 err = fib_props[RTN_BLACKHOLE].error;
1606 goto out_reject;
1607 }
1608
1609 nhc = nexthop_get_nhc_lookup(fi->nh, fib_flags, flp,
1610 &nhsel);
1611 if (nhc)
1612 goto set_result;
1613 goto miss;
David Ahern4c7e8082019-06-03 20:19:51 -07001614 }
1615
David Ahern5481d732019-06-03 20:19:49 -07001616 for (nhsel = 0; nhsel < fib_info_num_path(fi); nhsel++) {
David Ahernaf7888a2020-05-26 12:56:17 -06001617 nhc = fib_info_nhc(fi, nhsel);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001618
David Ahernaf7888a2020-05-26 12:56:17 -06001619 if (!fib_lookup_good_nhc(nhc, fib_flags, flp))
Alexander Duyck345e9b52014-12-31 10:56:24 -08001620 continue;
David Ahernaf7888a2020-05-26 12:56:17 -06001621set_result:
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001622 if (!(fib_flags & FIB_LOOKUP_NOREF))
Reshetova, Elena0029c0d2017-07-04 09:35:02 +03001623 refcount_inc(&fi->fib_clntref);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001624
David Ahern6ffd9032017-05-25 10:42:37 -07001625 res->prefix = htonl(n->key);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001626 res->prefixlen = KEYLENGTH - fa->fa_slen;
1627 res->nh_sel = nhsel;
David Aherneba618a2019-04-02 14:11:55 -07001628 res->nhc = nhc;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001629 res->type = fa->fa_type;
1630 res->scope = fi->fib_scope;
1631 res->fi = fi;
1632 res->table = tb;
1633 res->fa_head = &n->leaf;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001634#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001635 this_cpu_inc(stats->semantic_match_passed);
Alexander Duyck345e9b52014-12-31 10:56:24 -08001636#endif
David Aherneba618a2019-04-02 14:11:55 -07001637 trace_fib_table_lookup(tb->tb_id, flp, nhc, err);
David Ahernf6d3c192015-08-28 08:42:09 -07001638
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001639 return err;
Alexander Duyck345e9b52014-12-31 10:56:24 -08001640 }
Alexander Duyck345e9b52014-12-31 10:56:24 -08001641 }
David Ahernaf7888a2020-05-26 12:56:17 -06001642miss:
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08001643#ifdef CONFIG_IP_FIB_TRIE_STATS
1644 this_cpu_inc(stats->semantic_match_miss);
1645#endif
Alexander Duyck345e9b52014-12-31 10:56:24 -08001646 goto backtrace;
Robert Olsson19baf832005-06-21 12:43:18 -07001647}
Florian Westphal6fc01432011-08-25 13:46:12 +02001648EXPORT_SYMBOL_GPL(fib_table_lookup);
Robert Olsson19baf832005-06-21 12:43:18 -07001649
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001650static void fib_remove_alias(struct trie *t, struct key_vector *tp,
1651 struct key_vector *l, struct fib_alias *old)
Alexander Duyckd5d64872015-03-04 15:02:18 -08001652{
1653 /* record the location of the previous list_info entry */
1654 struct hlist_node **pprev = old->fa_list.pprev;
1655 struct fib_alias *fa = hlist_entry(pprev, typeof(*fa), fa_list.next);
1656
1657 /* remove the fib_alias from the list */
1658 hlist_del_rcu(&old->fa_list);
1659
1660 /* if we emptied the list this leaf will be freed and we can sort
1661 * out parent suffix lengths as a part of trie_rebalance
1662 */
1663 if (hlist_empty(&l->leaf)) {
Alexander Duycka52ca622016-12-01 07:27:57 -05001664 if (tp->slen == l->slen)
1665 node_pull_suffix(tp, tp->pos);
Alexander Duyck88bae712015-03-06 09:54:52 -08001666 put_child_root(tp, l->key, NULL);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001667 node_free(l);
1668 trie_rebalance(t, tp);
1669 return;
1670 }
1671
1672 /* only access fa if it is pointing at the last valid hlist_node */
1673 if (*pprev)
1674 return;
1675
1676 /* update the trie with the latest suffix length */
1677 l->slen = fa->fa_slen;
Alexander Duyck1a239172016-12-01 07:27:52 -05001678 node_pull_suffix(tp, fa->fa_slen);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001679}
1680
Ido Schimmelf613b6e2019-12-14 17:53:11 +02001681static void fib_notify_alias_delete(struct net *net, u32 key,
1682 struct hlist_head *fah,
1683 struct fib_alias *fa_to_delete,
1684 struct netlink_ext_ack *extack)
1685{
1686 struct fib_alias *fa_next, *fa_to_notify;
1687 u32 tb_id = fa_to_delete->tb_id;
1688 u8 slen = fa_to_delete->fa_slen;
1689 enum fib_event_type fib_event;
1690
1691 /* Do not notify if we do not care about the route. */
1692 if (fib_find_alias(fah, slen, 0, 0, tb_id, true) != fa_to_delete)
1693 return;
1694
1695 /* Determine if the route should be replaced by the next route in the
1696 * list.
1697 */
1698 fa_next = hlist_entry_safe(fa_to_delete->fa_list.next,
1699 struct fib_alias, fa_list);
1700 if (fa_next && fa_next->fa_slen == slen && fa_next->tb_id == tb_id) {
Ido Schimmel446f7392019-12-14 17:53:15 +02001701 fib_event = FIB_EVENT_ENTRY_REPLACE;
Ido Schimmelf613b6e2019-12-14 17:53:11 +02001702 fa_to_notify = fa_next;
1703 } else {
Ido Schimmel446f7392019-12-14 17:53:15 +02001704 fib_event = FIB_EVENT_ENTRY_DEL;
Ido Schimmelf613b6e2019-12-14 17:53:11 +02001705 fa_to_notify = fa_to_delete;
1706 }
1707 call_fib_entry_notifiers(net, fib_event, key, KEYLENGTH - slen,
1708 fa_to_notify, extack);
1709}
1710
Alexander Duyckd5d64872015-03-04 15:02:18 -08001711/* Caller must hold RTNL. */
Jiri Pirkob90eb752016-09-26 12:52:29 +02001712int fib_table_delete(struct net *net, struct fib_table *tb,
David Ahern78055992017-05-27 16:19:26 -06001713 struct fib_config *cfg, struct netlink_ext_ack *extack)
Robert Olsson19baf832005-06-21 12:43:18 -07001714{
1715 struct trie *t = (struct trie *) tb->tb_data;
Robert Olsson19baf832005-06-21 12:43:18 -07001716 struct fib_alias *fa, *fa_to_delete;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001717 struct key_vector *l, *tp;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001718 u8 plen = cfg->fc_dst_len;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08001719 u8 slen = KEYLENGTH - plen;
Guillaume Nault32ccf112022-02-04 14:58:19 +01001720 dscp_t dscp;
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001721 u32 key;
Olof Johansson91b9a272005-08-09 20:24:39 -07001722
Thomas Graf4e902c52006-08-17 18:14:52 -07001723 key = ntohl(cfg->fc_dst);
Robert Olsson19baf832005-06-21 12:43:18 -07001724
David Ahern78055992017-05-27 16:19:26 -06001725 if (!fib_valid_key_len(key, plen, extack))
Robert Olsson19baf832005-06-21 12:43:18 -07001726 return -EINVAL;
1727
Alexander Duyckd4a975e2015-03-04 15:01:59 -08001728 l = fib_find_node(t, &tp, key);
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07001729 if (!l)
Robert Olsson19baf832005-06-21 12:43:18 -07001730 return -ESRCH;
1731
Guillaume Nault32ccf112022-02-04 14:58:19 +01001732 dscp = cfg->fc_dscp;
1733 fa = fib_find_alias(&l->leaf, slen, dscp, 0, tb->tb_id, false);
Robert Olsson19baf832005-06-21 12:43:18 -07001734 if (!fa)
1735 return -ESRCH;
1736
Guillaume Nault32ccf112022-02-04 14:58:19 +01001737 pr_debug("Deleting %08x/%d dsfield=0x%02x t=%p\n", key, plen,
1738 inet_dscp_to_dsfield(dscp), t);
Robert Olsson19baf832005-06-21 12:43:18 -07001739
1740 fa_to_delete = NULL;
Alexander Duyck56315f92015-02-25 15:31:31 -08001741 hlist_for_each_entry_from(fa, fa_list) {
Robert Olsson19baf832005-06-21 12:43:18 -07001742 struct fib_info *fi = fa->fa_info;
1743
Alexander Duyck0b65bd92015-03-12 14:46:29 -07001744 if ((fa->fa_slen != slen) ||
1745 (fa->tb_id != tb->tb_id) ||
Guillaume Nault32ccf112022-02-04 14:58:19 +01001746 (fa->fa_dscp != dscp))
Robert Olsson19baf832005-06-21 12:43:18 -07001747 break;
1748
Thomas Graf4e902c52006-08-17 18:14:52 -07001749 if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) &&
1750 (cfg->fc_scope == RT_SCOPE_NOWHERE ||
David S. Miller37e826c2011-03-24 18:06:47 -07001751 fa->fa_info->fib_scope == cfg->fc_scope) &&
Julian Anastasov74cb3c12011-03-19 12:13:46 +00001752 (!cfg->fc_prefsrc ||
1753 fi->fib_prefsrc == cfg->fc_prefsrc) &&
Thomas Graf4e902c52006-08-17 18:14:52 -07001754 (!cfg->fc_protocol ||
1755 fi->fib_protocol == cfg->fc_protocol) &&
Alexander Aringfaee6762020-03-27 18:00:21 -04001756 fib_nh_match(net, cfg, fi, extack) == 0 &&
Xin Long5f9ae3d2017-08-23 10:07:26 +08001757 fib_metrics_match(cfg, fi)) {
Robert Olsson19baf832005-06-21 12:43:18 -07001758 fa_to_delete = fa;
1759 break;
1760 }
1761 }
1762
Olof Johansson91b9a272005-08-09 20:24:39 -07001763 if (!fa_to_delete)
1764 return -ESRCH;
Robert Olsson19baf832005-06-21 12:43:18 -07001765
Ido Schimmelf613b6e2019-12-14 17:53:11 +02001766 fib_notify_alias_delete(net, key, &l->leaf, fa_to_delete, extack);
Alexander Duyckd5d64872015-03-04 15:02:18 -08001767 rtmsg_fib(RTM_DELROUTE, htonl(key), fa_to_delete, plen, tb->tb_id,
Milan Kocianb8f55832007-05-23 14:55:06 -07001768 &cfg->fc_nlinfo, 0);
Robert Olsson19baf832005-06-21 12:43:18 -07001769
David S. Miller21d8c492011-04-14 14:49:37 -07001770 if (!plen)
1771 tb->tb_num_default--;
1772
Alexander Duyckd5d64872015-03-04 15:02:18 -08001773 fib_remove_alias(t, tp, l, fa_to_delete);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08001774
Alexander Duyckd5d64872015-03-04 15:02:18 -08001775 if (fa_to_delete->fa_state & FA_S_ACCESSED)
Nicolas Dichtel4ccfe6d2012-09-07 00:45:29 +00001776 rt_cache_flush(cfg->fc_nlinfo.nl_net);
Olof Johansson91b9a272005-08-09 20:24:39 -07001777
Alexander Duyckd5d64872015-03-04 15:02:18 -08001778 fib_release_info(fa_to_delete->fa_info);
1779 alias_free_mem_rcu(fa_to_delete);
Olof Johansson91b9a272005-08-09 20:24:39 -07001780 return 0;
Robert Olsson19baf832005-06-21 12:43:18 -07001781}
1782
Alexander Duyck8be33e92015-03-04 14:59:19 -08001783/* Scan for the next leaf starting at the provided key value */
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001784static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)
Robert Olsson19baf832005-06-21 12:43:18 -07001785{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08001786 struct key_vector *pn, *n = *tn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001787 unsigned long cindex;
Robert Olsson19baf832005-06-21 12:43:18 -07001788
Alexander Duyck8be33e92015-03-04 14:59:19 -08001789 /* this loop is meant to try and find the key in the trie */
Alexander Duyck88bae712015-03-06 09:54:52 -08001790 do {
1791 /* record parent and next child index */
1792 pn = n;
Alexander Duyckc2229fe2015-10-27 15:06:45 -07001793 cindex = (key > pn->key) ? get_index(key, pn) : 0;
Alexander Duyck88bae712015-03-06 09:54:52 -08001794
1795 if (cindex >> pn->bits)
1796 break;
1797
1798 /* descend into the next child */
1799 n = get_child_rcu(pn, cindex++);
1800 if (!n)
1801 break;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001802
Alexander Duyck8be33e92015-03-04 14:59:19 -08001803 /* guarantee forward progress on the keys */
1804 if (IS_LEAF(n) && (n->key >= key))
1805 goto found;
Alexander Duyck88bae712015-03-06 09:54:52 -08001806 } while (IS_TNODE(n));
Alexander Duyck8be33e92015-03-04 14:59:19 -08001807
1808 /* this loop will search for the next leaf with a greater key */
Alexander Duyck88bae712015-03-06 09:54:52 -08001809 while (!IS_TRIE(pn)) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08001810 /* if we exhausted the parent node we will need to climb */
1811 if (cindex >= (1ul << pn->bits)) {
1812 t_key pkey = pn->key;
1813
1814 pn = node_parent_rcu(pn);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001815 cindex = get_index(pkey, pn) + 1;
1816 continue;
Robert Olsson19baf832005-06-21 12:43:18 -07001817 }
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001818
Alexander Duyck8be33e92015-03-04 14:59:19 -08001819 /* grab the next available node */
Alexander Duyck754baf8d2015-03-06 09:54:14 -08001820 n = get_child_rcu(pn, cindex++);
Alexander Duyck8be33e92015-03-04 14:59:19 -08001821 if (!n)
1822 continue;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001823
Alexander Duyck8be33e92015-03-04 14:59:19 -08001824 /* no need to compare keys since we bumped the index */
1825 if (IS_LEAF(n))
1826 goto found;
1827
1828 /* Rescan start scanning in new node */
1829 pn = n;
1830 cindex = 0;
1831 }
1832
1833 *tn = pn;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001834 return NULL; /* Root of trie */
Alexander Duyck8be33e92015-03-04 14:59:19 -08001835found:
1836 /* if we are at the limit for keys just return NULL for the tnode */
Alexander Duyck88bae712015-03-06 09:54:52 -08001837 *tn = pn;
Alexander Duyck8be33e92015-03-04 14:59:19 -08001838 return n;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08001839}
1840
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001841static void fib_trie_free(struct fib_table *tb)
1842{
1843 struct trie *t = (struct trie *)tb->tb_data;
1844 struct key_vector *pn = t->kv;
1845 unsigned long cindex = 1;
1846 struct hlist_node *tmp;
1847 struct fib_alias *fa;
1848
1849 /* walk trie in reverse order and free everything */
1850 for (;;) {
1851 struct key_vector *n;
1852
1853 if (!(cindex--)) {
1854 t_key pkey = pn->key;
1855
1856 if (IS_TRIE(pn))
1857 break;
1858
1859 n = pn;
1860 pn = node_parent(pn);
1861
1862 /* drop emptied tnode */
1863 put_child_root(pn, n->key, NULL);
1864 node_free(n);
1865
1866 cindex = get_index(pkey, pn);
1867
1868 continue;
1869 }
1870
1871 /* grab the next available node */
1872 n = get_child(pn, cindex);
1873 if (!n)
1874 continue;
1875
1876 if (IS_TNODE(n)) {
1877 /* record pn and cindex for leaf walking */
1878 pn = n;
1879 cindex = 1ul << n->bits;
1880
1881 continue;
1882 }
1883
1884 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
1885 hlist_del_rcu(&fa->fa_list);
1886 alias_free_mem_rcu(fa);
1887 }
1888
1889 put_child_root(pn, n->key, NULL);
1890 node_free(n);
1891 }
1892
1893#ifdef CONFIG_IP_FIB_TRIE_STATS
1894 free_percpu(t->stats);
1895#endif
1896 kfree(tb);
1897}
1898
1899struct fib_table *fib_trie_unmerge(struct fib_table *oldtb)
1900{
1901 struct trie *ot = (struct trie *)oldtb->tb_data;
1902 struct key_vector *l, *tp = ot->kv;
1903 struct fib_table *local_tb;
1904 struct fib_alias *fa;
1905 struct trie *lt;
1906 t_key key = 0;
1907
1908 if (oldtb->tb_data == oldtb->__data)
1909 return oldtb;
1910
1911 local_tb = fib_trie_table(RT_TABLE_LOCAL, NULL);
1912 if (!local_tb)
1913 return NULL;
1914
1915 lt = (struct trie *)local_tb->tb_data;
1916
1917 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
1918 struct key_vector *local_l = NULL, *local_tp;
1919
Ido Schimmel83f35222020-07-29 11:37:13 +03001920 hlist_for_each_entry(fa, &l->leaf, fa_list) {
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001921 struct fib_alias *new_fa;
1922
1923 if (local_tb->tb_id != fa->tb_id)
1924 continue;
1925
1926 /* clone fa for new local table */
1927 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
1928 if (!new_fa)
1929 goto out;
1930
1931 memcpy(new_fa, fa, sizeof(*fa));
1932
1933 /* insert clone into table */
1934 if (!local_l)
1935 local_l = fib_find_node(lt, &local_tp, l->key);
1936
1937 if (fib_insert_alias(lt, local_tp, local_l, new_fa,
Alexander Duyck3114cdf2016-11-15 05:46:12 -05001938 NULL, l->key)) {
1939 kmem_cache_free(fn_alias_kmem, new_fa);
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001940 goto out;
Alexander Duyck3114cdf2016-11-15 05:46:12 -05001941 }
Alexander Duyck0ddcf432015-03-06 13:47:00 -08001942 }
1943
1944 /* stop loop if key wrapped back to 0 */
1945 key = l->key + 1;
1946 if (key < l->key)
1947 break;
1948 }
1949
1950 return local_tb;
1951out:
1952 fib_trie_free(local_tb);
1953
1954 return NULL;
1955}
1956
Alexander Duyck3b709332016-11-15 05:46:06 -05001957/* Caller must hold RTNL */
1958void fib_table_flush_external(struct fib_table *tb)
1959{
1960 struct trie *t = (struct trie *)tb->tb_data;
1961 struct key_vector *pn = t->kv;
1962 unsigned long cindex = 1;
1963 struct hlist_node *tmp;
1964 struct fib_alias *fa;
1965
1966 /* walk trie in reverse order */
1967 for (;;) {
1968 unsigned char slen = 0;
1969 struct key_vector *n;
1970
1971 if (!(cindex--)) {
1972 t_key pkey = pn->key;
1973
1974 /* cannot resize the trie vector */
1975 if (IS_TRIE(pn))
1976 break;
1977
Alexander Duycka52ca622016-12-01 07:27:57 -05001978 /* update the suffix to address pulled leaves */
1979 if (pn->slen > pn->pos)
1980 update_suffix(pn);
1981
Alexander Duyck3b709332016-11-15 05:46:06 -05001982 /* resize completed node */
1983 pn = resize(t, pn);
1984 cindex = get_index(pkey, pn);
1985
1986 continue;
1987 }
1988
1989 /* grab the next available node */
1990 n = get_child(pn, cindex);
1991 if (!n)
1992 continue;
1993
1994 if (IS_TNODE(n)) {
1995 /* record pn and cindex for leaf walking */
1996 pn = n;
1997 cindex = 1ul << n->bits;
1998
1999 continue;
2000 }
2001
2002 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
2003 /* if alias was cloned to local then we just
2004 * need to remove the local copy from main
2005 */
2006 if (tb->tb_id != fa->tb_id) {
2007 hlist_del_rcu(&fa->fa_list);
2008 alias_free_mem_rcu(fa);
2009 continue;
2010 }
2011
2012 /* record local slen */
2013 slen = fa->fa_slen;
2014 }
2015
2016 /* update leaf slen */
2017 n->slen = slen;
2018
2019 if (hlist_empty(&n->leaf)) {
2020 put_child_root(pn, n->key, NULL);
2021 node_free(n);
2022 }
2023 }
2024}
2025
Alexander Duyck8be33e92015-03-04 14:59:19 -08002026/* Caller must hold RTNL. */
Ido Schimmelf97f4dd2019-01-09 09:57:39 +00002027int fib_table_flush(struct net *net, struct fib_table *tb, bool flush_all)
Robert Olsson19baf832005-06-21 12:43:18 -07002028{
Alexander Duyck7289e6d2015-03-04 14:58:19 -08002029 struct trie *t = (struct trie *)tb->tb_data;
Hangbin Liu4b2b6062023-09-22 15:55:08 +08002030 struct nl_info info = { .nl_net = net };
Alexander Duyck88bae712015-03-06 09:54:52 -08002031 struct key_vector *pn = t->kv;
2032 unsigned long cindex = 1;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08002033 struct hlist_node *tmp;
2034 struct fib_alias *fa;
Stephen Hemminger82cfbb02008-01-22 21:55:32 -08002035 int found = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07002036
Alexander Duyck88bae712015-03-06 09:54:52 -08002037 /* walk trie in reverse order */
2038 for (;;) {
2039 unsigned char slen = 0;
2040 struct key_vector *n;
Robert Olsson19baf832005-06-21 12:43:18 -07002041
Alexander Duyck88bae712015-03-06 09:54:52 -08002042 if (!(cindex--)) {
2043 t_key pkey = pn->key;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08002044
Alexander Duyck88bae712015-03-06 09:54:52 -08002045 /* cannot resize the trie vector */
2046 if (IS_TRIE(pn))
2047 break;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08002048
Alexander Duycka52ca622016-12-01 07:27:57 -05002049 /* update the suffix to address pulled leaves */
2050 if (pn->slen > pn->pos)
2051 update_suffix(pn);
2052
Alexander Duyck88bae712015-03-06 09:54:52 -08002053 /* resize completed node */
2054 pn = resize(t, pn);
2055 cindex = get_index(pkey, pn);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08002056
Alexander Duyck88bae712015-03-06 09:54:52 -08002057 continue;
2058 }
Alexander Duyck7289e6d2015-03-04 14:58:19 -08002059
Alexander Duyck88bae712015-03-06 09:54:52 -08002060 /* grab the next available node */
2061 n = get_child(pn, cindex);
2062 if (!n)
2063 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08002064
Alexander Duyck88bae712015-03-06 09:54:52 -08002065 if (IS_TNODE(n)) {
2066 /* record pn and cindex for leaf walking */
2067 pn = n;
2068 cindex = 1ul << n->bits;
2069
2070 continue;
2071 }
2072
2073 hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) {
2074 struct fib_info *fi = fa->fa_info;
2075
Ido Schimmelf97f4dd2019-01-09 09:57:39 +00002076 if (!fi || tb->tb_id != fa->tb_id ||
2077 (!(fi->fib_flags & RTNH_F_DEAD) &&
2078 !fib_props[fa->fa_type].error)) {
2079 slen = fa->fa_slen;
2080 continue;
2081 }
2082
2083 /* Do not flush error routes if network namespace is
2084 * not being dismantled
2085 */
2086 if (!flush_all && fib_props[fa->fa_type].error) {
Alexander Duyck88bae712015-03-06 09:54:52 -08002087 slen = fa->fa_slen;
2088 continue;
Alexander Duyck7289e6d2015-03-04 14:58:19 -08002089 }
2090
Ido Schimmel525bc342019-12-14 17:53:12 +02002091 fib_notify_alias_delete(net, n->key, &n->leaf, fa,
2092 NULL);
Hangbin Liu4b2b6062023-09-22 15:55:08 +08002093 if (fi->pfsrc_removed)
2094 rtmsg_fib(RTM_DELROUTE, htonl(n->key), fa,
2095 KEYLENGTH - fa->fa_slen, tb->tb_id, &info, 0);
Alexander Duyck7289e6d2015-03-04 14:58:19 -08002096 hlist_del_rcu(&fa->fa_list);
2097 fib_release_info(fa->fa_info);
2098 alias_free_mem_rcu(fa);
2099 found++;
Alexander Duyck64c62722015-01-22 15:51:45 -08002100 }
2101
Alexander Duyck88bae712015-03-06 09:54:52 -08002102 /* update leaf slen */
2103 n->slen = slen;
2104
2105 if (hlist_empty(&n->leaf)) {
2106 put_child_root(pn, n->key, NULL);
2107 node_free(n);
Alexander Duyck88bae712015-03-06 09:54:52 -08002108 }
Robert Olsson19baf832005-06-21 12:43:18 -07002109 }
2110
Stephen Hemminger0c7770c2005-08-23 21:59:41 -07002111 pr_debug("trie_flush found=%d\n", found);
Robert Olsson19baf832005-06-21 12:43:18 -07002112 return found;
2113}
2114
David Ahern1bff1a02019-05-22 12:04:42 -07002115/* derived from fib_trie_free */
2116static void __fib_info_notify_update(struct net *net, struct fib_table *tb,
2117 struct nl_info *info)
2118{
2119 struct trie *t = (struct trie *)tb->tb_data;
2120 struct key_vector *pn = t->kv;
2121 unsigned long cindex = 1;
2122 struct fib_alias *fa;
2123
2124 for (;;) {
2125 struct key_vector *n;
2126
2127 if (!(cindex--)) {
2128 t_key pkey = pn->key;
2129
2130 if (IS_TRIE(pn))
2131 break;
2132
David Ahern1bff1a02019-05-22 12:04:42 -07002133 pn = node_parent(pn);
2134 cindex = get_index(pkey, pn);
2135 continue;
2136 }
2137
2138 /* grab the next available node */
2139 n = get_child(pn, cindex);
2140 if (!n)
2141 continue;
2142
2143 if (IS_TNODE(n)) {
2144 /* record pn and cindex for leaf walking */
2145 pn = n;
2146 cindex = 1ul << n->bits;
2147
2148 continue;
2149 }
2150
2151 hlist_for_each_entry(fa, &n->leaf, fa_list) {
2152 struct fib_info *fi = fa->fa_info;
2153
2154 if (!fi || !fi->nh_updated || fa->tb_id != tb->tb_id)
2155 continue;
2156
2157 rtmsg_fib(RTM_NEWROUTE, htonl(n->key), fa,
2158 KEYLENGTH - fa->fa_slen, tb->tb_id,
2159 info, NLM_F_REPLACE);
David Ahern1bff1a02019-05-22 12:04:42 -07002160 }
2161 }
2162}
2163
2164void fib_info_notify_update(struct net *net, struct nl_info *info)
2165{
2166 unsigned int h;
2167
2168 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2169 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
2170 struct fib_table *tb;
2171
Ido Schimmel7f6f32b2020-08-26 19:48:10 +03002172 hlist_for_each_entry_rcu(tb, head, tb_hlist,
2173 lockdep_rtnl_is_held())
David Ahern1bff1a02019-05-22 12:04:42 -07002174 __fib_info_notify_update(net, tb, info);
2175 }
2176}
2177
Jiri Pirko55c894f2019-10-03 11:49:28 +02002178static int fib_leaf_notify(struct key_vector *l, struct fib_table *tb,
Jiri Pirkob7a59552019-10-03 11:49:30 +02002179 struct notifier_block *nb,
2180 struct netlink_ext_ack *extack)
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002181{
2182 struct fib_alias *fa;
Ido Schimmel20d15652019-12-14 17:53:13 +02002183 int last_slen = -1;
Jiri Pirko55c894f2019-10-03 11:49:28 +02002184 int err;
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002185
2186 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
2187 struct fib_info *fi = fa->fa_info;
2188
2189 if (!fi)
2190 continue;
2191
2192 /* local and main table can share the same trie,
2193 * so don't notify twice for the same entry.
2194 */
2195 if (tb->tb_id != fa->tb_id)
2196 continue;
2197
Ido Schimmel20d15652019-12-14 17:53:13 +02002198 if (fa->fa_slen == last_slen)
2199 continue;
2200
2201 last_slen = fa->fa_slen;
Ido Schimmel446f7392019-12-14 17:53:15 +02002202 err = call_fib_entry_notifier(nb, FIB_EVENT_ENTRY_REPLACE,
Ido Schimmel20d15652019-12-14 17:53:13 +02002203 l->key, KEYLENGTH - fa->fa_slen,
2204 fa, extack);
2205 if (err)
2206 return err;
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002207 }
Jiri Pirko55c894f2019-10-03 11:49:28 +02002208 return 0;
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002209}
2210
Jiri Pirkob7a59552019-10-03 11:49:30 +02002211static int fib_table_notify(struct fib_table *tb, struct notifier_block *nb,
2212 struct netlink_ext_ack *extack)
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002213{
2214 struct trie *t = (struct trie *)tb->tb_data;
2215 struct key_vector *l, *tp = t->kv;
2216 t_key key = 0;
Jiri Pirko55c894f2019-10-03 11:49:28 +02002217 int err;
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002218
2219 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
Jiri Pirkob7a59552019-10-03 11:49:30 +02002220 err = fib_leaf_notify(l, tb, nb, extack);
Jiri Pirko55c894f2019-10-03 11:49:28 +02002221 if (err)
2222 return err;
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002223
2224 key = l->key + 1;
2225 /* stop in case of wrap around */
2226 if (key < l->key)
2227 break;
2228 }
Jiri Pirko55c894f2019-10-03 11:49:28 +02002229 return 0;
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002230}
2231
Jiri Pirkob7a59552019-10-03 11:49:30 +02002232int fib_notify(struct net *net, struct notifier_block *nb,
2233 struct netlink_ext_ack *extack)
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002234{
2235 unsigned int h;
Jiri Pirko55c894f2019-10-03 11:49:28 +02002236 int err;
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002237
2238 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2239 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
2240 struct fib_table *tb;
2241
Jiri Pirko55c894f2019-10-03 11:49:28 +02002242 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Jiri Pirkob7a59552019-10-03 11:49:30 +02002243 err = fib_table_notify(tb, nb, extack);
Jiri Pirko55c894f2019-10-03 11:49:28 +02002244 if (err)
2245 return err;
2246 }
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002247 }
Jiri Pirko55c894f2019-10-03 11:49:28 +02002248 return 0;
Ido Schimmelc3852ef2016-12-03 16:45:07 +01002249}
2250
Alexander Duycka7e53532015-03-04 15:02:44 -08002251static void __trie_free_rcu(struct rcu_head *head)
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00002252{
Alexander Duycka7e53532015-03-04 15:02:44 -08002253 struct fib_table *tb = container_of(head, struct fib_table, rcu);
Alexander Duyck8274a972014-12-31 10:55:29 -08002254#ifdef CONFIG_IP_FIB_TRIE_STATS
2255 struct trie *t = (struct trie *)tb->tb_data;
2256
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002257 if (tb->tb_data == tb->__data)
2258 free_percpu(t->stats);
Alexander Duyck8274a972014-12-31 10:55:29 -08002259#endif /* CONFIG_IP_FIB_TRIE_STATS */
Pavel Emelyanov4aa2c462010-10-28 02:00:43 +00002260 kfree(tb);
2261}
2262
Alexander Duycka7e53532015-03-04 15:02:44 -08002263void fib_free_table(struct fib_table *tb)
2264{
2265 call_rcu(&tb->rcu, __trie_free_rcu);
2266}
2267
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002268static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,
David Ahern18a80212018-10-15 18:56:43 -07002269 struct sk_buff *skb, struct netlink_callback *cb,
2270 struct fib_dump_filter *filter)
Robert Olsson19baf832005-06-21 12:43:18 -07002271{
David Ahern18a80212018-10-15 18:56:43 -07002272 unsigned int flags = NLM_F_MULTI;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002273 __be32 xkey = htonl(l->key);
Stefano Brivioee289062019-06-21 17:45:23 +02002274 int i, s_i, i_fa, s_fa, err;
Robert Olsson19baf832005-06-21 12:43:18 -07002275 struct fib_alias *fa;
Robert Olsson19baf832005-06-21 12:43:18 -07002276
Stefano Brivioee289062019-06-21 17:45:23 +02002277 if (filter->filter_set ||
2278 !filter->dump_exceptions || !filter->dump_routes)
David Ahern18a80212018-10-15 18:56:43 -07002279 flags |= NLM_F_DUMP_FILTERED;
2280
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002281 s_i = cb->args[4];
Stefano Brivioee289062019-06-21 17:45:23 +02002282 s_fa = cb->args[5];
Robert Olsson19baf832005-06-21 12:43:18 -07002283 i = 0;
2284
Robert Olsson2373ce12005-08-25 13:01:29 -07002285 /* rcu_read_lock is hold by caller */
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002286 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
Stefano Brivioee289062019-06-21 17:45:23 +02002287 struct fib_info *fi = fa->fa_info;
David Ahernf6c57752017-05-15 23:19:17 -07002288
David Ahern18a80212018-10-15 18:56:43 -07002289 if (i < s_i)
2290 goto next;
Robert Olsson19baf832005-06-21 12:43:18 -07002291
Stefano Brivioee289062019-06-21 17:45:23 +02002292 i_fa = 0;
2293
David Ahern18a80212018-10-15 18:56:43 -07002294 if (tb->tb_id != fa->tb_id)
2295 goto next;
2296
2297 if (filter->filter_set) {
2298 if (filter->rt_type && fa->fa_type != filter->rt_type)
2299 goto next;
2300
2301 if ((filter->protocol &&
Stefano Brivioee289062019-06-21 17:45:23 +02002302 fi->fib_protocol != filter->protocol))
David Ahern18a80212018-10-15 18:56:43 -07002303 goto next;
2304
2305 if (filter->dev &&
Stefano Brivioee289062019-06-21 17:45:23 +02002306 !fib_info_nh_uses_dev(fi, filter->dev))
David Ahern18a80212018-10-15 18:56:43 -07002307 goto next;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002308 }
2309
Stefano Brivio885b8b42019-06-29 19:55:08 +02002310 if (filter->dump_routes) {
2311 if (!s_fa) {
Ido Schimmel1e301fd2020-01-14 13:23:10 +02002312 struct fib_rt_info fri;
2313
2314 fri.fi = fi;
2315 fri.tb_id = tb->tb_id;
2316 fri.dst = xkey;
2317 fri.dst_len = KEYLENGTH - fa->fa_slen;
Guillaume Nault888ade82022-04-08 22:08:37 +02002318 fri.dscp = fa->fa_dscp;
Ido Schimmel1e301fd2020-01-14 13:23:10 +02002319 fri.type = fa->fa_type;
Eric Dumazet9fcf9862022-02-16 09:32:16 -08002320 fri.offload = READ_ONCE(fa->offload);
2321 fri.trap = READ_ONCE(fa->trap);
2322 fri.offload_failed = READ_ONCE(fa->offload_failed);
Stefano Brivio885b8b42019-06-29 19:55:08 +02002323 err = fib_dump_info(skb,
2324 NETLINK_CB(cb->skb).portid,
2325 cb->nlh->nlmsg_seq,
Ido Schimmel1e301fd2020-01-14 13:23:10 +02002326 RTM_NEWROUTE, &fri, flags);
Stefano Brivio885b8b42019-06-29 19:55:08 +02002327 if (err < 0)
2328 goto stop;
2329 }
2330
Stefano Brivioee289062019-06-21 17:45:23 +02002331 i_fa++;
Robert Olsson19baf832005-06-21 12:43:18 -07002332 }
Stefano Brivioee289062019-06-21 17:45:23 +02002333
2334 if (filter->dump_exceptions) {
2335 err = fib_dump_info_fnhe(skb, cb, tb->tb_id, fi,
John Fastabende93fb3e2019-08-23 17:11:38 -07002336 &i_fa, s_fa, flags);
Stefano Brivioee289062019-06-21 17:45:23 +02002337 if (err < 0)
2338 goto stop;
2339 }
2340
David Ahern18a80212018-10-15 18:56:43 -07002341next:
Stephen Hemmingera88ee222008-01-22 21:56:11 -08002342 i++;
Robert Olsson19baf832005-06-21 12:43:18 -07002343 }
Stephen Hemmingera88ee222008-01-22 21:56:11 -08002344
Stephen Hemminger71d67e62008-01-31 16:45:47 -08002345 cb->args[4] = i;
Robert Olsson19baf832005-06-21 12:43:18 -07002346 return skb->len;
Stefano Brivioee289062019-06-21 17:45:23 +02002347
2348stop:
2349 cb->args[4] = i;
2350 cb->args[5] = i_fa;
2351 return err;
Robert Olsson19baf832005-06-21 12:43:18 -07002352}
2353
Alexander Duycka7e53532015-03-04 15:02:44 -08002354/* rcu_read_lock needs to be hold by caller from readside */
Stephen Hemminger16c6cf82009-09-20 10:35:36 +00002355int fib_table_dump(struct fib_table *tb, struct sk_buff *skb,
David Ahern18a80212018-10-15 18:56:43 -07002356 struct netlink_callback *cb, struct fib_dump_filter *filter)
Robert Olsson19baf832005-06-21 12:43:18 -07002357{
Alexander Duyck8be33e92015-03-04 14:59:19 -08002358 struct trie *t = (struct trie *)tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002359 struct key_vector *l, *tp = t->kv;
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08002360 /* Dump starting at last key.
2361 * Note: 0.0.0.0/0 (ie default) is first key.
2362 */
Alexander Duyck8be33e92015-03-04 14:59:19 -08002363 int count = cb->args[2];
2364 t_key key = cb->args[3];
Stephen Hemmingera88ee222008-01-22 21:56:11 -08002365
David Ahern9827c062020-01-10 09:03:58 -08002366 /* First time here, count and key are both always 0. Count > 0
2367 * and key == 0 means the dump has wrapped around and we are done.
2368 */
2369 if (count && !key)
2370 return skb->len;
2371
Alexander Duyck8be33e92015-03-04 14:59:19 -08002372 while ((l = leaf_walk_rcu(&tp, key)) != NULL) {
David Ahernf6c57752017-05-15 23:19:17 -07002373 int err;
2374
David Ahern18a80212018-10-15 18:56:43 -07002375 err = fn_trie_dump_leaf(l, tb, skb, cb, filter);
David Ahernf6c57752017-05-15 23:19:17 -07002376 if (err < 0) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08002377 cb->args[3] = key;
2378 cb->args[2] = count;
David Ahernf6c57752017-05-15 23:19:17 -07002379 return err;
Robert Olsson19baf832005-06-21 12:43:18 -07002380 }
Stephen Hemmingerd5ce8a02008-01-22 21:57:22 -08002381
Stephen Hemminger71d67e62008-01-31 16:45:47 -08002382 ++count;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002383 key = l->key + 1;
2384
Stephen Hemminger71d67e62008-01-31 16:45:47 -08002385 memset(&cb->args[4], 0,
2386 sizeof(cb->args) - 4*sizeof(cb->args[0]));
Alexander Duyck8be33e92015-03-04 14:59:19 -08002387
2388 /* stop loop if key wrapped back to 0 */
2389 if (key < l->key)
2390 break;
Robert Olsson19baf832005-06-21 12:43:18 -07002391 }
Alexander Duyck8be33e92015-03-04 14:59:19 -08002392
Alexander Duyck8be33e92015-03-04 14:59:19 -08002393 cb->args[3] = key;
2394 cb->args[2] = count;
2395
Robert Olsson19baf832005-06-21 12:43:18 -07002396 return skb->len;
Robert Olsson19baf832005-06-21 12:43:18 -07002397}
2398
David S. Miller5348ba82011-02-01 15:30:56 -08002399void __init fib_trie_init(void)
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08002400{
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002401 fn_alias_kmem = kmem_cache_create("ip_fib_alias",
2402 sizeof(struct fib_alias),
Vasily Averin61268912021-07-19 13:44:31 +03002403 0, SLAB_PANIC | SLAB_ACCOUNT, NULL);
Stephen Hemmingerbc3c8c12008-01-22 21:51:50 -08002404
2405 trie_leaf_kmem = kmem_cache_create("ip_fib_trie",
Alexander Duyck41b489f2015-03-04 15:02:33 -08002406 LEAF_SIZE,
Vasily Averin61268912021-07-19 13:44:31 +03002407 0, SLAB_PANIC | SLAB_ACCOUNT, NULL);
Stephen Hemminger7f9b8052008-01-14 23:14:20 -08002408}
Robert Olsson19baf832005-06-21 12:43:18 -07002409
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002410struct fib_table *fib_trie_table(u32 id, struct fib_table *alias)
Robert Olsson19baf832005-06-21 12:43:18 -07002411{
2412 struct fib_table *tb;
2413 struct trie *t;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002414 size_t sz = sizeof(*tb);
Robert Olsson19baf832005-06-21 12:43:18 -07002415
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002416 if (!alias)
2417 sz += sizeof(struct trie);
2418
2419 tb = kzalloc(sz, GFP_KERNEL);
Ian Morris51456b22015-04-03 09:17:26 +01002420 if (!tb)
Robert Olsson19baf832005-06-21 12:43:18 -07002421 return NULL;
2422
2423 tb->tb_id = id;
David S. Miller21d8c492011-04-14 14:49:37 -07002424 tb->tb_num_default = 0;
Alexander Duyck0ddcf432015-03-06 13:47:00 -08002425 tb->tb_data = (alias ? alias->__data : tb->__data);
2426
2427 if (alias)
2428 return tb;
Robert Olsson19baf832005-06-21 12:43:18 -07002429
2430 t = (struct trie *) tb->tb_data;
Alexander Duyck88bae712015-03-06 09:54:52 -08002431 t->kv[0].pos = KEYLENGTH;
2432 t->kv[0].slen = KEYLENGTH;
Alexander Duyck8274a972014-12-31 10:55:29 -08002433#ifdef CONFIG_IP_FIB_TRIE_STATS
2434 t->stats = alloc_percpu(struct trie_use_stats);
2435 if (!t->stats) {
2436 kfree(tb);
2437 tb = NULL;
2438 }
2439#endif
Robert Olsson19baf832005-06-21 12:43:18 -07002440
Robert Olsson19baf832005-06-21 12:43:18 -07002441 return tb;
2442}
2443
Robert Olsson19baf832005-06-21 12:43:18 -07002444#ifdef CONFIG_PROC_FS
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002445/* Depth first Trie walk iterator */
2446struct fib_trie_iter {
Denis V. Lunev1c340b22008-01-10 03:27:17 -08002447 struct seq_net_private p;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002448 struct fib_table *tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002449 struct key_vector *tnode;
Eric Dumazeta034ee32010-09-09 23:32:28 +00002450 unsigned int index;
2451 unsigned int depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002452};
Robert Olsson19baf832005-06-21 12:43:18 -07002453
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002454static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)
Robert Olsson19baf832005-06-21 12:43:18 -07002455{
Alexander Duyck98293e82014-12-31 10:56:18 -08002456 unsigned long cindex = iter->index;
Alexander Duyck88bae712015-03-06 09:54:52 -08002457 struct key_vector *pn = iter->tnode;
2458 t_key pkey;
Eric W. Biederman6640e692007-01-24 14:42:04 -08002459
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002460 pr_debug("get_next iter={node=%p index=%d depth=%d}\n",
2461 iter->tnode, iter->index, iter->depth);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002462
Alexander Duyck88bae712015-03-06 09:54:52 -08002463 while (!IS_TRIE(pn)) {
2464 while (cindex < child_length(pn)) {
2465 struct key_vector *n = get_child_rcu(pn, cindex++);
2466
2467 if (!n)
2468 continue;
2469
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002470 if (IS_LEAF(n)) {
Alexander Duyck88bae712015-03-06 09:54:52 -08002471 iter->tnode = pn;
2472 iter->index = cindex;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002473 } else {
2474 /* push down one level */
Alexander Duyckadaf9812014-12-31 10:55:47 -08002475 iter->tnode = n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002476 iter->index = 0;
2477 ++iter->depth;
2478 }
Alexander Duyck88bae712015-03-06 09:54:52 -08002479
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002480 return n;
2481 }
2482
Alexander Duyck88bae712015-03-06 09:54:52 -08002483 /* Current node exhausted, pop back up */
2484 pkey = pn->key;
2485 pn = node_parent_rcu(pn);
2486 cindex = get_index(pkey, pn) + 1;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002487 --iter->depth;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002488 }
2489
Alexander Duyck88bae712015-03-06 09:54:52 -08002490 /* record root node so further searches know we are done */
2491 iter->tnode = pn;
2492 iter->index = 0;
2493
Robert Olsson19baf832005-06-21 12:43:18 -07002494 return NULL;
2495}
2496
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002497static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,
2498 struct trie *t)
Robert Olsson19baf832005-06-21 12:43:18 -07002499{
Firo Yangf38b24c2015-06-08 11:54:51 +08002500 struct key_vector *n, *pn;
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002501
Stephen Hemminger132adf52007-03-08 20:44:43 -08002502 if (!t)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002503 return NULL;
2504
Firo Yangf38b24c2015-06-08 11:54:51 +08002505 pn = t->kv;
Alexander Duyck88bae712015-03-06 09:54:52 -08002506 n = rcu_dereference(pn->tnode[0]);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002507 if (!n)
Robert Olsson5ddf0eb2006-03-20 21:34:12 -08002508 return NULL;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002509
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002510 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002511 iter->tnode = n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002512 iter->index = 0;
2513 iter->depth = 1;
2514 } else {
Alexander Duyck88bae712015-03-06 09:54:52 -08002515 iter->tnode = pn;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002516 iter->index = 0;
2517 iter->depth = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002518 }
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002519
2520 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002521}
2522
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002523static void trie_collect_stats(struct trie *t, struct trie_stat *s)
Robert Olsson19baf832005-06-21 12:43:18 -07002524{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002525 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002526 struct fib_trie_iter iter;
Robert Olsson19baf832005-06-21 12:43:18 -07002527
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002528 memset(s, 0, sizeof(*s));
Robert Olsson19baf832005-06-21 12:43:18 -07002529
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002530 rcu_read_lock();
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002531 for (n = fib_trie_get_first(&iter, t); n; n = fib_trie_get_next(&iter)) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002532 if (IS_LEAF(n)) {
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002533 struct fib_alias *fa;
Stephen Hemminger93672292008-01-22 21:54:05 -08002534
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002535 s->leaves++;
2536 s->totdepth += iter.depth;
2537 if (iter.depth > s->maxdepth)
2538 s->maxdepth = iter.depth;
Stephen Hemminger93672292008-01-22 21:54:05 -08002539
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002540 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list)
Stephen Hemminger93672292008-01-22 21:54:05 -08002541 ++s->prefixes;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002542 } else {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002543 s->tnodes++;
Alexander Duyckadaf9812014-12-31 10:55:47 -08002544 if (n->bits < MAX_STAT_DEPTH)
2545 s->nodesizes[n->bits]++;
Alexander Duyck6e22d172015-03-06 09:54:39 -08002546 s->nullpointers += tn_info(n)->empty_children;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002547 }
2548 }
2549 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002550}
2551
Stephen Hemmingerc877efb2005-07-19 14:01:51 -07002552/*
Robert Olsson19baf832005-06-21 12:43:18 -07002553 * This outputs /proc/net/fib_triestats
Robert Olsson19baf832005-06-21 12:43:18 -07002554 */
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002555static void trie_show_stats(struct seq_file *seq, struct trie_stat *stat)
Robert Olsson19baf832005-06-21 12:43:18 -07002556{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002557 unsigned int i, max, pointers, bytes, avdepth;
Robert Olsson19baf832005-06-21 12:43:18 -07002558
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002559 if (stat->leaves)
2560 avdepth = stat->totdepth*100 / stat->leaves;
2561 else
2562 avdepth = 0;
Robert Olsson19baf832005-06-21 12:43:18 -07002563
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002564 seq_printf(seq, "\tAver depth: %u.%02d\n",
2565 avdepth / 100, avdepth % 100);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002566 seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth);
Robert Olsson19baf832005-06-21 12:43:18 -07002567
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002568 seq_printf(seq, "\tLeaves: %u\n", stat->leaves);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002569 bytes = LEAF_SIZE * stat->leaves;
Stephen Hemminger93672292008-01-22 21:54:05 -08002570
2571 seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002572 bytes += sizeof(struct fib_alias) * stat->prefixes;
Stephen Hemminger93672292008-01-22 21:54:05 -08002573
Stephen Hemminger187b5182008-01-12 20:55:55 -08002574 seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes);
Alexander Duyck41b489f2015-03-04 15:02:33 -08002575 bytes += TNODE_SIZE(0) * stat->tnodes;
Robert Olsson19baf832005-06-21 12:43:18 -07002576
Robert Olsson06ef9212006-03-20 21:35:01 -08002577 max = MAX_STAT_DEPTH;
2578 while (max > 0 && stat->nodesizes[max-1] == 0)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002579 max--;
Robert Olsson19baf832005-06-21 12:43:18 -07002580
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002581 pointers = 0;
Jerry Snitselaarf585a992013-07-22 12:01:58 -07002582 for (i = 1; i < max; i++)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002583 if (stat->nodesizes[i] != 0) {
Stephen Hemminger187b5182008-01-12 20:55:55 -08002584 seq_printf(seq, " %u: %u", i, stat->nodesizes[i]);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002585 pointers += (1<<i) * stat->nodesizes[i];
2586 }
2587 seq_putc(seq, '\n');
Stephen Hemminger187b5182008-01-12 20:55:55 -08002588 seq_printf(seq, "\tPointers: %u\n", pointers);
Robert Olsson19baf832005-06-21 12:43:18 -07002589
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002590 bytes += sizeof(struct key_vector *) * pointers;
Stephen Hemminger187b5182008-01-12 20:55:55 -08002591 seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers);
2592 seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024);
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002593}
Robert Olsson19baf832005-06-21 12:43:18 -07002594
2595#ifdef CONFIG_IP_FIB_TRIE_STATS
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002596static void trie_show_usage(struct seq_file *seq,
Alexander Duyck8274a972014-12-31 10:55:29 -08002597 const struct trie_use_stats __percpu *stats)
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002598{
Alexander Duyck8274a972014-12-31 10:55:29 -08002599 struct trie_use_stats s = { 0 };
2600 int cpu;
2601
2602 /* loop through all of the CPUs and gather up the stats */
2603 for_each_possible_cpu(cpu) {
2604 const struct trie_use_stats *pcpu = per_cpu_ptr(stats, cpu);
2605
2606 s.gets += pcpu->gets;
2607 s.backtrack += pcpu->backtrack;
2608 s.semantic_match_passed += pcpu->semantic_match_passed;
2609 s.semantic_match_miss += pcpu->semantic_match_miss;
2610 s.null_node_hit += pcpu->null_node_hit;
2611 s.resize_node_skipped += pcpu->resize_node_skipped;
2612 }
2613
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002614 seq_printf(seq, "\nCounters:\n---------\n");
Alexander Duyck8274a972014-12-31 10:55:29 -08002615 seq_printf(seq, "gets = %u\n", s.gets);
2616 seq_printf(seq, "backtracks = %u\n", s.backtrack);
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002617 seq_printf(seq, "semantic match passed = %u\n",
Alexander Duyck8274a972014-12-31 10:55:29 -08002618 s.semantic_match_passed);
2619 seq_printf(seq, "semantic match miss = %u\n", s.semantic_match_miss);
2620 seq_printf(seq, "null node hit= %u\n", s.null_node_hit);
2621 seq_printf(seq, "skipped node resize = %u\n\n", s.resize_node_skipped);
Robert Olsson19baf832005-06-21 12:43:18 -07002622}
Stephen Hemminger66a2f7f2008-01-12 21:23:17 -08002623#endif /* CONFIG_IP_FIB_TRIE_STATS */
2624
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002625static void fib_table_print(struct seq_file *seq, struct fib_table *tb)
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002626{
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002627 if (tb->tb_id == RT_TABLE_LOCAL)
2628 seq_puts(seq, "Local:\n");
2629 else if (tb->tb_id == RT_TABLE_MAIN)
2630 seq_puts(seq, "Main:\n");
2631 else
2632 seq_printf(seq, "Id %d:\n", tb->tb_id);
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002633}
Robert Olsson19baf832005-06-21 12:43:18 -07002634
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002635
Robert Olsson19baf832005-06-21 12:43:18 -07002636static int fib_triestat_seq_show(struct seq_file *seq, void *v)
2637{
Yu Zhe2e47eec2022-04-28 19:14:04 -07002638 struct net *net = seq->private;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002639 unsigned int h;
Eric W. Biederman877a9bf2007-12-07 00:47:47 -08002640
Stephen Hemmingerd717a9a2008-01-14 23:11:54 -08002641 seq_printf(seq,
Stephen Hemmingera07f5f52008-01-22 21:53:36 -08002642 "Basic info: size of leaf:"
Alexey Dobriyan5b5e0922017-02-27 14:30:02 -08002643 " %zd bytes, size of tnode: %zd bytes.\n",
Alexander Duyck41b489f2015-03-04 15:02:33 -08002644 LEAF_SIZE, TNODE_SIZE(0));
Olof Johansson91b9a272005-08-09 20:24:39 -07002645
Qian Caifbe4e0c2020-03-25 18:01:00 -04002646 rcu_read_lock();
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002647 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2648 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002649 struct fib_table *tb;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002650
Sasha Levinb67bfe02013-02-27 17:06:00 -08002651 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002652 struct trie *t = (struct trie *) tb->tb_data;
2653 struct trie_stat stat;
2654
2655 if (!t)
2656 continue;
2657
2658 fib_table_print(seq, tb);
2659
2660 trie_collect_stats(t, &stat);
2661 trie_show_stats(seq, &stat);
2662#ifdef CONFIG_IP_FIB_TRIE_STATS
Alexander Duyck8274a972014-12-31 10:55:29 -08002663 trie_show_usage(seq, t->stats);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002664#endif
2665 }
Qian Caifbe4e0c2020-03-25 18:01:00 -04002666 cond_resched_rcu();
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002667 }
Qian Caifbe4e0c2020-03-25 18:01:00 -04002668 rcu_read_unlock();
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002669
Robert Olsson19baf832005-06-21 12:43:18 -07002670 return 0;
2671}
2672
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002673static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)
Robert Olsson19baf832005-06-21 12:43:18 -07002674{
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002675 struct fib_trie_iter *iter = seq->private;
2676 struct net *net = seq_file_net(seq);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002677 loff_t idx = 0;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002678 unsigned int h;
Robert Olsson19baf832005-06-21 12:43:18 -07002679
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002680 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
2681 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002682 struct fib_table *tb;
2683
Sasha Levinb67bfe02013-02-27 17:06:00 -08002684 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002685 struct key_vector *n;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002686
2687 for (n = fib_trie_get_first(iter,
2688 (struct trie *) tb->tb_data);
2689 n; n = fib_trie_get_next(iter))
2690 if (pos == idx++) {
2691 iter->tb = tb;
2692 return n;
2693 }
2694 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002695 }
Robert Olsson19baf832005-06-21 12:43:18 -07002696
Robert Olsson19baf832005-06-21 12:43:18 -07002697 return NULL;
2698}
2699
2700static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002701 __acquires(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002702{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002703 rcu_read_lock();
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002704 return fib_trie_get_idx(seq, *pos);
Robert Olsson19baf832005-06-21 12:43:18 -07002705}
2706
2707static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2708{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002709 struct fib_trie_iter *iter = seq->private;
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002710 struct net *net = seq_file_net(seq);
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002711 struct fib_table *tb = iter->tb;
2712 struct hlist_node *tb_node;
2713 unsigned int h;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002714 struct key_vector *n;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002715
Robert Olsson19baf832005-06-21 12:43:18 -07002716 ++*pos;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002717 /* next node in same table */
2718 n = fib_trie_get_next(iter);
2719 if (n)
2720 return n;
Olof Johansson91b9a272005-08-09 20:24:39 -07002721
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002722 /* walk rest of this hash chain */
2723 h = tb->tb_id & (FIB_TABLE_HASHSZ - 1);
Eric Dumazet0a5c0472011-03-31 01:51:35 -07002724 while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002725 tb = hlist_entry(tb_node, struct fib_table, tb_hlist);
2726 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2727 if (n)
2728 goto found;
2729 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002730
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002731 /* new hash chain */
2732 while (++h < FIB_TABLE_HASHSZ) {
2733 struct hlist_head *head = &net->ipv4.fib_table_hash[h];
Sasha Levinb67bfe02013-02-27 17:06:00 -08002734 hlist_for_each_entry_rcu(tb, head, tb_hlist) {
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002735 n = fib_trie_get_first(iter, (struct trie *) tb->tb_data);
2736 if (n)
2737 goto found;
2738 }
2739 }
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002740 return NULL;
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002741
2742found:
2743 iter->tb = tb;
2744 return n;
Robert Olsson19baf832005-06-21 12:43:18 -07002745}
2746
2747static void fib_trie_seq_stop(struct seq_file *seq, void *v)
Stephen Hemmingerc95aaf92008-01-12 21:25:02 -08002748 __releases(RCU)
Robert Olsson19baf832005-06-21 12:43:18 -07002749{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002750 rcu_read_unlock();
Robert Olsson19baf832005-06-21 12:43:18 -07002751}
2752
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002753static void seq_indent(struct seq_file *seq, int n)
2754{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002755 while (n-- > 0)
2756 seq_puts(seq, " ");
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002757}
Robert Olsson19baf832005-06-21 12:43:18 -07002758
Eric Dumazet28d36e32008-01-14 23:09:56 -08002759static inline const char *rtn_scope(char *buf, size_t len, enum rt_scope_t s)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002760{
Stephen Hemminger132adf52007-03-08 20:44:43 -08002761 switch (s) {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002762 case RT_SCOPE_UNIVERSE: return "universe";
2763 case RT_SCOPE_SITE: return "site";
2764 case RT_SCOPE_LINK: return "link";
2765 case RT_SCOPE_HOST: return "host";
2766 case RT_SCOPE_NOWHERE: return "nowhere";
2767 default:
Eric Dumazet28d36e32008-01-14 23:09:56 -08002768 snprintf(buf, len, "scope=%d", s);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002769 return buf;
2770 }
2771}
2772
Jan Engelhardt36cbd3d2009-08-05 10:42:58 -07002773static const char *const rtn_type_names[__RTN_MAX] = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002774 [RTN_UNSPEC] = "UNSPEC",
2775 [RTN_UNICAST] = "UNICAST",
2776 [RTN_LOCAL] = "LOCAL",
2777 [RTN_BROADCAST] = "BROADCAST",
2778 [RTN_ANYCAST] = "ANYCAST",
2779 [RTN_MULTICAST] = "MULTICAST",
2780 [RTN_BLACKHOLE] = "BLACKHOLE",
2781 [RTN_UNREACHABLE] = "UNREACHABLE",
2782 [RTN_PROHIBIT] = "PROHIBIT",
2783 [RTN_THROW] = "THROW",
2784 [RTN_NAT] = "NAT",
2785 [RTN_XRESOLVE] = "XRESOLVE",
2786};
2787
Eric Dumazeta034ee32010-09-09 23:32:28 +00002788static inline const char *rtn_type(char *buf, size_t len, unsigned int t)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002789{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002790 if (t < __RTN_MAX && rtn_type_names[t])
2791 return rtn_type_names[t];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002792 snprintf(buf, len, "type %u", t);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002793 return buf;
2794}
2795
2796/* Pretty print the trie */
Robert Olsson19baf832005-06-21 12:43:18 -07002797static int fib_trie_seq_show(struct seq_file *seq, void *v)
2798{
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002799 const struct fib_trie_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002800 struct key_vector *n = v;
Robert Olsson19baf832005-06-21 12:43:18 -07002801
Alexander Duyck88bae712015-03-06 09:54:52 -08002802 if (IS_TRIE(node_parent_rcu(n)))
Stephen Hemminger3d3b2d22008-03-23 22:43:56 -07002803 fib_table_print(seq, iter->tb);
Robert Olsson095b8502007-01-26 19:06:01 -08002804
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002805 if (IS_TNODE(n)) {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002806 __be32 prf = htonl(n->key);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002807
Alexander Duycke9b44012014-12-31 10:56:12 -08002808 seq_indent(seq, iter->depth-1);
2809 seq_printf(seq, " +-- %pI4/%zu %u %u %u\n",
2810 &prf, KEYLENGTH - n->pos - n->bits, n->bits,
Alexander Duyck6e22d172015-03-06 09:54:39 -08002811 tn_info(n)->full_children,
2812 tn_info(n)->empty_children);
Olof Johansson91b9a272005-08-09 20:24:39 -07002813 } else {
Alexander Duyckadaf9812014-12-31 10:55:47 -08002814 __be32 val = htonl(n->key);
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002815 struct fib_alias *fa;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002816
2817 seq_indent(seq, iter->depth);
Harvey Harrison673d57e2008-10-31 00:53:57 -07002818 seq_printf(seq, " |-- %pI4\n", &val);
Eric Dumazet28d36e32008-01-14 23:09:56 -08002819
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002820 hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) {
2821 char buf1[32], buf2[32];
Eric Dumazet28d36e32008-01-14 23:09:56 -08002822
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002823 seq_indent(seq, iter->depth + 1);
2824 seq_printf(seq, " /%zu %s %s",
2825 KEYLENGTH - fa->fa_slen,
2826 rtn_scope(buf1, sizeof(buf1),
2827 fa->fa_info->fib_scope),
2828 rtn_type(buf2, sizeof(buf2),
2829 fa->fa_type));
Guillaume Nault32ccf112022-02-04 14:58:19 +01002830 if (fa->fa_dscp)
2831 seq_printf(seq, " tos=%d",
2832 inet_dscp_to_dsfield(fa->fa_dscp));
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002833 seq_putc(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002834 }
Robert Olsson19baf832005-06-21 12:43:18 -07002835 }
2836
2837 return 0;
2838}
2839
Stephen Hemmingerf6908082007-03-12 14:34:29 -07002840static const struct seq_operations fib_trie_seq_ops = {
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002841 .start = fib_trie_seq_start,
2842 .next = fib_trie_seq_next,
2843 .stop = fib_trie_seq_stop,
2844 .show = fib_trie_seq_show,
Robert Olsson19baf832005-06-21 12:43:18 -07002845};
2846
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002847struct fib_route_iter {
2848 struct seq_net_private p;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002849 struct fib_table *main_tb;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002850 struct key_vector *tnode;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002851 loff_t pos;
2852 t_key key;
2853};
2854
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002855static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,
2856 loff_t pos)
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002857{
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002858 struct key_vector *l, **tp = &iter->tnode;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002859 t_key key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002860
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002861 /* use cached location of previously found key */
Alexander Duyck8be33e92015-03-04 14:59:19 -08002862 if (iter->pos > 0 && pos >= iter->pos) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08002863 key = iter->key;
2864 } else {
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002865 iter->pos = 1;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002866 key = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002867 }
2868
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002869 pos -= iter->pos;
2870
2871 while ((l = leaf_walk_rcu(tp, key)) && (pos-- > 0)) {
Alexander Duyck8be33e92015-03-04 14:59:19 -08002872 key = l->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002873 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002874 l = NULL;
2875
2876 /* handle unlikely case of a key wrap */
2877 if (!key)
2878 break;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002879 }
2880
2881 if (l)
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002882 iter->key = l->key; /* remember it */
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002883 else
2884 iter->pos = 0; /* forget it */
2885
2886 return l;
2887}
2888
2889static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos)
2890 __acquires(RCU)
2891{
2892 struct fib_route_iter *iter = seq->private;
2893 struct fib_table *tb;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002894 struct trie *t;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002895
2896 rcu_read_lock();
Alexander Duyck8be33e92015-03-04 14:59:19 -08002897
YOSHIFUJI Hideaki12188542008-03-26 02:36:06 +09002898 tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN);
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002899 if (!tb)
2900 return NULL;
2901
Alexander Duyck8be33e92015-03-04 14:59:19 -08002902 iter->main_tb = tb;
David Forster94d9f1c2016-08-03 15:13:01 +01002903 t = (struct trie *)tb->tb_data;
2904 iter->tnode = t->kv;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002905
2906 if (*pos != 0)
2907 return fib_route_get_idx(iter, *pos);
2908
Alexander Duyck8be33e92015-03-04 14:59:19 -08002909 iter->pos = 0;
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002910 iter->key = KEY_MAX;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002911
2912 return SEQ_START_TOKEN;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002913}
2914
2915static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2916{
2917 struct fib_route_iter *iter = seq->private;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002918 struct key_vector *l = NULL;
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002919 t_key key = iter->key + 1;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002920
2921 ++*pos;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002922
2923 /* only allow key of 0 for start of sequence */
2924 if ((v == SEQ_START_TOKEN) || key)
2925 l = leaf_walk_rcu(&iter->tnode, key);
2926
2927 if (l) {
Alexander Duyckfd0285a2016-11-04 15:11:57 -04002928 iter->key = l->key;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002929 iter->pos++;
Alexander Duyck8be33e92015-03-04 14:59:19 -08002930 } else {
2931 iter->pos = 0;
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002932 }
2933
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08002934 return l;
2935}
2936
2937static void fib_route_seq_stop(struct seq_file *seq, void *v)
2938 __releases(RCU)
2939{
2940 rcu_read_unlock();
2941}
2942
David Ahern5481d732019-06-03 20:19:49 -07002943static unsigned int fib_flag_trans(int type, __be32 mask, struct fib_info *fi)
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002944{
Eric Dumazeta034ee32010-09-09 23:32:28 +00002945 unsigned int flags = 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002946
Eric Dumazeta034ee32010-09-09 23:32:28 +00002947 if (type == RTN_UNREACHABLE || type == RTN_PROHIBIT)
2948 flags = RTF_REJECT;
David Ahern5481d732019-06-03 20:19:49 -07002949 if (fi) {
David Aherndcb1ecb2019-06-03 20:19:50 -07002950 const struct fib_nh_common *nhc = fib_info_nhc(fi, 0);
David Ahern5481d732019-06-03 20:19:49 -07002951
David Aherndcb1ecb2019-06-03 20:19:50 -07002952 if (nhc->nhc_gw.ipv4)
David Ahern5481d732019-06-03 20:19:49 -07002953 flags |= RTF_GATEWAY;
2954 }
Al Viro32ab5f82006-09-26 22:21:45 -07002955 if (mask == htonl(0xFFFFFFFF))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002956 flags |= RTF_HOST;
2957 flags |= RTF_UP;
2958 return flags;
2959}
2960
2961/*
2962 * This outputs /proc/net/route.
2963 * The format of the file is not supposed to be changed
Eric Dumazeta034ee32010-09-09 23:32:28 +00002964 * and needs to be same as fib_hash output to avoid breaking
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002965 * legacy utilities
2966 */
2967static int fib_route_seq_show(struct seq_file *seq, void *v)
2968{
Alexander Duyck654eff42015-03-11 16:36:08 -07002969 struct fib_route_iter *iter = seq->private;
2970 struct fib_table *tb = iter->main_tb;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002971 struct fib_alias *fa;
Alexander Duyck35c6eda2015-03-06 09:54:08 -08002972 struct key_vector *l = v;
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002973 __be32 prefix;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002974
2975 if (v == SEQ_START_TOKEN) {
2976 seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway "
2977 "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU"
2978 "\tWindow\tIRTT");
2979 return 0;
2980 }
2981
Alexander Duyck9b6ebad2015-02-25 15:31:44 -08002982 prefix = htonl(l->key);
2983
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002984 hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) {
David Ahern5481d732019-06-03 20:19:49 -07002985 struct fib_info *fi = fa->fa_info;
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002986 __be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen);
2987 unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002988
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002989 if ((fa->fa_type == RTN_BROADCAST) ||
2990 (fa->fa_type == RTN_MULTICAST))
2991 continue;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002992
Alexander Duyck654eff42015-03-11 16:36:08 -07002993 if (fa->tb_id != tb->tb_id)
2994 continue;
2995
Alexander Duyck79e5ad22015-02-25 15:31:51 -08002996 seq_setwidth(seq, 127);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07002997
David Ahern5481d732019-06-03 20:19:49 -07002998 if (fi) {
David Aherndcb1ecb2019-06-03 20:19:50 -07002999 struct fib_nh_common *nhc = fib_info_nhc(fi, 0);
3000 __be32 gw = 0;
3001
3002 if (nhc->nhc_gw_family == AF_INET)
3003 gw = nhc->nhc_gw.ipv4;
David Ahern5481d732019-06-03 20:19:49 -07003004
Alexander Duyck79e5ad22015-02-25 15:31:51 -08003005 seq_printf(seq,
3006 "%s\t%08X\t%08X\t%04X\t%d\t%u\t"
3007 "%d\t%08X\t%d\t%u\t%u",
David Aherndcb1ecb2019-06-03 20:19:50 -07003008 nhc->nhc_dev ? nhc->nhc_dev->name : "*",
3009 prefix, gw, flags, 0, 0,
Alexander Duyck79e5ad22015-02-25 15:31:51 -08003010 fi->fib_priority,
3011 mask,
3012 (fi->fib_advmss ?
3013 fi->fib_advmss + 40 : 0),
3014 fi->fib_window,
3015 fi->fib_rtt >> 3);
David Ahern5481d732019-06-03 20:19:49 -07003016 } else {
Alexander Duyck79e5ad22015-02-25 15:31:51 -08003017 seq_printf(seq,
3018 "*\t%08X\t%08X\t%04X\t%d\t%u\t"
3019 "%d\t%08X\t%d\t%u\t%u",
3020 prefix, 0, flags, 0, 0, 0,
3021 mask, 0, 0, 0);
David Ahern5481d732019-06-03 20:19:49 -07003022 }
Alexander Duyck79e5ad22015-02-25 15:31:51 -08003023 seq_pad(seq, '\n');
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07003024 }
3025
3026 return 0;
3027}
3028
Stephen Hemmingerf6908082007-03-12 14:34:29 -07003029static const struct seq_operations fib_route_seq_ops = {
Stephen Hemminger8315f5d2008-02-11 21:14:39 -08003030 .start = fib_route_seq_start,
3031 .next = fib_route_seq_next,
3032 .stop = fib_route_seq_stop,
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07003033 .show = fib_route_seq_show,
3034};
3035
Denis V. Lunev61a02652008-01-10 03:21:09 -08003036int __net_init fib_proc_init(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07003037{
Christoph Hellwigc3506372018-04-10 19:42:55 +02003038 if (!proc_create_net("fib_trie", 0444, net->proc_net, &fib_trie_seq_ops,
3039 sizeof(struct fib_trie_iter)))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07003040 goto out1;
3041
Christoph Hellwig3617d942018-04-13 20:38:35 +02003042 if (!proc_create_net_single("fib_triestat", 0444, net->proc_net,
3043 fib_triestat_seq_show, NULL))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07003044 goto out2;
3045
Christoph Hellwigc3506372018-04-10 19:42:55 +02003046 if (!proc_create_net("route", 0444, net->proc_net, &fib_route_seq_ops,
3047 sizeof(struct fib_route_iter)))
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07003048 goto out3;
3049
Robert Olsson19baf832005-06-21 12:43:18 -07003050 return 0;
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07003051
3052out3:
Gao fengece31ff2013-02-18 01:34:56 +00003053 remove_proc_entry("fib_triestat", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07003054out2:
Gao fengece31ff2013-02-18 01:34:56 +00003055 remove_proc_entry("fib_trie", net->proc_net);
Stephen Hemmingercb7b5932005-09-09 13:35:42 -07003056out1:
3057 return -ENOMEM;
Robert Olsson19baf832005-06-21 12:43:18 -07003058}
3059
Denis V. Lunev61a02652008-01-10 03:21:09 -08003060void __net_exit fib_proc_exit(struct net *net)
Robert Olsson19baf832005-06-21 12:43:18 -07003061{
Gao fengece31ff2013-02-18 01:34:56 +00003062 remove_proc_entry("fib_trie", net->proc_net);
3063 remove_proc_entry("fib_triestat", net->proc_net);
3064 remove_proc_entry("route", net->proc_net);
Robert Olsson19baf832005-06-21 12:43:18 -07003065}
3066
3067#endif /* CONFIG_PROC_FS */