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: in6_src.c,v 1.132 2003/08/26 04:42:27 keiichi Exp $
35 * Copyright (c) 1982, 1986, 1991, 1993
36 * The Regents of the University of California. All rights reserved.
38 * Redistribution and use in source and binary forms, with or without
39 * modification, are permitted provided that the following conditions
41 * 1. Redistributions of source code must retain the above copyright
42 * notice, this list of conditions and the following disclaimer.
43 * 2. Redistributions in binary form must reproduce the above copyright
44 * notice, this list of conditions and the following disclaimer in the
45 * documentation and/or other materials provided with the distribution.
46 * 3. Neither the name of the University nor the names of its contributors
47 * may be used to endorse or promote products derived from this software
48 * without specific prior written permission.
50 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
51 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
52 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
53 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
54 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
55 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
56 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
57 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
58 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
59 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
62 * @(#)in_pcb.c 8.2 (Berkeley) 1/4/94
65 #include <sys/cdefs.h>
66 __FBSDID("$FreeBSD$");
69 #include "opt_inet6.h"
70 #include "opt_mpath.h"
72 #include <sys/param.h>
73 #include <sys/systm.h>
75 #include <sys/malloc.h>
78 #include <sys/protosw.h>
79 #include <sys/socket.h>
80 #include <sys/socketvar.h>
81 #include <sys/sockio.h>
82 #include <sys/sysctl.h>
83 #include <sys/errno.h>
86 #include <sys/kernel.h>
87 #include <sys/rmlock.h>
91 #include <net/if_var.h>
92 #include <net/if_dl.h>
93 #include <net/route.h>
94 #include <net/route/nhop.h>
95 #include <net/if_llatbl.h>
97 #include <net/radix_mpath.h>
100 #include <netinet/in.h>
101 #include <netinet/in_var.h>
102 #include <netinet/in_systm.h>
103 #include <netinet/ip.h>
104 #include <netinet/in_pcb.h>
105 #include <netinet/ip_var.h>
106 #include <netinet/udp.h>
107 #include <netinet/udp_var.h>
109 #include <netinet6/in6_var.h>
110 #include <netinet/ip6.h>
111 #include <netinet6/in6_fib.h>
112 #include <netinet6/in6_pcb.h>
113 #include <netinet6/ip6_var.h>
114 #include <netinet6/scope6_var.h>
115 #include <netinet6/nd6.h>
117 static struct mtx addrsel_lock;
118 #define ADDRSEL_LOCK_INIT() mtx_init(&addrsel_lock, "addrsel_lock", NULL, MTX_DEF)
119 #define ADDRSEL_LOCK() mtx_lock(&addrsel_lock)
120 #define ADDRSEL_UNLOCK() mtx_unlock(&addrsel_lock)
121 #define ADDRSEL_LOCK_ASSERT() mtx_assert(&addrsel_lock, MA_OWNED)
123 static struct sx addrsel_sxlock;
124 #define ADDRSEL_SXLOCK_INIT() sx_init(&addrsel_sxlock, "addrsel_sxlock")
125 #define ADDRSEL_SLOCK() sx_slock(&addrsel_sxlock)
126 #define ADDRSEL_SUNLOCK() sx_sunlock(&addrsel_sxlock)
127 #define ADDRSEL_XLOCK() sx_xlock(&addrsel_sxlock)
128 #define ADDRSEL_XUNLOCK() sx_xunlock(&addrsel_sxlock)
130 #define ADDR_LABEL_NOTAPP (-1)
131 VNET_DEFINE_STATIC(struct in6_addrpolicy, defaultaddrpolicy);
132 #define V_defaultaddrpolicy VNET(defaultaddrpolicy)
134 VNET_DEFINE(int, ip6_prefer_tempaddr) = 0;
136 static int selectroute(struct sockaddr_in6 *, struct ip6_pktopts *,
137 struct ip6_moptions *, struct route_in6 *, struct ifnet **,
138 struct nhop_object **, int, u_int, uint32_t);
139 static int in6_selectif(struct sockaddr_in6 *, struct ip6_pktopts *,
140 struct ip6_moptions *, struct ifnet **,
141 struct ifnet *, u_int);
142 static int in6_selectsrc(uint32_t, struct sockaddr_in6 *,
143 struct ip6_pktopts *, struct inpcb *, struct ucred *,
144 struct ifnet **, struct in6_addr *);
146 static struct in6_addrpolicy *lookup_addrsel_policy(struct sockaddr_in6 *);
148 static void init_policy_queue(void);
149 static int add_addrsel_policyent(struct in6_addrpolicy *);
150 static int delete_addrsel_policyent(struct in6_addrpolicy *);
151 static int walk_addrsel_policy(int (*)(struct in6_addrpolicy *, void *),
153 static int dump_addrsel_policyent(struct in6_addrpolicy *, void *);
154 static struct in6_addrpolicy *match_addrsel_policy(struct sockaddr_in6 *);
157 * Return an IPv6 address, which is the most appropriate for a given
158 * destination and user specified options.
159 * If necessary, this function lookups the routing table and returns
160 * an entry to the caller for later use.
162 #define REPLACE(r) do {\
163 IP6STAT_INC(ip6s_sources_rule[(r)]); \
165 char ip6buf[INET6_ADDRSTRLEN], ip6b[INET6_ADDRSTRLEN]; \
166 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)); \
170 #define NEXT(r) do {\
172 char ip6buf[INET6_ADDRSTRLEN], ip6b[INET6_ADDRSTRLEN]; \
173 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)); \
175 goto next; /* XXX: we can't use 'continue' here */ \
177 #define BREAK(r) do { \
178 IP6STAT_INC(ip6s_sources_rule[(r)]); \
179 goto out; /* XXX: we can't use 'break' here */ \
183 in6_selectsrc(uint32_t fibnum, struct sockaddr_in6 *dstsock,
184 struct ip6_pktopts *opts, struct inpcb *inp, struct ucred *cred,
185 struct ifnet **ifpp, struct in6_addr *srcp)
187 struct rm_priotracker in6_ifa_tracker;
188 struct in6_addr dst, tmp;
189 struct ifnet *ifp = NULL, *oifp = NULL;
190 struct in6_ifaddr *ia = NULL, *ia_best = NULL;
191 struct in6_pktinfo *pi = NULL;
192 int dst_scope = -1, best_scope = -1, best_matchlen = -1;
193 struct in6_addrpolicy *dst_policy = NULL, *best_policy = NULL;
197 struct ip6_moptions *mopts;
199 KASSERT(srcp != NULL, ("%s: srcp is NULL", __func__));
201 dst = dstsock->sin6_addr; /* make a copy for local operation */
204 * Save a possibly passed in ifp for in6_selectsrc. Only
205 * neighbor discovery code should use this feature, where
206 * we may know the interface but not the FIB number holding
207 * the connected subnet in case someone deleted it from the
208 * default FIB and we need to check the interface.
216 INP_LOCK_ASSERT(inp);
217 mopts = inp->in6p_moptions;
223 * If the source address is explicitly specified by the caller,
224 * check if the requested source address is indeed a unicast address
225 * assigned to the node, and can be used as the packet's source
226 * address. If everything is okay, use the address as source.
228 if (opts && (pi = opts->ip6po_pktinfo) &&
229 !IN6_IS_ADDR_UNSPECIFIED(&pi->ipi6_addr)) {
230 /* get the outgoing interface */
231 if ((error = in6_selectif(dstsock, opts, mopts, &ifp, oifp,
237 * determine the appropriate zone id of the source based on
238 * the zone of the destination and the outgoing interface.
239 * If the specified address is ambiguous wrt the scope zone,
240 * the interface must be specified; otherwise, ifa_ifwithaddr()
241 * will fail matching the address.
245 error = in6_setscope(&tmp, ifp, &odstzone);
249 if (cred != NULL && (error = prison_local_ip6(cred,
250 &tmp, (inp->inp_flags & IN6P_IPV6_V6ONLY) != 0)) != 0)
254 * If IPV6_BINDANY socket option is set, we allow to specify
255 * non local addresses as source address in IPV6_PKTINFO
258 if ((inp->inp_flags & INP_BINDANY) == 0) {
259 ia = in6ifa_ifwithaddr(&tmp, 0 /* XXX */);
260 if (ia == NULL || (ia->ia6_flags & (IN6_IFF_ANYCAST |
261 IN6_IFF_NOTREADY))) {
263 ifa_free(&ia->ia_ifa);
264 return (EADDRNOTAVAIL);
266 bcopy(&ia->ia_addr.sin6_addr, srcp, sizeof(*srcp));
267 ifa_free(&ia->ia_ifa);
269 bcopy(&tmp, srcp, sizeof(*srcp));
270 pi->ipi6_addr = tmp; /* XXX: this overrides pi */
277 * Otherwise, if the socket has already bound the source, just use it.
279 if (inp != NULL && !IN6_IS_ADDR_UNSPECIFIED(&inp->in6p_laddr)) {
281 (error = prison_local_ip6(cred, &inp->in6p_laddr,
282 ((inp->inp_flags & IN6P_IPV6_V6ONLY) != 0))) != 0)
284 bcopy(&inp->in6p_laddr, srcp, sizeof(*srcp));
289 * Bypass source address selection and use the primary jail IP
292 if (cred != NULL && !prison_saddrsel_ip6(cred, srcp))
296 * If the address is not specified, choose the best one based on
297 * the outgoing interface and the destination address.
299 /* get the outgoing interface */
300 if ((error = in6_selectif(dstsock, opts, mopts, &ifp, oifp,
301 (inp != NULL) ? inp->inp_inc.inc_fibnum : fibnum)) != 0)
305 if (ifp == NULL) /* this should not happen */
306 panic("in6_selectsrc: NULL ifp");
308 error = in6_setscope(&dst, ifp, &odstzone);
312 IN6_IFADDR_RLOCK(&in6_ifa_tracker);
313 CK_STAILQ_FOREACH(ia, &V_in6_ifaddrhead, ia_link) {
314 int new_scope = -1, new_matchlen = -1;
315 struct in6_addrpolicy *new_policy = NULL;
316 u_int32_t srczone, osrczone, dstzone;
318 struct ifnet *ifp1 = ia->ia_ifp;
321 * We'll never take an address that breaks the scope zone
322 * of the destination. We also skip an address if its zone
323 * does not contain the outgoing interface.
324 * XXX: we should probably use sin6_scope_id here.
326 if (in6_setscope(&dst, ifp1, &dstzone) ||
327 odstzone != dstzone) {
330 src = ia->ia_addr.sin6_addr;
331 if (in6_setscope(&src, ifp, &osrczone) ||
332 in6_setscope(&src, ifp1, &srczone) ||
333 osrczone != srczone) {
337 /* avoid unusable addresses */
339 (IN6_IFF_NOTREADY | IN6_IFF_ANYCAST | IN6_IFF_DETACHED))) {
342 if (!V_ip6_use_deprecated && IFA6_IS_DEPRECATED(ia))
345 /* If jailed only take addresses of the jail into account. */
347 prison_check_ip6(cred, &ia->ia_addr.sin6_addr) != 0)
350 /* Rule 1: Prefer same address */
351 if (IN6_ARE_ADDR_EQUAL(&dst, &ia->ia_addr.sin6_addr)) {
353 BREAK(1); /* there should be no better candidate */
359 /* Rule 2: Prefer appropriate scope */
361 dst_scope = in6_addrscope(&dst);
362 new_scope = in6_addrscope(&ia->ia_addr.sin6_addr);
363 if (IN6_ARE_SCOPE_CMP(best_scope, new_scope) < 0) {
364 if (IN6_ARE_SCOPE_CMP(best_scope, dst_scope) < 0)
367 } else if (IN6_ARE_SCOPE_CMP(new_scope, best_scope) < 0) {
368 if (IN6_ARE_SCOPE_CMP(new_scope, dst_scope) < 0)
374 * Rule 3: Avoid deprecated addresses. Note that the case of
375 * !ip6_use_deprecated is already rejected above.
377 if (!IFA6_IS_DEPRECATED(ia_best) && IFA6_IS_DEPRECATED(ia))
379 if (IFA6_IS_DEPRECATED(ia_best) && !IFA6_IS_DEPRECATED(ia))
382 /* Rule 4: Prefer home addresses */
384 * XXX: This is a TODO. We should probably merge the MIP6
388 /* Rule 5: Prefer outgoing interface */
389 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_NO_PREFER_IFACE)) {
390 if (ia_best->ia_ifp == ifp && ia->ia_ifp != ifp)
392 if (ia_best->ia_ifp != ifp && ia->ia_ifp == ifp)
397 * Rule 6: Prefer matching label
398 * Note that best_policy should be non-NULL here.
400 if (dst_policy == NULL)
401 dst_policy = lookup_addrsel_policy(dstsock);
402 if (dst_policy->label != ADDR_LABEL_NOTAPP) {
403 new_policy = lookup_addrsel_policy(&ia->ia_addr);
404 if (dst_policy->label == best_policy->label &&
405 dst_policy->label != new_policy->label)
407 if (dst_policy->label != best_policy->label &&
408 dst_policy->label == new_policy->label)
413 * Rule 7: Prefer public addresses.
414 * We allow users to reverse the logic by configuring
415 * a sysctl variable, so that privacy conscious users can
416 * always prefer temporary addresses.
419 opts->ip6po_prefer_tempaddr == IP6PO_TEMPADDR_SYSTEM) {
420 prefer_tempaddr = V_ip6_prefer_tempaddr;
421 } else if (opts->ip6po_prefer_tempaddr ==
422 IP6PO_TEMPADDR_NOTPREFER) {
426 if (!(ia_best->ia6_flags & IN6_IFF_TEMPORARY) &&
427 (ia->ia6_flags & IN6_IFF_TEMPORARY)) {
433 if ((ia_best->ia6_flags & IN6_IFF_TEMPORARY) &&
434 !(ia->ia6_flags & IN6_IFF_TEMPORARY)) {
442 * Rule 8: prefer addresses on alive interfaces.
443 * This is a KAME specific rule.
445 if ((ia_best->ia_ifp->if_flags & IFF_UP) &&
446 !(ia->ia_ifp->if_flags & IFF_UP))
448 if (!(ia_best->ia_ifp->if_flags & IFF_UP) &&
449 (ia->ia_ifp->if_flags & IFF_UP))
453 * Rule 9: prefer address with better virtual status.
455 if (ifa_preferred(&ia_best->ia_ifa, &ia->ia_ifa))
457 if (ifa_preferred(&ia->ia_ifa, &ia_best->ia_ifa))
461 * Rule 10: prefer address with `prefer_source' flag.
463 if ((ia_best->ia6_flags & IN6_IFF_PREFER_SOURCE) == 0 &&
464 (ia->ia6_flags & IN6_IFF_PREFER_SOURCE) != 0)
466 if ((ia_best->ia6_flags & IN6_IFF_PREFER_SOURCE) != 0 &&
467 (ia->ia6_flags & IN6_IFF_PREFER_SOURCE) == 0)
471 * Rule 14: Use longest matching prefix.
472 * Note: in the address selection draft, this rule is
473 * documented as "Rule 8". However, since it is also
474 * documented that this rule can be overridden, we assign
475 * a large number so that it is easy to assign smaller numbers
476 * to more preferred rules.
478 new_matchlen = in6_matchlen(&ia->ia_addr.sin6_addr, &dst);
479 if (best_matchlen < new_matchlen)
481 if (new_matchlen < best_matchlen)
484 /* Rule 15 is reserved. */
487 * Last resort: just keep the current candidate.
488 * Or, do we need more rules?
494 best_scope = (new_scope >= 0 ? new_scope :
495 in6_addrscope(&ia_best->ia_addr.sin6_addr));
496 best_policy = (new_policy ? new_policy :
497 lookup_addrsel_policy(&ia_best->ia_addr));
498 best_matchlen = (new_matchlen >= 0 ? new_matchlen :
499 in6_matchlen(&ia_best->ia_addr.sin6_addr,
509 if ((ia = ia_best) == NULL) {
510 IN6_IFADDR_RUNLOCK(&in6_ifa_tracker);
511 IP6STAT_INC(ip6s_sources_none);
512 return (EADDRNOTAVAIL);
516 * At this point at least one of the addresses belonged to the jail
517 * but it could still be, that we want to further restrict it, e.g.
518 * theoratically IN6_IS_ADDR_LOOPBACK.
519 * It must not be IN6_IS_ADDR_UNSPECIFIED anymore.
520 * prison_local_ip6() will fix an IN6_IS_ADDR_LOOPBACK but should
521 * let all others previously selected pass.
522 * Use tmp to not change ::1 on lo0 to the primary jail address.
524 tmp = ia->ia_addr.sin6_addr;
525 if (cred != NULL && prison_local_ip6(cred, &tmp, (inp != NULL &&
526 (inp->inp_flags & IN6P_IPV6_V6ONLY) != 0)) != 0) {
527 IN6_IFADDR_RUNLOCK(&in6_ifa_tracker);
528 IP6STAT_INC(ip6s_sources_none);
529 return (EADDRNOTAVAIL);
535 bcopy(&tmp, srcp, sizeof(*srcp));
536 if (ia->ia_ifp == ifp)
537 IP6STAT_INC(ip6s_sources_sameif[best_scope]);
539 IP6STAT_INC(ip6s_sources_otherif[best_scope]);
540 if (dst_scope == best_scope)
541 IP6STAT_INC(ip6s_sources_samescope[best_scope]);
543 IP6STAT_INC(ip6s_sources_otherscope[best_scope]);
544 if (IFA6_IS_DEPRECATED(ia))
545 IP6STAT_INC(ip6s_sources_deprecated[best_scope]);
546 IN6_IFADDR_RUNLOCK(&in6_ifa_tracker);
551 * Select source address based on @inp, @dstsock and @opts.
552 * Stores selected address to @srcp. If @scope_ambiguous is set,
553 * embed scope from selected outgoing interface. If @hlim pointer
554 * is provided, stores calculated hop limit there.
555 * Returns 0 on success.
558 in6_selectsrc_socket(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
559 struct inpcb *inp, struct ucred *cred, int scope_ambiguous,
560 struct in6_addr *srcp, int *hlim)
562 struct ifnet *retifp;
566 fibnum = inp->inp_inc.inc_fibnum;
569 error = in6_selectsrc(fibnum, dstsock, opts, inp, cred, &retifp, srcp);
574 *hlim = in6_selecthlim(inp, retifp);
576 if (retifp == NULL || scope_ambiguous == 0)
580 * Application should provide a proper zone ID or the use of
581 * default zone IDs should be enabled. Unfortunately, some
582 * applications do not behave as it should, so we need a
583 * workaround. Even if an appropriate ID is not determined
584 * (when it's required), if we can determine the outgoing
585 * interface. determine the zone ID based on the interface.
587 error = in6_setscope(&dstsock->sin6_addr, retifp, NULL);
593 * Select source address based on @fibnum, @dst and @scopeid.
594 * Stores selected address to @srcp.
595 * Returns 0 on success.
597 * Used by non-socket based consumers (ND code mostly)
600 in6_selectsrc_addr(uint32_t fibnum, const struct in6_addr *dst,
601 uint32_t scopeid, struct ifnet *ifp, struct in6_addr *srcp,
604 struct ifnet *retifp;
605 struct sockaddr_in6 dst_sa;
609 bzero(&dst_sa, sizeof(dst_sa));
610 dst_sa.sin6_family = AF_INET6;
611 dst_sa.sin6_len = sizeof(dst_sa);
612 dst_sa.sin6_addr = *dst;
613 dst_sa.sin6_scope_id = scopeid;
614 sa6_embedscope(&dst_sa, 0);
616 error = in6_selectsrc(fibnum, &dst_sa, NULL, NULL, NULL, &retifp, srcp);
618 *hlim = in6_selecthlim(NULL, retifp);
624 * clone - meaningful only for bsdi and freebsd
627 selectroute(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
628 struct ip6_moptions *mopts, struct route_in6 *ro,
629 struct ifnet **retifp, struct nhop_object **retnh, int norouteok,
630 u_int fibnum, uint32_t flowid)
633 struct ifnet *ifp = NULL;
634 struct nhop_object *nh = NULL;
635 struct sockaddr_in6 *sin6_next;
636 struct in6_pktinfo *pi = NULL;
637 struct in6_addr *dst = &dstsock->sin6_addr;
640 char ip6buf[INET6_ADDRSTRLEN];
642 if (dstsock->sin6_addr.s6_addr32[0] == 0 &&
643 dstsock->sin6_addr.s6_addr32[1] == 0 &&
644 !IN6_IS_ADDR_LOOPBACK(&dstsock->sin6_addr)) {
645 printf("%s: strange destination %s\n", __func__,
646 ip6_sprintf(ip6buf, &dstsock->sin6_addr));
648 printf("%s: destination = %s%%%d\n", __func__,
649 ip6_sprintf(ip6buf, &dstsock->sin6_addr),
650 dstsock->sin6_scope_id); /* for debug */
654 /* If the caller specify the outgoing interface explicitly, use it. */
655 if (opts && (pi = opts->ip6po_pktinfo) != NULL && pi->ipi6_ifindex) {
656 /* XXX boundary check is assumed to be already done. */
657 ifp = ifnet_byindex(pi->ipi6_ifindex);
659 (norouteok || retnh == NULL ||
660 IN6_IS_ADDR_MULTICAST(dst))) {
662 * we do not have to check or get the route for
670 * If the destination address is a multicast address and the outgoing
671 * interface for the address is specified by the caller, use it.
673 if (IN6_IS_ADDR_MULTICAST(dst) &&
674 mopts != NULL && (ifp = mopts->im6o_multicast_ifp) != NULL) {
675 goto done; /* we do not need a route for multicast. */
678 * If destination address is LLA or link- or node-local multicast,
679 * use it's embedded scope zone id to determine outgoing interface.
681 if (IN6_IS_ADDR_MC_LINKLOCAL(dst) ||
682 IN6_IS_ADDR_MC_NODELOCAL(dst)) {
683 zoneid = ntohs(in6_getscope(dst));
685 ifp = in6_getlinkifnet(zoneid);
692 * If the next hop address for the packet is specified by the caller,
693 * use it as the gateway.
695 if (opts && opts->ip6po_nexthop) {
696 struct route_in6 *ron;
698 sin6_next = satosin6(opts->ip6po_nexthop);
699 if (IN6_IS_ADDR_LINKLOCAL(&sin6_next->sin6_addr)) {
701 * Next hop is LLA, thus it should be neighbor.
702 * Determine outgoing interface by zone index.
704 zoneid = ntohs(in6_getscope(&sin6_next->sin6_addr));
706 ifp = in6_getlinkifnet(zoneid);
710 ron = &opts->ip6po_nextroute;
711 /* Use a cached route if it exists and is valid. */
712 if (ron->ro_nh != NULL && (
713 !NH_IS_VALID(ron->ro_nh) ||
714 ron->ro_dst.sin6_family != AF_INET6 ||
715 !IN6_ARE_ADDR_EQUAL(&ron->ro_dst.sin6_addr,
716 &sin6_next->sin6_addr)))
718 if (ron->ro_nh == NULL) {
719 ron->ro_dst = *sin6_next;
721 * sin6_next is not link-local OR scopeid is 0,
722 * no need to clear scope
724 ron->ro_nh = fib6_lookup(fibnum,
725 &sin6_next->sin6_addr, 0, NHR_REF, flowid);
728 * The node identified by that address must be a
729 * neighbor of the sending host.
731 if (ron->ro_nh == NULL ||
732 (ron->ro_nh->nh_flags & NHF_GATEWAY) != 0)
733 error = EHOSTUNREACH;
742 * Use a cached route if it exists and is valid, else try to allocate
743 * a new one. Note that we should check the address family of the
744 * cached destination, in case of sharing the cache with IPv4.
748 (!NH_IS_VALID(ro->ro_nh) ||
749 ((struct sockaddr *)(&ro->ro_dst))->sa_family != AF_INET6 ||
750 !IN6_ARE_ADDR_EQUAL(&satosin6(&ro->ro_dst)->sin6_addr,
754 if (ro->ro_nh == (struct nhop_object *)NULL) {
755 struct sockaddr_in6 *sa6;
757 /* No route yet, so try to acquire one */
758 bzero(&ro->ro_dst, sizeof(struct sockaddr_in6));
759 sa6 = (struct sockaddr_in6 *)&ro->ro_dst;
761 sa6->sin6_scope_id = 0;
764 * Currently dst has scopeid embedded iff it is LL.
765 * New routing API accepts scopeid as a separate argument.
766 * Convert dst before/after doing lookup
768 uint32_t scopeid = 0;
769 if (IN6_IS_SCOPE_LINKLOCAL(&sa6->sin6_addr)) {
770 /* Unwrap in6_getscope() and in6_clearscope() */
771 scopeid = ntohs(sa6->sin6_addr.s6_addr16[1]);
772 sa6->sin6_addr.s6_addr16[1] = 0;
777 rtalloc_mpath_fib((struct route *)ro,
778 ntohl(sa6->sin6_addr.s6_addr32[3]), fibnum);
780 ro->ro_nh = fib6_lookup(fibnum,
781 &sa6->sin6_addr, scopeid, NHR_REF, flowid);
783 if (IN6_IS_SCOPE_LINKLOCAL(&sa6->sin6_addr))
784 sa6->sin6_addr.s6_addr16[1] = htons(scopeid);
788 * do not care about the result if we have the nexthop
789 * explicitly specified.
791 if (opts && opts->ip6po_nexthop)
795 ifp = ro->ro_nh->nh_ifp;
797 error = EHOSTUNREACH;
801 * Check if the outgoing interface conflicts with
802 * the interface specified by ipi6_ifindex (if specified).
803 * Note that loopback interface is always okay.
804 * (this may happen when we are sending a packet to one of
805 * our own addresses.)
807 if (ifp && opts && opts->ip6po_pktinfo &&
808 opts->ip6po_pktinfo->ipi6_ifindex) {
809 if (!(ifp->if_flags & IFF_LOOPBACK) &&
811 opts->ip6po_pktinfo->ipi6_ifindex) {
812 error = EHOSTUNREACH;
819 if (ifp == NULL && nh == NULL) {
821 * This can happen if the caller did not pass a cached route
822 * nor any other hints. We treat this case an error.
824 error = EHOSTUNREACH;
826 if (error == EHOSTUNREACH)
827 IP6STAT_INC(ip6s_noroute);
829 if (retifp != NULL) {
831 *retifp = nh->nh_aifp;
837 *retnh = nh; /* nh may be NULL */
843 in6_selectif(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
844 struct ip6_moptions *mopts, struct ifnet **retifp,
845 struct ifnet *oifp, u_int fibnum)
848 struct route_in6 sro;
849 struct nhop_object *nh = NULL;
852 KASSERT(retifp != NULL, ("%s: retifp is NULL", __func__));
854 bzero(&sro, sizeof(sro));
857 error = selectroute(dstsock, opts, mopts, &sro, retifp, &nh, 1, fibnum, 0);
860 nh_flags = nh->nh_flags;
861 if (nh != NULL && nh == sro.ro_nh)
865 /* Help ND. See oifp comment in in6_selectsrc(). */
866 if (oifp != NULL && fibnum == RT_DEFAULT_FIB) {
874 * do not use a rejected or black hole route.
875 * XXX: this check should be done in the L2 output routine.
876 * However, if we skipped this check here, we'd see the following
878 * - install a rejected route for a scoped address prefix
880 * - send a packet to a destination that matches the scoped prefix,
881 * with ambiguity about the scope zone.
882 * - pick the outgoing interface from the route, and disambiguate the
883 * scope zone with the interface.
884 * - ip6_output() would try to get another route with the "new"
885 * destination, which may be valid.
886 * - we'd see no error on output.
887 * Although this may not be very harmful, it should still be confusing.
888 * We thus reject the case here.
891 if (nh_flags & (NHF_REJECT | NHF_BLACKHOLE)) {
892 error = (nh_flags & NHF_HOST ? EHOSTUNREACH : ENETUNREACH);
899 /* Public wrapper function to selectroute(). */
901 in6_selectroute(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
902 struct ip6_moptions *mopts, struct route_in6 *ro,
903 struct ifnet **retifp, struct nhop_object **retnh, u_int fibnum, uint32_t flowid)
906 return (selectroute(dstsock, opts, mopts, ro, retifp,
907 retnh, 0, fibnum, flowid));
911 * Default hop limit selection. The precedence is as follows:
912 * 1. Hoplimit value specified via ioctl.
913 * 2. (If the outgoing interface is detected) the current
914 * hop limit of the interface specified by router advertisement.
915 * 3. The system default hoplimit.
918 in6_selecthlim(struct inpcb *inp, struct ifnet *ifp)
921 if (inp && inp->in6p_hops >= 0)
922 return (inp->in6p_hops);
924 return (ND_IFINFO(ifp)->chlim);
925 else if (inp && !IN6_IS_ADDR_UNSPECIFIED(&inp->in6p_faddr)) {
926 struct nhop6_basic nh6;
928 uint32_t fibnum, scopeid;
931 fibnum = inp->inp_inc.inc_fibnum;
932 in6_splitscope(&inp->in6p_faddr, &dst, &scopeid);
933 if (fib6_lookup_nh_basic(fibnum, &dst, scopeid, 0, 0, &nh6)==0){
934 hlim = ND_IFINFO(nh6.nh_ifp)->chlim;
938 return (V_ip6_defhlim);
942 * XXX: this is borrowed from in6_pcbbind(). If possible, we should
943 * share this function by all *bsd*...
946 in6_pcbsetport(struct in6_addr *laddr, struct inpcb *inp, struct ucred *cred)
948 struct socket *so = inp->inp_socket;
950 int error, lookupflags = 0;
952 struct inpcbinfo *pcbinfo = inp->inp_pcbinfo;
955 INP_WLOCK_ASSERT(inp);
956 INP_HASH_WLOCK_ASSERT(pcbinfo);
958 error = prison_local_ip6(cred, laddr,
959 ((inp->inp_flags & IN6P_IPV6_V6ONLY) != 0));
963 /* XXX: this is redundant when called from in6_pcbbind */
964 if ((so->so_options & (SO_REUSEADDR|SO_REUSEPORT|SO_REUSEPORT_LB)) == 0)
965 lookupflags = INPLOOKUP_WILDCARD;
967 inp->inp_flags |= INP_ANONPORT;
969 error = in_pcb_lport(inp, NULL, &lport, cred, lookupflags);
973 inp->inp_lport = lport;
974 if (in_pcbinshash(inp) != 0) {
975 inp->in6p_laddr = in6addr_any;
984 addrsel_policy_init(void)
989 /* initialize the "last resort" policy */
990 bzero(&V_defaultaddrpolicy, sizeof(V_defaultaddrpolicy));
991 V_defaultaddrpolicy.label = ADDR_LABEL_NOTAPP;
993 if (!IS_DEFAULT_VNET(curvnet))
997 ADDRSEL_SXLOCK_INIT();
1000 static struct in6_addrpolicy *
1001 lookup_addrsel_policy(struct sockaddr_in6 *key)
1003 struct in6_addrpolicy *match = NULL;
1006 match = match_addrsel_policy(key);
1009 match = &V_defaultaddrpolicy;
1018 * Subroutines to manage the address selection policy table via sysctl.
1021 struct sysctl_req *w_req;
1024 static int in6_src_sysctl(SYSCTL_HANDLER_ARGS);
1025 SYSCTL_DECL(_net_inet6_ip6);
1026 static SYSCTL_NODE(_net_inet6_ip6, IPV6CTL_ADDRCTLPOLICY, addrctlpolicy,
1027 CTLFLAG_RD | CTLFLAG_MPSAFE, in6_src_sysctl,
1031 in6_src_sysctl(SYSCTL_HANDLER_ARGS)
1038 bzero(&w, sizeof(w));
1041 return (walk_addrsel_policy(dump_addrsel_policyent, &w));
1045 in6_src_ioctl(u_long cmd, caddr_t data)
1047 struct in6_addrpolicy ent0;
1049 if (cmd != SIOCAADDRCTL_POLICY && cmd != SIOCDADDRCTL_POLICY)
1050 return (EOPNOTSUPP); /* check for safety */
1052 ent0 = *(struct in6_addrpolicy *)data;
1054 if (ent0.label == ADDR_LABEL_NOTAPP)
1056 /* check if the prefix mask is consecutive. */
1057 if (in6_mask2len(&ent0.addrmask.sin6_addr, NULL) < 0)
1059 /* clear trailing garbages (if any) of the prefix address. */
1060 IN6_MASK_ADDR(&ent0.addr.sin6_addr, &ent0.addrmask.sin6_addr);
1064 case SIOCAADDRCTL_POLICY:
1065 return (add_addrsel_policyent(&ent0));
1066 case SIOCDADDRCTL_POLICY:
1067 return (delete_addrsel_policyent(&ent0));
1070 return (0); /* XXX: compromise compilers */
1074 * The followings are implementation of the policy table using a
1075 * simple tail queue.
1076 * XXX such details should be hidden.
1077 * XXX implementation using binary tree should be more efficient.
1079 struct addrsel_policyent {
1080 TAILQ_ENTRY(addrsel_policyent) ape_entry;
1081 struct in6_addrpolicy ape_policy;
1084 TAILQ_HEAD(addrsel_policyhead, addrsel_policyent);
1086 VNET_DEFINE_STATIC(struct addrsel_policyhead, addrsel_policytab);
1087 #define V_addrsel_policytab VNET(addrsel_policytab)
1090 init_policy_queue(void)
1093 TAILQ_INIT(&V_addrsel_policytab);
1097 add_addrsel_policyent(struct in6_addrpolicy *newpolicy)
1099 struct addrsel_policyent *new, *pol;
1101 new = malloc(sizeof(*new), M_IFADDR,
1106 /* duplication check */
1107 TAILQ_FOREACH(pol, &V_addrsel_policytab, ape_entry) {
1108 if (IN6_ARE_ADDR_EQUAL(&newpolicy->addr.sin6_addr,
1109 &pol->ape_policy.addr.sin6_addr) &&
1110 IN6_ARE_ADDR_EQUAL(&newpolicy->addrmask.sin6_addr,
1111 &pol->ape_policy.addrmask.sin6_addr)) {
1114 free(new, M_IFADDR);
1115 return (EEXIST); /* or override it? */
1119 bzero(new, sizeof(*new));
1121 /* XXX: should validate entry */
1122 new->ape_policy = *newpolicy;
1124 TAILQ_INSERT_TAIL(&V_addrsel_policytab, new, ape_entry);
1132 delete_addrsel_policyent(struct in6_addrpolicy *key)
1134 struct addrsel_policyent *pol;
1139 /* search for the entry in the table */
1140 TAILQ_FOREACH(pol, &V_addrsel_policytab, ape_entry) {
1141 if (IN6_ARE_ADDR_EQUAL(&key->addr.sin6_addr,
1142 &pol->ape_policy.addr.sin6_addr) &&
1143 IN6_ARE_ADDR_EQUAL(&key->addrmask.sin6_addr,
1144 &pol->ape_policy.addrmask.sin6_addr)) {
1154 TAILQ_REMOVE(&V_addrsel_policytab, pol, ape_entry);
1157 free(pol, M_IFADDR);
1163 walk_addrsel_policy(int (*callback)(struct in6_addrpolicy *, void *), void *w)
1165 struct addrsel_policyent *pol;
1169 TAILQ_FOREACH(pol, &V_addrsel_policytab, ape_entry) {
1170 if ((error = (*callback)(&pol->ape_policy, w)) != 0) {
1180 dump_addrsel_policyent(struct in6_addrpolicy *pol, void *arg)
1183 struct walkarg *w = arg;
1185 error = SYSCTL_OUT(w->w_req, pol, sizeof(*pol));
1190 static struct in6_addrpolicy *
1191 match_addrsel_policy(struct sockaddr_in6 *key)
1193 struct addrsel_policyent *pent;
1194 struct in6_addrpolicy *bestpol = NULL, *pol;
1195 int matchlen, bestmatchlen = -1;
1196 u_char *mp, *ep, *k, *p, m;
1198 TAILQ_FOREACH(pent, &V_addrsel_policytab, ape_entry) {
1201 pol = &pent->ape_policy;
1202 mp = (u_char *)&pol->addrmask.sin6_addr;
1203 ep = mp + 16; /* XXX: scope field? */
1204 k = (u_char *)&key->sin6_addr;
1205 p = (u_char *)&pol->addr.sin6_addr;
1206 for (; mp < ep && *mp; mp++, k++, p++) {
1209 goto next; /* not match */
1210 if (m == 0xff) /* short cut for a typical case */
1220 /* matched. check if this is better than the current best. */
1221 if (bestpol == NULL ||
1222 matchlen > bestmatchlen) {
1224 bestmatchlen = matchlen;