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_dl.h>
62 #include <net/if_types.h>
63 #include <net/route.h>
66 #include <netinet/in.h>
67 #include <netinet/in_kdtrace.h>
68 #include <net/if_llatbl.h>
69 #include <netinet/if_ether.h>
70 #include <netinet6/in6_var.h>
71 #include <netinet/ip6.h>
72 #include <netinet6/ip6_var.h>
73 #include <netinet6/scope6_var.h>
74 #include <netinet6/nd6.h>
75 #include <netinet6/in6_ifattach.h>
76 #include <netinet/icmp6.h>
77 #include <netinet6/send.h>
79 #include <sys/limits.h>
81 #include <security/mac/mac_framework.h>
83 #define ND6_SLOWTIMER_INTERVAL (60 * 60) /* 1 hour */
84 #define ND6_RECALC_REACHTM_INTERVAL (60 * 120) /* 2 hours */
86 #define SIN6(s) ((const struct sockaddr_in6 *)(s))
88 MALLOC_DEFINE(M_IP6NDP, "ip6ndp", "IPv6 Neighbor Discovery");
91 VNET_DEFINE(int, nd6_prune) = 1; /* walk list every 1 seconds */
92 VNET_DEFINE(int, nd6_delay) = 5; /* delay first probe time 5 second */
93 VNET_DEFINE(int, nd6_umaxtries) = 3; /* maximum unicast query */
94 VNET_DEFINE(int, nd6_mmaxtries) = 3; /* maximum multicast query */
95 VNET_DEFINE(int, nd6_useloopback) = 1; /* use loopback interface for
97 VNET_DEFINE(int, nd6_gctimer) = (60 * 60 * 24); /* 1 day: garbage
100 /* preventing too many loops in ND option parsing */
101 VNET_DEFINE_STATIC(int, nd6_maxndopt) = 10; /* max # of ND options allowed */
103 VNET_DEFINE(int, nd6_maxnudhint) = 0; /* max # of subsequent upper
105 VNET_DEFINE_STATIC(int, nd6_maxqueuelen) = 1; /* max pkts cached in unresolved
107 #define V_nd6_maxndopt VNET(nd6_maxndopt)
108 #define V_nd6_maxqueuelen VNET(nd6_maxqueuelen)
111 VNET_DEFINE(int, nd6_debug) = 1;
113 VNET_DEFINE(int, nd6_debug) = 0;
116 static eventhandler_tag lle_event_eh, iflladdr_event_eh;
118 VNET_DEFINE(struct nd_prhead, nd_prefix);
119 VNET_DEFINE(struct rwlock, nd6_lock);
120 VNET_DEFINE(uint64_t, nd6_list_genid);
121 VNET_DEFINE(struct mtx, nd6_onlink_mtx);
123 VNET_DEFINE(int, nd6_recalc_reachtm_interval) = ND6_RECALC_REACHTM_INTERVAL;
124 #define V_nd6_recalc_reachtm_interval VNET(nd6_recalc_reachtm_interval)
126 int (*send_sendso_input_hook)(struct mbuf *, struct ifnet *, int, int);
128 static int nd6_is_new_addr_neighbor(const struct sockaddr_in6 *,
130 static void nd6_setmtu0(struct ifnet *, struct nd_ifinfo *);
131 static void nd6_slowtimo(void *);
132 static int regen_tmpaddr(struct in6_ifaddr *);
133 static void nd6_free(struct llentry **, int);
134 static void nd6_free_redirect(const struct llentry *);
135 static void nd6_llinfo_timer(void *);
136 static void nd6_llinfo_settimer_locked(struct llentry *, long);
137 static void clear_llinfo_pqueue(struct llentry *);
138 static void nd6_rtrequest(int, struct rtentry *, struct rt_addrinfo *);
139 static int nd6_resolve_slow(struct ifnet *, int, struct mbuf *,
140 const struct sockaddr_in6 *, u_char *, uint32_t *, struct llentry **);
141 static int nd6_need_cache(struct ifnet *);
144 VNET_DEFINE_STATIC(struct callout, nd6_slowtimo_ch);
145 #define V_nd6_slowtimo_ch VNET(nd6_slowtimo_ch)
147 VNET_DEFINE_STATIC(struct callout, nd6_timer_ch);
148 #define V_nd6_timer_ch VNET(nd6_timer_ch)
150 SYSCTL_DECL(_net_inet6_icmp6);
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 nd6_defrouter_init();
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 CK_STAILQ_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;
337 ndi->maxmtu = ifp->if_mtu;
340 * Decreasing the interface MTU under IPV6 minimum MTU may cause
341 * undesirable situation. We thus notify the operator of the change
342 * explicitly. The check for omaxmtu is necessary to restrict the
343 * log to the case of changing the MTU, not initializing it.
345 if (omaxmtu >= IPV6_MMTU && ndi->maxmtu < IPV6_MMTU) {
346 log(LOG_NOTICE, "nd6_setmtu0: "
347 "new link MTU on %s (%lu) is too small for IPv6\n",
348 if_name(ifp), (unsigned long)ndi->maxmtu);
351 if (ndi->maxmtu > V_in6_maxmtu)
352 in6_setmaxmtu(); /* check all interfaces just in case */
357 nd6_option_init(void *opt, int icmp6len, union nd_opts *ndopts)
360 bzero(ndopts, sizeof(*ndopts));
361 ndopts->nd_opts_search = (struct nd_opt_hdr *)opt;
363 = (struct nd_opt_hdr *)(((u_char *)opt) + icmp6len);
366 ndopts->nd_opts_done = 1;
367 ndopts->nd_opts_search = NULL;
372 * Take one ND option.
375 nd6_option(union nd_opts *ndopts)
377 struct nd_opt_hdr *nd_opt;
380 KASSERT(ndopts != NULL, ("%s: ndopts == NULL", __func__));
381 KASSERT(ndopts->nd_opts_last != NULL, ("%s: uninitialized ndopts",
383 if (ndopts->nd_opts_search == NULL)
385 if (ndopts->nd_opts_done)
388 nd_opt = ndopts->nd_opts_search;
390 /* make sure nd_opt_len is inside the buffer */
391 if ((caddr_t)&nd_opt->nd_opt_len >= (caddr_t)ndopts->nd_opts_last) {
392 bzero(ndopts, sizeof(*ndopts));
396 olen = nd_opt->nd_opt_len << 3;
399 * Message validation requires that all included
400 * options have a length that is greater than zero.
402 bzero(ndopts, sizeof(*ndopts));
406 ndopts->nd_opts_search = (struct nd_opt_hdr *)((caddr_t)nd_opt + olen);
407 if (ndopts->nd_opts_search > ndopts->nd_opts_last) {
408 /* option overruns the end of buffer, invalid */
409 bzero(ndopts, sizeof(*ndopts));
411 } else if (ndopts->nd_opts_search == ndopts->nd_opts_last) {
412 /* reached the end of options chain */
413 ndopts->nd_opts_done = 1;
414 ndopts->nd_opts_search = NULL;
420 * Parse multiple ND options.
421 * This function is much easier to use, for ND routines that do not need
422 * multiple options of the same type.
425 nd6_options(union nd_opts *ndopts)
427 struct nd_opt_hdr *nd_opt;
430 KASSERT(ndopts != NULL, ("%s: ndopts == NULL", __func__));
431 KASSERT(ndopts->nd_opts_last != NULL, ("%s: uninitialized ndopts",
433 if (ndopts->nd_opts_search == NULL)
437 nd_opt = nd6_option(ndopts);
438 if (nd_opt == NULL && ndopts->nd_opts_last == NULL) {
440 * Message validation requires that all included
441 * options have a length that is greater than zero.
443 ICMP6STAT_INC(icp6s_nd_badopt);
444 bzero(ndopts, sizeof(*ndopts));
451 switch (nd_opt->nd_opt_type) {
452 case ND_OPT_SOURCE_LINKADDR:
453 case ND_OPT_TARGET_LINKADDR:
455 case ND_OPT_REDIRECTED_HEADER:
457 if (ndopts->nd_opt_array[nd_opt->nd_opt_type]) {
459 "duplicated ND6 option found (type=%d)\n",
460 nd_opt->nd_opt_type));
463 ndopts->nd_opt_array[nd_opt->nd_opt_type]
467 case ND_OPT_PREFIX_INFORMATION:
468 if (ndopts->nd_opt_array[nd_opt->nd_opt_type] == 0) {
469 ndopts->nd_opt_array[nd_opt->nd_opt_type]
472 ndopts->nd_opts_pi_end =
473 (struct nd_opt_prefix_info *)nd_opt;
475 /* What about ND_OPT_ROUTE_INFO? RFC 4191 */
476 case ND_OPT_RDNSS: /* RFC 6106 */
477 case ND_OPT_DNSSL: /* RFC 6106 */
479 * Silently ignore options we know and do not care about
485 * Unknown options must be silently ignored,
486 * to accommodate future extension to the protocol.
489 "nd6_options: unsupported option %d - "
490 "option ignored\n", nd_opt->nd_opt_type));
495 if (i > V_nd6_maxndopt) {
496 ICMP6STAT_INC(icp6s_nd_toomanyopt);
497 nd6log((LOG_INFO, "too many loop in nd opt\n"));
501 if (ndopts->nd_opts_done)
509 * ND6 timer routine to handle ND6 entries
512 nd6_llinfo_settimer_locked(struct llentry *ln, long tick)
516 LLE_WLOCK_ASSERT(ln);
521 canceled = callout_stop(&ln->lle_timer);
523 ln->la_expire = time_uptime + tick / hz;
525 if (tick > INT_MAX) {
526 ln->ln_ntick = tick - INT_MAX;
527 canceled = callout_reset(&ln->lle_timer, INT_MAX,
528 nd6_llinfo_timer, ln);
531 canceled = callout_reset(&ln->lle_timer, tick,
532 nd6_llinfo_timer, ln);
540 * Gets source address of the first packet in hold queue
541 * and stores it in @src.
542 * Returns pointer to @src (if hold queue is not empty) or NULL.
544 * Set noinline to be dtrace-friendly
546 static __noinline struct in6_addr *
547 nd6_llinfo_get_holdsrc(struct llentry *ln, struct in6_addr *src)
552 if (ln->la_hold == NULL)
556 * assume every packet in la_hold has the same IP header
559 if (sizeof(hdr) > m->m_len)
562 m_copydata(m, 0, sizeof(hdr), (caddr_t)&hdr);
569 * Checks if we need to switch from STALE state.
571 * RFC 4861 requires switching from STALE to DELAY state
572 * on first packet matching entry, waiting V_nd6_delay and
573 * transition to PROBE state (if upper layer confirmation was
576 * This code performs a bit differently:
577 * On packet hit we don't change state (but desired state
578 * can be guessed by control plane). However, after V_nd6_delay
579 * seconds code will transition to PROBE state (so DELAY state
580 * is kinda skipped in most situations).
582 * Typically, V_nd6_gctimer is bigger than V_nd6_delay, so
583 * we perform the following upon entering STALE state:
585 * 1) Arm timer to run each V_nd6_delay seconds to make sure that
586 * if packet was transmitted at the start of given interval, we
587 * would be able to switch to PROBE state in V_nd6_delay seconds
590 * 2) Reschedule timer until original V_nd6_gctimer expires keeping
591 * lle in STALE state (remaining timer value stored in lle_remtime).
593 * 3) Reschedule timer if packet was transmitted less that V_nd6_delay
596 * Returns non-zero value if the entry is still STALE (storing
597 * the next timer interval in @pdelay).
599 * Returns zero value if original timer expired or we need to switch to
600 * PROBE (store that in @do_switch variable).
603 nd6_is_stale(struct llentry *lle, long *pdelay, int *do_switch)
605 int nd_delay, nd_gctimer, r_skip_req;
610 nd_gctimer = V_nd6_gctimer;
611 nd_delay = V_nd6_delay;
614 r_skip_req = lle->r_skip_req;
615 lle_hittime = lle->lle_hittime;
618 if (r_skip_req > 0) {
621 * Nonzero r_skip_req value was set upon entering
622 * STALE state. Since value was not changed, no
623 * packets were passed using this lle. Ask for
624 * timer reschedule and keep STALE state.
626 delay = (long)(MIN(nd_gctimer, nd_delay));
628 if (lle->lle_remtime > delay)
629 lle->lle_remtime -= delay;
631 delay = lle->lle_remtime;
632 lle->lle_remtime = 0;
638 * The original ng6_gctime timeout ended,
639 * no more rescheduling.
649 * Packet received. Verify timestamp
651 delay = (long)(time_uptime - lle_hittime);
652 if (delay < nd_delay) {
655 * V_nd6_delay still not passed since the first
656 * hit in STALE state.
657 * Reshedule timer and return.
659 *pdelay = (long)(nd_delay - delay) * hz;
663 /* Request switching to probe */
670 * Switch @lle state to new state optionally arming timers.
672 * Set noinline to be dtrace-friendly
675 nd6_llinfo_setstate(struct llentry *lle, int newstate)
678 int nd_gctimer, nd_delay;
685 case ND6_LLINFO_INCOMPLETE:
686 ifp = lle->lle_tbl->llt_ifp;
687 delay = (long)ND_IFINFO(ifp)->retrans * hz / 1000;
689 case ND6_LLINFO_REACHABLE:
690 if (!ND6_LLINFO_PERMANENT(lle)) {
691 ifp = lle->lle_tbl->llt_ifp;
692 delay = (long)ND_IFINFO(ifp)->reachable * hz;
695 case ND6_LLINFO_STALE:
698 * Notify fast path that we want to know if any packet
699 * is transmitted by setting r_skip_req.
704 nd_delay = V_nd6_delay;
705 nd_gctimer = V_nd6_gctimer;
707 delay = (long)(MIN(nd_gctimer, nd_delay)) * hz;
708 remtime = (long)nd_gctimer * hz - delay;
710 case ND6_LLINFO_DELAY:
712 delay = (long)V_nd6_delay * hz;
717 nd6_llinfo_settimer_locked(lle, delay);
719 lle->lle_remtime = remtime;
720 lle->ln_state = newstate;
724 * Timer-dependent part of nd state machine.
726 * Set noinline to be dtrace-friendly
728 static __noinline void
729 nd6_llinfo_timer(void *arg)
732 struct in6_addr *dst, *pdst, *psrc, src;
734 struct nd_ifinfo *ndi;
735 int do_switch, send_ns;
738 KASSERT(arg != NULL, ("%s: arg NULL", __func__));
739 ln = (struct llentry *)arg;
740 ifp = lltable_get_ifp(ln->lle_tbl);
741 CURVNET_SET(ifp->if_vnet);
745 if (callout_pending(&ln->lle_timer)) {
747 * Here we are a bit odd here in the treatment of
748 * active/pending. If the pending bit is set, it got
749 * rescheduled before I ran. The active
750 * bit we ignore, since if it was stopped
751 * in ll_tablefree() and was currently running
752 * it would have return 0 so the code would
753 * not have deleted it since the callout could
754 * not be stopped so we want to go through
755 * with the delete here now. If the callout
756 * was restarted, the pending bit will be back on and
757 * we just want to bail since the callout_reset would
758 * return 1 and our reference would have been removed
759 * by nd6_llinfo_settimer_locked above since canceled
767 ndi = ND_IFINFO(ifp);
769 dst = &ln->r_l3addr.addr6;
772 if (ln->ln_ntick > 0) {
773 if (ln->ln_ntick > INT_MAX) {
774 ln->ln_ntick -= INT_MAX;
775 nd6_llinfo_settimer_locked(ln, INT_MAX);
778 nd6_llinfo_settimer_locked(ln, ln->ln_ntick);
783 if (ln->la_flags & LLE_STATIC) {
787 if (ln->la_flags & LLE_DELETED) {
792 switch (ln->ln_state) {
793 case ND6_LLINFO_INCOMPLETE:
794 if (ln->la_asked < V_nd6_mmaxtries) {
797 /* Send NS to multicast address */
800 struct mbuf *m = ln->la_hold;
805 * assuming every packet in la_hold has the
806 * same IP header. Send error after unlock.
811 clear_llinfo_pqueue(ln);
815 icmp6_error2(m, ICMP6_DST_UNREACH,
816 ICMP6_DST_UNREACH_ADDR, 0, ifp);
819 case ND6_LLINFO_REACHABLE:
820 if (!ND6_LLINFO_PERMANENT(ln))
821 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE);
824 case ND6_LLINFO_STALE:
825 if (nd6_is_stale(ln, &delay, &do_switch) != 0) {
828 * No packet has used this entry and GC timeout
829 * has not been passed. Reshedule timer and
832 nd6_llinfo_settimer_locked(ln, delay);
836 if (do_switch == 0) {
839 * GC timer has ended and entry hasn't been used.
840 * Run Garbage collector (RFC 4861, 5.3)
842 if (!ND6_LLINFO_PERMANENT(ln))
847 /* Entry has been used AND delay timer has ended. */
851 case ND6_LLINFO_DELAY:
852 if (ndi && (ndi->flags & ND6_IFF_PERFORMNUD) != 0) {
855 nd6_llinfo_setstate(ln, ND6_LLINFO_PROBE);
858 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE); /* XXX */
860 case ND6_LLINFO_PROBE:
861 if (ln->la_asked < V_nd6_umaxtries) {
869 panic("%s: paths in a dark night can be confusing: %d",
870 __func__, ln->ln_state);
876 nd6_llinfo_settimer_locked(ln, (long)ndi->retrans * hz / 1000);
877 psrc = nd6_llinfo_get_holdsrc(ln, &src);
880 nd6_ns_output(ifp, psrc, pdst, dst, NULL);
890 * ND6 timer routine to expire default route list and prefix list
895 CURVNET_SET((struct vnet *) arg);
896 struct nd_prhead prl;
897 struct nd_prefix *pr, *npr;
899 struct in6_ifaddr *ia6, *nia6;
904 nd6_defrouter_timer();
907 * expire interface addresses.
908 * in the past the loop was inside prefix expiry processing.
909 * However, from a stricter speci-confrmance standpoint, we should
910 * rather separate address lifetimes and prefix lifetimes.
912 * XXXRW: in6_ifaddrhead locking.
915 CK_STAILQ_FOREACH_SAFE(ia6, &V_in6_ifaddrhead, ia_link, nia6) {
916 /* check address lifetime */
917 if (IFA6_IS_INVALID(ia6)) {
921 * If the expiring address is temporary, try
922 * regenerating a new one. This would be useful when
923 * we suspended a laptop PC, then turned it on after a
924 * period that could invalidate all temporary
925 * addresses. Although we may have to restart the
926 * loop (see below), it must be after purging the
927 * address. Otherwise, we'd see an infinite loop of
930 if (V_ip6_use_tempaddr &&
931 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0) {
932 if (regen_tmpaddr(ia6) == 0)
936 in6_purgeaddr(&ia6->ia_ifa);
939 goto addrloop; /* XXX: see below */
940 } else if (IFA6_IS_DEPRECATED(ia6)) {
941 int oldflags = ia6->ia6_flags;
943 ia6->ia6_flags |= IN6_IFF_DEPRECATED;
946 * If a temporary address has just become deprecated,
947 * regenerate a new one if possible.
949 if (V_ip6_use_tempaddr &&
950 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0 &&
951 (oldflags & IN6_IFF_DEPRECATED) == 0) {
953 if (regen_tmpaddr(ia6) == 0) {
955 * A new temporary address is
957 * XXX: this means the address chain
958 * has changed while we are still in
959 * the loop. Although the change
960 * would not cause disaster (because
961 * it's not a deletion, but an
962 * addition,) we'd rather restart the
963 * loop just for safety. Or does this
964 * significantly reduce performance??
969 } else if ((ia6->ia6_flags & IN6_IFF_TENTATIVE) != 0) {
971 * Schedule DAD for a tentative address. This happens
972 * if the interface was down or not running
973 * when the address was configured.
977 delay = arc4random() %
978 (MAX_RTR_SOLICITATION_DELAY * hz);
979 nd6_dad_start((struct ifaddr *)ia6, delay);
982 * Check status of the interface. If it is down,
983 * mark the address as tentative for future DAD.
986 if ((ND_IFINFO(ifp)->flags & ND6_IFF_NO_DAD) == 0 &&
987 ((ifp->if_flags & IFF_UP) == 0 ||
988 (ifp->if_drv_flags & IFF_DRV_RUNNING) == 0 ||
989 (ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) != 0)){
990 ia6->ia6_flags &= ~IN6_IFF_DUPLICATED;
991 ia6->ia6_flags |= IN6_IFF_TENTATIVE;
995 * A new RA might have made a deprecated address
998 ia6->ia6_flags &= ~IN6_IFF_DEPRECATED;
1004 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, npr) {
1006 * Expire prefixes. Since the pltime is only used for
1007 * autoconfigured addresses, pltime processing for prefixes is
1010 * Only unlink after all derived addresses have expired. This
1011 * may not occur until two hours after the prefix has expired
1012 * per RFC 4862. If the prefix expires before its derived
1013 * addresses, mark it off-link. This will be done automatically
1014 * after unlinking if no address references remain.
1016 if (pr->ndpr_vltime == ND6_INFINITE_LIFETIME ||
1017 time_uptime - pr->ndpr_lastupdate <= pr->ndpr_vltime)
1020 if (pr->ndpr_addrcnt == 0) {
1021 nd6_prefix_unlink(pr, &prl);
1024 if ((pr->ndpr_stateflags & NDPRF_ONLINK) != 0) {
1025 genid = V_nd6_list_genid;
1029 (void)nd6_prefix_offlink(pr);
1030 ND6_ONLINK_UNLOCK();
1032 nd6_prefix_rele(pr);
1033 if (genid != V_nd6_list_genid)
1039 while ((pr = LIST_FIRST(&prl)) != NULL) {
1040 LIST_REMOVE(pr, ndpr_entry);
1044 callout_reset(&V_nd6_timer_ch, V_nd6_prune * hz,
1045 nd6_timer, curvnet);
1051 * ia6 - deprecated/invalidated temporary address
1054 regen_tmpaddr(struct in6_ifaddr *ia6)
1058 struct in6_ifaddr *public_ifa6 = NULL;
1060 ifp = ia6->ia_ifa.ifa_ifp;
1062 CK_STAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1063 struct in6_ifaddr *it6;
1065 if (ifa->ifa_addr->sa_family != AF_INET6)
1068 it6 = (struct in6_ifaddr *)ifa;
1070 /* ignore no autoconf addresses. */
1071 if ((it6->ia6_flags & IN6_IFF_AUTOCONF) == 0)
1074 /* ignore autoconf addresses with different prefixes. */
1075 if (it6->ia6_ndpr == NULL || it6->ia6_ndpr != ia6->ia6_ndpr)
1079 * Now we are looking at an autoconf address with the same
1080 * prefix as ours. If the address is temporary and is still
1081 * preferred, do not create another one. It would be rare, but
1082 * could happen, for example, when we resume a laptop PC after
1085 if ((it6->ia6_flags & IN6_IFF_TEMPORARY) != 0 &&
1086 !IFA6_IS_DEPRECATED(it6)) {
1092 * This is a public autoconf address that has the same prefix
1093 * as ours. If it is preferred, keep it. We can't break the
1094 * loop here, because there may be a still-preferred temporary
1095 * address with the prefix.
1097 if (!IFA6_IS_DEPRECATED(it6))
1100 if (public_ifa6 != NULL)
1101 ifa_ref(&public_ifa6->ia_ifa);
1102 IF_ADDR_RUNLOCK(ifp);
1104 if (public_ifa6 != NULL) {
1107 if ((e = in6_tmpifadd(public_ifa6, 0, 0)) != 0) {
1108 ifa_free(&public_ifa6->ia_ifa);
1109 log(LOG_NOTICE, "regen_tmpaddr: failed to create a new"
1110 " tmp addr,errno=%d\n", e);
1113 ifa_free(&public_ifa6->ia_ifa);
1121 * Remove prefix and default router list entries corresponding to ifp. Neighbor
1122 * cache entries are freed in in6_domifdetach().
1125 nd6_purge(struct ifnet *ifp)
1127 struct nd_prhead prl;
1128 struct nd_prefix *pr, *npr;
1132 /* Purge default router list entries toward ifp. */
1133 nd6_defrouter_purge(ifp);
1137 * Remove prefixes on ifp. We should have already removed addresses on
1138 * this interface, so no addresses should be referencing these prefixes.
1140 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, npr) {
1141 if (pr->ndpr_ifp == ifp)
1142 nd6_prefix_unlink(pr, &prl);
1146 /* Delete the unlinked prefix objects. */
1147 while ((pr = LIST_FIRST(&prl)) != NULL) {
1148 LIST_REMOVE(pr, ndpr_entry);
1152 /* cancel default outgoing interface setting */
1153 if (V_nd6_defifindex == ifp->if_index)
1154 nd6_setdefaultiface(0);
1156 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
1157 /* Refresh default router list. */
1158 defrouter_select_fib(ifp->if_fib);
1163 * the caller acquires and releases the lock on the lltbls
1164 * Returns the llentry locked
1167 nd6_lookup(const struct in6_addr *addr6, int flags, struct ifnet *ifp)
1169 struct sockaddr_in6 sin6;
1172 bzero(&sin6, sizeof(sin6));
1173 sin6.sin6_len = sizeof(struct sockaddr_in6);
1174 sin6.sin6_family = AF_INET6;
1175 sin6.sin6_addr = *addr6;
1177 IF_AFDATA_LOCK_ASSERT(ifp);
1179 ln = lla_lookup(LLTABLE6(ifp), flags, (struct sockaddr *)&sin6);
1185 nd6_alloc(const struct in6_addr *addr6, int flags, struct ifnet *ifp)
1187 struct sockaddr_in6 sin6;
1190 bzero(&sin6, sizeof(sin6));
1191 sin6.sin6_len = sizeof(struct sockaddr_in6);
1192 sin6.sin6_family = AF_INET6;
1193 sin6.sin6_addr = *addr6;
1195 ln = lltable_alloc_entry(LLTABLE6(ifp), 0, (struct sockaddr *)&sin6);
1197 ln->ln_state = ND6_LLINFO_NOSTATE;
1203 * Test whether a given IPv6 address is a neighbor or not, ignoring
1204 * the actual neighbor cache. The neighbor cache is ignored in order
1205 * to not reenter the routing code from within itself.
1208 nd6_is_new_addr_neighbor(const struct sockaddr_in6 *addr, struct ifnet *ifp)
1210 struct nd_prefix *pr;
1212 struct rt_addrinfo info;
1213 struct sockaddr_in6 rt_key;
1214 const struct sockaddr *dst6;
1219 * A link-local address is always a neighbor.
1220 * XXX: a link does not necessarily specify a single interface.
1222 if (IN6_IS_ADDR_LINKLOCAL(&addr->sin6_addr)) {
1223 struct sockaddr_in6 sin6_copy;
1227 * We need sin6_copy since sa6_recoverscope() may modify the
1231 if (sa6_recoverscope(&sin6_copy))
1232 return (0); /* XXX: should be impossible */
1233 if (in6_setscope(&sin6_copy.sin6_addr, ifp, &zone))
1235 if (sin6_copy.sin6_scope_id == zone)
1241 bzero(&rt_key, sizeof(rt_key));
1242 bzero(&info, sizeof(info));
1243 info.rti_info[RTAX_DST] = (struct sockaddr *)&rt_key;
1246 * If the address matches one of our addresses,
1247 * it should be a neighbor.
1248 * If the address matches one of our on-link prefixes, it should be a
1253 LIST_FOREACH(pr, &V_nd_prefix, ndpr_entry) {
1254 if (pr->ndpr_ifp != ifp)
1257 if ((pr->ndpr_stateflags & NDPRF_ONLINK) == 0) {
1258 dst6 = (const struct sockaddr *)&pr->ndpr_prefix;
1261 * We only need to check all FIBs if add_addr_allfibs
1262 * is unset. If set, checking any FIB will suffice.
1264 fibnum = V_rt_add_addr_allfibs ? rt_numfibs - 1 : 0;
1265 for (; fibnum < rt_numfibs; fibnum++) {
1266 genid = V_nd6_list_genid;
1270 * Restore length field before
1273 rt_key.sin6_len = sizeof(rt_key);
1274 error = rib_lookup_info(fibnum, dst6, 0, 0,
1278 if (genid != V_nd6_list_genid)
1287 * This is the case where multiple interfaces
1288 * have the same prefix, but only one is installed
1289 * into the routing table and that prefix entry
1290 * is not the one being examined here. In the case
1291 * where RADIX_MPATH is enabled, multiple route
1292 * entries (of the same rt_key value) will be
1293 * installed because the interface addresses all
1296 if (!IN6_ARE_ADDR_EQUAL(&pr->ndpr_prefix.sin6_addr,
1301 if (IN6_ARE_MASKED_ADDR_EQUAL(&pr->ndpr_prefix.sin6_addr,
1302 &addr->sin6_addr, &pr->ndpr_mask)) {
1310 * If the address is assigned on the node of the other side of
1311 * a p2p interface, the address should be a neighbor.
1313 if (ifp->if_flags & IFF_POINTOPOINT) {
1315 CK_STAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1316 if (ifa->ifa_addr->sa_family != addr->sin6_family)
1318 if (ifa->ifa_dstaddr != NULL &&
1319 sa_equal(addr, ifa->ifa_dstaddr)) {
1320 IF_ADDR_RUNLOCK(ifp);
1324 IF_ADDR_RUNLOCK(ifp);
1328 * If the default router list is empty, all addresses are regarded
1329 * as on-link, and thus, as a neighbor.
1331 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV &&
1332 nd6_defrouter_list_empty() &&
1333 V_nd6_defifindex == ifp->if_index) {
1342 * Detect if a given IPv6 address identifies a neighbor on a given link.
1343 * XXX: should take care of the destination of a p2p link?
1346 nd6_is_addr_neighbor(const struct sockaddr_in6 *addr, struct ifnet *ifp)
1348 struct llentry *lle;
1351 IF_AFDATA_UNLOCK_ASSERT(ifp);
1352 if (nd6_is_new_addr_neighbor(addr, ifp))
1356 * Even if the address matches none of our addresses, it might be
1357 * in the neighbor cache.
1359 IF_AFDATA_RLOCK(ifp);
1360 if ((lle = nd6_lookup(&addr->sin6_addr, 0, ifp)) != NULL) {
1364 IF_AFDATA_RUNLOCK(ifp);
1369 * Free an nd6 llinfo entry.
1370 * Since the function would cause significant changes in the kernel, DO NOT
1371 * make it global, unless you have a strong reason for the change, and are sure
1372 * that the change is safe.
1374 * Set noinline to be dtrace-friendly
1376 static __noinline void
1377 nd6_free(struct llentry **lnp, int gc)
1381 struct nd_defrouter *dr;
1386 LLE_WLOCK_ASSERT(ln);
1389 ifp = lltable_get_ifp(ln->lle_tbl);
1390 if ((ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) != 0)
1391 dr = defrouter_lookup_locked(&ln->r_l3addr.addr6, ifp);
1396 if ((ln->la_flags & LLE_DELETED) == 0)
1397 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_EXPIRED);
1400 * we used to have pfctlinput(PRC_HOSTDEAD) here.
1401 * even though it is not harmful, it was not really necessary.
1405 nd6_llinfo_settimer_locked(ln, -1);
1407 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
1408 if (dr != NULL && dr->expire &&
1409 ln->ln_state == ND6_LLINFO_STALE && gc) {
1411 * If the reason for the deletion is just garbage
1412 * collection, and the neighbor is an active default
1413 * router, do not delete it. Instead, reset the GC
1414 * timer using the router's lifetime.
1415 * Simply deleting the entry would affect default
1416 * router selection, which is not necessarily a good
1417 * thing, especially when we're using router preference
1419 * XXX: the check for ln_state would be redundant,
1420 * but we intentionally keep it just in case.
1422 if (dr->expire > time_uptime)
1423 nd6_llinfo_settimer_locked(ln,
1424 (dr->expire - time_uptime) * hz);
1426 nd6_llinfo_settimer_locked(ln,
1427 (long)V_nd6_gctimer * hz);
1437 * Unreachablity of a router might affect the default
1438 * router selection and on-link detection of advertised
1443 * Temporarily fake the state to choose a new default
1444 * router and to perform on-link determination of
1445 * prefixes correctly.
1446 * Below the state will be set correctly,
1447 * or the entry itself will be deleted.
1449 ln->ln_state = ND6_LLINFO_INCOMPLETE;
1452 if (ln->ln_router || dr) {
1455 * We need to unlock to avoid a LOR with rt6_flush() with the
1456 * rnh and for the calls to pfxlist_onlink_check() and
1457 * defrouter_select_fib() in the block further down for calls
1458 * into nd6_lookup(). We still hold a ref.
1463 * rt6_flush must be called whether or not the neighbor
1464 * is in the Default Router List.
1465 * See a corresponding comment in nd6_na_input().
1467 rt6_flush(&ln->r_l3addr.addr6, ifp);
1472 * Since defrouter_select_fib() does not affect the
1473 * on-link determination and MIP6 needs the check
1474 * before the default router selection, we perform
1477 pfxlist_onlink_check();
1480 * Refresh default router list.
1482 defrouter_select_fib(dr->ifp->if_fib);
1486 * If this entry was added by an on-link redirect, remove the
1487 * corresponding host route.
1489 if (ln->la_flags & LLE_REDIRECT)
1490 nd6_free_redirect(ln);
1492 if (ln->ln_router || dr)
1497 * Save to unlock. We still hold an extra reference and will not
1498 * free(9) in llentry_free() if someone else holds one as well.
1501 IF_AFDATA_LOCK(ifp);
1503 /* Guard against race with other llentry_free(). */
1504 if (ln->la_flags & LLE_LINKED) {
1505 /* Remove callout reference */
1507 lltable_unlink_entry(ln->lle_tbl, ln);
1509 IF_AFDATA_UNLOCK(ifp);
1517 nd6_isdynrte(const struct rtentry *rt, void *xap)
1520 if (rt->rt_flags == (RTF_UP | RTF_HOST | RTF_DYNAMIC))
1526 * Remove the rtentry for the given llentry,
1527 * both of which were installed by a redirect.
1530 nd6_free_redirect(const struct llentry *ln)
1533 struct sockaddr_in6 sin6;
1534 struct rt_addrinfo info;
1536 lltable_fill_sa_entry(ln, (struct sockaddr *)&sin6);
1537 memset(&info, 0, sizeof(info));
1538 info.rti_info[RTAX_DST] = (struct sockaddr *)&sin6;
1539 info.rti_filter = nd6_isdynrte;
1541 for (fibnum = 0; fibnum < rt_numfibs; fibnum++)
1542 rtrequest1_fib(RTM_DELETE, &info, NULL, fibnum);
1546 * Rejuvenate this function for routing operations related
1550 nd6_rtrequest(int req, struct rtentry *rt, struct rt_addrinfo *info)
1552 struct sockaddr_in6 *gateway;
1553 struct nd_defrouter *dr;
1556 gateway = (struct sockaddr_in6 *)rt->rt_gateway;
1567 * Only indirect routes are interesting.
1569 if ((rt->rt_flags & RTF_GATEWAY) == 0)
1572 * check for default route
1574 if (IN6_ARE_ADDR_EQUAL(&in6addr_any,
1575 &SIN6(rt_key(rt))->sin6_addr)) {
1576 dr = defrouter_lookup(&gateway->sin6_addr, ifp);
1588 nd6_ioctl(u_long cmd, caddr_t data, struct ifnet *ifp)
1590 struct in6_ndireq *ndi = (struct in6_ndireq *)data;
1591 struct in6_nbrinfo *nbi = (struct in6_nbrinfo *)data;
1592 struct in6_ndifreq *ndif = (struct in6_ndifreq *)data;
1595 if (ifp->if_afdata[AF_INET6] == NULL)
1596 return (EPFNOSUPPORT);
1598 case OSIOCGIFINFO_IN6:
1600 /* XXX: old ndp(8) assumes a positive value for linkmtu. */
1601 bzero(&ND, sizeof(ND));
1602 ND.linkmtu = IN6_LINKMTU(ifp);
1603 ND.maxmtu = ND_IFINFO(ifp)->maxmtu;
1604 ND.basereachable = ND_IFINFO(ifp)->basereachable;
1605 ND.reachable = ND_IFINFO(ifp)->reachable;
1606 ND.retrans = ND_IFINFO(ifp)->retrans;
1607 ND.flags = ND_IFINFO(ifp)->flags;
1608 ND.recalctm = ND_IFINFO(ifp)->recalctm;
1609 ND.chlim = ND_IFINFO(ifp)->chlim;
1611 case SIOCGIFINFO_IN6:
1612 ND = *ND_IFINFO(ifp);
1614 case SIOCSIFINFO_IN6:
1616 * used to change host variables from userland.
1617 * intended for a use on router to reflect RA configurations.
1619 /* 0 means 'unspecified' */
1620 if (ND.linkmtu != 0) {
1621 if (ND.linkmtu < IPV6_MMTU ||
1622 ND.linkmtu > IN6_LINKMTU(ifp)) {
1626 ND_IFINFO(ifp)->linkmtu = ND.linkmtu;
1629 if (ND.basereachable != 0) {
1630 int obasereachable = ND_IFINFO(ifp)->basereachable;
1632 ND_IFINFO(ifp)->basereachable = ND.basereachable;
1633 if (ND.basereachable != obasereachable)
1634 ND_IFINFO(ifp)->reachable =
1635 ND_COMPUTE_RTIME(ND.basereachable);
1637 if (ND.retrans != 0)
1638 ND_IFINFO(ifp)->retrans = ND.retrans;
1640 ND_IFINFO(ifp)->chlim = ND.chlim;
1642 case SIOCSIFINFO_FLAGS:
1645 struct in6_ifaddr *ia;
1647 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) &&
1648 !(ND.flags & ND6_IFF_IFDISABLED)) {
1649 /* ifdisabled 1->0 transision */
1652 * If the interface is marked as ND6_IFF_IFDISABLED and
1653 * has an link-local address with IN6_IFF_DUPLICATED,
1654 * do not clear ND6_IFF_IFDISABLED.
1655 * See RFC 4862, Section 5.4.5.
1658 CK_STAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1659 if (ifa->ifa_addr->sa_family != AF_INET6)
1661 ia = (struct in6_ifaddr *)ifa;
1662 if ((ia->ia6_flags & IN6_IFF_DUPLICATED) &&
1663 IN6_IS_ADDR_LINKLOCAL(IA6_IN6(ia)))
1666 IF_ADDR_RUNLOCK(ifp);
1669 /* LLA is duplicated. */
1670 ND.flags |= ND6_IFF_IFDISABLED;
1671 log(LOG_ERR, "Cannot enable an interface"
1672 " with a link-local address marked"
1675 ND_IFINFO(ifp)->flags &= ~ND6_IFF_IFDISABLED;
1676 if (ifp->if_flags & IFF_UP)
1679 } else if (!(ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) &&
1680 (ND.flags & ND6_IFF_IFDISABLED)) {
1681 /* ifdisabled 0->1 transision */
1682 /* Mark all IPv6 address as tentative. */
1684 ND_IFINFO(ifp)->flags |= ND6_IFF_IFDISABLED;
1685 if (V_ip6_dad_count > 0 &&
1686 (ND_IFINFO(ifp)->flags & ND6_IFF_NO_DAD) == 0) {
1688 CK_STAILQ_FOREACH(ifa, &ifp->if_addrhead,
1690 if (ifa->ifa_addr->sa_family !=
1693 ia = (struct in6_ifaddr *)ifa;
1694 ia->ia6_flags |= IN6_IFF_TENTATIVE;
1696 IF_ADDR_RUNLOCK(ifp);
1700 if (ND.flags & ND6_IFF_AUTO_LINKLOCAL) {
1701 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_AUTO_LINKLOCAL)) {
1702 /* auto_linklocal 0->1 transision */
1704 /* If no link-local address on ifp, configure */
1705 ND_IFINFO(ifp)->flags |= ND6_IFF_AUTO_LINKLOCAL;
1706 in6_ifattach(ifp, NULL);
1707 } else if (!(ND.flags & ND6_IFF_IFDISABLED) &&
1708 ifp->if_flags & IFF_UP) {
1710 * When the IF already has
1711 * ND6_IFF_AUTO_LINKLOCAL, no link-local
1712 * address is assigned, and IFF_UP, try to
1716 CK_STAILQ_FOREACH(ifa, &ifp->if_addrhead,
1718 if (ifa->ifa_addr->sa_family !=
1721 ia = (struct in6_ifaddr *)ifa;
1722 if (IN6_IS_ADDR_LINKLOCAL(IA6_IN6(ia)))
1725 IF_ADDR_RUNLOCK(ifp);
1727 /* No LLA is configured. */
1728 in6_ifattach(ifp, NULL);
1732 ND_IFINFO(ifp)->flags = ND.flags;
1735 case SIOCSNDFLUSH_IN6: /* XXX: the ioctl name is confusing... */
1736 /* sync kernel routing table with the default router list */
1740 case SIOCSPFXFLUSH_IN6:
1742 /* flush all the prefix advertised by routers */
1743 struct in6_ifaddr *ia, *ia_next;
1744 struct nd_prefix *pr, *next;
1745 struct nd_prhead prl;
1750 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, next) {
1751 if (IN6_IS_ADDR_LINKLOCAL(&pr->ndpr_prefix.sin6_addr))
1753 nd6_prefix_unlink(pr, &prl);
1757 while ((pr = LIST_FIRST(&prl)) != NULL) {
1758 LIST_REMOVE(pr, ndpr_entry);
1759 /* XXXRW: in6_ifaddrhead locking. */
1760 CK_STAILQ_FOREACH_SAFE(ia, &V_in6_ifaddrhead, ia_link,
1762 if ((ia->ia6_flags & IN6_IFF_AUTOCONF) == 0)
1765 if (ia->ia6_ndpr == pr)
1766 in6_purgeaddr(&ia->ia_ifa);
1772 case SIOCSRTRFLUSH_IN6:
1774 /* flush all the default routers */
1777 nd6_defrouter_flush_all();
1781 case SIOCGNBRINFO_IN6:
1784 struct in6_addr nb_addr = nbi->addr; /* make local for safety */
1786 if ((error = in6_setscope(&nb_addr, ifp, NULL)) != 0)
1789 IF_AFDATA_RLOCK(ifp);
1790 ln = nd6_lookup(&nb_addr, 0, ifp);
1791 IF_AFDATA_RUNLOCK(ifp);
1797 nbi->state = ln->ln_state;
1798 nbi->asked = ln->la_asked;
1799 nbi->isrouter = ln->ln_router;
1800 if (ln->la_expire == 0)
1803 nbi->expire = ln->la_expire + ln->lle_remtime / hz +
1804 (time_second - time_uptime);
1808 case SIOCGDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */
1809 ndif->ifindex = V_nd6_defifindex;
1811 case SIOCSDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */
1812 return (nd6_setdefaultiface(ndif->ifindex));
1818 * Calculates new isRouter value based on provided parameters and
1822 nd6_is_router(int type, int code, int is_new, int old_addr, int new_addr,
1827 * ICMP6 type dependent behavior.
1829 * NS: clear IsRouter if new entry
1830 * RS: clear IsRouter
1831 * RA: set IsRouter if there's lladdr
1832 * redir: clear IsRouter if new entry
1835 * The spec says that we must set IsRouter in the following cases:
1836 * - If lladdr exist, set IsRouter. This means (1-5).
1837 * - If it is old entry (!newentry), set IsRouter. This means (7).
1838 * So, based on the spec, in (1-5) and (7) cases we must set IsRouter.
1839 * A quetion arises for (1) case. (1) case has no lladdr in the
1840 * neighbor cache, this is similar to (6).
1841 * This case is rare but we figured that we MUST NOT set IsRouter.
1843 * is_new old_addr new_addr NS RS RA redir
1850 * 1 -- n (6) c c c s
1851 * 1 -- y (7) c c s c s
1855 switch (type & 0xff) {
1856 case ND_NEIGHBOR_SOLICIT:
1858 * New entry must have is_router flag cleared.
1860 if (is_new) /* (6-7) */
1865 * If the icmp is a redirect to a better router, always set the
1866 * is_router flag. Otherwise, if the entry is newly created,
1867 * clear the flag. [RFC 2461, sec 8.3]
1869 if (code == ND_REDIRECT_ROUTER)
1872 if (is_new) /* (6-7) */
1876 case ND_ROUTER_SOLICIT:
1878 * is_router flag must always be cleared.
1882 case ND_ROUTER_ADVERT:
1884 * Mark an entry with lladdr as a router.
1886 if ((!is_new && (old_addr || new_addr)) || /* (2-5) */
1887 (is_new && new_addr)) { /* (7) */
1897 * Create neighbor cache entry and cache link-layer address,
1898 * on reception of inbound ND6 packets. (RS/RA/NS/redirect)
1901 * code - type dependent information
1905 nd6_cache_lladdr(struct ifnet *ifp, struct in6_addr *from, char *lladdr,
1906 int lladdrlen, int type, int code)
1908 struct llentry *ln = NULL, *ln_tmp;
1914 uint16_t router = 0;
1915 struct sockaddr_in6 sin6;
1916 struct mbuf *chain = NULL;
1917 u_char linkhdr[LLE_MAX_LINKHDR];
1921 IF_AFDATA_UNLOCK_ASSERT(ifp);
1923 KASSERT(ifp != NULL, ("%s: ifp == NULL", __func__));
1924 KASSERT(from != NULL, ("%s: from == NULL", __func__));
1926 /* nothing must be updated for unspecified address */
1927 if (IN6_IS_ADDR_UNSPECIFIED(from))
1931 * Validation about ifp->if_addrlen and lladdrlen must be done in
1934 * XXX If the link does not have link-layer adderss, what should
1935 * we do? (ifp->if_addrlen == 0)
1936 * Spec says nothing in sections for RA, RS and NA. There's small
1937 * description on it in NS section (RFC 2461 7.2.3).
1939 flags = lladdr ? LLE_EXCLUSIVE : 0;
1940 IF_AFDATA_RLOCK(ifp);
1941 ln = nd6_lookup(from, flags, ifp);
1942 IF_AFDATA_RUNLOCK(ifp);
1945 flags |= LLE_EXCLUSIVE;
1946 ln = nd6_alloc(from, 0, ifp);
1951 * Since we already know all the data for the new entry,
1952 * fill it before insertion.
1954 if (lladdr != NULL) {
1955 linkhdrsize = sizeof(linkhdr);
1956 if (lltable_calc_llheader(ifp, AF_INET6, lladdr,
1957 linkhdr, &linkhdrsize, &lladdr_off) != 0)
1959 lltable_set_entry_addr(ifp, ln, linkhdr, linkhdrsize,
1963 IF_AFDATA_WLOCK(ifp);
1965 /* Prefer any existing lle over newly-created one */
1966 ln_tmp = nd6_lookup(from, LLE_EXCLUSIVE, ifp);
1968 lltable_link_entry(LLTABLE6(ifp), ln);
1969 IF_AFDATA_WUNLOCK(ifp);
1970 if (ln_tmp == NULL) {
1971 /* No existing lle, mark as new entry (6,7) */
1973 if (lladdr != NULL) { /* (7) */
1974 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE);
1975 EVENTHANDLER_INVOKE(lle_event, ln,
1979 lltable_free_entry(LLTABLE6(ifp), ln);
1984 /* do nothing if static ndp is set */
1985 if ((ln->la_flags & LLE_STATIC)) {
1986 if (flags & LLE_EXCLUSIVE)
1993 olladdr = (ln->la_flags & LLE_VALID) ? 1 : 0;
1994 if (olladdr && lladdr) {
1995 llchange = bcmp(lladdr, ln->ll_addr,
1997 } else if (!olladdr && lladdr)
2003 * newentry olladdr lladdr llchange (*=record)
2006 * 0 n y y (3) * STALE
2008 * 0 y y y (5) * STALE
2009 * 1 -- n -- (6) NOSTATE(= PASSIVE)
2010 * 1 -- y -- (7) * STALE
2014 if (is_newentry == 0 && llchange != 0) {
2015 do_update = 1; /* (3,5) */
2018 * Record source link-layer address
2019 * XXX is it dependent to ifp->if_type?
2021 linkhdrsize = sizeof(linkhdr);
2022 if (lltable_calc_llheader(ifp, AF_INET6, lladdr,
2023 linkhdr, &linkhdrsize, &lladdr_off) != 0)
2026 if (lltable_try_set_entry_addr(ifp, ln, linkhdr, linkhdrsize,
2028 /* Entry was deleted */
2032 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE);
2034 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_RESOLVED);
2036 if (ln->la_hold != NULL)
2037 nd6_grab_holdchain(ln, &chain, &sin6);
2040 /* Calculates new router status */
2041 router = nd6_is_router(type, code, is_newentry, olladdr,
2042 lladdr != NULL ? 1 : 0, ln->ln_router);
2044 ln->ln_router = router;
2045 /* Mark non-router redirects with special flag */
2046 if ((type & 0xFF) == ND_REDIRECT && code != ND_REDIRECT_ROUTER)
2047 ln->la_flags |= LLE_REDIRECT;
2049 if (flags & LLE_EXCLUSIVE)
2055 nd6_flush_holdchain(ifp, chain, &sin6);
2058 * When the link-layer address of a router changes, select the
2059 * best router again. In particular, when the neighbor entry is newly
2060 * created, it might affect the selection policy.
2061 * Question: can we restrict the first condition to the "is_newentry"
2063 * XXX: when we hear an RA from a new router with the link-layer
2064 * address option, defrouter_select_fib() is called twice, since
2065 * defrtrlist_update called the function as well. However, I believe
2066 * we can compromise the overhead, since it only happens the first
2068 * XXX: although defrouter_select_fib() should not have a bad effect
2069 * for those are not autoconfigured hosts, we explicitly avoid such
2072 if ((do_update || is_newentry) && router &&
2073 ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
2075 * guaranteed recursion
2077 defrouter_select_fib(ifp->if_fib);
2082 nd6_slowtimo(void *arg)
2084 CURVNET_SET((struct vnet *) arg);
2085 struct nd_ifinfo *nd6if;
2088 callout_reset(&V_nd6_slowtimo_ch, ND6_SLOWTIMER_INTERVAL * hz,
2089 nd6_slowtimo, curvnet);
2090 IFNET_RLOCK_NOSLEEP();
2091 CK_STAILQ_FOREACH(ifp, &V_ifnet, if_link) {
2092 if (ifp->if_afdata[AF_INET6] == NULL)
2094 nd6if = ND_IFINFO(ifp);
2095 if (nd6if->basereachable && /* already initialized */
2096 (nd6if->recalctm -= ND6_SLOWTIMER_INTERVAL) <= 0) {
2098 * Since reachable time rarely changes by router
2099 * advertisements, we SHOULD insure that a new random
2100 * value gets recomputed at least once every few hours.
2103 nd6if->recalctm = V_nd6_recalc_reachtm_interval;
2104 nd6if->reachable = ND_COMPUTE_RTIME(nd6if->basereachable);
2107 IFNET_RUNLOCK_NOSLEEP();
2112 nd6_grab_holdchain(struct llentry *ln, struct mbuf **chain,
2113 struct sockaddr_in6 *sin6)
2116 LLE_WLOCK_ASSERT(ln);
2118 *chain = ln->la_hold;
2120 lltable_fill_sa_entry(ln, (struct sockaddr *)sin6);
2122 if (ln->ln_state == ND6_LLINFO_STALE) {
2125 * The first time we send a packet to a
2126 * neighbor whose entry is STALE, we have
2127 * to change the state to DELAY and a sets
2128 * a timer to expire in DELAY_FIRST_PROBE_TIME
2129 * seconds to ensure do neighbor unreachability
2130 * detection on expiration.
2133 nd6_llinfo_setstate(ln, ND6_LLINFO_DELAY);
2138 nd6_output_ifp(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *m,
2139 struct sockaddr_in6 *dst, struct route *ro)
2143 struct ip6_hdr *ip6;
2147 mac_netinet6_nd6_send(ifp, m);
2151 * If called from nd6_ns_output() (NS), nd6_na_output() (NA),
2152 * icmp6_redirect_output() (REDIRECT) or from rip6_output() (RS, RA
2153 * as handled by rtsol and rtadvd), mbufs will be tagged for SeND
2154 * to be diverted to user space. When re-injected into the kernel,
2155 * send_output() will directly dispatch them to the outgoing interface.
2157 if (send_sendso_input_hook != NULL) {
2158 mtag = m_tag_find(m, PACKET_TAG_ND_OUTGOING, NULL);
2160 ip6 = mtod(m, struct ip6_hdr *);
2161 ip6len = sizeof(struct ip6_hdr) + ntohs(ip6->ip6_plen);
2162 /* Use the SEND socket */
2163 error = send_sendso_input_hook(m, ifp, SND_OUT,
2165 /* -1 == no app on SEND socket */
2166 if (error == 0 || error != -1)
2171 m_clrprotoflags(m); /* Avoid confusing lower layers. */
2172 IP_PROBE(send, NULL, NULL, mtod(m, struct ip6_hdr *), ifp, NULL,
2173 mtod(m, struct ip6_hdr *));
2175 if ((ifp->if_flags & IFF_LOOPBACK) == 0)
2178 error = (*ifp->if_output)(origifp, m, (struct sockaddr *)dst, ro);
2183 * Lookup link headerfor @sa_dst address. Stores found
2184 * data in @desten buffer. Copy of lle ln_flags can be also
2185 * saved in @pflags if @pflags is non-NULL.
2187 * If destination LLE does not exists or lle state modification
2188 * is required, call "slow" version.
2191 * - 0 on success (address copied to buffer).
2192 * - EWOULDBLOCK (no local error, but address is still unresolved)
2193 * - other errors (alloc failure, etc)
2196 nd6_resolve(struct ifnet *ifp, int is_gw, struct mbuf *m,
2197 const struct sockaddr *sa_dst, u_char *desten, uint32_t *pflags,
2198 struct llentry **plle)
2200 struct llentry *ln = NULL;
2201 const struct sockaddr_in6 *dst6;
2206 dst6 = (const struct sockaddr_in6 *)sa_dst;
2208 /* discard the packet if IPv6 operation is disabled on the interface */
2209 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED)) {
2211 return (ENETDOWN); /* better error? */
2214 if (m != NULL && m->m_flags & M_MCAST) {
2215 switch (ifp->if_type) {
2219 ETHER_MAP_IPV6_MULTICAST(&dst6->sin6_addr,
2224 return (EAFNOSUPPORT);
2228 IF_AFDATA_RLOCK(ifp);
2229 ln = nd6_lookup(&dst6->sin6_addr, plle ? LLE_EXCLUSIVE : LLE_UNLOCKED,
2231 if (ln != NULL && (ln->r_flags & RLLE_VALID) != 0) {
2232 /* Entry found, let's copy lle info */
2233 bcopy(ln->r_linkdata, desten, ln->r_hdrlen);
2235 *pflags = LLE_VALID | (ln->r_flags & RLLE_IFADDR);
2236 /* Check if we have feedback request from nd6 timer */
2237 if (ln->r_skip_req != 0) {
2239 ln->r_skip_req = 0; /* Notify that entry was used */
2240 ln->lle_hittime = time_uptime;
2248 IF_AFDATA_RUNLOCK(ifp);
2250 } else if (plle && ln)
2252 IF_AFDATA_RUNLOCK(ifp);
2254 return (nd6_resolve_slow(ifp, 0, m, dst6, desten, pflags, plle));
2259 * Do L2 address resolution for @sa_dst address. Stores found
2260 * address in @desten buffer. Copy of lle ln_flags can be also
2261 * saved in @pflags if @pflags is non-NULL.
2264 * Function assume that destination LLE does not exist,
2265 * is invalid or stale, so LLE_EXCLUSIVE lock needs to be acquired.
2267 * Set noinline to be dtrace-friendly
2269 static __noinline int
2270 nd6_resolve_slow(struct ifnet *ifp, int flags, struct mbuf *m,
2271 const struct sockaddr_in6 *dst, u_char *desten, uint32_t *pflags,
2272 struct llentry **plle)
2274 struct llentry *lle = NULL, *lle_tmp;
2275 struct in6_addr *psrc, src;
2276 int send_ns, ll_len;
2280 * Address resolution or Neighbor Unreachability Detection
2282 * At this point, the destination of the packet must be a unicast
2283 * or an anycast address(i.e. not a multicast).
2286 IF_AFDATA_RLOCK(ifp);
2287 lle = nd6_lookup(&dst->sin6_addr, LLE_EXCLUSIVE, ifp);
2288 IF_AFDATA_RUNLOCK(ifp);
2289 if ((lle == NULL) && nd6_is_addr_neighbor(dst, ifp)) {
2291 * Since nd6_is_addr_neighbor() internally calls nd6_lookup(),
2292 * the condition below is not very efficient. But we believe
2293 * it is tolerable, because this should be a rare case.
2295 lle = nd6_alloc(&dst->sin6_addr, 0, ifp);
2297 char ip6buf[INET6_ADDRSTRLEN];
2299 "nd6_output: can't allocate llinfo for %s "
2301 ip6_sprintf(ip6buf, &dst->sin6_addr), lle);
2306 IF_AFDATA_WLOCK(ifp);
2308 /* Prefer any existing entry over newly-created one */
2309 lle_tmp = nd6_lookup(&dst->sin6_addr, LLE_EXCLUSIVE, ifp);
2310 if (lle_tmp == NULL)
2311 lltable_link_entry(LLTABLE6(ifp), lle);
2312 IF_AFDATA_WUNLOCK(ifp);
2313 if (lle_tmp != NULL) {
2314 lltable_free_entry(LLTABLE6(ifp), lle);
2325 LLE_WLOCK_ASSERT(lle);
2328 * The first time we send a packet to a neighbor whose entry is
2329 * STALE, we have to change the state to DELAY and a sets a timer to
2330 * expire in DELAY_FIRST_PROBE_TIME seconds to ensure do
2331 * neighbor unreachability detection on expiration.
2334 if (lle->ln_state == ND6_LLINFO_STALE)
2335 nd6_llinfo_setstate(lle, ND6_LLINFO_DELAY);
2338 * If the neighbor cache entry has a state other than INCOMPLETE
2339 * (i.e. its link-layer address is already resolved), just
2342 if (lle->ln_state > ND6_LLINFO_INCOMPLETE) {
2343 if (flags & LLE_ADDRONLY) {
2344 lladdr = lle->ll_addr;
2345 ll_len = ifp->if_addrlen;
2347 lladdr = lle->r_linkdata;
2348 ll_len = lle->r_hdrlen;
2350 bcopy(lladdr, desten, ll_len);
2352 *pflags = lle->la_flags;
2362 * There is a neighbor cache entry, but no ethernet address
2363 * response yet. Append this latest packet to the end of the
2364 * packet queue in the mbuf. When it exceeds nd6_maxqueuelen,
2365 * the oldest packet in the queue will be removed.
2368 if (lle->la_hold != NULL) {
2369 struct mbuf *m_hold;
2373 for (m_hold = lle->la_hold; m_hold; m_hold = m_hold->m_nextpkt){
2375 if (m_hold->m_nextpkt == NULL) {
2376 m_hold->m_nextpkt = m;
2380 while (i >= V_nd6_maxqueuelen) {
2381 m_hold = lle->la_hold;
2382 lle->la_hold = lle->la_hold->m_nextpkt;
2391 * If there has been no NS for the neighbor after entering the
2392 * INCOMPLETE state, send the first solicitation.
2393 * Note that for newly-created lle la_asked will be 0,
2394 * so we will transition from ND6_LLINFO_NOSTATE to
2395 * ND6_LLINFO_INCOMPLETE state here.
2399 if (lle->la_asked == 0) {
2402 psrc = nd6_llinfo_get_holdsrc(lle, &src);
2404 nd6_llinfo_setstate(lle, ND6_LLINFO_INCOMPLETE);
2408 nd6_ns_output(ifp, psrc, NULL, &dst->sin6_addr, NULL);
2410 return (EWOULDBLOCK);
2414 * Do L2 address resolution for @sa_dst address. Stores found
2415 * address in @desten buffer. Copy of lle ln_flags can be also
2416 * saved in @pflags if @pflags is non-NULL.
2419 * - 0 on success (address copied to buffer).
2420 * - EWOULDBLOCK (no local error, but address is still unresolved)
2421 * - other errors (alloc failure, etc)
2424 nd6_resolve_addr(struct ifnet *ifp, int flags, const struct sockaddr *dst,
2425 char *desten, uint32_t *pflags)
2429 flags |= LLE_ADDRONLY;
2430 error = nd6_resolve_slow(ifp, flags, NULL,
2431 (const struct sockaddr_in6 *)dst, desten, pflags, NULL);
2436 nd6_flush_holdchain(struct ifnet *ifp, struct mbuf *chain,
2437 struct sockaddr_in6 *dst)
2439 struct mbuf *m, *m_head;
2446 m_head = m_head->m_nextpkt;
2447 error = nd6_output_ifp(ifp, ifp, m, dst, NULL);
2452 * note that intermediate errors are blindly ignored
2458 nd6_need_cache(struct ifnet *ifp)
2461 * XXX: we currently do not make neighbor cache on any interface
2462 * other than Ethernet and GIF.
2465 * - unidirectional tunnels needs no ND
2467 switch (ifp->if_type) {
2471 case IFT_INFINIBAND:
2473 case IFT_PROPVIRTUAL:
2481 * Add pernament ND6 link-layer record for given
2482 * interface address.
2484 * Very similar to IPv4 arp_ifinit(), but:
2485 * 1) IPv6 DAD is performed in different place
2486 * 2) It is called by IPv6 protocol stack in contrast to
2487 * arp_ifinit() which is typically called in SIOCSIFADDR
2488 * driver ioctl handler.
2492 nd6_add_ifa_lle(struct in6_ifaddr *ia)
2495 struct llentry *ln, *ln_tmp;
2496 struct sockaddr *dst;
2498 ifp = ia->ia_ifa.ifa_ifp;
2499 if (nd6_need_cache(ifp) == 0)
2502 ia->ia_ifa.ifa_rtrequest = nd6_rtrequest;
2503 dst = (struct sockaddr *)&ia->ia_addr;
2504 ln = lltable_alloc_entry(LLTABLE6(ifp), LLE_IFADDR, dst);
2508 IF_AFDATA_WLOCK(ifp);
2510 /* Unlink any entry if exists */
2511 ln_tmp = lla_lookup(LLTABLE6(ifp), LLE_EXCLUSIVE, dst);
2513 lltable_unlink_entry(LLTABLE6(ifp), ln_tmp);
2514 lltable_link_entry(LLTABLE6(ifp), ln);
2515 IF_AFDATA_WUNLOCK(ifp);
2518 EVENTHANDLER_INVOKE(lle_event, ln_tmp, LLENTRY_EXPIRED);
2519 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_RESOLVED);
2523 llentry_free(ln_tmp);
2529 * Removes either all lle entries for given @ia, or lle
2530 * corresponding to @ia address.
2533 nd6_rem_ifa_lle(struct in6_ifaddr *ia, int all)
2535 struct sockaddr_in6 mask, addr;
2536 struct sockaddr *saddr, *smask;
2539 ifp = ia->ia_ifa.ifa_ifp;
2540 memcpy(&addr, &ia->ia_addr, sizeof(ia->ia_addr));
2541 memcpy(&mask, &ia->ia_prefixmask, sizeof(ia->ia_prefixmask));
2542 saddr = (struct sockaddr *)&addr;
2543 smask = (struct sockaddr *)&mask;
2546 lltable_prefix_free(AF_INET6, saddr, smask, LLE_STATIC);
2548 lltable_delete_addr(LLTABLE6(ifp), LLE_IFADDR, saddr);
2552 clear_llinfo_pqueue(struct llentry *ln)
2554 struct mbuf *m_hold, *m_hold_next;
2556 for (m_hold = ln->la_hold; m_hold; m_hold = m_hold_next) {
2557 m_hold_next = m_hold->m_nextpkt;
2565 nd6_sysctl_prlist(SYSCTL_HANDLER_ARGS)
2567 struct in6_prefix p;
2568 struct sockaddr_in6 s6;
2569 struct nd_prefix *pr;
2570 struct nd_pfxrouter *pfr;
2573 char ip6buf[INET6_ADDRSTRLEN];
2578 error = sysctl_wire_old_buffer(req, 0);
2582 bzero(&p, sizeof(p));
2583 p.origin = PR_ORIG_RA;
2584 bzero(&s6, sizeof(s6));
2585 s6.sin6_family = AF_INET6;
2586 s6.sin6_len = sizeof(s6);
2589 LIST_FOREACH(pr, &V_nd_prefix, ndpr_entry) {
2590 p.prefix = pr->ndpr_prefix;
2591 if (sa6_recoverscope(&p.prefix)) {
2592 log(LOG_ERR, "scope error in prefix list (%s)\n",
2593 ip6_sprintf(ip6buf, &p.prefix.sin6_addr));
2594 /* XXX: press on... */
2596 p.raflags = pr->ndpr_raf;
2597 p.prefixlen = pr->ndpr_plen;
2598 p.vltime = pr->ndpr_vltime;
2599 p.pltime = pr->ndpr_pltime;
2600 p.if_index = pr->ndpr_ifp->if_index;
2601 if (pr->ndpr_vltime == ND6_INFINITE_LIFETIME)
2604 /* XXX: we assume time_t is signed. */
2606 ~((time_t)1 << ((sizeof(maxexpire) * 8) - 1));
2607 if (pr->ndpr_vltime < maxexpire - pr->ndpr_lastupdate)
2608 p.expire = pr->ndpr_lastupdate +
2610 (time_second - time_uptime);
2612 p.expire = maxexpire;
2614 p.refcnt = pr->ndpr_addrcnt;
2615 p.flags = pr->ndpr_stateflags;
2617 LIST_FOREACH(pfr, &pr->ndpr_advrtrs, pfr_entry)
2619 error = SYSCTL_OUT(req, &p, sizeof(p));
2622 LIST_FOREACH(pfr, &pr->ndpr_advrtrs, pfr_entry) {
2623 s6.sin6_addr = pfr->router->rtaddr;
2624 if (sa6_recoverscope(&s6))
2626 "scope error in prefix list (%s)\n",
2627 ip6_sprintf(ip6buf, &pfr->router->rtaddr));
2628 error = SYSCTL_OUT(req, &s6, sizeof(s6));
2637 SYSCTL_PROC(_net_inet6_icmp6, ICMPV6CTL_ND6_PRLIST, nd6_prlist,
2638 CTLTYPE_OPAQUE | CTLFLAG_RD | CTLFLAG_MPSAFE,
2639 NULL, 0, nd6_sysctl_prlist, "S,in6_prefix",
2641 SYSCTL_INT(_net_inet6_icmp6, ICMPV6CTL_ND6_MAXQLEN, nd6_maxqueuelen,
2642 CTLFLAG_VNET | CTLFLAG_RW, &VNET_NAME(nd6_maxqueuelen), 1, "");
2643 SYSCTL_INT(_net_inet6_icmp6, OID_AUTO, nd6_gctimer,
2644 CTLFLAG_VNET | CTLFLAG_RW, &VNET_NAME(nd6_gctimer), (60 * 60 * 24), "");