in6_src.c revision 1.62 1 1.62 ozaki /* $NetBSD: in6_src.c,v 1.62 2016/06/21 10:25:27 ozaki-r Exp $ */
2 1.23 rpaulo /* $KAME: in6_src.c,v 1.159 2005/10/19 01:40:32 t-momose Exp $ */
3 1.1 itojun
4 1.1 itojun /*
5 1.1 itojun * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
6 1.1 itojun * All rights reserved.
7 1.1 itojun *
8 1.1 itojun * Redistribution and use in source and binary forms, with or without
9 1.1 itojun * modification, are permitted provided that the following conditions
10 1.1 itojun * are met:
11 1.1 itojun * 1. Redistributions of source code must retain the above copyright
12 1.1 itojun * notice, this list of conditions and the following disclaimer.
13 1.1 itojun * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 itojun * notice, this list of conditions and the following disclaimer in the
15 1.1 itojun * documentation and/or other materials provided with the distribution.
16 1.1 itojun * 3. Neither the name of the project nor the names of its contributors
17 1.1 itojun * may be used to endorse or promote products derived from this software
18 1.1 itojun * without specific prior written permission.
19 1.1 itojun *
20 1.1 itojun * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
21 1.1 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 1.1 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 1.1 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
24 1.1 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 1.1 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 1.1 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 1.1 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 1.1 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 1.1 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 1.1 itojun * SUCH DAMAGE.
31 1.1 itojun */
32 1.1 itojun
33 1.1 itojun /*
34 1.1 itojun * Copyright (c) 1982, 1986, 1991, 1993
35 1.1 itojun * The Regents of the University of California. All rights reserved.
36 1.1 itojun *
37 1.1 itojun * Redistribution and use in source and binary forms, with or without
38 1.1 itojun * modification, are permitted provided that the following conditions
39 1.1 itojun * are met:
40 1.1 itojun * 1. Redistributions of source code must retain the above copyright
41 1.1 itojun * notice, this list of conditions and the following disclaimer.
42 1.1 itojun * 2. Redistributions in binary form must reproduce the above copyright
43 1.1 itojun * notice, this list of conditions and the following disclaimer in the
44 1.1 itojun * documentation and/or other materials provided with the distribution.
45 1.23 rpaulo * 3. All advertising materials mentioning features or use of this software
46 1.23 rpaulo * must display the following acknowledgement:
47 1.23 rpaulo * This product includes software developed by the University of
48 1.23 rpaulo * California, Berkeley and its contributors.
49 1.23 rpaulo * 4. Neither the name of the University nor the names of its contributors
50 1.1 itojun * may be used to endorse or promote products derived from this software
51 1.1 itojun * without specific prior written permission.
52 1.1 itojun *
53 1.1 itojun * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
54 1.1 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
55 1.1 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
56 1.1 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
57 1.1 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
58 1.1 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
59 1.1 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
60 1.1 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
61 1.1 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
62 1.1 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
63 1.1 itojun * SUCH DAMAGE.
64 1.1 itojun *
65 1.1 itojun * @(#)in_pcb.c 8.2 (Berkeley) 1/4/94
66 1.1 itojun */
67 1.9 lukem
68 1.9 lukem #include <sys/cdefs.h>
69 1.62 ozaki __KERNEL_RCSID(0, "$NetBSD: in6_src.c,v 1.62 2016/06/21 10:25:27 ozaki-r Exp $");
70 1.1 itojun
71 1.58 pooka #ifdef _KERNEL_OPT
72 1.1 itojun #include "opt_inet.h"
73 1.58 pooka #endif
74 1.1 itojun
75 1.1 itojun #include <sys/param.h>
76 1.1 itojun #include <sys/systm.h>
77 1.1 itojun #include <sys/malloc.h>
78 1.1 itojun #include <sys/mbuf.h>
79 1.1 itojun #include <sys/protosw.h>
80 1.1 itojun #include <sys/socket.h>
81 1.1 itojun #include <sys/socketvar.h>
82 1.1 itojun #include <sys/ioctl.h>
83 1.1 itojun #include <sys/errno.h>
84 1.1 itojun #include <sys/time.h>
85 1.23 rpaulo #include <sys/kernel.h>
86 1.1 itojun #include <sys/proc.h>
87 1.26 elad #include <sys/kauth.h>
88 1.1 itojun
89 1.1 itojun #include <net/if.h>
90 1.23 rpaulo #include <net/if_types.h>
91 1.1 itojun #include <net/route.h>
92 1.1 itojun
93 1.1 itojun #include <netinet/in.h>
94 1.1 itojun #include <netinet/in_var.h>
95 1.1 itojun #include <netinet/in_systm.h>
96 1.1 itojun #include <netinet/ip.h>
97 1.1 itojun #include <netinet/in_pcb.h>
98 1.53 christos #include <netinet/portalgo.h>
99 1.1 itojun #include <netinet6/in6_var.h>
100 1.1 itojun #include <netinet/ip6.h>
101 1.1 itojun #include <netinet6/in6_pcb.h>
102 1.1 itojun #include <netinet6/ip6_var.h>
103 1.43 thorpej #include <netinet6/ip6_private.h>
104 1.1 itojun #include <netinet6/nd6.h>
105 1.13 itojun #include <netinet6/scope6_var.h>
106 1.23 rpaulo
107 1.23 rpaulo #include <net/net_osdep.h>
108 1.23 rpaulo
109 1.23 rpaulo #ifdef MIP6
110 1.23 rpaulo #include <netinet6/mip6.h>
111 1.23 rpaulo #include <netinet6/mip6_var.h>
112 1.23 rpaulo #include "mip.h"
113 1.23 rpaulo #if NMIP > 0
114 1.23 rpaulo #include <net/if_mip.h>
115 1.23 rpaulo #endif /* NMIP > 0 */
116 1.23 rpaulo #endif /* MIP6 */
117 1.23 rpaulo
118 1.50 dyoung #include <netinet/tcp_vtw.h>
119 1.50 dyoung
120 1.23 rpaulo #define ADDR_LABEL_NOTAPP (-1)
121 1.23 rpaulo struct in6_addrpolicy defaultaddrpolicy;
122 1.23 rpaulo
123 1.23 rpaulo int ip6_prefer_tempaddr = 0;
124 1.23 rpaulo
125 1.35 dyoung static int selectroute(struct sockaddr_in6 *, struct ip6_pktopts *,
126 1.62 ozaki struct ip6_moptions *, struct route *, struct ifnet **, struct psref *,
127 1.35 dyoung struct rtentry **, int, int);
128 1.35 dyoung static int in6_selectif(struct sockaddr_in6 *, struct ip6_pktopts *,
129 1.62 ozaki struct ip6_moptions *, struct route *, struct ifnet **, struct psref *);
130 1.35 dyoung
131 1.35 dyoung static struct in6_addrpolicy *lookup_addrsel_policy(struct sockaddr_in6 *);
132 1.35 dyoung
133 1.35 dyoung static void init_policy_queue(void);
134 1.35 dyoung static int add_addrsel_policyent(struct in6_addrpolicy *);
135 1.35 dyoung static int delete_addrsel_policyent(struct in6_addrpolicy *);
136 1.35 dyoung static int walk_addrsel_policy(int (*)(struct in6_addrpolicy *, void *),
137 1.35 dyoung void *);
138 1.35 dyoung static int dump_addrsel_policyent(struct in6_addrpolicy *, void *);
139 1.35 dyoung static struct in6_addrpolicy *match_addrsel_policy(struct sockaddr_in6 *);
140 1.1 itojun
141 1.1 itojun /*
142 1.5 itojun * Return an IPv6 address, which is the most appropriate for a given
143 1.1 itojun * destination and user specified options.
144 1.5 itojun * If necessary, this function lookups the routing table and returns
145 1.1 itojun * an entry to the caller for later use.
146 1.1 itojun */
147 1.23 rpaulo #if 0 /* diabled ad-hoc */
148 1.23 rpaulo #define REPLACE(r) do {\
149 1.23 rpaulo if ((r) < sizeof(ip6stat.ip6s_sources_rule) / \
150 1.23 rpaulo sizeof(ip6stat.ip6s_sources_rule[0])) /* check for safety */ \
151 1.23 rpaulo ip6stat.ip6s_sources_rule[(r)]++; \
152 1.23 rpaulo /* printf("in6_selectsrc: replace %s with %s by %d\n", ia_best ? ip6_sprintf(&ia_best->ia_addr.sin6_addr) : "none", ip6_sprintf(&ia->ia_addr.sin6_addr), (r)); */ \
153 1.23 rpaulo goto replace; \
154 1.23 rpaulo } while(0)
155 1.23 rpaulo #define NEXT(r) do {\
156 1.23 rpaulo if ((r) < sizeof(ip6stat.ip6s_sources_rule) / \
157 1.23 rpaulo sizeof(ip6stat.ip6s_sources_rule[0])) /* check for safety */ \
158 1.23 rpaulo ip6stat.ip6s_sources_rule[(r)]++; \
159 1.23 rpaulo /* printf("in6_selectsrc: keep %s against %s by %d\n", ia_best ? ip6_sprintf(&ia_best->ia_addr.sin6_addr) : "none", ip6_sprintf(&ia->ia_addr.sin6_addr), (r)); */ \
160 1.23 rpaulo goto next; /* XXX: we can't use 'continue' here */ \
161 1.23 rpaulo } while(0)
162 1.23 rpaulo #define BREAK(r) do { \
163 1.23 rpaulo if ((r) < sizeof(ip6stat.ip6s_sources_rule) / \
164 1.23 rpaulo sizeof(ip6stat.ip6s_sources_rule[0])) /* check for safety */ \
165 1.23 rpaulo ip6stat.ip6s_sources_rule[(r)]++; \
166 1.23 rpaulo goto out; /* XXX: we can't use 'break' here */ \
167 1.23 rpaulo } while(0)
168 1.23 rpaulo #else
169 1.23 rpaulo #define REPLACE(r) goto replace
170 1.23 rpaulo #define NEXT(r) goto next
171 1.23 rpaulo #define BREAK(r) goto out
172 1.23 rpaulo #endif
173 1.23 rpaulo
174 1.1 itojun struct in6_addr *
175 1.38 christos in6_selectsrc(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
176 1.38 christos struct ip6_moptions *mopts, struct route *ro, struct in6_addr *laddr,
177 1.62 ozaki struct ifnet **ifpp, struct psref *psref, int *errorp)
178 1.1 itojun {
179 1.23 rpaulo struct in6_addr dst;
180 1.23 rpaulo struct ifnet *ifp = NULL;
181 1.23 rpaulo struct in6_ifaddr *ia = NULL, *ia_best = NULL;
182 1.1 itojun struct in6_pktinfo *pi = NULL;
183 1.23 rpaulo int dst_scope = -1, best_scope = -1, best_matchlen = -1;
184 1.23 rpaulo struct in6_addrpolicy *dst_policy = NULL, *best_policy = NULL;
185 1.23 rpaulo u_int32_t odstzone;
186 1.28 dyoung int error;
187 1.23 rpaulo int prefer_tempaddr;
188 1.23 rpaulo #if defined(MIP6) && NMIP > 0
189 1.23 rpaulo u_int8_t ip6po_usecoa = 0;
190 1.23 rpaulo #endif /* MIP6 && NMIP > 0 */
191 1.62 ozaki struct psref local_psref;
192 1.62 ozaki struct in6_addr *ret_ia = NULL;
193 1.62 ozaki int bound = curlwp_bind();
194 1.62 ozaki #define PSREF (psref == NULL) ? &local_psref : psref
195 1.62 ozaki
196 1.62 ozaki KASSERT((ifpp != NULL && psref != NULL) ||
197 1.62 ozaki (ifpp == NULL && psref == NULL));
198 1.1 itojun
199 1.23 rpaulo dst = dstsock->sin6_addr; /* make a copy for local operation */
200 1.1 itojun *errorp = 0;
201 1.23 rpaulo if (ifpp)
202 1.23 rpaulo *ifpp = NULL;
203 1.1 itojun
204 1.1 itojun /*
205 1.28 dyoung * Try to determine the outgoing interface for the given destination.
206 1.28 dyoung * We do this regardless of whether the socket is bound, since the
207 1.28 dyoung * caller may need this information as a side effect of the call
208 1.28 dyoung * to this function (e.g., for identifying the appropriate scope zone
209 1.28 dyoung * ID).
210 1.28 dyoung */
211 1.62 ozaki error = in6_selectif(dstsock, opts, mopts, ro, &ifp, PSREF);
212 1.62 ozaki if (ifpp != NULL)
213 1.28 dyoung *ifpp = ifp;
214 1.28 dyoung
215 1.28 dyoung /*
216 1.1 itojun * If the source address is explicitly specified by the caller,
217 1.23 rpaulo * check if the requested source address is indeed a unicast address
218 1.23 rpaulo * assigned to the node, and can be used as the packet's source
219 1.23 rpaulo * address. If everything is okay, use the address as source.
220 1.1 itojun */
221 1.1 itojun if (opts && (pi = opts->ip6po_pktinfo) &&
222 1.23 rpaulo !IN6_IS_ADDR_UNSPECIFIED(&pi->ipi6_addr)) {
223 1.23 rpaulo struct sockaddr_in6 srcsock;
224 1.23 rpaulo struct in6_ifaddr *ia6;
225 1.23 rpaulo
226 1.23 rpaulo /*
227 1.23 rpaulo * Determine the appropriate zone id of the source based on
228 1.23 rpaulo * the zone of the destination and the outgoing interface.
229 1.23 rpaulo * If the specified address is ambiguous wrt the scope zone,
230 1.23 rpaulo * the interface must be specified; otherwise, ifa_ifwithaddr()
231 1.23 rpaulo * will fail matching the address.
232 1.23 rpaulo */
233 1.46 cegger memset(&srcsock, 0, sizeof(srcsock));
234 1.23 rpaulo srcsock.sin6_family = AF_INET6;
235 1.23 rpaulo srcsock.sin6_len = sizeof(srcsock);
236 1.23 rpaulo srcsock.sin6_addr = pi->ipi6_addr;
237 1.23 rpaulo if (ifp) {
238 1.23 rpaulo *errorp = in6_setscope(&srcsock.sin6_addr, ifp, NULL);
239 1.23 rpaulo if (*errorp != 0)
240 1.62 ozaki goto exit;
241 1.23 rpaulo }
242 1.23 rpaulo
243 1.23 rpaulo ia6 = (struct in6_ifaddr *)ifa_ifwithaddr((struct sockaddr *)(&srcsock));
244 1.23 rpaulo if (ia6 == NULL ||
245 1.23 rpaulo (ia6->ia6_flags & (IN6_IFF_ANYCAST | IN6_IFF_NOTREADY))) {
246 1.23 rpaulo *errorp = EADDRNOTAVAIL;
247 1.62 ozaki goto exit;
248 1.23 rpaulo }
249 1.23 rpaulo pi->ipi6_addr = srcsock.sin6_addr; /* XXX: this overrides pi */
250 1.23 rpaulo if (ifpp)
251 1.23 rpaulo *ifpp = ifp;
252 1.62 ozaki ret_ia = &ia6->ia_addr.sin6_addr;
253 1.62 ozaki goto exit;
254 1.23 rpaulo }
255 1.1 itojun
256 1.1 itojun /*
257 1.28 dyoung * If the socket has already bound the source, just use it. We don't
258 1.28 dyoung * care at the moment whether in6_selectif() succeeded above, even
259 1.28 dyoung * though it would eventually cause an error.
260 1.1 itojun */
261 1.62 ozaki if (laddr && !IN6_IS_ADDR_UNSPECIFIED(laddr)) {
262 1.62 ozaki ret_ia = laddr;
263 1.62 ozaki goto exit;
264 1.62 ozaki }
265 1.1 itojun
266 1.1 itojun /*
267 1.28 dyoung * The outgoing interface is crucial in the general selection procedure
268 1.28 dyoung * below. If it is not known at this point, we fail.
269 1.28 dyoung */
270 1.28 dyoung if (ifp == NULL) {
271 1.28 dyoung *errorp = error;
272 1.62 ozaki goto exit;
273 1.28 dyoung }
274 1.28 dyoung
275 1.28 dyoung /*
276 1.28 dyoung * If the address is not yet determined, choose the best one based on
277 1.23 rpaulo * the outgoing interface and the destination address.
278 1.1 itojun */
279 1.1 itojun
280 1.23 rpaulo #if defined(MIP6) && NMIP > 0
281 1.1 itojun /*
282 1.23 rpaulo * a caller can specify IP6PO_USECOA to not to use a home
283 1.23 rpaulo * address. for example, the case that the neighbour
284 1.23 rpaulo * unreachability detection to the global address.
285 1.1 itojun */
286 1.23 rpaulo if (opts != NULL &&
287 1.23 rpaulo (opts->ip6po_flags & IP6PO_USECOA) != 0) {
288 1.23 rpaulo ip6po_usecoa = 1;
289 1.23 rpaulo }
290 1.23 rpaulo #endif /* MIP6 && NMIP > 0 */
291 1.23 rpaulo
292 1.23 rpaulo *errorp = in6_setscope(&dst, ifp, &odstzone);
293 1.23 rpaulo if (*errorp != 0)
294 1.62 ozaki goto exit;
295 1.23 rpaulo
296 1.23 rpaulo for (ia = in6_ifaddr; ia; ia = ia->ia_next) {
297 1.23 rpaulo int new_scope = -1, new_matchlen = -1;
298 1.23 rpaulo struct in6_addrpolicy *new_policy = NULL;
299 1.23 rpaulo u_int32_t srczone, osrczone, dstzone;
300 1.23 rpaulo struct in6_addr src;
301 1.23 rpaulo struct ifnet *ifp1 = ia->ia_ifp;
302 1.23 rpaulo
303 1.1 itojun /*
304 1.23 rpaulo * We'll never take an address that breaks the scope zone
305 1.23 rpaulo * of the destination. We also skip an address if its zone
306 1.23 rpaulo * does not contain the outgoing interface.
307 1.23 rpaulo * XXX: we should probably use sin6_scope_id here.
308 1.1 itojun */
309 1.23 rpaulo if (in6_setscope(&dst, ifp1, &dstzone) ||
310 1.23 rpaulo odstzone != dstzone) {
311 1.23 rpaulo continue;
312 1.23 rpaulo }
313 1.23 rpaulo src = ia->ia_addr.sin6_addr;
314 1.23 rpaulo if (in6_setscope(&src, ifp, &osrczone) ||
315 1.23 rpaulo in6_setscope(&src, ifp1, &srczone) ||
316 1.23 rpaulo osrczone != srczone) {
317 1.23 rpaulo continue;
318 1.23 rpaulo }
319 1.23 rpaulo
320 1.23 rpaulo /* avoid unusable addresses */
321 1.23 rpaulo if ((ia->ia6_flags &
322 1.23 rpaulo (IN6_IFF_NOTREADY | IN6_IFF_ANYCAST | IN6_IFF_DETACHED))) {
323 1.23 rpaulo continue;
324 1.23 rpaulo }
325 1.23 rpaulo if (!ip6_use_deprecated && IFA6_IS_DEPRECATED(ia))
326 1.23 rpaulo continue;
327 1.23 rpaulo
328 1.23 rpaulo #if defined(MIP6) && NMIP > 0
329 1.23 rpaulo /* avoid unusable home addresses. */
330 1.23 rpaulo if ((ia->ia6_flags & IN6_IFF_HOME) &&
331 1.23 rpaulo !mip6_ifa6_is_addr_valid_hoa(ia))
332 1.23 rpaulo continue;
333 1.23 rpaulo #endif /* MIP6 && NMIP > 0 */
334 1.23 rpaulo
335 1.23 rpaulo /* Rule 1: Prefer same address */
336 1.23 rpaulo if (IN6_ARE_ADDR_EQUAL(&dst, &ia->ia_addr.sin6_addr)) {
337 1.23 rpaulo ia_best = ia;
338 1.23 rpaulo BREAK(1); /* there should be no better candidate */
339 1.1 itojun }
340 1.1 itojun
341 1.23 rpaulo if (ia_best == NULL)
342 1.23 rpaulo REPLACE(0);
343 1.23 rpaulo
344 1.23 rpaulo /* Rule 2: Prefer appropriate scope */
345 1.23 rpaulo if (dst_scope < 0)
346 1.23 rpaulo dst_scope = in6_addrscope(&dst);
347 1.23 rpaulo new_scope = in6_addrscope(&ia->ia_addr.sin6_addr);
348 1.23 rpaulo if (IN6_ARE_SCOPE_CMP(best_scope, new_scope) < 0) {
349 1.23 rpaulo if (IN6_ARE_SCOPE_CMP(best_scope, dst_scope) < 0)
350 1.23 rpaulo REPLACE(2);
351 1.23 rpaulo NEXT(2);
352 1.23 rpaulo } else if (IN6_ARE_SCOPE_CMP(new_scope, best_scope) < 0) {
353 1.23 rpaulo if (IN6_ARE_SCOPE_CMP(new_scope, dst_scope) < 0)
354 1.23 rpaulo NEXT(2);
355 1.23 rpaulo REPLACE(2);
356 1.23 rpaulo }
357 1.1 itojun
358 1.23 rpaulo /*
359 1.23 rpaulo * Rule 3: Avoid deprecated addresses. Note that the case of
360 1.23 rpaulo * !ip6_use_deprecated is already rejected above.
361 1.23 rpaulo */
362 1.23 rpaulo if (!IFA6_IS_DEPRECATED(ia_best) && IFA6_IS_DEPRECATED(ia))
363 1.23 rpaulo NEXT(3);
364 1.23 rpaulo if (IFA6_IS_DEPRECATED(ia_best) && !IFA6_IS_DEPRECATED(ia))
365 1.23 rpaulo REPLACE(3);
366 1.23 rpaulo
367 1.23 rpaulo /* Rule 4: Prefer home addresses */
368 1.23 rpaulo #if defined(MIP6) && NMIP > 0
369 1.23 rpaulo if (!MIP6_IS_MN)
370 1.23 rpaulo goto skip_rule4;
371 1.23 rpaulo
372 1.23 rpaulo if ((ia_best->ia6_flags & IN6_IFF_HOME) == 0 &&
373 1.23 rpaulo (ia->ia6_flags & IN6_IFF_HOME) == 0) {
374 1.23 rpaulo /* both address are not home addresses. */
375 1.23 rpaulo goto skip_rule4;
376 1.23 rpaulo }
377 1.1 itojun
378 1.23 rpaulo /*
379 1.23 rpaulo * If SA is simultaneously a home address and care-of
380 1.23 rpaulo * address and SB is not, then prefer SA. Similarly,
381 1.23 rpaulo * if SB is simultaneously a home address and care-of
382 1.23 rpaulo * address and SA is not, then prefer SB.
383 1.23 rpaulo */
384 1.23 rpaulo if (((ia_best->ia6_flags & IN6_IFF_HOME) != 0 &&
385 1.23 rpaulo ia_best->ia_ifp->if_type != IFT_MIP)
386 1.23 rpaulo &&
387 1.23 rpaulo ((ia->ia6_flags & IN6_IFF_HOME) != 0 &&
388 1.23 rpaulo ia->ia_ifp->if_type == IFT_MIP))
389 1.23 rpaulo NEXT(4);
390 1.23 rpaulo if (((ia_best->ia6_flags & IN6_IFF_HOME) != 0 &&
391 1.23 rpaulo ia_best->ia_ifp->if_type == IFT_MIP)
392 1.23 rpaulo &&
393 1.23 rpaulo ((ia->ia6_flags & IN6_IFF_HOME) != 0 &&
394 1.23 rpaulo ia->ia_ifp->if_type != IFT_MIP))
395 1.23 rpaulo REPLACE(4);
396 1.23 rpaulo if (ip6po_usecoa == 0) {
397 1.23 rpaulo /*
398 1.23 rpaulo * If SA is just a home address and SB is just
399 1.23 rpaulo * a care-of address, then prefer
400 1.23 rpaulo * SA. Similarly, if SB is just a home address
401 1.23 rpaulo * and SA is just a care-of address, then
402 1.23 rpaulo * prefer SB.
403 1.23 rpaulo */
404 1.23 rpaulo if ((ia_best->ia6_flags & IN6_IFF_HOME) != 0 &&
405 1.23 rpaulo (ia->ia6_flags & IN6_IFF_HOME) == 0) {
406 1.23 rpaulo NEXT(4);
407 1.23 rpaulo }
408 1.23 rpaulo if ((ia_best->ia6_flags & IN6_IFF_HOME) == 0 &&
409 1.23 rpaulo (ia->ia6_flags & IN6_IFF_HOME) != 0) {
410 1.23 rpaulo REPLACE(4);
411 1.23 rpaulo }
412 1.23 rpaulo } else {
413 1.23 rpaulo /*
414 1.23 rpaulo * a sender don't want to use a home address
415 1.23 rpaulo * because:
416 1.23 rpaulo *
417 1.23 rpaulo * 1) we cannot use. (ex. NS or NA to global
418 1.23 rpaulo * addresses.)
419 1.23 rpaulo *
420 1.23 rpaulo * 2) a user specified not to use.
421 1.23 rpaulo * (ex. mip6control -u)
422 1.23 rpaulo */
423 1.23 rpaulo if ((ia_best->ia6_flags & IN6_IFF_HOME) == 0 &&
424 1.23 rpaulo (ia->ia6_flags & IN6_IFF_HOME) != 0) {
425 1.23 rpaulo /* XXX breaks stat */
426 1.23 rpaulo NEXT(0);
427 1.23 rpaulo }
428 1.23 rpaulo if ((ia_best->ia6_flags & IN6_IFF_HOME) != 0 &&
429 1.23 rpaulo (ia->ia6_flags & IN6_IFF_HOME) == 0) {
430 1.23 rpaulo /* XXX breaks stat */
431 1.23 rpaulo REPLACE(0);
432 1.1 itojun }
433 1.23 rpaulo }
434 1.23 rpaulo skip_rule4:
435 1.23 rpaulo #endif /* MIP6 && NMIP > 0 */
436 1.23 rpaulo
437 1.23 rpaulo /* Rule 5: Prefer outgoing interface */
438 1.23 rpaulo if (ia_best->ia_ifp == ifp && ia->ia_ifp != ifp)
439 1.23 rpaulo NEXT(5);
440 1.23 rpaulo if (ia_best->ia_ifp != ifp && ia->ia_ifp == ifp)
441 1.23 rpaulo REPLACE(5);
442 1.23 rpaulo
443 1.23 rpaulo /*
444 1.23 rpaulo * Rule 6: Prefer matching label
445 1.23 rpaulo * Note that best_policy should be non-NULL here.
446 1.23 rpaulo */
447 1.23 rpaulo if (dst_policy == NULL)
448 1.23 rpaulo dst_policy = lookup_addrsel_policy(dstsock);
449 1.23 rpaulo if (dst_policy->label != ADDR_LABEL_NOTAPP) {
450 1.23 rpaulo new_policy = lookup_addrsel_policy(&ia->ia_addr);
451 1.23 rpaulo if (dst_policy->label == best_policy->label &&
452 1.23 rpaulo dst_policy->label != new_policy->label)
453 1.23 rpaulo NEXT(6);
454 1.23 rpaulo if (dst_policy->label != best_policy->label &&
455 1.23 rpaulo dst_policy->label == new_policy->label)
456 1.23 rpaulo REPLACE(6);
457 1.23 rpaulo }
458 1.23 rpaulo
459 1.23 rpaulo /*
460 1.23 rpaulo * Rule 7: Prefer public addresses.
461 1.23 rpaulo * We allow users to reverse the logic by configuring
462 1.23 rpaulo * a sysctl variable, so that privacy conscious users can
463 1.23 rpaulo * always prefer temporary addresses.
464 1.23 rpaulo */
465 1.23 rpaulo if (opts == NULL ||
466 1.23 rpaulo opts->ip6po_prefer_tempaddr == IP6PO_TEMPADDR_SYSTEM) {
467 1.23 rpaulo prefer_tempaddr = ip6_prefer_tempaddr;
468 1.23 rpaulo } else if (opts->ip6po_prefer_tempaddr ==
469 1.23 rpaulo IP6PO_TEMPADDR_NOTPREFER) {
470 1.23 rpaulo prefer_tempaddr = 0;
471 1.23 rpaulo } else
472 1.23 rpaulo prefer_tempaddr = 1;
473 1.23 rpaulo if (!(ia_best->ia6_flags & IN6_IFF_TEMPORARY) &&
474 1.23 rpaulo (ia->ia6_flags & IN6_IFF_TEMPORARY)) {
475 1.23 rpaulo if (prefer_tempaddr)
476 1.23 rpaulo REPLACE(7);
477 1.23 rpaulo else
478 1.23 rpaulo NEXT(7);
479 1.23 rpaulo }
480 1.23 rpaulo if ((ia_best->ia6_flags & IN6_IFF_TEMPORARY) &&
481 1.23 rpaulo !(ia->ia6_flags & IN6_IFF_TEMPORARY)) {
482 1.23 rpaulo if (prefer_tempaddr)
483 1.23 rpaulo NEXT(7);
484 1.23 rpaulo else
485 1.23 rpaulo REPLACE(7);
486 1.1 itojun }
487 1.23 rpaulo
488 1.23 rpaulo /*
489 1.23 rpaulo * Rule 8: prefer addresses on alive interfaces.
490 1.23 rpaulo * This is a KAME specific rule.
491 1.23 rpaulo */
492 1.23 rpaulo if ((ia_best->ia_ifp->if_flags & IFF_UP) &&
493 1.23 rpaulo !(ia->ia_ifp->if_flags & IFF_UP))
494 1.23 rpaulo NEXT(8);
495 1.23 rpaulo if (!(ia_best->ia_ifp->if_flags & IFF_UP) &&
496 1.23 rpaulo (ia->ia_ifp->if_flags & IFF_UP))
497 1.23 rpaulo REPLACE(8);
498 1.23 rpaulo
499 1.23 rpaulo /*
500 1.23 rpaulo * Rule 9: prefer addresses on "preferred" interfaces.
501 1.23 rpaulo * This is a KAME specific rule.
502 1.23 rpaulo */
503 1.23 rpaulo #ifdef notyet /* until introducing address selection */
504 1.23 rpaulo #define NDI_BEST ND_IFINFO(ia_best->ia_ifp)
505 1.23 rpaulo #define NDI_NEW ND_IFINFO(ia->ia_ifp)
506 1.23 rpaulo if ((NDI_BEST->flags & ND6_IFF_PREFER_SOURCE) &&
507 1.23 rpaulo !(NDI_NEW->flags & ND6_IFF_PREFER_SOURCE))
508 1.23 rpaulo NEXT(9);
509 1.23 rpaulo if (!(NDI_BEST->flags & ND6_IFF_PREFER_SOURCE) &&
510 1.23 rpaulo (NDI_NEW->flags & ND6_IFF_PREFER_SOURCE))
511 1.23 rpaulo REPLACE(9);
512 1.23 rpaulo #undef NDI_BEST
513 1.23 rpaulo #undef NDI_NEW
514 1.23 rpaulo #endif
515 1.23 rpaulo
516 1.23 rpaulo /*
517 1.23 rpaulo * Rule 14: Use longest matching prefix.
518 1.23 rpaulo * Note: in the address selection draft, this rule is
519 1.23 rpaulo * documented as "Rule 8". However, since it is also
520 1.23 rpaulo * documented that this rule can be overridden, we assign
521 1.23 rpaulo * a large number so that it is easy to assign smaller numbers
522 1.23 rpaulo * to more preferred rules.
523 1.23 rpaulo */
524 1.23 rpaulo new_matchlen = in6_matchlen(&ia->ia_addr.sin6_addr, &dst);
525 1.23 rpaulo if (best_matchlen < new_matchlen)
526 1.23 rpaulo REPLACE(14);
527 1.23 rpaulo if (new_matchlen < best_matchlen)
528 1.23 rpaulo NEXT(14);
529 1.23 rpaulo
530 1.23 rpaulo /* Rule 15 is reserved. */
531 1.23 rpaulo
532 1.23 rpaulo /*
533 1.23 rpaulo * Last resort: just keep the current candidate.
534 1.23 rpaulo * Or, do we need more rules?
535 1.23 rpaulo */
536 1.23 rpaulo continue;
537 1.23 rpaulo
538 1.23 rpaulo replace:
539 1.23 rpaulo ia_best = ia;
540 1.23 rpaulo best_scope = (new_scope >= 0 ? new_scope :
541 1.23 rpaulo in6_addrscope(&ia_best->ia_addr.sin6_addr));
542 1.23 rpaulo best_policy = (new_policy ? new_policy :
543 1.23 rpaulo lookup_addrsel_policy(&ia_best->ia_addr));
544 1.23 rpaulo best_matchlen = (new_matchlen >= 0 ? new_matchlen :
545 1.23 rpaulo in6_matchlen(&ia_best->ia_addr.sin6_addr,
546 1.23 rpaulo &dst));
547 1.23 rpaulo
548 1.23 rpaulo next:
549 1.23 rpaulo continue;
550 1.23 rpaulo
551 1.23 rpaulo out:
552 1.23 rpaulo break;
553 1.23 rpaulo }
554 1.23 rpaulo
555 1.23 rpaulo if ((ia = ia_best) == NULL) {
556 1.23 rpaulo *errorp = EADDRNOTAVAIL;
557 1.62 ozaki goto exit;
558 1.23 rpaulo }
559 1.23 rpaulo
560 1.62 ozaki ret_ia = &ia->ia_addr.sin6_addr;
561 1.62 ozaki exit:
562 1.62 ozaki if (ifpp == NULL)
563 1.62 ozaki if_put(ifp, PSREF);
564 1.62 ozaki curlwp_bindx(bound);
565 1.62 ozaki return ret_ia;
566 1.62 ozaki #undef PSREF
567 1.23 rpaulo }
568 1.23 rpaulo #undef REPLACE
569 1.23 rpaulo #undef BREAK
570 1.23 rpaulo #undef NEXT
571 1.23 rpaulo
572 1.23 rpaulo static int
573 1.38 christos selectroute(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
574 1.38 christos struct ip6_moptions *mopts, struct route *ro, struct ifnet **retifp,
575 1.62 ozaki struct psref *psref, struct rtentry **retrt, int clone, int norouteok)
576 1.23 rpaulo {
577 1.23 rpaulo int error = 0;
578 1.23 rpaulo struct ifnet *ifp = NULL;
579 1.23 rpaulo struct rtentry *rt = NULL;
580 1.23 rpaulo struct sockaddr_in6 *sin6_next;
581 1.23 rpaulo struct in6_pktinfo *pi = NULL;
582 1.23 rpaulo struct in6_addr *dst;
583 1.62 ozaki struct psref local_psref;
584 1.62 ozaki #define PSREF ((psref == NULL) ? &local_psref : psref)
585 1.62 ozaki
586 1.62 ozaki KASSERT((retifp != NULL && psref != NULL) ||
587 1.62 ozaki (retifp == NULL && psref == NULL));
588 1.23 rpaulo
589 1.23 rpaulo dst = &dstsock->sin6_addr;
590 1.23 rpaulo
591 1.23 rpaulo #if 0
592 1.23 rpaulo if (dstsock->sin6_addr.s6_addr32[0] == 0 &&
593 1.23 rpaulo dstsock->sin6_addr.s6_addr32[1] == 0 &&
594 1.23 rpaulo !IN6_IS_ADDR_LOOPBACK(&dstsock->sin6_addr)) {
595 1.23 rpaulo printf("in6_selectroute: strange destination %s\n",
596 1.23 rpaulo ip6_sprintf(&dstsock->sin6_addr));
597 1.23 rpaulo } else {
598 1.23 rpaulo printf("in6_selectroute: destination = %s%%%d\n",
599 1.23 rpaulo ip6_sprintf(&dstsock->sin6_addr),
600 1.23 rpaulo dstsock->sin6_scope_id); /* for debug */
601 1.23 rpaulo }
602 1.23 rpaulo #endif
603 1.23 rpaulo
604 1.23 rpaulo /* If the caller specify the outgoing interface explicitly, use it. */
605 1.23 rpaulo if (opts && (pi = opts->ip6po_pktinfo) != NULL && pi->ipi6_ifindex) {
606 1.23 rpaulo /* XXX boundary check is assumed to be already done. */
607 1.62 ozaki ifp = if_get_byindex(pi->ipi6_ifindex, PSREF);
608 1.23 rpaulo if (ifp != NULL &&
609 1.23 rpaulo (norouteok || retrt == NULL ||
610 1.23 rpaulo IN6_IS_ADDR_MULTICAST(dst))) {
611 1.23 rpaulo /*
612 1.23 rpaulo * we do not have to check or get the route for
613 1.23 rpaulo * multicast.
614 1.23 rpaulo */
615 1.23 rpaulo goto done;
616 1.62 ozaki } else {
617 1.62 ozaki if_put(ifp, PSREF);
618 1.62 ozaki ifp = NULL;
619 1.23 rpaulo goto getroute;
620 1.62 ozaki }
621 1.1 itojun }
622 1.1 itojun
623 1.1 itojun /*
624 1.23 rpaulo * If the destination address is a multicast address and the outgoing
625 1.23 rpaulo * interface for the address is specified by the caller, use it.
626 1.1 itojun */
627 1.61 ozaki if (IN6_IS_ADDR_MULTICAST(dst) && mopts != NULL) {
628 1.62 ozaki ifp = if_get_byindex(mopts->im6o_multicast_if_index, PSREF);
629 1.61 ozaki if (ifp != NULL)
630 1.61 ozaki goto done; /* we do not need a route for multicast. */
631 1.23 rpaulo }
632 1.23 rpaulo
633 1.23 rpaulo getroute:
634 1.23 rpaulo /*
635 1.23 rpaulo * If the next hop address for the packet is specified by the caller,
636 1.23 rpaulo * use it as the gateway.
637 1.23 rpaulo */
638 1.23 rpaulo if (opts && opts->ip6po_nexthop) {
639 1.35 dyoung struct route *ron;
640 1.23 rpaulo
641 1.23 rpaulo sin6_next = satosin6(opts->ip6po_nexthop);
642 1.23 rpaulo
643 1.23 rpaulo /* at this moment, we only support AF_INET6 next hops */
644 1.23 rpaulo if (sin6_next->sin6_family != AF_INET6) {
645 1.23 rpaulo error = EAFNOSUPPORT; /* or should we proceed? */
646 1.23 rpaulo goto done;
647 1.23 rpaulo }
648 1.23 rpaulo
649 1.23 rpaulo /*
650 1.23 rpaulo * If the next hop is an IPv6 address, then the node identified
651 1.23 rpaulo * by that address must be a neighbor of the sending host.
652 1.23 rpaulo */
653 1.37 dyoung ron = &opts->ip6po_nextroute;
654 1.37 dyoung if ((rt = rtcache_lookup(ron, sin6tosa(sin6_next))) == NULL ||
655 1.37 dyoung (rt->rt_flags & RTF_GATEWAY) != 0 ||
656 1.37 dyoung !nd6_is_addr_neighbor(sin6_next, rt->rt_ifp)) {
657 1.35 dyoung rtcache_free(ron);
658 1.23 rpaulo error = EHOSTUNREACH;
659 1.23 rpaulo goto done;
660 1.23 rpaulo }
661 1.23 rpaulo ifp = rt->rt_ifp;
662 1.62 ozaki if (ifp != NULL)
663 1.62 ozaki if_acquire_NOMPSAFE(ifp, PSREF);
664 1.23 rpaulo
665 1.23 rpaulo /*
666 1.23 rpaulo * When cloning is required, try to allocate a route to the
667 1.23 rpaulo * destination so that the caller can store path MTU
668 1.23 rpaulo * information.
669 1.23 rpaulo */
670 1.23 rpaulo if (!clone)
671 1.23 rpaulo goto done;
672 1.1 itojun }
673 1.1 itojun
674 1.1 itojun /*
675 1.23 rpaulo * Use a cached route if it exists and is valid, else try to allocate
676 1.23 rpaulo * a new one. Note that we should check the address family of the
677 1.13 itojun * cached destination, in case of sharing the cache with IPv4.
678 1.1 itojun */
679 1.31 dyoung if (ro != NULL) {
680 1.37 dyoung union {
681 1.37 dyoung struct sockaddr dst;
682 1.37 dyoung struct sockaddr_in6 dst6;
683 1.37 dyoung } u;
684 1.37 dyoung
685 1.37 dyoung /* No route yet, so try to acquire one */
686 1.37 dyoung u.dst6 = *dstsock;
687 1.37 dyoung u.dst6.sin6_scope_id = 0;
688 1.37 dyoung rt = rtcache_lookup1(ro, &u.dst, clone);
689 1.1 itojun
690 1.1 itojun /*
691 1.23 rpaulo * do not care about the result if we have the nexthop
692 1.23 rpaulo * explicitly specified.
693 1.1 itojun */
694 1.23 rpaulo if (opts && opts->ip6po_nexthop)
695 1.23 rpaulo goto done;
696 1.1 itojun
697 1.37 dyoung if (rt == NULL)
698 1.23 rpaulo error = EHOSTUNREACH;
699 1.62 ozaki else {
700 1.62 ozaki if_put(ifp, PSREF);
701 1.37 dyoung ifp = rt->rt_ifp;
702 1.62 ozaki if (ifp != NULL)
703 1.62 ozaki if_acquire_NOMPSAFE(ifp, PSREF);
704 1.62 ozaki }
705 1.23 rpaulo
706 1.23 rpaulo /*
707 1.23 rpaulo * Check if the outgoing interface conflicts with
708 1.23 rpaulo * the interface specified by ipi6_ifindex (if specified).
709 1.23 rpaulo * Note that loopback interface is always okay.
710 1.23 rpaulo * (this may happen when we are sending a packet to one of
711 1.23 rpaulo * our own addresses.)
712 1.23 rpaulo */
713 1.23 rpaulo if (opts && opts->ip6po_pktinfo &&
714 1.23 rpaulo opts->ip6po_pktinfo->ipi6_ifindex) {
715 1.23 rpaulo if (!(ifp->if_flags & IFF_LOOPBACK) &&
716 1.23 rpaulo ifp->if_index !=
717 1.23 rpaulo opts->ip6po_pktinfo->ipi6_ifindex) {
718 1.23 rpaulo error = EHOSTUNREACH;
719 1.23 rpaulo goto done;
720 1.23 rpaulo }
721 1.23 rpaulo }
722 1.23 rpaulo }
723 1.23 rpaulo
724 1.23 rpaulo done:
725 1.23 rpaulo if (ifp == NULL && rt == NULL) {
726 1.1 itojun /*
727 1.23 rpaulo * This can happen if the caller did not pass a cached route
728 1.23 rpaulo * nor any other hints. We treat this case an error.
729 1.1 itojun */
730 1.23 rpaulo error = EHOSTUNREACH;
731 1.23 rpaulo }
732 1.23 rpaulo if (error == EHOSTUNREACH)
733 1.43 thorpej IP6_STATINC(IP6_STAT_NOROUTE);
734 1.1 itojun
735 1.23 rpaulo if (retifp != NULL)
736 1.23 rpaulo *retifp = ifp;
737 1.62 ozaki else
738 1.62 ozaki if_put(ifp, PSREF);
739 1.23 rpaulo if (retrt != NULL)
740 1.23 rpaulo *retrt = rt; /* rt may be NULL */
741 1.1 itojun
742 1.23 rpaulo return (error);
743 1.62 ozaki #undef PSREF
744 1.23 rpaulo }
745 1.23 rpaulo
746 1.23 rpaulo static int
747 1.38 christos in6_selectif(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
748 1.62 ozaki struct ip6_moptions *mopts, struct route *ro, struct ifnet **retifp,
749 1.62 ozaki struct psref *psref)
750 1.23 rpaulo {
751 1.23 rpaulo int error, clone;
752 1.23 rpaulo struct rtentry *rt = NULL;
753 1.23 rpaulo
754 1.62 ozaki KASSERT(retifp != NULL);
755 1.62 ozaki *retifp = NULL;
756 1.62 ozaki
757 1.23 rpaulo clone = IN6_IS_ADDR_MULTICAST(&dstsock->sin6_addr) ? 0 : 1;
758 1.62 ozaki if ((error = selectroute(dstsock, opts, mopts, ro, retifp, psref,
759 1.23 rpaulo &rt, clone, 1)) != 0) {
760 1.23 rpaulo return (error);
761 1.1 itojun }
762 1.1 itojun
763 1.23 rpaulo /*
764 1.23 rpaulo * do not use a rejected or black hole route.
765 1.23 rpaulo * XXX: this check should be done in the L2 output routine.
766 1.23 rpaulo * However, if we skipped this check here, we'd see the following
767 1.23 rpaulo * scenario:
768 1.23 rpaulo * - install a rejected route for a scoped address prefix
769 1.23 rpaulo * (like fe80::/10)
770 1.23 rpaulo * - send a packet to a destination that matches the scoped prefix,
771 1.23 rpaulo * with ambiguity about the scope zone.
772 1.23 rpaulo * - pick the outgoing interface from the route, and disambiguate the
773 1.23 rpaulo * scope zone with the interface.
774 1.23 rpaulo * - ip6_output() would try to get another route with the "new"
775 1.23 rpaulo * destination, which may be valid.
776 1.23 rpaulo * - we'd see no error on output.
777 1.23 rpaulo * Although this may not be very harmful, it should still be confusing.
778 1.23 rpaulo * We thus reject the case here.
779 1.23 rpaulo */
780 1.23 rpaulo if (rt && (rt->rt_flags & (RTF_REJECT | RTF_BLACKHOLE)))
781 1.23 rpaulo return (rt->rt_flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
782 1.23 rpaulo
783 1.23 rpaulo /*
784 1.23 rpaulo * Adjust the "outgoing" interface. If we're going to loop the packet
785 1.23 rpaulo * back to ourselves, the ifp would be the loopback interface.
786 1.23 rpaulo * However, we'd rather know the interface associated to the
787 1.23 rpaulo * destination address (which should probably be one of our own
788 1.23 rpaulo * addresses.)
789 1.23 rpaulo */
790 1.62 ozaki if (rt && rt->rt_ifa && rt->rt_ifa->ifa_ifp &&
791 1.62 ozaki rt->rt_ifa->ifa_ifp != *retifp) {
792 1.62 ozaki if_put(*retifp, psref);
793 1.23 rpaulo *retifp = rt->rt_ifa->ifa_ifp;
794 1.62 ozaki if_acquire_NOMPSAFE(*retifp, psref);
795 1.62 ozaki }
796 1.23 rpaulo
797 1.15 itojun return (0);
798 1.1 itojun }
799 1.1 itojun
800 1.38 christos /*
801 1.38 christos * close - meaningful only for bsdi and freebsd.
802 1.38 christos */
803 1.38 christos
804 1.23 rpaulo int
805 1.38 christos in6_selectroute(struct sockaddr_in6 *dstsock, struct ip6_pktopts *opts,
806 1.38 christos struct ip6_moptions *mopts, struct route *ro, struct ifnet **retifp,
807 1.62 ozaki struct psref *psref, struct rtentry **retrt, int clone)
808 1.23 rpaulo {
809 1.62 ozaki return selectroute(dstsock, opts, mopts, ro, retifp, psref,
810 1.35 dyoung retrt, clone, 0);
811 1.23 rpaulo }
812 1.23 rpaulo
813 1.1 itojun /*
814 1.1 itojun * Default hop limit selection. The precedence is as follows:
815 1.1 itojun * 1. Hoplimit value specified via ioctl.
816 1.1 itojun * 2. (If the outgoing interface is detected) the current
817 1.1 itojun * hop limit of the interface specified by router advertisement.
818 1.1 itojun * 3. The system default hoplimit.
819 1.1 itojun */
820 1.1 itojun int
821 1.38 christos in6_selecthlim(struct in6pcb *in6p, struct ifnet *ifp)
822 1.1 itojun {
823 1.1 itojun if (in6p && in6p->in6p_hops >= 0)
824 1.15 itojun return (in6p->in6p_hops);
825 1.1 itojun else if (ifp)
826 1.15 itojun return (ND_IFINFO(ifp)->chlim);
827 1.1 itojun else
828 1.15 itojun return (ip6_defhlim);
829 1.1 itojun }
830 1.1 itojun
831 1.57 ozaki int
832 1.57 ozaki in6_selecthlim_rt(struct in6pcb *in6p)
833 1.57 ozaki {
834 1.57 ozaki struct rtentry *rt;
835 1.57 ozaki
836 1.57 ozaki if (in6p == NULL)
837 1.57 ozaki return in6_selecthlim(in6p, NULL);
838 1.57 ozaki
839 1.57 ozaki rt = rtcache_validate(&in6p->in6p_route);
840 1.57 ozaki if (rt != NULL)
841 1.57 ozaki return in6_selecthlim(in6p, rt->rt_ifp);
842 1.57 ozaki else
843 1.57 ozaki return in6_selecthlim(in6p, NULL);
844 1.57 ozaki }
845 1.57 ozaki
846 1.1 itojun /*
847 1.1 itojun * Find an empty port and set it to the specified PCB.
848 1.1 itojun */
849 1.1 itojun int
850 1.47 elad in6_pcbsetport(struct sockaddr_in6 *sin6, struct in6pcb *in6p, struct lwp *l)
851 1.1 itojun {
852 1.1 itojun struct socket *so = in6p->in6p_socket;
853 1.17 itojun struct inpcbtable *table = in6p->in6p_table;
854 1.17 itojun u_int16_t lport, *lastport;
855 1.47 elad enum kauth_network_req req;
856 1.52 christos int error = 0;
857 1.52 christos
858 1.1 itojun if (in6p->in6p_flags & IN6P_LOWPORT) {
859 1.3 itojun #ifndef IPNOPRIVPORTS
860 1.47 elad req = KAUTH_REQ_NETWORK_BIND_PRIVPORT;
861 1.47 elad #else
862 1.47 elad req = KAUTH_REQ_NETWORK_BIND_PORT;
863 1.3 itojun #endif
864 1.17 itojun lastport = &table->inpt_lastlow;
865 1.1 itojun } else {
866 1.47 elad req = KAUTH_REQ_NETWORK_BIND_PORT;
867 1.47 elad
868 1.17 itojun lastport = &table->inpt_lastport;
869 1.1 itojun }
870 1.23 rpaulo
871 1.47 elad /* XXX-kauth: KAUTH_REQ_NETWORK_BIND_AUTOASSIGN_{,PRIV}PORT */
872 1.47 elad error = kauth_authorize_network(l->l_cred, KAUTH_NETWORK_BIND, req, so,
873 1.47 elad sin6, NULL);
874 1.47 elad if (error)
875 1.48 elad return (EACCES);
876 1.47 elad
877 1.52 christos /*
878 1.52 christos * Use RFC6056 randomized port selection
879 1.52 christos */
880 1.53 christos error = portalgo_randport(&lport, &in6p->in6p_head, l->l_cred);
881 1.52 christos if (error)
882 1.52 christos return error;
883 1.47 elad
884 1.17 itojun in6p->in6p_flags |= IN6P_ANONPORT;
885 1.17 itojun *lastport = lport;
886 1.17 itojun in6p->in6p_lport = htons(lport);
887 1.17 itojun in6_pcbstate(in6p, IN6P_BOUND);
888 1.15 itojun return (0); /* success */
889 1.2 itojun }
890 1.2 itojun
891 1.23 rpaulo void
892 1.39 dyoung addrsel_policy_init(void)
893 1.23 rpaulo {
894 1.23 rpaulo init_policy_queue();
895 1.23 rpaulo
896 1.23 rpaulo /* initialize the "last resort" policy */
897 1.46 cegger memset(&defaultaddrpolicy, 0, sizeof(defaultaddrpolicy));
898 1.23 rpaulo defaultaddrpolicy.label = ADDR_LABEL_NOTAPP;
899 1.23 rpaulo }
900 1.23 rpaulo
901 1.23 rpaulo static struct in6_addrpolicy *
902 1.38 christos lookup_addrsel_policy(struct sockaddr_in6 *key)
903 1.23 rpaulo {
904 1.23 rpaulo struct in6_addrpolicy *match = NULL;
905 1.23 rpaulo
906 1.23 rpaulo match = match_addrsel_policy(key);
907 1.23 rpaulo
908 1.23 rpaulo if (match == NULL)
909 1.23 rpaulo match = &defaultaddrpolicy;
910 1.23 rpaulo else
911 1.23 rpaulo match->use++;
912 1.23 rpaulo
913 1.23 rpaulo return (match);
914 1.23 rpaulo }
915 1.23 rpaulo
916 1.2 itojun /*
917 1.23 rpaulo * Subroutines to manage the address selection policy table via sysctl.
918 1.2 itojun */
919 1.45 christos struct sel_walkarg {
920 1.23 rpaulo size_t w_total;
921 1.23 rpaulo size_t w_given;
922 1.36 christos void * w_where;
923 1.36 christos void *w_limit;
924 1.23 rpaulo };
925 1.23 rpaulo
926 1.59 christos int sysctl_net_inet6_addrctlpolicy(SYSCTLFN_ARGS);
927 1.23 rpaulo int
928 1.59 christos sysctl_net_inet6_addrctlpolicy(SYSCTLFN_ARGS)
929 1.23 rpaulo {
930 1.23 rpaulo int error = 0;
931 1.23 rpaulo int s;
932 1.23 rpaulo
933 1.23 rpaulo s = splsoftnet();
934 1.23 rpaulo
935 1.23 rpaulo if (newp) {
936 1.23 rpaulo error = EPERM;
937 1.23 rpaulo goto end;
938 1.23 rpaulo }
939 1.23 rpaulo if (oldp && oldlenp == NULL) {
940 1.23 rpaulo error = EINVAL;
941 1.23 rpaulo goto end;
942 1.23 rpaulo }
943 1.23 rpaulo if (oldp || oldlenp) {
944 1.45 christos struct sel_walkarg w;
945 1.24 christos size_t oldlen = *oldlenp;
946 1.23 rpaulo
947 1.36 christos memset(&w, 0, sizeof(w));
948 1.23 rpaulo w.w_given = oldlen;
949 1.23 rpaulo w.w_where = oldp;
950 1.23 rpaulo if (oldp)
951 1.36 christos w.w_limit = (char *)oldp + oldlen;
952 1.23 rpaulo
953 1.23 rpaulo error = walk_addrsel_policy(dump_addrsel_policyent, &w);
954 1.23 rpaulo
955 1.23 rpaulo *oldlenp = w.w_total;
956 1.23 rpaulo if (oldp && w.w_total > oldlen && error == 0)
957 1.23 rpaulo error = ENOMEM;
958 1.23 rpaulo }
959 1.23 rpaulo
960 1.23 rpaulo end:
961 1.23 rpaulo splx(s);
962 1.23 rpaulo
963 1.23 rpaulo return (error);
964 1.23 rpaulo }
965 1.23 rpaulo
966 1.2 itojun int
967 1.38 christos in6_src_ioctl(u_long cmd, void *data)
968 1.2 itojun {
969 1.23 rpaulo int i;
970 1.23 rpaulo struct in6_addrpolicy ent0;
971 1.2 itojun
972 1.23 rpaulo if (cmd != SIOCAADDRCTL_POLICY && cmd != SIOCDADDRCTL_POLICY)
973 1.23 rpaulo return (EOPNOTSUPP); /* check for safety */
974 1.2 itojun
975 1.23 rpaulo ent0 = *(struct in6_addrpolicy *)data;
976 1.2 itojun
977 1.23 rpaulo if (ent0.label == ADDR_LABEL_NOTAPP)
978 1.23 rpaulo return (EINVAL);
979 1.23 rpaulo /* check if the prefix mask is consecutive. */
980 1.23 rpaulo if (in6_mask2len(&ent0.addrmask.sin6_addr, NULL) < 0)
981 1.23 rpaulo return (EINVAL);
982 1.23 rpaulo /* clear trailing garbages (if any) of the prefix address. */
983 1.23 rpaulo for (i = 0; i < 4; i++) {
984 1.23 rpaulo ent0.addr.sin6_addr.s6_addr32[i] &=
985 1.23 rpaulo ent0.addrmask.sin6_addr.s6_addr32[i];
986 1.23 rpaulo }
987 1.23 rpaulo ent0.use = 0;
988 1.2 itojun
989 1.23 rpaulo switch (cmd) {
990 1.23 rpaulo case SIOCAADDRCTL_POLICY:
991 1.23 rpaulo return (add_addrsel_policyent(&ent0));
992 1.23 rpaulo case SIOCDADDRCTL_POLICY:
993 1.23 rpaulo return (delete_addrsel_policyent(&ent0));
994 1.2 itojun }
995 1.2 itojun
996 1.23 rpaulo return (0); /* XXX: compromise compilers */
997 1.2 itojun }
998 1.2 itojun
999 1.2 itojun /*
1000 1.23 rpaulo * The followings are implementation of the policy table using a
1001 1.23 rpaulo * simple tail queue.
1002 1.23 rpaulo * XXX such details should be hidden.
1003 1.23 rpaulo * XXX implementation using binary tree should be more efficient.
1004 1.2 itojun */
1005 1.23 rpaulo struct addrsel_policyent {
1006 1.23 rpaulo TAILQ_ENTRY(addrsel_policyent) ape_entry;
1007 1.23 rpaulo struct in6_addrpolicy ape_policy;
1008 1.23 rpaulo };
1009 1.23 rpaulo
1010 1.23 rpaulo TAILQ_HEAD(addrsel_policyhead, addrsel_policyent);
1011 1.23 rpaulo
1012 1.23 rpaulo struct addrsel_policyhead addrsel_policytab;
1013 1.23 rpaulo
1014 1.23 rpaulo static void
1015 1.41 matt init_policy_queue(void)
1016 1.23 rpaulo {
1017 1.23 rpaulo TAILQ_INIT(&addrsel_policytab);
1018 1.23 rpaulo }
1019 1.23 rpaulo
1020 1.23 rpaulo static int
1021 1.38 christos add_addrsel_policyent(struct in6_addrpolicy *newpolicy)
1022 1.23 rpaulo {
1023 1.55 matt struct addrsel_policyent *newpol, *pol;
1024 1.23 rpaulo
1025 1.23 rpaulo /* duplication check */
1026 1.55 matt TAILQ_FOREACH(pol, &addrsel_policytab, ape_entry) {
1027 1.23 rpaulo if (IN6_ARE_ADDR_EQUAL(&newpolicy->addr.sin6_addr,
1028 1.23 rpaulo &pol->ape_policy.addr.sin6_addr) &&
1029 1.23 rpaulo IN6_ARE_ADDR_EQUAL(&newpolicy->addrmask.sin6_addr,
1030 1.23 rpaulo &pol->ape_policy.addrmask.sin6_addr)) {
1031 1.23 rpaulo return (EEXIST); /* or override it? */
1032 1.23 rpaulo }
1033 1.23 rpaulo }
1034 1.23 rpaulo
1035 1.55 matt newpol = malloc(sizeof(*newpol), M_IFADDR, M_WAITOK|M_ZERO);
1036 1.23 rpaulo
1037 1.23 rpaulo /* XXX: should validate entry */
1038 1.55 matt newpol->ape_policy = *newpolicy;
1039 1.23 rpaulo
1040 1.55 matt TAILQ_INSERT_TAIL(&addrsel_policytab, newpol, ape_entry);
1041 1.23 rpaulo
1042 1.23 rpaulo return (0);
1043 1.23 rpaulo }
1044 1.23 rpaulo
1045 1.23 rpaulo static int
1046 1.38 christos delete_addrsel_policyent(struct in6_addrpolicy *key)
1047 1.2 itojun {
1048 1.23 rpaulo struct addrsel_policyent *pol;
1049 1.23 rpaulo
1050 1.23 rpaulo /* search for the entry in the table */
1051 1.23 rpaulo for (pol = TAILQ_FIRST(&addrsel_policytab); pol;
1052 1.23 rpaulo pol = TAILQ_NEXT(pol, ape_entry)) {
1053 1.23 rpaulo if (IN6_ARE_ADDR_EQUAL(&key->addr.sin6_addr,
1054 1.23 rpaulo &pol->ape_policy.addr.sin6_addr) &&
1055 1.23 rpaulo IN6_ARE_ADDR_EQUAL(&key->addrmask.sin6_addr,
1056 1.23 rpaulo &pol->ape_policy.addrmask.sin6_addr)) {
1057 1.23 rpaulo break;
1058 1.23 rpaulo }
1059 1.23 rpaulo }
1060 1.23 rpaulo if (pol == NULL) {
1061 1.23 rpaulo return (ESRCH);
1062 1.23 rpaulo }
1063 1.2 itojun
1064 1.23 rpaulo TAILQ_REMOVE(&addrsel_policytab, pol, ape_entry);
1065 1.2 itojun
1066 1.23 rpaulo return (0);
1067 1.23 rpaulo }
1068 1.23 rpaulo
1069 1.23 rpaulo static int
1070 1.35 dyoung walk_addrsel_policy(int (*callback)(struct in6_addrpolicy *, void *), void *w)
1071 1.23 rpaulo {
1072 1.23 rpaulo struct addrsel_policyent *pol;
1073 1.23 rpaulo int error = 0;
1074 1.2 itojun
1075 1.35 dyoung TAILQ_FOREACH(pol, &addrsel_policytab, ape_entry) {
1076 1.35 dyoung if ((error = (*callback)(&pol->ape_policy, w)) != 0)
1077 1.35 dyoung return error;
1078 1.2 itojun }
1079 1.2 itojun
1080 1.35 dyoung return error;
1081 1.5 itojun }
1082 1.5 itojun
1083 1.23 rpaulo static int
1084 1.35 dyoung dump_addrsel_policyent(struct in6_addrpolicy *pol, void *arg)
1085 1.23 rpaulo {
1086 1.23 rpaulo int error = 0;
1087 1.45 christos struct sel_walkarg *w = arg;
1088 1.23 rpaulo
1089 1.36 christos if (w->w_where && (char *)w->w_where + sizeof(*pol) <= (char *)w->w_limit) {
1090 1.23 rpaulo if ((error = copyout(pol, w->w_where, sizeof(*pol))) != 0)
1091 1.35 dyoung return error;
1092 1.36 christos w->w_where = (char *)w->w_where + sizeof(*pol);
1093 1.23 rpaulo }
1094 1.23 rpaulo w->w_total += sizeof(*pol);
1095 1.23 rpaulo
1096 1.35 dyoung return error;
1097 1.23 rpaulo }
1098 1.23 rpaulo
1099 1.23 rpaulo static struct in6_addrpolicy *
1100 1.38 christos match_addrsel_policy(struct sockaddr_in6 *key)
1101 1.5 itojun {
1102 1.23 rpaulo struct addrsel_policyent *pent;
1103 1.23 rpaulo struct in6_addrpolicy *bestpol = NULL, *pol;
1104 1.23 rpaulo int matchlen, bestmatchlen = -1;
1105 1.23 rpaulo u_char *mp, *ep, *k, *p, m;
1106 1.23 rpaulo
1107 1.23 rpaulo for (pent = TAILQ_FIRST(&addrsel_policytab); pent;
1108 1.23 rpaulo pent = TAILQ_NEXT(pent, ape_entry)) {
1109 1.23 rpaulo matchlen = 0;
1110 1.23 rpaulo
1111 1.23 rpaulo pol = &pent->ape_policy;
1112 1.23 rpaulo mp = (u_char *)&pol->addrmask.sin6_addr;
1113 1.23 rpaulo ep = mp + 16; /* XXX: scope field? */
1114 1.23 rpaulo k = (u_char *)&key->sin6_addr;
1115 1.23 rpaulo p = (u_char *)&pol->addr.sin6_addr;
1116 1.23 rpaulo for (; mp < ep && *mp; mp++, k++, p++) {
1117 1.23 rpaulo m = *mp;
1118 1.23 rpaulo if ((*k & m) != *p)
1119 1.23 rpaulo goto next; /* not match */
1120 1.23 rpaulo if (m == 0xff) /* short cut for a typical case */
1121 1.23 rpaulo matchlen += 8;
1122 1.23 rpaulo else {
1123 1.23 rpaulo while (m >= 0x80) {
1124 1.23 rpaulo matchlen++;
1125 1.23 rpaulo m <<= 1;
1126 1.23 rpaulo }
1127 1.23 rpaulo }
1128 1.23 rpaulo }
1129 1.23 rpaulo
1130 1.23 rpaulo /* matched. check if this is better than the current best. */
1131 1.23 rpaulo if (bestpol == NULL ||
1132 1.23 rpaulo matchlen > bestmatchlen) {
1133 1.23 rpaulo bestpol = pol;
1134 1.23 rpaulo bestmatchlen = matchlen;
1135 1.23 rpaulo }
1136 1.23 rpaulo
1137 1.23 rpaulo next:
1138 1.23 rpaulo continue;
1139 1.23 rpaulo }
1140 1.23 rpaulo
1141 1.23 rpaulo return (bestpol);
1142 1.1 itojun }
1143