ip_encap.c revision 1.44 1 1.44 ozaki /* $NetBSD: ip_encap.c,v 1.44 2015/04/16 06:50:16 ozaki-r Exp $ */
2 1.7 itojun /* $KAME: ip_encap.c,v 1.73 2001/10/02 08:30:58 itojun 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 * My grandfather said that there's a devil inside tunnelling technology...
34 1.1 itojun *
35 1.1 itojun * We have surprisingly many protocols that want packets with IP protocol
36 1.1 itojun * #4 or #41. Here's a list of protocols that want protocol #41:
37 1.1 itojun * RFC1933 configured tunnel
38 1.1 itojun * RFC1933 automatic tunnel
39 1.1 itojun * RFC2401 IPsec tunnel
40 1.1 itojun * RFC2473 IPv6 generic packet tunnelling
41 1.1 itojun * RFC2529 6over4 tunnel
42 1.7 itojun * RFC3056 6to4 tunnel
43 1.7 itojun * isatap tunnel
44 1.1 itojun * mobile-ip6 (uses RFC2473)
45 1.1 itojun * Here's a list of protocol that want protocol #4:
46 1.1 itojun * RFC1853 IPv4-in-IPv4 tunnelling
47 1.1 itojun * RFC2003 IPv4 encapsulation within IPv4
48 1.1 itojun * RFC2344 reverse tunnelling for mobile-ip4
49 1.1 itojun * RFC2401 IPsec tunnel
50 1.1 itojun * Well, what can I say. They impose different en/decapsulation mechanism
51 1.1 itojun * from each other, so they need separate protocol handler. The only one
52 1.1 itojun * we can easily determine by protocol # is IPsec, which always has
53 1.1 itojun * AH/ESP/IPComp header right after outer IP header.
54 1.1 itojun *
55 1.1 itojun * So, clearly good old protosw does not work for protocol #4 and #41.
56 1.1 itojun * The code will let you match protocol via src/dst address pair.
57 1.1 itojun */
58 1.1 itojun /* XXX is M_NETADDR correct? */
59 1.6 lukem
60 1.7 itojun /*
61 1.7 itojun * With USE_RADIX the code will use radix table for tunnel lookup, for
62 1.7 itojun * tunnels registered with encap_attach() with a addr/mask pair.
63 1.7 itojun * Faster on machines with thousands of tunnel registerations (= interfaces).
64 1.7 itojun *
65 1.7 itojun * The code assumes that radix table code can handle non-continuous netmask,
66 1.7 itojun * as it will pass radix table memory region with (src + dst) sockaddr pair.
67 1.7 itojun *
68 1.7 itojun * FreeBSD is excluded here as they make max_keylen a static variable, and
69 1.7 itojun * thus forbid definition of radix table other than proper domains.
70 1.33 pooka *
71 1.33 pooka * !!!!!!!
72 1.33 pooka * !!NOTE: dom_maxrtkey assumes USE_RADIX is defined.
73 1.33 pooka * !!!!!!!
74 1.7 itojun */
75 1.7 itojun #define USE_RADIX
76 1.7 itojun
77 1.6 lukem #include <sys/cdefs.h>
78 1.44 ozaki __KERNEL_RCSID(0, "$NetBSD: ip_encap.c,v 1.44 2015/04/16 06:50:16 ozaki-r Exp $");
79 1.1 itojun
80 1.4 itojun #include "opt_mrouting.h"
81 1.4 itojun #include "opt_inet.h"
82 1.1 itojun
83 1.1 itojun #include <sys/param.h>
84 1.1 itojun #include <sys/systm.h>
85 1.1 itojun #include <sys/socket.h>
86 1.1 itojun #include <sys/sockio.h>
87 1.1 itojun #include <sys/mbuf.h>
88 1.1 itojun #include <sys/errno.h>
89 1.1 itojun #include <sys/protosw.h>
90 1.4 itojun #include <sys/queue.h>
91 1.1 itojun
92 1.1 itojun #include <net/if.h>
93 1.1 itojun #include <net/route.h>
94 1.1 itojun
95 1.1 itojun #include <netinet/in.h>
96 1.1 itojun #include <netinet/in_systm.h>
97 1.1 itojun #include <netinet/ip.h>
98 1.1 itojun #include <netinet/ip_var.h>
99 1.1 itojun #include <netinet/ip_encap.h>
100 1.1 itojun #ifdef MROUTING
101 1.1 itojun #include <netinet/ip_mroute.h>
102 1.1 itojun #endif /* MROUTING */
103 1.1 itojun
104 1.1 itojun #ifdef INET6
105 1.1 itojun #include <netinet/ip6.h>
106 1.1 itojun #include <netinet6/ip6_var.h>
107 1.1 itojun #include <netinet6/ip6protosw.h>
108 1.7 itojun #include <netinet6/in6_var.h>
109 1.7 itojun #include <netinet6/in6_pcb.h>
110 1.7 itojun #include <netinet/icmp6.h>
111 1.1 itojun #endif
112 1.1 itojun
113 1.1 itojun #include <net/net_osdep.h>
114 1.1 itojun
115 1.7 itojun enum direction { INBOUND, OUTBOUND };
116 1.7 itojun
117 1.7 itojun #ifdef INET
118 1.22 perry static struct encaptab *encap4_lookup(struct mbuf *, int, int, enum direction);
119 1.7 itojun #endif
120 1.7 itojun #ifdef INET6
121 1.22 perry static struct encaptab *encap6_lookup(struct mbuf *, int, int, enum direction);
122 1.7 itojun #endif
123 1.22 perry static int encap_add(struct encaptab *);
124 1.22 perry static int encap_remove(struct encaptab *);
125 1.22 perry static int encap_afcheck(int, const struct sockaddr *, const struct sockaddr *);
126 1.7 itojun #ifdef USE_RADIX
127 1.22 perry static struct radix_node_head *encap_rnh(int);
128 1.22 perry static int mask_matchlen(const struct sockaddr *);
129 1.7 itojun #endif
130 1.7 itojun #ifndef USE_RADIX
131 1.22 perry static int mask_match(const struct encaptab *, const struct sockaddr *,
132 1.22 perry const struct sockaddr *);
133 1.7 itojun #endif
134 1.22 perry static void encap_fillarg(struct mbuf *, const struct encaptab *);
135 1.1 itojun
136 1.2 thorpej LIST_HEAD(, encaptab) encaptab = LIST_HEAD_INITIALIZER(&encaptab);
137 1.1 itojun
138 1.7 itojun #ifdef USE_RADIX
139 1.7 itojun extern int max_keylen; /* radix.c */
140 1.7 itojun struct radix_node_head *encap_head[2]; /* 0 for AF_INET, 1 for AF_INET6 */
141 1.7 itojun #endif
142 1.7 itojun
143 1.1 itojun void
144 1.23 perry encap_init(void)
145 1.1 itojun {
146 1.7 itojun static int initialized = 0;
147 1.7 itojun
148 1.7 itojun if (initialized)
149 1.7 itojun return;
150 1.7 itojun initialized++;
151 1.1 itojun #if 0
152 1.1 itojun /*
153 1.1 itojun * we cannot use LIST_INIT() here, since drivers may want to call
154 1.4 itojun * encap_attach(), on driver attach. encap_init() will be called
155 1.1 itojun * on AF_INET{,6} initialization, which happens after driver
156 1.1 itojun * initialization - using LIST_INIT() here can nuke encap_attach()
157 1.1 itojun * from drivers.
158 1.1 itojun */
159 1.1 itojun LIST_INIT(&encaptab);
160 1.1 itojun #endif
161 1.7 itojun
162 1.7 itojun #ifdef USE_RADIX
163 1.7 itojun /*
164 1.38 pooka * initialize radix lookup table when the radix subsystem is inited.
165 1.7 itojun */
166 1.38 pooka rn_delayedinit((void *)&encap_head[0],
167 1.38 pooka sizeof(struct sockaddr_pack) << 3);
168 1.7 itojun #ifdef INET6
169 1.38 pooka rn_delayedinit((void *)&encap_head[1],
170 1.38 pooka sizeof(struct sockaddr_pack) << 3);
171 1.7 itojun #endif
172 1.7 itojun #endif
173 1.1 itojun }
174 1.1 itojun
175 1.4 itojun #ifdef INET
176 1.7 itojun static struct encaptab *
177 1.23 perry encap4_lookup(struct mbuf *m, int off, int proto, enum direction dir)
178 1.1 itojun {
179 1.1 itojun struct ip *ip;
180 1.33 pooka struct ip_pack4 pack;
181 1.1 itojun struct encaptab *ep, *match;
182 1.1 itojun int prio, matchprio;
183 1.7 itojun #ifdef USE_RADIX
184 1.7 itojun struct radix_node_head *rnh = encap_rnh(AF_INET);
185 1.7 itojun struct radix_node *rn;
186 1.7 itojun #endif
187 1.1 itojun
188 1.41 ozaki KASSERT(m->m_len >= sizeof(*ip));
189 1.41 ozaki
190 1.1 itojun ip = mtod(m, struct ip *);
191 1.1 itojun
192 1.35 cegger memset(&pack, 0, sizeof(pack));
193 1.7 itojun pack.p.sp_len = sizeof(pack);
194 1.7 itojun pack.mine.sin_family = pack.yours.sin_family = AF_INET;
195 1.7 itojun pack.mine.sin_len = pack.yours.sin_len = sizeof(struct sockaddr_in);
196 1.7 itojun if (dir == INBOUND) {
197 1.7 itojun pack.mine.sin_addr = ip->ip_dst;
198 1.7 itojun pack.yours.sin_addr = ip->ip_src;
199 1.7 itojun } else {
200 1.7 itojun pack.mine.sin_addr = ip->ip_src;
201 1.7 itojun pack.yours.sin_addr = ip->ip_dst;
202 1.7 itojun }
203 1.1 itojun
204 1.1 itojun match = NULL;
205 1.1 itojun matchprio = 0;
206 1.7 itojun
207 1.7 itojun #ifdef USE_RADIX
208 1.30 christos rn = rnh->rnh_matchaddr((void *)&pack, rnh);
209 1.7 itojun if (rn && (rn->rn_flags & RNF_ROOT) == 0) {
210 1.7 itojun match = (struct encaptab *)rn;
211 1.7 itojun matchprio = mask_matchlen(match->srcmask) +
212 1.7 itojun mask_matchlen(match->dstmask);
213 1.7 itojun }
214 1.7 itojun #endif
215 1.7 itojun
216 1.31 dyoung LIST_FOREACH(ep, &encaptab, chain) {
217 1.1 itojun if (ep->af != AF_INET)
218 1.1 itojun continue;
219 1.1 itojun if (ep->proto >= 0 && ep->proto != proto)
220 1.1 itojun continue;
221 1.1 itojun if (ep->func)
222 1.1 itojun prio = (*ep->func)(m, off, proto, ep->arg);
223 1.1 itojun else {
224 1.7 itojun #ifdef USE_RADIX
225 1.7 itojun continue;
226 1.7 itojun #else
227 1.7 itojun prio = mask_match(ep, (struct sockaddr *)&pack.mine,
228 1.7 itojun (struct sockaddr *)&pack.yours);
229 1.7 itojun #endif
230 1.1 itojun }
231 1.1 itojun
232 1.1 itojun /*
233 1.1 itojun * We prioritize the matches by using bit length of the
234 1.1 itojun * matches. mask_match() and user-supplied matching function
235 1.1 itojun * should return the bit length of the matches (for example,
236 1.1 itojun * if both src/dst are matched for IPv4, 64 should be returned).
237 1.1 itojun * 0 or negative return value means "it did not match".
238 1.1 itojun *
239 1.1 itojun * The question is, since we have two "mask" portion, we
240 1.1 itojun * cannot really define total order between entries.
241 1.1 itojun * For example, which of these should be preferred?
242 1.1 itojun * mask_match() returns 48 (32 + 16) for both of them.
243 1.1 itojun * src=3ffe::/16, dst=3ffe:501::/32
244 1.1 itojun * src=3ffe:501::/32, dst=3ffe::/16
245 1.1 itojun *
246 1.1 itojun * We need to loop through all the possible candidates
247 1.1 itojun * to get the best match - the search takes O(n) for
248 1.1 itojun * n attachments (i.e. interfaces).
249 1.7 itojun *
250 1.7 itojun * For radix-based lookup, I guess source takes precedence.
251 1.7 itojun * See rn_{refines,lexobetter} for the correct answer.
252 1.1 itojun */
253 1.1 itojun if (prio <= 0)
254 1.1 itojun continue;
255 1.1 itojun if (prio > matchprio) {
256 1.1 itojun matchprio = prio;
257 1.1 itojun match = ep;
258 1.1 itojun }
259 1.1 itojun }
260 1.1 itojun
261 1.7 itojun return match;
262 1.7 itojun }
263 1.7 itojun
264 1.7 itojun void
265 1.7 itojun encap4_input(struct mbuf *m, ...)
266 1.7 itojun {
267 1.7 itojun int off, proto;
268 1.7 itojun va_list ap;
269 1.7 itojun const struct protosw *psw;
270 1.7 itojun struct encaptab *match;
271 1.7 itojun
272 1.7 itojun va_start(ap, m);
273 1.7 itojun off = va_arg(ap, int);
274 1.7 itojun proto = va_arg(ap, int);
275 1.7 itojun va_end(ap);
276 1.7 itojun
277 1.7 itojun match = encap4_lookup(m, off, proto, INBOUND);
278 1.7 itojun
279 1.1 itojun if (match) {
280 1.1 itojun /* found a match, "match" has the best one */
281 1.4 itojun psw = match->psw;
282 1.4 itojun if (psw && psw->pr_input) {
283 1.1 itojun encap_fillarg(m, match);
284 1.4 itojun (*psw->pr_input)(m, off, proto);
285 1.1 itojun } else
286 1.1 itojun m_freem(m);
287 1.1 itojun return;
288 1.1 itojun }
289 1.1 itojun
290 1.1 itojun /* last resort: inject to raw socket */
291 1.1 itojun rip_input(m, off, proto);
292 1.1 itojun }
293 1.1 itojun #endif
294 1.1 itojun
295 1.1 itojun #ifdef INET6
296 1.7 itojun static struct encaptab *
297 1.23 perry encap6_lookup(struct mbuf *m, int off, int proto, enum direction dir)
298 1.1 itojun {
299 1.1 itojun struct ip6_hdr *ip6;
300 1.33 pooka struct ip_pack6 pack;
301 1.7 itojun int prio, matchprio;
302 1.1 itojun struct encaptab *ep, *match;
303 1.7 itojun #ifdef USE_RADIX
304 1.7 itojun struct radix_node_head *rnh = encap_rnh(AF_INET6);
305 1.7 itojun struct radix_node *rn;
306 1.7 itojun #endif
307 1.1 itojun
308 1.41 ozaki KASSERT(m->m_len >= sizeof(*ip6));
309 1.41 ozaki
310 1.1 itojun ip6 = mtod(m, struct ip6_hdr *);
311 1.1 itojun
312 1.35 cegger memset(&pack, 0, sizeof(pack));
313 1.7 itojun pack.p.sp_len = sizeof(pack);
314 1.7 itojun pack.mine.sin6_family = pack.yours.sin6_family = AF_INET6;
315 1.7 itojun pack.mine.sin6_len = pack.yours.sin6_len = sizeof(struct sockaddr_in6);
316 1.7 itojun if (dir == INBOUND) {
317 1.7 itojun pack.mine.sin6_addr = ip6->ip6_dst;
318 1.7 itojun pack.yours.sin6_addr = ip6->ip6_src;
319 1.7 itojun } else {
320 1.7 itojun pack.mine.sin6_addr = ip6->ip6_src;
321 1.7 itojun pack.yours.sin6_addr = ip6->ip6_dst;
322 1.7 itojun }
323 1.1 itojun
324 1.1 itojun match = NULL;
325 1.1 itojun matchprio = 0;
326 1.7 itojun
327 1.7 itojun #ifdef USE_RADIX
328 1.30 christos rn = rnh->rnh_matchaddr((void *)&pack, rnh);
329 1.7 itojun if (rn && (rn->rn_flags & RNF_ROOT) == 0) {
330 1.7 itojun match = (struct encaptab *)rn;
331 1.7 itojun matchprio = mask_matchlen(match->srcmask) +
332 1.7 itojun mask_matchlen(match->dstmask);
333 1.7 itojun }
334 1.7 itojun #endif
335 1.7 itojun
336 1.31 dyoung LIST_FOREACH(ep, &encaptab, chain) {
337 1.1 itojun if (ep->af != AF_INET6)
338 1.1 itojun continue;
339 1.1 itojun if (ep->proto >= 0 && ep->proto != proto)
340 1.1 itojun continue;
341 1.1 itojun if (ep->func)
342 1.7 itojun prio = (*ep->func)(m, off, proto, ep->arg);
343 1.1 itojun else {
344 1.7 itojun #ifdef USE_RADIX
345 1.7 itojun continue;
346 1.7 itojun #else
347 1.7 itojun prio = mask_match(ep, (struct sockaddr *)&pack.mine,
348 1.7 itojun (struct sockaddr *)&pack.yours);
349 1.7 itojun #endif
350 1.1 itojun }
351 1.1 itojun
352 1.7 itojun /* see encap4_lookup() for issues here */
353 1.1 itojun if (prio <= 0)
354 1.1 itojun continue;
355 1.1 itojun if (prio > matchprio) {
356 1.1 itojun matchprio = prio;
357 1.1 itojun match = ep;
358 1.1 itojun }
359 1.1 itojun }
360 1.1 itojun
361 1.7 itojun return match;
362 1.7 itojun }
363 1.7 itojun
364 1.7 itojun int
365 1.23 perry encap6_input(struct mbuf **mp, int *offp, int proto)
366 1.7 itojun {
367 1.7 itojun struct mbuf *m = *mp;
368 1.7 itojun const struct ip6protosw *psw;
369 1.7 itojun struct encaptab *match;
370 1.7 itojun
371 1.7 itojun match = encap6_lookup(m, *offp, proto, INBOUND);
372 1.7 itojun
373 1.1 itojun if (match) {
374 1.1 itojun /* found a match */
375 1.4 itojun psw = (const struct ip6protosw *)match->psw;
376 1.1 itojun if (psw && psw->pr_input) {
377 1.1 itojun encap_fillarg(m, match);
378 1.1 itojun return (*psw->pr_input)(mp, offp, proto);
379 1.1 itojun } else {
380 1.1 itojun m_freem(m);
381 1.1 itojun return IPPROTO_DONE;
382 1.1 itojun }
383 1.1 itojun }
384 1.1 itojun
385 1.1 itojun /* last resort: inject to raw socket */
386 1.1 itojun return rip6_input(mp, offp, proto);
387 1.1 itojun }
388 1.1 itojun #endif
389 1.1 itojun
390 1.7 itojun static int
391 1.23 perry encap_add(struct encaptab *ep)
392 1.1 itojun {
393 1.7 itojun #ifdef USE_RADIX
394 1.7 itojun struct radix_node_head *rnh = encap_rnh(ep->af);
395 1.7 itojun #endif
396 1.7 itojun int error = 0;
397 1.1 itojun
398 1.1 itojun LIST_INSERT_HEAD(&encaptab, ep, chain);
399 1.7 itojun #ifdef USE_RADIX
400 1.7 itojun if (!ep->func && rnh) {
401 1.30 christos if (!rnh->rnh_addaddr((void *)ep->addrpack,
402 1.30 christos (void *)ep->maskpack, rnh, ep->nodes)) {
403 1.7 itojun error = EEXIST;
404 1.7 itojun goto fail;
405 1.7 itojun }
406 1.7 itojun }
407 1.7 itojun #endif
408 1.7 itojun return error;
409 1.7 itojun
410 1.7 itojun fail:
411 1.7 itojun LIST_REMOVE(ep, chain);
412 1.7 itojun return error;
413 1.7 itojun }
414 1.7 itojun
415 1.7 itojun static int
416 1.23 perry encap_remove(struct encaptab *ep)
417 1.7 itojun {
418 1.7 itojun #ifdef USE_RADIX
419 1.7 itojun struct radix_node_head *rnh = encap_rnh(ep->af);
420 1.7 itojun #endif
421 1.7 itojun int error = 0;
422 1.7 itojun
423 1.7 itojun LIST_REMOVE(ep, chain);
424 1.7 itojun #ifdef USE_RADIX
425 1.7 itojun if (!ep->func && rnh) {
426 1.30 christos if (!rnh->rnh_deladdr((void *)ep->addrpack,
427 1.30 christos (void *)ep->maskpack, rnh))
428 1.7 itojun error = ESRCH;
429 1.7 itojun }
430 1.7 itojun #endif
431 1.7 itojun return error;
432 1.7 itojun }
433 1.7 itojun
434 1.7 itojun static int
435 1.23 perry encap_afcheck(int af, const struct sockaddr *sp, const struct sockaddr *dp)
436 1.7 itojun {
437 1.7 itojun if (sp && dp) {
438 1.7 itojun if (sp->sa_len != dp->sa_len)
439 1.7 itojun return EINVAL;
440 1.7 itojun if (af != sp->sa_family || af != dp->sa_family)
441 1.7 itojun return EINVAL;
442 1.7 itojun } else if (!sp && !dp)
443 1.7 itojun ;
444 1.7 itojun else
445 1.7 itojun return EINVAL;
446 1.7 itojun
447 1.7 itojun switch (af) {
448 1.7 itojun case AF_INET:
449 1.7 itojun if (sp && sp->sa_len != sizeof(struct sockaddr_in))
450 1.7 itojun return EINVAL;
451 1.7 itojun if (dp && dp->sa_len != sizeof(struct sockaddr_in))
452 1.7 itojun return EINVAL;
453 1.7 itojun break;
454 1.7 itojun #ifdef INET6
455 1.7 itojun case AF_INET6:
456 1.7 itojun if (sp && sp->sa_len != sizeof(struct sockaddr_in6))
457 1.7 itojun return EINVAL;
458 1.7 itojun if (dp && dp->sa_len != sizeof(struct sockaddr_in6))
459 1.7 itojun return EINVAL;
460 1.7 itojun break;
461 1.7 itojun #endif
462 1.7 itojun default:
463 1.7 itojun return EAFNOSUPPORT;
464 1.7 itojun }
465 1.7 itojun
466 1.7 itojun return 0;
467 1.1 itojun }
468 1.1 itojun
469 1.1 itojun /*
470 1.1 itojun * sp (src ptr) is always my side, and dp (dst ptr) is always remote side.
471 1.1 itojun * length of mask (sm and dm) is assumed to be same as sp/dp.
472 1.1 itojun * Return value will be necessary as input (cookie) for encap_detach().
473 1.1 itojun */
474 1.1 itojun const struct encaptab *
475 1.23 perry encap_attach(int af, int proto,
476 1.23 perry const struct sockaddr *sp, const struct sockaddr *sm,
477 1.23 perry const struct sockaddr *dp, const struct sockaddr *dm,
478 1.23 perry const struct protosw *psw, void *arg)
479 1.1 itojun {
480 1.1 itojun struct encaptab *ep;
481 1.1 itojun int error;
482 1.1 itojun int s;
483 1.7 itojun size_t l;
484 1.33 pooka struct ip_pack4 *pack4;
485 1.7 itojun #ifdef INET6
486 1.33 pooka struct ip_pack6 *pack6;
487 1.7 itojun #endif
488 1.1 itojun
489 1.1 itojun s = splsoftnet();
490 1.1 itojun /* sanity check on args */
491 1.7 itojun error = encap_afcheck(af, sp, dp);
492 1.7 itojun if (error)
493 1.1 itojun goto fail;
494 1.1 itojun
495 1.1 itojun /* check if anyone have already attached with exactly same config */
496 1.31 dyoung LIST_FOREACH(ep, &encaptab, chain) {
497 1.1 itojun if (ep->af != af)
498 1.1 itojun continue;
499 1.1 itojun if (ep->proto != proto)
500 1.1 itojun continue;
501 1.7 itojun if (ep->func)
502 1.7 itojun continue;
503 1.41 ozaki
504 1.43 riastrad KASSERT(ep->src != NULL);
505 1.43 riastrad KASSERT(ep->dst != NULL);
506 1.43 riastrad KASSERT(ep->srcmask != NULL);
507 1.43 riastrad KASSERT(ep->dstmask != NULL);
508 1.41 ozaki
509 1.7 itojun if (ep->src->sa_len != sp->sa_len ||
510 1.34 cegger memcmp(ep->src, sp, sp->sa_len) != 0 ||
511 1.34 cegger memcmp(ep->srcmask, sm, sp->sa_len) != 0)
512 1.7 itojun continue;
513 1.7 itojun if (ep->dst->sa_len != dp->sa_len ||
514 1.34 cegger memcmp(ep->dst, dp, dp->sa_len) != 0 ||
515 1.34 cegger memcmp(ep->dstmask, dm, dp->sa_len) != 0)
516 1.1 itojun continue;
517 1.1 itojun
518 1.1 itojun error = EEXIST;
519 1.1 itojun goto fail;
520 1.1 itojun }
521 1.3 thorpej
522 1.7 itojun switch (af) {
523 1.7 itojun case AF_INET:
524 1.7 itojun l = sizeof(*pack4);
525 1.7 itojun break;
526 1.7 itojun #ifdef INET6
527 1.7 itojun case AF_INET6:
528 1.7 itojun l = sizeof(*pack6);
529 1.7 itojun break;
530 1.7 itojun #endif
531 1.7 itojun default:
532 1.7 itojun goto fail;
533 1.7 itojun }
534 1.7 itojun
535 1.20 itojun /* M_NETADDR ok? */
536 1.20 itojun ep = malloc(sizeof(*ep), M_NETADDR, M_NOWAIT|M_ZERO);
537 1.1 itojun if (ep == NULL) {
538 1.1 itojun error = ENOBUFS;
539 1.1 itojun goto fail;
540 1.1 itojun }
541 1.20 itojun ep->addrpack = malloc(l, M_NETADDR, M_NOWAIT|M_ZERO);
542 1.7 itojun if (ep->addrpack == NULL) {
543 1.7 itojun error = ENOBUFS;
544 1.7 itojun goto gc;
545 1.7 itojun }
546 1.20 itojun ep->maskpack = malloc(l, M_NETADDR, M_NOWAIT|M_ZERO);
547 1.7 itojun if (ep->maskpack == NULL) {
548 1.7 itojun error = ENOBUFS;
549 1.7 itojun goto gc;
550 1.7 itojun }
551 1.1 itojun
552 1.1 itojun ep->af = af;
553 1.1 itojun ep->proto = proto;
554 1.7 itojun ep->addrpack->sa_len = l & 0xff;
555 1.7 itojun ep->maskpack->sa_len = l & 0xff;
556 1.7 itojun switch (af) {
557 1.7 itojun case AF_INET:
558 1.33 pooka pack4 = (struct ip_pack4 *)ep->addrpack;
559 1.7 itojun ep->src = (struct sockaddr *)&pack4->mine;
560 1.7 itojun ep->dst = (struct sockaddr *)&pack4->yours;
561 1.33 pooka pack4 = (struct ip_pack4 *)ep->maskpack;
562 1.7 itojun ep->srcmask = (struct sockaddr *)&pack4->mine;
563 1.7 itojun ep->dstmask = (struct sockaddr *)&pack4->yours;
564 1.7 itojun break;
565 1.7 itojun #ifdef INET6
566 1.7 itojun case AF_INET6:
567 1.33 pooka pack6 = (struct ip_pack6 *)ep->addrpack;
568 1.7 itojun ep->src = (struct sockaddr *)&pack6->mine;
569 1.7 itojun ep->dst = (struct sockaddr *)&pack6->yours;
570 1.33 pooka pack6 = (struct ip_pack6 *)ep->maskpack;
571 1.7 itojun ep->srcmask = (struct sockaddr *)&pack6->mine;
572 1.7 itojun ep->dstmask = (struct sockaddr *)&pack6->yours;
573 1.7 itojun break;
574 1.7 itojun #endif
575 1.7 itojun }
576 1.7 itojun
577 1.37 tsutsui memcpy(ep->src, sp, sp->sa_len);
578 1.37 tsutsui memcpy(ep->srcmask, sm, sp->sa_len);
579 1.37 tsutsui memcpy(ep->dst, dp, dp->sa_len);
580 1.37 tsutsui memcpy(ep->dstmask, dm, dp->sa_len);
581 1.1 itojun ep->psw = psw;
582 1.1 itojun ep->arg = arg;
583 1.1 itojun
584 1.7 itojun error = encap_add(ep);
585 1.7 itojun if (error)
586 1.7 itojun goto gc;
587 1.1 itojun
588 1.1 itojun error = 0;
589 1.1 itojun splx(s);
590 1.1 itojun return ep;
591 1.1 itojun
592 1.7 itojun gc:
593 1.7 itojun if (ep->addrpack)
594 1.7 itojun free(ep->addrpack, M_NETADDR);
595 1.7 itojun if (ep->maskpack)
596 1.7 itojun free(ep->maskpack, M_NETADDR);
597 1.7 itojun if (ep)
598 1.7 itojun free(ep, M_NETADDR);
599 1.1 itojun fail:
600 1.1 itojun splx(s);
601 1.1 itojun return NULL;
602 1.1 itojun }
603 1.1 itojun
604 1.1 itojun const struct encaptab *
605 1.23 perry encap_attach_func(int af, int proto,
606 1.26 martin int (*func)(struct mbuf *, int, int, void *),
607 1.23 perry const struct protosw *psw, void *arg)
608 1.1 itojun {
609 1.1 itojun struct encaptab *ep;
610 1.1 itojun int error;
611 1.1 itojun int s;
612 1.1 itojun
613 1.1 itojun s = splsoftnet();
614 1.1 itojun /* sanity check on args */
615 1.1 itojun if (!func) {
616 1.1 itojun error = EINVAL;
617 1.1 itojun goto fail;
618 1.1 itojun }
619 1.1 itojun
620 1.7 itojun error = encap_afcheck(af, NULL, NULL);
621 1.7 itojun if (error)
622 1.7 itojun goto fail;
623 1.7 itojun
624 1.1 itojun ep = malloc(sizeof(*ep), M_NETADDR, M_NOWAIT); /*XXX*/
625 1.1 itojun if (ep == NULL) {
626 1.1 itojun error = ENOBUFS;
627 1.1 itojun goto fail;
628 1.1 itojun }
629 1.35 cegger memset(ep, 0, sizeof(*ep));
630 1.1 itojun
631 1.1 itojun ep->af = af;
632 1.1 itojun ep->proto = proto;
633 1.1 itojun ep->func = func;
634 1.1 itojun ep->psw = psw;
635 1.1 itojun ep->arg = arg;
636 1.1 itojun
637 1.7 itojun error = encap_add(ep);
638 1.7 itojun if (error)
639 1.7 itojun goto fail;
640 1.1 itojun
641 1.1 itojun error = 0;
642 1.1 itojun splx(s);
643 1.1 itojun return ep;
644 1.1 itojun
645 1.1 itojun fail:
646 1.1 itojun splx(s);
647 1.1 itojun return NULL;
648 1.1 itojun }
649 1.1 itojun
650 1.7 itojun /* XXX encap4_ctlinput() is necessary if we set DF=1 on outer IPv4 header */
651 1.7 itojun
652 1.7 itojun #ifdef INET6
653 1.32 ad void *
654 1.29 dyoung encap6_ctlinput(int cmd, const struct sockaddr *sa, void *d0)
655 1.7 itojun {
656 1.7 itojun void *d = d0;
657 1.7 itojun struct ip6_hdr *ip6;
658 1.7 itojun struct mbuf *m;
659 1.7 itojun int off;
660 1.7 itojun struct ip6ctlparam *ip6cp = NULL;
661 1.7 itojun int nxt;
662 1.7 itojun struct encaptab *ep;
663 1.7 itojun const struct ip6protosw *psw;
664 1.7 itojun
665 1.7 itojun if (sa->sa_family != AF_INET6 ||
666 1.7 itojun sa->sa_len != sizeof(struct sockaddr_in6))
667 1.32 ad return NULL;
668 1.7 itojun
669 1.7 itojun if ((unsigned)cmd >= PRC_NCMDS)
670 1.32 ad return NULL;
671 1.7 itojun if (cmd == PRC_HOSTDEAD)
672 1.7 itojun d = NULL;
673 1.7 itojun else if (cmd == PRC_MSGSIZE)
674 1.7 itojun ; /* special code is present, see below */
675 1.7 itojun else if (inet6ctlerrmap[cmd] == 0)
676 1.32 ad return NULL;
677 1.7 itojun
678 1.7 itojun /* if the parameter is from icmp6, decode it. */
679 1.7 itojun if (d != NULL) {
680 1.7 itojun ip6cp = (struct ip6ctlparam *)d;
681 1.7 itojun m = ip6cp->ip6c_m;
682 1.7 itojun ip6 = ip6cp->ip6c_ip6;
683 1.7 itojun off = ip6cp->ip6c_off;
684 1.7 itojun nxt = ip6cp->ip6c_nxt;
685 1.15 mycroft
686 1.15 mycroft if (ip6 && cmd == PRC_MSGSIZE) {
687 1.15 mycroft int valid = 0;
688 1.15 mycroft struct encaptab *match;
689 1.15 mycroft
690 1.15 mycroft /*
691 1.15 mycroft * Check to see if we have a valid encap configuration.
692 1.15 mycroft */
693 1.15 mycroft match = encap6_lookup(m, off, nxt, OUTBOUND);
694 1.15 mycroft if (match)
695 1.15 mycroft valid++;
696 1.15 mycroft
697 1.15 mycroft /*
698 1.15 mycroft * Depending on the value of "valid" and routing table
699 1.15 mycroft * size (mtudisc_{hi,lo}wat), we will:
700 1.15 mycroft * - recalcurate the new MTU and create the
701 1.15 mycroft * corresponding routing entry, or
702 1.15 mycroft * - ignore the MTU change notification.
703 1.15 mycroft */
704 1.15 mycroft icmp6_mtudisc_update((struct ip6ctlparam *)d, valid);
705 1.15 mycroft }
706 1.7 itojun } else {
707 1.7 itojun m = NULL;
708 1.7 itojun ip6 = NULL;
709 1.7 itojun nxt = -1;
710 1.7 itojun }
711 1.7 itojun
712 1.7 itojun /* inform all listeners */
713 1.31 dyoung LIST_FOREACH(ep, &encaptab, chain) {
714 1.7 itojun if (ep->af != AF_INET6)
715 1.7 itojun continue;
716 1.7 itojun if (ep->proto >= 0 && ep->proto != nxt)
717 1.7 itojun continue;
718 1.7 itojun
719 1.7 itojun /* should optimize by looking at address pairs */
720 1.7 itojun
721 1.7 itojun /* XXX need to pass ep->arg or ep itself to listeners */
722 1.7 itojun psw = (const struct ip6protosw *)ep->psw;
723 1.7 itojun if (psw && psw->pr_ctlinput)
724 1.7 itojun (*psw->pr_ctlinput)(cmd, sa, d);
725 1.7 itojun }
726 1.7 itojun
727 1.7 itojun rip6_ctlinput(cmd, sa, d0);
728 1.32 ad return NULL;
729 1.7 itojun }
730 1.7 itojun #endif
731 1.7 itojun
732 1.1 itojun int
733 1.23 perry encap_detach(const struct encaptab *cookie)
734 1.1 itojun {
735 1.1 itojun const struct encaptab *ep = cookie;
736 1.42 ozaki struct encaptab *p, *np;
737 1.7 itojun int error;
738 1.1 itojun
739 1.42 ozaki LIST_FOREACH_SAFE(p, &encaptab, chain, np) {
740 1.1 itojun if (p == ep) {
741 1.7 itojun error = encap_remove(p);
742 1.7 itojun if (error)
743 1.7 itojun return error;
744 1.7 itojun if (!ep->func) {
745 1.7 itojun free(p->addrpack, M_NETADDR);
746 1.7 itojun free(p->maskpack, M_NETADDR);
747 1.7 itojun }
748 1.1 itojun free(p, M_NETADDR); /*XXX*/
749 1.1 itojun return 0;
750 1.1 itojun }
751 1.1 itojun }
752 1.1 itojun
753 1.7 itojun return ENOENT;
754 1.7 itojun }
755 1.7 itojun
756 1.7 itojun #ifdef USE_RADIX
757 1.7 itojun static struct radix_node_head *
758 1.23 perry encap_rnh(int af)
759 1.7 itojun {
760 1.7 itojun
761 1.7 itojun switch (af) {
762 1.7 itojun case AF_INET:
763 1.7 itojun return encap_head[0];
764 1.7 itojun #ifdef INET6
765 1.7 itojun case AF_INET6:
766 1.7 itojun return encap_head[1];
767 1.7 itojun #endif
768 1.7 itojun default:
769 1.7 itojun return NULL;
770 1.7 itojun }
771 1.7 itojun }
772 1.7 itojun
773 1.7 itojun static int
774 1.23 perry mask_matchlen(const struct sockaddr *sa)
775 1.7 itojun {
776 1.7 itojun const char *p, *ep;
777 1.7 itojun int l;
778 1.7 itojun
779 1.7 itojun p = (const char *)sa;
780 1.7 itojun ep = p + sa->sa_len;
781 1.7 itojun p += 2; /* sa_len + sa_family */
782 1.7 itojun
783 1.7 itojun l = 0;
784 1.7 itojun while (p < ep) {
785 1.7 itojun l += (*p ? 8 : 0); /* estimate */
786 1.7 itojun p++;
787 1.7 itojun }
788 1.7 itojun return l;
789 1.1 itojun }
790 1.7 itojun #endif
791 1.1 itojun
792 1.7 itojun #ifndef USE_RADIX
793 1.1 itojun static int
794 1.23 perry mask_match(const struct encaptab *ep,
795 1.23 perry const struct sockaddr *sp,
796 1.23 perry const struct sockaddr *dp)
797 1.1 itojun {
798 1.1 itojun struct sockaddr_storage s;
799 1.1 itojun struct sockaddr_storage d;
800 1.1 itojun int i;
801 1.4 itojun const u_int8_t *p, *q;
802 1.4 itojun u_int8_t *r;
803 1.1 itojun int matchlen;
804 1.1 itojun
805 1.41 ozaki KASSERTMSG(ep->func == NULL, "wrong encaptab passed to mask_match");
806 1.41 ozaki
807 1.1 itojun if (sp->sa_len > sizeof(s) || dp->sa_len > sizeof(d))
808 1.1 itojun return 0;
809 1.1 itojun if (sp->sa_family != ep->af || dp->sa_family != ep->af)
810 1.1 itojun return 0;
811 1.7 itojun if (sp->sa_len != ep->src->sa_len || dp->sa_len != ep->dst->sa_len)
812 1.1 itojun return 0;
813 1.1 itojun
814 1.1 itojun matchlen = 0;
815 1.1 itojun
816 1.4 itojun p = (const u_int8_t *)sp;
817 1.7 itojun q = (const u_int8_t *)ep->srcmask;
818 1.1 itojun r = (u_int8_t *)&s;
819 1.1 itojun for (i = 0 ; i < sp->sa_len; i++) {
820 1.1 itojun r[i] = p[i] & q[i];
821 1.1 itojun /* XXX estimate */
822 1.1 itojun matchlen += (q[i] ? 8 : 0);
823 1.1 itojun }
824 1.1 itojun
825 1.4 itojun p = (const u_int8_t *)dp;
826 1.7 itojun q = (const u_int8_t *)ep->dstmask;
827 1.1 itojun r = (u_int8_t *)&d;
828 1.1 itojun for (i = 0 ; i < dp->sa_len; i++) {
829 1.1 itojun r[i] = p[i] & q[i];
830 1.1 itojun /* XXX rough estimate */
831 1.1 itojun matchlen += (q[i] ? 8 : 0);
832 1.1 itojun }
833 1.1 itojun
834 1.1 itojun /* need to overwrite len/family portion as we don't compare them */
835 1.1 itojun s.ss_len = sp->sa_len;
836 1.1 itojun s.ss_family = sp->sa_family;
837 1.1 itojun d.ss_len = dp->sa_len;
838 1.1 itojun d.ss_family = dp->sa_family;
839 1.1 itojun
840 1.34 cegger if (memcmp(&s, ep->src, ep->src->sa_len) == 0 &&
841 1.34 cegger memcmp(&d, ep->dst, ep->dst->sa_len) == 0) {
842 1.1 itojun return matchlen;
843 1.1 itojun } else
844 1.1 itojun return 0;
845 1.1 itojun }
846 1.7 itojun #endif
847 1.1 itojun
848 1.1 itojun static void
849 1.23 perry encap_fillarg(struct mbuf *m, const struct encaptab *ep)
850 1.1 itojun {
851 1.12 itojun struct m_tag *mtag;
852 1.1 itojun
853 1.12 itojun mtag = m_tag_get(PACKET_TAG_ENCAP, sizeof(void *), M_NOWAIT);
854 1.12 itojun if (mtag) {
855 1.12 itojun *(void **)(mtag + 1) = ep->arg;
856 1.12 itojun m_tag_prepend(m, mtag);
857 1.1 itojun }
858 1.1 itojun }
859 1.1 itojun
860 1.1 itojun void *
861 1.23 perry encap_getarg(struct mbuf *m)
862 1.1 itojun {
863 1.1 itojun void *p;
864 1.12 itojun struct m_tag *mtag;
865 1.1 itojun
866 1.1 itojun p = NULL;
867 1.12 itojun mtag = m_tag_find(m, PACKET_TAG_ENCAP, NULL);
868 1.12 itojun if (mtag != NULL) {
869 1.13 itojun p = *(void **)(mtag + 1);
870 1.12 itojun m_tag_delete(m, mtag);
871 1.1 itojun }
872 1.1 itojun return p;
873 1.1 itojun }
874