1 /*- 2 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. Neither the name of the project nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * 29 * $KAME: nd6.c,v 1.144 2001/05/24 07:44:00 itojun Exp $ 30 */ 31 32 #include <sys/cdefs.h> 33 __FBSDID("$FreeBSD$"); 34 35 #include "opt_inet.h" 36 #include "opt_inet6.h" 37 38 #include <sys/param.h> 39 #include <sys/systm.h> 40 #include <sys/callout.h> 41 #include <sys/malloc.h> 42 #include <sys/mbuf.h> 43 #include <sys/socket.h> 44 #include <sys/sockio.h> 45 #include <sys/time.h> 46 #include <sys/kernel.h> 47 #include <sys/protosw.h> 48 #include <sys/errno.h> 49 #include <sys/syslog.h> 50 #include <sys/lock.h> 51 #include <sys/rwlock.h> 52 #include <sys/queue.h> 53 #include <sys/sdt.h> 54 #include <sys/sysctl.h> 55 56 #include <net/if.h> 57 #include <net/if_var.h> 58 #include <net/if_arc.h> 59 #include <net/if_dl.h> 60 #include <net/if_types.h> 61 #include <net/iso88025.h> 62 #include <net/fddi.h> 63 #include <net/route.h> 64 #include <net/vnet.h> 65 66 #include <netinet/in.h> 67 #include <netinet/in_kdtrace.h> 68 #include <net/if_llatbl.h> 69 #include <netinet/if_ether.h> 70 #include <netinet6/in6_var.h> 71 #include <netinet/ip6.h> 72 #include <netinet6/ip6_var.h> 73 #include <netinet6/scope6_var.h> 74 #include <netinet6/nd6.h> 75 #include <netinet6/in6_ifattach.h> 76 #include <netinet/icmp6.h> 77 #include <netinet6/send.h> 78 79 #include <sys/limits.h> 80 81 #include <security/mac/mac_framework.h> 82 83 #define ND6_SLOWTIMER_INTERVAL (60 * 60) /* 1 hour */ 84 #define ND6_RECALC_REACHTM_INTERVAL (60 * 120) /* 2 hours */ 85 86 #define SIN6(s) ((const struct sockaddr_in6 *)(s)) 87 88 /* timer values */ 89 VNET_DEFINE(int, nd6_prune) = 1; /* walk list every 1 seconds */ 90 VNET_DEFINE(int, nd6_delay) = 5; /* delay first probe time 5 second */ 91 VNET_DEFINE(int, nd6_umaxtries) = 3; /* maximum unicast query */ 92 VNET_DEFINE(int, nd6_mmaxtries) = 3; /* maximum multicast query */ 93 VNET_DEFINE(int, nd6_useloopback) = 1; /* use loopback interface for 94 * local traffic */ 95 VNET_DEFINE(int, nd6_gctimer) = (60 * 60 * 24); /* 1 day: garbage 96 * collection timer */ 97 98 /* preventing too many loops in ND option parsing */ 99 static VNET_DEFINE(int, nd6_maxndopt) = 10; /* max # of ND options allowed */ 100 101 VNET_DEFINE(int, nd6_maxnudhint) = 0; /* max # of subsequent upper 102 * layer hints */ 103 static VNET_DEFINE(int, nd6_maxqueuelen) = 1; /* max pkts cached in unresolved 104 * ND entries */ 105 #define V_nd6_maxndopt VNET(nd6_maxndopt) 106 #define V_nd6_maxqueuelen VNET(nd6_maxqueuelen) 107 108 #ifdef ND6_DEBUG 109 VNET_DEFINE(int, nd6_debug) = 1; 110 #else 111 VNET_DEFINE(int, nd6_debug) = 0; 112 #endif 113 114 static eventhandler_tag lle_event_eh; 115 116 /* for debugging? */ 117 #if 0 118 static int nd6_inuse, nd6_allocated; 119 #endif 120 121 VNET_DEFINE(struct nd_drhead, nd_defrouter); 122 VNET_DEFINE(struct nd_prhead, nd_prefix); 123 124 VNET_DEFINE(int, nd6_recalc_reachtm_interval) = ND6_RECALC_REACHTM_INTERVAL; 125 #define V_nd6_recalc_reachtm_interval VNET(nd6_recalc_reachtm_interval) 126 127 int (*send_sendso_input_hook)(struct mbuf *, struct ifnet *, int, int); 128 129 static int nd6_is_new_addr_neighbor(const struct sockaddr_in6 *, 130 struct ifnet *); 131 static void nd6_setmtu0(struct ifnet *, struct nd_ifinfo *); 132 static void nd6_slowtimo(void *); 133 static int regen_tmpaddr(struct in6_ifaddr *); 134 static void nd6_free(struct llentry *, int); 135 static void nd6_free_redirect(const struct llentry *); 136 static void nd6_llinfo_timer(void *); 137 static void clear_llinfo_pqueue(struct llentry *); 138 static void nd6_rtrequest(int, struct rtentry *, struct rt_addrinfo *); 139 static int nd6_resolve_slow(struct ifnet *, struct mbuf *, 140 const struct sockaddr_in6 *, u_char *, uint32_t *); 141 static int nd6_need_cache(struct ifnet *); 142 143 144 static VNET_DEFINE(struct callout, nd6_slowtimo_ch); 145 #define V_nd6_slowtimo_ch VNET(nd6_slowtimo_ch) 146 147 VNET_DEFINE(struct callout, nd6_timer_ch); 148 149 static void 150 nd6_lle_event(void *arg __unused, struct llentry *lle, int evt) 151 { 152 struct rt_addrinfo rtinfo; 153 struct sockaddr_in6 dst; 154 struct sockaddr_dl gw; 155 struct ifnet *ifp; 156 int type; 157 158 LLE_WLOCK_ASSERT(lle); 159 160 if (lltable_get_af(lle->lle_tbl) != AF_INET6) 161 return; 162 163 switch (evt) { 164 case LLENTRY_RESOLVED: 165 type = RTM_ADD; 166 KASSERT(lle->la_flags & LLE_VALID, 167 ("%s: %p resolved but not valid?", __func__, lle)); 168 break; 169 case LLENTRY_EXPIRED: 170 type = RTM_DELETE; 171 break; 172 default: 173 return; 174 } 175 176 ifp = lltable_get_ifp(lle->lle_tbl); 177 178 bzero(&dst, sizeof(dst)); 179 bzero(&gw, sizeof(gw)); 180 bzero(&rtinfo, sizeof(rtinfo)); 181 lltable_fill_sa_entry(lle, (struct sockaddr *)&dst); 182 dst.sin6_scope_id = in6_getscopezone(ifp, 183 in6_addrscope(&dst.sin6_addr)); 184 gw.sdl_len = sizeof(struct sockaddr_dl); 185 gw.sdl_family = AF_LINK; 186 gw.sdl_alen = ifp->if_addrlen; 187 gw.sdl_index = ifp->if_index; 188 gw.sdl_type = ifp->if_type; 189 if (evt == LLENTRY_RESOLVED) 190 bcopy(&lle->ll_addr, gw.sdl_data, ifp->if_addrlen); 191 rtinfo.rti_info[RTAX_DST] = (struct sockaddr *)&dst; 192 rtinfo.rti_info[RTAX_GATEWAY] = (struct sockaddr *)&gw; 193 rtinfo.rti_addrs = RTA_DST | RTA_GATEWAY; 194 rt_missmsg_fib(type, &rtinfo, RTF_HOST | RTF_LLDATA | ( 195 type == RTM_ADD ? RTF_UP: 0), 0, RT_DEFAULT_FIB); 196 } 197 198 void 199 nd6_init(void) 200 { 201 202 LIST_INIT(&V_nd_prefix); 203 204 /* initialization of the default router list */ 205 TAILQ_INIT(&V_nd_defrouter); 206 207 /* start timer */ 208 callout_init(&V_nd6_slowtimo_ch, 0); 209 callout_reset(&V_nd6_slowtimo_ch, ND6_SLOWTIMER_INTERVAL * hz, 210 nd6_slowtimo, curvnet); 211 212 nd6_dad_init(); 213 if (IS_DEFAULT_VNET(curvnet)) 214 lle_event_eh = EVENTHANDLER_REGISTER(lle_event, nd6_lle_event, 215 NULL, EVENTHANDLER_PRI_ANY); 216 } 217 218 #ifdef VIMAGE 219 void 220 nd6_destroy() 221 { 222 223 callout_drain(&V_nd6_slowtimo_ch); 224 callout_drain(&V_nd6_timer_ch); 225 if (IS_DEFAULT_VNET(curvnet)) 226 EVENTHANDLER_DEREGISTER(lle_event, lle_event_eh); 227 } 228 #endif 229 230 struct nd_ifinfo * 231 nd6_ifattach(struct ifnet *ifp) 232 { 233 struct nd_ifinfo *nd; 234 235 nd = (struct nd_ifinfo *)malloc(sizeof(*nd), M_IP6NDP, M_WAITOK|M_ZERO); 236 nd->initialized = 1; 237 238 nd->chlim = IPV6_DEFHLIM; 239 nd->basereachable = REACHABLE_TIME; 240 nd->reachable = ND_COMPUTE_RTIME(nd->basereachable); 241 nd->retrans = RETRANS_TIMER; 242 243 nd->flags = ND6_IFF_PERFORMNUD; 244 245 /* A loopback interface always has ND6_IFF_AUTO_LINKLOCAL. 246 * XXXHRS: Clear ND6_IFF_AUTO_LINKLOCAL on an IFT_BRIDGE interface by 247 * default regardless of the V_ip6_auto_linklocal configuration to 248 * give a reasonable default behavior. 249 */ 250 if ((V_ip6_auto_linklocal && ifp->if_type != IFT_BRIDGE) || 251 (ifp->if_flags & IFF_LOOPBACK)) 252 nd->flags |= ND6_IFF_AUTO_LINKLOCAL; 253 /* 254 * A loopback interface does not need to accept RTADV. 255 * XXXHRS: Clear ND6_IFF_ACCEPT_RTADV on an IFT_BRIDGE interface by 256 * default regardless of the V_ip6_accept_rtadv configuration to 257 * prevent the interface from accepting RA messages arrived 258 * on one of the member interfaces with ND6_IFF_ACCEPT_RTADV. 259 */ 260 if (V_ip6_accept_rtadv && 261 !(ifp->if_flags & IFF_LOOPBACK) && 262 (ifp->if_type != IFT_BRIDGE)) 263 nd->flags |= ND6_IFF_ACCEPT_RTADV; 264 if (V_ip6_no_radr && !(ifp->if_flags & IFF_LOOPBACK)) 265 nd->flags |= ND6_IFF_NO_RADR; 266 267 /* XXX: we cannot call nd6_setmtu since ifp is not fully initialized */ 268 nd6_setmtu0(ifp, nd); 269 270 return nd; 271 } 272 273 void 274 nd6_ifdetach(struct nd_ifinfo *nd) 275 { 276 277 free(nd, M_IP6NDP); 278 } 279 280 /* 281 * Reset ND level link MTU. This function is called when the physical MTU 282 * changes, which means we might have to adjust the ND level MTU. 283 */ 284 void 285 nd6_setmtu(struct ifnet *ifp) 286 { 287 288 nd6_setmtu0(ifp, ND_IFINFO(ifp)); 289 } 290 291 /* XXX todo: do not maintain copy of ifp->if_mtu in ndi->maxmtu */ 292 void 293 nd6_setmtu0(struct ifnet *ifp, struct nd_ifinfo *ndi) 294 { 295 u_int32_t omaxmtu; 296 297 omaxmtu = ndi->maxmtu; 298 299 switch (ifp->if_type) { 300 case IFT_ARCNET: 301 ndi->maxmtu = MIN(ARC_PHDS_MAXMTU, ifp->if_mtu); /* RFC2497 */ 302 break; 303 case IFT_FDDI: 304 ndi->maxmtu = MIN(FDDIIPMTU, ifp->if_mtu); /* RFC2467 */ 305 break; 306 case IFT_ISO88025: 307 ndi->maxmtu = MIN(ISO88025_MAX_MTU, ifp->if_mtu); 308 break; 309 default: 310 ndi->maxmtu = ifp->if_mtu; 311 break; 312 } 313 314 /* 315 * Decreasing the interface MTU under IPV6 minimum MTU may cause 316 * undesirable situation. We thus notify the operator of the change 317 * explicitly. The check for omaxmtu is necessary to restrict the 318 * log to the case of changing the MTU, not initializing it. 319 */ 320 if (omaxmtu >= IPV6_MMTU && ndi->maxmtu < IPV6_MMTU) { 321 log(LOG_NOTICE, "nd6_setmtu0: " 322 "new link MTU on %s (%lu) is too small for IPv6\n", 323 if_name(ifp), (unsigned long)ndi->maxmtu); 324 } 325 326 if (ndi->maxmtu > V_in6_maxmtu) 327 in6_setmaxmtu(); /* check all interfaces just in case */ 328 329 } 330 331 void 332 nd6_option_init(void *opt, int icmp6len, union nd_opts *ndopts) 333 { 334 335 bzero(ndopts, sizeof(*ndopts)); 336 ndopts->nd_opts_search = (struct nd_opt_hdr *)opt; 337 ndopts->nd_opts_last 338 = (struct nd_opt_hdr *)(((u_char *)opt) + icmp6len); 339 340 if (icmp6len == 0) { 341 ndopts->nd_opts_done = 1; 342 ndopts->nd_opts_search = NULL; 343 } 344 } 345 346 /* 347 * Take one ND option. 348 */ 349 struct nd_opt_hdr * 350 nd6_option(union nd_opts *ndopts) 351 { 352 struct nd_opt_hdr *nd_opt; 353 int olen; 354 355 KASSERT(ndopts != NULL, ("%s: ndopts == NULL", __func__)); 356 KASSERT(ndopts->nd_opts_last != NULL, ("%s: uninitialized ndopts", 357 __func__)); 358 if (ndopts->nd_opts_search == NULL) 359 return NULL; 360 if (ndopts->nd_opts_done) 361 return NULL; 362 363 nd_opt = ndopts->nd_opts_search; 364 365 /* make sure nd_opt_len is inside the buffer */ 366 if ((caddr_t)&nd_opt->nd_opt_len >= (caddr_t)ndopts->nd_opts_last) { 367 bzero(ndopts, sizeof(*ndopts)); 368 return NULL; 369 } 370 371 olen = nd_opt->nd_opt_len << 3; 372 if (olen == 0) { 373 /* 374 * Message validation requires that all included 375 * options have a length that is greater than zero. 376 */ 377 bzero(ndopts, sizeof(*ndopts)); 378 return NULL; 379 } 380 381 ndopts->nd_opts_search = (struct nd_opt_hdr *)((caddr_t)nd_opt + olen); 382 if (ndopts->nd_opts_search > ndopts->nd_opts_last) { 383 /* option overruns the end of buffer, invalid */ 384 bzero(ndopts, sizeof(*ndopts)); 385 return NULL; 386 } else if (ndopts->nd_opts_search == ndopts->nd_opts_last) { 387 /* reached the end of options chain */ 388 ndopts->nd_opts_done = 1; 389 ndopts->nd_opts_search = NULL; 390 } 391 return nd_opt; 392 } 393 394 /* 395 * Parse multiple ND options. 396 * This function is much easier to use, for ND routines that do not need 397 * multiple options of the same type. 398 */ 399 int 400 nd6_options(union nd_opts *ndopts) 401 { 402 struct nd_opt_hdr *nd_opt; 403 int i = 0; 404 405 KASSERT(ndopts != NULL, ("%s: ndopts == NULL", __func__)); 406 KASSERT(ndopts->nd_opts_last != NULL, ("%s: uninitialized ndopts", 407 __func__)); 408 if (ndopts->nd_opts_search == NULL) 409 return 0; 410 411 while (1) { 412 nd_opt = nd6_option(ndopts); 413 if (nd_opt == NULL && ndopts->nd_opts_last == NULL) { 414 /* 415 * Message validation requires that all included 416 * options have a length that is greater than zero. 417 */ 418 ICMP6STAT_INC(icp6s_nd_badopt); 419 bzero(ndopts, sizeof(*ndopts)); 420 return -1; 421 } 422 423 if (nd_opt == NULL) 424 goto skip1; 425 426 switch (nd_opt->nd_opt_type) { 427 case ND_OPT_SOURCE_LINKADDR: 428 case ND_OPT_TARGET_LINKADDR: 429 case ND_OPT_MTU: 430 case ND_OPT_REDIRECTED_HEADER: 431 case ND_OPT_NONCE: 432 if (ndopts->nd_opt_array[nd_opt->nd_opt_type]) { 433 nd6log((LOG_INFO, 434 "duplicated ND6 option found (type=%d)\n", 435 nd_opt->nd_opt_type)); 436 /* XXX bark? */ 437 } else { 438 ndopts->nd_opt_array[nd_opt->nd_opt_type] 439 = nd_opt; 440 } 441 break; 442 case ND_OPT_PREFIX_INFORMATION: 443 if (ndopts->nd_opt_array[nd_opt->nd_opt_type] == 0) { 444 ndopts->nd_opt_array[nd_opt->nd_opt_type] 445 = nd_opt; 446 } 447 ndopts->nd_opts_pi_end = 448 (struct nd_opt_prefix_info *)nd_opt; 449 break; 450 /* What about ND_OPT_ROUTE_INFO? RFC 4191 */ 451 case ND_OPT_RDNSS: /* RFC 6106 */ 452 case ND_OPT_DNSSL: /* RFC 6106 */ 453 /* 454 * Silently ignore options we know and do not care about 455 * in the kernel. 456 */ 457 break; 458 default: 459 /* 460 * Unknown options must be silently ignored, 461 * to accomodate future extension to the protocol. 462 */ 463 nd6log((LOG_DEBUG, 464 "nd6_options: unsupported option %d - " 465 "option ignored\n", nd_opt->nd_opt_type)); 466 } 467 468 skip1: 469 i++; 470 if (i > V_nd6_maxndopt) { 471 ICMP6STAT_INC(icp6s_nd_toomanyopt); 472 nd6log((LOG_INFO, "too many loop in nd opt\n")); 473 break; 474 } 475 476 if (ndopts->nd_opts_done) 477 break; 478 } 479 480 return 0; 481 } 482 483 /* 484 * ND6 timer routine to handle ND6 entries 485 */ 486 void 487 nd6_llinfo_settimer_locked(struct llentry *ln, long tick) 488 { 489 int canceled; 490 491 LLE_WLOCK_ASSERT(ln); 492 493 if (tick < 0) { 494 ln->la_expire = 0; 495 ln->ln_ntick = 0; 496 canceled = callout_stop(&ln->lle_timer); 497 } else { 498 ln->la_expire = time_uptime + tick / hz; 499 LLE_ADDREF(ln); 500 if (tick > INT_MAX) { 501 ln->ln_ntick = tick - INT_MAX; 502 canceled = callout_reset(&ln->lle_timer, INT_MAX, 503 nd6_llinfo_timer, ln); 504 } else { 505 ln->ln_ntick = 0; 506 canceled = callout_reset(&ln->lle_timer, tick, 507 nd6_llinfo_timer, ln); 508 } 509 } 510 if (canceled) 511 LLE_REMREF(ln); 512 } 513 514 /* 515 * Gets source address of the first packet in hold queue 516 * and stores it in @src. 517 * Returns pointer to @src (if hold queue is not empty) or NULL. 518 * 519 */ 520 static struct in6_addr * 521 nd6_llinfo_get_holdsrc(struct llentry *ln, struct in6_addr *src) 522 { 523 struct ip6_hdr hdr; 524 struct mbuf *m; 525 526 if (ln->la_hold == NULL) 527 return (NULL); 528 529 /* 530 * assume every packet in la_hold has the same IP header 531 */ 532 m = ln->la_hold; 533 if (sizeof(hdr) < m->m_len) 534 return (NULL); 535 536 m_copydata(m, 0, sizeof(hdr), (caddr_t)&hdr); 537 *src = hdr.ip6_src; 538 539 return (src); 540 } 541 542 /* 543 * Switch @lle state to new state optionally arming timers. 544 */ 545 void 546 nd6_llinfo_setstate(struct llentry *lle, int newstate) 547 { 548 struct ifnet *ifp; 549 long delay; 550 551 delay = 0; 552 553 switch (newstate) { 554 case ND6_LLINFO_INCOMPLETE: 555 ifp = lle->lle_tbl->llt_ifp; 556 delay = (long)ND_IFINFO(ifp)->retrans * hz / 1000; 557 break; 558 case ND6_LLINFO_REACHABLE: 559 if (!ND6_LLINFO_PERMANENT(lle)) { 560 ifp = lle->lle_tbl->llt_ifp; 561 delay = (long)ND_IFINFO(ifp)->reachable * hz; 562 } 563 break; 564 case ND6_LLINFO_STALE: 565 delay = (long)V_nd6_gctimer * hz; 566 break; 567 case ND6_LLINFO_DELAY: 568 lle->la_asked = 0; 569 delay = (long)V_nd6_delay * hz; 570 break; 571 } 572 573 if (delay > 0) 574 nd6_llinfo_settimer_locked(lle, delay); 575 576 lle->ln_state = newstate; 577 } 578 579 580 void 581 nd6_llinfo_settimer(struct llentry *ln, long tick) 582 { 583 584 LLE_WLOCK(ln); 585 nd6_llinfo_settimer_locked(ln, tick); 586 LLE_WUNLOCK(ln); 587 } 588 589 static void 590 nd6_llinfo_timer(void *arg) 591 { 592 struct llentry *ln; 593 struct in6_addr *dst, *pdst, *psrc, src; 594 struct ifnet *ifp; 595 struct nd_ifinfo *ndi = NULL; 596 int send_ns; 597 598 KASSERT(arg != NULL, ("%s: arg NULL", __func__)); 599 ln = (struct llentry *)arg; 600 LLE_WLOCK(ln); 601 if (callout_pending(&ln->lle_timer)) { 602 /* 603 * Here we are a bit odd here in the treatment of 604 * active/pending. If the pending bit is set, it got 605 * rescheduled before I ran. The active 606 * bit we ignore, since if it was stopped 607 * in ll_tablefree() and was currently running 608 * it would have return 0 so the code would 609 * not have deleted it since the callout could 610 * not be stopped so we want to go through 611 * with the delete here now. If the callout 612 * was restarted, the pending bit will be back on and 613 * we just want to bail since the callout_reset would 614 * return 1 and our reference would have been removed 615 * by nd6_llinfo_settimer_locked above since canceled 616 * would have been 1. 617 */ 618 LLE_WUNLOCK(ln); 619 return; 620 } 621 ifp = ln->lle_tbl->llt_ifp; 622 CURVNET_SET(ifp->if_vnet); 623 ndi = ND_IFINFO(ifp); 624 send_ns = 0; 625 dst = &ln->r_l3addr.addr6; 626 pdst = dst; 627 628 if (ln->ln_ntick > 0) { 629 if (ln->ln_ntick > INT_MAX) { 630 ln->ln_ntick -= INT_MAX; 631 nd6_llinfo_settimer_locked(ln, INT_MAX); 632 } else { 633 ln->ln_ntick = 0; 634 nd6_llinfo_settimer_locked(ln, ln->ln_ntick); 635 } 636 goto done; 637 } 638 639 if (ln->la_flags & LLE_STATIC) { 640 goto done; 641 } 642 643 if (ln->la_flags & LLE_DELETED) { 644 nd6_free(ln, 0); 645 ln = NULL; 646 goto done; 647 } 648 649 switch (ln->ln_state) { 650 case ND6_LLINFO_INCOMPLETE: 651 if (ln->la_asked < V_nd6_mmaxtries) { 652 ln->la_asked++; 653 send_ns = 1; 654 /* Send NS to multicast address */ 655 pdst = NULL; 656 } else { 657 struct mbuf *m = ln->la_hold; 658 if (m) { 659 struct mbuf *m0; 660 661 /* 662 * assuming every packet in la_hold has the 663 * same IP header. Send error after unlock. 664 */ 665 m0 = m->m_nextpkt; 666 m->m_nextpkt = NULL; 667 ln->la_hold = m0; 668 clear_llinfo_pqueue(ln); 669 } 670 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_TIMEDOUT); 671 nd6_free(ln, 0); 672 ln = NULL; 673 if (m != NULL) 674 icmp6_error2(m, ICMP6_DST_UNREACH, 675 ICMP6_DST_UNREACH_ADDR, 0, ifp); 676 } 677 break; 678 case ND6_LLINFO_REACHABLE: 679 if (!ND6_LLINFO_PERMANENT(ln)) 680 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE); 681 break; 682 683 case ND6_LLINFO_STALE: 684 /* Garbage Collection(RFC 2461 5.3) */ 685 if (!ND6_LLINFO_PERMANENT(ln)) { 686 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_EXPIRED); 687 nd6_free(ln, 1); 688 ln = NULL; 689 } 690 break; 691 692 case ND6_LLINFO_DELAY: 693 if (ndi && (ndi->flags & ND6_IFF_PERFORMNUD) != 0) { 694 /* We need NUD */ 695 ln->la_asked = 1; 696 nd6_llinfo_setstate(ln, ND6_LLINFO_PROBE); 697 send_ns = 1; 698 } else 699 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE); /* XXX */ 700 break; 701 case ND6_LLINFO_PROBE: 702 if (ln->la_asked < V_nd6_umaxtries) { 703 ln->la_asked++; 704 send_ns = 1; 705 } else { 706 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_EXPIRED); 707 nd6_free(ln, 0); 708 ln = NULL; 709 } 710 break; 711 default: 712 panic("%s: paths in a dark night can be confusing: %d", 713 __func__, ln->ln_state); 714 } 715 done: 716 if (send_ns != 0) { 717 nd6_llinfo_settimer_locked(ln, (long)ndi->retrans * hz / 1000); 718 psrc = nd6_llinfo_get_holdsrc(ln, &src); 719 LLE_FREE_LOCKED(ln); 720 ln = NULL; 721 nd6_ns_output(ifp, psrc, pdst, dst, NULL); 722 } 723 724 if (ln != NULL) 725 LLE_FREE_LOCKED(ln); 726 CURVNET_RESTORE(); 727 } 728 729 730 /* 731 * ND6 timer routine to expire default route list and prefix list 732 */ 733 void 734 nd6_timer(void *arg) 735 { 736 CURVNET_SET((struct vnet *) arg); 737 struct nd_defrouter *dr, *ndr; 738 struct nd_prefix *pr, *npr; 739 struct in6_ifaddr *ia6, *nia6; 740 741 callout_reset(&V_nd6_timer_ch, V_nd6_prune * hz, 742 nd6_timer, curvnet); 743 744 /* expire default router list */ 745 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr) { 746 if (dr->expire && dr->expire < time_uptime) 747 defrtrlist_del(dr); 748 } 749 750 /* 751 * expire interface addresses. 752 * in the past the loop was inside prefix expiry processing. 753 * However, from a stricter speci-confrmance standpoint, we should 754 * rather separate address lifetimes and prefix lifetimes. 755 * 756 * XXXRW: in6_ifaddrhead locking. 757 */ 758 addrloop: 759 TAILQ_FOREACH_SAFE(ia6, &V_in6_ifaddrhead, ia_link, nia6) { 760 /* check address lifetime */ 761 if (IFA6_IS_INVALID(ia6)) { 762 int regen = 0; 763 764 /* 765 * If the expiring address is temporary, try 766 * regenerating a new one. This would be useful when 767 * we suspended a laptop PC, then turned it on after a 768 * period that could invalidate all temporary 769 * addresses. Although we may have to restart the 770 * loop (see below), it must be after purging the 771 * address. Otherwise, we'd see an infinite loop of 772 * regeneration. 773 */ 774 if (V_ip6_use_tempaddr && 775 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0) { 776 if (regen_tmpaddr(ia6) == 0) 777 regen = 1; 778 } 779 780 in6_purgeaddr(&ia6->ia_ifa); 781 782 if (regen) 783 goto addrloop; /* XXX: see below */ 784 } else if (IFA6_IS_DEPRECATED(ia6)) { 785 int oldflags = ia6->ia6_flags; 786 787 ia6->ia6_flags |= IN6_IFF_DEPRECATED; 788 789 /* 790 * If a temporary address has just become deprecated, 791 * regenerate a new one if possible. 792 */ 793 if (V_ip6_use_tempaddr && 794 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0 && 795 (oldflags & IN6_IFF_DEPRECATED) == 0) { 796 797 if (regen_tmpaddr(ia6) == 0) { 798 /* 799 * A new temporary address is 800 * generated. 801 * XXX: this means the address chain 802 * has changed while we are still in 803 * the loop. Although the change 804 * would not cause disaster (because 805 * it's not a deletion, but an 806 * addition,) we'd rather restart the 807 * loop just for safety. Or does this 808 * significantly reduce performance?? 809 */ 810 goto addrloop; 811 } 812 } 813 } else { 814 /* 815 * A new RA might have made a deprecated address 816 * preferred. 817 */ 818 ia6->ia6_flags &= ~IN6_IFF_DEPRECATED; 819 } 820 } 821 822 /* expire prefix list */ 823 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, npr) { 824 /* 825 * check prefix lifetime. 826 * since pltime is just for autoconf, pltime processing for 827 * prefix is not necessary. 828 */ 829 if (pr->ndpr_vltime != ND6_INFINITE_LIFETIME && 830 time_uptime - pr->ndpr_lastupdate > pr->ndpr_vltime) { 831 832 /* 833 * address expiration and prefix expiration are 834 * separate. NEVER perform in6_purgeaddr here. 835 */ 836 prelist_remove(pr); 837 } 838 } 839 CURVNET_RESTORE(); 840 } 841 842 /* 843 * ia6 - deprecated/invalidated temporary address 844 */ 845 static int 846 regen_tmpaddr(struct in6_ifaddr *ia6) 847 { 848 struct ifaddr *ifa; 849 struct ifnet *ifp; 850 struct in6_ifaddr *public_ifa6 = NULL; 851 852 ifp = ia6->ia_ifa.ifa_ifp; 853 IF_ADDR_RLOCK(ifp); 854 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) { 855 struct in6_ifaddr *it6; 856 857 if (ifa->ifa_addr->sa_family != AF_INET6) 858 continue; 859 860 it6 = (struct in6_ifaddr *)ifa; 861 862 /* ignore no autoconf addresses. */ 863 if ((it6->ia6_flags & IN6_IFF_AUTOCONF) == 0) 864 continue; 865 866 /* ignore autoconf addresses with different prefixes. */ 867 if (it6->ia6_ndpr == NULL || it6->ia6_ndpr != ia6->ia6_ndpr) 868 continue; 869 870 /* 871 * Now we are looking at an autoconf address with the same 872 * prefix as ours. If the address is temporary and is still 873 * preferred, do not create another one. It would be rare, but 874 * could happen, for example, when we resume a laptop PC after 875 * a long period. 876 */ 877 if ((it6->ia6_flags & IN6_IFF_TEMPORARY) != 0 && 878 !IFA6_IS_DEPRECATED(it6)) { 879 public_ifa6 = NULL; 880 break; 881 } 882 883 /* 884 * This is a public autoconf address that has the same prefix 885 * as ours. If it is preferred, keep it. We can't break the 886 * loop here, because there may be a still-preferred temporary 887 * address with the prefix. 888 */ 889 if (!IFA6_IS_DEPRECATED(it6)) 890 public_ifa6 = it6; 891 } 892 if (public_ifa6 != NULL) 893 ifa_ref(&public_ifa6->ia_ifa); 894 IF_ADDR_RUNLOCK(ifp); 895 896 if (public_ifa6 != NULL) { 897 int e; 898 899 if ((e = in6_tmpifadd(public_ifa6, 0, 0)) != 0) { 900 ifa_free(&public_ifa6->ia_ifa); 901 log(LOG_NOTICE, "regen_tmpaddr: failed to create a new" 902 " tmp addr,errno=%d\n", e); 903 return (-1); 904 } 905 ifa_free(&public_ifa6->ia_ifa); 906 return (0); 907 } 908 909 return (-1); 910 } 911 912 /* 913 * Nuke neighbor cache/prefix/default router management table, right before 914 * ifp goes away. 915 */ 916 void 917 nd6_purge(struct ifnet *ifp) 918 { 919 struct nd_defrouter *dr, *ndr; 920 struct nd_prefix *pr, *npr; 921 922 /* 923 * Nuke default router list entries toward ifp. 924 * We defer removal of default router list entries that is installed 925 * in the routing table, in order to keep additional side effects as 926 * small as possible. 927 */ 928 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr) { 929 if (dr->installed) 930 continue; 931 932 if (dr->ifp == ifp) 933 defrtrlist_del(dr); 934 } 935 936 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr) { 937 if (!dr->installed) 938 continue; 939 940 if (dr->ifp == ifp) 941 defrtrlist_del(dr); 942 } 943 944 /* Nuke prefix list entries toward ifp */ 945 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, npr) { 946 if (pr->ndpr_ifp == ifp) { 947 /* 948 * Because if_detach() does *not* release prefixes 949 * while purging addresses the reference count will 950 * still be above zero. We therefore reset it to 951 * make sure that the prefix really gets purged. 952 */ 953 pr->ndpr_refcnt = 0; 954 955 /* 956 * Previously, pr->ndpr_addr is removed as well, 957 * but I strongly believe we don't have to do it. 958 * nd6_purge() is only called from in6_ifdetach(), 959 * which removes all the associated interface addresses 960 * by itself. 961 * (jinmei@kame.net 20010129) 962 */ 963 prelist_remove(pr); 964 } 965 } 966 967 /* cancel default outgoing interface setting */ 968 if (V_nd6_defifindex == ifp->if_index) 969 nd6_setdefaultiface(0); 970 971 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) { 972 /* Refresh default router list. */ 973 defrouter_select(); 974 } 975 976 /* XXXXX 977 * We do not nuke the neighbor cache entries here any more 978 * because the neighbor cache is kept in if_afdata[AF_INET6]. 979 * nd6_purge() is invoked by in6_ifdetach() which is called 980 * from if_detach() where everything gets purged. So let 981 * in6_domifdetach() do the actual L2 table purging work. 982 */ 983 } 984 985 /* 986 * the caller acquires and releases the lock on the lltbls 987 * Returns the llentry locked 988 */ 989 struct llentry * 990 nd6_lookup(const struct in6_addr *addr6, int flags, struct ifnet *ifp) 991 { 992 struct sockaddr_in6 sin6; 993 struct llentry *ln; 994 995 bzero(&sin6, sizeof(sin6)); 996 sin6.sin6_len = sizeof(struct sockaddr_in6); 997 sin6.sin6_family = AF_INET6; 998 sin6.sin6_addr = *addr6; 999 1000 IF_AFDATA_LOCK_ASSERT(ifp); 1001 1002 ln = lla_lookup(LLTABLE6(ifp), flags, (struct sockaddr *)&sin6); 1003 1004 return (ln); 1005 } 1006 1007 struct llentry * 1008 nd6_alloc(const struct in6_addr *addr6, int flags, struct ifnet *ifp) 1009 { 1010 struct sockaddr_in6 sin6; 1011 struct llentry *ln; 1012 1013 bzero(&sin6, sizeof(sin6)); 1014 sin6.sin6_len = sizeof(struct sockaddr_in6); 1015 sin6.sin6_family = AF_INET6; 1016 sin6.sin6_addr = *addr6; 1017 1018 ln = lltable_alloc_entry(LLTABLE6(ifp), 0, (struct sockaddr *)&sin6); 1019 if (ln != NULL) 1020 ln->ln_state = ND6_LLINFO_NOSTATE; 1021 1022 return (ln); 1023 } 1024 1025 /* 1026 * Test whether a given IPv6 address is a neighbor or not, ignoring 1027 * the actual neighbor cache. The neighbor cache is ignored in order 1028 * to not reenter the routing code from within itself. 1029 */ 1030 static int 1031 nd6_is_new_addr_neighbor(const struct sockaddr_in6 *addr, struct ifnet *ifp) 1032 { 1033 struct nd_prefix *pr; 1034 struct ifaddr *dstaddr; 1035 1036 /* 1037 * A link-local address is always a neighbor. 1038 * XXX: a link does not necessarily specify a single interface. 1039 */ 1040 if (IN6_IS_ADDR_LINKLOCAL(&addr->sin6_addr)) { 1041 struct sockaddr_in6 sin6_copy; 1042 u_int32_t zone; 1043 1044 /* 1045 * We need sin6_copy since sa6_recoverscope() may modify the 1046 * content (XXX). 1047 */ 1048 sin6_copy = *addr; 1049 if (sa6_recoverscope(&sin6_copy)) 1050 return (0); /* XXX: should be impossible */ 1051 if (in6_setscope(&sin6_copy.sin6_addr, ifp, &zone)) 1052 return (0); 1053 if (sin6_copy.sin6_scope_id == zone) 1054 return (1); 1055 else 1056 return (0); 1057 } 1058 1059 /* 1060 * If the address matches one of our addresses, 1061 * it should be a neighbor. 1062 * If the address matches one of our on-link prefixes, it should be a 1063 * neighbor. 1064 */ 1065 LIST_FOREACH(pr, &V_nd_prefix, ndpr_entry) { 1066 if (pr->ndpr_ifp != ifp) 1067 continue; 1068 1069 if (!(pr->ndpr_stateflags & NDPRF_ONLINK)) { 1070 struct rtentry *rt; 1071 1072 /* Always use the default FIB here. */ 1073 rt = in6_rtalloc1((struct sockaddr *)&pr->ndpr_prefix, 1074 0, 0, RT_DEFAULT_FIB); 1075 if (rt == NULL) 1076 continue; 1077 /* 1078 * This is the case where multiple interfaces 1079 * have the same prefix, but only one is installed 1080 * into the routing table and that prefix entry 1081 * is not the one being examined here. In the case 1082 * where RADIX_MPATH is enabled, multiple route 1083 * entries (of the same rt_key value) will be 1084 * installed because the interface addresses all 1085 * differ. 1086 */ 1087 if (!IN6_ARE_ADDR_EQUAL(&pr->ndpr_prefix.sin6_addr, 1088 &((struct sockaddr_in6 *)rt_key(rt))->sin6_addr)) { 1089 RTFREE_LOCKED(rt); 1090 continue; 1091 } 1092 RTFREE_LOCKED(rt); 1093 } 1094 1095 if (IN6_ARE_MASKED_ADDR_EQUAL(&pr->ndpr_prefix.sin6_addr, 1096 &addr->sin6_addr, &pr->ndpr_mask)) 1097 return (1); 1098 } 1099 1100 /* 1101 * If the address is assigned on the node of the other side of 1102 * a p2p interface, the address should be a neighbor. 1103 */ 1104 dstaddr = ifa_ifwithdstaddr((const struct sockaddr *)addr, RT_ALL_FIBS); 1105 if (dstaddr != NULL) { 1106 if (dstaddr->ifa_ifp == ifp) { 1107 ifa_free(dstaddr); 1108 return (1); 1109 } 1110 ifa_free(dstaddr); 1111 } 1112 1113 /* 1114 * If the default router list is empty, all addresses are regarded 1115 * as on-link, and thus, as a neighbor. 1116 */ 1117 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV && 1118 TAILQ_EMPTY(&V_nd_defrouter) && 1119 V_nd6_defifindex == ifp->if_index) { 1120 return (1); 1121 } 1122 1123 return (0); 1124 } 1125 1126 1127 /* 1128 * Detect if a given IPv6 address identifies a neighbor on a given link. 1129 * XXX: should take care of the destination of a p2p link? 1130 */ 1131 int 1132 nd6_is_addr_neighbor(const struct sockaddr_in6 *addr, struct ifnet *ifp) 1133 { 1134 struct llentry *lle; 1135 int rc = 0; 1136 1137 IF_AFDATA_UNLOCK_ASSERT(ifp); 1138 if (nd6_is_new_addr_neighbor(addr, ifp)) 1139 return (1); 1140 1141 /* 1142 * Even if the address matches none of our addresses, it might be 1143 * in the neighbor cache. 1144 */ 1145 IF_AFDATA_RLOCK(ifp); 1146 if ((lle = nd6_lookup(&addr->sin6_addr, 0, ifp)) != NULL) { 1147 LLE_RUNLOCK(lle); 1148 rc = 1; 1149 } 1150 IF_AFDATA_RUNLOCK(ifp); 1151 return (rc); 1152 } 1153 1154 /* 1155 * Free an nd6 llinfo entry. 1156 * Since the function would cause significant changes in the kernel, DO NOT 1157 * make it global, unless you have a strong reason for the change, and are sure 1158 * that the change is safe. 1159 */ 1160 static void 1161 nd6_free(struct llentry *ln, int gc) 1162 { 1163 struct nd_defrouter *dr; 1164 struct ifnet *ifp; 1165 1166 LLE_WLOCK_ASSERT(ln); 1167 1168 /* 1169 * we used to have pfctlinput(PRC_HOSTDEAD) here. 1170 * even though it is not harmful, it was not really necessary. 1171 */ 1172 1173 /* cancel timer */ 1174 nd6_llinfo_settimer_locked(ln, -1); 1175 1176 ifp = ln->lle_tbl->llt_ifp; 1177 1178 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) { 1179 dr = defrouter_lookup(&ln->r_l3addr.addr6, ifp); 1180 1181 if (dr != NULL && dr->expire && 1182 ln->ln_state == ND6_LLINFO_STALE && gc) { 1183 /* 1184 * If the reason for the deletion is just garbage 1185 * collection, and the neighbor is an active default 1186 * router, do not delete it. Instead, reset the GC 1187 * timer using the router's lifetime. 1188 * Simply deleting the entry would affect default 1189 * router selection, which is not necessarily a good 1190 * thing, especially when we're using router preference 1191 * values. 1192 * XXX: the check for ln_state would be redundant, 1193 * but we intentionally keep it just in case. 1194 */ 1195 if (dr->expire > time_uptime) 1196 nd6_llinfo_settimer_locked(ln, 1197 (dr->expire - time_uptime) * hz); 1198 else 1199 nd6_llinfo_settimer_locked(ln, 1200 (long)V_nd6_gctimer * hz); 1201 1202 LLE_REMREF(ln); 1203 LLE_WUNLOCK(ln); 1204 return; 1205 } 1206 1207 if (dr) { 1208 /* 1209 * Unreachablity of a router might affect the default 1210 * router selection and on-link detection of advertised 1211 * prefixes. 1212 */ 1213 1214 /* 1215 * Temporarily fake the state to choose a new default 1216 * router and to perform on-link determination of 1217 * prefixes correctly. 1218 * Below the state will be set correctly, 1219 * or the entry itself will be deleted. 1220 */ 1221 ln->ln_state = ND6_LLINFO_INCOMPLETE; 1222 } 1223 1224 if (ln->ln_router || dr) { 1225 1226 /* 1227 * We need to unlock to avoid a LOR with rt6_flush() with the 1228 * rnh and for the calls to pfxlist_onlink_check() and 1229 * defrouter_select() in the block further down for calls 1230 * into nd6_lookup(). We still hold a ref. 1231 */ 1232 LLE_WUNLOCK(ln); 1233 1234 /* 1235 * rt6_flush must be called whether or not the neighbor 1236 * is in the Default Router List. 1237 * See a corresponding comment in nd6_na_input(). 1238 */ 1239 rt6_flush(&ln->r_l3addr.addr6, ifp); 1240 } 1241 1242 if (dr) { 1243 /* 1244 * Since defrouter_select() does not affect the 1245 * on-link determination and MIP6 needs the check 1246 * before the default router selection, we perform 1247 * the check now. 1248 */ 1249 pfxlist_onlink_check(); 1250 1251 /* 1252 * Refresh default router list. 1253 */ 1254 defrouter_select(); 1255 } 1256 1257 /* 1258 * If this entry was added by an on-link redirect, remove the 1259 * corresponding host route. 1260 */ 1261 if (ln->la_flags & LLE_REDIRECT) 1262 nd6_free_redirect(ln); 1263 1264 if (ln->ln_router || dr) 1265 LLE_WLOCK(ln); 1266 } 1267 1268 /* 1269 * Save to unlock. We still hold an extra reference and will not 1270 * free(9) in llentry_free() if someone else holds one as well. 1271 */ 1272 LLE_WUNLOCK(ln); 1273 IF_AFDATA_LOCK(ifp); 1274 LLE_WLOCK(ln); 1275 /* Guard against race with other llentry_free(). */ 1276 if (ln->la_flags & LLE_LINKED) { 1277 /* Remove callout reference */ 1278 LLE_REMREF(ln); 1279 lltable_unlink_entry(ln->lle_tbl, ln); 1280 } 1281 IF_AFDATA_UNLOCK(ifp); 1282 1283 llentry_free(ln); 1284 } 1285 1286 /* 1287 * Remove the rtentry for the given llentry, 1288 * both of which were installed by a redirect. 1289 */ 1290 static void 1291 nd6_free_redirect(const struct llentry *ln) 1292 { 1293 int fibnum; 1294 struct rtentry *rt; 1295 struct radix_node_head *rnh; 1296 struct sockaddr_in6 sin6; 1297 1298 lltable_fill_sa_entry(ln, (struct sockaddr *)&sin6); 1299 for (fibnum = 0; fibnum < rt_numfibs; fibnum++) { 1300 rnh = rt_tables_get_rnh(fibnum, AF_INET6); 1301 if (rnh == NULL) 1302 continue; 1303 1304 RADIX_NODE_HEAD_LOCK(rnh); 1305 rt = in6_rtalloc1((struct sockaddr *)&sin6, 0, 1306 RTF_RNH_LOCKED, fibnum); 1307 if (rt) { 1308 if (rt->rt_flags == (RTF_UP | RTF_HOST | RTF_DYNAMIC)) 1309 rt_expunge(rnh, rt); 1310 RTFREE_LOCKED(rt); 1311 } 1312 RADIX_NODE_HEAD_UNLOCK(rnh); 1313 } 1314 } 1315 1316 /* 1317 * Rejuvenate this function for routing operations related 1318 * processing. 1319 */ 1320 void 1321 nd6_rtrequest(int req, struct rtentry *rt, struct rt_addrinfo *info) 1322 { 1323 struct sockaddr_in6 *gateway; 1324 struct nd_defrouter *dr; 1325 struct ifnet *ifp; 1326 1327 gateway = (struct sockaddr_in6 *)rt->rt_gateway; 1328 ifp = rt->rt_ifp; 1329 1330 switch (req) { 1331 case RTM_ADD: 1332 break; 1333 1334 case RTM_DELETE: 1335 if (!ifp) 1336 return; 1337 /* 1338 * Only indirect routes are interesting. 1339 */ 1340 if ((rt->rt_flags & RTF_GATEWAY) == 0) 1341 return; 1342 /* 1343 * check for default route 1344 */ 1345 if (IN6_ARE_ADDR_EQUAL(&in6addr_any, 1346 &SIN6(rt_key(rt))->sin6_addr)) { 1347 1348 dr = defrouter_lookup(&gateway->sin6_addr, ifp); 1349 if (dr != NULL) 1350 dr->installed = 0; 1351 } 1352 break; 1353 } 1354 } 1355 1356 1357 int 1358 nd6_ioctl(u_long cmd, caddr_t data, struct ifnet *ifp) 1359 { 1360 struct in6_ndireq *ndi = (struct in6_ndireq *)data; 1361 struct in6_nbrinfo *nbi = (struct in6_nbrinfo *)data; 1362 struct in6_ndifreq *ndif = (struct in6_ndifreq *)data; 1363 int error = 0; 1364 1365 if (ifp->if_afdata[AF_INET6] == NULL) 1366 return (EPFNOSUPPORT); 1367 switch (cmd) { 1368 case OSIOCGIFINFO_IN6: 1369 #define ND ndi->ndi 1370 /* XXX: old ndp(8) assumes a positive value for linkmtu. */ 1371 bzero(&ND, sizeof(ND)); 1372 ND.linkmtu = IN6_LINKMTU(ifp); 1373 ND.maxmtu = ND_IFINFO(ifp)->maxmtu; 1374 ND.basereachable = ND_IFINFO(ifp)->basereachable; 1375 ND.reachable = ND_IFINFO(ifp)->reachable; 1376 ND.retrans = ND_IFINFO(ifp)->retrans; 1377 ND.flags = ND_IFINFO(ifp)->flags; 1378 ND.recalctm = ND_IFINFO(ifp)->recalctm; 1379 ND.chlim = ND_IFINFO(ifp)->chlim; 1380 break; 1381 case SIOCGIFINFO_IN6: 1382 ND = *ND_IFINFO(ifp); 1383 break; 1384 case SIOCSIFINFO_IN6: 1385 /* 1386 * used to change host variables from userland. 1387 * intented for a use on router to reflect RA configurations. 1388 */ 1389 /* 0 means 'unspecified' */ 1390 if (ND.linkmtu != 0) { 1391 if (ND.linkmtu < IPV6_MMTU || 1392 ND.linkmtu > IN6_LINKMTU(ifp)) { 1393 error = EINVAL; 1394 break; 1395 } 1396 ND_IFINFO(ifp)->linkmtu = ND.linkmtu; 1397 } 1398 1399 if (ND.basereachable != 0) { 1400 int obasereachable = ND_IFINFO(ifp)->basereachable; 1401 1402 ND_IFINFO(ifp)->basereachable = ND.basereachable; 1403 if (ND.basereachable != obasereachable) 1404 ND_IFINFO(ifp)->reachable = 1405 ND_COMPUTE_RTIME(ND.basereachable); 1406 } 1407 if (ND.retrans != 0) 1408 ND_IFINFO(ifp)->retrans = ND.retrans; 1409 if (ND.chlim != 0) 1410 ND_IFINFO(ifp)->chlim = ND.chlim; 1411 /* FALLTHROUGH */ 1412 case SIOCSIFINFO_FLAGS: 1413 { 1414 struct ifaddr *ifa; 1415 struct in6_ifaddr *ia; 1416 1417 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) && 1418 !(ND.flags & ND6_IFF_IFDISABLED)) { 1419 /* ifdisabled 1->0 transision */ 1420 1421 /* 1422 * If the interface is marked as ND6_IFF_IFDISABLED and 1423 * has an link-local address with IN6_IFF_DUPLICATED, 1424 * do not clear ND6_IFF_IFDISABLED. 1425 * See RFC 4862, Section 5.4.5. 1426 */ 1427 IF_ADDR_RLOCK(ifp); 1428 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) { 1429 if (ifa->ifa_addr->sa_family != AF_INET6) 1430 continue; 1431 ia = (struct in6_ifaddr *)ifa; 1432 if ((ia->ia6_flags & IN6_IFF_DUPLICATED) && 1433 IN6_IS_ADDR_LINKLOCAL(IA6_IN6(ia))) 1434 break; 1435 } 1436 IF_ADDR_RUNLOCK(ifp); 1437 1438 if (ifa != NULL) { 1439 /* LLA is duplicated. */ 1440 ND.flags |= ND6_IFF_IFDISABLED; 1441 log(LOG_ERR, "Cannot enable an interface" 1442 " with a link-local address marked" 1443 " duplicate.\n"); 1444 } else { 1445 ND_IFINFO(ifp)->flags &= ~ND6_IFF_IFDISABLED; 1446 if (ifp->if_flags & IFF_UP) 1447 in6_if_up(ifp); 1448 } 1449 } else if (!(ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) && 1450 (ND.flags & ND6_IFF_IFDISABLED)) { 1451 /* ifdisabled 0->1 transision */ 1452 /* Mark all IPv6 address as tentative. */ 1453 1454 ND_IFINFO(ifp)->flags |= ND6_IFF_IFDISABLED; 1455 if ((ND_IFINFO(ifp)->flags & ND6_IFF_NO_DAD) == 0) { 1456 IF_ADDR_RLOCK(ifp); 1457 TAILQ_FOREACH(ifa, &ifp->if_addrhead, 1458 ifa_link) { 1459 if (ifa->ifa_addr->sa_family != 1460 AF_INET6) 1461 continue; 1462 ia = (struct in6_ifaddr *)ifa; 1463 ia->ia6_flags |= IN6_IFF_TENTATIVE; 1464 } 1465 IF_ADDR_RUNLOCK(ifp); 1466 } 1467 } 1468 1469 if (ND.flags & ND6_IFF_AUTO_LINKLOCAL) { 1470 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_AUTO_LINKLOCAL)) { 1471 /* auto_linklocal 0->1 transision */ 1472 1473 /* If no link-local address on ifp, configure */ 1474 ND_IFINFO(ifp)->flags |= ND6_IFF_AUTO_LINKLOCAL; 1475 in6_ifattach(ifp, NULL); 1476 } else if (!(ND.flags & ND6_IFF_IFDISABLED) && 1477 ifp->if_flags & IFF_UP) { 1478 /* 1479 * When the IF already has 1480 * ND6_IFF_AUTO_LINKLOCAL, no link-local 1481 * address is assigned, and IFF_UP, try to 1482 * assign one. 1483 */ 1484 IF_ADDR_RLOCK(ifp); 1485 TAILQ_FOREACH(ifa, &ifp->if_addrhead, 1486 ifa_link) { 1487 if (ifa->ifa_addr->sa_family != 1488 AF_INET6) 1489 continue; 1490 ia = (struct in6_ifaddr *)ifa; 1491 if (IN6_IS_ADDR_LINKLOCAL(IA6_IN6(ia))) 1492 break; 1493 } 1494 IF_ADDR_RUNLOCK(ifp); 1495 if (ifa != NULL) 1496 /* No LLA is configured. */ 1497 in6_ifattach(ifp, NULL); 1498 } 1499 } 1500 } 1501 ND_IFINFO(ifp)->flags = ND.flags; 1502 break; 1503 #undef ND 1504 case SIOCSNDFLUSH_IN6: /* XXX: the ioctl name is confusing... */ 1505 /* sync kernel routing table with the default router list */ 1506 defrouter_reset(); 1507 defrouter_select(); 1508 break; 1509 case SIOCSPFXFLUSH_IN6: 1510 { 1511 /* flush all the prefix advertised by routers */ 1512 struct nd_prefix *pr, *next; 1513 1514 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, next) { 1515 struct in6_ifaddr *ia, *ia_next; 1516 1517 if (IN6_IS_ADDR_LINKLOCAL(&pr->ndpr_prefix.sin6_addr)) 1518 continue; /* XXX */ 1519 1520 /* do we really have to remove addresses as well? */ 1521 /* XXXRW: in6_ifaddrhead locking. */ 1522 TAILQ_FOREACH_SAFE(ia, &V_in6_ifaddrhead, ia_link, 1523 ia_next) { 1524 if ((ia->ia6_flags & IN6_IFF_AUTOCONF) == 0) 1525 continue; 1526 1527 if (ia->ia6_ndpr == pr) 1528 in6_purgeaddr(&ia->ia_ifa); 1529 } 1530 prelist_remove(pr); 1531 } 1532 break; 1533 } 1534 case SIOCSRTRFLUSH_IN6: 1535 { 1536 /* flush all the default routers */ 1537 struct nd_defrouter *dr, *next; 1538 1539 defrouter_reset(); 1540 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, next) { 1541 defrtrlist_del(dr); 1542 } 1543 defrouter_select(); 1544 break; 1545 } 1546 case SIOCGNBRINFO_IN6: 1547 { 1548 struct llentry *ln; 1549 struct in6_addr nb_addr = nbi->addr; /* make local for safety */ 1550 1551 if ((error = in6_setscope(&nb_addr, ifp, NULL)) != 0) 1552 return (error); 1553 1554 IF_AFDATA_RLOCK(ifp); 1555 ln = nd6_lookup(&nb_addr, 0, ifp); 1556 IF_AFDATA_RUNLOCK(ifp); 1557 1558 if (ln == NULL) { 1559 error = EINVAL; 1560 break; 1561 } 1562 nbi->state = ln->ln_state; 1563 nbi->asked = ln->la_asked; 1564 nbi->isrouter = ln->ln_router; 1565 if (ln->la_expire == 0) 1566 nbi->expire = 0; 1567 else 1568 nbi->expire = ln->la_expire + 1569 (time_second - time_uptime); 1570 LLE_RUNLOCK(ln); 1571 break; 1572 } 1573 case SIOCGDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */ 1574 ndif->ifindex = V_nd6_defifindex; 1575 break; 1576 case SIOCSDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */ 1577 return (nd6_setdefaultiface(ndif->ifindex)); 1578 } 1579 return (error); 1580 } 1581 1582 /* 1583 * Calculates new isRouter value based on provided parameters and 1584 * returns it. 1585 */ 1586 static int 1587 nd6_is_router(int type, int code, int is_new, int old_addr, int new_addr, 1588 int ln_router) 1589 { 1590 1591 /* 1592 * ICMP6 type dependent behavior. 1593 * 1594 * NS: clear IsRouter if new entry 1595 * RS: clear IsRouter 1596 * RA: set IsRouter if there's lladdr 1597 * redir: clear IsRouter if new entry 1598 * 1599 * RA case, (1): 1600 * The spec says that we must set IsRouter in the following cases: 1601 * - If lladdr exist, set IsRouter. This means (1-5). 1602 * - If it is old entry (!newentry), set IsRouter. This means (7). 1603 * So, based on the spec, in (1-5) and (7) cases we must set IsRouter. 1604 * A quetion arises for (1) case. (1) case has no lladdr in the 1605 * neighbor cache, this is similar to (6). 1606 * This case is rare but we figured that we MUST NOT set IsRouter. 1607 * 1608 * is_new old_addr new_addr NS RS RA redir 1609 * D R 1610 * 0 n n (1) c ? s 1611 * 0 y n (2) c s s 1612 * 0 n y (3) c s s 1613 * 0 y y (4) c s s 1614 * 0 y y (5) c s s 1615 * 1 -- n (6) c c c s 1616 * 1 -- y (7) c c s c s 1617 * 1618 * (c=clear s=set) 1619 */ 1620 switch (type & 0xff) { 1621 case ND_NEIGHBOR_SOLICIT: 1622 /* 1623 * New entry must have is_router flag cleared. 1624 */ 1625 if (is_new) /* (6-7) */ 1626 ln_router = 0; 1627 break; 1628 case ND_REDIRECT: 1629 /* 1630 * If the icmp is a redirect to a better router, always set the 1631 * is_router flag. Otherwise, if the entry is newly created, 1632 * clear the flag. [RFC 2461, sec 8.3] 1633 */ 1634 if (code == ND_REDIRECT_ROUTER) 1635 ln_router = 1; 1636 else { 1637 if (is_new) /* (6-7) */ 1638 ln_router = 0; 1639 } 1640 break; 1641 case ND_ROUTER_SOLICIT: 1642 /* 1643 * is_router flag must always be cleared. 1644 */ 1645 ln_router = 0; 1646 break; 1647 case ND_ROUTER_ADVERT: 1648 /* 1649 * Mark an entry with lladdr as a router. 1650 */ 1651 if ((!is_new && (old_addr || new_addr)) || /* (2-5) */ 1652 (is_new && new_addr)) { /* (7) */ 1653 ln_router = 1; 1654 } 1655 break; 1656 } 1657 1658 return (ln_router); 1659 } 1660 1661 /* 1662 * Create neighbor cache entry and cache link-layer address, 1663 * on reception of inbound ND6 packets. (RS/RA/NS/redirect) 1664 * 1665 * type - ICMP6 type 1666 * code - type dependent information 1667 * 1668 */ 1669 void 1670 nd6_cache_lladdr(struct ifnet *ifp, struct in6_addr *from, char *lladdr, 1671 int lladdrlen, int type, int code) 1672 { 1673 struct llentry *ln = NULL, *ln_tmp; 1674 int is_newentry; 1675 int do_update; 1676 int olladdr; 1677 int llchange; 1678 int flags; 1679 uint16_t router = 0; 1680 struct sockaddr_in6 sin6; 1681 struct mbuf *chain = NULL; 1682 1683 IF_AFDATA_UNLOCK_ASSERT(ifp); 1684 1685 KASSERT(ifp != NULL, ("%s: ifp == NULL", __func__)); 1686 KASSERT(from != NULL, ("%s: from == NULL", __func__)); 1687 1688 /* nothing must be updated for unspecified address */ 1689 if (IN6_IS_ADDR_UNSPECIFIED(from)) 1690 return; 1691 1692 /* 1693 * Validation about ifp->if_addrlen and lladdrlen must be done in 1694 * the caller. 1695 * 1696 * XXX If the link does not have link-layer adderss, what should 1697 * we do? (ifp->if_addrlen == 0) 1698 * Spec says nothing in sections for RA, RS and NA. There's small 1699 * description on it in NS section (RFC 2461 7.2.3). 1700 */ 1701 flags = lladdr ? LLE_EXCLUSIVE : 0; 1702 IF_AFDATA_RLOCK(ifp); 1703 ln = nd6_lookup(from, flags, ifp); 1704 IF_AFDATA_RUNLOCK(ifp); 1705 is_newentry = 0; 1706 if (ln == NULL) { 1707 flags |= LLE_EXCLUSIVE; 1708 ln = nd6_alloc(from, 0, ifp); 1709 if (ln == NULL) 1710 return; 1711 1712 /* 1713 * Since we already know all the data for the new entry, 1714 * fill it before insertion. 1715 */ 1716 if (lladdr != NULL) { 1717 bcopy(lladdr, &ln->ll_addr, ifp->if_addrlen); 1718 ln->la_flags |= LLE_VALID; 1719 } 1720 IF_AFDATA_WLOCK(ifp); 1721 LLE_WLOCK(ln); 1722 /* Prefer any existing lle over newly-created one */ 1723 ln_tmp = nd6_lookup(from, LLE_EXCLUSIVE, ifp); 1724 if (ln_tmp == NULL) 1725 lltable_link_entry(LLTABLE6(ifp), ln); 1726 IF_AFDATA_WUNLOCK(ifp); 1727 if (ln_tmp == NULL) { 1728 /* No existing lle, mark as new entry */ 1729 is_newentry = 1; 1730 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE); 1731 } else { 1732 lltable_free_entry(LLTABLE6(ifp), ln); 1733 ln = ln_tmp; 1734 ln_tmp = NULL; 1735 } 1736 } 1737 /* do nothing if static ndp is set */ 1738 if ((ln->la_flags & LLE_STATIC)) { 1739 if (flags & LLE_EXCLUSIVE) 1740 LLE_WUNLOCK(ln); 1741 else 1742 LLE_RUNLOCK(ln); 1743 return; 1744 } 1745 1746 olladdr = (ln->la_flags & LLE_VALID) ? 1 : 0; 1747 if (olladdr && lladdr) { 1748 llchange = bcmp(lladdr, &ln->ll_addr, 1749 ifp->if_addrlen); 1750 } else if (!olladdr && lladdr) 1751 llchange = 1; 1752 else 1753 llchange = 0; 1754 1755 /* 1756 * newentry olladdr lladdr llchange (*=record) 1757 * 0 n n -- (1) 1758 * 0 y n -- (2) 1759 * 0 n y y (3) * STALE 1760 * 0 y y n (4) * 1761 * 0 y y y (5) * STALE 1762 * 1 -- n -- (6) NOSTATE(= PASSIVE) 1763 * 1 -- y -- (7) * STALE 1764 */ 1765 1766 do_update = 0; 1767 if (!is_newentry && llchange != 0) 1768 do_update = 1; /* (3,5) */ 1769 1770 if (lladdr) { /* (3-5) and (7) */ 1771 /* 1772 * Record source link-layer address 1773 * XXX is it dependent to ifp->if_type? 1774 */ 1775 bcopy(lladdr, &ln->ll_addr, ifp->if_addrlen); 1776 ln->la_flags |= LLE_VALID; 1777 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE); 1778 1779 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_RESOLVED); 1780 1781 if (do_update) { 1782 if (ln->la_hold != NULL) 1783 nd6_grab_holdchain(ln, &chain, &sin6); 1784 } 1785 } 1786 1787 /* Calculates new router status */ 1788 router = nd6_is_router(type, code, is_newentry, olladdr, 1789 lladdr != NULL ? 1 : 0, ln->ln_router); 1790 1791 ln->ln_router = router; 1792 /* Mark non-router redirects with special flag */ 1793 if ((type & 0xFF) == ND_REDIRECT && code != ND_REDIRECT_ROUTER) 1794 ln->la_flags |= LLE_REDIRECT; 1795 1796 if (flags & LLE_EXCLUSIVE) 1797 LLE_WUNLOCK(ln); 1798 else 1799 LLE_RUNLOCK(ln); 1800 1801 if (chain != NULL) 1802 nd6_flush_holdchain(ifp, ifp, chain, &sin6); 1803 1804 /* 1805 * When the link-layer address of a router changes, select the 1806 * best router again. In particular, when the neighbor entry is newly 1807 * created, it might affect the selection policy. 1808 * Question: can we restrict the first condition to the "is_newentry" 1809 * case? 1810 * XXX: when we hear an RA from a new router with the link-layer 1811 * address option, defrouter_select() is called twice, since 1812 * defrtrlist_update called the function as well. However, I believe 1813 * we can compromise the overhead, since it only happens the first 1814 * time. 1815 * XXX: although defrouter_select() should not have a bad effect 1816 * for those are not autoconfigured hosts, we explicitly avoid such 1817 * cases for safety. 1818 */ 1819 if ((do_update || is_newentry) && router && 1820 ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) { 1821 /* 1822 * guaranteed recursion 1823 */ 1824 defrouter_select(); 1825 } 1826 } 1827 1828 static void 1829 nd6_slowtimo(void *arg) 1830 { 1831 CURVNET_SET((struct vnet *) arg); 1832 struct nd_ifinfo *nd6if; 1833 struct ifnet *ifp; 1834 1835 callout_reset(&V_nd6_slowtimo_ch, ND6_SLOWTIMER_INTERVAL * hz, 1836 nd6_slowtimo, curvnet); 1837 IFNET_RLOCK_NOSLEEP(); 1838 TAILQ_FOREACH(ifp, &V_ifnet, if_link) { 1839 if (ifp->if_afdata[AF_INET6] == NULL) 1840 continue; 1841 nd6if = ND_IFINFO(ifp); 1842 if (nd6if->basereachable && /* already initialized */ 1843 (nd6if->recalctm -= ND6_SLOWTIMER_INTERVAL) <= 0) { 1844 /* 1845 * Since reachable time rarely changes by router 1846 * advertisements, we SHOULD insure that a new random 1847 * value gets recomputed at least once every few hours. 1848 * (RFC 2461, 6.3.4) 1849 */ 1850 nd6if->recalctm = V_nd6_recalc_reachtm_interval; 1851 nd6if->reachable = ND_COMPUTE_RTIME(nd6if->basereachable); 1852 } 1853 } 1854 IFNET_RUNLOCK_NOSLEEP(); 1855 CURVNET_RESTORE(); 1856 } 1857 1858 void 1859 nd6_grab_holdchain(struct llentry *ln, struct mbuf **chain, 1860 struct sockaddr_in6 *sin6) 1861 { 1862 1863 LLE_WLOCK_ASSERT(ln); 1864 1865 *chain = ln->la_hold; 1866 ln->la_hold = NULL; 1867 lltable_fill_sa_entry(ln, (struct sockaddr *)sin6); 1868 1869 if (ln->ln_state == ND6_LLINFO_STALE) { 1870 1871 /* 1872 * The first time we send a packet to a 1873 * neighbor whose entry is STALE, we have 1874 * to change the state to DELAY and a sets 1875 * a timer to expire in DELAY_FIRST_PROBE_TIME 1876 * seconds to ensure do neighbor unreachability 1877 * detection on expiration. 1878 * (RFC 2461 7.3.3) 1879 */ 1880 nd6_llinfo_setstate(ln, ND6_LLINFO_DELAY); 1881 } 1882 } 1883 1884 int 1885 nd6_output_ifp(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *m, 1886 struct sockaddr_in6 *dst) 1887 { 1888 int error; 1889 int ip6len; 1890 struct ip6_hdr *ip6; 1891 struct m_tag *mtag; 1892 1893 #ifdef MAC 1894 mac_netinet6_nd6_send(ifp, m); 1895 #endif 1896 1897 /* 1898 * If called from nd6_ns_output() (NS), nd6_na_output() (NA), 1899 * icmp6_redirect_output() (REDIRECT) or from rip6_output() (RS, RA 1900 * as handled by rtsol and rtadvd), mbufs will be tagged for SeND 1901 * to be diverted to user space. When re-injected into the kernel, 1902 * send_output() will directly dispatch them to the outgoing interface. 1903 */ 1904 if (send_sendso_input_hook != NULL) { 1905 mtag = m_tag_find(m, PACKET_TAG_ND_OUTGOING, NULL); 1906 if (mtag != NULL) { 1907 ip6 = mtod(m, struct ip6_hdr *); 1908 ip6len = sizeof(struct ip6_hdr) + ntohs(ip6->ip6_plen); 1909 /* Use the SEND socket */ 1910 error = send_sendso_input_hook(m, ifp, SND_OUT, 1911 ip6len); 1912 /* -1 == no app on SEND socket */ 1913 if (error == 0 || error != -1) 1914 return (error); 1915 } 1916 } 1917 1918 m_clrprotoflags(m); /* Avoid confusing lower layers. */ 1919 IP_PROBE(send, NULL, NULL, mtod(m, struct ip6_hdr *), ifp, NULL, 1920 mtod(m, struct ip6_hdr *)); 1921 1922 if ((ifp->if_flags & IFF_LOOPBACK) == 0) 1923 origifp = ifp; 1924 1925 error = (*ifp->if_output)(origifp, m, (struct sockaddr *)dst, NULL); 1926 return (error); 1927 } 1928 1929 /* 1930 * Do L2 address resolution for @sa_dst address. Stores found 1931 * address in @desten buffer. Copy of lle ln_flags can be also 1932 * saved in @pflags if @pflags is non-NULL. 1933 * 1934 * If destination LLE does not exists or lle state modification 1935 * is required, call "slow" version. 1936 * 1937 * Return values: 1938 * - 0 on success (address copied to buffer). 1939 * - EWOULDBLOCK (no local error, but address is still unresolved) 1940 * - other errors (alloc failure, etc) 1941 */ 1942 int 1943 nd6_resolve(struct ifnet *ifp, int is_gw, struct mbuf *m, 1944 const struct sockaddr *sa_dst, u_char *desten, uint32_t *pflags) 1945 { 1946 struct llentry *ln = NULL; 1947 const struct sockaddr_in6 *dst6; 1948 1949 if (pflags != NULL) 1950 *pflags = 0; 1951 1952 dst6 = (const struct sockaddr_in6 *)sa_dst; 1953 1954 /* discard the packet if IPv6 operation is disabled on the interface */ 1955 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED)) { 1956 m_freem(m); 1957 return (ENETDOWN); /* better error? */ 1958 } 1959 1960 if (m != NULL && m->m_flags & M_MCAST) { 1961 switch (ifp->if_type) { 1962 case IFT_ETHER: 1963 case IFT_FDDI: 1964 case IFT_L2VLAN: 1965 case IFT_IEEE80211: 1966 case IFT_BRIDGE: 1967 case IFT_ISO88025: 1968 ETHER_MAP_IPV6_MULTICAST(&dst6->sin6_addr, 1969 desten); 1970 return (0); 1971 default: 1972 m_freem(m); 1973 return (EAFNOSUPPORT); 1974 } 1975 } 1976 1977 IF_AFDATA_RLOCK(ifp); 1978 ln = nd6_lookup(&dst6->sin6_addr, 0, ifp); 1979 IF_AFDATA_RUNLOCK(ifp); 1980 1981 /* 1982 * Perform fast path for the following cases: 1983 * 1) lle state is REACHABLE 1984 * 2) lle state is DELAY (NS message sent) 1985 * 1986 * Every other case involves lle modification, so we handle 1987 * them separately. 1988 */ 1989 if (ln == NULL || (ln->ln_state != ND6_LLINFO_REACHABLE && 1990 ln->ln_state != ND6_LLINFO_DELAY)) { 1991 /* Fall back to slow processing path */ 1992 if (ln != NULL) 1993 LLE_RUNLOCK(ln); 1994 return (nd6_resolve_slow(ifp, m, dst6, desten, pflags)); 1995 } 1996 1997 1998 bcopy(&ln->ll_addr, desten, ifp->if_addrlen); 1999 if (pflags != NULL) 2000 *pflags = ln->la_flags; 2001 LLE_RUNLOCK(ln); 2002 return (0); 2003 } 2004 2005 2006 /* 2007 * Do L2 address resolution for @sa_dst address. Stores found 2008 * address in @desten buffer. Copy of lle ln_flags can be also 2009 * saved in @pflags if @pflags is non-NULL. 2010 * 2011 * Heavy version. 2012 * Function assume that destination LLE does not exist, 2013 * is invalid or stale, so LLE_EXCLUSIVE lock needs to be acquired. 2014 */ 2015 static int 2016 nd6_resolve_slow(struct ifnet *ifp, struct mbuf *m, 2017 const struct sockaddr_in6 *dst, u_char *desten, uint32_t *pflags) 2018 { 2019 struct llentry *lle = NULL, *lle_tmp; 2020 struct in6_addr *psrc, src; 2021 int send_ns; 2022 2023 /* 2024 * Address resolution or Neighbor Unreachability Detection 2025 * for the next hop. 2026 * At this point, the destination of the packet must be a unicast 2027 * or an anycast address(i.e. not a multicast). 2028 */ 2029 if (lle == NULL) { 2030 IF_AFDATA_RLOCK(ifp); 2031 lle = nd6_lookup(&dst->sin6_addr, LLE_EXCLUSIVE, ifp); 2032 IF_AFDATA_RUNLOCK(ifp); 2033 if ((lle == NULL) && nd6_is_addr_neighbor(dst, ifp)) { 2034 /* 2035 * Since nd6_is_addr_neighbor() internally calls nd6_lookup(), 2036 * the condition below is not very efficient. But we believe 2037 * it is tolerable, because this should be a rare case. 2038 */ 2039 lle = nd6_alloc(&dst->sin6_addr, 0, ifp); 2040 if (lle == NULL) { 2041 char ip6buf[INET6_ADDRSTRLEN]; 2042 log(LOG_DEBUG, 2043 "nd6_output: can't allocate llinfo for %s " 2044 "(ln=%p)\n", 2045 ip6_sprintf(ip6buf, &dst->sin6_addr), lle); 2046 m_freem(m); 2047 return (ENOBUFS); 2048 } 2049 2050 IF_AFDATA_WLOCK(ifp); 2051 LLE_WLOCK(lle); 2052 /* Prefer any existing entry over newly-created one */ 2053 lle_tmp = nd6_lookup(&dst->sin6_addr, LLE_EXCLUSIVE, ifp); 2054 if (lle_tmp == NULL) 2055 lltable_link_entry(LLTABLE6(ifp), lle); 2056 IF_AFDATA_WUNLOCK(ifp); 2057 if (lle_tmp != NULL) { 2058 lltable_free_entry(LLTABLE6(ifp), lle); 2059 lle = lle_tmp; 2060 lle_tmp = NULL; 2061 } 2062 } 2063 } 2064 if (lle == NULL) { 2065 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_PERFORMNUD)) { 2066 m_freem(m); 2067 return (ENOBUFS); 2068 } 2069 2070 if (m != NULL) 2071 m_freem(m); 2072 return (ENOBUFS); 2073 } 2074 2075 LLE_WLOCK_ASSERT(lle); 2076 2077 /* 2078 * The first time we send a packet to a neighbor whose entry is 2079 * STALE, we have to change the state to DELAY and a sets a timer to 2080 * expire in DELAY_FIRST_PROBE_TIME seconds to ensure do 2081 * neighbor unreachability detection on expiration. 2082 * (RFC 2461 7.3.3) 2083 */ 2084 if (lle->ln_state == ND6_LLINFO_STALE) 2085 nd6_llinfo_setstate(lle, ND6_LLINFO_DELAY); 2086 2087 /* 2088 * If the neighbor cache entry has a state other than INCOMPLETE 2089 * (i.e. its link-layer address is already resolved), just 2090 * send the packet. 2091 */ 2092 if (lle->ln_state > ND6_LLINFO_INCOMPLETE) { 2093 bcopy(&lle->ll_addr, desten, ifp->if_addrlen); 2094 if (pflags != NULL) 2095 *pflags = lle->la_flags; 2096 LLE_WUNLOCK(lle); 2097 return (0); 2098 } 2099 2100 /* 2101 * There is a neighbor cache entry, but no ethernet address 2102 * response yet. Append this latest packet to the end of the 2103 * packet queue in the mbuf, unless the number of the packet 2104 * does not exceed nd6_maxqueuelen. When it exceeds nd6_maxqueuelen, 2105 * the oldest packet in the queue will be removed. 2106 */ 2107 2108 if (lle->la_hold != NULL) { 2109 struct mbuf *m_hold; 2110 int i; 2111 2112 i = 0; 2113 for (m_hold = lle->la_hold; m_hold; m_hold = m_hold->m_nextpkt){ 2114 i++; 2115 if (m_hold->m_nextpkt == NULL) { 2116 m_hold->m_nextpkt = m; 2117 break; 2118 } 2119 } 2120 while (i >= V_nd6_maxqueuelen) { 2121 m_hold = lle->la_hold; 2122 lle->la_hold = lle->la_hold->m_nextpkt; 2123 m_freem(m_hold); 2124 i--; 2125 } 2126 } else { 2127 lle->la_hold = m; 2128 } 2129 2130 /* 2131 * If there has been no NS for the neighbor after entering the 2132 * INCOMPLETE state, send the first solicitation. 2133 * Note that for newly-created lle la_asked will be 0, 2134 * so we will transition from ND6_LLINFO_NOSTATE to 2135 * ND6_LLINFO_INCOMPLETE state here. 2136 */ 2137 psrc = NULL; 2138 send_ns = 0; 2139 if (lle->la_asked == 0) { 2140 lle->la_asked++; 2141 send_ns = 1; 2142 psrc = nd6_llinfo_get_holdsrc(lle, &src); 2143 2144 nd6_llinfo_setstate(lle, ND6_LLINFO_INCOMPLETE); 2145 } 2146 LLE_WUNLOCK(lle); 2147 if (send_ns != 0) 2148 nd6_ns_output(ifp, psrc, NULL, &dst->sin6_addr, NULL); 2149 2150 return (EWOULDBLOCK); 2151 } 2152 2153 2154 int 2155 nd6_flush_holdchain(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *chain, 2156 struct sockaddr_in6 *dst) 2157 { 2158 struct mbuf *m, *m_head; 2159 struct ifnet *outifp; 2160 int error = 0; 2161 2162 m_head = chain; 2163 if ((ifp->if_flags & IFF_LOOPBACK) != 0) 2164 outifp = origifp; 2165 else 2166 outifp = ifp; 2167 2168 while (m_head) { 2169 m = m_head; 2170 m_head = m_head->m_nextpkt; 2171 error = nd6_output_ifp(ifp, origifp, m, dst); 2172 } 2173 2174 /* 2175 * XXX 2176 * note that intermediate errors are blindly ignored 2177 */ 2178 return (error); 2179 } 2180 2181 static int 2182 nd6_need_cache(struct ifnet *ifp) 2183 { 2184 /* 2185 * XXX: we currently do not make neighbor cache on any interface 2186 * other than ARCnet, Ethernet, FDDI and GIF. 2187 * 2188 * RFC2893 says: 2189 * - unidirectional tunnels needs no ND 2190 */ 2191 switch (ifp->if_type) { 2192 case IFT_ARCNET: 2193 case IFT_ETHER: 2194 case IFT_FDDI: 2195 case IFT_IEEE1394: 2196 case IFT_L2VLAN: 2197 case IFT_IEEE80211: 2198 case IFT_INFINIBAND: 2199 case IFT_BRIDGE: 2200 case IFT_PROPVIRTUAL: 2201 return (1); 2202 default: 2203 return (0); 2204 } 2205 } 2206 2207 /* 2208 * Add pernament ND6 link-layer record for given 2209 * interface address. 2210 * 2211 * Very similar to IPv4 arp_ifinit(), but: 2212 * 1) IPv6 DAD is performed in different place 2213 * 2) It is called by IPv6 protocol stack in contrast to 2214 * arp_ifinit() which is typically called in SIOCSIFADDR 2215 * driver ioctl handler. 2216 * 2217 */ 2218 int 2219 nd6_add_ifa_lle(struct in6_ifaddr *ia) 2220 { 2221 struct ifnet *ifp; 2222 struct llentry *ln, *ln_tmp; 2223 struct sockaddr *dst; 2224 2225 ifp = ia->ia_ifa.ifa_ifp; 2226 if (nd6_need_cache(ifp) == 0) 2227 return (0); 2228 2229 ia->ia_ifa.ifa_rtrequest = nd6_rtrequest; 2230 dst = (struct sockaddr *)&ia->ia_addr; 2231 ln = lltable_alloc_entry(LLTABLE6(ifp), LLE_IFADDR, dst); 2232 if (ln == NULL) 2233 return (ENOBUFS); 2234 2235 IF_AFDATA_WLOCK(ifp); 2236 LLE_WLOCK(ln); 2237 /* Unlink any entry if exists */ 2238 ln_tmp = lla_lookup(LLTABLE6(ifp), LLE_EXCLUSIVE, dst); 2239 if (ln_tmp != NULL) 2240 lltable_unlink_entry(LLTABLE6(ifp), ln_tmp); 2241 lltable_link_entry(LLTABLE6(ifp), ln); 2242 IF_AFDATA_WUNLOCK(ifp); 2243 2244 if (ln_tmp != NULL) 2245 EVENTHANDLER_INVOKE(lle_event, ln_tmp, LLENTRY_EXPIRED); 2246 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_RESOLVED); 2247 2248 LLE_WUNLOCK(ln); 2249 if (ln_tmp != NULL) 2250 llentry_free(ln_tmp); 2251 2252 return (0); 2253 } 2254 2255 /* 2256 * Removes either all lle entries for given @ia, or lle 2257 * corresponding to @ia address. 2258 */ 2259 void 2260 nd6_rem_ifa_lle(struct in6_ifaddr *ia, int all) 2261 { 2262 struct sockaddr_in6 mask, addr; 2263 struct sockaddr *saddr, *smask; 2264 struct ifnet *ifp; 2265 2266 ifp = ia->ia_ifa.ifa_ifp; 2267 memcpy(&addr, &ia->ia_addr, sizeof(ia->ia_addr)); 2268 memcpy(&mask, &ia->ia_prefixmask, sizeof(ia->ia_prefixmask)); 2269 saddr = (struct sockaddr *)&addr; 2270 smask = (struct sockaddr *)&mask; 2271 2272 if (all != 0) 2273 lltable_prefix_free(AF_INET6, saddr, smask, LLE_STATIC); 2274 else 2275 lltable_delete_addr(LLTABLE6(ifp), LLE_IFADDR, saddr); 2276 } 2277 2278 static void 2279 clear_llinfo_pqueue(struct llentry *ln) 2280 { 2281 struct mbuf *m_hold, *m_hold_next; 2282 2283 for (m_hold = ln->la_hold; m_hold; m_hold = m_hold_next) { 2284 m_hold_next = m_hold->m_nextpkt; 2285 m_freem(m_hold); 2286 } 2287 2288 ln->la_hold = NULL; 2289 return; 2290 } 2291 2292 static int nd6_sysctl_drlist(SYSCTL_HANDLER_ARGS); 2293 static int nd6_sysctl_prlist(SYSCTL_HANDLER_ARGS); 2294 #ifdef SYSCTL_DECL 2295 SYSCTL_DECL(_net_inet6_icmp6); 2296 #endif 2297 SYSCTL_NODE(_net_inet6_icmp6, ICMPV6CTL_ND6_DRLIST, nd6_drlist, 2298 CTLFLAG_RD, nd6_sysctl_drlist, ""); 2299 SYSCTL_NODE(_net_inet6_icmp6, ICMPV6CTL_ND6_PRLIST, nd6_prlist, 2300 CTLFLAG_RD, nd6_sysctl_prlist, ""); 2301 SYSCTL_INT(_net_inet6_icmp6, ICMPV6CTL_ND6_MAXQLEN, nd6_maxqueuelen, 2302 CTLFLAG_VNET | CTLFLAG_RW, &VNET_NAME(nd6_maxqueuelen), 1, ""); 2303 SYSCTL_INT(_net_inet6_icmp6, OID_AUTO, nd6_gctimer, 2304 CTLFLAG_VNET | CTLFLAG_RW, &VNET_NAME(nd6_gctimer), (60 * 60 * 24), ""); 2305 2306 static int 2307 nd6_sysctl_drlist(SYSCTL_HANDLER_ARGS) 2308 { 2309 struct in6_defrouter d; 2310 struct nd_defrouter *dr; 2311 int error; 2312 2313 if (req->newptr) 2314 return (EPERM); 2315 2316 bzero(&d, sizeof(d)); 2317 d.rtaddr.sin6_family = AF_INET6; 2318 d.rtaddr.sin6_len = sizeof(d.rtaddr); 2319 2320 /* 2321 * XXX locking 2322 */ 2323 TAILQ_FOREACH(dr, &V_nd_defrouter, dr_entry) { 2324 d.rtaddr.sin6_addr = dr->rtaddr; 2325 error = sa6_recoverscope(&d.rtaddr); 2326 if (error != 0) 2327 return (error); 2328 d.flags = dr->flags; 2329 d.rtlifetime = dr->rtlifetime; 2330 d.expire = dr->expire + (time_second - time_uptime); 2331 d.if_index = dr->ifp->if_index; 2332 error = SYSCTL_OUT(req, &d, sizeof(d)); 2333 if (error != 0) 2334 return (error); 2335 } 2336 return (0); 2337 } 2338 2339 static int 2340 nd6_sysctl_prlist(SYSCTL_HANDLER_ARGS) 2341 { 2342 struct in6_prefix p; 2343 struct sockaddr_in6 s6; 2344 struct nd_prefix *pr; 2345 struct nd_pfxrouter *pfr; 2346 time_t maxexpire; 2347 int error; 2348 char ip6buf[INET6_ADDRSTRLEN]; 2349 2350 if (req->newptr) 2351 return (EPERM); 2352 2353 bzero(&p, sizeof(p)); 2354 p.origin = PR_ORIG_RA; 2355 bzero(&s6, sizeof(s6)); 2356 s6.sin6_family = AF_INET6; 2357 s6.sin6_len = sizeof(s6); 2358 2359 /* 2360 * XXX locking 2361 */ 2362 LIST_FOREACH(pr, &V_nd_prefix, ndpr_entry) { 2363 p.prefix = pr->ndpr_prefix; 2364 if (sa6_recoverscope(&p.prefix)) { 2365 log(LOG_ERR, "scope error in prefix list (%s)\n", 2366 ip6_sprintf(ip6buf, &p.prefix.sin6_addr)); 2367 /* XXX: press on... */ 2368 } 2369 p.raflags = pr->ndpr_raf; 2370 p.prefixlen = pr->ndpr_plen; 2371 p.vltime = pr->ndpr_vltime; 2372 p.pltime = pr->ndpr_pltime; 2373 p.if_index = pr->ndpr_ifp->if_index; 2374 if (pr->ndpr_vltime == ND6_INFINITE_LIFETIME) 2375 p.expire = 0; 2376 else { 2377 /* XXX: we assume time_t is signed. */ 2378 maxexpire = (-1) & 2379 ~((time_t)1 << ((sizeof(maxexpire) * 8) - 1)); 2380 if (pr->ndpr_vltime < maxexpire - pr->ndpr_lastupdate) 2381 p.expire = pr->ndpr_lastupdate + 2382 pr->ndpr_vltime + 2383 (time_second - time_uptime); 2384 else 2385 p.expire = maxexpire; 2386 } 2387 p.refcnt = pr->ndpr_refcnt; 2388 p.flags = pr->ndpr_stateflags; 2389 p.advrtrs = 0; 2390 LIST_FOREACH(pfr, &pr->ndpr_advrtrs, pfr_entry) 2391 p.advrtrs++; 2392 error = SYSCTL_OUT(req, &p, sizeof(p)); 2393 if (error != 0) 2394 return (error); 2395 LIST_FOREACH(pfr, &pr->ndpr_advrtrs, pfr_entry) { 2396 s6.sin6_addr = pfr->router->rtaddr; 2397 if (sa6_recoverscope(&s6)) 2398 log(LOG_ERR, 2399 "scope error in prefix list (%s)\n", 2400 ip6_sprintf(ip6buf, &pfr->router->rtaddr)); 2401 error = SYSCTL_OUT(req, &s6, sizeof(s6)); 2402 if (error != 0) 2403 return (error); 2404 } 2405 } 2406 return (0); 2407 } 2408