1 /* $OpenBSD: kroute.c,v 1.91 2011/09/16 18:24:57 sthen Exp $ */ 2 3 /* 4 * Copyright (c) 2004 Esben Norby <norby@openbsd.org> 5 * Copyright (c) 2003, 2004 Henning Brauer <henning@openbsd.org> 6 * 7 * Permission to use, copy, modify, and distribute this software for any 8 * purpose with or without fee is hereby granted, provided that the above 9 * copyright notice and this permission notice appear in all copies. 10 * 11 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES 12 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF 13 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR 14 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES 15 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN 16 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF 17 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. 18 */ 19 20 #include <sys/param.h> 21 #include <sys/types.h> 22 #include <sys/socket.h> 23 #include <sys/sysctl.h> 24 #include <sys/tree.h> 25 #include <sys/uio.h> 26 #include <netinet/in.h> 27 #include <arpa/inet.h> 28 #include <net/if.h> 29 #include <net/if_dl.h> 30 #include <net/if_types.h> 31 #include <net/route.h> 32 #include <err.h> 33 #include <errno.h> 34 #include <fcntl.h> 35 #include <stdio.h> 36 #include <stdlib.h> 37 #include <string.h> 38 #include <unistd.h> 39 40 #include "ospfd.h" 41 #include "log.h" 42 43 struct { 44 u_int32_t rtseq; 45 pid_t pid; 46 int fib_sync; 47 int fib_serial; 48 int fd; 49 struct event ev; 50 struct event reload; 51 u_int rdomain; 52 #define KR_RELOAD_IDLE 0 53 #define KR_RELOAD_FETCH 1 54 #define KR_RELOAD_HOLD 2 55 int reload_state; 56 } kr_state; 57 58 struct kroute_node { 59 RB_ENTRY(kroute_node) entry; 60 struct kroute_node *next; 61 struct kroute r; 62 int serial; 63 }; 64 65 struct kif_node { 66 RB_ENTRY(kif_node) entry; 67 TAILQ_HEAD(, kif_addr) addrs; 68 struct kif k; 69 }; 70 71 void kr_redist_remove(struct kroute_node *, struct kroute_node *); 72 int kr_redist_eval(struct kroute *, struct kroute *); 73 void kr_redistribute(struct kroute_node *); 74 int kroute_compare(struct kroute_node *, struct kroute_node *); 75 int kif_compare(struct kif_node *, struct kif_node *); 76 int kr_change_fib(struct kroute_node *, struct kroute *, int, int); 77 int kr_delete_fib(struct kroute_node *); 78 79 struct kroute_node *kroute_find(in_addr_t, u_int8_t, u_int8_t); 80 struct kroute_node *kroute_matchgw(struct kroute_node *, struct in_addr); 81 int kroute_insert(struct kroute_node *); 82 int kroute_remove(struct kroute_node *); 83 void kroute_clear(void); 84 85 struct kif_node *kif_find(u_short); 86 struct kif_node *kif_insert(u_short); 87 int kif_remove(struct kif_node *); 88 void kif_clear(void); 89 struct kif *kif_update(u_short, int, struct if_data *, 90 struct sockaddr_dl *); 91 int kif_validate(u_short); 92 93 struct kroute_node *kroute_match(in_addr_t); 94 95 int protect_lo(void); 96 u_int8_t prefixlen_classful(in_addr_t); 97 void get_rtaddrs(int, struct sockaddr *, struct sockaddr **); 98 void if_change(u_short, int, struct if_data *, struct sockaddr_dl *); 99 void if_newaddr(u_short, struct sockaddr_in *, struct sockaddr_in *, 100 struct sockaddr_in *); 101 void if_deladdr(u_short, struct sockaddr_in *, struct sockaddr_in *, 102 struct sockaddr_in *); 103 void if_announce(void *); 104 105 int send_rtmsg(int, int, struct kroute *); 106 int dispatch_rtmsg(void); 107 int fetchtable(void); 108 int fetchifs(u_short); 109 int rtmsg_process(char *, int); 110 void kr_fib_reload_timer(int, short, void *); 111 void kr_fib_reload_arm_timer(int); 112 113 RB_HEAD(kroute_tree, kroute_node) krt; 114 RB_PROTOTYPE(kroute_tree, kroute_node, entry, kroute_compare) 115 RB_GENERATE(kroute_tree, kroute_node, entry, kroute_compare) 116 117 RB_HEAD(kif_tree, kif_node) kit; 118 RB_PROTOTYPE(kif_tree, kif_node, entry, kif_compare) 119 RB_GENERATE(kif_tree, kif_node, entry, kif_compare) 120 121 int 122 kif_init(void) 123 { 124 RB_INIT(&kit); 125 /* init also krt tree so that we can call kr_shutdown() */ 126 RB_INIT(&krt); 127 kr_state.fib_sync = 0; /* decoupled */ 128 129 if (fetchifs(0) == -1) 130 return (-1); 131 132 return (0); 133 } 134 135 int 136 kr_init(int fs, u_int rdomain) 137 { 138 int opt = 0, rcvbuf, default_rcvbuf; 139 socklen_t optlen; 140 141 kr_state.fib_sync = fs; 142 kr_state.rdomain = rdomain; 143 144 if ((kr_state.fd = socket(AF_ROUTE, SOCK_RAW, AF_INET)) == -1) { 145 log_warn("kr_init: socket"); 146 return (-1); 147 } 148 149 /* not interested in my own messages */ 150 if (setsockopt(kr_state.fd, SOL_SOCKET, SO_USELOOPBACK, 151 &opt, sizeof(opt)) == -1) 152 log_warn("kr_init: setsockopt"); /* not fatal */ 153 154 /* grow receive buffer, don't wanna miss messages */ 155 optlen = sizeof(default_rcvbuf); 156 if (getsockopt(kr_state.fd, SOL_SOCKET, SO_RCVBUF, 157 &default_rcvbuf, &optlen) == -1) 158 log_warn("kr_init getsockopt SOL_SOCKET SO_RCVBUF"); 159 else 160 for (rcvbuf = MAX_RTSOCK_BUF; 161 rcvbuf > default_rcvbuf && 162 setsockopt(kr_state.fd, SOL_SOCKET, SO_RCVBUF, 163 &rcvbuf, sizeof(rcvbuf)) == -1 && errno == ENOBUFS; 164 rcvbuf /= 2) 165 ; /* nothing */ 166 167 kr_state.pid = getpid(); 168 kr_state.rtseq = 1; 169 170 if (fetchtable() == -1) 171 return (-1); 172 173 if (protect_lo() == -1) 174 return (-1); 175 176 event_set(&kr_state.ev, kr_state.fd, EV_READ | EV_PERSIST, 177 kr_dispatch_msg, NULL); 178 event_add(&kr_state.ev, NULL); 179 180 kr_state.reload_state = KR_RELOAD_IDLE; 181 evtimer_set(&kr_state.reload, kr_fib_reload_timer, NULL); 182 183 return (0); 184 } 185 186 int 187 kr_change_fib(struct kroute_node *kr, struct kroute *kroute, int krcount, 188 int action) 189 { 190 int i; 191 struct kroute_node *kn, *nkn; 192 193 if (action == RTM_ADD) { 194 /* 195 * First remove all stale multipath routes. 196 * This step must be skipped when the action is RTM_CHANGE 197 * because it is already a single path route that will be 198 * changed. 199 */ 200 for (kn = kr; kn != NULL; kn = nkn) { 201 for (i = 0; i < krcount; i++) { 202 if (kn->r.nexthop.s_addr == 203 kroute[i].nexthop.s_addr) 204 break; 205 } 206 nkn = kn->next; 207 if (i == krcount) { 208 /* stale route */ 209 if (kr_delete_fib(kn) == -1) 210 log_warnx("kr_delete_fib failed"); 211 /* 212 * if head element was removed we need to adjust 213 * the head 214 */ 215 if (kr == kn) 216 kr = nkn; 217 } 218 } 219 } 220 221 /* 222 * now add or change the route 223 */ 224 for (i = 0; i < krcount; i++) { 225 /* nexthop within 127/8 -> ignore silently */ 226 if ((kroute[i].nexthop.s_addr & htonl(IN_CLASSA_NET)) == 227 htonl(INADDR_LOOPBACK & IN_CLASSA_NET)) 228 continue; 229 230 if (action == RTM_ADD && kr) { 231 for (kn = kr; kn != NULL; kn = kn->next) { 232 if (kn->r.nexthop.s_addr == 233 kroute[i].nexthop.s_addr) 234 break; 235 } 236 237 if (kn != NULL) 238 /* nexthop already present, skip it */ 239 continue; 240 } else 241 /* modify first entry */ 242 kn = kr; 243 244 /* send update */ 245 if (send_rtmsg(kr_state.fd, action, &kroute[i]) == -1) 246 return (-1); 247 248 /* create new entry unless we are changing the first entry */ 249 if (action == RTM_ADD) 250 if ((kn = calloc(1, sizeof(*kn))) == NULL) 251 fatal(NULL); 252 253 kn->r.prefix.s_addr = kroute[i].prefix.s_addr; 254 kn->r.prefixlen = kroute[i].prefixlen; 255 kn->r.nexthop.s_addr = kroute[i].nexthop.s_addr; 256 kn->r.flags = kroute[i].flags | F_OSPFD_INSERTED; 257 kn->r.priority = RTP_OSPF; 258 kn->r.ext_tag = kroute[i].ext_tag; 259 rtlabel_unref(kn->r.rtlabel); /* for RTM_CHANGE */ 260 kn->r.rtlabel = kroute[i].rtlabel; 261 262 if (action == RTM_ADD) 263 if (kroute_insert(kn) == -1) { 264 log_debug("kr_update_fib: cannot insert %s", 265 inet_ntoa(kn->r.nexthop)); 266 free(kn); 267 } 268 action = RTM_ADD; 269 } 270 return (0); 271 } 272 273 int 274 kr_change(struct kroute *kroute, int krcount) 275 { 276 struct kroute_node *kr; 277 int action = RTM_ADD; 278 279 kroute->rtlabel = rtlabel_tag2id(kroute->ext_tag); 280 281 kr = kroute_find(kroute->prefix.s_addr, kroute->prefixlen, RTP_OSPF); 282 if (kr != NULL && kr->next == NULL && krcount == 1) 283 /* single path OSPF route */ 284 action = RTM_CHANGE; 285 286 return (kr_change_fib(kr, kroute, krcount, action)); 287 } 288 289 int 290 kr_delete_fib(struct kroute_node *kr) 291 { 292 if (kr->r.priority != RTP_OSPF) 293 log_warn("kr_delete_fib: %s/%d has wrong priority %d", 294 inet_ntoa(kr->r.prefix), kr->r.prefixlen, kr->r.priority); 295 296 if (send_rtmsg(kr_state.fd, RTM_DELETE, &kr->r) == -1) 297 return (-1); 298 299 if (kroute_remove(kr) == -1) 300 return (-1); 301 302 return (0); 303 } 304 305 int 306 kr_delete(struct kroute *kroute) 307 { 308 struct kroute_node *kr, *nkr; 309 310 if ((kr = kroute_find(kroute->prefix.s_addr, kroute->prefixlen, 311 RTP_OSPF)) == NULL) 312 return (0); 313 314 while (kr != NULL) { 315 nkr = kr->next; 316 if (kr_delete_fib(kr) == -1) 317 return (-1); 318 kr = nkr; 319 } 320 return (0); 321 } 322 323 void 324 kr_shutdown(void) 325 { 326 kr_fib_decouple(); 327 kroute_clear(); 328 kif_clear(); 329 } 330 331 void 332 kr_fib_couple(void) 333 { 334 struct kroute_node *kr; 335 struct kroute_node *kn; 336 337 if (kr_state.fib_sync == 1) /* already coupled */ 338 return; 339 340 kr_state.fib_sync = 1; 341 342 RB_FOREACH(kr, kroute_tree, &krt) 343 if (kr->r.priority == RTP_OSPF) 344 for (kn = kr; kn != NULL; kn = kn->next) 345 send_rtmsg(kr_state.fd, RTM_ADD, &kn->r); 346 347 log_info("kernel routing table coupled"); 348 } 349 350 void 351 kr_fib_decouple(void) 352 { 353 struct kroute_node *kr; 354 struct kroute_node *kn; 355 356 if (kr_state.fib_sync == 0) /* already decoupled */ 357 return; 358 359 RB_FOREACH(kr, kroute_tree, &krt) 360 if (kr->r.priority == RTP_OSPF) 361 for (kn = kr; kn != NULL; kn = kn->next) 362 send_rtmsg(kr_state.fd, RTM_DELETE, &kn->r); 363 364 kr_state.fib_sync = 0; 365 366 log_info("kernel routing table decoupled"); 367 } 368 369 void 370 kr_fib_reload_timer(int fd, short event, void *bula) 371 { 372 if (kr_state.reload_state == KR_RELOAD_FETCH) { 373 kr_fib_reload(); 374 kr_state.reload_state = KR_RELOAD_HOLD; 375 kr_fib_reload_arm_timer(KR_RELOAD_HOLD_TIMER); 376 } else { 377 kr_state.reload_state = KR_RELOAD_IDLE; 378 } 379 } 380 381 void 382 kr_fib_reload_arm_timer(int delay) 383 { 384 struct timeval tv; 385 386 timerclear(&tv); 387 tv.tv_sec = delay / 1000; 388 tv.tv_usec = (delay % 1000) * 1000; 389 390 if (evtimer_add(&kr_state.reload, &tv) == -1) 391 fatal("add_reload_timer"); 392 } 393 394 void 395 kr_fib_reload() 396 { 397 struct kroute_node *krn, *kr, *kn; 398 399 log_info("reloading interface list and routing table"); 400 401 kr_state.fib_serial++; 402 403 if (fetchifs(0) == -1 || fetchtable() == -1) 404 return; 405 406 for (kr = RB_MIN(kroute_tree, &krt); kr != NULL; kr = krn) { 407 krn = RB_NEXT(kroute_tree, &krt, kr); 408 409 do { 410 kn = kr->next; 411 412 if (kr->serial != kr_state.fib_serial) { 413 if (kr->r.priority == RTP_OSPF) { 414 kr->serial = kr_state.fib_serial; 415 if (send_rtmsg(kr_state.fd, 416 RTM_ADD, &kr->r) != 0) 417 break; 418 } else 419 kroute_remove(kr); 420 } 421 422 } while ((kr = kn) != NULL); 423 } 424 } 425 426 /* ARGSUSED */ 427 void 428 kr_dispatch_msg(int fd, short event, void *bula) 429 { 430 /* XXX this is stupid */ 431 if (dispatch_rtmsg() == -1) 432 event_loopexit(NULL); 433 } 434 435 void 436 kr_show_route(struct imsg *imsg) 437 { 438 struct kroute_node *kr; 439 struct kroute_node *kn; 440 int flags; 441 struct in_addr addr; 442 443 switch (imsg->hdr.type) { 444 case IMSG_CTL_KROUTE: 445 if (imsg->hdr.len != IMSG_HEADER_SIZE + sizeof(flags)) { 446 log_warnx("kr_show_route: wrong imsg len"); 447 return; 448 } 449 memcpy(&flags, imsg->data, sizeof(flags)); 450 RB_FOREACH(kr, kroute_tree, &krt) 451 if (!flags || kr->r.flags & flags) { 452 kn = kr; 453 do { 454 main_imsg_compose_ospfe(IMSG_CTL_KROUTE, 455 imsg->hdr.pid, 456 &kn->r, sizeof(kn->r)); 457 } while ((kn = kn->next) != NULL); 458 } 459 break; 460 case IMSG_CTL_KROUTE_ADDR: 461 if (imsg->hdr.len != IMSG_HEADER_SIZE + 462 sizeof(struct in_addr)) { 463 log_warnx("kr_show_route: wrong imsg len"); 464 return; 465 } 466 memcpy(&addr, imsg->data, sizeof(addr)); 467 kr = NULL; 468 kr = kroute_match(addr.s_addr); 469 if (kr != NULL) 470 main_imsg_compose_ospfe(IMSG_CTL_KROUTE, imsg->hdr.pid, 471 &kr->r, sizeof(kr->r)); 472 break; 473 default: 474 log_debug("kr_show_route: error handling imsg"); 475 break; 476 } 477 478 main_imsg_compose_ospfe(IMSG_CTL_END, imsg->hdr.pid, NULL, 0); 479 } 480 481 void 482 kr_ifinfo(char *ifname, pid_t pid) 483 { 484 struct kif_node *kif; 485 486 RB_FOREACH(kif, kif_tree, &kit) 487 if (ifname == NULL || !strcmp(ifname, kif->k.ifname)) { 488 main_imsg_compose_ospfe(IMSG_CTL_IFINFO, 489 pid, &kif->k, sizeof(kif->k)); 490 } 491 492 main_imsg_compose_ospfe(IMSG_CTL_END, pid, NULL, 0); 493 } 494 495 void 496 kr_redist_remove(struct kroute_node *kh, struct kroute_node *kn) 497 { 498 struct kroute *rr; 499 500 /* was the route redistributed? */ 501 if ((kn->r.flags & F_REDISTRIBUTED) == 0) 502 return; 503 504 /* remove redistributed flag */ 505 kn->r.flags &= ~F_REDISTRIBUTED; 506 rr = &kn->r; 507 508 /* probably inform the RDE (check if no other path is redistributed) */ 509 for (kn = kh; kn; kn = kn->next) 510 if (kn->r.flags & F_REDISTRIBUTED) 511 break; 512 513 if (kn == NULL) 514 main_imsg_compose_rde(IMSG_NETWORK_DEL, 0, rr, 515 sizeof(struct kroute)); 516 } 517 518 int 519 kr_redist_eval(struct kroute *kr, struct kroute *rr) 520 { 521 u_int32_t a, metric = 0; 522 523 /* Only non-ospfd routes are considered for redistribution. */ 524 if (!(kr->flags & F_KERNEL)) 525 goto dont_redistribute; 526 527 /* Dynamic routes are not redistributable. */ 528 if (kr->flags & F_DYNAMIC) 529 goto dont_redistribute; 530 531 /* interface is not up and running so don't announce */ 532 if (kr->flags & F_DOWN) 533 goto dont_redistribute; 534 535 /* 536 * We consider the loopback net, multicast and experimental addresses 537 * as not redistributable. 538 */ 539 a = ntohl(kr->prefix.s_addr); 540 if (IN_MULTICAST(a) || IN_BADCLASS(a) || 541 (a >> IN_CLASSA_NSHIFT) == IN_LOOPBACKNET) 542 goto dont_redistribute; 543 /* 544 * Consider networks with nexthop loopback as not redistributable 545 * unless it is a reject or blackhole route. 546 */ 547 if (kr->nexthop.s_addr == htonl(INADDR_LOOPBACK) && 548 !(kr->flags & (F_BLACKHOLE|F_REJECT))) 549 goto dont_redistribute; 550 551 /* Should we redistribute this route? */ 552 if (!ospf_redistribute(kr, &metric)) 553 goto dont_redistribute; 554 555 /* prefix should be redistributed */ 556 kr->flags |= F_REDISTRIBUTED; 557 /* 558 * only one of all multipath routes can be redistributed so 559 * redistribute the best one. 560 */ 561 if (rr->metric > metric) { 562 *rr = *kr; 563 rr->metric = metric; 564 } 565 566 return (1); 567 568 dont_redistribute: 569 /* was the route redistributed? */ 570 if ((kr->flags & F_REDISTRIBUTED) == 0) 571 return (0); 572 573 kr->flags &= ~F_REDISTRIBUTED; 574 return (1); 575 } 576 577 void 578 kr_redistribute(struct kroute_node *kh) 579 { 580 struct kroute_node *kn; 581 struct kroute rr; 582 int redistribute = 0; 583 584 /* only the highest prio route can be redistributed */ 585 if (kroute_find(kh->r.prefix.s_addr, kh->r.prefixlen, RTP_ANY) != kh) 586 return; 587 588 bzero(&rr, sizeof(rr)); 589 rr.metric = UINT_MAX; 590 for (kn = kh; kn; kn = kn->next) 591 if (kr_redist_eval(&kn->r, &rr)) 592 redistribute = 1; 593 594 if (!redistribute) 595 return; 596 597 if (rr.flags & F_REDISTRIBUTED) { 598 main_imsg_compose_rde(IMSG_NETWORK_ADD, 0, &rr, 599 sizeof(struct kroute)); 600 } else { 601 rr = kh->r; 602 main_imsg_compose_rde(IMSG_NETWORK_DEL, 0, &rr, 603 sizeof(struct kroute)); 604 } 605 } 606 607 void 608 kr_reload(void) 609 { 610 struct kroute_node *kr, *kn; 611 u_int32_t dummy; 612 int r; 613 614 RB_FOREACH(kr, kroute_tree, &krt) { 615 for (kn = kr; kn; kn = kn->next) { 616 r = ospf_redistribute(&kn->r, &dummy); 617 /* 618 * if it is redistributed, redistribute again metric 619 * may have changed. 620 */ 621 if ((kn->r.flags & F_REDISTRIBUTED && !r) || r) 622 break; 623 } 624 if (kn) { 625 /* 626 * kr_redistribute copes with removes and RDE with 627 * duplicates 628 */ 629 kr_redistribute(kr); 630 } 631 } 632 } 633 634 /* rb-tree compare */ 635 int 636 kroute_compare(struct kroute_node *a, struct kroute_node *b) 637 { 638 if (ntohl(a->r.prefix.s_addr) < ntohl(b->r.prefix.s_addr)) 639 return (-1); 640 if (ntohl(a->r.prefix.s_addr) > ntohl(b->r.prefix.s_addr)) 641 return (1); 642 if (a->r.prefixlen < b->r.prefixlen) 643 return (-1); 644 if (a->r.prefixlen > b->r.prefixlen) 645 return (1); 646 647 /* if the priority is RTP_ANY finish on the first address hit */ 648 if (a->r.priority == RTP_ANY || b->r.priority == RTP_ANY) 649 return (0); 650 if (a->r.priority < b->r.priority) 651 return (-1); 652 if (a->r.priority > b->r.priority) 653 return (1); 654 return (0); 655 } 656 657 int 658 kif_compare(struct kif_node *a, struct kif_node *b) 659 { 660 return (b->k.ifindex - a->k.ifindex); 661 } 662 663 /* tree management */ 664 struct kroute_node * 665 kroute_find(in_addr_t prefix, u_int8_t prefixlen, u_int8_t prio) 666 { 667 struct kroute_node s; 668 struct kroute_node *kn, *tmp; 669 670 s.r.prefix.s_addr = prefix; 671 s.r.prefixlen = prefixlen; 672 s.r.priority = prio; 673 674 kn = RB_FIND(kroute_tree, &krt, &s); 675 if (kn && prio == RTP_ANY) { 676 tmp = RB_PREV(kroute_tree, &krt, kn); 677 while (tmp) { 678 if (kroute_compare(&s, tmp) == 0) 679 kn = tmp; 680 else 681 break; 682 tmp = RB_PREV(kroute_tree, &krt, kn); 683 } 684 } 685 return (kn); 686 } 687 688 struct kroute_node * 689 kroute_matchgw(struct kroute_node *kr, struct in_addr nh) 690 { 691 in_addr_t nexthop; 692 693 nexthop = nh.s_addr; 694 695 while (kr) { 696 if (kr->r.nexthop.s_addr == nexthop) 697 return (kr); 698 kr = kr->next; 699 } 700 701 return (NULL); 702 } 703 704 int 705 kroute_insert(struct kroute_node *kr) 706 { 707 struct kroute_node *krm, *krh; 708 709 kr->serial = kr_state.fib_serial; 710 711 if ((krh = RB_INSERT(kroute_tree, &krt, kr)) != NULL) { 712 /* 713 * Multipath route, add at end of list. 714 */ 715 krm = krh; 716 while (krm->next != NULL) 717 krm = krm->next; 718 krm->next = kr; 719 kr->next = NULL; /* to be sure */ 720 } else 721 krh = kr; 722 723 if (!(kr->r.flags & F_KERNEL)) { 724 /* don't validate or redistribute ospf route */ 725 kr->r.flags &= ~F_DOWN; 726 return (0); 727 } 728 729 if (kif_validate(kr->r.ifindex)) 730 kr->r.flags &= ~F_DOWN; 731 else 732 kr->r.flags |= F_DOWN; 733 734 kr_redistribute(krh); 735 return (0); 736 } 737 738 int 739 kroute_remove(struct kroute_node *kr) 740 { 741 struct kroute_node *krm; 742 743 if ((krm = RB_FIND(kroute_tree, &krt, kr)) == NULL) { 744 log_warnx("kroute_remove failed to find %s/%u", 745 inet_ntoa(kr->r.prefix), kr->r.prefixlen); 746 return (-1); 747 } 748 749 if (krm == kr) { 750 /* head element */ 751 if (RB_REMOVE(kroute_tree, &krt, kr) == NULL) { 752 log_warnx("kroute_remove failed for %s/%u", 753 inet_ntoa(kr->r.prefix), kr->r.prefixlen); 754 return (-1); 755 } 756 if (kr->next != NULL) { 757 if (RB_INSERT(kroute_tree, &krt, kr->next) != NULL) { 758 log_warnx("kroute_remove failed to add %s/%u", 759 inet_ntoa(kr->r.prefix), kr->r.prefixlen); 760 return (-1); 761 } 762 } 763 } else { 764 /* somewhere in the list */ 765 while (krm->next != kr && krm->next != NULL) 766 krm = krm->next; 767 if (krm->next == NULL) { 768 log_warnx("kroute_remove multipath list corrupted " 769 "for %s/%u", inet_ntoa(kr->r.prefix), 770 kr->r.prefixlen); 771 return (-1); 772 } 773 krm->next = kr->next; 774 } 775 776 kr_redist_remove(krm, kr); 777 rtlabel_unref(kr->r.rtlabel); 778 779 free(kr); 780 return (0); 781 } 782 783 void 784 kroute_clear(void) 785 { 786 struct kroute_node *kr; 787 788 while ((kr = RB_MIN(kroute_tree, &krt)) != NULL) 789 kroute_remove(kr); 790 } 791 792 struct kif_node * 793 kif_find(u_short ifindex) 794 { 795 struct kif_node s; 796 797 bzero(&s, sizeof(s)); 798 s.k.ifindex = ifindex; 799 800 return (RB_FIND(kif_tree, &kit, &s)); 801 } 802 803 struct kif * 804 kif_findname(char *ifname, struct in_addr addr, struct kif_addr **kap) 805 { 806 struct kif_node *kif; 807 struct kif_addr *ka; 808 809 RB_FOREACH(kif, kif_tree, &kit) 810 if (!strcmp(ifname, kif->k.ifname)) { 811 ka = TAILQ_FIRST(&kif->addrs); 812 if (addr.s_addr != 0) { 813 TAILQ_FOREACH(ka, &kif->addrs, entry) { 814 if (addr.s_addr == ka->addr.s_addr) 815 break; 816 } 817 } 818 if (kap != NULL) 819 *kap = ka; 820 return (&kif->k); 821 } 822 823 return (NULL); 824 } 825 826 struct kif_node * 827 kif_insert(u_short ifindex) 828 { 829 struct kif_node *kif; 830 831 if ((kif = calloc(1, sizeof(struct kif_node))) == NULL) 832 return (NULL); 833 834 kif->k.ifindex = ifindex; 835 TAILQ_INIT(&kif->addrs); 836 837 if (RB_INSERT(kif_tree, &kit, kif) != NULL) 838 fatalx("kif_insert: RB_INSERT"); 839 840 return (kif); 841 } 842 843 int 844 kif_remove(struct kif_node *kif) 845 { 846 struct kif_addr *ka; 847 848 if (RB_REMOVE(kif_tree, &kit, kif) == NULL) { 849 log_warnx("RB_REMOVE(kif_tree, &kit, kif)"); 850 return (-1); 851 } 852 853 while ((ka = TAILQ_FIRST(&kif->addrs)) != NULL) { 854 TAILQ_REMOVE(&kif->addrs, ka, entry); 855 free(ka); 856 } 857 free(kif); 858 return (0); 859 } 860 861 void 862 kif_clear(void) 863 { 864 struct kif_node *kif; 865 866 while ((kif = RB_MIN(kif_tree, &kit)) != NULL) 867 kif_remove(kif); 868 } 869 870 struct kif * 871 kif_update(u_short ifindex, int flags, struct if_data *ifd, 872 struct sockaddr_dl *sdl) 873 { 874 struct kif_node *kif; 875 876 if ((kif = kif_find(ifindex)) == NULL) { 877 if ((kif = kif_insert(ifindex)) == NULL) 878 return (NULL); 879 kif->k.nh_reachable = (flags & IFF_UP) && 880 LINK_STATE_IS_UP(ifd->ifi_link_state); 881 } 882 883 kif->k.flags = flags; 884 kif->k.link_state = ifd->ifi_link_state; 885 kif->k.media_type = ifd->ifi_type; 886 kif->k.baudrate = ifd->ifi_baudrate; 887 kif->k.mtu = ifd->ifi_mtu; 888 889 if (sdl && sdl->sdl_family == AF_LINK) { 890 if (sdl->sdl_nlen >= sizeof(kif->k.ifname)) 891 memcpy(kif->k.ifname, sdl->sdl_data, 892 sizeof(kif->k.ifname) - 1); 893 else if (sdl->sdl_nlen > 0) 894 memcpy(kif->k.ifname, sdl->sdl_data, 895 sdl->sdl_nlen); 896 /* string already terminated via calloc() */ 897 } 898 899 return (&kif->k); 900 } 901 902 int 903 kif_validate(u_short ifindex) 904 { 905 struct kif_node *kif; 906 907 if ((kif = kif_find(ifindex)) == NULL) { 908 log_warnx("interface with index %u not found", ifindex); 909 return (1); 910 } 911 912 return (kif->k.nh_reachable); 913 } 914 915 struct kroute_node * 916 kroute_match(in_addr_t key) 917 { 918 int i; 919 struct kroute_node *kr; 920 921 /* we will never match the default route */ 922 for (i = 32; i > 0; i--) 923 if ((kr = kroute_find(key & prefixlen2mask(i), i, 924 RTP_ANY)) != NULL) 925 return (kr); 926 927 /* if we don't have a match yet, try to find a default route */ 928 if ((kr = kroute_find(0, 0, RTP_ANY)) != NULL) 929 return (kr); 930 931 return (NULL); 932 } 933 934 /* misc */ 935 int 936 protect_lo(void) 937 { 938 struct kroute_node *kr; 939 940 /* special protection for 127/8 */ 941 if ((kr = calloc(1, sizeof(struct kroute_node))) == NULL) { 942 log_warn("protect_lo"); 943 return (-1); 944 } 945 kr->r.prefix.s_addr = htonl(INADDR_LOOPBACK & IN_CLASSA_NET); 946 kr->r.prefixlen = 8; 947 kr->r.flags = F_KERNEL|F_CONNECTED; 948 949 if (RB_INSERT(kroute_tree, &krt, kr) != NULL) 950 free(kr); /* kernel route already there, no problem */ 951 952 return (0); 953 } 954 955 u_int8_t 956 prefixlen_classful(in_addr_t ina) 957 { 958 /* it hurt to write this. */ 959 960 if (ina >= 0xf0000000U) /* class E */ 961 return (32); 962 else if (ina >= 0xe0000000U) /* class D */ 963 return (4); 964 else if (ina >= 0xc0000000U) /* class C */ 965 return (24); 966 else if (ina >= 0x80000000U) /* class B */ 967 return (16); 968 else /* class A */ 969 return (8); 970 } 971 972 u_int8_t 973 mask2prefixlen(in_addr_t ina) 974 { 975 if (ina == 0) 976 return (0); 977 else 978 return (33 - ffs(ntohl(ina))); 979 } 980 981 in_addr_t 982 prefixlen2mask(u_int8_t prefixlen) 983 { 984 if (prefixlen == 0) 985 return (0); 986 987 return (htonl(0xffffffff << (32 - prefixlen))); 988 } 989 990 #define ROUNDUP(a) \ 991 (((a) & (sizeof(long) - 1)) ? (1 + ((a) | (sizeof(long) - 1))) : (a)) 992 993 void 994 get_rtaddrs(int addrs, struct sockaddr *sa, struct sockaddr **rti_info) 995 { 996 int i; 997 998 for (i = 0; i < RTAX_MAX; i++) { 999 if (addrs & (1 << i)) { 1000 rti_info[i] = sa; 1001 sa = (struct sockaddr *)((char *)(sa) + 1002 ROUNDUP(sa->sa_len)); 1003 } else 1004 rti_info[i] = NULL; 1005 } 1006 } 1007 1008 void 1009 if_change(u_short ifindex, int flags, struct if_data *ifd, 1010 struct sockaddr_dl *sdl) 1011 { 1012 struct kroute_node *kr, *tkr; 1013 struct kif *kif; 1014 u_int8_t reachable; 1015 1016 if ((kif = kif_update(ifindex, flags, ifd, sdl)) == NULL) { 1017 log_warn("if_change: kif_update(%u)", ifindex); 1018 return; 1019 } 1020 1021 reachable = (kif->flags & IFF_UP) && 1022 LINK_STATE_IS_UP(kif->link_state); 1023 1024 if (reachable == kif->nh_reachable) 1025 return; /* nothing changed wrt nexthop validity */ 1026 1027 kif->nh_reachable = reachable; 1028 1029 /* notify ospfe about interface link state */ 1030 main_imsg_compose_ospfe(IMSG_IFINFO, 0, kif, sizeof(struct kif)); 1031 1032 /* update redistribute list */ 1033 RB_FOREACH(kr, kroute_tree, &krt) { 1034 for (tkr = kr; tkr != NULL; tkr = tkr->next) { 1035 if (tkr->r.ifindex == ifindex) { 1036 if (reachable) 1037 tkr->r.flags &= ~F_DOWN; 1038 else 1039 tkr->r.flags |= F_DOWN; 1040 1041 } 1042 } 1043 kr_redistribute(kr); 1044 } 1045 } 1046 1047 void 1048 if_newaddr(u_short ifindex, struct sockaddr_in *ifa, struct sockaddr_in *mask, 1049 struct sockaddr_in *brd) 1050 { 1051 struct kif_node *kif; 1052 struct kif_addr *ka; 1053 1054 if (ifa == NULL || ifa->sin_family != AF_INET) 1055 return; 1056 if ((kif = kif_find(ifindex)) == NULL) { 1057 log_warnx("if_newaddr: corresponding if %i not found", ifindex); 1058 return; 1059 } 1060 if ((ka = calloc(1, sizeof(struct kif_addr))) == NULL) 1061 fatal("if_newaddr"); 1062 ka->addr = ifa->sin_addr; 1063 if (mask) 1064 ka->mask = mask->sin_addr; 1065 else 1066 ka->mask.s_addr = INADDR_NONE; 1067 if (brd) 1068 ka->dstbrd = brd->sin_addr; 1069 else 1070 ka->dstbrd.s_addr = INADDR_NONE; 1071 1072 TAILQ_INSERT_TAIL(&kif->addrs, ka, entry); 1073 } 1074 1075 void 1076 if_deladdr(u_short ifindex, struct sockaddr_in *ifa, struct sockaddr_in *mask, 1077 struct sockaddr_in *brd) 1078 { 1079 struct kif_node *kif; 1080 struct kif_addr *ka, *nka; 1081 struct ifaddrdel ifc; 1082 1083 if (ifa == NULL || ifa->sin_family != AF_INET) 1084 return; 1085 if ((kif = kif_find(ifindex)) == NULL) { 1086 log_warnx("if_deladdr: corresponding if %i not found", ifindex); 1087 return; 1088 } 1089 1090 for (ka = TAILQ_FIRST(&kif->addrs); ka != NULL; ka = nka) { 1091 nka = TAILQ_NEXT(ka, entry); 1092 1093 if (ka->addr.s_addr == ifa->sin_addr.s_addr) { 1094 TAILQ_REMOVE(&kif->addrs, ka, entry); 1095 ifc.addr = ifa->sin_addr; 1096 ifc.ifindex = ifindex; 1097 main_imsg_compose_ospfe(IMSG_IFADDRDEL, 0, &ifc, 1098 sizeof(ifc)); 1099 free(ka); 1100 return; 1101 } 1102 } 1103 } 1104 1105 void 1106 if_announce(void *msg) 1107 { 1108 struct if_announcemsghdr *ifan; 1109 struct kif_node *kif; 1110 1111 ifan = msg; 1112 1113 switch (ifan->ifan_what) { 1114 case IFAN_ARRIVAL: 1115 kif = kif_insert(ifan->ifan_index); 1116 strlcpy(kif->k.ifname, ifan->ifan_name, sizeof(kif->k.ifname)); 1117 break; 1118 case IFAN_DEPARTURE: 1119 kif = kif_find(ifan->ifan_index); 1120 kif_remove(kif); 1121 break; 1122 } 1123 } 1124 1125 /* rtsock */ 1126 int 1127 send_rtmsg(int fd, int action, struct kroute *kroute) 1128 { 1129 struct iovec iov[5]; 1130 struct rt_msghdr hdr; 1131 struct sockaddr_in prefix; 1132 struct sockaddr_in nexthop; 1133 struct sockaddr_in mask; 1134 struct sockaddr_rtlabel sa_rl; 1135 int iovcnt = 0; 1136 const char *label; 1137 1138 if (kr_state.fib_sync == 0) 1139 return (0); 1140 1141 /* initialize header */ 1142 bzero(&hdr, sizeof(hdr)); 1143 hdr.rtm_version = RTM_VERSION; 1144 hdr.rtm_type = action; 1145 hdr.rtm_priority = RTP_OSPF; 1146 hdr.rtm_tableid = kr_state.rdomain; /* rtableid */ 1147 if (action == RTM_CHANGE) 1148 hdr.rtm_fmask = RTF_REJECT|RTF_BLACKHOLE; 1149 else 1150 hdr.rtm_flags = RTF_MPATH; 1151 hdr.rtm_seq = kr_state.rtseq++; /* overflow doesn't matter */ 1152 hdr.rtm_msglen = sizeof(hdr); 1153 /* adjust iovec */ 1154 iov[iovcnt].iov_base = &hdr; 1155 iov[iovcnt++].iov_len = sizeof(hdr); 1156 1157 bzero(&prefix, sizeof(prefix)); 1158 prefix.sin_len = sizeof(prefix); 1159 prefix.sin_family = AF_INET; 1160 prefix.sin_addr.s_addr = kroute->prefix.s_addr; 1161 /* adjust header */ 1162 hdr.rtm_addrs |= RTA_DST; 1163 hdr.rtm_msglen += sizeof(prefix); 1164 /* adjust iovec */ 1165 iov[iovcnt].iov_base = &prefix; 1166 iov[iovcnt++].iov_len = sizeof(prefix); 1167 1168 if (kroute->nexthop.s_addr != 0) { 1169 bzero(&nexthop, sizeof(nexthop)); 1170 nexthop.sin_len = sizeof(nexthop); 1171 nexthop.sin_family = AF_INET; 1172 nexthop.sin_addr.s_addr = kroute->nexthop.s_addr; 1173 /* adjust header */ 1174 hdr.rtm_flags |= RTF_GATEWAY; 1175 hdr.rtm_addrs |= RTA_GATEWAY; 1176 hdr.rtm_msglen += sizeof(nexthop); 1177 /* adjust iovec */ 1178 iov[iovcnt].iov_base = &nexthop; 1179 iov[iovcnt++].iov_len = sizeof(nexthop); 1180 } 1181 1182 bzero(&mask, sizeof(mask)); 1183 mask.sin_len = sizeof(mask); 1184 mask.sin_family = AF_INET; 1185 mask.sin_addr.s_addr = prefixlen2mask(kroute->prefixlen); 1186 /* adjust header */ 1187 hdr.rtm_addrs |= RTA_NETMASK; 1188 hdr.rtm_msglen += sizeof(mask); 1189 /* adjust iovec */ 1190 iov[iovcnt].iov_base = &mask; 1191 iov[iovcnt++].iov_len = sizeof(mask); 1192 1193 if (kroute->rtlabel != 0) { 1194 sa_rl.sr_len = sizeof(sa_rl); 1195 sa_rl.sr_family = AF_UNSPEC; 1196 label = rtlabel_id2name(kroute->rtlabel); 1197 if (strlcpy(sa_rl.sr_label, label, 1198 sizeof(sa_rl.sr_label)) >= sizeof(sa_rl.sr_label)) { 1199 log_warnx("send_rtmsg: invalid rtlabel"); 1200 return (-1); 1201 } 1202 /* adjust header */ 1203 hdr.rtm_addrs |= RTA_LABEL; 1204 hdr.rtm_msglen += sizeof(sa_rl); 1205 /* adjust iovec */ 1206 iov[iovcnt].iov_base = &sa_rl; 1207 iov[iovcnt++].iov_len = sizeof(sa_rl); 1208 } 1209 1210 retry: 1211 if (writev(fd, iov, iovcnt) == -1) { 1212 if (errno == ESRCH) { 1213 if (hdr.rtm_type == RTM_CHANGE) { 1214 hdr.rtm_type = RTM_ADD; 1215 goto retry; 1216 } else if (hdr.rtm_type == RTM_DELETE) { 1217 log_info("route %s/%u vanished before delete", 1218 inet_ntoa(kroute->prefix), 1219 kroute->prefixlen); 1220 return (0); 1221 } 1222 } 1223 log_warn("send_rtmsg: action %u, prefix %s/%u", hdr.rtm_type, 1224 inet_ntoa(kroute->prefix), kroute->prefixlen); 1225 return (0); 1226 } 1227 1228 return (0); 1229 } 1230 1231 int 1232 fetchtable(void) 1233 { 1234 size_t len; 1235 int mib[7]; 1236 char *buf; 1237 int rv; 1238 1239 mib[0] = CTL_NET; 1240 mib[1] = AF_ROUTE; 1241 mib[2] = 0; 1242 mib[3] = AF_INET; 1243 mib[4] = NET_RT_DUMP; 1244 mib[5] = 0; 1245 mib[6] = kr_state.rdomain; /* rtableid */ 1246 1247 if (sysctl(mib, 7, NULL, &len, NULL, 0) == -1) { 1248 log_warn("sysctl"); 1249 return (-1); 1250 } 1251 if ((buf = malloc(len)) == NULL) { 1252 log_warn("fetchtable"); 1253 return (-1); 1254 } 1255 if (sysctl(mib, 7, buf, &len, NULL, 0) == -1) { 1256 log_warn("sysctl"); 1257 free(buf); 1258 return (-1); 1259 } 1260 1261 rv = rtmsg_process(buf, len); 1262 free(buf); 1263 1264 return (rv); 1265 } 1266 1267 int 1268 fetchifs(u_short ifindex) 1269 { 1270 size_t len; 1271 int mib[6]; 1272 char *buf; 1273 int rv; 1274 1275 mib[0] = CTL_NET; 1276 mib[1] = AF_ROUTE; 1277 mib[2] = 0; 1278 mib[3] = AF_INET; 1279 mib[4] = NET_RT_IFLIST; 1280 mib[5] = ifindex; 1281 1282 if (sysctl(mib, 6, NULL, &len, NULL, 0) == -1) { 1283 log_warn("sysctl"); 1284 return (-1); 1285 } 1286 if ((buf = malloc(len)) == NULL) { 1287 log_warn("fetchif"); 1288 return (-1); 1289 } 1290 if (sysctl(mib, 6, buf, &len, NULL, 0) == -1) { 1291 log_warn("sysctl"); 1292 free(buf); 1293 return (-1); 1294 } 1295 1296 rv = rtmsg_process(buf, len); 1297 free(buf); 1298 1299 return (rv); 1300 } 1301 1302 int 1303 dispatch_rtmsg(void) 1304 { 1305 char buf[RT_BUF_SIZE]; 1306 ssize_t n; 1307 1308 if ((n = read(kr_state.fd, &buf, sizeof(buf))) == -1) { 1309 log_warn("dispatch_rtmsg: read error"); 1310 return (-1); 1311 } 1312 1313 if (n == 0) { 1314 log_warnx("routing socket closed"); 1315 return (-1); 1316 } 1317 1318 return (rtmsg_process(buf, n)); 1319 } 1320 1321 int 1322 rtmsg_process(char *buf, int len) 1323 { 1324 struct rt_msghdr *rtm; 1325 struct if_msghdr ifm; 1326 struct ifa_msghdr *ifam; 1327 struct sockaddr *sa, *rti_info[RTAX_MAX]; 1328 struct sockaddr_in *sa_in; 1329 struct sockaddr_rtlabel *label; 1330 struct kroute_node *kr, *okr; 1331 struct in_addr prefix, nexthop; 1332 u_int8_t prefixlen, prio; 1333 int flags, mpath; 1334 u_short ifindex = 0; 1335 int rv, delay; 1336 1337 int offset; 1338 char *next; 1339 1340 for (offset = 0; offset < len; offset += rtm->rtm_msglen) { 1341 next = buf + offset; 1342 rtm = (struct rt_msghdr *)next; 1343 if (rtm->rtm_version != RTM_VERSION) 1344 continue; 1345 1346 prefix.s_addr = 0; 1347 prefixlen = 0; 1348 flags = F_KERNEL; 1349 nexthop.s_addr = 0; 1350 mpath = 0; 1351 prio = 0; 1352 1353 sa = (struct sockaddr *)(next + rtm->rtm_hdrlen); 1354 get_rtaddrs(rtm->rtm_addrs, sa, rti_info); 1355 1356 switch (rtm->rtm_type) { 1357 case RTM_ADD: 1358 case RTM_GET: 1359 case RTM_CHANGE: 1360 case RTM_DELETE: 1361 prefix.s_addr = 0; 1362 prefixlen = 0; 1363 nexthop.s_addr = 0; 1364 mpath = 0; 1365 prio = 0; 1366 1367 if (rtm->rtm_errno) /* failed attempts... */ 1368 continue; 1369 1370 if (rtm->rtm_tableid != kr_state.rdomain) 1371 continue; 1372 1373 if ((sa = rti_info[RTAX_DST]) == NULL) 1374 continue; 1375 1376 if (rtm->rtm_flags & RTF_LLINFO) /* arp cache */ 1377 continue; 1378 1379 if (rtm->rtm_flags & RTF_MPATH) 1380 mpath = 1; 1381 prio = rtm->rtm_priority; 1382 flags = (prio == RTP_OSPF) ? 1383 F_OSPFD_INSERTED : F_KERNEL; 1384 1385 switch (sa->sa_family) { 1386 case AF_INET: 1387 prefix.s_addr = 1388 ((struct sockaddr_in *)sa)->sin_addr.s_addr; 1389 sa_in = (struct sockaddr_in *) 1390 rti_info[RTAX_NETMASK]; 1391 if (sa_in != NULL) { 1392 if (sa_in->sin_len != 0) 1393 prefixlen = mask2prefixlen( 1394 sa_in->sin_addr.s_addr); 1395 } else if (rtm->rtm_flags & RTF_HOST) 1396 prefixlen = 32; 1397 else 1398 prefixlen = 1399 prefixlen_classful(prefix.s_addr); 1400 if (rtm->rtm_flags & RTF_STATIC) 1401 flags |= F_STATIC; 1402 if (rtm->rtm_flags & RTF_BLACKHOLE) 1403 flags |= F_BLACKHOLE; 1404 if (rtm->rtm_flags & RTF_REJECT) 1405 flags |= F_REJECT; 1406 if (rtm->rtm_flags & RTF_DYNAMIC) 1407 flags |= F_DYNAMIC; 1408 break; 1409 default: 1410 continue; 1411 } 1412 1413 ifindex = rtm->rtm_index; 1414 if ((sa = rti_info[RTAX_GATEWAY]) != NULL) { 1415 switch (sa->sa_family) { 1416 case AF_INET: 1417 nexthop.s_addr = ((struct 1418 sockaddr_in *)sa)->sin_addr.s_addr; 1419 break; 1420 case AF_LINK: 1421 flags |= F_CONNECTED; 1422 break; 1423 } 1424 } 1425 } 1426 1427 switch (rtm->rtm_type) { 1428 case RTM_ADD: 1429 case RTM_GET: 1430 case RTM_CHANGE: 1431 if (nexthop.s_addr == 0 && !(flags & F_CONNECTED)) { 1432 log_warnx("no nexthop for %s/%u", 1433 inet_ntoa(prefix), prefixlen); 1434 continue; 1435 } 1436 1437 if ((okr = kroute_find(prefix.s_addr, prefixlen, prio)) 1438 != NULL) { 1439 /* get the correct route */ 1440 kr = okr; 1441 if ((mpath || prio == RTP_OSPF) && 1442 (kr = kroute_matchgw(okr, nexthop)) == 1443 NULL) { 1444 log_warnx("mpath route not found"); 1445 /* add routes we missed out earlier */ 1446 goto add; 1447 } 1448 1449 if (kr->r.flags & F_REDISTRIBUTED) 1450 flags |= F_REDISTRIBUTED; 1451 kr->r.nexthop.s_addr = nexthop.s_addr; 1452 kr->r.flags = flags; 1453 kr->r.ifindex = ifindex; 1454 1455 rtlabel_unref(kr->r.rtlabel); 1456 kr->r.rtlabel = 0; 1457 kr->r.ext_tag = 0; 1458 if ((label = (struct sockaddr_rtlabel *) 1459 rti_info[RTAX_LABEL]) != NULL) { 1460 kr->r.rtlabel = 1461 rtlabel_name2id(label->sr_label); 1462 kr->r.ext_tag = 1463 rtlabel_id2tag(kr->r.rtlabel); 1464 } 1465 1466 if (kif_validate(kr->r.ifindex)) 1467 kr->r.flags &= ~F_DOWN; 1468 else 1469 kr->r.flags |= F_DOWN; 1470 1471 /* just readd, the RDE will care */ 1472 kr->serial = kr_state.fib_serial; 1473 kr_redistribute(okr); 1474 } else { 1475 add: 1476 if ((kr = calloc(1, 1477 sizeof(struct kroute_node))) == NULL) { 1478 log_warn("dispatch calloc"); 1479 return (-1); 1480 } 1481 1482 kr->r.prefix.s_addr = prefix.s_addr; 1483 kr->r.prefixlen = prefixlen; 1484 kr->r.nexthop.s_addr = nexthop.s_addr; 1485 kr->r.flags = flags; 1486 kr->r.ifindex = ifindex; 1487 kr->r.priority = prio; 1488 1489 if (rtm->rtm_priority == RTP_OSPF) { 1490 log_warnx("alien OSPF route %s/%d", 1491 inet_ntoa(prefix), prefixlen); 1492 rv = send_rtmsg(kr_state.fd, 1493 RTM_DELETE, &kr->r); 1494 free(kr); 1495 if (rv == -1) 1496 return (-1); 1497 } else { 1498 if ((label = (struct sockaddr_rtlabel *) 1499 rti_info[RTAX_LABEL]) != NULL) { 1500 kr->r.rtlabel = 1501 rtlabel_name2id( 1502 label->sr_label); 1503 kr->r.ext_tag = 1504 rtlabel_id2tag( 1505 kr->r.rtlabel); 1506 } 1507 1508 kroute_insert(kr); 1509 } 1510 } 1511 break; 1512 case RTM_DELETE: 1513 if ((kr = kroute_find(prefix.s_addr, prefixlen, prio)) 1514 == NULL) 1515 continue; 1516 if (!(kr->r.flags & F_KERNEL)) 1517 continue; 1518 /* get the correct route */ 1519 okr = kr; 1520 if (mpath && 1521 (kr = kroute_matchgw(kr, nexthop)) == NULL) { 1522 log_warnx("dispatch_rtmsg mpath route" 1523 " not found"); 1524 return (-1); 1525 } 1526 if (kroute_remove(kr) == -1) 1527 return (-1); 1528 break; 1529 case RTM_IFINFO: 1530 memcpy(&ifm, next, sizeof(ifm)); 1531 if_change(ifm.ifm_index, ifm.ifm_flags, &ifm.ifm_data, 1532 (struct sockaddr_dl *)rti_info[RTAX_IFP]); 1533 break; 1534 case RTM_NEWADDR: 1535 ifam = (struct ifa_msghdr *)rtm; 1536 if ((ifam->ifam_addrs & (RTA_NETMASK | RTA_IFA | 1537 RTA_BRD)) == 0) 1538 break; 1539 1540 if_newaddr(ifam->ifam_index, 1541 (struct sockaddr_in *)rti_info[RTAX_IFA], 1542 (struct sockaddr_in *)rti_info[RTAX_NETMASK], 1543 (struct sockaddr_in *)rti_info[RTAX_BRD]); 1544 break; 1545 case RTM_DELADDR: 1546 ifam = (struct ifa_msghdr *)rtm; 1547 if ((ifam->ifam_addrs & (RTA_NETMASK | RTA_IFA | 1548 RTA_BRD)) == 0) 1549 break; 1550 1551 if_deladdr(ifam->ifam_index, 1552 (struct sockaddr_in *)rti_info[RTAX_IFA], 1553 (struct sockaddr_in *)rti_info[RTAX_NETMASK], 1554 (struct sockaddr_in *)rti_info[RTAX_BRD]); 1555 break; 1556 case RTM_IFANNOUNCE: 1557 if_announce(next); 1558 break; 1559 case RTM_DESYNC: 1560 /* 1561 * We lost some routing packets. Schedule a reload 1562 * of the kernel route/interface information. 1563 */ 1564 if (kr_state.reload_state == KR_RELOAD_IDLE) { 1565 delay = KR_RELOAD_TIMER; 1566 log_info("desync; scheduling fib reload"); 1567 } else { 1568 delay = KR_RELOAD_HOLD_TIMER; 1569 log_debug("desync during KR_RELOAD_%s", 1570 kr_state.reload_state == 1571 KR_RELOAD_FETCH ? "FETCH" : "HOLD"); 1572 } 1573 kr_state.reload_state = KR_RELOAD_FETCH; 1574 kr_fib_reload_arm_timer(delay); 1575 break; 1576 default: 1577 /* ignore for now */ 1578 break; 1579 } 1580 } 1581 1582 return (offset); 1583 } 1584