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: in6_src.c,v 1.132 2003/08/26 04:42:27 keiichi Exp $
33 * Copyright (c) 1982, 1986, 1991, 1993
34 * The Regents of the University of California. All rights reserved.
36 * Redistribution and use in source and binary forms, with or without
37 * modification, are permitted provided that the following conditions
39 * 1. Redistributions of source code must retain the above copyright
40 * notice, this list of conditions and the following disclaimer.
41 * 2. Redistributions in binary form must reproduce the above copyright
42 * notice, this list of conditions and the following disclaimer in the
43 * documentation and/or other materials provided with the distribution.
44 * 4. Neither the name of the University nor the names of its contributors
45 * may be used to endorse or promote products derived from this software
46 * without specific prior written permission.
48 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
49 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
50 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
51 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
52 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
53 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
54 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
55 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
56 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
57 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
60 * @(#)in_pcb.c 8.2 (Berkeley) 1/4/94
63 #include <sys/cdefs.h>
64 __FBSDID("$FreeBSD$");
67 #include "opt_inet6.h"
68 #include "opt_mpath.h"
70 #include <sys/param.h>
71 #include <sys/systm.h>
73 #include <sys/malloc.h>
76 #include <sys/protosw.h>
77 #include <sys/socket.h>
78 #include <sys/socketvar.h>
79 #include <sys/sockio.h>
80 #include <sys/sysctl.h>
81 #include <sys/errno.h>
84 #include <sys/kernel.h>
88 #include <net/if_var.h>
89 #include <net/if_dl.h>
90 #include <net/route.h>
91 #include <net/if_llatbl.h>
93 #include <net/radix_mpath.h>
96 #include <netinet/in.h>
97 #include <netinet/in_var.h>
98 #include <netinet/in_systm.h>
99 #include <netinet/ip.h>
100 #include <netinet/in_pcb.h>
101 #include <netinet/ip_var.h>
102 #include <netinet/udp.h>
103 #include <netinet/udp_var.h>
105 #include <netinet6/in6_var.h>
106 #include <netinet/ip6.h>
107 #include <netinet6/in6_pcb.h>
108 #include <netinet6/ip6_var.h>
109 #include <netinet6/scope6_var.h>
110 #include <netinet6/nd6.h>
112 static struct mtx addrsel_lock;
113 #define ADDRSEL_LOCK_INIT() mtx_init(&addrsel_lock, "addrsel_lock", NULL, MTX_DEF)
114 #define ADDRSEL_LOCK() mtx_lock(&addrsel_lock)
115 #define ADDRSEL_UNLOCK() mtx_unlock(&addrsel_lock)
116 #define ADDRSEL_LOCK_ASSERT() mtx_assert(&addrsel_lock, MA_OWNED)
118 static struct sx addrsel_sxlock;
119 #define ADDRSEL_SXLOCK_INIT() sx_init(&addrsel_sxlock, "addrsel_sxlock")
120 #define ADDRSEL_SLOCK() sx_slock(&addrsel_sxlock)
121 #define ADDRSEL_SUNLOCK() sx_sunlock(&addrsel_sxlock)
122 #define ADDRSEL_XLOCK() sx_xlock(&addrsel_sxlock)
123 #define ADDRSEL_XUNLOCK() sx_xunlock(&addrsel_sxlock)
125 #define ADDR_LABEL_NOTAPP (-1)
126 static VNET_DEFINE(struct in6_addrpolicy, defaultaddrpolicy);
127 #define V_defaultaddrpolicy VNET(defaultaddrpolicy)
129 VNET_DEFINE(int, ip6_prefer_tempaddr) = 0;
131 static int selectroute(struct sockaddr_in6 *, struct ip6_pktopts *,
132 struct ip6_moptions *, struct route_in6 *, struct ifnet **,
133 struct rtentry **, int, u_int);
134 static int in6_selectif(struct sockaddr_in6 *, struct ip6_pktopts *,
135 struct ip6_moptions *, struct route_in6 *ro, struct ifnet **,
136 struct ifnet *, u_int);
138 static struct in6_addrpolicy *lookup_addrsel_policy(struct sockaddr_in6 *);
140 static void init_policy_queue(void);
141 static int add_addrsel_policyent(struct in6_addrpolicy *);
142 static int delete_addrsel_policyent(struct in6_addrpolicy *);
143 static int walk_addrsel_policy(int (*)(struct in6_addrpolicy *, void *),
145 static int dump_addrsel_policyent(struct in6_addrpolicy *, void *);
146 static struct in6_addrpolicy *match_addrsel_policy(struct sockaddr_in6 *);
149 * Return an IPv6 address, which is the most appropriate for a given
150 * destination and user specified options.
151 * If necessary, this function lookups the routing table and returns
152 * an entry to the caller for later use.
154 #define REPLACE(r) do {\
155 IP6STAT_INC(ip6s_sources_rule[(r)]); \
158 char ip6buf[INET6_ADDRSTRLEN], ip6b[INET6_ADDRSTRLEN]; \
159 printf("in6_selectsrc: replace %s with %s by %d\n", ia_best ? ip6_sprintf(ip6buf, &ia_best->ia_addr.sin6_addr) : "none", ip6_sprintf(ip6b, &ia->ia_addr.sin6_addr), (r)); \
163 #define NEXT(r) do {\
165 char ip6buf[INET6_ADDRSTRLEN], ip6b[INET6_ADDRSTRLEN]; \
166 printf("in6_selectsrc: keep %s against %s by %d\n", ia_best ? ip6_sprintf(ip6buf, &ia_best->ia_addr.sin6_addr) : "none", ip6_sprintf(ip6b, &ia->ia_addr.sin6_addr), (r)); \
168 goto next; /* XXX: we can't use 'continue' here */ \
170 #define BREAK(r) do { \
171 IP6STAT_INC(ip6s_sources_rule[(r)]); \
173 goto out; /* XXX: we can't use 'break' here */ \
177 in6_selectsrc(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
178 struct inpcb *inp, struct route_in6 *ro, struct ucred *cred,
179 struct ifnet **ifpp, struct in6_addr *srcp)
181 struct in6_addr dst, tmp;
182 struct ifnet *ifp = NULL, *oifp = NULL;
183 struct in6_ifaddr *ia = NULL, *ia_best = NULL;
184 struct in6_pktinfo *pi = NULL;
185 int dst_scope = -1, best_scope = -1, best_matchlen = -1;
186 struct in6_addrpolicy *dst_policy = NULL, *best_policy = NULL;
190 struct ip6_moptions *mopts;
192 KASSERT(srcp != NULL, ("%s: srcp is NULL", __func__));
194 dst = dstsock->sin6_addr; /* make a copy for local operation */
197 * Save a possibly passed in ifp for in6_selectsrc. Only
198 * neighbor discovery code should use this feature, where
199 * we may know the interface but not the FIB number holding
200 * the connected subnet in case someone deleted it from the
201 * default FIB and we need to check the interface.
209 INP_LOCK_ASSERT(inp);
210 mopts = inp->in6p_moptions;
216 * If the source address is explicitly specified by the caller,
217 * check if the requested source address is indeed a unicast address
218 * assigned to the node, and can be used as the packet's source
219 * address. If everything is okay, use the address as source.
221 if (opts && (pi = opts->ip6po_pktinfo) &&
222 !IN6_IS_ADDR_UNSPECIFIED(&pi->ipi6_addr)) {
223 struct sockaddr_in6 srcsock;
224 struct in6_ifaddr *ia6;
226 /* get the outgoing interface */
227 if ((error = in6_selectif(dstsock, opts, mopts, ro, &ifp, oifp,
228 (inp != NULL) ? inp->inp_inc.inc_fibnum : RT_DEFAULT_FIB))
233 * determine the appropriate zone id of the source based on
234 * the zone of the destination and the outgoing interface.
235 * If the specified address is ambiguous wrt the scope zone,
236 * the interface must be specified; otherwise, ifa_ifwithaddr()
237 * will fail matching the address.
239 bzero(&srcsock, sizeof(srcsock));
240 srcsock.sin6_family = AF_INET6;
241 srcsock.sin6_len = sizeof(srcsock);
242 srcsock.sin6_addr = pi->ipi6_addr;
244 error = in6_setscope(&srcsock.sin6_addr, ifp, NULL);
248 if (cred != NULL && (error = prison_local_ip6(cred,
249 &srcsock.sin6_addr, (inp != NULL &&
250 (inp->inp_flags & IN6P_IPV6_V6ONLY) != 0))) != 0)
253 ia6 = (struct in6_ifaddr *)ifa_ifwithaddr(
254 (struct sockaddr *)&srcsock);
256 (ia6->ia6_flags & (IN6_IFF_ANYCAST | IN6_IFF_NOTREADY))) {
258 ifa_free(&ia6->ia_ifa);
259 return (EADDRNOTAVAIL);
261 pi->ipi6_addr = srcsock.sin6_addr; /* XXX: this overrides pi */
264 bcopy(&ia6->ia_addr.sin6_addr, srcp, sizeof(*srcp));
265 ifa_free(&ia6->ia_ifa);
270 * Otherwise, if the socket has already bound the source, just use it.
272 if (inp != NULL && !IN6_IS_ADDR_UNSPECIFIED(&inp->in6p_laddr)) {
274 (error = prison_local_ip6(cred, &inp->in6p_laddr,
275 ((inp->inp_flags & IN6P_IPV6_V6ONLY) != 0))) != 0)
277 bcopy(&inp->in6p_laddr, srcp, sizeof(*srcp));
282 * Bypass source address selection and use the primary jail IP
285 if (cred != NULL && !prison_saddrsel_ip6(cred, srcp))
289 * If the address is not specified, choose the best one based on
290 * the outgoing interface and the destination address.
292 /* get the outgoing interface */
293 if ((error = in6_selectif(dstsock, opts, mopts, ro, &ifp, oifp,
294 (inp != NULL) ? inp->inp_inc.inc_fibnum : RT_DEFAULT_FIB)) != 0)
298 if (ifp == NULL) /* this should not happen */
299 panic("in6_selectsrc: NULL ifp");
301 error = in6_setscope(&dst, ifp, &odstzone);
307 TAILQ_FOREACH(ia, &V_in6_ifaddrhead, ia_link) {
308 int new_scope = -1, new_matchlen = -1;
309 struct in6_addrpolicy *new_policy = NULL;
310 u_int32_t srczone, osrczone, dstzone;
312 struct ifnet *ifp1 = ia->ia_ifp;
315 * We'll never take an address that breaks the scope zone
316 * of the destination. We also skip an address if its zone
317 * does not contain the outgoing interface.
318 * XXX: we should probably use sin6_scope_id here.
320 if (in6_setscope(&dst, ifp1, &dstzone) ||
321 odstzone != dstzone) {
324 src = ia->ia_addr.sin6_addr;
325 if (in6_setscope(&src, ifp, &osrczone) ||
326 in6_setscope(&src, ifp1, &srczone) ||
327 osrczone != srczone) {
331 /* avoid unusable addresses */
333 (IN6_IFF_NOTREADY | IN6_IFF_ANYCAST | IN6_IFF_DETACHED))) {
336 if (!V_ip6_use_deprecated && IFA6_IS_DEPRECATED(ia))
339 /* If jailed only take addresses of the jail into account. */
341 prison_check_ip6(cred, &ia->ia_addr.sin6_addr) != 0)
344 /* Rule 1: Prefer same address */
345 if (IN6_ARE_ADDR_EQUAL(&dst, &ia->ia_addr.sin6_addr)) {
347 BREAK(1); /* there should be no better candidate */
353 /* Rule 2: Prefer appropriate scope */
355 dst_scope = in6_addrscope(&dst);
356 new_scope = in6_addrscope(&ia->ia_addr.sin6_addr);
357 if (IN6_ARE_SCOPE_CMP(best_scope, new_scope) < 0) {
358 if (IN6_ARE_SCOPE_CMP(best_scope, dst_scope) < 0)
361 } else if (IN6_ARE_SCOPE_CMP(new_scope, best_scope) < 0) {
362 if (IN6_ARE_SCOPE_CMP(new_scope, dst_scope) < 0)
368 * Rule 3: Avoid deprecated addresses. Note that the case of
369 * !ip6_use_deprecated is already rejected above.
371 if (!IFA6_IS_DEPRECATED(ia_best) && IFA6_IS_DEPRECATED(ia))
373 if (IFA6_IS_DEPRECATED(ia_best) && !IFA6_IS_DEPRECATED(ia))
376 /* Rule 4: Prefer home addresses */
378 * XXX: This is a TODO. We should probably merge the MIP6
382 /* Rule 5: Prefer outgoing interface */
383 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_NO_PREFER_IFACE)) {
384 if (ia_best->ia_ifp == ifp && ia->ia_ifp != ifp)
386 if (ia_best->ia_ifp != ifp && ia->ia_ifp == ifp)
391 * Rule 6: Prefer matching label
392 * Note that best_policy should be non-NULL here.
394 if (dst_policy == NULL)
395 dst_policy = lookup_addrsel_policy(dstsock);
396 if (dst_policy->label != ADDR_LABEL_NOTAPP) {
397 new_policy = lookup_addrsel_policy(&ia->ia_addr);
398 if (dst_policy->label == best_policy->label &&
399 dst_policy->label != new_policy->label)
401 if (dst_policy->label != best_policy->label &&
402 dst_policy->label == new_policy->label)
407 * Rule 7: Prefer public addresses.
408 * We allow users to reverse the logic by configuring
409 * a sysctl variable, so that privacy conscious users can
410 * always prefer temporary addresses.
413 opts->ip6po_prefer_tempaddr == IP6PO_TEMPADDR_SYSTEM) {
414 prefer_tempaddr = V_ip6_prefer_tempaddr;
415 } else if (opts->ip6po_prefer_tempaddr ==
416 IP6PO_TEMPADDR_NOTPREFER) {
420 if (!(ia_best->ia6_flags & IN6_IFF_TEMPORARY) &&
421 (ia->ia6_flags & IN6_IFF_TEMPORARY)) {
427 if ((ia_best->ia6_flags & IN6_IFF_TEMPORARY) &&
428 !(ia->ia6_flags & IN6_IFF_TEMPORARY)) {
436 * Rule 8: prefer addresses on alive interfaces.
437 * This is a KAME specific rule.
439 if ((ia_best->ia_ifp->if_flags & IFF_UP) &&
440 !(ia->ia_ifp->if_flags & IFF_UP))
442 if (!(ia_best->ia_ifp->if_flags & IFF_UP) &&
443 (ia->ia_ifp->if_flags & IFF_UP))
447 * Rule 14: Use longest matching prefix.
448 * Note: in the address selection draft, this rule is
449 * documented as "Rule 8". However, since it is also
450 * documented that this rule can be overridden, we assign
451 * a large number so that it is easy to assign smaller numbers
452 * to more preferred rules.
454 new_matchlen = in6_matchlen(&ia->ia_addr.sin6_addr, &dst);
455 if (best_matchlen < new_matchlen)
457 if (new_matchlen < best_matchlen)
460 /* Rule 15 is reserved. */
463 * Last resort: just keep the current candidate.
464 * Or, do we need more rules?
470 best_scope = (new_scope >= 0 ? new_scope :
471 in6_addrscope(&ia_best->ia_addr.sin6_addr));
472 best_policy = (new_policy ? new_policy :
473 lookup_addrsel_policy(&ia_best->ia_addr));
474 best_matchlen = (new_matchlen >= 0 ? new_matchlen :
475 in6_matchlen(&ia_best->ia_addr.sin6_addr,
485 if ((ia = ia_best) == NULL) {
486 IN6_IFADDR_RUNLOCK();
487 IP6STAT_INC(ip6s_sources_none);
488 return (EADDRNOTAVAIL);
492 * At this point at least one of the addresses belonged to the jail
493 * but it could still be, that we want to further restrict it, e.g.
494 * theoratically IN6_IS_ADDR_LOOPBACK.
495 * It must not be IN6_IS_ADDR_UNSPECIFIED anymore.
496 * prison_local_ip6() will fix an IN6_IS_ADDR_LOOPBACK but should
497 * let all others previously selected pass.
498 * Use tmp to not change ::1 on lo0 to the primary jail address.
500 tmp = ia->ia_addr.sin6_addr;
501 if (cred != NULL && prison_local_ip6(cred, &tmp, (inp != NULL &&
502 (inp->inp_flags & IN6P_IPV6_V6ONLY) != 0)) != 0) {
503 IN6_IFADDR_RUNLOCK();
504 IP6STAT_INC(ip6s_sources_none);
505 return (EADDRNOTAVAIL);
511 bcopy(&tmp, srcp, sizeof(*srcp));
512 if (ia->ia_ifp == ifp)
513 IP6STAT_INC(ip6s_sources_sameif[best_scope]);
515 IP6STAT_INC(ip6s_sources_otherif[best_scope]);
516 if (dst_scope == best_scope)
517 IP6STAT_INC(ip6s_sources_samescope[best_scope]);
519 IP6STAT_INC(ip6s_sources_otherscope[best_scope]);
520 if (IFA6_IS_DEPRECATED(ia))
521 IP6STAT_INC(ip6s_sources_deprecated[best_scope]);
522 IN6_IFADDR_RUNLOCK();
527 * clone - meaningful only for bsdi and freebsd
530 selectroute(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
531 struct ip6_moptions *mopts, struct route_in6 *ro,
532 struct ifnet **retifp, struct rtentry **retrt, int norouteok, u_int fibnum)
535 struct ifnet *ifp = NULL;
536 struct rtentry *rt = NULL;
537 struct sockaddr_in6 *sin6_next;
538 struct in6_pktinfo *pi = NULL;
539 struct in6_addr *dst = &dstsock->sin6_addr;
541 char ip6buf[INET6_ADDRSTRLEN];
543 if (dstsock->sin6_addr.s6_addr32[0] == 0 &&
544 dstsock->sin6_addr.s6_addr32[1] == 0 &&
545 !IN6_IS_ADDR_LOOPBACK(&dstsock->sin6_addr)) {
546 printf("in6_selectroute: strange destination %s\n",
547 ip6_sprintf(ip6buf, &dstsock->sin6_addr));
549 printf("in6_selectroute: destination = %s%%%d\n",
550 ip6_sprintf(ip6buf, &dstsock->sin6_addr),
551 dstsock->sin6_scope_id); /* for debug */
555 /* If the caller specify the outgoing interface explicitly, use it. */
556 if (opts && (pi = opts->ip6po_pktinfo) != NULL && pi->ipi6_ifindex) {
557 /* XXX boundary check is assumed to be already done. */
558 ifp = ifnet_byindex(pi->ipi6_ifindex);
560 (norouteok || retrt == NULL ||
561 IN6_IS_ADDR_MULTICAST(dst))) {
563 * we do not have to check or get the route for
572 * If the destination address is a multicast address and the outgoing
573 * interface for the address is specified by the caller, use it.
575 if (IN6_IS_ADDR_MULTICAST(dst) &&
576 mopts != NULL && (ifp = mopts->im6o_multicast_ifp) != NULL) {
577 goto done; /* we do not need a route for multicast. */
582 * If the next hop address for the packet is specified by the caller,
583 * use it as the gateway.
585 if (opts && opts->ip6po_nexthop) {
586 struct route_in6 *ron;
589 sin6_next = satosin6(opts->ip6po_nexthop);
591 /* at this moment, we only support AF_INET6 next hops */
592 if (sin6_next->sin6_family != AF_INET6) {
593 error = EAFNOSUPPORT; /* or should we proceed? */
598 * If the next hop is an IPv6 address, then the node identified
599 * by that address must be a neighbor of the sending host.
601 ron = &opts->ip6po_nextroute;
603 * XXX what do we do here?
608 if (ron->ro_rt == NULL) {
609 in6_rtalloc(ron, fibnum); /* multi path case? */
610 if (ron->ro_rt == NULL) {
616 error = EHOSTUNREACH;
623 IF_AFDATA_RLOCK(ifp);
624 la = lla_lookup(LLTABLE6(ifp), 0, (struct sockaddr *)sin6_next);
625 IF_AFDATA_RUNLOCK(ifp);
629 error = EHOSTUNREACH;
634 (ron->ro_rt->rt_flags & (RTF_UP | RTF_LLINFO)) !=
635 (RTF_UP | RTF_LLINFO)) ||
636 !IN6_ARE_ADDR_EQUAL(&satosin6(&ron->ro_dst)->sin6_addr,
637 &sin6_next->sin6_addr)) {
642 *satosin6(&ron->ro_dst) = *sin6_next;
644 if (ron->ro_rt == NULL) {
645 in6_rtalloc(ron, fibnum); /* multi path case? */
646 if (ron->ro_rt == NULL ||
647 !(ron->ro_rt->rt_flags & RTF_LLINFO)) {
652 error = EHOSTUNREACH;
659 * When cloning is required, try to allocate a route to the
660 * destination so that the caller can store path MTU
667 * Use a cached route if it exists and is valid, else try to allocate
668 * a new one. Note that we should check the address family of the
669 * cached destination, in case of sharing the cache with IPv4.
673 (!(ro->ro_rt->rt_flags & RTF_UP) ||
674 ((struct sockaddr *)(&ro->ro_dst))->sa_family != AF_INET6 ||
675 !IN6_ARE_ADDR_EQUAL(&satosin6(&ro->ro_dst)->sin6_addr,
678 ro->ro_rt = (struct rtentry *)NULL;
680 if (ro->ro_rt == (struct rtentry *)NULL) {
681 struct sockaddr_in6 *sa6;
683 /* No route yet, so try to acquire one */
684 bzero(&ro->ro_dst, sizeof(struct sockaddr_in6));
685 sa6 = (struct sockaddr_in6 *)&ro->ro_dst;
687 sa6->sin6_scope_id = 0;
690 rtalloc_mpath_fib((struct route *)ro,
691 ntohl(sa6->sin6_addr.s6_addr32[3]), fibnum);
693 ro->ro_rt = in6_rtalloc1((struct sockaddr *)
694 &ro->ro_dst, 0, 0UL, fibnum);
696 RT_UNLOCK(ro->ro_rt);
701 * do not care about the result if we have the nexthop
702 * explicitly specified.
704 if (opts && opts->ip6po_nexthop)
708 ifp = ro->ro_rt->rt_ifp;
710 if (ifp == NULL) { /* can this really happen? */
715 if (ro->ro_rt == NULL)
716 error = EHOSTUNREACH;
720 * Check if the outgoing interface conflicts with
721 * the interface specified by ipi6_ifindex (if specified).
722 * Note that loopback interface is always okay.
723 * (this may happen when we are sending a packet to one of
724 * our own addresses.)
726 if (ifp && opts && opts->ip6po_pktinfo &&
727 opts->ip6po_pktinfo->ipi6_ifindex) {
728 if (!(ifp->if_flags & IFF_LOOPBACK) &&
730 opts->ip6po_pktinfo->ipi6_ifindex) {
731 error = EHOSTUNREACH;
738 if (ifp == NULL && rt == NULL) {
740 * This can happen if the caller did not pass a cached route
741 * nor any other hints. We treat this case an error.
743 error = EHOSTUNREACH;
745 if (error == EHOSTUNREACH)
746 IP6STAT_INC(ip6s_noroute);
748 if (retifp != NULL) {
752 * Adjust the "outgoing" interface. If we're going to loop
753 * the packet back to ourselves, the ifp would be the loopback
754 * interface. However, we'd rather know the interface associated
755 * to the destination address (which should probably be one of
756 * our own addresses.)
759 if ((rt->rt_ifp->if_flags & IFF_LOOPBACK) &&
760 (rt->rt_gateway->sa_family == AF_LINK))
762 ifnet_byindex(((struct sockaddr_dl *)
763 rt->rt_gateway)->sdl_index);
768 *retrt = rt; /* rt may be NULL */
774 in6_selectif(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
775 struct ip6_moptions *mopts, struct route_in6 *ro, struct ifnet **retifp,
776 struct ifnet *oifp, u_int fibnum)
779 struct route_in6 sro;
780 struct rtentry *rt = NULL;
782 KASSERT(retifp != NULL, ("%s: retifp is NULL", __func__));
785 bzero(&sro, sizeof(sro));
789 if ((error = selectroute(dstsock, opts, mopts, ro, retifp,
790 &rt, 1, fibnum)) != 0) {
791 if (ro == &sro && rt && rt == sro.ro_rt)
793 /* Help ND. See oifp comment in in6_selectsrc(). */
794 if (oifp != NULL && fibnum == RT_DEFAULT_FIB) {
802 * do not use a rejected or black hole route.
803 * XXX: this check should be done in the L2 output routine.
804 * However, if we skipped this check here, we'd see the following
806 * - install a rejected route for a scoped address prefix
808 * - send a packet to a destination that matches the scoped prefix,
809 * with ambiguity about the scope zone.
810 * - pick the outgoing interface from the route, and disambiguate the
811 * scope zone with the interface.
812 * - ip6_output() would try to get another route with the "new"
813 * destination, which may be valid.
814 * - we'd see no error on output.
815 * Although this may not be very harmful, it should still be confusing.
816 * We thus reject the case here.
818 if (rt && (rt->rt_flags & (RTF_REJECT | RTF_BLACKHOLE))) {
819 int flags = (rt->rt_flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
821 if (ro == &sro && rt && rt == sro.ro_rt)
826 if (ro == &sro && rt && rt == sro.ro_rt)
832 * Public wrapper function to selectroute().
834 * XXX-BZ in6_selectroute() should and will grow the FIB argument. The
835 * in6_selectroute_fib() function is only there for backward compat on stable.
838 in6_selectroute(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
839 struct ip6_moptions *mopts, struct route_in6 *ro,
840 struct ifnet **retifp, struct rtentry **retrt)
843 return (selectroute(dstsock, opts, mopts, ro, retifp,
844 retrt, 0, RT_DEFAULT_FIB));
849 in6_selectroute_fib(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
850 struct ip6_moptions *mopts, struct route_in6 *ro,
851 struct ifnet **retifp, struct rtentry **retrt, u_int fibnum)
854 return (selectroute(dstsock, opts, mopts, ro, retifp,
860 * Default hop limit selection. The precedence is as follows:
861 * 1. Hoplimit value specified via ioctl.
862 * 2. (If the outgoing interface is detected) the current
863 * hop limit of the interface specified by router advertisement.
864 * 3. The system default hoplimit.
867 in6_selecthlim(struct inpcb *in6p, struct ifnet *ifp)
870 if (in6p && in6p->in6p_hops >= 0)
871 return (in6p->in6p_hops);
873 return (ND_IFINFO(ifp)->chlim);
874 else if (in6p && !IN6_IS_ADDR_UNSPECIFIED(&in6p->in6p_faddr)) {
875 struct route_in6 ro6;
878 bzero(&ro6, sizeof(ro6));
879 ro6.ro_dst.sin6_family = AF_INET6;
880 ro6.ro_dst.sin6_len = sizeof(struct sockaddr_in6);
881 ro6.ro_dst.sin6_addr = in6p->in6p_faddr;
882 in6_rtalloc(&ro6, in6p->inp_inc.inc_fibnum);
884 lifp = ro6.ro_rt->rt_ifp;
887 return (ND_IFINFO(lifp)->chlim);
890 return (V_ip6_defhlim);
894 * XXX: this is borrowed from in6_pcbbind(). If possible, we should
895 * share this function by all *bsd*...
898 in6_pcbsetport(struct in6_addr *laddr, struct inpcb *inp, struct ucred *cred)
900 struct socket *so = inp->inp_socket;
902 int error, lookupflags = 0;
904 struct inpcbinfo *pcbinfo = inp->inp_pcbinfo;
907 INP_WLOCK_ASSERT(inp);
908 INP_HASH_WLOCK_ASSERT(pcbinfo);
910 error = prison_local_ip6(cred, laddr,
911 ((inp->inp_flags & IN6P_IPV6_V6ONLY) != 0));
915 /* XXX: this is redundant when called from in6_pcbbind */
916 if ((so->so_options & (SO_REUSEADDR|SO_REUSEPORT)) == 0)
917 lookupflags = INPLOOKUP_WILDCARD;
919 inp->inp_flags |= INP_ANONPORT;
921 error = in_pcb_lport(inp, NULL, &lport, cred, lookupflags);
925 inp->inp_lport = lport;
926 if (in_pcbinshash(inp) != 0) {
927 inp->in6p_laddr = in6addr_any;
936 addrsel_policy_init(void)
941 /* initialize the "last resort" policy */
942 bzero(&V_defaultaddrpolicy, sizeof(V_defaultaddrpolicy));
943 V_defaultaddrpolicy.label = ADDR_LABEL_NOTAPP;
945 if (!IS_DEFAULT_VNET(curvnet))
949 ADDRSEL_SXLOCK_INIT();
952 static struct in6_addrpolicy *
953 lookup_addrsel_policy(struct sockaddr_in6 *key)
955 struct in6_addrpolicy *match = NULL;
958 match = match_addrsel_policy(key);
961 match = &V_defaultaddrpolicy;
970 * Subroutines to manage the address selection policy table via sysctl.
973 struct sysctl_req *w_req;
976 static int in6_src_sysctl(SYSCTL_HANDLER_ARGS);
977 SYSCTL_DECL(_net_inet6_ip6);
978 static SYSCTL_NODE(_net_inet6_ip6, IPV6CTL_ADDRCTLPOLICY, addrctlpolicy,
979 CTLFLAG_RD, in6_src_sysctl, "");
982 in6_src_sysctl(SYSCTL_HANDLER_ARGS)
989 bzero(&w, sizeof(w));
992 return (walk_addrsel_policy(dump_addrsel_policyent, &w));
996 in6_src_ioctl(u_long cmd, caddr_t data)
998 struct in6_addrpolicy ent0;
1000 if (cmd != SIOCAADDRCTL_POLICY && cmd != SIOCDADDRCTL_POLICY)
1001 return (EOPNOTSUPP); /* check for safety */
1003 ent0 = *(struct in6_addrpolicy *)data;
1005 if (ent0.label == ADDR_LABEL_NOTAPP)
1007 /* check if the prefix mask is consecutive. */
1008 if (in6_mask2len(&ent0.addrmask.sin6_addr, NULL) < 0)
1010 /* clear trailing garbages (if any) of the prefix address. */
1011 IN6_MASK_ADDR(&ent0.addr.sin6_addr, &ent0.addrmask.sin6_addr);
1015 case SIOCAADDRCTL_POLICY:
1016 return (add_addrsel_policyent(&ent0));
1017 case SIOCDADDRCTL_POLICY:
1018 return (delete_addrsel_policyent(&ent0));
1021 return (0); /* XXX: compromise compilers */
1025 * The followings are implementation of the policy table using a
1026 * simple tail queue.
1027 * XXX such details should be hidden.
1028 * XXX implementation using binary tree should be more efficient.
1030 struct addrsel_policyent {
1031 TAILQ_ENTRY(addrsel_policyent) ape_entry;
1032 struct in6_addrpolicy ape_policy;
1035 TAILQ_HEAD(addrsel_policyhead, addrsel_policyent);
1037 static VNET_DEFINE(struct addrsel_policyhead, addrsel_policytab);
1038 #define V_addrsel_policytab VNET(addrsel_policytab)
1041 init_policy_queue(void)
1044 TAILQ_INIT(&V_addrsel_policytab);
1048 add_addrsel_policyent(struct in6_addrpolicy *newpolicy)
1050 struct addrsel_policyent *new, *pol;
1052 new = malloc(sizeof(*new), M_IFADDR,
1057 /* duplication check */
1058 TAILQ_FOREACH(pol, &V_addrsel_policytab, ape_entry) {
1059 if (IN6_ARE_ADDR_EQUAL(&newpolicy->addr.sin6_addr,
1060 &pol->ape_policy.addr.sin6_addr) &&
1061 IN6_ARE_ADDR_EQUAL(&newpolicy->addrmask.sin6_addr,
1062 &pol->ape_policy.addrmask.sin6_addr)) {
1065 free(new, M_IFADDR);
1066 return (EEXIST); /* or override it? */
1070 bzero(new, sizeof(*new));
1072 /* XXX: should validate entry */
1073 new->ape_policy = *newpolicy;
1075 TAILQ_INSERT_TAIL(&V_addrsel_policytab, new, ape_entry);
1083 delete_addrsel_policyent(struct in6_addrpolicy *key)
1085 struct addrsel_policyent *pol;
1090 /* search for the entry in the table */
1091 TAILQ_FOREACH(pol, &V_addrsel_policytab, ape_entry) {
1092 if (IN6_ARE_ADDR_EQUAL(&key->addr.sin6_addr,
1093 &pol->ape_policy.addr.sin6_addr) &&
1094 IN6_ARE_ADDR_EQUAL(&key->addrmask.sin6_addr,
1095 &pol->ape_policy.addrmask.sin6_addr)) {
1105 TAILQ_REMOVE(&V_addrsel_policytab, pol, ape_entry);
1108 free(pol, M_IFADDR);
1114 walk_addrsel_policy(int (*callback)(struct in6_addrpolicy *, void *), void *w)
1116 struct addrsel_policyent *pol;
1120 TAILQ_FOREACH(pol, &V_addrsel_policytab, ape_entry) {
1121 if ((error = (*callback)(&pol->ape_policy, w)) != 0) {
1131 dump_addrsel_policyent(struct in6_addrpolicy *pol, void *arg)
1134 struct walkarg *w = arg;
1136 error = SYSCTL_OUT(w->w_req, pol, sizeof(*pol));
1141 static struct in6_addrpolicy *
1142 match_addrsel_policy(struct sockaddr_in6 *key)
1144 struct addrsel_policyent *pent;
1145 struct in6_addrpolicy *bestpol = NULL, *pol;
1146 int matchlen, bestmatchlen = -1;
1147 u_char *mp, *ep, *k, *p, m;
1149 TAILQ_FOREACH(pent, &V_addrsel_policytab, ape_entry) {
1152 pol = &pent->ape_policy;
1153 mp = (u_char *)&pol->addrmask.sin6_addr;
1154 ep = mp + 16; /* XXX: scope field? */
1155 k = (u_char *)&key->sin6_addr;
1156 p = (u_char *)&pol->addr.sin6_addr;
1157 for (; mp < ep && *mp; mp++, k++, p++) {
1160 goto next; /* not match */
1161 if (m == 0xff) /* short cut for a typical case */
1171 /* matched. check if this is better than the current best. */
1172 if (bestpol == NULL ||
1173 matchlen > bestmatchlen) {
1175 bestmatchlen = matchlen;