Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
1ab1457c | 2 | * Linux INET6 implementation |
1da177e4 LT |
3 | * Forwarding Information Database |
4 | * | |
5 | * Authors: | |
1ab1457c | 6 | * Pedro Roque <roque@di.fc.ul.pt> |
1da177e4 | 7 | * |
1da177e4 LT |
8 | * This program is free software; you can redistribute it and/or |
9 | * modify it under the terms of the GNU General Public License | |
10 | * as published by the Free Software Foundation; either version | |
11 | * 2 of the License, or (at your option) any later version. | |
12 | */ | |
13 | ||
14 | /* | |
15 | * Changes: | |
16 | * Yuji SEKIYA @USAGI: Support default route on router node; | |
17 | * remove ip6_null_entry from the top of | |
18 | * routing table. | |
c0bece9f | 19 | * Ville Nuorvala: Fixed routing subtrees. |
1da177e4 | 20 | */ |
f3213831 JP |
21 | |
22 | #define pr_fmt(fmt) "IPv6: " fmt | |
23 | ||
1da177e4 LT |
24 | #include <linux/errno.h> |
25 | #include <linux/types.h> | |
26 | #include <linux/net.h> | |
27 | #include <linux/route.h> | |
28 | #include <linux/netdevice.h> | |
29 | #include <linux/in6.h> | |
30 | #include <linux/init.h> | |
c71099ac | 31 | #include <linux/list.h> |
5a0e3ad6 | 32 | #include <linux/slab.h> |
1da177e4 | 33 | |
1da177e4 LT |
34 | #include <net/ipv6.h> |
35 | #include <net/ndisc.h> | |
36 | #include <net/addrconf.h> | |
37 | ||
38 | #include <net/ip6_fib.h> | |
39 | #include <net/ip6_route.h> | |
40 | ||
41 | #define RT6_DEBUG 2 | |
42 | ||
43 | #if RT6_DEBUG >= 3 | |
91df42be | 44 | #define RT6_TRACE(x...) pr_debug(x) |
1da177e4 LT |
45 | #else |
46 | #define RT6_TRACE(x...) do { ; } while (0) | |
47 | #endif | |
48 | ||
e18b890b | 49 | static struct kmem_cache * fib6_node_kmem __read_mostly; |
1da177e4 LT |
50 | |
51 | enum fib_walk_state_t | |
52 | { | |
53 | #ifdef CONFIG_IPV6_SUBTREES | |
54 | FWS_S, | |
55 | #endif | |
56 | FWS_L, | |
57 | FWS_R, | |
58 | FWS_C, | |
59 | FWS_U | |
60 | }; | |
61 | ||
62 | struct fib6_cleaner_t | |
63 | { | |
64 | struct fib6_walker_t w; | |
ec7d43c2 | 65 | struct net *net; |
1da177e4 LT |
66 | int (*func)(struct rt6_info *, void *arg); |
67 | void *arg; | |
68 | }; | |
69 | ||
90d41122 | 70 | static DEFINE_RWLOCK(fib6_walker_lock); |
1da177e4 LT |
71 | |
72 | #ifdef CONFIG_IPV6_SUBTREES | |
73 | #define FWS_INIT FWS_S | |
1da177e4 LT |
74 | #else |
75 | #define FWS_INIT FWS_L | |
1da177e4 LT |
76 | #endif |
77 | ||
ec7d43c2 BT |
78 | static void fib6_prune_clones(struct net *net, struct fib6_node *fn, |
79 | struct rt6_info *rt); | |
8ed67789 DL |
80 | static struct rt6_info *fib6_find_prefix(struct net *net, struct fib6_node *fn); |
81 | static struct fib6_node *fib6_repair_tree(struct net *net, struct fib6_node *fn); | |
90d41122 AB |
82 | static int fib6_walk(struct fib6_walker_t *w); |
83 | static int fib6_walk_continue(struct fib6_walker_t *w); | |
1da177e4 LT |
84 | |
85 | /* | |
86 | * A routing update causes an increase of the serial number on the | |
87 | * affected subtree. This allows for cached routes to be asynchronously | |
88 | * tested when modifications are made to the destination cache as a | |
89 | * result of redirects, path MTU changes, etc. | |
90 | */ | |
91 | ||
92 | static __u32 rt_sernum; | |
93 | ||
5b7c931d DL |
94 | static void fib6_gc_timer_cb(unsigned long arg); |
95 | ||
bbef49da AD |
96 | static LIST_HEAD(fib6_walkers); |
97 | #define FOR_WALKERS(w) list_for_each_entry(w, &fib6_walkers, lh) | |
1da177e4 | 98 | |
90d41122 AB |
99 | static inline void fib6_walker_link(struct fib6_walker_t *w) |
100 | { | |
101 | write_lock_bh(&fib6_walker_lock); | |
bbef49da | 102 | list_add(&w->lh, &fib6_walkers); |
90d41122 AB |
103 | write_unlock_bh(&fib6_walker_lock); |
104 | } | |
105 | ||
106 | static inline void fib6_walker_unlink(struct fib6_walker_t *w) | |
107 | { | |
108 | write_lock_bh(&fib6_walker_lock); | |
bbef49da | 109 | list_del(&w->lh); |
90d41122 AB |
110 | write_unlock_bh(&fib6_walker_lock); |
111 | } | |
1da177e4 LT |
112 | static __inline__ u32 fib6_new_sernum(void) |
113 | { | |
114 | u32 n = ++rt_sernum; | |
115 | if ((__s32)n <= 0) | |
116 | rt_sernum = n = 1; | |
117 | return n; | |
118 | } | |
119 | ||
120 | /* | |
121 | * Auxiliary address test functions for the radix tree. | |
122 | * | |
1ab1457c | 123 | * These assume a 32bit processor (although it will work on |
1da177e4 LT |
124 | * 64bit processors) |
125 | */ | |
126 | ||
127 | /* | |
128 | * test bit | |
129 | */ | |
02cdce53 YH |
130 | #if defined(__LITTLE_ENDIAN) |
131 | # define BITOP_BE32_SWIZZLE (0x1F & ~7) | |
132 | #else | |
133 | # define BITOP_BE32_SWIZZLE 0 | |
134 | #endif | |
1da177e4 | 135 | |
b71d1d42 | 136 | static __inline__ __be32 addr_bit_set(const void *token, int fn_bit) |
1da177e4 | 137 | { |
b71d1d42 | 138 | const __be32 *addr = token; |
02cdce53 YH |
139 | /* |
140 | * Here, | |
141 | * 1 << ((~fn_bit ^ BITOP_BE32_SWIZZLE) & 0x1f) | |
142 | * is optimized version of | |
143 | * htonl(1 << ((~fn_bit)&0x1F)) | |
144 | * See include/asm-generic/bitops/le.h. | |
145 | */ | |
0eae88f3 ED |
146 | return (__force __be32)(1 << ((~fn_bit ^ BITOP_BE32_SWIZZLE) & 0x1f)) & |
147 | addr[fn_bit >> 5]; | |
1da177e4 LT |
148 | } |
149 | ||
1da177e4 LT |
150 | static __inline__ struct fib6_node * node_alloc(void) |
151 | { | |
152 | struct fib6_node *fn; | |
153 | ||
c3762229 | 154 | fn = kmem_cache_zalloc(fib6_node_kmem, GFP_ATOMIC); |
1da177e4 LT |
155 | |
156 | return fn; | |
157 | } | |
158 | ||
159 | static __inline__ void node_free(struct fib6_node * fn) | |
160 | { | |
161 | kmem_cache_free(fib6_node_kmem, fn); | |
162 | } | |
163 | ||
164 | static __inline__ void rt6_release(struct rt6_info *rt) | |
165 | { | |
166 | if (atomic_dec_and_test(&rt->rt6i_ref)) | |
d8d1f30b | 167 | dst_free(&rt->dst); |
1da177e4 LT |
168 | } |
169 | ||
58f09b78 | 170 | static void fib6_link_table(struct net *net, struct fib6_table *tb) |
1b43af54 PM |
171 | { |
172 | unsigned int h; | |
173 | ||
375216ad TG |
174 | /* |
175 | * Initialize table lock at a single place to give lockdep a key, | |
176 | * tables aren't visible prior to being linked to the list. | |
177 | */ | |
178 | rwlock_init(&tb->tb6_lock); | |
179 | ||
a33bc5c1 | 180 | h = tb->tb6_id & (FIB6_TABLE_HASHSZ - 1); |
1b43af54 PM |
181 | |
182 | /* | |
183 | * No protection necessary, this is the only list mutatation | |
184 | * operation, tables never disappear once they exist. | |
185 | */ | |
58f09b78 | 186 | hlist_add_head_rcu(&tb->tb6_hlist, &net->ipv6.fib_table_hash[h]); |
1b43af54 | 187 | } |
c71099ac | 188 | |
1b43af54 | 189 | #ifdef CONFIG_IPV6_MULTIPLE_TABLES |
e0b85590 | 190 | |
8ed67789 | 191 | static struct fib6_table *fib6_alloc_table(struct net *net, u32 id) |
c71099ac TG |
192 | { |
193 | struct fib6_table *table; | |
194 | ||
195 | table = kzalloc(sizeof(*table), GFP_ATOMIC); | |
507c9b1e | 196 | if (table) { |
c71099ac | 197 | table->tb6_id = id; |
8ed67789 | 198 | table->tb6_root.leaf = net->ipv6.ip6_null_entry; |
c71099ac | 199 | table->tb6_root.fn_flags = RTN_ROOT | RTN_TL_ROOT | RTN_RTINFO; |
8e773277 | 200 | inet_peer_base_init(&table->tb6_peers); |
c71099ac TG |
201 | } |
202 | ||
203 | return table; | |
204 | } | |
205 | ||
58f09b78 | 206 | struct fib6_table *fib6_new_table(struct net *net, u32 id) |
c71099ac TG |
207 | { |
208 | struct fib6_table *tb; | |
209 | ||
210 | if (id == 0) | |
211 | id = RT6_TABLE_MAIN; | |
58f09b78 | 212 | tb = fib6_get_table(net, id); |
c71099ac TG |
213 | if (tb) |
214 | return tb; | |
215 | ||
8ed67789 | 216 | tb = fib6_alloc_table(net, id); |
507c9b1e | 217 | if (tb) |
58f09b78 | 218 | fib6_link_table(net, tb); |
c71099ac TG |
219 | |
220 | return tb; | |
221 | } | |
222 | ||
58f09b78 | 223 | struct fib6_table *fib6_get_table(struct net *net, u32 id) |
c71099ac TG |
224 | { |
225 | struct fib6_table *tb; | |
58f09b78 | 226 | struct hlist_head *head; |
c71099ac TG |
227 | unsigned int h; |
228 | ||
229 | if (id == 0) | |
230 | id = RT6_TABLE_MAIN; | |
a33bc5c1 | 231 | h = id & (FIB6_TABLE_HASHSZ - 1); |
c71099ac | 232 | rcu_read_lock(); |
58f09b78 | 233 | head = &net->ipv6.fib_table_hash[h]; |
b67bfe0d | 234 | hlist_for_each_entry_rcu(tb, head, tb6_hlist) { |
c71099ac TG |
235 | if (tb->tb6_id == id) { |
236 | rcu_read_unlock(); | |
237 | return tb; | |
238 | } | |
239 | } | |
240 | rcu_read_unlock(); | |
241 | ||
242 | return NULL; | |
243 | } | |
244 | ||
2c8c1e72 | 245 | static void __net_init fib6_tables_init(struct net *net) |
c71099ac | 246 | { |
58f09b78 DL |
247 | fib6_link_table(net, net->ipv6.fib6_main_tbl); |
248 | fib6_link_table(net, net->ipv6.fib6_local_tbl); | |
c71099ac | 249 | } |
c71099ac TG |
250 | #else |
251 | ||
58f09b78 | 252 | struct fib6_table *fib6_new_table(struct net *net, u32 id) |
c71099ac | 253 | { |
58f09b78 | 254 | return fib6_get_table(net, id); |
c71099ac TG |
255 | } |
256 | ||
58f09b78 | 257 | struct fib6_table *fib6_get_table(struct net *net, u32 id) |
c71099ac | 258 | { |
58f09b78 | 259 | return net->ipv6.fib6_main_tbl; |
c71099ac TG |
260 | } |
261 | ||
4c9483b2 | 262 | struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi6 *fl6, |
58f09b78 | 263 | int flags, pol_lookup_t lookup) |
c71099ac | 264 | { |
4c9483b2 | 265 | return (struct dst_entry *) lookup(net, net->ipv6.fib6_main_tbl, fl6, flags); |
c71099ac TG |
266 | } |
267 | ||
2c8c1e72 | 268 | static void __net_init fib6_tables_init(struct net *net) |
c71099ac | 269 | { |
58f09b78 | 270 | fib6_link_table(net, net->ipv6.fib6_main_tbl); |
c71099ac TG |
271 | } |
272 | ||
273 | #endif | |
274 | ||
1b43af54 PM |
275 | static int fib6_dump_node(struct fib6_walker_t *w) |
276 | { | |
277 | int res; | |
278 | struct rt6_info *rt; | |
279 | ||
d8d1f30b | 280 | for (rt = w->leaf; rt; rt = rt->dst.rt6_next) { |
1b43af54 PM |
281 | res = rt6_dump_route(rt, w->args); |
282 | if (res < 0) { | |
283 | /* Frame is full, suspend walking */ | |
284 | w->leaf = rt; | |
285 | return 1; | |
286 | } | |
547b792c | 287 | WARN_ON(res == 0); |
1b43af54 PM |
288 | } |
289 | w->leaf = NULL; | |
290 | return 0; | |
291 | } | |
292 | ||
293 | static void fib6_dump_end(struct netlink_callback *cb) | |
294 | { | |
295 | struct fib6_walker_t *w = (void*)cb->args[2]; | |
296 | ||
297 | if (w) { | |
7891cc81 HX |
298 | if (cb->args[4]) { |
299 | cb->args[4] = 0; | |
300 | fib6_walker_unlink(w); | |
301 | } | |
1b43af54 PM |
302 | cb->args[2] = 0; |
303 | kfree(w); | |
304 | } | |
305 | cb->done = (void*)cb->args[3]; | |
306 | cb->args[1] = 3; | |
307 | } | |
308 | ||
309 | static int fib6_dump_done(struct netlink_callback *cb) | |
310 | { | |
311 | fib6_dump_end(cb); | |
312 | return cb->done ? cb->done(cb) : 0; | |
313 | } | |
314 | ||
315 | static int fib6_dump_table(struct fib6_table *table, struct sk_buff *skb, | |
316 | struct netlink_callback *cb) | |
317 | { | |
318 | struct fib6_walker_t *w; | |
319 | int res; | |
320 | ||
321 | w = (void *)cb->args[2]; | |
322 | w->root = &table->tb6_root; | |
323 | ||
324 | if (cb->args[4] == 0) { | |
2bec5a36 PM |
325 | w->count = 0; |
326 | w->skip = 0; | |
327 | ||
1b43af54 PM |
328 | read_lock_bh(&table->tb6_lock); |
329 | res = fib6_walk(w); | |
330 | read_unlock_bh(&table->tb6_lock); | |
2bec5a36 | 331 | if (res > 0) { |
1b43af54 | 332 | cb->args[4] = 1; |
2bec5a36 PM |
333 | cb->args[5] = w->root->fn_sernum; |
334 | } | |
1b43af54 | 335 | } else { |
2bec5a36 PM |
336 | if (cb->args[5] != w->root->fn_sernum) { |
337 | /* Begin at the root if the tree changed */ | |
338 | cb->args[5] = w->root->fn_sernum; | |
339 | w->state = FWS_INIT; | |
340 | w->node = w->root; | |
341 | w->skip = w->count; | |
342 | } else | |
343 | w->skip = 0; | |
344 | ||
1b43af54 PM |
345 | read_lock_bh(&table->tb6_lock); |
346 | res = fib6_walk_continue(w); | |
347 | read_unlock_bh(&table->tb6_lock); | |
7891cc81 HX |
348 | if (res <= 0) { |
349 | fib6_walker_unlink(w); | |
350 | cb->args[4] = 0; | |
1b43af54 | 351 | } |
1b43af54 | 352 | } |
7891cc81 | 353 | |
1b43af54 PM |
354 | return res; |
355 | } | |
356 | ||
c127ea2c | 357 | static int inet6_dump_fib(struct sk_buff *skb, struct netlink_callback *cb) |
1b43af54 | 358 | { |
3b1e0a65 | 359 | struct net *net = sock_net(skb->sk); |
1b43af54 PM |
360 | unsigned int h, s_h; |
361 | unsigned int e = 0, s_e; | |
362 | struct rt6_rtnl_dump_arg arg; | |
363 | struct fib6_walker_t *w; | |
364 | struct fib6_table *tb; | |
58f09b78 | 365 | struct hlist_head *head; |
1b43af54 PM |
366 | int res = 0; |
367 | ||
368 | s_h = cb->args[0]; | |
369 | s_e = cb->args[1]; | |
370 | ||
371 | w = (void *)cb->args[2]; | |
507c9b1e | 372 | if (!w) { |
1b43af54 PM |
373 | /* New dump: |
374 | * | |
375 | * 1. hook callback destructor. | |
376 | */ | |
377 | cb->args[3] = (long)cb->done; | |
378 | cb->done = fib6_dump_done; | |
379 | ||
380 | /* | |
381 | * 2. allocate and initialize walker. | |
382 | */ | |
383 | w = kzalloc(sizeof(*w), GFP_ATOMIC); | |
507c9b1e | 384 | if (!w) |
1b43af54 PM |
385 | return -ENOMEM; |
386 | w->func = fib6_dump_node; | |
387 | cb->args[2] = (long)w; | |
388 | } | |
389 | ||
390 | arg.skb = skb; | |
391 | arg.cb = cb; | |
191cd582 | 392 | arg.net = net; |
1b43af54 PM |
393 | w->args = &arg; |
394 | ||
e67f88dd | 395 | rcu_read_lock(); |
a33bc5c1 | 396 | for (h = s_h; h < FIB6_TABLE_HASHSZ; h++, s_e = 0) { |
1b43af54 | 397 | e = 0; |
58f09b78 | 398 | head = &net->ipv6.fib_table_hash[h]; |
b67bfe0d | 399 | hlist_for_each_entry_rcu(tb, head, tb6_hlist) { |
1b43af54 PM |
400 | if (e < s_e) |
401 | goto next; | |
402 | res = fib6_dump_table(tb, skb, cb); | |
403 | if (res != 0) | |
404 | goto out; | |
405 | next: | |
406 | e++; | |
407 | } | |
408 | } | |
409 | out: | |
e67f88dd | 410 | rcu_read_unlock(); |
1b43af54 PM |
411 | cb->args[1] = e; |
412 | cb->args[0] = h; | |
413 | ||
414 | res = res < 0 ? res : skb->len; | |
415 | if (res <= 0) | |
416 | fib6_dump_end(cb); | |
417 | return res; | |
418 | } | |
1da177e4 LT |
419 | |
420 | /* | |
421 | * Routing Table | |
422 | * | |
423 | * return the appropriate node for a routing tree "add" operation | |
424 | * by either creating and inserting or by returning an existing | |
425 | * node. | |
426 | */ | |
427 | ||
428 | static struct fib6_node * fib6_add_1(struct fib6_node *root, void *addr, | |
429 | int addrlen, int plen, | |
4a287eba MV |
430 | int offset, int allow_create, |
431 | int replace_required) | |
1da177e4 LT |
432 | { |
433 | struct fib6_node *fn, *in, *ln; | |
434 | struct fib6_node *pn = NULL; | |
435 | struct rt6key *key; | |
436 | int bit; | |
1ab1457c | 437 | __be32 dir = 0; |
1da177e4 LT |
438 | __u32 sernum = fib6_new_sernum(); |
439 | ||
440 | RT6_TRACE("fib6_add_1\n"); | |
441 | ||
442 | /* insert node in tree */ | |
443 | ||
444 | fn = root; | |
445 | ||
446 | do { | |
447 | key = (struct rt6key *)((u8 *)fn->leaf + offset); | |
448 | ||
449 | /* | |
450 | * Prefix match | |
451 | */ | |
452 | if (plen < fn->fn_bit || | |
4a287eba | 453 | !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) { |
14df015b MV |
454 | if (!allow_create) { |
455 | if (replace_required) { | |
f3213831 | 456 | pr_warn("Can't replace route, no match found\n"); |
14df015b MV |
457 | return ERR_PTR(-ENOENT); |
458 | } | |
f3213831 | 459 | pr_warn("NLM_F_CREATE should be set when creating new route\n"); |
14df015b | 460 | } |
1da177e4 | 461 | goto insert_above; |
4a287eba | 462 | } |
1ab1457c | 463 | |
1da177e4 LT |
464 | /* |
465 | * Exact match ? | |
466 | */ | |
1ab1457c | 467 | |
1da177e4 LT |
468 | if (plen == fn->fn_bit) { |
469 | /* clean up an intermediate node */ | |
507c9b1e | 470 | if (!(fn->fn_flags & RTN_RTINFO)) { |
1da177e4 LT |
471 | rt6_release(fn->leaf); |
472 | fn->leaf = NULL; | |
473 | } | |
1ab1457c | 474 | |
1da177e4 | 475 | fn->fn_sernum = sernum; |
1ab1457c | 476 | |
1da177e4 LT |
477 | return fn; |
478 | } | |
479 | ||
480 | /* | |
481 | * We have more bits to go | |
482 | */ | |
1ab1457c | 483 | |
1da177e4 LT |
484 | /* Try to walk down on tree. */ |
485 | fn->fn_sernum = sernum; | |
486 | dir = addr_bit_set(addr, fn->fn_bit); | |
487 | pn = fn; | |
488 | fn = dir ? fn->right: fn->left; | |
489 | } while (fn); | |
490 | ||
14df015b | 491 | if (!allow_create) { |
4a287eba MV |
492 | /* We should not create new node because |
493 | * NLM_F_REPLACE was specified without NLM_F_CREATE | |
494 | * I assume it is safe to require NLM_F_CREATE when | |
495 | * REPLACE flag is used! Later we may want to remove the | |
496 | * check for replace_required, because according | |
497 | * to netlink specification, NLM_F_CREATE | |
498 | * MUST be specified if new route is created. | |
499 | * That would keep IPv6 consistent with IPv4 | |
500 | */ | |
14df015b | 501 | if (replace_required) { |
f3213831 | 502 | pr_warn("Can't replace route, no match found\n"); |
14df015b MV |
503 | return ERR_PTR(-ENOENT); |
504 | } | |
f3213831 | 505 | pr_warn("NLM_F_CREATE should be set when creating new route\n"); |
4a287eba | 506 | } |
1da177e4 LT |
507 | /* |
508 | * We walked to the bottom of tree. | |
509 | * Create new leaf node without children. | |
510 | */ | |
511 | ||
512 | ln = node_alloc(); | |
513 | ||
507c9b1e | 514 | if (!ln) |
188c517a | 515 | return ERR_PTR(-ENOMEM); |
1da177e4 | 516 | ln->fn_bit = plen; |
1ab1457c | 517 | |
1da177e4 LT |
518 | ln->parent = pn; |
519 | ln->fn_sernum = sernum; | |
520 | ||
521 | if (dir) | |
522 | pn->right = ln; | |
523 | else | |
524 | pn->left = ln; | |
525 | ||
526 | return ln; | |
527 | ||
528 | ||
529 | insert_above: | |
530 | /* | |
1ab1457c | 531 | * split since we don't have a common prefix anymore or |
1da177e4 LT |
532 | * we have a less significant route. |
533 | * we've to insert an intermediate node on the list | |
534 | * this new node will point to the one we need to create | |
535 | * and the current | |
536 | */ | |
537 | ||
538 | pn = fn->parent; | |
539 | ||
540 | /* find 1st bit in difference between the 2 addrs. | |
541 | ||
971f359d | 542 | See comment in __ipv6_addr_diff: bit may be an invalid value, |
1da177e4 LT |
543 | but if it is >= plen, the value is ignored in any case. |
544 | */ | |
1ab1457c | 545 | |
971f359d | 546 | bit = __ipv6_addr_diff(addr, &key->addr, addrlen); |
1da177e4 | 547 | |
1ab1457c YH |
548 | /* |
549 | * (intermediate)[in] | |
1da177e4 LT |
550 | * / \ |
551 | * (new leaf node)[ln] (old node)[fn] | |
552 | */ | |
553 | if (plen > bit) { | |
554 | in = node_alloc(); | |
555 | ln = node_alloc(); | |
1ab1457c | 556 | |
507c9b1e | 557 | if (!in || !ln) { |
1da177e4 LT |
558 | if (in) |
559 | node_free(in); | |
560 | if (ln) | |
561 | node_free(ln); | |
188c517a | 562 | return ERR_PTR(-ENOMEM); |
1da177e4 LT |
563 | } |
564 | ||
1ab1457c YH |
565 | /* |
566 | * new intermediate node. | |
1da177e4 LT |
567 | * RTN_RTINFO will |
568 | * be off since that an address that chooses one of | |
569 | * the branches would not match less specific routes | |
570 | * in the other branch | |
571 | */ | |
572 | ||
573 | in->fn_bit = bit; | |
574 | ||
575 | in->parent = pn; | |
576 | in->leaf = fn->leaf; | |
577 | atomic_inc(&in->leaf->rt6i_ref); | |
578 | ||
579 | in->fn_sernum = sernum; | |
580 | ||
581 | /* update parent pointer */ | |
582 | if (dir) | |
583 | pn->right = in; | |
584 | else | |
585 | pn->left = in; | |
586 | ||
587 | ln->fn_bit = plen; | |
588 | ||
589 | ln->parent = in; | |
590 | fn->parent = in; | |
591 | ||
592 | ln->fn_sernum = sernum; | |
593 | ||
594 | if (addr_bit_set(addr, bit)) { | |
595 | in->right = ln; | |
596 | in->left = fn; | |
597 | } else { | |
598 | in->left = ln; | |
599 | in->right = fn; | |
600 | } | |
601 | } else { /* plen <= bit */ | |
602 | ||
1ab1457c | 603 | /* |
1da177e4 LT |
604 | * (new leaf node)[ln] |
605 | * / \ | |
606 | * (old node)[fn] NULL | |
607 | */ | |
608 | ||
609 | ln = node_alloc(); | |
610 | ||
507c9b1e | 611 | if (!ln) |
188c517a | 612 | return ERR_PTR(-ENOMEM); |
1da177e4 LT |
613 | |
614 | ln->fn_bit = plen; | |
615 | ||
616 | ln->parent = pn; | |
617 | ||
618 | ln->fn_sernum = sernum; | |
1ab1457c | 619 | |
1da177e4 LT |
620 | if (dir) |
621 | pn->right = ln; | |
622 | else | |
623 | pn->left = ln; | |
624 | ||
625 | if (addr_bit_set(&key->addr, plen)) | |
626 | ln->right = fn; | |
627 | else | |
628 | ln->left = fn; | |
629 | ||
630 | fn->parent = ln; | |
631 | } | |
632 | return ln; | |
633 | } | |
634 | ||
635 | /* | |
636 | * Insert routing information in a node. | |
637 | */ | |
638 | ||
639 | static int fib6_add_rt2node(struct fib6_node *fn, struct rt6_info *rt, | |
86872cb5 | 640 | struct nl_info *info) |
1da177e4 LT |
641 | { |
642 | struct rt6_info *iter = NULL; | |
643 | struct rt6_info **ins; | |
507c9b1e DM |
644 | int replace = (info->nlh && |
645 | (info->nlh->nlmsg_flags & NLM_F_REPLACE)); | |
646 | int add = (!info->nlh || | |
647 | (info->nlh->nlmsg_flags & NLM_F_CREATE)); | |
4a287eba | 648 | int found = 0; |
1da177e4 LT |
649 | |
650 | ins = &fn->leaf; | |
651 | ||
507c9b1e | 652 | for (iter = fn->leaf; iter; iter = iter->dst.rt6_next) { |
1da177e4 LT |
653 | /* |
654 | * Search for duplicates | |
655 | */ | |
656 | ||
657 | if (iter->rt6i_metric == rt->rt6i_metric) { | |
658 | /* | |
659 | * Same priority level | |
660 | */ | |
507c9b1e DM |
661 | if (info->nlh && |
662 | (info->nlh->nlmsg_flags & NLM_F_EXCL)) | |
4a287eba MV |
663 | return -EEXIST; |
664 | if (replace) { | |
665 | found++; | |
666 | break; | |
667 | } | |
1da177e4 | 668 | |
d1918542 | 669 | if (iter->dst.dev == rt->dst.dev && |
1da177e4 LT |
670 | iter->rt6i_idev == rt->rt6i_idev && |
671 | ipv6_addr_equal(&iter->rt6i_gateway, | |
672 | &rt->rt6i_gateway)) { | |
51ebd318 ND |
673 | if (rt->rt6i_nsiblings) |
674 | rt->rt6i_nsiblings = 0; | |
507c9b1e | 675 | if (!(iter->rt6i_flags & RTF_EXPIRES)) |
1da177e4 | 676 | return -EEXIST; |
1716a961 G |
677 | if (!(rt->rt6i_flags & RTF_EXPIRES)) |
678 | rt6_clean_expires(iter); | |
679 | else | |
680 | rt6_set_expires(iter, rt->dst.expires); | |
1da177e4 LT |
681 | return -EEXIST; |
682 | } | |
51ebd318 ND |
683 | /* If we have the same destination and the same metric, |
684 | * but not the same gateway, then the route we try to | |
685 | * add is sibling to this route, increment our counter | |
686 | * of siblings, and later we will add our route to the | |
687 | * list. | |
688 | * Only static routes (which don't have flag | |
689 | * RTF_EXPIRES) are used for ECMPv6. | |
690 | * | |
691 | * To avoid long list, we only had siblings if the | |
692 | * route have a gateway. | |
693 | */ | |
694 | if (rt->rt6i_flags & RTF_GATEWAY && | |
695 | !(rt->rt6i_flags & RTF_EXPIRES) && | |
696 | !(iter->rt6i_flags & RTF_EXPIRES)) | |
697 | rt->rt6i_nsiblings++; | |
1da177e4 LT |
698 | } |
699 | ||
700 | if (iter->rt6i_metric > rt->rt6i_metric) | |
701 | break; | |
702 | ||
d8d1f30b | 703 | ins = &iter->dst.rt6_next; |
1da177e4 LT |
704 | } |
705 | ||
f11e6659 DM |
706 | /* Reset round-robin state, if necessary */ |
707 | if (ins == &fn->leaf) | |
708 | fn->rr_ptr = NULL; | |
709 | ||
51ebd318 ND |
710 | /* Link this route to others same route. */ |
711 | if (rt->rt6i_nsiblings) { | |
712 | unsigned int rt6i_nsiblings; | |
713 | struct rt6_info *sibling, *temp_sibling; | |
714 | ||
715 | /* Find the first route that have the same metric */ | |
716 | sibling = fn->leaf; | |
717 | while (sibling) { | |
718 | if (sibling->rt6i_metric == rt->rt6i_metric) { | |
719 | list_add_tail(&rt->rt6i_siblings, | |
720 | &sibling->rt6i_siblings); | |
721 | break; | |
722 | } | |
723 | sibling = sibling->dst.rt6_next; | |
724 | } | |
725 | /* For each sibling in the list, increment the counter of | |
726 | * siblings. BUG() if counters does not match, list of siblings | |
727 | * is broken! | |
728 | */ | |
729 | rt6i_nsiblings = 0; | |
730 | list_for_each_entry_safe(sibling, temp_sibling, | |
731 | &rt->rt6i_siblings, rt6i_siblings) { | |
732 | sibling->rt6i_nsiblings++; | |
733 | BUG_ON(sibling->rt6i_nsiblings != rt->rt6i_nsiblings); | |
734 | rt6i_nsiblings++; | |
735 | } | |
736 | BUG_ON(rt6i_nsiblings != rt->rt6i_nsiblings); | |
737 | } | |
738 | ||
1da177e4 LT |
739 | /* |
740 | * insert node | |
741 | */ | |
4a287eba MV |
742 | if (!replace) { |
743 | if (!add) | |
f3213831 | 744 | pr_warn("NLM_F_CREATE should be set when creating new route\n"); |
4a287eba MV |
745 | |
746 | add: | |
747 | rt->dst.rt6_next = iter; | |
748 | *ins = rt; | |
749 | rt->rt6i_node = fn; | |
750 | atomic_inc(&rt->rt6i_ref); | |
751 | inet6_rt_notify(RTM_NEWROUTE, rt, info); | |
752 | info->nl_net->ipv6.rt6_stats->fib_rt_entries++; | |
753 | ||
507c9b1e | 754 | if (!(fn->fn_flags & RTN_RTINFO)) { |
4a287eba MV |
755 | info->nl_net->ipv6.rt6_stats->fib_route_nodes++; |
756 | fn->fn_flags |= RTN_RTINFO; | |
757 | } | |
1da177e4 | 758 | |
4a287eba MV |
759 | } else { |
760 | if (!found) { | |
761 | if (add) | |
762 | goto add; | |
f3213831 | 763 | pr_warn("NLM_F_REPLACE set, but no existing node found!\n"); |
4a287eba MV |
764 | return -ENOENT; |
765 | } | |
766 | *ins = rt; | |
767 | rt->rt6i_node = fn; | |
768 | rt->dst.rt6_next = iter->dst.rt6_next; | |
769 | atomic_inc(&rt->rt6i_ref); | |
770 | inet6_rt_notify(RTM_NEWROUTE, rt, info); | |
771 | rt6_release(iter); | |
507c9b1e | 772 | if (!(fn->fn_flags & RTN_RTINFO)) { |
4a287eba MV |
773 | info->nl_net->ipv6.rt6_stats->fib_route_nodes++; |
774 | fn->fn_flags |= RTN_RTINFO; | |
775 | } | |
1da177e4 LT |
776 | } |
777 | ||
778 | return 0; | |
779 | } | |
780 | ||
63152fc0 | 781 | static __inline__ void fib6_start_gc(struct net *net, struct rt6_info *rt) |
1da177e4 | 782 | { |
417f28bb | 783 | if (!timer_pending(&net->ipv6.ip6_fib_timer) && |
507c9b1e | 784 | (rt->rt6i_flags & (RTF_EXPIRES | RTF_CACHE))) |
417f28bb | 785 | mod_timer(&net->ipv6.ip6_fib_timer, |
847499ce | 786 | jiffies + net->ipv6.sysctl.ip6_rt_gc_interval); |
1da177e4 LT |
787 | } |
788 | ||
63152fc0 | 789 | void fib6_force_start_gc(struct net *net) |
1da177e4 | 790 | { |
417f28bb SH |
791 | if (!timer_pending(&net->ipv6.ip6_fib_timer)) |
792 | mod_timer(&net->ipv6.ip6_fib_timer, | |
847499ce | 793 | jiffies + net->ipv6.sysctl.ip6_rt_gc_interval); |
1da177e4 LT |
794 | } |
795 | ||
796 | /* | |
797 | * Add routing information to the routing tree. | |
798 | * <destination addr>/<source addr> | |
799 | * with source addr info in sub-trees | |
800 | */ | |
801 | ||
86872cb5 | 802 | int fib6_add(struct fib6_node *root, struct rt6_info *rt, struct nl_info *info) |
1da177e4 | 803 | { |
66729e18 | 804 | struct fib6_node *fn, *pn = NULL; |
1da177e4 | 805 | int err = -ENOMEM; |
4a287eba MV |
806 | int allow_create = 1; |
807 | int replace_required = 0; | |
507c9b1e DM |
808 | |
809 | if (info->nlh) { | |
810 | if (!(info->nlh->nlmsg_flags & NLM_F_CREATE)) | |
4a287eba | 811 | allow_create = 0; |
507c9b1e | 812 | if (info->nlh->nlmsg_flags & NLM_F_REPLACE) |
4a287eba MV |
813 | replace_required = 1; |
814 | } | |
815 | if (!allow_create && !replace_required) | |
f3213831 | 816 | pr_warn("RTM_NEWROUTE with no NLM_F_CREATE or NLM_F_REPLACE\n"); |
1da177e4 LT |
817 | |
818 | fn = fib6_add_1(root, &rt->rt6i_dst.addr, sizeof(struct in6_addr), | |
507c9b1e DM |
819 | rt->rt6i_dst.plen, offsetof(struct rt6_info, rt6i_dst), |
820 | allow_create, replace_required); | |
4a287eba MV |
821 | |
822 | if (IS_ERR(fn)) { | |
823 | err = PTR_ERR(fn); | |
1da177e4 | 824 | goto out; |
188c517a | 825 | } |
1da177e4 | 826 | |
66729e18 YH |
827 | pn = fn; |
828 | ||
1da177e4 LT |
829 | #ifdef CONFIG_IPV6_SUBTREES |
830 | if (rt->rt6i_src.plen) { | |
831 | struct fib6_node *sn; | |
832 | ||
507c9b1e | 833 | if (!fn->subtree) { |
1da177e4 LT |
834 | struct fib6_node *sfn; |
835 | ||
836 | /* | |
837 | * Create subtree. | |
838 | * | |
839 | * fn[main tree] | |
840 | * | | |
841 | * sfn[subtree root] | |
842 | * \ | |
843 | * sn[new leaf node] | |
844 | */ | |
845 | ||
846 | /* Create subtree root node */ | |
847 | sfn = node_alloc(); | |
507c9b1e | 848 | if (!sfn) |
1da177e4 LT |
849 | goto st_failure; |
850 | ||
8ed67789 DL |
851 | sfn->leaf = info->nl_net->ipv6.ip6_null_entry; |
852 | atomic_inc(&info->nl_net->ipv6.ip6_null_entry->rt6i_ref); | |
1da177e4 LT |
853 | sfn->fn_flags = RTN_ROOT; |
854 | sfn->fn_sernum = fib6_new_sernum(); | |
855 | ||
856 | /* Now add the first leaf node to new subtree */ | |
857 | ||
858 | sn = fib6_add_1(sfn, &rt->rt6i_src.addr, | |
859 | sizeof(struct in6_addr), rt->rt6i_src.plen, | |
4a287eba MV |
860 | offsetof(struct rt6_info, rt6i_src), |
861 | allow_create, replace_required); | |
1da177e4 | 862 | |
f950c0ec | 863 | if (IS_ERR(sn)) { |
1da177e4 LT |
864 | /* If it is failed, discard just allocated |
865 | root, and then (in st_failure) stale node | |
866 | in main tree. | |
867 | */ | |
868 | node_free(sfn); | |
188c517a | 869 | err = PTR_ERR(sn); |
1da177e4 LT |
870 | goto st_failure; |
871 | } | |
872 | ||
873 | /* Now link new subtree to main tree */ | |
874 | sfn->parent = fn; | |
875 | fn->subtree = sfn; | |
1da177e4 LT |
876 | } else { |
877 | sn = fib6_add_1(fn->subtree, &rt->rt6i_src.addr, | |
878 | sizeof(struct in6_addr), rt->rt6i_src.plen, | |
4a287eba MV |
879 | offsetof(struct rt6_info, rt6i_src), |
880 | allow_create, replace_required); | |
1da177e4 | 881 | |
4a287eba MV |
882 | if (IS_ERR(sn)) { |
883 | err = PTR_ERR(sn); | |
1da177e4 | 884 | goto st_failure; |
188c517a | 885 | } |
1da177e4 LT |
886 | } |
887 | ||
507c9b1e | 888 | if (!fn->leaf) { |
66729e18 YH |
889 | fn->leaf = rt; |
890 | atomic_inc(&rt->rt6i_ref); | |
891 | } | |
1da177e4 LT |
892 | fn = sn; |
893 | } | |
894 | #endif | |
895 | ||
86872cb5 | 896 | err = fib6_add_rt2node(fn, rt, info); |
507c9b1e | 897 | if (!err) { |
63152fc0 | 898 | fib6_start_gc(info->nl_net, rt); |
507c9b1e | 899 | if (!(rt->rt6i_flags & RTF_CACHE)) |
ec7d43c2 | 900 | fib6_prune_clones(info->nl_net, pn, rt); |
1da177e4 LT |
901 | } |
902 | ||
903 | out: | |
66729e18 YH |
904 | if (err) { |
905 | #ifdef CONFIG_IPV6_SUBTREES | |
906 | /* | |
907 | * If fib6_add_1 has cleared the old leaf pointer in the | |
908 | * super-tree leaf node we have to find a new one for it. | |
909 | */ | |
3c051235 DM |
910 | if (pn != fn && pn->leaf == rt) { |
911 | pn->leaf = NULL; | |
912 | atomic_dec(&rt->rt6i_ref); | |
913 | } | |
66729e18 | 914 | if (pn != fn && !pn->leaf && !(pn->fn_flags & RTN_RTINFO)) { |
8ed67789 | 915 | pn->leaf = fib6_find_prefix(info->nl_net, pn); |
66729e18 YH |
916 | #if RT6_DEBUG >= 2 |
917 | if (!pn->leaf) { | |
547b792c | 918 | WARN_ON(pn->leaf == NULL); |
8ed67789 | 919 | pn->leaf = info->nl_net->ipv6.ip6_null_entry; |
66729e18 YH |
920 | } |
921 | #endif | |
922 | atomic_inc(&pn->leaf->rt6i_ref); | |
923 | } | |
924 | #endif | |
d8d1f30b | 925 | dst_free(&rt->dst); |
66729e18 | 926 | } |
1da177e4 LT |
927 | return err; |
928 | ||
929 | #ifdef CONFIG_IPV6_SUBTREES | |
930 | /* Subtree creation failed, probably main tree node | |
931 | is orphan. If it is, shoot it. | |
932 | */ | |
933 | st_failure: | |
934 | if (fn && !(fn->fn_flags & (RTN_RTINFO|RTN_ROOT))) | |
8ed67789 | 935 | fib6_repair_tree(info->nl_net, fn); |
d8d1f30b | 936 | dst_free(&rt->dst); |
1da177e4 LT |
937 | return err; |
938 | #endif | |
939 | } | |
940 | ||
941 | /* | |
942 | * Routing tree lookup | |
943 | * | |
944 | */ | |
945 | ||
946 | struct lookup_args { | |
507c9b1e | 947 | int offset; /* key offset on rt6_info */ |
b71d1d42 | 948 | const struct in6_addr *addr; /* search key */ |
1da177e4 LT |
949 | }; |
950 | ||
951 | static struct fib6_node * fib6_lookup_1(struct fib6_node *root, | |
952 | struct lookup_args *args) | |
953 | { | |
954 | struct fib6_node *fn; | |
e69a4adc | 955 | __be32 dir; |
1da177e4 | 956 | |
825e288e YH |
957 | if (unlikely(args->offset == 0)) |
958 | return NULL; | |
959 | ||
1da177e4 LT |
960 | /* |
961 | * Descend on a tree | |
962 | */ | |
963 | ||
964 | fn = root; | |
965 | ||
966 | for (;;) { | |
967 | struct fib6_node *next; | |
968 | ||
969 | dir = addr_bit_set(args->addr, fn->fn_bit); | |
970 | ||
971 | next = dir ? fn->right : fn->left; | |
972 | ||
973 | if (next) { | |
974 | fn = next; | |
975 | continue; | |
976 | } | |
1da177e4 LT |
977 | break; |
978 | } | |
979 | ||
507c9b1e | 980 | while (fn) { |
7fc33165 | 981 | if (FIB6_SUBTREE(fn) || fn->fn_flags & RTN_RTINFO) { |
1da177e4 LT |
982 | struct rt6key *key; |
983 | ||
984 | key = (struct rt6key *) ((u8 *) fn->leaf + | |
985 | args->offset); | |
986 | ||
3fc5e044 YH |
987 | if (ipv6_prefix_equal(&key->addr, args->addr, key->plen)) { |
988 | #ifdef CONFIG_IPV6_SUBTREES | |
989 | if (fn->subtree) | |
990 | fn = fib6_lookup_1(fn->subtree, args + 1); | |
991 | #endif | |
992 | if (!fn || fn->fn_flags & RTN_RTINFO) | |
993 | return fn; | |
994 | } | |
1da177e4 LT |
995 | } |
996 | ||
3fc5e044 YH |
997 | if (fn->fn_flags & RTN_ROOT) |
998 | break; | |
999 | ||
1da177e4 LT |
1000 | fn = fn->parent; |
1001 | } | |
1002 | ||
1003 | return NULL; | |
1004 | } | |
1005 | ||
b71d1d42 ED |
1006 | struct fib6_node * fib6_lookup(struct fib6_node *root, const struct in6_addr *daddr, |
1007 | const struct in6_addr *saddr) | |
1da177e4 | 1008 | { |
1da177e4 | 1009 | struct fib6_node *fn; |
825e288e YH |
1010 | struct lookup_args args[] = { |
1011 | { | |
1012 | .offset = offsetof(struct rt6_info, rt6i_dst), | |
1013 | .addr = daddr, | |
1014 | }, | |
1da177e4 | 1015 | #ifdef CONFIG_IPV6_SUBTREES |
825e288e YH |
1016 | { |
1017 | .offset = offsetof(struct rt6_info, rt6i_src), | |
1018 | .addr = saddr, | |
1019 | }, | |
1da177e4 | 1020 | #endif |
825e288e YH |
1021 | { |
1022 | .offset = 0, /* sentinel */ | |
1023 | } | |
1024 | }; | |
1da177e4 | 1025 | |
fefc2a6c | 1026 | fn = fib6_lookup_1(root, daddr ? args : args + 1); |
507c9b1e | 1027 | if (!fn || fn->fn_flags & RTN_TL_ROOT) |
1da177e4 LT |
1028 | fn = root; |
1029 | ||
1030 | return fn; | |
1031 | } | |
1032 | ||
1033 | /* | |
1034 | * Get node with specified destination prefix (and source prefix, | |
1035 | * if subtrees are used) | |
1036 | */ | |
1037 | ||
1038 | ||
1039 | static struct fib6_node * fib6_locate_1(struct fib6_node *root, | |
b71d1d42 | 1040 | const struct in6_addr *addr, |
1da177e4 LT |
1041 | int plen, int offset) |
1042 | { | |
1043 | struct fib6_node *fn; | |
1044 | ||
1045 | for (fn = root; fn ; ) { | |
1046 | struct rt6key *key = (struct rt6key *)((u8 *)fn->leaf + offset); | |
1047 | ||
1048 | /* | |
1049 | * Prefix match | |
1050 | */ | |
1051 | if (plen < fn->fn_bit || | |
1052 | !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) | |
1053 | return NULL; | |
1054 | ||
1055 | if (plen == fn->fn_bit) | |
1056 | return fn; | |
1057 | ||
1058 | /* | |
1059 | * We have more bits to go | |
1060 | */ | |
1061 | if (addr_bit_set(addr, fn->fn_bit)) | |
1062 | fn = fn->right; | |
1063 | else | |
1064 | fn = fn->left; | |
1065 | } | |
1066 | return NULL; | |
1067 | } | |
1068 | ||
1069 | struct fib6_node * fib6_locate(struct fib6_node *root, | |
b71d1d42 ED |
1070 | const struct in6_addr *daddr, int dst_len, |
1071 | const struct in6_addr *saddr, int src_len) | |
1da177e4 LT |
1072 | { |
1073 | struct fib6_node *fn; | |
1074 | ||
1075 | fn = fib6_locate_1(root, daddr, dst_len, | |
1076 | offsetof(struct rt6_info, rt6i_dst)); | |
1077 | ||
1078 | #ifdef CONFIG_IPV6_SUBTREES | |
1079 | if (src_len) { | |
547b792c | 1080 | WARN_ON(saddr == NULL); |
3fc5e044 YH |
1081 | if (fn && fn->subtree) |
1082 | fn = fib6_locate_1(fn->subtree, saddr, src_len, | |
1da177e4 LT |
1083 | offsetof(struct rt6_info, rt6i_src)); |
1084 | } | |
1085 | #endif | |
1086 | ||
507c9b1e | 1087 | if (fn && fn->fn_flags & RTN_RTINFO) |
1da177e4 LT |
1088 | return fn; |
1089 | ||
1090 | return NULL; | |
1091 | } | |
1092 | ||
1093 | ||
1094 | /* | |
1095 | * Deletion | |
1096 | * | |
1097 | */ | |
1098 | ||
8ed67789 | 1099 | static struct rt6_info *fib6_find_prefix(struct net *net, struct fib6_node *fn) |
1da177e4 | 1100 | { |
507c9b1e | 1101 | if (fn->fn_flags & RTN_ROOT) |
8ed67789 | 1102 | return net->ipv6.ip6_null_entry; |
1da177e4 | 1103 | |
507c9b1e DM |
1104 | while (fn) { |
1105 | if (fn->left) | |
1da177e4 | 1106 | return fn->left->leaf; |
507c9b1e | 1107 | if (fn->right) |
1da177e4 LT |
1108 | return fn->right->leaf; |
1109 | ||
7fc33165 | 1110 | fn = FIB6_SUBTREE(fn); |
1da177e4 LT |
1111 | } |
1112 | return NULL; | |
1113 | } | |
1114 | ||
1115 | /* | |
1116 | * Called to trim the tree of intermediate nodes when possible. "fn" | |
1117 | * is the node we want to try and remove. | |
1118 | */ | |
1119 | ||
8ed67789 DL |
1120 | static struct fib6_node *fib6_repair_tree(struct net *net, |
1121 | struct fib6_node *fn) | |
1da177e4 LT |
1122 | { |
1123 | int children; | |
1124 | int nstate; | |
1125 | struct fib6_node *child, *pn; | |
1126 | struct fib6_walker_t *w; | |
1127 | int iter = 0; | |
1128 | ||
1129 | for (;;) { | |
1130 | RT6_TRACE("fixing tree: plen=%d iter=%d\n", fn->fn_bit, iter); | |
1131 | iter++; | |
1132 | ||
547b792c IJ |
1133 | WARN_ON(fn->fn_flags & RTN_RTINFO); |
1134 | WARN_ON(fn->fn_flags & RTN_TL_ROOT); | |
1135 | WARN_ON(fn->leaf != NULL); | |
1da177e4 LT |
1136 | |
1137 | children = 0; | |
1138 | child = NULL; | |
1139 | if (fn->right) child = fn->right, children |= 1; | |
1140 | if (fn->left) child = fn->left, children |= 2; | |
1141 | ||
7fc33165 | 1142 | if (children == 3 || FIB6_SUBTREE(fn) |
1da177e4 LT |
1143 | #ifdef CONFIG_IPV6_SUBTREES |
1144 | /* Subtree root (i.e. fn) may have one child */ | |
507c9b1e | 1145 | || (children && fn->fn_flags & RTN_ROOT) |
1da177e4 LT |
1146 | #endif |
1147 | ) { | |
8ed67789 | 1148 | fn->leaf = fib6_find_prefix(net, fn); |
1da177e4 | 1149 | #if RT6_DEBUG >= 2 |
507c9b1e | 1150 | if (!fn->leaf) { |
547b792c | 1151 | WARN_ON(!fn->leaf); |
8ed67789 | 1152 | fn->leaf = net->ipv6.ip6_null_entry; |
1da177e4 LT |
1153 | } |
1154 | #endif | |
1155 | atomic_inc(&fn->leaf->rt6i_ref); | |
1156 | return fn->parent; | |
1157 | } | |
1158 | ||
1159 | pn = fn->parent; | |
1160 | #ifdef CONFIG_IPV6_SUBTREES | |
7fc33165 | 1161 | if (FIB6_SUBTREE(pn) == fn) { |
547b792c | 1162 | WARN_ON(!(fn->fn_flags & RTN_ROOT)); |
7fc33165 | 1163 | FIB6_SUBTREE(pn) = NULL; |
1da177e4 LT |
1164 | nstate = FWS_L; |
1165 | } else { | |
547b792c | 1166 | WARN_ON(fn->fn_flags & RTN_ROOT); |
1da177e4 LT |
1167 | #endif |
1168 | if (pn->right == fn) pn->right = child; | |
1169 | else if (pn->left == fn) pn->left = child; | |
1170 | #if RT6_DEBUG >= 2 | |
547b792c IJ |
1171 | else |
1172 | WARN_ON(1); | |
1da177e4 LT |
1173 | #endif |
1174 | if (child) | |
1175 | child->parent = pn; | |
1176 | nstate = FWS_R; | |
1177 | #ifdef CONFIG_IPV6_SUBTREES | |
1178 | } | |
1179 | #endif | |
1180 | ||
1181 | read_lock(&fib6_walker_lock); | |
1182 | FOR_WALKERS(w) { | |
507c9b1e | 1183 | if (!child) { |
1da177e4 LT |
1184 | if (w->root == fn) { |
1185 | w->root = w->node = NULL; | |
1186 | RT6_TRACE("W %p adjusted by delroot 1\n", w); | |
1187 | } else if (w->node == fn) { | |
1188 | RT6_TRACE("W %p adjusted by delnode 1, s=%d/%d\n", w, w->state, nstate); | |
1189 | w->node = pn; | |
1190 | w->state = nstate; | |
1191 | } | |
1192 | } else { | |
1193 | if (w->root == fn) { | |
1194 | w->root = child; | |
1195 | RT6_TRACE("W %p adjusted by delroot 2\n", w); | |
1196 | } | |
1197 | if (w->node == fn) { | |
1198 | w->node = child; | |
1199 | if (children&2) { | |
1200 | RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state); | |
1201 | w->state = w->state>=FWS_R ? FWS_U : FWS_INIT; | |
1202 | } else { | |
1203 | RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state); | |
1204 | w->state = w->state>=FWS_C ? FWS_U : FWS_INIT; | |
1205 | } | |
1206 | } | |
1207 | } | |
1208 | } | |
1209 | read_unlock(&fib6_walker_lock); | |
1210 | ||
1211 | node_free(fn); | |
507c9b1e | 1212 | if (pn->fn_flags & RTN_RTINFO || FIB6_SUBTREE(pn)) |
1da177e4 LT |
1213 | return pn; |
1214 | ||
1215 | rt6_release(pn->leaf); | |
1216 | pn->leaf = NULL; | |
1217 | fn = pn; | |
1218 | } | |
1219 | } | |
1220 | ||
1221 | static void fib6_del_route(struct fib6_node *fn, struct rt6_info **rtp, | |
86872cb5 | 1222 | struct nl_info *info) |
1da177e4 LT |
1223 | { |
1224 | struct fib6_walker_t *w; | |
1225 | struct rt6_info *rt = *rtp; | |
c572872f | 1226 | struct net *net = info->nl_net; |
1da177e4 LT |
1227 | |
1228 | RT6_TRACE("fib6_del_route\n"); | |
1229 | ||
1230 | /* Unlink it */ | |
d8d1f30b | 1231 | *rtp = rt->dst.rt6_next; |
1da177e4 | 1232 | rt->rt6i_node = NULL; |
c572872f BT |
1233 | net->ipv6.rt6_stats->fib_rt_entries--; |
1234 | net->ipv6.rt6_stats->fib_discarded_routes++; | |
1da177e4 | 1235 | |
f11e6659 DM |
1236 | /* Reset round-robin state, if necessary */ |
1237 | if (fn->rr_ptr == rt) | |
1238 | fn->rr_ptr = NULL; | |
1239 | ||
51ebd318 ND |
1240 | /* Remove this entry from other siblings */ |
1241 | if (rt->rt6i_nsiblings) { | |
1242 | struct rt6_info *sibling, *next_sibling; | |
1243 | ||
1244 | list_for_each_entry_safe(sibling, next_sibling, | |
1245 | &rt->rt6i_siblings, rt6i_siblings) | |
1246 | sibling->rt6i_nsiblings--; | |
1247 | rt->rt6i_nsiblings = 0; | |
1248 | list_del_init(&rt->rt6i_siblings); | |
1249 | } | |
1250 | ||
1da177e4 LT |
1251 | /* Adjust walkers */ |
1252 | read_lock(&fib6_walker_lock); | |
1253 | FOR_WALKERS(w) { | |
1254 | if (w->state == FWS_C && w->leaf == rt) { | |
1255 | RT6_TRACE("walker %p adjusted by delroute\n", w); | |
d8d1f30b | 1256 | w->leaf = rt->dst.rt6_next; |
507c9b1e | 1257 | if (!w->leaf) |
1da177e4 LT |
1258 | w->state = FWS_U; |
1259 | } | |
1260 | } | |
1261 | read_unlock(&fib6_walker_lock); | |
1262 | ||
d8d1f30b | 1263 | rt->dst.rt6_next = NULL; |
1da177e4 | 1264 | |
1da177e4 | 1265 | /* If it was last route, expunge its radix tree node */ |
507c9b1e | 1266 | if (!fn->leaf) { |
1da177e4 | 1267 | fn->fn_flags &= ~RTN_RTINFO; |
c572872f | 1268 | net->ipv6.rt6_stats->fib_route_nodes--; |
8ed67789 | 1269 | fn = fib6_repair_tree(net, fn); |
1da177e4 LT |
1270 | } |
1271 | ||
1272 | if (atomic_read(&rt->rt6i_ref) != 1) { | |
1273 | /* This route is used as dummy address holder in some split | |
1274 | * nodes. It is not leaked, but it still holds other resources, | |
1275 | * which must be released in time. So, scan ascendant nodes | |
1276 | * and replace dummy references to this route with references | |
1277 | * to still alive ones. | |
1278 | */ | |
1279 | while (fn) { | |
507c9b1e | 1280 | if (!(fn->fn_flags & RTN_RTINFO) && fn->leaf == rt) { |
8ed67789 | 1281 | fn->leaf = fib6_find_prefix(net, fn); |
1da177e4 LT |
1282 | atomic_inc(&fn->leaf->rt6i_ref); |
1283 | rt6_release(rt); | |
1284 | } | |
1285 | fn = fn->parent; | |
1286 | } | |
1287 | /* No more references are possible at this point. */ | |
2df96af0 | 1288 | BUG_ON(atomic_read(&rt->rt6i_ref) != 1); |
1da177e4 LT |
1289 | } |
1290 | ||
86872cb5 | 1291 | inet6_rt_notify(RTM_DELROUTE, rt, info); |
1da177e4 LT |
1292 | rt6_release(rt); |
1293 | } | |
1294 | ||
86872cb5 | 1295 | int fib6_del(struct rt6_info *rt, struct nl_info *info) |
1da177e4 | 1296 | { |
8ed67789 | 1297 | struct net *net = info->nl_net; |
1da177e4 LT |
1298 | struct fib6_node *fn = rt->rt6i_node; |
1299 | struct rt6_info **rtp; | |
1300 | ||
1301 | #if RT6_DEBUG >= 2 | |
d8d1f30b | 1302 | if (rt->dst.obsolete>0) { |
547b792c | 1303 | WARN_ON(fn != NULL); |
1da177e4 LT |
1304 | return -ENOENT; |
1305 | } | |
1306 | #endif | |
507c9b1e | 1307 | if (!fn || rt == net->ipv6.ip6_null_entry) |
1da177e4 LT |
1308 | return -ENOENT; |
1309 | ||
547b792c | 1310 | WARN_ON(!(fn->fn_flags & RTN_RTINFO)); |
1da177e4 | 1311 | |
507c9b1e | 1312 | if (!(rt->rt6i_flags & RTF_CACHE)) { |
150730d5 YH |
1313 | struct fib6_node *pn = fn; |
1314 | #ifdef CONFIG_IPV6_SUBTREES | |
1315 | /* clones of this route might be in another subtree */ | |
1316 | if (rt->rt6i_src.plen) { | |
507c9b1e | 1317 | while (!(pn->fn_flags & RTN_ROOT)) |
150730d5 YH |
1318 | pn = pn->parent; |
1319 | pn = pn->parent; | |
1320 | } | |
1321 | #endif | |
ec7d43c2 | 1322 | fib6_prune_clones(info->nl_net, pn, rt); |
150730d5 | 1323 | } |
1da177e4 LT |
1324 | |
1325 | /* | |
1326 | * Walk the leaf entries looking for ourself | |
1327 | */ | |
1328 | ||
d8d1f30b | 1329 | for (rtp = &fn->leaf; *rtp; rtp = &(*rtp)->dst.rt6_next) { |
1da177e4 | 1330 | if (*rtp == rt) { |
86872cb5 | 1331 | fib6_del_route(fn, rtp, info); |
1da177e4 LT |
1332 | return 0; |
1333 | } | |
1334 | } | |
1335 | return -ENOENT; | |
1336 | } | |
1337 | ||
1338 | /* | |
1339 | * Tree traversal function. | |
1340 | * | |
1341 | * Certainly, it is not interrupt safe. | |
1342 | * However, it is internally reenterable wrt itself and fib6_add/fib6_del. | |
1343 | * It means, that we can modify tree during walking | |
1344 | * and use this function for garbage collection, clone pruning, | |
1ab1457c | 1345 | * cleaning tree when a device goes down etc. etc. |
1da177e4 LT |
1346 | * |
1347 | * It guarantees that every node will be traversed, | |
1348 | * and that it will be traversed only once. | |
1349 | * | |
1350 | * Callback function w->func may return: | |
1351 | * 0 -> continue walking. | |
1352 | * positive value -> walking is suspended (used by tree dumps, | |
1353 | * and probably by gc, if it will be split to several slices) | |
1354 | * negative value -> terminate walking. | |
1355 | * | |
1356 | * The function itself returns: | |
1357 | * 0 -> walk is complete. | |
1358 | * >0 -> walk is incomplete (i.e. suspended) | |
1359 | * <0 -> walk is terminated by an error. | |
1360 | */ | |
1361 | ||
90d41122 | 1362 | static int fib6_walk_continue(struct fib6_walker_t *w) |
1da177e4 LT |
1363 | { |
1364 | struct fib6_node *fn, *pn; | |
1365 | ||
1366 | for (;;) { | |
1367 | fn = w->node; | |
507c9b1e | 1368 | if (!fn) |
1da177e4 LT |
1369 | return 0; |
1370 | ||
1371 | if (w->prune && fn != w->root && | |
507c9b1e | 1372 | fn->fn_flags & RTN_RTINFO && w->state < FWS_C) { |
1da177e4 LT |
1373 | w->state = FWS_C; |
1374 | w->leaf = fn->leaf; | |
1375 | } | |
1376 | switch (w->state) { | |
1377 | #ifdef CONFIG_IPV6_SUBTREES | |
1378 | case FWS_S: | |
7fc33165 YH |
1379 | if (FIB6_SUBTREE(fn)) { |
1380 | w->node = FIB6_SUBTREE(fn); | |
1da177e4 LT |
1381 | continue; |
1382 | } | |
1383 | w->state = FWS_L; | |
1ab1457c | 1384 | #endif |
1da177e4 LT |
1385 | case FWS_L: |
1386 | if (fn->left) { | |
1387 | w->node = fn->left; | |
1388 | w->state = FWS_INIT; | |
1389 | continue; | |
1390 | } | |
1391 | w->state = FWS_R; | |
1392 | case FWS_R: | |
1393 | if (fn->right) { | |
1394 | w->node = fn->right; | |
1395 | w->state = FWS_INIT; | |
1396 | continue; | |
1397 | } | |
1398 | w->state = FWS_C; | |
1399 | w->leaf = fn->leaf; | |
1400 | case FWS_C: | |
507c9b1e | 1401 | if (w->leaf && fn->fn_flags & RTN_RTINFO) { |
2bec5a36 PM |
1402 | int err; |
1403 | ||
fa809e2f ED |
1404 | if (w->skip) { |
1405 | w->skip--; | |
2bec5a36 PM |
1406 | continue; |
1407 | } | |
1408 | ||
1409 | err = w->func(w); | |
1da177e4 LT |
1410 | if (err) |
1411 | return err; | |
2bec5a36 PM |
1412 | |
1413 | w->count++; | |
1da177e4 LT |
1414 | continue; |
1415 | } | |
1416 | w->state = FWS_U; | |
1417 | case FWS_U: | |
1418 | if (fn == w->root) | |
1419 | return 0; | |
1420 | pn = fn->parent; | |
1421 | w->node = pn; | |
1422 | #ifdef CONFIG_IPV6_SUBTREES | |
7fc33165 | 1423 | if (FIB6_SUBTREE(pn) == fn) { |
547b792c | 1424 | WARN_ON(!(fn->fn_flags & RTN_ROOT)); |
1da177e4 LT |
1425 | w->state = FWS_L; |
1426 | continue; | |
1427 | } | |
1428 | #endif | |
1429 | if (pn->left == fn) { | |
1430 | w->state = FWS_R; | |
1431 | continue; | |
1432 | } | |
1433 | if (pn->right == fn) { | |
1434 | w->state = FWS_C; | |
1435 | w->leaf = w->node->leaf; | |
1436 | continue; | |
1437 | } | |
1438 | #if RT6_DEBUG >= 2 | |
547b792c | 1439 | WARN_ON(1); |
1da177e4 LT |
1440 | #endif |
1441 | } | |
1442 | } | |
1443 | } | |
1444 | ||
90d41122 | 1445 | static int fib6_walk(struct fib6_walker_t *w) |
1da177e4 LT |
1446 | { |
1447 | int res; | |
1448 | ||
1449 | w->state = FWS_INIT; | |
1450 | w->node = w->root; | |
1451 | ||
1452 | fib6_walker_link(w); | |
1453 | res = fib6_walk_continue(w); | |
1454 | if (res <= 0) | |
1455 | fib6_walker_unlink(w); | |
1456 | return res; | |
1457 | } | |
1458 | ||
1459 | static int fib6_clean_node(struct fib6_walker_t *w) | |
1460 | { | |
1461 | int res; | |
1462 | struct rt6_info *rt; | |
0a8891a0 | 1463 | struct fib6_cleaner_t *c = container_of(w, struct fib6_cleaner_t, w); |
ec7d43c2 BT |
1464 | struct nl_info info = { |
1465 | .nl_net = c->net, | |
1466 | }; | |
1da177e4 | 1467 | |
d8d1f30b | 1468 | for (rt = w->leaf; rt; rt = rt->dst.rt6_next) { |
1da177e4 LT |
1469 | res = c->func(rt, c->arg); |
1470 | if (res < 0) { | |
1471 | w->leaf = rt; | |
528c4ceb | 1472 | res = fib6_del(rt, &info); |
1da177e4 LT |
1473 | if (res) { |
1474 | #if RT6_DEBUG >= 2 | |
91df42be JP |
1475 | pr_debug("%s: del failed: rt=%p@%p err=%d\n", |
1476 | __func__, rt, rt->rt6i_node, res); | |
1da177e4 LT |
1477 | #endif |
1478 | continue; | |
1479 | } | |
1480 | return 0; | |
1481 | } | |
547b792c | 1482 | WARN_ON(res != 0); |
1da177e4 LT |
1483 | } |
1484 | w->leaf = rt; | |
1485 | return 0; | |
1486 | } | |
1487 | ||
1488 | /* | |
1489 | * Convenient frontend to tree walker. | |
1ab1457c | 1490 | * |
1da177e4 LT |
1491 | * func is called on each route. |
1492 | * It may return -1 -> delete this route. | |
1493 | * 0 -> continue walking | |
1494 | * | |
1495 | * prune==1 -> only immediate children of node (certainly, | |
1496 | * ignoring pure split nodes) will be scanned. | |
1497 | */ | |
1498 | ||
ec7d43c2 | 1499 | static void fib6_clean_tree(struct net *net, struct fib6_node *root, |
8ce11e6a AB |
1500 | int (*func)(struct rt6_info *, void *arg), |
1501 | int prune, void *arg) | |
1da177e4 LT |
1502 | { |
1503 | struct fib6_cleaner_t c; | |
1504 | ||
1505 | c.w.root = root; | |
1506 | c.w.func = fib6_clean_node; | |
1507 | c.w.prune = prune; | |
2bec5a36 PM |
1508 | c.w.count = 0; |
1509 | c.w.skip = 0; | |
1da177e4 LT |
1510 | c.func = func; |
1511 | c.arg = arg; | |
ec7d43c2 | 1512 | c.net = net; |
1da177e4 LT |
1513 | |
1514 | fib6_walk(&c.w); | |
1515 | } | |
1516 | ||
32b293a5 JH |
1517 | void fib6_clean_all_ro(struct net *net, int (*func)(struct rt6_info *, void *arg), |
1518 | int prune, void *arg) | |
1519 | { | |
1520 | struct fib6_table *table; | |
32b293a5 JH |
1521 | struct hlist_head *head; |
1522 | unsigned int h; | |
1523 | ||
1524 | rcu_read_lock(); | |
1525 | for (h = 0; h < FIB6_TABLE_HASHSZ; h++) { | |
1526 | head = &net->ipv6.fib_table_hash[h]; | |
b67bfe0d | 1527 | hlist_for_each_entry_rcu(table, head, tb6_hlist) { |
32b293a5 JH |
1528 | read_lock_bh(&table->tb6_lock); |
1529 | fib6_clean_tree(net, &table->tb6_root, | |
1530 | func, prune, arg); | |
1531 | read_unlock_bh(&table->tb6_lock); | |
1532 | } | |
1533 | } | |
1534 | rcu_read_unlock(); | |
1535 | } | |
f3db4851 | 1536 | void fib6_clean_all(struct net *net, int (*func)(struct rt6_info *, void *arg), |
c71099ac TG |
1537 | int prune, void *arg) |
1538 | { | |
c71099ac | 1539 | struct fib6_table *table; |
58f09b78 | 1540 | struct hlist_head *head; |
1b43af54 | 1541 | unsigned int h; |
c71099ac | 1542 | |
1b43af54 | 1543 | rcu_read_lock(); |
a33bc5c1 | 1544 | for (h = 0; h < FIB6_TABLE_HASHSZ; h++) { |
f3db4851 | 1545 | head = &net->ipv6.fib_table_hash[h]; |
b67bfe0d | 1546 | hlist_for_each_entry_rcu(table, head, tb6_hlist) { |
c71099ac | 1547 | write_lock_bh(&table->tb6_lock); |
ec7d43c2 BT |
1548 | fib6_clean_tree(net, &table->tb6_root, |
1549 | func, prune, arg); | |
c71099ac TG |
1550 | write_unlock_bh(&table->tb6_lock); |
1551 | } | |
1552 | } | |
1b43af54 | 1553 | rcu_read_unlock(); |
c71099ac TG |
1554 | } |
1555 | ||
1da177e4 LT |
1556 | static int fib6_prune_clone(struct rt6_info *rt, void *arg) |
1557 | { | |
1558 | if (rt->rt6i_flags & RTF_CACHE) { | |
1559 | RT6_TRACE("pruning clone %p\n", rt); | |
1560 | return -1; | |
1561 | } | |
1562 | ||
1563 | return 0; | |
1564 | } | |
1565 | ||
ec7d43c2 BT |
1566 | static void fib6_prune_clones(struct net *net, struct fib6_node *fn, |
1567 | struct rt6_info *rt) | |
1da177e4 | 1568 | { |
ec7d43c2 | 1569 | fib6_clean_tree(net, fn, fib6_prune_clone, 1, rt); |
1da177e4 LT |
1570 | } |
1571 | ||
1572 | /* | |
1573 | * Garbage collection | |
1574 | */ | |
1575 | ||
1576 | static struct fib6_gc_args | |
1577 | { | |
1578 | int timeout; | |
1579 | int more; | |
1580 | } gc_args; | |
1581 | ||
1582 | static int fib6_age(struct rt6_info *rt, void *arg) | |
1583 | { | |
1584 | unsigned long now = jiffies; | |
1585 | ||
1586 | /* | |
1587 | * check addrconf expiration here. | |
1588 | * Routes are expired even if they are in use. | |
1589 | * | |
1590 | * Also age clones. Note, that clones are aged out | |
1591 | * only if they are not in use now. | |
1592 | */ | |
1593 | ||
d1918542 DM |
1594 | if (rt->rt6i_flags & RTF_EXPIRES && rt->dst.expires) { |
1595 | if (time_after(now, rt->dst.expires)) { | |
1da177e4 | 1596 | RT6_TRACE("expiring %p\n", rt); |
1da177e4 LT |
1597 | return -1; |
1598 | } | |
1599 | gc_args.more++; | |
1600 | } else if (rt->rt6i_flags & RTF_CACHE) { | |
d8d1f30b CG |
1601 | if (atomic_read(&rt->dst.__refcnt) == 0 && |
1602 | time_after_eq(now, rt->dst.lastuse + gc_args.timeout)) { | |
1da177e4 LT |
1603 | RT6_TRACE("aging clone %p\n", rt); |
1604 | return -1; | |
5339ab8b DM |
1605 | } else if (rt->rt6i_flags & RTF_GATEWAY) { |
1606 | struct neighbour *neigh; | |
1607 | __u8 neigh_flags = 0; | |
1608 | ||
1609 | neigh = dst_neigh_lookup(&rt->dst, &rt->rt6i_gateway); | |
1610 | if (neigh) { | |
1611 | neigh_flags = neigh->flags; | |
1612 | neigh_release(neigh); | |
1613 | } | |
8bd74516 | 1614 | if (!(neigh_flags & NTF_ROUTER)) { |
5339ab8b DM |
1615 | RT6_TRACE("purging route %p via non-router but gateway\n", |
1616 | rt); | |
1617 | return -1; | |
1618 | } | |
1da177e4 LT |
1619 | } |
1620 | gc_args.more++; | |
1621 | } | |
1622 | ||
1623 | return 0; | |
1624 | } | |
1625 | ||
1626 | static DEFINE_SPINLOCK(fib6_gc_lock); | |
1627 | ||
5b7c931d | 1628 | void fib6_run_gc(unsigned long expires, struct net *net) |
1da177e4 | 1629 | { |
5b7c931d | 1630 | if (expires != ~0UL) { |
1da177e4 | 1631 | spin_lock_bh(&fib6_gc_lock); |
5b7c931d DL |
1632 | gc_args.timeout = expires ? (int)expires : |
1633 | net->ipv6.sysctl.ip6_rt_gc_interval; | |
1da177e4 | 1634 | } else { |
a76d7345 | 1635 | if (!spin_trylock_bh(&fib6_gc_lock)) { |
417f28bb | 1636 | mod_timer(&net->ipv6.ip6_fib_timer, jiffies + HZ); |
1da177e4 LT |
1637 | return; |
1638 | } | |
5b7c931d | 1639 | gc_args.timeout = net->ipv6.sysctl.ip6_rt_gc_interval; |
1da177e4 | 1640 | } |
1da177e4 | 1641 | |
3d0f24a7 | 1642 | gc_args.more = icmp6_dst_gc(); |
f3db4851 | 1643 | |
5b7c931d | 1644 | fib6_clean_all(net, fib6_age, 0, NULL); |
1da177e4 LT |
1645 | |
1646 | if (gc_args.more) | |
c8a45222 SH |
1647 | mod_timer(&net->ipv6.ip6_fib_timer, |
1648 | round_jiffies(jiffies | |
1649 | + net->ipv6.sysctl.ip6_rt_gc_interval)); | |
417f28bb SH |
1650 | else |
1651 | del_timer(&net->ipv6.ip6_fib_timer); | |
1da177e4 LT |
1652 | spin_unlock_bh(&fib6_gc_lock); |
1653 | } | |
1654 | ||
5b7c931d DL |
1655 | static void fib6_gc_timer_cb(unsigned long arg) |
1656 | { | |
1657 | fib6_run_gc(0, (struct net *)arg); | |
1658 | } | |
1659 | ||
2c8c1e72 | 1660 | static int __net_init fib6_net_init(struct net *net) |
1da177e4 | 1661 | { |
10da66f7 ED |
1662 | size_t size = sizeof(struct hlist_head) * FIB6_TABLE_HASHSZ; |
1663 | ||
417f28bb | 1664 | setup_timer(&net->ipv6.ip6_fib_timer, fib6_gc_timer_cb, (unsigned long)net); |
63152fc0 | 1665 | |
c572872f BT |
1666 | net->ipv6.rt6_stats = kzalloc(sizeof(*net->ipv6.rt6_stats), GFP_KERNEL); |
1667 | if (!net->ipv6.rt6_stats) | |
1668 | goto out_timer; | |
1669 | ||
10da66f7 ED |
1670 | /* Avoid false sharing : Use at least a full cache line */ |
1671 | size = max_t(size_t, size, L1_CACHE_BYTES); | |
1672 | ||
1673 | net->ipv6.fib_table_hash = kzalloc(size, GFP_KERNEL); | |
58f09b78 | 1674 | if (!net->ipv6.fib_table_hash) |
c572872f | 1675 | goto out_rt6_stats; |
e0b85590 | 1676 | |
58f09b78 DL |
1677 | net->ipv6.fib6_main_tbl = kzalloc(sizeof(*net->ipv6.fib6_main_tbl), |
1678 | GFP_KERNEL); | |
1679 | if (!net->ipv6.fib6_main_tbl) | |
e0b85590 DL |
1680 | goto out_fib_table_hash; |
1681 | ||
58f09b78 | 1682 | net->ipv6.fib6_main_tbl->tb6_id = RT6_TABLE_MAIN; |
8ed67789 | 1683 | net->ipv6.fib6_main_tbl->tb6_root.leaf = net->ipv6.ip6_null_entry; |
58f09b78 DL |
1684 | net->ipv6.fib6_main_tbl->tb6_root.fn_flags = |
1685 | RTN_ROOT | RTN_TL_ROOT | RTN_RTINFO; | |
8e773277 | 1686 | inet_peer_base_init(&net->ipv6.fib6_main_tbl->tb6_peers); |
e0b85590 DL |
1687 | |
1688 | #ifdef CONFIG_IPV6_MULTIPLE_TABLES | |
58f09b78 DL |
1689 | net->ipv6.fib6_local_tbl = kzalloc(sizeof(*net->ipv6.fib6_local_tbl), |
1690 | GFP_KERNEL); | |
1691 | if (!net->ipv6.fib6_local_tbl) | |
e0b85590 | 1692 | goto out_fib6_main_tbl; |
58f09b78 | 1693 | net->ipv6.fib6_local_tbl->tb6_id = RT6_TABLE_LOCAL; |
8ed67789 | 1694 | net->ipv6.fib6_local_tbl->tb6_root.leaf = net->ipv6.ip6_null_entry; |
58f09b78 DL |
1695 | net->ipv6.fib6_local_tbl->tb6_root.fn_flags = |
1696 | RTN_ROOT | RTN_TL_ROOT | RTN_RTINFO; | |
8e773277 | 1697 | inet_peer_base_init(&net->ipv6.fib6_local_tbl->tb6_peers); |
e0b85590 | 1698 | #endif |
58f09b78 | 1699 | fib6_tables_init(net); |
f845ab6b | 1700 | |
417f28bb | 1701 | return 0; |
d63bddbe | 1702 | |
e0b85590 | 1703 | #ifdef CONFIG_IPV6_MULTIPLE_TABLES |
e0b85590 | 1704 | out_fib6_main_tbl: |
58f09b78 | 1705 | kfree(net->ipv6.fib6_main_tbl); |
e0b85590 | 1706 | #endif |
e0b85590 | 1707 | out_fib_table_hash: |
58f09b78 | 1708 | kfree(net->ipv6.fib_table_hash); |
c572872f BT |
1709 | out_rt6_stats: |
1710 | kfree(net->ipv6.rt6_stats); | |
63152fc0 | 1711 | out_timer: |
417f28bb | 1712 | return -ENOMEM; |
58f09b78 DL |
1713 | } |
1714 | ||
1715 | static void fib6_net_exit(struct net *net) | |
1716 | { | |
8ed67789 | 1717 | rt6_ifdown(net, NULL); |
417f28bb SH |
1718 | del_timer_sync(&net->ipv6.ip6_fib_timer); |
1719 | ||
58f09b78 | 1720 | #ifdef CONFIG_IPV6_MULTIPLE_TABLES |
8e773277 | 1721 | inetpeer_invalidate_tree(&net->ipv6.fib6_local_tbl->tb6_peers); |
58f09b78 DL |
1722 | kfree(net->ipv6.fib6_local_tbl); |
1723 | #endif | |
8e773277 | 1724 | inetpeer_invalidate_tree(&net->ipv6.fib6_main_tbl->tb6_peers); |
58f09b78 DL |
1725 | kfree(net->ipv6.fib6_main_tbl); |
1726 | kfree(net->ipv6.fib_table_hash); | |
c572872f | 1727 | kfree(net->ipv6.rt6_stats); |
58f09b78 DL |
1728 | } |
1729 | ||
1730 | static struct pernet_operations fib6_net_ops = { | |
1731 | .init = fib6_net_init, | |
1732 | .exit = fib6_net_exit, | |
1733 | }; | |
1734 | ||
1735 | int __init fib6_init(void) | |
1736 | { | |
1737 | int ret = -ENOMEM; | |
63152fc0 | 1738 | |
58f09b78 DL |
1739 | fib6_node_kmem = kmem_cache_create("fib6_nodes", |
1740 | sizeof(struct fib6_node), | |
1741 | 0, SLAB_HWCACHE_ALIGN, | |
1742 | NULL); | |
1743 | if (!fib6_node_kmem) | |
1744 | goto out; | |
1745 | ||
1746 | ret = register_pernet_subsys(&fib6_net_ops); | |
1747 | if (ret) | |
c572872f | 1748 | goto out_kmem_cache_create; |
e8803b6c DM |
1749 | |
1750 | ret = __rtnl_register(PF_INET6, RTM_GETROUTE, NULL, inet6_dump_fib, | |
1751 | NULL); | |
1752 | if (ret) | |
1753 | goto out_unregister_subsys; | |
58f09b78 DL |
1754 | out: |
1755 | return ret; | |
1756 | ||
e8803b6c DM |
1757 | out_unregister_subsys: |
1758 | unregister_pernet_subsys(&fib6_net_ops); | |
d63bddbe DL |
1759 | out_kmem_cache_create: |
1760 | kmem_cache_destroy(fib6_node_kmem); | |
1761 | goto out; | |
1da177e4 LT |
1762 | } |
1763 | ||
1764 | void fib6_gc_cleanup(void) | |
1765 | { | |
58f09b78 | 1766 | unregister_pernet_subsys(&fib6_net_ops); |
1da177e4 LT |
1767 | kmem_cache_destroy(fib6_node_kmem); |
1768 | } |