1 /* $KAME: ip_encap.c,v 1.41 2001/03/15 08:35:08 itojun Exp $ */
4 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the project nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * My grandfather said that there's a devil inside tunnelling technology...
34 * We have surprisingly many protocols that want packets with IP protocol
35 * #4 or #41. Here's a list of protocols that want protocol #41:
36 * RFC1933 configured tunnel
37 * RFC1933 automatic tunnel
38 * RFC2401 IPsec tunnel
39 * RFC2473 IPv6 generic packet tunnelling
40 * RFC2529 6over4 tunnel
41 * mobile-ip6 (uses RFC2473)
44 * Here's a list of protocol that want protocol #4:
45 * RFC1853 IPv4-in-IPv4 tunnelling
46 * RFC2003 IPv4 encapsulation within IPv4
47 * RFC2344 reverse tunnelling for mobile-ip4
48 * RFC2401 IPsec tunnel
49 * Well, what can I say. They impose different en/decapsulation mechanism
50 * from each other, so they need separate protocol handler. The only one
51 * we can easily determine by protocol # is IPsec, which always has
52 * AH/ESP/IPComp header right after outer IP header.
54 * So, clearly good old protosw does not work for protocol #4 and #41.
55 * The code will let you match protocol via src/dst address pair.
57 /* XXX is M_NETADDR correct? */
59 #include <sys/cdefs.h>
60 __FBSDID("$FreeBSD$");
62 #include "opt_mrouting.h"
64 #include "opt_inet6.h"
66 #include <sys/param.h>
67 #include <sys/systm.h>
68 #include <sys/socket.h>
69 #include <sys/sockio.h>
71 #include <sys/errno.h>
72 #include <sys/protosw.h>
73 #include <sys/queue.h>
76 #include <net/route.h>
78 #include <netinet/in.h>
79 #include <netinet/in_systm.h>
80 #include <netinet/ip.h>
81 #include <netinet/ip_var.h>
82 #include <netinet/ip_encap.h>
85 #include <netinet/ip6.h>
86 #include <netinet6/ip6_var.h>
89 #include <machine/stdarg.h>
91 #include <sys/kernel.h>
92 #include <sys/malloc.h>
93 static MALLOC_DEFINE(M_NETADDR, "encap_export_host", "Export host address structure");
95 static void encap_add(struct encaptab *);
96 static int mask_match(const struct encaptab *, const struct sockaddr *,
97 const struct sockaddr *);
98 static void encap_fillarg(struct mbuf *, void *);
101 * All global variables in ip_encap.c are locked using encapmtx.
103 static struct mtx encapmtx;
104 MTX_SYSINIT(encapmtx, &encapmtx, "encapmtx", MTX_DEF);
105 static LIST_HEAD(, encaptab) encaptab = LIST_HEAD_INITIALIZER(encaptab);
108 * We currently keey encap_init() for source code compatibility reasons --
109 * it's referenced by KAME pieces in netinet6.
118 encap4_input(struct mbuf **mp, int *offp, int proto)
122 struct sockaddr_in s, d;
123 const struct protosw *psw;
124 struct encaptab *ep, *match;
126 int matchprio, off, prio;
130 ip = mtod(m, struct ip *);
132 bzero(&s, sizeof(s));
133 s.sin_family = AF_INET;
134 s.sin_len = sizeof(struct sockaddr_in);
135 s.sin_addr = ip->ip_src;
136 bzero(&d, sizeof(d));
137 d.sin_family = AF_INET;
138 d.sin_len = sizeof(struct sockaddr_in);
139 d.sin_addr = ip->ip_dst;
146 LIST_FOREACH(ep, &encaptab, chain) {
147 if (ep->af != AF_INET)
149 if (ep->proto >= 0 && ep->proto != proto)
152 prio = (*ep->func)(m, off, proto, ep->arg);
155 * it's inbound traffic, we need to match in reverse
158 prio = mask_match(ep, (struct sockaddr *)&d,
159 (struct sockaddr *)&s);
163 * We prioritize the matches by using bit length of the
164 * matches. mask_match() and user-supplied matching function
165 * should return the bit length of the matches (for example,
166 * if both src/dst are matched for IPv4, 64 should be returned).
167 * 0 or negative return value means "it did not match".
169 * The question is, since we have two "mask" portion, we
170 * cannot really define total order between entries.
171 * For example, which of these should be preferred?
172 * mask_match() returns 48 (32 + 16) for both of them.
173 * src=3ffe::/16, dst=3ffe:501::/32
174 * src=3ffe:501::/32, dst=3ffe::/16
176 * We need to loop through all the possible candidates
177 * to get the best match - the search takes O(n) for
178 * n attachments (i.e. interfaces).
182 if (prio > matchprio) {
191 mtx_unlock(&encapmtx);
194 /* found a match, "match" has the best one */
195 if (psw != NULL && psw->pr_input != NULL) {
196 encap_fillarg(m, arg);
197 (*psw->pr_input)(mp, offp, proto);
200 return (IPPROTO_DONE);
203 /* last resort: inject to raw socket */
204 return (rip_input(mp, offp, proto));
210 encap6_input(struct mbuf **mp, int *offp, int proto)
212 struct mbuf *m = *mp;
214 struct sockaddr_in6 s, d;
215 const struct protosw *psw;
216 struct encaptab *ep, *match;
220 ip6 = mtod(m, struct ip6_hdr *);
222 bzero(&s, sizeof(s));
223 s.sin6_family = AF_INET6;
224 s.sin6_len = sizeof(struct sockaddr_in6);
225 s.sin6_addr = ip6->ip6_src;
226 bzero(&d, sizeof(d));
227 d.sin6_family = AF_INET6;
228 d.sin6_len = sizeof(struct sockaddr_in6);
229 d.sin6_addr = ip6->ip6_dst;
236 LIST_FOREACH(ep, &encaptab, chain) {
237 if (ep->af != AF_INET6)
239 if (ep->proto >= 0 && ep->proto != proto)
242 prio = (*ep->func)(m, *offp, proto, ep->arg);
245 * it's inbound traffic, we need to match in reverse
248 prio = mask_match(ep, (struct sockaddr *)&d,
249 (struct sockaddr *)&s);
252 /* see encap4_input() for issues here */
255 if (prio > matchprio) {
264 mtx_unlock(&encapmtx);
268 if (psw != NULL && psw->pr_input != NULL) {
269 encap_fillarg(m, arg);
270 return (*psw->pr_input)(mp, offp, proto);
273 return (IPPROTO_DONE);
277 /* last resort: inject to raw socket */
278 return rip6_input(mp, offp, proto);
282 /*lint -sem(encap_add, custodial(1)) */
284 encap_add(struct encaptab *ep)
287 mtx_assert(&encapmtx, MA_OWNED);
288 LIST_INSERT_HEAD(&encaptab, ep, chain);
292 * sp (src ptr) is always my side, and dp (dst ptr) is always remote side.
293 * length of mask (sm and dm) is assumed to be same as sp/dp.
294 * Return value will be necessary as input (cookie) for encap_detach().
296 const struct encaptab *
297 encap_attach(int af, int proto, const struct sockaddr *sp,
298 const struct sockaddr *sm, const struct sockaddr *dp,
299 const struct sockaddr *dm, const struct protosw *psw, void *arg)
303 /* sanity check on args */
304 if (sp->sa_len > sizeof(ep->src) || dp->sa_len > sizeof(ep->dst))
306 if (sp->sa_len != dp->sa_len)
308 if (af != sp->sa_family || af != dp->sa_family)
311 /* check if anyone have already attached with exactly same config */
313 LIST_FOREACH(ep, &encaptab, chain) {
316 if (ep->proto != proto)
318 if (ep->src.ss_len != sp->sa_len ||
319 bcmp(&ep->src, sp, sp->sa_len) != 0 ||
320 bcmp(&ep->srcmask, sm, sp->sa_len) != 0)
322 if (ep->dst.ss_len != dp->sa_len ||
323 bcmp(&ep->dst, dp, dp->sa_len) != 0 ||
324 bcmp(&ep->dstmask, dm, dp->sa_len) != 0)
327 mtx_unlock(&encapmtx);
331 ep = malloc(sizeof(*ep), M_NETADDR, M_NOWAIT); /*XXX*/
333 mtx_unlock(&encapmtx);
336 bzero(ep, sizeof(*ep));
340 bcopy(sp, &ep->src, sp->sa_len);
341 bcopy(sm, &ep->srcmask, sp->sa_len);
342 bcopy(dp, &ep->dst, dp->sa_len);
343 bcopy(dm, &ep->dstmask, dp->sa_len);
348 mtx_unlock(&encapmtx);
352 const struct encaptab *
353 encap_attach_func(int af, int proto,
354 int (*func)(const struct mbuf *, int, int, void *),
355 const struct protosw *psw, void *arg)
359 /* sanity check on args */
363 ep = malloc(sizeof(*ep), M_NETADDR, M_NOWAIT); /*XXX*/
366 bzero(ep, sizeof(*ep));
376 mtx_unlock(&encapmtx);
381 encap_detach(const struct encaptab *cookie)
383 const struct encaptab *ep = cookie;
387 LIST_FOREACH(p, &encaptab, chain) {
389 LIST_REMOVE(p, chain);
390 mtx_unlock(&encapmtx);
391 free(p, M_NETADDR); /*XXX*/
395 mtx_unlock(&encapmtx);
401 mask_match(const struct encaptab *ep, const struct sockaddr *sp,
402 const struct sockaddr *dp)
404 struct sockaddr_storage s;
405 struct sockaddr_storage d;
407 const u_int8_t *p, *q;
411 if (sp->sa_len > sizeof(s) || dp->sa_len > sizeof(d))
413 if (sp->sa_family != ep->af || dp->sa_family != ep->af)
415 if (sp->sa_len != ep->src.ss_len || dp->sa_len != ep->dst.ss_len)
420 p = (const u_int8_t *)sp;
421 q = (const u_int8_t *)&ep->srcmask;
423 for (i = 0 ; i < sp->sa_len; i++) {
426 matchlen += (q[i] ? 8 : 0);
429 p = (const u_int8_t *)dp;
430 q = (const u_int8_t *)&ep->dstmask;
432 for (i = 0 ; i < dp->sa_len; i++) {
434 /* XXX rough estimate */
435 matchlen += (q[i] ? 8 : 0);
438 /* need to overwrite len/family portion as we don't compare them */
439 s.ss_len = sp->sa_len;
440 s.ss_family = sp->sa_family;
441 d.ss_len = dp->sa_len;
442 d.ss_family = dp->sa_family;
444 if (bcmp(&s, &ep->src, ep->src.ss_len) == 0 &&
445 bcmp(&d, &ep->dst, ep->dst.ss_len) == 0) {
452 encap_fillarg(struct mbuf *m, void *arg)
457 tag = m_tag_get(PACKET_TAG_ENCAP, sizeof(void *), M_NOWAIT);
459 *(void**)(tag+1) = arg;
460 m_tag_prepend(m, tag);
466 encap_getarg(struct mbuf *m)
471 tag = m_tag_find(m, PACKET_TAG_ENCAP, NULL);
473 p = *(void**)(tag+1);
474 m_tag_delete(m, tag);