2 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
29 * $KAME: nd6.c,v 1.144 2001/05/24 07:44:00 itojun Exp $
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
36 #include "opt_inet6.h"
38 #include <sys/param.h>
39 #include <sys/systm.h>
40 #include <sys/callout.h>
41 #include <sys/malloc.h>
43 #include <sys/socket.h>
44 #include <sys/sockio.h>
46 #include <sys/kernel.h>
47 #include <sys/protosw.h>
48 #include <sys/errno.h>
49 #include <sys/syslog.h>
51 #include <sys/rwlock.h>
52 #include <sys/queue.h>
53 #include <sys/sysctl.h>
56 #include <net/if_arc.h>
57 #include <net/if_dl.h>
58 #include <net/if_types.h>
59 #include <net/iso88025.h>
61 #include <net/route.h>
64 #include <netinet/in.h>
65 #include <net/if_llatbl.h>
66 #define L3_ADDR_SIN6(le) ((struct sockaddr_in6 *) L3_ADDR(le))
67 #include <netinet/if_ether.h>
68 #include <netinet6/in6_var.h>
69 #include <netinet/ip6.h>
70 #include <netinet6/ip6_var.h>
71 #include <netinet6/scope6_var.h>
72 #include <netinet6/nd6.h>
73 #include <netinet6/in6_ifattach.h>
74 #include <netinet/icmp6.h>
75 #include <netinet6/send.h>
77 #include <sys/limits.h>
79 #include <security/mac/mac_framework.h>
81 #define ND6_SLOWTIMER_INTERVAL (60 * 60) /* 1 hour */
82 #define ND6_RECALC_REACHTM_INTERVAL (60 * 120) /* 2 hours */
84 #define SIN6(s) ((const struct sockaddr_in6 *)(s))
87 VNET_DEFINE(int, nd6_prune) = 1; /* walk list every 1 seconds */
88 VNET_DEFINE(int, nd6_delay) = 5; /* delay first probe time 5 second */
89 VNET_DEFINE(int, nd6_umaxtries) = 3; /* maximum unicast query */
90 VNET_DEFINE(int, nd6_mmaxtries) = 3; /* maximum multicast query */
91 VNET_DEFINE(int, nd6_useloopback) = 1; /* use loopback interface for
93 VNET_DEFINE(int, nd6_gctimer) = (60 * 60 * 24); /* 1 day: garbage
96 /* preventing too many loops in ND option parsing */
97 static VNET_DEFINE(int, nd6_maxndopt) = 10; /* max # of ND options allowed */
99 VNET_DEFINE(int, nd6_maxnudhint) = 0; /* max # of subsequent upper
101 static VNET_DEFINE(int, nd6_maxqueuelen) = 1; /* max pkts cached in unresolved
103 #define V_nd6_maxndopt VNET(nd6_maxndopt)
104 #define V_nd6_maxqueuelen VNET(nd6_maxqueuelen)
107 VNET_DEFINE(int, nd6_debug) = 1;
109 VNET_DEFINE(int, nd6_debug) = 0;
114 static int nd6_inuse, nd6_allocated;
117 VNET_DEFINE(struct nd_drhead, nd_defrouter);
118 VNET_DEFINE(struct nd_prhead, nd_prefix);
120 VNET_DEFINE(int, nd6_recalc_reachtm_interval) = ND6_RECALC_REACHTM_INTERVAL;
121 #define V_nd6_recalc_reachtm_interval VNET(nd6_recalc_reachtm_interval)
123 int (*send_sendso_input_hook)(struct mbuf *, struct ifnet *, int, int);
125 static int nd6_is_new_addr_neighbor(struct sockaddr_in6 *,
127 static void nd6_setmtu0(struct ifnet *, struct nd_ifinfo *);
128 static void nd6_slowtimo(void *);
129 static int regen_tmpaddr(struct in6_ifaddr *);
130 static struct llentry *nd6_free(struct llentry *, int);
131 static void nd6_llinfo_timer(void *);
132 static void clear_llinfo_pqueue(struct llentry *);
134 static VNET_DEFINE(struct callout, nd6_slowtimo_ch);
135 #define V_nd6_slowtimo_ch VNET(nd6_slowtimo_ch)
137 VNET_DEFINE(struct callout, nd6_timer_ch);
143 LIST_INIT(&V_nd_prefix);
145 /* initialization of the default router list */
146 TAILQ_INIT(&V_nd_defrouter);
149 callout_init(&V_nd6_slowtimo_ch, 0);
150 callout_reset(&V_nd6_slowtimo_ch, ND6_SLOWTIMER_INTERVAL * hz,
151 nd6_slowtimo, curvnet);
159 callout_drain(&V_nd6_slowtimo_ch);
160 callout_drain(&V_nd6_timer_ch);
165 nd6_ifattach(struct ifnet *ifp)
167 struct nd_ifinfo *nd;
169 nd = (struct nd_ifinfo *)malloc(sizeof(*nd), M_IP6NDP, M_WAITOK|M_ZERO);
172 nd->chlim = IPV6_DEFHLIM;
173 nd->basereachable = REACHABLE_TIME;
174 nd->reachable = ND_COMPUTE_RTIME(nd->basereachable);
175 nd->retrans = RETRANS_TIMER;
177 nd->flags = ND6_IFF_PERFORMNUD;
179 /* A loopback interface always has ND6_IFF_AUTO_LINKLOCAL.
180 * XXXHRS: Clear ND6_IFF_AUTO_LINKLOCAL on an IFT_BRIDGE interface by
181 * default regardless of the V_ip6_auto_linklocal configuration to
182 * give a reasonable default behavior.
184 if ((V_ip6_auto_linklocal && ifp->if_type != IFT_BRIDGE) ||
185 (ifp->if_flags & IFF_LOOPBACK))
186 nd->flags |= ND6_IFF_AUTO_LINKLOCAL;
188 * A loopback interface does not need to accept RTADV.
189 * XXXHRS: Clear ND6_IFF_ACCEPT_RTADV on an IFT_BRIDGE interface by
190 * default regardless of the V_ip6_accept_rtadv configuration to
191 * prevent the interface from accepting RA messages arrived
192 * on one of the member interfaces with ND6_IFF_ACCEPT_RTADV.
194 if (V_ip6_accept_rtadv &&
195 !(ifp->if_flags & IFF_LOOPBACK) &&
196 (ifp->if_type != IFT_BRIDGE))
197 nd->flags |= ND6_IFF_ACCEPT_RTADV;
198 if (V_ip6_no_radr && !(ifp->if_flags & IFF_LOOPBACK))
199 nd->flags |= ND6_IFF_NO_RADR;
201 /* XXX: we cannot call nd6_setmtu since ifp is not fully initialized */
202 nd6_setmtu0(ifp, nd);
208 nd6_ifdetach(struct nd_ifinfo *nd)
215 * Reset ND level link MTU. This function is called when the physical MTU
216 * changes, which means we might have to adjust the ND level MTU.
219 nd6_setmtu(struct ifnet *ifp)
222 nd6_setmtu0(ifp, ND_IFINFO(ifp));
225 /* XXX todo: do not maintain copy of ifp->if_mtu in ndi->maxmtu */
227 nd6_setmtu0(struct ifnet *ifp, struct nd_ifinfo *ndi)
231 omaxmtu = ndi->maxmtu;
233 switch (ifp->if_type) {
235 ndi->maxmtu = MIN(ARC_PHDS_MAXMTU, ifp->if_mtu); /* RFC2497 */
238 ndi->maxmtu = MIN(FDDIIPMTU, ifp->if_mtu); /* RFC2467 */
241 ndi->maxmtu = MIN(ISO88025_MAX_MTU, ifp->if_mtu);
244 ndi->maxmtu = ifp->if_mtu;
249 * Decreasing the interface MTU under IPV6 minimum MTU may cause
250 * undesirable situation. We thus notify the operator of the change
251 * explicitly. The check for omaxmtu is necessary to restrict the
252 * log to the case of changing the MTU, not initializing it.
254 if (omaxmtu >= IPV6_MMTU && ndi->maxmtu < IPV6_MMTU) {
255 log(LOG_NOTICE, "nd6_setmtu0: "
256 "new link MTU on %s (%lu) is too small for IPv6\n",
257 if_name(ifp), (unsigned long)ndi->maxmtu);
260 if (ndi->maxmtu > V_in6_maxmtu)
261 in6_setmaxmtu(); /* check all interfaces just in case */
266 nd6_option_init(void *opt, int icmp6len, union nd_opts *ndopts)
269 bzero(ndopts, sizeof(*ndopts));
270 ndopts->nd_opts_search = (struct nd_opt_hdr *)opt;
272 = (struct nd_opt_hdr *)(((u_char *)opt) + icmp6len);
275 ndopts->nd_opts_done = 1;
276 ndopts->nd_opts_search = NULL;
281 * Take one ND option.
284 nd6_option(union nd_opts *ndopts)
286 struct nd_opt_hdr *nd_opt;
289 KASSERT(ndopts != NULL, ("%s: ndopts == NULL", __func__));
290 KASSERT(ndopts->nd_opts_last != NULL, ("%s: uninitialized ndopts",
292 if (ndopts->nd_opts_search == NULL)
294 if (ndopts->nd_opts_done)
297 nd_opt = ndopts->nd_opts_search;
299 /* make sure nd_opt_len is inside the buffer */
300 if ((caddr_t)&nd_opt->nd_opt_len >= (caddr_t)ndopts->nd_opts_last) {
301 bzero(ndopts, sizeof(*ndopts));
305 olen = nd_opt->nd_opt_len << 3;
308 * Message validation requires that all included
309 * options have a length that is greater than zero.
311 bzero(ndopts, sizeof(*ndopts));
315 ndopts->nd_opts_search = (struct nd_opt_hdr *)((caddr_t)nd_opt + olen);
316 if (ndopts->nd_opts_search > ndopts->nd_opts_last) {
317 /* option overruns the end of buffer, invalid */
318 bzero(ndopts, sizeof(*ndopts));
320 } else if (ndopts->nd_opts_search == ndopts->nd_opts_last) {
321 /* reached the end of options chain */
322 ndopts->nd_opts_done = 1;
323 ndopts->nd_opts_search = NULL;
329 * Parse multiple ND options.
330 * This function is much easier to use, for ND routines that do not need
331 * multiple options of the same type.
334 nd6_options(union nd_opts *ndopts)
336 struct nd_opt_hdr *nd_opt;
339 KASSERT(ndopts != NULL, ("%s: ndopts == NULL", __func__));
340 KASSERT(ndopts->nd_opts_last != NULL, ("%s: uninitialized ndopts",
342 if (ndopts->nd_opts_search == NULL)
346 nd_opt = nd6_option(ndopts);
347 if (nd_opt == NULL && ndopts->nd_opts_last == NULL) {
349 * Message validation requires that all included
350 * options have a length that is greater than zero.
352 ICMP6STAT_INC(icp6s_nd_badopt);
353 bzero(ndopts, sizeof(*ndopts));
360 switch (nd_opt->nd_opt_type) {
361 case ND_OPT_SOURCE_LINKADDR:
362 case ND_OPT_TARGET_LINKADDR:
364 case ND_OPT_REDIRECTED_HEADER:
365 if (ndopts->nd_opt_array[nd_opt->nd_opt_type]) {
367 "duplicated ND6 option found (type=%d)\n",
368 nd_opt->nd_opt_type));
371 ndopts->nd_opt_array[nd_opt->nd_opt_type]
375 case ND_OPT_PREFIX_INFORMATION:
376 if (ndopts->nd_opt_array[nd_opt->nd_opt_type] == 0) {
377 ndopts->nd_opt_array[nd_opt->nd_opt_type]
380 ndopts->nd_opts_pi_end =
381 (struct nd_opt_prefix_info *)nd_opt;
383 /* What about ND_OPT_ROUTE_INFO? RFC 4191 */
384 case ND_OPT_RDNSS: /* RFC 6106 */
385 case ND_OPT_DNSSL: /* RFC 6106 */
387 * Silently ignore options we know and do not care about
393 * Unknown options must be silently ignored,
394 * to accomodate future extension to the protocol.
397 "nd6_options: unsupported option %d - "
398 "option ignored\n", nd_opt->nd_opt_type));
403 if (i > V_nd6_maxndopt) {
404 ICMP6STAT_INC(icp6s_nd_toomanyopt);
405 nd6log((LOG_INFO, "too many loop in nd opt\n"));
409 if (ndopts->nd_opts_done)
417 * ND6 timer routine to handle ND6 entries
420 nd6_llinfo_settimer_locked(struct llentry *ln, long tick)
424 LLE_WLOCK_ASSERT(ln);
429 canceled = callout_stop(&ln->ln_timer_ch);
431 ln->la_expire = time_uptime + tick / hz;
433 if (tick > INT_MAX) {
434 ln->ln_ntick = tick - INT_MAX;
435 canceled = callout_reset(&ln->ln_timer_ch, INT_MAX,
436 nd6_llinfo_timer, ln);
439 canceled = callout_reset(&ln->ln_timer_ch, tick,
440 nd6_llinfo_timer, ln);
448 nd6_llinfo_settimer(struct llentry *ln, long tick)
452 nd6_llinfo_settimer_locked(ln, tick);
457 nd6_llinfo_timer(void *arg)
460 struct in6_addr *dst;
462 struct nd_ifinfo *ndi = NULL;
464 KASSERT(arg != NULL, ("%s: arg NULL", __func__));
465 ln = (struct llentry *)arg;
466 LLE_WLOCK_ASSERT(ln);
467 ifp = ln->lle_tbl->llt_ifp;
469 CURVNET_SET(ifp->if_vnet);
471 if (ln->ln_ntick > 0) {
472 if (ln->ln_ntick > INT_MAX) {
473 ln->ln_ntick -= INT_MAX;
474 nd6_llinfo_settimer_locked(ln, INT_MAX);
477 nd6_llinfo_settimer_locked(ln, ln->ln_ntick);
482 ndi = ND_IFINFO(ifp);
483 dst = &L3_ADDR_SIN6(ln)->sin6_addr;
484 if (ln->la_flags & LLE_STATIC) {
488 if (ln->la_flags & LLE_DELETED) {
489 (void)nd6_free(ln, 0);
494 switch (ln->ln_state) {
495 case ND6_LLINFO_INCOMPLETE:
496 if (ln->la_asked < V_nd6_mmaxtries) {
498 nd6_llinfo_settimer_locked(ln, (long)ndi->retrans * hz / 1000);
500 nd6_ns_output(ifp, NULL, dst, ln, 0);
503 struct mbuf *m = ln->la_hold;
508 * assuming every packet in la_hold has the
509 * same IP header. Send error after unlock.
514 clear_llinfo_pqueue(ln);
516 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_TIMEDOUT);
517 (void)nd6_free(ln, 0);
520 icmp6_error2(m, ICMP6_DST_UNREACH,
521 ICMP6_DST_UNREACH_ADDR, 0, ifp);
524 case ND6_LLINFO_REACHABLE:
525 if (!ND6_LLINFO_PERMANENT(ln)) {
526 ln->ln_state = ND6_LLINFO_STALE;
527 nd6_llinfo_settimer_locked(ln, (long)V_nd6_gctimer * hz);
531 case ND6_LLINFO_STALE:
532 /* Garbage Collection(RFC 2461 5.3) */
533 if (!ND6_LLINFO_PERMANENT(ln)) {
534 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_EXPIRED);
535 (void)nd6_free(ln, 1);
540 case ND6_LLINFO_DELAY:
541 if (ndi && (ndi->flags & ND6_IFF_PERFORMNUD) != 0) {
544 ln->ln_state = ND6_LLINFO_PROBE;
545 nd6_llinfo_settimer_locked(ln, (long)ndi->retrans * hz / 1000);
547 nd6_ns_output(ifp, dst, dst, ln, 0);
550 ln->ln_state = ND6_LLINFO_STALE; /* XXX */
551 nd6_llinfo_settimer_locked(ln, (long)V_nd6_gctimer * hz);
554 case ND6_LLINFO_PROBE:
555 if (ln->la_asked < V_nd6_umaxtries) {
557 nd6_llinfo_settimer_locked(ln, (long)ndi->retrans * hz / 1000);
559 nd6_ns_output(ifp, dst, dst, ln, 0);
562 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_EXPIRED);
563 (void)nd6_free(ln, 0);
568 panic("%s: paths in a dark night can be confusing: %d",
569 __func__, ln->ln_state);
579 * ND6 timer routine to expire default route list and prefix list
584 CURVNET_SET((struct vnet *) arg);
585 struct nd_defrouter *dr, *ndr;
586 struct nd_prefix *pr, *npr;
587 struct in6_ifaddr *ia6, *nia6;
589 callout_reset(&V_nd6_timer_ch, V_nd6_prune * hz,
592 /* expire default router list */
593 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr) {
594 if (dr->expire && dr->expire < time_uptime)
599 * expire interface addresses.
600 * in the past the loop was inside prefix expiry processing.
601 * However, from a stricter speci-confrmance standpoint, we should
602 * rather separate address lifetimes and prefix lifetimes.
604 * XXXRW: in6_ifaddrhead locking.
607 TAILQ_FOREACH_SAFE(ia6, &V_in6_ifaddrhead, ia_link, nia6) {
608 /* check address lifetime */
609 if (IFA6_IS_INVALID(ia6)) {
613 * If the expiring address is temporary, try
614 * regenerating a new one. This would be useful when
615 * we suspended a laptop PC, then turned it on after a
616 * period that could invalidate all temporary
617 * addresses. Although we may have to restart the
618 * loop (see below), it must be after purging the
619 * address. Otherwise, we'd see an infinite loop of
622 if (V_ip6_use_tempaddr &&
623 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0) {
624 if (regen_tmpaddr(ia6) == 0)
628 in6_purgeaddr(&ia6->ia_ifa);
631 goto addrloop; /* XXX: see below */
632 } else if (IFA6_IS_DEPRECATED(ia6)) {
633 int oldflags = ia6->ia6_flags;
635 ia6->ia6_flags |= IN6_IFF_DEPRECATED;
638 * If a temporary address has just become deprecated,
639 * regenerate a new one if possible.
641 if (V_ip6_use_tempaddr &&
642 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0 &&
643 (oldflags & IN6_IFF_DEPRECATED) == 0) {
645 if (regen_tmpaddr(ia6) == 0) {
647 * A new temporary address is
649 * XXX: this means the address chain
650 * has changed while we are still in
651 * the loop. Although the change
652 * would not cause disaster (because
653 * it's not a deletion, but an
654 * addition,) we'd rather restart the
655 * loop just for safety. Or does this
656 * significantly reduce performance??
663 * A new RA might have made a deprecated address
666 ia6->ia6_flags &= ~IN6_IFF_DEPRECATED;
670 /* expire prefix list */
671 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, npr) {
673 * check prefix lifetime.
674 * since pltime is just for autoconf, pltime processing for
675 * prefix is not necessary.
677 if (pr->ndpr_vltime != ND6_INFINITE_LIFETIME &&
678 time_uptime - pr->ndpr_lastupdate > pr->ndpr_vltime) {
681 * address expiration and prefix expiration are
682 * separate. NEVER perform in6_purgeaddr here.
691 * ia6 - deprecated/invalidated temporary address
694 regen_tmpaddr(struct in6_ifaddr *ia6)
698 struct in6_ifaddr *public_ifa6 = NULL;
700 ifp = ia6->ia_ifa.ifa_ifp;
702 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
703 struct in6_ifaddr *it6;
705 if (ifa->ifa_addr->sa_family != AF_INET6)
708 it6 = (struct in6_ifaddr *)ifa;
710 /* ignore no autoconf addresses. */
711 if ((it6->ia6_flags & IN6_IFF_AUTOCONF) == 0)
714 /* ignore autoconf addresses with different prefixes. */
715 if (it6->ia6_ndpr == NULL || it6->ia6_ndpr != ia6->ia6_ndpr)
719 * Now we are looking at an autoconf address with the same
720 * prefix as ours. If the address is temporary and is still
721 * preferred, do not create another one. It would be rare, but
722 * could happen, for example, when we resume a laptop PC after
725 if ((it6->ia6_flags & IN6_IFF_TEMPORARY) != 0 &&
726 !IFA6_IS_DEPRECATED(it6)) {
732 * This is a public autoconf address that has the same prefix
733 * as ours. If it is preferred, keep it. We can't break the
734 * loop here, because there may be a still-preferred temporary
735 * address with the prefix.
737 if (!IFA6_IS_DEPRECATED(it6))
740 if (public_ifa6 != NULL)
741 ifa_ref(&public_ifa6->ia_ifa);
743 IF_ADDR_RUNLOCK(ifp);
745 if (public_ifa6 != NULL) {
748 if ((e = in6_tmpifadd(public_ifa6, 0, 0)) != 0) {
749 ifa_free(&public_ifa6->ia_ifa);
750 log(LOG_NOTICE, "regen_tmpaddr: failed to create a new"
751 " tmp addr,errno=%d\n", e);
754 ifa_free(&public_ifa6->ia_ifa);
762 * Nuke neighbor cache/prefix/default router management table, right before
766 nd6_purge(struct ifnet *ifp)
768 struct nd_defrouter *dr, *ndr;
769 struct nd_prefix *pr, *npr;
772 * Nuke default router list entries toward ifp.
773 * We defer removal of default router list entries that is installed
774 * in the routing table, in order to keep additional side effects as
777 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr) {
785 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr) {
793 /* Nuke prefix list entries toward ifp */
794 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, npr) {
795 if (pr->ndpr_ifp == ifp) {
797 * Because if_detach() does *not* release prefixes
798 * while purging addresses the reference count will
799 * still be above zero. We therefore reset it to
800 * make sure that the prefix really gets purged.
805 * Previously, pr->ndpr_addr is removed as well,
806 * but I strongly believe we don't have to do it.
807 * nd6_purge() is only called from in6_ifdetach(),
808 * which removes all the associated interface addresses
810 * (jinmei@kame.net 20010129)
816 /* cancel default outgoing interface setting */
817 if (V_nd6_defifindex == ifp->if_index)
818 nd6_setdefaultiface(0);
820 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
821 /* Refresh default router list. */
826 * We do not nuke the neighbor cache entries here any more
827 * because the neighbor cache is kept in if_afdata[AF_INET6].
828 * nd6_purge() is invoked by in6_ifdetach() which is called
829 * from if_detach() where everything gets purged. So let
830 * in6_domifdetach() do the actual L2 table purging work.
835 * the caller acquires and releases the lock on the lltbls
836 * Returns the llentry locked
839 nd6_lookup(struct in6_addr *addr6, int flags, struct ifnet *ifp)
841 struct sockaddr_in6 sin6;
845 bzero(&sin6, sizeof(sin6));
846 sin6.sin6_len = sizeof(struct sockaddr_in6);
847 sin6.sin6_family = AF_INET6;
848 sin6.sin6_addr = *addr6;
850 IF_AFDATA_LOCK_ASSERT(ifp);
853 if (flags & ND6_CREATE)
854 llflags |= LLE_CREATE;
855 if (flags & ND6_EXCLUSIVE)
856 llflags |= LLE_EXCLUSIVE;
858 ln = lla_lookup(LLTABLE6(ifp), llflags, (struct sockaddr *)&sin6);
859 if ((ln != NULL) && (llflags & LLE_CREATE))
860 ln->ln_state = ND6_LLINFO_NOSTATE;
866 * Test whether a given IPv6 address is a neighbor or not, ignoring
867 * the actual neighbor cache. The neighbor cache is ignored in order
868 * to not reenter the routing code from within itself.
871 nd6_is_new_addr_neighbor(struct sockaddr_in6 *addr, struct ifnet *ifp)
873 struct nd_prefix *pr;
874 struct ifaddr *dstaddr;
877 * A link-local address is always a neighbor.
878 * XXX: a link does not necessarily specify a single interface.
880 if (IN6_IS_ADDR_LINKLOCAL(&addr->sin6_addr)) {
881 struct sockaddr_in6 sin6_copy;
885 * We need sin6_copy since sa6_recoverscope() may modify the
889 if (sa6_recoverscope(&sin6_copy))
890 return (0); /* XXX: should be impossible */
891 if (in6_setscope(&sin6_copy.sin6_addr, ifp, &zone))
893 if (sin6_copy.sin6_scope_id == zone)
900 * If the address matches one of our addresses,
901 * it should be a neighbor.
902 * If the address matches one of our on-link prefixes, it should be a
905 LIST_FOREACH(pr, &V_nd_prefix, ndpr_entry) {
906 if (pr->ndpr_ifp != ifp)
909 if (!(pr->ndpr_stateflags & NDPRF_ONLINK)) {
912 /* Always use the default FIB here. */
913 rt = in6_rtalloc1((struct sockaddr *)&pr->ndpr_prefix,
914 0, 0, RT_DEFAULT_FIB);
918 * This is the case where multiple interfaces
919 * have the same prefix, but only one is installed
920 * into the routing table and that prefix entry
921 * is not the one being examined here. In the case
922 * where RADIX_MPATH is enabled, multiple route
923 * entries (of the same rt_key value) will be
924 * installed because the interface addresses all
927 if (!IN6_ARE_ADDR_EQUAL(&pr->ndpr_prefix.sin6_addr,
928 &((struct sockaddr_in6 *)rt_key(rt))->sin6_addr)) {
935 if (IN6_ARE_MASKED_ADDR_EQUAL(&pr->ndpr_prefix.sin6_addr,
936 &addr->sin6_addr, &pr->ndpr_mask))
941 * If the address is assigned on the node of the other side of
942 * a p2p interface, the address should be a neighbor.
944 dstaddr = ifa_ifwithdstaddr((struct sockaddr *)addr);
945 if (dstaddr != NULL) {
946 if (dstaddr->ifa_ifp == ifp) {
954 * If the default router list is empty, all addresses are regarded
955 * as on-link, and thus, as a neighbor.
957 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV &&
958 TAILQ_EMPTY(&V_nd_defrouter) &&
959 V_nd6_defifindex == ifp->if_index) {
968 * Detect if a given IPv6 address identifies a neighbor on a given link.
969 * XXX: should take care of the destination of a p2p link?
972 nd6_is_addr_neighbor(struct sockaddr_in6 *addr, struct ifnet *ifp)
977 IF_AFDATA_UNLOCK_ASSERT(ifp);
978 if (nd6_is_new_addr_neighbor(addr, ifp))
982 * Even if the address matches none of our addresses, it might be
983 * in the neighbor cache.
985 IF_AFDATA_RLOCK(ifp);
986 if ((lle = nd6_lookup(&addr->sin6_addr, 0, ifp)) != NULL) {
990 IF_AFDATA_RUNLOCK(ifp);
995 * Free an nd6 llinfo entry.
996 * Since the function would cause significant changes in the kernel, DO NOT
997 * make it global, unless you have a strong reason for the change, and are sure
998 * that the change is safe.
1000 static struct llentry *
1001 nd6_free(struct llentry *ln, int gc)
1003 struct llentry *next;
1004 struct nd_defrouter *dr;
1007 LLE_WLOCK_ASSERT(ln);
1010 * we used to have pfctlinput(PRC_HOSTDEAD) here.
1011 * even though it is not harmful, it was not really necessary.
1015 nd6_llinfo_settimer_locked(ln, -1);
1017 ifp = ln->lle_tbl->llt_ifp;
1019 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
1020 dr = defrouter_lookup(&L3_ADDR_SIN6(ln)->sin6_addr, ifp);
1022 if (dr != NULL && dr->expire &&
1023 ln->ln_state == ND6_LLINFO_STALE && gc) {
1025 * If the reason for the deletion is just garbage
1026 * collection, and the neighbor is an active default
1027 * router, do not delete it. Instead, reset the GC
1028 * timer using the router's lifetime.
1029 * Simply deleting the entry would affect default
1030 * router selection, which is not necessarily a good
1031 * thing, especially when we're using router preference
1033 * XXX: the check for ln_state would be redundant,
1034 * but we intentionally keep it just in case.
1036 if (dr->expire > time_uptime)
1037 nd6_llinfo_settimer_locked(ln,
1038 (dr->expire - time_uptime) * hz);
1040 nd6_llinfo_settimer_locked(ln,
1041 (long)V_nd6_gctimer * hz);
1043 next = LIST_NEXT(ln, lle_next);
1051 * Unreachablity of a router might affect the default
1052 * router selection and on-link detection of advertised
1057 * Temporarily fake the state to choose a new default
1058 * router and to perform on-link determination of
1059 * prefixes correctly.
1060 * Below the state will be set correctly,
1061 * or the entry itself will be deleted.
1063 ln->ln_state = ND6_LLINFO_INCOMPLETE;
1066 if (ln->ln_router || dr) {
1069 * We need to unlock to avoid a LOR with rt6_flush() with the
1070 * rnh and for the calls to pfxlist_onlink_check() and
1071 * defrouter_select() in the block further down for calls
1072 * into nd6_lookup(). We still hold a ref.
1077 * rt6_flush must be called whether or not the neighbor
1078 * is in the Default Router List.
1079 * See a corresponding comment in nd6_na_input().
1081 rt6_flush(&L3_ADDR_SIN6(ln)->sin6_addr, ifp);
1086 * Since defrouter_select() does not affect the
1087 * on-link determination and MIP6 needs the check
1088 * before the default router selection, we perform
1091 pfxlist_onlink_check();
1094 * Refresh default router list.
1099 if (ln->ln_router || dr)
1104 * Before deleting the entry, remember the next entry as the
1105 * return value. We need this because pfxlist_onlink_check() above
1106 * might have freed other entries (particularly the old next entry) as
1107 * a side effect (XXX).
1109 next = LIST_NEXT(ln, lle_next);
1112 * Save to unlock. We still hold an extra reference and will not
1113 * free(9) in llentry_free() if someone else holds one as well.
1116 IF_AFDATA_LOCK(ifp);
1119 /* Guard against race with other llentry_free(). */
1120 if (ln->la_flags & LLE_LINKED) {
1124 LLE_FREE_LOCKED(ln);
1126 IF_AFDATA_UNLOCK(ifp);
1132 * Upper-layer reachability hint for Neighbor Unreachability Detection.
1134 * XXX cost-effective methods?
1137 nd6_nud_hint(struct rtentry *rt, struct in6_addr *dst6, int force)
1142 if ((dst6 == NULL) || (rt == NULL))
1146 IF_AFDATA_LOCK(ifp);
1147 ln = nd6_lookup(dst6, ND6_EXCLUSIVE, NULL);
1148 IF_AFDATA_UNLOCK(ifp);
1152 if (ln->ln_state < ND6_LLINFO_REACHABLE)
1156 * if we get upper-layer reachability confirmation many times,
1157 * it is possible we have false information.
1161 if (ln->ln_byhint > V_nd6_maxnudhint) {
1166 ln->ln_state = ND6_LLINFO_REACHABLE;
1167 if (!ND6_LLINFO_PERMANENT(ln)) {
1168 nd6_llinfo_settimer_locked(ln,
1169 (long)ND_IFINFO(rt->rt_ifp)->reachable * hz);
1177 * Rejuvenate this function for routing operations related
1181 nd6_rtrequest(int req, struct rtentry *rt, struct rt_addrinfo *info)
1183 struct sockaddr_in6 *gateway;
1184 struct nd_defrouter *dr;
1188 gateway = (struct sockaddr_in6 *)rt->rt_gateway;
1199 * Only indirect routes are interesting.
1201 if ((rt->rt_flags & RTF_GATEWAY) == 0)
1204 * check for default route
1206 if (IN6_ARE_ADDR_EQUAL(&in6addr_any,
1207 &SIN6(rt_key(rt))->sin6_addr)) {
1209 dr = defrouter_lookup(&gateway->sin6_addr, ifp);
1219 nd6_ioctl(u_long cmd, caddr_t data, struct ifnet *ifp)
1221 struct in6_drlist *drl = (struct in6_drlist *)data;
1222 struct in6_oprlist *oprl = (struct in6_oprlist *)data;
1223 struct in6_ndireq *ndi = (struct in6_ndireq *)data;
1224 struct in6_nbrinfo *nbi = (struct in6_nbrinfo *)data;
1225 struct in6_ndifreq *ndif = (struct in6_ndifreq *)data;
1226 struct nd_defrouter *dr;
1227 struct nd_prefix *pr;
1228 int i = 0, error = 0;
1230 if (ifp->if_afdata[AF_INET6] == NULL)
1231 return (EPFNOSUPPORT);
1233 case SIOCGDRLST_IN6:
1235 * obsolete API, use sysctl under net.inet6.icmp6
1237 bzero(drl, sizeof(*drl));
1238 TAILQ_FOREACH(dr, &V_nd_defrouter, dr_entry) {
1241 drl->defrouter[i].rtaddr = dr->rtaddr;
1242 in6_clearscope(&drl->defrouter[i].rtaddr);
1244 drl->defrouter[i].flags = dr->flags;
1245 drl->defrouter[i].rtlifetime = dr->rtlifetime;
1246 drl->defrouter[i].expire = dr->expire +
1247 (time_second - time_uptime);
1248 drl->defrouter[i].if_index = dr->ifp->if_index;
1252 case SIOCGPRLST_IN6:
1254 * obsolete API, use sysctl under net.inet6.icmp6
1256 * XXX the structure in6_prlist was changed in backward-
1257 * incompatible manner. in6_oprlist is used for SIOCGPRLST_IN6,
1258 * in6_prlist is used for nd6_sysctl() - fill_prlist().
1261 * XXX meaning of fields, especialy "raflags", is very
1262 * differnet between RA prefix list and RR/static prefix list.
1263 * how about separating ioctls into two?
1265 bzero(oprl, sizeof(*oprl));
1266 LIST_FOREACH(pr, &V_nd_prefix, ndpr_entry) {
1267 struct nd_pfxrouter *pfr;
1272 oprl->prefix[i].prefix = pr->ndpr_prefix.sin6_addr;
1273 oprl->prefix[i].raflags = pr->ndpr_raf;
1274 oprl->prefix[i].prefixlen = pr->ndpr_plen;
1275 oprl->prefix[i].vltime = pr->ndpr_vltime;
1276 oprl->prefix[i].pltime = pr->ndpr_pltime;
1277 oprl->prefix[i].if_index = pr->ndpr_ifp->if_index;
1278 if (pr->ndpr_vltime == ND6_INFINITE_LIFETIME)
1279 oprl->prefix[i].expire = 0;
1283 /* XXX: we assume time_t is signed. */
1286 ((sizeof(maxexpire) * 8) - 1));
1287 if (pr->ndpr_vltime <
1288 maxexpire - pr->ndpr_lastupdate) {
1289 oprl->prefix[i].expire =
1290 pr->ndpr_lastupdate +
1292 (time_second - time_uptime);
1294 oprl->prefix[i].expire = maxexpire;
1298 LIST_FOREACH(pfr, &pr->ndpr_advrtrs, pfr_entry) {
1300 #define RTRADDR oprl->prefix[i].advrtr[j]
1301 RTRADDR = pfr->router->rtaddr;
1302 in6_clearscope(&RTRADDR);
1307 oprl->prefix[i].advrtrs = j;
1308 oprl->prefix[i].origin = PR_ORIG_RA;
1314 case OSIOCGIFINFO_IN6:
1316 /* XXX: old ndp(8) assumes a positive value for linkmtu. */
1317 bzero(&ND, sizeof(ND));
1318 ND.linkmtu = IN6_LINKMTU(ifp);
1319 ND.maxmtu = ND_IFINFO(ifp)->maxmtu;
1320 ND.basereachable = ND_IFINFO(ifp)->basereachable;
1321 ND.reachable = ND_IFINFO(ifp)->reachable;
1322 ND.retrans = ND_IFINFO(ifp)->retrans;
1323 ND.flags = ND_IFINFO(ifp)->flags;
1324 ND.recalctm = ND_IFINFO(ifp)->recalctm;
1325 ND.chlim = ND_IFINFO(ifp)->chlim;
1327 case SIOCGIFINFO_IN6:
1328 ND = *ND_IFINFO(ifp);
1330 case SIOCSIFINFO_IN6:
1332 * used to change host variables from userland.
1333 * intented for a use on router to reflect RA configurations.
1335 /* 0 means 'unspecified' */
1336 if (ND.linkmtu != 0) {
1337 if (ND.linkmtu < IPV6_MMTU ||
1338 ND.linkmtu > IN6_LINKMTU(ifp)) {
1342 ND_IFINFO(ifp)->linkmtu = ND.linkmtu;
1345 if (ND.basereachable != 0) {
1346 int obasereachable = ND_IFINFO(ifp)->basereachable;
1348 ND_IFINFO(ifp)->basereachable = ND.basereachable;
1349 if (ND.basereachable != obasereachable)
1350 ND_IFINFO(ifp)->reachable =
1351 ND_COMPUTE_RTIME(ND.basereachable);
1353 if (ND.retrans != 0)
1354 ND_IFINFO(ifp)->retrans = ND.retrans;
1356 ND_IFINFO(ifp)->chlim = ND.chlim;
1358 case SIOCSIFINFO_FLAGS:
1361 struct in6_ifaddr *ia;
1363 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) &&
1364 !(ND.flags & ND6_IFF_IFDISABLED)) {
1365 /* ifdisabled 1->0 transision */
1368 * If the interface is marked as ND6_IFF_IFDISABLED and
1369 * has an link-local address with IN6_IFF_DUPLICATED,
1370 * do not clear ND6_IFF_IFDISABLED.
1371 * See RFC 4862, Section 5.4.5.
1373 int duplicated_linklocal = 0;
1376 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1377 if (ifa->ifa_addr->sa_family != AF_INET6)
1379 ia = (struct in6_ifaddr *)ifa;
1380 if ((ia->ia6_flags & IN6_IFF_DUPLICATED) &&
1381 IN6_IS_ADDR_LINKLOCAL(IA6_IN6(ia))) {
1382 duplicated_linklocal = 1;
1386 IF_ADDR_RUNLOCK(ifp);
1388 if (duplicated_linklocal) {
1389 ND.flags |= ND6_IFF_IFDISABLED;
1390 log(LOG_ERR, "Cannot enable an interface"
1391 " with a link-local address marked"
1394 ND_IFINFO(ifp)->flags &= ~ND6_IFF_IFDISABLED;
1395 if (ifp->if_flags & IFF_UP)
1398 } else if (!(ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) &&
1399 (ND.flags & ND6_IFF_IFDISABLED)) {
1400 /* ifdisabled 0->1 transision */
1401 /* Mark all IPv6 address as tentative. */
1403 ND_IFINFO(ifp)->flags |= ND6_IFF_IFDISABLED;
1405 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1406 if (ifa->ifa_addr->sa_family != AF_INET6)
1408 ia = (struct in6_ifaddr *)ifa;
1409 ia->ia6_flags |= IN6_IFF_TENTATIVE;
1411 IF_ADDR_RUNLOCK(ifp);
1414 if (ND.flags & ND6_IFF_AUTO_LINKLOCAL) {
1415 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_AUTO_LINKLOCAL)) {
1416 /* auto_linklocal 0->1 transision */
1418 /* If no link-local address on ifp, configure */
1419 ND_IFINFO(ifp)->flags |= ND6_IFF_AUTO_LINKLOCAL;
1420 in6_ifattach(ifp, NULL);
1421 } else if (!(ND.flags & ND6_IFF_IFDISABLED) &&
1422 ifp->if_flags & IFF_UP) {
1424 * When the IF already has
1425 * ND6_IFF_AUTO_LINKLOCAL, no link-local
1426 * address is assigned, and IFF_UP, try to
1429 int haslinklocal = 0;
1432 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1433 if (ifa->ifa_addr->sa_family != AF_INET6)
1435 ia = (struct in6_ifaddr *)ifa;
1436 if (IN6_IS_ADDR_LINKLOCAL(IA6_IN6(ia))) {
1441 IF_ADDR_RUNLOCK(ifp);
1443 in6_ifattach(ifp, NULL);
1447 ND_IFINFO(ifp)->flags = ND.flags;
1450 case SIOCSNDFLUSH_IN6: /* XXX: the ioctl name is confusing... */
1451 /* sync kernel routing table with the default router list */
1455 case SIOCSPFXFLUSH_IN6:
1457 /* flush all the prefix advertised by routers */
1458 struct nd_prefix *pr, *next;
1460 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, next) {
1461 struct in6_ifaddr *ia, *ia_next;
1463 if (IN6_IS_ADDR_LINKLOCAL(&pr->ndpr_prefix.sin6_addr))
1466 /* do we really have to remove addresses as well? */
1467 /* XXXRW: in6_ifaddrhead locking. */
1468 TAILQ_FOREACH_SAFE(ia, &V_in6_ifaddrhead, ia_link,
1470 if ((ia->ia6_flags & IN6_IFF_AUTOCONF) == 0)
1473 if (ia->ia6_ndpr == pr)
1474 in6_purgeaddr(&ia->ia_ifa);
1480 case SIOCSRTRFLUSH_IN6:
1482 /* flush all the default routers */
1483 struct nd_defrouter *dr, *next;
1486 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, next) {
1492 case SIOCGNBRINFO_IN6:
1495 struct in6_addr nb_addr = nbi->addr; /* make local for safety */
1497 if ((error = in6_setscope(&nb_addr, ifp, NULL)) != 0)
1500 IF_AFDATA_RLOCK(ifp);
1501 ln = nd6_lookup(&nb_addr, 0, ifp);
1502 IF_AFDATA_RUNLOCK(ifp);
1508 nbi->state = ln->ln_state;
1509 nbi->asked = ln->la_asked;
1510 nbi->isrouter = ln->ln_router;
1511 if (ln->la_expire == 0)
1514 nbi->expire = ln->la_expire +
1515 (time_second - time_uptime);
1519 case SIOCGDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */
1520 ndif->ifindex = V_nd6_defifindex;
1522 case SIOCSDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */
1523 return (nd6_setdefaultiface(ndif->ifindex));
1529 * Create neighbor cache entry and cache link-layer address,
1530 * on reception of inbound ND6 packets. (RS/RA/NS/redirect)
1533 * code - type dependent information
1536 * The caller of this function already acquired the ndp
1537 * cache table lock because the cache entry is returned.
1540 nd6_cache_lladdr(struct ifnet *ifp, struct in6_addr *from, char *lladdr,
1541 int lladdrlen, int type, int code)
1543 struct llentry *ln = NULL;
1550 uint16_t router = 0;
1551 struct sockaddr_in6 sin6;
1552 struct mbuf *chain = NULL;
1553 int static_route = 0;
1555 IF_AFDATA_UNLOCK_ASSERT(ifp);
1557 KASSERT(ifp != NULL, ("%s: ifp == NULL", __func__));
1558 KASSERT(from != NULL, ("%s: from == NULL", __func__));
1560 /* nothing must be updated for unspecified address */
1561 if (IN6_IS_ADDR_UNSPECIFIED(from))
1565 * Validation about ifp->if_addrlen and lladdrlen must be done in
1568 * XXX If the link does not have link-layer adderss, what should
1569 * we do? (ifp->if_addrlen == 0)
1570 * Spec says nothing in sections for RA, RS and NA. There's small
1571 * description on it in NS section (RFC 2461 7.2.3).
1573 flags = lladdr ? ND6_EXCLUSIVE : 0;
1574 IF_AFDATA_LOCK(ifp);
1575 ln = nd6_lookup(from, flags, ifp);
1578 flags |= ND6_EXCLUSIVE;
1579 ln = nd6_lookup(from, flags | ND6_CREATE, ifp);
1580 IF_AFDATA_UNLOCK(ifp);
1583 IF_AFDATA_UNLOCK(ifp);
1584 /* do nothing if static ndp is set */
1585 if (ln->la_flags & LLE_STATIC) {
1594 olladdr = (ln->la_flags & LLE_VALID) ? 1 : 0;
1595 if (olladdr && lladdr) {
1596 llchange = bcmp(lladdr, &ln->ll_addr,
1602 * newentry olladdr lladdr llchange (*=record)
1605 * 0 n y -- (3) * STALE
1607 * 0 y y y (5) * STALE
1608 * 1 -- n -- (6) NOSTATE(= PASSIVE)
1609 * 1 -- y -- (7) * STALE
1612 if (lladdr) { /* (3-5) and (7) */
1614 * Record source link-layer address
1615 * XXX is it dependent to ifp->if_type?
1617 bcopy(lladdr, &ln->ll_addr, ifp->if_addrlen);
1618 ln->la_flags |= LLE_VALID;
1619 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_RESOLVED);
1623 if ((!olladdr && lladdr != NULL) || /* (3) */
1624 (olladdr && lladdr != NULL && llchange)) { /* (5) */
1626 newstate = ND6_LLINFO_STALE;
1627 } else /* (1-2,4) */
1631 if (lladdr == NULL) /* (6) */
1632 newstate = ND6_LLINFO_NOSTATE;
1634 newstate = ND6_LLINFO_STALE;
1639 * Update the state of the neighbor cache.
1641 ln->ln_state = newstate;
1643 if (ln->ln_state == ND6_LLINFO_STALE) {
1645 * XXX: since nd6_output() below will cause
1646 * state tansition to DELAY and reset the timer,
1647 * we must set the timer now, although it is actually
1650 nd6_llinfo_settimer_locked(ln, (long)V_nd6_gctimer * hz);
1653 struct mbuf *m_hold, *m_hold_next;
1656 * reset the la_hold in advance, to explicitly
1657 * prevent a la_hold lookup in nd6_output()
1658 * (wouldn't happen, though...)
1660 for (m_hold = ln->la_hold, ln->la_hold = NULL;
1661 m_hold; m_hold = m_hold_next) {
1662 m_hold_next = m_hold->m_nextpkt;
1663 m_hold->m_nextpkt = NULL;
1666 * we assume ifp is not a p2p here, so
1667 * just set the 2nd argument as the
1670 nd6_output_lle(ifp, ifp, m_hold, L3_ADDR_SIN6(ln), NULL, ln, &chain);
1673 * If we have mbufs in the chain we need to do
1674 * deferred transmit. Copy the address from the
1675 * llentry before dropping the lock down below.
1678 memcpy(&sin6, L3_ADDR_SIN6(ln), sizeof(sin6));
1680 } else if (ln->ln_state == ND6_LLINFO_INCOMPLETE) {
1681 /* probe right away */
1682 nd6_llinfo_settimer_locked((void *)ln, 0);
1687 * ICMP6 type dependent behavior.
1689 * NS: clear IsRouter if new entry
1690 * RS: clear IsRouter
1691 * RA: set IsRouter if there's lladdr
1692 * redir: clear IsRouter if new entry
1695 * The spec says that we must set IsRouter in the following cases:
1696 * - If lladdr exist, set IsRouter. This means (1-5).
1697 * - If it is old entry (!newentry), set IsRouter. This means (7).
1698 * So, based on the spec, in (1-5) and (7) cases we must set IsRouter.
1699 * A quetion arises for (1) case. (1) case has no lladdr in the
1700 * neighbor cache, this is similar to (6).
1701 * This case is rare but we figured that we MUST NOT set IsRouter.
1703 * newentry olladdr lladdr llchange NS RS RA redir
1705 * 0 n n -- (1) c ? s
1706 * 0 y n -- (2) c s s
1707 * 0 n y -- (3) c s s
1710 * 1 -- n -- (6) c c c s
1711 * 1 -- y -- (7) c c s c s
1715 switch (type & 0xff) {
1716 case ND_NEIGHBOR_SOLICIT:
1718 * New entry must have is_router flag cleared.
1720 if (is_newentry) /* (6-7) */
1725 * If the icmp is a redirect to a better router, always set the
1726 * is_router flag. Otherwise, if the entry is newly created,
1727 * clear the flag. [RFC 2461, sec 8.3]
1729 if (code == ND_REDIRECT_ROUTER)
1731 else if (is_newentry) /* (6-7) */
1734 case ND_ROUTER_SOLICIT:
1736 * is_router flag must always be cleared.
1740 case ND_ROUTER_ADVERT:
1742 * Mark an entry with lladdr as a router.
1744 if ((!is_newentry && (olladdr || lladdr)) || /* (2-5) */
1745 (is_newentry && lladdr)) { /* (7) */
1752 static_route = (ln->la_flags & LLE_STATIC);
1753 router = ln->ln_router;
1755 if (flags & ND6_EXCLUSIVE)
1763 nd6_output_flush(ifp, ifp, chain, &sin6, NULL);
1766 * When the link-layer address of a router changes, select the
1767 * best router again. In particular, when the neighbor entry is newly
1768 * created, it might affect the selection policy.
1769 * Question: can we restrict the first condition to the "is_newentry"
1771 * XXX: when we hear an RA from a new router with the link-layer
1772 * address option, defrouter_select() is called twice, since
1773 * defrtrlist_update called the function as well. However, I believe
1774 * we can compromise the overhead, since it only happens the first
1776 * XXX: although defrouter_select() should not have a bad effect
1777 * for those are not autoconfigured hosts, we explicitly avoid such
1780 if (do_update && router &&
1781 ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
1783 * guaranteed recursion
1791 if (flags & ND6_EXCLUSIVE)
1802 nd6_slowtimo(void *arg)
1804 CURVNET_SET((struct vnet *) arg);
1805 struct nd_ifinfo *nd6if;
1808 callout_reset(&V_nd6_slowtimo_ch, ND6_SLOWTIMER_INTERVAL * hz,
1809 nd6_slowtimo, curvnet);
1810 IFNET_RLOCK_NOSLEEP();
1811 TAILQ_FOREACH(ifp, &V_ifnet, if_list) {
1812 if (ifp->if_afdata[AF_INET6] == NULL)
1814 nd6if = ND_IFINFO(ifp);
1815 if (nd6if->basereachable && /* already initialized */
1816 (nd6if->recalctm -= ND6_SLOWTIMER_INTERVAL) <= 0) {
1818 * Since reachable time rarely changes by router
1819 * advertisements, we SHOULD insure that a new random
1820 * value gets recomputed at least once every few hours.
1823 nd6if->recalctm = V_nd6_recalc_reachtm_interval;
1824 nd6if->reachable = ND_COMPUTE_RTIME(nd6if->basereachable);
1827 IFNET_RUNLOCK_NOSLEEP();
1832 nd6_output(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *m0,
1833 struct sockaddr_in6 *dst, struct rtentry *rt0)
1836 return (nd6_output_lle(ifp, origifp, m0, dst, rt0, NULL, NULL));
1841 * Note that I'm not enforcing any global serialization
1842 * lle state or asked changes here as the logic is too
1843 * complicated to avoid having to always acquire an exclusive
1848 #define senderr(e) { error = (e); goto bad;}
1851 nd6_output_lle(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *m0,
1852 struct sockaddr_in6 *dst, struct rtentry *rt0, struct llentry *lle,
1853 struct mbuf **chain)
1855 struct mbuf *m = m0;
1857 struct llentry *ln = lle;
1858 struct ip6_hdr *ip6;
1866 LLE_WLOCK_ASSERT(lle);
1868 KASSERT(chain != NULL, (" lle locked but no mbuf chain pointer passed"));
1871 if (IN6_IS_ADDR_MULTICAST(&dst->sin6_addr))
1874 if (nd6_need_cache(ifp) == 0)
1878 * next hop determination. This routine is derived from ether_output.
1882 * Address resolution or Neighbor Unreachability Detection
1884 * At this point, the destination of the packet must be a unicast
1885 * or an anycast address(i.e. not a multicast).
1888 flags = ((m != NULL) || (lle != NULL)) ? LLE_EXCLUSIVE : 0;
1891 IF_AFDATA_LOCK(ifp);
1892 ln = lla_lookup(LLTABLE6(ifp), flags, (struct sockaddr *)dst);
1893 IF_AFDATA_UNLOCK(ifp);
1894 if ((ln == NULL) && nd6_is_addr_neighbor(dst, ifp)) {
1896 * Since nd6_is_addr_neighbor() internally calls nd6_lookup(),
1897 * the condition below is not very efficient. But we believe
1898 * it is tolerable, because this should be a rare case.
1900 flags = ND6_CREATE | (m ? ND6_EXCLUSIVE : 0);
1901 IF_AFDATA_LOCK(ifp);
1902 ln = nd6_lookup(&dst->sin6_addr, flags, ifp);
1903 IF_AFDATA_UNLOCK(ifp);
1907 if ((ifp->if_flags & IFF_POINTOPOINT) == 0 &&
1908 !(ND_IFINFO(ifp)->flags & ND6_IFF_PERFORMNUD)) {
1909 char ip6buf[INET6_ADDRSTRLEN];
1911 "nd6_output: can't allocate llinfo for %s "
1913 ip6_sprintf(ip6buf, &dst->sin6_addr), ln);
1914 senderr(EIO); /* XXX: good error? */
1916 goto sendpkt; /* send anyway */
1919 /* We don't have to do link-layer address resolution on a p2p link. */
1920 if ((ifp->if_flags & IFF_POINTOPOINT) != 0 &&
1921 ln->ln_state < ND6_LLINFO_REACHABLE) {
1922 if ((flags & LLE_EXCLUSIVE) == 0) {
1923 flags |= LLE_EXCLUSIVE;
1926 ln->ln_state = ND6_LLINFO_STALE;
1927 nd6_llinfo_settimer_locked(ln, (long)V_nd6_gctimer * hz);
1931 * The first time we send a packet to a neighbor whose entry is
1932 * STALE, we have to change the state to DELAY and a sets a timer to
1933 * expire in DELAY_FIRST_PROBE_TIME seconds to ensure do
1934 * neighbor unreachability detection on expiration.
1937 if (ln->ln_state == ND6_LLINFO_STALE) {
1938 if ((flags & LLE_EXCLUSIVE) == 0) {
1939 flags |= LLE_EXCLUSIVE;
1944 ln->ln_state = ND6_LLINFO_DELAY;
1945 nd6_llinfo_settimer_locked(ln, (long)V_nd6_delay * hz);
1949 * If the neighbor cache entry has a state other than INCOMPLETE
1950 * (i.e. its link-layer address is already resolved), just
1953 if (ln->ln_state > ND6_LLINFO_INCOMPLETE)
1957 * There is a neighbor cache entry, but no ethernet address
1958 * response yet. Append this latest packet to the end of the
1959 * packet queue in the mbuf, unless the number of the packet
1960 * does not exceed nd6_maxqueuelen. When it exceeds nd6_maxqueuelen,
1961 * the oldest packet in the queue will be removed.
1963 if (ln->ln_state == ND6_LLINFO_NOSTATE)
1964 ln->ln_state = ND6_LLINFO_INCOMPLETE;
1966 if ((flags & LLE_EXCLUSIVE) == 0) {
1967 flags |= LLE_EXCLUSIVE;
1972 LLE_WLOCK_ASSERT(ln);
1975 struct mbuf *m_hold;
1979 for (m_hold = ln->la_hold; m_hold; m_hold = m_hold->m_nextpkt) {
1981 if (m_hold->m_nextpkt == NULL) {
1982 m_hold->m_nextpkt = m;
1986 while (i >= V_nd6_maxqueuelen) {
1987 m_hold = ln->la_hold;
1988 ln->la_hold = ln->la_hold->m_nextpkt;
1997 * If there has been no NS for the neighbor after entering the
1998 * INCOMPLETE state, send the first solicitation.
2000 if (!ND6_LLINFO_PERMANENT(ln) && ln->la_asked == 0) {
2003 nd6_llinfo_settimer_locked(ln,
2004 (long)ND_IFINFO(ifp)->retrans * hz / 1000);
2006 nd6_ns_output(ifp, NULL, &dst->sin6_addr, ln, 0);
2007 if (lle != NULL && ln == lle)
2010 } else if (lle == NULL || ln != lle) {
2012 * We did the lookup (no lle arg) so we
2013 * need to do the unlock here.
2021 /* discard the packet if IPv6 operation is disabled on the interface */
2022 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED)) {
2023 error = ENETDOWN; /* better error? */
2027 * ln is valid and the caller did not pass in
2030 if ((ln != NULL) && (lle == NULL)) {
2031 if (flags & LLE_EXCLUSIVE)
2038 mac_netinet6_nd6_send(ifp, m);
2042 * If called from nd6_ns_output() (NS), nd6_na_output() (NA),
2043 * icmp6_redirect_output() (REDIRECT) or from rip6_output() (RS, RA
2044 * as handled by rtsol and rtadvd), mbufs will be tagged for SeND
2045 * to be diverted to user space. When re-injected into the kernel,
2046 * send_output() will directly dispatch them to the outgoing interface.
2048 if (send_sendso_input_hook != NULL) {
2049 mtag = m_tag_find(m, PACKET_TAG_ND_OUTGOING, NULL);
2051 ip6 = mtod(m, struct ip6_hdr *);
2052 ip6len = sizeof(struct ip6_hdr) + ntohs(ip6->ip6_plen);
2053 /* Use the SEND socket */
2054 error = send_sendso_input_hook(m, ifp, SND_OUT,
2056 /* -1 == no app on SEND socket */
2057 if (error == 0 || error != -1)
2063 * We were passed in a pointer to an lle with the lock held
2064 * this means that we can't call if_output as we will
2065 * recurse on the lle lock - so what we do is we create
2066 * a list of mbufs to send and transmit them in the caller
2067 * after the lock is dropped
2076 * append mbuf to end of deferred chain
2079 while (mb->m_nextpkt != NULL)
2085 m_clrprotoflags(m); /* Avoid confusing lower layers. */
2086 if ((ifp->if_flags & IFF_LOOPBACK) != 0) {
2087 return ((*ifp->if_output)(origifp, m, (struct sockaddr *)dst,
2090 error = (*ifp->if_output)(ifp, m, (struct sockaddr *)dst, NULL);
2095 * ln is valid and the caller did not pass in
2098 if ((ln != NULL) && (lle == NULL)) {
2099 if (flags & LLE_EXCLUSIVE)
2112 nd6_output_flush(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *chain,
2113 struct sockaddr_in6 *dst, struct route *ro)
2115 struct mbuf *m, *m_head;
2116 struct ifnet *outifp;
2120 if ((ifp->if_flags & IFF_LOOPBACK) != 0)
2127 m_head = m_head->m_nextpkt;
2128 error = (*ifp->if_output)(ifp, m, (struct sockaddr *)dst, ro);
2133 * note that intermediate errors are blindly ignored - but this is
2134 * the same convention as used with nd6_output when called by
2142 nd6_need_cache(struct ifnet *ifp)
2145 * XXX: we currently do not make neighbor cache on any interface
2146 * other than ARCnet, Ethernet, FDDI and GIF.
2149 * - unidirectional tunnels needs no ND
2151 switch (ifp->if_type) {
2159 #ifdef IFT_IEEE80211
2162 case IFT_INFINIBAND:
2163 case IFT_GIF: /* XXX need more cases? */
2167 case IFT_PROPVIRTUAL:
2175 * the callers of this function need to be re-worked to drop
2176 * the lle lock, drop here for now
2179 nd6_storelladdr(struct ifnet *ifp, struct mbuf *m,
2180 const struct sockaddr *dst, u_char *desten, struct llentry **lle)
2185 IF_AFDATA_UNLOCK_ASSERT(ifp);
2186 if (m != NULL && m->m_flags & M_MCAST) {
2189 switch (ifp->if_type) {
2195 #ifdef IFT_IEEE80211
2200 ETHER_MAP_IPV6_MULTICAST(&SIN6(dst)->sin6_addr,
2205 * netbsd can use if_broadcastaddr, but we don't do so
2206 * to reduce # of ifdef.
2208 for (i = 0; i < ifp->if_addrlen; i++)
2216 return (EAFNOSUPPORT);
2222 * the entry should have been created in nd6_store_lladdr
2224 IF_AFDATA_RLOCK(ifp);
2225 ln = lla_lookup(LLTABLE6(ifp), 0, dst);
2226 IF_AFDATA_RUNLOCK(ifp);
2227 if ((ln == NULL) || !(ln->la_flags & LLE_VALID)) {
2230 /* this could happen, if we could not allocate memory */
2235 bcopy(&ln->ll_addr, desten, ifp->if_addrlen);
2239 * A *small* use after free race exists here
2245 clear_llinfo_pqueue(struct llentry *ln)
2247 struct mbuf *m_hold, *m_hold_next;
2249 for (m_hold = ln->la_hold; m_hold; m_hold = m_hold_next) {
2250 m_hold_next = m_hold->m_nextpkt;
2258 static int nd6_sysctl_drlist(SYSCTL_HANDLER_ARGS);
2259 static int nd6_sysctl_prlist(SYSCTL_HANDLER_ARGS);
2261 SYSCTL_DECL(_net_inet6_icmp6);
2263 SYSCTL_NODE(_net_inet6_icmp6, ICMPV6CTL_ND6_DRLIST, nd6_drlist,
2264 CTLFLAG_RD, nd6_sysctl_drlist, "");
2265 SYSCTL_NODE(_net_inet6_icmp6, ICMPV6CTL_ND6_PRLIST, nd6_prlist,
2266 CTLFLAG_RD, nd6_sysctl_prlist, "");
2267 SYSCTL_VNET_INT(_net_inet6_icmp6, ICMPV6CTL_ND6_MAXQLEN, nd6_maxqueuelen,
2268 CTLFLAG_RW, &VNET_NAME(nd6_maxqueuelen), 1, "");
2271 nd6_sysctl_drlist(SYSCTL_HANDLER_ARGS)
2273 struct in6_defrouter d;
2274 struct nd_defrouter *dr;
2280 bzero(&d, sizeof(d));
2281 d.rtaddr.sin6_family = AF_INET6;
2282 d.rtaddr.sin6_len = sizeof(d.rtaddr);
2287 TAILQ_FOREACH(dr, &V_nd_defrouter, dr_entry) {
2288 d.rtaddr.sin6_addr = dr->rtaddr;
2289 error = sa6_recoverscope(&d.rtaddr);
2292 d.flags = dr->flags;
2293 d.rtlifetime = dr->rtlifetime;
2294 d.expire = dr->expire + (time_second - time_uptime);
2295 d.if_index = dr->ifp->if_index;
2296 error = SYSCTL_OUT(req, &d, sizeof(d));
2304 nd6_sysctl_prlist(SYSCTL_HANDLER_ARGS)
2306 struct in6_prefix p;
2307 struct sockaddr_in6 s6;
2308 struct nd_prefix *pr;
2309 struct nd_pfxrouter *pfr;
2312 char ip6buf[INET6_ADDRSTRLEN];
2317 bzero(&p, sizeof(p));
2318 p.origin = PR_ORIG_RA;
2319 bzero(&s6, sizeof(s6));
2320 s6.sin6_family = AF_INET6;
2321 s6.sin6_len = sizeof(s6);
2326 LIST_FOREACH(pr, &V_nd_prefix, ndpr_entry) {
2327 p.prefix = pr->ndpr_prefix;
2328 if (sa6_recoverscope(&p.prefix)) {
2329 log(LOG_ERR, "scope error in prefix list (%s)\n",
2330 ip6_sprintf(ip6buf, &p.prefix.sin6_addr));
2331 /* XXX: press on... */
2333 p.raflags = pr->ndpr_raf;
2334 p.prefixlen = pr->ndpr_plen;
2335 p.vltime = pr->ndpr_vltime;
2336 p.pltime = pr->ndpr_pltime;
2337 p.if_index = pr->ndpr_ifp->if_index;
2338 if (pr->ndpr_vltime == ND6_INFINITE_LIFETIME)
2341 /* XXX: we assume time_t is signed. */
2343 ~((time_t)1 << ((sizeof(maxexpire) * 8) - 1));
2344 if (pr->ndpr_vltime < maxexpire - pr->ndpr_lastupdate)
2345 p.expire = pr->ndpr_lastupdate +
2347 (time_second - time_uptime);
2349 p.expire = maxexpire;
2351 p.refcnt = pr->ndpr_refcnt;
2352 p.flags = pr->ndpr_stateflags;
2354 LIST_FOREACH(pfr, &pr->ndpr_advrtrs, pfr_entry)
2356 error = SYSCTL_OUT(req, &p, sizeof(p));
2359 LIST_FOREACH(pfr, &pr->ndpr_advrtrs, pfr_entry) {
2360 s6.sin6_addr = pfr->router->rtaddr;
2361 if (sa6_recoverscope(&s6))
2363 "scope error in prefix list (%s)\n",
2364 ip6_sprintf(ip6buf, &pfr->router->rtaddr));
2365 error = SYSCTL_OUT(req, &s6, sizeof(s6));