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