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>
76 #include <sys/limits.h>
78 #include <security/mac/mac_framework.h>
80 #define ND6_SLOWTIMER_INTERVAL (60 * 60) /* 1 hour */
81 #define ND6_RECALC_REACHTM_INTERVAL (60 * 120) /* 2 hours */
83 #define SIN6(s) ((struct sockaddr_in6 *)s)
85 VNET_DEFINE(int, nd6_prune);
86 VNET_DEFINE(int, nd6_delay);
87 VNET_DEFINE(int, nd6_umaxtries);
88 VNET_DEFINE(int, nd6_mmaxtries);
89 VNET_DEFINE(int, nd6_useloopback);
90 VNET_DEFINE(int, nd6_gctimer);
92 /* preventing too many loops in ND option parsing */
93 static VNET_DEFINE(int, nd6_maxndopt);
94 VNET_DEFINE(int, nd6_maxnudhint);
95 static VNET_DEFINE(int, nd6_maxqueuelen);
96 #define V_nd6_maxndopt VNET(nd6_maxndopt)
97 #define V_nd6_maxqueuelen VNET(nd6_maxqueuelen)
99 VNET_DEFINE(int, nd6_debug);
103 static int nd6_inuse, nd6_allocated;
106 VNET_DEFINE(struct nd_drhead, nd_defrouter);
107 VNET_DEFINE(struct nd_prhead, nd_prefix);
109 VNET_DEFINE(int, nd6_recalc_reachtm_interval);
110 #define V_nd6_recalc_reachtm_interval VNET(nd6_recalc_reachtm_interval)
112 static struct sockaddr_in6 all1_sa;
114 static int nd6_is_new_addr_neighbor __P((struct sockaddr_in6 *,
116 static void nd6_setmtu0(struct ifnet *, struct nd_ifinfo *);
117 static void nd6_slowtimo(void *);
118 static int regen_tmpaddr(struct in6_ifaddr *);
119 static struct llentry *nd6_free(struct llentry *, int);
120 static void nd6_llinfo_timer(void *);
121 static void clear_llinfo_pqueue(struct llentry *);
123 static VNET_DEFINE(struct callout, nd6_slowtimo_ch);
124 #define V_nd6_slowtimo_ch VNET(nd6_slowtimo_ch)
126 VNET_DEFINE(struct callout, nd6_timer_ch);
128 VNET_DECLARE(int, dad_ignore_ns);
129 VNET_DECLARE(int, dad_maxtry);
130 #define V_dad_ignore_ns VNET(dad_ignore_ns)
131 #define V_dad_maxtry VNET(dad_maxtry)
138 V_nd6_prune = 1; /* walk list every 1 seconds */
139 V_nd6_delay = 5; /* delay first probe time 5 second */
140 V_nd6_umaxtries = 3; /* maximum unicast query */
141 V_nd6_mmaxtries = 3; /* maximum multicast query */
142 V_nd6_useloopback = 1; /* use loopback interface for local traffic */
143 V_nd6_gctimer = (60 * 60 * 24); /* 1 day: garbage collection timer */
145 /* preventing too many loops in ND option parsing */
146 V_nd6_maxndopt = 10; /* max # of ND options allowed */
148 V_nd6_maxnudhint = 0; /* max # of subsequent upper layer hints */
149 V_nd6_maxqueuelen = 1; /* max pkts cached in unresolved ND entries */
157 V_nd6_recalc_reachtm_interval = ND6_RECALC_REACHTM_INTERVAL;
159 V_dad_ignore_ns = 0; /* ignore NS in DAD - specwise incorrect*/
160 V_dad_maxtry = 15; /* max # of *tries* to transmit DAD packet */
163 * XXX just to get this to compile KMM
166 V_llinfo_nd6.ln_next = &V_llinfo_nd6;
167 V_llinfo_nd6.ln_prev = &V_llinfo_nd6;
169 LIST_INIT(&V_nd_prefix);
171 V_ip6_use_tempaddr = 0;
172 V_ip6_temp_preferred_lifetime = DEF_TEMP_PREFERRED_LIFETIME;
173 V_ip6_temp_valid_lifetime = DEF_TEMP_VALID_LIFETIME;
174 V_ip6_temp_regen_advance = TEMPADDR_REGEN_ADVANCE;
176 V_ip6_desync_factor = 0;
178 all1_sa.sin6_family = AF_INET6;
179 all1_sa.sin6_len = sizeof(struct sockaddr_in6);
180 for (i = 0; i < sizeof(all1_sa.sin6_addr); i++)
181 all1_sa.sin6_addr.s6_addr[i] = 0xff;
183 /* initialization of the default router list */
184 TAILQ_INIT(&V_nd_defrouter);
186 callout_init(&V_nd6_slowtimo_ch, 0);
187 callout_reset(&V_nd6_slowtimo_ch, ND6_SLOWTIMER_INTERVAL * hz,
188 nd6_slowtimo, curvnet);
197 callout_drain(&V_nd6_slowtimo_ch);
198 callout_drain(&V_nd6_timer_ch);
203 nd6_ifattach(struct ifnet *ifp)
205 struct nd_ifinfo *nd;
207 nd = (struct nd_ifinfo *)malloc(sizeof(*nd), M_IP6NDP, M_WAITOK);
208 bzero(nd, sizeof(*nd));
212 nd->chlim = IPV6_DEFHLIM;
213 nd->basereachable = REACHABLE_TIME;
214 nd->reachable = ND_COMPUTE_RTIME(nd->basereachable);
215 nd->retrans = RETRANS_TIMER;
217 nd->flags = ND6_IFF_PERFORMNUD;
219 /* A loopback interface always has ND6_IFF_AUTO_LINKLOCAL. */
220 if (V_ip6_auto_linklocal || (ifp->if_flags & IFF_LOOPBACK))
221 nd->flags |= ND6_IFF_AUTO_LINKLOCAL;
223 /* A loopback interface does not need to accept RTADV. */
224 if (V_ip6_accept_rtadv && !(ifp->if_flags & IFF_LOOPBACK))
225 nd->flags |= ND6_IFF_ACCEPT_RTADV;
227 /* XXX: we cannot call nd6_setmtu since ifp is not fully initialized */
228 nd6_setmtu0(ifp, nd);
234 nd6_ifdetach(struct nd_ifinfo *nd)
241 * Reset ND level link MTU. This function is called when the physical MTU
242 * changes, which means we might have to adjust the ND level MTU.
245 nd6_setmtu(struct ifnet *ifp)
248 nd6_setmtu0(ifp, ND_IFINFO(ifp));
251 /* XXX todo: do not maintain copy of ifp->if_mtu in ndi->maxmtu */
253 nd6_setmtu0(struct ifnet *ifp, struct nd_ifinfo *ndi)
257 omaxmtu = ndi->maxmtu;
259 switch (ifp->if_type) {
261 ndi->maxmtu = MIN(ARC_PHDS_MAXMTU, ifp->if_mtu); /* RFC2497 */
264 ndi->maxmtu = MIN(FDDIIPMTU, ifp->if_mtu); /* RFC2467 */
267 ndi->maxmtu = MIN(ISO88025_MAX_MTU, ifp->if_mtu);
270 ndi->maxmtu = ifp->if_mtu;
275 * Decreasing the interface MTU under IPV6 minimum MTU may cause
276 * undesirable situation. We thus notify the operator of the change
277 * explicitly. The check for omaxmtu is necessary to restrict the
278 * log to the case of changing the MTU, not initializing it.
280 if (omaxmtu >= IPV6_MMTU && ndi->maxmtu < IPV6_MMTU) {
281 log(LOG_NOTICE, "nd6_setmtu0: "
282 "new link MTU on %s (%lu) is too small for IPv6\n",
283 if_name(ifp), (unsigned long)ndi->maxmtu);
286 if (ndi->maxmtu > V_in6_maxmtu)
287 in6_setmaxmtu(); /* check all interfaces just in case */
292 nd6_option_init(void *opt, int icmp6len, union nd_opts *ndopts)
295 bzero(ndopts, sizeof(*ndopts));
296 ndopts->nd_opts_search = (struct nd_opt_hdr *)opt;
298 = (struct nd_opt_hdr *)(((u_char *)opt) + icmp6len);
301 ndopts->nd_opts_done = 1;
302 ndopts->nd_opts_search = NULL;
307 * Take one ND option.
310 nd6_option(union nd_opts *ndopts)
312 struct nd_opt_hdr *nd_opt;
316 panic("ndopts == NULL in nd6_option");
317 if (ndopts->nd_opts_last == NULL)
318 panic("uninitialized ndopts in nd6_option");
319 if (ndopts->nd_opts_search == NULL)
321 if (ndopts->nd_opts_done)
324 nd_opt = ndopts->nd_opts_search;
326 /* make sure nd_opt_len is inside the buffer */
327 if ((caddr_t)&nd_opt->nd_opt_len >= (caddr_t)ndopts->nd_opts_last) {
328 bzero(ndopts, sizeof(*ndopts));
332 olen = nd_opt->nd_opt_len << 3;
335 * Message validation requires that all included
336 * options have a length that is greater than zero.
338 bzero(ndopts, sizeof(*ndopts));
342 ndopts->nd_opts_search = (struct nd_opt_hdr *)((caddr_t)nd_opt + olen);
343 if (ndopts->nd_opts_search > ndopts->nd_opts_last) {
344 /* option overruns the end of buffer, invalid */
345 bzero(ndopts, sizeof(*ndopts));
347 } else if (ndopts->nd_opts_search == ndopts->nd_opts_last) {
348 /* reached the end of options chain */
349 ndopts->nd_opts_done = 1;
350 ndopts->nd_opts_search = NULL;
356 * Parse multiple ND options.
357 * This function is much easier to use, for ND routines that do not need
358 * multiple options of the same type.
361 nd6_options(union nd_opts *ndopts)
363 struct nd_opt_hdr *nd_opt;
367 panic("ndopts == NULL in nd6_options");
368 if (ndopts->nd_opts_last == NULL)
369 panic("uninitialized ndopts in nd6_options");
370 if (ndopts->nd_opts_search == NULL)
374 nd_opt = nd6_option(ndopts);
375 if (nd_opt == NULL && ndopts->nd_opts_last == NULL) {
377 * Message validation requires that all included
378 * options have a length that is greater than zero.
380 ICMP6STAT_INC(icp6s_nd_badopt);
381 bzero(ndopts, sizeof(*ndopts));
388 switch (nd_opt->nd_opt_type) {
389 case ND_OPT_SOURCE_LINKADDR:
390 case ND_OPT_TARGET_LINKADDR:
392 case ND_OPT_REDIRECTED_HEADER:
393 if (ndopts->nd_opt_array[nd_opt->nd_opt_type]) {
395 "duplicated ND6 option found (type=%d)\n",
396 nd_opt->nd_opt_type));
399 ndopts->nd_opt_array[nd_opt->nd_opt_type]
403 case ND_OPT_PREFIX_INFORMATION:
404 if (ndopts->nd_opt_array[nd_opt->nd_opt_type] == 0) {
405 ndopts->nd_opt_array[nd_opt->nd_opt_type]
408 ndopts->nd_opts_pi_end =
409 (struct nd_opt_prefix_info *)nd_opt;
413 * Unknown options must be silently ignored,
414 * to accomodate future extension to the protocol.
417 "nd6_options: unsupported option %d - "
418 "option ignored\n", nd_opt->nd_opt_type));
423 if (i > V_nd6_maxndopt) {
424 ICMP6STAT_INC(icp6s_nd_toomanyopt);
425 nd6log((LOG_INFO, "too many loop in nd opt\n"));
429 if (ndopts->nd_opts_done)
437 * ND6 timer routine to handle ND6 entries
440 nd6_llinfo_settimer_locked(struct llentry *ln, long tick)
445 callout_stop(&ln->ln_timer_ch);
447 * XXX - do we know that there is
448 * callout installed? i.e. are we
449 * guaranteed that we're not dropping
450 * a reference that we did not add?
455 ln->la_expire = time_second + tick / hz;
457 if (tick > INT_MAX) {
458 ln->ln_ntick = tick - INT_MAX;
459 callout_reset(&ln->ln_timer_ch, INT_MAX,
460 nd6_llinfo_timer, ln);
463 callout_reset(&ln->ln_timer_ch, tick,
464 nd6_llinfo_timer, ln);
470 nd6_llinfo_settimer(struct llentry *ln, long tick)
474 nd6_llinfo_settimer_locked(ln, tick);
479 nd6_llinfo_timer(void *arg)
482 struct in6_addr *dst;
484 struct nd_ifinfo *ndi = NULL;
486 ln = (struct llentry *)arg;
488 panic("%s: NULL entry!\n", __func__);
492 if ((ifp = ((ln->lle_tbl != NULL) ? ln->lle_tbl->llt_ifp : NULL)) == NULL)
493 panic("ln ifp == NULL");
495 CURVNET_SET(ifp->if_vnet);
497 if (ln->ln_ntick > 0) {
498 if (ln->ln_ntick > INT_MAX) {
499 ln->ln_ntick -= INT_MAX;
500 nd6_llinfo_settimer(ln, INT_MAX);
503 nd6_llinfo_settimer(ln, ln->ln_ntick);
508 ndi = ND_IFINFO(ifp);
509 dst = &L3_ADDR_SIN6(ln)->sin6_addr;
510 if ((ln->la_flags & LLE_STATIC) || (ln->la_expire > time_second)) {
514 if (ln->la_flags & LLE_DELETED) {
515 (void)nd6_free(ln, 0);
519 switch (ln->ln_state) {
520 case ND6_LLINFO_INCOMPLETE:
521 if (ln->la_asked < V_nd6_mmaxtries) {
523 nd6_llinfo_settimer(ln, (long)ndi->retrans * hz / 1000);
524 nd6_ns_output(ifp, NULL, dst, ln, 0);
526 struct mbuf *m = ln->la_hold;
531 * assuming every packet in la_hold has the
536 icmp6_error2(m, ICMP6_DST_UNREACH,
537 ICMP6_DST_UNREACH_ADDR, 0, ifp);
540 clear_llinfo_pqueue(ln);
542 (void)nd6_free(ln, 0);
546 case ND6_LLINFO_REACHABLE:
547 if (!ND6_LLINFO_PERMANENT(ln)) {
548 ln->ln_state = ND6_LLINFO_STALE;
549 nd6_llinfo_settimer(ln, (long)V_nd6_gctimer * hz);
553 case ND6_LLINFO_STALE:
554 /* Garbage Collection(RFC 2461 5.3) */
555 if (!ND6_LLINFO_PERMANENT(ln)) {
556 (void)nd6_free(ln, 1);
561 case ND6_LLINFO_DELAY:
562 if (ndi && (ndi->flags & ND6_IFF_PERFORMNUD) != 0) {
565 ln->ln_state = ND6_LLINFO_PROBE;
566 nd6_llinfo_settimer(ln, (long)ndi->retrans * hz / 1000);
567 nd6_ns_output(ifp, dst, dst, ln, 0);
569 ln->ln_state = ND6_LLINFO_STALE; /* XXX */
570 nd6_llinfo_settimer(ln, (long)V_nd6_gctimer * hz);
573 case ND6_LLINFO_PROBE:
574 if (ln->la_asked < V_nd6_umaxtries) {
576 nd6_llinfo_settimer(ln, (long)ndi->retrans * hz / 1000);
577 nd6_ns_output(ifp, dst, dst, ln, 0);
579 (void)nd6_free(ln, 0);
592 * ND6 timer routine to expire default route list and prefix list
597 CURVNET_SET((struct vnet *) arg);
599 struct nd_defrouter *dr;
600 struct nd_prefix *pr;
601 struct in6_ifaddr *ia6, *nia6;
602 struct in6_addrlifetime *lt6;
604 callout_reset(&V_nd6_timer_ch, V_nd6_prune * hz,
607 /* expire default router list */
609 dr = TAILQ_FIRST(&V_nd_defrouter);
611 if (dr->expire && dr->expire < time_second) {
612 struct nd_defrouter *t;
613 t = TAILQ_NEXT(dr, dr_entry);
617 dr = TAILQ_NEXT(dr, dr_entry);
622 * expire interface addresses.
623 * in the past the loop was inside prefix expiry processing.
624 * However, from a stricter speci-confrmance standpoint, we should
625 * rather separate address lifetimes and prefix lifetimes.
627 * XXXRW: in6_ifaddrhead locking.
630 TAILQ_FOREACH_SAFE(ia6, &V_in6_ifaddrhead, ia_link, nia6) {
631 /* check address lifetime */
632 lt6 = &ia6->ia6_lifetime;
633 if (IFA6_IS_INVALID(ia6)) {
637 * If the expiring address is temporary, try
638 * regenerating a new one. This would be useful when
639 * we suspended a laptop PC, then turned it on after a
640 * period that could invalidate all temporary
641 * addresses. Although we may have to restart the
642 * loop (see below), it must be after purging the
643 * address. Otherwise, we'd see an infinite loop of
646 if (V_ip6_use_tempaddr &&
647 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0) {
648 if (regen_tmpaddr(ia6) == 0)
652 in6_purgeaddr(&ia6->ia_ifa);
655 goto addrloop; /* XXX: see below */
656 } else if (IFA6_IS_DEPRECATED(ia6)) {
657 int oldflags = ia6->ia6_flags;
659 ia6->ia6_flags |= IN6_IFF_DEPRECATED;
662 * If a temporary address has just become deprecated,
663 * regenerate a new one if possible.
665 if (V_ip6_use_tempaddr &&
666 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0 &&
667 (oldflags & IN6_IFF_DEPRECATED) == 0) {
669 if (regen_tmpaddr(ia6) == 0) {
671 * A new temporary address is
673 * XXX: this means the address chain
674 * has changed while we are still in
675 * the loop. Although the change
676 * would not cause disaster (because
677 * it's not a deletion, but an
678 * addition,) we'd rather restart the
679 * loop just for safety. Or does this
680 * significantly reduce performance??
687 * A new RA might have made a deprecated address
690 ia6->ia6_flags &= ~IN6_IFF_DEPRECATED;
694 /* expire prefix list */
695 pr = V_nd_prefix.lh_first;
698 * check prefix lifetime.
699 * since pltime is just for autoconf, pltime processing for
700 * prefix is not necessary.
702 if (pr->ndpr_vltime != ND6_INFINITE_LIFETIME &&
703 time_second - pr->ndpr_lastupdate > pr->ndpr_vltime) {
708 * address expiration and prefix expiration are
709 * separate. NEVER perform in6_purgeaddr here.
722 * ia6 - deprecated/invalidated temporary address
725 regen_tmpaddr(struct in6_ifaddr *ia6)
729 struct in6_ifaddr *public_ifa6 = NULL;
731 ifp = ia6->ia_ifa.ifa_ifp;
733 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
734 struct in6_ifaddr *it6;
736 if (ifa->ifa_addr->sa_family != AF_INET6)
739 it6 = (struct in6_ifaddr *)ifa;
741 /* ignore no autoconf addresses. */
742 if ((it6->ia6_flags & IN6_IFF_AUTOCONF) == 0)
745 /* ignore autoconf addresses with different prefixes. */
746 if (it6->ia6_ndpr == NULL || it6->ia6_ndpr != ia6->ia6_ndpr)
750 * Now we are looking at an autoconf address with the same
751 * prefix as ours. If the address is temporary and is still
752 * preferred, do not create another one. It would be rare, but
753 * could happen, for example, when we resume a laptop PC after
756 if ((it6->ia6_flags & IN6_IFF_TEMPORARY) != 0 &&
757 !IFA6_IS_DEPRECATED(it6)) {
763 * This is a public autoconf address that has the same prefix
764 * as ours. If it is preferred, keep it. We can't break the
765 * loop here, because there may be a still-preferred temporary
766 * address with the prefix.
768 if (!IFA6_IS_DEPRECATED(it6))
772 if (public_ifa6 != NULL) {
775 if ((e = in6_tmpifadd(public_ifa6, 0, 0)) != 0) {
777 log(LOG_NOTICE, "regen_tmpaddr: failed to create a new"
778 " tmp addr,errno=%d\n", e);
790 * Nuke neighbor cache/prefix/default router management table, right before
794 nd6_purge(struct ifnet *ifp)
796 struct nd_defrouter *dr, *ndr;
797 struct nd_prefix *pr, *npr;
800 * Nuke default router list entries toward ifp.
801 * We defer removal of default router list entries that is installed
802 * in the routing table, in order to keep additional side effects as
805 for (dr = TAILQ_FIRST(&V_nd_defrouter); dr; dr = ndr) {
806 ndr = TAILQ_NEXT(dr, dr_entry);
814 for (dr = TAILQ_FIRST(&V_nd_defrouter); dr; dr = ndr) {
815 ndr = TAILQ_NEXT(dr, dr_entry);
823 /* Nuke prefix list entries toward ifp */
824 for (pr = V_nd_prefix.lh_first; pr; pr = npr) {
826 if (pr->ndpr_ifp == ifp) {
828 * Because if_detach() does *not* release prefixes
829 * while purging addresses the reference count will
830 * still be above zero. We therefore reset it to
831 * make sure that the prefix really gets purged.
836 * Previously, pr->ndpr_addr is removed as well,
837 * but I strongly believe we don't have to do it.
838 * nd6_purge() is only called from in6_ifdetach(),
839 * which removes all the associated interface addresses
841 * (jinmei@kame.net 20010129)
847 /* cancel default outgoing interface setting */
848 if (V_nd6_defifindex == ifp->if_index)
849 nd6_setdefaultiface(0);
851 if (!V_ip6_forwarding && ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
852 /* Refresh default router list. */
857 * We do not nuke the neighbor cache entries here any more
858 * because the neighbor cache is kept in if_afdata[AF_INET6].
859 * nd6_purge() is invoked by in6_ifdetach() which is called
860 * from if_detach() where everything gets purged. So let
861 * in6_domifdetach() do the actual L2 table purging work.
866 * the caller acquires and releases the lock on the lltbls
867 * Returns the llentry locked
870 nd6_lookup(struct in6_addr *addr6, int flags, struct ifnet *ifp)
872 struct sockaddr_in6 sin6;
876 bzero(&sin6, sizeof(sin6));
877 sin6.sin6_len = sizeof(struct sockaddr_in6);
878 sin6.sin6_family = AF_INET6;
879 sin6.sin6_addr = *addr6;
881 IF_AFDATA_LOCK_ASSERT(ifp);
883 if (flags & ND6_CREATE)
884 llflags |= LLE_CREATE;
885 if (flags & ND6_EXCLUSIVE)
886 llflags |= LLE_EXCLUSIVE;
888 ln = lla_lookup(LLTABLE6(ifp), llflags, (struct sockaddr *)&sin6);
889 if ((ln != NULL) && (flags & LLE_CREATE)) {
890 ln->ln_state = ND6_LLINFO_NOSTATE;
891 callout_init(&ln->ln_timer_ch, 0);
898 * Test whether a given IPv6 address is a neighbor or not, ignoring
899 * the actual neighbor cache. The neighbor cache is ignored in order
900 * to not reenter the routing code from within itself.
903 nd6_is_new_addr_neighbor(struct sockaddr_in6 *addr, struct ifnet *ifp)
905 struct nd_prefix *pr;
906 struct ifaddr *dstaddr;
909 * A link-local address is always a neighbor.
910 * XXX: a link does not necessarily specify a single interface.
912 if (IN6_IS_ADDR_LINKLOCAL(&addr->sin6_addr)) {
913 struct sockaddr_in6 sin6_copy;
917 * We need sin6_copy since sa6_recoverscope() may modify the
921 if (sa6_recoverscope(&sin6_copy))
922 return (0); /* XXX: should be impossible */
923 if (in6_setscope(&sin6_copy.sin6_addr, ifp, &zone))
925 if (sin6_copy.sin6_scope_id == zone)
932 * If the address matches one of our addresses,
933 * it should be a neighbor.
934 * If the address matches one of our on-link prefixes, it should be a
937 for (pr = V_nd_prefix.lh_first; pr; pr = pr->ndpr_next) {
938 if (pr->ndpr_ifp != ifp)
941 if (!(pr->ndpr_stateflags & NDPRF_ONLINK))
944 if (IN6_ARE_MASKED_ADDR_EQUAL(&pr->ndpr_prefix.sin6_addr,
945 &addr->sin6_addr, &pr->ndpr_mask))
950 * If the address is assigned on the node of the other side of
951 * a p2p interface, the address should be a neighbor.
953 dstaddr = ifa_ifwithdstaddr((struct sockaddr *)addr);
954 if (dstaddr != NULL) {
955 if (dstaddr->ifa_ifp == ifp) {
963 * If the default router list is empty, all addresses are regarded
964 * as on-link, and thus, as a neighbor.
965 * XXX: we restrict the condition to hosts, because routers usually do
966 * not have the "default router list".
968 if (!V_ip6_forwarding && TAILQ_FIRST(&V_nd_defrouter) == NULL &&
969 V_nd6_defifindex == ifp->if_index) {
978 * Detect if a given IPv6 address identifies a neighbor on a given link.
979 * XXX: should take care of the destination of a p2p link?
982 nd6_is_addr_neighbor(struct sockaddr_in6 *addr, struct ifnet *ifp)
987 IF_AFDATA_UNLOCK_ASSERT(ifp);
988 if (nd6_is_new_addr_neighbor(addr, ifp))
992 * Even if the address matches none of our addresses, it might be
993 * in the neighbor cache.
996 if ((lle = nd6_lookup(&addr->sin6_addr, 0, ifp)) != NULL) {
1000 IF_AFDATA_UNLOCK(ifp);
1005 * Free an nd6 llinfo entry.
1006 * Since the function would cause significant changes in the kernel, DO NOT
1007 * make it global, unless you have a strong reason for the change, and are sure
1008 * that the change is safe.
1010 static struct llentry *
1011 nd6_free(struct llentry *ln, int gc)
1013 struct llentry *next;
1014 struct nd_defrouter *dr;
1015 struct ifnet *ifp=NULL;
1018 * we used to have pfctlinput(PRC_HOSTDEAD) here.
1019 * even though it is not harmful, it was not really necessary.
1023 nd6_llinfo_settimer(ln, -1);
1025 if (!V_ip6_forwarding) {
1028 dr = defrouter_lookup(&L3_ADDR_SIN6(ln)->sin6_addr, ln->lle_tbl->llt_ifp);
1030 if (dr != NULL && dr->expire &&
1031 ln->ln_state == ND6_LLINFO_STALE && gc) {
1033 * If the reason for the deletion is just garbage
1034 * collection, and the neighbor is an active default
1035 * router, do not delete it. Instead, reset the GC
1036 * timer using the router's lifetime.
1037 * Simply deleting the entry would affect default
1038 * router selection, which is not necessarily a good
1039 * thing, especially when we're using router preference
1041 * XXX: the check for ln_state would be redundant,
1042 * but we intentionally keep it just in case.
1044 if (dr->expire > time_second)
1045 nd6_llinfo_settimer(ln,
1046 (dr->expire - time_second) * hz);
1048 nd6_llinfo_settimer(ln, (long)V_nd6_gctimer * hz);
1050 return (LIST_NEXT(ln, lle_next));
1053 if (ln->ln_router || dr) {
1055 * rt6_flush must be called whether or not the neighbor
1056 * is in the Default Router List.
1057 * See a corresponding comment in nd6_na_input().
1059 rt6_flush(&L3_ADDR_SIN6(ln)->sin6_addr, ln->lle_tbl->llt_ifp);
1064 * Unreachablity of a router might affect the default
1065 * router selection and on-link detection of advertised
1070 * Temporarily fake the state to choose a new default
1071 * router and to perform on-link determination of
1072 * prefixes correctly.
1073 * Below the state will be set correctly,
1074 * or the entry itself will be deleted.
1076 ln->ln_state = ND6_LLINFO_INCOMPLETE;
1079 * Since defrouter_select() does not affect the
1080 * on-link determination and MIP6 needs the check
1081 * before the default router selection, we perform
1084 pfxlist_onlink_check();
1087 * refresh default router list
1095 * Before deleting the entry, remember the next entry as the
1096 * return value. We need this because pfxlist_onlink_check() above
1097 * might have freed other entries (particularly the old next entry) as
1098 * a side effect (XXX).
1100 next = LIST_NEXT(ln, lle_next);
1102 ifp = ln->lle_tbl->llt_ifp;
1103 IF_AFDATA_LOCK(ifp);
1106 IF_AFDATA_UNLOCK(ifp);
1112 * Upper-layer reachability hint for Neighbor Unreachability Detection.
1114 * XXX cost-effective methods?
1117 nd6_nud_hint(struct rtentry *rt, struct in6_addr *dst6, int force)
1122 if ((dst6 == NULL) || (rt == NULL))
1126 IF_AFDATA_LOCK(ifp);
1127 ln = nd6_lookup(dst6, ND6_EXCLUSIVE, NULL);
1128 IF_AFDATA_UNLOCK(ifp);
1132 if (ln->ln_state < ND6_LLINFO_REACHABLE)
1136 * if we get upper-layer reachability confirmation many times,
1137 * it is possible we have false information.
1141 if (ln->ln_byhint > V_nd6_maxnudhint) {
1146 ln->ln_state = ND6_LLINFO_REACHABLE;
1147 if (!ND6_LLINFO_PERMANENT(ln)) {
1148 nd6_llinfo_settimer(ln,
1149 (long)ND_IFINFO(rt->rt_ifp)->reachable * hz);
1157 nd6_ioctl(u_long cmd, caddr_t data, struct ifnet *ifp)
1159 struct in6_drlist *drl = (struct in6_drlist *)data;
1160 struct in6_oprlist *oprl = (struct in6_oprlist *)data;
1161 struct in6_ndireq *ndi = (struct in6_ndireq *)data;
1162 struct in6_nbrinfo *nbi = (struct in6_nbrinfo *)data;
1163 struct in6_ndifreq *ndif = (struct in6_ndifreq *)data;
1164 struct nd_defrouter *dr;
1165 struct nd_prefix *pr;
1166 int i = 0, error = 0;
1170 case SIOCGDRLST_IN6:
1172 * obsolete API, use sysctl under net.inet6.icmp6
1174 bzero(drl, sizeof(*drl));
1176 dr = TAILQ_FIRST(&V_nd_defrouter);
1177 while (dr && i < DRLSTSIZ) {
1178 drl->defrouter[i].rtaddr = dr->rtaddr;
1179 in6_clearscope(&drl->defrouter[i].rtaddr);
1181 drl->defrouter[i].flags = dr->flags;
1182 drl->defrouter[i].rtlifetime = dr->rtlifetime;
1183 drl->defrouter[i].expire = dr->expire;
1184 drl->defrouter[i].if_index = dr->ifp->if_index;
1186 dr = TAILQ_NEXT(dr, dr_entry);
1190 case SIOCGPRLST_IN6:
1192 * obsolete API, use sysctl under net.inet6.icmp6
1194 * XXX the structure in6_prlist was changed in backward-
1195 * incompatible manner. in6_oprlist is used for SIOCGPRLST_IN6,
1196 * in6_prlist is used for nd6_sysctl() - fill_prlist().
1199 * XXX meaning of fields, especialy "raflags", is very
1200 * differnet between RA prefix list and RR/static prefix list.
1201 * how about separating ioctls into two?
1203 bzero(oprl, sizeof(*oprl));
1205 pr = V_nd_prefix.lh_first;
1206 while (pr && i < PRLSTSIZ) {
1207 struct nd_pfxrouter *pfr;
1210 oprl->prefix[i].prefix = pr->ndpr_prefix.sin6_addr;
1211 oprl->prefix[i].raflags = pr->ndpr_raf;
1212 oprl->prefix[i].prefixlen = pr->ndpr_plen;
1213 oprl->prefix[i].vltime = pr->ndpr_vltime;
1214 oprl->prefix[i].pltime = pr->ndpr_pltime;
1215 oprl->prefix[i].if_index = pr->ndpr_ifp->if_index;
1216 if (pr->ndpr_vltime == ND6_INFINITE_LIFETIME)
1217 oprl->prefix[i].expire = 0;
1221 /* XXX: we assume time_t is signed. */
1224 ((sizeof(maxexpire) * 8) - 1));
1225 if (pr->ndpr_vltime <
1226 maxexpire - pr->ndpr_lastupdate) {
1227 oprl->prefix[i].expire =
1228 pr->ndpr_lastupdate +
1231 oprl->prefix[i].expire = maxexpire;
1234 pfr = pr->ndpr_advrtrs.lh_first;
1238 #define RTRADDR oprl->prefix[i].advrtr[j]
1239 RTRADDR = pfr->router->rtaddr;
1240 in6_clearscope(&RTRADDR);
1244 pfr = pfr->pfr_next;
1246 oprl->prefix[i].advrtrs = j;
1247 oprl->prefix[i].origin = PR_ORIG_RA;
1255 case OSIOCGIFINFO_IN6:
1257 /* XXX: old ndp(8) assumes a positive value for linkmtu. */
1258 bzero(&ND, sizeof(ND));
1259 ND.linkmtu = IN6_LINKMTU(ifp);
1260 ND.maxmtu = ND_IFINFO(ifp)->maxmtu;
1261 ND.basereachable = ND_IFINFO(ifp)->basereachable;
1262 ND.reachable = ND_IFINFO(ifp)->reachable;
1263 ND.retrans = ND_IFINFO(ifp)->retrans;
1264 ND.flags = ND_IFINFO(ifp)->flags;
1265 ND.recalctm = ND_IFINFO(ifp)->recalctm;
1266 ND.chlim = ND_IFINFO(ifp)->chlim;
1268 case SIOCGIFINFO_IN6:
1269 ND = *ND_IFINFO(ifp);
1271 case SIOCSIFINFO_IN6:
1273 * used to change host variables from userland.
1274 * intented for a use on router to reflect RA configurations.
1276 /* 0 means 'unspecified' */
1277 if (ND.linkmtu != 0) {
1278 if (ND.linkmtu < IPV6_MMTU ||
1279 ND.linkmtu > IN6_LINKMTU(ifp)) {
1283 ND_IFINFO(ifp)->linkmtu = ND.linkmtu;
1286 if (ND.basereachable != 0) {
1287 int obasereachable = ND_IFINFO(ifp)->basereachable;
1289 ND_IFINFO(ifp)->basereachable = ND.basereachable;
1290 if (ND.basereachable != obasereachable)
1291 ND_IFINFO(ifp)->reachable =
1292 ND_COMPUTE_RTIME(ND.basereachable);
1294 if (ND.retrans != 0)
1295 ND_IFINFO(ifp)->retrans = ND.retrans;
1297 ND_IFINFO(ifp)->chlim = ND.chlim;
1299 case SIOCSIFINFO_FLAGS:
1302 struct in6_ifaddr *ia;
1304 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) &&
1305 !(ND.flags & ND6_IFF_IFDISABLED)) {
1306 /* ifdisabled 1->0 transision */
1309 * If the interface is marked as ND6_IFF_IFDISABLED and
1310 * has an link-local address with IN6_IFF_DUPLICATED,
1311 * do not clear ND6_IFF_IFDISABLED.
1312 * See RFC 4862, Section 5.4.5.
1314 int duplicated_linklocal = 0;
1317 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1318 if (ifa->ifa_addr->sa_family != AF_INET6)
1320 ia = (struct in6_ifaddr *)ifa;
1321 if ((ia->ia6_flags & IN6_IFF_DUPLICATED) &&
1322 IN6_IS_ADDR_LINKLOCAL(&ia->ia_addr.sin6_addr)) {
1323 duplicated_linklocal = 1;
1327 IF_ADDR_UNLOCK(ifp);
1329 if (duplicated_linklocal) {
1330 ND.flags |= ND6_IFF_IFDISABLED;
1331 log(LOG_ERR, "Cannot enable an interface"
1332 " with a link-local address marked"
1335 ND_IFINFO(ifp)->flags &= ~ND6_IFF_IFDISABLED;
1338 } else if (!(ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) &&
1339 (ND.flags & ND6_IFF_IFDISABLED)) {
1340 /* ifdisabled 0->1 transision */
1341 /* Mark all IPv6 address as tentative. */
1343 ND_IFINFO(ifp)->flags |= ND6_IFF_IFDISABLED;
1345 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1346 if (ifa->ifa_addr->sa_family != AF_INET6)
1348 ia = (struct in6_ifaddr *)ifa;
1349 ia->ia6_flags |= IN6_IFF_TENTATIVE;
1351 IF_ADDR_UNLOCK(ifp);
1354 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_AUTO_LINKLOCAL) &&
1355 (ND.flags & ND6_IFF_AUTO_LINKLOCAL)) {
1356 /* auto_linklocal 0->1 transision */
1358 /* If no link-local address on ifp, configure */
1359 ND_IFINFO(ifp)->flags |= ND6_IFF_AUTO_LINKLOCAL;
1360 in6_ifattach(ifp, NULL);
1363 ND_IFINFO(ifp)->flags = ND.flags;
1366 case SIOCSNDFLUSH_IN6: /* XXX: the ioctl name is confusing... */
1367 /* sync kernel routing table with the default router list */
1371 case SIOCSPFXFLUSH_IN6:
1373 /* flush all the prefix advertised by routers */
1374 struct nd_prefix *pr, *next;
1377 for (pr = V_nd_prefix.lh_first; pr; pr = next) {
1378 struct in6_ifaddr *ia, *ia_next;
1380 next = pr->ndpr_next;
1382 if (IN6_IS_ADDR_LINKLOCAL(&pr->ndpr_prefix.sin6_addr))
1385 /* do we really have to remove addresses as well? */
1386 /* XXXRW: in6_ifaddrhead locking. */
1387 TAILQ_FOREACH_SAFE(ia, &V_in6_ifaddrhead, ia_link,
1389 if ((ia->ia6_flags & IN6_IFF_AUTOCONF) == 0)
1392 if (ia->ia6_ndpr == pr)
1393 in6_purgeaddr(&ia->ia_ifa);
1400 case SIOCSRTRFLUSH_IN6:
1402 /* flush all the default routers */
1403 struct nd_defrouter *dr, *next;
1407 for (dr = TAILQ_FIRST(&V_nd_defrouter); dr; dr = next) {
1408 next = TAILQ_NEXT(dr, dr_entry);
1415 case SIOCGNBRINFO_IN6:
1418 struct in6_addr nb_addr = nbi->addr; /* make local for safety */
1420 if ((error = in6_setscope(&nb_addr, ifp, NULL)) != 0)
1423 IF_AFDATA_LOCK(ifp);
1424 ln = nd6_lookup(&nb_addr, 0, ifp);
1425 IF_AFDATA_UNLOCK(ifp);
1431 nbi->state = ln->ln_state;
1432 nbi->asked = ln->la_asked;
1433 nbi->isrouter = ln->ln_router;
1434 nbi->expire = ln->la_expire;
1438 case SIOCGDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */
1439 ndif->ifindex = V_nd6_defifindex;
1441 case SIOCSDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */
1442 return (nd6_setdefaultiface(ndif->ifindex));
1448 * Create neighbor cache entry and cache link-layer address,
1449 * on reception of inbound ND6 packets. (RS/RA/NS/redirect)
1452 * code - type dependent information
1455 * The caller of this function already acquired the ndp
1456 * cache table lock because the cache entry is returned.
1459 nd6_cache_lladdr(struct ifnet *ifp, struct in6_addr *from, char *lladdr,
1460 int lladdrlen, int type, int code)
1462 struct llentry *ln = NULL;
1469 uint16_t router = 0;
1470 struct sockaddr_in6 sin6;
1471 struct mbuf *chain = NULL;
1472 int static_route = 0;
1474 IF_AFDATA_UNLOCK_ASSERT(ifp);
1477 panic("ifp == NULL in nd6_cache_lladdr");
1479 panic("from == NULL in nd6_cache_lladdr");
1481 /* nothing must be updated for unspecified address */
1482 if (IN6_IS_ADDR_UNSPECIFIED(from))
1486 * Validation about ifp->if_addrlen and lladdrlen must be done in
1489 * XXX If the link does not have link-layer adderss, what should
1490 * we do? (ifp->if_addrlen == 0)
1491 * Spec says nothing in sections for RA, RS and NA. There's small
1492 * description on it in NS section (RFC 2461 7.2.3).
1494 flags |= lladdr ? ND6_EXCLUSIVE : 0;
1495 IF_AFDATA_LOCK(ifp);
1496 ln = nd6_lookup(from, flags, ifp);
1499 flags |= LLE_EXCLUSIVE;
1500 ln = nd6_lookup(from, flags |ND6_CREATE, ifp);
1501 IF_AFDATA_UNLOCK(ifp);
1504 IF_AFDATA_UNLOCK(ifp);
1505 /* do nothing if static ndp is set */
1506 if (ln->la_flags & LLE_STATIC) {
1515 olladdr = (ln->la_flags & LLE_VALID) ? 1 : 0;
1516 if (olladdr && lladdr) {
1517 llchange = bcmp(lladdr, &ln->ll_addr,
1523 * newentry olladdr lladdr llchange (*=record)
1526 * 0 n y -- (3) * STALE
1528 * 0 y y y (5) * STALE
1529 * 1 -- n -- (6) NOSTATE(= PASSIVE)
1530 * 1 -- y -- (7) * STALE
1533 if (lladdr) { /* (3-5) and (7) */
1535 * Record source link-layer address
1536 * XXX is it dependent to ifp->if_type?
1538 bcopy(lladdr, &ln->ll_addr, ifp->if_addrlen);
1539 ln->la_flags |= LLE_VALID;
1543 if ((!olladdr && lladdr != NULL) || /* (3) */
1544 (olladdr && lladdr != NULL && llchange)) { /* (5) */
1546 newstate = ND6_LLINFO_STALE;
1547 } else /* (1-2,4) */
1551 if (lladdr == NULL) /* (6) */
1552 newstate = ND6_LLINFO_NOSTATE;
1554 newstate = ND6_LLINFO_STALE;
1559 * Update the state of the neighbor cache.
1561 ln->ln_state = newstate;
1563 if (ln->ln_state == ND6_LLINFO_STALE) {
1565 * XXX: since nd6_output() below will cause
1566 * state tansition to DELAY and reset the timer,
1567 * we must set the timer now, although it is actually
1570 nd6_llinfo_settimer_locked(ln, (long)V_nd6_gctimer * hz);
1573 struct mbuf *m_hold, *m_hold_next;
1576 * reset the la_hold in advance, to explicitly
1577 * prevent a la_hold lookup in nd6_output()
1578 * (wouldn't happen, though...)
1580 for (m_hold = ln->la_hold, ln->la_hold = NULL;
1581 m_hold; m_hold = m_hold_next) {
1582 m_hold_next = m_hold->m_nextpkt;
1583 m_hold->m_nextpkt = NULL;
1586 * we assume ifp is not a p2p here, so
1587 * just set the 2nd argument as the
1590 nd6_output_lle(ifp, ifp, m_hold, L3_ADDR_SIN6(ln), NULL, ln, &chain);
1593 * If we have mbufs in the chain we need to do
1594 * deferred transmit. Copy the address from the
1595 * llentry before dropping the lock down below.
1598 memcpy(&sin6, L3_ADDR_SIN6(ln), sizeof(sin6));
1600 } else if (ln->ln_state == ND6_LLINFO_INCOMPLETE) {
1601 /* probe right away */
1602 nd6_llinfo_settimer_locked((void *)ln, 0);
1607 * ICMP6 type dependent behavior.
1609 * NS: clear IsRouter if new entry
1610 * RS: clear IsRouter
1611 * RA: set IsRouter if there's lladdr
1612 * redir: clear IsRouter if new entry
1615 * The spec says that we must set IsRouter in the following cases:
1616 * - If lladdr exist, set IsRouter. This means (1-5).
1617 * - If it is old entry (!newentry), set IsRouter. This means (7).
1618 * So, based on the spec, in (1-5) and (7) cases we must set IsRouter.
1619 * A quetion arises for (1) case. (1) case has no lladdr in the
1620 * neighbor cache, this is similar to (6).
1621 * This case is rare but we figured that we MUST NOT set IsRouter.
1623 * newentry olladdr lladdr llchange NS RS RA redir
1625 * 0 n n -- (1) c ? s
1626 * 0 y n -- (2) c s s
1627 * 0 n y -- (3) c s s
1630 * 1 -- n -- (6) c c c s
1631 * 1 -- y -- (7) c c s c s
1635 switch (type & 0xff) {
1636 case ND_NEIGHBOR_SOLICIT:
1638 * New entry must have is_router flag cleared.
1640 if (is_newentry) /* (6-7) */
1645 * If the icmp is a redirect to a better router, always set the
1646 * is_router flag. Otherwise, if the entry is newly created,
1647 * clear the flag. [RFC 2461, sec 8.3]
1649 if (code == ND_REDIRECT_ROUTER)
1651 else if (is_newentry) /* (6-7) */
1654 case ND_ROUTER_SOLICIT:
1656 * is_router flag must always be cleared.
1660 case ND_ROUTER_ADVERT:
1662 * Mark an entry with lladdr as a router.
1664 if ((!is_newentry && (olladdr || lladdr)) || /* (2-5) */
1665 (is_newentry && lladdr)) { /* (7) */
1672 static_route = (ln->la_flags & LLE_STATIC);
1673 router = ln->ln_router;
1675 if (flags & ND6_EXCLUSIVE)
1683 nd6_output_flush(ifp, ifp, chain, &sin6, NULL);
1686 * When the link-layer address of a router changes, select the
1687 * best router again. In particular, when the neighbor entry is newly
1688 * created, it might affect the selection policy.
1689 * Question: can we restrict the first condition to the "is_newentry"
1691 * XXX: when we hear an RA from a new router with the link-layer
1692 * address option, defrouter_select() is called twice, since
1693 * defrtrlist_update called the function as well. However, I believe
1694 * we can compromise the overhead, since it only happens the first
1696 * XXX: although defrouter_select() should not have a bad effect
1697 * for those are not autoconfigured hosts, we explicitly avoid such
1700 if (do_update && router && !V_ip6_forwarding &&
1701 ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
1703 * guaranteed recursion
1711 if (flags & ND6_EXCLUSIVE)
1722 nd6_slowtimo(void *arg)
1724 CURVNET_SET((struct vnet *) arg);
1725 struct nd_ifinfo *nd6if;
1728 callout_reset(&V_nd6_slowtimo_ch, ND6_SLOWTIMER_INTERVAL * hz,
1729 nd6_slowtimo, curvnet);
1730 IFNET_RLOCK_NOSLEEP();
1731 for (ifp = TAILQ_FIRST(&V_ifnet); ifp;
1732 ifp = TAILQ_NEXT(ifp, if_list)) {
1733 nd6if = ND_IFINFO(ifp);
1734 if (nd6if->basereachable && /* already initialized */
1735 (nd6if->recalctm -= ND6_SLOWTIMER_INTERVAL) <= 0) {
1737 * Since reachable time rarely changes by router
1738 * advertisements, we SHOULD insure that a new random
1739 * value gets recomputed at least once every few hours.
1742 nd6if->recalctm = V_nd6_recalc_reachtm_interval;
1743 nd6if->reachable = ND_COMPUTE_RTIME(nd6if->basereachable);
1746 IFNET_RUNLOCK_NOSLEEP();
1751 nd6_output(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *m0,
1752 struct sockaddr_in6 *dst, struct rtentry *rt0)
1755 return (nd6_output_lle(ifp, origifp, m0, dst, rt0, NULL, NULL));
1760 * Note that I'm not enforcing any global serialization
1761 * lle state or asked changes here as the logic is too
1762 * complicated to avoid having to always acquire an exclusive
1767 #define senderr(e) { error = (e); goto bad;}
1770 nd6_output_lle(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *m0,
1771 struct sockaddr_in6 *dst, struct rtentry *rt0, struct llentry *lle,
1772 struct mbuf **chain)
1774 struct mbuf *m = m0;
1775 struct llentry *ln = lle;
1782 LLE_WLOCK_ASSERT(lle);
1784 KASSERT(chain != NULL, (" lle locked but no mbuf chain pointer passed"));
1787 if (IN6_IS_ADDR_MULTICAST(&dst->sin6_addr))
1790 if (nd6_need_cache(ifp) == 0)
1794 * next hop determination. This routine is derived from ether_output.
1798 * Address resolution or Neighbor Unreachability Detection
1800 * At this point, the destination of the packet must be a unicast
1801 * or an anycast address(i.e. not a multicast).
1804 flags = ((m != NULL) || (lle != NULL)) ? LLE_EXCLUSIVE : 0;
1807 IF_AFDATA_LOCK(ifp);
1808 ln = lla_lookup(LLTABLE6(ifp), flags, (struct sockaddr *)dst);
1809 IF_AFDATA_UNLOCK(ifp);
1810 if ((ln == NULL) && nd6_is_addr_neighbor(dst, ifp)) {
1812 * Since nd6_is_addr_neighbor() internally calls nd6_lookup(),
1813 * the condition below is not very efficient. But we believe
1814 * it is tolerable, because this should be a rare case.
1816 flags = ND6_CREATE | (m ? ND6_EXCLUSIVE : 0);
1817 IF_AFDATA_LOCK(ifp);
1818 ln = nd6_lookup(&dst->sin6_addr, flags, ifp);
1819 IF_AFDATA_UNLOCK(ifp);
1823 if ((ifp->if_flags & IFF_POINTOPOINT) == 0 &&
1824 !(ND_IFINFO(ifp)->flags & ND6_IFF_PERFORMNUD)) {
1825 char ip6buf[INET6_ADDRSTRLEN];
1827 "nd6_output: can't allocate llinfo for %s "
1829 ip6_sprintf(ip6buf, &dst->sin6_addr), ln);
1830 senderr(EIO); /* XXX: good error? */
1832 goto sendpkt; /* send anyway */
1835 /* We don't have to do link-layer address resolution on a p2p link. */
1836 if ((ifp->if_flags & IFF_POINTOPOINT) != 0 &&
1837 ln->ln_state < ND6_LLINFO_REACHABLE) {
1838 if ((flags & LLE_EXCLUSIVE) == 0) {
1839 flags |= LLE_EXCLUSIVE;
1842 ln->ln_state = ND6_LLINFO_STALE;
1843 nd6_llinfo_settimer_locked(ln, (long)V_nd6_gctimer * hz);
1847 * The first time we send a packet to a neighbor whose entry is
1848 * STALE, we have to change the state to DELAY and a sets a timer to
1849 * expire in DELAY_FIRST_PROBE_TIME seconds to ensure do
1850 * neighbor unreachability detection on expiration.
1853 if (ln->ln_state == ND6_LLINFO_STALE) {
1854 if ((flags & LLE_EXCLUSIVE) == 0) {
1855 flags |= LLE_EXCLUSIVE;
1860 ln->ln_state = ND6_LLINFO_DELAY;
1861 nd6_llinfo_settimer_locked(ln, (long)V_nd6_delay * hz);
1865 * If the neighbor cache entry has a state other than INCOMPLETE
1866 * (i.e. its link-layer address is already resolved), just
1869 if (ln->ln_state > ND6_LLINFO_INCOMPLETE)
1873 * There is a neighbor cache entry, but no ethernet address
1874 * response yet. Append this latest packet to the end of the
1875 * packet queue in the mbuf, unless the number of the packet
1876 * does not exceed nd6_maxqueuelen. When it exceeds nd6_maxqueuelen,
1877 * the oldest packet in the queue will be removed.
1879 if (ln->ln_state == ND6_LLINFO_NOSTATE)
1880 ln->ln_state = ND6_LLINFO_INCOMPLETE;
1882 if ((flags & LLE_EXCLUSIVE) == 0) {
1883 flags |= LLE_EXCLUSIVE;
1888 struct mbuf *m_hold;
1892 for (m_hold = ln->la_hold; m_hold; m_hold = m_hold->m_nextpkt) {
1894 if (m_hold->m_nextpkt == NULL) {
1895 m_hold->m_nextpkt = m;
1899 while (i >= V_nd6_maxqueuelen) {
1900 m_hold = ln->la_hold;
1901 ln->la_hold = ln->la_hold->m_nextpkt;
1909 * We did the lookup (no lle arg) so we
1910 * need to do the unlock here
1913 if (flags & LLE_EXCLUSIVE)
1920 * If there has been no NS for the neighbor after entering the
1921 * INCOMPLETE state, send the first solicitation.
1923 if (!ND6_LLINFO_PERMANENT(ln) && ln->la_asked == 0) {
1926 nd6_llinfo_settimer(ln,
1927 (long)ND_IFINFO(ifp)->retrans * hz / 1000);
1928 nd6_ns_output(ifp, NULL, &dst->sin6_addr, ln, 0);
1933 /* discard the packet if IPv6 operation is disabled on the interface */
1934 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED)) {
1935 error = ENETDOWN; /* better error? */
1939 * ln is valid and the caller did not pass in
1942 if ((ln != NULL) && (lle == NULL)) {
1943 if (flags & LLE_EXCLUSIVE)
1950 mac_netinet6_nd6_send(ifp, m);
1953 * We were passed in a pointer to an lle with the lock held
1954 * this means that we can't call if_output as we will
1955 * recurse on the lle lock - so what we do is we create
1956 * a list of mbufs to send and transmit them in the caller
1957 * after the lock is dropped
1963 struct mbuf *m = *chain;
1966 * append mbuf to end of deferred chain
1968 while (m->m_nextpkt != NULL)
1974 if ((ifp->if_flags & IFF_LOOPBACK) != 0) {
1975 return ((*ifp->if_output)(origifp, m, (struct sockaddr *)dst,
1978 error = (*ifp->if_output)(ifp, m, (struct sockaddr *)dst, NULL);
1983 * ln is valid and the caller did not pass in
1986 if ((ln != NULL) && (lle == NULL)) {
1987 if (flags & LLE_EXCLUSIVE)
2000 nd6_output_flush(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *chain,
2001 struct sockaddr_in6 *dst, struct route *ro)
2003 struct mbuf *m, *m_head;
2004 struct ifnet *outifp;
2008 if ((ifp->if_flags & IFF_LOOPBACK) != 0)
2015 m_head = m_head->m_nextpkt;
2016 error = (*ifp->if_output)(ifp, m, (struct sockaddr *)dst, ro);
2021 * note that intermediate errors are blindly ignored - but this is
2022 * the same convention as used with nd6_output when called by
2030 nd6_need_cache(struct ifnet *ifp)
2033 * XXX: we currently do not make neighbor cache on any interface
2034 * other than ARCnet, Ethernet, FDDI and GIF.
2037 * - unidirectional tunnels needs no ND
2039 switch (ifp->if_type) {
2047 #ifdef IFT_IEEE80211
2053 case IFT_GIF: /* XXX need more cases? */
2057 case IFT_PROPVIRTUAL:
2065 * the callers of this function need to be re-worked to drop
2066 * the lle lock, drop here for now
2069 nd6_storelladdr(struct ifnet *ifp, struct mbuf *m,
2070 struct sockaddr *dst, u_char *desten, struct llentry **lle)
2075 IF_AFDATA_UNLOCK_ASSERT(ifp);
2076 if (m->m_flags & M_MCAST) {
2079 switch (ifp->if_type) {
2085 #ifdef IFT_IEEE80211
2090 ETHER_MAP_IPV6_MULTICAST(&SIN6(dst)->sin6_addr,
2095 * netbsd can use if_broadcastaddr, but we don't do so
2096 * to reduce # of ifdef.
2098 for (i = 0; i < ifp->if_addrlen; i++)
2106 return (EAFNOSUPPORT);
2112 * the entry should have been created in nd6_store_lladdr
2114 IF_AFDATA_LOCK(ifp);
2115 ln = lla_lookup(LLTABLE6(ifp), 0, dst);
2116 IF_AFDATA_UNLOCK(ifp);
2117 if ((ln == NULL) || !(ln->la_flags & LLE_VALID)) {
2120 /* this could happen, if we could not allocate memory */
2125 bcopy(&ln->ll_addr, desten, ifp->if_addrlen);
2129 * A *small* use after free race exists here
2135 clear_llinfo_pqueue(struct llentry *ln)
2137 struct mbuf *m_hold, *m_hold_next;
2139 for (m_hold = ln->la_hold; m_hold; m_hold = m_hold_next) {
2140 m_hold_next = m_hold->m_nextpkt;
2141 m_hold->m_nextpkt = NULL;
2149 static int nd6_sysctl_drlist(SYSCTL_HANDLER_ARGS);
2150 static int nd6_sysctl_prlist(SYSCTL_HANDLER_ARGS);
2152 SYSCTL_DECL(_net_inet6_icmp6);
2154 SYSCTL_NODE(_net_inet6_icmp6, ICMPV6CTL_ND6_DRLIST, nd6_drlist,
2155 CTLFLAG_RD, nd6_sysctl_drlist, "");
2156 SYSCTL_NODE(_net_inet6_icmp6, ICMPV6CTL_ND6_PRLIST, nd6_prlist,
2157 CTLFLAG_RD, nd6_sysctl_prlist, "");
2158 SYSCTL_VNET_INT(_net_inet6_icmp6, ICMPV6CTL_ND6_MAXQLEN, nd6_maxqueuelen,
2159 CTLFLAG_RW, &VNET_NAME(nd6_maxqueuelen), 1, "");
2162 nd6_sysctl_drlist(SYSCTL_HANDLER_ARGS)
2165 char buf[1024] __aligned(4);
2166 struct in6_defrouter *d, *de;
2167 struct nd_defrouter *dr;
2173 for (dr = TAILQ_FIRST(&V_nd_defrouter); dr;
2174 dr = TAILQ_NEXT(dr, dr_entry)) {
2175 d = (struct in6_defrouter *)buf;
2176 de = (struct in6_defrouter *)(buf + sizeof(buf));
2179 bzero(d, sizeof(*d));
2180 d->rtaddr.sin6_family = AF_INET6;
2181 d->rtaddr.sin6_len = sizeof(d->rtaddr);
2182 d->rtaddr.sin6_addr = dr->rtaddr;
2183 error = sa6_recoverscope(&d->rtaddr);
2186 d->flags = dr->flags;
2187 d->rtlifetime = dr->rtlifetime;
2188 d->expire = dr->expire;
2189 d->if_index = dr->ifp->if_index;
2191 panic("buffer too short");
2193 error = SYSCTL_OUT(req, buf, sizeof(*d));
2202 nd6_sysctl_prlist(SYSCTL_HANDLER_ARGS)
2205 char buf[1024] __aligned(4);
2206 struct in6_prefix *p, *pe;
2207 struct nd_prefix *pr;
2208 char ip6buf[INET6_ADDRSTRLEN];
2214 for (pr = V_nd_prefix.lh_first; pr; pr = pr->ndpr_next) {
2217 struct sockaddr_in6 *sin6, *s6;
2218 struct nd_pfxrouter *pfr;
2220 p = (struct in6_prefix *)buf;
2221 pe = (struct in6_prefix *)(buf + sizeof(buf));
2224 bzero(p, sizeof(*p));
2225 sin6 = (struct sockaddr_in6 *)(p + 1);
2227 p->prefix = pr->ndpr_prefix;
2228 if (sa6_recoverscope(&p->prefix)) {
2230 "scope error in prefix list (%s)\n",
2231 ip6_sprintf(ip6buf, &p->prefix.sin6_addr));
2232 /* XXX: press on... */
2234 p->raflags = pr->ndpr_raf;
2235 p->prefixlen = pr->ndpr_plen;
2236 p->vltime = pr->ndpr_vltime;
2237 p->pltime = pr->ndpr_pltime;
2238 p->if_index = pr->ndpr_ifp->if_index;
2239 if (pr->ndpr_vltime == ND6_INFINITE_LIFETIME)
2244 /* XXX: we assume time_t is signed. */
2247 ((sizeof(maxexpire) * 8) - 1));
2248 if (pr->ndpr_vltime <
2249 maxexpire - pr->ndpr_lastupdate) {
2250 p->expire = pr->ndpr_lastupdate +
2253 p->expire = maxexpire;
2255 p->refcnt = pr->ndpr_refcnt;
2256 p->flags = pr->ndpr_stateflags;
2257 p->origin = PR_ORIG_RA;
2259 for (pfr = pr->ndpr_advrtrs.lh_first; pfr;
2260 pfr = pfr->pfr_next) {
2261 if ((void *)&sin6[advrtrs + 1] > (void *)pe) {
2265 s6 = &sin6[advrtrs];
2266 bzero(s6, sizeof(*s6));
2267 s6->sin6_family = AF_INET6;
2268 s6->sin6_len = sizeof(*sin6);
2269 s6->sin6_addr = pfr->router->rtaddr;
2270 if (sa6_recoverscope(s6)) {
2273 "prefix list (%s)\n",
2275 &pfr->router->rtaddr));
2279 p->advrtrs = advrtrs;
2281 panic("buffer too short");
2283 advance = sizeof(*p) + sizeof(*sin6) * advrtrs;
2284 error = SYSCTL_OUT(req, buf, advance);