1 /*- 2 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 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. 16 * 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 27 * SUCH DAMAGE. 28 * 29 * $KAME: in6_src.c,v 1.132 2003/08/26 04:42:27 keiichi Exp $ 30 */ 31 32 /*- 33 * Copyright (c) 1982, 1986, 1991, 1993 34 * The Regents of the University of California. All rights reserved. 35 * 36 * Redistribution and use in source and binary forms, with or without 37 * modification, are permitted provided that the following conditions 38 * are met: 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. 47 * 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 58 * SUCH DAMAGE. 59 * 60 * @(#)in_pcb.c 8.2 (Berkeley) 1/4/94 61 */ 62 63 #include <sys/cdefs.h> 64 __FBSDID("$FreeBSD$"); 65 66 #include "opt_inet.h" 67 #include "opt_inet6.h" 68 #include "opt_mpath.h" 69 70 #include <sys/param.h> 71 #include <sys/systm.h> 72 #include <sys/lock.h> 73 #include <sys/malloc.h> 74 #include <sys/mbuf.h> 75 #include <sys/priv.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> 82 #include <sys/time.h> 83 #include <sys/jail.h> 84 #include <sys/kernel.h> 85 #include <sys/rmlock.h> 86 #include <sys/sx.h> 87 88 #include <net/if.h> 89 #include <net/if_var.h> 90 #include <net/if_dl.h> 91 #include <net/route.h> 92 #include <net/if_llatbl.h> 93 #ifdef RADIX_MPATH 94 #include <net/radix_mpath.h> 95 #endif 96 97 #include <netinet/in.h> 98 #include <netinet/in_var.h> 99 #include <netinet/in_systm.h> 100 #include <netinet/ip.h> 101 #include <netinet/in_pcb.h> 102 #include <netinet/ip_var.h> 103 #include <netinet/udp.h> 104 #include <netinet/udp_var.h> 105 106 #include <netinet6/in6_var.h> 107 #include <netinet/ip6.h> 108 #include <netinet6/in6_pcb.h> 109 #include <netinet6/ip6_var.h> 110 #include <netinet6/scope6_var.h> 111 #include <netinet6/nd6.h> 112 113 static struct mtx addrsel_lock; 114 #define ADDRSEL_LOCK_INIT() mtx_init(&addrsel_lock, "addrsel_lock", NULL, MTX_DEF) 115 #define ADDRSEL_LOCK() mtx_lock(&addrsel_lock) 116 #define ADDRSEL_UNLOCK() mtx_unlock(&addrsel_lock) 117 #define ADDRSEL_LOCK_ASSERT() mtx_assert(&addrsel_lock, MA_OWNED) 118 119 static struct sx addrsel_sxlock; 120 #define ADDRSEL_SXLOCK_INIT() sx_init(&addrsel_sxlock, "addrsel_sxlock") 121 #define ADDRSEL_SLOCK() sx_slock(&addrsel_sxlock) 122 #define ADDRSEL_SUNLOCK() sx_sunlock(&addrsel_sxlock) 123 #define ADDRSEL_XLOCK() sx_xlock(&addrsel_sxlock) 124 #define ADDRSEL_XUNLOCK() sx_xunlock(&addrsel_sxlock) 125 126 #define ADDR_LABEL_NOTAPP (-1) 127 static VNET_DEFINE(struct in6_addrpolicy, defaultaddrpolicy); 128 #define V_defaultaddrpolicy VNET(defaultaddrpolicy) 129 130 VNET_DEFINE(int, ip6_prefer_tempaddr) = 0; 131 132 static int selectroute(struct sockaddr_in6 *, struct ip6_pktopts *, 133 struct ip6_moptions *, struct route_in6 *, struct ifnet **, 134 struct rtentry **, int, u_int); 135 static int in6_selectif(struct sockaddr_in6 *, struct ip6_pktopts *, 136 struct ip6_moptions *, struct route_in6 *ro, struct ifnet **, 137 struct ifnet *, u_int); 138 139 static struct in6_addrpolicy *lookup_addrsel_policy(struct sockaddr_in6 *); 140 141 static void init_policy_queue(void); 142 static int add_addrsel_policyent(struct in6_addrpolicy *); 143 static int delete_addrsel_policyent(struct in6_addrpolicy *); 144 static int walk_addrsel_policy(int (*)(struct in6_addrpolicy *, void *), 145 void *); 146 static int dump_addrsel_policyent(struct in6_addrpolicy *, void *); 147 static struct in6_addrpolicy *match_addrsel_policy(struct sockaddr_in6 *); 148 149 /* 150 * Return an IPv6 address, which is the most appropriate for a given 151 * destination and user specified options. 152 * If necessary, this function lookups the routing table and returns 153 * an entry to the caller for later use. 154 */ 155 #define REPLACE(r) do {\ 156 IP6STAT_INC(ip6s_sources_rule[(r)]); \ 157 rule = (r); \ 158 /* { \ 159 char ip6buf[INET6_ADDRSTRLEN], ip6b[INET6_ADDRSTRLEN]; \ 160 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)); \ 161 } */ \ 162 goto replace; \ 163 } while(0) 164 #define NEXT(r) do {\ 165 /* { \ 166 char ip6buf[INET6_ADDRSTRLEN], ip6b[INET6_ADDRSTRLEN]; \ 167 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 } */ \ 169 goto next; /* XXX: we can't use 'continue' here */ \ 170 } while(0) 171 #define BREAK(r) do { \ 172 IP6STAT_INC(ip6s_sources_rule[(r)]); \ 173 rule = (r); \ 174 goto out; /* XXX: we can't use 'break' here */ \ 175 } while(0) 176 177 int 178 in6_selectsrc(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts, 179 struct inpcb *inp, struct route_in6 *ro, struct ucred *cred, 180 struct ifnet **ifpp, struct in6_addr *srcp) 181 { 182 struct rm_priotracker in6_ifa_tracker; 183 struct in6_addr dst, tmp; 184 struct ifnet *ifp = NULL, *oifp = NULL; 185 struct in6_ifaddr *ia = NULL, *ia_best = NULL; 186 struct in6_pktinfo *pi = NULL; 187 int dst_scope = -1, best_scope = -1, best_matchlen = -1; 188 struct in6_addrpolicy *dst_policy = NULL, *best_policy = NULL; 189 u_int32_t odstzone; 190 int prefer_tempaddr; 191 int error, rule; 192 struct ip6_moptions *mopts; 193 194 KASSERT(srcp != NULL, ("%s: srcp is NULL", __func__)); 195 196 dst = dstsock->sin6_addr; /* make a copy for local operation */ 197 if (ifpp) { 198 /* 199 * Save a possibly passed in ifp for in6_selectsrc. Only 200 * neighbor discovery code should use this feature, where 201 * we may know the interface but not the FIB number holding 202 * the connected subnet in case someone deleted it from the 203 * default FIB and we need to check the interface. 204 */ 205 if (*ifpp != NULL) 206 oifp = *ifpp; 207 *ifpp = NULL; 208 } 209 210 if (inp != NULL) { 211 INP_LOCK_ASSERT(inp); 212 mopts = inp->in6p_moptions; 213 } else { 214 mopts = NULL; 215 } 216 217 /* 218 * If the source address is explicitly specified by the caller, 219 * check if the requested source address is indeed a unicast address 220 * assigned to the node, and can be used as the packet's source 221 * address. If everything is okay, use the address as source. 222 */ 223 if (opts && (pi = opts->ip6po_pktinfo) && 224 !IN6_IS_ADDR_UNSPECIFIED(&pi->ipi6_addr)) { 225 struct sockaddr_in6 srcsock; 226 struct in6_ifaddr *ia6; 227 228 /* get the outgoing interface */ 229 if ((error = in6_selectif(dstsock, opts, mopts, ro, &ifp, oifp, 230 (inp != NULL) ? inp->inp_inc.inc_fibnum : RT_DEFAULT_FIB)) 231 != 0) 232 return (error); 233 234 /* 235 * determine the appropriate zone id of the source based on 236 * the zone of the destination and the outgoing interface. 237 * If the specified address is ambiguous wrt the scope zone, 238 * the interface must be specified; otherwise, ifa_ifwithaddr() 239 * will fail matching the address. 240 */ 241 bzero(&srcsock, sizeof(srcsock)); 242 srcsock.sin6_family = AF_INET6; 243 srcsock.sin6_len = sizeof(srcsock); 244 srcsock.sin6_addr = pi->ipi6_addr; 245 if (ifp) { 246 error = in6_setscope(&srcsock.sin6_addr, ifp, NULL); 247 if (error) 248 return (error); 249 } 250 if (cred != NULL && (error = prison_local_ip6(cred, 251 &srcsock.sin6_addr, (inp != NULL && 252 (inp->inp_flags & IN6P_IPV6_V6ONLY) != 0))) != 0) 253 return (error); 254 255 ia6 = (struct in6_ifaddr *)ifa_ifwithaddr( 256 (struct sockaddr *)&srcsock); 257 if (ia6 == NULL || 258 (ia6->ia6_flags & (IN6_IFF_ANYCAST | IN6_IFF_NOTREADY))) { 259 if (ia6 != NULL) 260 ifa_free(&ia6->ia_ifa); 261 return (EADDRNOTAVAIL); 262 } 263 pi->ipi6_addr = srcsock.sin6_addr; /* XXX: this overrides pi */ 264 if (ifpp) 265 *ifpp = ifp; 266 bcopy(&ia6->ia_addr.sin6_addr, srcp, sizeof(*srcp)); 267 ifa_free(&ia6->ia_ifa); 268 return (0); 269 } 270 271 /* 272 * Otherwise, if the socket has already bound the source, just use it. 273 */ 274 if (inp != NULL && !IN6_IS_ADDR_UNSPECIFIED(&inp->in6p_laddr)) { 275 if (cred != NULL && 276 (error = prison_local_ip6(cred, &inp->in6p_laddr, 277 ((inp->inp_flags & IN6P_IPV6_V6ONLY) != 0))) != 0) 278 return (error); 279 bcopy(&inp->in6p_laddr, srcp, sizeof(*srcp)); 280 return (0); 281 } 282 283 /* 284 * Bypass source address selection and use the primary jail IP 285 * if requested. 286 */ 287 if (cred != NULL && !prison_saddrsel_ip6(cred, srcp)) 288 return (0); 289 290 /* 291 * If the address is not specified, choose the best one based on 292 * the outgoing interface and the destination address. 293 */ 294 /* get the outgoing interface */ 295 if ((error = in6_selectif(dstsock, opts, mopts, ro, &ifp, oifp, 296 (inp != NULL) ? inp->inp_inc.inc_fibnum : RT_DEFAULT_FIB)) != 0) 297 return (error); 298 299 #ifdef DIAGNOSTIC 300 if (ifp == NULL) /* this should not happen */ 301 panic("in6_selectsrc: NULL ifp"); 302 #endif 303 error = in6_setscope(&dst, ifp, &odstzone); 304 if (error) 305 return (error); 306 307 rule = 0; 308 IN6_IFADDR_RLOCK(&in6_ifa_tracker); 309 TAILQ_FOREACH(ia, &V_in6_ifaddrhead, ia_link) { 310 int new_scope = -1, new_matchlen = -1; 311 struct in6_addrpolicy *new_policy = NULL; 312 u_int32_t srczone, osrczone, dstzone; 313 struct in6_addr src; 314 struct ifnet *ifp1 = ia->ia_ifp; 315 316 /* 317 * We'll never take an address that breaks the scope zone 318 * of the destination. We also skip an address if its zone 319 * does not contain the outgoing interface. 320 * XXX: we should probably use sin6_scope_id here. 321 */ 322 if (in6_setscope(&dst, ifp1, &dstzone) || 323 odstzone != dstzone) { 324 continue; 325 } 326 src = ia->ia_addr.sin6_addr; 327 if (in6_setscope(&src, ifp, &osrczone) || 328 in6_setscope(&src, ifp1, &srczone) || 329 osrczone != srczone) { 330 continue; 331 } 332 333 /* avoid unusable addresses */ 334 if ((ia->ia6_flags & 335 (IN6_IFF_NOTREADY | IN6_IFF_ANYCAST | IN6_IFF_DETACHED))) { 336 continue; 337 } 338 if (!V_ip6_use_deprecated && IFA6_IS_DEPRECATED(ia)) 339 continue; 340 341 /* If jailed only take addresses of the jail into account. */ 342 if (cred != NULL && 343 prison_check_ip6(cred, &ia->ia_addr.sin6_addr) != 0) 344 continue; 345 346 /* Rule 1: Prefer same address */ 347 if (IN6_ARE_ADDR_EQUAL(&dst, &ia->ia_addr.sin6_addr)) { 348 ia_best = ia; 349 BREAK(1); /* there should be no better candidate */ 350 } 351 352 if (ia_best == NULL) 353 REPLACE(0); 354 355 /* Rule 2: Prefer appropriate scope */ 356 if (dst_scope < 0) 357 dst_scope = in6_addrscope(&dst); 358 new_scope = in6_addrscope(&ia->ia_addr.sin6_addr); 359 if (IN6_ARE_SCOPE_CMP(best_scope, new_scope) < 0) { 360 if (IN6_ARE_SCOPE_CMP(best_scope, dst_scope) < 0) 361 REPLACE(2); 362 NEXT(2); 363 } else if (IN6_ARE_SCOPE_CMP(new_scope, best_scope) < 0) { 364 if (IN6_ARE_SCOPE_CMP(new_scope, dst_scope) < 0) 365 NEXT(2); 366 REPLACE(2); 367 } 368 369 /* 370 * Rule 3: Avoid deprecated addresses. Note that the case of 371 * !ip6_use_deprecated is already rejected above. 372 */ 373 if (!IFA6_IS_DEPRECATED(ia_best) && IFA6_IS_DEPRECATED(ia)) 374 NEXT(3); 375 if (IFA6_IS_DEPRECATED(ia_best) && !IFA6_IS_DEPRECATED(ia)) 376 REPLACE(3); 377 378 /* Rule 4: Prefer home addresses */ 379 /* 380 * XXX: This is a TODO. We should probably merge the MIP6 381 * case above. 382 */ 383 384 /* Rule 5: Prefer outgoing interface */ 385 if (!(ND_IFINFO(ifp)->flags & ND6_IFF_NO_PREFER_IFACE)) { 386 if (ia_best->ia_ifp == ifp && ia->ia_ifp != ifp) 387 NEXT(5); 388 if (ia_best->ia_ifp != ifp && ia->ia_ifp == ifp) 389 REPLACE(5); 390 } 391 392 /* 393 * Rule 6: Prefer matching label 394 * Note that best_policy should be non-NULL here. 395 */ 396 if (dst_policy == NULL) 397 dst_policy = lookup_addrsel_policy(dstsock); 398 if (dst_policy->label != ADDR_LABEL_NOTAPP) { 399 new_policy = lookup_addrsel_policy(&ia->ia_addr); 400 if (dst_policy->label == best_policy->label && 401 dst_policy->label != new_policy->label) 402 NEXT(6); 403 if (dst_policy->label != best_policy->label && 404 dst_policy->label == new_policy->label) 405 REPLACE(6); 406 } 407 408 /* 409 * Rule 7: Prefer public addresses. 410 * We allow users to reverse the logic by configuring 411 * a sysctl variable, so that privacy conscious users can 412 * always prefer temporary addresses. 413 */ 414 if (opts == NULL || 415 opts->ip6po_prefer_tempaddr == IP6PO_TEMPADDR_SYSTEM) { 416 prefer_tempaddr = V_ip6_prefer_tempaddr; 417 } else if (opts->ip6po_prefer_tempaddr == 418 IP6PO_TEMPADDR_NOTPREFER) { 419 prefer_tempaddr = 0; 420 } else 421 prefer_tempaddr = 1; 422 if (!(ia_best->ia6_flags & IN6_IFF_TEMPORARY) && 423 (ia->ia6_flags & IN6_IFF_TEMPORARY)) { 424 if (prefer_tempaddr) 425 REPLACE(7); 426 else 427 NEXT(7); 428 } 429 if ((ia_best->ia6_flags & IN6_IFF_TEMPORARY) && 430 !(ia->ia6_flags & IN6_IFF_TEMPORARY)) { 431 if (prefer_tempaddr) 432 NEXT(7); 433 else 434 REPLACE(7); 435 } 436 437 /* 438 * Rule 8: prefer addresses on alive interfaces. 439 * This is a KAME specific rule. 440 */ 441 if ((ia_best->ia_ifp->if_flags & IFF_UP) && 442 !(ia->ia_ifp->if_flags & IFF_UP)) 443 NEXT(8); 444 if (!(ia_best->ia_ifp->if_flags & IFF_UP) && 445 (ia->ia_ifp->if_flags & IFF_UP)) 446 REPLACE(8); 447 448 /* 449 * Rule 9: prefer address with better virtual status. 450 */ 451 if (ifa_preferred(&ia_best->ia_ifa, &ia->ia_ifa)) 452 REPLACE(9); 453 if (ifa_preferred(&ia->ia_ifa, &ia_best->ia_ifa)) 454 NEXT(9); 455 456 /* 457 * Rule 10: prefer address with `prefer_source' flag. 458 */ 459 if ((ia_best->ia6_flags & IN6_IFF_PREFER_SOURCE) == 0 && 460 (ia->ia6_flags & IN6_IFF_PREFER_SOURCE) != 0) 461 REPLACE(10); 462 if ((ia_best->ia6_flags & IN6_IFF_PREFER_SOURCE) != 0 && 463 (ia->ia6_flags & IN6_IFF_PREFER_SOURCE) == 0) 464 NEXT(10); 465 466 /* 467 * Rule 14: Use longest matching prefix. 468 * Note: in the address selection draft, this rule is 469 * documented as "Rule 8". However, since it is also 470 * documented that this rule can be overridden, we assign 471 * a large number so that it is easy to assign smaller numbers 472 * to more preferred rules. 473 */ 474 new_matchlen = in6_matchlen(&ia->ia_addr.sin6_addr, &dst); 475 if (best_matchlen < new_matchlen) 476 REPLACE(14); 477 if (new_matchlen < best_matchlen) 478 NEXT(14); 479 480 /* Rule 15 is reserved. */ 481 482 /* 483 * Last resort: just keep the current candidate. 484 * Or, do we need more rules? 485 */ 486 continue; 487 488 replace: 489 ia_best = ia; 490 best_scope = (new_scope >= 0 ? new_scope : 491 in6_addrscope(&ia_best->ia_addr.sin6_addr)); 492 best_policy = (new_policy ? new_policy : 493 lookup_addrsel_policy(&ia_best->ia_addr)); 494 best_matchlen = (new_matchlen >= 0 ? new_matchlen : 495 in6_matchlen(&ia_best->ia_addr.sin6_addr, 496 &dst)); 497 498 next: 499 continue; 500 501 out: 502 break; 503 } 504 505 if ((ia = ia_best) == NULL) { 506 IN6_IFADDR_RUNLOCK(&in6_ifa_tracker); 507 IP6STAT_INC(ip6s_sources_none); 508 return (EADDRNOTAVAIL); 509 } 510 511 /* 512 * At this point at least one of the addresses belonged to the jail 513 * but it could still be, that we want to further restrict it, e.g. 514 * theoratically IN6_IS_ADDR_LOOPBACK. 515 * It must not be IN6_IS_ADDR_UNSPECIFIED anymore. 516 * prison_local_ip6() will fix an IN6_IS_ADDR_LOOPBACK but should 517 * let all others previously selected pass. 518 * Use tmp to not change ::1 on lo0 to the primary jail address. 519 */ 520 tmp = ia->ia_addr.sin6_addr; 521 if (cred != NULL && prison_local_ip6(cred, &tmp, (inp != NULL && 522 (inp->inp_flags & IN6P_IPV6_V6ONLY) != 0)) != 0) { 523 IN6_IFADDR_RUNLOCK(&in6_ifa_tracker); 524 IP6STAT_INC(ip6s_sources_none); 525 return (EADDRNOTAVAIL); 526 } 527 528 if (ifpp) 529 *ifpp = ifp; 530 531 bcopy(&tmp, srcp, sizeof(*srcp)); 532 if (ia->ia_ifp == ifp) 533 IP6STAT_INC(ip6s_sources_sameif[best_scope]); 534 else 535 IP6STAT_INC(ip6s_sources_otherif[best_scope]); 536 if (dst_scope == best_scope) 537 IP6STAT_INC(ip6s_sources_samescope[best_scope]); 538 else 539 IP6STAT_INC(ip6s_sources_otherscope[best_scope]); 540 if (IFA6_IS_DEPRECATED(ia)) 541 IP6STAT_INC(ip6s_sources_deprecated[best_scope]); 542 IN6_IFADDR_RUNLOCK(&in6_ifa_tracker); 543 return (0); 544 } 545 546 /* 547 * clone - meaningful only for bsdi and freebsd 548 */ 549 static int 550 selectroute(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts, 551 struct ip6_moptions *mopts, struct route_in6 *ro, 552 struct ifnet **retifp, struct rtentry **retrt, int norouteok, u_int fibnum) 553 { 554 int error = 0; 555 struct ifnet *ifp = NULL; 556 struct rtentry *rt = NULL; 557 struct sockaddr_in6 *sin6_next; 558 struct in6_pktinfo *pi = NULL; 559 struct in6_addr *dst = &dstsock->sin6_addr; 560 uint32_t zoneid; 561 #if 0 562 char ip6buf[INET6_ADDRSTRLEN]; 563 564 if (dstsock->sin6_addr.s6_addr32[0] == 0 && 565 dstsock->sin6_addr.s6_addr32[1] == 0 && 566 !IN6_IS_ADDR_LOOPBACK(&dstsock->sin6_addr)) { 567 printf("in6_selectroute: strange destination %s\n", 568 ip6_sprintf(ip6buf, &dstsock->sin6_addr)); 569 } else { 570 printf("in6_selectroute: destination = %s%%%d\n", 571 ip6_sprintf(ip6buf, &dstsock->sin6_addr), 572 dstsock->sin6_scope_id); /* for debug */ 573 } 574 #endif 575 576 /* If the caller specify the outgoing interface explicitly, use it. */ 577 if (opts && (pi = opts->ip6po_pktinfo) != NULL && pi->ipi6_ifindex) { 578 /* XXX boundary check is assumed to be already done. */ 579 ifp = ifnet_byindex(pi->ipi6_ifindex); 580 if (ifp != NULL && 581 (norouteok || retrt == NULL || 582 IN6_IS_ADDR_MULTICAST(dst))) { 583 /* 584 * we do not have to check or get the route for 585 * multicast. 586 */ 587 goto done; 588 } else 589 goto getroute; 590 } 591 /* 592 * If the destination address is a multicast address and the outgoing 593 * interface for the address is specified by the caller, use it. 594 */ 595 if (IN6_IS_ADDR_MULTICAST(dst) && 596 mopts != NULL && (ifp = mopts->im6o_multicast_ifp) != NULL) { 597 goto done; /* we do not need a route for multicast. */ 598 } 599 /* 600 * If destination address is LLA or link- or node-local multicast, 601 * use it's embedded scope zone id to determine outgoing interface. 602 */ 603 if (IN6_IS_ADDR_MC_LINKLOCAL(dst) || 604 IN6_IS_ADDR_MC_NODELOCAL(dst)) { 605 zoneid = ntohs(in6_getscope(dst)); 606 if (zoneid > 0) { 607 ifp = in6_getlinkifnet(zoneid); 608 goto done; 609 } 610 } 611 612 getroute: 613 /* 614 * If the next hop address for the packet is specified by the caller, 615 * use it as the gateway. 616 */ 617 if (opts && opts->ip6po_nexthop) { 618 struct route_in6 *ron; 619 struct llentry *la; 620 621 sin6_next = satosin6(opts->ip6po_nexthop); 622 623 /* at this moment, we only support AF_INET6 next hops */ 624 if (sin6_next->sin6_family != AF_INET6) { 625 error = EAFNOSUPPORT; /* or should we proceed? */ 626 goto done; 627 } 628 629 /* 630 * If the next hop is an IPv6 address, then the node identified 631 * by that address must be a neighbor of the sending host. 632 */ 633 ron = &opts->ip6po_nextroute; 634 /* 635 * XXX what do we do here? 636 * PLZ to be fixing 637 */ 638 639 640 if (ron->ro_rt == NULL) { 641 in6_rtalloc(ron, fibnum); /* multi path case? */ 642 if (ron->ro_rt == NULL) { 643 /* XXX-BZ WT.? */ 644 if (ron->ro_rt) { 645 RTFREE(ron->ro_rt); 646 ron->ro_rt = NULL; 647 } 648 error = EHOSTUNREACH; 649 goto done; 650 } 651 } 652 653 rt = ron->ro_rt; 654 ifp = rt->rt_ifp; 655 IF_AFDATA_RLOCK(ifp); 656 la = lla_lookup(LLTABLE6(ifp), 0, (struct sockaddr *)sin6_next); 657 IF_AFDATA_RUNLOCK(ifp); 658 if (la != NULL) 659 LLE_RUNLOCK(la); 660 else { 661 error = EHOSTUNREACH; 662 goto done; 663 } 664 #if 0 665 if ((ron->ro_rt && 666 (ron->ro_rt->rt_flags & (RTF_UP | RTF_LLINFO)) != 667 (RTF_UP | RTF_LLINFO)) || 668 !IN6_ARE_ADDR_EQUAL(&satosin6(&ron->ro_dst)->sin6_addr, 669 &sin6_next->sin6_addr)) { 670 if (ron->ro_rt) { 671 RTFREE(ron->ro_rt); 672 ron->ro_rt = NULL; 673 } 674 *satosin6(&ron->ro_dst) = *sin6_next; 675 } 676 if (ron->ro_rt == NULL) { 677 in6_rtalloc(ron, fibnum); /* multi path case? */ 678 if (ron->ro_rt == NULL || 679 !(ron->ro_rt->rt_flags & RTF_LLINFO)) { 680 if (ron->ro_rt) { 681 RTFREE(ron->ro_rt); 682 ron->ro_rt = NULL; 683 } 684 error = EHOSTUNREACH; 685 goto done; 686 } 687 } 688 #endif 689 690 /* 691 * When cloning is required, try to allocate a route to the 692 * destination so that the caller can store path MTU 693 * information. 694 */ 695 goto done; 696 } 697 698 /* 699 * Use a cached route if it exists and is valid, else try to allocate 700 * a new one. Note that we should check the address family of the 701 * cached destination, in case of sharing the cache with IPv4. 702 */ 703 if (ro) { 704 if (ro->ro_rt && 705 (!(ro->ro_rt->rt_flags & RTF_UP) || 706 ((struct sockaddr *)(&ro->ro_dst))->sa_family != AF_INET6 || 707 !IN6_ARE_ADDR_EQUAL(&satosin6(&ro->ro_dst)->sin6_addr, 708 dst))) { 709 RTFREE(ro->ro_rt); 710 ro->ro_rt = (struct rtentry *)NULL; 711 } 712 if (ro->ro_rt == (struct rtentry *)NULL) { 713 struct sockaddr_in6 *sa6; 714 715 /* No route yet, so try to acquire one */ 716 bzero(&ro->ro_dst, sizeof(struct sockaddr_in6)); 717 sa6 = (struct sockaddr_in6 *)&ro->ro_dst; 718 *sa6 = *dstsock; 719 sa6->sin6_scope_id = 0; 720 721 #ifdef RADIX_MPATH 722 rtalloc_mpath_fib((struct route *)ro, 723 ntohl(sa6->sin6_addr.s6_addr32[3]), fibnum); 724 #else 725 ro->ro_rt = in6_rtalloc1((struct sockaddr *) 726 &ro->ro_dst, 0, 0UL, fibnum); 727 if (ro->ro_rt) 728 RT_UNLOCK(ro->ro_rt); 729 #endif 730 } 731 732 /* 733 * do not care about the result if we have the nexthop 734 * explicitly specified. 735 */ 736 if (opts && opts->ip6po_nexthop) 737 goto done; 738 739 if (ro->ro_rt) { 740 ifp = ro->ro_rt->rt_ifp; 741 742 if (ifp == NULL) { /* can this really happen? */ 743 RTFREE(ro->ro_rt); 744 ro->ro_rt = NULL; 745 } 746 } 747 if (ro->ro_rt == NULL) 748 error = EHOSTUNREACH; 749 rt = ro->ro_rt; 750 751 /* 752 * Check if the outgoing interface conflicts with 753 * the interface specified by ipi6_ifindex (if specified). 754 * Note that loopback interface is always okay. 755 * (this may happen when we are sending a packet to one of 756 * our own addresses.) 757 */ 758 if (ifp && opts && opts->ip6po_pktinfo && 759 opts->ip6po_pktinfo->ipi6_ifindex) { 760 if (!(ifp->if_flags & IFF_LOOPBACK) && 761 ifp->if_index != 762 opts->ip6po_pktinfo->ipi6_ifindex) { 763 error = EHOSTUNREACH; 764 goto done; 765 } 766 } 767 } 768 769 done: 770 if (ifp == NULL && rt == NULL) { 771 /* 772 * This can happen if the caller did not pass a cached route 773 * nor any other hints. We treat this case an error. 774 */ 775 error = EHOSTUNREACH; 776 } 777 if (error == EHOSTUNREACH) 778 IP6STAT_INC(ip6s_noroute); 779 780 if (retifp != NULL) { 781 *retifp = ifp; 782 783 /* 784 * Adjust the "outgoing" interface. If we're going to loop 785 * the packet back to ourselves, the ifp would be the loopback 786 * interface. However, we'd rather know the interface associated 787 * to the destination address (which should probably be one of 788 * our own addresses.) 789 */ 790 if (rt) { 791 if ((rt->rt_ifp->if_flags & IFF_LOOPBACK) && 792 (rt->rt_gateway->sa_family == AF_LINK)) 793 *retifp = 794 ifnet_byindex(((struct sockaddr_dl *) 795 rt->rt_gateway)->sdl_index); 796 } 797 } 798 799 if (retrt != NULL) 800 *retrt = rt; /* rt may be NULL */ 801 802 return (error); 803 } 804 805 static int 806 in6_selectif(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts, 807 struct ip6_moptions *mopts, struct route_in6 *ro, struct ifnet **retifp, 808 struct ifnet *oifp, u_int fibnum) 809 { 810 int error; 811 struct route_in6 sro; 812 struct rtentry *rt = NULL; 813 814 KASSERT(retifp != NULL, ("%s: retifp is NULL", __func__)); 815 816 if (ro == NULL) { 817 bzero(&sro, sizeof(sro)); 818 ro = &sro; 819 } 820 821 if ((error = selectroute(dstsock, opts, mopts, ro, retifp, 822 &rt, 1, fibnum)) != 0) { 823 if (ro == &sro && rt && rt == sro.ro_rt) 824 RTFREE(rt); 825 /* Help ND. See oifp comment in in6_selectsrc(). */ 826 if (oifp != NULL && fibnum == RT_DEFAULT_FIB) { 827 *retifp = oifp; 828 error = 0; 829 } 830 return (error); 831 } 832 833 /* 834 * do not use a rejected or black hole route. 835 * XXX: this check should be done in the L2 output routine. 836 * However, if we skipped this check here, we'd see the following 837 * scenario: 838 * - install a rejected route for a scoped address prefix 839 * (like fe80::/10) 840 * - send a packet to a destination that matches the scoped prefix, 841 * with ambiguity about the scope zone. 842 * - pick the outgoing interface from the route, and disambiguate the 843 * scope zone with the interface. 844 * - ip6_output() would try to get another route with the "new" 845 * destination, which may be valid. 846 * - we'd see no error on output. 847 * Although this may not be very harmful, it should still be confusing. 848 * We thus reject the case here. 849 */ 850 if (rt && (rt->rt_flags & (RTF_REJECT | RTF_BLACKHOLE))) { 851 int flags = (rt->rt_flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH); 852 853 if (ro == &sro && rt && rt == sro.ro_rt) 854 RTFREE(rt); 855 return (flags); 856 } 857 858 if (ro == &sro && rt && rt == sro.ro_rt) 859 RTFREE(rt); 860 return (0); 861 } 862 863 /* 864 * Public wrapper function to selectroute(). 865 * 866 * XXX-BZ in6_selectroute() should and will grow the FIB argument. The 867 * in6_selectroute_fib() function is only there for backward compat on stable. 868 */ 869 int 870 in6_selectroute(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts, 871 struct ip6_moptions *mopts, struct route_in6 *ro, 872 struct ifnet **retifp, struct rtentry **retrt) 873 { 874 875 return (selectroute(dstsock, opts, mopts, ro, retifp, 876 retrt, 0, RT_DEFAULT_FIB)); 877 } 878 879 #ifndef BURN_BRIDGES 880 int 881 in6_selectroute_fib(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts, 882 struct ip6_moptions *mopts, struct route_in6 *ro, 883 struct ifnet **retifp, struct rtentry **retrt, u_int fibnum) 884 { 885 886 return (selectroute(dstsock, opts, mopts, ro, retifp, 887 retrt, 0, fibnum)); 888 } 889 #endif 890 891 /* 892 * Default hop limit selection. The precedence is as follows: 893 * 1. Hoplimit value specified via ioctl. 894 * 2. (If the outgoing interface is detected) the current 895 * hop limit of the interface specified by router advertisement. 896 * 3. The system default hoplimit. 897 */ 898 int 899 in6_selecthlim(struct inpcb *in6p, struct ifnet *ifp) 900 { 901 902 if (in6p && in6p->in6p_hops >= 0) 903 return (in6p->in6p_hops); 904 else if (ifp) 905 return (ND_IFINFO(ifp)->chlim); 906 else if (in6p && !IN6_IS_ADDR_UNSPECIFIED(&in6p->in6p_faddr)) { 907 struct route_in6 ro6; 908 struct ifnet *lifp; 909 910 bzero(&ro6, sizeof(ro6)); 911 ro6.ro_dst.sin6_family = AF_INET6; 912 ro6.ro_dst.sin6_len = sizeof(struct sockaddr_in6); 913 ro6.ro_dst.sin6_addr = in6p->in6p_faddr; 914 in6_rtalloc(&ro6, in6p->inp_inc.inc_fibnum); 915 if (ro6.ro_rt) { 916 lifp = ro6.ro_rt->rt_ifp; 917 RTFREE(ro6.ro_rt); 918 if (lifp) 919 return (ND_IFINFO(lifp)->chlim); 920 } 921 } 922 return (V_ip6_defhlim); 923 } 924 925 /* 926 * XXX: this is borrowed from in6_pcbbind(). If possible, we should 927 * share this function by all *bsd*... 928 */ 929 int 930 in6_pcbsetport(struct in6_addr *laddr, struct inpcb *inp, struct ucred *cred) 931 { 932 struct socket *so = inp->inp_socket; 933 u_int16_t lport = 0; 934 int error, lookupflags = 0; 935 #ifdef INVARIANTS 936 struct inpcbinfo *pcbinfo = inp->inp_pcbinfo; 937 #endif 938 939 INP_WLOCK_ASSERT(inp); 940 INP_HASH_WLOCK_ASSERT(pcbinfo); 941 942 error = prison_local_ip6(cred, laddr, 943 ((inp->inp_flags & IN6P_IPV6_V6ONLY) != 0)); 944 if (error) 945 return(error); 946 947 /* XXX: this is redundant when called from in6_pcbbind */ 948 if ((so->so_options & (SO_REUSEADDR|SO_REUSEPORT)) == 0) 949 lookupflags = INPLOOKUP_WILDCARD; 950 951 inp->inp_flags |= INP_ANONPORT; 952 953 error = in_pcb_lport(inp, NULL, &lport, cred, lookupflags); 954 if (error != 0) 955 return (error); 956 957 inp->inp_lport = lport; 958 if (in_pcbinshash(inp) != 0) { 959 inp->in6p_laddr = in6addr_any; 960 inp->inp_lport = 0; 961 return (EAGAIN); 962 } 963 964 return (0); 965 } 966 967 void 968 addrsel_policy_init(void) 969 { 970 971 init_policy_queue(); 972 973 /* initialize the "last resort" policy */ 974 bzero(&V_defaultaddrpolicy, sizeof(V_defaultaddrpolicy)); 975 V_defaultaddrpolicy.label = ADDR_LABEL_NOTAPP; 976 977 if (!IS_DEFAULT_VNET(curvnet)) 978 return; 979 980 ADDRSEL_LOCK_INIT(); 981 ADDRSEL_SXLOCK_INIT(); 982 } 983 984 static struct in6_addrpolicy * 985 lookup_addrsel_policy(struct sockaddr_in6 *key) 986 { 987 struct in6_addrpolicy *match = NULL; 988 989 ADDRSEL_LOCK(); 990 match = match_addrsel_policy(key); 991 992 if (match == NULL) 993 match = &V_defaultaddrpolicy; 994 else 995 match->use++; 996 ADDRSEL_UNLOCK(); 997 998 return (match); 999 } 1000 1001 /* 1002 * Subroutines to manage the address selection policy table via sysctl. 1003 */ 1004 struct walkarg { 1005 struct sysctl_req *w_req; 1006 }; 1007 1008 static int in6_src_sysctl(SYSCTL_HANDLER_ARGS); 1009 SYSCTL_DECL(_net_inet6_ip6); 1010 static SYSCTL_NODE(_net_inet6_ip6, IPV6CTL_ADDRCTLPOLICY, addrctlpolicy, 1011 CTLFLAG_RD, in6_src_sysctl, ""); 1012 1013 static int 1014 in6_src_sysctl(SYSCTL_HANDLER_ARGS) 1015 { 1016 struct walkarg w; 1017 1018 if (req->newptr) 1019 return EPERM; 1020 1021 bzero(&w, sizeof(w)); 1022 w.w_req = req; 1023 1024 return (walk_addrsel_policy(dump_addrsel_policyent, &w)); 1025 } 1026 1027 int 1028 in6_src_ioctl(u_long cmd, caddr_t data) 1029 { 1030 struct in6_addrpolicy ent0; 1031 1032 if (cmd != SIOCAADDRCTL_POLICY && cmd != SIOCDADDRCTL_POLICY) 1033 return (EOPNOTSUPP); /* check for safety */ 1034 1035 ent0 = *(struct in6_addrpolicy *)data; 1036 1037 if (ent0.label == ADDR_LABEL_NOTAPP) 1038 return (EINVAL); 1039 /* check if the prefix mask is consecutive. */ 1040 if (in6_mask2len(&ent0.addrmask.sin6_addr, NULL) < 0) 1041 return (EINVAL); 1042 /* clear trailing garbages (if any) of the prefix address. */ 1043 IN6_MASK_ADDR(&ent0.addr.sin6_addr, &ent0.addrmask.sin6_addr); 1044 ent0.use = 0; 1045 1046 switch (cmd) { 1047 case SIOCAADDRCTL_POLICY: 1048 return (add_addrsel_policyent(&ent0)); 1049 case SIOCDADDRCTL_POLICY: 1050 return (delete_addrsel_policyent(&ent0)); 1051 } 1052 1053 return (0); /* XXX: compromise compilers */ 1054 } 1055 1056 /* 1057 * The followings are implementation of the policy table using a 1058 * simple tail queue. 1059 * XXX such details should be hidden. 1060 * XXX implementation using binary tree should be more efficient. 1061 */ 1062 struct addrsel_policyent { 1063 TAILQ_ENTRY(addrsel_policyent) ape_entry; 1064 struct in6_addrpolicy ape_policy; 1065 }; 1066 1067 TAILQ_HEAD(addrsel_policyhead, addrsel_policyent); 1068 1069 static VNET_DEFINE(struct addrsel_policyhead, addrsel_policytab); 1070 #define V_addrsel_policytab VNET(addrsel_policytab) 1071 1072 static void 1073 init_policy_queue(void) 1074 { 1075 1076 TAILQ_INIT(&V_addrsel_policytab); 1077 } 1078 1079 static int 1080 add_addrsel_policyent(struct in6_addrpolicy *newpolicy) 1081 { 1082 struct addrsel_policyent *new, *pol; 1083 1084 new = malloc(sizeof(*new), M_IFADDR, 1085 M_WAITOK); 1086 ADDRSEL_XLOCK(); 1087 ADDRSEL_LOCK(); 1088 1089 /* duplication check */ 1090 TAILQ_FOREACH(pol, &V_addrsel_policytab, ape_entry) { 1091 if (IN6_ARE_ADDR_EQUAL(&newpolicy->addr.sin6_addr, 1092 &pol->ape_policy.addr.sin6_addr) && 1093 IN6_ARE_ADDR_EQUAL(&newpolicy->addrmask.sin6_addr, 1094 &pol->ape_policy.addrmask.sin6_addr)) { 1095 ADDRSEL_UNLOCK(); 1096 ADDRSEL_XUNLOCK(); 1097 free(new, M_IFADDR); 1098 return (EEXIST); /* or override it? */ 1099 } 1100 } 1101 1102 bzero(new, sizeof(*new)); 1103 1104 /* XXX: should validate entry */ 1105 new->ape_policy = *newpolicy; 1106 1107 TAILQ_INSERT_TAIL(&V_addrsel_policytab, new, ape_entry); 1108 ADDRSEL_UNLOCK(); 1109 ADDRSEL_XUNLOCK(); 1110 1111 return (0); 1112 } 1113 1114 static int 1115 delete_addrsel_policyent(struct in6_addrpolicy *key) 1116 { 1117 struct addrsel_policyent *pol; 1118 1119 ADDRSEL_XLOCK(); 1120 ADDRSEL_LOCK(); 1121 1122 /* search for the entry in the table */ 1123 TAILQ_FOREACH(pol, &V_addrsel_policytab, ape_entry) { 1124 if (IN6_ARE_ADDR_EQUAL(&key->addr.sin6_addr, 1125 &pol->ape_policy.addr.sin6_addr) && 1126 IN6_ARE_ADDR_EQUAL(&key->addrmask.sin6_addr, 1127 &pol->ape_policy.addrmask.sin6_addr)) { 1128 break; 1129 } 1130 } 1131 if (pol == NULL) { 1132 ADDRSEL_UNLOCK(); 1133 ADDRSEL_XUNLOCK(); 1134 return (ESRCH); 1135 } 1136 1137 TAILQ_REMOVE(&V_addrsel_policytab, pol, ape_entry); 1138 ADDRSEL_UNLOCK(); 1139 ADDRSEL_XUNLOCK(); 1140 free(pol, M_IFADDR); 1141 1142 return (0); 1143 } 1144 1145 static int 1146 walk_addrsel_policy(int (*callback)(struct in6_addrpolicy *, void *), void *w) 1147 { 1148 struct addrsel_policyent *pol; 1149 int error = 0; 1150 1151 ADDRSEL_SLOCK(); 1152 TAILQ_FOREACH(pol, &V_addrsel_policytab, ape_entry) { 1153 if ((error = (*callback)(&pol->ape_policy, w)) != 0) { 1154 ADDRSEL_SUNLOCK(); 1155 return (error); 1156 } 1157 } 1158 ADDRSEL_SUNLOCK(); 1159 return (error); 1160 } 1161 1162 static int 1163 dump_addrsel_policyent(struct in6_addrpolicy *pol, void *arg) 1164 { 1165 int error = 0; 1166 struct walkarg *w = arg; 1167 1168 error = SYSCTL_OUT(w->w_req, pol, sizeof(*pol)); 1169 1170 return (error); 1171 } 1172 1173 static struct in6_addrpolicy * 1174 match_addrsel_policy(struct sockaddr_in6 *key) 1175 { 1176 struct addrsel_policyent *pent; 1177 struct in6_addrpolicy *bestpol = NULL, *pol; 1178 int matchlen, bestmatchlen = -1; 1179 u_char *mp, *ep, *k, *p, m; 1180 1181 TAILQ_FOREACH(pent, &V_addrsel_policytab, ape_entry) { 1182 matchlen = 0; 1183 1184 pol = &pent->ape_policy; 1185 mp = (u_char *)&pol->addrmask.sin6_addr; 1186 ep = mp + 16; /* XXX: scope field? */ 1187 k = (u_char *)&key->sin6_addr; 1188 p = (u_char *)&pol->addr.sin6_addr; 1189 for (; mp < ep && *mp; mp++, k++, p++) { 1190 m = *mp; 1191 if ((*k & m) != *p) 1192 goto next; /* not match */ 1193 if (m == 0xff) /* short cut for a typical case */ 1194 matchlen += 8; 1195 else { 1196 while (m >= 0x80) { 1197 matchlen++; 1198 m <<= 1; 1199 } 1200 } 1201 } 1202 1203 /* matched. check if this is better than the current best. */ 1204 if (bestpol == NULL || 1205 matchlen > bestmatchlen) { 1206 bestpol = pol; 1207 bestmatchlen = matchlen; 1208 } 1209 1210 next: 1211 continue; 1212 } 1213 1214 return (bestpol); 1215 } 1216