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