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