2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the project nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * $KAME: nd6.c,v 1.144 2001/05/24 07:44:00 itojun Exp $
34 #include <sys/cdefs.h>
35 __FBSDID("$FreeBSD$");
38 #include "opt_inet6.h"
40 #include <sys/param.h>
41 #include <sys/systm.h>
42 #include <sys/callout.h>
44 #include <sys/malloc.h>
46 #include <sys/mutex.h>
47 #include <sys/socket.h>
48 #include <sys/sockio.h>
50 #include <sys/kernel.h>
51 #include <sys/protosw.h>
52 #include <sys/errno.h>
53 #include <sys/syslog.h>
54 #include <sys/rwlock.h>
55 #include <sys/queue.h>
57 #include <sys/sysctl.h>
60 #include <net/if_var.h>
61 #include <net/if_arc.h>
62 #include <net/if_dl.h>
63 #include <net/if_types.h>
64 #include <net/route.h>
67 #include <netinet/in.h>
68 #include <netinet/in_kdtrace.h>
69 #include <net/if_llatbl.h>
70 #include <netinet/if_ether.h>
71 #include <netinet6/in6_var.h>
72 #include <netinet/ip6.h>
73 #include <netinet6/ip6_var.h>
74 #include <netinet6/scope6_var.h>
75 #include <netinet6/nd6.h>
76 #include <netinet6/in6_ifattach.h>
77 #include <netinet/icmp6.h>
78 #include <netinet6/send.h>
80 #include <sys/limits.h>
82 #include <security/mac/mac_framework.h>
84 #define ND6_SLOWTIMER_INTERVAL (60 * 60) /* 1 hour */
85 #define ND6_RECALC_REACHTM_INTERVAL (60 * 120) /* 2 hours */
87 #define SIN6(s) ((const struct sockaddr_in6 *)(s))
89 MALLOC_DEFINE(M_IP6NDP, "ip6ndp", "IPv6 Neighbor Discovery");
92 VNET_DEFINE(int, nd6_prune) = 1; /* walk list every 1 seconds */
93 VNET_DEFINE(int, nd6_delay) = 5; /* delay first probe time 5 second */
94 VNET_DEFINE(int, nd6_umaxtries) = 3; /* maximum unicast query */
95 VNET_DEFINE(int, nd6_mmaxtries) = 3; /* maximum multicast query */
96 VNET_DEFINE(int, nd6_useloopback) = 1; /* use loopback interface for
98 VNET_DEFINE(int, nd6_gctimer) = (60 * 60 * 24); /* 1 day: garbage
101 /* preventing too many loops in ND option parsing */
102 static VNET_DEFINE(int, nd6_maxndopt) = 10; /* max # of ND options allowed */
104 VNET_DEFINE(int, nd6_maxnudhint) = 0; /* max # of subsequent upper
106 static VNET_DEFINE(int, nd6_maxqueuelen) = 1; /* max pkts cached in unresolved
108 #define V_nd6_maxndopt VNET(nd6_maxndopt)
109 #define V_nd6_maxqueuelen VNET(nd6_maxqueuelen)
112 VNET_DEFINE(int, nd6_debug) = 1;
114 VNET_DEFINE(int, nd6_debug) = 0;
117 static eventhandler_tag lle_event_eh, iflladdr_event_eh;
119 VNET_DEFINE(struct nd_drhead, nd_defrouter);
120 VNET_DEFINE(struct nd_prhead, nd_prefix);
121 VNET_DEFINE(struct rwlock, nd6_lock);
122 VNET_DEFINE(uint64_t, nd6_list_genid);
123 VNET_DEFINE(struct mtx, nd6_onlink_mtx);
125 VNET_DEFINE(int, nd6_recalc_reachtm_interval) = ND6_RECALC_REACHTM_INTERVAL;
126 #define V_nd6_recalc_reachtm_interval VNET(nd6_recalc_reachtm_interval)
128 int (*send_sendso_input_hook)(struct mbuf *, struct ifnet *, int, int);
130 static int nd6_is_new_addr_neighbor(const struct sockaddr_in6 *,
132 static void nd6_setmtu0(struct ifnet *, struct nd_ifinfo *);
133 static void nd6_slowtimo(void *);
134 static int regen_tmpaddr(struct in6_ifaddr *);
135 static void nd6_free(struct llentry **, int);
136 static void nd6_free_redirect(const struct llentry *);
137 static void nd6_llinfo_timer(void *);
138 static void nd6_llinfo_settimer_locked(struct llentry *, long);
139 static void clear_llinfo_pqueue(struct llentry *);
140 static void nd6_rtrequest(int, struct rtentry *, struct rt_addrinfo *);
141 static int nd6_resolve_slow(struct ifnet *, int, struct mbuf *,
142 const struct sockaddr_in6 *, u_char *, uint32_t *, struct llentry **);
143 static int nd6_need_cache(struct ifnet *);
146 static VNET_DEFINE(struct callout, nd6_slowtimo_ch);
147 #define V_nd6_slowtimo_ch VNET(nd6_slowtimo_ch)
149 VNET_DEFINE(struct callout, nd6_timer_ch);
150 #define V_nd6_timer_ch VNET(nd6_timer_ch)
153 nd6_lle_event(void *arg __unused, struct llentry *lle, int evt)
155 struct rt_addrinfo rtinfo;
156 struct sockaddr_in6 dst;
157 struct sockaddr_dl gw;
162 LLE_WLOCK_ASSERT(lle);
164 if (lltable_get_af(lle->lle_tbl) != AF_INET6)
168 case LLENTRY_RESOLVED:
170 KASSERT(lle->la_flags & LLE_VALID,
171 ("%s: %p resolved but not valid?", __func__, lle));
173 case LLENTRY_EXPIRED:
180 ifp = lltable_get_ifp(lle->lle_tbl);
182 bzero(&dst, sizeof(dst));
183 bzero(&gw, sizeof(gw));
184 bzero(&rtinfo, sizeof(rtinfo));
185 lltable_fill_sa_entry(lle, (struct sockaddr *)&dst);
186 dst.sin6_scope_id = in6_getscopezone(ifp,
187 in6_addrscope(&dst.sin6_addr));
188 gw.sdl_len = sizeof(struct sockaddr_dl);
189 gw.sdl_family = AF_LINK;
190 gw.sdl_alen = ifp->if_addrlen;
191 gw.sdl_index = ifp->if_index;
192 gw.sdl_type = ifp->if_type;
193 if (evt == LLENTRY_RESOLVED)
194 bcopy(lle->ll_addr, gw.sdl_data, ifp->if_addrlen);
195 rtinfo.rti_info[RTAX_DST] = (struct sockaddr *)&dst;
196 rtinfo.rti_info[RTAX_GATEWAY] = (struct sockaddr *)&gw;
197 rtinfo.rti_addrs = RTA_DST | RTA_GATEWAY;
198 fibnum = V_rt_add_addr_allfibs ? RT_ALL_FIBS : ifp->if_fib;
199 rt_missmsg_fib(type, &rtinfo, RTF_HOST | RTF_LLDATA | (
200 type == RTM_ADD ? RTF_UP: 0), 0, fibnum);
204 * A handler for interface link layer address change event.
207 nd6_iflladdr(void *arg __unused, struct ifnet *ifp)
210 lltable_update_ifaddr(LLTABLE6(ifp));
217 mtx_init(&V_nd6_onlink_mtx, "nd6 onlink", NULL, MTX_DEF);
218 rw_init(&V_nd6_lock, "nd6 list");
220 LIST_INIT(&V_nd_prefix);
221 TAILQ_INIT(&V_nd_defrouter);
224 callout_init(&V_nd6_slowtimo_ch, 0);
225 callout_reset(&V_nd6_slowtimo_ch, ND6_SLOWTIMER_INTERVAL * hz,
226 nd6_slowtimo, curvnet);
228 callout_init(&V_nd6_timer_ch, 0);
229 callout_reset(&V_nd6_timer_ch, hz, nd6_timer, curvnet);
232 if (IS_DEFAULT_VNET(curvnet)) {
233 lle_event_eh = EVENTHANDLER_REGISTER(lle_event, nd6_lle_event,
234 NULL, EVENTHANDLER_PRI_ANY);
235 iflladdr_event_eh = EVENTHANDLER_REGISTER(iflladdr_event,
236 nd6_iflladdr, NULL, EVENTHANDLER_PRI_ANY);
245 callout_drain(&V_nd6_slowtimo_ch);
246 callout_drain(&V_nd6_timer_ch);
247 if (IS_DEFAULT_VNET(curvnet)) {
248 EVENTHANDLER_DEREGISTER(lle_event, lle_event_eh);
249 EVENTHANDLER_DEREGISTER(iflladdr_event, iflladdr_event_eh);
251 rw_destroy(&V_nd6_lock);
252 mtx_destroy(&V_nd6_onlink_mtx);
257 nd6_ifattach(struct ifnet *ifp)
259 struct nd_ifinfo *nd;
261 nd = malloc(sizeof(*nd), M_IP6NDP, M_WAITOK | M_ZERO);
264 nd->chlim = IPV6_DEFHLIM;
265 nd->basereachable = REACHABLE_TIME;
266 nd->reachable = ND_COMPUTE_RTIME(nd->basereachable);
267 nd->retrans = RETRANS_TIMER;
269 nd->flags = ND6_IFF_PERFORMNUD;
271 /* A loopback interface always has ND6_IFF_AUTO_LINKLOCAL.
272 * XXXHRS: Clear ND6_IFF_AUTO_LINKLOCAL on an IFT_BRIDGE interface by
273 * default regardless of the V_ip6_auto_linklocal configuration to
274 * give a reasonable default behavior.
276 if ((V_ip6_auto_linklocal && ifp->if_type != IFT_BRIDGE) ||
277 (ifp->if_flags & IFF_LOOPBACK))
278 nd->flags |= ND6_IFF_AUTO_LINKLOCAL;
280 * A loopback interface does not need to accept RTADV.
281 * XXXHRS: Clear ND6_IFF_ACCEPT_RTADV on an IFT_BRIDGE interface by
282 * default regardless of the V_ip6_accept_rtadv configuration to
283 * prevent the interface from accepting RA messages arrived
284 * on one of the member interfaces with ND6_IFF_ACCEPT_RTADV.
286 if (V_ip6_accept_rtadv &&
287 !(ifp->if_flags & IFF_LOOPBACK) &&
288 (ifp->if_type != IFT_BRIDGE))
289 nd->flags |= ND6_IFF_ACCEPT_RTADV;
290 if (V_ip6_no_radr && !(ifp->if_flags & IFF_LOOPBACK))
291 nd->flags |= ND6_IFF_NO_RADR;
293 /* XXX: we cannot call nd6_setmtu since ifp is not fully initialized */
294 nd6_setmtu0(ifp, nd);
300 nd6_ifdetach(struct ifnet *ifp, struct nd_ifinfo *nd)
302 struct ifaddr *ifa, *next;
305 TAILQ_FOREACH_SAFE(ifa, &ifp->if_addrhead, ifa_link, next) {
306 if (ifa->ifa_addr->sa_family != AF_INET6)
309 /* stop DAD processing */
312 IF_ADDR_RUNLOCK(ifp);
318 * Reset ND level link MTU. This function is called when the physical MTU
319 * changes, which means we might have to adjust the ND level MTU.
322 nd6_setmtu(struct ifnet *ifp)
324 if (ifp->if_afdata[AF_INET6] == NULL)
327 nd6_setmtu0(ifp, ND_IFINFO(ifp));
330 /* XXX todo: do not maintain copy of ifp->if_mtu in ndi->maxmtu */
332 nd6_setmtu0(struct ifnet *ifp, struct nd_ifinfo *ndi)
336 omaxmtu = ndi->maxmtu;
338 switch (ifp->if_type) {
340 ndi->maxmtu = MIN(ARC_PHDS_MAXMTU, ifp->if_mtu); /* RFC2497 */
343 ndi->maxmtu = ifp->if_mtu;
348 * Decreasing the interface MTU under IPV6 minimum MTU may cause
349 * undesirable situation. We thus notify the operator of the change
350 * explicitly. The check for omaxmtu is necessary to restrict the
351 * log to the case of changing the MTU, not initializing it.
353 if (omaxmtu >= IPV6_MMTU && ndi->maxmtu < IPV6_MMTU) {
354 log(LOG_NOTICE, "nd6_setmtu0: "
355 "new link MTU on %s (%lu) is too small for IPv6\n",
356 if_name(ifp), (unsigned long)ndi->maxmtu);
359 if (ndi->maxmtu > V_in6_maxmtu)
360 in6_setmaxmtu(); /* check all interfaces just in case */
365 nd6_option_init(void *opt, int icmp6len, union nd_opts *ndopts)
368 bzero(ndopts, sizeof(*ndopts));
369 ndopts->nd_opts_search = (struct nd_opt_hdr *)opt;
371 = (struct nd_opt_hdr *)(((u_char *)opt) + icmp6len);
374 ndopts->nd_opts_done = 1;
375 ndopts->nd_opts_search = NULL;
380 * Take one ND option.
383 nd6_option(union nd_opts *ndopts)
385 struct nd_opt_hdr *nd_opt;
388 KASSERT(ndopts != NULL, ("%s: ndopts == NULL", __func__));
389 KASSERT(ndopts->nd_opts_last != NULL, ("%s: uninitialized ndopts",
391 if (ndopts->nd_opts_search == NULL)
393 if (ndopts->nd_opts_done)
396 nd_opt = ndopts->nd_opts_search;
398 /* make sure nd_opt_len is inside the buffer */
399 if ((caddr_t)&nd_opt->nd_opt_len >= (caddr_t)ndopts->nd_opts_last) {
400 bzero(ndopts, sizeof(*ndopts));
404 olen = nd_opt->nd_opt_len << 3;
407 * Message validation requires that all included
408 * options have a length that is greater than zero.
410 bzero(ndopts, sizeof(*ndopts));
414 ndopts->nd_opts_search = (struct nd_opt_hdr *)((caddr_t)nd_opt + olen);
415 if (ndopts->nd_opts_search > ndopts->nd_opts_last) {
416 /* option overruns the end of buffer, invalid */
417 bzero(ndopts, sizeof(*ndopts));
419 } else if (ndopts->nd_opts_search == ndopts->nd_opts_last) {
420 /* reached the end of options chain */
421 ndopts->nd_opts_done = 1;
422 ndopts->nd_opts_search = NULL;
428 * Parse multiple ND options.
429 * This function is much easier to use, for ND routines that do not need
430 * multiple options of the same type.
433 nd6_options(union nd_opts *ndopts)
435 struct nd_opt_hdr *nd_opt;
438 KASSERT(ndopts != NULL, ("%s: ndopts == NULL", __func__));
439 KASSERT(ndopts->nd_opts_last != NULL, ("%s: uninitialized ndopts",
441 if (ndopts->nd_opts_search == NULL)
445 nd_opt = nd6_option(ndopts);
446 if (nd_opt == NULL && ndopts->nd_opts_last == NULL) {
448 * Message validation requires that all included
449 * options have a length that is greater than zero.
451 ICMP6STAT_INC(icp6s_nd_badopt);
452 bzero(ndopts, sizeof(*ndopts));
459 switch (nd_opt->nd_opt_type) {
460 case ND_OPT_SOURCE_LINKADDR:
461 case ND_OPT_TARGET_LINKADDR:
463 case ND_OPT_REDIRECTED_HEADER:
465 if (ndopts->nd_opt_array[nd_opt->nd_opt_type]) {
467 "duplicated ND6 option found (type=%d)\n",
468 nd_opt->nd_opt_type));
471 ndopts->nd_opt_array[nd_opt->nd_opt_type]
475 case ND_OPT_PREFIX_INFORMATION:
476 if (ndopts->nd_opt_array[nd_opt->nd_opt_type] == 0) {
477 ndopts->nd_opt_array[nd_opt->nd_opt_type]
480 ndopts->nd_opts_pi_end =
481 (struct nd_opt_prefix_info *)nd_opt;
483 /* What about ND_OPT_ROUTE_INFO? RFC 4191 */
484 case ND_OPT_RDNSS: /* RFC 6106 */
485 case ND_OPT_DNSSL: /* RFC 6106 */
487 * Silently ignore options we know and do not care about
493 * Unknown options must be silently ignored,
494 * to accommodate future extension to the protocol.
497 "nd6_options: unsupported option %d - "
498 "option ignored\n", nd_opt->nd_opt_type));
503 if (i > V_nd6_maxndopt) {
504 ICMP6STAT_INC(icp6s_nd_toomanyopt);
505 nd6log((LOG_INFO, "too many loop in nd opt\n"));
509 if (ndopts->nd_opts_done)
517 * ND6 timer routine to handle ND6 entries
520 nd6_llinfo_settimer_locked(struct llentry *ln, long tick)
524 LLE_WLOCK_ASSERT(ln);
529 canceled = callout_stop(&ln->lle_timer);
531 ln->la_expire = time_uptime + tick / hz;
533 if (tick > INT_MAX) {
534 ln->ln_ntick = tick - INT_MAX;
535 canceled = callout_reset(&ln->lle_timer, INT_MAX,
536 nd6_llinfo_timer, ln);
539 canceled = callout_reset(&ln->lle_timer, tick,
540 nd6_llinfo_timer, ln);
548 * Gets source address of the first packet in hold queue
549 * and stores it in @src.
550 * Returns pointer to @src (if hold queue is not empty) or NULL.
552 * Set noinline to be dtrace-friendly
554 static __noinline struct in6_addr *
555 nd6_llinfo_get_holdsrc(struct llentry *ln, struct in6_addr *src)
560 if (ln->la_hold == NULL)
564 * assume every packet in la_hold has the same IP header
567 if (sizeof(hdr) > m->m_len)
570 m_copydata(m, 0, sizeof(hdr), (caddr_t)&hdr);
577 * Checks if we need to switch from STALE state.
579 * RFC 4861 requires switching from STALE to DELAY state
580 * on first packet matching entry, waiting V_nd6_delay and
581 * transition to PROBE state (if upper layer confirmation was
584 * This code performs a bit differently:
585 * On packet hit we don't change state (but desired state
586 * can be guessed by control plane). However, after V_nd6_delay
587 * seconds code will transition to PROBE state (so DELAY state
588 * is kinda skipped in most situations).
590 * Typically, V_nd6_gctimer is bigger than V_nd6_delay, so
591 * we perform the following upon entering STALE state:
593 * 1) Arm timer to run each V_nd6_delay seconds to make sure that
594 * if packet was transmitted at the start of given interval, we
595 * would be able to switch to PROBE state in V_nd6_delay seconds
598 * 2) Reschedule timer until original V_nd6_gctimer expires keeping
599 * lle in STALE state (remaining timer value stored in lle_remtime).
601 * 3) Reschedule timer if packet was transmitted less that V_nd6_delay
604 * Returns non-zero value if the entry is still STALE (storing
605 * the next timer interval in @pdelay).
607 * Returns zero value if original timer expired or we need to switch to
608 * PROBE (store that in @do_switch variable).
611 nd6_is_stale(struct llentry *lle, long *pdelay, int *do_switch)
613 int nd_delay, nd_gctimer, r_skip_req;
618 nd_gctimer = V_nd6_gctimer;
619 nd_delay = V_nd6_delay;
622 r_skip_req = lle->r_skip_req;
623 lle_hittime = lle->lle_hittime;
626 if (r_skip_req > 0) {
629 * Nonzero r_skip_req value was set upon entering
630 * STALE state. Since value was not changed, no
631 * packets were passed using this lle. Ask for
632 * timer reschedule and keep STALE state.
634 delay = (long)(MIN(nd_gctimer, nd_delay));
636 if (lle->lle_remtime > delay)
637 lle->lle_remtime -= delay;
639 delay = lle->lle_remtime;
640 lle->lle_remtime = 0;
646 * The original ng6_gctime timeout ended,
647 * no more rescheduling.
657 * Packet received. Verify timestamp
659 delay = (long)(time_uptime - lle_hittime);
660 if (delay < nd_delay) {
663 * V_nd6_delay still not passed since the first
664 * hit in STALE state.
665 * Reshedule timer and return.
667 *pdelay = (long)(nd_delay - delay) * hz;
671 /* Request switching to probe */
678 * Switch @lle state to new state optionally arming timers.
680 * Set noinline to be dtrace-friendly
683 nd6_llinfo_setstate(struct llentry *lle, int newstate)
686 int nd_gctimer, nd_delay;
693 case ND6_LLINFO_INCOMPLETE:
694 ifp = lle->lle_tbl->llt_ifp;
695 delay = (long)ND_IFINFO(ifp)->retrans * hz / 1000;
697 case ND6_LLINFO_REACHABLE:
698 if (!ND6_LLINFO_PERMANENT(lle)) {
699 ifp = lle->lle_tbl->llt_ifp;
700 delay = (long)ND_IFINFO(ifp)->reachable * hz;
703 case ND6_LLINFO_STALE:
706 * Notify fast path that we want to know if any packet
707 * is transmitted by setting r_skip_req.
712 nd_delay = V_nd6_delay;
713 nd_gctimer = V_nd6_gctimer;
715 delay = (long)(MIN(nd_gctimer, nd_delay)) * hz;
716 remtime = (long)nd_gctimer * hz - delay;
718 case ND6_LLINFO_DELAY:
720 delay = (long)V_nd6_delay * hz;
725 nd6_llinfo_settimer_locked(lle, delay);
727 lle->lle_remtime = remtime;
728 lle->ln_state = newstate;
732 * Timer-dependent part of nd state machine.
734 * Set noinline to be dtrace-friendly
736 static __noinline void
737 nd6_llinfo_timer(void *arg)
740 struct in6_addr *dst, *pdst, *psrc, src;
742 struct nd_ifinfo *ndi;
743 int do_switch, send_ns;
746 KASSERT(arg != NULL, ("%s: arg NULL", __func__));
747 ln = (struct llentry *)arg;
748 ifp = lltable_get_ifp(ln->lle_tbl);
749 CURVNET_SET(ifp->if_vnet);
753 if (callout_pending(&ln->lle_timer)) {
755 * Here we are a bit odd here in the treatment of
756 * active/pending. If the pending bit is set, it got
757 * rescheduled before I ran. The active
758 * bit we ignore, since if it was stopped
759 * in ll_tablefree() and was currently running
760 * it would have return 0 so the code would
761 * not have deleted it since the callout could
762 * not be stopped so we want to go through
763 * with the delete here now. If the callout
764 * was restarted, the pending bit will be back on and
765 * we just want to bail since the callout_reset would
766 * return 1 and our reference would have been removed
767 * by nd6_llinfo_settimer_locked above since canceled
775 ndi = ND_IFINFO(ifp);
777 dst = &ln->r_l3addr.addr6;
780 if (ln->ln_ntick > 0) {
781 if (ln->ln_ntick > INT_MAX) {
782 ln->ln_ntick -= INT_MAX;
783 nd6_llinfo_settimer_locked(ln, INT_MAX);
786 nd6_llinfo_settimer_locked(ln, ln->ln_ntick);
791 if (ln->la_flags & LLE_STATIC) {
795 if (ln->la_flags & LLE_DELETED) {
800 switch (ln->ln_state) {
801 case ND6_LLINFO_INCOMPLETE:
802 if (ln->la_asked < V_nd6_mmaxtries) {
805 /* Send NS to multicast address */
808 struct mbuf *m = ln->la_hold;
813 * assuming every packet in la_hold has the
814 * same IP header. Send error after unlock.
819 clear_llinfo_pqueue(ln);
823 icmp6_error2(m, ICMP6_DST_UNREACH,
824 ICMP6_DST_UNREACH_ADDR, 0, ifp);
827 case ND6_LLINFO_REACHABLE:
828 if (!ND6_LLINFO_PERMANENT(ln))
829 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE);
832 case ND6_LLINFO_STALE:
833 if (nd6_is_stale(ln, &delay, &do_switch) != 0) {
836 * No packet has used this entry and GC timeout
837 * has not been passed. Reshedule timer and
840 nd6_llinfo_settimer_locked(ln, delay);
844 if (do_switch == 0) {
847 * GC timer has ended and entry hasn't been used.
848 * Run Garbage collector (RFC 4861, 5.3)
850 if (!ND6_LLINFO_PERMANENT(ln))
855 /* Entry has been used AND delay timer has ended. */
859 case ND6_LLINFO_DELAY:
860 if (ndi && (ndi->flags & ND6_IFF_PERFORMNUD) != 0) {
863 nd6_llinfo_setstate(ln, ND6_LLINFO_PROBE);
866 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE); /* XXX */
868 case ND6_LLINFO_PROBE:
869 if (ln->la_asked < V_nd6_umaxtries) {
877 panic("%s: paths in a dark night can be confusing: %d",
878 __func__, ln->ln_state);
884 nd6_llinfo_settimer_locked(ln, (long)ndi->retrans * hz / 1000);
885 psrc = nd6_llinfo_get_holdsrc(ln, &src);
888 nd6_ns_output(ifp, psrc, pdst, dst, NULL);
898 * ND6 timer routine to expire default route list and prefix list
903 CURVNET_SET((struct vnet *) arg);
904 struct nd_drhead drq;
905 struct nd_prhead prl;
906 struct nd_defrouter *dr, *ndr;
907 struct nd_prefix *pr, *npr;
908 struct in6_ifaddr *ia6, *nia6;
915 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr)
916 if (dr->expire && dr->expire < time_uptime)
917 defrouter_unlink(dr, &drq);
920 while ((dr = TAILQ_FIRST(&drq)) != NULL) {
921 TAILQ_REMOVE(&drq, dr, dr_entry);
926 * expire interface addresses.
927 * in the past the loop was inside prefix expiry processing.
928 * However, from a stricter speci-confrmance standpoint, we should
929 * rather separate address lifetimes and prefix lifetimes.
931 * XXXRW: in6_ifaddrhead locking.
934 TAILQ_FOREACH_SAFE(ia6, &V_in6_ifaddrhead, ia_link, nia6) {
935 /* check address lifetime */
936 if (IFA6_IS_INVALID(ia6)) {
940 * If the expiring address is temporary, try
941 * regenerating a new one. This would be useful when
942 * we suspended a laptop PC, then turned it on after a
943 * period that could invalidate all temporary
944 * addresses. Although we may have to restart the
945 * loop (see below), it must be after purging the
946 * address. Otherwise, we'd see an infinite loop of
949 if (V_ip6_use_tempaddr &&
950 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0) {
951 if (regen_tmpaddr(ia6) == 0)
955 in6_purgeaddr(&ia6->ia_ifa);
958 goto addrloop; /* XXX: see below */
959 } else if (IFA6_IS_DEPRECATED(ia6)) {
960 int oldflags = ia6->ia6_flags;
962 ia6->ia6_flags |= IN6_IFF_DEPRECATED;
965 * If a temporary address has just become deprecated,
966 * regenerate a new one if possible.
968 if (V_ip6_use_tempaddr &&
969 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0 &&
970 (oldflags & IN6_IFF_DEPRECATED) == 0) {
972 if (regen_tmpaddr(ia6) == 0) {
974 * A new temporary address is
976 * XXX: this means the address chain
977 * has changed while we are still in
978 * the loop. Although the change
979 * would not cause disaster (because
980 * it's not a deletion, but an
981 * addition,) we'd rather restart the
982 * loop just for safety. Or does this
983 * significantly reduce performance??
988 } else if ((ia6->ia6_flags & IN6_IFF_TENTATIVE) != 0) {
990 * Schedule DAD for a tentative address. This happens
991 * if the interface was down or not running
992 * when the address was configured.
996 delay = arc4random() %
997 (MAX_RTR_SOLICITATION_DELAY * hz);
998 nd6_dad_start((struct ifaddr *)ia6, delay);
1001 * Check status of the interface. If it is down,
1002 * mark the address as tentative for future DAD.
1004 if ((ia6->ia_ifp->if_flags & IFF_UP) == 0 ||
1005 (ia6->ia_ifp->if_drv_flags & IFF_DRV_RUNNING)
1007 (ND_IFINFO(ia6->ia_ifp)->flags &
1008 ND6_IFF_IFDISABLED) != 0) {
1009 ia6->ia6_flags &= ~IN6_IFF_DUPLICATED;
1010 ia6->ia6_flags |= IN6_IFF_TENTATIVE;
1013 * A new RA might have made a deprecated address
1016 ia6->ia6_flags &= ~IN6_IFF_DEPRECATED;
1022 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, npr) {
1024 * Expire prefixes. Since the pltime is only used for
1025 * autoconfigured addresses, pltime processing for prefixes is
1028 * Only unlink after all derived addresses have expired. This
1029 * may not occur until two hours after the prefix has expired
1030 * per RFC 4862. If the prefix expires before its derived
1031 * addresses, mark it off-link. This will be done automatically
1032 * after unlinking if no address references remain.
1034 if (pr->ndpr_vltime == ND6_INFINITE_LIFETIME ||
1035 time_uptime - pr->ndpr_lastupdate <= pr->ndpr_vltime)
1038 if (pr->ndpr_addrcnt == 0) {
1039 nd6_prefix_unlink(pr, &prl);
1042 if ((pr->ndpr_stateflags & NDPRF_ONLINK) != 0) {
1043 genid = V_nd6_list_genid;
1047 (void)nd6_prefix_offlink(pr);
1048 ND6_ONLINK_UNLOCK();
1050 nd6_prefix_rele(pr);
1051 if (genid != V_nd6_list_genid)
1057 while ((pr = LIST_FIRST(&prl)) != NULL) {
1058 LIST_REMOVE(pr, ndpr_entry);
1062 callout_reset(&V_nd6_timer_ch, V_nd6_prune * hz,
1063 nd6_timer, curvnet);
1069 * ia6 - deprecated/invalidated temporary address
1072 regen_tmpaddr(struct in6_ifaddr *ia6)
1076 struct in6_ifaddr *public_ifa6 = NULL;
1078 ifp = ia6->ia_ifa.ifa_ifp;
1080 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1081 struct in6_ifaddr *it6;
1083 if (ifa->ifa_addr->sa_family != AF_INET6)
1086 it6 = (struct in6_ifaddr *)ifa;
1088 /* ignore no autoconf addresses. */
1089 if ((it6->ia6_flags & IN6_IFF_AUTOCONF) == 0)
1092 /* ignore autoconf addresses with different prefixes. */
1093 if (it6->ia6_ndpr == NULL || it6->ia6_ndpr != ia6->ia6_ndpr)
1097 * Now we are looking at an autoconf address with the same
1098 * prefix as ours. If the address is temporary and is still
1099 * preferred, do not create another one. It would be rare, but
1100 * could happen, for example, when we resume a laptop PC after
1103 if ((it6->ia6_flags & IN6_IFF_TEMPORARY) != 0 &&
1104 !IFA6_IS_DEPRECATED(it6)) {
1110 * This is a public autoconf address that has the same prefix
1111 * as ours. If it is preferred, keep it. We can't break the
1112 * loop here, because there may be a still-preferred temporary
1113 * address with the prefix.
1115 if (!IFA6_IS_DEPRECATED(it6))
1118 if (public_ifa6 != NULL)
1119 ifa_ref(&public_ifa6->ia_ifa);
1120 IF_ADDR_RUNLOCK(ifp);
1122 if (public_ifa6 != NULL) {
1125 if ((e = in6_tmpifadd(public_ifa6, 0, 0)) != 0) {
1126 ifa_free(&public_ifa6->ia_ifa);
1127 log(LOG_NOTICE, "regen_tmpaddr: failed to create a new"
1128 " tmp addr,errno=%d\n", e);
1131 ifa_free(&public_ifa6->ia_ifa);
1139 * Remove prefix and default router list entries corresponding to ifp. Neighbor
1140 * cache entries are freed in in6_domifdetach().
1143 nd6_purge(struct ifnet *ifp)
1145 struct nd_drhead drq;
1146 struct nd_prhead prl;
1147 struct nd_defrouter *dr, *ndr;
1148 struct nd_prefix *pr, *npr;
1154 * Nuke default router list entries toward ifp.
1155 * We defer removal of default router list entries that is installed
1156 * in the routing table, in order to keep additional side effects as
1157 * small as possible.
1160 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr) {
1164 defrouter_unlink(dr, &drq);
1166 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr) {
1170 defrouter_unlink(dr, &drq);
1174 * Remove prefixes on ifp. We should have already removed addresses on
1175 * this interface, so no addresses should be referencing these prefixes.
1177 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, npr) {
1178 if (pr->ndpr_ifp == ifp)
1179 nd6_prefix_unlink(pr, &prl);
1183 /* Delete the unlinked router and prefix objects. */
1184 while ((dr = TAILQ_FIRST(&drq)) != NULL) {
1185 TAILQ_REMOVE(&drq, dr, dr_entry);
1188 while ((pr = LIST_FIRST(&prl)) != NULL) {
1189 LIST_REMOVE(pr, ndpr_entry);
1193 /* cancel default outgoing interface setting */
1194 if (V_nd6_defifindex == ifp->if_index)
1195 nd6_setdefaultiface(0);
1197 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
1198 /* Refresh default router list. */
1199 defrouter_select_fib(ifp->if_fib);
1204 * the caller acquires and releases the lock on the lltbls
1205 * Returns the llentry locked
1208 nd6_lookup(const struct in6_addr *addr6, int flags, struct ifnet *ifp)
1210 struct sockaddr_in6 sin6;
1213 bzero(&sin6, sizeof(sin6));
1214 sin6.sin6_len = sizeof(struct sockaddr_in6);
1215 sin6.sin6_family = AF_INET6;
1216 sin6.sin6_addr = *addr6;
1218 IF_AFDATA_LOCK_ASSERT(ifp);
1220 ln = lla_lookup(LLTABLE6(ifp), flags, (struct sockaddr *)&sin6);
1226 nd6_alloc(const struct in6_addr *addr6, int flags, struct ifnet *ifp)
1228 struct sockaddr_in6 sin6;
1231 bzero(&sin6, sizeof(sin6));
1232 sin6.sin6_len = sizeof(struct sockaddr_in6);
1233 sin6.sin6_family = AF_INET6;
1234 sin6.sin6_addr = *addr6;
1236 ln = lltable_alloc_entry(LLTABLE6(ifp), 0, (struct sockaddr *)&sin6);
1238 ln->ln_state = ND6_LLINFO_NOSTATE;
1244 * Test whether a given IPv6 address is a neighbor or not, ignoring
1245 * the actual neighbor cache. The neighbor cache is ignored in order
1246 * to not reenter the routing code from within itself.
1249 nd6_is_new_addr_neighbor(const struct sockaddr_in6 *addr, struct ifnet *ifp)
1251 struct nd_prefix *pr;
1253 struct rt_addrinfo info;
1254 struct sockaddr_in6 rt_key;
1255 const struct sockaddr *dst6;
1260 * A link-local address is always a neighbor.
1261 * XXX: a link does not necessarily specify a single interface.
1263 if (IN6_IS_ADDR_LINKLOCAL(&addr->sin6_addr)) {
1264 struct sockaddr_in6 sin6_copy;
1268 * We need sin6_copy since sa6_recoverscope() may modify the
1272 if (sa6_recoverscope(&sin6_copy))
1273 return (0); /* XXX: should be impossible */
1274 if (in6_setscope(&sin6_copy.sin6_addr, ifp, &zone))
1276 if (sin6_copy.sin6_scope_id == zone)
1282 bzero(&rt_key, sizeof(rt_key));
1283 bzero(&info, sizeof(info));
1284 info.rti_info[RTAX_DST] = (struct sockaddr *)&rt_key;
1287 * If the address matches one of our addresses,
1288 * it should be a neighbor.
1289 * If the address matches one of our on-link prefixes, it should be a
1294 LIST_FOREACH(pr, &V_nd_prefix, ndpr_entry) {
1295 if (pr->ndpr_ifp != ifp)
1298 if ((pr->ndpr_stateflags & NDPRF_ONLINK) == 0) {
1299 dst6 = (const struct sockaddr *)&pr->ndpr_prefix;
1302 * We only need to check all FIBs if add_addr_allfibs
1303 * is unset. If set, checking any FIB will suffice.
1305 fibnum = V_rt_add_addr_allfibs ? rt_numfibs - 1 : 0;
1306 for (; fibnum < rt_numfibs; fibnum++) {
1307 genid = V_nd6_list_genid;
1311 * Restore length field before
1314 rt_key.sin6_len = sizeof(rt_key);
1315 error = rib_lookup_info(fibnum, dst6, 0, 0,
1319 if (genid != V_nd6_list_genid)
1328 * This is the case where multiple interfaces
1329 * have the same prefix, but only one is installed
1330 * into the routing table and that prefix entry
1331 * is not the one being examined here. In the case
1332 * where RADIX_MPATH is enabled, multiple route
1333 * entries (of the same rt_key value) will be
1334 * installed because the interface addresses all
1337 if (!IN6_ARE_ADDR_EQUAL(&pr->ndpr_prefix.sin6_addr,
1342 if (IN6_ARE_MASKED_ADDR_EQUAL(&pr->ndpr_prefix.sin6_addr,
1343 &addr->sin6_addr, &pr->ndpr_mask)) {
1351 * If the address is assigned on the node of the other side of
1352 * a p2p interface, the address should be a neighbor.
1354 if (ifp->if_flags & IFF_POINTOPOINT) {
1356 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1357 if (ifa->ifa_addr->sa_family != addr->sin6_family)
1359 if (ifa->ifa_dstaddr != NULL &&
1360 sa_equal(addr, ifa->ifa_dstaddr)) {
1361 IF_ADDR_RUNLOCK(ifp);
1365 IF_ADDR_RUNLOCK(ifp);
1369 * If the default router list is empty, all addresses are regarded
1370 * as on-link, and thus, as a neighbor.
1372 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV &&
1373 TAILQ_EMPTY(&V_nd_defrouter) &&
1374 V_nd6_defifindex == ifp->if_index) {
1383 * Detect if a given IPv6 address identifies a neighbor on a given link.
1384 * XXX: should take care of the destination of a p2p link?
1387 nd6_is_addr_neighbor(const struct sockaddr_in6 *addr, struct ifnet *ifp)
1389 struct llentry *lle;
1392 IF_AFDATA_UNLOCK_ASSERT(ifp);
1393 if (nd6_is_new_addr_neighbor(addr, ifp))
1397 * Even if the address matches none of our addresses, it might be
1398 * in the neighbor cache.
1400 IF_AFDATA_RLOCK(ifp);
1401 if ((lle = nd6_lookup(&addr->sin6_addr, 0, ifp)) != NULL) {
1405 IF_AFDATA_RUNLOCK(ifp);
1410 * Free an nd6 llinfo entry.
1411 * Since the function would cause significant changes in the kernel, DO NOT
1412 * make it global, unless you have a strong reason for the change, and are sure
1413 * that the change is safe.
1415 * Set noinline to be dtrace-friendly
1417 static __noinline void
1418 nd6_free(struct llentry **lnp, int gc)
1422 struct nd_defrouter *dr;
1427 LLE_WLOCK_ASSERT(ln);
1430 ifp = lltable_get_ifp(ln->lle_tbl);
1431 if ((ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) != 0)
1432 dr = defrouter_lookup_locked(&ln->r_l3addr.addr6, ifp);
1437 if ((ln->la_flags & LLE_DELETED) == 0)
1438 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_EXPIRED);
1441 * we used to have pfctlinput(PRC_HOSTDEAD) here.
1442 * even though it is not harmful, it was not really necessary.
1446 nd6_llinfo_settimer_locked(ln, -1);
1448 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
1449 if (dr != NULL && dr->expire &&
1450 ln->ln_state == ND6_LLINFO_STALE && gc) {
1452 * If the reason for the deletion is just garbage
1453 * collection, and the neighbor is an active default
1454 * router, do not delete it. Instead, reset the GC
1455 * timer using the router's lifetime.
1456 * Simply deleting the entry would affect default
1457 * router selection, which is not necessarily a good
1458 * thing, especially when we're using router preference
1460 * XXX: the check for ln_state would be redundant,
1461 * but we intentionally keep it just in case.
1463 if (dr->expire > time_uptime)
1464 nd6_llinfo_settimer_locked(ln,
1465 (dr->expire - time_uptime) * hz);
1467 nd6_llinfo_settimer_locked(ln,
1468 (long)V_nd6_gctimer * hz);
1478 * Unreachablity of a router might affect the default
1479 * router selection and on-link detection of advertised
1484 * Temporarily fake the state to choose a new default
1485 * router and to perform on-link determination of
1486 * prefixes correctly.
1487 * Below the state will be set correctly,
1488 * or the entry itself will be deleted.
1490 ln->ln_state = ND6_LLINFO_INCOMPLETE;
1493 if (ln->ln_router || dr) {
1496 * We need to unlock to avoid a LOR with rt6_flush() with the
1497 * rnh and for the calls to pfxlist_onlink_check() and
1498 * defrouter_select_fib() in the block further down for calls
1499 * into nd6_lookup(). We still hold a ref.
1504 * rt6_flush must be called whether or not the neighbor
1505 * is in the Default Router List.
1506 * See a corresponding comment in nd6_na_input().
1508 rt6_flush(&ln->r_l3addr.addr6, ifp);
1513 * Since defrouter_select_fib() does not affect the
1514 * on-link determination and MIP6 needs the check
1515 * before the default router selection, we perform
1518 pfxlist_onlink_check();
1521 * Refresh default router list.
1523 defrouter_select_fib(dr->ifp->if_fib);
1527 * If this entry was added by an on-link redirect, remove the
1528 * corresponding host route.
1530 if (ln->la_flags & LLE_REDIRECT)
1531 nd6_free_redirect(ln);
1533 if (ln->ln_router || dr)
1538 * Save to unlock. We still hold an extra reference and will not
1539 * free(9) in llentry_free() if someone else holds one as well.
1542 IF_AFDATA_LOCK(ifp);
1544 /* Guard against race with other llentry_free(). */
1545 if (ln->la_flags & LLE_LINKED) {
1546 /* Remove callout reference */
1548 lltable_unlink_entry(ln->lle_tbl, ln);
1550 IF_AFDATA_UNLOCK(ifp);
1558 nd6_isdynrte(const struct rtentry *rt, void *xap)
1561 if (rt->rt_flags == (RTF_UP | RTF_HOST | RTF_DYNAMIC))
1567 * Remove the rtentry for the given llentry,
1568 * both of which were installed by a redirect.
1571 nd6_free_redirect(const struct llentry *ln)
1574 struct sockaddr_in6 sin6;
1575 struct rt_addrinfo info;
1577 lltable_fill_sa_entry(ln, (struct sockaddr *)&sin6);
1578 memset(&info, 0, sizeof(info));
1579 info.rti_info[RTAX_DST] = (struct sockaddr *)&sin6;
1580 info.rti_filter = nd6_isdynrte;
1582 for (fibnum = 0; fibnum < rt_numfibs; fibnum++)
1583 rtrequest1_fib(RTM_DELETE, &info, NULL, fibnum);
1587 * Rejuvenate this function for routing operations related
1591 nd6_rtrequest(int req, struct rtentry *rt, struct rt_addrinfo *info)
1593 struct sockaddr_in6 *gateway;
1594 struct nd_defrouter *dr;
1597 gateway = (struct sockaddr_in6 *)rt->rt_gateway;
1608 * Only indirect routes are interesting.
1610 if ((rt->rt_flags & RTF_GATEWAY) == 0)
1613 * check for default route
1615 if (IN6_ARE_ADDR_EQUAL(&in6addr_any,
1616 &SIN6(rt_key(rt))->sin6_addr)) {
1617 dr = defrouter_lookup(&gateway->sin6_addr, ifp);
1629 nd6_ioctl(u_long cmd, caddr_t data, struct ifnet *ifp)
1631 struct in6_ndireq *ndi = (struct in6_ndireq *)data;
1632 struct in6_nbrinfo *nbi = (struct in6_nbrinfo *)data;
1633 struct in6_ndifreq *ndif = (struct in6_ndifreq *)data;
1636 if (ifp->if_afdata[AF_INET6] == NULL)
1637 return (EPFNOSUPPORT);
1639 case OSIOCGIFINFO_IN6:
1641 /* XXX: old ndp(8) assumes a positive value for linkmtu. */
1642 bzero(&ND, sizeof(ND));
1643 ND.linkmtu = IN6_LINKMTU(ifp);
1644 ND.maxmtu = ND_IFINFO(ifp)->maxmtu;
1645 ND.basereachable = ND_IFINFO(ifp)->basereachable;
1646 ND.reachable = ND_IFINFO(ifp)->reachable;
1647 ND.retrans = ND_IFINFO(ifp)->retrans;
1648 ND.flags = ND_IFINFO(ifp)->flags;
1649 ND.recalctm = ND_IFINFO(ifp)->recalctm;
1650 ND.chlim = ND_IFINFO(ifp)->chlim;
1652 case SIOCGIFINFO_IN6:
1653 ND = *ND_IFINFO(ifp);
1655 case SIOCSIFINFO_IN6:
1657 * used to change host variables from userland.
1658 * intended for a use on router to reflect RA configurations.
1660 /* 0 means 'unspecified' */
1661 if (ND.linkmtu != 0) {
1662 if (ND.linkmtu < IPV6_MMTU ||
1663 ND.linkmtu > IN6_LINKMTU(ifp)) {
1667 ND_IFINFO(ifp)->linkmtu = ND.linkmtu;
1670 if (ND.basereachable != 0) {
1671 int obasereachable = ND_IFINFO(ifp)->basereachable;
1673 ND_IFINFO(ifp)->basereachable = ND.basereachable;
1674 if (ND.basereachable != obasereachable)
1675 ND_IFINFO(ifp)->reachable =
1676 ND_COMPUTE_RTIME(ND.basereachable);
1678 if (ND.retrans != 0)
1679 ND_IFINFO(ifp)->retrans = ND.retrans;
1681 ND_IFINFO(ifp)->chlim = ND.chlim;
1683 case SIOCSIFINFO_FLAGS:
1686 struct in6_ifaddr *ia;
1688 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) &&
1689 !(ND.flags & ND6_IFF_IFDISABLED)) {
1690 /* ifdisabled 1->0 transision */
1693 * If the interface is marked as ND6_IFF_IFDISABLED and
1694 * has an link-local address with IN6_IFF_DUPLICATED,
1695 * do not clear ND6_IFF_IFDISABLED.
1696 * See RFC 4862, Section 5.4.5.
1699 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1700 if (ifa->ifa_addr->sa_family != AF_INET6)
1702 ia = (struct in6_ifaddr *)ifa;
1703 if ((ia->ia6_flags & IN6_IFF_DUPLICATED) &&
1704 IN6_IS_ADDR_LINKLOCAL(IA6_IN6(ia)))
1707 IF_ADDR_RUNLOCK(ifp);
1710 /* LLA is duplicated. */
1711 ND.flags |= ND6_IFF_IFDISABLED;
1712 log(LOG_ERR, "Cannot enable an interface"
1713 " with a link-local address marked"
1716 ND_IFINFO(ifp)->flags &= ~ND6_IFF_IFDISABLED;
1717 if (ifp->if_flags & IFF_UP)
1720 } else if (!(ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) &&
1721 (ND.flags & ND6_IFF_IFDISABLED)) {
1722 /* ifdisabled 0->1 transision */
1723 /* Mark all IPv6 address as tentative. */
1725 ND_IFINFO(ifp)->flags |= ND6_IFF_IFDISABLED;
1726 if (V_ip6_dad_count > 0 &&
1727 (ND_IFINFO(ifp)->flags & ND6_IFF_NO_DAD) == 0) {
1729 TAILQ_FOREACH(ifa, &ifp->if_addrhead,
1731 if (ifa->ifa_addr->sa_family !=
1734 ia = (struct in6_ifaddr *)ifa;
1735 ia->ia6_flags |= IN6_IFF_TENTATIVE;
1737 IF_ADDR_RUNLOCK(ifp);
1741 if (ND.flags & ND6_IFF_AUTO_LINKLOCAL) {
1742 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_AUTO_LINKLOCAL)) {
1743 /* auto_linklocal 0->1 transision */
1745 /* If no link-local address on ifp, configure */
1746 ND_IFINFO(ifp)->flags |= ND6_IFF_AUTO_LINKLOCAL;
1747 in6_ifattach(ifp, NULL);
1748 } else if (!(ND.flags & ND6_IFF_IFDISABLED) &&
1749 ifp->if_flags & IFF_UP) {
1751 * When the IF already has
1752 * ND6_IFF_AUTO_LINKLOCAL, no link-local
1753 * address is assigned, and IFF_UP, try to
1757 TAILQ_FOREACH(ifa, &ifp->if_addrhead,
1759 if (ifa->ifa_addr->sa_family !=
1762 ia = (struct in6_ifaddr *)ifa;
1763 if (IN6_IS_ADDR_LINKLOCAL(IA6_IN6(ia)))
1766 IF_ADDR_RUNLOCK(ifp);
1768 /* No LLA is configured. */
1769 in6_ifattach(ifp, NULL);
1773 ND_IFINFO(ifp)->flags = ND.flags;
1776 case SIOCSNDFLUSH_IN6: /* XXX: the ioctl name is confusing... */
1777 /* sync kernel routing table with the default router list */
1781 case SIOCSPFXFLUSH_IN6:
1783 /* flush all the prefix advertised by routers */
1784 struct in6_ifaddr *ia, *ia_next;
1785 struct nd_prefix *pr, *next;
1786 struct nd_prhead prl;
1791 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, next) {
1792 if (IN6_IS_ADDR_LINKLOCAL(&pr->ndpr_prefix.sin6_addr))
1794 nd6_prefix_unlink(pr, &prl);
1798 while ((pr = LIST_FIRST(&prl)) != NULL) {
1799 LIST_REMOVE(pr, ndpr_entry);
1800 /* XXXRW: in6_ifaddrhead locking. */
1801 TAILQ_FOREACH_SAFE(ia, &V_in6_ifaddrhead, ia_link,
1803 if ((ia->ia6_flags & IN6_IFF_AUTOCONF) == 0)
1806 if (ia->ia6_ndpr == pr)
1807 in6_purgeaddr(&ia->ia_ifa);
1813 case SIOCSRTRFLUSH_IN6:
1815 /* flush all the default routers */
1816 struct nd_drhead drq;
1817 struct nd_defrouter *dr;
1824 while ((dr = TAILQ_FIRST(&V_nd_defrouter)) != NULL)
1825 defrouter_unlink(dr, &drq);
1827 while ((dr = TAILQ_FIRST(&drq)) != NULL) {
1828 TAILQ_REMOVE(&drq, dr, dr_entry);
1835 case SIOCGNBRINFO_IN6:
1838 struct in6_addr nb_addr = nbi->addr; /* make local for safety */
1840 if ((error = in6_setscope(&nb_addr, ifp, NULL)) != 0)
1843 IF_AFDATA_RLOCK(ifp);
1844 ln = nd6_lookup(&nb_addr, 0, ifp);
1845 IF_AFDATA_RUNLOCK(ifp);
1851 nbi->state = ln->ln_state;
1852 nbi->asked = ln->la_asked;
1853 nbi->isrouter = ln->ln_router;
1854 if (ln->la_expire == 0)
1857 nbi->expire = ln->la_expire + ln->lle_remtime / hz +
1858 (time_second - time_uptime);
1862 case SIOCGDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */
1863 ndif->ifindex = V_nd6_defifindex;
1865 case SIOCSDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */
1866 return (nd6_setdefaultiface(ndif->ifindex));
1872 * Calculates new isRouter value based on provided parameters and
1876 nd6_is_router(int type, int code, int is_new, int old_addr, int new_addr,
1881 * ICMP6 type dependent behavior.
1883 * NS: clear IsRouter if new entry
1884 * RS: clear IsRouter
1885 * RA: set IsRouter if there's lladdr
1886 * redir: clear IsRouter if new entry
1889 * The spec says that we must set IsRouter in the following cases:
1890 * - If lladdr exist, set IsRouter. This means (1-5).
1891 * - If it is old entry (!newentry), set IsRouter. This means (7).
1892 * So, based on the spec, in (1-5) and (7) cases we must set IsRouter.
1893 * A quetion arises for (1) case. (1) case has no lladdr in the
1894 * neighbor cache, this is similar to (6).
1895 * This case is rare but we figured that we MUST NOT set IsRouter.
1897 * is_new old_addr new_addr NS RS RA redir
1904 * 1 -- n (6) c c c s
1905 * 1 -- y (7) c c s c s
1909 switch (type & 0xff) {
1910 case ND_NEIGHBOR_SOLICIT:
1912 * New entry must have is_router flag cleared.
1914 if (is_new) /* (6-7) */
1919 * If the icmp is a redirect to a better router, always set the
1920 * is_router flag. Otherwise, if the entry is newly created,
1921 * clear the flag. [RFC 2461, sec 8.3]
1923 if (code == ND_REDIRECT_ROUTER)
1926 if (is_new) /* (6-7) */
1930 case ND_ROUTER_SOLICIT:
1932 * is_router flag must always be cleared.
1936 case ND_ROUTER_ADVERT:
1938 * Mark an entry with lladdr as a router.
1940 if ((!is_new && (old_addr || new_addr)) || /* (2-5) */
1941 (is_new && new_addr)) { /* (7) */
1951 * Create neighbor cache entry and cache link-layer address,
1952 * on reception of inbound ND6 packets. (RS/RA/NS/redirect)
1955 * code - type dependent information
1959 nd6_cache_lladdr(struct ifnet *ifp, struct in6_addr *from, char *lladdr,
1960 int lladdrlen, int type, int code)
1962 struct llentry *ln = NULL, *ln_tmp;
1968 uint16_t router = 0;
1969 struct sockaddr_in6 sin6;
1970 struct mbuf *chain = NULL;
1971 u_char linkhdr[LLE_MAX_LINKHDR];
1975 IF_AFDATA_UNLOCK_ASSERT(ifp);
1977 KASSERT(ifp != NULL, ("%s: ifp == NULL", __func__));
1978 KASSERT(from != NULL, ("%s: from == NULL", __func__));
1980 /* nothing must be updated for unspecified address */
1981 if (IN6_IS_ADDR_UNSPECIFIED(from))
1985 * Validation about ifp->if_addrlen and lladdrlen must be done in
1988 * XXX If the link does not have link-layer adderss, what should
1989 * we do? (ifp->if_addrlen == 0)
1990 * Spec says nothing in sections for RA, RS and NA. There's small
1991 * description on it in NS section (RFC 2461 7.2.3).
1993 flags = lladdr ? LLE_EXCLUSIVE : 0;
1994 IF_AFDATA_RLOCK(ifp);
1995 ln = nd6_lookup(from, flags, ifp);
1996 IF_AFDATA_RUNLOCK(ifp);
1999 flags |= LLE_EXCLUSIVE;
2000 ln = nd6_alloc(from, 0, ifp);
2005 * Since we already know all the data for the new entry,
2006 * fill it before insertion.
2008 if (lladdr != NULL) {
2009 linkhdrsize = sizeof(linkhdr);
2010 if (lltable_calc_llheader(ifp, AF_INET6, lladdr,
2011 linkhdr, &linkhdrsize, &lladdr_off) != 0)
2013 lltable_set_entry_addr(ifp, ln, linkhdr, linkhdrsize,
2017 IF_AFDATA_WLOCK(ifp);
2019 /* Prefer any existing lle over newly-created one */
2020 ln_tmp = nd6_lookup(from, LLE_EXCLUSIVE, ifp);
2022 lltable_link_entry(LLTABLE6(ifp), ln);
2023 IF_AFDATA_WUNLOCK(ifp);
2024 if (ln_tmp == NULL) {
2025 /* No existing lle, mark as new entry (6,7) */
2027 if (lladdr != NULL) { /* (7) */
2028 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE);
2029 EVENTHANDLER_INVOKE(lle_event, ln,
2033 lltable_free_entry(LLTABLE6(ifp), ln);
2038 /* do nothing if static ndp is set */
2039 if ((ln->la_flags & LLE_STATIC)) {
2040 if (flags & LLE_EXCLUSIVE)
2047 olladdr = (ln->la_flags & LLE_VALID) ? 1 : 0;
2048 if (olladdr && lladdr) {
2049 llchange = bcmp(lladdr, ln->ll_addr,
2051 } else if (!olladdr && lladdr)
2057 * newentry olladdr lladdr llchange (*=record)
2060 * 0 n y y (3) * STALE
2062 * 0 y y y (5) * STALE
2063 * 1 -- n -- (6) NOSTATE(= PASSIVE)
2064 * 1 -- y -- (7) * STALE
2068 if (is_newentry == 0 && llchange != 0) {
2069 do_update = 1; /* (3,5) */
2072 * Record source link-layer address
2073 * XXX is it dependent to ifp->if_type?
2075 linkhdrsize = sizeof(linkhdr);
2076 if (lltable_calc_llheader(ifp, AF_INET6, lladdr,
2077 linkhdr, &linkhdrsize, &lladdr_off) != 0)
2080 if (lltable_try_set_entry_addr(ifp, ln, linkhdr, linkhdrsize,
2082 /* Entry was deleted */
2086 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE);
2088 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_RESOLVED);
2090 if (ln->la_hold != NULL)
2091 nd6_grab_holdchain(ln, &chain, &sin6);
2094 /* Calculates new router status */
2095 router = nd6_is_router(type, code, is_newentry, olladdr,
2096 lladdr != NULL ? 1 : 0, ln->ln_router);
2098 ln->ln_router = router;
2099 /* Mark non-router redirects with special flag */
2100 if ((type & 0xFF) == ND_REDIRECT && code != ND_REDIRECT_ROUTER)
2101 ln->la_flags |= LLE_REDIRECT;
2103 if (flags & LLE_EXCLUSIVE)
2109 nd6_flush_holdchain(ifp, chain, &sin6);
2112 * When the link-layer address of a router changes, select the
2113 * best router again. In particular, when the neighbor entry is newly
2114 * created, it might affect the selection policy.
2115 * Question: can we restrict the first condition to the "is_newentry"
2117 * XXX: when we hear an RA from a new router with the link-layer
2118 * address option, defrouter_select_fib() is called twice, since
2119 * defrtrlist_update called the function as well. However, I believe
2120 * we can compromise the overhead, since it only happens the first
2122 * XXX: although defrouter_select_fib() should not have a bad effect
2123 * for those are not autoconfigured hosts, we explicitly avoid such
2126 if ((do_update || is_newentry) && router &&
2127 ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
2129 * guaranteed recursion
2131 defrouter_select_fib(ifp->if_fib);
2136 nd6_slowtimo(void *arg)
2138 CURVNET_SET((struct vnet *) arg);
2139 struct nd_ifinfo *nd6if;
2142 callout_reset(&V_nd6_slowtimo_ch, ND6_SLOWTIMER_INTERVAL * hz,
2143 nd6_slowtimo, curvnet);
2144 IFNET_RLOCK_NOSLEEP();
2145 TAILQ_FOREACH(ifp, &V_ifnet, if_link) {
2146 if (ifp->if_afdata[AF_INET6] == NULL)
2148 nd6if = ND_IFINFO(ifp);
2149 if (nd6if->basereachable && /* already initialized */
2150 (nd6if->recalctm -= ND6_SLOWTIMER_INTERVAL) <= 0) {
2152 * Since reachable time rarely changes by router
2153 * advertisements, we SHOULD insure that a new random
2154 * value gets recomputed at least once every few hours.
2157 nd6if->recalctm = V_nd6_recalc_reachtm_interval;
2158 nd6if->reachable = ND_COMPUTE_RTIME(nd6if->basereachable);
2161 IFNET_RUNLOCK_NOSLEEP();
2166 nd6_grab_holdchain(struct llentry *ln, struct mbuf **chain,
2167 struct sockaddr_in6 *sin6)
2170 LLE_WLOCK_ASSERT(ln);
2172 *chain = ln->la_hold;
2174 lltable_fill_sa_entry(ln, (struct sockaddr *)sin6);
2176 if (ln->ln_state == ND6_LLINFO_STALE) {
2179 * The first time we send a packet to a
2180 * neighbor whose entry is STALE, we have
2181 * to change the state to DELAY and a sets
2182 * a timer to expire in DELAY_FIRST_PROBE_TIME
2183 * seconds to ensure do neighbor unreachability
2184 * detection on expiration.
2187 nd6_llinfo_setstate(ln, ND6_LLINFO_DELAY);
2192 nd6_output_ifp(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *m,
2193 struct sockaddr_in6 *dst, struct route *ro)
2197 struct ip6_hdr *ip6;
2201 mac_netinet6_nd6_send(ifp, m);
2205 * If called from nd6_ns_output() (NS), nd6_na_output() (NA),
2206 * icmp6_redirect_output() (REDIRECT) or from rip6_output() (RS, RA
2207 * as handled by rtsol and rtadvd), mbufs will be tagged for SeND
2208 * to be diverted to user space. When re-injected into the kernel,
2209 * send_output() will directly dispatch them to the outgoing interface.
2211 if (send_sendso_input_hook != NULL) {
2212 mtag = m_tag_find(m, PACKET_TAG_ND_OUTGOING, NULL);
2214 ip6 = mtod(m, struct ip6_hdr *);
2215 ip6len = sizeof(struct ip6_hdr) + ntohs(ip6->ip6_plen);
2216 /* Use the SEND socket */
2217 error = send_sendso_input_hook(m, ifp, SND_OUT,
2219 /* -1 == no app on SEND socket */
2220 if (error == 0 || error != -1)
2225 m_clrprotoflags(m); /* Avoid confusing lower layers. */
2226 IP_PROBE(send, NULL, NULL, mtod(m, struct ip6_hdr *), ifp, NULL,
2227 mtod(m, struct ip6_hdr *));
2229 if ((ifp->if_flags & IFF_LOOPBACK) == 0)
2232 error = (*ifp->if_output)(origifp, m, (struct sockaddr *)dst, ro);
2237 * Lookup link headerfor @sa_dst address. Stores found
2238 * data in @desten buffer. Copy of lle ln_flags can be also
2239 * saved in @pflags if @pflags is non-NULL.
2241 * If destination LLE does not exists or lle state modification
2242 * is required, call "slow" version.
2245 * - 0 on success (address copied to buffer).
2246 * - EWOULDBLOCK (no local error, but address is still unresolved)
2247 * - other errors (alloc failure, etc)
2250 nd6_resolve(struct ifnet *ifp, int is_gw, struct mbuf *m,
2251 const struct sockaddr *sa_dst, u_char *desten, uint32_t *pflags,
2252 struct llentry **plle)
2254 struct llentry *ln = NULL;
2255 const struct sockaddr_in6 *dst6;
2260 dst6 = (const struct sockaddr_in6 *)sa_dst;
2262 /* discard the packet if IPv6 operation is disabled on the interface */
2263 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED)) {
2265 return (ENETDOWN); /* better error? */
2268 if (m != NULL && m->m_flags & M_MCAST) {
2269 switch (ifp->if_type) {
2273 ETHER_MAP_IPV6_MULTICAST(&dst6->sin6_addr,
2278 return (EAFNOSUPPORT);
2282 IF_AFDATA_RLOCK(ifp);
2283 ln = nd6_lookup(&dst6->sin6_addr, plle ? LLE_EXCLUSIVE : LLE_UNLOCKED,
2285 if (ln != NULL && (ln->r_flags & RLLE_VALID) != 0) {
2286 /* Entry found, let's copy lle info */
2287 bcopy(ln->r_linkdata, desten, ln->r_hdrlen);
2289 *pflags = LLE_VALID | (ln->r_flags & RLLE_IFADDR);
2290 /* Check if we have feedback request from nd6 timer */
2291 if (ln->r_skip_req != 0) {
2293 ln->r_skip_req = 0; /* Notify that entry was used */
2294 ln->lle_hittime = time_uptime;
2302 IF_AFDATA_RUNLOCK(ifp);
2304 } else if (plle && ln)
2306 IF_AFDATA_RUNLOCK(ifp);
2308 return (nd6_resolve_slow(ifp, 0, m, dst6, desten, pflags, plle));
2313 * Do L2 address resolution for @sa_dst address. Stores found
2314 * address in @desten buffer. Copy of lle ln_flags can be also
2315 * saved in @pflags if @pflags is non-NULL.
2318 * Function assume that destination LLE does not exist,
2319 * is invalid or stale, so LLE_EXCLUSIVE lock needs to be acquired.
2321 * Set noinline to be dtrace-friendly
2323 static __noinline int
2324 nd6_resolve_slow(struct ifnet *ifp, int flags, struct mbuf *m,
2325 const struct sockaddr_in6 *dst, u_char *desten, uint32_t *pflags,
2326 struct llentry **plle)
2328 struct llentry *lle = NULL, *lle_tmp;
2329 struct in6_addr *psrc, src;
2330 int send_ns, ll_len;
2334 * Address resolution or Neighbor Unreachability Detection
2336 * At this point, the destination of the packet must be a unicast
2337 * or an anycast address(i.e. not a multicast).
2340 IF_AFDATA_RLOCK(ifp);
2341 lle = nd6_lookup(&dst->sin6_addr, LLE_EXCLUSIVE, ifp);
2342 IF_AFDATA_RUNLOCK(ifp);
2343 if ((lle == NULL) && nd6_is_addr_neighbor(dst, ifp)) {
2345 * Since nd6_is_addr_neighbor() internally calls nd6_lookup(),
2346 * the condition below is not very efficient. But we believe
2347 * it is tolerable, because this should be a rare case.
2349 lle = nd6_alloc(&dst->sin6_addr, 0, ifp);
2351 char ip6buf[INET6_ADDRSTRLEN];
2353 "nd6_output: can't allocate llinfo for %s "
2355 ip6_sprintf(ip6buf, &dst->sin6_addr), lle);
2360 IF_AFDATA_WLOCK(ifp);
2362 /* Prefer any existing entry over newly-created one */
2363 lle_tmp = nd6_lookup(&dst->sin6_addr, LLE_EXCLUSIVE, ifp);
2364 if (lle_tmp == NULL)
2365 lltable_link_entry(LLTABLE6(ifp), lle);
2366 IF_AFDATA_WUNLOCK(ifp);
2367 if (lle_tmp != NULL) {
2368 lltable_free_entry(LLTABLE6(ifp), lle);
2375 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_PERFORMNUD)) {
2385 LLE_WLOCK_ASSERT(lle);
2388 * The first time we send a packet to a neighbor whose entry is
2389 * STALE, we have to change the state to DELAY and a sets a timer to
2390 * expire in DELAY_FIRST_PROBE_TIME seconds to ensure do
2391 * neighbor unreachability detection on expiration.
2394 if (lle->ln_state == ND6_LLINFO_STALE)
2395 nd6_llinfo_setstate(lle, ND6_LLINFO_DELAY);
2398 * If the neighbor cache entry has a state other than INCOMPLETE
2399 * (i.e. its link-layer address is already resolved), just
2402 if (lle->ln_state > ND6_LLINFO_INCOMPLETE) {
2403 if (flags & LLE_ADDRONLY) {
2404 lladdr = lle->ll_addr;
2405 ll_len = ifp->if_addrlen;
2407 lladdr = lle->r_linkdata;
2408 ll_len = lle->r_hdrlen;
2410 bcopy(lladdr, desten, ll_len);
2412 *pflags = lle->la_flags;
2422 * There is a neighbor cache entry, but no ethernet address
2423 * response yet. Append this latest packet to the end of the
2424 * packet queue in the mbuf. When it exceeds nd6_maxqueuelen,
2425 * the oldest packet in the queue will be removed.
2428 if (lle->la_hold != NULL) {
2429 struct mbuf *m_hold;
2433 for (m_hold = lle->la_hold; m_hold; m_hold = m_hold->m_nextpkt){
2435 if (m_hold->m_nextpkt == NULL) {
2436 m_hold->m_nextpkt = m;
2440 while (i >= V_nd6_maxqueuelen) {
2441 m_hold = lle->la_hold;
2442 lle->la_hold = lle->la_hold->m_nextpkt;
2451 * If there has been no NS for the neighbor after entering the
2452 * INCOMPLETE state, send the first solicitation.
2453 * Note that for newly-created lle la_asked will be 0,
2454 * so we will transition from ND6_LLINFO_NOSTATE to
2455 * ND6_LLINFO_INCOMPLETE state here.
2459 if (lle->la_asked == 0) {
2462 psrc = nd6_llinfo_get_holdsrc(lle, &src);
2464 nd6_llinfo_setstate(lle, ND6_LLINFO_INCOMPLETE);
2468 nd6_ns_output(ifp, psrc, NULL, &dst->sin6_addr, NULL);
2470 return (EWOULDBLOCK);
2474 * Do L2 address resolution for @sa_dst address. Stores found
2475 * address in @desten buffer. Copy of lle ln_flags can be also
2476 * saved in @pflags if @pflags is non-NULL.
2479 * - 0 on success (address copied to buffer).
2480 * - EWOULDBLOCK (no local error, but address is still unresolved)
2481 * - other errors (alloc failure, etc)
2484 nd6_resolve_addr(struct ifnet *ifp, int flags, const struct sockaddr *dst,
2485 char *desten, uint32_t *pflags)
2489 flags |= LLE_ADDRONLY;
2490 error = nd6_resolve_slow(ifp, flags, NULL,
2491 (const struct sockaddr_in6 *)dst, desten, pflags, NULL);
2496 nd6_flush_holdchain(struct ifnet *ifp, struct mbuf *chain,
2497 struct sockaddr_in6 *dst)
2499 struct mbuf *m, *m_head;
2506 m_head = m_head->m_nextpkt;
2507 error = nd6_output_ifp(ifp, ifp, m, dst, NULL);
2512 * note that intermediate errors are blindly ignored
2518 nd6_need_cache(struct ifnet *ifp)
2521 * XXX: we currently do not make neighbor cache on any interface
2522 * other than ARCnet, Ethernet and GIF.
2525 * - unidirectional tunnels needs no ND
2527 switch (ifp->if_type) {
2532 case IFT_INFINIBAND:
2534 case IFT_PROPVIRTUAL:
2542 * Add pernament ND6 link-layer record for given
2543 * interface address.
2545 * Very similar to IPv4 arp_ifinit(), but:
2546 * 1) IPv6 DAD is performed in different place
2547 * 2) It is called by IPv6 protocol stack in contrast to
2548 * arp_ifinit() which is typically called in SIOCSIFADDR
2549 * driver ioctl handler.
2553 nd6_add_ifa_lle(struct in6_ifaddr *ia)
2556 struct llentry *ln, *ln_tmp;
2557 struct sockaddr *dst;
2559 ifp = ia->ia_ifa.ifa_ifp;
2560 if (nd6_need_cache(ifp) == 0)
2563 ia->ia_ifa.ifa_rtrequest = nd6_rtrequest;
2564 dst = (struct sockaddr *)&ia->ia_addr;
2565 ln = lltable_alloc_entry(LLTABLE6(ifp), LLE_IFADDR, dst);
2569 IF_AFDATA_WLOCK(ifp);
2571 /* Unlink any entry if exists */
2572 ln_tmp = lla_lookup(LLTABLE6(ifp), LLE_EXCLUSIVE, dst);
2574 lltable_unlink_entry(LLTABLE6(ifp), ln_tmp);
2575 lltable_link_entry(LLTABLE6(ifp), ln);
2576 IF_AFDATA_WUNLOCK(ifp);
2579 EVENTHANDLER_INVOKE(lle_event, ln_tmp, LLENTRY_EXPIRED);
2580 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_RESOLVED);
2584 llentry_free(ln_tmp);
2590 * Removes either all lle entries for given @ia, or lle
2591 * corresponding to @ia address.
2594 nd6_rem_ifa_lle(struct in6_ifaddr *ia, int all)
2596 struct sockaddr_in6 mask, addr;
2597 struct sockaddr *saddr, *smask;
2600 ifp = ia->ia_ifa.ifa_ifp;
2601 memcpy(&addr, &ia->ia_addr, sizeof(ia->ia_addr));
2602 memcpy(&mask, &ia->ia_prefixmask, sizeof(ia->ia_prefixmask));
2603 saddr = (struct sockaddr *)&addr;
2604 smask = (struct sockaddr *)&mask;
2607 lltable_prefix_free(AF_INET6, saddr, smask, LLE_STATIC);
2609 lltable_delete_addr(LLTABLE6(ifp), LLE_IFADDR, saddr);
2613 clear_llinfo_pqueue(struct llentry *ln)
2615 struct mbuf *m_hold, *m_hold_next;
2617 for (m_hold = ln->la_hold; m_hold; m_hold = m_hold_next) {
2618 m_hold_next = m_hold->m_nextpkt;
2625 static int nd6_sysctl_drlist(SYSCTL_HANDLER_ARGS);
2626 static int nd6_sysctl_prlist(SYSCTL_HANDLER_ARGS);
2628 SYSCTL_DECL(_net_inet6_icmp6);
2629 SYSCTL_PROC(_net_inet6_icmp6, ICMPV6CTL_ND6_DRLIST, nd6_drlist,
2630 CTLTYPE_OPAQUE | CTLFLAG_RD | CTLFLAG_MPSAFE,
2631 NULL, 0, nd6_sysctl_drlist, "S,in6_defrouter",
2632 "NDP default router list");
2633 SYSCTL_PROC(_net_inet6_icmp6, ICMPV6CTL_ND6_PRLIST, nd6_prlist,
2634 CTLTYPE_OPAQUE | CTLFLAG_RD | CTLFLAG_MPSAFE,
2635 NULL, 0, nd6_sysctl_prlist, "S,in6_prefix",
2637 SYSCTL_INT(_net_inet6_icmp6, ICMPV6CTL_ND6_MAXQLEN, nd6_maxqueuelen,
2638 CTLFLAG_VNET | CTLFLAG_RW, &VNET_NAME(nd6_maxqueuelen), 1, "");
2639 SYSCTL_INT(_net_inet6_icmp6, OID_AUTO, nd6_gctimer,
2640 CTLFLAG_VNET | CTLFLAG_RW, &VNET_NAME(nd6_gctimer), (60 * 60 * 24), "");
2643 nd6_sysctl_drlist(SYSCTL_HANDLER_ARGS)
2645 struct in6_defrouter d;
2646 struct nd_defrouter *dr;
2649 if (req->newptr != NULL)
2652 error = sysctl_wire_old_buffer(req, 0);
2656 bzero(&d, sizeof(d));
2657 d.rtaddr.sin6_family = AF_INET6;
2658 d.rtaddr.sin6_len = sizeof(d.rtaddr);
2661 TAILQ_FOREACH(dr, &V_nd_defrouter, dr_entry) {
2662 d.rtaddr.sin6_addr = dr->rtaddr;
2663 error = sa6_recoverscope(&d.rtaddr);
2666 d.flags = dr->raflags;
2667 d.rtlifetime = dr->rtlifetime;
2668 d.expire = dr->expire + (time_second - time_uptime);
2669 d.if_index = dr->ifp->if_index;
2670 error = SYSCTL_OUT(req, &d, sizeof(d));
2679 nd6_sysctl_prlist(SYSCTL_HANDLER_ARGS)
2681 struct in6_prefix p;
2682 struct sockaddr_in6 s6;
2683 struct nd_prefix *pr;
2684 struct nd_pfxrouter *pfr;
2687 char ip6buf[INET6_ADDRSTRLEN];
2692 error = sysctl_wire_old_buffer(req, 0);
2696 bzero(&p, sizeof(p));
2697 p.origin = PR_ORIG_RA;
2698 bzero(&s6, sizeof(s6));
2699 s6.sin6_family = AF_INET6;
2700 s6.sin6_len = sizeof(s6);
2703 LIST_FOREACH(pr, &V_nd_prefix, ndpr_entry) {
2704 p.prefix = pr->ndpr_prefix;
2705 if (sa6_recoverscope(&p.prefix)) {
2706 log(LOG_ERR, "scope error in prefix list (%s)\n",
2707 ip6_sprintf(ip6buf, &p.prefix.sin6_addr));
2708 /* XXX: press on... */
2710 p.raflags = pr->ndpr_raf;
2711 p.prefixlen = pr->ndpr_plen;
2712 p.vltime = pr->ndpr_vltime;
2713 p.pltime = pr->ndpr_pltime;
2714 p.if_index = pr->ndpr_ifp->if_index;
2715 if (pr->ndpr_vltime == ND6_INFINITE_LIFETIME)
2718 /* XXX: we assume time_t is signed. */
2720 ~((time_t)1 << ((sizeof(maxexpire) * 8) - 1));
2721 if (pr->ndpr_vltime < maxexpire - pr->ndpr_lastupdate)
2722 p.expire = pr->ndpr_lastupdate +
2724 (time_second - time_uptime);
2726 p.expire = maxexpire;
2728 p.refcnt = pr->ndpr_addrcnt;
2729 p.flags = pr->ndpr_stateflags;
2731 LIST_FOREACH(pfr, &pr->ndpr_advrtrs, pfr_entry)
2733 error = SYSCTL_OUT(req, &p, sizeof(p));
2736 LIST_FOREACH(pfr, &pr->ndpr_advrtrs, pfr_entry) {
2737 s6.sin6_addr = pfr->router->rtaddr;
2738 if (sa6_recoverscope(&s6))
2740 "scope error in prefix list (%s)\n",
2741 ip6_sprintf(ip6buf, &pfr->router->rtaddr));
2742 error = SYSCTL_OUT(req, &s6, sizeof(s6));