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