]>
Commit | Line | Data |
---|---|---|
19baf839 RO |
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 | * | |
e905a9ed | 10 | * Jens Laas <jens.laas@data.slu.se> Swedish University of |
19baf839 | 11 | * Agricultural Sciences. |
e905a9ed | 12 | * |
19baf839 RO |
13 | * Hans Liss <hans.liss@its.uu.se> Uppsala Universitet |
14 | * | |
25985edc | 15 | * This work is based on the LPC-trie which is originally described in: |
e905a9ed | 16 | * |
19baf839 RO |
17 | * An experimental study of compression methods for dynamic tries |
18 | * Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002. | |
631dd1a8 | 19 | * http://www.csc.kth.se/~snilsson/software/dyntrie2/ |
19baf839 RO |
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 | * | |
19baf839 RO |
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. | |
fd966255 RO |
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> | |
19baf839 RO |
49 | */ |
50 | ||
80b71b80 | 51 | #define VERSION "0.409" |
19baf839 | 52 | |
19baf839 | 53 | #include <asm/uaccess.h> |
1977f032 | 54 | #include <linux/bitops.h> |
19baf839 RO |
55 | #include <linux/types.h> |
56 | #include <linux/kernel.h> | |
19baf839 RO |
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> | |
cd8787ab | 64 | #include <linux/inetdevice.h> |
19baf839 RO |
65 | #include <linux/netdevice.h> |
66 | #include <linux/if_arp.h> | |
67 | #include <linux/proc_fs.h> | |
2373ce1c | 68 | #include <linux/rcupdate.h> |
19baf839 RO |
69 | #include <linux/skbuff.h> |
70 | #include <linux/netlink.h> | |
71 | #include <linux/init.h> | |
72 | #include <linux/list.h> | |
5a0e3ad6 | 73 | #include <linux/slab.h> |
bc3b2d7f | 74 | #include <linux/export.h> |
457c4cbc | 75 | #include <net/net_namespace.h> |
19baf839 RO |
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> | |
8e05fd71 | 82 | #include <net/switchdev.h> |
19baf839 RO |
83 | #include "fib_lookup.h" |
84 | ||
06ef921d | 85 | #define MAX_STAT_DEPTH 32 |
19baf839 | 86 | |
95f60ea3 AD |
87 | #define KEYLENGTH (8*sizeof(t_key)) |
88 | #define KEY_MAX ((t_key)~0) | |
19baf839 | 89 | |
19baf839 RO |
90 | typedef unsigned int t_key; |
91 | ||
88bae714 AD |
92 | #define IS_TRIE(n) ((n)->pos >= KEYLENGTH) |
93 | #define IS_TNODE(n) ((n)->bits) | |
94 | #define IS_LEAF(n) (!(n)->bits) | |
2373ce1c | 95 | |
35c6edac | 96 | struct key_vector { |
64c9b6fb | 97 | t_key key; |
64c9b6fb | 98 | unsigned char pos; /* 2log(KEYLENGTH) bits needed */ |
41b489fd | 99 | unsigned char bits; /* 2log(KEYLENGTH) bits needed */ |
5405afd1 | 100 | unsigned char slen; |
adaf9816 | 101 | union { |
41b489fd | 102 | /* This list pointer if valid if (pos | bits) == 0 (LEAF) */ |
79e5ad2c | 103 | struct hlist_head leaf; |
41b489fd | 104 | /* This array is valid if (pos | bits) > 0 (TNODE) */ |
35c6edac | 105 | struct key_vector __rcu *tnode[0]; |
adaf9816 | 106 | }; |
19baf839 RO |
107 | }; |
108 | ||
dc35dbed | 109 | struct tnode { |
56ca2adf | 110 | struct rcu_head rcu; |
6e22d174 AD |
111 | t_key empty_children; /* KEYLENGTH bits needed */ |
112 | t_key full_children; /* KEYLENGTH bits needed */ | |
f23e59fb | 113 | struct key_vector __rcu *parent; |
dc35dbed | 114 | struct key_vector kv[1]; |
56ca2adf | 115 | #define tn_bits kv[0].bits |
dc35dbed AD |
116 | }; |
117 | ||
118 | #define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n]) | |
41b489fd AD |
119 | #define LEAF_SIZE TNODE_SIZE(1) |
120 | ||
19baf839 RO |
121 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
122 | struct trie_use_stats { | |
123 | unsigned int gets; | |
124 | unsigned int backtrack; | |
125 | unsigned int semantic_match_passed; | |
126 | unsigned int semantic_match_miss; | |
127 | unsigned int null_node_hit; | |
2f36895a | 128 | unsigned int resize_node_skipped; |
19baf839 RO |
129 | }; |
130 | #endif | |
131 | ||
132 | struct trie_stat { | |
133 | unsigned int totdepth; | |
134 | unsigned int maxdepth; | |
135 | unsigned int tnodes; | |
136 | unsigned int leaves; | |
137 | unsigned int nullpointers; | |
93672292 | 138 | unsigned int prefixes; |
06ef921d | 139 | unsigned int nodesizes[MAX_STAT_DEPTH]; |
c877efb2 | 140 | }; |
19baf839 RO |
141 | |
142 | struct trie { | |
88bae714 | 143 | struct key_vector kv[1]; |
19baf839 | 144 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
8274a97a | 145 | struct trie_use_stats __percpu *stats; |
19baf839 | 146 | #endif |
19baf839 RO |
147 | }; |
148 | ||
88bae714 | 149 | static struct key_vector *resize(struct trie *t, struct key_vector *tn); |
c3059477 JP |
150 | static size_t tnode_free_size; |
151 | ||
152 | /* | |
153 | * synchronize_rcu after call_rcu for that many pages; it should be especially | |
154 | * useful before resizing the root node with PREEMPT_NONE configs; the value was | |
155 | * obtained experimentally, aiming to avoid visible slowdown. | |
156 | */ | |
157 | static const int sync_pages = 128; | |
19baf839 | 158 | |
e18b890b | 159 | static struct kmem_cache *fn_alias_kmem __read_mostly; |
bc3c8c1e | 160 | static struct kmem_cache *trie_leaf_kmem __read_mostly; |
19baf839 | 161 | |
56ca2adf AD |
162 | static inline struct tnode *tn_info(struct key_vector *kv) |
163 | { | |
164 | return container_of(kv, struct tnode, kv[0]); | |
165 | } | |
166 | ||
64c9b6fb | 167 | /* caller must hold RTNL */ |
f23e59fb | 168 | #define node_parent(tn) rtnl_dereference(tn_info(tn)->parent) |
754baf8d | 169 | #define get_child(tn, i) rtnl_dereference((tn)->tnode[i]) |
0a5c0475 | 170 | |
64c9b6fb | 171 | /* caller must hold RCU read lock or RTNL */ |
f23e59fb | 172 | #define node_parent_rcu(tn) rcu_dereference_rtnl(tn_info(tn)->parent) |
754baf8d | 173 | #define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i]) |
0a5c0475 | 174 | |
64c9b6fb | 175 | /* wrapper for rcu_assign_pointer */ |
35c6edac | 176 | static inline void node_set_parent(struct key_vector *n, struct key_vector *tp) |
b59cfbf7 | 177 | { |
adaf9816 | 178 | if (n) |
f23e59fb | 179 | rcu_assign_pointer(tn_info(n)->parent, tp); |
06801916 SH |
180 | } |
181 | ||
f23e59fb | 182 | #define NODE_INIT_PARENT(n, p) RCU_INIT_POINTER(tn_info(n)->parent, p) |
64c9b6fb AD |
183 | |
184 | /* This provides us with the number of children in this node, in the case of a | |
185 | * leaf this will return 0 meaning none of the children are accessible. | |
6440cc9e | 186 | */ |
2e1ac88a | 187 | static inline unsigned long child_length(const struct key_vector *tn) |
06801916 | 188 | { |
64c9b6fb | 189 | return (1ul << tn->bits) & ~(1ul); |
06801916 | 190 | } |
2373ce1c | 191 | |
88bae714 AD |
192 | #define get_cindex(key, kv) (((key) ^ (kv)->key) >> (kv)->pos) |
193 | ||
2e1ac88a AD |
194 | static inline unsigned long get_index(t_key key, struct key_vector *kv) |
195 | { | |
196 | unsigned long index = key ^ kv->key; | |
197 | ||
88bae714 AD |
198 | if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos)) |
199 | return 0; | |
200 | ||
2e1ac88a AD |
201 | return index >> kv->pos; |
202 | } | |
203 | ||
e9b44019 AD |
204 | /* To understand this stuff, an understanding of keys and all their bits is |
205 | * necessary. Every node in the trie has a key associated with it, but not | |
206 | * all of the bits in that key are significant. | |
207 | * | |
208 | * Consider a node 'n' and its parent 'tp'. | |
209 | * | |
210 | * If n is a leaf, every bit in its key is significant. Its presence is | |
211 | * necessitated by path compression, since during a tree traversal (when | |
212 | * searching for a leaf - unless we are doing an insertion) we will completely | |
213 | * ignore all skipped bits we encounter. Thus we need to verify, at the end of | |
214 | * a potentially successful search, that we have indeed been walking the | |
215 | * correct key path. | |
216 | * | |
217 | * Note that we can never "miss" the correct key in the tree if present by | |
218 | * following the wrong path. Path compression ensures that segments of the key | |
219 | * that are the same for all keys with a given prefix are skipped, but the | |
220 | * skipped part *is* identical for each node in the subtrie below the skipped | |
221 | * bit! trie_insert() in this implementation takes care of that. | |
222 | * | |
223 | * if n is an internal node - a 'tnode' here, the various parts of its key | |
224 | * have many different meanings. | |
225 | * | |
226 | * Example: | |
227 | * _________________________________________________________________ | |
228 | * | i | i | i | i | i | i | i | N | N | N | S | S | S | S | S | C | | |
229 | * ----------------------------------------------------------------- | |
230 | * 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 | |
231 | * | |
232 | * _________________________________________________________________ | |
233 | * | C | C | C | u | u | u | u | u | u | u | u | u | u | u | u | u | | |
234 | * ----------------------------------------------------------------- | |
235 | * 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 | |
236 | * | |
237 | * tp->pos = 22 | |
238 | * tp->bits = 3 | |
239 | * n->pos = 13 | |
240 | * n->bits = 4 | |
241 | * | |
242 | * First, let's just ignore the bits that come before the parent tp, that is | |
243 | * the bits from (tp->pos + tp->bits) to 31. They are *known* but at this | |
244 | * point we do not use them for anything. | |
245 | * | |
246 | * The bits from (tp->pos) to (tp->pos + tp->bits - 1) - "N", above - are the | |
247 | * index into the parent's child array. That is, they will be used to find | |
248 | * 'n' among tp's children. | |
249 | * | |
250 | * The bits from (n->pos + n->bits) to (tn->pos - 1) - "S" - are skipped bits | |
251 | * for the node n. | |
252 | * | |
253 | * All the bits we have seen so far are significant to the node n. The rest | |
254 | * of the bits are really not needed or indeed known in n->key. | |
255 | * | |
256 | * The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into | |
257 | * n's child array, and will of course be different for each child. | |
258 | * | |
259 | * The rest of the bits, from 0 to (n->pos + n->bits), are completely unknown | |
260 | * at this point. | |
261 | */ | |
19baf839 | 262 | |
f5026fab DL |
263 | static const int halve_threshold = 25; |
264 | static const int inflate_threshold = 50; | |
345aa031 | 265 | static const int halve_threshold_root = 15; |
80b71b80 | 266 | static const int inflate_threshold_root = 30; |
2373ce1c RO |
267 | |
268 | static void __alias_free_mem(struct rcu_head *head) | |
19baf839 | 269 | { |
2373ce1c RO |
270 | struct fib_alias *fa = container_of(head, struct fib_alias, rcu); |
271 | kmem_cache_free(fn_alias_kmem, fa); | |
19baf839 RO |
272 | } |
273 | ||
2373ce1c | 274 | static inline void alias_free_mem_rcu(struct fib_alias *fa) |
19baf839 | 275 | { |
2373ce1c RO |
276 | call_rcu(&fa->rcu, __alias_free_mem); |
277 | } | |
91b9a277 | 278 | |
37fd30f2 | 279 | #define TNODE_KMALLOC_MAX \ |
35c6edac | 280 | ilog2((PAGE_SIZE - TNODE_SIZE(0)) / sizeof(struct key_vector *)) |
1de3d87b | 281 | #define TNODE_VMALLOC_MAX \ |
35c6edac | 282 | ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *)) |
91b9a277 | 283 | |
37fd30f2 | 284 | static void __node_free_rcu(struct rcu_head *head) |
387a5487 | 285 | { |
56ca2adf | 286 | struct tnode *n = container_of(head, struct tnode, rcu); |
37fd30f2 | 287 | |
56ca2adf | 288 | if (!n->tn_bits) |
37fd30f2 | 289 | kmem_cache_free(trie_leaf_kmem, n); |
56ca2adf | 290 | else if (n->tn_bits <= TNODE_KMALLOC_MAX) |
37fd30f2 AD |
291 | kfree(n); |
292 | else | |
293 | vfree(n); | |
387a5487 SH |
294 | } |
295 | ||
56ca2adf | 296 | #define node_free(n) call_rcu(&tn_info(n)->rcu, __node_free_rcu) |
37fd30f2 | 297 | |
dc35dbed | 298 | static struct tnode *tnode_alloc(int bits) |
f0e36f8c | 299 | { |
1de3d87b AD |
300 | size_t size; |
301 | ||
302 | /* verify bits is within bounds */ | |
303 | if (bits > TNODE_VMALLOC_MAX) | |
304 | return NULL; | |
305 | ||
306 | /* determine size and verify it is non-zero and didn't overflow */ | |
307 | size = TNODE_SIZE(1ul << bits); | |
308 | ||
2373ce1c | 309 | if (size <= PAGE_SIZE) |
8d965444 | 310 | return kzalloc(size, GFP_KERNEL); |
15be75cd | 311 | else |
7a1c8e5a | 312 | return vzalloc(size); |
15be75cd | 313 | } |
2373ce1c | 314 | |
35c6edac | 315 | static inline void empty_child_inc(struct key_vector *n) |
95f60ea3 | 316 | { |
6e22d174 | 317 | ++tn_info(n)->empty_children ? : ++tn_info(n)->full_children; |
95f60ea3 AD |
318 | } |
319 | ||
35c6edac | 320 | static inline void empty_child_dec(struct key_vector *n) |
95f60ea3 | 321 | { |
6e22d174 | 322 | tn_info(n)->empty_children-- ? : tn_info(n)->full_children--; |
95f60ea3 AD |
323 | } |
324 | ||
35c6edac | 325 | static struct key_vector *leaf_new(t_key key, struct fib_alias *fa) |
2373ce1c | 326 | { |
dc35dbed AD |
327 | struct tnode *kv = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL); |
328 | struct key_vector *l = kv->kv; | |
329 | ||
330 | if (!kv) | |
331 | return NULL; | |
332 | ||
333 | /* initialize key vector */ | |
334 | l->key = key; | |
335 | l->pos = 0; | |
336 | l->bits = 0; | |
337 | l->slen = fa->fa_slen; | |
338 | ||
339 | /* link leaf to fib alias */ | |
340 | INIT_HLIST_HEAD(&l->leaf); | |
341 | hlist_add_head(&fa->fa_list, &l->leaf); | |
342 | ||
2373ce1c RO |
343 | return l; |
344 | } | |
345 | ||
35c6edac | 346 | static struct key_vector *tnode_new(t_key key, int pos, int bits) |
19baf839 | 347 | { |
dc35dbed | 348 | struct tnode *tnode = tnode_alloc(bits); |
64c9b6fb | 349 | unsigned int shift = pos + bits; |
dc35dbed | 350 | struct key_vector *tn = tnode->kv; |
64c9b6fb AD |
351 | |
352 | /* verify bits and pos their msb bits clear and values are valid */ | |
353 | BUG_ON(!bits || (shift > KEYLENGTH)); | |
19baf839 | 354 | |
dc35dbed | 355 | pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0), |
35c6edac | 356 | sizeof(struct key_vector *) << bits); |
dc35dbed AD |
357 | |
358 | if (!tnode) | |
359 | return NULL; | |
360 | ||
361 | if (bits == KEYLENGTH) | |
6e22d174 | 362 | tnode->full_children = 1; |
dc35dbed | 363 | else |
6e22d174 | 364 | tnode->empty_children = 1ul << bits; |
dc35dbed AD |
365 | |
366 | tn->key = (shift < KEYLENGTH) ? (key >> shift) << shift : 0; | |
367 | tn->pos = pos; | |
368 | tn->bits = bits; | |
369 | tn->slen = pos; | |
370 | ||
19baf839 RO |
371 | return tn; |
372 | } | |
373 | ||
e9b44019 | 374 | /* Check whether a tnode 'n' is "full", i.e. it is an internal node |
19baf839 RO |
375 | * and no bits are skipped. See discussion in dyntree paper p. 6 |
376 | */ | |
35c6edac | 377 | static inline int tnode_full(struct key_vector *tn, struct key_vector *n) |
19baf839 | 378 | { |
e9b44019 | 379 | return n && ((n->pos + n->bits) == tn->pos) && IS_TNODE(n); |
19baf839 RO |
380 | } |
381 | ||
ff181ed8 AD |
382 | /* Add a child at position i overwriting the old value. |
383 | * Update the value of full_children and empty_children. | |
384 | */ | |
35c6edac AD |
385 | static void put_child(struct key_vector *tn, unsigned long i, |
386 | struct key_vector *n) | |
19baf839 | 387 | { |
754baf8d | 388 | struct key_vector *chi = get_child(tn, i); |
ff181ed8 | 389 | int isfull, wasfull; |
19baf839 | 390 | |
2e1ac88a | 391 | BUG_ON(i >= child_length(tn)); |
0c7770c7 | 392 | |
95f60ea3 | 393 | /* update emptyChildren, overflow into fullChildren */ |
00db4124 | 394 | if (!n && chi) |
95f60ea3 | 395 | empty_child_inc(tn); |
00db4124 | 396 | if (n && !chi) |
95f60ea3 | 397 | empty_child_dec(tn); |
c877efb2 | 398 | |
19baf839 | 399 | /* update fullChildren */ |
ff181ed8 | 400 | wasfull = tnode_full(tn, chi); |
19baf839 | 401 | isfull = tnode_full(tn, n); |
ff181ed8 | 402 | |
c877efb2 | 403 | if (wasfull && !isfull) |
6e22d174 | 404 | tn_info(tn)->full_children--; |
c877efb2 | 405 | else if (!wasfull && isfull) |
6e22d174 | 406 | tn_info(tn)->full_children++; |
91b9a277 | 407 | |
5405afd1 AD |
408 | if (n && (tn->slen < n->slen)) |
409 | tn->slen = n->slen; | |
410 | ||
41b489fd | 411 | rcu_assign_pointer(tn->tnode[i], n); |
19baf839 RO |
412 | } |
413 | ||
35c6edac | 414 | static void update_children(struct key_vector *tn) |
69fa57b1 AD |
415 | { |
416 | unsigned long i; | |
417 | ||
418 | /* update all of the child parent pointers */ | |
2e1ac88a | 419 | for (i = child_length(tn); i;) { |
754baf8d | 420 | struct key_vector *inode = get_child(tn, --i); |
69fa57b1 AD |
421 | |
422 | if (!inode) | |
423 | continue; | |
424 | ||
425 | /* Either update the children of a tnode that | |
426 | * already belongs to us or update the child | |
427 | * to point to ourselves. | |
428 | */ | |
429 | if (node_parent(inode) == tn) | |
430 | update_children(inode); | |
431 | else | |
432 | node_set_parent(inode, tn); | |
433 | } | |
434 | } | |
435 | ||
88bae714 AD |
436 | static inline void put_child_root(struct key_vector *tp, t_key key, |
437 | struct key_vector *n) | |
836a0123 | 438 | { |
88bae714 AD |
439 | if (IS_TRIE(tp)) |
440 | rcu_assign_pointer(tp->tnode[0], n); | |
836a0123 | 441 | else |
88bae714 | 442 | put_child(tp, get_index(key, tp), n); |
836a0123 AD |
443 | } |
444 | ||
35c6edac | 445 | static inline void tnode_free_init(struct key_vector *tn) |
0a5c0475 | 446 | { |
56ca2adf | 447 | tn_info(tn)->rcu.next = NULL; |
fc86a93b AD |
448 | } |
449 | ||
35c6edac AD |
450 | static inline void tnode_free_append(struct key_vector *tn, |
451 | struct key_vector *n) | |
fc86a93b | 452 | { |
56ca2adf AD |
453 | tn_info(n)->rcu.next = tn_info(tn)->rcu.next; |
454 | tn_info(tn)->rcu.next = &tn_info(n)->rcu; | |
fc86a93b | 455 | } |
0a5c0475 | 456 | |
35c6edac | 457 | static void tnode_free(struct key_vector *tn) |
fc86a93b | 458 | { |
56ca2adf | 459 | struct callback_head *head = &tn_info(tn)->rcu; |
fc86a93b AD |
460 | |
461 | while (head) { | |
462 | head = head->next; | |
41b489fd | 463 | tnode_free_size += TNODE_SIZE(1ul << tn->bits); |
fc86a93b AD |
464 | node_free(tn); |
465 | ||
56ca2adf | 466 | tn = container_of(head, struct tnode, rcu)->kv; |
fc86a93b AD |
467 | } |
468 | ||
469 | if (tnode_free_size >= PAGE_SIZE * sync_pages) { | |
470 | tnode_free_size = 0; | |
471 | synchronize_rcu(); | |
0a5c0475 | 472 | } |
0a5c0475 ED |
473 | } |
474 | ||
88bae714 AD |
475 | static struct key_vector *replace(struct trie *t, |
476 | struct key_vector *oldtnode, | |
477 | struct key_vector *tn) | |
69fa57b1 | 478 | { |
35c6edac | 479 | struct key_vector *tp = node_parent(oldtnode); |
69fa57b1 AD |
480 | unsigned long i; |
481 | ||
482 | /* setup the parent pointer out of and back into this node */ | |
483 | NODE_INIT_PARENT(tn, tp); | |
88bae714 | 484 | put_child_root(tp, tn->key, tn); |
69fa57b1 AD |
485 | |
486 | /* update all of the child parent pointers */ | |
487 | update_children(tn); | |
488 | ||
489 | /* all pointers should be clean so we are done */ | |
490 | tnode_free(oldtnode); | |
491 | ||
492 | /* resize children now that oldtnode is freed */ | |
2e1ac88a | 493 | for (i = child_length(tn); i;) { |
754baf8d | 494 | struct key_vector *inode = get_child(tn, --i); |
69fa57b1 AD |
495 | |
496 | /* resize child node */ | |
497 | if (tnode_full(tn, inode)) | |
88bae714 | 498 | tn = resize(t, inode); |
69fa57b1 | 499 | } |
8d8e810c | 500 | |
88bae714 | 501 | return tp; |
69fa57b1 AD |
502 | } |
503 | ||
88bae714 AD |
504 | static struct key_vector *inflate(struct trie *t, |
505 | struct key_vector *oldtnode) | |
19baf839 | 506 | { |
35c6edac | 507 | struct key_vector *tn; |
69fa57b1 | 508 | unsigned long i; |
e9b44019 | 509 | t_key m; |
19baf839 | 510 | |
0c7770c7 | 511 | pr_debug("In inflate\n"); |
19baf839 | 512 | |
e9b44019 | 513 | tn = tnode_new(oldtnode->key, oldtnode->pos - 1, oldtnode->bits + 1); |
0c7770c7 | 514 | if (!tn) |
8d8e810c | 515 | goto notnode; |
2f36895a | 516 | |
69fa57b1 AD |
517 | /* prepare oldtnode to be freed */ |
518 | tnode_free_init(oldtnode); | |
519 | ||
12c081a5 AD |
520 | /* Assemble all of the pointers in our cluster, in this case that |
521 | * represents all of the pointers out of our allocated nodes that | |
522 | * point to existing tnodes and the links between our allocated | |
523 | * nodes. | |
2f36895a | 524 | */ |
2e1ac88a | 525 | for (i = child_length(oldtnode), m = 1u << tn->pos; i;) { |
754baf8d | 526 | struct key_vector *inode = get_child(oldtnode, --i); |
35c6edac | 527 | struct key_vector *node0, *node1; |
69fa57b1 | 528 | unsigned long j, k; |
c877efb2 | 529 | |
19baf839 | 530 | /* An empty child */ |
51456b29 | 531 | if (!inode) |
19baf839 RO |
532 | continue; |
533 | ||
534 | /* A leaf or an internal node with skipped bits */ | |
adaf9816 | 535 | if (!tnode_full(oldtnode, inode)) { |
e9b44019 | 536 | put_child(tn, get_index(inode->key, tn), inode); |
19baf839 RO |
537 | continue; |
538 | } | |
539 | ||
69fa57b1 AD |
540 | /* drop the node in the old tnode free list */ |
541 | tnode_free_append(oldtnode, inode); | |
542 | ||
19baf839 | 543 | /* An internal node with two children */ |
19baf839 | 544 | if (inode->bits == 1) { |
754baf8d AD |
545 | put_child(tn, 2 * i + 1, get_child(inode, 1)); |
546 | put_child(tn, 2 * i, get_child(inode, 0)); | |
91b9a277 | 547 | continue; |
19baf839 RO |
548 | } |
549 | ||
91b9a277 | 550 | /* We will replace this node 'inode' with two new |
12c081a5 | 551 | * ones, 'node0' and 'node1', each with half of the |
91b9a277 OJ |
552 | * original children. The two new nodes will have |
553 | * a position one bit further down the key and this | |
554 | * means that the "significant" part of their keys | |
555 | * (see the discussion near the top of this file) | |
556 | * will differ by one bit, which will be "0" in | |
12c081a5 | 557 | * node0's key and "1" in node1's key. Since we are |
91b9a277 OJ |
558 | * moving the key position by one step, the bit that |
559 | * we are moving away from - the bit at position | |
12c081a5 AD |
560 | * (tn->pos) - is the one that will differ between |
561 | * node0 and node1. So... we synthesize that bit in the | |
562 | * two new keys. | |
91b9a277 | 563 | */ |
12c081a5 AD |
564 | node1 = tnode_new(inode->key | m, inode->pos, inode->bits - 1); |
565 | if (!node1) | |
566 | goto nomem; | |
69fa57b1 | 567 | node0 = tnode_new(inode->key, inode->pos, inode->bits - 1); |
12c081a5 | 568 | |
69fa57b1 | 569 | tnode_free_append(tn, node1); |
12c081a5 AD |
570 | if (!node0) |
571 | goto nomem; | |
572 | tnode_free_append(tn, node0); | |
573 | ||
574 | /* populate child pointers in new nodes */ | |
2e1ac88a | 575 | for (k = child_length(inode), j = k / 2; j;) { |
754baf8d AD |
576 | put_child(node1, --j, get_child(inode, --k)); |
577 | put_child(node0, j, get_child(inode, j)); | |
578 | put_child(node1, --j, get_child(inode, --k)); | |
579 | put_child(node0, j, get_child(inode, j)); | |
12c081a5 | 580 | } |
19baf839 | 581 | |
12c081a5 AD |
582 | /* link new nodes to parent */ |
583 | NODE_INIT_PARENT(node1, tn); | |
584 | NODE_INIT_PARENT(node0, tn); | |
2f36895a | 585 | |
12c081a5 AD |
586 | /* link parent to nodes */ |
587 | put_child(tn, 2 * i + 1, node1); | |
588 | put_child(tn, 2 * i, node0); | |
589 | } | |
2f36895a | 590 | |
69fa57b1 | 591 | /* setup the parent pointers into and out of this node */ |
8d8e810c | 592 | return replace(t, oldtnode, tn); |
2f80b3c8 | 593 | nomem: |
fc86a93b AD |
594 | /* all pointers should be clean so we are done */ |
595 | tnode_free(tn); | |
8d8e810c AD |
596 | notnode: |
597 | return NULL; | |
19baf839 RO |
598 | } |
599 | ||
88bae714 AD |
600 | static struct key_vector *halve(struct trie *t, |
601 | struct key_vector *oldtnode) | |
19baf839 | 602 | { |
35c6edac | 603 | struct key_vector *tn; |
12c081a5 | 604 | unsigned long i; |
19baf839 | 605 | |
0c7770c7 | 606 | pr_debug("In halve\n"); |
c877efb2 | 607 | |
e9b44019 | 608 | tn = tnode_new(oldtnode->key, oldtnode->pos + 1, oldtnode->bits - 1); |
2f80b3c8 | 609 | if (!tn) |
8d8e810c | 610 | goto notnode; |
2f36895a | 611 | |
69fa57b1 AD |
612 | /* prepare oldtnode to be freed */ |
613 | tnode_free_init(oldtnode); | |
614 | ||
12c081a5 AD |
615 | /* Assemble all of the pointers in our cluster, in this case that |
616 | * represents all of the pointers out of our allocated nodes that | |
617 | * point to existing tnodes and the links between our allocated | |
618 | * nodes. | |
2f36895a | 619 | */ |
2e1ac88a | 620 | for (i = child_length(oldtnode); i;) { |
754baf8d AD |
621 | struct key_vector *node1 = get_child(oldtnode, --i); |
622 | struct key_vector *node0 = get_child(oldtnode, --i); | |
35c6edac | 623 | struct key_vector *inode; |
2f36895a | 624 | |
12c081a5 AD |
625 | /* At least one of the children is empty */ |
626 | if (!node1 || !node0) { | |
627 | put_child(tn, i / 2, node1 ? : node0); | |
628 | continue; | |
629 | } | |
c877efb2 | 630 | |
2f36895a | 631 | /* Two nonempty children */ |
12c081a5 | 632 | inode = tnode_new(node0->key, oldtnode->pos, 1); |
8d8e810c AD |
633 | if (!inode) |
634 | goto nomem; | |
12c081a5 | 635 | tnode_free_append(tn, inode); |
2f36895a | 636 | |
12c081a5 AD |
637 | /* initialize pointers out of node */ |
638 | put_child(inode, 1, node1); | |
639 | put_child(inode, 0, node0); | |
640 | NODE_INIT_PARENT(inode, tn); | |
641 | ||
642 | /* link parent to node */ | |
643 | put_child(tn, i / 2, inode); | |
2f36895a | 644 | } |
19baf839 | 645 | |
69fa57b1 | 646 | /* setup the parent pointers into and out of this node */ |
8d8e810c AD |
647 | return replace(t, oldtnode, tn); |
648 | nomem: | |
649 | /* all pointers should be clean so we are done */ | |
650 | tnode_free(tn); | |
651 | notnode: | |
652 | return NULL; | |
19baf839 RO |
653 | } |
654 | ||
88bae714 AD |
655 | static struct key_vector *collapse(struct trie *t, |
656 | struct key_vector *oldtnode) | |
95f60ea3 | 657 | { |
35c6edac | 658 | struct key_vector *n, *tp; |
95f60ea3 AD |
659 | unsigned long i; |
660 | ||
661 | /* scan the tnode looking for that one child that might still exist */ | |
2e1ac88a | 662 | for (n = NULL, i = child_length(oldtnode); !n && i;) |
754baf8d | 663 | n = get_child(oldtnode, --i); |
95f60ea3 AD |
664 | |
665 | /* compress one level */ | |
666 | tp = node_parent(oldtnode); | |
88bae714 | 667 | put_child_root(tp, oldtnode->key, n); |
95f60ea3 AD |
668 | node_set_parent(n, tp); |
669 | ||
670 | /* drop dead node */ | |
671 | node_free(oldtnode); | |
88bae714 AD |
672 | |
673 | return tp; | |
95f60ea3 AD |
674 | } |
675 | ||
35c6edac | 676 | static unsigned char update_suffix(struct key_vector *tn) |
5405afd1 AD |
677 | { |
678 | unsigned char slen = tn->pos; | |
679 | unsigned long stride, i; | |
680 | ||
681 | /* search though the list of children looking for nodes that might | |
682 | * have a suffix greater than the one we currently have. This is | |
683 | * why we start with a stride of 2 since a stride of 1 would | |
684 | * represent the nodes with suffix length equal to tn->pos | |
685 | */ | |
2e1ac88a | 686 | for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) { |
754baf8d | 687 | struct key_vector *n = get_child(tn, i); |
5405afd1 AD |
688 | |
689 | if (!n || (n->slen <= slen)) | |
690 | continue; | |
691 | ||
692 | /* update stride and slen based on new value */ | |
693 | stride <<= (n->slen - slen); | |
694 | slen = n->slen; | |
695 | i &= ~(stride - 1); | |
696 | ||
697 | /* if slen covers all but the last bit we can stop here | |
698 | * there will be nothing longer than that since only node | |
699 | * 0 and 1 << (bits - 1) could have that as their suffix | |
700 | * length. | |
701 | */ | |
702 | if ((slen + 1) >= (tn->pos + tn->bits)) | |
703 | break; | |
704 | } | |
705 | ||
706 | tn->slen = slen; | |
707 | ||
708 | return slen; | |
709 | } | |
710 | ||
f05a4819 AD |
711 | /* From "Implementing a dynamic compressed trie" by Stefan Nilsson of |
712 | * the Helsinki University of Technology and Matti Tikkanen of Nokia | |
713 | * Telecommunications, page 6: | |
714 | * "A node is doubled if the ratio of non-empty children to all | |
715 | * children in the *doubled* node is at least 'high'." | |
716 | * | |
717 | * 'high' in this instance is the variable 'inflate_threshold'. It | |
718 | * is expressed as a percentage, so we multiply it with | |
2e1ac88a | 719 | * child_length() and instead of multiplying by 2 (since the |
f05a4819 AD |
720 | * child array will be doubled by inflate()) and multiplying |
721 | * the left-hand side by 100 (to handle the percentage thing) we | |
722 | * multiply the left-hand side by 50. | |
723 | * | |
2e1ac88a | 724 | * The left-hand side may look a bit weird: child_length(tn) |
f05a4819 AD |
725 | * - tn->empty_children is of course the number of non-null children |
726 | * in the current node. tn->full_children is the number of "full" | |
727 | * children, that is non-null tnodes with a skip value of 0. | |
728 | * All of those will be doubled in the resulting inflated tnode, so | |
729 | * we just count them one extra time here. | |
730 | * | |
731 | * A clearer way to write this would be: | |
732 | * | |
733 | * to_be_doubled = tn->full_children; | |
2e1ac88a | 734 | * not_to_be_doubled = child_length(tn) - tn->empty_children - |
f05a4819 AD |
735 | * tn->full_children; |
736 | * | |
2e1ac88a | 737 | * new_child_length = child_length(tn) * 2; |
f05a4819 AD |
738 | * |
739 | * new_fill_factor = 100 * (not_to_be_doubled + 2*to_be_doubled) / | |
740 | * new_child_length; | |
741 | * if (new_fill_factor >= inflate_threshold) | |
742 | * | |
743 | * ...and so on, tho it would mess up the while () loop. | |
744 | * | |
745 | * anyway, | |
746 | * 100 * (not_to_be_doubled + 2*to_be_doubled) / new_child_length >= | |
747 | * inflate_threshold | |
748 | * | |
749 | * avoid a division: | |
750 | * 100 * (not_to_be_doubled + 2*to_be_doubled) >= | |
751 | * inflate_threshold * new_child_length | |
752 | * | |
753 | * expand not_to_be_doubled and to_be_doubled, and shorten: | |
2e1ac88a | 754 | * 100 * (child_length(tn) - tn->empty_children + |
f05a4819 AD |
755 | * tn->full_children) >= inflate_threshold * new_child_length |
756 | * | |
757 | * expand new_child_length: | |
2e1ac88a | 758 | * 100 * (child_length(tn) - tn->empty_children + |
f05a4819 | 759 | * tn->full_children) >= |
2e1ac88a | 760 | * inflate_threshold * child_length(tn) * 2 |
f05a4819 AD |
761 | * |
762 | * shorten again: | |
2e1ac88a | 763 | * 50 * (tn->full_children + child_length(tn) - |
f05a4819 | 764 | * tn->empty_children) >= inflate_threshold * |
2e1ac88a | 765 | * child_length(tn) |
f05a4819 AD |
766 | * |
767 | */ | |
35c6edac | 768 | static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn) |
f05a4819 | 769 | { |
2e1ac88a | 770 | unsigned long used = child_length(tn); |
f05a4819 AD |
771 | unsigned long threshold = used; |
772 | ||
773 | /* Keep root node larger */ | |
88bae714 | 774 | threshold *= IS_TRIE(tp) ? inflate_threshold_root : inflate_threshold; |
6e22d174 AD |
775 | used -= tn_info(tn)->empty_children; |
776 | used += tn_info(tn)->full_children; | |
f05a4819 | 777 | |
95f60ea3 AD |
778 | /* if bits == KEYLENGTH then pos = 0, and will fail below */ |
779 | ||
780 | return (used > 1) && tn->pos && ((50 * used) >= threshold); | |
f05a4819 AD |
781 | } |
782 | ||
35c6edac | 783 | static inline bool should_halve(struct key_vector *tp, struct key_vector *tn) |
f05a4819 | 784 | { |
2e1ac88a | 785 | unsigned long used = child_length(tn); |
f05a4819 AD |
786 | unsigned long threshold = used; |
787 | ||
788 | /* Keep root node larger */ | |
88bae714 | 789 | threshold *= IS_TRIE(tp) ? halve_threshold_root : halve_threshold; |
6e22d174 | 790 | used -= tn_info(tn)->empty_children; |
f05a4819 | 791 | |
95f60ea3 AD |
792 | /* if bits == KEYLENGTH then used = 100% on wrap, and will fail below */ |
793 | ||
794 | return (used > 1) && (tn->bits > 1) && ((100 * used) < threshold); | |
795 | } | |
796 | ||
35c6edac | 797 | static inline bool should_collapse(struct key_vector *tn) |
95f60ea3 | 798 | { |
2e1ac88a | 799 | unsigned long used = child_length(tn); |
95f60ea3 | 800 | |
6e22d174 | 801 | used -= tn_info(tn)->empty_children; |
95f60ea3 AD |
802 | |
803 | /* account for bits == KEYLENGTH case */ | |
6e22d174 | 804 | if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children) |
95f60ea3 AD |
805 | used -= KEY_MAX; |
806 | ||
807 | /* One child or none, time to drop us from the trie */ | |
808 | return used < 2; | |
f05a4819 AD |
809 | } |
810 | ||
cf3637bb | 811 | #define MAX_WORK 10 |
88bae714 | 812 | static struct key_vector *resize(struct trie *t, struct key_vector *tn) |
cf3637bb | 813 | { |
8d8e810c AD |
814 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
815 | struct trie_use_stats __percpu *stats = t->stats; | |
816 | #endif | |
35c6edac | 817 | struct key_vector *tp = node_parent(tn); |
88bae714 | 818 | unsigned long cindex = get_index(tn->key, tp); |
a80e89d4 | 819 | int max_work = MAX_WORK; |
cf3637bb | 820 | |
cf3637bb AD |
821 | pr_debug("In tnode_resize %p inflate_threshold=%d threshold=%d\n", |
822 | tn, inflate_threshold, halve_threshold); | |
823 | ||
ff181ed8 AD |
824 | /* track the tnode via the pointer from the parent instead of |
825 | * doing it ourselves. This way we can let RCU fully do its | |
826 | * thing without us interfering | |
827 | */ | |
88bae714 | 828 | BUG_ON(tn != get_child(tp, cindex)); |
ff181ed8 | 829 | |
f05a4819 AD |
830 | /* Double as long as the resulting node has a number of |
831 | * nonempty nodes that are above the threshold. | |
cf3637bb | 832 | */ |
b6f15f82 | 833 | while (should_inflate(tp, tn) && max_work) { |
88bae714 AD |
834 | tp = inflate(t, tn); |
835 | if (!tp) { | |
cf3637bb | 836 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
8d8e810c | 837 | this_cpu_inc(stats->resize_node_skipped); |
cf3637bb AD |
838 | #endif |
839 | break; | |
840 | } | |
ff181ed8 | 841 | |
b6f15f82 | 842 | max_work--; |
88bae714 | 843 | tn = get_child(tp, cindex); |
cf3637bb AD |
844 | } |
845 | ||
b6f15f82 AD |
846 | /* update parent in case inflate failed */ |
847 | tp = node_parent(tn); | |
848 | ||
cf3637bb AD |
849 | /* Return if at least one inflate is run */ |
850 | if (max_work != MAX_WORK) | |
b6f15f82 | 851 | return tp; |
cf3637bb | 852 | |
f05a4819 | 853 | /* Halve as long as the number of empty children in this |
cf3637bb AD |
854 | * node is above threshold. |
855 | */ | |
b6f15f82 | 856 | while (should_halve(tp, tn) && max_work) { |
88bae714 AD |
857 | tp = halve(t, tn); |
858 | if (!tp) { | |
cf3637bb | 859 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
8d8e810c | 860 | this_cpu_inc(stats->resize_node_skipped); |
cf3637bb AD |
861 | #endif |
862 | break; | |
863 | } | |
cf3637bb | 864 | |
b6f15f82 | 865 | max_work--; |
88bae714 | 866 | tn = get_child(tp, cindex); |
ff181ed8 | 867 | } |
cf3637bb AD |
868 | |
869 | /* Only one child remains */ | |
88bae714 AD |
870 | if (should_collapse(tn)) |
871 | return collapse(t, tn); | |
872 | ||
b6f15f82 | 873 | /* update parent in case halve failed */ |
88bae714 | 874 | tp = node_parent(tn); |
5405afd1 AD |
875 | |
876 | /* Return if at least one deflate was run */ | |
877 | if (max_work != MAX_WORK) | |
88bae714 | 878 | return tp; |
5405afd1 AD |
879 | |
880 | /* push the suffix length to the parent node */ | |
881 | if (tn->slen > tn->pos) { | |
882 | unsigned char slen = update_suffix(tn); | |
883 | ||
88bae714 | 884 | if (slen > tp->slen) |
5405afd1 | 885 | tp->slen = slen; |
cf3637bb | 886 | } |
8d8e810c | 887 | |
88bae714 | 888 | return tp; |
cf3637bb AD |
889 | } |
890 | ||
35c6edac | 891 | static void leaf_pull_suffix(struct key_vector *tp, struct key_vector *l) |
5405afd1 | 892 | { |
88bae714 | 893 | while ((tp->slen > tp->pos) && (tp->slen > l->slen)) { |
5405afd1 AD |
894 | if (update_suffix(tp) > l->slen) |
895 | break; | |
896 | tp = node_parent(tp); | |
897 | } | |
898 | } | |
899 | ||
35c6edac | 900 | static void leaf_push_suffix(struct key_vector *tn, struct key_vector *l) |
19baf839 | 901 | { |
5405afd1 AD |
902 | /* if this is a new leaf then tn will be NULL and we can sort |
903 | * out parent suffix lengths as a part of trie_rebalance | |
904 | */ | |
88bae714 | 905 | while (tn->slen < l->slen) { |
5405afd1 AD |
906 | tn->slen = l->slen; |
907 | tn = node_parent(tn); | |
908 | } | |
909 | } | |
910 | ||
2373ce1c | 911 | /* rcu_read_lock needs to be hold by caller from readside */ |
35c6edac AD |
912 | static struct key_vector *fib_find_node(struct trie *t, |
913 | struct key_vector **tp, u32 key) | |
19baf839 | 914 | { |
88bae714 AD |
915 | struct key_vector *pn, *n = t->kv; |
916 | unsigned long index = 0; | |
917 | ||
918 | do { | |
919 | pn = n; | |
920 | n = get_child_rcu(n, index); | |
921 | ||
922 | if (!n) | |
923 | break; | |
939afb06 | 924 | |
88bae714 | 925 | index = get_cindex(key, n); |
939afb06 AD |
926 | |
927 | /* This bit of code is a bit tricky but it combines multiple | |
928 | * checks into a single check. The prefix consists of the | |
929 | * prefix plus zeros for the bits in the cindex. The index | |
930 | * is the difference between the key and this value. From | |
931 | * this we can actually derive several pieces of data. | |
d4a975e8 | 932 | * if (index >= (1ul << bits)) |
939afb06 | 933 | * we have a mismatch in skip bits and failed |
b3832117 AD |
934 | * else |
935 | * we know the value is cindex | |
d4a975e8 AD |
936 | * |
937 | * This check is safe even if bits == KEYLENGTH due to the | |
938 | * fact that we can only allocate a node with 32 bits if a | |
939 | * long is greater than 32 bits. | |
939afb06 | 940 | */ |
d4a975e8 AD |
941 | if (index >= (1ul << n->bits)) { |
942 | n = NULL; | |
943 | break; | |
944 | } | |
939afb06 | 945 | |
88bae714 AD |
946 | /* keep searching until we find a perfect match leaf or NULL */ |
947 | } while (IS_TNODE(n)); | |
91b9a277 | 948 | |
35c6edac | 949 | *tp = pn; |
d4a975e8 | 950 | |
939afb06 | 951 | return n; |
19baf839 RO |
952 | } |
953 | ||
02525368 AD |
954 | /* Return the first fib alias matching TOS with |
955 | * priority less than or equal to PRIO. | |
956 | */ | |
79e5ad2c | 957 | static struct fib_alias *fib_find_alias(struct hlist_head *fah, u8 slen, |
0b65bd97 | 958 | u8 tos, u32 prio, u32 tb_id) |
02525368 AD |
959 | { |
960 | struct fib_alias *fa; | |
961 | ||
962 | if (!fah) | |
963 | return NULL; | |
964 | ||
56315f9e | 965 | hlist_for_each_entry(fa, fah, fa_list) { |
79e5ad2c AD |
966 | if (fa->fa_slen < slen) |
967 | continue; | |
968 | if (fa->fa_slen != slen) | |
969 | break; | |
0b65bd97 AD |
970 | if (fa->tb_id > tb_id) |
971 | continue; | |
972 | if (fa->tb_id != tb_id) | |
973 | break; | |
02525368 AD |
974 | if (fa->fa_tos > tos) |
975 | continue; | |
976 | if (fa->fa_info->fib_priority >= prio || fa->fa_tos < tos) | |
977 | return fa; | |
978 | } | |
979 | ||
980 | return NULL; | |
981 | } | |
982 | ||
35c6edac | 983 | static void trie_rebalance(struct trie *t, struct key_vector *tn) |
19baf839 | 984 | { |
88bae714 AD |
985 | while (!IS_TRIE(tn)) |
986 | tn = resize(t, tn); | |
19baf839 RO |
987 | } |
988 | ||
35c6edac | 989 | static int fib_insert_node(struct trie *t, struct key_vector *tp, |
d5d6487c | 990 | struct fib_alias *new, t_key key) |
19baf839 | 991 | { |
35c6edac | 992 | struct key_vector *n, *l; |
19baf839 | 993 | |
d5d6487c | 994 | l = leaf_new(key, new); |
79e5ad2c | 995 | if (!l) |
8d8e810c | 996 | goto noleaf; |
d5d6487c AD |
997 | |
998 | /* retrieve child from parent node */ | |
88bae714 | 999 | n = get_child(tp, get_index(key, tp)); |
19baf839 | 1000 | |
836a0123 AD |
1001 | /* Case 2: n is a LEAF or a TNODE and the key doesn't match. |
1002 | * | |
1003 | * Add a new tnode here | |
1004 | * first tnode need some special handling | |
1005 | * leaves us in position for handling as case 3 | |
1006 | */ | |
1007 | if (n) { | |
35c6edac | 1008 | struct key_vector *tn; |
19baf839 | 1009 | |
e9b44019 | 1010 | tn = tnode_new(key, __fls(key ^ n->key), 1); |
8d8e810c AD |
1011 | if (!tn) |
1012 | goto notnode; | |
91b9a277 | 1013 | |
836a0123 AD |
1014 | /* initialize routes out of node */ |
1015 | NODE_INIT_PARENT(tn, tp); | |
1016 | put_child(tn, get_index(key, tn) ^ 1, n); | |
19baf839 | 1017 | |
836a0123 | 1018 | /* start adding routes into the node */ |
88bae714 | 1019 | put_child_root(tp, key, tn); |
836a0123 | 1020 | node_set_parent(n, tn); |
e962f302 | 1021 | |
836a0123 | 1022 | /* parent now has a NULL spot where the leaf can go */ |
e962f302 | 1023 | tp = tn; |
19baf839 | 1024 | } |
91b9a277 | 1025 | |
836a0123 | 1026 | /* Case 3: n is NULL, and will just insert a new leaf */ |
d5d6487c | 1027 | NODE_INIT_PARENT(l, tp); |
88bae714 | 1028 | put_child_root(tp, key, l); |
d5d6487c AD |
1029 | trie_rebalance(t, tp); |
1030 | ||
1031 | return 0; | |
8d8e810c AD |
1032 | notnode: |
1033 | node_free(l); | |
1034 | noleaf: | |
1035 | return -ENOMEM; | |
d5d6487c AD |
1036 | } |
1037 | ||
35c6edac AD |
1038 | static int fib_insert_alias(struct trie *t, struct key_vector *tp, |
1039 | struct key_vector *l, struct fib_alias *new, | |
d5d6487c AD |
1040 | struct fib_alias *fa, t_key key) |
1041 | { | |
1042 | if (!l) | |
1043 | return fib_insert_node(t, tp, new, key); | |
1044 | ||
1045 | if (fa) { | |
1046 | hlist_add_before_rcu(&new->fa_list, &fa->fa_list); | |
836a0123 | 1047 | } else { |
d5d6487c AD |
1048 | struct fib_alias *last; |
1049 | ||
1050 | hlist_for_each_entry(last, &l->leaf, fa_list) { | |
1051 | if (new->fa_slen < last->fa_slen) | |
1052 | break; | |
0b65bd97 AD |
1053 | if ((new->fa_slen == last->fa_slen) && |
1054 | (new->tb_id > last->tb_id)) | |
1055 | break; | |
d5d6487c AD |
1056 | fa = last; |
1057 | } | |
1058 | ||
1059 | if (fa) | |
1060 | hlist_add_behind_rcu(&new->fa_list, &fa->fa_list); | |
1061 | else | |
1062 | hlist_add_head_rcu(&new->fa_list, &l->leaf); | |
836a0123 | 1063 | } |
2373ce1c | 1064 | |
d5d6487c AD |
1065 | /* if we added to the tail node then we need to update slen */ |
1066 | if (l->slen < new->fa_slen) { | |
1067 | l->slen = new->fa_slen; | |
1068 | leaf_push_suffix(tp, l); | |
1069 | } | |
1070 | ||
1071 | return 0; | |
19baf839 RO |
1072 | } |
1073 | ||
d5d6487c | 1074 | /* Caller must hold RTNL. */ |
16c6cf8b | 1075 | int fib_table_insert(struct fib_table *tb, struct fib_config *cfg) |
19baf839 | 1076 | { |
d4a975e8 | 1077 | struct trie *t = (struct trie *)tb->tb_data; |
19baf839 | 1078 | struct fib_alias *fa, *new_fa; |
35c6edac | 1079 | struct key_vector *l, *tp; |
19baf839 | 1080 | struct fib_info *fi; |
79e5ad2c AD |
1081 | u8 plen = cfg->fc_dst_len; |
1082 | u8 slen = KEYLENGTH - plen; | |
4e902c57 | 1083 | u8 tos = cfg->fc_tos; |
d4a975e8 | 1084 | u32 key; |
19baf839 | 1085 | int err; |
19baf839 | 1086 | |
5786ec60 | 1087 | if (plen > KEYLENGTH) |
19baf839 RO |
1088 | return -EINVAL; |
1089 | ||
4e902c57 | 1090 | key = ntohl(cfg->fc_dst); |
19baf839 | 1091 | |
2dfe55b4 | 1092 | pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen); |
19baf839 | 1093 | |
d4a975e8 | 1094 | if ((plen < KEYLENGTH) && (key << plen)) |
19baf839 RO |
1095 | return -EINVAL; |
1096 | ||
4e902c57 TG |
1097 | fi = fib_create_info(cfg); |
1098 | if (IS_ERR(fi)) { | |
1099 | err = PTR_ERR(fi); | |
19baf839 | 1100 | goto err; |
4e902c57 | 1101 | } |
19baf839 | 1102 | |
d4a975e8 | 1103 | l = fib_find_node(t, &tp, key); |
0b65bd97 AD |
1104 | fa = l ? fib_find_alias(&l->leaf, slen, tos, fi->fib_priority, |
1105 | tb->tb_id) : NULL; | |
19baf839 RO |
1106 | |
1107 | /* Now fa, if non-NULL, points to the first fib alias | |
1108 | * with the same keys [prefix,tos,priority], if such key already | |
1109 | * exists or to the node before which we will insert new one. | |
1110 | * | |
1111 | * If fa is NULL, we will need to allocate a new one and | |
56315f9e AD |
1112 | * insert to the tail of the section matching the suffix length |
1113 | * of the new alias. | |
19baf839 RO |
1114 | */ |
1115 | ||
936f6f8e JA |
1116 | if (fa && fa->fa_tos == tos && |
1117 | fa->fa_info->fib_priority == fi->fib_priority) { | |
1118 | struct fib_alias *fa_first, *fa_match; | |
19baf839 RO |
1119 | |
1120 | err = -EEXIST; | |
4e902c57 | 1121 | if (cfg->fc_nlflags & NLM_F_EXCL) |
19baf839 RO |
1122 | goto out; |
1123 | ||
936f6f8e JA |
1124 | /* We have 2 goals: |
1125 | * 1. Find exact match for type, scope, fib_info to avoid | |
1126 | * duplicate routes | |
1127 | * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it | |
1128 | */ | |
1129 | fa_match = NULL; | |
1130 | fa_first = fa; | |
56315f9e | 1131 | hlist_for_each_entry_from(fa, fa_list) { |
0b65bd97 AD |
1132 | if ((fa->fa_slen != slen) || |
1133 | (fa->tb_id != tb->tb_id) || | |
1134 | (fa->fa_tos != tos)) | |
936f6f8e JA |
1135 | break; |
1136 | if (fa->fa_info->fib_priority != fi->fib_priority) | |
1137 | break; | |
1138 | if (fa->fa_type == cfg->fc_type && | |
936f6f8e JA |
1139 | fa->fa_info == fi) { |
1140 | fa_match = fa; | |
1141 | break; | |
1142 | } | |
1143 | } | |
1144 | ||
4e902c57 | 1145 | if (cfg->fc_nlflags & NLM_F_REPLACE) { |
19baf839 RO |
1146 | struct fib_info *fi_drop; |
1147 | u8 state; | |
1148 | ||
936f6f8e JA |
1149 | fa = fa_first; |
1150 | if (fa_match) { | |
1151 | if (fa == fa_match) | |
1152 | err = 0; | |
6725033f | 1153 | goto out; |
936f6f8e | 1154 | } |
2373ce1c | 1155 | err = -ENOBUFS; |
e94b1766 | 1156 | new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL); |
51456b29 | 1157 | if (!new_fa) |
2373ce1c | 1158 | goto out; |
19baf839 RO |
1159 | |
1160 | fi_drop = fa->fa_info; | |
2373ce1c RO |
1161 | new_fa->fa_tos = fa->fa_tos; |
1162 | new_fa->fa_info = fi; | |
4e902c57 | 1163 | new_fa->fa_type = cfg->fc_type; |
19baf839 | 1164 | state = fa->fa_state; |
936f6f8e | 1165 | new_fa->fa_state = state & ~FA_S_ACCESSED; |
9b6ebad5 | 1166 | new_fa->fa_slen = fa->fa_slen; |
19baf839 | 1167 | |
8e05fd71 SF |
1168 | err = netdev_switch_fib_ipv4_add(key, plen, fi, |
1169 | new_fa->fa_tos, | |
1170 | cfg->fc_type, | |
f8f21471 | 1171 | cfg->fc_nlflags, |
8e05fd71 SF |
1172 | tb->tb_id); |
1173 | if (err) { | |
1174 | netdev_switch_fib_ipv4_abort(fi); | |
1175 | kmem_cache_free(fn_alias_kmem, new_fa); | |
1176 | goto out; | |
1177 | } | |
1178 | ||
56315f9e | 1179 | hlist_replace_rcu(&fa->fa_list, &new_fa->fa_list); |
8e05fd71 | 1180 | |
2373ce1c | 1181 | alias_free_mem_rcu(fa); |
19baf839 RO |
1182 | |
1183 | fib_release_info(fi_drop); | |
1184 | if (state & FA_S_ACCESSED) | |
4ccfe6d4 | 1185 | rt_cache_flush(cfg->fc_nlinfo.nl_net); |
b8f55831 MK |
1186 | rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, |
1187 | tb->tb_id, &cfg->fc_nlinfo, NLM_F_REPLACE); | |
19baf839 | 1188 | |
91b9a277 | 1189 | goto succeeded; |
19baf839 RO |
1190 | } |
1191 | /* Error if we find a perfect match which | |
1192 | * uses the same scope, type, and nexthop | |
1193 | * information. | |
1194 | */ | |
936f6f8e JA |
1195 | if (fa_match) |
1196 | goto out; | |
a07f5f50 | 1197 | |
4e902c57 | 1198 | if (!(cfg->fc_nlflags & NLM_F_APPEND)) |
936f6f8e | 1199 | fa = fa_first; |
19baf839 RO |
1200 | } |
1201 | err = -ENOENT; | |
4e902c57 | 1202 | if (!(cfg->fc_nlflags & NLM_F_CREATE)) |
19baf839 RO |
1203 | goto out; |
1204 | ||
1205 | err = -ENOBUFS; | |
e94b1766 | 1206 | new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL); |
51456b29 | 1207 | if (!new_fa) |
19baf839 RO |
1208 | goto out; |
1209 | ||
1210 | new_fa->fa_info = fi; | |
1211 | new_fa->fa_tos = tos; | |
4e902c57 | 1212 | new_fa->fa_type = cfg->fc_type; |
19baf839 | 1213 | new_fa->fa_state = 0; |
79e5ad2c | 1214 | new_fa->fa_slen = slen; |
0ddcf43d | 1215 | new_fa->tb_id = tb->tb_id; |
19baf839 | 1216 | |
8e05fd71 SF |
1217 | /* (Optionally) offload fib entry to switch hardware. */ |
1218 | err = netdev_switch_fib_ipv4_add(key, plen, fi, tos, | |
f8f21471 SF |
1219 | cfg->fc_type, |
1220 | cfg->fc_nlflags, | |
1221 | tb->tb_id); | |
8e05fd71 SF |
1222 | if (err) { |
1223 | netdev_switch_fib_ipv4_abort(fi); | |
1224 | goto out_free_new_fa; | |
1225 | } | |
1226 | ||
9b6ebad5 | 1227 | /* Insert new entry to the list. */ |
d5d6487c AD |
1228 | err = fib_insert_alias(t, tp, l, new_fa, fa, key); |
1229 | if (err) | |
8e05fd71 | 1230 | goto out_sw_fib_del; |
19baf839 | 1231 | |
21d8c49e DM |
1232 | if (!plen) |
1233 | tb->tb_num_default++; | |
1234 | ||
4ccfe6d4 | 1235 | rt_cache_flush(cfg->fc_nlinfo.nl_net); |
0ddcf43d | 1236 | rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, new_fa->tb_id, |
b8f55831 | 1237 | &cfg->fc_nlinfo, 0); |
19baf839 RO |
1238 | succeeded: |
1239 | return 0; | |
f835e471 | 1240 | |
8e05fd71 SF |
1241 | out_sw_fib_del: |
1242 | netdev_switch_fib_ipv4_del(key, plen, fi, tos, cfg->fc_type, tb->tb_id); | |
f835e471 RO |
1243 | out_free_new_fa: |
1244 | kmem_cache_free(fn_alias_kmem, new_fa); | |
19baf839 RO |
1245 | out: |
1246 | fib_release_info(fi); | |
91b9a277 | 1247 | err: |
19baf839 RO |
1248 | return err; |
1249 | } | |
1250 | ||
35c6edac | 1251 | static inline t_key prefix_mismatch(t_key key, struct key_vector *n) |
9f9e636d AD |
1252 | { |
1253 | t_key prefix = n->key; | |
1254 | ||
1255 | return (key ^ prefix) & (prefix | -prefix); | |
1256 | } | |
1257 | ||
345e9b54 | 1258 | /* should be called with rcu_read_lock */ |
22bd5b9b | 1259 | int fib_table_lookup(struct fib_table *tb, const struct flowi4 *flp, |
ebc0ffae | 1260 | struct fib_result *res, int fib_flags) |
19baf839 | 1261 | { |
0ddcf43d | 1262 | struct trie *t = (struct trie *) tb->tb_data; |
8274a97a AD |
1263 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
1264 | struct trie_use_stats __percpu *stats = t->stats; | |
1265 | #endif | |
9f9e636d | 1266 | const t_key key = ntohl(flp->daddr); |
35c6edac | 1267 | struct key_vector *n, *pn; |
79e5ad2c | 1268 | struct fib_alias *fa; |
71e8b67d | 1269 | unsigned long index; |
9f9e636d | 1270 | t_key cindex; |
91b9a277 | 1271 | |
88bae714 AD |
1272 | pn = t->kv; |
1273 | cindex = 0; | |
1274 | ||
1275 | n = get_child_rcu(pn, cindex); | |
c877efb2 | 1276 | if (!n) |
345e9b54 | 1277 | return -EAGAIN; |
19baf839 RO |
1278 | |
1279 | #ifdef CONFIG_IP_FIB_TRIE_STATS | |
8274a97a | 1280 | this_cpu_inc(stats->gets); |
19baf839 RO |
1281 | #endif |
1282 | ||
9f9e636d AD |
1283 | /* Step 1: Travel to the longest prefix match in the trie */ |
1284 | for (;;) { | |
88bae714 | 1285 | index = get_cindex(key, n); |
9f9e636d AD |
1286 | |
1287 | /* This bit of code is a bit tricky but it combines multiple | |
1288 | * checks into a single check. The prefix consists of the | |
1289 | * prefix plus zeros for the "bits" in the prefix. The index | |
1290 | * is the difference between the key and this value. From | |
1291 | * this we can actually derive several pieces of data. | |
71e8b67d | 1292 | * if (index >= (1ul << bits)) |
9f9e636d | 1293 | * we have a mismatch in skip bits and failed |
b3832117 AD |
1294 | * else |
1295 | * we know the value is cindex | |
71e8b67d AD |
1296 | * |
1297 | * This check is safe even if bits == KEYLENGTH due to the | |
1298 | * fact that we can only allocate a node with 32 bits if a | |
1299 | * long is greater than 32 bits. | |
9f9e636d | 1300 | */ |
71e8b67d | 1301 | if (index >= (1ul << n->bits)) |
9f9e636d | 1302 | break; |
19baf839 | 1303 | |
9f9e636d AD |
1304 | /* we have found a leaf. Prefixes have already been compared */ |
1305 | if (IS_LEAF(n)) | |
a07f5f50 | 1306 | goto found; |
19baf839 | 1307 | |
9f9e636d AD |
1308 | /* only record pn and cindex if we are going to be chopping |
1309 | * bits later. Otherwise we are just wasting cycles. | |
91b9a277 | 1310 | */ |
5405afd1 | 1311 | if (n->slen > n->pos) { |
9f9e636d AD |
1312 | pn = n; |
1313 | cindex = index; | |
91b9a277 | 1314 | } |
19baf839 | 1315 | |
754baf8d | 1316 | n = get_child_rcu(n, index); |
9f9e636d AD |
1317 | if (unlikely(!n)) |
1318 | goto backtrace; | |
1319 | } | |
19baf839 | 1320 | |
9f9e636d AD |
1321 | /* Step 2: Sort out leaves and begin backtracing for longest prefix */ |
1322 | for (;;) { | |
1323 | /* record the pointer where our next node pointer is stored */ | |
35c6edac | 1324 | struct key_vector __rcu **cptr = n->tnode; |
19baf839 | 1325 | |
9f9e636d AD |
1326 | /* This test verifies that none of the bits that differ |
1327 | * between the key and the prefix exist in the region of | |
1328 | * the lsb and higher in the prefix. | |
91b9a277 | 1329 | */ |
5405afd1 | 1330 | if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos)) |
9f9e636d | 1331 | goto backtrace; |
91b9a277 | 1332 | |
9f9e636d AD |
1333 | /* exit out and process leaf */ |
1334 | if (unlikely(IS_LEAF(n))) | |
1335 | break; | |
91b9a277 | 1336 | |
9f9e636d AD |
1337 | /* Don't bother recording parent info. Since we are in |
1338 | * prefix match mode we will have to come back to wherever | |
1339 | * we started this traversal anyway | |
91b9a277 | 1340 | */ |
91b9a277 | 1341 | |
9f9e636d | 1342 | while ((n = rcu_dereference(*cptr)) == NULL) { |
19baf839 | 1343 | backtrace: |
19baf839 | 1344 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
9f9e636d AD |
1345 | if (!n) |
1346 | this_cpu_inc(stats->null_node_hit); | |
19baf839 | 1347 | #endif |
9f9e636d AD |
1348 | /* If we are at cindex 0 there are no more bits for |
1349 | * us to strip at this level so we must ascend back | |
1350 | * up one level to see if there are any more bits to | |
1351 | * be stripped there. | |
1352 | */ | |
1353 | while (!cindex) { | |
1354 | t_key pkey = pn->key; | |
1355 | ||
88bae714 AD |
1356 | /* If we don't have a parent then there is |
1357 | * nothing for us to do as we do not have any | |
1358 | * further nodes to parse. | |
1359 | */ | |
1360 | if (IS_TRIE(pn)) | |
345e9b54 | 1361 | return -EAGAIN; |
9f9e636d AD |
1362 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
1363 | this_cpu_inc(stats->backtrack); | |
1364 | #endif | |
1365 | /* Get Child's index */ | |
88bae714 | 1366 | pn = node_parent_rcu(pn); |
9f9e636d AD |
1367 | cindex = get_index(pkey, pn); |
1368 | } | |
1369 | ||
1370 | /* strip the least significant bit from the cindex */ | |
1371 | cindex &= cindex - 1; | |
1372 | ||
1373 | /* grab pointer for next child node */ | |
41b489fd | 1374 | cptr = &pn->tnode[cindex]; |
c877efb2 | 1375 | } |
19baf839 | 1376 | } |
9f9e636d | 1377 | |
19baf839 | 1378 | found: |
71e8b67d AD |
1379 | /* this line carries forward the xor from earlier in the function */ |
1380 | index = key ^ n->key; | |
1381 | ||
9f9e636d | 1382 | /* Step 3: Process the leaf, if that fails fall back to backtracing */ |
79e5ad2c AD |
1383 | hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) { |
1384 | struct fib_info *fi = fa->fa_info; | |
1385 | int nhsel, err; | |
345e9b54 | 1386 | |
71e8b67d | 1387 | if ((index >= (1ul << fa->fa_slen)) && |
79e5ad2c | 1388 | ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen != KEYLENGTH))) |
71e8b67d | 1389 | continue; |
79e5ad2c AD |
1390 | if (fa->fa_tos && fa->fa_tos != flp->flowi4_tos) |
1391 | continue; | |
1392 | if (fi->fib_dead) | |
1393 | continue; | |
1394 | if (fa->fa_info->fib_scope < flp->flowi4_scope) | |
1395 | continue; | |
1396 | fib_alias_accessed(fa); | |
1397 | err = fib_props[fa->fa_type].error; | |
1398 | if (unlikely(err < 0)) { | |
345e9b54 | 1399 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
79e5ad2c | 1400 | this_cpu_inc(stats->semantic_match_passed); |
345e9b54 | 1401 | #endif |
79e5ad2c AD |
1402 | return err; |
1403 | } | |
1404 | if (fi->fib_flags & RTNH_F_DEAD) | |
1405 | continue; | |
1406 | for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) { | |
1407 | const struct fib_nh *nh = &fi->fib_nh[nhsel]; | |
1408 | ||
1409 | if (nh->nh_flags & RTNH_F_DEAD) | |
1410 | continue; | |
1411 | if (flp->flowi4_oif && flp->flowi4_oif != nh->nh_oif) | |
345e9b54 | 1412 | continue; |
79e5ad2c AD |
1413 | |
1414 | if (!(fib_flags & FIB_LOOKUP_NOREF)) | |
1415 | atomic_inc(&fi->fib_clntref); | |
1416 | ||
1417 | res->prefixlen = KEYLENGTH - fa->fa_slen; | |
1418 | res->nh_sel = nhsel; | |
1419 | res->type = fa->fa_type; | |
1420 | res->scope = fi->fib_scope; | |
1421 | res->fi = fi; | |
1422 | res->table = tb; | |
1423 | res->fa_head = &n->leaf; | |
345e9b54 | 1424 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
79e5ad2c | 1425 | this_cpu_inc(stats->semantic_match_passed); |
345e9b54 | 1426 | #endif |
79e5ad2c | 1427 | return err; |
345e9b54 | 1428 | } |
9b6ebad5 | 1429 | } |
345e9b54 | 1430 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
9b6ebad5 | 1431 | this_cpu_inc(stats->semantic_match_miss); |
345e9b54 | 1432 | #endif |
345e9b54 | 1433 | goto backtrace; |
19baf839 | 1434 | } |
6fc01438 | 1435 | EXPORT_SYMBOL_GPL(fib_table_lookup); |
19baf839 | 1436 | |
35c6edac AD |
1437 | static void fib_remove_alias(struct trie *t, struct key_vector *tp, |
1438 | struct key_vector *l, struct fib_alias *old) | |
d5d6487c AD |
1439 | { |
1440 | /* record the location of the previous list_info entry */ | |
1441 | struct hlist_node **pprev = old->fa_list.pprev; | |
1442 | struct fib_alias *fa = hlist_entry(pprev, typeof(*fa), fa_list.next); | |
1443 | ||
1444 | /* remove the fib_alias from the list */ | |
1445 | hlist_del_rcu(&old->fa_list); | |
1446 | ||
1447 | /* if we emptied the list this leaf will be freed and we can sort | |
1448 | * out parent suffix lengths as a part of trie_rebalance | |
1449 | */ | |
1450 | if (hlist_empty(&l->leaf)) { | |
88bae714 | 1451 | put_child_root(tp, l->key, NULL); |
d5d6487c AD |
1452 | node_free(l); |
1453 | trie_rebalance(t, tp); | |
1454 | return; | |
1455 | } | |
1456 | ||
1457 | /* only access fa if it is pointing at the last valid hlist_node */ | |
1458 | if (*pprev) | |
1459 | return; | |
1460 | ||
1461 | /* update the trie with the latest suffix length */ | |
1462 | l->slen = fa->fa_slen; | |
1463 | leaf_pull_suffix(tp, l); | |
1464 | } | |
1465 | ||
1466 | /* Caller must hold RTNL. */ | |
16c6cf8b | 1467 | int fib_table_delete(struct fib_table *tb, struct fib_config *cfg) |
19baf839 RO |
1468 | { |
1469 | struct trie *t = (struct trie *) tb->tb_data; | |
19baf839 | 1470 | struct fib_alias *fa, *fa_to_delete; |
35c6edac | 1471 | struct key_vector *l, *tp; |
79e5ad2c | 1472 | u8 plen = cfg->fc_dst_len; |
79e5ad2c | 1473 | u8 slen = KEYLENGTH - plen; |
d4a975e8 AD |
1474 | u8 tos = cfg->fc_tos; |
1475 | u32 key; | |
91b9a277 | 1476 | |
79e5ad2c | 1477 | if (plen > KEYLENGTH) |
19baf839 RO |
1478 | return -EINVAL; |
1479 | ||
4e902c57 | 1480 | key = ntohl(cfg->fc_dst); |
19baf839 | 1481 | |
d4a975e8 | 1482 | if ((plen < KEYLENGTH) && (key << plen)) |
19baf839 RO |
1483 | return -EINVAL; |
1484 | ||
d4a975e8 | 1485 | l = fib_find_node(t, &tp, key); |
c877efb2 | 1486 | if (!l) |
19baf839 RO |
1487 | return -ESRCH; |
1488 | ||
0b65bd97 | 1489 | fa = fib_find_alias(&l->leaf, slen, tos, 0, tb->tb_id); |
19baf839 RO |
1490 | if (!fa) |
1491 | return -ESRCH; | |
1492 | ||
0c7770c7 | 1493 | pr_debug("Deleting %08x/%d tos=%d t=%p\n", key, plen, tos, t); |
19baf839 RO |
1494 | |
1495 | fa_to_delete = NULL; | |
56315f9e | 1496 | hlist_for_each_entry_from(fa, fa_list) { |
19baf839 RO |
1497 | struct fib_info *fi = fa->fa_info; |
1498 | ||
0b65bd97 AD |
1499 | if ((fa->fa_slen != slen) || |
1500 | (fa->tb_id != tb->tb_id) || | |
1501 | (fa->fa_tos != tos)) | |
19baf839 RO |
1502 | break; |
1503 | ||
4e902c57 TG |
1504 | if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) && |
1505 | (cfg->fc_scope == RT_SCOPE_NOWHERE || | |
37e826c5 | 1506 | fa->fa_info->fib_scope == cfg->fc_scope) && |
74cb3c10 JA |
1507 | (!cfg->fc_prefsrc || |
1508 | fi->fib_prefsrc == cfg->fc_prefsrc) && | |
4e902c57 TG |
1509 | (!cfg->fc_protocol || |
1510 | fi->fib_protocol == cfg->fc_protocol) && | |
1511 | fib_nh_match(cfg, fi) == 0) { | |
19baf839 RO |
1512 | fa_to_delete = fa; |
1513 | break; | |
1514 | } | |
1515 | } | |
1516 | ||
91b9a277 OJ |
1517 | if (!fa_to_delete) |
1518 | return -ESRCH; | |
19baf839 | 1519 | |
8e05fd71 SF |
1520 | netdev_switch_fib_ipv4_del(key, plen, fa_to_delete->fa_info, tos, |
1521 | cfg->fc_type, tb->tb_id); | |
1522 | ||
d5d6487c | 1523 | rtmsg_fib(RTM_DELROUTE, htonl(key), fa_to_delete, plen, tb->tb_id, |
b8f55831 | 1524 | &cfg->fc_nlinfo, 0); |
91b9a277 | 1525 | |
21d8c49e DM |
1526 | if (!plen) |
1527 | tb->tb_num_default--; | |
1528 | ||
d5d6487c | 1529 | fib_remove_alias(t, tp, l, fa_to_delete); |
19baf839 | 1530 | |
d5d6487c | 1531 | if (fa_to_delete->fa_state & FA_S_ACCESSED) |
4ccfe6d4 | 1532 | rt_cache_flush(cfg->fc_nlinfo.nl_net); |
19baf839 | 1533 | |
d5d6487c AD |
1534 | fib_release_info(fa_to_delete->fa_info); |
1535 | alias_free_mem_rcu(fa_to_delete); | |
91b9a277 | 1536 | return 0; |
19baf839 RO |
1537 | } |
1538 | ||
8be33e95 | 1539 | /* Scan for the next leaf starting at the provided key value */ |
35c6edac | 1540 | static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key) |
19baf839 | 1541 | { |
35c6edac | 1542 | struct key_vector *pn, *n = *tn; |
8be33e95 | 1543 | unsigned long cindex; |
82cfbb00 | 1544 | |
8be33e95 | 1545 | /* this loop is meant to try and find the key in the trie */ |
88bae714 | 1546 | do { |
8be33e95 AD |
1547 | /* record parent and next child index */ |
1548 | pn = n; | |
3ec320dd | 1549 | cindex = key ? get_index(key, pn) : 0; |
88bae714 AD |
1550 | |
1551 | if (cindex >> pn->bits) | |
1552 | break; | |
82cfbb00 | 1553 | |
8be33e95 | 1554 | /* descend into the next child */ |
754baf8d | 1555 | n = get_child_rcu(pn, cindex++); |
88bae714 AD |
1556 | if (!n) |
1557 | break; | |
1558 | ||
1559 | /* guarantee forward progress on the keys */ | |
1560 | if (IS_LEAF(n) && (n->key >= key)) | |
1561 | goto found; | |
1562 | } while (IS_TNODE(n)); | |
82cfbb00 | 1563 | |
8be33e95 | 1564 | /* this loop will search for the next leaf with a greater key */ |
88bae714 | 1565 | while (!IS_TRIE(pn)) { |
8be33e95 AD |
1566 | /* if we exhausted the parent node we will need to climb */ |
1567 | if (cindex >= (1ul << pn->bits)) { | |
1568 | t_key pkey = pn->key; | |
82cfbb00 | 1569 | |
8be33e95 | 1570 | pn = node_parent_rcu(pn); |
8be33e95 AD |
1571 | cindex = get_index(pkey, pn) + 1; |
1572 | continue; | |
1573 | } | |
82cfbb00 | 1574 | |
8be33e95 | 1575 | /* grab the next available node */ |
754baf8d | 1576 | n = get_child_rcu(pn, cindex++); |
8be33e95 AD |
1577 | if (!n) |
1578 | continue; | |
19baf839 | 1579 | |
8be33e95 AD |
1580 | /* no need to compare keys since we bumped the index */ |
1581 | if (IS_LEAF(n)) | |
1582 | goto found; | |
71d67e66 | 1583 | |
8be33e95 AD |
1584 | /* Rescan start scanning in new node */ |
1585 | pn = n; | |
1586 | cindex = 0; | |
1587 | } | |
ec28cf73 | 1588 | |
8be33e95 AD |
1589 | *tn = pn; |
1590 | return NULL; /* Root of trie */ | |
1591 | found: | |
1592 | /* if we are at the limit for keys just return NULL for the tnode */ | |
88bae714 | 1593 | *tn = pn; |
8be33e95 | 1594 | return n; |
71d67e66 SH |
1595 | } |
1596 | ||
0ddcf43d AD |
1597 | static void fib_trie_free(struct fib_table *tb) |
1598 | { | |
1599 | struct trie *t = (struct trie *)tb->tb_data; | |
1600 | struct key_vector *pn = t->kv; | |
1601 | unsigned long cindex = 1; | |
1602 | struct hlist_node *tmp; | |
1603 | struct fib_alias *fa; | |
1604 | ||
1605 | /* walk trie in reverse order and free everything */ | |
1606 | for (;;) { | |
1607 | struct key_vector *n; | |
1608 | ||
1609 | if (!(cindex--)) { | |
1610 | t_key pkey = pn->key; | |
1611 | ||
1612 | if (IS_TRIE(pn)) | |
1613 | break; | |
1614 | ||
1615 | n = pn; | |
1616 | pn = node_parent(pn); | |
1617 | ||
1618 | /* drop emptied tnode */ | |
1619 | put_child_root(pn, n->key, NULL); | |
1620 | node_free(n); | |
1621 | ||
1622 | cindex = get_index(pkey, pn); | |
1623 | ||
1624 | continue; | |
1625 | } | |
1626 | ||
1627 | /* grab the next available node */ | |
1628 | n = get_child(pn, cindex); | |
1629 | if (!n) | |
1630 | continue; | |
1631 | ||
1632 | if (IS_TNODE(n)) { | |
1633 | /* record pn and cindex for leaf walking */ | |
1634 | pn = n; | |
1635 | cindex = 1ul << n->bits; | |
1636 | ||
1637 | continue; | |
1638 | } | |
1639 | ||
1640 | hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) { | |
1641 | hlist_del_rcu(&fa->fa_list); | |
1642 | alias_free_mem_rcu(fa); | |
1643 | } | |
1644 | ||
1645 | put_child_root(pn, n->key, NULL); | |
1646 | node_free(n); | |
1647 | } | |
1648 | ||
1649 | #ifdef CONFIG_IP_FIB_TRIE_STATS | |
1650 | free_percpu(t->stats); | |
1651 | #endif | |
1652 | kfree(tb); | |
1653 | } | |
1654 | ||
1655 | struct fib_table *fib_trie_unmerge(struct fib_table *oldtb) | |
1656 | { | |
1657 | struct trie *ot = (struct trie *)oldtb->tb_data; | |
1658 | struct key_vector *l, *tp = ot->kv; | |
1659 | struct fib_table *local_tb; | |
1660 | struct fib_alias *fa; | |
1661 | struct trie *lt; | |
1662 | t_key key = 0; | |
1663 | ||
1664 | if (oldtb->tb_data == oldtb->__data) | |
1665 | return oldtb; | |
1666 | ||
1667 | local_tb = fib_trie_table(RT_TABLE_LOCAL, NULL); | |
1668 | if (!local_tb) | |
1669 | return NULL; | |
1670 | ||
1671 | lt = (struct trie *)local_tb->tb_data; | |
1672 | ||
1673 | while ((l = leaf_walk_rcu(&tp, key)) != NULL) { | |
1674 | struct key_vector *local_l = NULL, *local_tp; | |
1675 | ||
1676 | hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) { | |
1677 | struct fib_alias *new_fa; | |
1678 | ||
1679 | if (local_tb->tb_id != fa->tb_id) | |
1680 | continue; | |
1681 | ||
1682 | /* clone fa for new local table */ | |
1683 | new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL); | |
1684 | if (!new_fa) | |
1685 | goto out; | |
1686 | ||
1687 | memcpy(new_fa, fa, sizeof(*fa)); | |
1688 | ||
1689 | /* insert clone into table */ | |
1690 | if (!local_l) | |
1691 | local_l = fib_find_node(lt, &local_tp, l->key); | |
1692 | ||
1693 | if (fib_insert_alias(lt, local_tp, local_l, new_fa, | |
1694 | NULL, l->key)) | |
1695 | goto out; | |
1696 | } | |
1697 | ||
1698 | /* stop loop if key wrapped back to 0 */ | |
1699 | key = l->key + 1; | |
1700 | if (key < l->key) | |
1701 | break; | |
1702 | } | |
1703 | ||
1704 | return local_tb; | |
1705 | out: | |
1706 | fib_trie_free(local_tb); | |
1707 | ||
1708 | return NULL; | |
1709 | } | |
1710 | ||
104616e7 SF |
1711 | /* Caller must hold RTNL */ |
1712 | void fib_table_flush_external(struct fib_table *tb) | |
1713 | { | |
1714 | struct trie *t = (struct trie *)tb->tb_data; | |
88bae714 AD |
1715 | struct key_vector *pn = t->kv; |
1716 | unsigned long cindex = 1; | |
1717 | struct hlist_node *tmp; | |
104616e7 | 1718 | struct fib_alias *fa; |
104616e7 | 1719 | |
88bae714 AD |
1720 | /* walk trie in reverse order */ |
1721 | for (;;) { | |
0ddcf43d | 1722 | unsigned char slen = 0; |
88bae714 | 1723 | struct key_vector *n; |
104616e7 | 1724 | |
88bae714 AD |
1725 | if (!(cindex--)) { |
1726 | t_key pkey = pn->key; | |
104616e7 | 1727 | |
88bae714 AD |
1728 | /* cannot resize the trie vector */ |
1729 | if (IS_TRIE(pn)) | |
1730 | break; | |
104616e7 | 1731 | |
0ddcf43d AD |
1732 | /* resize completed node */ |
1733 | pn = resize(t, pn); | |
88bae714 | 1734 | cindex = get_index(pkey, pn); |
104616e7 | 1735 | |
88bae714 AD |
1736 | continue; |
1737 | } | |
104616e7 | 1738 | |
88bae714 AD |
1739 | /* grab the next available node */ |
1740 | n = get_child(pn, cindex); | |
1741 | if (!n) | |
1742 | continue; | |
104616e7 | 1743 | |
88bae714 AD |
1744 | if (IS_TNODE(n)) { |
1745 | /* record pn and cindex for leaf walking */ | |
1746 | pn = n; | |
1747 | cindex = 1ul << n->bits; | |
104616e7 | 1748 | |
72be7260 | 1749 | continue; |
88bae714 | 1750 | } |
72be7260 | 1751 | |
88bae714 AD |
1752 | hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) { |
1753 | struct fib_info *fi = fa->fa_info; | |
1754 | ||
0ddcf43d AD |
1755 | /* if alias was cloned to local then we just |
1756 | * need to remove the local copy from main | |
1757 | */ | |
1758 | if (tb->tb_id != fa->tb_id) { | |
1759 | hlist_del_rcu(&fa->fa_list); | |
1760 | alias_free_mem_rcu(fa); | |
1761 | continue; | |
1762 | } | |
1763 | ||
1764 | /* record local slen */ | |
1765 | slen = fa->fa_slen; | |
1766 | ||
eea39946 | 1767 | if (!fi || !(fi->fib_flags & RTNH_F_OFFLOAD)) |
88bae714 | 1768 | continue; |
104616e7 | 1769 | |
88bae714 AD |
1770 | netdev_switch_fib_ipv4_del(n->key, |
1771 | KEYLENGTH - fa->fa_slen, | |
1772 | fi, fa->fa_tos, | |
1773 | fa->fa_type, tb->tb_id); | |
1774 | } | |
0ddcf43d AD |
1775 | |
1776 | /* update leaf slen */ | |
1777 | n->slen = slen; | |
1778 | ||
1779 | if (hlist_empty(&n->leaf)) { | |
1780 | put_child_root(pn, n->key, NULL); | |
1781 | node_free(n); | |
1782 | } else { | |
1783 | leaf_pull_suffix(pn, n); | |
1784 | } | |
88bae714 | 1785 | } |
104616e7 SF |
1786 | } |
1787 | ||
8be33e95 | 1788 | /* Caller must hold RTNL. */ |
16c6cf8b | 1789 | int fib_table_flush(struct fib_table *tb) |
19baf839 | 1790 | { |
7289e6dd | 1791 | struct trie *t = (struct trie *)tb->tb_data; |
88bae714 AD |
1792 | struct key_vector *pn = t->kv; |
1793 | unsigned long cindex = 1; | |
7289e6dd AD |
1794 | struct hlist_node *tmp; |
1795 | struct fib_alias *fa; | |
82cfbb00 | 1796 | int found = 0; |
19baf839 | 1797 | |
88bae714 AD |
1798 | /* walk trie in reverse order */ |
1799 | for (;;) { | |
1800 | unsigned char slen = 0; | |
1801 | struct key_vector *n; | |
19baf839 | 1802 | |
88bae714 AD |
1803 | if (!(cindex--)) { |
1804 | t_key pkey = pn->key; | |
7289e6dd | 1805 | |
88bae714 AD |
1806 | /* cannot resize the trie vector */ |
1807 | if (IS_TRIE(pn)) | |
1808 | break; | |
7289e6dd | 1809 | |
88bae714 AD |
1810 | /* resize completed node */ |
1811 | pn = resize(t, pn); | |
1812 | cindex = get_index(pkey, pn); | |
7289e6dd | 1813 | |
88bae714 AD |
1814 | continue; |
1815 | } | |
7289e6dd | 1816 | |
88bae714 AD |
1817 | /* grab the next available node */ |
1818 | n = get_child(pn, cindex); | |
1819 | if (!n) | |
1820 | continue; | |
7289e6dd | 1821 | |
88bae714 AD |
1822 | if (IS_TNODE(n)) { |
1823 | /* record pn and cindex for leaf walking */ | |
1824 | pn = n; | |
1825 | cindex = 1ul << n->bits; | |
7289e6dd | 1826 | |
88bae714 AD |
1827 | continue; |
1828 | } | |
7289e6dd | 1829 | |
88bae714 AD |
1830 | hlist_for_each_entry_safe(fa, tmp, &n->leaf, fa_list) { |
1831 | struct fib_info *fi = fa->fa_info; | |
7289e6dd | 1832 | |
88bae714 AD |
1833 | if (!fi || !(fi->fib_flags & RTNH_F_DEAD)) { |
1834 | slen = fa->fa_slen; | |
1835 | continue; | |
1836 | } | |
7289e6dd | 1837 | |
8e05fd71 SF |
1838 | netdev_switch_fib_ipv4_del(n->key, |
1839 | KEYLENGTH - fa->fa_slen, | |
1840 | fi, fa->fa_tos, | |
1841 | fa->fa_type, tb->tb_id); | |
7289e6dd AD |
1842 | hlist_del_rcu(&fa->fa_list); |
1843 | fib_release_info(fa->fa_info); | |
1844 | alias_free_mem_rcu(fa); | |
1845 | found++; | |
64c62723 AD |
1846 | } |
1847 | ||
88bae714 AD |
1848 | /* update leaf slen */ |
1849 | n->slen = slen; | |
7289e6dd | 1850 | |
88bae714 AD |
1851 | if (hlist_empty(&n->leaf)) { |
1852 | put_child_root(pn, n->key, NULL); | |
1853 | node_free(n); | |
1854 | } else { | |
1855 | leaf_pull_suffix(pn, n); | |
1856 | } | |
64c62723 | 1857 | } |
19baf839 | 1858 | |
0c7770c7 | 1859 | pr_debug("trie_flush found=%d\n", found); |
19baf839 RO |
1860 | return found; |
1861 | } | |
1862 | ||
a7e53531 | 1863 | static void __trie_free_rcu(struct rcu_head *head) |
4aa2c466 | 1864 | { |
a7e53531 | 1865 | struct fib_table *tb = container_of(head, struct fib_table, rcu); |
8274a97a AD |
1866 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
1867 | struct trie *t = (struct trie *)tb->tb_data; | |
1868 | ||
0ddcf43d AD |
1869 | if (tb->tb_data == tb->__data) |
1870 | free_percpu(t->stats); | |
8274a97a | 1871 | #endif /* CONFIG_IP_FIB_TRIE_STATS */ |
4aa2c466 PE |
1872 | kfree(tb); |
1873 | } | |
1874 | ||
a7e53531 AD |
1875 | void fib_free_table(struct fib_table *tb) |
1876 | { | |
1877 | call_rcu(&tb->rcu, __trie_free_rcu); | |
1878 | } | |
1879 | ||
35c6edac | 1880 | static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb, |
79e5ad2c | 1881 | struct sk_buff *skb, struct netlink_callback *cb) |
19baf839 | 1882 | { |
79e5ad2c | 1883 | __be32 xkey = htonl(l->key); |
19baf839 | 1884 | struct fib_alias *fa; |
79e5ad2c | 1885 | int i, s_i; |
19baf839 | 1886 | |
79e5ad2c | 1887 | s_i = cb->args[4]; |
19baf839 RO |
1888 | i = 0; |
1889 | ||
2373ce1c | 1890 | /* rcu_read_lock is hold by caller */ |
79e5ad2c | 1891 | hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) { |
19baf839 RO |
1892 | if (i < s_i) { |
1893 | i++; | |
1894 | continue; | |
1895 | } | |
19baf839 | 1896 | |
0ddcf43d AD |
1897 | if (tb->tb_id != fa->tb_id) { |
1898 | i++; | |
1899 | continue; | |
1900 | } | |
1901 | ||
15e47304 | 1902 | if (fib_dump_info(skb, NETLINK_CB(cb->skb).portid, |
19baf839 RO |
1903 | cb->nlh->nlmsg_seq, |
1904 | RTM_NEWROUTE, | |
1905 | tb->tb_id, | |
1906 | fa->fa_type, | |
be403ea1 | 1907 | xkey, |
9b6ebad5 | 1908 | KEYLENGTH - fa->fa_slen, |
19baf839 | 1909 | fa->fa_tos, |
64347f78 | 1910 | fa->fa_info, NLM_F_MULTI) < 0) { |
71d67e66 | 1911 | cb->args[4] = i; |
19baf839 RO |
1912 | return -1; |
1913 | } | |
a88ee229 | 1914 | i++; |
19baf839 | 1915 | } |
a88ee229 | 1916 | |
71d67e66 | 1917 | cb->args[4] = i; |
19baf839 RO |
1918 | return skb->len; |
1919 | } | |
1920 | ||
a7e53531 | 1921 | /* rcu_read_lock needs to be hold by caller from readside */ |
16c6cf8b SH |
1922 | int fib_table_dump(struct fib_table *tb, struct sk_buff *skb, |
1923 | struct netlink_callback *cb) | |
19baf839 | 1924 | { |
8be33e95 | 1925 | struct trie *t = (struct trie *)tb->tb_data; |
88bae714 | 1926 | struct key_vector *l, *tp = t->kv; |
d5ce8a0e SH |
1927 | /* Dump starting at last key. |
1928 | * Note: 0.0.0.0/0 (ie default) is first key. | |
1929 | */ | |
8be33e95 AD |
1930 | int count = cb->args[2]; |
1931 | t_key key = cb->args[3]; | |
a88ee229 | 1932 | |
8be33e95 | 1933 | while ((l = leaf_walk_rcu(&tp, key)) != NULL) { |
a88ee229 | 1934 | if (fn_trie_dump_leaf(l, tb, skb, cb) < 0) { |
8be33e95 AD |
1935 | cb->args[3] = key; |
1936 | cb->args[2] = count; | |
a88ee229 | 1937 | return -1; |
19baf839 | 1938 | } |
d5ce8a0e | 1939 | |
71d67e66 | 1940 | ++count; |
8be33e95 AD |
1941 | key = l->key + 1; |
1942 | ||
71d67e66 SH |
1943 | memset(&cb->args[4], 0, |
1944 | sizeof(cb->args) - 4*sizeof(cb->args[0])); | |
8be33e95 AD |
1945 | |
1946 | /* stop loop if key wrapped back to 0 */ | |
1947 | if (key < l->key) | |
1948 | break; | |
19baf839 | 1949 | } |
8be33e95 | 1950 | |
8be33e95 AD |
1951 | cb->args[3] = key; |
1952 | cb->args[2] = count; | |
1953 | ||
19baf839 | 1954 | return skb->len; |
19baf839 RO |
1955 | } |
1956 | ||
5348ba85 | 1957 | void __init fib_trie_init(void) |
7f9b8052 | 1958 | { |
a07f5f50 SH |
1959 | fn_alias_kmem = kmem_cache_create("ip_fib_alias", |
1960 | sizeof(struct fib_alias), | |
bc3c8c1e SH |
1961 | 0, SLAB_PANIC, NULL); |
1962 | ||
1963 | trie_leaf_kmem = kmem_cache_create("ip_fib_trie", | |
41b489fd | 1964 | LEAF_SIZE, |
bc3c8c1e | 1965 | 0, SLAB_PANIC, NULL); |
7f9b8052 | 1966 | } |
19baf839 | 1967 | |
0ddcf43d | 1968 | struct fib_table *fib_trie_table(u32 id, struct fib_table *alias) |
19baf839 RO |
1969 | { |
1970 | struct fib_table *tb; | |
1971 | struct trie *t; | |
0ddcf43d AD |
1972 | size_t sz = sizeof(*tb); |
1973 | ||
1974 | if (!alias) | |
1975 | sz += sizeof(struct trie); | |
19baf839 | 1976 | |
0ddcf43d | 1977 | tb = kzalloc(sz, GFP_KERNEL); |
51456b29 | 1978 | if (!tb) |
19baf839 RO |
1979 | return NULL; |
1980 | ||
1981 | tb->tb_id = id; | |
971b893e | 1982 | tb->tb_default = -1; |
21d8c49e | 1983 | tb->tb_num_default = 0; |
0ddcf43d AD |
1984 | tb->tb_data = (alias ? alias->__data : tb->__data); |
1985 | ||
1986 | if (alias) | |
1987 | return tb; | |
19baf839 RO |
1988 | |
1989 | t = (struct trie *) tb->tb_data; | |
88bae714 AD |
1990 | t->kv[0].pos = KEYLENGTH; |
1991 | t->kv[0].slen = KEYLENGTH; | |
8274a97a AD |
1992 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
1993 | t->stats = alloc_percpu(struct trie_use_stats); | |
1994 | if (!t->stats) { | |
1995 | kfree(tb); | |
1996 | tb = NULL; | |
1997 | } | |
1998 | #endif | |
19baf839 | 1999 | |
19baf839 RO |
2000 | return tb; |
2001 | } | |
2002 | ||
cb7b593c SH |
2003 | #ifdef CONFIG_PROC_FS |
2004 | /* Depth first Trie walk iterator */ | |
2005 | struct fib_trie_iter { | |
1c340b2f | 2006 | struct seq_net_private p; |
3d3b2d25 | 2007 | struct fib_table *tb; |
35c6edac | 2008 | struct key_vector *tnode; |
a034ee3c ED |
2009 | unsigned int index; |
2010 | unsigned int depth; | |
cb7b593c | 2011 | }; |
19baf839 | 2012 | |
35c6edac | 2013 | static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter) |
19baf839 | 2014 | { |
98293e8d | 2015 | unsigned long cindex = iter->index; |
88bae714 AD |
2016 | struct key_vector *pn = iter->tnode; |
2017 | t_key pkey; | |
6640e697 | 2018 | |
cb7b593c SH |
2019 | pr_debug("get_next iter={node=%p index=%d depth=%d}\n", |
2020 | iter->tnode, iter->index, iter->depth); | |
19baf839 | 2021 | |
88bae714 AD |
2022 | while (!IS_TRIE(pn)) { |
2023 | while (cindex < child_length(pn)) { | |
2024 | struct key_vector *n = get_child_rcu(pn, cindex++); | |
2025 | ||
2026 | if (!n) | |
2027 | continue; | |
2028 | ||
cb7b593c | 2029 | if (IS_LEAF(n)) { |
88bae714 AD |
2030 | iter->tnode = pn; |
2031 | iter->index = cindex; | |
cb7b593c SH |
2032 | } else { |
2033 | /* push down one level */ | |
adaf9816 | 2034 | iter->tnode = n; |
cb7b593c SH |
2035 | iter->index = 0; |
2036 | ++iter->depth; | |
2037 | } | |
88bae714 | 2038 | |
cb7b593c SH |
2039 | return n; |
2040 | } | |
19baf839 | 2041 | |
88bae714 AD |
2042 | /* Current node exhausted, pop back up */ |
2043 | pkey = pn->key; | |
2044 | pn = node_parent_rcu(pn); | |
2045 | cindex = get_index(pkey, pn) + 1; | |
cb7b593c | 2046 | --iter->depth; |
19baf839 | 2047 | } |
cb7b593c | 2048 | |
88bae714 AD |
2049 | /* record root node so further searches know we are done */ |
2050 | iter->tnode = pn; | |
2051 | iter->index = 0; | |
2052 | ||
cb7b593c | 2053 | return NULL; |
19baf839 RO |
2054 | } |
2055 | ||
35c6edac AD |
2056 | static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter, |
2057 | struct trie *t) | |
19baf839 | 2058 | { |
88bae714 | 2059 | struct key_vector *n, *pn = t->kv; |
5ddf0eb2 | 2060 | |
132adf54 | 2061 | if (!t) |
5ddf0eb2 RO |
2062 | return NULL; |
2063 | ||
88bae714 | 2064 | n = rcu_dereference(pn->tnode[0]); |
3d3b2d25 | 2065 | if (!n) |
5ddf0eb2 | 2066 | return NULL; |
19baf839 | 2067 | |
3d3b2d25 | 2068 | if (IS_TNODE(n)) { |
adaf9816 | 2069 | iter->tnode = n; |
3d3b2d25 SH |
2070 | iter->index = 0; |
2071 | iter->depth = 1; | |
2072 | } else { | |
88bae714 | 2073 | iter->tnode = pn; |
3d3b2d25 SH |
2074 | iter->index = 0; |
2075 | iter->depth = 0; | |
91b9a277 | 2076 | } |
3d3b2d25 SH |
2077 | |
2078 | return n; | |
cb7b593c | 2079 | } |
91b9a277 | 2080 | |
cb7b593c SH |
2081 | static void trie_collect_stats(struct trie *t, struct trie_stat *s) |
2082 | { | |
35c6edac | 2083 | struct key_vector *n; |
cb7b593c | 2084 | struct fib_trie_iter iter; |
91b9a277 | 2085 | |
cb7b593c | 2086 | memset(s, 0, sizeof(*s)); |
91b9a277 | 2087 | |
cb7b593c | 2088 | rcu_read_lock(); |
3d3b2d25 | 2089 | for (n = fib_trie_get_first(&iter, t); n; n = fib_trie_get_next(&iter)) { |
cb7b593c | 2090 | if (IS_LEAF(n)) { |
79e5ad2c | 2091 | struct fib_alias *fa; |
93672292 | 2092 | |
cb7b593c SH |
2093 | s->leaves++; |
2094 | s->totdepth += iter.depth; | |
2095 | if (iter.depth > s->maxdepth) | |
2096 | s->maxdepth = iter.depth; | |
93672292 | 2097 | |
79e5ad2c | 2098 | hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) |
93672292 | 2099 | ++s->prefixes; |
cb7b593c | 2100 | } else { |
cb7b593c | 2101 | s->tnodes++; |
adaf9816 AD |
2102 | if (n->bits < MAX_STAT_DEPTH) |
2103 | s->nodesizes[n->bits]++; | |
6e22d174 | 2104 | s->nullpointers += tn_info(n)->empty_children; |
19baf839 | 2105 | } |
19baf839 | 2106 | } |
2373ce1c | 2107 | rcu_read_unlock(); |
19baf839 RO |
2108 | } |
2109 | ||
cb7b593c SH |
2110 | /* |
2111 | * This outputs /proc/net/fib_triestats | |
2112 | */ | |
2113 | static void trie_show_stats(struct seq_file *seq, struct trie_stat *stat) | |
19baf839 | 2114 | { |
a034ee3c | 2115 | unsigned int i, max, pointers, bytes, avdepth; |
c877efb2 | 2116 | |
cb7b593c SH |
2117 | if (stat->leaves) |
2118 | avdepth = stat->totdepth*100 / stat->leaves; | |
2119 | else | |
2120 | avdepth = 0; | |
91b9a277 | 2121 | |
a07f5f50 SH |
2122 | seq_printf(seq, "\tAver depth: %u.%02d\n", |
2123 | avdepth / 100, avdepth % 100); | |
cb7b593c | 2124 | seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth); |
91b9a277 | 2125 | |
cb7b593c | 2126 | seq_printf(seq, "\tLeaves: %u\n", stat->leaves); |
41b489fd | 2127 | bytes = LEAF_SIZE * stat->leaves; |
93672292 SH |
2128 | |
2129 | seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes); | |
79e5ad2c | 2130 | bytes += sizeof(struct fib_alias) * stat->prefixes; |
93672292 | 2131 | |
187b5188 | 2132 | seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes); |
41b489fd | 2133 | bytes += TNODE_SIZE(0) * stat->tnodes; |
19baf839 | 2134 | |
06ef921d RO |
2135 | max = MAX_STAT_DEPTH; |
2136 | while (max > 0 && stat->nodesizes[max-1] == 0) | |
cb7b593c | 2137 | max--; |
19baf839 | 2138 | |
cb7b593c | 2139 | pointers = 0; |
f585a991 | 2140 | for (i = 1; i < max; i++) |
cb7b593c | 2141 | if (stat->nodesizes[i] != 0) { |
187b5188 | 2142 | seq_printf(seq, " %u: %u", i, stat->nodesizes[i]); |
cb7b593c SH |
2143 | pointers += (1<<i) * stat->nodesizes[i]; |
2144 | } | |
2145 | seq_putc(seq, '\n'); | |
187b5188 | 2146 | seq_printf(seq, "\tPointers: %u\n", pointers); |
2373ce1c | 2147 | |
35c6edac | 2148 | bytes += sizeof(struct key_vector *) * pointers; |
187b5188 SH |
2149 | seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers); |
2150 | seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024); | |
66a2f7fd | 2151 | } |
2373ce1c | 2152 | |
cb7b593c | 2153 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
66a2f7fd | 2154 | static void trie_show_usage(struct seq_file *seq, |
8274a97a | 2155 | const struct trie_use_stats __percpu *stats) |
66a2f7fd | 2156 | { |
8274a97a AD |
2157 | struct trie_use_stats s = { 0 }; |
2158 | int cpu; | |
2159 | ||
2160 | /* loop through all of the CPUs and gather up the stats */ | |
2161 | for_each_possible_cpu(cpu) { | |
2162 | const struct trie_use_stats *pcpu = per_cpu_ptr(stats, cpu); | |
2163 | ||
2164 | s.gets += pcpu->gets; | |
2165 | s.backtrack += pcpu->backtrack; | |
2166 | s.semantic_match_passed += pcpu->semantic_match_passed; | |
2167 | s.semantic_match_miss += pcpu->semantic_match_miss; | |
2168 | s.null_node_hit += pcpu->null_node_hit; | |
2169 | s.resize_node_skipped += pcpu->resize_node_skipped; | |
2170 | } | |
2171 | ||
66a2f7fd | 2172 | seq_printf(seq, "\nCounters:\n---------\n"); |
8274a97a AD |
2173 | seq_printf(seq, "gets = %u\n", s.gets); |
2174 | seq_printf(seq, "backtracks = %u\n", s.backtrack); | |
a07f5f50 | 2175 | seq_printf(seq, "semantic match passed = %u\n", |
8274a97a AD |
2176 | s.semantic_match_passed); |
2177 | seq_printf(seq, "semantic match miss = %u\n", s.semantic_match_miss); | |
2178 | seq_printf(seq, "null node hit= %u\n", s.null_node_hit); | |
2179 | seq_printf(seq, "skipped node resize = %u\n\n", s.resize_node_skipped); | |
cb7b593c | 2180 | } |
66a2f7fd SH |
2181 | #endif /* CONFIG_IP_FIB_TRIE_STATS */ |
2182 | ||
3d3b2d25 | 2183 | static void fib_table_print(struct seq_file *seq, struct fib_table *tb) |
d717a9a6 | 2184 | { |
3d3b2d25 SH |
2185 | if (tb->tb_id == RT_TABLE_LOCAL) |
2186 | seq_puts(seq, "Local:\n"); | |
2187 | else if (tb->tb_id == RT_TABLE_MAIN) | |
2188 | seq_puts(seq, "Main:\n"); | |
2189 | else | |
2190 | seq_printf(seq, "Id %d:\n", tb->tb_id); | |
d717a9a6 | 2191 | } |
19baf839 | 2192 | |
3d3b2d25 | 2193 | |
cb7b593c SH |
2194 | static int fib_triestat_seq_show(struct seq_file *seq, void *v) |
2195 | { | |
1c340b2f | 2196 | struct net *net = (struct net *)seq->private; |
3d3b2d25 | 2197 | unsigned int h; |
877a9bff | 2198 | |
d717a9a6 | 2199 | seq_printf(seq, |
a07f5f50 SH |
2200 | "Basic info: size of leaf:" |
2201 | " %Zd bytes, size of tnode: %Zd bytes.\n", | |
41b489fd | 2202 | LEAF_SIZE, TNODE_SIZE(0)); |
d717a9a6 | 2203 | |
3d3b2d25 SH |
2204 | for (h = 0; h < FIB_TABLE_HASHSZ; h++) { |
2205 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; | |
3d3b2d25 SH |
2206 | struct fib_table *tb; |
2207 | ||
b67bfe0d | 2208 | hlist_for_each_entry_rcu(tb, head, tb_hlist) { |
3d3b2d25 SH |
2209 | struct trie *t = (struct trie *) tb->tb_data; |
2210 | struct trie_stat stat; | |
877a9bff | 2211 | |
3d3b2d25 SH |
2212 | if (!t) |
2213 | continue; | |
2214 | ||
2215 | fib_table_print(seq, tb); | |
2216 | ||
2217 | trie_collect_stats(t, &stat); | |
2218 | trie_show_stats(seq, &stat); | |
2219 | #ifdef CONFIG_IP_FIB_TRIE_STATS | |
8274a97a | 2220 | trie_show_usage(seq, t->stats); |
3d3b2d25 SH |
2221 | #endif |
2222 | } | |
2223 | } | |
19baf839 | 2224 | |
cb7b593c | 2225 | return 0; |
19baf839 RO |
2226 | } |
2227 | ||
cb7b593c | 2228 | static int fib_triestat_seq_open(struct inode *inode, struct file *file) |
19baf839 | 2229 | { |
de05c557 | 2230 | return single_open_net(inode, file, fib_triestat_seq_show); |
1c340b2f DL |
2231 | } |
2232 | ||
9a32144e | 2233 | static const struct file_operations fib_triestat_fops = { |
cb7b593c SH |
2234 | .owner = THIS_MODULE, |
2235 | .open = fib_triestat_seq_open, | |
2236 | .read = seq_read, | |
2237 | .llseek = seq_lseek, | |
b6fcbdb4 | 2238 | .release = single_release_net, |
cb7b593c SH |
2239 | }; |
2240 | ||
35c6edac | 2241 | static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos) |
19baf839 | 2242 | { |
1218854a YH |
2243 | struct fib_trie_iter *iter = seq->private; |
2244 | struct net *net = seq_file_net(seq); | |
cb7b593c | 2245 | loff_t idx = 0; |
3d3b2d25 | 2246 | unsigned int h; |
cb7b593c | 2247 | |
3d3b2d25 SH |
2248 | for (h = 0; h < FIB_TABLE_HASHSZ; h++) { |
2249 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; | |
3d3b2d25 | 2250 | struct fib_table *tb; |
cb7b593c | 2251 | |
b67bfe0d | 2252 | hlist_for_each_entry_rcu(tb, head, tb_hlist) { |
35c6edac | 2253 | struct key_vector *n; |
3d3b2d25 SH |
2254 | |
2255 | for (n = fib_trie_get_first(iter, | |
2256 | (struct trie *) tb->tb_data); | |
2257 | n; n = fib_trie_get_next(iter)) | |
2258 | if (pos == idx++) { | |
2259 | iter->tb = tb; | |
2260 | return n; | |
2261 | } | |
2262 | } | |
cb7b593c | 2263 | } |
3d3b2d25 | 2264 | |
19baf839 RO |
2265 | return NULL; |
2266 | } | |
2267 | ||
cb7b593c | 2268 | static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos) |
c95aaf9a | 2269 | __acquires(RCU) |
19baf839 | 2270 | { |
cb7b593c | 2271 | rcu_read_lock(); |
1218854a | 2272 | return fib_trie_get_idx(seq, *pos); |
19baf839 RO |
2273 | } |
2274 | ||
cb7b593c | 2275 | static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
19baf839 | 2276 | { |
cb7b593c | 2277 | struct fib_trie_iter *iter = seq->private; |
1218854a | 2278 | struct net *net = seq_file_net(seq); |
3d3b2d25 SH |
2279 | struct fib_table *tb = iter->tb; |
2280 | struct hlist_node *tb_node; | |
2281 | unsigned int h; | |
35c6edac | 2282 | struct key_vector *n; |
cb7b593c | 2283 | |
19baf839 | 2284 | ++*pos; |
3d3b2d25 SH |
2285 | /* next node in same table */ |
2286 | n = fib_trie_get_next(iter); | |
2287 | if (n) | |
2288 | return n; | |
19baf839 | 2289 | |
3d3b2d25 SH |
2290 | /* walk rest of this hash chain */ |
2291 | h = tb->tb_id & (FIB_TABLE_HASHSZ - 1); | |
0a5c0475 | 2292 | while ((tb_node = rcu_dereference(hlist_next_rcu(&tb->tb_hlist)))) { |
3d3b2d25 SH |
2293 | tb = hlist_entry(tb_node, struct fib_table, tb_hlist); |
2294 | n = fib_trie_get_first(iter, (struct trie *) tb->tb_data); | |
2295 | if (n) | |
2296 | goto found; | |
2297 | } | |
19baf839 | 2298 | |
3d3b2d25 SH |
2299 | /* new hash chain */ |
2300 | while (++h < FIB_TABLE_HASHSZ) { | |
2301 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; | |
b67bfe0d | 2302 | hlist_for_each_entry_rcu(tb, head, tb_hlist) { |
3d3b2d25 SH |
2303 | n = fib_trie_get_first(iter, (struct trie *) tb->tb_data); |
2304 | if (n) | |
2305 | goto found; | |
2306 | } | |
2307 | } | |
cb7b593c | 2308 | return NULL; |
3d3b2d25 SH |
2309 | |
2310 | found: | |
2311 | iter->tb = tb; | |
2312 | return n; | |
cb7b593c | 2313 | } |
19baf839 | 2314 | |
cb7b593c | 2315 | static void fib_trie_seq_stop(struct seq_file *seq, void *v) |
c95aaf9a | 2316 | __releases(RCU) |
19baf839 | 2317 | { |
cb7b593c SH |
2318 | rcu_read_unlock(); |
2319 | } | |
91b9a277 | 2320 | |
cb7b593c SH |
2321 | static void seq_indent(struct seq_file *seq, int n) |
2322 | { | |
a034ee3c ED |
2323 | while (n-- > 0) |
2324 | seq_puts(seq, " "); | |
cb7b593c | 2325 | } |
19baf839 | 2326 | |
28d36e37 | 2327 | static inline const char *rtn_scope(char *buf, size_t len, enum rt_scope_t s) |
cb7b593c | 2328 | { |
132adf54 | 2329 | switch (s) { |
cb7b593c SH |
2330 | case RT_SCOPE_UNIVERSE: return "universe"; |
2331 | case RT_SCOPE_SITE: return "site"; | |
2332 | case RT_SCOPE_LINK: return "link"; | |
2333 | case RT_SCOPE_HOST: return "host"; | |
2334 | case RT_SCOPE_NOWHERE: return "nowhere"; | |
2335 | default: | |
28d36e37 | 2336 | snprintf(buf, len, "scope=%d", s); |
cb7b593c SH |
2337 | return buf; |
2338 | } | |
2339 | } | |
19baf839 | 2340 | |
36cbd3dc | 2341 | static const char *const rtn_type_names[__RTN_MAX] = { |
cb7b593c SH |
2342 | [RTN_UNSPEC] = "UNSPEC", |
2343 | [RTN_UNICAST] = "UNICAST", | |
2344 | [RTN_LOCAL] = "LOCAL", | |
2345 | [RTN_BROADCAST] = "BROADCAST", | |
2346 | [RTN_ANYCAST] = "ANYCAST", | |
2347 | [RTN_MULTICAST] = "MULTICAST", | |
2348 | [RTN_BLACKHOLE] = "BLACKHOLE", | |
2349 | [RTN_UNREACHABLE] = "UNREACHABLE", | |
2350 | [RTN_PROHIBIT] = "PROHIBIT", | |
2351 | [RTN_THROW] = "THROW", | |
2352 | [RTN_NAT] = "NAT", | |
2353 | [RTN_XRESOLVE] = "XRESOLVE", | |
2354 | }; | |
19baf839 | 2355 | |
a034ee3c | 2356 | static inline const char *rtn_type(char *buf, size_t len, unsigned int t) |
cb7b593c | 2357 | { |
cb7b593c SH |
2358 | if (t < __RTN_MAX && rtn_type_names[t]) |
2359 | return rtn_type_names[t]; | |
28d36e37 | 2360 | snprintf(buf, len, "type %u", t); |
cb7b593c | 2361 | return buf; |
19baf839 RO |
2362 | } |
2363 | ||
cb7b593c SH |
2364 | /* Pretty print the trie */ |
2365 | static int fib_trie_seq_show(struct seq_file *seq, void *v) | |
19baf839 | 2366 | { |
cb7b593c | 2367 | const struct fib_trie_iter *iter = seq->private; |
35c6edac | 2368 | struct key_vector *n = v; |
c877efb2 | 2369 | |
88bae714 | 2370 | if (IS_TRIE(node_parent_rcu(n))) |
3d3b2d25 | 2371 | fib_table_print(seq, iter->tb); |
095b8501 | 2372 | |
cb7b593c | 2373 | if (IS_TNODE(n)) { |
adaf9816 | 2374 | __be32 prf = htonl(n->key); |
91b9a277 | 2375 | |
e9b44019 AD |
2376 | seq_indent(seq, iter->depth-1); |
2377 | seq_printf(seq, " +-- %pI4/%zu %u %u %u\n", | |
2378 | &prf, KEYLENGTH - n->pos - n->bits, n->bits, | |
6e22d174 AD |
2379 | tn_info(n)->full_children, |
2380 | tn_info(n)->empty_children); | |
cb7b593c | 2381 | } else { |
adaf9816 | 2382 | __be32 val = htonl(n->key); |
79e5ad2c | 2383 | struct fib_alias *fa; |
cb7b593c SH |
2384 | |
2385 | seq_indent(seq, iter->depth); | |
673d57e7 | 2386 | seq_printf(seq, " |-- %pI4\n", &val); |
1328042e | 2387 | |
79e5ad2c AD |
2388 | hlist_for_each_entry_rcu(fa, &n->leaf, fa_list) { |
2389 | char buf1[32], buf2[32]; | |
2390 | ||
2391 | seq_indent(seq, iter->depth + 1); | |
2392 | seq_printf(seq, " /%zu %s %s", | |
2393 | KEYLENGTH - fa->fa_slen, | |
2394 | rtn_scope(buf1, sizeof(buf1), | |
2395 | fa->fa_info->fib_scope), | |
2396 | rtn_type(buf2, sizeof(buf2), | |
2397 | fa->fa_type)); | |
2398 | if (fa->fa_tos) | |
2399 | seq_printf(seq, " tos=%d", fa->fa_tos); | |
2400 | seq_putc(seq, '\n'); | |
cb7b593c | 2401 | } |
19baf839 | 2402 | } |
cb7b593c | 2403 | |
19baf839 RO |
2404 | return 0; |
2405 | } | |
2406 | ||
f690808e | 2407 | static const struct seq_operations fib_trie_seq_ops = { |
cb7b593c SH |
2408 | .start = fib_trie_seq_start, |
2409 | .next = fib_trie_seq_next, | |
2410 | .stop = fib_trie_seq_stop, | |
2411 | .show = fib_trie_seq_show, | |
19baf839 RO |
2412 | }; |
2413 | ||
cb7b593c | 2414 | static int fib_trie_seq_open(struct inode *inode, struct file *file) |
19baf839 | 2415 | { |
1c340b2f DL |
2416 | return seq_open_net(inode, file, &fib_trie_seq_ops, |
2417 | sizeof(struct fib_trie_iter)); | |
19baf839 RO |
2418 | } |
2419 | ||
9a32144e | 2420 | static const struct file_operations fib_trie_fops = { |
cb7b593c SH |
2421 | .owner = THIS_MODULE, |
2422 | .open = fib_trie_seq_open, | |
2423 | .read = seq_read, | |
2424 | .llseek = seq_lseek, | |
1c340b2f | 2425 | .release = seq_release_net, |
19baf839 RO |
2426 | }; |
2427 | ||
8315f5d8 SH |
2428 | struct fib_route_iter { |
2429 | struct seq_net_private p; | |
8be33e95 | 2430 | struct fib_table *main_tb; |
35c6edac | 2431 | struct key_vector *tnode; |
8315f5d8 SH |
2432 | loff_t pos; |
2433 | t_key key; | |
2434 | }; | |
2435 | ||
35c6edac AD |
2436 | static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter, |
2437 | loff_t pos) | |
8315f5d8 | 2438 | { |
8be33e95 | 2439 | struct fib_table *tb = iter->main_tb; |
35c6edac | 2440 | struct key_vector *l, **tp = &iter->tnode; |
8be33e95 AD |
2441 | struct trie *t; |
2442 | t_key key; | |
8315f5d8 | 2443 | |
8be33e95 AD |
2444 | /* use cache location of next-to-find key */ |
2445 | if (iter->pos > 0 && pos >= iter->pos) { | |
8315f5d8 | 2446 | pos -= iter->pos; |
8be33e95 AD |
2447 | key = iter->key; |
2448 | } else { | |
2449 | t = (struct trie *)tb->tb_data; | |
88bae714 | 2450 | iter->tnode = t->kv; |
8315f5d8 | 2451 | iter->pos = 0; |
8be33e95 | 2452 | key = 0; |
8315f5d8 SH |
2453 | } |
2454 | ||
8be33e95 AD |
2455 | while ((l = leaf_walk_rcu(tp, key)) != NULL) { |
2456 | key = l->key + 1; | |
8315f5d8 | 2457 | iter->pos++; |
8be33e95 AD |
2458 | |
2459 | if (pos-- <= 0) | |
2460 | break; | |
2461 | ||
2462 | l = NULL; | |
2463 | ||
2464 | /* handle unlikely case of a key wrap */ | |
2465 | if (!key) | |
2466 | break; | |
8315f5d8 SH |
2467 | } |
2468 | ||
2469 | if (l) | |
8be33e95 | 2470 | iter->key = key; /* remember it */ |
8315f5d8 SH |
2471 | else |
2472 | iter->pos = 0; /* forget it */ | |
2473 | ||
2474 | return l; | |
2475 | } | |
2476 | ||
2477 | static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos) | |
2478 | __acquires(RCU) | |
2479 | { | |
2480 | struct fib_route_iter *iter = seq->private; | |
2481 | struct fib_table *tb; | |
8be33e95 | 2482 | struct trie *t; |
8315f5d8 SH |
2483 | |
2484 | rcu_read_lock(); | |
8be33e95 | 2485 | |
1218854a | 2486 | tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN); |
8315f5d8 SH |
2487 | if (!tb) |
2488 | return NULL; | |
2489 | ||
8be33e95 AD |
2490 | iter->main_tb = tb; |
2491 | ||
2492 | if (*pos != 0) | |
2493 | return fib_route_get_idx(iter, *pos); | |
2494 | ||
2495 | t = (struct trie *)tb->tb_data; | |
88bae714 | 2496 | iter->tnode = t->kv; |
8be33e95 AD |
2497 | iter->pos = 0; |
2498 | iter->key = 0; | |
2499 | ||
2500 | return SEQ_START_TOKEN; | |
8315f5d8 SH |
2501 | } |
2502 | ||
2503 | static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos) | |
2504 | { | |
2505 | struct fib_route_iter *iter = seq->private; | |
35c6edac | 2506 | struct key_vector *l = NULL; |
8be33e95 | 2507 | t_key key = iter->key; |
8315f5d8 SH |
2508 | |
2509 | ++*pos; | |
8be33e95 AD |
2510 | |
2511 | /* only allow key of 0 for start of sequence */ | |
2512 | if ((v == SEQ_START_TOKEN) || key) | |
2513 | l = leaf_walk_rcu(&iter->tnode, key); | |
2514 | ||
2515 | if (l) { | |
2516 | iter->key = l->key + 1; | |
8315f5d8 | 2517 | iter->pos++; |
8be33e95 AD |
2518 | } else { |
2519 | iter->pos = 0; | |
8315f5d8 SH |
2520 | } |
2521 | ||
8315f5d8 SH |
2522 | return l; |
2523 | } | |
2524 | ||
2525 | static void fib_route_seq_stop(struct seq_file *seq, void *v) | |
2526 | __releases(RCU) | |
2527 | { | |
2528 | rcu_read_unlock(); | |
2529 | } | |
2530 | ||
a034ee3c | 2531 | static unsigned int fib_flag_trans(int type, __be32 mask, const struct fib_info *fi) |
19baf839 | 2532 | { |
a034ee3c | 2533 | unsigned int flags = 0; |
19baf839 | 2534 | |
a034ee3c ED |
2535 | if (type == RTN_UNREACHABLE || type == RTN_PROHIBIT) |
2536 | flags = RTF_REJECT; | |
cb7b593c SH |
2537 | if (fi && fi->fib_nh->nh_gw) |
2538 | flags |= RTF_GATEWAY; | |
32ab5f80 | 2539 | if (mask == htonl(0xFFFFFFFF)) |
cb7b593c SH |
2540 | flags |= RTF_HOST; |
2541 | flags |= RTF_UP; | |
2542 | return flags; | |
19baf839 RO |
2543 | } |
2544 | ||
cb7b593c SH |
2545 | /* |
2546 | * This outputs /proc/net/route. | |
2547 | * The format of the file is not supposed to be changed | |
a034ee3c | 2548 | * and needs to be same as fib_hash output to avoid breaking |
cb7b593c SH |
2549 | * legacy utilities |
2550 | */ | |
2551 | static int fib_route_seq_show(struct seq_file *seq, void *v) | |
19baf839 | 2552 | { |
654eff45 AD |
2553 | struct fib_route_iter *iter = seq->private; |
2554 | struct fib_table *tb = iter->main_tb; | |
79e5ad2c | 2555 | struct fib_alias *fa; |
35c6edac | 2556 | struct key_vector *l = v; |
9b6ebad5 | 2557 | __be32 prefix; |
19baf839 | 2558 | |
cb7b593c SH |
2559 | if (v == SEQ_START_TOKEN) { |
2560 | seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway " | |
2561 | "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU" | |
2562 | "\tWindow\tIRTT"); | |
2563 | return 0; | |
2564 | } | |
19baf839 | 2565 | |
9b6ebad5 AD |
2566 | prefix = htonl(l->key); |
2567 | ||
79e5ad2c AD |
2568 | hlist_for_each_entry_rcu(fa, &l->leaf, fa_list) { |
2569 | const struct fib_info *fi = fa->fa_info; | |
2570 | __be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen); | |
2571 | unsigned int flags = fib_flag_trans(fa->fa_type, mask, fi); | |
19baf839 | 2572 | |
79e5ad2c AD |
2573 | if ((fa->fa_type == RTN_BROADCAST) || |
2574 | (fa->fa_type == RTN_MULTICAST)) | |
2575 | continue; | |
19baf839 | 2576 | |
654eff45 AD |
2577 | if (fa->tb_id != tb->tb_id) |
2578 | continue; | |
2579 | ||
79e5ad2c AD |
2580 | seq_setwidth(seq, 127); |
2581 | ||
2582 | if (fi) | |
2583 | seq_printf(seq, | |
2584 | "%s\t%08X\t%08X\t%04X\t%d\t%u\t" | |
2585 | "%d\t%08X\t%d\t%u\t%u", | |
2586 | fi->fib_dev ? fi->fib_dev->name : "*", | |
2587 | prefix, | |
2588 | fi->fib_nh->nh_gw, flags, 0, 0, | |
2589 | fi->fib_priority, | |
2590 | mask, | |
2591 | (fi->fib_advmss ? | |
2592 | fi->fib_advmss + 40 : 0), | |
2593 | fi->fib_window, | |
2594 | fi->fib_rtt >> 3); | |
2595 | else | |
2596 | seq_printf(seq, | |
2597 | "*\t%08X\t%08X\t%04X\t%d\t%u\t" | |
2598 | "%d\t%08X\t%d\t%u\t%u", | |
2599 | prefix, 0, flags, 0, 0, 0, | |
2600 | mask, 0, 0, 0); | |
19baf839 | 2601 | |
79e5ad2c | 2602 | seq_pad(seq, '\n'); |
19baf839 RO |
2603 | } |
2604 | ||
2605 | return 0; | |
2606 | } | |
2607 | ||
f690808e | 2608 | static const struct seq_operations fib_route_seq_ops = { |
8315f5d8 SH |
2609 | .start = fib_route_seq_start, |
2610 | .next = fib_route_seq_next, | |
2611 | .stop = fib_route_seq_stop, | |
cb7b593c | 2612 | .show = fib_route_seq_show, |
19baf839 RO |
2613 | }; |
2614 | ||
cb7b593c | 2615 | static int fib_route_seq_open(struct inode *inode, struct file *file) |
19baf839 | 2616 | { |
1c340b2f | 2617 | return seq_open_net(inode, file, &fib_route_seq_ops, |
8315f5d8 | 2618 | sizeof(struct fib_route_iter)); |
19baf839 RO |
2619 | } |
2620 | ||
9a32144e | 2621 | static const struct file_operations fib_route_fops = { |
cb7b593c SH |
2622 | .owner = THIS_MODULE, |
2623 | .open = fib_route_seq_open, | |
2624 | .read = seq_read, | |
2625 | .llseek = seq_lseek, | |
1c340b2f | 2626 | .release = seq_release_net, |
19baf839 RO |
2627 | }; |
2628 | ||
61a02653 | 2629 | int __net_init fib_proc_init(struct net *net) |
19baf839 | 2630 | { |
d4beaa66 | 2631 | if (!proc_create("fib_trie", S_IRUGO, net->proc_net, &fib_trie_fops)) |
cb7b593c SH |
2632 | goto out1; |
2633 | ||
d4beaa66 G |
2634 | if (!proc_create("fib_triestat", S_IRUGO, net->proc_net, |
2635 | &fib_triestat_fops)) | |
cb7b593c SH |
2636 | goto out2; |
2637 | ||
d4beaa66 | 2638 | if (!proc_create("route", S_IRUGO, net->proc_net, &fib_route_fops)) |
cb7b593c SH |
2639 | goto out3; |
2640 | ||
19baf839 | 2641 | return 0; |
cb7b593c SH |
2642 | |
2643 | out3: | |
ece31ffd | 2644 | remove_proc_entry("fib_triestat", net->proc_net); |
cb7b593c | 2645 | out2: |
ece31ffd | 2646 | remove_proc_entry("fib_trie", net->proc_net); |
cb7b593c SH |
2647 | out1: |
2648 | return -ENOMEM; | |
19baf839 RO |
2649 | } |
2650 | ||
61a02653 | 2651 | void __net_exit fib_proc_exit(struct net *net) |
19baf839 | 2652 | { |
ece31ffd G |
2653 | remove_proc_entry("fib_trie", net->proc_net); |
2654 | remove_proc_entry("fib_triestat", net->proc_net); | |
2655 | remove_proc_entry("route", net->proc_net); | |
19baf839 RO |
2656 | } |
2657 | ||
2658 | #endif /* CONFIG_PROC_FS */ |