2 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the project nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * $KAME: nd6.c,v 1.144 2001/05/24 07:44:00 itojun Exp $
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
36 #include "opt_inet6.h"
38 #include <sys/param.h>
39 #include <sys/systm.h>
40 #include <sys/callout.h>
41 #include <sys/random.h>
42 #include <sys/malloc.h>
44 #include <sys/socket.h>
45 #include <sys/sockio.h>
47 #include <sys/kernel.h>
48 #include <sys/protosw.h>
49 #include <sys/errno.h>
50 #include <sys/syslog.h>
52 #include <sys/rwlock.h>
53 #include <sys/queue.h>
55 #include <sys/sysctl.h>
58 #include <net/if_var.h>
59 #include <net/if_arc.h>
60 #include <net/if_dl.h>
61 #include <net/if_types.h>
62 #include <net/iso88025.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))
90 VNET_DEFINE(int, nd6_prune) = 1; /* walk list every 1 seconds */
91 VNET_DEFINE(int, nd6_delay) = 5; /* delay first probe time 5 second */
92 VNET_DEFINE(int, nd6_umaxtries) = 3; /* maximum unicast query */
93 VNET_DEFINE(int, nd6_mmaxtries) = 3; /* maximum multicast query */
94 VNET_DEFINE(int, nd6_useloopback) = 1; /* use loopback interface for
96 VNET_DEFINE(int, nd6_gctimer) = (60 * 60 * 24); /* 1 day: garbage
99 /* preventing too many loops in ND option parsing */
100 static VNET_DEFINE(int, nd6_maxndopt) = 10; /* max # of ND options allowed */
102 VNET_DEFINE(int, nd6_maxnudhint) = 0; /* max # of subsequent upper
104 static VNET_DEFINE(int, nd6_maxqueuelen) = 1; /* max pkts cached in unresolved
107 static VNET_DEFINE(int, nd6_on_link) = 1; /* Send unsolicited ND's on link up */
109 #define V_nd6_maxndopt VNET(nd6_maxndopt)
110 #define V_nd6_maxqueuelen VNET(nd6_maxqueuelen)
111 #define V_nd6_on_link VNET(nd6_on_link)
114 VNET_DEFINE(int, nd6_debug) = 1;
116 VNET_DEFINE(int, nd6_debug) = 0;
119 static eventhandler_tag lle_event_eh;
120 static eventhandler_tag ifnet_link_event_eh;
124 static int nd6_inuse, nd6_allocated;
127 VNET_DEFINE(struct nd_drhead, nd_defrouter);
128 VNET_DEFINE(struct nd_prhead, nd_prefix);
130 VNET_DEFINE(int, nd6_recalc_reachtm_interval) = ND6_RECALC_REACHTM_INTERVAL;
131 #define V_nd6_recalc_reachtm_interval VNET(nd6_recalc_reachtm_interval)
133 int (*send_sendso_input_hook)(struct mbuf *, struct ifnet *, int, int);
135 static int nd6_is_new_addr_neighbor(const struct sockaddr_in6 *,
137 static void nd6_setmtu0(struct ifnet *, struct nd_ifinfo *);
138 static void nd6_slowtimo(void *);
139 static int regen_tmpaddr(struct in6_ifaddr *);
140 static void nd6_free(struct llentry *, int);
141 static void nd6_free_redirect(const struct llentry *);
142 static void nd6_llinfo_timer(void *);
143 static void nd6_llinfo_settimer_locked(struct llentry *, long);
144 static void clear_llinfo_pqueue(struct llentry *);
145 static void nd6_rtrequest(int, struct rtentry *, struct rt_addrinfo *);
146 static int nd6_resolve_slow(struct ifnet *, struct mbuf *,
147 const struct sockaddr_in6 *, u_char *, uint32_t *);
148 static int nd6_need_cache(struct ifnet *);
151 static VNET_DEFINE(struct callout, nd6_slowtimo_ch);
152 #define V_nd6_slowtimo_ch VNET(nd6_slowtimo_ch)
154 VNET_DEFINE(struct callout, nd6_timer_ch);
157 nd6_lle_event(void *arg __unused, struct llentry *lle, int evt)
159 struct rt_addrinfo rtinfo;
160 struct sockaddr_in6 dst;
161 struct sockaddr_dl gw;
165 LLE_WLOCK_ASSERT(lle);
167 if (lltable_get_af(lle->lle_tbl) != AF_INET6)
171 case LLENTRY_RESOLVED:
173 KASSERT(lle->la_flags & LLE_VALID,
174 ("%s: %p resolved but not valid?", __func__, lle));
176 case LLENTRY_EXPIRED:
183 ifp = lltable_get_ifp(lle->lle_tbl);
185 bzero(&dst, sizeof(dst));
186 bzero(&gw, sizeof(gw));
187 bzero(&rtinfo, sizeof(rtinfo));
188 lltable_fill_sa_entry(lle, (struct sockaddr *)&dst);
189 dst.sin6_scope_id = in6_getscopezone(ifp,
190 in6_addrscope(&dst.sin6_addr));
191 gw.sdl_len = sizeof(struct sockaddr_dl);
192 gw.sdl_family = AF_LINK;
193 gw.sdl_alen = ifp->if_addrlen;
194 gw.sdl_index = ifp->if_index;
195 gw.sdl_type = ifp->if_type;
196 if (evt == LLENTRY_RESOLVED)
197 bcopy(&lle->ll_addr, gw.sdl_data, ifp->if_addrlen);
198 rtinfo.rti_info[RTAX_DST] = (struct sockaddr *)&dst;
199 rtinfo.rti_info[RTAX_GATEWAY] = (struct sockaddr *)&gw;
200 rtinfo.rti_addrs = RTA_DST | RTA_GATEWAY;
201 rt_missmsg_fib(type, &rtinfo, RTF_HOST | RTF_LLDATA | (
202 type == RTM_ADD ? RTF_UP: 0), 0, RT_DEFAULT_FIB);
206 nd6_ifnet_link_event(void *arg __unused, struct ifnet *ifp, int linkstate)
209 if (linkstate == LINK_STATE_UP && V_nd6_on_link)
210 nd6_na_output_unsolicited(ifp);
217 LIST_INIT(&V_nd_prefix);
219 /* initialization of the default router list */
220 TAILQ_INIT(&V_nd_defrouter);
223 callout_init(&V_nd6_slowtimo_ch, 0);
224 callout_reset(&V_nd6_slowtimo_ch, ND6_SLOWTIMER_INTERVAL * hz,
225 nd6_slowtimo, curvnet);
228 if (IS_DEFAULT_VNET(curvnet)) {
229 lle_event_eh = EVENTHANDLER_REGISTER(lle_event, nd6_lle_event,
230 NULL, EVENTHANDLER_PRI_ANY);
231 ifnet_link_event_eh = EVENTHANDLER_REGISTER(ifnet_link_event,
232 nd6_ifnet_link_event, NULL, EVENTHANDLER_PRI_ANY);
241 callout_drain(&V_nd6_slowtimo_ch);
242 callout_drain(&V_nd6_timer_ch);
243 if (IS_DEFAULT_VNET(curvnet)) {
244 EVENTHANDLER_DEREGISTER(lle_event, lle_event_eh);
245 EVENTHANDLER_DEREGISTER(ifnet_link_event, ifnet_link_event_eh);
251 nd6_ifattach(struct ifnet *ifp)
253 struct nd_ifinfo *nd;
255 nd = (struct nd_ifinfo *)malloc(sizeof(*nd), M_IP6NDP, M_WAITOK|M_ZERO);
258 nd->chlim = IPV6_DEFHLIM;
259 nd->basereachable = REACHABLE_TIME;
260 nd->reachable = ND_COMPUTE_RTIME(nd->basereachable);
261 nd->retrans = RETRANS_TIMER;
263 nd->flags = ND6_IFF_PERFORMNUD;
265 /* A loopback interface always has ND6_IFF_AUTO_LINKLOCAL.
266 * XXXHRS: Clear ND6_IFF_AUTO_LINKLOCAL on an IFT_BRIDGE interface by
267 * default regardless of the V_ip6_auto_linklocal configuration to
268 * give a reasonable default behavior.
270 if ((V_ip6_auto_linklocal && ifp->if_type != IFT_BRIDGE) ||
271 (ifp->if_flags & IFF_LOOPBACK))
272 nd->flags |= ND6_IFF_AUTO_LINKLOCAL;
274 * A loopback interface does not need to accept RTADV.
275 * XXXHRS: Clear ND6_IFF_ACCEPT_RTADV on an IFT_BRIDGE interface by
276 * default regardless of the V_ip6_accept_rtadv configuration to
277 * prevent the interface from accepting RA messages arrived
278 * on one of the member interfaces with ND6_IFF_ACCEPT_RTADV.
280 if (V_ip6_accept_rtadv &&
281 !(ifp->if_flags & IFF_LOOPBACK) &&
282 (ifp->if_type != IFT_BRIDGE))
283 nd->flags |= ND6_IFF_ACCEPT_RTADV;
284 if (V_ip6_no_radr && !(ifp->if_flags & IFF_LOOPBACK))
285 nd->flags |= ND6_IFF_NO_RADR;
287 /* XXX: we cannot call nd6_setmtu since ifp is not fully initialized */
288 nd6_setmtu0(ifp, nd);
294 nd6_ifdetach(struct nd_ifinfo *nd)
301 * Reset ND level link MTU. This function is called when the physical MTU
302 * changes, which means we might have to adjust the ND level MTU.
305 nd6_setmtu(struct ifnet *ifp)
307 if (ifp->if_afdata[AF_INET6] == NULL)
310 nd6_setmtu0(ifp, ND_IFINFO(ifp));
313 /* XXX todo: do not maintain copy of ifp->if_mtu in ndi->maxmtu */
315 nd6_setmtu0(struct ifnet *ifp, struct nd_ifinfo *ndi)
319 omaxmtu = ndi->maxmtu;
321 switch (ifp->if_type) {
323 ndi->maxmtu = MIN(ARC_PHDS_MAXMTU, ifp->if_mtu); /* RFC2497 */
326 ndi->maxmtu = MIN(FDDIIPMTU, ifp->if_mtu); /* RFC2467 */
329 ndi->maxmtu = MIN(ISO88025_MAX_MTU, ifp->if_mtu);
332 ndi->maxmtu = ifp->if_mtu;
337 * Decreasing the interface MTU under IPV6 minimum MTU may cause
338 * undesirable situation. We thus notify the operator of the change
339 * explicitly. The check for omaxmtu is necessary to restrict the
340 * log to the case of changing the MTU, not initializing it.
342 if (omaxmtu >= IPV6_MMTU && ndi->maxmtu < IPV6_MMTU) {
343 log(LOG_NOTICE, "nd6_setmtu0: "
344 "new link MTU on %s (%lu) is too small for IPv6\n",
345 if_name(ifp), (unsigned long)ndi->maxmtu);
348 if (ndi->maxmtu > V_in6_maxmtu)
349 in6_setmaxmtu(); /* check all interfaces just in case */
354 nd6_option_init(void *opt, int icmp6len, union nd_opts *ndopts)
357 bzero(ndopts, sizeof(*ndopts));
358 ndopts->nd_opts_search = (struct nd_opt_hdr *)opt;
360 = (struct nd_opt_hdr *)(((u_char *)opt) + icmp6len);
363 ndopts->nd_opts_done = 1;
364 ndopts->nd_opts_search = NULL;
369 * Take one ND option.
372 nd6_option(union nd_opts *ndopts)
374 struct nd_opt_hdr *nd_opt;
377 KASSERT(ndopts != NULL, ("%s: ndopts == NULL", __func__));
378 KASSERT(ndopts->nd_opts_last != NULL, ("%s: uninitialized ndopts",
380 if (ndopts->nd_opts_search == NULL)
382 if (ndopts->nd_opts_done)
385 nd_opt = ndopts->nd_opts_search;
387 /* make sure nd_opt_len is inside the buffer */
388 if ((caddr_t)&nd_opt->nd_opt_len >= (caddr_t)ndopts->nd_opts_last) {
389 bzero(ndopts, sizeof(*ndopts));
393 olen = nd_opt->nd_opt_len << 3;
396 * Message validation requires that all included
397 * options have a length that is greater than zero.
399 bzero(ndopts, sizeof(*ndopts));
403 ndopts->nd_opts_search = (struct nd_opt_hdr *)((caddr_t)nd_opt + olen);
404 if (ndopts->nd_opts_search > ndopts->nd_opts_last) {
405 /* option overruns the end of buffer, invalid */
406 bzero(ndopts, sizeof(*ndopts));
408 } else if (ndopts->nd_opts_search == ndopts->nd_opts_last) {
409 /* reached the end of options chain */
410 ndopts->nd_opts_done = 1;
411 ndopts->nd_opts_search = NULL;
417 * Parse multiple ND options.
418 * This function is much easier to use, for ND routines that do not need
419 * multiple options of the same type.
422 nd6_options(union nd_opts *ndopts)
424 struct nd_opt_hdr *nd_opt;
427 KASSERT(ndopts != NULL, ("%s: ndopts == NULL", __func__));
428 KASSERT(ndopts->nd_opts_last != NULL, ("%s: uninitialized ndopts",
430 if (ndopts->nd_opts_search == NULL)
434 nd_opt = nd6_option(ndopts);
435 if (nd_opt == NULL && ndopts->nd_opts_last == NULL) {
437 * Message validation requires that all included
438 * options have a length that is greater than zero.
440 ICMP6STAT_INC(icp6s_nd_badopt);
441 bzero(ndopts, sizeof(*ndopts));
448 switch (nd_opt->nd_opt_type) {
449 case ND_OPT_SOURCE_LINKADDR:
450 case ND_OPT_TARGET_LINKADDR:
452 case ND_OPT_REDIRECTED_HEADER:
454 if (ndopts->nd_opt_array[nd_opt->nd_opt_type]) {
456 "duplicated ND6 option found (type=%d)\n",
457 nd_opt->nd_opt_type));
460 ndopts->nd_opt_array[nd_opt->nd_opt_type]
464 case ND_OPT_PREFIX_INFORMATION:
465 if (ndopts->nd_opt_array[nd_opt->nd_opt_type] == 0) {
466 ndopts->nd_opt_array[nd_opt->nd_opt_type]
469 ndopts->nd_opts_pi_end =
470 (struct nd_opt_prefix_info *)nd_opt;
472 /* What about ND_OPT_ROUTE_INFO? RFC 4191 */
473 case ND_OPT_RDNSS: /* RFC 6106 */
474 case ND_OPT_DNSSL: /* RFC 6106 */
476 * Silently ignore options we know and do not care about
482 * Unknown options must be silently ignored,
483 * to accomodate future extension to the protocol.
486 "nd6_options: unsupported option %d - "
487 "option ignored\n", nd_opt->nd_opt_type));
492 if (i > V_nd6_maxndopt) {
493 ICMP6STAT_INC(icp6s_nd_toomanyopt);
494 nd6log((LOG_INFO, "too many loop in nd opt\n"));
498 if (ndopts->nd_opts_done)
506 * ND6 timer routine to handle ND6 entries
509 nd6_llinfo_settimer_locked(struct llentry *ln, long tick)
513 LLE_WLOCK_ASSERT(ln);
518 canceled = callout_stop(&ln->lle_timer);
520 ln->la_expire = time_uptime + tick / hz;
522 if (tick > INT_MAX) {
523 ln->ln_ntick = tick - INT_MAX;
524 canceled = callout_reset(&ln->lle_timer, INT_MAX,
525 nd6_llinfo_timer, ln);
528 canceled = callout_reset(&ln->lle_timer, tick,
529 nd6_llinfo_timer, ln);
537 * Gets source address of the first packet in hold queue
538 * and stores it in @src.
539 * Returns pointer to @src (if hold queue is not empty) or NULL.
541 * Set noinline to be dtrace-friendly
543 static __noinline struct in6_addr *
544 nd6_llinfo_get_holdsrc(struct llentry *ln, struct in6_addr *src)
549 if (ln->la_hold == NULL)
553 * assume every packet in la_hold has the same IP header
556 if (sizeof(hdr) > m->m_len)
559 m_copydata(m, 0, sizeof(hdr), (caddr_t)&hdr);
566 * Checks if we need to switch from STALE state.
568 * RFC 4861 requires switching from STALE to DELAY state
569 * on first packet matching entry, waiting V_nd6_delay and
570 * transition to PROBE state (if upper layer confirmation was
573 * This code performs a bit differently:
574 * On packet hit we don't change state (but desired state
575 * can be guessed by control plane). However, after V_nd6_delay
576 * seconds code will transition to PROBE state (so DELAY state
577 * is kinda skipped in most situations).
579 * Typically, V_nd6_gctimer is bigger than V_nd6_delay, so
580 * we perform the following upon entering STALE state:
582 * 1) Arm timer to run each V_nd6_delay seconds to make sure that
583 * if packet was transmitted at the start of given interval, we
584 * would be able to switch to PROBE state in V_nd6_delay seconds
587 * 2) Reschedule timer until original V_nd6_gctimer expires keeping
588 * lle in STALE state (remaining timer value stored in lle_remtime).
590 * 3) Reschedule timer if packet was transmitted less that V_nd6_delay
593 * Returns non-zero value if the entry is still STALE (storing
594 * the next timer interval in @pdelay).
596 * Returns zero value if original timer expired or we need to switch to
597 * PROBE (store that in @do_switch variable).
600 nd6_is_stale(struct llentry *lle, long *pdelay, int *do_switch)
602 int nd_delay, nd_gctimer, r_skip_req;
607 nd_gctimer = V_nd6_gctimer;
608 nd_delay = V_nd6_delay;
611 r_skip_req = lle->r_skip_req;
612 lle_hittime = lle->lle_hittime;
615 if (r_skip_req > 0) {
618 * Nonzero r_skip_req value was set upon entering
619 * STALE state. Since value was not changed, no
620 * packets were passed using this lle. Ask for
621 * timer reschedule and keep STALE state.
623 delay = (long)(MIN(nd_gctimer, nd_delay));
625 if (lle->lle_remtime > delay)
626 lle->lle_remtime -= delay;
628 delay = lle->lle_remtime;
629 lle->lle_remtime = 0;
635 * The original ng6_gctime timeout ended,
636 * no more rescheduling.
646 * Packet received. Verify timestamp
648 delay = (long)(time_uptime - lle_hittime);
649 if (delay < nd_delay) {
652 * V_nd6_delay still not passed since the first
653 * hit in STALE state.
654 * Reshedule timer and return.
656 *pdelay = (long)(nd_delay - delay) * hz;
660 /* Request switching to probe */
667 * Switch @lle state to new state optionally arming timers.
669 * Set noinline to be dtrace-friendly
672 nd6_llinfo_setstate(struct llentry *lle, int newstate)
675 int nd_gctimer, nd_delay;
682 case ND6_LLINFO_INCOMPLETE:
683 ifp = lle->lle_tbl->llt_ifp;
684 delay = (long)ND_IFINFO(ifp)->retrans * hz / 1000;
686 case ND6_LLINFO_REACHABLE:
687 if (!ND6_LLINFO_PERMANENT(lle)) {
688 ifp = lle->lle_tbl->llt_ifp;
689 delay = (long)ND_IFINFO(ifp)->reachable * hz;
692 case ND6_LLINFO_STALE:
695 * Notify fast path that we want to know if any packet
696 * is transmitted by setting r_skip_req.
701 nd_delay = V_nd6_delay;
702 nd_gctimer = V_nd6_gctimer;
704 delay = (long)(MIN(nd_gctimer, nd_delay)) * hz;
705 remtime = (long)nd_gctimer * hz - delay;
707 case ND6_LLINFO_DELAY:
709 delay = (long)V_nd6_delay * hz;
714 nd6_llinfo_settimer_locked(lle, delay);
716 lle->lle_remtime = remtime;
717 lle->ln_state = newstate;
721 * Timer-dependent part of nd state machine.
723 * Set noinline to be dtrace-friendly
725 static __noinline void
726 nd6_llinfo_timer(void *arg)
729 struct in6_addr *dst, *pdst, *psrc, src;
731 struct nd_ifinfo *ndi = NULL;
732 int do_switch, send_ns;
735 KASSERT(arg != NULL, ("%s: arg NULL", __func__));
736 ln = (struct llentry *)arg;
738 if (callout_pending(&ln->lle_timer)) {
740 * Here we are a bit odd here in the treatment of
741 * active/pending. If the pending bit is set, it got
742 * rescheduled before I ran. The active
743 * bit we ignore, since if it was stopped
744 * in ll_tablefree() and was currently running
745 * it would have return 0 so the code would
746 * not have deleted it since the callout could
747 * not be stopped so we want to go through
748 * with the delete here now. If the callout
749 * was restarted, the pending bit will be back on and
750 * we just want to bail since the callout_reset would
751 * return 1 and our reference would have been removed
752 * by nd6_llinfo_settimer_locked above since canceled
758 ifp = ln->lle_tbl->llt_ifp;
759 CURVNET_SET(ifp->if_vnet);
760 ndi = ND_IFINFO(ifp);
762 dst = &ln->r_l3addr.addr6;
765 if (ln->ln_ntick > 0) {
766 if (ln->ln_ntick > INT_MAX) {
767 ln->ln_ntick -= INT_MAX;
768 nd6_llinfo_settimer_locked(ln, INT_MAX);
771 nd6_llinfo_settimer_locked(ln, ln->ln_ntick);
776 if (ln->la_flags & LLE_STATIC) {
780 if (ln->la_flags & LLE_DELETED) {
786 switch (ln->ln_state) {
787 case ND6_LLINFO_INCOMPLETE:
788 if (ln->la_asked < V_nd6_mmaxtries) {
791 /* Send NS to multicast address */
794 struct mbuf *m = ln->la_hold;
799 * assuming every packet in la_hold has the
800 * same IP header. Send error after unlock.
805 clear_llinfo_pqueue(ln);
807 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_TIMEDOUT);
811 icmp6_error2(m, ICMP6_DST_UNREACH,
812 ICMP6_DST_UNREACH_ADDR, 0, ifp);
815 case ND6_LLINFO_REACHABLE:
816 if (!ND6_LLINFO_PERMANENT(ln))
817 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE);
820 case ND6_LLINFO_STALE:
821 if (nd6_is_stale(ln, &delay, &do_switch) != 0) {
824 * No packet has used this entry and GC timeout
825 * has not been passed. Reshedule timer and
828 nd6_llinfo_settimer_locked(ln, delay);
832 if (do_switch == 0) {
835 * GC timer has ended and entry hasn't been used.
836 * Run Garbage collector (RFC 4861, 5.3)
838 if (!ND6_LLINFO_PERMANENT(ln)) {
839 EVENTHANDLER_INVOKE(lle_event, 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) {
865 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_EXPIRED);
871 panic("%s: paths in a dark night can be confusing: %d",
872 __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_defrouter *dr, *ndr;
897 struct nd_prefix *pr, *npr;
898 struct in6_ifaddr *ia6, *nia6;
900 callout_reset(&V_nd6_timer_ch, V_nd6_prune * hz,
903 /* expire default router list */
904 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr) {
905 if (dr->expire && dr->expire < time_uptime)
910 * expire interface addresses.
911 * in the past the loop was inside prefix expiry processing.
912 * However, from a stricter speci-confrmance standpoint, we should
913 * rather separate address lifetimes and prefix lifetimes.
915 * XXXRW: in6_ifaddrhead locking.
918 TAILQ_FOREACH_SAFE(ia6, &V_in6_ifaddrhead, ia_link, nia6) {
919 /* check address lifetime */
920 if (IFA6_IS_INVALID(ia6)) {
924 * If the expiring address is temporary, try
925 * regenerating a new one. This would be useful when
926 * we suspended a laptop PC, then turned it on after a
927 * period that could invalidate all temporary
928 * addresses. Although we may have to restart the
929 * loop (see below), it must be after purging the
930 * address. Otherwise, we'd see an infinite loop of
933 if (V_ip6_use_tempaddr &&
934 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0) {
935 if (regen_tmpaddr(ia6) == 0)
939 in6_purgeaddr(&ia6->ia_ifa);
942 goto addrloop; /* XXX: see below */
943 } else if (IFA6_IS_DEPRECATED(ia6)) {
944 int oldflags = ia6->ia6_flags;
946 ia6->ia6_flags |= IN6_IFF_DEPRECATED;
949 * If a temporary address has just become deprecated,
950 * regenerate a new one if possible.
952 if (V_ip6_use_tempaddr &&
953 (ia6->ia6_flags & IN6_IFF_TEMPORARY) != 0 &&
954 (oldflags & IN6_IFF_DEPRECATED) == 0) {
956 if (regen_tmpaddr(ia6) == 0) {
958 * A new temporary address is
960 * XXX: this means the address chain
961 * has changed while we are still in
962 * the loop. Although the change
963 * would not cause disaster (because
964 * it's not a deletion, but an
965 * addition,) we'd rather restart the
966 * loop just for safety. Or does this
967 * significantly reduce performance??
972 } else if ((ia6->ia6_flags & IN6_IFF_TENTATIVE) != 0) {
974 * Schedule DAD for a tentative address. This happens
975 * if the interface was down or not running
976 * when the address was configured.
980 delay = arc4random() %
981 (MAX_RTR_SOLICITATION_DELAY * hz);
982 nd6_dad_start((struct ifaddr *)ia6, delay);
985 * Check status of the interface. If it is down,
986 * mark the address as tentative for future DAD.
988 if ((ia6->ia_ifp->if_flags & IFF_UP) == 0 ||
989 (ia6->ia_ifp->if_drv_flags & IFF_DRV_RUNNING)
991 (ND_IFINFO(ia6->ia_ifp)->flags &
992 ND6_IFF_IFDISABLED) != 0) {
993 ia6->ia6_flags &= ~IN6_IFF_DUPLICATED;
994 ia6->ia6_flags |= IN6_IFF_TENTATIVE;
997 * A new RA might have made a deprecated address
1000 ia6->ia6_flags &= ~IN6_IFF_DEPRECATED;
1004 /* expire prefix list */
1005 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, npr) {
1007 * check prefix lifetime.
1008 * since pltime is just for autoconf, pltime processing for
1009 * prefix is not necessary.
1011 if (pr->ndpr_vltime != ND6_INFINITE_LIFETIME &&
1012 time_uptime - pr->ndpr_lastupdate > pr->ndpr_vltime) {
1015 * address expiration and prefix expiration are
1016 * separate. NEVER perform in6_purgeaddr here.
1025 * ia6 - deprecated/invalidated temporary address
1028 regen_tmpaddr(struct in6_ifaddr *ia6)
1032 struct in6_ifaddr *public_ifa6 = NULL;
1034 ifp = ia6->ia_ifa.ifa_ifp;
1036 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1037 struct in6_ifaddr *it6;
1039 if (ifa->ifa_addr->sa_family != AF_INET6)
1042 it6 = (struct in6_ifaddr *)ifa;
1044 /* ignore no autoconf addresses. */
1045 if ((it6->ia6_flags & IN6_IFF_AUTOCONF) == 0)
1048 /* ignore autoconf addresses with different prefixes. */
1049 if (it6->ia6_ndpr == NULL || it6->ia6_ndpr != ia6->ia6_ndpr)
1053 * Now we are looking at an autoconf address with the same
1054 * prefix as ours. If the address is temporary and is still
1055 * preferred, do not create another one. It would be rare, but
1056 * could happen, for example, when we resume a laptop PC after
1059 if ((it6->ia6_flags & IN6_IFF_TEMPORARY) != 0 &&
1060 !IFA6_IS_DEPRECATED(it6)) {
1066 * This is a public autoconf address that has the same prefix
1067 * as ours. If it is preferred, keep it. We can't break the
1068 * loop here, because there may be a still-preferred temporary
1069 * address with the prefix.
1071 if (!IFA6_IS_DEPRECATED(it6))
1074 if (public_ifa6 != NULL)
1075 ifa_ref(&public_ifa6->ia_ifa);
1076 IF_ADDR_RUNLOCK(ifp);
1078 if (public_ifa6 != NULL) {
1081 if ((e = in6_tmpifadd(public_ifa6, 0, 0)) != 0) {
1082 ifa_free(&public_ifa6->ia_ifa);
1083 log(LOG_NOTICE, "regen_tmpaddr: failed to create a new"
1084 " tmp addr,errno=%d\n", e);
1087 ifa_free(&public_ifa6->ia_ifa);
1095 * Nuke neighbor cache/prefix/default router management table, right before
1099 nd6_purge(struct ifnet *ifp)
1101 struct nd_defrouter *dr, *ndr;
1102 struct nd_prefix *pr, *npr;
1105 * Nuke default router list entries toward ifp.
1106 * We defer removal of default router list entries that is installed
1107 * in the routing table, in order to keep additional side effects as
1108 * small as possible.
1110 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr) {
1118 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, ndr) {
1126 /* Nuke prefix list entries toward ifp */
1127 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, npr) {
1128 if (pr->ndpr_ifp == ifp) {
1130 * Because if_detach() does *not* release prefixes
1131 * while purging addresses the reference count will
1132 * still be above zero. We therefore reset it to
1133 * make sure that the prefix really gets purged.
1135 pr->ndpr_refcnt = 0;
1138 * Previously, pr->ndpr_addr is removed as well,
1139 * but I strongly believe we don't have to do it.
1140 * nd6_purge() is only called from in6_ifdetach(),
1141 * which removes all the associated interface addresses
1143 * (jinmei@kame.net 20010129)
1149 /* cancel default outgoing interface setting */
1150 if (V_nd6_defifindex == ifp->if_index)
1151 nd6_setdefaultiface(0);
1153 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
1154 /* Refresh default router list. */
1159 * We do not nuke the neighbor cache entries here any more
1160 * because the neighbor cache is kept in if_afdata[AF_INET6].
1161 * nd6_purge() is invoked by in6_ifdetach() which is called
1162 * from if_detach() where everything gets purged. So let
1163 * in6_domifdetach() do the actual L2 table purging work.
1168 * the caller acquires and releases the lock on the lltbls
1169 * Returns the llentry locked
1172 nd6_lookup(const struct in6_addr *addr6, int flags, struct ifnet *ifp)
1174 struct sockaddr_in6 sin6;
1177 bzero(&sin6, sizeof(sin6));
1178 sin6.sin6_len = sizeof(struct sockaddr_in6);
1179 sin6.sin6_family = AF_INET6;
1180 sin6.sin6_addr = *addr6;
1182 IF_AFDATA_LOCK_ASSERT(ifp);
1184 ln = lla_lookup(LLTABLE6(ifp), flags, (struct sockaddr *)&sin6);
1190 nd6_alloc(const struct in6_addr *addr6, int flags, struct ifnet *ifp)
1192 struct sockaddr_in6 sin6;
1195 bzero(&sin6, sizeof(sin6));
1196 sin6.sin6_len = sizeof(struct sockaddr_in6);
1197 sin6.sin6_family = AF_INET6;
1198 sin6.sin6_addr = *addr6;
1200 ln = lltable_alloc_entry(LLTABLE6(ifp), 0, (struct sockaddr *)&sin6);
1202 ln->ln_state = ND6_LLINFO_NOSTATE;
1208 * Test whether a given IPv6 address is a neighbor or not, ignoring
1209 * the actual neighbor cache. The neighbor cache is ignored in order
1210 * to not reenter the routing code from within itself.
1213 nd6_is_new_addr_neighbor(const struct sockaddr_in6 *addr, struct ifnet *ifp)
1215 struct nd_prefix *pr;
1216 struct ifaddr *dstaddr;
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)
1242 * If the address matches one of our addresses,
1243 * it should be a neighbor.
1244 * If the address matches one of our on-link prefixes, it should be a
1247 LIST_FOREACH(pr, &V_nd_prefix, ndpr_entry) {
1248 if (pr->ndpr_ifp != ifp)
1251 if (!(pr->ndpr_stateflags & NDPRF_ONLINK)) {
1254 /* Always use the default FIB here. */
1255 rt = in6_rtalloc1((struct sockaddr *)&pr->ndpr_prefix,
1256 0, 0, RT_DEFAULT_FIB);
1260 * This is the case where multiple interfaces
1261 * have the same prefix, but only one is installed
1262 * into the routing table and that prefix entry
1263 * is not the one being examined here. In the case
1264 * where RADIX_MPATH is enabled, multiple route
1265 * entries (of the same rt_key value) will be
1266 * installed because the interface addresses all
1269 if (!IN6_ARE_ADDR_EQUAL(&pr->ndpr_prefix.sin6_addr,
1270 &((struct sockaddr_in6 *)rt_key(rt))->sin6_addr)) {
1277 if (IN6_ARE_MASKED_ADDR_EQUAL(&pr->ndpr_prefix.sin6_addr,
1278 &addr->sin6_addr, &pr->ndpr_mask))
1283 * If the address is assigned on the node of the other side of
1284 * a p2p interface, the address should be a neighbor.
1286 dstaddr = ifa_ifwithdstaddr((const struct sockaddr *)addr, RT_ALL_FIBS);
1287 if (dstaddr != NULL) {
1288 if (dstaddr->ifa_ifp == ifp) {
1296 * If the default router list is empty, all addresses are regarded
1297 * as on-link, and thus, as a neighbor.
1299 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV &&
1300 TAILQ_EMPTY(&V_nd_defrouter) &&
1301 V_nd6_defifindex == ifp->if_index) {
1310 * Detect if a given IPv6 address identifies a neighbor on a given link.
1311 * XXX: should take care of the destination of a p2p link?
1314 nd6_is_addr_neighbor(const struct sockaddr_in6 *addr, struct ifnet *ifp)
1316 struct llentry *lle;
1319 IF_AFDATA_UNLOCK_ASSERT(ifp);
1320 if (nd6_is_new_addr_neighbor(addr, ifp))
1324 * Even if the address matches none of our addresses, it might be
1325 * in the neighbor cache.
1327 IF_AFDATA_RLOCK(ifp);
1328 if ((lle = nd6_lookup(&addr->sin6_addr, 0, ifp)) != NULL) {
1332 IF_AFDATA_RUNLOCK(ifp);
1337 * Free an nd6 llinfo entry.
1338 * Since the function would cause significant changes in the kernel, DO NOT
1339 * make it global, unless you have a strong reason for the change, and are sure
1340 * that the change is safe.
1342 * Set noinline to be dtrace-friendly
1344 static __noinline void
1345 nd6_free(struct llentry *ln, int gc)
1347 struct nd_defrouter *dr;
1350 LLE_WLOCK_ASSERT(ln);
1353 * we used to have pfctlinput(PRC_HOSTDEAD) here.
1354 * even though it is not harmful, it was not really necessary.
1358 nd6_llinfo_settimer_locked(ln, -1);
1360 ifp = ln->lle_tbl->llt_ifp;
1362 if (ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
1363 dr = defrouter_lookup(&ln->r_l3addr.addr6, ifp);
1365 if (dr != NULL && dr->expire &&
1366 ln->ln_state == ND6_LLINFO_STALE && gc) {
1368 * If the reason for the deletion is just garbage
1369 * collection, and the neighbor is an active default
1370 * router, do not delete it. Instead, reset the GC
1371 * timer using the router's lifetime.
1372 * Simply deleting the entry would affect default
1373 * router selection, which is not necessarily a good
1374 * thing, especially when we're using router preference
1376 * XXX: the check for ln_state would be redundant,
1377 * but we intentionally keep it just in case.
1379 if (dr->expire > time_uptime)
1380 nd6_llinfo_settimer_locked(ln,
1381 (dr->expire - time_uptime) * hz);
1383 nd6_llinfo_settimer_locked(ln,
1384 (long)V_nd6_gctimer * hz);
1393 * Unreachablity of a router might affect the default
1394 * router selection and on-link detection of advertised
1399 * Temporarily fake the state to choose a new default
1400 * router and to perform on-link determination of
1401 * prefixes correctly.
1402 * Below the state will be set correctly,
1403 * or the entry itself will be deleted.
1405 ln->ln_state = ND6_LLINFO_INCOMPLETE;
1408 if (ln->ln_router || dr) {
1411 * We need to unlock to avoid a LOR with rt6_flush() with the
1412 * rnh and for the calls to pfxlist_onlink_check() and
1413 * defrouter_select() in the block further down for calls
1414 * into nd6_lookup(). We still hold a ref.
1419 * rt6_flush must be called whether or not the neighbor
1420 * is in the Default Router List.
1421 * See a corresponding comment in nd6_na_input().
1423 rt6_flush(&ln->r_l3addr.addr6, ifp);
1428 * Since defrouter_select() does not affect the
1429 * on-link determination and MIP6 needs the check
1430 * before the default router selection, we perform
1433 pfxlist_onlink_check();
1436 * Refresh default router list.
1442 * If this entry was added by an on-link redirect, remove the
1443 * corresponding host route.
1445 if (ln->la_flags & LLE_REDIRECT)
1446 nd6_free_redirect(ln);
1448 if (ln->ln_router || dr)
1453 * Save to unlock. We still hold an extra reference and will not
1454 * free(9) in llentry_free() if someone else holds one as well.
1457 IF_AFDATA_LOCK(ifp);
1459 /* Guard against race with other llentry_free(). */
1460 if (ln->la_flags & LLE_LINKED) {
1461 /* Remove callout reference */
1463 lltable_unlink_entry(ln->lle_tbl, ln);
1465 IF_AFDATA_UNLOCK(ifp);
1471 nd6_isdynrte(const struct rtentry *rt, void *xap)
1474 if (rt->rt_flags == (RTF_UP | RTF_HOST | RTF_DYNAMIC))
1480 * Remove the rtentry for the given llentry,
1481 * both of which were installed by a redirect.
1484 nd6_free_redirect(const struct llentry *ln)
1487 struct sockaddr_in6 sin6;
1488 struct rt_addrinfo info;
1490 lltable_fill_sa_entry(ln, (struct sockaddr *)&sin6);
1491 memset(&info, 0, sizeof(info));
1492 info.rti_info[RTAX_DST] = (struct sockaddr *)&sin6;
1493 info.rti_filter = nd6_isdynrte;
1495 for (fibnum = 0; fibnum < rt_numfibs; fibnum++)
1496 rtrequest1_fib(RTM_DELETE, &info, NULL, fibnum);
1500 * Rejuvenate this function for routing operations related
1504 nd6_rtrequest(int req, struct rtentry *rt, struct rt_addrinfo *info)
1506 struct sockaddr_in6 *gateway;
1507 struct nd_defrouter *dr;
1510 gateway = (struct sockaddr_in6 *)rt->rt_gateway;
1521 * Only indirect routes are interesting.
1523 if ((rt->rt_flags & RTF_GATEWAY) == 0)
1526 * check for default route
1528 if (IN6_ARE_ADDR_EQUAL(&in6addr_any,
1529 &SIN6(rt_key(rt))->sin6_addr)) {
1531 dr = defrouter_lookup(&gateway->sin6_addr, ifp);
1541 nd6_ioctl(u_long cmd, caddr_t data, struct ifnet *ifp)
1543 struct in6_ndireq *ndi = (struct in6_ndireq *)data;
1544 struct in6_nbrinfo *nbi = (struct in6_nbrinfo *)data;
1545 struct in6_ndifreq *ndif = (struct in6_ndifreq *)data;
1548 if (ifp->if_afdata[AF_INET6] == NULL)
1549 return (EPFNOSUPPORT);
1551 case OSIOCGIFINFO_IN6:
1553 /* XXX: old ndp(8) assumes a positive value for linkmtu. */
1554 bzero(&ND, sizeof(ND));
1555 ND.linkmtu = IN6_LINKMTU(ifp);
1556 ND.maxmtu = ND_IFINFO(ifp)->maxmtu;
1557 ND.basereachable = ND_IFINFO(ifp)->basereachable;
1558 ND.reachable = ND_IFINFO(ifp)->reachable;
1559 ND.retrans = ND_IFINFO(ifp)->retrans;
1560 ND.flags = ND_IFINFO(ifp)->flags;
1561 ND.recalctm = ND_IFINFO(ifp)->recalctm;
1562 ND.chlim = ND_IFINFO(ifp)->chlim;
1564 case SIOCGIFINFO_IN6:
1565 ND = *ND_IFINFO(ifp);
1567 case SIOCSIFINFO_IN6:
1569 * used to change host variables from userland.
1570 * intented for a use on router to reflect RA configurations.
1572 /* 0 means 'unspecified' */
1573 if (ND.linkmtu != 0) {
1574 if (ND.linkmtu < IPV6_MMTU ||
1575 ND.linkmtu > IN6_LINKMTU(ifp)) {
1579 ND_IFINFO(ifp)->linkmtu = ND.linkmtu;
1582 if (ND.basereachable != 0) {
1583 int obasereachable = ND_IFINFO(ifp)->basereachable;
1585 ND_IFINFO(ifp)->basereachable = ND.basereachable;
1586 if (ND.basereachable != obasereachable)
1587 ND_IFINFO(ifp)->reachable =
1588 ND_COMPUTE_RTIME(ND.basereachable);
1590 if (ND.retrans != 0)
1591 ND_IFINFO(ifp)->retrans = ND.retrans;
1593 ND_IFINFO(ifp)->chlim = ND.chlim;
1595 case SIOCSIFINFO_FLAGS:
1598 struct in6_ifaddr *ia;
1600 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) &&
1601 !(ND.flags & ND6_IFF_IFDISABLED)) {
1602 /* ifdisabled 1->0 transision */
1605 * If the interface is marked as ND6_IFF_IFDISABLED and
1606 * has an link-local address with IN6_IFF_DUPLICATED,
1607 * do not clear ND6_IFF_IFDISABLED.
1608 * See RFC 4862, Section 5.4.5.
1611 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
1612 if (ifa->ifa_addr->sa_family != AF_INET6)
1614 ia = (struct in6_ifaddr *)ifa;
1615 if ((ia->ia6_flags & IN6_IFF_DUPLICATED) &&
1616 IN6_IS_ADDR_LINKLOCAL(IA6_IN6(ia)))
1619 IF_ADDR_RUNLOCK(ifp);
1622 /* LLA is duplicated. */
1623 ND.flags |= ND6_IFF_IFDISABLED;
1624 log(LOG_ERR, "Cannot enable an interface"
1625 " with a link-local address marked"
1628 ND_IFINFO(ifp)->flags &= ~ND6_IFF_IFDISABLED;
1629 if (ifp->if_flags & IFF_UP)
1632 } else if (!(ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED) &&
1633 (ND.flags & ND6_IFF_IFDISABLED)) {
1634 /* ifdisabled 0->1 transision */
1635 /* Mark all IPv6 address as tentative. */
1637 ND_IFINFO(ifp)->flags |= ND6_IFF_IFDISABLED;
1638 if (V_ip6_dad_count > 0 &&
1639 (ND_IFINFO(ifp)->flags & ND6_IFF_NO_DAD) == 0) {
1641 TAILQ_FOREACH(ifa, &ifp->if_addrhead,
1643 if (ifa->ifa_addr->sa_family !=
1646 ia = (struct in6_ifaddr *)ifa;
1647 ia->ia6_flags |= IN6_IFF_TENTATIVE;
1649 IF_ADDR_RUNLOCK(ifp);
1653 if (ND.flags & ND6_IFF_AUTO_LINKLOCAL) {
1654 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_AUTO_LINKLOCAL)) {
1655 /* auto_linklocal 0->1 transision */
1657 /* If no link-local address on ifp, configure */
1658 ND_IFINFO(ifp)->flags |= ND6_IFF_AUTO_LINKLOCAL;
1659 in6_ifattach(ifp, NULL);
1660 } else if (!(ND.flags & ND6_IFF_IFDISABLED) &&
1661 ifp->if_flags & IFF_UP) {
1663 * When the IF already has
1664 * ND6_IFF_AUTO_LINKLOCAL, no link-local
1665 * address is assigned, and IFF_UP, try to
1669 TAILQ_FOREACH(ifa, &ifp->if_addrhead,
1671 if (ifa->ifa_addr->sa_family !=
1674 ia = (struct in6_ifaddr *)ifa;
1675 if (IN6_IS_ADDR_LINKLOCAL(IA6_IN6(ia)))
1678 IF_ADDR_RUNLOCK(ifp);
1680 /* No LLA is configured. */
1681 in6_ifattach(ifp, NULL);
1685 ND_IFINFO(ifp)->flags = ND.flags;
1688 case SIOCSNDFLUSH_IN6: /* XXX: the ioctl name is confusing... */
1689 /* sync kernel routing table with the default router list */
1693 case SIOCSPFXFLUSH_IN6:
1695 /* flush all the prefix advertised by routers */
1696 struct nd_prefix *pr, *next;
1698 LIST_FOREACH_SAFE(pr, &V_nd_prefix, ndpr_entry, next) {
1699 struct in6_ifaddr *ia, *ia_next;
1701 if (IN6_IS_ADDR_LINKLOCAL(&pr->ndpr_prefix.sin6_addr))
1704 /* do we really have to remove addresses as well? */
1705 /* XXXRW: in6_ifaddrhead locking. */
1706 TAILQ_FOREACH_SAFE(ia, &V_in6_ifaddrhead, ia_link,
1708 if ((ia->ia6_flags & IN6_IFF_AUTOCONF) == 0)
1711 if (ia->ia6_ndpr == pr)
1712 in6_purgeaddr(&ia->ia_ifa);
1718 case SIOCSRTRFLUSH_IN6:
1720 /* flush all the default routers */
1721 struct nd_defrouter *dr, *next;
1724 TAILQ_FOREACH_SAFE(dr, &V_nd_defrouter, dr_entry, next) {
1730 case SIOCGNBRINFO_IN6:
1733 struct in6_addr nb_addr = nbi->addr; /* make local for safety */
1735 if ((error = in6_setscope(&nb_addr, ifp, NULL)) != 0)
1738 IF_AFDATA_RLOCK(ifp);
1739 ln = nd6_lookup(&nb_addr, 0, ifp);
1740 IF_AFDATA_RUNLOCK(ifp);
1746 nbi->state = ln->ln_state;
1747 nbi->asked = ln->la_asked;
1748 nbi->isrouter = ln->ln_router;
1749 if (ln->la_expire == 0)
1752 nbi->expire = ln->la_expire + ln->lle_remtime / hz +
1753 (time_second - time_uptime);
1757 case SIOCGDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */
1758 ndif->ifindex = V_nd6_defifindex;
1760 case SIOCSDEFIFACE_IN6: /* XXX: should be implemented as a sysctl? */
1761 return (nd6_setdefaultiface(ndif->ifindex));
1767 * Calculates new isRouter value based on provided parameters and
1771 nd6_is_router(int type, int code, int is_new, int old_addr, int new_addr,
1776 * ICMP6 type dependent behavior.
1778 * NS: clear IsRouter if new entry
1779 * RS: clear IsRouter
1780 * RA: set IsRouter if there's lladdr
1781 * redir: clear IsRouter if new entry
1784 * The spec says that we must set IsRouter in the following cases:
1785 * - If lladdr exist, set IsRouter. This means (1-5).
1786 * - If it is old entry (!newentry), set IsRouter. This means (7).
1787 * So, based on the spec, in (1-5) and (7) cases we must set IsRouter.
1788 * A quetion arises for (1) case. (1) case has no lladdr in the
1789 * neighbor cache, this is similar to (6).
1790 * This case is rare but we figured that we MUST NOT set IsRouter.
1792 * is_new old_addr new_addr NS RS RA redir
1799 * 1 -- n (6) c c c s
1800 * 1 -- y (7) c c s c s
1804 switch (type & 0xff) {
1805 case ND_NEIGHBOR_SOLICIT:
1807 * New entry must have is_router flag cleared.
1809 if (is_new) /* (6-7) */
1814 * If the icmp is a redirect to a better router, always set the
1815 * is_router flag. Otherwise, if the entry is newly created,
1816 * clear the flag. [RFC 2461, sec 8.3]
1818 if (code == ND_REDIRECT_ROUTER)
1821 if (is_new) /* (6-7) */
1825 case ND_ROUTER_SOLICIT:
1827 * is_router flag must always be cleared.
1831 case ND_ROUTER_ADVERT:
1833 * Mark an entry with lladdr as a router.
1835 if ((!is_new && (old_addr || new_addr)) || /* (2-5) */
1836 (is_new && new_addr)) { /* (7) */
1846 * Create neighbor cache entry and cache link-layer address,
1847 * on reception of inbound ND6 packets. (RS/RA/NS/redirect)
1850 * code - type dependent information
1854 nd6_cache_lladdr(struct ifnet *ifp, struct in6_addr *from, char *lladdr,
1855 int lladdrlen, int type, int code)
1857 struct llentry *ln = NULL, *ln_tmp;
1863 uint16_t router = 0;
1864 struct sockaddr_in6 sin6;
1865 struct mbuf *chain = NULL;
1867 IF_AFDATA_UNLOCK_ASSERT(ifp);
1869 KASSERT(ifp != NULL, ("%s: ifp == NULL", __func__));
1870 KASSERT(from != NULL, ("%s: from == NULL", __func__));
1872 /* nothing must be updated for unspecified address */
1873 if (IN6_IS_ADDR_UNSPECIFIED(from))
1877 * Validation about ifp->if_addrlen and lladdrlen must be done in
1880 * XXX If the link does not have link-layer adderss, what should
1881 * we do? (ifp->if_addrlen == 0)
1882 * Spec says nothing in sections for RA, RS and NA. There's small
1883 * description on it in NS section (RFC 2461 7.2.3).
1885 flags = lladdr ? LLE_EXCLUSIVE : 0;
1886 IF_AFDATA_RLOCK(ifp);
1887 ln = nd6_lookup(from, flags, ifp);
1888 IF_AFDATA_RUNLOCK(ifp);
1891 flags |= LLE_EXCLUSIVE;
1892 ln = nd6_alloc(from, 0, ifp);
1897 * Since we already know all the data for the new entry,
1898 * fill it before insertion.
1901 lltable_set_entry_addr(ifp, ln, lladdr);
1902 IF_AFDATA_WLOCK(ifp);
1904 /* Prefer any existing lle over newly-created one */
1905 ln_tmp = nd6_lookup(from, LLE_EXCLUSIVE, ifp);
1907 lltable_link_entry(LLTABLE6(ifp), ln);
1908 IF_AFDATA_WUNLOCK(ifp);
1909 if (ln_tmp == NULL) {
1910 /* No existing lle, mark as new entry (6,7) */
1912 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE);
1913 if (lladdr != NULL) /* (7) */
1914 EVENTHANDLER_INVOKE(lle_event, ln,
1917 lltable_free_entry(LLTABLE6(ifp), ln);
1922 /* do nothing if static ndp is set */
1923 if ((ln->la_flags & LLE_STATIC)) {
1924 if (flags & LLE_EXCLUSIVE)
1931 olladdr = (ln->la_flags & LLE_VALID) ? 1 : 0;
1932 if (olladdr && lladdr) {
1933 llchange = bcmp(lladdr, &ln->ll_addr,
1935 } else if (!olladdr && lladdr)
1941 * newentry olladdr lladdr llchange (*=record)
1944 * 0 n y y (3) * STALE
1946 * 0 y y y (5) * STALE
1947 * 1 -- n -- (6) NOSTATE(= PASSIVE)
1948 * 1 -- y -- (7) * STALE
1952 if (is_newentry == 0 && llchange != 0) {
1953 do_update = 1; /* (3,5) */
1956 * Record source link-layer address
1957 * XXX is it dependent to ifp->if_type?
1959 if (lltable_try_set_entry_addr(ifp, ln, lladdr) == 0) {
1960 /* Entry was deleted */
1964 nd6_llinfo_setstate(ln, ND6_LLINFO_STALE);
1966 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_RESOLVED);
1968 if (ln->la_hold != NULL)
1969 nd6_grab_holdchain(ln, &chain, &sin6);
1972 /* Calculates new router status */
1973 router = nd6_is_router(type, code, is_newentry, olladdr,
1974 lladdr != NULL ? 1 : 0, ln->ln_router);
1976 ln->ln_router = router;
1977 /* Mark non-router redirects with special flag */
1978 if ((type & 0xFF) == ND_REDIRECT && code != ND_REDIRECT_ROUTER)
1979 ln->la_flags |= LLE_REDIRECT;
1981 if (flags & LLE_EXCLUSIVE)
1987 nd6_flush_holdchain(ifp, ifp, chain, &sin6);
1990 * When the link-layer address of a router changes, select the
1991 * best router again. In particular, when the neighbor entry is newly
1992 * created, it might affect the selection policy.
1993 * Question: can we restrict the first condition to the "is_newentry"
1995 * XXX: when we hear an RA from a new router with the link-layer
1996 * address option, defrouter_select() is called twice, since
1997 * defrtrlist_update called the function as well. However, I believe
1998 * we can compromise the overhead, since it only happens the first
2000 * XXX: although defrouter_select() should not have a bad effect
2001 * for those are not autoconfigured hosts, we explicitly avoid such
2004 if ((do_update || is_newentry) && router &&
2005 ND_IFINFO(ifp)->flags & ND6_IFF_ACCEPT_RTADV) {
2007 * guaranteed recursion
2014 nd6_slowtimo(void *arg)
2016 CURVNET_SET((struct vnet *) arg);
2017 struct nd_ifinfo *nd6if;
2020 callout_reset(&V_nd6_slowtimo_ch, ND6_SLOWTIMER_INTERVAL * hz,
2021 nd6_slowtimo, curvnet);
2022 IFNET_RLOCK_NOSLEEP();
2023 TAILQ_FOREACH(ifp, &V_ifnet, if_link) {
2024 if (ifp->if_afdata[AF_INET6] == NULL)
2026 nd6if = ND_IFINFO(ifp);
2027 if (nd6if->basereachable && /* already initialized */
2028 (nd6if->recalctm -= ND6_SLOWTIMER_INTERVAL) <= 0) {
2030 * Since reachable time rarely changes by router
2031 * advertisements, we SHOULD insure that a new random
2032 * value gets recomputed at least once every few hours.
2035 nd6if->recalctm = V_nd6_recalc_reachtm_interval;
2036 nd6if->reachable = ND_COMPUTE_RTIME(nd6if->basereachable);
2039 IFNET_RUNLOCK_NOSLEEP();
2044 nd6_grab_holdchain(struct llentry *ln, struct mbuf **chain,
2045 struct sockaddr_in6 *sin6)
2048 LLE_WLOCK_ASSERT(ln);
2050 *chain = ln->la_hold;
2052 lltable_fill_sa_entry(ln, (struct sockaddr *)sin6);
2054 if (ln->ln_state == ND6_LLINFO_STALE) {
2057 * The first time we send a packet to a
2058 * neighbor whose entry is STALE, we have
2059 * to change the state to DELAY and a sets
2060 * a timer to expire in DELAY_FIRST_PROBE_TIME
2061 * seconds to ensure do neighbor unreachability
2062 * detection on expiration.
2065 nd6_llinfo_setstate(ln, ND6_LLINFO_DELAY);
2070 nd6_output_ifp(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *m,
2071 struct sockaddr_in6 *dst, struct route *ro)
2075 struct ip6_hdr *ip6;
2079 mac_netinet6_nd6_send(ifp, m);
2083 * If called from nd6_ns_output() (NS), nd6_na_output() (NA),
2084 * icmp6_redirect_output() (REDIRECT) or from rip6_output() (RS, RA
2085 * as handled by rtsol and rtadvd), mbufs will be tagged for SeND
2086 * to be diverted to user space. When re-injected into the kernel,
2087 * send_output() will directly dispatch them to the outgoing interface.
2089 if (send_sendso_input_hook != NULL) {
2090 mtag = m_tag_find(m, PACKET_TAG_ND_OUTGOING, NULL);
2092 ip6 = mtod(m, struct ip6_hdr *);
2093 ip6len = sizeof(struct ip6_hdr) + ntohs(ip6->ip6_plen);
2094 /* Use the SEND socket */
2095 error = send_sendso_input_hook(m, ifp, SND_OUT,
2097 /* -1 == no app on SEND socket */
2098 if (error == 0 || error != -1)
2103 m_clrprotoflags(m); /* Avoid confusing lower layers. */
2104 IP_PROBE(send, NULL, NULL, mtod(m, struct ip6_hdr *), ifp, NULL,
2105 mtod(m, struct ip6_hdr *));
2107 if ((ifp->if_flags & IFF_LOOPBACK) == 0)
2110 error = (*ifp->if_output)(origifp, m, (struct sockaddr *)dst, ro);
2115 * Do L2 address resolution for @sa_dst address. Stores found
2116 * address in @desten buffer. Copy of lle ln_flags can be also
2117 * saved in @pflags if @pflags is non-NULL.
2119 * If destination LLE does not exists or lle state modification
2120 * is required, call "slow" version.
2123 * - 0 on success (address copied to buffer).
2124 * - EWOULDBLOCK (no local error, but address is still unresolved)
2125 * - other errors (alloc failure, etc)
2128 nd6_resolve(struct ifnet *ifp, int is_gw, struct mbuf *m,
2129 const struct sockaddr *sa_dst, u_char *desten, uint32_t *pflags)
2131 struct llentry *ln = NULL;
2132 const struct sockaddr_in6 *dst6;
2137 dst6 = (const struct sockaddr_in6 *)sa_dst;
2139 /* discard the packet if IPv6 operation is disabled on the interface */
2140 if ((ND_IFINFO(ifp)->flags & ND6_IFF_IFDISABLED)) {
2142 return (ENETDOWN); /* better error? */
2145 if (m != NULL && m->m_flags & M_MCAST) {
2146 switch (ifp->if_type) {
2153 ETHER_MAP_IPV6_MULTICAST(&dst6->sin6_addr,
2158 return (EAFNOSUPPORT);
2162 IF_AFDATA_RLOCK(ifp);
2163 ln = nd6_lookup(&dst6->sin6_addr, LLE_UNLOCKED, ifp);
2164 if (ln != NULL && (ln->r_flags & RLLE_VALID) != 0) {
2165 /* Entry found, let's copy lle info */
2166 bcopy(&ln->ll_addr, desten, ifp->if_addrlen);
2168 *pflags = LLE_VALID | (ln->r_flags & RLLE_IFADDR);
2169 /* Check if we have feedback request from nd6 timer */
2170 if (ln->r_skip_req != 0) {
2172 ln->r_skip_req = 0; /* Notify that entry was used */
2173 ln->lle_hittime = time_uptime;
2176 IF_AFDATA_RUNLOCK(ifp);
2179 IF_AFDATA_RUNLOCK(ifp);
2181 return (nd6_resolve_slow(ifp, m, dst6, desten, pflags));
2186 * Do L2 address resolution for @sa_dst address. Stores found
2187 * address in @desten buffer. Copy of lle ln_flags can be also
2188 * saved in @pflags if @pflags is non-NULL.
2191 * Function assume that destination LLE does not exist,
2192 * is invalid or stale, so LLE_EXCLUSIVE lock needs to be acquired.
2194 * Set noinline to be dtrace-friendly
2196 static __noinline int
2197 nd6_resolve_slow(struct ifnet *ifp, struct mbuf *m,
2198 const struct sockaddr_in6 *dst, u_char *desten, uint32_t *pflags)
2200 struct llentry *lle = NULL, *lle_tmp;
2201 struct in6_addr *psrc, src;
2205 * Address resolution or Neighbor Unreachability Detection
2207 * At this point, the destination of the packet must be a unicast
2208 * or an anycast address(i.e. not a multicast).
2211 IF_AFDATA_RLOCK(ifp);
2212 lle = nd6_lookup(&dst->sin6_addr, LLE_EXCLUSIVE, ifp);
2213 IF_AFDATA_RUNLOCK(ifp);
2214 if ((lle == NULL) && nd6_is_addr_neighbor(dst, ifp)) {
2216 * Since nd6_is_addr_neighbor() internally calls nd6_lookup(),
2217 * the condition below is not very efficient. But we believe
2218 * it is tolerable, because this should be a rare case.
2220 lle = nd6_alloc(&dst->sin6_addr, 0, ifp);
2222 char ip6buf[INET6_ADDRSTRLEN];
2224 "nd6_output: can't allocate llinfo for %s "
2226 ip6_sprintf(ip6buf, &dst->sin6_addr), lle);
2231 IF_AFDATA_WLOCK(ifp);
2233 /* Prefer any existing entry over newly-created one */
2234 lle_tmp = nd6_lookup(&dst->sin6_addr, LLE_EXCLUSIVE, ifp);
2235 if (lle_tmp == NULL)
2236 lltable_link_entry(LLTABLE6(ifp), lle);
2237 IF_AFDATA_WUNLOCK(ifp);
2238 if (lle_tmp != NULL) {
2239 lltable_free_entry(LLTABLE6(ifp), lle);
2246 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_PERFORMNUD)) {
2256 LLE_WLOCK_ASSERT(lle);
2259 * The first time we send a packet to a neighbor whose entry is
2260 * STALE, we have to change the state to DELAY and a sets a timer to
2261 * expire in DELAY_FIRST_PROBE_TIME seconds to ensure do
2262 * neighbor unreachability detection on expiration.
2265 if (lle->ln_state == ND6_LLINFO_STALE)
2266 nd6_llinfo_setstate(lle, ND6_LLINFO_DELAY);
2269 * If the neighbor cache entry has a state other than INCOMPLETE
2270 * (i.e. its link-layer address is already resolved), just
2273 if (lle->ln_state > ND6_LLINFO_INCOMPLETE) {
2274 bcopy(&lle->ll_addr, desten, ifp->if_addrlen);
2276 *pflags = lle->la_flags;
2282 * There is a neighbor cache entry, but no ethernet address
2283 * response yet. Append this latest packet to the end of the
2284 * packet queue in the mbuf, unless the number of the packet
2285 * does not exceed nd6_maxqueuelen. When it exceeds nd6_maxqueuelen,
2286 * the oldest packet in the queue will be removed.
2289 if (lle->la_hold != NULL) {
2290 struct mbuf *m_hold;
2294 for (m_hold = lle->la_hold; m_hold; m_hold = m_hold->m_nextpkt){
2296 if (m_hold->m_nextpkt == NULL) {
2297 m_hold->m_nextpkt = m;
2301 while (i >= V_nd6_maxqueuelen) {
2302 m_hold = lle->la_hold;
2303 lle->la_hold = lle->la_hold->m_nextpkt;
2312 * If there has been no NS for the neighbor after entering the
2313 * INCOMPLETE state, send the first solicitation.
2314 * Note that for newly-created lle la_asked will be 0,
2315 * so we will transition from ND6_LLINFO_NOSTATE to
2316 * ND6_LLINFO_INCOMPLETE state here.
2320 if (lle->la_asked == 0) {
2323 psrc = nd6_llinfo_get_holdsrc(lle, &src);
2325 nd6_llinfo_setstate(lle, ND6_LLINFO_INCOMPLETE);
2329 nd6_ns_output(ifp, psrc, NULL, &dst->sin6_addr, NULL);
2331 return (EWOULDBLOCK);
2336 nd6_flush_holdchain(struct ifnet *ifp, struct ifnet *origifp, struct mbuf *chain,
2337 struct sockaddr_in6 *dst)
2339 struct mbuf *m, *m_head;
2340 struct ifnet *outifp;
2344 if ((ifp->if_flags & IFF_LOOPBACK) != 0)
2351 m_head = m_head->m_nextpkt;
2352 error = nd6_output_ifp(ifp, origifp, m, dst, NULL);
2357 * note that intermediate errors are blindly ignored
2363 nd6_need_cache(struct ifnet *ifp)
2366 * XXX: we currently do not make neighbor cache on any interface
2367 * other than ARCnet, Ethernet, FDDI and GIF.
2370 * - unidirectional tunnels needs no ND
2372 switch (ifp->if_type) {
2379 case IFT_INFINIBAND:
2381 case IFT_PROPVIRTUAL:
2389 * Add pernament ND6 link-layer record for given
2390 * interface address.
2392 * Very similar to IPv4 arp_ifinit(), but:
2393 * 1) IPv6 DAD is performed in different place
2394 * 2) It is called by IPv6 protocol stack in contrast to
2395 * arp_ifinit() which is typically called in SIOCSIFADDR
2396 * driver ioctl handler.
2400 nd6_add_ifa_lle(struct in6_ifaddr *ia)
2403 struct llentry *ln, *ln_tmp;
2404 struct sockaddr *dst;
2406 ifp = ia->ia_ifa.ifa_ifp;
2407 if (nd6_need_cache(ifp) == 0)
2410 ia->ia_ifa.ifa_rtrequest = nd6_rtrequest;
2411 dst = (struct sockaddr *)&ia->ia_addr;
2412 ln = lltable_alloc_entry(LLTABLE6(ifp), LLE_IFADDR, dst);
2416 IF_AFDATA_WLOCK(ifp);
2418 /* Unlink any entry if exists */
2419 ln_tmp = lla_lookup(LLTABLE6(ifp), LLE_EXCLUSIVE, dst);
2421 lltable_unlink_entry(LLTABLE6(ifp), ln_tmp);
2422 lltable_link_entry(LLTABLE6(ifp), ln);
2423 IF_AFDATA_WUNLOCK(ifp);
2426 EVENTHANDLER_INVOKE(lle_event, ln_tmp, LLENTRY_EXPIRED);
2427 EVENTHANDLER_INVOKE(lle_event, ln, LLENTRY_RESOLVED);
2431 llentry_free(ln_tmp);
2437 * Removes either all lle entries for given @ia, or lle
2438 * corresponding to @ia address.
2441 nd6_rem_ifa_lle(struct in6_ifaddr *ia, int all)
2443 struct sockaddr_in6 mask, addr;
2444 struct sockaddr *saddr, *smask;
2447 ifp = ia->ia_ifa.ifa_ifp;
2448 memcpy(&addr, &ia->ia_addr, sizeof(ia->ia_addr));
2449 memcpy(&mask, &ia->ia_prefixmask, sizeof(ia->ia_prefixmask));
2450 saddr = (struct sockaddr *)&addr;
2451 smask = (struct sockaddr *)&mask;
2454 lltable_prefix_free(AF_INET6, saddr, smask, LLE_STATIC);
2456 lltable_delete_addr(LLTABLE6(ifp), LLE_IFADDR, saddr);
2460 clear_llinfo_pqueue(struct llentry *ln)
2462 struct mbuf *m_hold, *m_hold_next;
2464 for (m_hold = ln->la_hold; m_hold; m_hold = m_hold_next) {
2465 m_hold_next = m_hold->m_nextpkt;
2473 static int nd6_sysctl_drlist(SYSCTL_HANDLER_ARGS);
2474 static int nd6_sysctl_prlist(SYSCTL_HANDLER_ARGS);
2476 SYSCTL_DECL(_net_inet6_icmp6);
2478 SYSCTL_NODE(_net_inet6_icmp6, ICMPV6CTL_ND6_DRLIST, nd6_drlist,
2479 CTLFLAG_RD, nd6_sysctl_drlist, "List default routers");
2480 SYSCTL_NODE(_net_inet6_icmp6, ICMPV6CTL_ND6_PRLIST, nd6_prlist,
2481 CTLFLAG_RD, nd6_sysctl_prlist, "List prefixes");
2482 SYSCTL_INT(_net_inet6_icmp6, ICMPV6CTL_ND6_MAXQLEN, nd6_maxqueuelen,
2483 CTLFLAG_VNET | CTLFLAG_RW, &VNET_NAME(nd6_maxqueuelen), 1,
2484 "Max packets cached in unresolved ND entries");
2485 SYSCTL_INT(_net_inet6_icmp6, OID_AUTO, nd6_gctimer,
2486 CTLFLAG_VNET | CTLFLAG_RW, &VNET_NAME(nd6_gctimer), (60 * 60 * 24),
2487 "Interface in seconds between garbage collection passes");
2488 SYSCTL_INT(_net_inet6_icmp6, OID_AUTO, nd6_on_link, CTLFLAG_VNET | CTLFLAG_RW,
2489 &VNET_NAME(nd6_on_link), 0,
2490 "Send unsolicited neighbor discovery on interface link up events");
2493 nd6_sysctl_drlist(SYSCTL_HANDLER_ARGS)
2495 struct in6_defrouter d;
2496 struct nd_defrouter *dr;
2502 bzero(&d, sizeof(d));
2503 d.rtaddr.sin6_family = AF_INET6;
2504 d.rtaddr.sin6_len = sizeof(d.rtaddr);
2509 TAILQ_FOREACH(dr, &V_nd_defrouter, dr_entry) {
2510 d.rtaddr.sin6_addr = dr->rtaddr;
2511 error = sa6_recoverscope(&d.rtaddr);
2514 d.flags = dr->flags;
2515 d.rtlifetime = dr->rtlifetime;
2516 d.expire = dr->expire + (time_second - time_uptime);
2517 d.if_index = dr->ifp->if_index;
2518 error = SYSCTL_OUT(req, &d, sizeof(d));
2526 nd6_sysctl_prlist(SYSCTL_HANDLER_ARGS)
2528 struct in6_prefix p;
2529 struct sockaddr_in6 s6;
2530 struct nd_prefix *pr;
2531 struct nd_pfxrouter *pfr;
2534 char ip6buf[INET6_ADDRSTRLEN];
2539 bzero(&p, sizeof(p));
2540 p.origin = PR_ORIG_RA;
2541 bzero(&s6, sizeof(s6));
2542 s6.sin6_family = AF_INET6;
2543 s6.sin6_len = sizeof(s6);
2548 LIST_FOREACH(pr, &V_nd_prefix, ndpr_entry) {
2549 p.prefix = pr->ndpr_prefix;
2550 if (sa6_recoverscope(&p.prefix)) {
2551 log(LOG_ERR, "scope error in prefix list (%s)\n",
2552 ip6_sprintf(ip6buf, &p.prefix.sin6_addr));
2553 /* XXX: press on... */
2555 p.raflags = pr->ndpr_raf;
2556 p.prefixlen = pr->ndpr_plen;
2557 p.vltime = pr->ndpr_vltime;
2558 p.pltime = pr->ndpr_pltime;
2559 p.if_index = pr->ndpr_ifp->if_index;
2560 if (pr->ndpr_vltime == ND6_INFINITE_LIFETIME)
2563 /* XXX: we assume time_t is signed. */
2565 ~((time_t)1 << ((sizeof(maxexpire) * 8) - 1));
2566 if (pr->ndpr_vltime < maxexpire - pr->ndpr_lastupdate)
2567 p.expire = pr->ndpr_lastupdate +
2569 (time_second - time_uptime);
2571 p.expire = maxexpire;
2573 p.refcnt = pr->ndpr_refcnt;
2574 p.flags = pr->ndpr_stateflags;
2576 LIST_FOREACH(pfr, &pr->ndpr_advrtrs, pfr_entry)
2578 error = SYSCTL_OUT(req, &p, sizeof(p));
2581 LIST_FOREACH(pfr, &pr->ndpr_advrtrs, pfr_entry) {
2582 s6.sin6_addr = pfr->router->rtaddr;
2583 if (sa6_recoverscope(&s6))
2585 "scope error in prefix list (%s)\n",
2586 ip6_sprintf(ip6buf, &pfr->router->rtaddr));
2587 error = SYSCTL_OUT(req, &s6, sizeof(s6));