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