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