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