Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1 | /* |
| 2 | * This program is free software; you can redistribute it and/or |
| 3 | * modify it under the terms of the GNU General Public License |
| 4 | * as published by the Free Software Foundation; either version |
| 5 | * 2 of the License, or (at your option) any later version. |
| 6 | * |
| 7 | * Robert Olsson <robert.olsson@its.uu.se> Uppsala Universitet |
| 8 | * & Swedish University of Agricultural Sciences. |
| 9 | * |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 10 | * Jens Laas <jens.laas@data.slu.se> Swedish University of |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 11 | * Agricultural Sciences. |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 12 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 13 | * Hans Liss <hans.liss@its.uu.se> Uppsala Universitet |
| 14 | * |
Lucas De Marchi | 25985ed | 2011-03-30 22:57:33 -0300 | [diff] [blame] | 15 | * 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] | 16 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 17 | * An experimental study of compression methods for dynamic tries |
| 18 | * Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002. |
Justin P. Mattock | 631dd1a | 2010-10-18 11:03:14 +0200 | [diff] [blame] | 19 | * http://www.csc.kth.se/~snilsson/software/dyntrie2/ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 20 | * |
| 21 | * |
| 22 | * IP-address lookup using LC-tries. Stefan Nilsson and Gunnar Karlsson |
| 23 | * IEEE Journal on Selected Areas in Communications, 17(6):1083-1092, June 1999 |
| 24 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 25 | * |
| 26 | * Code from fib_hash has been reused which includes the following header: |
| 27 | * |
| 28 | * |
| 29 | * INET An implementation of the TCP/IP protocol suite for the LINUX |
| 30 | * operating system. INET is implemented using the BSD Socket |
| 31 | * interface as the means of communication with the user level. |
| 32 | * |
| 33 | * IPv4 FIB: lookup engine and maintenance routines. |
| 34 | * |
| 35 | * |
| 36 | * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru> |
| 37 | * |
| 38 | * This program is free software; you can redistribute it and/or |
| 39 | * modify it under the terms of the GNU General Public License |
| 40 | * as published by the Free Software Foundation; either version |
| 41 | * 2 of the License, or (at your option) any later version. |
Robert Olsson | fd96625 | 2005-12-22 11:25:10 -0800 | [diff] [blame] | 42 | * |
| 43 | * Substantial contributions to this work comes from: |
| 44 | * |
| 45 | * David S. Miller, <davem@davemloft.net> |
| 46 | * Stephen Hemminger <shemminger@osdl.org> |
| 47 | * Paul E. McKenney <paulmck@us.ibm.com> |
| 48 | * Patrick McHardy <kaber@trash.net> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 49 | */ |
| 50 | |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 51 | #define VERSION "0.409" |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 52 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 53 | #include <asm/uaccess.h> |
Jiri Slaby | 1977f03 | 2007-10-18 23:40:25 -0700 | [diff] [blame] | 54 | #include <linux/bitops.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 55 | #include <linux/types.h> |
| 56 | #include <linux/kernel.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 57 | #include <linux/mm.h> |
| 58 | #include <linux/string.h> |
| 59 | #include <linux/socket.h> |
| 60 | #include <linux/sockios.h> |
| 61 | #include <linux/errno.h> |
| 62 | #include <linux/in.h> |
| 63 | #include <linux/inet.h> |
Stephen Hemminger | cd8787a | 2006-01-03 14:38:34 -0800 | [diff] [blame] | 64 | #include <linux/inetdevice.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 65 | #include <linux/netdevice.h> |
| 66 | #include <linux/if_arp.h> |
| 67 | #include <linux/proc_fs.h> |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 68 | #include <linux/rcupdate.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 69 | #include <linux/skbuff.h> |
| 70 | #include <linux/netlink.h> |
| 71 | #include <linux/init.h> |
| 72 | #include <linux/list.h> |
Tejun Heo | 5a0e3ad | 2010-03-24 17:04:11 +0900 | [diff] [blame] | 73 | #include <linux/slab.h> |
Paul Gortmaker | bc3b2d7 | 2011-07-15 11:47:34 -0400 | [diff] [blame] | 74 | #include <linux/export.h> |
Eric W. Biederman | 457c4cb | 2007-09-12 12:01:34 +0200 | [diff] [blame] | 75 | #include <net/net_namespace.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 76 | #include <net/ip.h> |
| 77 | #include <net/protocol.h> |
| 78 | #include <net/route.h> |
| 79 | #include <net/tcp.h> |
| 80 | #include <net/sock.h> |
| 81 | #include <net/ip_fib.h> |
| 82 | #include "fib_lookup.h" |
| 83 | |
Robert Olsson | 06ef921 | 2006-03-20 21:35:01 -0800 | [diff] [blame] | 84 | #define MAX_STAT_DEPTH 32 |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 85 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 86 | #define KEYLENGTH (8*sizeof(t_key)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 87 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 88 | typedef unsigned int t_key; |
| 89 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 90 | #define IS_TNODE(n) ((n)->bits) |
| 91 | #define IS_LEAF(n) (!(n)->bits) |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 92 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 93 | struct tnode { |
| 94 | t_key key; |
| 95 | unsigned char bits; /* 2log(KEYLENGTH) bits needed */ |
| 96 | unsigned char pos; /* 2log(KEYLENGTH) bits needed */ |
| 97 | struct tnode __rcu *parent; |
| 98 | union { |
| 99 | struct rcu_head rcu; |
| 100 | struct tnode *tnode_free; |
| 101 | }; |
| 102 | unsigned int full_children; /* KEYLENGTH bits needed */ |
| 103 | unsigned int empty_children; /* KEYLENGTH bits needed */ |
| 104 | struct rt_trie_node __rcu *child[0]; |
| 105 | }; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 106 | |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 107 | struct rt_trie_node { |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 108 | t_key key; |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 109 | unsigned char bits; |
| 110 | unsigned char pos; |
| 111 | struct tnode __rcu *parent; |
| 112 | struct rcu_head rcu; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 113 | }; |
| 114 | |
| 115 | struct leaf { |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 116 | t_key key; |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 117 | unsigned char bits; |
| 118 | unsigned char pos; |
| 119 | struct tnode __rcu *parent; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 120 | struct rcu_head rcu; |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 121 | struct hlist_head list; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 122 | }; |
| 123 | |
| 124 | struct leaf_info { |
| 125 | struct hlist_node hlist; |
| 126 | int plen; |
Eric Dumazet | 5c74501 | 2011-07-18 03:16:33 +0000 | [diff] [blame] | 127 | u32 mask_plen; /* ntohl(inet_make_mask(plen)) */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 128 | struct list_head falh; |
Eric Dumazet | 5c74501 | 2011-07-18 03:16:33 +0000 | [diff] [blame] | 129 | struct rcu_head rcu; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 130 | }; |
| 131 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 132 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 133 | struct trie_use_stats { |
| 134 | unsigned int gets; |
| 135 | unsigned int backtrack; |
| 136 | unsigned int semantic_match_passed; |
| 137 | unsigned int semantic_match_miss; |
| 138 | unsigned int null_node_hit; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 139 | unsigned int resize_node_skipped; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 140 | }; |
| 141 | #endif |
| 142 | |
| 143 | struct trie_stat { |
| 144 | unsigned int totdepth; |
| 145 | unsigned int maxdepth; |
| 146 | unsigned int tnodes; |
| 147 | unsigned int leaves; |
| 148 | unsigned int nullpointers; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 149 | unsigned int prefixes; |
Robert Olsson | 06ef921 | 2006-03-20 21:35:01 -0800 | [diff] [blame] | 150 | unsigned int nodesizes[MAX_STAT_DEPTH]; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 151 | }; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 152 | |
| 153 | struct trie { |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 154 | struct rt_trie_node __rcu *trie; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 155 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 156 | struct trie_use_stats __percpu *stats; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 157 | #endif |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 158 | }; |
| 159 | |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 160 | static void tnode_put_child_reorg(struct tnode *tn, int i, struct rt_trie_node *n, |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 161 | int wasfull); |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 162 | static struct rt_trie_node *resize(struct trie *t, struct tnode *tn); |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 163 | static struct tnode *inflate(struct trie *t, struct tnode *tn); |
| 164 | static struct tnode *halve(struct trie *t, struct tnode *tn); |
Jarek Poplawski | e0f7cb8 | 2009-06-15 02:31:29 -0700 | [diff] [blame] | 165 | /* tnodes to free after resize(); protected by RTNL */ |
| 166 | static struct tnode *tnode_free_head; |
Jarek Poplawski | c305947 | 2009-07-14 08:33:08 +0000 | [diff] [blame] | 167 | static size_t tnode_free_size; |
| 168 | |
| 169 | /* |
| 170 | * synchronize_rcu after call_rcu for that many pages; it should be especially |
| 171 | * useful before resizing the root node with PREEMPT_NONE configs; the value was |
| 172 | * obtained experimentally, aiming to avoid visible slowdown. |
| 173 | */ |
| 174 | static const int sync_pages = 128; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 175 | |
Christoph Lameter | e18b890 | 2006-12-06 20:33:20 -0800 | [diff] [blame] | 176 | static struct kmem_cache *fn_alias_kmem __read_mostly; |
Stephen Hemminger | bc3c8c1 | 2008-01-22 21:51:50 -0800 | [diff] [blame] | 177 | static struct kmem_cache *trie_leaf_kmem __read_mostly; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 178 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 179 | /* caller must hold RTNL */ |
| 180 | #define node_parent(n) rtnl_dereference((n)->parent) |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 181 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 182 | /* caller must hold RCU read lock or RTNL */ |
| 183 | #define node_parent_rcu(n) rcu_dereference_rtnl((n)->parent) |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 184 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 185 | /* wrapper for rcu_assign_pointer */ |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 186 | static inline void node_set_parent(struct rt_trie_node *node, struct tnode *ptr) |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 187 | { |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 188 | if (node) |
| 189 | rcu_assign_pointer(node->parent, ptr); |
| 190 | } |
| 191 | |
| 192 | #define NODE_INIT_PARENT(n, p) RCU_INIT_POINTER((n)->parent, p) |
| 193 | |
| 194 | /* This provides us with the number of children in this node, in the case of a |
| 195 | * leaf this will return 0 meaning none of the children are accessible. |
| 196 | */ |
| 197 | static inline int tnode_child_length(const struct tnode *tn) |
| 198 | { |
| 199 | return (1ul << tn->bits) & ~(1ul); |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 200 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 201 | |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 202 | /* |
| 203 | * caller must hold RTNL |
| 204 | */ |
| 205 | static inline struct rt_trie_node *tnode_get_child(const struct tnode *tn, unsigned int i) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 206 | { |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 207 | BUG_ON(i >= tnode_child_length(tn)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 208 | |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 209 | return rtnl_dereference(tn->child[i]); |
Eric Dumazet | b59cfbf | 2008-01-18 03:31:36 -0800 | [diff] [blame] | 210 | } |
| 211 | |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 212 | /* |
| 213 | * caller must hold RCU read lock or RTNL |
| 214 | */ |
| 215 | static inline struct rt_trie_node *tnode_get_child_rcu(const struct tnode *tn, unsigned int i) |
Eric Dumazet | b59cfbf | 2008-01-18 03:31:36 -0800 | [diff] [blame] | 216 | { |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 217 | BUG_ON(i >= tnode_child_length(tn)); |
Eric Dumazet | b59cfbf | 2008-01-18 03:31:36 -0800 | [diff] [blame] | 218 | |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 219 | return rcu_dereference_rtnl(tn->child[i]); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 220 | } |
| 221 | |
David S. Miller | 3b00456 | 2011-02-16 14:56:22 -0800 | [diff] [blame] | 222 | static inline t_key mask_pfx(t_key k, unsigned int l) |
Stephen Hemminger | ab66b4a | 2007-08-10 15:22:58 -0700 | [diff] [blame] | 223 | { |
| 224 | return (l == 0) ? 0 : k >> (KEYLENGTH-l) << (KEYLENGTH-l); |
| 225 | } |
| 226 | |
David S. Miller | 3b00456 | 2011-02-16 14:56:22 -0800 | [diff] [blame] | 227 | static inline t_key tkey_extract_bits(t_key a, unsigned int offset, unsigned int bits) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 228 | { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 229 | if (offset < KEYLENGTH) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 230 | return ((t_key)(a << offset)) >> (KEYLENGTH - bits); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 231 | else |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 232 | return 0; |
| 233 | } |
| 234 | |
| 235 | static inline int tkey_equals(t_key a, t_key b) |
| 236 | { |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 237 | return a == b; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 238 | } |
| 239 | |
| 240 | static inline int tkey_sub_equals(t_key a, int offset, int bits, t_key b) |
| 241 | { |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 242 | if (bits == 0 || offset >= KEYLENGTH) |
| 243 | return 1; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 244 | bits = bits > KEYLENGTH ? KEYLENGTH : bits; |
| 245 | return ((a ^ b) << offset) >> (KEYLENGTH - bits) == 0; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 246 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 247 | |
| 248 | static inline int tkey_mismatch(t_key a, int offset, t_key b) |
| 249 | { |
| 250 | t_key diff = a ^ b; |
| 251 | int i = offset; |
| 252 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 253 | if (!diff) |
| 254 | return 0; |
| 255 | while ((diff << i) >> (KEYLENGTH-1) == 0) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 256 | i++; |
| 257 | return i; |
| 258 | } |
| 259 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 260 | /* |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 261 | To understand this stuff, an understanding of keys and all their bits is |
| 262 | necessary. Every node in the trie has a key associated with it, but not |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 263 | all of the bits in that key are significant. |
| 264 | |
| 265 | Consider a node 'n' and its parent 'tp'. |
| 266 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 267 | If n is a leaf, every bit in its key is significant. Its presence is |
| 268 | necessitated by path compression, since during a tree traversal (when |
| 269 | searching for a leaf - unless we are doing an insertion) we will completely |
| 270 | ignore all skipped bits we encounter. Thus we need to verify, at the end of |
| 271 | a potentially successful search, that we have indeed been walking the |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 272 | correct key path. |
| 273 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 274 | Note that we can never "miss" the correct key in the tree if present by |
| 275 | following the wrong path. Path compression ensures that segments of the key |
| 276 | that are the same for all keys with a given prefix are skipped, but the |
| 277 | skipped part *is* identical for each node in the subtrie below the skipped |
| 278 | bit! trie_insert() in this implementation takes care of that - note the |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 279 | call to tkey_sub_equals() in trie_insert(). |
| 280 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 281 | if n is an internal node - a 'tnode' here, the various parts of its key |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 282 | have many different meanings. |
| 283 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 284 | Example: |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 285 | _________________________________________________________________ |
| 286 | | i | i | i | i | i | i | i | N | N | N | S | S | S | S | S | C | |
| 287 | ----------------------------------------------------------------- |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 288 | 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 289 | |
| 290 | _________________________________________________________________ |
| 291 | | C | C | C | u | u | u | u | u | u | u | u | u | u | u | u | u | |
| 292 | ----------------------------------------------------------------- |
| 293 | 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 |
| 294 | |
| 295 | tp->pos = 7 |
| 296 | tp->bits = 3 |
| 297 | n->pos = 15 |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 298 | n->bits = 4 |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 299 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 300 | First, let's just ignore the bits that come before the parent tp, that is |
| 301 | the bits from 0 to (tp->pos-1). They are *known* but at this point we do |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 302 | not use them for anything. |
| 303 | |
| 304 | The bits from (tp->pos) to (tp->pos + tp->bits - 1) - "N", above - are the |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 305 | index into the parent's child array. That is, they will be used to find |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 306 | 'n' among tp's children. |
| 307 | |
| 308 | The bits from (tp->pos + tp->bits) to (n->pos - 1) - "S" - are skipped bits |
| 309 | for the node n. |
| 310 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 311 | All the bits we have seen so far are significant to the node n. The rest |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 312 | of the bits are really not needed or indeed known in n->key. |
| 313 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 314 | The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 315 | n's child array, and will of course be different for each child. |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 316 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 317 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 318 | The rest of the bits, from (n->pos + n->bits) onward, are completely unknown |
| 319 | at this point. |
| 320 | |
| 321 | */ |
| 322 | |
Denis V. Lunev | f5026fa | 2007-12-13 09:47:57 -0800 | [diff] [blame] | 323 | static const int halve_threshold = 25; |
| 324 | static const int inflate_threshold = 50; |
Jarek Poplawski | 345aa03 | 2009-07-07 19:39:16 -0700 | [diff] [blame] | 325 | static const int halve_threshold_root = 15; |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 326 | static const int inflate_threshold_root = 30; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 327 | |
| 328 | static void __alias_free_mem(struct rcu_head *head) |
| 329 | { |
| 330 | struct fib_alias *fa = container_of(head, struct fib_alias, rcu); |
| 331 | kmem_cache_free(fn_alias_kmem, fa); |
| 332 | } |
| 333 | |
| 334 | static inline void alias_free_mem_rcu(struct fib_alias *fa) |
| 335 | { |
| 336 | call_rcu(&fa->rcu, __alias_free_mem); |
| 337 | } |
| 338 | |
| 339 | static void __leaf_free_rcu(struct rcu_head *head) |
| 340 | { |
Stephen Hemminger | bc3c8c1 | 2008-01-22 21:51:50 -0800 | [diff] [blame] | 341 | struct leaf *l = container_of(head, struct leaf, rcu); |
| 342 | kmem_cache_free(trie_leaf_kmem, l); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 343 | } |
| 344 | |
Stephen Hemminger | 387a548 | 2008-04-10 03:47:34 -0700 | [diff] [blame] | 345 | static inline void free_leaf(struct leaf *l) |
| 346 | { |
Eric Dumazet | 0c03eca | 2012-08-07 00:47:11 +0000 | [diff] [blame] | 347 | call_rcu(&l->rcu, __leaf_free_rcu); |
Stephen Hemminger | 387a548 | 2008-04-10 03:47:34 -0700 | [diff] [blame] | 348 | } |
| 349 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 350 | static inline void free_leaf_info(struct leaf_info *leaf) |
| 351 | { |
Lai Jiangshan | bceb0f4 | 2011-03-18 11:42:34 +0800 | [diff] [blame] | 352 | kfree_rcu(leaf, rcu); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 353 | } |
| 354 | |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 355 | static struct tnode *tnode_alloc(size_t size) |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 356 | { |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 357 | if (size <= PAGE_SIZE) |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 358 | return kzalloc(size, GFP_KERNEL); |
Stephen Hemminger | 15be75c | 2008-04-10 02:56:38 -0700 | [diff] [blame] | 359 | else |
Eric Dumazet | 7a1c8e5 | 2010-11-20 07:46:35 +0000 | [diff] [blame] | 360 | return vzalloc(size); |
Stephen Hemminger | 15be75c | 2008-04-10 02:56:38 -0700 | [diff] [blame] | 361 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 362 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 363 | static void __tnode_free_rcu(struct rcu_head *head) |
| 364 | { |
| 365 | struct tnode *tn = container_of(head, struct tnode, rcu); |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 366 | size_t size = sizeof(struct tnode) + |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 367 | (sizeof(struct rt_trie_node *) << tn->bits); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 368 | |
| 369 | if (size <= PAGE_SIZE) |
| 370 | kfree(tn); |
Al Viro | 0020356 | 2013-05-05 16:03:46 +0000 | [diff] [blame] | 371 | else |
| 372 | vfree(tn); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 373 | } |
| 374 | |
| 375 | static inline void tnode_free(struct tnode *tn) |
| 376 | { |
Stephen Hemminger | 387a548 | 2008-04-10 03:47:34 -0700 | [diff] [blame] | 377 | if (IS_LEAF(tn)) |
| 378 | free_leaf((struct leaf *) tn); |
| 379 | else |
Robert Olsson | 550e29b | 2006-04-04 12:53:35 -0700 | [diff] [blame] | 380 | call_rcu(&tn->rcu, __tnode_free_rcu); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 381 | } |
| 382 | |
Jarek Poplawski | e0f7cb8 | 2009-06-15 02:31:29 -0700 | [diff] [blame] | 383 | static void tnode_free_safe(struct tnode *tn) |
| 384 | { |
| 385 | BUG_ON(IS_LEAF(tn)); |
Jarek Poplawski | 7b85576 | 2009-06-18 00:28:51 -0700 | [diff] [blame] | 386 | tn->tnode_free = tnode_free_head; |
| 387 | tnode_free_head = tn; |
Jarek Poplawski | c305947 | 2009-07-14 08:33:08 +0000 | [diff] [blame] | 388 | tnode_free_size += sizeof(struct tnode) + |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 389 | (sizeof(struct rt_trie_node *) << tn->bits); |
Jarek Poplawski | e0f7cb8 | 2009-06-15 02:31:29 -0700 | [diff] [blame] | 390 | } |
| 391 | |
| 392 | static void tnode_free_flush(void) |
| 393 | { |
| 394 | struct tnode *tn; |
| 395 | |
| 396 | while ((tn = tnode_free_head)) { |
| 397 | tnode_free_head = tn->tnode_free; |
| 398 | tn->tnode_free = NULL; |
| 399 | tnode_free(tn); |
| 400 | } |
Jarek Poplawski | c305947 | 2009-07-14 08:33:08 +0000 | [diff] [blame] | 401 | |
| 402 | if (tnode_free_size >= PAGE_SIZE * sync_pages) { |
| 403 | tnode_free_size = 0; |
| 404 | synchronize_rcu(); |
| 405 | } |
Jarek Poplawski | e0f7cb8 | 2009-06-15 02:31:29 -0700 | [diff] [blame] | 406 | } |
| 407 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 408 | static struct leaf *leaf_new(t_key key) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 409 | { |
Stephen Hemminger | bc3c8c1 | 2008-01-22 21:51:50 -0800 | [diff] [blame] | 410 | struct leaf *l = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 411 | if (l) { |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 412 | l->parent = NULL; |
| 413 | /* set key and pos to reflect full key value |
| 414 | * any trailing zeros in the key should be ignored |
| 415 | * as the nodes are searched |
| 416 | */ |
| 417 | l->key = key; |
| 418 | l->pos = KEYLENGTH; |
| 419 | /* set bits to 0 indicating we are not a tnode */ |
| 420 | l->bits = 0; |
| 421 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 422 | INIT_HLIST_HEAD(&l->list); |
| 423 | } |
| 424 | return l; |
| 425 | } |
| 426 | |
| 427 | static struct leaf_info *leaf_info_new(int plen) |
| 428 | { |
| 429 | struct leaf_info *li = kmalloc(sizeof(struct leaf_info), GFP_KERNEL); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 430 | if (li) { |
| 431 | li->plen = plen; |
Eric Dumazet | 5c74501 | 2011-07-18 03:16:33 +0000 | [diff] [blame] | 432 | li->mask_plen = ntohl(inet_make_mask(plen)); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 433 | INIT_LIST_HEAD(&li->falh); |
Patrick McHardy | f0e36f8 | 2005-07-05 14:44:55 -0700 | [diff] [blame] | 434 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 435 | return li; |
Patrick McHardy | f0e36f8 | 2005-07-05 14:44:55 -0700 | [diff] [blame] | 436 | } |
| 437 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 438 | static struct tnode *tnode_new(t_key key, int pos, int bits) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 439 | { |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 440 | size_t sz = sizeof(struct tnode) + (sizeof(struct rt_trie_node *) << bits); |
Patrick McHardy | f0e36f8 | 2005-07-05 14:44:55 -0700 | [diff] [blame] | 441 | struct tnode *tn = tnode_alloc(sz); |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 442 | unsigned int shift = pos + bits; |
| 443 | |
| 444 | /* verify bits and pos their msb bits clear and values are valid */ |
| 445 | BUG_ON(!bits || (shift > KEYLENGTH)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 446 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 447 | if (tn) { |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 448 | tn->parent = NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 449 | tn->pos = pos; |
| 450 | tn->bits = bits; |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 451 | tn->key = mask_pfx(key, pos); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 452 | tn->full_children = 0; |
| 453 | tn->empty_children = 1<<bits; |
| 454 | } |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 455 | |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 456 | pr_debug("AT %p s=%zu %zu\n", tn, sizeof(struct tnode), |
Lin Ming | 4ea4bf7 | 2012-07-29 01:19:55 +0000 | [diff] [blame] | 457 | sizeof(struct rt_trie_node *) << bits); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 458 | return tn; |
| 459 | } |
| 460 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 461 | /* |
| 462 | * Check whether a tnode 'n' is "full", i.e. it is an internal node |
| 463 | * and no bits are skipped. See discussion in dyntree paper p. 6 |
| 464 | */ |
| 465 | |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 466 | static inline int tnode_full(const struct tnode *tn, const struct rt_trie_node *n) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 467 | { |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 468 | return n && IS_TNODE(n) && (n->pos == (tn->pos + tn->bits)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 469 | } |
| 470 | |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 471 | static inline void put_child(struct tnode *tn, int i, |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 472 | struct rt_trie_node *n) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 473 | { |
| 474 | tnode_put_child_reorg(tn, i, n, -1); |
| 475 | } |
| 476 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 477 | /* |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 478 | * Add a child at position i overwriting the old value. |
| 479 | * Update the value of full_children and empty_children. |
| 480 | */ |
| 481 | |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 482 | static void tnode_put_child_reorg(struct tnode *tn, int i, struct rt_trie_node *n, |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 483 | int wasfull) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 484 | { |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 485 | struct rt_trie_node *chi = rtnl_dereference(tn->child[i]); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 486 | int isfull; |
| 487 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 488 | BUG_ON(i >= 1<<tn->bits); |
| 489 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 490 | /* update emptyChildren */ |
| 491 | if (n == NULL && chi != NULL) |
| 492 | tn->empty_children++; |
| 493 | else if (n != NULL && chi == NULL) |
| 494 | tn->empty_children--; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 495 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 496 | /* update fullChildren */ |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 497 | if (wasfull == -1) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 498 | wasfull = tnode_full(tn, chi); |
| 499 | |
| 500 | isfull = tnode_full(tn, n); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 501 | if (wasfull && !isfull) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 502 | tn->full_children--; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 503 | else if (!wasfull && isfull) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 504 | tn->full_children++; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 505 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 506 | node_set_parent(n, tn); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 507 | |
Eric Dumazet | cf778b0 | 2012-01-12 04:41:32 +0000 | [diff] [blame] | 508 | rcu_assign_pointer(tn->child[i], n); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 509 | } |
| 510 | |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 511 | #define MAX_WORK 10 |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 512 | static struct rt_trie_node *resize(struct trie *t, struct tnode *tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 513 | { |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 514 | struct rt_trie_node *n = NULL; |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 515 | struct tnode *old_tn; |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 516 | int inflate_threshold_use; |
| 517 | int halve_threshold_use; |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 518 | int max_work; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 519 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 520 | if (!tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 521 | return NULL; |
| 522 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 523 | pr_debug("In tnode_resize %p inflate_threshold=%d threshold=%d\n", |
| 524 | tn, inflate_threshold, halve_threshold); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 525 | |
| 526 | /* No children */ |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 527 | if (tn->empty_children > (tnode_child_length(tn) - 1)) |
| 528 | goto no_children; |
| 529 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 530 | /* One child */ |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 531 | if (tn->empty_children == (tnode_child_length(tn) - 1)) |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 532 | goto one_child; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 533 | /* |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 534 | * Double as long as the resulting node has a number of |
| 535 | * nonempty nodes that are above the threshold. |
| 536 | */ |
| 537 | |
| 538 | /* |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 539 | * From "Implementing a dynamic compressed trie" by Stefan Nilsson of |
| 540 | * the Helsinki University of Technology and Matti Tikkanen of Nokia |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 541 | * Telecommunications, page 6: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 542 | * "A node is doubled if the ratio of non-empty children to all |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 543 | * children in the *doubled* node is at least 'high'." |
| 544 | * |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 545 | * 'high' in this instance is the variable 'inflate_threshold'. It |
| 546 | * is expressed as a percentage, so we multiply it with |
| 547 | * tnode_child_length() and instead of multiplying by 2 (since the |
| 548 | * child array will be doubled by inflate()) and multiplying |
| 549 | * the left-hand side by 100 (to handle the percentage thing) we |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 550 | * multiply the left-hand side by 50. |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 551 | * |
| 552 | * The left-hand side may look a bit weird: tnode_child_length(tn) |
| 553 | * - tn->empty_children is of course the number of non-null children |
| 554 | * in the current node. tn->full_children is the number of "full" |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 555 | * children, that is non-null tnodes with a skip value of 0. |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 556 | * All of those will be doubled in the resulting inflated tnode, so |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 557 | * we just count them one extra time here. |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 558 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 559 | * A clearer way to write this would be: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 560 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 561 | * to_be_doubled = tn->full_children; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 562 | * not_to_be_doubled = tnode_child_length(tn) - tn->empty_children - |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 563 | * tn->full_children; |
| 564 | * |
| 565 | * new_child_length = tnode_child_length(tn) * 2; |
| 566 | * |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 567 | * new_fill_factor = 100 * (not_to_be_doubled + 2*to_be_doubled) / |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 568 | * new_child_length; |
| 569 | * if (new_fill_factor >= inflate_threshold) |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 570 | * |
| 571 | * ...and so on, tho it would mess up the while () loop. |
| 572 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 573 | * anyway, |
| 574 | * 100 * (not_to_be_doubled + 2*to_be_doubled) / new_child_length >= |
| 575 | * inflate_threshold |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 576 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 577 | * avoid a division: |
| 578 | * 100 * (not_to_be_doubled + 2*to_be_doubled) >= |
| 579 | * inflate_threshold * new_child_length |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 580 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 581 | * expand not_to_be_doubled and to_be_doubled, and shorten: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 582 | * 100 * (tnode_child_length(tn) - tn->empty_children + |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 583 | * tn->full_children) >= inflate_threshold * new_child_length |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 584 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 585 | * expand new_child_length: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 586 | * 100 * (tnode_child_length(tn) - tn->empty_children + |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 587 | * tn->full_children) >= |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 588 | * inflate_threshold * tnode_child_length(tn) * 2 |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 589 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 590 | * shorten again: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 591 | * 50 * (tn->full_children + tnode_child_length(tn) - |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 592 | * tn->empty_children) >= inflate_threshold * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 593 | * tnode_child_length(tn) |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 594 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 595 | */ |
| 596 | |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 597 | /* Keep root node larger */ |
| 598 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 599 | if (!node_parent(tn)) { |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 600 | inflate_threshold_use = inflate_threshold_root; |
| 601 | halve_threshold_use = halve_threshold_root; |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 602 | } else { |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 603 | inflate_threshold_use = inflate_threshold; |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 604 | halve_threshold_use = halve_threshold; |
| 605 | } |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 606 | |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 607 | max_work = MAX_WORK; |
| 608 | while ((tn->full_children > 0 && max_work-- && |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 609 | 50 * (tn->full_children + tnode_child_length(tn) |
| 610 | - tn->empty_children) |
| 611 | >= inflate_threshold_use * tnode_child_length(tn))) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 612 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 613 | old_tn = tn; |
| 614 | tn = inflate(t, tn); |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 615 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 616 | if (IS_ERR(tn)) { |
| 617 | tn = old_tn; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 618 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 619 | this_cpu_inc(t->stats->resize_node_skipped); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 620 | #endif |
| 621 | break; |
| 622 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 623 | } |
| 624 | |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 625 | /* Return if at least one inflate is run */ |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 626 | if (max_work != MAX_WORK) |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 627 | return (struct rt_trie_node *) tn; |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 628 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 629 | /* |
| 630 | * Halve as long as the number of empty children in this |
| 631 | * node is above threshold. |
| 632 | */ |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 633 | |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 634 | max_work = MAX_WORK; |
| 635 | while (tn->bits > 1 && max_work-- && |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 636 | 100 * (tnode_child_length(tn) - tn->empty_children) < |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 637 | halve_threshold_use * tnode_child_length(tn)) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 638 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 639 | old_tn = tn; |
| 640 | tn = halve(t, tn); |
| 641 | if (IS_ERR(tn)) { |
| 642 | tn = old_tn; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 643 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 644 | this_cpu_inc(t->stats->resize_node_skipped); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 645 | #endif |
| 646 | break; |
| 647 | } |
| 648 | } |
| 649 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 650 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 651 | /* Only one child remains */ |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 652 | if (tn->empty_children == (tnode_child_length(tn) - 1)) { |
| 653 | unsigned long i; |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 654 | one_child: |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 655 | for (i = tnode_child_length(tn); !n && i;) |
| 656 | n = tnode_get_child(tn, --i); |
| 657 | no_children: |
| 658 | /* compress one level */ |
| 659 | node_set_parent(n, NULL); |
| 660 | tnode_free_safe(tn); |
| 661 | return n; |
Jens Låås | 80b71b8 | 2009-08-28 23:57:15 -0700 | [diff] [blame] | 662 | } |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 663 | return (struct rt_trie_node *) tn; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 664 | } |
| 665 | |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 666 | |
| 667 | static void tnode_clean_free(struct tnode *tn) |
| 668 | { |
| 669 | int i; |
| 670 | struct tnode *tofree; |
| 671 | |
| 672 | for (i = 0; i < tnode_child_length(tn); i++) { |
| 673 | tofree = (struct tnode *)rtnl_dereference(tn->child[i]); |
| 674 | if (tofree) |
| 675 | tnode_free(tofree); |
| 676 | } |
| 677 | tnode_free(tn); |
| 678 | } |
| 679 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 680 | static struct tnode *inflate(struct trie *t, struct tnode *tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 681 | { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 682 | struct tnode *oldtnode = tn; |
| 683 | int olen = tnode_child_length(tn); |
| 684 | int i; |
| 685 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 686 | pr_debug("In inflate\n"); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 687 | |
| 688 | tn = tnode_new(oldtnode->key, oldtnode->pos, oldtnode->bits + 1); |
| 689 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 690 | if (!tn) |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 691 | return ERR_PTR(-ENOMEM); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 692 | |
| 693 | /* |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 694 | * Preallocate and store tnodes before the actual work so we |
| 695 | * don't get into an inconsistent state if memory allocation |
| 696 | * fails. In case of failure we return the oldnode and inflate |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 697 | * of tnode is ignored. |
| 698 | */ |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 699 | |
| 700 | for (i = 0; i < olen; i++) { |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 701 | struct tnode *inode; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 702 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 703 | inode = (struct tnode *) tnode_get_child(oldtnode, i); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 704 | if (inode && |
| 705 | IS_TNODE(inode) && |
| 706 | inode->pos == oldtnode->pos + oldtnode->bits && |
| 707 | inode->bits > 1) { |
| 708 | struct tnode *left, *right; |
Stephen Hemminger | ab66b4a | 2007-08-10 15:22:58 -0700 | [diff] [blame] | 709 | t_key m = ~0U << (KEYLENGTH - 1) >> inode->pos; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 710 | |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 711 | left = tnode_new(inode->key&(~m), inode->pos + 1, |
| 712 | inode->bits - 1); |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 713 | if (!left) |
| 714 | goto nomem; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 715 | |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 716 | right = tnode_new(inode->key|m, inode->pos + 1, |
| 717 | inode->bits - 1); |
| 718 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 719 | if (!right) { |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 720 | tnode_free(left); |
| 721 | goto nomem; |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 722 | } |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 723 | |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 724 | put_child(tn, 2*i, (struct rt_trie_node *) left); |
| 725 | put_child(tn, 2*i+1, (struct rt_trie_node *) right); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 726 | } |
| 727 | } |
| 728 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 729 | for (i = 0; i < olen; i++) { |
Stephen Hemminger | c95aaf9 | 2008-01-12 21:25:02 -0800 | [diff] [blame] | 730 | struct tnode *inode; |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 731 | struct rt_trie_node *node = tnode_get_child(oldtnode, i); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 732 | struct tnode *left, *right; |
| 733 | int size, j; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 734 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 735 | /* An empty child */ |
| 736 | if (node == NULL) |
| 737 | continue; |
| 738 | |
| 739 | /* A leaf or an internal node with skipped bits */ |
| 740 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 741 | if (IS_LEAF(node) || (node->pos > (tn->pos + tn->bits - 1))) { |
baker.zhang | bbe34cf | 2013-10-01 07:45:09 +0800 | [diff] [blame] | 742 | put_child(tn, |
| 743 | tkey_extract_bits(node->key, oldtnode->pos, oldtnode->bits + 1), |
| 744 | node); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 745 | continue; |
| 746 | } |
| 747 | |
| 748 | /* An internal node with two children */ |
| 749 | inode = (struct tnode *) node; |
| 750 | |
| 751 | if (inode->bits == 1) { |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 752 | put_child(tn, 2*i, rtnl_dereference(inode->child[0])); |
| 753 | put_child(tn, 2*i+1, rtnl_dereference(inode->child[1])); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 754 | |
Jarek Poplawski | e0f7cb8 | 2009-06-15 02:31:29 -0700 | [diff] [blame] | 755 | tnode_free_safe(inode); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 756 | continue; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 757 | } |
| 758 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 759 | /* An internal node with more than two children */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 760 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 761 | /* We will replace this node 'inode' with two new |
| 762 | * ones, 'left' and 'right', each with half of the |
| 763 | * original children. The two new nodes will have |
| 764 | * a position one bit further down the key and this |
| 765 | * means that the "significant" part of their keys |
| 766 | * (see the discussion near the top of this file) |
| 767 | * will differ by one bit, which will be "0" in |
| 768 | * left's key and "1" in right's key. Since we are |
| 769 | * moving the key position by one step, the bit that |
| 770 | * we are moving away from - the bit at position |
| 771 | * (inode->pos) - is the one that will differ between |
| 772 | * left and right. So... we synthesize that bit in the |
| 773 | * two new keys. |
| 774 | * The mask 'm' below will be a single "one" bit at |
| 775 | * the position (inode->pos) |
| 776 | */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 777 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 778 | /* Use the old key, but set the new significant |
| 779 | * bit to zero. |
| 780 | */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 781 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 782 | left = (struct tnode *) tnode_get_child(tn, 2*i); |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 783 | put_child(tn, 2*i, NULL); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 784 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 785 | BUG_ON(!left); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 786 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 787 | right = (struct tnode *) tnode_get_child(tn, 2*i+1); |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 788 | put_child(tn, 2*i+1, NULL); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 789 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 790 | BUG_ON(!right); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 791 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 792 | size = tnode_child_length(left); |
| 793 | for (j = 0; j < size; j++) { |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 794 | put_child(left, j, rtnl_dereference(inode->child[j])); |
| 795 | put_child(right, j, rtnl_dereference(inode->child[j + size])); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 796 | } |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 797 | put_child(tn, 2*i, resize(t, left)); |
| 798 | put_child(tn, 2*i+1, resize(t, right)); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 799 | |
Jarek Poplawski | e0f7cb8 | 2009-06-15 02:31:29 -0700 | [diff] [blame] | 800 | tnode_free_safe(inode); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 801 | } |
Jarek Poplawski | e0f7cb8 | 2009-06-15 02:31:29 -0700 | [diff] [blame] | 802 | tnode_free_safe(oldtnode); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 803 | return tn; |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 804 | nomem: |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 805 | tnode_clean_free(tn); |
| 806 | return ERR_PTR(-ENOMEM); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 807 | } |
| 808 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 809 | static struct tnode *halve(struct trie *t, struct tnode *tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 810 | { |
| 811 | struct tnode *oldtnode = tn; |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 812 | struct rt_trie_node *left, *right; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 813 | int i; |
| 814 | int olen = tnode_child_length(tn); |
| 815 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 816 | pr_debug("In halve\n"); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 817 | |
| 818 | tn = tnode_new(oldtnode->key, oldtnode->pos, oldtnode->bits - 1); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 819 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 820 | if (!tn) |
| 821 | return ERR_PTR(-ENOMEM); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 822 | |
| 823 | /* |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 824 | * Preallocate and store tnodes before the actual work so we |
| 825 | * don't get into an inconsistent state if memory allocation |
| 826 | * fails. In case of failure we return the oldnode and halve |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 827 | * of tnode is ignored. |
| 828 | */ |
| 829 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 830 | for (i = 0; i < olen; i += 2) { |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 831 | left = tnode_get_child(oldtnode, i); |
| 832 | right = tnode_get_child(oldtnode, i+1); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 833 | |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 834 | /* Two nonempty children */ |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 835 | if (left && right) { |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 836 | struct tnode *newn; |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 837 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 838 | newn = tnode_new(left->key, tn->pos + tn->bits, 1); |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 839 | |
| 840 | if (!newn) |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 841 | goto nomem; |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 842 | |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 843 | put_child(tn, i/2, (struct rt_trie_node *)newn); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 844 | } |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 845 | |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 846 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 847 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 848 | for (i = 0; i < olen; i += 2) { |
| 849 | struct tnode *newBinNode; |
| 850 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 851 | left = tnode_get_child(oldtnode, i); |
| 852 | right = tnode_get_child(oldtnode, i+1); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 853 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 854 | /* At least one of the children is empty */ |
| 855 | if (left == NULL) { |
| 856 | if (right == NULL) /* Both are empty */ |
| 857 | continue; |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 858 | put_child(tn, i/2, right); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 859 | continue; |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 860 | } |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 861 | |
| 862 | if (right == NULL) { |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 863 | put_child(tn, i/2, left); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 864 | continue; |
| 865 | } |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 866 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 867 | /* Two nonempty children */ |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 868 | newBinNode = (struct tnode *) tnode_get_child(tn, i/2); |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 869 | put_child(tn, i/2, NULL); |
| 870 | put_child(newBinNode, 0, left); |
| 871 | put_child(newBinNode, 1, right); |
| 872 | put_child(tn, i/2, resize(t, newBinNode)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 873 | } |
Jarek Poplawski | e0f7cb8 | 2009-06-15 02:31:29 -0700 | [diff] [blame] | 874 | tnode_free_safe(oldtnode); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 875 | return tn; |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 876 | nomem: |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 877 | tnode_clean_free(tn); |
| 878 | return ERR_PTR(-ENOMEM); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 879 | } |
| 880 | |
Robert Olsson | 772cb71 | 2005-09-19 15:31:18 -0700 | [diff] [blame] | 881 | /* readside must use rcu_read_lock currently dump routines |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 882 | via get_fa_head and dump */ |
| 883 | |
Robert Olsson | 772cb71 | 2005-09-19 15:31:18 -0700 | [diff] [blame] | 884 | static struct leaf_info *find_leaf_info(struct leaf *l, int plen) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 885 | { |
Robert Olsson | 772cb71 | 2005-09-19 15:31:18 -0700 | [diff] [blame] | 886 | struct hlist_head *head = &l->list; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 887 | struct leaf_info *li; |
| 888 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 889 | hlist_for_each_entry_rcu(li, head, hlist) |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 890 | if (li->plen == plen) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 891 | return li; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 892 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 893 | return NULL; |
| 894 | } |
| 895 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 896 | static inline struct list_head *get_fa_head(struct leaf *l, int plen) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 897 | { |
Robert Olsson | 772cb71 | 2005-09-19 15:31:18 -0700 | [diff] [blame] | 898 | struct leaf_info *li = find_leaf_info(l, plen); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 899 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 900 | if (!li) |
| 901 | return NULL; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 902 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 903 | return &li->falh; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 904 | } |
| 905 | |
| 906 | static void insert_leaf_info(struct hlist_head *head, struct leaf_info *new) |
| 907 | { |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 908 | struct leaf_info *li = NULL, *last = NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 909 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 910 | if (hlist_empty(head)) { |
| 911 | hlist_add_head_rcu(&new->hlist, head); |
| 912 | } else { |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 913 | hlist_for_each_entry(li, head, hlist) { |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 914 | if (new->plen > li->plen) |
| 915 | break; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 916 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 917 | last = li; |
| 918 | } |
| 919 | if (last) |
Ken Helias | 1d02328 | 2014-08-06 16:09:16 -0700 | [diff] [blame] | 920 | hlist_add_behind_rcu(&new->hlist, &last->hlist); |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 921 | else |
| 922 | hlist_add_before_rcu(&new->hlist, &li->hlist); |
| 923 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 924 | } |
| 925 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 926 | /* rcu_read_lock needs to be hold by caller from readside */ |
| 927 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 928 | static struct leaf * |
| 929 | fib_find_node(struct trie *t, u32 key) |
| 930 | { |
| 931 | int pos; |
| 932 | struct tnode *tn; |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 933 | struct rt_trie_node *n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 934 | |
| 935 | pos = 0; |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 936 | n = rcu_dereference_rtnl(t->trie); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 937 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 938 | while (n && IS_TNODE(n)) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 939 | tn = (struct tnode *) n; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 940 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 941 | if (tkey_sub_equals(tn->key, pos, tn->pos-pos, key)) { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 942 | pos = tn->pos + tn->bits; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 943 | n = tnode_get_child_rcu(tn, |
| 944 | tkey_extract_bits(key, |
| 945 | tn->pos, |
| 946 | tn->bits)); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 947 | } else |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 948 | break; |
| 949 | } |
| 950 | /* Case we have found a leaf. Compare prefixes */ |
| 951 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 952 | if (n != NULL && IS_LEAF(n) && tkey_equals(key, n->key)) |
| 953 | return (struct leaf *)n; |
| 954 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 955 | return NULL; |
| 956 | } |
| 957 | |
Jarek Poplawski | 7b85576 | 2009-06-18 00:28:51 -0700 | [diff] [blame] | 958 | static void trie_rebalance(struct trie *t, struct tnode *tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 959 | { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 960 | int wasfull; |
Robert Olsson | 3ed18d7 | 2009-05-21 15:20:59 -0700 | [diff] [blame] | 961 | t_key cindex, key; |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 962 | struct tnode *tp; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 963 | |
Robert Olsson | 3ed18d7 | 2009-05-21 15:20:59 -0700 | [diff] [blame] | 964 | key = tn->key; |
| 965 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 966 | while (tn != NULL && (tp = node_parent(tn)) != NULL) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 967 | cindex = tkey_extract_bits(key, tp->pos, tp->bits); |
| 968 | wasfull = tnode_full(tp, tnode_get_child(tp, cindex)); |
Joe Perches | e319269 | 2012-06-03 17:41:40 +0000 | [diff] [blame] | 969 | tn = (struct tnode *)resize(t, tn); |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 970 | |
Joe Perches | e319269 | 2012-06-03 17:41:40 +0000 | [diff] [blame] | 971 | tnode_put_child_reorg(tp, cindex, |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 972 | (struct rt_trie_node *)tn, wasfull); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 973 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 974 | tp = node_parent(tn); |
Jarek Poplawski | 008440e | 2009-06-30 12:47:19 -0700 | [diff] [blame] | 975 | if (!tp) |
Eric Dumazet | cf778b0 | 2012-01-12 04:41:32 +0000 | [diff] [blame] | 976 | rcu_assign_pointer(t->trie, (struct rt_trie_node *)tn); |
Jarek Poplawski | 008440e | 2009-06-30 12:47:19 -0700 | [diff] [blame] | 977 | |
Jarek Poplawski | e0f7cb8 | 2009-06-15 02:31:29 -0700 | [diff] [blame] | 978 | tnode_free_flush(); |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 979 | if (!tp) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 980 | break; |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 981 | tn = tp; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 982 | } |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 983 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 984 | /* Handle last (top) tnode */ |
Jarek Poplawski | 7b85576 | 2009-06-18 00:28:51 -0700 | [diff] [blame] | 985 | if (IS_TNODE(tn)) |
Joe Perches | e319269 | 2012-06-03 17:41:40 +0000 | [diff] [blame] | 986 | tn = (struct tnode *)resize(t, tn); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 987 | |
Eric Dumazet | cf778b0 | 2012-01-12 04:41:32 +0000 | [diff] [blame] | 988 | rcu_assign_pointer(t->trie, (struct rt_trie_node *)tn); |
Jarek Poplawski | 7b85576 | 2009-06-18 00:28:51 -0700 | [diff] [blame] | 989 | tnode_free_flush(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 990 | } |
| 991 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 992 | /* only used from updater-side */ |
| 993 | |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 994 | static struct list_head *fib_insert_node(struct trie *t, u32 key, int plen) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 995 | { |
| 996 | int pos, newpos; |
| 997 | struct tnode *tp = NULL, *tn = NULL; |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 998 | struct rt_trie_node *n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 999 | struct leaf *l; |
| 1000 | int missbit; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1001 | struct list_head *fa_head = NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1002 | struct leaf_info *li; |
| 1003 | t_key cindex; |
| 1004 | |
| 1005 | pos = 0; |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 1006 | n = rtnl_dereference(t->trie); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1007 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1008 | /* If we point to NULL, stop. Either the tree is empty and we should |
| 1009 | * just put a new leaf in if, or we have reached an empty child slot, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1010 | * and we should just put our new leaf in that. |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1011 | * If we point to a T_TNODE, check if it matches our key. Note that |
| 1012 | * a T_TNODE might be skipping any number of bits - its 'pos' need |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1013 | * not be the parent's 'pos'+'bits'! |
| 1014 | * |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1015 | * If it does match the current key, get pos/bits from it, extract |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1016 | * the index from our key, push the T_TNODE and walk the tree. |
| 1017 | * |
| 1018 | * If it doesn't, we have to replace it with a new T_TNODE. |
| 1019 | * |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1020 | * If we point to a T_LEAF, it might or might not have the same key |
| 1021 | * as we do. If it does, just change the value, update the T_LEAF's |
| 1022 | * value, and return it. |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1023 | * If it doesn't, we need to replace it with a T_TNODE. |
| 1024 | */ |
| 1025 | |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 1026 | while (n && IS_TNODE(n)) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1027 | tn = (struct tnode *) n; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1028 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1029 | if (tkey_sub_equals(tn->key, pos, tn->pos-pos, key)) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1030 | tp = tn; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1031 | pos = tn->pos + tn->bits; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1032 | n = tnode_get_child(tn, |
| 1033 | tkey_extract_bits(key, |
| 1034 | tn->pos, |
| 1035 | tn->bits)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1036 | |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 1037 | BUG_ON(n && node_parent(n) != tn); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1038 | } else |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1039 | break; |
| 1040 | } |
| 1041 | |
| 1042 | /* |
| 1043 | * n ----> NULL, LEAF or TNODE |
| 1044 | * |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1045 | * tp is n's (parent) ----> NULL or TNODE |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1046 | */ |
| 1047 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1048 | BUG_ON(tp && IS_LEAF(tp)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1049 | |
| 1050 | /* Case 1: n is a leaf. Compare prefixes */ |
| 1051 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1052 | if (n != NULL && IS_LEAF(n) && tkey_equals(key, n->key)) { |
Stephen Hemminger | c95aaf9 | 2008-01-12 21:25:02 -0800 | [diff] [blame] | 1053 | l = (struct leaf *) n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1054 | li = leaf_info_new(plen); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1055 | |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1056 | if (!li) |
| 1057 | return NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1058 | |
| 1059 | fa_head = &li->falh; |
| 1060 | insert_leaf_info(&l->list, li); |
| 1061 | goto done; |
| 1062 | } |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 1063 | l = leaf_new(key); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1064 | |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1065 | if (!l) |
| 1066 | return NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1067 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1068 | li = leaf_info_new(plen); |
| 1069 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1070 | if (!li) { |
Stephen Hemminger | 387a548 | 2008-04-10 03:47:34 -0700 | [diff] [blame] | 1071 | free_leaf(l); |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1072 | return NULL; |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1073 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1074 | |
| 1075 | fa_head = &li->falh; |
| 1076 | insert_leaf_info(&l->list, li); |
| 1077 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1078 | if (t->trie && n == NULL) { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1079 | /* Case 2: n is NULL, and will just insert a new leaf */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1080 | |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 1081 | node_set_parent((struct rt_trie_node *)l, tp); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1082 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1083 | cindex = tkey_extract_bits(key, tp->pos, tp->bits); |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 1084 | put_child(tp, cindex, (struct rt_trie_node *)l); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1085 | } else { |
| 1086 | /* Case 3: n is a LEAF or a TNODE and the key doesn't match. */ |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1087 | /* |
| 1088 | * Add a new tnode here |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1089 | * first tnode need some special handling |
| 1090 | */ |
| 1091 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1092 | if (n) { |
baker.zhang | 4c60f1d | 2013-10-08 11:36:51 +0800 | [diff] [blame] | 1093 | pos = tp ? tp->pos+tp->bits : 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1094 | newpos = tkey_mismatch(key, pos, n->key); |
| 1095 | tn = tnode_new(n->key, newpos, 1); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1096 | } else { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1097 | newpos = 0; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1098 | tn = tnode_new(key, newpos, 1); /* First tnode */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1099 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1100 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1101 | if (!tn) { |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1102 | free_leaf_info(li); |
Stephen Hemminger | 387a548 | 2008-04-10 03:47:34 -0700 | [diff] [blame] | 1103 | free_leaf(l); |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1104 | return NULL; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1105 | } |
| 1106 | |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 1107 | node_set_parent((struct rt_trie_node *)tn, tp); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1108 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1109 | missbit = tkey_extract_bits(key, newpos, 1); |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 1110 | put_child(tn, missbit, (struct rt_trie_node *)l); |
| 1111 | put_child(tn, 1-missbit, n); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1112 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1113 | if (tp) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1114 | cindex = tkey_extract_bits(key, tp->pos, tp->bits); |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 1115 | put_child(tp, cindex, (struct rt_trie_node *)tn); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1116 | } else { |
Eric Dumazet | cf778b0 | 2012-01-12 04:41:32 +0000 | [diff] [blame] | 1117 | rcu_assign_pointer(t->trie, (struct rt_trie_node *)tn); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1118 | } |
Alexander Duyck | e962f30 | 2014-12-10 21:49:22 -0800 | [diff] [blame] | 1119 | |
| 1120 | tp = tn; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1121 | } |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1122 | |
| 1123 | if (tp && tp->pos + tp->bits > 32) |
Joe Perches | 058bd4d | 2012-03-11 18:36:11 +0000 | [diff] [blame] | 1124 | pr_warn("fib_trie tp=%p pos=%d, bits=%d, key=%0x plen=%d\n", |
| 1125 | tp, tp->pos, tp->bits, key, plen); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1126 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1127 | /* Rebalance the trie */ |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1128 | |
Jarek Poplawski | 7b85576 | 2009-06-18 00:28:51 -0700 | [diff] [blame] | 1129 | trie_rebalance(t, tp); |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1130 | done: |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1131 | return fa_head; |
| 1132 | } |
| 1133 | |
Robert Olsson | d562f1f | 2007-03-26 14:22:22 -0700 | [diff] [blame] | 1134 | /* |
| 1135 | * Caller must hold RTNL. |
| 1136 | */ |
Stephen Hemminger | 16c6cf8 | 2009-09-20 10:35:36 +0000 | [diff] [blame] | 1137 | int fib_table_insert(struct fib_table *tb, struct fib_config *cfg) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1138 | { |
| 1139 | struct trie *t = (struct trie *) tb->tb_data; |
| 1140 | struct fib_alias *fa, *new_fa; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1141 | struct list_head *fa_head = NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1142 | struct fib_info *fi; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1143 | int plen = cfg->fc_dst_len; |
| 1144 | u8 tos = cfg->fc_tos; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1145 | u32 key, mask; |
| 1146 | int err; |
| 1147 | struct leaf *l; |
| 1148 | |
| 1149 | if (plen > 32) |
| 1150 | return -EINVAL; |
| 1151 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1152 | key = ntohl(cfg->fc_dst); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1153 | |
Patrick McHardy | 2dfe55b | 2006-08-10 23:08:33 -0700 | [diff] [blame] | 1154 | pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1155 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1156 | mask = ntohl(inet_make_mask(plen)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1157 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1158 | if (key & ~mask) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1159 | return -EINVAL; |
| 1160 | |
| 1161 | key = key & mask; |
| 1162 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1163 | fi = fib_create_info(cfg); |
| 1164 | if (IS_ERR(fi)) { |
| 1165 | err = PTR_ERR(fi); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1166 | goto err; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1167 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1168 | |
| 1169 | l = fib_find_node(t, key); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1170 | fa = NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1171 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1172 | if (l) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1173 | fa_head = get_fa_head(l, plen); |
| 1174 | fa = fib_find_alias(fa_head, tos, fi->fib_priority); |
| 1175 | } |
| 1176 | |
| 1177 | /* Now fa, if non-NULL, points to the first fib alias |
| 1178 | * with the same keys [prefix,tos,priority], if such key already |
| 1179 | * exists or to the node before which we will insert new one. |
| 1180 | * |
| 1181 | * If fa is NULL, we will need to allocate a new one and |
| 1182 | * insert to the head of f. |
| 1183 | * |
| 1184 | * If f is NULL, no fib node matched the destination key |
| 1185 | * and we need to allocate a new one of those as well. |
| 1186 | */ |
| 1187 | |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1188 | if (fa && fa->fa_tos == tos && |
| 1189 | fa->fa_info->fib_priority == fi->fib_priority) { |
| 1190 | struct fib_alias *fa_first, *fa_match; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1191 | |
| 1192 | err = -EEXIST; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1193 | if (cfg->fc_nlflags & NLM_F_EXCL) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1194 | goto out; |
| 1195 | |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1196 | /* We have 2 goals: |
| 1197 | * 1. Find exact match for type, scope, fib_info to avoid |
| 1198 | * duplicate routes |
| 1199 | * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it |
| 1200 | */ |
| 1201 | fa_match = NULL; |
| 1202 | fa_first = fa; |
| 1203 | fa = list_entry(fa->fa_list.prev, struct fib_alias, fa_list); |
| 1204 | list_for_each_entry_continue(fa, fa_head, fa_list) { |
| 1205 | if (fa->fa_tos != tos) |
| 1206 | break; |
| 1207 | if (fa->fa_info->fib_priority != fi->fib_priority) |
| 1208 | break; |
| 1209 | if (fa->fa_type == cfg->fc_type && |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1210 | fa->fa_info == fi) { |
| 1211 | fa_match = fa; |
| 1212 | break; |
| 1213 | } |
| 1214 | } |
| 1215 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1216 | if (cfg->fc_nlflags & NLM_F_REPLACE) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1217 | struct fib_info *fi_drop; |
| 1218 | u8 state; |
| 1219 | |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1220 | fa = fa_first; |
| 1221 | if (fa_match) { |
| 1222 | if (fa == fa_match) |
| 1223 | err = 0; |
Joonwoo Park | 6725033 | 2008-01-18 03:45:18 -0800 | [diff] [blame] | 1224 | goto out; |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1225 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1226 | err = -ENOBUFS; |
Christoph Lameter | e94b176 | 2006-12-06 20:33:17 -0800 | [diff] [blame] | 1227 | new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1228 | if (new_fa == NULL) |
| 1229 | goto out; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1230 | |
| 1231 | fi_drop = fa->fa_info; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1232 | new_fa->fa_tos = fa->fa_tos; |
| 1233 | new_fa->fa_info = fi; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1234 | new_fa->fa_type = cfg->fc_type; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1235 | state = fa->fa_state; |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1236 | new_fa->fa_state = state & ~FA_S_ACCESSED; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1237 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1238 | list_replace_rcu(&fa->fa_list, &new_fa->fa_list); |
| 1239 | alias_free_mem_rcu(fa); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1240 | |
| 1241 | fib_release_info(fi_drop); |
| 1242 | if (state & FA_S_ACCESSED) |
Nicolas Dichtel | 4ccfe6d | 2012-09-07 00:45:29 +0000 | [diff] [blame] | 1243 | rt_cache_flush(cfg->fc_nlinfo.nl_net); |
Milan Kocian | b8f5583 | 2007-05-23 14:55:06 -0700 | [diff] [blame] | 1244 | rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, |
| 1245 | tb->tb_id, &cfg->fc_nlinfo, NLM_F_REPLACE); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1246 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1247 | goto succeeded; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1248 | } |
| 1249 | /* Error if we find a perfect match which |
| 1250 | * uses the same scope, type, and nexthop |
| 1251 | * information. |
| 1252 | */ |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1253 | if (fa_match) |
| 1254 | goto out; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1255 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1256 | if (!(cfg->fc_nlflags & NLM_F_APPEND)) |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1257 | fa = fa_first; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1258 | } |
| 1259 | err = -ENOENT; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1260 | if (!(cfg->fc_nlflags & NLM_F_CREATE)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1261 | goto out; |
| 1262 | |
| 1263 | err = -ENOBUFS; |
Christoph Lameter | e94b176 | 2006-12-06 20:33:17 -0800 | [diff] [blame] | 1264 | new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1265 | if (new_fa == NULL) |
| 1266 | goto out; |
| 1267 | |
| 1268 | new_fa->fa_info = fi; |
| 1269 | new_fa->fa_tos = tos; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1270 | new_fa->fa_type = cfg->fc_type; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1271 | new_fa->fa_state = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1272 | /* |
| 1273 | * Insert new entry to the list. |
| 1274 | */ |
| 1275 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1276 | if (!fa_head) { |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1277 | fa_head = fib_insert_node(t, key, plen); |
| 1278 | if (unlikely(!fa_head)) { |
| 1279 | err = -ENOMEM; |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1280 | goto out_free_new_fa; |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1281 | } |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1282 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1283 | |
David S. Miller | 21d8c49 | 2011-04-14 14:49:37 -0700 | [diff] [blame] | 1284 | if (!plen) |
| 1285 | tb->tb_num_default++; |
| 1286 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1287 | list_add_tail_rcu(&new_fa->fa_list, |
| 1288 | (fa ? &fa->fa_list : fa_head)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1289 | |
Nicolas Dichtel | 4ccfe6d | 2012-09-07 00:45:29 +0000 | [diff] [blame] | 1290 | rt_cache_flush(cfg->fc_nlinfo.nl_net); |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1291 | rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, tb->tb_id, |
Milan Kocian | b8f5583 | 2007-05-23 14:55:06 -0700 | [diff] [blame] | 1292 | &cfg->fc_nlinfo, 0); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1293 | succeeded: |
| 1294 | return 0; |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1295 | |
| 1296 | out_free_new_fa: |
| 1297 | kmem_cache_free(fn_alias_kmem, new_fa); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1298 | out: |
| 1299 | fib_release_info(fi); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1300 | err: |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1301 | return err; |
| 1302 | } |
| 1303 | |
Robert Olsson | 772cb71 | 2005-09-19 15:31:18 -0700 | [diff] [blame] | 1304 | /* should be called with rcu_read_lock */ |
David S. Miller | 5b47044 | 2011-01-31 16:10:03 -0800 | [diff] [blame] | 1305 | static int check_leaf(struct fib_table *tb, struct trie *t, struct leaf *l, |
David S. Miller | 22bd5b9 | 2011-03-11 19:54:08 -0500 | [diff] [blame] | 1306 | t_key key, const struct flowi4 *flp, |
Eric Dumazet | ebc0ffa | 2010-10-05 10:41:36 +0000 | [diff] [blame] | 1307 | struct fib_result *res, int fib_flags) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1308 | { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1309 | struct leaf_info *li; |
| 1310 | struct hlist_head *hhead = &l->list; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1311 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 1312 | hlist_for_each_entry_rcu(li, hhead, hlist) { |
David S. Miller | 3be0686 | 2011-03-07 15:01:10 -0800 | [diff] [blame] | 1313 | struct fib_alias *fa; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1314 | |
Eric Dumazet | 5c74501 | 2011-07-18 03:16:33 +0000 | [diff] [blame] | 1315 | if (l->key != (key & li->mask_plen)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1316 | continue; |
| 1317 | |
David S. Miller | 3be0686 | 2011-03-07 15:01:10 -0800 | [diff] [blame] | 1318 | list_for_each_entry_rcu(fa, &li->falh, fa_list) { |
| 1319 | struct fib_info *fi = fa->fa_info; |
| 1320 | int nhsel, err; |
| 1321 | |
David S. Miller | 22bd5b9 | 2011-03-11 19:54:08 -0500 | [diff] [blame] | 1322 | if (fa->fa_tos && fa->fa_tos != flp->flowi4_tos) |
David S. Miller | 3be0686 | 2011-03-07 15:01:10 -0800 | [diff] [blame] | 1323 | continue; |
David S. Miller | dccd9ecc | 2012-05-10 22:16:32 -0400 | [diff] [blame] | 1324 | if (fi->fib_dead) |
| 1325 | continue; |
David S. Miller | 37e826c | 2011-03-24 18:06:47 -0700 | [diff] [blame] | 1326 | if (fa->fa_info->fib_scope < flp->flowi4_scope) |
David S. Miller | 3be0686 | 2011-03-07 15:01:10 -0800 | [diff] [blame] | 1327 | continue; |
| 1328 | fib_alias_accessed(fa); |
| 1329 | err = fib_props[fa->fa_type].error; |
| 1330 | if (err) { |
| 1331 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 1332 | this_cpu_inc(t->stats->semantic_match_passed); |
David S. Miller | 3be0686 | 2011-03-07 15:01:10 -0800 | [diff] [blame] | 1333 | #endif |
Julian Anastasov | 1fbc784 | 2011-03-25 20:33:23 -0700 | [diff] [blame] | 1334 | return err; |
David S. Miller | 3be0686 | 2011-03-07 15:01:10 -0800 | [diff] [blame] | 1335 | } |
| 1336 | if (fi->fib_flags & RTNH_F_DEAD) |
| 1337 | continue; |
| 1338 | for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) { |
| 1339 | const struct fib_nh *nh = &fi->fib_nh[nhsel]; |
| 1340 | |
| 1341 | if (nh->nh_flags & RTNH_F_DEAD) |
| 1342 | continue; |
David S. Miller | 22bd5b9 | 2011-03-11 19:54:08 -0500 | [diff] [blame] | 1343 | if (flp->flowi4_oif && flp->flowi4_oif != nh->nh_oif) |
David S. Miller | 3be0686 | 2011-03-07 15:01:10 -0800 | [diff] [blame] | 1344 | continue; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1345 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1346 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 1347 | this_cpu_inc(t->stats->semantic_match_passed); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1348 | #endif |
Eric Dumazet | 5c74501 | 2011-07-18 03:16:33 +0000 | [diff] [blame] | 1349 | res->prefixlen = li->plen; |
David S. Miller | 3be0686 | 2011-03-07 15:01:10 -0800 | [diff] [blame] | 1350 | res->nh_sel = nhsel; |
| 1351 | res->type = fa->fa_type; |
David S. Miller | 37e826c | 2011-03-24 18:06:47 -0700 | [diff] [blame] | 1352 | res->scope = fa->fa_info->fib_scope; |
David S. Miller | 3be0686 | 2011-03-07 15:01:10 -0800 | [diff] [blame] | 1353 | res->fi = fi; |
| 1354 | res->table = tb; |
| 1355 | res->fa_head = &li->falh; |
| 1356 | if (!(fib_flags & FIB_LOOKUP_NOREF)) |
Eric Dumazet | 5c74501 | 2011-07-18 03:16:33 +0000 | [diff] [blame] | 1357 | atomic_inc(&fi->fib_clntref); |
David S. Miller | 3be0686 | 2011-03-07 15:01:10 -0800 | [diff] [blame] | 1358 | return 0; |
| 1359 | } |
| 1360 | } |
| 1361 | |
| 1362 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 1363 | this_cpu_inc(t->stats->semantic_match_miss); |
David S. Miller | 3be0686 | 2011-03-07 15:01:10 -0800 | [diff] [blame] | 1364 | #endif |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1365 | } |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1366 | |
Ben Hutchings | 2e65557 | 2008-07-10 16:52:52 -0700 | [diff] [blame] | 1367 | return 1; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1368 | } |
| 1369 | |
David S. Miller | 22bd5b9 | 2011-03-11 19:54:08 -0500 | [diff] [blame] | 1370 | int fib_table_lookup(struct fib_table *tb, const struct flowi4 *flp, |
Eric Dumazet | ebc0ffa | 2010-10-05 10:41:36 +0000 | [diff] [blame] | 1371 | struct fib_result *res, int fib_flags) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1372 | { |
| 1373 | struct trie *t = (struct trie *) tb->tb_data; |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 1374 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 1375 | struct trie_use_stats __percpu *stats = t->stats; |
| 1376 | #endif |
Ben Hutchings | 2e65557 | 2008-07-10 16:52:52 -0700 | [diff] [blame] | 1377 | int ret; |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 1378 | struct rt_trie_node *n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1379 | struct tnode *pn; |
David S. Miller | 3b00456 | 2011-02-16 14:56:22 -0800 | [diff] [blame] | 1380 | unsigned int pos, bits; |
David S. Miller | 22bd5b9 | 2011-03-11 19:54:08 -0500 | [diff] [blame] | 1381 | t_key key = ntohl(flp->daddr); |
David S. Miller | 3b00456 | 2011-02-16 14:56:22 -0800 | [diff] [blame] | 1382 | unsigned int chopped_off; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1383 | t_key cindex = 0; |
David S. Miller | 3b00456 | 2011-02-16 14:56:22 -0800 | [diff] [blame] | 1384 | unsigned int current_prefix_length = KEYLENGTH; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1385 | struct tnode *cn; |
Eric Dumazet | 874ffa8 | 2010-10-13 06:56:11 +0000 | [diff] [blame] | 1386 | t_key pref_mismatch; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1387 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1388 | rcu_read_lock(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1389 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1390 | n = rcu_dereference(t->trie); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1391 | if (!n) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1392 | goto failed; |
| 1393 | |
| 1394 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 1395 | this_cpu_inc(stats->gets); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1396 | #endif |
| 1397 | |
| 1398 | /* Just a leaf? */ |
| 1399 | if (IS_LEAF(n)) { |
David S. Miller | 5b47044 | 2011-01-31 16:10:03 -0800 | [diff] [blame] | 1400 | ret = check_leaf(tb, t, (struct leaf *)n, key, flp, res, fib_flags); |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1401 | goto found; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1402 | } |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1403 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1404 | pn = (struct tnode *) n; |
| 1405 | chopped_off = 0; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1406 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1407 | while (pn) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1408 | pos = pn->pos; |
| 1409 | bits = pn->bits; |
| 1410 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1411 | if (!chopped_off) |
Stephen Hemminger | ab66b4a | 2007-08-10 15:22:58 -0700 | [diff] [blame] | 1412 | cindex = tkey_extract_bits(mask_pfx(key, current_prefix_length), |
| 1413 | pos, bits); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1414 | |
Jarek Poplawski | b902e57 | 2009-07-14 11:20:32 +0000 | [diff] [blame] | 1415 | n = tnode_get_child_rcu(pn, cindex); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1416 | |
| 1417 | if (n == NULL) { |
| 1418 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 1419 | this_cpu_inc(stats->null_node_hit); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1420 | #endif |
| 1421 | goto backtrace; |
| 1422 | } |
| 1423 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1424 | if (IS_LEAF(n)) { |
David S. Miller | 5b47044 | 2011-01-31 16:10:03 -0800 | [diff] [blame] | 1425 | ret = check_leaf(tb, t, (struct leaf *)n, key, flp, res, fib_flags); |
Ben Hutchings | 2e65557 | 2008-07-10 16:52:52 -0700 | [diff] [blame] | 1426 | if (ret > 0) |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1427 | goto backtrace; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1428 | goto found; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1429 | } |
| 1430 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1431 | cn = (struct tnode *)n; |
| 1432 | |
| 1433 | /* |
| 1434 | * It's a tnode, and we can do some extra checks here if we |
| 1435 | * like, to avoid descending into a dead-end branch. |
| 1436 | * This tnode is in the parent's child array at index |
| 1437 | * key[p_pos..p_pos+p_bits] but potentially with some bits |
| 1438 | * chopped off, so in reality the index may be just a |
| 1439 | * subprefix, padded with zero at the end. |
| 1440 | * We can also take a look at any skipped bits in this |
| 1441 | * tnode - everything up to p_pos is supposed to be ok, |
| 1442 | * and the non-chopped bits of the index (se previous |
| 1443 | * paragraph) are also guaranteed ok, but the rest is |
| 1444 | * considered unknown. |
| 1445 | * |
| 1446 | * The skipped bits are key[pos+bits..cn->pos]. |
| 1447 | */ |
| 1448 | |
| 1449 | /* If current_prefix_length < pos+bits, we are already doing |
| 1450 | * actual prefix matching, which means everything from |
| 1451 | * pos+(bits-chopped_off) onward must be zero along some |
| 1452 | * branch of this subtree - otherwise there is *no* valid |
| 1453 | * prefix present. Here we can only check the skipped |
| 1454 | * bits. Remember, since we have already indexed into the |
| 1455 | * parent's child array, we know that the bits we chopped of |
| 1456 | * *are* zero. |
| 1457 | */ |
| 1458 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1459 | /* NOTA BENE: Checking only skipped bits |
| 1460 | for the new node here */ |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1461 | |
| 1462 | if (current_prefix_length < pos+bits) { |
| 1463 | if (tkey_extract_bits(cn->key, current_prefix_length, |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1464 | cn->pos - current_prefix_length) |
| 1465 | || !(cn->child[0])) |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1466 | goto backtrace; |
| 1467 | } |
| 1468 | |
| 1469 | /* |
| 1470 | * If chopped_off=0, the index is fully validated and we |
| 1471 | * only need to look at the skipped bits for this, the new, |
| 1472 | * tnode. What we actually want to do is to find out if |
| 1473 | * these skipped bits match our key perfectly, or if we will |
| 1474 | * have to count on finding a matching prefix further down, |
| 1475 | * because if we do, we would like to have some way of |
| 1476 | * verifying the existence of such a prefix at this point. |
| 1477 | */ |
| 1478 | |
| 1479 | /* The only thing we can do at this point is to verify that |
| 1480 | * any such matching prefix can indeed be a prefix to our |
| 1481 | * key, and if the bits in the node we are inspecting that |
| 1482 | * do not match our key are not ZERO, this cannot be true. |
| 1483 | * Thus, find out where there is a mismatch (before cn->pos) |
| 1484 | * and verify that all the mismatching bits are zero in the |
| 1485 | * new tnode's key. |
| 1486 | */ |
| 1487 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1488 | /* |
| 1489 | * Note: We aren't very concerned about the piece of |
| 1490 | * the key that precede pn->pos+pn->bits, since these |
| 1491 | * have already been checked. The bits after cn->pos |
| 1492 | * aren't checked since these are by definition |
| 1493 | * "unknown" at this point. Thus, what we want to see |
| 1494 | * is if we are about to enter the "prefix matching" |
| 1495 | * state, and in that case verify that the skipped |
| 1496 | * bits that will prevail throughout this subtree are |
| 1497 | * zero, as they have to be if we are to find a |
| 1498 | * matching prefix. |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1499 | */ |
| 1500 | |
Eric Dumazet | 874ffa8 | 2010-10-13 06:56:11 +0000 | [diff] [blame] | 1501 | pref_mismatch = mask_pfx(cn->key ^ key, cn->pos); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1502 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1503 | /* |
| 1504 | * In short: If skipped bits in this node do not match |
| 1505 | * the search key, enter the "prefix matching" |
| 1506 | * state.directly. |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1507 | */ |
| 1508 | if (pref_mismatch) { |
Eric Dumazet | 79cda75 | 2012-08-07 10:45:47 +0000 | [diff] [blame] | 1509 | /* fls(x) = __fls(x) + 1 */ |
| 1510 | int mp = KEYLENGTH - __fls(pref_mismatch) - 1; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1511 | |
Eric Dumazet | 874ffa8 | 2010-10-13 06:56:11 +0000 | [diff] [blame] | 1512 | if (tkey_extract_bits(cn->key, mp, cn->pos - mp) != 0) |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1513 | goto backtrace; |
| 1514 | |
| 1515 | if (current_prefix_length >= cn->pos) |
| 1516 | current_prefix_length = mp; |
| 1517 | } |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1518 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1519 | pn = (struct tnode *)n; /* Descend */ |
| 1520 | chopped_off = 0; |
| 1521 | continue; |
| 1522 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1523 | backtrace: |
| 1524 | chopped_off++; |
| 1525 | |
| 1526 | /* As zero don't change the child key (cindex) */ |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1527 | while ((chopped_off <= pn->bits) |
| 1528 | && !(cindex & (1<<(chopped_off-1)))) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1529 | chopped_off++; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1530 | |
| 1531 | /* Decrease current_... with bits chopped off */ |
| 1532 | if (current_prefix_length > pn->pos + pn->bits - chopped_off) |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1533 | current_prefix_length = pn->pos + pn->bits |
| 1534 | - chopped_off; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1535 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1536 | /* |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1537 | * Either we do the actual chop off according or if we have |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1538 | * chopped off all bits in this tnode walk up to our parent. |
| 1539 | */ |
| 1540 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1541 | if (chopped_off <= pn->bits) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1542 | cindex &= ~(1 << (chopped_off-1)); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1543 | } else { |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 1544 | struct tnode *parent = node_parent_rcu(pn); |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 1545 | if (!parent) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1546 | goto failed; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1547 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1548 | /* Get Child's index */ |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 1549 | cindex = tkey_extract_bits(pn->key, parent->pos, parent->bits); |
| 1550 | pn = parent; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1551 | chopped_off = 0; |
| 1552 | |
| 1553 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 1554 | this_cpu_inc(stats->backtrack); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1555 | #endif |
| 1556 | goto backtrace; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1557 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1558 | } |
| 1559 | failed: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1560 | ret = 1; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1561 | found: |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1562 | rcu_read_unlock(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1563 | return ret; |
| 1564 | } |
Florian Westphal | 6fc0143 | 2011-08-25 13:46:12 +0200 | [diff] [blame] | 1565 | EXPORT_SYMBOL_GPL(fib_table_lookup); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1566 | |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1567 | /* |
| 1568 | * Remove the leaf and return parent. |
| 1569 | */ |
| 1570 | static void trie_leaf_remove(struct trie *t, struct leaf *l) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1571 | { |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 1572 | struct tnode *tp = node_parent(l); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1573 | |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1574 | pr_debug("entering trie_leaf_remove(%p)\n", l); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1575 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1576 | if (tp) { |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1577 | t_key cindex = tkey_extract_bits(l->key, tp->pos, tp->bits); |
Lin Ming | 61648d9 | 2012-07-29 02:00:03 +0000 | [diff] [blame] | 1578 | put_child(tp, cindex, NULL); |
Jarek Poplawski | 7b85576 | 2009-06-18 00:28:51 -0700 | [diff] [blame] | 1579 | trie_rebalance(t, tp); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1580 | } else |
Stephen Hemminger | a9b3cd7 | 2011-08-01 16:19:00 +0000 | [diff] [blame] | 1581 | RCU_INIT_POINTER(t->trie, NULL); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1582 | |
Stephen Hemminger | 387a548 | 2008-04-10 03:47:34 -0700 | [diff] [blame] | 1583 | free_leaf(l); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1584 | } |
| 1585 | |
Robert Olsson | d562f1f | 2007-03-26 14:22:22 -0700 | [diff] [blame] | 1586 | /* |
| 1587 | * Caller must hold RTNL. |
| 1588 | */ |
Stephen Hemminger | 16c6cf8 | 2009-09-20 10:35:36 +0000 | [diff] [blame] | 1589 | int fib_table_delete(struct fib_table *tb, struct fib_config *cfg) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1590 | { |
| 1591 | struct trie *t = (struct trie *) tb->tb_data; |
| 1592 | u32 key, mask; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1593 | int plen = cfg->fc_dst_len; |
| 1594 | u8 tos = cfg->fc_tos; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1595 | struct fib_alias *fa, *fa_to_delete; |
| 1596 | struct list_head *fa_head; |
| 1597 | struct leaf *l; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1598 | struct leaf_info *li; |
| 1599 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1600 | if (plen > 32) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1601 | return -EINVAL; |
| 1602 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1603 | key = ntohl(cfg->fc_dst); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1604 | mask = ntohl(inet_make_mask(plen)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1605 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1606 | if (key & ~mask) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1607 | return -EINVAL; |
| 1608 | |
| 1609 | key = key & mask; |
| 1610 | l = fib_find_node(t, key); |
| 1611 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1612 | if (!l) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1613 | return -ESRCH; |
| 1614 | |
Igor Maravic | ad5b310 | 2012-08-13 10:26:08 +0200 | [diff] [blame] | 1615 | li = find_leaf_info(l, plen); |
| 1616 | |
| 1617 | if (!li) |
| 1618 | return -ESRCH; |
| 1619 | |
| 1620 | fa_head = &li->falh; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1621 | fa = fib_find_alias(fa_head, tos, 0); |
| 1622 | |
| 1623 | if (!fa) |
| 1624 | return -ESRCH; |
| 1625 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 1626 | pr_debug("Deleting %08x/%d tos=%d t=%p\n", key, plen, tos, t); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1627 | |
| 1628 | fa_to_delete = NULL; |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1629 | fa = list_entry(fa->fa_list.prev, struct fib_alias, fa_list); |
| 1630 | list_for_each_entry_continue(fa, fa_head, fa_list) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1631 | struct fib_info *fi = fa->fa_info; |
| 1632 | |
| 1633 | if (fa->fa_tos != tos) |
| 1634 | break; |
| 1635 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1636 | if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) && |
| 1637 | (cfg->fc_scope == RT_SCOPE_NOWHERE || |
David S. Miller | 37e826c | 2011-03-24 18:06:47 -0700 | [diff] [blame] | 1638 | fa->fa_info->fib_scope == cfg->fc_scope) && |
Julian Anastasov | 74cb3c1 | 2011-03-19 12:13:46 +0000 | [diff] [blame] | 1639 | (!cfg->fc_prefsrc || |
| 1640 | fi->fib_prefsrc == cfg->fc_prefsrc) && |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1641 | (!cfg->fc_protocol || |
| 1642 | fi->fib_protocol == cfg->fc_protocol) && |
| 1643 | fib_nh_match(cfg, fi) == 0) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1644 | fa_to_delete = fa; |
| 1645 | break; |
| 1646 | } |
| 1647 | } |
| 1648 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1649 | if (!fa_to_delete) |
| 1650 | return -ESRCH; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1651 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1652 | fa = fa_to_delete; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1653 | rtmsg_fib(RTM_DELROUTE, htonl(key), fa, plen, tb->tb_id, |
Milan Kocian | b8f5583 | 2007-05-23 14:55:06 -0700 | [diff] [blame] | 1654 | &cfg->fc_nlinfo, 0); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1655 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1656 | list_del_rcu(&fa->fa_list); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1657 | |
David S. Miller | 21d8c49 | 2011-04-14 14:49:37 -0700 | [diff] [blame] | 1658 | if (!plen) |
| 1659 | tb->tb_num_default--; |
| 1660 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1661 | if (list_empty(fa_head)) { |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1662 | hlist_del_rcu(&li->hlist); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1663 | free_leaf_info(li); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1664 | } |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1665 | |
| 1666 | if (hlist_empty(&l->list)) |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1667 | trie_leaf_remove(t, l); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1668 | |
| 1669 | if (fa->fa_state & FA_S_ACCESSED) |
Nicolas Dichtel | 4ccfe6d | 2012-09-07 00:45:29 +0000 | [diff] [blame] | 1670 | rt_cache_flush(cfg->fc_nlinfo.nl_net); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1671 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1672 | fib_release_info(fa->fa_info); |
| 1673 | alias_free_mem_rcu(fa); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1674 | return 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1675 | } |
| 1676 | |
Stephen Hemminger | ef3660c | 2008-04-10 03:46:12 -0700 | [diff] [blame] | 1677 | static int trie_flush_list(struct list_head *head) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1678 | { |
| 1679 | struct fib_alias *fa, *fa_node; |
| 1680 | int found = 0; |
| 1681 | |
| 1682 | list_for_each_entry_safe(fa, fa_node, head, fa_list) { |
| 1683 | struct fib_info *fi = fa->fa_info; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1684 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1685 | if (fi && (fi->fib_flags & RTNH_F_DEAD)) { |
| 1686 | list_del_rcu(&fa->fa_list); |
| 1687 | fib_release_info(fa->fa_info); |
| 1688 | alias_free_mem_rcu(fa); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1689 | found++; |
| 1690 | } |
| 1691 | } |
| 1692 | return found; |
| 1693 | } |
| 1694 | |
Stephen Hemminger | ef3660c | 2008-04-10 03:46:12 -0700 | [diff] [blame] | 1695 | static int trie_flush_leaf(struct leaf *l) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1696 | { |
| 1697 | int found = 0; |
| 1698 | struct hlist_head *lih = &l->list; |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 1699 | struct hlist_node *tmp; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1700 | struct leaf_info *li = NULL; |
| 1701 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 1702 | hlist_for_each_entry_safe(li, tmp, lih, hlist) { |
Stephen Hemminger | ef3660c | 2008-04-10 03:46:12 -0700 | [diff] [blame] | 1703 | found += trie_flush_list(&li->falh); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1704 | |
| 1705 | if (list_empty(&li->falh)) { |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1706 | hlist_del_rcu(&li->hlist); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1707 | free_leaf_info(li); |
| 1708 | } |
| 1709 | } |
| 1710 | return found; |
| 1711 | } |
| 1712 | |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1713 | /* |
| 1714 | * Scan for the next right leaf starting at node p->child[idx] |
| 1715 | * Since we have back pointer, no recursion necessary. |
| 1716 | */ |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 1717 | static struct leaf *leaf_walk_rcu(struct tnode *p, struct rt_trie_node *c) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1718 | { |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1719 | do { |
| 1720 | t_key idx; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1721 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1722 | if (c) |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1723 | idx = tkey_extract_bits(c->key, p->pos, p->bits) + 1; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1724 | else |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1725 | idx = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1726 | |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1727 | while (idx < 1u << p->bits) { |
| 1728 | c = tnode_get_child_rcu(p, idx++); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1729 | if (!c) |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1730 | continue; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1731 | |
Eric Dumazet | aab515d | 2013-08-05 11:18:49 -0700 | [diff] [blame] | 1732 | if (IS_LEAF(c)) |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1733 | return (struct leaf *) c; |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1734 | |
| 1735 | /* Rescan start scanning in new node */ |
| 1736 | p = (struct tnode *) c; |
| 1737 | idx = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1738 | } |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1739 | |
| 1740 | /* Node empty, walk back up to parent */ |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 1741 | c = (struct rt_trie_node *) p; |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 1742 | } while ((p = node_parent_rcu(c)) != NULL); |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1743 | |
| 1744 | return NULL; /* Root of trie */ |
| 1745 | } |
| 1746 | |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1747 | static struct leaf *trie_firstleaf(struct trie *t) |
| 1748 | { |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 1749 | struct tnode *n = (struct tnode *)rcu_dereference_rtnl(t->trie); |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1750 | |
| 1751 | if (!n) |
| 1752 | return NULL; |
| 1753 | |
| 1754 | if (IS_LEAF(n)) /* trie is just a leaf */ |
| 1755 | return (struct leaf *) n; |
| 1756 | |
| 1757 | return leaf_walk_rcu(n, NULL); |
| 1758 | } |
| 1759 | |
| 1760 | static struct leaf *trie_nextleaf(struct leaf *l) |
| 1761 | { |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 1762 | struct rt_trie_node *c = (struct rt_trie_node *) l; |
Jarek Poplawski | b902e57 | 2009-07-14 11:20:32 +0000 | [diff] [blame] | 1763 | struct tnode *p = node_parent_rcu(c); |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1764 | |
| 1765 | if (!p) |
| 1766 | return NULL; /* trie with just one leaf */ |
| 1767 | |
| 1768 | return leaf_walk_rcu(p, c); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1769 | } |
| 1770 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1771 | static struct leaf *trie_leafindex(struct trie *t, int index) |
| 1772 | { |
| 1773 | struct leaf *l = trie_firstleaf(t); |
| 1774 | |
Stephen Hemminger | ec28cf7 | 2008-02-11 21:12:49 -0800 | [diff] [blame] | 1775 | while (l && index-- > 0) |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1776 | l = trie_nextleaf(l); |
Stephen Hemminger | ec28cf7 | 2008-02-11 21:12:49 -0800 | [diff] [blame] | 1777 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1778 | return l; |
| 1779 | } |
| 1780 | |
| 1781 | |
Robert Olsson | d562f1f | 2007-03-26 14:22:22 -0700 | [diff] [blame] | 1782 | /* |
| 1783 | * Caller must hold RTNL. |
| 1784 | */ |
Stephen Hemminger | 16c6cf8 | 2009-09-20 10:35:36 +0000 | [diff] [blame] | 1785 | int fib_table_flush(struct fib_table *tb) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1786 | { |
| 1787 | struct trie *t = (struct trie *) tb->tb_data; |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1788 | struct leaf *l, *ll = NULL; |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1789 | int found = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1790 | |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1791 | for (l = trie_firstleaf(t); l; l = trie_nextleaf(l)) { |
Stephen Hemminger | ef3660c | 2008-04-10 03:46:12 -0700 | [diff] [blame] | 1792 | found += trie_flush_leaf(l); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1793 | |
| 1794 | if (ll && hlist_empty(&ll->list)) |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1795 | trie_leaf_remove(t, ll); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1796 | ll = l; |
| 1797 | } |
| 1798 | |
| 1799 | if (ll && hlist_empty(&ll->list)) |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1800 | trie_leaf_remove(t, ll); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1801 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 1802 | pr_debug("trie_flush found=%d\n", found); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1803 | return found; |
| 1804 | } |
| 1805 | |
Pavel Emelyanov | 4aa2c46 | 2010-10-28 02:00:43 +0000 | [diff] [blame] | 1806 | void fib_free_table(struct fib_table *tb) |
| 1807 | { |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 1808 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 1809 | struct trie *t = (struct trie *)tb->tb_data; |
| 1810 | |
| 1811 | free_percpu(t->stats); |
| 1812 | #endif /* CONFIG_IP_FIB_TRIE_STATS */ |
Pavel Emelyanov | 4aa2c46 | 2010-10-28 02:00:43 +0000 | [diff] [blame] | 1813 | kfree(tb); |
| 1814 | } |
| 1815 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1816 | static int fn_trie_dump_fa(t_key key, int plen, struct list_head *fah, |
| 1817 | struct fib_table *tb, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1818 | struct sk_buff *skb, struct netlink_callback *cb) |
| 1819 | { |
| 1820 | int i, s_i; |
| 1821 | struct fib_alias *fa; |
Al Viro | 32ab5f8 | 2006-09-26 22:21:45 -0700 | [diff] [blame] | 1822 | __be32 xkey = htonl(key); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1823 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1824 | s_i = cb->args[5]; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1825 | i = 0; |
| 1826 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1827 | /* rcu_read_lock is hold by caller */ |
| 1828 | |
| 1829 | list_for_each_entry_rcu(fa, fah, fa_list) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1830 | if (i < s_i) { |
| 1831 | i++; |
| 1832 | continue; |
| 1833 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1834 | |
Eric W. Biederman | 15e4730 | 2012-09-07 20:12:54 +0000 | [diff] [blame] | 1835 | if (fib_dump_info(skb, NETLINK_CB(cb->skb).portid, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1836 | cb->nlh->nlmsg_seq, |
| 1837 | RTM_NEWROUTE, |
| 1838 | tb->tb_id, |
| 1839 | fa->fa_type, |
Thomas Graf | be403ea | 2006-08-17 18:15:17 -0700 | [diff] [blame] | 1840 | xkey, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1841 | plen, |
| 1842 | fa->fa_tos, |
Stephen Hemminger | 64347f7 | 2008-01-22 21:55:01 -0800 | [diff] [blame] | 1843 | fa->fa_info, NLM_F_MULTI) < 0) { |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1844 | cb->args[5] = i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1845 | return -1; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1846 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1847 | i++; |
| 1848 | } |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1849 | cb->args[5] = i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1850 | return skb->len; |
| 1851 | } |
| 1852 | |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1853 | static int fn_trie_dump_leaf(struct leaf *l, struct fib_table *tb, |
| 1854 | struct sk_buff *skb, struct netlink_callback *cb) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1855 | { |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1856 | struct leaf_info *li; |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1857 | int i, s_i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1858 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1859 | s_i = cb->args[4]; |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1860 | i = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1861 | |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1862 | /* rcu_read_lock is hold by caller */ |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 1863 | hlist_for_each_entry_rcu(li, &l->list, hlist) { |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1864 | if (i < s_i) { |
| 1865 | i++; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1866 | continue; |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1867 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1868 | |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1869 | if (i > s_i) |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1870 | cb->args[5] = 0; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1871 | |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1872 | if (list_empty(&li->falh)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1873 | continue; |
| 1874 | |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1875 | if (fn_trie_dump_fa(l->key, li->plen, &li->falh, tb, skb, cb) < 0) { |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1876 | cb->args[4] = i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1877 | return -1; |
| 1878 | } |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1879 | i++; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1880 | } |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1881 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1882 | cb->args[4] = i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1883 | return skb->len; |
| 1884 | } |
| 1885 | |
Stephen Hemminger | 16c6cf8 | 2009-09-20 10:35:36 +0000 | [diff] [blame] | 1886 | int fib_table_dump(struct fib_table *tb, struct sk_buff *skb, |
| 1887 | struct netlink_callback *cb) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1888 | { |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1889 | struct leaf *l; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1890 | struct trie *t = (struct trie *) tb->tb_data; |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1891 | t_key key = cb->args[2]; |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1892 | int count = cb->args[3]; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1893 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1894 | rcu_read_lock(); |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1895 | /* Dump starting at last key. |
| 1896 | * Note: 0.0.0.0/0 (ie default) is first key. |
| 1897 | */ |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1898 | if (count == 0) |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1899 | l = trie_firstleaf(t); |
| 1900 | else { |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1901 | /* Normally, continue from last key, but if that is missing |
| 1902 | * fallback to using slow rescan |
| 1903 | */ |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1904 | l = fib_find_node(t, key); |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1905 | if (!l) |
| 1906 | l = trie_leafindex(t, count); |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1907 | } |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1908 | |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1909 | while (l) { |
| 1910 | cb->args[2] = l->key; |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1911 | if (fn_trie_dump_leaf(l, tb, skb, cb) < 0) { |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1912 | cb->args[3] = count; |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1913 | rcu_read_unlock(); |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1914 | return -1; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1915 | } |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1916 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1917 | ++count; |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1918 | l = trie_nextleaf(l); |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1919 | memset(&cb->args[4], 0, |
| 1920 | sizeof(cb->args) - 4*sizeof(cb->args[0])); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1921 | } |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1922 | cb->args[3] = count; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1923 | rcu_read_unlock(); |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1924 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1925 | return skb->len; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1926 | } |
| 1927 | |
David S. Miller | 5348ba8 | 2011-02-01 15:30:56 -0800 | [diff] [blame] | 1928 | void __init fib_trie_init(void) |
Stephen Hemminger | 7f9b805 | 2008-01-14 23:14:20 -0800 | [diff] [blame] | 1929 | { |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1930 | fn_alias_kmem = kmem_cache_create("ip_fib_alias", |
| 1931 | sizeof(struct fib_alias), |
Stephen Hemminger | bc3c8c1 | 2008-01-22 21:51:50 -0800 | [diff] [blame] | 1932 | 0, SLAB_PANIC, NULL); |
| 1933 | |
| 1934 | trie_leaf_kmem = kmem_cache_create("ip_fib_trie", |
| 1935 | max(sizeof(struct leaf), |
| 1936 | sizeof(struct leaf_info)), |
| 1937 | 0, SLAB_PANIC, NULL); |
Stephen Hemminger | 7f9b805 | 2008-01-14 23:14:20 -0800 | [diff] [blame] | 1938 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1939 | |
Stephen Hemminger | 7f9b805 | 2008-01-14 23:14:20 -0800 | [diff] [blame] | 1940 | |
David S. Miller | 5348ba8 | 2011-02-01 15:30:56 -0800 | [diff] [blame] | 1941 | struct fib_table *fib_trie_table(u32 id) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1942 | { |
| 1943 | struct fib_table *tb; |
| 1944 | struct trie *t; |
| 1945 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1946 | tb = kmalloc(sizeof(struct fib_table) + sizeof(struct trie), |
| 1947 | GFP_KERNEL); |
| 1948 | if (tb == NULL) |
| 1949 | return NULL; |
| 1950 | |
| 1951 | tb->tb_id = id; |
Denis V. Lunev | 971b893 | 2007-12-08 00:32:23 -0800 | [diff] [blame] | 1952 | tb->tb_default = -1; |
David S. Miller | 21d8c49 | 2011-04-14 14:49:37 -0700 | [diff] [blame] | 1953 | tb->tb_num_default = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1954 | |
| 1955 | t = (struct trie *) tb->tb_data; |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 1956 | RCU_INIT_POINTER(t->trie, NULL); |
| 1957 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 1958 | t->stats = alloc_percpu(struct trie_use_stats); |
| 1959 | if (!t->stats) { |
| 1960 | kfree(tb); |
| 1961 | tb = NULL; |
| 1962 | } |
| 1963 | #endif |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1964 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1965 | return tb; |
| 1966 | } |
| 1967 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1968 | #ifdef CONFIG_PROC_FS |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 1969 | /* Depth first Trie walk iterator */ |
| 1970 | struct fib_trie_iter { |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 1971 | struct seq_net_private p; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 1972 | struct fib_table *tb; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 1973 | struct tnode *tnode; |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 1974 | unsigned int index; |
| 1975 | unsigned int depth; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 1976 | }; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1977 | |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 1978 | static struct rt_trie_node *fib_trie_get_next(struct fib_trie_iter *iter) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1979 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 1980 | struct tnode *tn = iter->tnode; |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 1981 | unsigned int cindex = iter->index; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 1982 | struct tnode *p; |
| 1983 | |
Eric W. Biederman | 6640e69 | 2007-01-24 14:42:04 -0800 | [diff] [blame] | 1984 | /* A single entry routing table */ |
| 1985 | if (!tn) |
| 1986 | return NULL; |
| 1987 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 1988 | pr_debug("get_next iter={node=%p index=%d depth=%d}\n", |
| 1989 | iter->tnode, iter->index, iter->depth); |
| 1990 | rescan: |
| 1991 | while (cindex < (1<<tn->bits)) { |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 1992 | struct rt_trie_node *n = tnode_get_child_rcu(tn, cindex); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 1993 | |
| 1994 | if (n) { |
| 1995 | if (IS_LEAF(n)) { |
| 1996 | iter->tnode = tn; |
| 1997 | iter->index = cindex + 1; |
| 1998 | } else { |
| 1999 | /* push down one level */ |
| 2000 | iter->tnode = (struct tnode *) n; |
| 2001 | iter->index = 0; |
| 2002 | ++iter->depth; |
| 2003 | } |
| 2004 | return n; |
| 2005 | } |
| 2006 | |
| 2007 | ++cindex; |
| 2008 | } |
| 2009 | |
| 2010 | /* Current node exhausted, pop back up */ |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 2011 | p = node_parent_rcu((struct rt_trie_node *)tn); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2012 | if (p) { |
| 2013 | cindex = tkey_extract_bits(tn->key, p->pos, p->bits)+1; |
| 2014 | tn = p; |
| 2015 | --iter->depth; |
| 2016 | goto rescan; |
| 2017 | } |
| 2018 | |
| 2019 | /* got root? */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2020 | return NULL; |
| 2021 | } |
| 2022 | |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 2023 | static struct rt_trie_node *fib_trie_get_first(struct fib_trie_iter *iter, |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2024 | struct trie *t) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2025 | { |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 2026 | struct rt_trie_node *n; |
Robert Olsson | 5ddf0eb | 2006-03-20 21:34:12 -0800 | [diff] [blame] | 2027 | |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 2028 | if (!t) |
Robert Olsson | 5ddf0eb | 2006-03-20 21:34:12 -0800 | [diff] [blame] | 2029 | return NULL; |
| 2030 | |
| 2031 | n = rcu_dereference(t->trie); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2032 | if (!n) |
Robert Olsson | 5ddf0eb | 2006-03-20 21:34:12 -0800 | [diff] [blame] | 2033 | return NULL; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2034 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2035 | if (IS_TNODE(n)) { |
| 2036 | iter->tnode = (struct tnode *) n; |
| 2037 | iter->index = 0; |
| 2038 | iter->depth = 1; |
| 2039 | } else { |
| 2040 | iter->tnode = NULL; |
| 2041 | iter->index = 0; |
| 2042 | iter->depth = 0; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2043 | } |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2044 | |
| 2045 | return n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2046 | } |
| 2047 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2048 | static void trie_collect_stats(struct trie *t, struct trie_stat *s) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2049 | { |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 2050 | struct rt_trie_node *n; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2051 | struct fib_trie_iter iter; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2052 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2053 | memset(s, 0, sizeof(*s)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2054 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2055 | rcu_read_lock(); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2056 | 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] | 2057 | if (IS_LEAF(n)) { |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2058 | struct leaf *l = (struct leaf *)n; |
| 2059 | struct leaf_info *li; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2060 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2061 | s->leaves++; |
| 2062 | s->totdepth += iter.depth; |
| 2063 | if (iter.depth > s->maxdepth) |
| 2064 | s->maxdepth = iter.depth; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2065 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 2066 | hlist_for_each_entry_rcu(li, &l->list, hlist) |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2067 | ++s->prefixes; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2068 | } else { |
| 2069 | const struct tnode *tn = (const struct tnode *) n; |
| 2070 | int i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2071 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2072 | s->tnodes++; |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 2073 | if (tn->bits < MAX_STAT_DEPTH) |
Robert Olsson | 06ef921 | 2006-03-20 21:35:01 -0800 | [diff] [blame] | 2074 | s->nodesizes[tn->bits]++; |
| 2075 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2076 | for (i = 0; i < (1<<tn->bits); i++) |
| 2077 | if (!tn->child[i]) |
| 2078 | s->nullpointers++; |
| 2079 | } |
| 2080 | } |
| 2081 | rcu_read_unlock(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2082 | } |
| 2083 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 2084 | /* |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2085 | * This outputs /proc/net/fib_triestats |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2086 | */ |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2087 | 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] | 2088 | { |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2089 | unsigned int i, max, pointers, bytes, avdepth; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2090 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2091 | if (stat->leaves) |
| 2092 | avdepth = stat->totdepth*100 / stat->leaves; |
| 2093 | else |
| 2094 | avdepth = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2095 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2096 | seq_printf(seq, "\tAver depth: %u.%02d\n", |
| 2097 | avdepth / 100, avdepth % 100); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2098 | seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2099 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2100 | seq_printf(seq, "\tLeaves: %u\n", stat->leaves); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2101 | bytes = sizeof(struct leaf) * stat->leaves; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2102 | |
| 2103 | seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes); |
| 2104 | bytes += sizeof(struct leaf_info) * stat->prefixes; |
| 2105 | |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2106 | seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2107 | bytes += sizeof(struct tnode) * stat->tnodes; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2108 | |
Robert Olsson | 06ef921 | 2006-03-20 21:35:01 -0800 | [diff] [blame] | 2109 | max = MAX_STAT_DEPTH; |
| 2110 | while (max > 0 && stat->nodesizes[max-1] == 0) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2111 | max--; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2112 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2113 | pointers = 0; |
Jerry Snitselaar | f585a99 | 2013-07-22 12:01:58 -0700 | [diff] [blame] | 2114 | for (i = 1; i < max; i++) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2115 | if (stat->nodesizes[i] != 0) { |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2116 | seq_printf(seq, " %u: %u", i, stat->nodesizes[i]); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2117 | pointers += (1<<i) * stat->nodesizes[i]; |
| 2118 | } |
| 2119 | seq_putc(seq, '\n'); |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2120 | seq_printf(seq, "\tPointers: %u\n", pointers); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2121 | |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 2122 | bytes += sizeof(struct rt_trie_node *) * pointers; |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2123 | seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers); |
| 2124 | seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024); |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2125 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2126 | |
| 2127 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2128 | static void trie_show_usage(struct seq_file *seq, |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2129 | const struct trie_use_stats __percpu *stats) |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2130 | { |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2131 | struct trie_use_stats s = { 0 }; |
| 2132 | int cpu; |
| 2133 | |
| 2134 | /* loop through all of the CPUs and gather up the stats */ |
| 2135 | for_each_possible_cpu(cpu) { |
| 2136 | const struct trie_use_stats *pcpu = per_cpu_ptr(stats, cpu); |
| 2137 | |
| 2138 | s.gets += pcpu->gets; |
| 2139 | s.backtrack += pcpu->backtrack; |
| 2140 | s.semantic_match_passed += pcpu->semantic_match_passed; |
| 2141 | s.semantic_match_miss += pcpu->semantic_match_miss; |
| 2142 | s.null_node_hit += pcpu->null_node_hit; |
| 2143 | s.resize_node_skipped += pcpu->resize_node_skipped; |
| 2144 | } |
| 2145 | |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2146 | seq_printf(seq, "\nCounters:\n---------\n"); |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2147 | seq_printf(seq, "gets = %u\n", s.gets); |
| 2148 | seq_printf(seq, "backtracks = %u\n", s.backtrack); |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2149 | seq_printf(seq, "semantic match passed = %u\n", |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2150 | s.semantic_match_passed); |
| 2151 | seq_printf(seq, "semantic match miss = %u\n", s.semantic_match_miss); |
| 2152 | seq_printf(seq, "null node hit= %u\n", s.null_node_hit); |
| 2153 | 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] | 2154 | } |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2155 | #endif /* CONFIG_IP_FIB_TRIE_STATS */ |
| 2156 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2157 | 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] | 2158 | { |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2159 | if (tb->tb_id == RT_TABLE_LOCAL) |
| 2160 | seq_puts(seq, "Local:\n"); |
| 2161 | else if (tb->tb_id == RT_TABLE_MAIN) |
| 2162 | seq_puts(seq, "Main:\n"); |
| 2163 | else |
| 2164 | seq_printf(seq, "Id %d:\n", tb->tb_id); |
Stephen Hemminger | d717a9a | 2008-01-14 23:11:54 -0800 | [diff] [blame] | 2165 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2166 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2167 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2168 | static int fib_triestat_seq_show(struct seq_file *seq, void *v) |
| 2169 | { |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2170 | struct net *net = (struct net *)seq->private; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2171 | unsigned int h; |
Eric W. Biederman | 877a9bf | 2007-12-07 00:47:47 -0800 | [diff] [blame] | 2172 | |
Stephen Hemminger | d717a9a | 2008-01-14 23:11:54 -0800 | [diff] [blame] | 2173 | seq_printf(seq, |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2174 | "Basic info: size of leaf:" |
| 2175 | " %Zd bytes, size of tnode: %Zd bytes.\n", |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2176 | sizeof(struct leaf), sizeof(struct tnode)); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 2177 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2178 | for (h = 0; h < FIB_TABLE_HASHSZ; h++) { |
| 2179 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2180 | struct fib_table *tb; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2181 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 2182 | hlist_for_each_entry_rcu(tb, head, tb_hlist) { |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2183 | struct trie *t = (struct trie *) tb->tb_data; |
| 2184 | struct trie_stat stat; |
| 2185 | |
| 2186 | if (!t) |
| 2187 | continue; |
| 2188 | |
| 2189 | fib_table_print(seq, tb); |
| 2190 | |
| 2191 | trie_collect_stats(t, &stat); |
| 2192 | trie_show_stats(seq, &stat); |
| 2193 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Alexander Duyck | 8274a97 | 2014-12-31 10:55:29 -0800 | [diff] [blame] | 2194 | trie_show_usage(seq, t->stats); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2195 | #endif |
| 2196 | } |
| 2197 | } |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2198 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2199 | return 0; |
| 2200 | } |
| 2201 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2202 | static int fib_triestat_seq_open(struct inode *inode, struct file *file) |
| 2203 | { |
Pavel Emelyanov | de05c55 | 2008-07-18 04:07:21 -0700 | [diff] [blame] | 2204 | return single_open_net(inode, file, fib_triestat_seq_show); |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2205 | } |
| 2206 | |
Arjan van de Ven | 9a32144 | 2007-02-12 00:55:35 -0800 | [diff] [blame] | 2207 | static const struct file_operations fib_triestat_fops = { |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 2208 | .owner = THIS_MODULE, |
| 2209 | .open = fib_triestat_seq_open, |
| 2210 | .read = seq_read, |
| 2211 | .llseek = seq_lseek, |
Pavel Emelyanov | b6fcbdb | 2008-07-18 04:07:44 -0700 | [diff] [blame] | 2212 | .release = single_release_net, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2213 | }; |
| 2214 | |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 2215 | static struct rt_trie_node *fib_trie_get_idx(struct seq_file *seq, loff_t pos) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2216 | { |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2217 | struct fib_trie_iter *iter = seq->private; |
| 2218 | struct net *net = seq_file_net(seq); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2219 | loff_t idx = 0; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2220 | unsigned int h; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2221 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2222 | for (h = 0; h < FIB_TABLE_HASHSZ; h++) { |
| 2223 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2224 | struct fib_table *tb; |
| 2225 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 2226 | hlist_for_each_entry_rcu(tb, head, tb_hlist) { |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 2227 | struct rt_trie_node *n; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2228 | |
| 2229 | for (n = fib_trie_get_first(iter, |
| 2230 | (struct trie *) tb->tb_data); |
| 2231 | n; n = fib_trie_get_next(iter)) |
| 2232 | if (pos == idx++) { |
| 2233 | iter->tb = tb; |
| 2234 | return n; |
| 2235 | } |
| 2236 | } |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2237 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2238 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2239 | return NULL; |
| 2240 | } |
| 2241 | |
| 2242 | 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] | 2243 | __acquires(RCU) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2244 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2245 | rcu_read_lock(); |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2246 | return fib_trie_get_idx(seq, *pos); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2247 | } |
| 2248 | |
| 2249 | static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
| 2250 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2251 | struct fib_trie_iter *iter = seq->private; |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2252 | struct net *net = seq_file_net(seq); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2253 | struct fib_table *tb = iter->tb; |
| 2254 | struct hlist_node *tb_node; |
| 2255 | unsigned int h; |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 2256 | struct rt_trie_node *n; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2257 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2258 | ++*pos; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2259 | /* next node in same table */ |
| 2260 | n = fib_trie_get_next(iter); |
| 2261 | if (n) |
| 2262 | return n; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 2263 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2264 | /* walk rest of this hash chain */ |
| 2265 | h = tb->tb_id & (FIB_TABLE_HASHSZ - 1); |
Eric Dumazet | 0a5c047 | 2011-03-31 01:51:35 -0700 | [diff] [blame] | 2266 | while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) { |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2267 | tb = hlist_entry(tb_node, struct fib_table, tb_hlist); |
| 2268 | n = fib_trie_get_first(iter, (struct trie *) tb->tb_data); |
| 2269 | if (n) |
| 2270 | goto found; |
| 2271 | } |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2272 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2273 | /* new hash chain */ |
| 2274 | while (++h < FIB_TABLE_HASHSZ) { |
| 2275 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 2276 | hlist_for_each_entry_rcu(tb, head, tb_hlist) { |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2277 | n = fib_trie_get_first(iter, (struct trie *) tb->tb_data); |
| 2278 | if (n) |
| 2279 | goto found; |
| 2280 | } |
| 2281 | } |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2282 | return NULL; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2283 | |
| 2284 | found: |
| 2285 | iter->tb = tb; |
| 2286 | return n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2287 | } |
| 2288 | |
| 2289 | static void fib_trie_seq_stop(struct seq_file *seq, void *v) |
Stephen Hemminger | c95aaf9 | 2008-01-12 21:25:02 -0800 | [diff] [blame] | 2290 | __releases(RCU) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2291 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2292 | rcu_read_unlock(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2293 | } |
| 2294 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2295 | static void seq_indent(struct seq_file *seq, int n) |
| 2296 | { |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2297 | while (n-- > 0) |
| 2298 | seq_puts(seq, " "); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2299 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2300 | |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2301 | 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] | 2302 | { |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 2303 | switch (s) { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2304 | case RT_SCOPE_UNIVERSE: return "universe"; |
| 2305 | case RT_SCOPE_SITE: return "site"; |
| 2306 | case RT_SCOPE_LINK: return "link"; |
| 2307 | case RT_SCOPE_HOST: return "host"; |
| 2308 | case RT_SCOPE_NOWHERE: return "nowhere"; |
| 2309 | default: |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2310 | snprintf(buf, len, "scope=%d", s); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2311 | return buf; |
| 2312 | } |
| 2313 | } |
| 2314 | |
Jan Engelhardt | 36cbd3d | 2009-08-05 10:42:58 -0700 | [diff] [blame] | 2315 | static const char *const rtn_type_names[__RTN_MAX] = { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2316 | [RTN_UNSPEC] = "UNSPEC", |
| 2317 | [RTN_UNICAST] = "UNICAST", |
| 2318 | [RTN_LOCAL] = "LOCAL", |
| 2319 | [RTN_BROADCAST] = "BROADCAST", |
| 2320 | [RTN_ANYCAST] = "ANYCAST", |
| 2321 | [RTN_MULTICAST] = "MULTICAST", |
| 2322 | [RTN_BLACKHOLE] = "BLACKHOLE", |
| 2323 | [RTN_UNREACHABLE] = "UNREACHABLE", |
| 2324 | [RTN_PROHIBIT] = "PROHIBIT", |
| 2325 | [RTN_THROW] = "THROW", |
| 2326 | [RTN_NAT] = "NAT", |
| 2327 | [RTN_XRESOLVE] = "XRESOLVE", |
| 2328 | }; |
| 2329 | |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2330 | 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] | 2331 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2332 | if (t < __RTN_MAX && rtn_type_names[t]) |
| 2333 | return rtn_type_names[t]; |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2334 | snprintf(buf, len, "type %u", t); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2335 | return buf; |
| 2336 | } |
| 2337 | |
| 2338 | /* Pretty print the trie */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2339 | static int fib_trie_seq_show(struct seq_file *seq, void *v) |
| 2340 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2341 | const struct fib_trie_iter *iter = seq->private; |
David S. Miller | b299e4f | 2011-02-02 20:48:10 -0800 | [diff] [blame] | 2342 | struct rt_trie_node *n = v; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2343 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2344 | if (!node_parent_rcu(n)) |
| 2345 | fib_table_print(seq, iter->tb); |
Robert Olsson | 095b850 | 2007-01-26 19:06:01 -0800 | [diff] [blame] | 2346 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2347 | if (IS_TNODE(n)) { |
| 2348 | struct tnode *tn = (struct tnode *) n; |
Alexander Duyck | 64c9b6f | 2014-12-31 10:55:35 -0800 | [diff] [blame^] | 2349 | __be32 prf = htonl(tn->key); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2350 | |
Robert Olsson | 1d25cd6 | 2005-09-19 15:29:52 -0700 | [diff] [blame] | 2351 | seq_indent(seq, iter->depth-1); |
Harvey Harrison | 673d57e | 2008-10-31 00:53:57 -0700 | [diff] [blame] | 2352 | seq_printf(seq, " +-- %pI4/%d %d %d %d\n", |
| 2353 | &prf, tn->pos, tn->bits, tn->full_children, |
Robert Olsson | 1d25cd6 | 2005-09-19 15:29:52 -0700 | [diff] [blame] | 2354 | tn->empty_children); |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 2355 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 2356 | } else { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2357 | struct leaf *l = (struct leaf *) n; |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2358 | struct leaf_info *li; |
Al Viro | 32ab5f8 | 2006-09-26 22:21:45 -0700 | [diff] [blame] | 2359 | __be32 val = htonl(l->key); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2360 | |
| 2361 | seq_indent(seq, iter->depth); |
Harvey Harrison | 673d57e | 2008-10-31 00:53:57 -0700 | [diff] [blame] | 2362 | seq_printf(seq, " |-- %pI4\n", &val); |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2363 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 2364 | hlist_for_each_entry_rcu(li, &l->list, hlist) { |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2365 | struct fib_alias *fa; |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2366 | |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2367 | list_for_each_entry_rcu(fa, &li->falh, fa_list) { |
| 2368 | char buf1[32], buf2[32]; |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2369 | |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2370 | seq_indent(seq, iter->depth+1); |
| 2371 | seq_printf(seq, " /%d %s %s", li->plen, |
| 2372 | rtn_scope(buf1, sizeof(buf1), |
David S. Miller | 37e826c | 2011-03-24 18:06:47 -0700 | [diff] [blame] | 2373 | fa->fa_info->fib_scope), |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2374 | rtn_type(buf2, sizeof(buf2), |
| 2375 | fa->fa_type)); |
| 2376 | if (fa->fa_tos) |
Denis V. Lunev | b9c4d82 | 2008-02-05 02:58:45 -0800 | [diff] [blame] | 2377 | seq_printf(seq, " tos=%d", fa->fa_tos); |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2378 | seq_putc(seq, '\n'); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2379 | } |
| 2380 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2381 | } |
| 2382 | |
| 2383 | return 0; |
| 2384 | } |
| 2385 | |
Stephen Hemminger | f690808 | 2007-03-12 14:34:29 -0700 | [diff] [blame] | 2386 | static const struct seq_operations fib_trie_seq_ops = { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2387 | .start = fib_trie_seq_start, |
| 2388 | .next = fib_trie_seq_next, |
| 2389 | .stop = fib_trie_seq_stop, |
| 2390 | .show = fib_trie_seq_show, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2391 | }; |
| 2392 | |
| 2393 | static int fib_trie_seq_open(struct inode *inode, struct file *file) |
| 2394 | { |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2395 | return seq_open_net(inode, file, &fib_trie_seq_ops, |
| 2396 | sizeof(struct fib_trie_iter)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2397 | } |
| 2398 | |
Arjan van de Ven | 9a32144 | 2007-02-12 00:55:35 -0800 | [diff] [blame] | 2399 | static const struct file_operations fib_trie_fops = { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2400 | .owner = THIS_MODULE, |
| 2401 | .open = fib_trie_seq_open, |
| 2402 | .read = seq_read, |
| 2403 | .llseek = seq_lseek, |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2404 | .release = seq_release_net, |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2405 | }; |
| 2406 | |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2407 | struct fib_route_iter { |
| 2408 | struct seq_net_private p; |
| 2409 | struct trie *main_trie; |
| 2410 | loff_t pos; |
| 2411 | t_key key; |
| 2412 | }; |
| 2413 | |
| 2414 | static struct leaf *fib_route_get_idx(struct fib_route_iter *iter, loff_t pos) |
| 2415 | { |
| 2416 | struct leaf *l = NULL; |
| 2417 | struct trie *t = iter->main_trie; |
| 2418 | |
| 2419 | /* use cache location of last found key */ |
| 2420 | if (iter->pos > 0 && pos >= iter->pos && (l = fib_find_node(t, iter->key))) |
| 2421 | pos -= iter->pos; |
| 2422 | else { |
| 2423 | iter->pos = 0; |
| 2424 | l = trie_firstleaf(t); |
| 2425 | } |
| 2426 | |
| 2427 | while (l && pos-- > 0) { |
| 2428 | iter->pos++; |
| 2429 | l = trie_nextleaf(l); |
| 2430 | } |
| 2431 | |
| 2432 | if (l) |
| 2433 | iter->key = pos; /* remember it */ |
| 2434 | else |
| 2435 | iter->pos = 0; /* forget it */ |
| 2436 | |
| 2437 | return l; |
| 2438 | } |
| 2439 | |
| 2440 | static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos) |
| 2441 | __acquires(RCU) |
| 2442 | { |
| 2443 | struct fib_route_iter *iter = seq->private; |
| 2444 | struct fib_table *tb; |
| 2445 | |
| 2446 | rcu_read_lock(); |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2447 | tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN); |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2448 | if (!tb) |
| 2449 | return NULL; |
| 2450 | |
| 2451 | iter->main_trie = (struct trie *) tb->tb_data; |
| 2452 | if (*pos == 0) |
| 2453 | return SEQ_START_TOKEN; |
| 2454 | else |
| 2455 | return fib_route_get_idx(iter, *pos - 1); |
| 2456 | } |
| 2457 | |
| 2458 | static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
| 2459 | { |
| 2460 | struct fib_route_iter *iter = seq->private; |
| 2461 | struct leaf *l = v; |
| 2462 | |
| 2463 | ++*pos; |
| 2464 | if (v == SEQ_START_TOKEN) { |
| 2465 | iter->pos = 0; |
| 2466 | l = trie_firstleaf(iter->main_trie); |
| 2467 | } else { |
| 2468 | iter->pos++; |
| 2469 | l = trie_nextleaf(l); |
| 2470 | } |
| 2471 | |
| 2472 | if (l) |
| 2473 | iter->key = l->key; |
| 2474 | else |
| 2475 | iter->pos = 0; |
| 2476 | return l; |
| 2477 | } |
| 2478 | |
| 2479 | static void fib_route_seq_stop(struct seq_file *seq, void *v) |
| 2480 | __releases(RCU) |
| 2481 | { |
| 2482 | rcu_read_unlock(); |
| 2483 | } |
| 2484 | |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2485 | static unsigned int fib_flag_trans(int type, __be32 mask, const struct fib_info *fi) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2486 | { |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2487 | unsigned int flags = 0; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2488 | |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2489 | if (type == RTN_UNREACHABLE || type == RTN_PROHIBIT) |
| 2490 | flags = RTF_REJECT; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2491 | if (fi && fi->fib_nh->nh_gw) |
| 2492 | flags |= RTF_GATEWAY; |
Al Viro | 32ab5f8 | 2006-09-26 22:21:45 -0700 | [diff] [blame] | 2493 | if (mask == htonl(0xFFFFFFFF)) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2494 | flags |= RTF_HOST; |
| 2495 | flags |= RTF_UP; |
| 2496 | return flags; |
| 2497 | } |
| 2498 | |
| 2499 | /* |
| 2500 | * This outputs /proc/net/route. |
| 2501 | * The format of the file is not supposed to be changed |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2502 | * and needs to be same as fib_hash output to avoid breaking |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2503 | * legacy utilities |
| 2504 | */ |
| 2505 | static int fib_route_seq_show(struct seq_file *seq, void *v) |
| 2506 | { |
| 2507 | struct leaf *l = v; |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2508 | struct leaf_info *li; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2509 | |
| 2510 | if (v == SEQ_START_TOKEN) { |
| 2511 | seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway " |
| 2512 | "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU" |
| 2513 | "\tWindow\tIRTT"); |
| 2514 | return 0; |
| 2515 | } |
| 2516 | |
Sasha Levin | b67bfe0 | 2013-02-27 17:06:00 -0800 | [diff] [blame] | 2517 | hlist_for_each_entry_rcu(li, &l->list, hlist) { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2518 | struct fib_alias *fa; |
Al Viro | 32ab5f8 | 2006-09-26 22:21:45 -0700 | [diff] [blame] | 2519 | __be32 mask, prefix; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2520 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2521 | mask = inet_make_mask(li->plen); |
| 2522 | prefix = htonl(l->key); |
| 2523 | |
| 2524 | list_for_each_entry_rcu(fa, &li->falh, fa_list) { |
Herbert Xu | 1371e37 | 2005-10-15 09:42:39 +1000 | [diff] [blame] | 2525 | const struct fib_info *fi = fa->fa_info; |
Eric Dumazet | a034ee3 | 2010-09-09 23:32:28 +0000 | [diff] [blame] | 2526 | unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2527 | |
| 2528 | if (fa->fa_type == RTN_BROADCAST |
| 2529 | || fa->fa_type == RTN_MULTICAST) |
| 2530 | continue; |
| 2531 | |
Tetsuo Handa | 652586d | 2013-11-14 14:31:57 -0800 | [diff] [blame] | 2532 | seq_setwidth(seq, 127); |
| 2533 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2534 | if (fi) |
Pavel Emelyanov | 5e659e4 | 2008-04-24 01:02:16 -0700 | [diff] [blame] | 2535 | seq_printf(seq, |
| 2536 | "%s\t%08X\t%08X\t%04X\t%d\t%u\t" |
Tetsuo Handa | 652586d | 2013-11-14 14:31:57 -0800 | [diff] [blame] | 2537 | "%d\t%08X\t%d\t%u\t%u", |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2538 | fi->fib_dev ? fi->fib_dev->name : "*", |
| 2539 | prefix, |
| 2540 | fi->fib_nh->nh_gw, flags, 0, 0, |
| 2541 | fi->fib_priority, |
| 2542 | mask, |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2543 | (fi->fib_advmss ? |
| 2544 | fi->fib_advmss + 40 : 0), |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2545 | fi->fib_window, |
Tetsuo Handa | 652586d | 2013-11-14 14:31:57 -0800 | [diff] [blame] | 2546 | fi->fib_rtt >> 3); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2547 | else |
Pavel Emelyanov | 5e659e4 | 2008-04-24 01:02:16 -0700 | [diff] [blame] | 2548 | seq_printf(seq, |
| 2549 | "*\t%08X\t%08X\t%04X\t%d\t%u\t" |
Tetsuo Handa | 652586d | 2013-11-14 14:31:57 -0800 | [diff] [blame] | 2550 | "%d\t%08X\t%d\t%u\t%u", |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2551 | prefix, 0, flags, 0, 0, 0, |
Tetsuo Handa | 652586d | 2013-11-14 14:31:57 -0800 | [diff] [blame] | 2552 | mask, 0, 0, 0); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2553 | |
Tetsuo Handa | 652586d | 2013-11-14 14:31:57 -0800 | [diff] [blame] | 2554 | seq_pad(seq, '\n'); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2555 | } |
| 2556 | } |
| 2557 | |
| 2558 | return 0; |
| 2559 | } |
| 2560 | |
Stephen Hemminger | f690808 | 2007-03-12 14:34:29 -0700 | [diff] [blame] | 2561 | static const struct seq_operations fib_route_seq_ops = { |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2562 | .start = fib_route_seq_start, |
| 2563 | .next = fib_route_seq_next, |
| 2564 | .stop = fib_route_seq_stop, |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2565 | .show = fib_route_seq_show, |
| 2566 | }; |
| 2567 | |
| 2568 | static int fib_route_seq_open(struct inode *inode, struct file *file) |
| 2569 | { |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2570 | return seq_open_net(inode, file, &fib_route_seq_ops, |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2571 | sizeof(struct fib_route_iter)); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2572 | } |
| 2573 | |
Arjan van de Ven | 9a32144 | 2007-02-12 00:55:35 -0800 | [diff] [blame] | 2574 | static const struct file_operations fib_route_fops = { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2575 | .owner = THIS_MODULE, |
| 2576 | .open = fib_route_seq_open, |
| 2577 | .read = seq_read, |
| 2578 | .llseek = seq_lseek, |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2579 | .release = seq_release_net, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2580 | }; |
| 2581 | |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 2582 | int __net_init fib_proc_init(struct net *net) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2583 | { |
Gao feng | d4beaa6 | 2013-02-18 01:34:54 +0000 | [diff] [blame] | 2584 | if (!proc_create("fib_trie", S_IRUGO, net->proc_net, &fib_trie_fops)) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2585 | goto out1; |
| 2586 | |
Gao feng | d4beaa6 | 2013-02-18 01:34:54 +0000 | [diff] [blame] | 2587 | if (!proc_create("fib_triestat", S_IRUGO, net->proc_net, |
| 2588 | &fib_triestat_fops)) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2589 | goto out2; |
| 2590 | |
Gao feng | d4beaa6 | 2013-02-18 01:34:54 +0000 | [diff] [blame] | 2591 | if (!proc_create("route", S_IRUGO, net->proc_net, &fib_route_fops)) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2592 | goto out3; |
| 2593 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2594 | return 0; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2595 | |
| 2596 | out3: |
Gao feng | ece31ff | 2013-02-18 01:34:56 +0000 | [diff] [blame] | 2597 | remove_proc_entry("fib_triestat", net->proc_net); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2598 | out2: |
Gao feng | ece31ff | 2013-02-18 01:34:56 +0000 | [diff] [blame] | 2599 | remove_proc_entry("fib_trie", net->proc_net); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2600 | out1: |
| 2601 | return -ENOMEM; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2602 | } |
| 2603 | |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 2604 | void __net_exit fib_proc_exit(struct net *net) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2605 | { |
Gao feng | ece31ff | 2013-02-18 01:34:56 +0000 | [diff] [blame] | 2606 | remove_proc_entry("fib_trie", net->proc_net); |
| 2607 | remove_proc_entry("fib_triestat", net->proc_net); |
| 2608 | remove_proc_entry("route", net->proc_net); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2609 | } |
| 2610 | |
| 2611 | #endif /* CONFIG_PROC_FS */ |