Thomas Gleixner | 2874c5f | 2019-05-27 08:55:01 +0200 | [diff] [blame] | 1 | // SPDX-License-Identifier: GPL-2.0-or-later |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2 | /* |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 3 | * |
| 4 | * Robert Olsson <robert.olsson@its.uu.se> Uppsala Universitet |
| 5 | * & Swedish University of Agricultural Sciences. |
| 6 | * |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 7 | * Jens Laas <jens.laas@data.slu.se> Swedish University of |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 8 | * Agricultural Sciences. |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 9 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 10 | * Hans Liss <hans.liss@its.uu.se> Uppsala Universitet |
| 11 | * |
Lucas De Marchi | 25985ed | 2011-03-30 22:57:33 -0300 | [diff] [blame] | 12 | * This work is based on the LPC-trie which is originally described in: |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 13 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 14 | * An experimental study of compression methods for dynamic tries |
| 15 | * Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002. |
Alexander A. Klimov | 7a6498e | 2020-07-06 19:38:50 +0200 | [diff] [blame] | 16 | * https://www.csc.kth.se/~snilsson/software/dyntrie2/ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 17 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 18 | * 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 Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 21 | * Code from fib_hash has been reused which includes the following header: |
| 22 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 23 | * 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 Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 29 | * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru> |
| 30 | * |
Robert Olsson | fd96625 | 2005-12-22 11:25:10 -0800 | [diff] [blame] | 31 | * 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 Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 37 | */ |
Alexey Dobriyan | 08009a7 | 2018-02-24 21:20:33 +0300 | [diff] [blame] | 38 | #include <linux/cache.h> |
Linus Torvalds | 7c0f6ba | 2016-12-24 11:46:01 -0800 | [diff] [blame] | 39 | #include <linux/uaccess.h> |
Jiri Slaby | 1977f03 | 2007-10-18 23:40:25 -0700 | [diff] [blame] | 40 | #include <linux/bitops.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 41 | #include <linux/types.h> |
| 42 | #include <linux/kernel.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 43 | #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 Hemminger | cd8787a | 2006-01-03 14:38:34 -0800 | [diff] [blame] | 50 | #include <linux/inetdevice.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 51 | #include <linux/netdevice.h> |
| 52 | #include <linux/if_arp.h> |
| 53 | #include <linux/proc_fs.h> |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 54 | #include <linux/rcupdate.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 55 | #include <linux/skbuff.h> |
| 56 | #include <linux/netlink.h> |
| 57 | #include <linux/init.h> |
| 58 | #include <linux/list.h> |
Tejun Heo | 5a0e3ad | 2010-03-24 17:04:11 +0900 | [diff] [blame] | 59 | #include <linux/slab.h> |
Paul Gortmaker | bc3b2d7 | 2011-07-15 11:47:34 -0400 | [diff] [blame] | 60 | #include <linux/export.h> |
David S. Miller | ffa915d | 2015-05-27 00:19:03 -0400 | [diff] [blame] | 61 | #include <linux/vmalloc.h> |
Jiri Pirko | b90eb75 | 2016-09-26 12:52:29 +0200 | [diff] [blame] | 62 | #include <linux/notifier.h> |
Eric W. Biederman | 457c4cb | 2007-09-12 12:01:34 +0200 | [diff] [blame] | 63 | #include <net/net_namespace.h> |
Guillaume Nault | f55fbb6 | 2022-02-04 14:58:16 +0100 | [diff] [blame] | 64 | #include <net/inet_dscp.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 65 | #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 Schimmel | 04b1d4e | 2017-08-03 13:28:11 +0200 | [diff] [blame] | 71 | #include <net/fib_notifier.h> |
David Ahern | f6d3c19 | 2015-08-28 08:42:09 -0700 | [diff] [blame] | 72 | #include <trace/events/fib.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 73 | #include "fib_lookup.h" |
| 74 | |
Jiri Pirko | 7c550da | 2019-10-03 11:49:27 +0200 | [diff] [blame] | 75 | static int call_fib_entry_notifier(struct notifier_block *nb, |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 76 | enum fib_event_type event_type, u32 dst, |
Jiri Pirko | b7a5955 | 2019-10-03 11:49:30 +0200 | [diff] [blame] | 77 | int dst_len, struct fib_alias *fa, |
| 78 | struct netlink_ext_ack *extack) |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 79 | { |
| 80 | struct fib_entry_notifier_info info = { |
Jiri Pirko | b7a5955 | 2019-10-03 11:49:30 +0200 | [diff] [blame] | 81 | .info.extack = extack, |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 82 | .dst = dst, |
| 83 | .dst_len = dst_len, |
David Ahern | 6eba87c | 2017-10-18 11:39:13 -0700 | [diff] [blame] | 84 | .fi = fa->fa_info, |
Guillaume Nault | 568a3f3 | 2022-04-08 22:08:40 +0200 | [diff] [blame] | 85 | .dscp = fa->fa_dscp, |
David Ahern | 6eba87c | 2017-10-18 11:39:13 -0700 | [diff] [blame] | 86 | .type = fa->fa_type, |
| 87 | .tb_id = fa->tb_id, |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 88 | }; |
Jiri Pirko | 7c550da | 2019-10-03 11:49:27 +0200 | [diff] [blame] | 89 | return call_fib4_notifier(nb, event_type, &info.info); |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 90 | } |
| 91 | |
Jiri Pirko | b90eb75 | 2016-09-26 12:52:29 +0200 | [diff] [blame] | 92 | static int call_fib_entry_notifiers(struct net *net, |
| 93 | enum fib_event_type event_type, u32 dst, |
David Ahern | 6c31e5a | 2017-10-27 17:37:13 -0700 | [diff] [blame] | 94 | int dst_len, struct fib_alias *fa, |
| 95 | struct netlink_ext_ack *extack) |
Jiri Pirko | b90eb75 | 2016-09-26 12:52:29 +0200 | [diff] [blame] | 96 | { |
| 97 | struct fib_entry_notifier_info info = { |
David Ahern | 6c31e5a | 2017-10-27 17:37:13 -0700 | [diff] [blame] | 98 | .info.extack = extack, |
Jiri Pirko | b90eb75 | 2016-09-26 12:52:29 +0200 | [diff] [blame] | 99 | .dst = dst, |
| 100 | .dst_len = dst_len, |
David Ahern | 6eba87c | 2017-10-18 11:39:13 -0700 | [diff] [blame] | 101 | .fi = fa->fa_info, |
Guillaume Nault | 568a3f3 | 2022-04-08 22:08:40 +0200 | [diff] [blame] | 102 | .dscp = fa->fa_dscp, |
David Ahern | 6eba87c | 2017-10-18 11:39:13 -0700 | [diff] [blame] | 103 | .type = fa->fa_type, |
| 104 | .tb_id = fa->tb_id, |
Jiri Pirko | b90eb75 | 2016-09-26 12:52:29 +0200 | [diff] [blame] | 105 | }; |
Ido Schimmel | 04b1d4e | 2017-08-03 13:28:11 +0200 | [diff] [blame] | 106 | return call_fib4_notifiers(net, event_type, &info.info); |
Jiri Pirko | b90eb75 | 2016-09-26 12:52:29 +0200 | [diff] [blame] | 107 | } |
| 108 | |
Robert Olsson | 06ef921 | 2006-03-20 21:35:01 -0800 | [diff] [blame] | 109 | #define MAX_STAT_DEPTH 32 |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 110 | |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 111 | #define KEYLENGTH (8*sizeof(t_key)) |
| 112 | #define KEY_MAX ((t_key)~0) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 113 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 114 | typedef unsigned int t_key; |
| 115 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 116 | #define IS_TRIE(n) ((n)->pos >= KEYLENGTH) |
| 117 | #define IS_TNODE(n) ((n)->bits) |
| 118 | #define IS_LEAF(n) (!(n)->bits) |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 119 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 120 | struct key_vector { |
Alexander Duyck | 41b489f | 2015-03-04 15:02:33 -0800 | [diff] [blame] | 121 | t_key key; |
| 122 | unsigned char pos; /* 2log(KEYLENGTH) bits needed */ |
| 123 | unsigned char bits; /* 2log(KEYLENGTH) bits needed */ |
| 124 | unsigned char slen; |
Alexander Duyck | adaf981 | 2014-12-31 10:55:47 -0800 | [diff] [blame] | 125 | union { |
Alexander Duyck | 41b489f | 2015-03-04 15:02:33 -0800 | [diff] [blame] | 126 | /* This list pointer if valid if (pos | bits) == 0 (LEAF) */ |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 127 | struct hlist_head leaf; |
Alexander Duyck | 41b489f | 2015-03-04 15:02:33 -0800 | [diff] [blame] | 128 | /* This array is valid if (pos | bits) > 0 (TNODE) */ |
Kees Cook | 764f848 | 2022-11-17 20:21:52 -0800 | [diff] [blame] | 129 | DECLARE_FLEX_ARRAY(struct key_vector __rcu *, tnode); |
Alexander Duyck | adaf981 | 2014-12-31 10:55:47 -0800 | [diff] [blame] | 130 | }; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 131 | }; |
| 132 | |
Alexander Duyck | dc35dbe | 2015-03-06 09:54:27 -0800 | [diff] [blame] | 133 | struct tnode { |
Alexander Duyck | 56ca2ad | 2015-03-06 09:54:33 -0800 | [diff] [blame] | 134 | struct rcu_head rcu; |
Alexander Duyck | 6e22d17 | 2015-03-06 09:54:39 -0800 | [diff] [blame] | 135 | t_key empty_children; /* KEYLENGTH bits needed */ |
| 136 | t_key full_children; /* KEYLENGTH bits needed */ |
Alexander Duyck | f23e59f | 2015-03-06 09:54:46 -0800 | [diff] [blame] | 137 | struct key_vector __rcu *parent; |
Alexander Duyck | dc35dbe | 2015-03-06 09:54:27 -0800 | [diff] [blame] | 138 | struct key_vector kv[1]; |
Alexander Duyck | 56ca2ad | 2015-03-06 09:54:33 -0800 | [diff] [blame] | 139 | #define tn_bits kv[0].bits |
Alexander Duyck | dc35dbe | 2015-03-06 09:54:27 -0800 | [diff] [blame] | 140 | }; |
| 141 | |
| 142 | #define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n]) |
Alexander Duyck | 41b489f | 2015-03-04 15:02:33 -0800 | [diff] [blame] | 143 | #define LEAF_SIZE TNODE_SIZE(1) |
| 144 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 145 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 146 | struct 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 Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 152 | unsigned int resize_node_skipped; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 153 | }; |
| 154 | #endif |
| 155 | |
| 156 | struct trie_stat { |
| 157 | unsigned int totdepth; |
| 158 | unsigned int maxdepth; |
| 159 | unsigned int tnodes; |
| 160 | unsigned int leaves; |
| 161 | unsigned int nullpointers; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 162 | unsigned int prefixes; |
Robert Olsson | 06ef921 | 2006-03-20 21:35:01 -0800 | [diff] [blame] | 163 | unsigned int nodesizes[MAX_STAT_DEPTH]; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 164 | }; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 165 | |
| 166 | struct trie { |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 167 | struct key_vector kv[1]; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 168 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 169 | struct trie_use_stats __percpu *stats; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 170 | #endif |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 171 | }; |
| 172 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 173 | static struct key_vector *resize(struct trie *t, struct key_vector *tn); |
David Ahern | 9ab948a | 2019-03-20 09:18:59 -0700 | [diff] [blame] | 174 | static unsigned int tnode_free_size; |
Jarek Poplawski | c305947 | 2009-07-14 08:33:08 +0000 | [diff] [blame] | 175 | |
| 176 | /* |
David Ahern | 9ab948a | 2019-03-20 09:18:59 -0700 | [diff] [blame] | 177 | * 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 Poplawski | c305947 | 2009-07-14 08:33:08 +0000 | [diff] [blame] | 180 | */ |
David Ahern | 9ab948a | 2019-03-20 09:18:59 -0700 | [diff] [blame] | 181 | unsigned int sysctl_fib_sync_mem = 512 * 1024; |
| 182 | unsigned int sysctl_fib_sync_mem_min = 64 * 1024; |
| 183 | unsigned int sysctl_fib_sync_mem_max = 64 * 1024 * 1024; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 184 | |
Alexey Dobriyan | 08009a7 | 2018-02-24 21:20:33 +0300 | [diff] [blame] | 185 | static struct kmem_cache *fn_alias_kmem __ro_after_init; |
| 186 | static struct kmem_cache *trie_leaf_kmem __ro_after_init; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 187 | |
Alexander Duyck | 56ca2ad | 2015-03-06 09:54:33 -0800 | [diff] [blame] | 188 | static inline struct tnode *tn_info(struct key_vector *kv) |
| 189 | { |
| 190 | return container_of(kv, struct tnode, kv[0]); |
| 191 | } |
| 192 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame] | 193 | /* caller must hold RTNL */ |
Alexander Duyck | f23e59f | 2015-03-06 09:54:46 -0800 | [diff] [blame] | 194 | #define node_parent(tn) rtnl_dereference(tn_info(tn)->parent) |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 195 | #define get_child(tn, i) rtnl_dereference((tn)->tnode[i]) |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 196 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame] | 197 | /* caller must hold RCU read lock or RTNL */ |
Alexander Duyck | f23e59f | 2015-03-06 09:54:46 -0800 | [diff] [blame] | 198 | #define node_parent_rcu(tn) rcu_dereference_rtnl(tn_info(tn)->parent) |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 199 | #define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i]) |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 200 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame] | 201 | /* wrapper for rcu_assign_pointer */ |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 202 | static inline void node_set_parent(struct key_vector *n, struct key_vector *tp) |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 203 | { |
Alexander Duyck | adaf981 | 2014-12-31 10:55:47 -0800 | [diff] [blame] | 204 | if (n) |
Alexander Duyck | f23e59f | 2015-03-06 09:54:46 -0800 | [diff] [blame] | 205 | rcu_assign_pointer(tn_info(n)->parent, tp); |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame] | 206 | } |
| 207 | |
Alexander Duyck | f23e59f | 2015-03-06 09:54:46 -0800 | [diff] [blame] | 208 | #define NODE_INIT_PARENT(n, p) RCU_INIT_POINTER(tn_info(n)->parent, p) |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame] | 209 | |
| 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 Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 213 | static inline unsigned long child_length(const struct key_vector *tn) |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame] | 214 | { |
| 215 | return (1ul << tn->bits) & ~(1ul); |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 216 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 217 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 218 | #define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos) |
| 219 | |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 220 | static inline unsigned long get_index(t_key key, struct key_vector *kv) |
| 221 | { |
| 222 | unsigned long index = key ^ kv->key; |
| 223 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 224 | if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos)) |
| 225 | return 0; |
| 226 | |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 227 | return index >> kv->pos; |
| 228 | } |
| 229 | |
Alexander Duyck | e9b4401 | 2014-12-31 10:56:12 -0800 | [diff] [blame] | 230 | /* 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 Pang | 98a384e | 2016-08-18 12:33:28 +0800 | [diff] [blame] | 276 | * The bits from (n->pos + n->bits) to (tp->pos - 1) - "S" - are skipped bits |
Alexander Duyck | e9b4401 | 2014-12-31 10:56:12 -0800 | [diff] [blame] | 277 | * 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 Pang | 98a384e | 2016-08-18 12:33:28 +0800 | [diff] [blame] | 285 | * The rest of the bits, from 0 to (n->pos -1) - "u" - are completely unknown |
Alexander Duyck | e9b4401 | 2014-12-31 10:56:12 -0800 | [diff] [blame] | 286 | * at this point. |
| 287 | */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 288 | |
Denis V. Lunev | f5026fa | 2007-12-13 09:47:57 -0800 | [diff] [blame] | 289 | static const int halve_threshold = 25; |
| 290 | static const int inflate_threshold = 50; |
Jarek Poplawski | 345aa03 | 2009-07-07 19:39:16 -0700 | [diff] [blame] | 291 | static const int halve_threshold_root = 15; |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 292 | static const int inflate_threshold_root = 30; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 293 | |
| 294 | static 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 | |
| 300 | static inline void alias_free_mem_rcu(struct fib_alias *fa) |
| 301 | { |
| 302 | call_rcu(&fa->rcu, __alias_free_mem); |
| 303 | } |
| 304 | |
Alexander Duyck | 1de3d87 | 2015-03-04 15:04:46 -0800 | [diff] [blame] | 305 | #define TNODE_VMALLOC_MAX \ |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 306 | ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *)) |
Alexander Duyck | 37fd30f | 2014-12-31 10:55:41 -0800 | [diff] [blame] | 307 | |
| 308 | static void __node_free_rcu(struct rcu_head *head) |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 309 | { |
Alexander Duyck | 56ca2ad | 2015-03-06 09:54:33 -0800 | [diff] [blame] | 310 | struct tnode *n = container_of(head, struct tnode, rcu); |
Alexander Duyck | 37fd30f | 2014-12-31 10:55:41 -0800 | [diff] [blame] | 311 | |
Alexander Duyck | 56ca2ad | 2015-03-06 09:54:33 -0800 | [diff] [blame] | 312 | if (!n->tn_bits) |
Alexander Duyck | 37fd30f | 2014-12-31 10:55:41 -0800 | [diff] [blame] | 313 | kmem_cache_free(trie_leaf_kmem, n); |
Alexander Duyck | 37fd30f | 2014-12-31 10:55:41 -0800 | [diff] [blame] | 314 | else |
Tetsuo Handa | 1d5cfdb | 2016-01-22 15:11:02 -0800 | [diff] [blame] | 315 | kvfree(n); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 316 | } |
| 317 | |
Alexander Duyck | 56ca2ad | 2015-03-06 09:54:33 -0800 | [diff] [blame] | 318 | #define node_free(n) call_rcu(&tn_info(n)->rcu, __node_free_rcu) |
Stephen Hemminger | 387a548 | 2008-04-10 03:47:34 -0700 | [diff] [blame] | 319 | |
Alexander Duyck | dc35dbe | 2015-03-06 09:54:27 -0800 | [diff] [blame] | 320 | static struct tnode *tnode_alloc(int bits) |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 321 | { |
Alexander Duyck | 1de3d87 | 2015-03-04 15:04:46 -0800 | [diff] [blame] | 322 | 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 Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 331 | if (size <= PAGE_SIZE) |
Eric Dumazet | 8d965444 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 332 | return kzalloc(size, GFP_KERNEL); |
Stephen Hemminger | 15be75c | 2008-04-10 02:56:38 -0700 | [diff] [blame] | 333 | else |
Eric Dumazet | 7a1c8e5 | 2010-11-20 07:46:35 +0000 | [diff] [blame] | 334 | return vzalloc(size); |
Stephen Hemminger | 15be75c | 2008-04-10 02:56:38 -0700 | [diff] [blame] | 335 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 336 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 337 | static inline void empty_child_inc(struct key_vector *n) |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 338 | { |
Matthias Kaehlcke | 25cec75 | 2019-06-18 14:14:40 -0700 | [diff] [blame] | 339 | tn_info(n)->empty_children++; |
| 340 | |
| 341 | if (!tn_info(n)->empty_children) |
| 342 | tn_info(n)->full_children++; |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 343 | } |
| 344 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 345 | static inline void empty_child_dec(struct key_vector *n) |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 346 | { |
Matthias Kaehlcke | 25cec75 | 2019-06-18 14:14:40 -0700 | [diff] [blame] | 347 | if (!tn_info(n)->empty_children) |
| 348 | tn_info(n)->full_children--; |
| 349 | |
| 350 | tn_info(n)->empty_children--; |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 351 | } |
| 352 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 353 | static struct key_vector *leaf_new(t_key key, struct fib_alias *fa) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 354 | { |
Firo Yang | f38b24c | 2015-06-08 11:54:51 +0800 | [diff] [blame] | 355 | struct key_vector *l; |
| 356 | struct tnode *kv; |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame] | 357 | |
Firo Yang | f38b24c | 2015-06-08 11:54:51 +0800 | [diff] [blame] | 358 | kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL); |
Alexander Duyck | dc35dbe | 2015-03-06 09:54:27 -0800 | [diff] [blame] | 359 | if (!kv) |
| 360 | return NULL; |
| 361 | |
| 362 | /* initialize key vector */ |
Firo Yang | f38b24c | 2015-06-08 11:54:51 +0800 | [diff] [blame] | 363 | l = kv->kv; |
Alexander Duyck | dc35dbe | 2015-03-06 09:54:27 -0800 | [diff] [blame] | 364 | 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 Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 373 | return l; |
| 374 | } |
| 375 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 376 | static struct key_vector *tnode_new(t_key key, int pos, int bits) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 377 | { |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame] | 378 | unsigned int shift = pos + bits; |
Firo Yang | f38b24c | 2015-06-08 11:54:51 +0800 | [diff] [blame] | 379 | struct key_vector *tn; |
| 380 | struct tnode *tnode; |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame] | 381 | |
| 382 | /* verify bits and pos their msb bits clear and values are valid */ |
| 383 | BUG_ON(!bits || (shift > KEYLENGTH)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 384 | |
Firo Yang | f38b24c | 2015-06-08 11:54:51 +0800 | [diff] [blame] | 385 | tnode = tnode_alloc(bits); |
Alexander Duyck | dc35dbe | 2015-03-06 09:54:27 -0800 | [diff] [blame] | 386 | if (!tnode) |
| 387 | return NULL; |
| 388 | |
Firo Yang | f38b24c | 2015-06-08 11:54:51 +0800 | [diff] [blame] | 389 | pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0), |
| 390 | sizeof(struct key_vector *) << bits); |
| 391 | |
Alexander Duyck | dc35dbe | 2015-03-06 09:54:27 -0800 | [diff] [blame] | 392 | if (bits == KEYLENGTH) |
Alexander Duyck | 6e22d17 | 2015-03-06 09:54:39 -0800 | [diff] [blame] | 393 | tnode->full_children = 1; |
Alexander Duyck | dc35dbe | 2015-03-06 09:54:27 -0800 | [diff] [blame] | 394 | else |
Alexander Duyck | 6e22d17 | 2015-03-06 09:54:39 -0800 | [diff] [blame] | 395 | tnode->empty_children = 1ul << bits; |
Alexander Duyck | dc35dbe | 2015-03-06 09:54:27 -0800 | [diff] [blame] | 396 | |
Firo Yang | f38b24c | 2015-06-08 11:54:51 +0800 | [diff] [blame] | 397 | tn = tnode->kv; |
Alexander Duyck | dc35dbe | 2015-03-06 09:54:27 -0800 | [diff] [blame] | 398 | tn->key = (shift < KEYLENGTH) ? (key >> shift) << shift : 0; |
| 399 | tn->pos = pos; |
| 400 | tn->bits = bits; |
| 401 | tn->slen = pos; |
| 402 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 403 | return tn; |
| 404 | } |
| 405 | |
Alexander Duyck | e9b4401 | 2014-12-31 10:56:12 -0800 | [diff] [blame] | 406 | /* Check whether a tnode 'n' is "full", i.e. it is an internal node |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 407 | * and no bits are skipped. See discussion in dyntree paper p. 6 |
| 408 | */ |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 409 | static inline int tnode_full(struct key_vector *tn, struct key_vector *n) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 410 | { |
Alexander Duyck | e9b4401 | 2014-12-31 10:56:12 -0800 | [diff] [blame] | 411 | return n && ((n->pos + n->bits) == tn->pos) && IS_TNODE(n); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 412 | } |
| 413 | |
Alexander Duyck | ff181ed | 2014-12-31 10:56:43 -0800 | [diff] [blame] | 414 | /* Add a child at position i overwriting the old value. |
| 415 | * Update the value of full_children and empty_children. |
| 416 | */ |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 417 | static void put_child(struct key_vector *tn, unsigned long i, |
| 418 | struct key_vector *n) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 419 | { |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 420 | struct key_vector *chi = get_child(tn, i); |
Alexander Duyck | ff181ed | 2014-12-31 10:56:43 -0800 | [diff] [blame] | 421 | int isfull, wasfull; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 422 | |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 423 | BUG_ON(i >= child_length(tn)); |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 424 | |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 425 | /* update emptyChildren, overflow into fullChildren */ |
Ian Morris | 00db412 | 2015-04-03 09:17:27 +0100 | [diff] [blame] | 426 | if (!n && chi) |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 427 | empty_child_inc(tn); |
Ian Morris | 00db412 | 2015-04-03 09:17:27 +0100 | [diff] [blame] | 428 | if (n && !chi) |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 429 | empty_child_dec(tn); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 430 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 431 | /* update fullChildren */ |
Alexander Duyck | ff181ed | 2014-12-31 10:56:43 -0800 | [diff] [blame] | 432 | wasfull = tnode_full(tn, chi); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 433 | isfull = tnode_full(tn, n); |
Alexander Duyck | ff181ed | 2014-12-31 10:56:43 -0800 | [diff] [blame] | 434 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 435 | if (wasfull && !isfull) |
Alexander Duyck | 6e22d17 | 2015-03-06 09:54:39 -0800 | [diff] [blame] | 436 | tn_info(tn)->full_children--; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 437 | else if (!wasfull && isfull) |
Alexander Duyck | 6e22d17 | 2015-03-06 09:54:39 -0800 | [diff] [blame] | 438 | tn_info(tn)->full_children++; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 439 | |
Alexander Duyck | 5405afd | 2014-12-31 10:57:08 -0800 | [diff] [blame] | 440 | if (n && (tn->slen < n->slen)) |
| 441 | tn->slen = n->slen; |
| 442 | |
Alexander Duyck | 41b489f | 2015-03-04 15:02:33 -0800 | [diff] [blame] | 443 | rcu_assign_pointer(tn->tnode[i], n); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 444 | } |
| 445 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 446 | static void update_children(struct key_vector *tn) |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 447 | { |
| 448 | unsigned long i; |
| 449 | |
| 450 | /* update all of the child parent pointers */ |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 451 | for (i = child_length(tn); i;) { |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 452 | struct key_vector *inode = get_child(tn, --i); |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 453 | |
| 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 Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 468 | static inline void put_child_root(struct key_vector *tp, t_key key, |
| 469 | struct key_vector *n) |
Alexander Duyck | 836a012 | 2014-12-31 10:56:06 -0800 | [diff] [blame] | 470 | { |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 471 | if (IS_TRIE(tp)) |
| 472 | rcu_assign_pointer(tp->tnode[0], n); |
Alexander Duyck | 836a012 | 2014-12-31 10:56:06 -0800 | [diff] [blame] | 473 | else |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 474 | put_child(tp, get_index(key, tp), n); |
Alexander Duyck | 836a012 | 2014-12-31 10:56:06 -0800 | [diff] [blame] | 475 | } |
| 476 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 477 | static inline void tnode_free_init(struct key_vector *tn) |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 478 | { |
Alexander Duyck | 56ca2ad | 2015-03-06 09:54:33 -0800 | [diff] [blame] | 479 | tn_info(tn)->rcu.next = NULL; |
Alexander Duyck | fc86a93 | 2014-12-31 10:56:49 -0800 | [diff] [blame] | 480 | } |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 481 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 482 | static inline void tnode_free_append(struct key_vector *tn, |
| 483 | struct key_vector *n) |
Alexander Duyck | fc86a93 | 2014-12-31 10:56:49 -0800 | [diff] [blame] | 484 | { |
Alexander Duyck | 56ca2ad | 2015-03-06 09:54:33 -0800 | [diff] [blame] | 485 | tn_info(n)->rcu.next = tn_info(tn)->rcu.next; |
| 486 | tn_info(tn)->rcu.next = &tn_info(n)->rcu; |
Alexander Duyck | fc86a93 | 2014-12-31 10:56:49 -0800 | [diff] [blame] | 487 | } |
| 488 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 489 | static void tnode_free(struct key_vector *tn) |
Alexander Duyck | fc86a93 | 2014-12-31 10:56:49 -0800 | [diff] [blame] | 490 | { |
Alexander Duyck | 56ca2ad | 2015-03-06 09:54:33 -0800 | [diff] [blame] | 491 | struct callback_head *head = &tn_info(tn)->rcu; |
Alexander Duyck | fc86a93 | 2014-12-31 10:56:49 -0800 | [diff] [blame] | 492 | |
| 493 | while (head) { |
| 494 | head = head->next; |
Alexander Duyck | 41b489f | 2015-03-04 15:02:33 -0800 | [diff] [blame] | 495 | tnode_free_size += TNODE_SIZE(1ul << tn->bits); |
Alexander Duyck | fc86a93 | 2014-12-31 10:56:49 -0800 | [diff] [blame] | 496 | node_free(tn); |
| 497 | |
Alexander Duyck | 56ca2ad | 2015-03-06 09:54:33 -0800 | [diff] [blame] | 498 | tn = container_of(head, struct tnode, rcu)->kv; |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 499 | } |
Alexander Duyck | fc86a93 | 2014-12-31 10:56:49 -0800 | [diff] [blame] | 500 | |
Kuniyuki Iwashima | 73318c4 | 2022-07-06 16:40:03 -0700 | [diff] [blame] | 501 | if (tnode_free_size >= READ_ONCE(sysctl_fib_sync_mem)) { |
Alexander Duyck | fc86a93 | 2014-12-31 10:56:49 -0800 | [diff] [blame] | 502 | tnode_free_size = 0; |
| 503 | synchronize_rcu(); |
| 504 | } |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 505 | } |
| 506 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 507 | static struct key_vector *replace(struct trie *t, |
| 508 | struct key_vector *oldtnode, |
| 509 | struct key_vector *tn) |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 510 | { |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 511 | struct key_vector *tp = node_parent(oldtnode); |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 512 | unsigned long i; |
| 513 | |
| 514 | /* setup the parent pointer out of and back into this node */ |
| 515 | NODE_INIT_PARENT(tn, tp); |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 516 | put_child_root(tp, tn->key, tn); |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 517 | |
| 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 Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 525 | for (i = child_length(tn); i;) { |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 526 | struct key_vector *inode = get_child(tn, --i); |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 527 | |
| 528 | /* resize child node */ |
| 529 | if (tnode_full(tn, inode)) |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 530 | tn = resize(t, inode); |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 531 | } |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 532 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 533 | return tp; |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 534 | } |
| 535 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 536 | static struct key_vector *inflate(struct trie *t, |
| 537 | struct key_vector *oldtnode) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 538 | { |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 539 | struct key_vector *tn; |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 540 | unsigned long i; |
Alexander Duyck | e9b4401 | 2014-12-31 10:56:12 -0800 | [diff] [blame] | 541 | t_key m; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 542 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 543 | pr_debug("In inflate\n"); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 544 | |
Alexander Duyck | e9b4401 | 2014-12-31 10:56:12 -0800 | [diff] [blame] | 545 | tn = tnode_new(oldtnode->key, oldtnode->pos - 1, oldtnode->bits + 1); |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 546 | if (!tn) |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 547 | goto notnode; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 548 | |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 549 | /* prepare oldtnode to be freed */ |
| 550 | tnode_free_init(oldtnode); |
| 551 | |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 552 | /* 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 Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 556 | */ |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 557 | for (i = child_length(oldtnode), m = 1u << tn->pos; i;) { |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 558 | struct key_vector *inode = get_child(oldtnode, --i); |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 559 | struct key_vector *node0, *node1; |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 560 | unsigned long j, k; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 561 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 562 | /* An empty child */ |
Ian Morris | 51456b2 | 2015-04-03 09:17:26 +0100 | [diff] [blame] | 563 | if (!inode) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 564 | continue; |
| 565 | |
| 566 | /* A leaf or an internal node with skipped bits */ |
Alexander Duyck | adaf981 | 2014-12-31 10:55:47 -0800 | [diff] [blame] | 567 | if (!tnode_full(oldtnode, inode)) { |
Alexander Duyck | e9b4401 | 2014-12-31 10:56:12 -0800 | [diff] [blame] | 568 | put_child(tn, get_index(inode->key, tn), inode); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 569 | continue; |
| 570 | } |
| 571 | |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 572 | /* drop the node in the old tnode free list */ |
| 573 | tnode_free_append(oldtnode, inode); |
| 574 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 575 | /* An internal node with two children */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 576 | if (inode->bits == 1) { |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 577 | put_child(tn, 2 * i + 1, get_child(inode, 1)); |
| 578 | put_child(tn, 2 * i, get_child(inode, 0)); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 579 | continue; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 580 | } |
| 581 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 582 | /* We will replace this node 'inode' with two new |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 583 | * ones, 'node0' and 'node1', each with half of the |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 584 | * 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 Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 589 | * node0's key and "1" in node1's key. Since we are |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 590 | * moving the key position by one step, the bit that |
| 591 | * we are moving away from - the bit at position |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 592 | * (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 Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 595 | */ |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 596 | node1 = tnode_new(inode->key | m, inode->pos, inode->bits - 1); |
| 597 | if (!node1) |
| 598 | goto nomem; |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 599 | node0 = tnode_new(inode->key, inode->pos, inode->bits - 1); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 600 | |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 601 | tnode_free_append(tn, node1); |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 602 | if (!node0) |
| 603 | goto nomem; |
| 604 | tnode_free_append(tn, node0); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 605 | |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 606 | /* populate child pointers in new nodes */ |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 607 | for (k = child_length(inode), j = k / 2; j;) { |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 608 | 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 Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 612 | } |
Alexander Duyck | ff181ed | 2014-12-31 10:56:43 -0800 | [diff] [blame] | 613 | |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 614 | /* link new nodes to parent */ |
| 615 | NODE_INIT_PARENT(node1, tn); |
| 616 | NODE_INIT_PARENT(node0, tn); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 617 | |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 618 | /* link parent to nodes */ |
| 619 | put_child(tn, 2 * i + 1, node1); |
| 620 | put_child(tn, 2 * i, node0); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 621 | } |
Alexander Duyck | ff181ed | 2014-12-31 10:56:43 -0800 | [diff] [blame] | 622 | |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 623 | /* setup the parent pointers into and out of this node */ |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 624 | return replace(t, oldtnode, tn); |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 625 | nomem: |
Alexander Duyck | fc86a93 | 2014-12-31 10:56:49 -0800 | [diff] [blame] | 626 | /* all pointers should be clean so we are done */ |
| 627 | tnode_free(tn); |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 628 | notnode: |
| 629 | return NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 630 | } |
| 631 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 632 | static struct key_vector *halve(struct trie *t, |
| 633 | struct key_vector *oldtnode) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 634 | { |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 635 | struct key_vector *tn; |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 636 | unsigned long i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 637 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 638 | pr_debug("In halve\n"); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 639 | |
Alexander Duyck | e9b4401 | 2014-12-31 10:56:12 -0800 | [diff] [blame] | 640 | tn = tnode_new(oldtnode->key, oldtnode->pos + 1, oldtnode->bits - 1); |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 641 | if (!tn) |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 642 | goto notnode; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 643 | |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 644 | /* prepare oldtnode to be freed */ |
| 645 | tnode_free_init(oldtnode); |
| 646 | |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 647 | /* 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 Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 651 | */ |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 652 | for (i = child_length(oldtnode); i;) { |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 653 | struct key_vector *node1 = get_child(oldtnode, --i); |
| 654 | struct key_vector *node0 = get_child(oldtnode, --i); |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 655 | struct key_vector *inode; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 656 | |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 657 | /* At least one of the children is empty */ |
| 658 | if (!node1 || !node0) { |
| 659 | put_child(tn, i / 2, node1 ? : node0); |
| 660 | continue; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 661 | } |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 662 | |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 663 | /* Two nonempty children */ |
| 664 | inode = tnode_new(node0->key, oldtnode->pos, 1); |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 665 | if (!inode) |
| 666 | goto nomem; |
Alexander Duyck | 12c081a | 2014-12-31 10:56:55 -0800 | [diff] [blame] | 667 | 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 Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 676 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 677 | |
Alexander Duyck | 69fa57b | 2015-01-22 15:51:14 -0800 | [diff] [blame] | 678 | /* setup the parent pointers into and out of this node */ |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 679 | return replace(t, oldtnode, tn); |
| 680 | nomem: |
| 681 | /* all pointers should be clean so we are done */ |
| 682 | tnode_free(tn); |
| 683 | notnode: |
| 684 | return NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 685 | } |
| 686 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 687 | static struct key_vector *collapse(struct trie *t, |
| 688 | struct key_vector *oldtnode) |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 689 | { |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 690 | struct key_vector *n, *tp; |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 691 | unsigned long i; |
| 692 | |
| 693 | /* scan the tnode looking for that one child that might still exist */ |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 694 | for (n = NULL, i = child_length(oldtnode); !n && i;) |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 695 | n = get_child(oldtnode, --i); |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 696 | |
| 697 | /* compress one level */ |
| 698 | tp = node_parent(oldtnode); |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 699 | put_child_root(tp, oldtnode->key, n); |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 700 | node_set_parent(n, tp); |
| 701 | |
| 702 | /* drop dead node */ |
| 703 | node_free(oldtnode); |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 704 | |
| 705 | return tp; |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 706 | } |
| 707 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 708 | static unsigned char update_suffix(struct key_vector *tn) |
Alexander Duyck | 5405afd | 2014-12-31 10:57:08 -0800 | [diff] [blame] | 709 | { |
| 710 | unsigned char slen = tn->pos; |
| 711 | unsigned long stride, i; |
Alexander Duyck | a52ca62 | 2016-12-01 07:27:57 -0500 | [diff] [blame] | 712 | 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 Duyck | 5405afd | 2014-12-31 10:57:08 -0800 | [diff] [blame] | 719 | |
| 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 Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 725 | for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) { |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 726 | struct key_vector *n = get_child(tn, i); |
Alexander Duyck | 5405afd | 2014-12-31 10:57:08 -0800 | [diff] [blame] | 727 | |
| 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 Duyck | a52ca62 | 2016-12-01 07:27:57 -0500 | [diff] [blame] | 736 | /* stop searching if we have hit the maximum possible value */ |
| 737 | if (slen >= slen_max) |
Alexander Duyck | 5405afd | 2014-12-31 10:57:08 -0800 | [diff] [blame] | 738 | break; |
| 739 | } |
| 740 | |
| 741 | tn->slen = slen; |
| 742 | |
| 743 | return slen; |
| 744 | } |
| 745 | |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 746 | /* 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 Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 754 | * child_length() and instead of multiplying by 2 (since the |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 755 | * 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 Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 759 | * The left-hand side may look a bit weird: child_length(tn) |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 760 | * - 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 Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 769 | * not_to_be_doubled = child_length(tn) - tn->empty_children - |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 770 | * tn->full_children; |
| 771 | * |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 772 | * new_child_length = child_length(tn) * 2; |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 773 | * |
| 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 Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 789 | * 100 * (child_length(tn) - tn->empty_children + |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 790 | * tn->full_children) >= inflate_threshold * new_child_length |
| 791 | * |
| 792 | * expand new_child_length: |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 793 | * 100 * (child_length(tn) - tn->empty_children + |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 794 | * tn->full_children) >= |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 795 | * inflate_threshold * child_length(tn) * 2 |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 796 | * |
| 797 | * shorten again: |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 798 | * 50 * (tn->full_children + child_length(tn) - |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 799 | * tn->empty_children) >= inflate_threshold * |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 800 | * child_length(tn) |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 801 | * |
| 802 | */ |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 803 | static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn) |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 804 | { |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 805 | unsigned long used = child_length(tn); |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 806 | unsigned long threshold = used; |
| 807 | |
| 808 | /* Keep root node larger */ |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 809 | threshold *= IS_TRIE(tp) ? inflate_threshold_root : inflate_threshold; |
Alexander Duyck | 6e22d17 | 2015-03-06 09:54:39 -0800 | [diff] [blame] | 810 | used -= tn_info(tn)->empty_children; |
| 811 | used += tn_info(tn)->full_children; |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 812 | |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 813 | /* if bits == KEYLENGTH then pos = 0, and will fail below */ |
| 814 | |
| 815 | return (used > 1) && tn->pos && ((50 * used) >= threshold); |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 816 | } |
| 817 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 818 | static inline bool should_halve(struct key_vector *tp, struct key_vector *tn) |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 819 | { |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 820 | unsigned long used = child_length(tn); |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 821 | unsigned long threshold = used; |
| 822 | |
| 823 | /* Keep root node larger */ |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 824 | threshold *= IS_TRIE(tp) ? halve_threshold_root : halve_threshold; |
Alexander Duyck | 6e22d17 | 2015-03-06 09:54:39 -0800 | [diff] [blame] | 825 | used -= tn_info(tn)->empty_children; |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 826 | |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 827 | /* 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 Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 832 | static inline bool should_collapse(struct key_vector *tn) |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 833 | { |
Alexander Duyck | 2e1ac88 | 2015-03-06 09:54:21 -0800 | [diff] [blame] | 834 | unsigned long used = child_length(tn); |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 835 | |
Alexander Duyck | 6e22d17 | 2015-03-06 09:54:39 -0800 | [diff] [blame] | 836 | used -= tn_info(tn)->empty_children; |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 837 | |
| 838 | /* account for bits == KEYLENGTH case */ |
Alexander Duyck | 6e22d17 | 2015-03-06 09:54:39 -0800 | [diff] [blame] | 839 | if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children) |
Alexander Duyck | 95f60ea | 2015-01-22 15:51:26 -0800 | [diff] [blame] | 840 | used -= KEY_MAX; |
| 841 | |
| 842 | /* One child or none, time to drop us from the trie */ |
| 843 | return used < 2; |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 844 | } |
| 845 | |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 846 | #define MAX_WORK 10 |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 847 | static struct key_vector *resize(struct trie *t, struct key_vector *tn) |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 848 | { |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 849 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 850 | struct trie_use_stats __percpu *stats = t->stats; |
| 851 | #endif |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 852 | struct key_vector *tp = node_parent(tn); |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 853 | unsigned long cindex = get_index(tn->key, tp); |
Alexander Duyck | a80e89d | 2015-01-22 15:51:20 -0800 | [diff] [blame] | 854 | int max_work = MAX_WORK; |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 855 | |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 856 | pr_debug("In tnode_resize %p inflate_threshold=%d threshold=%d\n", |
| 857 | tn, inflate_threshold, halve_threshold); |
| 858 | |
Alexander Duyck | ff181ed | 2014-12-31 10:56:43 -0800 | [diff] [blame] | 859 | /* 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 Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 863 | BUG_ON(tn != get_child(tp, cindex)); |
Alexander Duyck | ff181ed | 2014-12-31 10:56:43 -0800 | [diff] [blame] | 864 | |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 865 | /* Double as long as the resulting node has a number of |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 866 | * nonempty nodes that are above the threshold. |
| 867 | */ |
Alexander Duyck | b6f15f8 | 2015-03-23 11:51:53 -0700 | [diff] [blame] | 868 | while (should_inflate(tp, tn) && max_work) { |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 869 | tp = inflate(t, tn); |
| 870 | if (!tp) { |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 871 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 872 | this_cpu_inc(stats->resize_node_skipped); |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 873 | #endif |
| 874 | break; |
| 875 | } |
Alexander Duyck | ff181ed | 2014-12-31 10:56:43 -0800 | [diff] [blame] | 876 | |
Alexander Duyck | b6f15f8 | 2015-03-23 11:51:53 -0700 | [diff] [blame] | 877 | max_work--; |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 878 | tn = get_child(tp, cindex); |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 879 | } |
| 880 | |
Alexander Duyck | b6f15f8 | 2015-03-23 11:51:53 -0700 | [diff] [blame] | 881 | /* update parent in case inflate failed */ |
| 882 | tp = node_parent(tn); |
| 883 | |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 884 | /* Return if at least one inflate is run */ |
| 885 | if (max_work != MAX_WORK) |
Alexander Duyck | b6f15f8 | 2015-03-23 11:51:53 -0700 | [diff] [blame] | 886 | return tp; |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 887 | |
Alexander Duyck | f05a481 | 2014-12-31 10:56:37 -0800 | [diff] [blame] | 888 | /* Halve as long as the number of empty children in this |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 889 | * node is above threshold. |
| 890 | */ |
Alexander Duyck | b6f15f8 | 2015-03-23 11:51:53 -0700 | [diff] [blame] | 891 | while (should_halve(tp, tn) && max_work) { |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 892 | tp = halve(t, tn); |
| 893 | if (!tp) { |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 894 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 895 | this_cpu_inc(stats->resize_node_skipped); |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 896 | #endif |
| 897 | break; |
| 898 | } |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 899 | |
Alexander Duyck | b6f15f8 | 2015-03-23 11:51:53 -0700 | [diff] [blame] | 900 | max_work--; |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 901 | tn = get_child(tp, cindex); |
Alexander Duyck | ff181ed | 2014-12-31 10:56:43 -0800 | [diff] [blame] | 902 | } |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 903 | |
| 904 | /* Only one child remains */ |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 905 | if (should_collapse(tn)) |
| 906 | return collapse(t, tn); |
| 907 | |
Alexander Duyck | b6f15f8 | 2015-03-23 11:51:53 -0700 | [diff] [blame] | 908 | /* update parent in case halve failed */ |
Alexander Duyck | a52ca62 | 2016-12-01 07:27:57 -0500 | [diff] [blame] | 909 | return node_parent(tn); |
Alexander Duyck | cf3637b | 2014-12-31 10:56:31 -0800 | [diff] [blame] | 910 | } |
| 911 | |
Alexander Duyck | 1a23917 | 2016-12-01 07:27:52 -0500 | [diff] [blame] | 912 | static void node_pull_suffix(struct key_vector *tn, unsigned char slen) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 913 | { |
Alexander Duyck | 1a23917 | 2016-12-01 07:27:52 -0500 | [diff] [blame] | 914 | 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 Duyck | 5405afd | 2014-12-31 10:57:08 -0800 | [diff] [blame] | 919 | break; |
Alexander Duyck | 1a23917 | 2016-12-01 07:27:52 -0500 | [diff] [blame] | 920 | |
| 921 | tn = node_parent(tn); |
| 922 | node_slen = tn->slen; |
Alexander Duyck | 5405afd | 2014-12-31 10:57:08 -0800 | [diff] [blame] | 923 | } |
| 924 | } |
| 925 | |
Alexander Duyck | 1a23917 | 2016-12-01 07:27:52 -0500 | [diff] [blame] | 926 | static void node_push_suffix(struct key_vector *tn, unsigned char slen) |
Alexander Duyck | 5405afd | 2014-12-31 10:57:08 -0800 | [diff] [blame] | 927 | { |
Alexander Duyck | 1a23917 | 2016-12-01 07:27:52 -0500 | [diff] [blame] | 928 | while (tn->slen < slen) { |
| 929 | tn->slen = slen; |
Alexander Duyck | 5405afd | 2014-12-31 10:57:08 -0800 | [diff] [blame] | 930 | tn = node_parent(tn); |
| 931 | } |
| 932 | } |
| 933 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 934 | /* rcu_read_lock needs to be hold by caller from readside */ |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 935 | static struct key_vector *fib_find_node(struct trie *t, |
| 936 | struct key_vector **tp, u32 key) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 937 | { |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 938 | struct key_vector *pn, *n = t->kv; |
| 939 | unsigned long index = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 940 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 941 | 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 Duyck | 939afb0 | 2014-12-31 10:56:00 -0800 | [diff] [blame] | 949 | |
| 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 Duyck | d4a975e | 2015-03-04 15:01:59 -0800 | [diff] [blame] | 955 | * if (index >= (1ul << bits)) |
Alexander Duyck | 939afb0 | 2014-12-31 10:56:00 -0800 | [diff] [blame] | 956 | * we have a mismatch in skip bits and failed |
Alexander Duyck | b383211 | 2015-01-22 15:51:08 -0800 | [diff] [blame] | 957 | * else |
| 958 | * we know the value is cindex |
Alexander Duyck | d4a975e | 2015-03-04 15:01:59 -0800 | [diff] [blame] | 959 | * |
| 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 Duyck | 939afb0 | 2014-12-31 10:56:00 -0800 | [diff] [blame] | 963 | */ |
Alexander Duyck | d4a975e | 2015-03-04 15:01:59 -0800 | [diff] [blame] | 964 | if (index >= (1ul << n->bits)) { |
| 965 | n = NULL; |
| 966 | break; |
| 967 | } |
Alexander Duyck | 939afb0 | 2014-12-31 10:56:00 -0800 | [diff] [blame] | 968 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 969 | /* keep searching until we find a perfect match leaf or NULL */ |
| 970 | } while (IS_TNODE(n)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 971 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 972 | *tp = pn; |
Alexander Duyck | d4a975e | 2015-03-04 15:01:59 -0800 | [diff] [blame] | 973 | |
Alexander Duyck | 939afb0 | 2014-12-31 10:56:00 -0800 | [diff] [blame] | 974 | return n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 975 | } |
| 976 | |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 977 | /* Return the first fib alias matching DSCP with |
Alexander Duyck | 0252536 | 2015-01-22 15:51:39 -0800 | [diff] [blame] | 978 | * priority less than or equal to PRIO. |
Ido Schimmel | b5fc043 | 2019-12-14 17:53:08 +0200 | [diff] [blame] | 979 | * If 'find_first' is set, return the first matching |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 980 | * fib alias, regardless of DSCP and priority. |
Alexander Duyck | 0252536 | 2015-01-22 15:51:39 -0800 | [diff] [blame] | 981 | */ |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 982 | static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen, |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 983 | dscp_t dscp, u32 prio, u32 tb_id, |
Ido Schimmel | b5fc043 | 2019-12-14 17:53:08 +0200 | [diff] [blame] | 984 | bool find_first) |
Alexander Duyck | 0252536 | 2015-01-22 15:51:39 -0800 | [diff] [blame] | 985 | { |
| 986 | struct fib_alias *fa; |
| 987 | |
| 988 | if (!fah) |
| 989 | return NULL; |
| 990 | |
Alexander Duyck | 56315f9 | 2015-02-25 15:31:31 -0800 | [diff] [blame] | 991 | hlist_for_each_entry(fa, fah, fa_list) { |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 992 | /* 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 Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 996 | if (fa->fa_slen < slen) |
| 997 | continue; |
| 998 | if (fa->fa_slen != slen) |
| 999 | break; |
Alexander Duyck | 0b65bd9 | 2015-03-12 14:46:29 -0700 | [diff] [blame] | 1000 | if (fa->tb_id > tb_id) |
| 1001 | continue; |
| 1002 | if (fa->tb_id != tb_id) |
| 1003 | break; |
Ido Schimmel | b5fc043 | 2019-12-14 17:53:08 +0200 | [diff] [blame] | 1004 | if (find_first) |
| 1005 | return fa; |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1006 | if (__fa_dscp > __dscp) |
Alexander Duyck | 0252536 | 2015-01-22 15:51:39 -0800 | [diff] [blame] | 1007 | continue; |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1008 | if (fa->fa_info->fib_priority >= prio || __fa_dscp < __dscp) |
Alexander Duyck | 0252536 | 2015-01-22 15:51:39 -0800 | [diff] [blame] | 1009 | return fa; |
| 1010 | } |
| 1011 | |
| 1012 | return NULL; |
| 1013 | } |
| 1014 | |
Ido Schimmel | 90b93f1 | 2020-01-14 13:23:11 +0200 | [diff] [blame] | 1015 | static struct fib_alias * |
| 1016 | fib_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 Nault | 888ade8 | 2022-04-08 22:08:37 +0200 | [diff] [blame] | 1035 | fa->fa_dscp == fri->dscp && fa->fa_info == fri->fi && |
| 1036 | fa->fa_type == fri->type) |
Ido Schimmel | 90b93f1 | 2020-01-14 13:23:11 +0200 | [diff] [blame] | 1037 | return fa; |
| 1038 | } |
| 1039 | |
| 1040 | return NULL; |
| 1041 | } |
| 1042 | |
| 1043 | void fib_alias_hw_flags_set(struct net *net, const struct fib_rt_info *fri) |
| 1044 | { |
Kuniyuki Iwashima | 96b9bd8 | 2022-07-22 11:22:05 -0700 | [diff] [blame] | 1045 | u8 fib_notify_on_flag_change; |
Ido Schimmel | 90b93f1 | 2020-01-14 13:23:11 +0200 | [diff] [blame] | 1046 | struct fib_alias *fa_match; |
Amit Cohen | 680aea0 | 2021-02-01 21:47:52 +0200 | [diff] [blame] | 1047 | struct sk_buff *skb; |
| 1048 | int err; |
Ido Schimmel | 90b93f1 | 2020-01-14 13:23:11 +0200 | [diff] [blame] | 1049 | |
| 1050 | rcu_read_lock(); |
| 1051 | |
| 1052 | fa_match = fib_find_matching_alias(net, fri); |
| 1053 | if (!fa_match) |
| 1054 | goto out; |
| 1055 | |
Eric Dumazet | 9fcf986 | 2022-02-16 09:32:16 -0800 | [diff] [blame] | 1056 | /* 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 Cohen | 680aea0 | 2021-02-01 21:47:52 +0200 | [diff] [blame] | 1062 | goto out; |
| 1063 | |
Eric Dumazet | 9fcf986 | 2022-02-16 09:32:16 -0800 | [diff] [blame] | 1064 | WRITE_ONCE(fa_match->offload, fri->offload); |
| 1065 | WRITE_ONCE(fa_match->trap, fri->trap); |
Amit Cohen | 648106c | 2021-02-07 10:22:51 +0200 | [diff] [blame] | 1066 | |
Kuniyuki Iwashima | 96b9bd8 | 2022-07-22 11:22:05 -0700 | [diff] [blame] | 1067 | fib_notify_on_flag_change = READ_ONCE(net->ipv4.sysctl_fib_notify_on_flag_change); |
| 1068 | |
Amit Cohen | 648106c | 2021-02-07 10:22:51 +0200 | [diff] [blame] | 1069 | /* 2 means send notifications only if offload_failed was changed. */ |
Kuniyuki Iwashima | 96b9bd8 | 2022-07-22 11:22:05 -0700 | [diff] [blame] | 1070 | if (fib_notify_on_flag_change == 2 && |
Eric Dumazet | 9fcf986 | 2022-02-16 09:32:16 -0800 | [diff] [blame] | 1071 | READ_ONCE(fa_match->offload_failed) == fri->offload_failed) |
Amit Cohen | 648106c | 2021-02-07 10:22:51 +0200 | [diff] [blame] | 1072 | goto out; |
| 1073 | |
Eric Dumazet | 9fcf986 | 2022-02-16 09:32:16 -0800 | [diff] [blame] | 1074 | WRITE_ONCE(fa_match->offload_failed, fri->offload_failed); |
Ido Schimmel | 90b93f1 | 2020-01-14 13:23:11 +0200 | [diff] [blame] | 1075 | |
Kuniyuki Iwashima | 96b9bd8 | 2022-07-22 11:22:05 -0700 | [diff] [blame] | 1076 | if (!fib_notify_on_flag_change) |
Amit Cohen | 680aea0 | 2021-02-01 21:47:52 +0200 | [diff] [blame] | 1077 | 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 | |
| 1096 | errout: |
| 1097 | rtnl_set_sk_err(net, RTNLGRP_IPV4_ROUTE, err); |
Ido Schimmel | 90b93f1 | 2020-01-14 13:23:11 +0200 | [diff] [blame] | 1098 | out: |
| 1099 | rcu_read_unlock(); |
| 1100 | } |
| 1101 | EXPORT_SYMBOL_GPL(fib_alias_hw_flags_set); |
| 1102 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1103 | static void trie_rebalance(struct trie *t, struct key_vector *tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1104 | { |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1105 | while (!IS_TRIE(tn)) |
| 1106 | tn = resize(t, tn); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1107 | } |
| 1108 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1109 | static int fib_insert_node(struct trie *t, struct key_vector *tp, |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1110 | struct fib_alias *new, t_key key) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1111 | { |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1112 | struct key_vector *n, *l; |
Alexander Duyck | 836a012 | 2014-12-31 10:56:06 -0800 | [diff] [blame] | 1113 | |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1114 | l = leaf_new(key, new); |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1115 | if (!l) |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 1116 | goto noleaf; |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1117 | |
| 1118 | /* retrieve child from parent node */ |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1119 | n = get_child(tp, get_index(key, tp)); |
Alexander Duyck | 836a012 | 2014-12-31 10:56:06 -0800 | [diff] [blame] | 1120 | |
| 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 Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1128 | struct key_vector *tn; |
Alexander Duyck | 836a012 | 2014-12-31 10:56:06 -0800 | [diff] [blame] | 1129 | |
Alexander Duyck | e9b4401 | 2014-12-31 10:56:12 -0800 | [diff] [blame] | 1130 | tn = tnode_new(key, __fls(key ^ n->key), 1); |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 1131 | if (!tn) |
| 1132 | goto notnode; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1133 | |
Alexander Duyck | 836a012 | 2014-12-31 10:56:06 -0800 | [diff] [blame] | 1134 | /* initialize routes out of node */ |
| 1135 | NODE_INIT_PARENT(tn, tp); |
| 1136 | put_child(tn, get_index(key, tn) ^ 1, n); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1137 | |
Alexander Duyck | 836a012 | 2014-12-31 10:56:06 -0800 | [diff] [blame] | 1138 | /* start adding routes into the node */ |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1139 | put_child_root(tp, key, tn); |
Alexander Duyck | 836a012 | 2014-12-31 10:56:06 -0800 | [diff] [blame] | 1140 | node_set_parent(n, tn); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1141 | |
Alexander Duyck | 836a012 | 2014-12-31 10:56:06 -0800 | [diff] [blame] | 1142 | /* parent now has a NULL spot where the leaf can go */ |
Alexander Duyck | e962f302 | 2014-12-10 21:49:22 -0800 | [diff] [blame] | 1143 | tp = tn; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1144 | } |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1145 | |
Alexander Duyck | 836a012 | 2014-12-31 10:56:06 -0800 | [diff] [blame] | 1146 | /* Case 3: n is NULL, and will just insert a new leaf */ |
Alexander Duyck | a52ca62 | 2016-12-01 07:27:57 -0500 | [diff] [blame] | 1147 | node_push_suffix(tp, new->fa_slen); |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1148 | NODE_INIT_PARENT(l, tp); |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1149 | put_child_root(tp, key, l); |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1150 | trie_rebalance(t, tp); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1151 | |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1152 | return 0; |
Alexander Duyck | 8d8e810 | 2015-03-06 09:54:02 -0800 | [diff] [blame] | 1153 | notnode: |
| 1154 | node_free(l); |
| 1155 | noleaf: |
| 1156 | return -ENOMEM; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1157 | } |
| 1158 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1159 | static int fib_insert_alias(struct trie *t, struct key_vector *tp, |
| 1160 | struct key_vector *l, struct fib_alias *new, |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1161 | 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 Duyck | 0b65bd9 | 2015-03-12 14:46:29 -0700 | [diff] [blame] | 1174 | if ((new->fa_slen == last->fa_slen) && |
| 1175 | (new->tb_id > last->tb_id)) |
| 1176 | break; |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1177 | 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 Duyck | 1a23917 | 2016-12-01 07:27:52 -0500 | [diff] [blame] | 1189 | node_push_suffix(tp, new->fa_slen); |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1190 | } |
| 1191 | |
| 1192 | return 0; |
| 1193 | } |
| 1194 | |
David Ahern | 7805599 | 2017-05-27 16:19:26 -0600 | [diff] [blame] | 1195 | static bool fib_valid_key_len(u32 key, u8 plen, struct netlink_ext_ack *extack) |
David Ahern | ba277e8 | 2017-05-27 16:19:25 -0600 | [diff] [blame] | 1196 | { |
David Ahern | 7805599 | 2017-05-27 16:19:26 -0600 | [diff] [blame] | 1197 | if (plen > KEYLENGTH) { |
| 1198 | NL_SET_ERR_MSG(extack, "Invalid prefix length"); |
David Ahern | ba277e8 | 2017-05-27 16:19:25 -0600 | [diff] [blame] | 1199 | return false; |
David Ahern | 7805599 | 2017-05-27 16:19:26 -0600 | [diff] [blame] | 1200 | } |
David Ahern | ba277e8 | 2017-05-27 16:19:25 -0600 | [diff] [blame] | 1201 | |
David Ahern | 7805599 | 2017-05-27 16:19:26 -0600 | [diff] [blame] | 1202 | if ((plen < KEYLENGTH) && (key << plen)) { |
| 1203 | NL_SET_ERR_MSG(extack, |
| 1204 | "Invalid prefix for given prefix length"); |
David Ahern | ba277e8 | 2017-05-27 16:19:25 -0600 | [diff] [blame] | 1205 | return false; |
David Ahern | 7805599 | 2017-05-27 16:19:26 -0600 | [diff] [blame] | 1206 | } |
David Ahern | ba277e8 | 2017-05-27 16:19:25 -0600 | [diff] [blame] | 1207 | |
| 1208 | return true; |
| 1209 | } |
| 1210 | |
Ido Schimmel | a6c76c1 | 2019-12-14 17:53:07 +0200 | [diff] [blame] | 1211 | static void fib_remove_alias(struct trie *t, struct key_vector *tp, |
| 1212 | struct key_vector *l, struct fib_alias *old); |
| 1213 | |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1214 | /* Caller must hold RTNL. */ |
Jiri Pirko | b90eb75 | 2016-09-26 12:52:29 +0200 | [diff] [blame] | 1215 | int fib_table_insert(struct net *net, struct fib_table *tb, |
David Ahern | 6d8422a1 | 2017-05-21 10:12:02 -0600 | [diff] [blame] | 1216 | struct fib_config *cfg, struct netlink_ext_ack *extack) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1217 | { |
Alexander Duyck | d4a975e | 2015-03-04 15:01:59 -0800 | [diff] [blame] | 1218 | struct trie *t = (struct trie *)tb->tb_data; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1219 | struct fib_alias *fa, *new_fa; |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1220 | struct key_vector *l, *tp; |
Guillaume Nault | b93e1fa | 2016-09-07 17:20:46 +0200 | [diff] [blame] | 1221 | u16 nlflags = NLM_F_EXCL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1222 | struct fib_info *fi; |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1223 | u8 plen = cfg->fc_dst_len; |
| 1224 | u8 slen = KEYLENGTH - plen; |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1225 | dscp_t dscp; |
Alexander Duyck | d4a975e | 2015-03-04 15:01:59 -0800 | [diff] [blame] | 1226 | u32 key; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1227 | int err; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1228 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1229 | key = ntohl(cfg->fc_dst); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1230 | |
David Ahern | 7805599 | 2017-05-27 16:19:26 -0600 | [diff] [blame] | 1231 | if (!fib_valid_key_len(key, plen, extack)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1232 | return -EINVAL; |
| 1233 | |
David Ahern | ba277e8 | 2017-05-27 16:19:25 -0600 | [diff] [blame] | 1234 | pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen); |
| 1235 | |
David Ahern | 6d8422a1 | 2017-05-21 10:12:02 -0600 | [diff] [blame] | 1236 | fi = fib_create_info(cfg, extack); |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1237 | if (IS_ERR(fi)) { |
| 1238 | err = PTR_ERR(fi); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1239 | goto err; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1240 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1241 | |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1242 | dscp = cfg->fc_dscp; |
Alexander Duyck | d4a975e | 2015-03-04 15:01:59 -0800 | [diff] [blame] | 1243 | l = fib_find_node(t, &tp, key); |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1244 | fa = l ? fib_find_alias(&l->leaf, slen, dscp, fi->fib_priority, |
Ido Schimmel | b5fc043 | 2019-12-14 17:53:08 +0200 | [diff] [blame] | 1245 | tb->tb_id, false) : NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1246 | |
| 1247 | /* Now fa, if non-NULL, points to the first fib alias |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1248 | * with the same keys [prefix,dscp,priority], if such key already |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1249 | * 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 Duyck | 56315f9 | 2015-02-25 15:31:31 -0800 | [diff] [blame] | 1252 | * insert to the tail of the section matching the suffix length |
| 1253 | * of the new alias. |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1254 | */ |
| 1255 | |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1256 | if (fa && fa->fa_dscp == dscp && |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1257 | fa->fa_info->fib_priority == fi->fib_priority) { |
| 1258 | struct fib_alias *fa_first, *fa_match; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1259 | |
| 1260 | err = -EEXIST; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1261 | if (cfg->fc_nlflags & NLM_F_EXCL) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1262 | goto out; |
| 1263 | |
Guillaume Nault | b93e1fa | 2016-09-07 17:20:46 +0200 | [diff] [blame] | 1264 | nlflags &= ~NLM_F_EXCL; |
| 1265 | |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1266 | /* 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 Duyck | 56315f9 | 2015-02-25 15:31:31 -0800 | [diff] [blame] | 1273 | hlist_for_each_entry_from(fa, fa_list) { |
Alexander Duyck | 0b65bd9 | 2015-03-12 14:46:29 -0700 | [diff] [blame] | 1274 | if ((fa->fa_slen != slen) || |
| 1275 | (fa->tb_id != tb->tb_id) || |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1276 | (fa->fa_dscp != dscp)) |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1277 | break; |
| 1278 | if (fa->fa_info->fib_priority != fi->fib_priority) |
| 1279 | break; |
| 1280 | if (fa->fa_type == cfg->fc_type && |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1281 | fa->fa_info == fi) { |
| 1282 | fa_match = fa; |
| 1283 | break; |
| 1284 | } |
| 1285 | } |
| 1286 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1287 | if (cfg->fc_nlflags & NLM_F_REPLACE) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1288 | struct fib_info *fi_drop; |
| 1289 | u8 state; |
| 1290 | |
Guillaume Nault | b93e1fa | 2016-09-07 17:20:46 +0200 | [diff] [blame] | 1291 | nlflags |= NLM_F_REPLACE; |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1292 | fa = fa_first; |
| 1293 | if (fa_match) { |
| 1294 | if (fa == fa_match) |
| 1295 | err = 0; |
Joonwoo Park | 6725033 | 2008-01-18 03:45:18 -0800 | [diff] [blame] | 1296 | goto out; |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1297 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1298 | err = -ENOBUFS; |
Christoph Lameter | e94b176 | 2006-12-06 20:33:17 -0800 | [diff] [blame] | 1299 | new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL); |
Ian Morris | 51456b2 | 2015-04-03 09:17:26 +0100 | [diff] [blame] | 1300 | if (!new_fa) |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1301 | goto out; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1302 | |
| 1303 | fi_drop = fa->fa_info; |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1304 | new_fa->fa_dscp = fa->fa_dscp; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1305 | new_fa->fa_info = fi; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1306 | new_fa->fa_type = cfg->fc_type; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1307 | state = fa->fa_state; |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1308 | new_fa->fa_state = state & ~FA_S_ACCESSED; |
Alexander Duyck | 9b6ebad | 2015-02-25 15:31:44 -0800 | [diff] [blame] | 1309 | new_fa->fa_slen = fa->fa_slen; |
Michal Kubeček | d4e64c2 | 2015-05-22 13:40:09 +0200 | [diff] [blame] | 1310 | new_fa->tb_id = tb->tb_id; |
Julian Anastasov | 2392deb | 2015-07-22 10:43:23 +0300 | [diff] [blame] | 1311 | new_fa->fa_default = -1; |
Ido Schimmel | 90b93f1 | 2020-01-14 13:23:11 +0200 | [diff] [blame] | 1312 | new_fa->offload = 0; |
| 1313 | new_fa->trap = 0; |
Amit Cohen | 36c5100 | 2021-02-07 10:22:50 +0200 | [diff] [blame] | 1314 | new_fa->offload_failed = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1315 | |
Ido Schimmel | 6324d0f | 2020-01-14 13:23:09 +0200 | [diff] [blame] | 1316 | hlist_replace_rcu(&fa->fa_list, &new_fa->fa_list); |
| 1317 | |
Ido Schimmel | ee3936d | 2019-12-14 17:53:09 +0200 | [diff] [blame] | 1318 | if (fib_find_alias(&l->leaf, fa->fa_slen, 0, 0, |
Ido Schimmel | 6324d0f | 2020-01-14 13:23:09 +0200 | [diff] [blame] | 1319 | tb->tb_id, true) == new_fa) { |
Ido Schimmel | ee3936d | 2019-12-14 17:53:09 +0200 | [diff] [blame] | 1320 | enum fib_event_type fib_event; |
| 1321 | |
Ido Schimmel | 446f739 | 2019-12-14 17:53:15 +0200 | [diff] [blame] | 1322 | fib_event = FIB_EVENT_ENTRY_REPLACE; |
Ido Schimmel | ee3936d | 2019-12-14 17:53:09 +0200 | [diff] [blame] | 1323 | err = call_fib_entry_notifiers(net, fib_event, |
| 1324 | key, plen, |
| 1325 | new_fa, extack); |
Ido Schimmel | 6324d0f | 2020-01-14 13:23:09 +0200 | [diff] [blame] | 1326 | if (err) { |
| 1327 | hlist_replace_rcu(&new_fa->fa_list, |
| 1328 | &fa->fa_list); |
Ido Schimmel | ee3936d | 2019-12-14 17:53:09 +0200 | [diff] [blame] | 1329 | goto out_free_new_fa; |
Ido Schimmel | 6324d0f | 2020-01-14 13:23:09 +0200 | [diff] [blame] | 1330 | } |
Ido Schimmel | ee3936d | 2019-12-14 17:53:09 +0200 | [diff] [blame] | 1331 | } |
David Ahern | c1d7ee6 | 2018-03-27 18:21:58 -0700 | [diff] [blame] | 1332 | |
Ido Schimmel | 5b7d616 | 2017-02-09 10:28:40 +0100 | [diff] [blame] | 1333 | rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, |
| 1334 | tb->tb_id, &cfg->fc_nlinfo, nlflags); |
| 1335 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1336 | alias_free_mem_rcu(fa); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1337 | |
| 1338 | fib_release_info(fi_drop); |
| 1339 | if (state & FA_S_ACCESSED) |
Nicolas Dichtel | 4ccfe6d | 2012-09-07 00:45:29 +0000 | [diff] [blame] | 1340 | rt_cache_flush(cfg->fc_nlinfo.nl_net); |
Jiri Pirko | b90eb75 | 2016-09-26 12:52:29 +0200 | [diff] [blame] | 1341 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1342 | goto succeeded; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1343 | } |
| 1344 | /* Error if we find a perfect match which |
| 1345 | * uses the same scope, type, and nexthop |
| 1346 | * information. |
| 1347 | */ |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1348 | if (fa_match) |
| 1349 | goto out; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1350 | |
Ido Schimmel | 446f739 | 2019-12-14 17:53:15 +0200 | [diff] [blame] | 1351 | if (cfg->fc_nlflags & NLM_F_APPEND) |
Guillaume Nault | b93e1fa | 2016-09-07 17:20:46 +0200 | [diff] [blame] | 1352 | nlflags |= NLM_F_APPEND; |
Ido Schimmel | 446f739 | 2019-12-14 17:53:15 +0200 | [diff] [blame] | 1353 | else |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1354 | fa = fa_first; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1355 | } |
| 1356 | err = -ENOENT; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1357 | if (!(cfg->fc_nlflags & NLM_F_CREATE)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1358 | goto out; |
| 1359 | |
Guillaume Nault | b93e1fa | 2016-09-07 17:20:46 +0200 | [diff] [blame] | 1360 | nlflags |= NLM_F_CREATE; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1361 | err = -ENOBUFS; |
Christoph Lameter | e94b176 | 2006-12-06 20:33:17 -0800 | [diff] [blame] | 1362 | new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL); |
Ian Morris | 51456b2 | 2015-04-03 09:17:26 +0100 | [diff] [blame] | 1363 | if (!new_fa) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1364 | goto out; |
| 1365 | |
| 1366 | new_fa->fa_info = fi; |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1367 | new_fa->fa_dscp = dscp; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1368 | new_fa->fa_type = cfg->fc_type; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1369 | new_fa->fa_state = 0; |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1370 | new_fa->fa_slen = slen; |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 1371 | new_fa->tb_id = tb->tb_id; |
Julian Anastasov | 2392deb | 2015-07-22 10:43:23 +0300 | [diff] [blame] | 1372 | new_fa->fa_default = -1; |
Ido Schimmel | 90b93f1 | 2020-01-14 13:23:11 +0200 | [diff] [blame] | 1373 | new_fa->offload = 0; |
| 1374 | new_fa->trap = 0; |
Amit Cohen | 36c5100 | 2021-02-07 10:22:50 +0200 | [diff] [blame] | 1375 | new_fa->offload_failed = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1376 | |
Alexander Duyck | 9b6ebad | 2015-02-25 15:31:44 -0800 | [diff] [blame] | 1377 | /* Insert new entry to the list. */ |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1378 | err = fib_insert_alias(t, tp, l, new_fa, fa, key); |
| 1379 | if (err) |
Ido Schimmel | a6c76c1 | 2019-12-14 17:53:07 +0200 | [diff] [blame] | 1380 | 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 Xuan | 568fe84 | 2022-11-20 15:28:38 +0800 | [diff] [blame] | 1384 | if (WARN_ON_ONCE(!l)) { |
| 1385 | err = -ENOENT; |
Ido Schimmel | a6c76c1 | 2019-12-14 17:53:07 +0200 | [diff] [blame] | 1386 | goto out_free_new_fa; |
Ziyang Xuan | 568fe84 | 2022-11-20 15:28:38 +0800 | [diff] [blame] | 1387 | } |
Ido Schimmel | a6c76c1 | 2019-12-14 17:53:07 +0200 | [diff] [blame] | 1388 | |
Ido Schimmel | a8674f7 | 2019-12-14 17:53:10 +0200 | [diff] [blame] | 1389 | 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 Schimmel | 446f739 | 2019-12-14 17:53:15 +0200 | [diff] [blame] | 1393 | fib_event = FIB_EVENT_ENTRY_REPLACE; |
Ido Schimmel | a8674f7 | 2019-12-14 17:53:10 +0200 | [diff] [blame] | 1394 | 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 Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1399 | |
David S. Miller | 21d8c49 | 2011-04-14 14:49:37 -0700 | [diff] [blame] | 1400 | if (!plen) |
| 1401 | tb->tb_num_default++; |
| 1402 | |
Nicolas Dichtel | 4ccfe6d | 2012-09-07 00:45:29 +0000 | [diff] [blame] | 1403 | rt_cache_flush(cfg->fc_nlinfo.nl_net); |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 1404 | rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, new_fa->tb_id, |
Roopa Prabhu | a2bb6d7 | 2015-06-17 11:07:01 -0700 | [diff] [blame] | 1405 | &cfg->fc_nlinfo, nlflags); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1406 | succeeded: |
| 1407 | return 0; |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1408 | |
Ido Schimmel | a6c76c1 | 2019-12-14 17:53:07 +0200 | [diff] [blame] | 1409 | out_remove_new_fa: |
| 1410 | fib_remove_alias(t, tp, l, new_fa); |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1411 | out_free_new_fa: |
| 1412 | kmem_cache_free(fn_alias_kmem, new_fa); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1413 | out: |
| 1414 | fib_release_info(fi); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1415 | err: |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1416 | return err; |
| 1417 | } |
| 1418 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1419 | static inline t_key prefix_mismatch(t_key key, struct key_vector *n) |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1420 | { |
| 1421 | t_key prefix = n->key; |
| 1422 | |
| 1423 | return (key ^ prefix) & (prefix | -prefix); |
| 1424 | } |
| 1425 | |
David Ahern | af7888a | 2020-05-26 12:56:17 -0600 | [diff] [blame] | 1426 | bool 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 Ahern | 40867d7 | 2022-03-14 14:45:51 -0600 | [diff] [blame] | 1437 | if (flp->flowi4_oif && flp->flowi4_oif != nhc->nhc_oif) |
| 1438 | return false; |
David Ahern | af7888a | 2020-05-26 12:56:17 -0600 | [diff] [blame] | 1439 | |
| 1440 | return true; |
| 1441 | } |
| 1442 | |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1443 | /* should be called with rcu_read_lock */ |
David S. Miller | 22bd5b9 | 2011-03-11 19:54:08 -0500 | [diff] [blame] | 1444 | int fib_table_lookup(struct fib_table *tb, const struct flowi4 *flp, |
Eric Dumazet | ebc0ffa | 2010-10-05 10:41:36 +0000 | [diff] [blame] | 1445 | struct fib_result *res, int fib_flags) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1446 | { |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 1447 | struct trie *t = (struct trie *) tb->tb_data; |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 1448 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 1449 | struct trie_use_stats __percpu *stats = t->stats; |
| 1450 | #endif |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1451 | const t_key key = ntohl(flp->daddr); |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1452 | struct key_vector *n, *pn; |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1453 | struct fib_alias *fa; |
Alexander Duyck | 71e8b67 | 2015-03-04 15:04:03 -0800 | [diff] [blame] | 1454 | unsigned long index; |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1455 | t_key cindex; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1456 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1457 | pn = t->kv; |
| 1458 | cindex = 0; |
| 1459 | |
| 1460 | n = get_child_rcu(pn, cindex); |
David Ahern | 9f32397 | 2018-05-23 17:08:47 -0700 | [diff] [blame] | 1461 | if (!n) { |
| 1462 | trace_fib_table_lookup(tb->tb_id, flp, NULL, -EAGAIN); |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1463 | return -EAGAIN; |
David Ahern | 9f32397 | 2018-05-23 17:08:47 -0700 | [diff] [blame] | 1464 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1465 | |
| 1466 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 1467 | this_cpu_inc(stats->gets); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1468 | #endif |
| 1469 | |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1470 | /* Step 1: Travel to the longest prefix match in the trie */ |
| 1471 | for (;;) { |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1472 | index = get_cindex(key, n); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1473 | |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1474 | /* 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 Duyck | 71e8b67 | 2015-03-04 15:04:03 -0800 | [diff] [blame] | 1479 | * if (index >= (1ul << bits)) |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1480 | * we have a mismatch in skip bits and failed |
Alexander Duyck | b383211 | 2015-01-22 15:51:08 -0800 | [diff] [blame] | 1481 | * else |
| 1482 | * we know the value is cindex |
Alexander Duyck | 71e8b67 | 2015-03-04 15:04:03 -0800 | [diff] [blame] | 1483 | * |
| 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 Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1487 | */ |
Alexander Duyck | 71e8b67 | 2015-03-04 15:04:03 -0800 | [diff] [blame] | 1488 | if (index >= (1ul << n->bits)) |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1489 | break; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1490 | |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1491 | /* we have found a leaf. Prefixes have already been compared */ |
| 1492 | if (IS_LEAF(n)) |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1493 | goto found; |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1494 | |
| 1495 | /* only record pn and cindex if we are going to be chopping |
| 1496 | * bits later. Otherwise we are just wasting cycles. |
| 1497 | */ |
Alexander Duyck | 5405afd | 2014-12-31 10:57:08 -0800 | [diff] [blame] | 1498 | if (n->slen > n->pos) { |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1499 | pn = n; |
| 1500 | cindex = index; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1501 | } |
| 1502 | |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 1503 | n = get_child_rcu(n, index); |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1504 | if (unlikely(!n)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1505 | goto backtrace; |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1506 | } |
| 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 Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1511 | struct key_vector __rcu **cptr = n->tnode; |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1512 | |
| 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 Duyck | 5405afd | 2014-12-31 10:57:08 -0800 | [diff] [blame] | 1517 | if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos)) |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1518 | 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) { |
| 1530 | backtrace: |
| 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 Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1543 | /* 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 Ahern | 9f32397 | 2018-05-23 17:08:47 -0700 | [diff] [blame] | 1547 | if (IS_TRIE(pn)) { |
| 1548 | trace_fib_table_lookup(tb->tb_id, flp, |
| 1549 | NULL, -EAGAIN); |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1550 | return -EAGAIN; |
David Ahern | 9f32397 | 2018-05-23 17:08:47 -0700 | [diff] [blame] | 1551 | } |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1552 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 1553 | this_cpu_inc(stats->backtrack); |
| 1554 | #endif |
| 1555 | /* Get Child's index */ |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1556 | pn = node_parent_rcu(pn); |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1557 | 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 Duyck | 41b489f | 2015-03-04 15:02:33 -0800 | [diff] [blame] | 1564 | cptr = &pn->tnode[cindex]; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1565 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1566 | } |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1567 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1568 | found: |
Alexander Duyck | 71e8b67 | 2015-03-04 15:04:03 -0800 | [diff] [blame] | 1569 | /* this line carries forward the xor from earlier in the function */ |
| 1570 | index = key ^ n->key; |
| 1571 | |
Alexander Duyck | 9f9e636 | 2014-12-31 10:55:54 -0800 | [diff] [blame] | 1572 | /* Step 3: Process the leaf, if that fails fall back to backtracing */ |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1573 | hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) { |
| 1574 | struct fib_info *fi = fa->fa_info; |
David Ahern | af7888a | 2020-05-26 12:56:17 -0600 | [diff] [blame] | 1575 | struct fib_nh_common *nhc; |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1576 | int nhsel, err; |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1577 | |
Alexander Duyck | a5829f5 | 2016-01-28 13:42:24 -0800 | [diff] [blame] | 1578 | if ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen < KEYLENGTH)) { |
| 1579 | if (index >= (1ul << fa->fa_slen)) |
| 1580 | continue; |
| 1581 | } |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1582 | if (fa->fa_dscp && |
| 1583 | inet_dscp_to_dsfield(fa->fa_dscp) != flp->flowi4_tos) |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1584 | continue; |
Eric Dumazet | fce92af | 2023-08-30 09:55:20 +0000 | [diff] [blame] | 1585 | /* Paired with WRITE_ONCE() in fib_release_info() */ |
| 1586 | if (READ_ONCE(fi->fib_dead)) |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1587 | 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 Ahern | 4c7e808 | 2019-06-03 20:19:51 -0700 | [diff] [blame] | 1593 | out_reject: |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1594 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1595 | this_cpu_inc(stats->semantic_match_passed); |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1596 | #endif |
David Ahern | 9f32397 | 2018-05-23 17:08:47 -0700 | [diff] [blame] | 1597 | trace_fib_table_lookup(tb->tb_id, flp, NULL, err); |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1598 | return err; |
| 1599 | } |
| 1600 | if (fi->fib_flags & RTNH_F_DEAD) |
| 1601 | continue; |
David Ahern | 4c7e808 | 2019-06-03 20:19:51 -0700 | [diff] [blame] | 1602 | |
David Ahern | af7888a | 2020-05-26 12:56:17 -0600 | [diff] [blame] | 1603 | 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 Ahern | 4c7e808 | 2019-06-03 20:19:51 -0700 | [diff] [blame] | 1614 | } |
| 1615 | |
David Ahern | 5481d73 | 2019-06-03 20:19:49 -0700 | [diff] [blame] | 1616 | for (nhsel = 0; nhsel < fib_info_num_path(fi); nhsel++) { |
David Ahern | af7888a | 2020-05-26 12:56:17 -0600 | [diff] [blame] | 1617 | nhc = fib_info_nhc(fi, nhsel); |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1618 | |
David Ahern | af7888a | 2020-05-26 12:56:17 -0600 | [diff] [blame] | 1619 | if (!fib_lookup_good_nhc(nhc, fib_flags, flp)) |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1620 | continue; |
David Ahern | af7888a | 2020-05-26 12:56:17 -0600 | [diff] [blame] | 1621 | set_result: |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1622 | if (!(fib_flags & FIB_LOOKUP_NOREF)) |
Reshetova, Elena | 0029c0d | 2017-07-04 09:35:02 +0300 | [diff] [blame] | 1623 | refcount_inc(&fi->fib_clntref); |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1624 | |
David Ahern | 6ffd903 | 2017-05-25 10:42:37 -0700 | [diff] [blame] | 1625 | res->prefix = htonl(n->key); |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1626 | res->prefixlen = KEYLENGTH - fa->fa_slen; |
| 1627 | res->nh_sel = nhsel; |
David Ahern | eba618a | 2019-04-02 14:11:55 -0700 | [diff] [blame] | 1628 | res->nhc = nhc; |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1629 | 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 Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1634 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1635 | this_cpu_inc(stats->semantic_match_passed); |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1636 | #endif |
David Ahern | eba618a | 2019-04-02 14:11:55 -0700 | [diff] [blame] | 1637 | trace_fib_table_lookup(tb->tb_id, flp, nhc, err); |
David Ahern | f6d3c19 | 2015-08-28 08:42:09 -0700 | [diff] [blame] | 1638 | |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1639 | return err; |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1640 | } |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1641 | } |
David Ahern | af7888a | 2020-05-26 12:56:17 -0600 | [diff] [blame] | 1642 | miss: |
Alexander Duyck | 9b6ebad | 2015-02-25 15:31:44 -0800 | [diff] [blame] | 1643 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 1644 | this_cpu_inc(stats->semantic_match_miss); |
| 1645 | #endif |
Alexander Duyck | 345e9b5 | 2014-12-31 10:56:24 -0800 | [diff] [blame] | 1646 | goto backtrace; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1647 | } |
Florian Westphal | 6fc0143 | 2011-08-25 13:46:12 +0200 | [diff] [blame] | 1648 | EXPORT_SYMBOL_GPL(fib_table_lookup); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1649 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1650 | static void fib_remove_alias(struct trie *t, struct key_vector *tp, |
| 1651 | struct key_vector *l, struct fib_alias *old) |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1652 | { |
| 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 Duyck | a52ca62 | 2016-12-01 07:27:57 -0500 | [diff] [blame] | 1664 | if (tp->slen == l->slen) |
| 1665 | node_pull_suffix(tp, tp->pos); |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1666 | put_child_root(tp, l->key, NULL); |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1667 | 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 Duyck | 1a23917 | 2016-12-01 07:27:52 -0500 | [diff] [blame] | 1678 | node_pull_suffix(tp, fa->fa_slen); |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1679 | } |
| 1680 | |
Ido Schimmel | f613b6e | 2019-12-14 17:53:11 +0200 | [diff] [blame] | 1681 | static 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 Schimmel | 446f739 | 2019-12-14 17:53:15 +0200 | [diff] [blame] | 1701 | fib_event = FIB_EVENT_ENTRY_REPLACE; |
Ido Schimmel | f613b6e | 2019-12-14 17:53:11 +0200 | [diff] [blame] | 1702 | fa_to_notify = fa_next; |
| 1703 | } else { |
Ido Schimmel | 446f739 | 2019-12-14 17:53:15 +0200 | [diff] [blame] | 1704 | fib_event = FIB_EVENT_ENTRY_DEL; |
Ido Schimmel | f613b6e | 2019-12-14 17:53:11 +0200 | [diff] [blame] | 1705 | 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 Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1711 | /* Caller must hold RTNL. */ |
Jiri Pirko | b90eb75 | 2016-09-26 12:52:29 +0200 | [diff] [blame] | 1712 | int fib_table_delete(struct net *net, struct fib_table *tb, |
David Ahern | 7805599 | 2017-05-27 16:19:26 -0600 | [diff] [blame] | 1713 | struct fib_config *cfg, struct netlink_ext_ack *extack) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1714 | { |
| 1715 | struct trie *t = (struct trie *) tb->tb_data; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1716 | struct fib_alias *fa, *fa_to_delete; |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1717 | struct key_vector *l, *tp; |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1718 | u8 plen = cfg->fc_dst_len; |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 1719 | u8 slen = KEYLENGTH - plen; |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1720 | dscp_t dscp; |
Alexander Duyck | d4a975e | 2015-03-04 15:01:59 -0800 | [diff] [blame] | 1721 | u32 key; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1722 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1723 | key = ntohl(cfg->fc_dst); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1724 | |
David Ahern | 7805599 | 2017-05-27 16:19:26 -0600 | [diff] [blame] | 1725 | if (!fib_valid_key_len(key, plen, extack)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1726 | return -EINVAL; |
| 1727 | |
Alexander Duyck | d4a975e | 2015-03-04 15:01:59 -0800 | [diff] [blame] | 1728 | l = fib_find_node(t, &tp, key); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1729 | if (!l) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1730 | return -ESRCH; |
| 1731 | |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1732 | dscp = cfg->fc_dscp; |
| 1733 | fa = fib_find_alias(&l->leaf, slen, dscp, 0, tb->tb_id, false); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1734 | if (!fa) |
| 1735 | return -ESRCH; |
| 1736 | |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1737 | pr_debug("Deleting %08x/%d dsfield=0x%02x t=%p\n", key, plen, |
| 1738 | inet_dscp_to_dsfield(dscp), t); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1739 | |
| 1740 | fa_to_delete = NULL; |
Alexander Duyck | 56315f9 | 2015-02-25 15:31:31 -0800 | [diff] [blame] | 1741 | hlist_for_each_entry_from(fa, fa_list) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1742 | struct fib_info *fi = fa->fa_info; |
| 1743 | |
Alexander Duyck | 0b65bd9 | 2015-03-12 14:46:29 -0700 | [diff] [blame] | 1744 | if ((fa->fa_slen != slen) || |
| 1745 | (fa->tb_id != tb->tb_id) || |
Guillaume Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 1746 | (fa->fa_dscp != dscp)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1747 | break; |
| 1748 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1749 | if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) && |
| 1750 | (cfg->fc_scope == RT_SCOPE_NOWHERE || |
David S. Miller | 37e826c | 2011-03-24 18:06:47 -0700 | [diff] [blame] | 1751 | fa->fa_info->fib_scope == cfg->fc_scope) && |
Julian Anastasov | 74cb3c1 | 2011-03-19 12:13:46 +0000 | [diff] [blame] | 1752 | (!cfg->fc_prefsrc || |
| 1753 | fi->fib_prefsrc == cfg->fc_prefsrc) && |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1754 | (!cfg->fc_protocol || |
| 1755 | fi->fib_protocol == cfg->fc_protocol) && |
Alexander Aring | faee676 | 2020-03-27 18:00:21 -0400 | [diff] [blame] | 1756 | fib_nh_match(net, cfg, fi, extack) == 0 && |
Xin Long | 5f9ae3d | 2017-08-23 10:07:26 +0800 | [diff] [blame] | 1757 | fib_metrics_match(cfg, fi)) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1758 | fa_to_delete = fa; |
| 1759 | break; |
| 1760 | } |
| 1761 | } |
| 1762 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1763 | if (!fa_to_delete) |
| 1764 | return -ESRCH; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1765 | |
Ido Schimmel | f613b6e | 2019-12-14 17:53:11 +0200 | [diff] [blame] | 1766 | fib_notify_alias_delete(net, key, &l->leaf, fa_to_delete, extack); |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1767 | rtmsg_fib(RTM_DELROUTE, htonl(key), fa_to_delete, plen, tb->tb_id, |
Milan Kocian | b8f5583 | 2007-05-23 14:55:06 -0700 | [diff] [blame] | 1768 | &cfg->fc_nlinfo, 0); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1769 | |
David S. Miller | 21d8c49 | 2011-04-14 14:49:37 -0700 | [diff] [blame] | 1770 | if (!plen) |
| 1771 | tb->tb_num_default--; |
| 1772 | |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1773 | fib_remove_alias(t, tp, l, fa_to_delete); |
Alexander Duyck | 7289e6d | 2015-03-04 14:58:19 -0800 | [diff] [blame] | 1774 | |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1775 | if (fa_to_delete->fa_state & FA_S_ACCESSED) |
Nicolas Dichtel | 4ccfe6d | 2012-09-07 00:45:29 +0000 | [diff] [blame] | 1776 | rt_cache_flush(cfg->fc_nlinfo.nl_net); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1777 | |
Alexander Duyck | d5d6487 | 2015-03-04 15:02:18 -0800 | [diff] [blame] | 1778 | fib_release_info(fa_to_delete->fa_info); |
| 1779 | alias_free_mem_rcu(fa_to_delete); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1780 | return 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1781 | } |
| 1782 | |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1783 | /* Scan for the next leaf starting at the provided key value */ |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1784 | static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1785 | { |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 1786 | struct key_vector *pn, *n = *tn; |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1787 | unsigned long cindex; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1788 | |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1789 | /* this loop is meant to try and find the key in the trie */ |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1790 | do { |
| 1791 | /* record parent and next child index */ |
| 1792 | pn = n; |
Alexander Duyck | c2229fe | 2015-10-27 15:06:45 -0700 | [diff] [blame] | 1793 | cindex = (key > pn->key) ? get_index(key, pn) : 0; |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1794 | |
| 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 Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1802 | |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1803 | /* guarantee forward progress on the keys */ |
| 1804 | if (IS_LEAF(n) && (n->key >= key)) |
| 1805 | goto found; |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1806 | } while (IS_TNODE(n)); |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1807 | |
| 1808 | /* this loop will search for the next leaf with a greater key */ |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1809 | while (!IS_TRIE(pn)) { |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1810 | /* 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 Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1815 | cindex = get_index(pkey, pn) + 1; |
| 1816 | continue; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1817 | } |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1818 | |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1819 | /* grab the next available node */ |
Alexander Duyck | 754baf8d | 2015-03-06 09:54:14 -0800 | [diff] [blame] | 1820 | n = get_child_rcu(pn, cindex++); |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1821 | if (!n) |
| 1822 | continue; |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1823 | |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1824 | /* 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 Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1834 | return NULL; /* Root of trie */ |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1835 | found: |
| 1836 | /* if we are at the limit for keys just return NULL for the tnode */ |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 1837 | *tn = pn; |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 1838 | return n; |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1839 | } |
| 1840 | |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 1841 | static 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 | |
| 1899 | struct 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 Schimmel | 83f3522 | 2020-07-29 11:37:13 +0300 | [diff] [blame] | 1920 | hlist_for_each_entry(fa, &l->leaf, fa_list) { |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 1921 | 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 Duyck | 3114cdf | 2016-11-15 05:46:12 -0500 | [diff] [blame] | 1938 | NULL, l->key)) { |
| 1939 | kmem_cache_free(fn_alias_kmem, new_fa); |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 1940 | goto out; |
Alexander Duyck | 3114cdf | 2016-11-15 05:46:12 -0500 | [diff] [blame] | 1941 | } |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 1942 | } |
| 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; |
| 1951 | out: |
| 1952 | fib_trie_free(local_tb); |
| 1953 | |
| 1954 | return NULL; |
| 1955 | } |
| 1956 | |
Alexander Duyck | 3b70933 | 2016-11-15 05:46:06 -0500 | [diff] [blame] | 1957 | /* Caller must hold RTNL */ |
| 1958 | void 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 Duyck | a52ca62 | 2016-12-01 07:27:57 -0500 | [diff] [blame] | 1978 | /* update the suffix to address pulled leaves */ |
| 1979 | if (pn->slen > pn->pos) |
| 1980 | update_suffix(pn); |
| 1981 | |
Alexander Duyck | 3b70933 | 2016-11-15 05:46:06 -0500 | [diff] [blame] | 1982 | /* 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 Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2026 | /* Caller must hold RTNL. */ |
Ido Schimmel | f97f4dd | 2019-01-09 09:57:39 +0000 | [diff] [blame] | 2027 | int fib_table_flush(struct net *net, struct fib_table *tb, bool flush_all) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2028 | { |
Alexander Duyck | 7289e6d | 2015-03-04 14:58:19 -0800 | [diff] [blame] | 2029 | struct trie *t = (struct trie *)tb->tb_data; |
Hangbin Liu | 4b2b606 | 2023-09-22 15:55:08 +0800 | [diff] [blame] | 2030 | struct nl_info info = { .nl_net = net }; |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2031 | struct key_vector *pn = t->kv; |
| 2032 | unsigned long cindex = 1; |
Alexander Duyck | 7289e6d | 2015-03-04 14:58:19 -0800 | [diff] [blame] | 2033 | struct hlist_node *tmp; |
| 2034 | struct fib_alias *fa; |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 2035 | int found = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2036 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2037 | /* walk trie in reverse order */ |
| 2038 | for (;;) { |
| 2039 | unsigned char slen = 0; |
| 2040 | struct key_vector *n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2041 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2042 | if (!(cindex--)) { |
| 2043 | t_key pkey = pn->key; |
Alexander Duyck | 7289e6d | 2015-03-04 14:58:19 -0800 | [diff] [blame] | 2044 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2045 | /* cannot resize the trie vector */ |
| 2046 | if (IS_TRIE(pn)) |
| 2047 | break; |
Alexander Duyck | 7289e6d | 2015-03-04 14:58:19 -0800 | [diff] [blame] | 2048 | |
Alexander Duyck | a52ca62 | 2016-12-01 07:27:57 -0500 | [diff] [blame] | 2049 | /* update the suffix to address pulled leaves */ |
| 2050 | if (pn->slen > pn->pos) |
| 2051 | update_suffix(pn); |
| 2052 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2053 | /* resize completed node */ |
| 2054 | pn = resize(t, pn); |
| 2055 | cindex = get_index(pkey, pn); |
Alexander Duyck | 7289e6d | 2015-03-04 14:58:19 -0800 | [diff] [blame] | 2056 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2057 | continue; |
| 2058 | } |
Alexander Duyck | 7289e6d | 2015-03-04 14:58:19 -0800 | [diff] [blame] | 2059 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2060 | /* grab the next available node */ |
| 2061 | n = get_child(pn, cindex); |
| 2062 | if (!n) |
| 2063 | continue; |
Alexander Duyck | 7289e6d | 2015-03-04 14:58:19 -0800 | [diff] [blame] | 2064 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2065 | 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 Schimmel | f97f4dd | 2019-01-09 09:57:39 +0000 | [diff] [blame] | 2076 | 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 Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2087 | slen = fa->fa_slen; |
| 2088 | continue; |
Alexander Duyck | 7289e6d | 2015-03-04 14:58:19 -0800 | [diff] [blame] | 2089 | } |
| 2090 | |
Ido Schimmel | 525bc34 | 2019-12-14 17:53:12 +0200 | [diff] [blame] | 2091 | fib_notify_alias_delete(net, n->key, &n->leaf, fa, |
| 2092 | NULL); |
Hangbin Liu | 4b2b606 | 2023-09-22 15:55:08 +0800 | [diff] [blame] | 2093 | if (fi->pfsrc_removed) |
| 2094 | rtmsg_fib(RTM_DELROUTE, htonl(n->key), fa, |
| 2095 | KEYLENGTH - fa->fa_slen, tb->tb_id, &info, 0); |
Alexander Duyck | 7289e6d | 2015-03-04 14:58:19 -0800 | [diff] [blame] | 2096 | hlist_del_rcu(&fa->fa_list); |
| 2097 | fib_release_info(fa->fa_info); |
| 2098 | alias_free_mem_rcu(fa); |
| 2099 | found++; |
Alexander Duyck | 64c6272 | 2015-01-22 15:51:45 -0800 | [diff] [blame] | 2100 | } |
| 2101 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2102 | /* 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 Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2108 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2109 | } |
| 2110 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 2111 | pr_debug("trie_flush found=%d\n", found); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2112 | return found; |
| 2113 | } |
| 2114 | |
David Ahern | 1bff1a0 | 2019-05-22 12:04:42 -0700 | [diff] [blame] | 2115 | /* derived from fib_trie_free */ |
| 2116 | static 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 Ahern | 1bff1a0 | 2019-05-22 12:04:42 -0700 | [diff] [blame] | 2133 | 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 Ahern | 1bff1a0 | 2019-05-22 12:04:42 -0700 | [diff] [blame] | 2160 | } |
| 2161 | } |
| 2162 | } |
| 2163 | |
| 2164 | void 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 Schimmel | 7f6f32b | 2020-08-26 19:48:10 +0300 | [diff] [blame] | 2172 | hlist_for_each_entry_rcu(tb, head, tb_hlist, |
| 2173 | lockdep_rtnl_is_held()) |
David Ahern | 1bff1a0 | 2019-05-22 12:04:42 -0700 | [diff] [blame] | 2174 | __fib_info_notify_update(net, tb, info); |
| 2175 | } |
| 2176 | } |
| 2177 | |
Jiri Pirko | 55c894f | 2019-10-03 11:49:28 +0200 | [diff] [blame] | 2178 | static int fib_leaf_notify(struct key_vector *l, struct fib_table *tb, |
Jiri Pirko | b7a5955 | 2019-10-03 11:49:30 +0200 | [diff] [blame] | 2179 | struct notifier_block *nb, |
| 2180 | struct netlink_ext_ack *extack) |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2181 | { |
| 2182 | struct fib_alias *fa; |
Ido Schimmel | 20d1565 | 2019-12-14 17:53:13 +0200 | [diff] [blame] | 2183 | int last_slen = -1; |
Jiri Pirko | 55c894f | 2019-10-03 11:49:28 +0200 | [diff] [blame] | 2184 | int err; |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2185 | |
| 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 Schimmel | 20d1565 | 2019-12-14 17:53:13 +0200 | [diff] [blame] | 2198 | if (fa->fa_slen == last_slen) |
| 2199 | continue; |
| 2200 | |
| 2201 | last_slen = fa->fa_slen; |
Ido Schimmel | 446f739 | 2019-12-14 17:53:15 +0200 | [diff] [blame] | 2202 | err = call_fib_entry_notifier(nb, FIB_EVENT_ENTRY_REPLACE, |
Ido Schimmel | 20d1565 | 2019-12-14 17:53:13 +0200 | [diff] [blame] | 2203 | l->key, KEYLENGTH - fa->fa_slen, |
| 2204 | fa, extack); |
| 2205 | if (err) |
| 2206 | return err; |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2207 | } |
Jiri Pirko | 55c894f | 2019-10-03 11:49:28 +0200 | [diff] [blame] | 2208 | return 0; |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2209 | } |
| 2210 | |
Jiri Pirko | b7a5955 | 2019-10-03 11:49:30 +0200 | [diff] [blame] | 2211 | static int fib_table_notify(struct fib_table *tb, struct notifier_block *nb, |
| 2212 | struct netlink_ext_ack *extack) |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2213 | { |
| 2214 | struct trie *t = (struct trie *)tb->tb_data; |
| 2215 | struct key_vector *l, *tp = t->kv; |
| 2216 | t_key key = 0; |
Jiri Pirko | 55c894f | 2019-10-03 11:49:28 +0200 | [diff] [blame] | 2217 | int err; |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2218 | |
| 2219 | while ((l = leaf_walk_rcu(&tp, key)) != NULL) { |
Jiri Pirko | b7a5955 | 2019-10-03 11:49:30 +0200 | [diff] [blame] | 2220 | err = fib_leaf_notify(l, tb, nb, extack); |
Jiri Pirko | 55c894f | 2019-10-03 11:49:28 +0200 | [diff] [blame] | 2221 | if (err) |
| 2222 | return err; |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2223 | |
| 2224 | key = l->key + 1; |
| 2225 | /* stop in case of wrap around */ |
| 2226 | if (key < l->key) |
| 2227 | break; |
| 2228 | } |
Jiri Pirko | 55c894f | 2019-10-03 11:49:28 +0200 | [diff] [blame] | 2229 | return 0; |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2230 | } |
| 2231 | |
Jiri Pirko | b7a5955 | 2019-10-03 11:49:30 +0200 | [diff] [blame] | 2232 | int fib_notify(struct net *net, struct notifier_block *nb, |
| 2233 | struct netlink_ext_ack *extack) |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2234 | { |
| 2235 | unsigned int h; |
Jiri Pirko | 55c894f | 2019-10-03 11:49:28 +0200 | [diff] [blame] | 2236 | int err; |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2237 | |
| 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 Pirko | 55c894f | 2019-10-03 11:49:28 +0200 | [diff] [blame] | 2242 | hlist_for_each_entry_rcu(tb, head, tb_hlist) { |
Jiri Pirko | b7a5955 | 2019-10-03 11:49:30 +0200 | [diff] [blame] | 2243 | err = fib_table_notify(tb, nb, extack); |
Jiri Pirko | 55c894f | 2019-10-03 11:49:28 +0200 | [diff] [blame] | 2244 | if (err) |
| 2245 | return err; |
| 2246 | } |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2247 | } |
Jiri Pirko | 55c894f | 2019-10-03 11:49:28 +0200 | [diff] [blame] | 2248 | return 0; |
Ido Schimmel | c3852ef | 2016-12-03 16:45:07 +0100 | [diff] [blame] | 2249 | } |
| 2250 | |
Alexander Duyck | a7e5353 | 2015-03-04 15:02:44 -0800 | [diff] [blame] | 2251 | static void __trie_free_rcu(struct rcu_head *head) |
Pavel Emelyanov | 4aa2c46 | 2010-10-28 02:00:43 +0000 | [diff] [blame] | 2252 | { |
Alexander Duyck | a7e5353 | 2015-03-04 15:02:44 -0800 | [diff] [blame] | 2253 | struct fib_table *tb = container_of(head, struct fib_table, rcu); |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2254 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 2255 | struct trie *t = (struct trie *)tb->tb_data; |
| 2256 | |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 2257 | if (tb->tb_data == tb->__data) |
| 2258 | free_percpu(t->stats); |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2259 | #endif /* CONFIG_IP_FIB_TRIE_STATS */ |
Pavel Emelyanov | 4aa2c46 | 2010-10-28 02:00:43 +0000 | [diff] [blame] | 2260 | kfree(tb); |
| 2261 | } |
| 2262 | |
Alexander Duyck | a7e5353 | 2015-03-04 15:02:44 -0800 | [diff] [blame] | 2263 | void fib_free_table(struct fib_table *tb) |
| 2264 | { |
| 2265 | call_rcu(&tb->rcu, __trie_free_rcu); |
| 2266 | } |
| 2267 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2268 | static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb, |
David Ahern | 18a8021 | 2018-10-15 18:56:43 -0700 | [diff] [blame] | 2269 | struct sk_buff *skb, struct netlink_callback *cb, |
| 2270 | struct fib_dump_filter *filter) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2271 | { |
David Ahern | 18a8021 | 2018-10-15 18:56:43 -0700 | [diff] [blame] | 2272 | unsigned int flags = NLM_F_MULTI; |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2273 | __be32 xkey = htonl(l->key); |
Stefano Brivio | ee28906 | 2019-06-21 17:45:23 +0200 | [diff] [blame] | 2274 | int i, s_i, i_fa, s_fa, err; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2275 | struct fib_alias *fa; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2276 | |
Stefano Brivio | ee28906 | 2019-06-21 17:45:23 +0200 | [diff] [blame] | 2277 | if (filter->filter_set || |
| 2278 | !filter->dump_exceptions || !filter->dump_routes) |
David Ahern | 18a8021 | 2018-10-15 18:56:43 -0700 | [diff] [blame] | 2279 | flags |= NLM_F_DUMP_FILTERED; |
| 2280 | |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2281 | s_i = cb->args[4]; |
Stefano Brivio | ee28906 | 2019-06-21 17:45:23 +0200 | [diff] [blame] | 2282 | s_fa = cb->args[5]; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2283 | i = 0; |
| 2284 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 2285 | /* rcu_read_lock is hold by caller */ |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2286 | hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) { |
Stefano Brivio | ee28906 | 2019-06-21 17:45:23 +0200 | [diff] [blame] | 2287 | struct fib_info *fi = fa->fa_info; |
David Ahern | f6c5775 | 2017-05-15 23:19:17 -0700 | [diff] [blame] | 2288 | |
David Ahern | 18a8021 | 2018-10-15 18:56:43 -0700 | [diff] [blame] | 2289 | if (i < s_i) |
| 2290 | goto next; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2291 | |
Stefano Brivio | ee28906 | 2019-06-21 17:45:23 +0200 | [diff] [blame] | 2292 | i_fa = 0; |
| 2293 | |
David Ahern | 18a8021 | 2018-10-15 18:56:43 -0700 | [diff] [blame] | 2294 | 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 Brivio | ee28906 | 2019-06-21 17:45:23 +0200 | [diff] [blame] | 2302 | fi->fib_protocol != filter->protocol)) |
David Ahern | 18a8021 | 2018-10-15 18:56:43 -0700 | [diff] [blame] | 2303 | goto next; |
| 2304 | |
| 2305 | if (filter->dev && |
Stefano Brivio | ee28906 | 2019-06-21 17:45:23 +0200 | [diff] [blame] | 2306 | !fib_info_nh_uses_dev(fi, filter->dev)) |
David Ahern | 18a8021 | 2018-10-15 18:56:43 -0700 | [diff] [blame] | 2307 | goto next; |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 2308 | } |
| 2309 | |
Stefano Brivio | 885b8b4 | 2019-06-29 19:55:08 +0200 | [diff] [blame] | 2310 | if (filter->dump_routes) { |
| 2311 | if (!s_fa) { |
Ido Schimmel | 1e301fd | 2020-01-14 13:23:10 +0200 | [diff] [blame] | 2312 | 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 Nault | 888ade8 | 2022-04-08 22:08:37 +0200 | [diff] [blame] | 2318 | fri.dscp = fa->fa_dscp; |
Ido Schimmel | 1e301fd | 2020-01-14 13:23:10 +0200 | [diff] [blame] | 2319 | fri.type = fa->fa_type; |
Eric Dumazet | 9fcf986 | 2022-02-16 09:32:16 -0800 | [diff] [blame] | 2320 | fri.offload = READ_ONCE(fa->offload); |
| 2321 | fri.trap = READ_ONCE(fa->trap); |
| 2322 | fri.offload_failed = READ_ONCE(fa->offload_failed); |
Stefano Brivio | 885b8b4 | 2019-06-29 19:55:08 +0200 | [diff] [blame] | 2323 | err = fib_dump_info(skb, |
| 2324 | NETLINK_CB(cb->skb).portid, |
| 2325 | cb->nlh->nlmsg_seq, |
Ido Schimmel | 1e301fd | 2020-01-14 13:23:10 +0200 | [diff] [blame] | 2326 | RTM_NEWROUTE, &fri, flags); |
Stefano Brivio | 885b8b4 | 2019-06-29 19:55:08 +0200 | [diff] [blame] | 2327 | if (err < 0) |
| 2328 | goto stop; |
| 2329 | } |
| 2330 | |
Stefano Brivio | ee28906 | 2019-06-21 17:45:23 +0200 | [diff] [blame] | 2331 | i_fa++; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2332 | } |
Stefano Brivio | ee28906 | 2019-06-21 17:45:23 +0200 | [diff] [blame] | 2333 | |
| 2334 | if (filter->dump_exceptions) { |
| 2335 | err = fib_dump_info_fnhe(skb, cb, tb->tb_id, fi, |
John Fastabend | e93fb3e | 2019-08-23 17:11:38 -0700 | [diff] [blame] | 2336 | &i_fa, s_fa, flags); |
Stefano Brivio | ee28906 | 2019-06-21 17:45:23 +0200 | [diff] [blame] | 2337 | if (err < 0) |
| 2338 | goto stop; |
| 2339 | } |
| 2340 | |
David Ahern | 18a8021 | 2018-10-15 18:56:43 -0700 | [diff] [blame] | 2341 | next: |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 2342 | i++; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2343 | } |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 2344 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 2345 | cb->args[4] = i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2346 | return skb->len; |
Stefano Brivio | ee28906 | 2019-06-21 17:45:23 +0200 | [diff] [blame] | 2347 | |
| 2348 | stop: |
| 2349 | cb->args[4] = i; |
| 2350 | cb->args[5] = i_fa; |
| 2351 | return err; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2352 | } |
| 2353 | |
Alexander Duyck | a7e5353 | 2015-03-04 15:02:44 -0800 | [diff] [blame] | 2354 | /* rcu_read_lock needs to be hold by caller from readside */ |
Stephen Hemminger | 16c6cf8 | 2009-09-20 10:35:36 +0000 | [diff] [blame] | 2355 | int fib_table_dump(struct fib_table *tb, struct sk_buff *skb, |
David Ahern | 18a8021 | 2018-10-15 18:56:43 -0700 | [diff] [blame] | 2356 | struct netlink_callback *cb, struct fib_dump_filter *filter) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2357 | { |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2358 | struct trie *t = (struct trie *)tb->tb_data; |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2359 | struct key_vector *l, *tp = t->kv; |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 2360 | /* Dump starting at last key. |
| 2361 | * Note: 0.0.0.0/0 (ie default) is first key. |
| 2362 | */ |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2363 | int count = cb->args[2]; |
| 2364 | t_key key = cb->args[3]; |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 2365 | |
David Ahern | 9827c06 | 2020-01-10 09:03:58 -0800 | [diff] [blame] | 2366 | /* 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 Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2372 | while ((l = leaf_walk_rcu(&tp, key)) != NULL) { |
David Ahern | f6c5775 | 2017-05-15 23:19:17 -0700 | [diff] [blame] | 2373 | int err; |
| 2374 | |
David Ahern | 18a8021 | 2018-10-15 18:56:43 -0700 | [diff] [blame] | 2375 | err = fn_trie_dump_leaf(l, tb, skb, cb, filter); |
David Ahern | f6c5775 | 2017-05-15 23:19:17 -0700 | [diff] [blame] | 2376 | if (err < 0) { |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2377 | cb->args[3] = key; |
| 2378 | cb->args[2] = count; |
David Ahern | f6c5775 | 2017-05-15 23:19:17 -0700 | [diff] [blame] | 2379 | return err; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2380 | } |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 2381 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 2382 | ++count; |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2383 | key = l->key + 1; |
| 2384 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 2385 | memset(&cb->args[4], 0, |
| 2386 | sizeof(cb->args) - 4*sizeof(cb->args[0])); |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2387 | |
| 2388 | /* stop loop if key wrapped back to 0 */ |
| 2389 | if (key < l->key) |
| 2390 | break; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2391 | } |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2392 | |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2393 | cb->args[3] = key; |
| 2394 | cb->args[2] = count; |
| 2395 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2396 | return skb->len; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2397 | } |
| 2398 | |
David S. Miller | 5348ba8 | 2011-02-01 15:30:56 -0800 | [diff] [blame] | 2399 | void __init fib_trie_init(void) |
Stephen Hemminger | 7f9b805 | 2008-01-14 23:14:20 -0800 | [diff] [blame] | 2400 | { |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2401 | fn_alias_kmem = kmem_cache_create("ip_fib_alias", |
| 2402 | sizeof(struct fib_alias), |
Vasily Averin | 6126891 | 2021-07-19 13:44:31 +0300 | [diff] [blame] | 2403 | 0, SLAB_PANIC | SLAB_ACCOUNT, NULL); |
Stephen Hemminger | bc3c8c1 | 2008-01-22 21:51:50 -0800 | [diff] [blame] | 2404 | |
| 2405 | trie_leaf_kmem = kmem_cache_create("ip_fib_trie", |
Alexander Duyck | 41b489f | 2015-03-04 15:02:33 -0800 | [diff] [blame] | 2406 | LEAF_SIZE, |
Vasily Averin | 6126891 | 2021-07-19 13:44:31 +0300 | [diff] [blame] | 2407 | 0, SLAB_PANIC | SLAB_ACCOUNT, NULL); |
Stephen Hemminger | 7f9b805 | 2008-01-14 23:14:20 -0800 | [diff] [blame] | 2408 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2409 | |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 2410 | struct fib_table *fib_trie_table(u32 id, struct fib_table *alias) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2411 | { |
| 2412 | struct fib_table *tb; |
| 2413 | struct trie *t; |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 2414 | size_t sz = sizeof(*tb); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2415 | |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 2416 | if (!alias) |
| 2417 | sz += sizeof(struct trie); |
| 2418 | |
| 2419 | tb = kzalloc(sz, GFP_KERNEL); |
Ian Morris | 51456b2 | 2015-04-03 09:17:26 +0100 | [diff] [blame] | 2420 | if (!tb) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2421 | return NULL; |
| 2422 | |
| 2423 | tb->tb_id = id; |
David S. Miller | 21d8c49 | 2011-04-14 14:49:37 -0700 | [diff] [blame] | 2424 | tb->tb_num_default = 0; |
Alexander Duyck | 0ddcf43 | 2015-03-06 13:47:00 -0800 | [diff] [blame] | 2425 | tb->tb_data = (alias ? alias->__data : tb->__data); |
| 2426 | |
| 2427 | if (alias) |
| 2428 | return tb; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2429 | |
| 2430 | t = (struct trie *) tb->tb_data; |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2431 | t->kv[0].pos = KEYLENGTH; |
| 2432 | t->kv[0].slen = KEYLENGTH; |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2433 | #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 Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2440 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2441 | return tb; |
| 2442 | } |
| 2443 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2444 | #ifdef CONFIG_PROC_FS |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2445 | /* Depth first Trie walk iterator */ |
| 2446 | struct fib_trie_iter { |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2447 | struct seq_net_private p; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2448 | struct fib_table *tb; |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2449 | struct key_vector *tnode; |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2450 | unsigned int index; |
| 2451 | unsigned int depth; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2452 | }; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2453 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2454 | static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2455 | { |
Alexander Duyck | 98293e8 | 2014-12-31 10:56:18 -0800 | [diff] [blame] | 2456 | unsigned long cindex = iter->index; |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2457 | struct key_vector *pn = iter->tnode; |
| 2458 | t_key pkey; |
Eric W. Biederman | 6640e69 | 2007-01-24 14:42:04 -0800 | [diff] [blame] | 2459 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2460 | pr_debug("get_next iter={node=%p index=%d depth=%d}\n", |
| 2461 | iter->tnode, iter->index, iter->depth); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2462 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2463 | 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 Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2470 | if (IS_LEAF(n)) { |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2471 | iter->tnode = pn; |
| 2472 | iter->index = cindex; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2473 | } else { |
| 2474 | /* push down one level */ |
Alexander Duyck | adaf981 | 2014-12-31 10:55:47 -0800 | [diff] [blame] | 2475 | iter->tnode = n; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2476 | iter->index = 0; |
| 2477 | ++iter->depth; |
| 2478 | } |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2479 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2480 | return n; |
| 2481 | } |
| 2482 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2483 | /* Current node exhausted, pop back up */ |
| 2484 | pkey = pn->key; |
| 2485 | pn = node_parent_rcu(pn); |
| 2486 | cindex = get_index(pkey, pn) + 1; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2487 | --iter->depth; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2488 | } |
| 2489 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2490 | /* record root node so further searches know we are done */ |
| 2491 | iter->tnode = pn; |
| 2492 | iter->index = 0; |
| 2493 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2494 | return NULL; |
| 2495 | } |
| 2496 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2497 | static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter, |
| 2498 | struct trie *t) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2499 | { |
Firo Yang | f38b24c | 2015-06-08 11:54:51 +0800 | [diff] [blame] | 2500 | struct key_vector *n, *pn; |
Robert Olsson | 5ddf0eb | 2006-03-20 21:34:12 -0800 | [diff] [blame] | 2501 | |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 2502 | if (!t) |
Robert Olsson | 5ddf0eb | 2006-03-20 21:34:12 -0800 | [diff] [blame] | 2503 | return NULL; |
| 2504 | |
Firo Yang | f38b24c | 2015-06-08 11:54:51 +0800 | [diff] [blame] | 2505 | pn = t->kv; |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2506 | n = rcu_dereference(pn->tnode[0]); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2507 | if (!n) |
Robert Olsson | 5ddf0eb | 2006-03-20 21:34:12 -0800 | [diff] [blame] | 2508 | return NULL; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2509 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2510 | if (IS_TNODE(n)) { |
Alexander Duyck | adaf981 | 2014-12-31 10:55:47 -0800 | [diff] [blame] | 2511 | iter->tnode = n; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2512 | iter->index = 0; |
| 2513 | iter->depth = 1; |
| 2514 | } else { |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2515 | iter->tnode = pn; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2516 | iter->index = 0; |
| 2517 | iter->depth = 0; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2518 | } |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2519 | |
| 2520 | return n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2521 | } |
| 2522 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2523 | static void trie_collect_stats(struct trie *t, struct trie_stat *s) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2524 | { |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2525 | struct key_vector *n; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2526 | struct fib_trie_iter iter; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2527 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2528 | memset(s, 0, sizeof(*s)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2529 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2530 | rcu_read_lock(); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2531 | for (n = fib_trie_get_first(&iter, t); n; n = fib_trie_get_next(&iter)) { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2532 | if (IS_LEAF(n)) { |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2533 | struct fib_alias *fa; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2534 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2535 | s->leaves++; |
| 2536 | s->totdepth += iter.depth; |
| 2537 | if (iter.depth > s->maxdepth) |
| 2538 | s->maxdepth = iter.depth; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2539 | |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2540 | hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2541 | ++s->prefixes; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2542 | } else { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2543 | s->tnodes++; |
Alexander Duyck | adaf981 | 2014-12-31 10:55:47 -0800 | [diff] [blame] | 2544 | if (n->bits < MAX_STAT_DEPTH) |
| 2545 | s->nodesizes[n->bits]++; |
Alexander Duyck | 6e22d17 | 2015-03-06 09:54:39 -0800 | [diff] [blame] | 2546 | s->nullpointers += tn_info(n)->empty_children; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2547 | } |
| 2548 | } |
| 2549 | rcu_read_unlock(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2550 | } |
| 2551 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 2552 | /* |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2553 | * This outputs /proc/net/fib_triestats |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2554 | */ |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2555 | static void trie_show_stats(struct seq_file *seq, struct trie_stat *stat) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2556 | { |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2557 | unsigned int i, max, pointers, bytes, avdepth; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2558 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2559 | if (stat->leaves) |
| 2560 | avdepth = stat->totdepth*100 / stat->leaves; |
| 2561 | else |
| 2562 | avdepth = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2563 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2564 | seq_printf(seq, "\tAver depth: %u.%02d\n", |
| 2565 | avdepth / 100, avdepth % 100); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2566 | seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2567 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2568 | seq_printf(seq, "\tLeaves: %u\n", stat->leaves); |
Alexander Duyck | 41b489f | 2015-03-04 15:02:33 -0800 | [diff] [blame] | 2569 | bytes = LEAF_SIZE * stat->leaves; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2570 | |
| 2571 | seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes); |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2572 | bytes += sizeof(struct fib_alias) * stat->prefixes; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2573 | |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2574 | seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes); |
Alexander Duyck | 41b489f | 2015-03-04 15:02:33 -0800 | [diff] [blame] | 2575 | bytes += TNODE_SIZE(0) * stat->tnodes; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2576 | |
Robert Olsson | 06ef921 | 2006-03-20 21:35:01 -0800 | [diff] [blame] | 2577 | max = MAX_STAT_DEPTH; |
| 2578 | while (max > 0 && stat->nodesizes[max-1] == 0) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2579 | max--; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2580 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2581 | pointers = 0; |
Jerry Snitselaar | f585a99 | 2013-07-22 12:01:58 -0700 | [diff] [blame] | 2582 | for (i = 1; i < max; i++) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2583 | if (stat->nodesizes[i] != 0) { |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2584 | seq_printf(seq, " %u: %u", i, stat->nodesizes[i]); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2585 | pointers += (1<<i) * stat->nodesizes[i]; |
| 2586 | } |
| 2587 | seq_putc(seq, '\n'); |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2588 | seq_printf(seq, "\tPointers: %u\n", pointers); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2589 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2590 | bytes += sizeof(struct key_vector *) * pointers; |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2591 | seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers); |
| 2592 | seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024); |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2593 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2594 | |
| 2595 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2596 | static void trie_show_usage(struct seq_file *seq, |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2597 | const struct trie_use_stats __percpu *stats) |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2598 | { |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2599 | 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 Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2614 | seq_printf(seq, "\nCounters:\n---------\n"); |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2615 | seq_printf(seq, "gets = %u\n", s.gets); |
| 2616 | seq_printf(seq, "backtracks = %u\n", s.backtrack); |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2617 | seq_printf(seq, "semantic match passed = %u\n", |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2618 | 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 Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2622 | } |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2623 | #endif /* CONFIG_IP_FIB_TRIE_STATS */ |
| 2624 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2625 | static void fib_table_print(struct seq_file *seq, struct fib_table *tb) |
Stephen Hemminger | d717a9a | 2008-01-14 23:11:54 -0800 | [diff] [blame] | 2626 | { |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2627 | 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 Hemminger | d717a9a | 2008-01-14 23:11:54 -0800 | [diff] [blame] | 2633 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2634 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2635 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2636 | static int fib_triestat_seq_show(struct seq_file *seq, void *v) |
| 2637 | { |
Yu Zhe | 2e47eec | 2022-04-28 19:14:04 -0700 | [diff] [blame] | 2638 | struct net *net = seq->private; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2639 | unsigned int h; |
Eric W. Biederman | 877a9bf | 2007-12-07 00:47:47 -0800 | [diff] [blame] | 2640 | |
Stephen Hemminger | d717a9a | 2008-01-14 23:11:54 -0800 | [diff] [blame] | 2641 | seq_printf(seq, |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2642 | "Basic info: size of leaf:" |
Alexey Dobriyan | 5b5e092 | 2017-02-27 14:30:02 -0800 | [diff] [blame] | 2643 | " %zd bytes, size of tnode: %zd bytes.\n", |
Alexander Duyck | 41b489f | 2015-03-04 15:02:33 -0800 | [diff] [blame] | 2644 | LEAF_SIZE, TNODE_SIZE(0)); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 2645 | |
Qian Cai | fbe4e0c | 2020-03-25 18:01:00 -0400 | [diff] [blame] | 2646 | rcu_read_lock(); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2647 | for (h = 0; h < FIB_TABLE_HASHSZ; h++) { |
| 2648 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2649 | struct fib_table *tb; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2650 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 2651 | hlist_for_each_entry_rcu(tb, head, tb_hlist) { |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2652 | 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 Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2663 | trie_show_usage(seq, t->stats); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2664 | #endif |
| 2665 | } |
Qian Cai | fbe4e0c | 2020-03-25 18:01:00 -0400 | [diff] [blame] | 2666 | cond_resched_rcu(); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2667 | } |
Qian Cai | fbe4e0c | 2020-03-25 18:01:00 -0400 | [diff] [blame] | 2668 | rcu_read_unlock(); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2669 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2670 | return 0; |
| 2671 | } |
| 2672 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2673 | static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2674 | { |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2675 | struct fib_trie_iter *iter = seq->private; |
| 2676 | struct net *net = seq_file_net(seq); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2677 | loff_t idx = 0; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2678 | unsigned int h; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2679 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2680 | for (h = 0; h < FIB_TABLE_HASHSZ; h++) { |
| 2681 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2682 | struct fib_table *tb; |
| 2683 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 2684 | hlist_for_each_entry_rcu(tb, head, tb_hlist) { |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2685 | struct key_vector *n; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2686 | |
| 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 Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2695 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2696 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2697 | return NULL; |
| 2698 | } |
| 2699 | |
| 2700 | static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos) |
Stephen Hemminger | c95aaf9 | 2008-01-12 21:25:02 -0800 | [diff] [blame] | 2701 | __acquires(RCU) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2702 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2703 | rcu_read_lock(); |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2704 | return fib_trie_get_idx(seq, *pos); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2705 | } |
| 2706 | |
| 2707 | static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
| 2708 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2709 | struct fib_trie_iter *iter = seq->private; |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2710 | struct net *net = seq_file_net(seq); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2711 | struct fib_table *tb = iter->tb; |
| 2712 | struct hlist_node *tb_node; |
| 2713 | unsigned int h; |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2714 | struct key_vector *n; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2715 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2716 | ++*pos; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2717 | /* next node in same table */ |
| 2718 | n = fib_trie_get_next(iter); |
| 2719 | if (n) |
| 2720 | return n; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 2721 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2722 | /* walk rest of this hash chain */ |
| 2723 | h = tb->tb_id & (FIB_TABLE_HASHSZ - 1); |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 2724 | while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) { |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2725 | 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 Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2730 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2731 | /* new hash chain */ |
| 2732 | while (++h < FIB_TABLE_HASHSZ) { |
| 2733 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 2734 | hlist_for_each_entry_rcu(tb, head, tb_hlist) { |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2735 | n = fib_trie_get_first(iter, (struct trie *) tb->tb_data); |
| 2736 | if (n) |
| 2737 | goto found; |
| 2738 | } |
| 2739 | } |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2740 | return NULL; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2741 | |
| 2742 | found: |
| 2743 | iter->tb = tb; |
| 2744 | return n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2745 | } |
| 2746 | |
| 2747 | static void fib_trie_seq_stop(struct seq_file *seq, void *v) |
Stephen Hemminger | c95aaf9 | 2008-01-12 21:25:02 -0800 | [diff] [blame] | 2748 | __releases(RCU) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2749 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2750 | rcu_read_unlock(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2751 | } |
| 2752 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2753 | static void seq_indent(struct seq_file *seq, int n) |
| 2754 | { |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2755 | while (n-- > 0) |
| 2756 | seq_puts(seq, " "); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2757 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2758 | |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2759 | static inline const char *rtn_scope(char *buf, size_t len, enum rt_scope_t s) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2760 | { |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 2761 | switch (s) { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2762 | 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 Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2768 | snprintf(buf, len, "scope=%d", s); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2769 | return buf; |
| 2770 | } |
| 2771 | } |
| 2772 | |
Jan Engelhardt | 36cbd3d | 2009-08-05 10:42:58 -0700 | [diff] [blame] | 2773 | static const char *const rtn_type_names[__RTN_MAX] = { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2774 | [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 Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2788 | static inline const char *rtn_type(char *buf, size_t len, unsigned int t) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2789 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2790 | if (t < __RTN_MAX && rtn_type_names[t]) |
| 2791 | return rtn_type_names[t]; |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2792 | snprintf(buf, len, "type %u", t); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2793 | return buf; |
| 2794 | } |
| 2795 | |
| 2796 | /* Pretty print the trie */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2797 | static int fib_trie_seq_show(struct seq_file *seq, void *v) |
| 2798 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2799 | const struct fib_trie_iter *iter = seq->private; |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2800 | struct key_vector *n = v; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2801 | |
Alexander Duyck | 88bae71 | 2015-03-06 09:54:52 -0800 | [diff] [blame] | 2802 | if (IS_TRIE(node_parent_rcu(n))) |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2803 | fib_table_print(seq, iter->tb); |
Robert Olsson | 095b850 | 2007-01-26 19:06:01 -0800 | [diff] [blame] | 2804 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2805 | if (IS_TNODE(n)) { |
Alexander Duyck | adaf981 | 2014-12-31 10:55:47 -0800 | [diff] [blame] | 2806 | __be32 prf = htonl(n->key); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2807 | |
Alexander Duyck | e9b4401 | 2014-12-31 10:56:12 -0800 | [diff] [blame] | 2808 | 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 Duyck | 6e22d17 | 2015-03-06 09:54:39 -0800 | [diff] [blame] | 2811 | tn_info(n)->full_children, |
| 2812 | tn_info(n)->empty_children); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 2813 | } else { |
Alexander Duyck | adaf981 | 2014-12-31 10:55:47 -0800 | [diff] [blame] | 2814 | __be32 val = htonl(n->key); |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2815 | struct fib_alias *fa; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2816 | |
| 2817 | seq_indent(seq, iter->depth); |
Harvey Harrison | 673d57e | 2008-10-31 00:53:57 -0700 | [diff] [blame] | 2818 | seq_printf(seq, " |-- %pI4\n", &val); |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2819 | |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2820 | hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) { |
| 2821 | char buf1[32], buf2[32]; |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2822 | |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2823 | 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 Nault | 32ccf11 | 2022-02-04 14:58:19 +0100 | [diff] [blame] | 2830 | if (fa->fa_dscp) |
| 2831 | seq_printf(seq, " tos=%d", |
| 2832 | inet_dscp_to_dsfield(fa->fa_dscp)); |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2833 | seq_putc(seq, '\n'); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2834 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2835 | } |
| 2836 | |
| 2837 | return 0; |
| 2838 | } |
| 2839 | |
Stephen Hemminger | f690808 | 2007-03-12 14:34:29 -0700 | [diff] [blame] | 2840 | static const struct seq_operations fib_trie_seq_ops = { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2841 | .start = fib_trie_seq_start, |
| 2842 | .next = fib_trie_seq_next, |
| 2843 | .stop = fib_trie_seq_stop, |
| 2844 | .show = fib_trie_seq_show, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2845 | }; |
| 2846 | |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2847 | struct fib_route_iter { |
| 2848 | struct seq_net_private p; |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2849 | struct fib_table *main_tb; |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2850 | struct key_vector *tnode; |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2851 | loff_t pos; |
| 2852 | t_key key; |
| 2853 | }; |
| 2854 | |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2855 | static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter, |
| 2856 | loff_t pos) |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2857 | { |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2858 | struct key_vector *l, **tp = &iter->tnode; |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2859 | t_key key; |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2860 | |
Alexander Duyck | fd0285a | 2016-11-04 15:11:57 -0400 | [diff] [blame] | 2861 | /* use cached location of previously found key */ |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2862 | if (iter->pos > 0 && pos >= iter->pos) { |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2863 | key = iter->key; |
| 2864 | } else { |
Alexander Duyck | fd0285a | 2016-11-04 15:11:57 -0400 | [diff] [blame] | 2865 | iter->pos = 1; |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2866 | key = 0; |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2867 | } |
| 2868 | |
Alexander Duyck | fd0285a | 2016-11-04 15:11:57 -0400 | [diff] [blame] | 2869 | pos -= iter->pos; |
| 2870 | |
| 2871 | while ((l = leaf_walk_rcu(tp, key)) && (pos-- > 0)) { |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2872 | key = l->key + 1; |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2873 | iter->pos++; |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2874 | l = NULL; |
| 2875 | |
| 2876 | /* handle unlikely case of a key wrap */ |
| 2877 | if (!key) |
| 2878 | break; |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2879 | } |
| 2880 | |
| 2881 | if (l) |
Alexander Duyck | fd0285a | 2016-11-04 15:11:57 -0400 | [diff] [blame] | 2882 | iter->key = l->key; /* remember it */ |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2883 | else |
| 2884 | iter->pos = 0; /* forget it */ |
| 2885 | |
| 2886 | return l; |
| 2887 | } |
| 2888 | |
| 2889 | static 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 Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2894 | struct trie *t; |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2895 | |
| 2896 | rcu_read_lock(); |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2897 | |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2898 | tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN); |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2899 | if (!tb) |
| 2900 | return NULL; |
| 2901 | |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2902 | iter->main_tb = tb; |
David Forster | 94d9f1c | 2016-08-03 15:13:01 +0100 | [diff] [blame] | 2903 | t = (struct trie *)tb->tb_data; |
| 2904 | iter->tnode = t->kv; |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2905 | |
| 2906 | if (*pos != 0) |
| 2907 | return fib_route_get_idx(iter, *pos); |
| 2908 | |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2909 | iter->pos = 0; |
Alexander Duyck | fd0285a | 2016-11-04 15:11:57 -0400 | [diff] [blame] | 2910 | iter->key = KEY_MAX; |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2911 | |
| 2912 | return SEQ_START_TOKEN; |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2913 | } |
| 2914 | |
| 2915 | static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
| 2916 | { |
| 2917 | struct fib_route_iter *iter = seq->private; |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2918 | struct key_vector *l = NULL; |
Alexander Duyck | fd0285a | 2016-11-04 15:11:57 -0400 | [diff] [blame] | 2919 | t_key key = iter->key + 1; |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2920 | |
| 2921 | ++*pos; |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2922 | |
| 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 Duyck | fd0285a | 2016-11-04 15:11:57 -0400 | [diff] [blame] | 2928 | iter->key = l->key; |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2929 | iter->pos++; |
Alexander Duyck | 8be33e9 | 2015-03-04 14:59:19 -0800 | [diff] [blame] | 2930 | } else { |
| 2931 | iter->pos = 0; |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2932 | } |
| 2933 | |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2934 | return l; |
| 2935 | } |
| 2936 | |
| 2937 | static void fib_route_seq_stop(struct seq_file *seq, void *v) |
| 2938 | __releases(RCU) |
| 2939 | { |
| 2940 | rcu_read_unlock(); |
| 2941 | } |
| 2942 | |
David Ahern | 5481d73 | 2019-06-03 20:19:49 -0700 | [diff] [blame] | 2943 | static unsigned int fib_flag_trans(int type, __be32 mask, struct fib_info *fi) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2944 | { |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2945 | unsigned int flags = 0; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2946 | |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2947 | if (type == RTN_UNREACHABLE || type == RTN_PROHIBIT) |
| 2948 | flags = RTF_REJECT; |
David Ahern | 5481d73 | 2019-06-03 20:19:49 -0700 | [diff] [blame] | 2949 | if (fi) { |
David Ahern | dcb1ecb | 2019-06-03 20:19:50 -0700 | [diff] [blame] | 2950 | const struct fib_nh_common *nhc = fib_info_nhc(fi, 0); |
David Ahern | 5481d73 | 2019-06-03 20:19:49 -0700 | [diff] [blame] | 2951 | |
David Ahern | dcb1ecb | 2019-06-03 20:19:50 -0700 | [diff] [blame] | 2952 | if (nhc->nhc_gw.ipv4) |
David Ahern | 5481d73 | 2019-06-03 20:19:49 -0700 | [diff] [blame] | 2953 | flags |= RTF_GATEWAY; |
| 2954 | } |
Al Viro | 32ab5f8 | 2006-09-26 22:21:45 -0700 | [diff] [blame] | 2955 | if (mask == htonl(0xFFFFFFFF)) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2956 | 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 Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2964 | * and needs to be same as fib_hash output to avoid breaking |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2965 | * legacy utilities |
| 2966 | */ |
| 2967 | static int fib_route_seq_show(struct seq_file *seq, void *v) |
| 2968 | { |
Alexander Duyck | 654eff4 | 2015-03-11 16:36:08 -0700 | [diff] [blame] | 2969 | struct fib_route_iter *iter = seq->private; |
| 2970 | struct fib_table *tb = iter->main_tb; |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2971 | struct fib_alias *fa; |
Alexander Duyck | 35c6eda | 2015-03-06 09:54:08 -0800 | [diff] [blame] | 2972 | struct key_vector *l = v; |
Alexander Duyck | 9b6ebad | 2015-02-25 15:31:44 -0800 | [diff] [blame] | 2973 | __be32 prefix; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2974 | |
| 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 Duyck | 9b6ebad | 2015-02-25 15:31:44 -0800 | [diff] [blame] | 2982 | prefix = htonl(l->key); |
| 2983 | |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2984 | hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) { |
David Ahern | 5481d73 | 2019-06-03 20:19:49 -0700 | [diff] [blame] | 2985 | struct fib_info *fi = fa->fa_info; |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2986 | __be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen); |
| 2987 | unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2988 | |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2989 | if ((fa->fa_type == RTN_BROADCAST) || |
| 2990 | (fa->fa_type == RTN_MULTICAST)) |
| 2991 | continue; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2992 | |
Alexander Duyck | 654eff4 | 2015-03-11 16:36:08 -0700 | [diff] [blame] | 2993 | if (fa->tb_id != tb->tb_id) |
| 2994 | continue; |
| 2995 | |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 2996 | seq_setwidth(seq, 127); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2997 | |
David Ahern | 5481d73 | 2019-06-03 20:19:49 -0700 | [diff] [blame] | 2998 | if (fi) { |
David Ahern | dcb1ecb | 2019-06-03 20:19:50 -0700 | [diff] [blame] | 2999 | 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 Ahern | 5481d73 | 2019-06-03 20:19:49 -0700 | [diff] [blame] | 3004 | |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 3005 | 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 Ahern | dcb1ecb | 2019-06-03 20:19:50 -0700 | [diff] [blame] | 3008 | nhc->nhc_dev ? nhc->nhc_dev->name : "*", |
| 3009 | prefix, gw, flags, 0, 0, |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 3010 | 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 Ahern | 5481d73 | 2019-06-03 20:19:49 -0700 | [diff] [blame] | 3016 | } else { |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 3017 | 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 Ahern | 5481d73 | 2019-06-03 20:19:49 -0700 | [diff] [blame] | 3022 | } |
Alexander Duyck | 79e5ad2 | 2015-02-25 15:31:51 -0800 | [diff] [blame] | 3023 | seq_pad(seq, '\n'); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 3024 | } |
| 3025 | |
| 3026 | return 0; |
| 3027 | } |
| 3028 | |
Stephen Hemminger | f690808 | 2007-03-12 14:34:29 -0700 | [diff] [blame] | 3029 | static const struct seq_operations fib_route_seq_ops = { |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 3030 | .start = fib_route_seq_start, |
| 3031 | .next = fib_route_seq_next, |
| 3032 | .stop = fib_route_seq_stop, |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 3033 | .show = fib_route_seq_show, |
| 3034 | }; |
| 3035 | |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 3036 | int __net_init fib_proc_init(struct net *net) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 3037 | { |
Christoph Hellwig | c350637 | 2018-04-10 19:42:55 +0200 | [diff] [blame] | 3038 | if (!proc_create_net("fib_trie", 0444, net->proc_net, &fib_trie_seq_ops, |
| 3039 | sizeof(struct fib_trie_iter))) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 3040 | goto out1; |
| 3041 | |
Christoph Hellwig | 3617d94 | 2018-04-13 20:38:35 +0200 | [diff] [blame] | 3042 | if (!proc_create_net_single("fib_triestat", 0444, net->proc_net, |
| 3043 | fib_triestat_seq_show, NULL)) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 3044 | goto out2; |
| 3045 | |
Christoph Hellwig | c350637 | 2018-04-10 19:42:55 +0200 | [diff] [blame] | 3046 | if (!proc_create_net("route", 0444, net->proc_net, &fib_route_seq_ops, |
| 3047 | sizeof(struct fib_route_iter))) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 3048 | goto out3; |
| 3049 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 3050 | return 0; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 3051 | |
| 3052 | out3: |
Gao feng | ece31ff | 2013-02-18 01:34:56 +0000 | [diff] [blame] | 3053 | remove_proc_entry("fib_triestat", net->proc_net); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 3054 | out2: |
Gao feng | ece31ff | 2013-02-18 01:34:56 +0000 | [diff] [blame] | 3055 | remove_proc_entry("fib_trie", net->proc_net); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 3056 | out1: |
| 3057 | return -ENOMEM; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 3058 | } |
| 3059 | |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 3060 | void __net_exit fib_proc_exit(struct net *net) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 3061 | { |
Gao feng | ece31ff | 2013-02-18 01:34:56 +0000 | [diff] [blame] | 3062 | 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 Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 3065 | } |
| 3066 | |
| 3067 | #endif /* CONFIG_PROC_FS */ |