Commit | Line | Data |
---|---|---|
2874c5fd | 1 | // SPDX-License-Identifier: GPL-2.0-or-later |
1da177e4 | 2 | /* |
1ab1457c | 3 | * Linux INET6 implementation |
1da177e4 LT |
4 | * Forwarding Information Database |
5 | * | |
6 | * Authors: | |
1ab1457c | 7 | * Pedro Roque <roque@di.fc.ul.pt> |
1da177e4 | 8 | * |
8db46f1d WY |
9 | * Changes: |
10 | * Yuji SEKIYA @USAGI: Support default route on router node; | |
11 | * remove ip6_null_entry from the top of | |
12 | * routing table. | |
13 | * Ville Nuorvala: Fixed routing subtrees. | |
1da177e4 | 14 | */ |
f3213831 JP |
15 | |
16 | #define pr_fmt(fmt) "IPv6: " fmt | |
17 | ||
b6459415 | 18 | #include <linux/bpf.h> |
1da177e4 LT |
19 | #include <linux/errno.h> |
20 | #include <linux/types.h> | |
21 | #include <linux/net.h> | |
22 | #include <linux/route.h> | |
23 | #include <linux/netdevice.h> | |
24 | #include <linux/in6.h> | |
25 | #include <linux/init.h> | |
c71099ac | 26 | #include <linux/list.h> |
5a0e3ad6 | 27 | #include <linux/slab.h> |
1da177e4 | 28 | |
cc5f0eb2 | 29 | #include <net/ip.h> |
1da177e4 LT |
30 | #include <net/ipv6.h> |
31 | #include <net/ndisc.h> | |
32 | #include <net/addrconf.h> | |
19e42e45 | 33 | #include <net/lwtunnel.h> |
df77fe4d | 34 | #include <net/fib_notifier.h> |
1da177e4 | 35 | |
ed13923f | 36 | #include <net/ip_fib.h> |
1da177e4 LT |
37 | #include <net/ip6_fib.h> |
38 | #include <net/ip6_route.h> | |
39 | ||
437de07c | 40 | static struct kmem_cache *fib6_node_kmem __read_mostly; |
1da177e4 | 41 | |
94b2cfe0 HFS |
42 | struct fib6_cleaner { |
43 | struct fib6_walker w; | |
ec7d43c2 | 44 | struct net *net; |
8d1c802b | 45 | int (*func)(struct fib6_info *, void *arg); |
327571cb | 46 | int sernum; |
1da177e4 | 47 | void *arg; |
7c6bb7d2 | 48 | bool skip_notify; |
1da177e4 LT |
49 | }; |
50 | ||
1da177e4 LT |
51 | #ifdef CONFIG_IPV6_SUBTREES |
52 | #define FWS_INIT FWS_S | |
1da177e4 LT |
53 | #else |
54 | #define FWS_INIT FWS_L | |
1da177e4 LT |
55 | #endif |
56 | ||
8d1c802b | 57 | static struct fib6_info *fib6_find_prefix(struct net *net, |
66f5d6ce WW |
58 | struct fib6_table *table, |
59 | struct fib6_node *fn); | |
60 | static struct fib6_node *fib6_repair_tree(struct net *net, | |
61 | struct fib6_table *table, | |
62 | struct fib6_node *fn); | |
9a03cd8f | 63 | static int fib6_walk(struct net *net, struct fib6_walker *w); |
94b2cfe0 | 64 | static int fib6_walk_continue(struct fib6_walker *w); |
1da177e4 LT |
65 | |
66 | /* | |
67 | * A routing update causes an increase of the serial number on the | |
68 | * affected subtree. This allows for cached routes to be asynchronously | |
69 | * tested when modifications are made to the destination cache as a | |
70 | * result of redirects, path MTU changes, etc. | |
71 | */ | |
72 | ||
86cb30ec | 73 | static void fib6_gc_timer_cb(struct timer_list *t); |
5b7c931d | 74 | |
9a03cd8f MK |
75 | #define FOR_WALKERS(net, w) \ |
76 | list_for_each_entry(w, &(net)->ipv6.fib6_walkers, lh) | |
1da177e4 | 77 | |
9a03cd8f | 78 | static void fib6_walker_link(struct net *net, struct fib6_walker *w) |
90d41122 | 79 | { |
9a03cd8f MK |
80 | write_lock_bh(&net->ipv6.fib6_walker_lock); |
81 | list_add(&w->lh, &net->ipv6.fib6_walkers); | |
82 | write_unlock_bh(&net->ipv6.fib6_walker_lock); | |
90d41122 AB |
83 | } |
84 | ||
9a03cd8f | 85 | static void fib6_walker_unlink(struct net *net, struct fib6_walker *w) |
90d41122 | 86 | { |
9a03cd8f | 87 | write_lock_bh(&net->ipv6.fib6_walker_lock); |
bbef49da | 88 | list_del(&w->lh); |
9a03cd8f | 89 | write_unlock_bh(&net->ipv6.fib6_walker_lock); |
90d41122 | 90 | } |
94b2cfe0 | 91 | |
812918c4 | 92 | static int fib6_new_sernum(struct net *net) |
1da177e4 | 93 | { |
30189806 | 94 | int new, old = atomic_read(&net->ipv6.fib6_sernum); |
42b18706 HFS |
95 | |
96 | do { | |
42b18706 | 97 | new = old < INT_MAX ? old + 1 : 1; |
30189806 ED |
98 | } while (!atomic_try_cmpxchg(&net->ipv6.fib6_sernum, &old, new)); |
99 | ||
42b18706 | 100 | return new; |
1da177e4 LT |
101 | } |
102 | ||
327571cb HFS |
103 | enum { |
104 | FIB6_NO_SERNUM_CHANGE = 0, | |
105 | }; | |
106 | ||
93c2fb25 | 107 | void fib6_update_sernum(struct net *net, struct fib6_info *f6i) |
180ca444 | 108 | { |
180ca444 WW |
109 | struct fib6_node *fn; |
110 | ||
93c2fb25 DA |
111 | fn = rcu_dereference_protected(f6i->fib6_node, |
112 | lockdep_is_held(&f6i->fib6_table->tb6_lock)); | |
180ca444 | 113 | if (fn) |
aafc2e32 | 114 | WRITE_ONCE(fn->fn_sernum, fib6_new_sernum(net)); |
180ca444 WW |
115 | } |
116 | ||
1da177e4 LT |
117 | /* |
118 | * Auxiliary address test functions for the radix tree. | |
119 | * | |
1ab1457c | 120 | * These assume a 32bit processor (although it will work on |
1da177e4 LT |
121 | * 64bit processors) |
122 | */ | |
123 | ||
124 | /* | |
125 | * test bit | |
126 | */ | |
02cdce53 YH |
127 | #if defined(__LITTLE_ENDIAN) |
128 | # define BITOP_BE32_SWIZZLE (0x1F & ~7) | |
129 | #else | |
130 | # define BITOP_BE32_SWIZZLE 0 | |
131 | #endif | |
1da177e4 | 132 | |
94b2cfe0 | 133 | static __be32 addr_bit_set(const void *token, int fn_bit) |
1da177e4 | 134 | { |
b71d1d42 | 135 | const __be32 *addr = token; |
02cdce53 YH |
136 | /* |
137 | * Here, | |
8db46f1d | 138 | * 1 << ((~fn_bit ^ BITOP_BE32_SWIZZLE) & 0x1f) |
02cdce53 YH |
139 | * is optimized version of |
140 | * htonl(1 << ((~fn_bit)&0x1F)) | |
141 | * See include/asm-generic/bitops/le.h. | |
142 | */ | |
0eae88f3 ED |
143 | return (__force __be32)(1 << ((~fn_bit ^ BITOP_BE32_SWIZZLE) & 0x1f)) & |
144 | addr[fn_bit >> 5]; | |
1da177e4 LT |
145 | } |
146 | ||
1cf844c7 | 147 | struct fib6_info *fib6_info_alloc(gfp_t gfp_flags, bool with_fib6_nh) |
a64efe14 | 148 | { |
8d1c802b | 149 | struct fib6_info *f6i; |
1cf844c7 | 150 | size_t sz = sizeof(*f6i); |
a64efe14 | 151 | |
1cf844c7 DA |
152 | if (with_fib6_nh) |
153 | sz += sizeof(struct fib6_nh); | |
154 | ||
155 | f6i = kzalloc(sz, gfp_flags); | |
a64efe14 DA |
156 | if (!f6i) |
157 | return NULL; | |
158 | ||
f88d8ea6 | 159 | /* fib6_siblings is a union with nh_list, so this initializes both */ |
93c2fb25 | 160 | INIT_LIST_HEAD(&f6i->fib6_siblings); |
f05713e0 | 161 | refcount_set(&f6i->fib6_ref, 1); |
a64efe14 DA |
162 | |
163 | return f6i; | |
164 | } | |
165 | ||
9b0a8da8 | 166 | void fib6_info_destroy_rcu(struct rcu_head *head) |
a64efe14 | 167 | { |
9b0a8da8 | 168 | struct fib6_info *f6i = container_of(head, struct fib6_info, rcu); |
a64efe14 | 169 | |
93c2fb25 | 170 | WARN_ON(f6i->fib6_node); |
a64efe14 | 171 | |
f88d8ea6 DA |
172 | if (f6i->nh) |
173 | nexthop_put(f6i->nh); | |
174 | else | |
175 | fib6_nh_release(f6i->fib6_nh); | |
176 | ||
cc5f0eb2 | 177 | ip_fib_metrics_put(f6i->fib6_metrics); |
a64efe14 DA |
178 | kfree(f6i); |
179 | } | |
9b0a8da8 | 180 | EXPORT_SYMBOL_GPL(fib6_info_destroy_rcu); |
a64efe14 | 181 | |
81eb8447 | 182 | static struct fib6_node *node_alloc(struct net *net) |
1da177e4 LT |
183 | { |
184 | struct fib6_node *fn; | |
185 | ||
c3762229 | 186 | fn = kmem_cache_zalloc(fib6_node_kmem, GFP_ATOMIC); |
81eb8447 WW |
187 | if (fn) |
188 | net->ipv6.rt6_stats->fib_nodes++; | |
1da177e4 LT |
189 | |
190 | return fn; | |
191 | } | |
192 | ||
81eb8447 | 193 | static void node_free_immediate(struct net *net, struct fib6_node *fn) |
c5cff856 WW |
194 | { |
195 | kmem_cache_free(fib6_node_kmem, fn); | |
81eb8447 | 196 | net->ipv6.rt6_stats->fib_nodes--; |
c5cff856 WW |
197 | } |
198 | ||
199 | static void node_free_rcu(struct rcu_head *head) | |
1da177e4 | 200 | { |
c5cff856 WW |
201 | struct fib6_node *fn = container_of(head, struct fib6_node, rcu); |
202 | ||
1da177e4 LT |
203 | kmem_cache_free(fib6_node_kmem, fn); |
204 | } | |
205 | ||
81eb8447 | 206 | static void node_free(struct net *net, struct fib6_node *fn) |
c5cff856 WW |
207 | { |
208 | call_rcu(&fn->rcu, node_free_rcu); | |
81eb8447 | 209 | net->ipv6.rt6_stats->fib_nodes--; |
c5cff856 WW |
210 | } |
211 | ||
ba1cc08d SD |
212 | static void fib6_free_table(struct fib6_table *table) |
213 | { | |
214 | inetpeer_invalidate_tree(&table->tb6_peers); | |
215 | kfree(table); | |
216 | } | |
217 | ||
58f09b78 | 218 | static void fib6_link_table(struct net *net, struct fib6_table *tb) |
1b43af54 PM |
219 | { |
220 | unsigned int h; | |
221 | ||
375216ad TG |
222 | /* |
223 | * Initialize table lock at a single place to give lockdep a key, | |
224 | * tables aren't visible prior to being linked to the list. | |
225 | */ | |
66f5d6ce | 226 | spin_lock_init(&tb->tb6_lock); |
a33bc5c1 | 227 | h = tb->tb6_id & (FIB6_TABLE_HASHSZ - 1); |
1b43af54 PM |
228 | |
229 | /* | |
230 | * No protection necessary, this is the only list mutatation | |
231 | * operation, tables never disappear once they exist. | |
232 | */ | |
58f09b78 | 233 | hlist_add_head_rcu(&tb->tb6_hlist, &net->ipv6.fib_table_hash[h]); |
1b43af54 | 234 | } |
c71099ac | 235 | |
1b43af54 | 236 | #ifdef CONFIG_IPV6_MULTIPLE_TABLES |
e0b85590 | 237 | |
8ed67789 | 238 | static struct fib6_table *fib6_alloc_table(struct net *net, u32 id) |
c71099ac TG |
239 | { |
240 | struct fib6_table *table; | |
241 | ||
242 | table = kzalloc(sizeof(*table), GFP_ATOMIC); | |
507c9b1e | 243 | if (table) { |
c71099ac | 244 | table->tb6_id = id; |
66f5d6ce | 245 | rcu_assign_pointer(table->tb6_root.leaf, |
421842ed | 246 | net->ipv6.fib6_null_entry); |
c71099ac | 247 | table->tb6_root.fn_flags = RTN_ROOT | RTN_TL_ROOT | RTN_RTINFO; |
8e773277 | 248 | inet_peer_base_init(&table->tb6_peers); |
c71099ac TG |
249 | } |
250 | ||
251 | return table; | |
252 | } | |
253 | ||
58f09b78 | 254 | struct fib6_table *fib6_new_table(struct net *net, u32 id) |
c71099ac TG |
255 | { |
256 | struct fib6_table *tb; | |
257 | ||
258 | if (id == 0) | |
259 | id = RT6_TABLE_MAIN; | |
58f09b78 | 260 | tb = fib6_get_table(net, id); |
c71099ac TG |
261 | if (tb) |
262 | return tb; | |
263 | ||
8ed67789 | 264 | tb = fib6_alloc_table(net, id); |
507c9b1e | 265 | if (tb) |
58f09b78 | 266 | fib6_link_table(net, tb); |
c71099ac TG |
267 | |
268 | return tb; | |
269 | } | |
b3b4663c | 270 | EXPORT_SYMBOL_GPL(fib6_new_table); |
c71099ac | 271 | |
58f09b78 | 272 | struct fib6_table *fib6_get_table(struct net *net, u32 id) |
c71099ac TG |
273 | { |
274 | struct fib6_table *tb; | |
58f09b78 | 275 | struct hlist_head *head; |
c71099ac TG |
276 | unsigned int h; |
277 | ||
278 | if (id == 0) | |
279 | id = RT6_TABLE_MAIN; | |
a33bc5c1 | 280 | h = id & (FIB6_TABLE_HASHSZ - 1); |
c71099ac | 281 | rcu_read_lock(); |
58f09b78 | 282 | head = &net->ipv6.fib_table_hash[h]; |
b67bfe0d | 283 | hlist_for_each_entry_rcu(tb, head, tb6_hlist) { |
c71099ac TG |
284 | if (tb->tb6_id == id) { |
285 | rcu_read_unlock(); | |
286 | return tb; | |
287 | } | |
288 | } | |
289 | rcu_read_unlock(); | |
290 | ||
291 | return NULL; | |
292 | } | |
c4850687 | 293 | EXPORT_SYMBOL_GPL(fib6_get_table); |
c71099ac | 294 | |
2c8c1e72 | 295 | static void __net_init fib6_tables_init(struct net *net) |
c71099ac | 296 | { |
58f09b78 DL |
297 | fib6_link_table(net, net->ipv6.fib6_main_tbl); |
298 | fib6_link_table(net, net->ipv6.fib6_local_tbl); | |
c71099ac | 299 | } |
c71099ac TG |
300 | #else |
301 | ||
58f09b78 | 302 | struct fib6_table *fib6_new_table(struct net *net, u32 id) |
c71099ac | 303 | { |
58f09b78 | 304 | return fib6_get_table(net, id); |
c71099ac TG |
305 | } |
306 | ||
58f09b78 | 307 | struct fib6_table *fib6_get_table(struct net *net, u32 id) |
c71099ac | 308 | { |
58f09b78 | 309 | return net->ipv6.fib6_main_tbl; |
c71099ac TG |
310 | } |
311 | ||
4c9483b2 | 312 | struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi6 *fl6, |
b75cc8f9 | 313 | const struct sk_buff *skb, |
58f09b78 | 314 | int flags, pol_lookup_t lookup) |
c71099ac | 315 | { |
ab997ad4 | 316 | struct rt6_info *rt; |
317 | ||
55cced4f BV |
318 | rt = pol_lookup_func(lookup, |
319 | net, net->ipv6.fib6_main_tbl, fl6, skb, flags); | |
07f61557 | 320 | if (rt->dst.error == -EAGAIN) { |
d64a1f57 | 321 | ip6_rt_put_flags(rt, flags); |
ab997ad4 | 322 | rt = net->ipv6.ip6_null_entry; |
7b09c2d0 | 323 | if (!(flags & RT6_LOOKUP_F_DST_NOREF)) |
d64a1f57 | 324 | dst_hold(&rt->dst); |
ab997ad4 | 325 | } |
326 | ||
327 | return &rt->dst; | |
c71099ac TG |
328 | } |
329 | ||
138118ec | 330 | /* called with rcu lock held; no reference taken on fib6_info */ |
effda4dd DA |
331 | int fib6_lookup(struct net *net, int oif, struct flowi6 *fl6, |
332 | struct fib6_result *res, int flags) | |
138118ec | 333 | { |
effda4dd DA |
334 | return fib6_table_lookup(net, net->ipv6.fib6_main_tbl, oif, fl6, |
335 | res, flags); | |
138118ec DA |
336 | } |
337 | ||
2c8c1e72 | 338 | static void __net_init fib6_tables_init(struct net *net) |
c71099ac | 339 | { |
58f09b78 | 340 | fib6_link_table(net, net->ipv6.fib6_main_tbl); |
c71099ac TG |
341 | } |
342 | ||
343 | #endif | |
344 | ||
e1ee0a5b IS |
345 | unsigned int fib6_tables_seq_read(struct net *net) |
346 | { | |
347 | unsigned int h, fib_seq = 0; | |
348 | ||
349 | rcu_read_lock(); | |
350 | for (h = 0; h < FIB6_TABLE_HASHSZ; h++) { | |
351 | struct hlist_head *head = &net->ipv6.fib_table_hash[h]; | |
352 | struct fib6_table *tb; | |
353 | ||
66f5d6ce | 354 | hlist_for_each_entry_rcu(tb, head, tb6_hlist) |
e1ee0a5b | 355 | fib_seq += tb->fib_seq; |
e1ee0a5b IS |
356 | } |
357 | rcu_read_unlock(); | |
358 | ||
359 | return fib_seq; | |
360 | } | |
361 | ||
7c550daf | 362 | static int call_fib6_entry_notifier(struct notifier_block *nb, |
e1ee0a5b | 363 | enum fib_event_type event_type, |
b7a59557 JP |
364 | struct fib6_info *rt, |
365 | struct netlink_ext_ack *extack) | |
e1ee0a5b IS |
366 | { |
367 | struct fib6_entry_notifier_info info = { | |
b7a59557 | 368 | .info.extack = extack, |
e1ee0a5b IS |
369 | .rt = rt, |
370 | }; | |
371 | ||
7c550daf | 372 | return call_fib6_notifier(nb, event_type, &info.info); |
e1ee0a5b IS |
373 | } |
374 | ||
9c6ecd3c IS |
375 | static int call_fib6_multipath_entry_notifier(struct notifier_block *nb, |
376 | enum fib_event_type event_type, | |
377 | struct fib6_info *rt, | |
378 | unsigned int nsiblings, | |
379 | struct netlink_ext_ack *extack) | |
380 | { | |
381 | struct fib6_entry_notifier_info info = { | |
382 | .info.extack = extack, | |
383 | .rt = rt, | |
384 | .nsiblings = nsiblings, | |
385 | }; | |
386 | ||
387 | return call_fib6_notifier(nb, event_type, &info.info); | |
388 | } | |
389 | ||
19a3b7ee DA |
390 | int call_fib6_entry_notifiers(struct net *net, |
391 | enum fib_event_type event_type, | |
392 | struct fib6_info *rt, | |
393 | struct netlink_ext_ack *extack) | |
df77fe4d IS |
394 | { |
395 | struct fib6_entry_notifier_info info = { | |
6c31e5a9 | 396 | .info.extack = extack, |
df77fe4d IS |
397 | .rt = rt, |
398 | }; | |
399 | ||
93c2fb25 | 400 | rt->fib6_table->fib_seq++; |
df77fe4d IS |
401 | return call_fib6_notifiers(net, event_type, &info.info); |
402 | } | |
403 | ||
d4b96c7b IS |
404 | int call_fib6_multipath_entry_notifiers(struct net *net, |
405 | enum fib_event_type event_type, | |
406 | struct fib6_info *rt, | |
407 | unsigned int nsiblings, | |
408 | struct netlink_ext_ack *extack) | |
409 | { | |
410 | struct fib6_entry_notifier_info info = { | |
411 | .info.extack = extack, | |
412 | .rt = rt, | |
413 | .nsiblings = nsiblings, | |
d4b96c7b IS |
414 | }; |
415 | ||
416 | rt->fib6_table->fib_seq++; | |
417 | return call_fib6_notifiers(net, event_type, &info.info); | |
418 | } | |
419 | ||
d2f0c9b1 IS |
420 | int call_fib6_entry_notifiers_replace(struct net *net, struct fib6_info *rt) |
421 | { | |
422 | struct fib6_entry_notifier_info info = { | |
423 | .rt = rt, | |
424 | .nsiblings = rt->fib6_nsiblings, | |
425 | }; | |
426 | ||
427 | rt->fib6_table->fib_seq++; | |
caafb250 | 428 | return call_fib6_notifiers(net, FIB_EVENT_ENTRY_REPLACE, &info.info); |
d2f0c9b1 IS |
429 | } |
430 | ||
e1ee0a5b IS |
431 | struct fib6_dump_arg { |
432 | struct net *net; | |
433 | struct notifier_block *nb; | |
b7a59557 | 434 | struct netlink_ext_ack *extack; |
e1ee0a5b IS |
435 | }; |
436 | ||
55c894f7 | 437 | static int fib6_rt_dump(struct fib6_info *rt, struct fib6_dump_arg *arg) |
e1ee0a5b | 438 | { |
caafb250 | 439 | enum fib_event_type fib_event = FIB_EVENT_ENTRY_REPLACE; |
9c6ecd3c IS |
440 | int err; |
441 | ||
442 | if (!rt || rt == arg->net->ipv6.fib6_null_entry) | |
443 | return 0; | |
444 | ||
445 | if (rt->fib6_nsiblings) | |
446 | err = call_fib6_multipath_entry_notifier(arg->nb, fib_event, | |
447 | rt, | |
448 | rt->fib6_nsiblings, | |
449 | arg->extack); | |
450 | else | |
451 | err = call_fib6_entry_notifier(arg->nb, fib_event, rt, | |
452 | arg->extack); | |
453 | ||
454 | return err; | |
455 | } | |
456 | ||
e1ee0a5b IS |
457 | static int fib6_node_dump(struct fib6_walker *w) |
458 | { | |
caafb250 | 459 | int err; |
9c6ecd3c | 460 | |
caafb250 | 461 | err = fib6_rt_dump(w->leaf, w->args); |
e1ee0a5b | 462 | w->leaf = NULL; |
55c894f7 | 463 | return err; |
e1ee0a5b IS |
464 | } |
465 | ||
55c894f7 JP |
466 | static int fib6_table_dump(struct net *net, struct fib6_table *tb, |
467 | struct fib6_walker *w) | |
e1ee0a5b | 468 | { |
55c894f7 JP |
469 | int err; |
470 | ||
e1ee0a5b | 471 | w->root = &tb->tb6_root; |
66f5d6ce | 472 | spin_lock_bh(&tb->tb6_lock); |
55c894f7 | 473 | err = fib6_walk(net, w); |
66f5d6ce | 474 | spin_unlock_bh(&tb->tb6_lock); |
55c894f7 | 475 | return err; |
e1ee0a5b IS |
476 | } |
477 | ||
478 | /* Called with rcu_read_lock() */ | |
b7a59557 JP |
479 | int fib6_tables_dump(struct net *net, struct notifier_block *nb, |
480 | struct netlink_ext_ack *extack) | |
e1ee0a5b IS |
481 | { |
482 | struct fib6_dump_arg arg; | |
483 | struct fib6_walker *w; | |
484 | unsigned int h; | |
55c894f7 | 485 | int err = 0; |
e1ee0a5b IS |
486 | |
487 | w = kzalloc(sizeof(*w), GFP_ATOMIC); | |
488 | if (!w) | |
489 | return -ENOMEM; | |
490 | ||
491 | w->func = fib6_node_dump; | |
492 | arg.net = net; | |
493 | arg.nb = nb; | |
b7a59557 | 494 | arg.extack = extack; |
e1ee0a5b IS |
495 | w->args = &arg; |
496 | ||
497 | for (h = 0; h < FIB6_TABLE_HASHSZ; h++) { | |
498 | struct hlist_head *head = &net->ipv6.fib_table_hash[h]; | |
499 | struct fib6_table *tb; | |
500 | ||
55c894f7 JP |
501 | hlist_for_each_entry_rcu(tb, head, tb6_hlist) { |
502 | err = fib6_table_dump(net, tb, w); | |
6f199552 | 503 | if (err) |
55c894f7 JP |
504 | goto out; |
505 | } | |
e1ee0a5b IS |
506 | } |
507 | ||
55c894f7 | 508 | out: |
e1ee0a5b IS |
509 | kfree(w); |
510 | ||
6f199552 VB |
511 | /* The tree traversal function should never return a positive value. */ |
512 | return err > 0 ? -EINVAL : err; | |
e1ee0a5b IS |
513 | } |
514 | ||
94b2cfe0 | 515 | static int fib6_dump_node(struct fib6_walker *w) |
1b43af54 PM |
516 | { |
517 | int res; | |
8d1c802b | 518 | struct fib6_info *rt; |
1b43af54 | 519 | |
66f5d6ce | 520 | for_each_fib6_walker_rt(w) { |
1e47b483 | 521 | res = rt6_dump_route(rt, w->args, w->skip_in_node); |
bf9a8a06 | 522 | if (res >= 0) { |
1b43af54 PM |
523 | /* Frame is full, suspend walking */ |
524 | w->leaf = rt; | |
1e47b483 SB |
525 | |
526 | /* We'll restart from this node, so if some routes were | |
527 | * already dumped, skip them next time. | |
528 | */ | |
529 | w->skip_in_node += res; | |
530 | ||
1b43af54 PM |
531 | return 1; |
532 | } | |
1e47b483 | 533 | w->skip_in_node = 0; |
beb1afac DA |
534 | |
535 | /* Multipath routes are dumped in one route with the | |
536 | * RTA_MULTIPATH attribute. Jump 'rt' to point to the | |
537 | * last sibling of this route (no need to dump the | |
538 | * sibling routes again) | |
539 | */ | |
93c2fb25 DA |
540 | if (rt->fib6_nsiblings) |
541 | rt = list_last_entry(&rt->fib6_siblings, | |
8d1c802b | 542 | struct fib6_info, |
93c2fb25 | 543 | fib6_siblings); |
1b43af54 PM |
544 | } |
545 | w->leaf = NULL; | |
546 | return 0; | |
547 | } | |
548 | ||
549 | static void fib6_dump_end(struct netlink_callback *cb) | |
550 | { | |
9a03cd8f | 551 | struct net *net = sock_net(cb->skb->sk); |
94b2cfe0 | 552 | struct fib6_walker *w = (void *)cb->args[2]; |
1b43af54 PM |
553 | |
554 | if (w) { | |
7891cc81 HX |
555 | if (cb->args[4]) { |
556 | cb->args[4] = 0; | |
9a03cd8f | 557 | fib6_walker_unlink(net, w); |
7891cc81 | 558 | } |
1b43af54 PM |
559 | cb->args[2] = 0; |
560 | kfree(w); | |
561 | } | |
437de07c | 562 | cb->done = (void *)cb->args[3]; |
1b43af54 PM |
563 | cb->args[1] = 3; |
564 | } | |
565 | ||
566 | static int fib6_dump_done(struct netlink_callback *cb) | |
567 | { | |
568 | fib6_dump_end(cb); | |
569 | return cb->done ? cb->done(cb) : 0; | |
570 | } | |
571 | ||
572 | static int fib6_dump_table(struct fib6_table *table, struct sk_buff *skb, | |
573 | struct netlink_callback *cb) | |
574 | { | |
9a03cd8f | 575 | struct net *net = sock_net(skb->sk); |
94b2cfe0 | 576 | struct fib6_walker *w; |
1b43af54 PM |
577 | int res; |
578 | ||
579 | w = (void *)cb->args[2]; | |
580 | w->root = &table->tb6_root; | |
581 | ||
582 | if (cb->args[4] == 0) { | |
2bec5a36 PM |
583 | w->count = 0; |
584 | w->skip = 0; | |
1e47b483 | 585 | w->skip_in_node = 0; |
2bec5a36 | 586 | |
66f5d6ce | 587 | spin_lock_bh(&table->tb6_lock); |
9a03cd8f | 588 | res = fib6_walk(net, w); |
66f5d6ce | 589 | spin_unlock_bh(&table->tb6_lock); |
2bec5a36 | 590 | if (res > 0) { |
1b43af54 | 591 | cb->args[4] = 1; |
aafc2e32 | 592 | cb->args[5] = READ_ONCE(w->root->fn_sernum); |
2bec5a36 | 593 | } |
1b43af54 | 594 | } else { |
aafc2e32 ED |
595 | int sernum = READ_ONCE(w->root->fn_sernum); |
596 | if (cb->args[5] != sernum) { | |
2bec5a36 | 597 | /* Begin at the root if the tree changed */ |
aafc2e32 | 598 | cb->args[5] = sernum; |
2bec5a36 PM |
599 | w->state = FWS_INIT; |
600 | w->node = w->root; | |
601 | w->skip = w->count; | |
1e47b483 | 602 | w->skip_in_node = 0; |
2bec5a36 PM |
603 | } else |
604 | w->skip = 0; | |
605 | ||
66f5d6ce | 606 | spin_lock_bh(&table->tb6_lock); |
1b43af54 | 607 | res = fib6_walk_continue(w); |
66f5d6ce | 608 | spin_unlock_bh(&table->tb6_lock); |
7891cc81 | 609 | if (res <= 0) { |
9a03cd8f | 610 | fib6_walker_unlink(net, w); |
7891cc81 | 611 | cb->args[4] = 0; |
1b43af54 | 612 | } |
1b43af54 | 613 | } |
7891cc81 | 614 | |
1b43af54 PM |
615 | return res; |
616 | } | |
617 | ||
c127ea2c | 618 | static int inet6_dump_fib(struct sk_buff *skb, struct netlink_callback *cb) |
1b43af54 | 619 | { |
564c91f7 SB |
620 | struct rt6_rtnl_dump_arg arg = { .filter.dump_exceptions = true, |
621 | .filter.dump_routes = true }; | |
e8ba330a | 622 | const struct nlmsghdr *nlh = cb->nlh; |
3b1e0a65 | 623 | struct net *net = sock_net(skb->sk); |
1b43af54 PM |
624 | unsigned int h, s_h; |
625 | unsigned int e = 0, s_e; | |
94b2cfe0 | 626 | struct fib6_walker *w; |
1b43af54 | 627 | struct fib6_table *tb; |
58f09b78 | 628 | struct hlist_head *head; |
1b43af54 PM |
629 | int res = 0; |
630 | ||
e8ba330a | 631 | if (cb->strict_check) { |
4724676d | 632 | int err; |
e8ba330a | 633 | |
effe6792 | 634 | err = ip_valid_fib_dump_req(net, nlh, &arg.filter, cb); |
e8ba330a DA |
635 | if (err < 0) |
636 | return err; | |
13e38901 DA |
637 | } else if (nlmsg_len(nlh) >= sizeof(struct rtmsg)) { |
638 | struct rtmsg *rtm = nlmsg_data(nlh); | |
e8ba330a | 639 | |
ef11209d SB |
640 | if (rtm->rtm_flags & RTM_F_PREFIX) |
641 | arg.filter.flags = RTM_F_PREFIX; | |
13e38901 | 642 | } |
1b43af54 PM |
643 | |
644 | w = (void *)cb->args[2]; | |
507c9b1e | 645 | if (!w) { |
1b43af54 PM |
646 | /* New dump: |
647 | * | |
648 | * 1. hook callback destructor. | |
649 | */ | |
650 | cb->args[3] = (long)cb->done; | |
651 | cb->done = fib6_dump_done; | |
652 | ||
653 | /* | |
654 | * 2. allocate and initialize walker. | |
655 | */ | |
656 | w = kzalloc(sizeof(*w), GFP_ATOMIC); | |
507c9b1e | 657 | if (!w) |
1b43af54 PM |
658 | return -ENOMEM; |
659 | w->func = fib6_dump_node; | |
660 | cb->args[2] = (long)w; | |
661 | } | |
662 | ||
663 | arg.skb = skb; | |
664 | arg.cb = cb; | |
191cd582 | 665 | arg.net = net; |
1b43af54 PM |
666 | w->args = &arg; |
667 | ||
13e38901 DA |
668 | if (arg.filter.table_id) { |
669 | tb = fib6_get_table(net, arg.filter.table_id); | |
670 | if (!tb) { | |
41b4bd98 | 671 | if (rtnl_msg_family(cb->nlh) != PF_INET6) |
e22d0bfa | 672 | goto out; |
ae677bbb | 673 | |
13e38901 DA |
674 | NL_SET_ERR_MSG_MOD(cb->extack, "FIB table does not exist"); |
675 | return -ENOENT; | |
676 | } | |
677 | ||
73155879 DA |
678 | if (!cb->args[0]) { |
679 | res = fib6_dump_table(tb, skb, cb); | |
680 | if (!res) | |
681 | cb->args[0] = 1; | |
682 | } | |
13e38901 DA |
683 | goto out; |
684 | } | |
685 | ||
686 | s_h = cb->args[0]; | |
687 | s_e = cb->args[1]; | |
688 | ||
e67f88dd | 689 | rcu_read_lock(); |
a33bc5c1 | 690 | for (h = s_h; h < FIB6_TABLE_HASHSZ; h++, s_e = 0) { |
1b43af54 | 691 | e = 0; |
58f09b78 | 692 | head = &net->ipv6.fib_table_hash[h]; |
b67bfe0d | 693 | hlist_for_each_entry_rcu(tb, head, tb6_hlist) { |
1b43af54 PM |
694 | if (e < s_e) |
695 | goto next; | |
696 | res = fib6_dump_table(tb, skb, cb); | |
697 | if (res != 0) | |
13e38901 | 698 | goto out_unlock; |
1b43af54 PM |
699 | next: |
700 | e++; | |
701 | } | |
702 | } | |
13e38901 | 703 | out_unlock: |
e67f88dd | 704 | rcu_read_unlock(); |
1b43af54 PM |
705 | cb->args[1] = e; |
706 | cb->args[0] = h; | |
13e38901 | 707 | out: |
1b43af54 PM |
708 | res = res < 0 ? res : skb->len; |
709 | if (res <= 0) | |
710 | fib6_dump_end(cb); | |
711 | return res; | |
712 | } | |
1da177e4 | 713 | |
8d1c802b | 714 | void fib6_metric_set(struct fib6_info *f6i, int metric, u32 val) |
d4ead6b3 DA |
715 | { |
716 | if (!f6i) | |
717 | return; | |
718 | ||
719 | if (f6i->fib6_metrics == &dst_default_metrics) { | |
720 | struct dst_metrics *p = kzalloc(sizeof(*p), GFP_ATOMIC); | |
721 | ||
722 | if (!p) | |
723 | return; | |
724 | ||
725 | refcount_set(&p->refcnt, 1); | |
726 | f6i->fib6_metrics = p; | |
727 | } | |
728 | ||
729 | f6i->fib6_metrics->metrics[metric - 1] = val; | |
730 | } | |
731 | ||
1da177e4 LT |
732 | /* |
733 | * Routing Table | |
734 | * | |
735 | * return the appropriate node for a routing tree "add" operation | |
736 | * by either creating and inserting or by returning an existing | |
737 | * node. | |
738 | */ | |
739 | ||
81eb8447 WW |
740 | static struct fib6_node *fib6_add_1(struct net *net, |
741 | struct fib6_table *table, | |
66f5d6ce WW |
742 | struct fib6_node *root, |
743 | struct in6_addr *addr, int plen, | |
744 | int offset, int allow_create, | |
745 | int replace_required, | |
746 | struct netlink_ext_ack *extack) | |
1da177e4 LT |
747 | { |
748 | struct fib6_node *fn, *in, *ln; | |
749 | struct fib6_node *pn = NULL; | |
750 | struct rt6key *key; | |
751 | int bit; | |
1ab1457c | 752 | __be32 dir = 0; |
1da177e4 LT |
753 | |
754 | RT6_TRACE("fib6_add_1\n"); | |
755 | ||
756 | /* insert node in tree */ | |
757 | ||
758 | fn = root; | |
759 | ||
760 | do { | |
8d1c802b | 761 | struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, |
66f5d6ce WW |
762 | lockdep_is_held(&table->tb6_lock)); |
763 | key = (struct rt6key *)((u8 *)leaf + offset); | |
1da177e4 LT |
764 | |
765 | /* | |
766 | * Prefix match | |
767 | */ | |
768 | if (plen < fn->fn_bit || | |
4a287eba | 769 | !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) { |
14df015b MV |
770 | if (!allow_create) { |
771 | if (replace_required) { | |
d5d531cb DA |
772 | NL_SET_ERR_MSG(extack, |
773 | "Can not replace route - no match found"); | |
f3213831 | 774 | pr_warn("Can't replace route, no match found\n"); |
14df015b MV |
775 | return ERR_PTR(-ENOENT); |
776 | } | |
f3213831 | 777 | pr_warn("NLM_F_CREATE should be set when creating new route\n"); |
14df015b | 778 | } |
1da177e4 | 779 | goto insert_above; |
4a287eba | 780 | } |
1ab1457c | 781 | |
1da177e4 LT |
782 | /* |
783 | * Exact match ? | |
784 | */ | |
1ab1457c | 785 | |
1da177e4 LT |
786 | if (plen == fn->fn_bit) { |
787 | /* clean up an intermediate node */ | |
507c9b1e | 788 | if (!(fn->fn_flags & RTN_RTINFO)) { |
66f5d6ce | 789 | RCU_INIT_POINTER(fn->leaf, NULL); |
93531c67 | 790 | fib6_info_release(leaf); |
4512c43e WW |
791 | /* remove null_entry in the root node */ |
792 | } else if (fn->fn_flags & RTN_TL_ROOT && | |
793 | rcu_access_pointer(fn->leaf) == | |
421842ed | 794 | net->ipv6.fib6_null_entry) { |
4512c43e | 795 | RCU_INIT_POINTER(fn->leaf, NULL); |
1da177e4 | 796 | } |
1ab1457c | 797 | |
1da177e4 LT |
798 | return fn; |
799 | } | |
800 | ||
801 | /* | |
802 | * We have more bits to go | |
803 | */ | |
1ab1457c | 804 | |
1da177e4 | 805 | /* Try to walk down on tree. */ |
1da177e4 LT |
806 | dir = addr_bit_set(addr, fn->fn_bit); |
807 | pn = fn; | |
66f5d6ce WW |
808 | fn = dir ? |
809 | rcu_dereference_protected(fn->right, | |
810 | lockdep_is_held(&table->tb6_lock)) : | |
811 | rcu_dereference_protected(fn->left, | |
812 | lockdep_is_held(&table->tb6_lock)); | |
1da177e4 LT |
813 | } while (fn); |
814 | ||
14df015b | 815 | if (!allow_create) { |
4a287eba MV |
816 | /* We should not create new node because |
817 | * NLM_F_REPLACE was specified without NLM_F_CREATE | |
818 | * I assume it is safe to require NLM_F_CREATE when | |
819 | * REPLACE flag is used! Later we may want to remove the | |
820 | * check for replace_required, because according | |
821 | * to netlink specification, NLM_F_CREATE | |
822 | * MUST be specified if new route is created. | |
823 | * That would keep IPv6 consistent with IPv4 | |
824 | */ | |
14df015b | 825 | if (replace_required) { |
d5d531cb DA |
826 | NL_SET_ERR_MSG(extack, |
827 | "Can not replace route - no match found"); | |
f3213831 | 828 | pr_warn("Can't replace route, no match found\n"); |
14df015b MV |
829 | return ERR_PTR(-ENOENT); |
830 | } | |
f3213831 | 831 | pr_warn("NLM_F_CREATE should be set when creating new route\n"); |
4a287eba | 832 | } |
1da177e4 LT |
833 | /* |
834 | * We walked to the bottom of tree. | |
835 | * Create new leaf node without children. | |
836 | */ | |
837 | ||
81eb8447 | 838 | ln = node_alloc(net); |
1da177e4 | 839 | |
507c9b1e | 840 | if (!ln) |
188c517a | 841 | return ERR_PTR(-ENOMEM); |
1da177e4 | 842 | ln->fn_bit = plen; |
66f5d6ce | 843 | RCU_INIT_POINTER(ln->parent, pn); |
1da177e4 LT |
844 | |
845 | if (dir) | |
66f5d6ce | 846 | rcu_assign_pointer(pn->right, ln); |
1da177e4 | 847 | else |
66f5d6ce | 848 | rcu_assign_pointer(pn->left, ln); |
1da177e4 LT |
849 | |
850 | return ln; | |
851 | ||
852 | ||
853 | insert_above: | |
854 | /* | |
1ab1457c | 855 | * split since we don't have a common prefix anymore or |
1da177e4 LT |
856 | * we have a less significant route. |
857 | * we've to insert an intermediate node on the list | |
858 | * this new node will point to the one we need to create | |
859 | * and the current | |
860 | */ | |
861 | ||
66f5d6ce WW |
862 | pn = rcu_dereference_protected(fn->parent, |
863 | lockdep_is_held(&table->tb6_lock)); | |
1da177e4 LT |
864 | |
865 | /* find 1st bit in difference between the 2 addrs. | |
866 | ||
971f359d | 867 | See comment in __ipv6_addr_diff: bit may be an invalid value, |
1da177e4 LT |
868 | but if it is >= plen, the value is ignored in any case. |
869 | */ | |
1ab1457c | 870 | |
9225b230 | 871 | bit = __ipv6_addr_diff(addr, &key->addr, sizeof(*addr)); |
1da177e4 | 872 | |
1ab1457c YH |
873 | /* |
874 | * (intermediate)[in] | |
1da177e4 LT |
875 | * / \ |
876 | * (new leaf node)[ln] (old node)[fn] | |
877 | */ | |
878 | if (plen > bit) { | |
81eb8447 WW |
879 | in = node_alloc(net); |
880 | ln = node_alloc(net); | |
1ab1457c | 881 | |
507c9b1e | 882 | if (!in || !ln) { |
1da177e4 | 883 | if (in) |
81eb8447 | 884 | node_free_immediate(net, in); |
1da177e4 | 885 | if (ln) |
81eb8447 | 886 | node_free_immediate(net, ln); |
188c517a | 887 | return ERR_PTR(-ENOMEM); |
1da177e4 LT |
888 | } |
889 | ||
1ab1457c YH |
890 | /* |
891 | * new intermediate node. | |
1da177e4 LT |
892 | * RTN_RTINFO will |
893 | * be off since that an address that chooses one of | |
894 | * the branches would not match less specific routes | |
895 | * in the other branch | |
896 | */ | |
897 | ||
898 | in->fn_bit = bit; | |
899 | ||
66f5d6ce | 900 | RCU_INIT_POINTER(in->parent, pn); |
1da177e4 | 901 | in->leaf = fn->leaf; |
5ea71528 ED |
902 | fib6_info_hold(rcu_dereference_protected(in->leaf, |
903 | lockdep_is_held(&table->tb6_lock))); | |
1da177e4 | 904 | |
1da177e4 LT |
905 | /* update parent pointer */ |
906 | if (dir) | |
66f5d6ce | 907 | rcu_assign_pointer(pn->right, in); |
1da177e4 | 908 | else |
66f5d6ce | 909 | rcu_assign_pointer(pn->left, in); |
1da177e4 LT |
910 | |
911 | ln->fn_bit = plen; | |
912 | ||
66f5d6ce WW |
913 | RCU_INIT_POINTER(ln->parent, in); |
914 | rcu_assign_pointer(fn->parent, in); | |
1da177e4 | 915 | |
1da177e4 | 916 | if (addr_bit_set(addr, bit)) { |
66f5d6ce WW |
917 | rcu_assign_pointer(in->right, ln); |
918 | rcu_assign_pointer(in->left, fn); | |
1da177e4 | 919 | } else { |
66f5d6ce WW |
920 | rcu_assign_pointer(in->left, ln); |
921 | rcu_assign_pointer(in->right, fn); | |
1da177e4 LT |
922 | } |
923 | } else { /* plen <= bit */ | |
924 | ||
1ab1457c | 925 | /* |
1da177e4 LT |
926 | * (new leaf node)[ln] |
927 | * / \ | |
928 | * (old node)[fn] NULL | |
929 | */ | |
930 | ||
81eb8447 | 931 | ln = node_alloc(net); |
1da177e4 | 932 | |
507c9b1e | 933 | if (!ln) |
188c517a | 934 | return ERR_PTR(-ENOMEM); |
1da177e4 LT |
935 | |
936 | ln->fn_bit = plen; | |
937 | ||
66f5d6ce | 938 | RCU_INIT_POINTER(ln->parent, pn); |
1da177e4 LT |
939 | |
940 | if (addr_bit_set(&key->addr, plen)) | |
66f5d6ce | 941 | RCU_INIT_POINTER(ln->right, fn); |
1da177e4 | 942 | else |
66f5d6ce WW |
943 | RCU_INIT_POINTER(ln->left, fn); |
944 | ||
945 | rcu_assign_pointer(fn->parent, ln); | |
1da177e4 | 946 | |
66f5d6ce WW |
947 | if (dir) |
948 | rcu_assign_pointer(pn->right, ln); | |
949 | else | |
950 | rcu_assign_pointer(pn->left, ln); | |
1da177e4 LT |
951 | } |
952 | return ln; | |
953 | } | |
954 | ||
7d88d8b5 DA |
955 | static void __fib6_drop_pcpu_from(struct fib6_nh *fib6_nh, |
956 | const struct fib6_info *match, | |
957 | const struct fib6_table *table) | |
e715b6d3 | 958 | { |
5bcaa41b | 959 | int cpu; |
e715b6d3 | 960 | |
f40b6ae2 DA |
961 | if (!fib6_nh->rt6i_pcpu) |
962 | return; | |
963 | ||
5bcaa41b DA |
964 | /* release the reference to this fib entry from |
965 | * all of its cached pcpu routes | |
966 | */ | |
967 | for_each_possible_cpu(cpu) { | |
968 | struct rt6_info **ppcpu_rt; | |
969 | struct rt6_info *pcpu_rt; | |
e715b6d3 | 970 | |
f40b6ae2 | 971 | ppcpu_rt = per_cpu_ptr(fib6_nh->rt6i_pcpu, cpu); |
5bcaa41b | 972 | pcpu_rt = *ppcpu_rt; |
7d88d8b5 DA |
973 | |
974 | /* only dropping the 'from' reference if the cached route | |
975 | * is using 'match'. The cached pcpu_rt->from only changes | |
976 | * from a fib6_info to NULL (ip6_dst_destroy); it can never | |
977 | * change from one fib6_info reference to another | |
978 | */ | |
979 | if (pcpu_rt && rcu_access_pointer(pcpu_rt->from) == match) { | |
a68886a6 | 980 | struct fib6_info *from; |
e715b6d3 | 981 | |
0e233874 | 982 | from = xchg((__force struct fib6_info **)&pcpu_rt->from, NULL); |
a68886a6 | 983 | fib6_info_release(from); |
5bcaa41b | 984 | } |
e5fd387a | 985 | } |
e5fd387a MK |
986 | } |
987 | ||
2ab75bfb DA |
988 | struct fib6_nh_pcpu_arg { |
989 | struct fib6_info *from; | |
990 | const struct fib6_table *table; | |
991 | }; | |
992 | ||
993 | static int fib6_nh_drop_pcpu_from(struct fib6_nh *nh, void *_arg) | |
994 | { | |
995 | struct fib6_nh_pcpu_arg *arg = _arg; | |
996 | ||
997 | __fib6_drop_pcpu_from(nh, arg->from, arg->table); | |
998 | return 0; | |
999 | } | |
1000 | ||
7d88d8b5 DA |
1001 | static void fib6_drop_pcpu_from(struct fib6_info *f6i, |
1002 | const struct fib6_table *table) | |
1003 | { | |
7d88d8b5 DA |
1004 | /* Make sure rt6_make_pcpu_route() wont add other percpu routes |
1005 | * while we are cleaning them here. | |
1006 | */ | |
1007 | f6i->fib6_destroying = 1; | |
1008 | mb(); /* paired with the cmpxchg() in rt6_make_pcpu_route() */ | |
1009 | ||
2ab75bfb DA |
1010 | if (f6i->nh) { |
1011 | struct fib6_nh_pcpu_arg arg = { | |
1012 | .from = f6i, | |
1013 | .table = table | |
1014 | }; | |
1015 | ||
1016 | nexthop_for_each_fib6_nh(f6i->nh, fib6_nh_drop_pcpu_from, | |
1017 | &arg); | |
1018 | } else { | |
1019 | struct fib6_nh *fib6_nh; | |
1020 | ||
1021 | fib6_nh = f6i->fib6_nh; | |
1022 | __fib6_drop_pcpu_from(fib6_nh, f6i, table); | |
1023 | } | |
7d88d8b5 DA |
1024 | } |
1025 | ||
8d1c802b | 1026 | static void fib6_purge_rt(struct fib6_info *rt, struct fib6_node *fn, |
6e9e16e6 HFS |
1027 | struct net *net) |
1028 | { | |
93c2fb25 | 1029 | struct fib6_table *table = rt->fib6_table; |
66f5d6ce | 1030 | |
d8f5c296 ST |
1031 | /* Flush all cached dst in exception table */ |
1032 | rt6_flush_exceptions(rt); | |
f40b6ae2 | 1033 | fib6_drop_pcpu_from(rt, table); |
61fb0d01 | 1034 | |
f88d8ea6 DA |
1035 | if (rt->nh && !list_empty(&rt->nh_list)) |
1036 | list_del_init(&rt->nh_list); | |
1037 | ||
f05713e0 | 1038 | if (refcount_read(&rt->fib6_ref) != 1) { |
6e9e16e6 HFS |
1039 | /* This route is used as dummy address holder in some split |
1040 | * nodes. It is not leaked, but it still holds other resources, | |
1041 | * which must be released in time. So, scan ascendant nodes | |
1042 | * and replace dummy references to this route with references | |
1043 | * to still alive ones. | |
1044 | */ | |
1045 | while (fn) { | |
8d1c802b | 1046 | struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, |
66f5d6ce | 1047 | lockdep_is_held(&table->tb6_lock)); |
8d1c802b | 1048 | struct fib6_info *new_leaf; |
66f5d6ce WW |
1049 | if (!(fn->fn_flags & RTN_RTINFO) && leaf == rt) { |
1050 | new_leaf = fib6_find_prefix(net, table, fn); | |
5ea71528 | 1051 | fib6_info_hold(new_leaf); |
93531c67 | 1052 | |
66f5d6ce | 1053 | rcu_assign_pointer(fn->leaf, new_leaf); |
93531c67 | 1054 | fib6_info_release(rt); |
6e9e16e6 | 1055 | } |
66f5d6ce WW |
1056 | fn = rcu_dereference_protected(fn->parent, |
1057 | lockdep_is_held(&table->tb6_lock)); | |
6e9e16e6 | 1058 | } |
6e9e16e6 HFS |
1059 | } |
1060 | } | |
1061 | ||
1da177e4 LT |
1062 | /* |
1063 | * Insert routing information in a node. | |
1064 | */ | |
1065 | ||
8d1c802b | 1066 | static int fib6_add_rt2node(struct fib6_node *fn, struct fib6_info *rt, |
d4ead6b3 | 1067 | struct nl_info *info, |
6c31e5a9 | 1068 | struct netlink_ext_ack *extack) |
1da177e4 | 1069 | { |
8d1c802b | 1070 | struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, |
93c2fb25 | 1071 | lockdep_is_held(&rt->fib6_table->tb6_lock)); |
33bd5ac5 | 1072 | struct fib6_info *iter = NULL; |
8d1c802b | 1073 | struct fib6_info __rcu **ins; |
33bd5ac5 | 1074 | struct fib6_info __rcu **fallback_ins = NULL; |
507c9b1e DM |
1075 | int replace = (info->nlh && |
1076 | (info->nlh->nlmsg_flags & NLM_F_REPLACE)); | |
1077 | int add = (!info->nlh || | |
1078 | (info->nlh->nlmsg_flags & NLM_F_CREATE)); | |
4a287eba | 1079 | int found = 0; |
33bd5ac5 | 1080 | bool rt_can_ecmp = rt6_qualify_for_ecmp(rt); |
c10c4279 | 1081 | bool notify_sibling_rt = false; |
73483c12 | 1082 | u16 nlflags = NLM_F_EXCL; |
e5fd387a | 1083 | int err; |
1da177e4 | 1084 | |
33bd5ac5 | 1085 | if (info->nlh && (info->nlh->nlmsg_flags & NLM_F_APPEND)) |
1f5e29ce DA |
1086 | nlflags |= NLM_F_APPEND; |
1087 | ||
1da177e4 LT |
1088 | ins = &fn->leaf; |
1089 | ||
66f5d6ce | 1090 | for (iter = leaf; iter; |
8fb11a9a | 1091 | iter = rcu_dereference_protected(iter->fib6_next, |
93c2fb25 | 1092 | lockdep_is_held(&rt->fib6_table->tb6_lock))) { |
1da177e4 LT |
1093 | /* |
1094 | * Search for duplicates | |
1095 | */ | |
1096 | ||
93c2fb25 | 1097 | if (iter->fib6_metric == rt->fib6_metric) { |
1da177e4 LT |
1098 | /* |
1099 | * Same priority level | |
1100 | */ | |
507c9b1e DM |
1101 | if (info->nlh && |
1102 | (info->nlh->nlmsg_flags & NLM_F_EXCL)) | |
4a287eba | 1103 | return -EEXIST; |
73483c12 GN |
1104 | |
1105 | nlflags &= ~NLM_F_EXCL; | |
4a287eba | 1106 | if (replace) { |
33bd5ac5 DA |
1107 | if (rt_can_ecmp == rt6_qualify_for_ecmp(iter)) { |
1108 | found++; | |
1109 | break; | |
1110 | } | |
e404b8c7 | 1111 | fallback_ins = fallback_ins ?: ins; |
33bd5ac5 | 1112 | goto next_iter; |
4a287eba | 1113 | } |
1da177e4 | 1114 | |
f06b7549 | 1115 | if (rt6_duplicate_nexthop(iter, rt)) { |
93c2fb25 DA |
1116 | if (rt->fib6_nsiblings) |
1117 | rt->fib6_nsiblings = 0; | |
1118 | if (!(iter->fib6_flags & RTF_EXPIRES)) | |
1da177e4 | 1119 | return -EEXIST; |
93c2fb25 | 1120 | if (!(rt->fib6_flags & RTF_EXPIRES)) |
14895687 | 1121 | fib6_clean_expires(iter); |
1716a961 | 1122 | else |
14895687 | 1123 | fib6_set_expires(iter, rt->expires); |
15a81b41 DA |
1124 | |
1125 | if (rt->fib6_pmtu) | |
1126 | fib6_metric_set(iter, RTAX_MTU, | |
1127 | rt->fib6_pmtu); | |
1da177e4 LT |
1128 | return -EEXIST; |
1129 | } | |
33bd5ac5 DA |
1130 | /* If we have the same destination and the same metric, |
1131 | * but not the same gateway, then the route we try to | |
1132 | * add is sibling to this route, increment our counter | |
1133 | * of siblings, and later we will add our route to the | |
1134 | * list. | |
1135 | * Only static routes (which don't have flag | |
1136 | * RTF_EXPIRES) are used for ECMPv6. | |
1137 | * | |
1138 | * To avoid long list, we only had siblings if the | |
1139 | * route have a gateway. | |
1140 | */ | |
1141 | if (rt_can_ecmp && | |
1142 | rt6_qualify_for_ecmp(iter)) | |
1143 | rt->fib6_nsiblings++; | |
1da177e4 LT |
1144 | } |
1145 | ||
93c2fb25 | 1146 | if (iter->fib6_metric > rt->fib6_metric) |
1da177e4 LT |
1147 | break; |
1148 | ||
33bd5ac5 | 1149 | next_iter: |
8fb11a9a | 1150 | ins = &iter->fib6_next; |
27596472 MK |
1151 | } |
1152 | ||
33bd5ac5 | 1153 | if (fallback_ins && !found) { |
e404b8c7 BP |
1154 | /* No matching route with same ecmp-able-ness found, replace |
1155 | * first matching route | |
1156 | */ | |
33bd5ac5 DA |
1157 | ins = fallback_ins; |
1158 | iter = rcu_dereference_protected(*ins, | |
1159 | lockdep_is_held(&rt->fib6_table->tb6_lock)); | |
1160 | found++; | |
1161 | } | |
1162 | ||
f11e6659 DM |
1163 | /* Reset round-robin state, if necessary */ |
1164 | if (ins == &fn->leaf) | |
1165 | fn->rr_ptr = NULL; | |
1166 | ||
51ebd318 | 1167 | /* Link this route to others same route. */ |
33bd5ac5 DA |
1168 | if (rt->fib6_nsiblings) { |
1169 | unsigned int fib6_nsiblings; | |
8d1c802b | 1170 | struct fib6_info *sibling, *temp_sibling; |
51ebd318 | 1171 | |
33bd5ac5 DA |
1172 | /* Find the first route that have the same metric */ |
1173 | sibling = leaf; | |
c10c4279 | 1174 | notify_sibling_rt = true; |
33bd5ac5 DA |
1175 | while (sibling) { |
1176 | if (sibling->fib6_metric == rt->fib6_metric && | |
1177 | rt6_qualify_for_ecmp(sibling)) { | |
1178 | list_add_tail(&rt->fib6_siblings, | |
1179 | &sibling->fib6_siblings); | |
1180 | break; | |
1181 | } | |
1182 | sibling = rcu_dereference_protected(sibling->fib6_next, | |
1183 | lockdep_is_held(&rt->fib6_table->tb6_lock)); | |
c10c4279 | 1184 | notify_sibling_rt = false; |
51ebd318 ND |
1185 | } |
1186 | /* For each sibling in the list, increment the counter of | |
1187 | * siblings. BUG() if counters does not match, list of siblings | |
1188 | * is broken! | |
1189 | */ | |
33bd5ac5 | 1190 | fib6_nsiblings = 0; |
51ebd318 | 1191 | list_for_each_entry_safe(sibling, temp_sibling, |
33bd5ac5 | 1192 | &rt->fib6_siblings, fib6_siblings) { |
93c2fb25 | 1193 | sibling->fib6_nsiblings++; |
33bd5ac5 DA |
1194 | BUG_ON(sibling->fib6_nsiblings != rt->fib6_nsiblings); |
1195 | fib6_nsiblings++; | |
51ebd318 | 1196 | } |
33bd5ac5 DA |
1197 | BUG_ON(fib6_nsiblings != rt->fib6_nsiblings); |
1198 | rt6_multipath_rebalance(temp_sibling); | |
51ebd318 ND |
1199 | } |
1200 | ||
1da177e4 LT |
1201 | /* |
1202 | * insert node | |
1203 | */ | |
4a287eba MV |
1204 | if (!replace) { |
1205 | if (!add) | |
f3213831 | 1206 | pr_warn("NLM_F_CREATE should be set when creating new route\n"); |
4a287eba MV |
1207 | |
1208 | add: | |
73483c12 | 1209 | nlflags |= NLM_F_CREATE; |
e715b6d3 | 1210 | |
caafb250 IS |
1211 | /* The route should only be notified if it is the first |
1212 | * route in the node or if it is added as a sibling | |
1213 | * route to the first route in the node. | |
1214 | */ | |
1215 | if (!info->skip_notify_kernel && | |
1216 | (notify_sibling_rt || ins == &fn->leaf)) { | |
c10c4279 IS |
1217 | enum fib_event_type fib_event; |
1218 | ||
1219 | if (notify_sibling_rt) | |
1220 | fib_event = FIB_EVENT_ENTRY_APPEND; | |
1221 | else | |
caafb250 | 1222 | fib_event = FIB_EVENT_ENTRY_REPLACE; |
d5382fef | 1223 | err = call_fib6_entry_notifiers(info->nl_net, |
caafb250 IS |
1224 | fib_event, rt, |
1225 | extack); | |
54851aa9 IS |
1226 | if (err) { |
1227 | struct fib6_info *sibling, *next_sibling; | |
1228 | ||
1229 | /* If the route has siblings, then it first | |
1230 | * needs to be unlinked from them. | |
1231 | */ | |
1232 | if (!rt->fib6_nsiblings) | |
1233 | return err; | |
1234 | ||
1235 | list_for_each_entry_safe(sibling, next_sibling, | |
1236 | &rt->fib6_siblings, | |
1237 | fib6_siblings) | |
1238 | sibling->fib6_nsiblings--; | |
1239 | rt->fib6_nsiblings = 0; | |
1240 | list_del_init(&rt->fib6_siblings); | |
1241 | rt6_multipath_rebalance(next_sibling); | |
d5382fef | 1242 | return err; |
54851aa9 | 1243 | } |
d5382fef | 1244 | } |
2233000c | 1245 | |
8fb11a9a | 1246 | rcu_assign_pointer(rt->fib6_next, iter); |
5ea71528 | 1247 | fib6_info_hold(rt); |
93c2fb25 | 1248 | rcu_assign_pointer(rt->fib6_node, fn); |
66f5d6ce | 1249 | rcu_assign_pointer(*ins, rt); |
3b1137fe DA |
1250 | if (!info->skip_notify) |
1251 | inet6_rt_notify(RTM_NEWROUTE, rt, info, nlflags); | |
4a287eba MV |
1252 | info->nl_net->ipv6.rt6_stats->fib_rt_entries++; |
1253 | ||
507c9b1e | 1254 | if (!(fn->fn_flags & RTN_RTINFO)) { |
4a287eba MV |
1255 | info->nl_net->ipv6.rt6_stats->fib_route_nodes++; |
1256 | fn->fn_flags |= RTN_RTINFO; | |
1257 | } | |
1da177e4 | 1258 | |
4a287eba | 1259 | } else { |
33bd5ac5 | 1260 | int nsiblings; |
27596472 | 1261 | |
4a287eba MV |
1262 | if (!found) { |
1263 | if (add) | |
1264 | goto add; | |
f3213831 | 1265 | pr_warn("NLM_F_REPLACE set, but no existing node found!\n"); |
4a287eba MV |
1266 | return -ENOENT; |
1267 | } | |
e715b6d3 | 1268 | |
caafb250 | 1269 | if (!info->skip_notify_kernel && ins == &fn->leaf) { |
d5382fef IS |
1270 | err = call_fib6_entry_notifiers(info->nl_net, |
1271 | FIB_EVENT_ENTRY_REPLACE, | |
1272 | rt, extack); | |
1273 | if (err) | |
1274 | return err; | |
1275 | } | |
2233000c | 1276 | |
5ea71528 | 1277 | fib6_info_hold(rt); |
93c2fb25 | 1278 | rcu_assign_pointer(rt->fib6_node, fn); |
33bd5ac5 | 1279 | rt->fib6_next = iter->fib6_next; |
66f5d6ce | 1280 | rcu_assign_pointer(*ins, rt); |
3b1137fe DA |
1281 | if (!info->skip_notify) |
1282 | inet6_rt_notify(RTM_NEWROUTE, rt, info, NLM_F_REPLACE); | |
507c9b1e | 1283 | if (!(fn->fn_flags & RTN_RTINFO)) { |
4a287eba MV |
1284 | info->nl_net->ipv6.rt6_stats->fib_route_nodes++; |
1285 | fn->fn_flags |= RTN_RTINFO; | |
1286 | } | |
33bd5ac5 DA |
1287 | nsiblings = iter->fib6_nsiblings; |
1288 | iter->fib6_node = NULL; | |
1289 | fib6_purge_rt(iter, fn, info->nl_net); | |
1290 | if (rcu_access_pointer(fn->rr_ptr) == iter) | |
1291 | fn->rr_ptr = NULL; | |
1292 | fib6_info_release(iter); | |
27596472 | 1293 | |
33bd5ac5 | 1294 | if (nsiblings) { |
27596472 | 1295 | /* Replacing an ECMP route, remove all siblings */ |
33bd5ac5 DA |
1296 | ins = &rt->fib6_next; |
1297 | iter = rcu_dereference_protected(*ins, | |
1298 | lockdep_is_held(&rt->fib6_table->tb6_lock)); | |
1299 | while (iter) { | |
1300 | if (iter->fib6_metric > rt->fib6_metric) | |
1301 | break; | |
1302 | if (rt6_qualify_for_ecmp(iter)) { | |
1303 | *ins = iter->fib6_next; | |
1304 | iter->fib6_node = NULL; | |
1305 | fib6_purge_rt(iter, fn, info->nl_net); | |
1306 | if (rcu_access_pointer(fn->rr_ptr) == iter) | |
1307 | fn->rr_ptr = NULL; | |
1308 | fib6_info_release(iter); | |
1309 | nsiblings--; | |
1310 | info->nl_net->ipv6.rt6_stats->fib_rt_entries--; | |
1311 | } else { | |
1312 | ins = &iter->fib6_next; | |
1313 | } | |
1314 | iter = rcu_dereference_protected(*ins, | |
1315 | lockdep_is_held(&rt->fib6_table->tb6_lock)); | |
27596472 | 1316 | } |
33bd5ac5 | 1317 | WARN_ON(nsiblings != 0); |
27596472 | 1318 | } |
1da177e4 LT |
1319 | } |
1320 | ||
1321 | return 0; | |
1322 | } | |
1323 | ||
8d1c802b | 1324 | static void fib6_start_gc(struct net *net, struct fib6_info *rt) |
1da177e4 | 1325 | { |
417f28bb | 1326 | if (!timer_pending(&net->ipv6.ip6_fib_timer) && |
93c2fb25 | 1327 | (rt->fib6_flags & RTF_EXPIRES)) |
417f28bb | 1328 | mod_timer(&net->ipv6.ip6_fib_timer, |
847499ce | 1329 | jiffies + net->ipv6.sysctl.ip6_rt_gc_interval); |
1da177e4 LT |
1330 | } |
1331 | ||
63152fc0 | 1332 | void fib6_force_start_gc(struct net *net) |
1da177e4 | 1333 | { |
417f28bb SH |
1334 | if (!timer_pending(&net->ipv6.ip6_fib_timer)) |
1335 | mod_timer(&net->ipv6.ip6_fib_timer, | |
847499ce | 1336 | jiffies + net->ipv6.sysctl.ip6_rt_gc_interval); |
1da177e4 LT |
1337 | } |
1338 | ||
8d1c802b | 1339 | static void __fib6_update_sernum_upto_root(struct fib6_info *rt, |
4a8e56ee | 1340 | int sernum) |
bbd63f06 | 1341 | { |
93c2fb25 DA |
1342 | struct fib6_node *fn = rcu_dereference_protected(rt->fib6_node, |
1343 | lockdep_is_held(&rt->fib6_table->tb6_lock)); | |
bbd63f06 | 1344 | |
446e7f21 | 1345 | /* paired with smp_rmb() in fib6_get_cookie_safe() */ |
bbd63f06 WW |
1346 | smp_wmb(); |
1347 | while (fn) { | |
aafc2e32 | 1348 | WRITE_ONCE(fn->fn_sernum, sernum); |
66f5d6ce | 1349 | fn = rcu_dereference_protected(fn->parent, |
93c2fb25 | 1350 | lockdep_is_held(&rt->fib6_table->tb6_lock)); |
bbd63f06 WW |
1351 | } |
1352 | } | |
1353 | ||
8d1c802b | 1354 | void fib6_update_sernum_upto_root(struct net *net, struct fib6_info *rt) |
4a8e56ee IS |
1355 | { |
1356 | __fib6_update_sernum_upto_root(rt, fib6_new_sernum(net)); | |
1357 | } | |
1358 | ||
cdaa16a4 DA |
1359 | /* allow ipv4 to update sernum via ipv6_stub */ |
1360 | void fib6_update_sernum_stub(struct net *net, struct fib6_info *f6i) | |
1361 | { | |
1362 | spin_lock_bh(&f6i->fib6_table->tb6_lock); | |
1363 | fib6_update_sernum_upto_root(net, f6i); | |
1364 | spin_unlock_bh(&f6i->fib6_table->tb6_lock); | |
1365 | } | |
1366 | ||
1da177e4 LT |
1367 | /* |
1368 | * Add routing information to the routing tree. | |
1369 | * <destination addr>/<source addr> | |
1370 | * with source addr info in sub-trees | |
66f5d6ce | 1371 | * Need to own table->tb6_lock |
1da177e4 LT |
1372 | */ |
1373 | ||
8d1c802b | 1374 | int fib6_add(struct fib6_node *root, struct fib6_info *rt, |
d4ead6b3 | 1375 | struct nl_info *info, struct netlink_ext_ack *extack) |
1da177e4 | 1376 | { |
93c2fb25 | 1377 | struct fib6_table *table = rt->fib6_table; |
66729e18 | 1378 | struct fib6_node *fn, *pn = NULL; |
1da177e4 | 1379 | int err = -ENOMEM; |
4a287eba MV |
1380 | int allow_create = 1; |
1381 | int replace_required = 0; | |
507c9b1e DM |
1382 | |
1383 | if (info->nlh) { | |
1384 | if (!(info->nlh->nlmsg_flags & NLM_F_CREATE)) | |
4a287eba | 1385 | allow_create = 0; |
507c9b1e | 1386 | if (info->nlh->nlmsg_flags & NLM_F_REPLACE) |
4a287eba MV |
1387 | replace_required = 1; |
1388 | } | |
1389 | if (!allow_create && !replace_required) | |
f3213831 | 1390 | pr_warn("RTM_NEWROUTE with no NLM_F_CREATE or NLM_F_REPLACE\n"); |
1da177e4 | 1391 | |
81eb8447 | 1392 | fn = fib6_add_1(info->nl_net, table, root, |
93c2fb25 DA |
1393 | &rt->fib6_dst.addr, rt->fib6_dst.plen, |
1394 | offsetof(struct fib6_info, fib6_dst), allow_create, | |
bbd63f06 | 1395 | replace_required, extack); |
4a287eba MV |
1396 | if (IS_ERR(fn)) { |
1397 | err = PTR_ERR(fn); | |
ae7b4e1f | 1398 | fn = NULL; |
1da177e4 | 1399 | goto out; |
188c517a | 1400 | } |
1da177e4 | 1401 | |
66729e18 YH |
1402 | pn = fn; |
1403 | ||
1da177e4 | 1404 | #ifdef CONFIG_IPV6_SUBTREES |
93c2fb25 | 1405 | if (rt->fib6_src.plen) { |
1da177e4 LT |
1406 | struct fib6_node *sn; |
1407 | ||
66f5d6ce | 1408 | if (!rcu_access_pointer(fn->subtree)) { |
1da177e4 LT |
1409 | struct fib6_node *sfn; |
1410 | ||
1411 | /* | |
1412 | * Create subtree. | |
1413 | * | |
1414 | * fn[main tree] | |
1415 | * | | |
1416 | * sfn[subtree root] | |
1417 | * \ | |
1418 | * sn[new leaf node] | |
1419 | */ | |
1420 | ||
1421 | /* Create subtree root node */ | |
81eb8447 | 1422 | sfn = node_alloc(info->nl_net); |
507c9b1e | 1423 | if (!sfn) |
348a4002 | 1424 | goto failure; |
1da177e4 | 1425 | |
5ea71528 | 1426 | fib6_info_hold(info->nl_net->ipv6.fib6_null_entry); |
66f5d6ce | 1427 | rcu_assign_pointer(sfn->leaf, |
421842ed | 1428 | info->nl_net->ipv6.fib6_null_entry); |
1da177e4 | 1429 | sfn->fn_flags = RTN_ROOT; |
1da177e4 LT |
1430 | |
1431 | /* Now add the first leaf node to new subtree */ | |
1432 | ||
81eb8447 | 1433 | sn = fib6_add_1(info->nl_net, table, sfn, |
93c2fb25 DA |
1434 | &rt->fib6_src.addr, rt->fib6_src.plen, |
1435 | offsetof(struct fib6_info, fib6_src), | |
bbd63f06 | 1436 | allow_create, replace_required, extack); |
1da177e4 | 1437 | |
f950c0ec | 1438 | if (IS_ERR(sn)) { |
1da177e4 | 1439 | /* If it is failed, discard just allocated |
348a4002 | 1440 | root, and then (in failure) stale node |
1da177e4 LT |
1441 | in main tree. |
1442 | */ | |
81eb8447 | 1443 | node_free_immediate(info->nl_net, sfn); |
188c517a | 1444 | err = PTR_ERR(sn); |
348a4002 | 1445 | goto failure; |
1da177e4 LT |
1446 | } |
1447 | ||
1448 | /* Now link new subtree to main tree */ | |
66f5d6ce WW |
1449 | rcu_assign_pointer(sfn->parent, fn); |
1450 | rcu_assign_pointer(fn->subtree, sfn); | |
1da177e4 | 1451 | } else { |
81eb8447 | 1452 | sn = fib6_add_1(info->nl_net, table, FIB6_SUBTREE(fn), |
93c2fb25 DA |
1453 | &rt->fib6_src.addr, rt->fib6_src.plen, |
1454 | offsetof(struct fib6_info, fib6_src), | |
bbd63f06 | 1455 | allow_create, replace_required, extack); |
1da177e4 | 1456 | |
4a287eba MV |
1457 | if (IS_ERR(sn)) { |
1458 | err = PTR_ERR(sn); | |
348a4002 | 1459 | goto failure; |
188c517a | 1460 | } |
1da177e4 LT |
1461 | } |
1462 | ||
66f5d6ce | 1463 | if (!rcu_access_pointer(fn->leaf)) { |
591ff9ea WW |
1464 | if (fn->fn_flags & RTN_TL_ROOT) { |
1465 | /* put back null_entry for root node */ | |
1466 | rcu_assign_pointer(fn->leaf, | |
421842ed | 1467 | info->nl_net->ipv6.fib6_null_entry); |
591ff9ea | 1468 | } else { |
5ea71528 | 1469 | fib6_info_hold(rt); |
591ff9ea WW |
1470 | rcu_assign_pointer(fn->leaf, rt); |
1471 | } | |
66729e18 | 1472 | } |
1da177e4 LT |
1473 | fn = sn; |
1474 | } | |
1475 | #endif | |
1476 | ||
d4ead6b3 | 1477 | err = fib6_add_rt2node(fn, rt, info, extack); |
bbd63f06 | 1478 | if (!err) { |
f88d8ea6 DA |
1479 | if (rt->nh) |
1480 | list_add(&rt->nh_list, &rt->nh->f6i_list); | |
e87b5052 | 1481 | __fib6_update_sernum_upto_root(rt, fib6_new_sernum(info->nl_net)); |
63152fc0 | 1482 | fib6_start_gc(info->nl_net, rt); |
bbd63f06 | 1483 | } |
1da177e4 LT |
1484 | |
1485 | out: | |
66729e18 YH |
1486 | if (err) { |
1487 | #ifdef CONFIG_IPV6_SUBTREES | |
1488 | /* | |
1489 | * If fib6_add_1 has cleared the old leaf pointer in the | |
1490 | * super-tree leaf node we have to find a new one for it. | |
1491 | */ | |
7bbfe00e | 1492 | if (pn != fn) { |
8d1c802b | 1493 | struct fib6_info *pn_leaf = |
7bbfe00e WW |
1494 | rcu_dereference_protected(pn->leaf, |
1495 | lockdep_is_held(&table->tb6_lock)); | |
1496 | if (pn_leaf == rt) { | |
1497 | pn_leaf = NULL; | |
1498 | RCU_INIT_POINTER(pn->leaf, NULL); | |
93531c67 | 1499 | fib6_info_release(rt); |
66729e18 | 1500 | } |
7bbfe00e WW |
1501 | if (!pn_leaf && !(pn->fn_flags & RTN_RTINFO)) { |
1502 | pn_leaf = fib6_find_prefix(info->nl_net, table, | |
1503 | pn); | |
1504 | #if RT6_DEBUG >= 2 | |
1505 | if (!pn_leaf) { | |
1506 | WARN_ON(!pn_leaf); | |
1507 | pn_leaf = | |
421842ed | 1508 | info->nl_net->ipv6.fib6_null_entry; |
7bbfe00e | 1509 | } |
66729e18 | 1510 | #endif |
93531c67 | 1511 | fib6_info_hold(pn_leaf); |
7bbfe00e WW |
1512 | rcu_assign_pointer(pn->leaf, pn_leaf); |
1513 | } | |
66729e18 YH |
1514 | } |
1515 | #endif | |
348a4002 | 1516 | goto failure; |
b9b33e7c PA |
1517 | } else if (fib6_requires_src(rt)) { |
1518 | fib6_routes_require_src_inc(info->nl_net); | |
66729e18 | 1519 | } |
1da177e4 LT |
1520 | return err; |
1521 | ||
348a4002 | 1522 | failure: |
4512c43e WW |
1523 | /* fn->leaf could be NULL and fib6_repair_tree() needs to be called if: |
1524 | * 1. fn is an intermediate node and we failed to add the new | |
1525 | * route to it in both subtree creation failure and fib6_add_rt2node() | |
1526 | * failure case. | |
1527 | * 2. fn is the root node in the table and we fail to add the first | |
1528 | * default route to it. | |
1da177e4 | 1529 | */ |
4512c43e WW |
1530 | if (fn && |
1531 | (!(fn->fn_flags & (RTN_RTINFO|RTN_ROOT)) || | |
1532 | (fn->fn_flags & RTN_TL_ROOT && | |
1533 | !rcu_access_pointer(fn->leaf)))) | |
66f5d6ce | 1534 | fib6_repair_tree(info->nl_net, table, fn); |
1da177e4 | 1535 | return err; |
1da177e4 LT |
1536 | } |
1537 | ||
1538 | /* | |
1539 | * Routing tree lookup | |
1540 | * | |
1541 | */ | |
1542 | ||
1543 | struct lookup_args { | |
8d1c802b | 1544 | int offset; /* key offset on fib6_info */ |
b71d1d42 | 1545 | const struct in6_addr *addr; /* search key */ |
1da177e4 LT |
1546 | }; |
1547 | ||
6454743b DA |
1548 | static struct fib6_node *fib6_node_lookup_1(struct fib6_node *root, |
1549 | struct lookup_args *args) | |
1da177e4 LT |
1550 | { |
1551 | struct fib6_node *fn; | |
e69a4adc | 1552 | __be32 dir; |
1da177e4 | 1553 | |
825e288e YH |
1554 | if (unlikely(args->offset == 0)) |
1555 | return NULL; | |
1556 | ||
1da177e4 LT |
1557 | /* |
1558 | * Descend on a tree | |
1559 | */ | |
1560 | ||
1561 | fn = root; | |
1562 | ||
1563 | for (;;) { | |
1564 | struct fib6_node *next; | |
1565 | ||
1566 | dir = addr_bit_set(args->addr, fn->fn_bit); | |
1567 | ||
66f5d6ce WW |
1568 | next = dir ? rcu_dereference(fn->right) : |
1569 | rcu_dereference(fn->left); | |
1da177e4 LT |
1570 | |
1571 | if (next) { | |
1572 | fn = next; | |
1573 | continue; | |
1574 | } | |
1da177e4 LT |
1575 | break; |
1576 | } | |
1577 | ||
507c9b1e | 1578 | while (fn) { |
66f5d6ce WW |
1579 | struct fib6_node *subtree = FIB6_SUBTREE(fn); |
1580 | ||
1581 | if (subtree || fn->fn_flags & RTN_RTINFO) { | |
8d1c802b | 1582 | struct fib6_info *leaf = rcu_dereference(fn->leaf); |
1da177e4 LT |
1583 | struct rt6key *key; |
1584 | ||
8d1040e8 WW |
1585 | if (!leaf) |
1586 | goto backtrack; | |
1587 | ||
1588 | key = (struct rt6key *) ((u8 *)leaf + args->offset); | |
1da177e4 | 1589 | |
3fc5e044 YH |
1590 | if (ipv6_prefix_equal(&key->addr, args->addr, key->plen)) { |
1591 | #ifdef CONFIG_IPV6_SUBTREES | |
66f5d6ce | 1592 | if (subtree) { |
3e3be275 | 1593 | struct fib6_node *sfn; |
6454743b DA |
1594 | sfn = fib6_node_lookup_1(subtree, |
1595 | args + 1); | |
3e3be275 HFS |
1596 | if (!sfn) |
1597 | goto backtrack; | |
1598 | fn = sfn; | |
1599 | } | |
3fc5e044 | 1600 | #endif |
3e3be275 | 1601 | if (fn->fn_flags & RTN_RTINFO) |
3fc5e044 YH |
1602 | return fn; |
1603 | } | |
1da177e4 | 1604 | } |
3e3be275 | 1605 | backtrack: |
3fc5e044 YH |
1606 | if (fn->fn_flags & RTN_ROOT) |
1607 | break; | |
1608 | ||
66f5d6ce | 1609 | fn = rcu_dereference(fn->parent); |
1da177e4 LT |
1610 | } |
1611 | ||
1612 | return NULL; | |
1613 | } | |
1614 | ||
66f5d6ce WW |
1615 | /* called with rcu_read_lock() held |
1616 | */ | |
6454743b DA |
1617 | struct fib6_node *fib6_node_lookup(struct fib6_node *root, |
1618 | const struct in6_addr *daddr, | |
1619 | const struct in6_addr *saddr) | |
1da177e4 | 1620 | { |
1da177e4 | 1621 | struct fib6_node *fn; |
825e288e YH |
1622 | struct lookup_args args[] = { |
1623 | { | |
93c2fb25 | 1624 | .offset = offsetof(struct fib6_info, fib6_dst), |
825e288e YH |
1625 | .addr = daddr, |
1626 | }, | |
1da177e4 | 1627 | #ifdef CONFIG_IPV6_SUBTREES |
825e288e | 1628 | { |
93c2fb25 | 1629 | .offset = offsetof(struct fib6_info, fib6_src), |
825e288e YH |
1630 | .addr = saddr, |
1631 | }, | |
1da177e4 | 1632 | #endif |
825e288e YH |
1633 | { |
1634 | .offset = 0, /* sentinel */ | |
1635 | } | |
1636 | }; | |
1da177e4 | 1637 | |
6454743b | 1638 | fn = fib6_node_lookup_1(root, daddr ? args : args + 1); |
507c9b1e | 1639 | if (!fn || fn->fn_flags & RTN_TL_ROOT) |
1da177e4 LT |
1640 | fn = root; |
1641 | ||
1642 | return fn; | |
1643 | } | |
1644 | ||
1645 | /* | |
1646 | * Get node with specified destination prefix (and source prefix, | |
1647 | * if subtrees are used) | |
38fbeeee WW |
1648 | * exact_match == true means we try to find fn with exact match of |
1649 | * the passed in prefix addr | |
1650 | * exact_match == false means we try to find fn with longest prefix | |
1651 | * match of the passed in prefix addr. This is useful for finding fn | |
1652 | * for cached route as it will be stored in the exception table under | |
1653 | * the node with longest prefix length. | |
1da177e4 LT |
1654 | */ |
1655 | ||
1656 | ||
437de07c WY |
1657 | static struct fib6_node *fib6_locate_1(struct fib6_node *root, |
1658 | const struct in6_addr *addr, | |
38fbeeee WW |
1659 | int plen, int offset, |
1660 | bool exact_match) | |
1da177e4 | 1661 | { |
38fbeeee | 1662 | struct fib6_node *fn, *prev = NULL; |
1da177e4 LT |
1663 | |
1664 | for (fn = root; fn ; ) { | |
8d1c802b | 1665 | struct fib6_info *leaf = rcu_dereference(fn->leaf); |
8d1040e8 WW |
1666 | struct rt6key *key; |
1667 | ||
1668 | /* This node is being deleted */ | |
1669 | if (!leaf) { | |
1670 | if (plen <= fn->fn_bit) | |
1671 | goto out; | |
1672 | else | |
1673 | goto next; | |
1674 | } | |
1675 | ||
1676 | key = (struct rt6key *)((u8 *)leaf + offset); | |
1da177e4 LT |
1677 | |
1678 | /* | |
1679 | * Prefix match | |
1680 | */ | |
1681 | if (plen < fn->fn_bit || | |
1682 | !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) | |
38fbeeee | 1683 | goto out; |
1da177e4 LT |
1684 | |
1685 | if (plen == fn->fn_bit) | |
1686 | return fn; | |
1687 | ||
40cb35d5 SB |
1688 | if (fn->fn_flags & RTN_RTINFO) |
1689 | prev = fn; | |
38fbeeee | 1690 | |
8d1040e8 | 1691 | next: |
1da177e4 LT |
1692 | /* |
1693 | * We have more bits to go | |
1694 | */ | |
1695 | if (addr_bit_set(addr, fn->fn_bit)) | |
66f5d6ce | 1696 | fn = rcu_dereference(fn->right); |
1da177e4 | 1697 | else |
66f5d6ce | 1698 | fn = rcu_dereference(fn->left); |
1da177e4 | 1699 | } |
38fbeeee WW |
1700 | out: |
1701 | if (exact_match) | |
1702 | return NULL; | |
1703 | else | |
1704 | return prev; | |
1da177e4 LT |
1705 | } |
1706 | ||
437de07c WY |
1707 | struct fib6_node *fib6_locate(struct fib6_node *root, |
1708 | const struct in6_addr *daddr, int dst_len, | |
38fbeeee WW |
1709 | const struct in6_addr *saddr, int src_len, |
1710 | bool exact_match) | |
1da177e4 LT |
1711 | { |
1712 | struct fib6_node *fn; | |
1713 | ||
1714 | fn = fib6_locate_1(root, daddr, dst_len, | |
93c2fb25 | 1715 | offsetof(struct fib6_info, fib6_dst), |
38fbeeee | 1716 | exact_match); |
1da177e4 LT |
1717 | |
1718 | #ifdef CONFIG_IPV6_SUBTREES | |
1719 | if (src_len) { | |
547b792c | 1720 | WARN_ON(saddr == NULL); |
0e80193b WW |
1721 | if (fn) { |
1722 | struct fib6_node *subtree = FIB6_SUBTREE(fn); | |
1723 | ||
1724 | if (subtree) { | |
1725 | fn = fib6_locate_1(subtree, saddr, src_len, | |
93c2fb25 | 1726 | offsetof(struct fib6_info, fib6_src), |
38fbeeee | 1727 | exact_match); |
0e80193b WW |
1728 | } |
1729 | } | |
1da177e4 LT |
1730 | } |
1731 | #endif | |
1732 | ||
507c9b1e | 1733 | if (fn && fn->fn_flags & RTN_RTINFO) |
1da177e4 LT |
1734 | return fn; |
1735 | ||
1736 | return NULL; | |
1737 | } | |
1738 | ||
1739 | ||
1740 | /* | |
1741 | * Deletion | |
1742 | * | |
1743 | */ | |
1744 | ||
8d1c802b | 1745 | static struct fib6_info *fib6_find_prefix(struct net *net, |
66f5d6ce WW |
1746 | struct fib6_table *table, |
1747 | struct fib6_node *fn) | |
1da177e4 | 1748 | { |
66f5d6ce WW |
1749 | struct fib6_node *child_left, *child_right; |
1750 | ||
507c9b1e | 1751 | if (fn->fn_flags & RTN_ROOT) |
421842ed | 1752 | return net->ipv6.fib6_null_entry; |
1da177e4 | 1753 | |
507c9b1e | 1754 | while (fn) { |
66f5d6ce WW |
1755 | child_left = rcu_dereference_protected(fn->left, |
1756 | lockdep_is_held(&table->tb6_lock)); | |
1757 | child_right = rcu_dereference_protected(fn->right, | |
1758 | lockdep_is_held(&table->tb6_lock)); | |
1759 | if (child_left) | |
1760 | return rcu_dereference_protected(child_left->leaf, | |
1761 | lockdep_is_held(&table->tb6_lock)); | |
1762 | if (child_right) | |
1763 | return rcu_dereference_protected(child_right->leaf, | |
1764 | lockdep_is_held(&table->tb6_lock)); | |
1da177e4 | 1765 | |
7fc33165 | 1766 | fn = FIB6_SUBTREE(fn); |
1da177e4 LT |
1767 | } |
1768 | return NULL; | |
1769 | } | |
1770 | ||
1771 | /* | |
1772 | * Called to trim the tree of intermediate nodes when possible. "fn" | |
1773 | * is the node we want to try and remove. | |
66f5d6ce | 1774 | * Need to own table->tb6_lock |
1da177e4 LT |
1775 | */ |
1776 | ||
8ed67789 | 1777 | static struct fib6_node *fib6_repair_tree(struct net *net, |
66f5d6ce WW |
1778 | struct fib6_table *table, |
1779 | struct fib6_node *fn) | |
1da177e4 LT |
1780 | { |
1781 | int children; | |
1782 | int nstate; | |
66f5d6ce | 1783 | struct fib6_node *child; |
94b2cfe0 | 1784 | struct fib6_walker *w; |
1da177e4 LT |
1785 | int iter = 0; |
1786 | ||
4512c43e WW |
1787 | /* Set fn->leaf to null_entry for root node. */ |
1788 | if (fn->fn_flags & RTN_TL_ROOT) { | |
421842ed | 1789 | rcu_assign_pointer(fn->leaf, net->ipv6.fib6_null_entry); |
4512c43e WW |
1790 | return fn; |
1791 | } | |
1792 | ||
1da177e4 | 1793 | for (;;) { |
66f5d6ce WW |
1794 | struct fib6_node *fn_r = rcu_dereference_protected(fn->right, |
1795 | lockdep_is_held(&table->tb6_lock)); | |
1796 | struct fib6_node *fn_l = rcu_dereference_protected(fn->left, | |
1797 | lockdep_is_held(&table->tb6_lock)); | |
1798 | struct fib6_node *pn = rcu_dereference_protected(fn->parent, | |
1799 | lockdep_is_held(&table->tb6_lock)); | |
1800 | struct fib6_node *pn_r = rcu_dereference_protected(pn->right, | |
1801 | lockdep_is_held(&table->tb6_lock)); | |
1802 | struct fib6_node *pn_l = rcu_dereference_protected(pn->left, | |
1803 | lockdep_is_held(&table->tb6_lock)); | |
8d1c802b | 1804 | struct fib6_info *fn_leaf = rcu_dereference_protected(fn->leaf, |
66f5d6ce | 1805 | lockdep_is_held(&table->tb6_lock)); |
8d1c802b | 1806 | struct fib6_info *pn_leaf = rcu_dereference_protected(pn->leaf, |
66f5d6ce | 1807 | lockdep_is_held(&table->tb6_lock)); |
8d1c802b | 1808 | struct fib6_info *new_fn_leaf; |
66f5d6ce | 1809 | |
1da177e4 LT |
1810 | RT6_TRACE("fixing tree: plen=%d iter=%d\n", fn->fn_bit, iter); |
1811 | iter++; | |
1812 | ||
547b792c IJ |
1813 | WARN_ON(fn->fn_flags & RTN_RTINFO); |
1814 | WARN_ON(fn->fn_flags & RTN_TL_ROOT); | |
66f5d6ce | 1815 | WARN_ON(fn_leaf); |
1da177e4 LT |
1816 | |
1817 | children = 0; | |
1818 | child = NULL; | |
dee84779 JP |
1819 | if (fn_r) { |
1820 | child = fn_r; | |
1821 | children |= 1; | |
1822 | } | |
1823 | if (fn_l) { | |
1824 | child = fn_l; | |
1825 | children |= 2; | |
1826 | } | |
1da177e4 | 1827 | |
7fc33165 | 1828 | if (children == 3 || FIB6_SUBTREE(fn) |
1da177e4 LT |
1829 | #ifdef CONFIG_IPV6_SUBTREES |
1830 | /* Subtree root (i.e. fn) may have one child */ | |
507c9b1e | 1831 | || (children && fn->fn_flags & RTN_ROOT) |
1da177e4 LT |
1832 | #endif |
1833 | ) { | |
66f5d6ce | 1834 | new_fn_leaf = fib6_find_prefix(net, table, fn); |
1da177e4 | 1835 | #if RT6_DEBUG >= 2 |
66f5d6ce WW |
1836 | if (!new_fn_leaf) { |
1837 | WARN_ON(!new_fn_leaf); | |
421842ed | 1838 | new_fn_leaf = net->ipv6.fib6_null_entry; |
1da177e4 LT |
1839 | } |
1840 | #endif | |
93531c67 | 1841 | fib6_info_hold(new_fn_leaf); |
66f5d6ce WW |
1842 | rcu_assign_pointer(fn->leaf, new_fn_leaf); |
1843 | return pn; | |
1da177e4 LT |
1844 | } |
1845 | ||
1da177e4 | 1846 | #ifdef CONFIG_IPV6_SUBTREES |
7fc33165 | 1847 | if (FIB6_SUBTREE(pn) == fn) { |
547b792c | 1848 | WARN_ON(!(fn->fn_flags & RTN_ROOT)); |
66f5d6ce | 1849 | RCU_INIT_POINTER(pn->subtree, NULL); |
1da177e4 LT |
1850 | nstate = FWS_L; |
1851 | } else { | |
547b792c | 1852 | WARN_ON(fn->fn_flags & RTN_ROOT); |
1da177e4 | 1853 | #endif |
66f5d6ce WW |
1854 | if (pn_r == fn) |
1855 | rcu_assign_pointer(pn->right, child); | |
1856 | else if (pn_l == fn) | |
1857 | rcu_assign_pointer(pn->left, child); | |
1da177e4 | 1858 | #if RT6_DEBUG >= 2 |
547b792c IJ |
1859 | else |
1860 | WARN_ON(1); | |
1da177e4 LT |
1861 | #endif |
1862 | if (child) | |
66f5d6ce | 1863 | rcu_assign_pointer(child->parent, pn); |
1da177e4 LT |
1864 | nstate = FWS_R; |
1865 | #ifdef CONFIG_IPV6_SUBTREES | |
1866 | } | |
1867 | #endif | |
1868 | ||
9a03cd8f MK |
1869 | read_lock(&net->ipv6.fib6_walker_lock); |
1870 | FOR_WALKERS(net, w) { | |
507c9b1e | 1871 | if (!child) { |
2b760fcf | 1872 | if (w->node == fn) { |
1da177e4 LT |
1873 | RT6_TRACE("W %p adjusted by delnode 1, s=%d/%d\n", w, w->state, nstate); |
1874 | w->node = pn; | |
1875 | w->state = nstate; | |
1876 | } | |
1877 | } else { | |
1da177e4 LT |
1878 | if (w->node == fn) { |
1879 | w->node = child; | |
1880 | if (children&2) { | |
1881 | RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state); | |
8db46f1d | 1882 | w->state = w->state >= FWS_R ? FWS_U : FWS_INIT; |
1da177e4 LT |
1883 | } else { |
1884 | RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state); | |
8db46f1d | 1885 | w->state = w->state >= FWS_C ? FWS_U : FWS_INIT; |
1da177e4 LT |
1886 | } |
1887 | } | |
1888 | } | |
1889 | } | |
9a03cd8f | 1890 | read_unlock(&net->ipv6.fib6_walker_lock); |
1da177e4 | 1891 | |
81eb8447 | 1892 | node_free(net, fn); |
507c9b1e | 1893 | if (pn->fn_flags & RTN_RTINFO || FIB6_SUBTREE(pn)) |
1da177e4 LT |
1894 | return pn; |
1895 | ||
66f5d6ce | 1896 | RCU_INIT_POINTER(pn->leaf, NULL); |
93531c67 | 1897 | fib6_info_release(pn_leaf); |
1da177e4 LT |
1898 | fn = pn; |
1899 | } | |
1900 | } | |
1901 | ||
66f5d6ce | 1902 | static void fib6_del_route(struct fib6_table *table, struct fib6_node *fn, |
8d1c802b | 1903 | struct fib6_info __rcu **rtp, struct nl_info *info) |
1da177e4 | 1904 | { |
d2f0c9b1 | 1905 | struct fib6_info *leaf, *replace_rt = NULL; |
94b2cfe0 | 1906 | struct fib6_walker *w; |
8d1c802b | 1907 | struct fib6_info *rt = rcu_dereference_protected(*rtp, |
66f5d6ce | 1908 | lockdep_is_held(&table->tb6_lock)); |
c572872f | 1909 | struct net *net = info->nl_net; |
d2f0c9b1 | 1910 | bool notify_del = false; |
1da177e4 LT |
1911 | |
1912 | RT6_TRACE("fib6_del_route\n"); | |
1913 | ||
d2f0c9b1 IS |
1914 | /* If the deleted route is the first in the node and it is not part of |
1915 | * a multipath route, then we need to replace it with the next route | |
1916 | * in the node, if exists. | |
1917 | */ | |
1918 | leaf = rcu_dereference_protected(fn->leaf, | |
1919 | lockdep_is_held(&table->tb6_lock)); | |
1920 | if (leaf == rt && !rt->fib6_nsiblings) { | |
1921 | if (rcu_access_pointer(rt->fib6_next)) | |
1922 | replace_rt = rcu_dereference_protected(rt->fib6_next, | |
1923 | lockdep_is_held(&table->tb6_lock)); | |
1924 | else | |
1925 | notify_del = true; | |
1926 | } | |
1927 | ||
1da177e4 | 1928 | /* Unlink it */ |
8fb11a9a | 1929 | *rtp = rt->fib6_next; |
93c2fb25 | 1930 | rt->fib6_node = NULL; |
c572872f BT |
1931 | net->ipv6.rt6_stats->fib_rt_entries--; |
1932 | net->ipv6.rt6_stats->fib_discarded_routes++; | |
1da177e4 | 1933 | |
f11e6659 | 1934 | /* Reset round-robin state, if necessary */ |
66f5d6ce | 1935 | if (rcu_access_pointer(fn->rr_ptr) == rt) |
f11e6659 DM |
1936 | fn->rr_ptr = NULL; |
1937 | ||
51ebd318 | 1938 | /* Remove this entry from other siblings */ |
93c2fb25 | 1939 | if (rt->fib6_nsiblings) { |
8d1c802b | 1940 | struct fib6_info *sibling, *next_sibling; |
51ebd318 | 1941 | |
d2f0c9b1 IS |
1942 | /* The route is deleted from a multipath route. If this |
1943 | * multipath route is the first route in the node, then we need | |
1944 | * to emit a delete notification. Otherwise, we need to skip | |
1945 | * the notification. | |
1946 | */ | |
1947 | if (rt->fib6_metric == leaf->fib6_metric && | |
1948 | rt6_qualify_for_ecmp(leaf)) | |
1949 | notify_del = true; | |
51ebd318 | 1950 | list_for_each_entry_safe(sibling, next_sibling, |
93c2fb25 DA |
1951 | &rt->fib6_siblings, fib6_siblings) |
1952 | sibling->fib6_nsiblings--; | |
1953 | rt->fib6_nsiblings = 0; | |
1954 | list_del_init(&rt->fib6_siblings); | |
d7dedee1 | 1955 | rt6_multipath_rebalance(next_sibling); |
51ebd318 ND |
1956 | } |
1957 | ||
1da177e4 | 1958 | /* Adjust walkers */ |
9a03cd8f MK |
1959 | read_lock(&net->ipv6.fib6_walker_lock); |
1960 | FOR_WALKERS(net, w) { | |
1da177e4 LT |
1961 | if (w->state == FWS_C && w->leaf == rt) { |
1962 | RT6_TRACE("walker %p adjusted by delroute\n", w); | |
8fb11a9a | 1963 | w->leaf = rcu_dereference_protected(rt->fib6_next, |
66f5d6ce | 1964 | lockdep_is_held(&table->tb6_lock)); |
507c9b1e | 1965 | if (!w->leaf) |
1da177e4 LT |
1966 | w->state = FWS_U; |
1967 | } | |
1968 | } | |
9a03cd8f | 1969 | read_unlock(&net->ipv6.fib6_walker_lock); |
1da177e4 | 1970 | |
4512c43e WW |
1971 | /* If it was last route, call fib6_repair_tree() to: |
1972 | * 1. For root node, put back null_entry as how the table was created. | |
1973 | * 2. For other nodes, expunge its radix tree node. | |
1974 | */ | |
66f5d6ce | 1975 | if (!rcu_access_pointer(fn->leaf)) { |
4512c43e WW |
1976 | if (!(fn->fn_flags & RTN_TL_ROOT)) { |
1977 | fn->fn_flags &= ~RTN_RTINFO; | |
1978 | net->ipv6.rt6_stats->fib_route_nodes--; | |
1979 | } | |
66f5d6ce | 1980 | fn = fib6_repair_tree(net, table, fn); |
1da177e4 LT |
1981 | } |
1982 | ||
6e9e16e6 | 1983 | fib6_purge_rt(rt, fn, net); |
1da177e4 | 1984 | |
d2f0c9b1 IS |
1985 | if (!info->skip_notify_kernel) { |
1986 | if (notify_del) | |
caafb250 | 1987 | call_fib6_entry_notifiers(net, FIB_EVENT_ENTRY_DEL, |
d2f0c9b1 IS |
1988 | rt, NULL); |
1989 | else if (replace_rt) | |
1990 | call_fib6_entry_notifiers_replace(net, replace_rt); | |
d2f0c9b1 | 1991 | } |
16a16cd3 DA |
1992 | if (!info->skip_notify) |
1993 | inet6_rt_notify(RTM_DELROUTE, rt, info, 0); | |
d5382fef | 1994 | |
93531c67 | 1995 | fib6_info_release(rt); |
1da177e4 LT |
1996 | } |
1997 | ||
66f5d6ce | 1998 | /* Need to own table->tb6_lock */ |
8d1c802b | 1999 | int fib6_del(struct fib6_info *rt, struct nl_info *info) |
1da177e4 | 2000 | { |
8ed67789 | 2001 | struct net *net = info->nl_net; |
8d1c802b DA |
2002 | struct fib6_info __rcu **rtp; |
2003 | struct fib6_info __rcu **rtp_next; | |
843d926b ED |
2004 | struct fib6_table *table; |
2005 | struct fib6_node *fn; | |
2006 | ||
2007 | if (rt == net->ipv6.fib6_null_entry) | |
2008 | return -ENOENT; | |
1da177e4 | 2009 | |
843d926b ED |
2010 | table = rt->fib6_table; |
2011 | fn = rcu_dereference_protected(rt->fib6_node, | |
2012 | lockdep_is_held(&table->tb6_lock)); | |
2013 | if (!fn) | |
1da177e4 LT |
2014 | return -ENOENT; |
2015 | ||
547b792c | 2016 | WARN_ON(!(fn->fn_flags & RTN_RTINFO)); |
1da177e4 | 2017 | |
1da177e4 LT |
2018 | /* |
2019 | * Walk the leaf entries looking for ourself | |
2020 | */ | |
2021 | ||
66f5d6ce | 2022 | for (rtp = &fn->leaf; *rtp; rtp = rtp_next) { |
8d1c802b | 2023 | struct fib6_info *cur = rcu_dereference_protected(*rtp, |
66f5d6ce WW |
2024 | lockdep_is_held(&table->tb6_lock)); |
2025 | if (rt == cur) { | |
b9b33e7c PA |
2026 | if (fib6_requires_src(cur)) |
2027 | fib6_routes_require_src_dec(info->nl_net); | |
66f5d6ce | 2028 | fib6_del_route(table, fn, rtp, info); |
1da177e4 LT |
2029 | return 0; |
2030 | } | |
8fb11a9a | 2031 | rtp_next = &cur->fib6_next; |
1da177e4 LT |
2032 | } |
2033 | return -ENOENT; | |
2034 | } | |
2035 | ||
2036 | /* | |
2037 | * Tree traversal function. | |
2038 | * | |
2039 | * Certainly, it is not interrupt safe. | |
2040 | * However, it is internally reenterable wrt itself and fib6_add/fib6_del. | |
2041 | * It means, that we can modify tree during walking | |
2042 | * and use this function for garbage collection, clone pruning, | |
1ab1457c | 2043 | * cleaning tree when a device goes down etc. etc. |
1da177e4 LT |
2044 | * |
2045 | * It guarantees that every node will be traversed, | |
2046 | * and that it will be traversed only once. | |
2047 | * | |
2048 | * Callback function w->func may return: | |
2049 | * 0 -> continue walking. | |
2050 | * positive value -> walking is suspended (used by tree dumps, | |
2051 | * and probably by gc, if it will be split to several slices) | |
2052 | * negative value -> terminate walking. | |
2053 | * | |
2054 | * The function itself returns: | |
2055 | * 0 -> walk is complete. | |
2056 | * >0 -> walk is incomplete (i.e. suspended) | |
2057 | * <0 -> walk is terminated by an error. | |
66f5d6ce WW |
2058 | * |
2059 | * This function is called with tb6_lock held. | |
1da177e4 LT |
2060 | */ |
2061 | ||
94b2cfe0 | 2062 | static int fib6_walk_continue(struct fib6_walker *w) |
1da177e4 | 2063 | { |
66f5d6ce | 2064 | struct fib6_node *fn, *pn, *left, *right; |
1da177e4 | 2065 | |
2b760fcf WW |
2066 | /* w->root should always be table->tb6_root */ |
2067 | WARN_ON_ONCE(!(w->root->fn_flags & RTN_TL_ROOT)); | |
2068 | ||
1da177e4 LT |
2069 | for (;;) { |
2070 | fn = w->node; | |
507c9b1e | 2071 | if (!fn) |
1da177e4 LT |
2072 | return 0; |
2073 | ||
1da177e4 LT |
2074 | switch (w->state) { |
2075 | #ifdef CONFIG_IPV6_SUBTREES | |
2076 | case FWS_S: | |
7fc33165 YH |
2077 | if (FIB6_SUBTREE(fn)) { |
2078 | w->node = FIB6_SUBTREE(fn); | |
1da177e4 LT |
2079 | continue; |
2080 | } | |
2081 | w->state = FWS_L; | |
a8eceea8 | 2082 | fallthrough; |
1ab1457c | 2083 | #endif |
1da177e4 | 2084 | case FWS_L: |
66f5d6ce WW |
2085 | left = rcu_dereference_protected(fn->left, 1); |
2086 | if (left) { | |
2087 | w->node = left; | |
1da177e4 LT |
2088 | w->state = FWS_INIT; |
2089 | continue; | |
2090 | } | |
2091 | w->state = FWS_R; | |
a8eceea8 | 2092 | fallthrough; |
1da177e4 | 2093 | case FWS_R: |
66f5d6ce WW |
2094 | right = rcu_dereference_protected(fn->right, 1); |
2095 | if (right) { | |
2096 | w->node = right; | |
1da177e4 LT |
2097 | w->state = FWS_INIT; |
2098 | continue; | |
2099 | } | |
2100 | w->state = FWS_C; | |
66f5d6ce | 2101 | w->leaf = rcu_dereference_protected(fn->leaf, 1); |
a8eceea8 | 2102 | fallthrough; |
1da177e4 | 2103 | case FWS_C: |
507c9b1e | 2104 | if (w->leaf && fn->fn_flags & RTN_RTINFO) { |
2bec5a36 PM |
2105 | int err; |
2106 | ||
fa809e2f ED |
2107 | if (w->skip) { |
2108 | w->skip--; | |
1c265854 | 2109 | goto skip; |
2bec5a36 PM |
2110 | } |
2111 | ||
2112 | err = w->func(w); | |
1da177e4 LT |
2113 | if (err) |
2114 | return err; | |
2bec5a36 PM |
2115 | |
2116 | w->count++; | |
1da177e4 LT |
2117 | continue; |
2118 | } | |
1c265854 | 2119 | skip: |
1da177e4 | 2120 | w->state = FWS_U; |
a8eceea8 | 2121 | fallthrough; |
1da177e4 LT |
2122 | case FWS_U: |
2123 | if (fn == w->root) | |
2124 | return 0; | |
66f5d6ce WW |
2125 | pn = rcu_dereference_protected(fn->parent, 1); |
2126 | left = rcu_dereference_protected(pn->left, 1); | |
2127 | right = rcu_dereference_protected(pn->right, 1); | |
1da177e4 LT |
2128 | w->node = pn; |
2129 | #ifdef CONFIG_IPV6_SUBTREES | |
7fc33165 | 2130 | if (FIB6_SUBTREE(pn) == fn) { |
547b792c | 2131 | WARN_ON(!(fn->fn_flags & RTN_ROOT)); |
1da177e4 LT |
2132 | w->state = FWS_L; |
2133 | continue; | |
2134 | } | |
2135 | #endif | |
66f5d6ce | 2136 | if (left == fn) { |
1da177e4 LT |
2137 | w->state = FWS_R; |
2138 | continue; | |
2139 | } | |
66f5d6ce | 2140 | if (right == fn) { |
1da177e4 | 2141 | w->state = FWS_C; |
66f5d6ce | 2142 | w->leaf = rcu_dereference_protected(w->node->leaf, 1); |
1da177e4 LT |
2143 | continue; |
2144 | } | |
2145 | #if RT6_DEBUG >= 2 | |
547b792c | 2146 | WARN_ON(1); |
1da177e4 LT |
2147 | #endif |
2148 | } | |
2149 | } | |
2150 | } | |
2151 | ||
9a03cd8f | 2152 | static int fib6_walk(struct net *net, struct fib6_walker *w) |
1da177e4 LT |
2153 | { |
2154 | int res; | |
2155 | ||
2156 | w->state = FWS_INIT; | |
2157 | w->node = w->root; | |
2158 | ||
9a03cd8f | 2159 | fib6_walker_link(net, w); |
1da177e4 LT |
2160 | res = fib6_walk_continue(w); |
2161 | if (res <= 0) | |
9a03cd8f | 2162 | fib6_walker_unlink(net, w); |
1da177e4 LT |
2163 | return res; |
2164 | } | |
2165 | ||
94b2cfe0 | 2166 | static int fib6_clean_node(struct fib6_walker *w) |
1da177e4 LT |
2167 | { |
2168 | int res; | |
8d1c802b | 2169 | struct fib6_info *rt; |
94b2cfe0 | 2170 | struct fib6_cleaner *c = container_of(w, struct fib6_cleaner, w); |
ec7d43c2 BT |
2171 | struct nl_info info = { |
2172 | .nl_net = c->net, | |
7c6bb7d2 | 2173 | .skip_notify = c->skip_notify, |
ec7d43c2 | 2174 | }; |
1da177e4 | 2175 | |
327571cb | 2176 | if (c->sernum != FIB6_NO_SERNUM_CHANGE && |
aafc2e32 ED |
2177 | READ_ONCE(w->node->fn_sernum) != c->sernum) |
2178 | WRITE_ONCE(w->node->fn_sernum, c->sernum); | |
327571cb HFS |
2179 | |
2180 | if (!c->func) { | |
2181 | WARN_ON_ONCE(c->sernum == FIB6_NO_SERNUM_CHANGE); | |
2182 | w->leaf = NULL; | |
2183 | return 0; | |
2184 | } | |
2185 | ||
66f5d6ce | 2186 | for_each_fib6_walker_rt(w) { |
1da177e4 | 2187 | res = c->func(rt, c->arg); |
b5cb5a75 | 2188 | if (res == -1) { |
1da177e4 | 2189 | w->leaf = rt; |
528c4ceb | 2190 | res = fib6_del(rt, &info); |
1da177e4 LT |
2191 | if (res) { |
2192 | #if RT6_DEBUG >= 2 | |
91df42be | 2193 | pr_debug("%s: del failed: rt=%p@%p err=%d\n", |
4e587ea7 | 2194 | __func__, rt, |
93c2fb25 | 2195 | rcu_access_pointer(rt->fib6_node), |
4e587ea7 | 2196 | res); |
1da177e4 LT |
2197 | #endif |
2198 | continue; | |
2199 | } | |
2200 | return 0; | |
b5cb5a75 | 2201 | } else if (res == -2) { |
93c2fb25 | 2202 | if (WARN_ON(!rt->fib6_nsiblings)) |
b5cb5a75 | 2203 | continue; |
93c2fb25 DA |
2204 | rt = list_last_entry(&rt->fib6_siblings, |
2205 | struct fib6_info, fib6_siblings); | |
b5cb5a75 | 2206 | continue; |
1da177e4 | 2207 | } |
547b792c | 2208 | WARN_ON(res != 0); |
1da177e4 LT |
2209 | } |
2210 | w->leaf = rt; | |
2211 | return 0; | |
2212 | } | |
2213 | ||
2214 | /* | |
2215 | * Convenient frontend to tree walker. | |
1ab1457c | 2216 | * |
1da177e4 | 2217 | * func is called on each route. |
b5cb5a75 IS |
2218 | * It may return -2 -> skip multipath route. |
2219 | * -1 -> delete this route. | |
1da177e4 | 2220 | * 0 -> continue walking |
1da177e4 LT |
2221 | */ |
2222 | ||
ec7d43c2 | 2223 | static void fib6_clean_tree(struct net *net, struct fib6_node *root, |
8d1c802b | 2224 | int (*func)(struct fib6_info *, void *arg), |
7c6bb7d2 | 2225 | int sernum, void *arg, bool skip_notify) |
1da177e4 | 2226 | { |
94b2cfe0 | 2227 | struct fib6_cleaner c; |
1da177e4 LT |
2228 | |
2229 | c.w.root = root; | |
2230 | c.w.func = fib6_clean_node; | |
2bec5a36 PM |
2231 | c.w.count = 0; |
2232 | c.w.skip = 0; | |
1e47b483 | 2233 | c.w.skip_in_node = 0; |
1da177e4 | 2234 | c.func = func; |
327571cb | 2235 | c.sernum = sernum; |
1da177e4 | 2236 | c.arg = arg; |
ec7d43c2 | 2237 | c.net = net; |
7c6bb7d2 | 2238 | c.skip_notify = skip_notify; |
1da177e4 | 2239 | |
9a03cd8f | 2240 | fib6_walk(net, &c.w); |
1da177e4 LT |
2241 | } |
2242 | ||
327571cb | 2243 | static void __fib6_clean_all(struct net *net, |
8d1c802b | 2244 | int (*func)(struct fib6_info *, void *), |
7c6bb7d2 | 2245 | int sernum, void *arg, bool skip_notify) |
c71099ac | 2246 | { |
c71099ac | 2247 | struct fib6_table *table; |
58f09b78 | 2248 | struct hlist_head *head; |
1b43af54 | 2249 | unsigned int h; |
c71099ac | 2250 | |
1b43af54 | 2251 | rcu_read_lock(); |
a33bc5c1 | 2252 | for (h = 0; h < FIB6_TABLE_HASHSZ; h++) { |
f3db4851 | 2253 | head = &net->ipv6.fib_table_hash[h]; |
b67bfe0d | 2254 | hlist_for_each_entry_rcu(table, head, tb6_hlist) { |
66f5d6ce | 2255 | spin_lock_bh(&table->tb6_lock); |
ec7d43c2 | 2256 | fib6_clean_tree(net, &table->tb6_root, |
7c6bb7d2 | 2257 | func, sernum, arg, skip_notify); |
66f5d6ce | 2258 | spin_unlock_bh(&table->tb6_lock); |
c71099ac TG |
2259 | } |
2260 | } | |
1b43af54 | 2261 | rcu_read_unlock(); |
c71099ac TG |
2262 | } |
2263 | ||
8d1c802b | 2264 | void fib6_clean_all(struct net *net, int (*func)(struct fib6_info *, void *), |
327571cb HFS |
2265 | void *arg) |
2266 | { | |
7c6bb7d2 DA |
2267 | __fib6_clean_all(net, func, FIB6_NO_SERNUM_CHANGE, arg, false); |
2268 | } | |
2269 | ||
2270 | void fib6_clean_all_skip_notify(struct net *net, | |
2271 | int (*func)(struct fib6_info *, void *), | |
2272 | void *arg) | |
2273 | { | |
2274 | __fib6_clean_all(net, func, FIB6_NO_SERNUM_CHANGE, arg, true); | |
327571cb HFS |
2275 | } |
2276 | ||
705f1c86 HFS |
2277 | static void fib6_flush_trees(struct net *net) |
2278 | { | |
812918c4 | 2279 | int new_sernum = fib6_new_sernum(net); |
705f1c86 | 2280 | |
7c6bb7d2 | 2281 | __fib6_clean_all(net, NULL, new_sernum, NULL, false); |
705f1c86 HFS |
2282 | } |
2283 | ||
1da177e4 LT |
2284 | /* |
2285 | * Garbage collection | |
2286 | */ | |
2287 | ||
8d1c802b | 2288 | static int fib6_age(struct fib6_info *rt, void *arg) |
1da177e4 | 2289 | { |
3570df91 | 2290 | struct fib6_gc_args *gc_args = arg; |
1da177e4 LT |
2291 | unsigned long now = jiffies; |
2292 | ||
2293 | /* | |
2294 | * check addrconf expiration here. | |
2295 | * Routes are expired even if they are in use. | |
1da177e4 LT |
2296 | */ |
2297 | ||
93c2fb25 | 2298 | if (rt->fib6_flags & RTF_EXPIRES && rt->expires) { |
14895687 | 2299 | if (time_after(now, rt->expires)) { |
1da177e4 | 2300 | RT6_TRACE("expiring %p\n", rt); |
1da177e4 LT |
2301 | return -1; |
2302 | } | |
3570df91 | 2303 | gc_args->more++; |
1da177e4 LT |
2304 | } |
2305 | ||
c757faa8 WW |
2306 | /* Also age clones in the exception table. |
2307 | * Note, that clones are aged out | |
2308 | * only if they are not in use now. | |
2309 | */ | |
2310 | rt6_age_exceptions(rt, gc_args, now); | |
2311 | ||
1da177e4 LT |
2312 | return 0; |
2313 | } | |
2314 | ||
2ac3ac8f | 2315 | void fib6_run_gc(unsigned long expires, struct net *net, bool force) |
1da177e4 | 2316 | { |
3570df91 | 2317 | struct fib6_gc_args gc_args; |
49a18d86 MK |
2318 | unsigned long now; |
2319 | ||
2ac3ac8f | 2320 | if (force) { |
3dc94f93 MK |
2321 | spin_lock_bh(&net->ipv6.fib6_gc_lock); |
2322 | } else if (!spin_trylock_bh(&net->ipv6.fib6_gc_lock)) { | |
2ac3ac8f MK |
2323 | mod_timer(&net->ipv6.ip6_fib_timer, jiffies + HZ); |
2324 | return; | |
1da177e4 | 2325 | } |
2ac3ac8f MK |
2326 | gc_args.timeout = expires ? (int)expires : |
2327 | net->ipv6.sysctl.ip6_rt_gc_interval; | |
db916649 | 2328 | gc_args.more = 0; |
f3db4851 | 2329 | |
3570df91 | 2330 | fib6_clean_all(net, fib6_age, &gc_args); |
49a18d86 MK |
2331 | now = jiffies; |
2332 | net->ipv6.ip6_rt_last_gc = now; | |
1da177e4 LT |
2333 | |
2334 | if (gc_args.more) | |
c8a45222 | 2335 | mod_timer(&net->ipv6.ip6_fib_timer, |
49a18d86 | 2336 | round_jiffies(now |
c8a45222 | 2337 | + net->ipv6.sysctl.ip6_rt_gc_interval)); |
417f28bb SH |
2338 | else |
2339 | del_timer(&net->ipv6.ip6_fib_timer); | |
3dc94f93 | 2340 | spin_unlock_bh(&net->ipv6.fib6_gc_lock); |
1da177e4 LT |
2341 | } |
2342 | ||
86cb30ec | 2343 | static void fib6_gc_timer_cb(struct timer_list *t) |
5b7c931d | 2344 | { |
86cb30ec KC |
2345 | struct net *arg = from_timer(arg, t, ipv6.ip6_fib_timer); |
2346 | ||
2347 | fib6_run_gc(0, arg, true); | |
5b7c931d DL |
2348 | } |
2349 | ||
2c8c1e72 | 2350 | static int __net_init fib6_net_init(struct net *net) |
1da177e4 | 2351 | { |
10da66f7 | 2352 | size_t size = sizeof(struct hlist_head) * FIB6_TABLE_HASHSZ; |
16ab6d7d IS |
2353 | int err; |
2354 | ||
2355 | err = fib6_notifier_init(net); | |
2356 | if (err) | |
2357 | return err; | |
10da66f7 | 2358 | |
ed13923f IS |
2359 | /* Default to 3-tuple */ |
2360 | net->ipv6.sysctl.multipath_hash_fields = | |
2361 | FIB_MULTIPATH_HASH_FIELD_DEFAULT_MASK; | |
2362 | ||
3dc94f93 | 2363 | spin_lock_init(&net->ipv6.fib6_gc_lock); |
9a03cd8f MK |
2364 | rwlock_init(&net->ipv6.fib6_walker_lock); |
2365 | INIT_LIST_HEAD(&net->ipv6.fib6_walkers); | |
86cb30ec | 2366 | timer_setup(&net->ipv6.ip6_fib_timer, fib6_gc_timer_cb, 0); |
63152fc0 | 2367 | |
c572872f BT |
2368 | net->ipv6.rt6_stats = kzalloc(sizeof(*net->ipv6.rt6_stats), GFP_KERNEL); |
2369 | if (!net->ipv6.rt6_stats) | |
67db5ca7 | 2370 | goto out_notifier; |
c572872f | 2371 | |
10da66f7 ED |
2372 | /* Avoid false sharing : Use at least a full cache line */ |
2373 | size = max_t(size_t, size, L1_CACHE_BYTES); | |
2374 | ||
2375 | net->ipv6.fib_table_hash = kzalloc(size, GFP_KERNEL); | |
58f09b78 | 2376 | if (!net->ipv6.fib_table_hash) |
c572872f | 2377 | goto out_rt6_stats; |
e0b85590 | 2378 | |
58f09b78 DL |
2379 | net->ipv6.fib6_main_tbl = kzalloc(sizeof(*net->ipv6.fib6_main_tbl), |
2380 | GFP_KERNEL); | |
2381 | if (!net->ipv6.fib6_main_tbl) | |
e0b85590 DL |
2382 | goto out_fib_table_hash; |
2383 | ||
58f09b78 | 2384 | net->ipv6.fib6_main_tbl->tb6_id = RT6_TABLE_MAIN; |
66f5d6ce | 2385 | rcu_assign_pointer(net->ipv6.fib6_main_tbl->tb6_root.leaf, |
421842ed | 2386 | net->ipv6.fib6_null_entry); |
58f09b78 DL |
2387 | net->ipv6.fib6_main_tbl->tb6_root.fn_flags = |
2388 | RTN_ROOT | RTN_TL_ROOT | RTN_RTINFO; | |
8e773277 | 2389 | inet_peer_base_init(&net->ipv6.fib6_main_tbl->tb6_peers); |
e0b85590 DL |
2390 | |
2391 | #ifdef CONFIG_IPV6_MULTIPLE_TABLES | |
58f09b78 DL |
2392 | net->ipv6.fib6_local_tbl = kzalloc(sizeof(*net->ipv6.fib6_local_tbl), |
2393 | GFP_KERNEL); | |
2394 | if (!net->ipv6.fib6_local_tbl) | |
e0b85590 | 2395 | goto out_fib6_main_tbl; |
58f09b78 | 2396 | net->ipv6.fib6_local_tbl->tb6_id = RT6_TABLE_LOCAL; |
66f5d6ce | 2397 | rcu_assign_pointer(net->ipv6.fib6_local_tbl->tb6_root.leaf, |
421842ed | 2398 | net->ipv6.fib6_null_entry); |
58f09b78 DL |
2399 | net->ipv6.fib6_local_tbl->tb6_root.fn_flags = |
2400 | RTN_ROOT | RTN_TL_ROOT | RTN_RTINFO; | |
8e773277 | 2401 | inet_peer_base_init(&net->ipv6.fib6_local_tbl->tb6_peers); |
e0b85590 | 2402 | #endif |
58f09b78 | 2403 | fib6_tables_init(net); |
f845ab6b | 2404 | |
417f28bb | 2405 | return 0; |
d63bddbe | 2406 | |
e0b85590 | 2407 | #ifdef CONFIG_IPV6_MULTIPLE_TABLES |
e0b85590 | 2408 | out_fib6_main_tbl: |
58f09b78 | 2409 | kfree(net->ipv6.fib6_main_tbl); |
e0b85590 | 2410 | #endif |
e0b85590 | 2411 | out_fib_table_hash: |
58f09b78 | 2412 | kfree(net->ipv6.fib_table_hash); |
c572872f BT |
2413 | out_rt6_stats: |
2414 | kfree(net->ipv6.rt6_stats); | |
67db5ca7 | 2415 | out_notifier: |
16ab6d7d | 2416 | fib6_notifier_exit(net); |
417f28bb | 2417 | return -ENOMEM; |
8db46f1d | 2418 | } |
58f09b78 DL |
2419 | |
2420 | static void fib6_net_exit(struct net *net) | |
2421 | { | |
ba1cc08d SD |
2422 | unsigned int i; |
2423 | ||
417f28bb SH |
2424 | del_timer_sync(&net->ipv6.ip6_fib_timer); |
2425 | ||
32a805ba | 2426 | for (i = 0; i < FIB6_TABLE_HASHSZ; i++) { |
ba1cc08d SD |
2427 | struct hlist_head *head = &net->ipv6.fib_table_hash[i]; |
2428 | struct hlist_node *tmp; | |
2429 | struct fib6_table *tb; | |
2430 | ||
2431 | hlist_for_each_entry_safe(tb, tmp, head, tb6_hlist) { | |
2432 | hlist_del(&tb->tb6_hlist); | |
2433 | fib6_free_table(tb); | |
2434 | } | |
2435 | } | |
2436 | ||
58f09b78 | 2437 | kfree(net->ipv6.fib_table_hash); |
c572872f | 2438 | kfree(net->ipv6.rt6_stats); |
16ab6d7d | 2439 | fib6_notifier_exit(net); |
58f09b78 DL |
2440 | } |
2441 | ||
2442 | static struct pernet_operations fib6_net_ops = { | |
2443 | .init = fib6_net_init, | |
2444 | .exit = fib6_net_exit, | |
2445 | }; | |
2446 | ||
2447 | int __init fib6_init(void) | |
2448 | { | |
2449 | int ret = -ENOMEM; | |
63152fc0 | 2450 | |
58f09b78 | 2451 | fib6_node_kmem = kmem_cache_create("fib6_nodes", |
6126891c VA |
2452 | sizeof(struct fib6_node), 0, |
2453 | SLAB_HWCACHE_ALIGN | SLAB_ACCOUNT, | |
58f09b78 DL |
2454 | NULL); |
2455 | if (!fib6_node_kmem) | |
2456 | goto out; | |
2457 | ||
2458 | ret = register_pernet_subsys(&fib6_net_ops); | |
2459 | if (ret) | |
c572872f | 2460 | goto out_kmem_cache_create; |
e8803b6c | 2461 | |
16feebcf FW |
2462 | ret = rtnl_register_module(THIS_MODULE, PF_INET6, RTM_GETROUTE, NULL, |
2463 | inet6_dump_fib, 0); | |
e8803b6c DM |
2464 | if (ret) |
2465 | goto out_unregister_subsys; | |
705f1c86 HFS |
2466 | |
2467 | __fib6_flush_trees = fib6_flush_trees; | |
58f09b78 DL |
2468 | out: |
2469 | return ret; | |
2470 | ||
e8803b6c DM |
2471 | out_unregister_subsys: |
2472 | unregister_pernet_subsys(&fib6_net_ops); | |
d63bddbe DL |
2473 | out_kmem_cache_create: |
2474 | kmem_cache_destroy(fib6_node_kmem); | |
2475 | goto out; | |
1da177e4 LT |
2476 | } |
2477 | ||
2478 | void fib6_gc_cleanup(void) | |
2479 | { | |
58f09b78 | 2480 | unregister_pernet_subsys(&fib6_net_ops); |
1da177e4 LT |
2481 | kmem_cache_destroy(fib6_node_kmem); |
2482 | } | |
8d2ca1d7 HFS |
2483 | |
2484 | #ifdef CONFIG_PROC_FS | |
138d0be3 | 2485 | static int ipv6_route_native_seq_show(struct seq_file *seq, void *v) |
8d2ca1d7 | 2486 | { |
8d1c802b | 2487 | struct fib6_info *rt = v; |
8d2ca1d7 | 2488 | struct ipv6_route_iter *iter = seq->private; |
f88d8ea6 | 2489 | struct fib6_nh *fib6_nh = rt->fib6_nh; |
2b2450ca | 2490 | unsigned int flags = rt->fib6_flags; |
5e670d84 | 2491 | const struct net_device *dev; |
8d2ca1d7 | 2492 | |
f88d8ea6 | 2493 | if (rt->nh) |
28259bac | 2494 | fib6_nh = nexthop_fib6_nh_bh(rt->nh); |
f88d8ea6 | 2495 | |
93c2fb25 | 2496 | seq_printf(seq, "%pi6 %02x ", &rt->fib6_dst.addr, rt->fib6_dst.plen); |
8d2ca1d7 HFS |
2497 | |
2498 | #ifdef CONFIG_IPV6_SUBTREES | |
93c2fb25 | 2499 | seq_printf(seq, "%pi6 %02x ", &rt->fib6_src.addr, rt->fib6_src.plen); |
8d2ca1d7 HFS |
2500 | #else |
2501 | seq_puts(seq, "00000000000000000000000000000000 00 "); | |
2502 | #endif | |
f88d8ea6 | 2503 | if (fib6_nh->fib_nh_gw_family) { |
2b2450ca | 2504 | flags |= RTF_GATEWAY; |
f88d8ea6 | 2505 | seq_printf(seq, "%pi6", &fib6_nh->fib_nh_gw6); |
2b2450ca | 2506 | } else { |
8d2ca1d7 | 2507 | seq_puts(seq, "00000000000000000000000000000000"); |
2b2450ca | 2508 | } |
8d2ca1d7 | 2509 | |
f88d8ea6 | 2510 | dev = fib6_nh->fib_nh_dev; |
8d2ca1d7 | 2511 | seq_printf(seq, " %08x %08x %08x %08x %8s\n", |
f05713e0 | 2512 | rt->fib6_metric, refcount_read(&rt->fib6_ref), 0, |
2b2450ca | 2513 | flags, dev ? dev->name : ""); |
8d2ca1d7 HFS |
2514 | iter->w.leaf = NULL; |
2515 | return 0; | |
2516 | } | |
2517 | ||
94b2cfe0 | 2518 | static int ipv6_route_yield(struct fib6_walker *w) |
8d2ca1d7 HFS |
2519 | { |
2520 | struct ipv6_route_iter *iter = w->args; | |
2521 | ||
2522 | if (!iter->skip) | |
2523 | return 1; | |
2524 | ||
2525 | do { | |
66f5d6ce | 2526 | iter->w.leaf = rcu_dereference_protected( |
8fb11a9a | 2527 | iter->w.leaf->fib6_next, |
66f5d6ce | 2528 | lockdep_is_held(&iter->tbl->tb6_lock)); |
8d2ca1d7 HFS |
2529 | iter->skip--; |
2530 | if (!iter->skip && iter->w.leaf) | |
2531 | return 1; | |
2532 | } while (iter->w.leaf); | |
2533 | ||
2534 | return 0; | |
2535 | } | |
2536 | ||
9a03cd8f MK |
2537 | static void ipv6_route_seq_setup_walk(struct ipv6_route_iter *iter, |
2538 | struct net *net) | |
8d2ca1d7 HFS |
2539 | { |
2540 | memset(&iter->w, 0, sizeof(iter->w)); | |
2541 | iter->w.func = ipv6_route_yield; | |
2542 | iter->w.root = &iter->tbl->tb6_root; | |
2543 | iter->w.state = FWS_INIT; | |
2544 | iter->w.node = iter->w.root; | |
2545 | iter->w.args = iter; | |
aafc2e32 | 2546 | iter->sernum = READ_ONCE(iter->w.root->fn_sernum); |
8d2ca1d7 | 2547 | INIT_LIST_HEAD(&iter->w.lh); |
9a03cd8f | 2548 | fib6_walker_link(net, &iter->w); |
8d2ca1d7 HFS |
2549 | } |
2550 | ||
2551 | static struct fib6_table *ipv6_route_seq_next_table(struct fib6_table *tbl, | |
2552 | struct net *net) | |
2553 | { | |
2554 | unsigned int h; | |
2555 | struct hlist_node *node; | |
2556 | ||
2557 | if (tbl) { | |
2558 | h = (tbl->tb6_id & (FIB6_TABLE_HASHSZ - 1)) + 1; | |
2559 | node = rcu_dereference_bh(hlist_next_rcu(&tbl->tb6_hlist)); | |
2560 | } else { | |
2561 | h = 0; | |
2562 | node = NULL; | |
2563 | } | |
2564 | ||
2565 | while (!node && h < FIB6_TABLE_HASHSZ) { | |
2566 | node = rcu_dereference_bh( | |
2567 | hlist_first_rcu(&net->ipv6.fib_table_hash[h++])); | |
2568 | } | |
2569 | return hlist_entry_safe(node, struct fib6_table, tb6_hlist); | |
2570 | } | |
2571 | ||
0a67d3ef HFS |
2572 | static void ipv6_route_check_sernum(struct ipv6_route_iter *iter) |
2573 | { | |
aafc2e32 ED |
2574 | int sernum = READ_ONCE(iter->w.root->fn_sernum); |
2575 | ||
2576 | if (iter->sernum != sernum) { | |
2577 | iter->sernum = sernum; | |
0a67d3ef HFS |
2578 | iter->w.state = FWS_INIT; |
2579 | iter->w.node = iter->w.root; | |
2580 | WARN_ON(iter->w.skip); | |
2581 | iter->w.skip = iter->w.count; | |
2582 | } | |
2583 | } | |
2584 | ||
8d2ca1d7 HFS |
2585 | static void *ipv6_route_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
2586 | { | |
2587 | int r; | |
8d1c802b | 2588 | struct fib6_info *n; |
8d2ca1d7 HFS |
2589 | struct net *net = seq_file_net(seq); |
2590 | struct ipv6_route_iter *iter = seq->private; | |
2591 | ||
4fc427e0 | 2592 | ++(*pos); |
8d2ca1d7 HFS |
2593 | if (!v) |
2594 | goto iter_table; | |
2595 | ||
8fb11a9a | 2596 | n = rcu_dereference_bh(((struct fib6_info *)v)->fib6_next); |
4fc427e0 | 2597 | if (n) |
8d2ca1d7 | 2598 | return n; |
8d2ca1d7 HFS |
2599 | |
2600 | iter_table: | |
0a67d3ef | 2601 | ipv6_route_check_sernum(iter); |
66f5d6ce | 2602 | spin_lock_bh(&iter->tbl->tb6_lock); |
8d2ca1d7 | 2603 | r = fib6_walk_continue(&iter->w); |
66f5d6ce | 2604 | spin_unlock_bh(&iter->tbl->tb6_lock); |
8d2ca1d7 | 2605 | if (r > 0) { |
8d2ca1d7 HFS |
2606 | return iter->w.leaf; |
2607 | } else if (r < 0) { | |
9a03cd8f | 2608 | fib6_walker_unlink(net, &iter->w); |
8d2ca1d7 HFS |
2609 | return NULL; |
2610 | } | |
9a03cd8f | 2611 | fib6_walker_unlink(net, &iter->w); |
8d2ca1d7 HFS |
2612 | |
2613 | iter->tbl = ipv6_route_seq_next_table(iter->tbl, net); | |
2614 | if (!iter->tbl) | |
2615 | return NULL; | |
2616 | ||
9a03cd8f | 2617 | ipv6_route_seq_setup_walk(iter, net); |
8d2ca1d7 HFS |
2618 | goto iter_table; |
2619 | } | |
2620 | ||
2621 | static void *ipv6_route_seq_start(struct seq_file *seq, loff_t *pos) | |
2622 | __acquires(RCU_BH) | |
2623 | { | |
2624 | struct net *net = seq_file_net(seq); | |
2625 | struct ipv6_route_iter *iter = seq->private; | |
2626 | ||
2627 | rcu_read_lock_bh(); | |
2628 | iter->tbl = ipv6_route_seq_next_table(NULL, net); | |
2629 | iter->skip = *pos; | |
2630 | ||
2631 | if (iter->tbl) { | |
6617dfd4 YS |
2632 | loff_t p = 0; |
2633 | ||
9a03cd8f | 2634 | ipv6_route_seq_setup_walk(iter, net); |
6617dfd4 | 2635 | return ipv6_route_seq_next(seq, NULL, &p); |
8d2ca1d7 HFS |
2636 | } else { |
2637 | return NULL; | |
2638 | } | |
2639 | } | |
2640 | ||
2641 | static bool ipv6_route_iter_active(struct ipv6_route_iter *iter) | |
2642 | { | |
94b2cfe0 | 2643 | struct fib6_walker *w = &iter->w; |
8d2ca1d7 HFS |
2644 | return w->node && !(w->state == FWS_U && w->node == w->root); |
2645 | } | |
2646 | ||
138d0be3 | 2647 | static void ipv6_route_native_seq_stop(struct seq_file *seq, void *v) |
8d2ca1d7 HFS |
2648 | __releases(RCU_BH) |
2649 | { | |
9a03cd8f | 2650 | struct net *net = seq_file_net(seq); |
8d2ca1d7 HFS |
2651 | struct ipv6_route_iter *iter = seq->private; |
2652 | ||
2653 | if (ipv6_route_iter_active(iter)) | |
9a03cd8f | 2654 | fib6_walker_unlink(net, &iter->w); |
8d2ca1d7 HFS |
2655 | |
2656 | rcu_read_unlock_bh(); | |
2657 | } | |
2658 | ||
138d0be3 | 2659 | #if IS_BUILTIN(CONFIG_IPV6) && defined(CONFIG_BPF_SYSCALL) |
138d0be3 YS |
2660 | static int ipv6_route_prog_seq_show(struct bpf_prog *prog, |
2661 | struct bpf_iter_meta *meta, | |
2662 | void *v) | |
2663 | { | |
2664 | struct bpf_iter__ipv6_route ctx; | |
2665 | ||
2666 | ctx.meta = meta; | |
2667 | ctx.rt = v; | |
2668 | return bpf_iter_run_prog(prog, &ctx); | |
2669 | } | |
2670 | ||
2671 | static int ipv6_route_seq_show(struct seq_file *seq, void *v) | |
2672 | { | |
2673 | struct ipv6_route_iter *iter = seq->private; | |
2674 | struct bpf_iter_meta meta; | |
2675 | struct bpf_prog *prog; | |
2676 | int ret; | |
2677 | ||
2678 | meta.seq = seq; | |
2679 | prog = bpf_iter_get_info(&meta, false); | |
2680 | if (!prog) | |
2681 | return ipv6_route_native_seq_show(seq, v); | |
2682 | ||
2683 | ret = ipv6_route_prog_seq_show(prog, &meta, v); | |
2684 | iter->w.leaf = NULL; | |
2685 | ||
2686 | return ret; | |
2687 | } | |
2688 | ||
2689 | static void ipv6_route_seq_stop(struct seq_file *seq, void *v) | |
2690 | { | |
2691 | struct bpf_iter_meta meta; | |
2692 | struct bpf_prog *prog; | |
2693 | ||
2694 | if (!v) { | |
2695 | meta.seq = seq; | |
2696 | prog = bpf_iter_get_info(&meta, true); | |
2697 | if (prog) | |
2698 | (void)ipv6_route_prog_seq_show(prog, &meta, v); | |
2699 | } | |
2700 | ||
2701 | ipv6_route_native_seq_stop(seq, v); | |
2702 | } | |
2703 | #else | |
2704 | static int ipv6_route_seq_show(struct seq_file *seq, void *v) | |
2705 | { | |
2706 | return ipv6_route_native_seq_show(seq, v); | |
2707 | } | |
2708 | ||
2709 | static void ipv6_route_seq_stop(struct seq_file *seq, void *v) | |
2710 | { | |
2711 | ipv6_route_native_seq_stop(seq, v); | |
2712 | } | |
2713 | #endif | |
2714 | ||
c3506372 | 2715 | const struct seq_operations ipv6_route_seq_ops = { |
8d2ca1d7 HFS |
2716 | .start = ipv6_route_seq_start, |
2717 | .next = ipv6_route_seq_next, | |
2718 | .stop = ipv6_route_seq_stop, | |
2719 | .show = ipv6_route_seq_show | |
2720 | }; | |
8d2ca1d7 | 2721 | #endif /* CONFIG_PROC_FS */ |