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