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