ip_encap.c revision 1.60 1 1.60 knakahar /* $NetBSD: ip_encap.c,v 1.60 2016/07/04 04:38:14 knakahara 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.55 knakahar * 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.55 knakahar #define USE_RADIX
69 1.7 itojun
70 1.6 lukem #include <sys/cdefs.h>
71 1.60 knakahar __KERNEL_RCSID(0, "$NetBSD: ip_encap.c,v 1.60 2016/07/04 04:38:14 knakahara Exp $");
72 1.1 itojun
73 1.46 pooka #ifdef _KERNEL_OPT
74 1.4 itojun #include "opt_mrouting.h"
75 1.4 itojun #include "opt_inet.h"
76 1.46 pooka #endif
77 1.1 itojun
78 1.1 itojun #include <sys/param.h>
79 1.1 itojun #include <sys/systm.h>
80 1.1 itojun #include <sys/socket.h>
81 1.1 itojun #include <sys/sockio.h>
82 1.1 itojun #include <sys/mbuf.h>
83 1.1 itojun #include <sys/errno.h>
84 1.4 itojun #include <sys/queue.h>
85 1.47 knakahar #include <sys/kmem.h>
86 1.56 knakahar #include <sys/mutex.h>
87 1.59 knakahar #include <sys/condvar.h>
88 1.56 knakahar #include <sys/psref.h>
89 1.56 knakahar #include <sys/pslist.h>
90 1.1 itojun
91 1.1 itojun #include <net/if.h>
92 1.1 itojun
93 1.1 itojun #include <netinet/in.h>
94 1.1 itojun #include <netinet/in_systm.h>
95 1.1 itojun #include <netinet/ip.h>
96 1.1 itojun #include <netinet/ip_var.h>
97 1.1 itojun #include <netinet/ip_encap.h>
98 1.1 itojun #ifdef MROUTING
99 1.1 itojun #include <netinet/ip_mroute.h>
100 1.1 itojun #endif /* MROUTING */
101 1.1 itojun
102 1.1 itojun #ifdef INET6
103 1.1 itojun #include <netinet/ip6.h>
104 1.1 itojun #include <netinet6/ip6_var.h>
105 1.51 knakahar #include <netinet6/ip6protosw.h> /* for struct ip6ctlparam */
106 1.7 itojun #include <netinet6/in6_var.h>
107 1.7 itojun #include <netinet6/in6_pcb.h>
108 1.7 itojun #include <netinet/icmp6.h>
109 1.1 itojun #endif
110 1.1 itojun
111 1.1 itojun #include <net/net_osdep.h>
112 1.1 itojun
113 1.7 itojun enum direction { INBOUND, OUTBOUND };
114 1.7 itojun
115 1.7 itojun #ifdef INET
116 1.56 knakahar static struct encaptab *encap4_lookup(struct mbuf *, int, int, enum direction,
117 1.56 knakahar struct psref *);
118 1.7 itojun #endif
119 1.7 itojun #ifdef INET6
120 1.56 knakahar static struct encaptab *encap6_lookup(struct mbuf *, int, int, enum direction,
121 1.56 knakahar struct psref *);
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.55 knakahar #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.55 knakahar #else
130 1.55 knakahar static int mask_match(const struct encaptab *, const struct sockaddr *,
131 1.55 knakahar const struct sockaddr *);
132 1.55 knakahar #endif
133 1.22 perry static void encap_fillarg(struct mbuf *, const struct encaptab *);
134 1.1 itojun
135 1.56 knakahar /*
136 1.56 knakahar * In encap[46]_lookup(), ep->func can sleep(e.g. rtalloc1) while walking
137 1.56 knakahar * encap_table. So, it cannot use pserialize_read_enter()
138 1.56 knakahar */
139 1.56 knakahar static struct {
140 1.56 knakahar struct pslist_head list;
141 1.56 knakahar pserialize_t psz;
142 1.56 knakahar struct psref_class *elem_class; /* for the element of et_list */
143 1.56 knakahar } encaptab __cacheline_aligned = {
144 1.56 knakahar .list = PSLIST_INITIALIZER,
145 1.56 knakahar };
146 1.56 knakahar #define encap_table encaptab.list
147 1.1 itojun
148 1.59 knakahar static struct {
149 1.59 knakahar kmutex_t lock;
150 1.59 knakahar kcondvar_t cv;
151 1.59 knakahar struct lwp *busy;
152 1.59 knakahar } encap_whole __cacheline_aligned;
153 1.59 knakahar
154 1.55 knakahar #ifdef USE_RADIX
155 1.7 itojun struct radix_node_head *encap_head[2]; /* 0 for AF_INET, 1 for AF_INET6 */
156 1.57 knakahar static bool encap_head_updating = false;
157 1.55 knakahar #endif
158 1.7 itojun
159 1.59 knakahar /*
160 1.59 knakahar * must be done before other encap interfaces initialization.
161 1.59 knakahar */
162 1.59 knakahar void
163 1.59 knakahar encapinit(void)
164 1.59 knakahar {
165 1.59 knakahar
166 1.60 knakahar encaptab.psz = pserialize_create();
167 1.60 knakahar encaptab.elem_class = psref_class_create("encapelem", IPL_SOFTNET);
168 1.60 knakahar if (encaptab.elem_class == NULL)
169 1.60 knakahar panic("encaptab.elem_class cannot be allocated.\n");
170 1.60 knakahar
171 1.59 knakahar mutex_init(&encap_whole.lock, MUTEX_DEFAULT, IPL_NONE);
172 1.59 knakahar cv_init(&encap_whole.cv, "ip_encap cv");
173 1.59 knakahar encap_whole.busy = NULL;
174 1.59 knakahar }
175 1.59 knakahar
176 1.1 itojun void
177 1.23 perry encap_init(void)
178 1.1 itojun {
179 1.7 itojun static int initialized = 0;
180 1.7 itojun
181 1.7 itojun if (initialized)
182 1.7 itojun return;
183 1.7 itojun initialized++;
184 1.1 itojun #if 0
185 1.1 itojun /*
186 1.1 itojun * we cannot use LIST_INIT() here, since drivers may want to call
187 1.4 itojun * encap_attach(), on driver attach. encap_init() will be called
188 1.1 itojun * on AF_INET{,6} initialization, which happens after driver
189 1.1 itojun * initialization - using LIST_INIT() here can nuke encap_attach()
190 1.1 itojun * from drivers.
191 1.1 itojun */
192 1.56 knakahar PSLIST_INIT(&encap_table);
193 1.1 itojun #endif
194 1.7 itojun
195 1.55 knakahar #ifdef USE_RADIX
196 1.7 itojun /*
197 1.38 pooka * initialize radix lookup table when the radix subsystem is inited.
198 1.7 itojun */
199 1.38 pooka rn_delayedinit((void *)&encap_head[0],
200 1.38 pooka sizeof(struct sockaddr_pack) << 3);
201 1.7 itojun #ifdef INET6
202 1.38 pooka rn_delayedinit((void *)&encap_head[1],
203 1.38 pooka sizeof(struct sockaddr_pack) << 3);
204 1.7 itojun #endif
205 1.55 knakahar #endif
206 1.1 itojun }
207 1.1 itojun
208 1.4 itojun #ifdef INET
209 1.7 itojun static struct encaptab *
210 1.56 knakahar encap4_lookup(struct mbuf *m, int off, int proto, enum direction dir,
211 1.56 knakahar struct psref *match_psref)
212 1.1 itojun {
213 1.1 itojun struct ip *ip;
214 1.33 pooka struct ip_pack4 pack;
215 1.1 itojun struct encaptab *ep, *match;
216 1.1 itojun int prio, matchprio;
217 1.56 knakahar int s;
218 1.55 knakahar #ifdef USE_RADIX
219 1.7 itojun struct radix_node_head *rnh = encap_rnh(AF_INET);
220 1.7 itojun struct radix_node *rn;
221 1.55 knakahar #endif
222 1.1 itojun
223 1.41 ozaki KASSERT(m->m_len >= sizeof(*ip));
224 1.41 ozaki
225 1.1 itojun ip = mtod(m, struct ip *);
226 1.1 itojun
227 1.35 cegger memset(&pack, 0, sizeof(pack));
228 1.7 itojun pack.p.sp_len = sizeof(pack);
229 1.7 itojun pack.mine.sin_family = pack.yours.sin_family = AF_INET;
230 1.7 itojun pack.mine.sin_len = pack.yours.sin_len = sizeof(struct sockaddr_in);
231 1.7 itojun if (dir == INBOUND) {
232 1.7 itojun pack.mine.sin_addr = ip->ip_dst;
233 1.7 itojun pack.yours.sin_addr = ip->ip_src;
234 1.7 itojun } else {
235 1.7 itojun pack.mine.sin_addr = ip->ip_src;
236 1.7 itojun pack.yours.sin_addr = ip->ip_dst;
237 1.7 itojun }
238 1.1 itojun
239 1.1 itojun match = NULL;
240 1.1 itojun matchprio = 0;
241 1.7 itojun
242 1.56 knakahar s = pserialize_read_enter();
243 1.55 knakahar #ifdef USE_RADIX
244 1.57 knakahar if (encap_head_updating) {
245 1.57 knakahar /*
246 1.57 knakahar * Update in progress. Do nothing.
247 1.57 knakahar */
248 1.57 knakahar pserialize_read_exit(s);
249 1.57 knakahar return NULL;
250 1.57 knakahar }
251 1.57 knakahar
252 1.30 christos rn = rnh->rnh_matchaddr((void *)&pack, rnh);
253 1.7 itojun if (rn && (rn->rn_flags & RNF_ROOT) == 0) {
254 1.56 knakahar struct encaptab *encapp = (struct encaptab *)rn;
255 1.56 knakahar
256 1.56 knakahar psref_acquire(match_psref, &encapp->psref,
257 1.56 knakahar encaptab.elem_class);
258 1.56 knakahar match = encapp;
259 1.7 itojun matchprio = mask_matchlen(match->srcmask) +
260 1.7 itojun mask_matchlen(match->dstmask);
261 1.7 itojun }
262 1.55 knakahar #endif
263 1.56 knakahar PSLIST_READER_FOREACH(ep, &encap_table, struct encaptab, chain) {
264 1.56 knakahar struct psref elem_psref;
265 1.56 knakahar
266 1.56 knakahar membar_datadep_consumer();
267 1.7 itojun
268 1.1 itojun if (ep->af != AF_INET)
269 1.1 itojun continue;
270 1.1 itojun if (ep->proto >= 0 && ep->proto != proto)
271 1.1 itojun continue;
272 1.56 knakahar
273 1.56 knakahar psref_acquire(&elem_psref, &ep->psref,
274 1.56 knakahar encaptab.elem_class);
275 1.56 knakahar if (ep->func) {
276 1.56 knakahar pserialize_read_exit(s);
277 1.56 knakahar /* ep->func is sleepable. e.g. rtalloc1 */
278 1.1 itojun prio = (*ep->func)(m, off, proto, ep->arg);
279 1.56 knakahar s = pserialize_read_enter();
280 1.56 knakahar } else {
281 1.55 knakahar #ifdef USE_RADIX
282 1.56 knakahar psref_release(&elem_psref, &ep->psref,
283 1.56 knakahar encaptab.elem_class);
284 1.7 itojun continue;
285 1.55 knakahar #else
286 1.55 knakahar prio = mask_match(ep, (struct sockaddr *)&pack.mine,
287 1.55 knakahar (struct sockaddr *)&pack.yours);
288 1.55 knakahar #endif
289 1.55 knakahar }
290 1.1 itojun
291 1.1 itojun /*
292 1.1 itojun * We prioritize the matches by using bit length of the
293 1.1 itojun * matches. mask_match() and user-supplied matching function
294 1.1 itojun * should return the bit length of the matches (for example,
295 1.1 itojun * if both src/dst are matched for IPv4, 64 should be returned).
296 1.1 itojun * 0 or negative return value means "it did not match".
297 1.1 itojun *
298 1.1 itojun * The question is, since we have two "mask" portion, we
299 1.1 itojun * cannot really define total order between entries.
300 1.1 itojun * For example, which of these should be preferred?
301 1.1 itojun * mask_match() returns 48 (32 + 16) for both of them.
302 1.1 itojun * src=3ffe::/16, dst=3ffe:501::/32
303 1.1 itojun * src=3ffe:501::/32, dst=3ffe::/16
304 1.1 itojun *
305 1.1 itojun * We need to loop through all the possible candidates
306 1.1 itojun * to get the best match - the search takes O(n) for
307 1.1 itojun * n attachments (i.e. interfaces).
308 1.7 itojun *
309 1.7 itojun * For radix-based lookup, I guess source takes precedence.
310 1.7 itojun * See rn_{refines,lexobetter} for the correct answer.
311 1.1 itojun */
312 1.56 knakahar if (prio <= 0) {
313 1.56 knakahar psref_release(&elem_psref, &ep->psref,
314 1.56 knakahar encaptab.elem_class);
315 1.1 itojun continue;
316 1.56 knakahar }
317 1.1 itojun if (prio > matchprio) {
318 1.56 knakahar /* release last matched ep */
319 1.56 knakahar if (match != NULL)
320 1.56 knakahar psref_release(match_psref, &match->psref,
321 1.56 knakahar encaptab.elem_class);
322 1.56 knakahar
323 1.56 knakahar psref_copy(match_psref, &elem_psref,
324 1.56 knakahar encaptab.elem_class);
325 1.1 itojun matchprio = prio;
326 1.1 itojun match = ep;
327 1.1 itojun }
328 1.56 knakahar KASSERTMSG((match == NULL) || psref_held(&match->psref,
329 1.56 knakahar encaptab.elem_class),
330 1.56 knakahar "current match = %p, but not hold its psref", match);
331 1.56 knakahar
332 1.56 knakahar psref_release(&elem_psref, &ep->psref,
333 1.56 knakahar encaptab.elem_class);
334 1.1 itojun }
335 1.56 knakahar pserialize_read_exit(s);
336 1.1 itojun
337 1.7 itojun return match;
338 1.7 itojun }
339 1.7 itojun
340 1.7 itojun void
341 1.7 itojun encap4_input(struct mbuf *m, ...)
342 1.7 itojun {
343 1.7 itojun int off, proto;
344 1.7 itojun va_list ap;
345 1.51 knakahar const struct encapsw *esw;
346 1.7 itojun struct encaptab *match;
347 1.56 knakahar struct psref match_psref;
348 1.7 itojun
349 1.7 itojun va_start(ap, m);
350 1.7 itojun off = va_arg(ap, int);
351 1.7 itojun proto = va_arg(ap, int);
352 1.7 itojun va_end(ap);
353 1.7 itojun
354 1.56 knakahar match = encap4_lookup(m, off, proto, INBOUND, &match_psref);
355 1.1 itojun if (match) {
356 1.1 itojun /* found a match, "match" has the best one */
357 1.51 knakahar esw = match->esw;
358 1.51 knakahar if (esw && esw->encapsw4.pr_input) {
359 1.1 itojun encap_fillarg(m, match);
360 1.51 knakahar (*esw->encapsw4.pr_input)(m, off, proto);
361 1.56 knakahar psref_release(&match_psref, &match->psref,
362 1.56 knakahar encaptab.elem_class);
363 1.54 knakahar } else {
364 1.56 knakahar psref_release(&match_psref, &match->psref,
365 1.56 knakahar encaptab.elem_class);
366 1.1 itojun m_freem(m);
367 1.54 knakahar }
368 1.1 itojun return;
369 1.1 itojun }
370 1.1 itojun
371 1.1 itojun /* last resort: inject to raw socket */
372 1.1 itojun rip_input(m, off, proto);
373 1.1 itojun }
374 1.1 itojun #endif
375 1.1 itojun
376 1.1 itojun #ifdef INET6
377 1.7 itojun static struct encaptab *
378 1.56 knakahar encap6_lookup(struct mbuf *m, int off, int proto, enum direction dir,
379 1.56 knakahar struct psref *match_psref)
380 1.1 itojun {
381 1.1 itojun struct ip6_hdr *ip6;
382 1.33 pooka struct ip_pack6 pack;
383 1.7 itojun int prio, matchprio;
384 1.56 knakahar int s;
385 1.1 itojun struct encaptab *ep, *match;
386 1.55 knakahar #ifdef USE_RADIX
387 1.7 itojun struct radix_node_head *rnh = encap_rnh(AF_INET6);
388 1.7 itojun struct radix_node *rn;
389 1.55 knakahar #endif
390 1.1 itojun
391 1.41 ozaki KASSERT(m->m_len >= sizeof(*ip6));
392 1.41 ozaki
393 1.1 itojun ip6 = mtod(m, struct ip6_hdr *);
394 1.1 itojun
395 1.35 cegger memset(&pack, 0, sizeof(pack));
396 1.7 itojun pack.p.sp_len = sizeof(pack);
397 1.7 itojun pack.mine.sin6_family = pack.yours.sin6_family = AF_INET6;
398 1.7 itojun pack.mine.sin6_len = pack.yours.sin6_len = sizeof(struct sockaddr_in6);
399 1.7 itojun if (dir == INBOUND) {
400 1.7 itojun pack.mine.sin6_addr = ip6->ip6_dst;
401 1.7 itojun pack.yours.sin6_addr = ip6->ip6_src;
402 1.7 itojun } else {
403 1.7 itojun pack.mine.sin6_addr = ip6->ip6_src;
404 1.7 itojun pack.yours.sin6_addr = ip6->ip6_dst;
405 1.7 itojun }
406 1.1 itojun
407 1.1 itojun match = NULL;
408 1.1 itojun matchprio = 0;
409 1.7 itojun
410 1.56 knakahar s = pserialize_read_enter();
411 1.55 knakahar #ifdef USE_RADIX
412 1.57 knakahar if (encap_head_updating) {
413 1.57 knakahar /*
414 1.57 knakahar * Update in progress. Do nothing.
415 1.57 knakahar */
416 1.57 knakahar pserialize_read_exit(s);
417 1.57 knakahar return NULL;
418 1.57 knakahar }
419 1.57 knakahar
420 1.30 christos rn = rnh->rnh_matchaddr((void *)&pack, rnh);
421 1.7 itojun if (rn && (rn->rn_flags & RNF_ROOT) == 0) {
422 1.56 knakahar struct encaptab *encapp = (struct encaptab *)rn;
423 1.56 knakahar
424 1.56 knakahar psref_acquire(match_psref, &encapp->psref,
425 1.56 knakahar encaptab.elem_class);
426 1.56 knakahar match = encapp;
427 1.7 itojun matchprio = mask_matchlen(match->srcmask) +
428 1.7 itojun mask_matchlen(match->dstmask);
429 1.7 itojun }
430 1.55 knakahar #endif
431 1.56 knakahar PSLIST_READER_FOREACH(ep, &encap_table, struct encaptab, chain) {
432 1.56 knakahar struct psref elem_psref;
433 1.56 knakahar
434 1.56 knakahar membar_datadep_consumer();
435 1.7 itojun
436 1.1 itojun if (ep->af != AF_INET6)
437 1.1 itojun continue;
438 1.1 itojun if (ep->proto >= 0 && ep->proto != proto)
439 1.1 itojun continue;
440 1.56 knakahar
441 1.56 knakahar psref_acquire(&elem_psref, &ep->psref,
442 1.56 knakahar encaptab.elem_class);
443 1.56 knakahar
444 1.56 knakahar if (ep->func) {
445 1.56 knakahar pserialize_read_exit(s);
446 1.56 knakahar /* ep->func is sleepable. e.g. rtalloc1 */
447 1.7 itojun prio = (*ep->func)(m, off, proto, ep->arg);
448 1.56 knakahar s = pserialize_read_enter();
449 1.56 knakahar } else {
450 1.55 knakahar #ifdef USE_RADIX
451 1.56 knakahar psref_release(&elem_psref, &ep->psref,
452 1.56 knakahar encaptab.elem_class);
453 1.7 itojun continue;
454 1.55 knakahar #else
455 1.55 knakahar prio = mask_match(ep, (struct sockaddr *)&pack.mine,
456 1.55 knakahar (struct sockaddr *)&pack.yours);
457 1.55 knakahar #endif
458 1.55 knakahar }
459 1.1 itojun
460 1.7 itojun /* see encap4_lookup() for issues here */
461 1.56 knakahar if (prio <= 0) {
462 1.56 knakahar psref_release(&elem_psref, &ep->psref,
463 1.56 knakahar encaptab.elem_class);
464 1.1 itojun continue;
465 1.56 knakahar }
466 1.1 itojun if (prio > matchprio) {
467 1.56 knakahar /* release last matched ep */
468 1.56 knakahar if (match != NULL)
469 1.56 knakahar psref_release(match_psref, &match->psref,
470 1.56 knakahar encaptab.elem_class);
471 1.56 knakahar
472 1.56 knakahar psref_copy(match_psref, &elem_psref,
473 1.56 knakahar encaptab.elem_class);
474 1.1 itojun matchprio = prio;
475 1.1 itojun match = ep;
476 1.1 itojun }
477 1.56 knakahar KASSERTMSG((match == NULL) || psref_held(&match->psref,
478 1.56 knakahar encaptab.elem_class),
479 1.56 knakahar "current match = %p, but not hold its psref", match);
480 1.56 knakahar
481 1.56 knakahar psref_release(&elem_psref, &ep->psref,
482 1.56 knakahar encaptab.elem_class);
483 1.1 itojun }
484 1.56 knakahar pserialize_read_exit(s);
485 1.1 itojun
486 1.7 itojun return match;
487 1.7 itojun }
488 1.7 itojun
489 1.7 itojun int
490 1.23 perry encap6_input(struct mbuf **mp, int *offp, int proto)
491 1.7 itojun {
492 1.7 itojun struct mbuf *m = *mp;
493 1.51 knakahar const struct encapsw *esw;
494 1.7 itojun struct encaptab *match;
495 1.56 knakahar struct psref match_psref;
496 1.7 itojun
497 1.56 knakahar match = encap6_lookup(m, *offp, proto, INBOUND, &match_psref);
498 1.7 itojun
499 1.1 itojun if (match) {
500 1.1 itojun /* found a match */
501 1.51 knakahar esw = match->esw;
502 1.51 knakahar if (esw && esw->encapsw6.pr_input) {
503 1.56 knakahar int ret;
504 1.1 itojun encap_fillarg(m, match);
505 1.56 knakahar ret = (*esw->encapsw6.pr_input)(mp, offp, proto);
506 1.56 knakahar psref_release(&match_psref, &match->psref,
507 1.56 knakahar encaptab.elem_class);
508 1.56 knakahar return ret;
509 1.1 itojun } else {
510 1.56 knakahar psref_release(&match_psref, &match->psref,
511 1.56 knakahar encaptab.elem_class);
512 1.1 itojun m_freem(m);
513 1.1 itojun return IPPROTO_DONE;
514 1.1 itojun }
515 1.1 itojun }
516 1.1 itojun
517 1.1 itojun /* last resort: inject to raw socket */
518 1.1 itojun return rip6_input(mp, offp, proto);
519 1.1 itojun }
520 1.1 itojun #endif
521 1.1 itojun
522 1.54 knakahar /*
523 1.54 knakahar * XXX
524 1.54 knakahar * The encaptab list and the rnh radix tree must be manipulated atomically.
525 1.54 knakahar */
526 1.7 itojun static int
527 1.23 perry encap_add(struct encaptab *ep)
528 1.1 itojun {
529 1.55 knakahar #ifdef USE_RADIX
530 1.7 itojun struct radix_node_head *rnh = encap_rnh(ep->af);
531 1.55 knakahar #endif
532 1.1 itojun
533 1.56 knakahar KASSERT(encap_lock_held());
534 1.54 knakahar
535 1.55 knakahar #ifdef USE_RADIX
536 1.7 itojun if (!ep->func && rnh) {
537 1.57 knakahar /* Disable access to the radix tree for reader. */
538 1.57 knakahar encap_head_updating = true;
539 1.56 knakahar /* Wait for all readers to drain. */
540 1.56 knakahar pserialize_perform(encaptab.psz);
541 1.56 knakahar
542 1.30 christos if (!rnh->rnh_addaddr((void *)ep->addrpack,
543 1.30 christos (void *)ep->maskpack, rnh, ep->nodes)) {
544 1.57 knakahar encap_head_updating = false;
545 1.56 knakahar return EEXIST;
546 1.7 itojun }
547 1.57 knakahar
548 1.57 knakahar /*
549 1.57 knakahar * The ep added to the radix tree must be skipped while
550 1.57 knakahar * encap[46]_lookup walks encaptab list. In other words,
551 1.57 knakahar * encap_add() does not need to care whether the ep has
552 1.57 knakahar * been added encaptab list or not yet.
553 1.57 knakahar * So, we can re-enable access to the radix tree for now.
554 1.57 knakahar */
555 1.57 knakahar encap_head_updating = false;
556 1.7 itojun }
557 1.55 knakahar #endif
558 1.56 knakahar PSLIST_WRITER_INSERT_HEAD(&encap_table, ep, chain);
559 1.7 itojun
560 1.56 knakahar return 0;
561 1.7 itojun }
562 1.7 itojun
563 1.54 knakahar /*
564 1.54 knakahar * XXX
565 1.54 knakahar * The encaptab list and the rnh radix tree must be manipulated atomically.
566 1.54 knakahar */
567 1.7 itojun static int
568 1.23 perry encap_remove(struct encaptab *ep)
569 1.7 itojun {
570 1.55 knakahar #ifdef USE_RADIX
571 1.7 itojun struct radix_node_head *rnh = encap_rnh(ep->af);
572 1.55 knakahar #endif
573 1.7 itojun int error = 0;
574 1.7 itojun
575 1.56 knakahar KASSERT(encap_lock_held());
576 1.54 knakahar
577 1.55 knakahar #ifdef USE_RADIX
578 1.7 itojun if (!ep->func && rnh) {
579 1.57 knakahar /* Disable access to the radix tree for reader. */
580 1.57 knakahar encap_head_updating = true;
581 1.56 knakahar /* Wait for all readers to drain. */
582 1.56 knakahar pserialize_perform(encaptab.psz);
583 1.56 knakahar
584 1.30 christos if (!rnh->rnh_deladdr((void *)ep->addrpack,
585 1.30 christos (void *)ep->maskpack, rnh))
586 1.7 itojun error = ESRCH;
587 1.57 knakahar
588 1.57 knakahar /*
589 1.57 knakahar * The ep added to the radix tree must be skipped while
590 1.57 knakahar * encap[46]_lookup walks encaptab list. In other words,
591 1.57 knakahar * encap_add() does not need to care whether the ep has
592 1.57 knakahar * been added encaptab list or not yet.
593 1.57 knakahar * So, we can re-enable access to the radix tree for now.
594 1.57 knakahar */
595 1.57 knakahar encap_head_updating = false;
596 1.7 itojun }
597 1.55 knakahar #endif
598 1.56 knakahar PSLIST_WRITER_REMOVE(ep, chain);
599 1.56 knakahar
600 1.7 itojun return error;
601 1.7 itojun }
602 1.7 itojun
603 1.7 itojun static int
604 1.23 perry encap_afcheck(int af, const struct sockaddr *sp, const struct sockaddr *dp)
605 1.7 itojun {
606 1.7 itojun if (sp && dp) {
607 1.7 itojun if (sp->sa_len != dp->sa_len)
608 1.7 itojun return EINVAL;
609 1.7 itojun if (af != sp->sa_family || af != dp->sa_family)
610 1.7 itojun return EINVAL;
611 1.7 itojun } else if (!sp && !dp)
612 1.7 itojun ;
613 1.7 itojun else
614 1.7 itojun return EINVAL;
615 1.7 itojun
616 1.7 itojun switch (af) {
617 1.7 itojun case AF_INET:
618 1.7 itojun if (sp && sp->sa_len != sizeof(struct sockaddr_in))
619 1.7 itojun return EINVAL;
620 1.7 itojun if (dp && dp->sa_len != sizeof(struct sockaddr_in))
621 1.7 itojun return EINVAL;
622 1.7 itojun break;
623 1.7 itojun #ifdef INET6
624 1.7 itojun case AF_INET6:
625 1.7 itojun if (sp && sp->sa_len != sizeof(struct sockaddr_in6))
626 1.7 itojun return EINVAL;
627 1.7 itojun if (dp && dp->sa_len != sizeof(struct sockaddr_in6))
628 1.7 itojun return EINVAL;
629 1.7 itojun break;
630 1.7 itojun #endif
631 1.7 itojun default:
632 1.7 itojun return EAFNOSUPPORT;
633 1.7 itojun }
634 1.7 itojun
635 1.7 itojun return 0;
636 1.1 itojun }
637 1.1 itojun
638 1.1 itojun /*
639 1.1 itojun * sp (src ptr) is always my side, and dp (dst ptr) is always remote side.
640 1.1 itojun * length of mask (sm and dm) is assumed to be same as sp/dp.
641 1.1 itojun * Return value will be necessary as input (cookie) for encap_detach().
642 1.1 itojun */
643 1.1 itojun const struct encaptab *
644 1.23 perry encap_attach(int af, int proto,
645 1.23 perry const struct sockaddr *sp, const struct sockaddr *sm,
646 1.23 perry const struct sockaddr *dp, const struct sockaddr *dm,
647 1.51 knakahar const struct encapsw *esw, void *arg)
648 1.1 itojun {
649 1.1 itojun struct encaptab *ep;
650 1.1 itojun int error;
651 1.56 knakahar int s, pss;
652 1.7 itojun size_t l;
653 1.33 pooka struct ip_pack4 *pack4;
654 1.7 itojun #ifdef INET6
655 1.33 pooka struct ip_pack6 *pack6;
656 1.7 itojun #endif
657 1.1 itojun
658 1.1 itojun s = splsoftnet();
659 1.1 itojun /* sanity check on args */
660 1.7 itojun error = encap_afcheck(af, sp, dp);
661 1.7 itojun if (error)
662 1.1 itojun goto fail;
663 1.1 itojun
664 1.1 itojun /* check if anyone have already attached with exactly same config */
665 1.56 knakahar pss = pserialize_read_enter();
666 1.56 knakahar PSLIST_READER_FOREACH(ep, &encap_table, struct encaptab, chain) {
667 1.56 knakahar membar_datadep_consumer();
668 1.56 knakahar
669 1.1 itojun if (ep->af != af)
670 1.1 itojun continue;
671 1.1 itojun if (ep->proto != proto)
672 1.1 itojun continue;
673 1.7 itojun if (ep->func)
674 1.7 itojun continue;
675 1.41 ozaki
676 1.43 riastrad KASSERT(ep->src != NULL);
677 1.43 riastrad KASSERT(ep->dst != NULL);
678 1.43 riastrad KASSERT(ep->srcmask != NULL);
679 1.43 riastrad KASSERT(ep->dstmask != NULL);
680 1.41 ozaki
681 1.7 itojun if (ep->src->sa_len != sp->sa_len ||
682 1.34 cegger memcmp(ep->src, sp, sp->sa_len) != 0 ||
683 1.34 cegger memcmp(ep->srcmask, sm, sp->sa_len) != 0)
684 1.7 itojun continue;
685 1.7 itojun if (ep->dst->sa_len != dp->sa_len ||
686 1.34 cegger memcmp(ep->dst, dp, dp->sa_len) != 0 ||
687 1.34 cegger memcmp(ep->dstmask, dm, dp->sa_len) != 0)
688 1.1 itojun continue;
689 1.1 itojun
690 1.1 itojun error = EEXIST;
691 1.56 knakahar pserialize_read_exit(pss);
692 1.1 itojun goto fail;
693 1.1 itojun }
694 1.56 knakahar pserialize_read_exit(pss);
695 1.3 thorpej
696 1.7 itojun switch (af) {
697 1.7 itojun case AF_INET:
698 1.7 itojun l = sizeof(*pack4);
699 1.7 itojun break;
700 1.7 itojun #ifdef INET6
701 1.7 itojun case AF_INET6:
702 1.7 itojun l = sizeof(*pack6);
703 1.7 itojun break;
704 1.7 itojun #endif
705 1.7 itojun default:
706 1.7 itojun goto fail;
707 1.7 itojun }
708 1.7 itojun
709 1.20 itojun /* M_NETADDR ok? */
710 1.47 knakahar ep = kmem_zalloc(sizeof(*ep), KM_NOSLEEP);
711 1.1 itojun if (ep == NULL) {
712 1.1 itojun error = ENOBUFS;
713 1.1 itojun goto fail;
714 1.1 itojun }
715 1.47 knakahar ep->addrpack = kmem_zalloc(l, KM_NOSLEEP);
716 1.7 itojun if (ep->addrpack == NULL) {
717 1.7 itojun error = ENOBUFS;
718 1.7 itojun goto gc;
719 1.7 itojun }
720 1.47 knakahar ep->maskpack = kmem_zalloc(l, KM_NOSLEEP);
721 1.7 itojun if (ep->maskpack == NULL) {
722 1.7 itojun error = ENOBUFS;
723 1.7 itojun goto gc;
724 1.7 itojun }
725 1.1 itojun
726 1.1 itojun ep->af = af;
727 1.1 itojun ep->proto = proto;
728 1.7 itojun ep->addrpack->sa_len = l & 0xff;
729 1.7 itojun ep->maskpack->sa_len = l & 0xff;
730 1.7 itojun switch (af) {
731 1.7 itojun case AF_INET:
732 1.33 pooka pack4 = (struct ip_pack4 *)ep->addrpack;
733 1.7 itojun ep->src = (struct sockaddr *)&pack4->mine;
734 1.7 itojun ep->dst = (struct sockaddr *)&pack4->yours;
735 1.33 pooka pack4 = (struct ip_pack4 *)ep->maskpack;
736 1.7 itojun ep->srcmask = (struct sockaddr *)&pack4->mine;
737 1.7 itojun ep->dstmask = (struct sockaddr *)&pack4->yours;
738 1.7 itojun break;
739 1.7 itojun #ifdef INET6
740 1.7 itojun case AF_INET6:
741 1.33 pooka pack6 = (struct ip_pack6 *)ep->addrpack;
742 1.7 itojun ep->src = (struct sockaddr *)&pack6->mine;
743 1.7 itojun ep->dst = (struct sockaddr *)&pack6->yours;
744 1.33 pooka pack6 = (struct ip_pack6 *)ep->maskpack;
745 1.7 itojun ep->srcmask = (struct sockaddr *)&pack6->mine;
746 1.7 itojun ep->dstmask = (struct sockaddr *)&pack6->yours;
747 1.7 itojun break;
748 1.7 itojun #endif
749 1.7 itojun }
750 1.7 itojun
751 1.37 tsutsui memcpy(ep->src, sp, sp->sa_len);
752 1.37 tsutsui memcpy(ep->srcmask, sm, sp->sa_len);
753 1.37 tsutsui memcpy(ep->dst, dp, dp->sa_len);
754 1.37 tsutsui memcpy(ep->dstmask, dm, dp->sa_len);
755 1.51 knakahar ep->esw = esw;
756 1.1 itojun ep->arg = arg;
757 1.56 knakahar psref_target_init(&ep->psref, encaptab.elem_class);
758 1.1 itojun
759 1.7 itojun error = encap_add(ep);
760 1.7 itojun if (error)
761 1.7 itojun goto gc;
762 1.1 itojun
763 1.1 itojun error = 0;
764 1.1 itojun splx(s);
765 1.1 itojun return ep;
766 1.1 itojun
767 1.7 itojun gc:
768 1.7 itojun if (ep->addrpack)
769 1.47 knakahar kmem_free(ep->addrpack, l);
770 1.7 itojun if (ep->maskpack)
771 1.47 knakahar kmem_free(ep->maskpack, l);
772 1.7 itojun if (ep)
773 1.47 knakahar kmem_free(ep, sizeof(*ep));
774 1.1 itojun fail:
775 1.1 itojun splx(s);
776 1.1 itojun return NULL;
777 1.1 itojun }
778 1.1 itojun
779 1.1 itojun const struct encaptab *
780 1.23 perry encap_attach_func(int af, int proto,
781 1.26 martin int (*func)(struct mbuf *, int, int, void *),
782 1.51 knakahar const struct encapsw *esw, void *arg)
783 1.1 itojun {
784 1.1 itojun struct encaptab *ep;
785 1.1 itojun int error;
786 1.1 itojun int s;
787 1.1 itojun
788 1.1 itojun s = splsoftnet();
789 1.1 itojun /* sanity check on args */
790 1.1 itojun if (!func) {
791 1.1 itojun error = EINVAL;
792 1.1 itojun goto fail;
793 1.1 itojun }
794 1.1 itojun
795 1.7 itojun error = encap_afcheck(af, NULL, NULL);
796 1.7 itojun if (error)
797 1.7 itojun goto fail;
798 1.7 itojun
799 1.47 knakahar ep = kmem_alloc(sizeof(*ep), KM_NOSLEEP); /*XXX*/
800 1.1 itojun if (ep == NULL) {
801 1.1 itojun error = ENOBUFS;
802 1.1 itojun goto fail;
803 1.1 itojun }
804 1.35 cegger memset(ep, 0, sizeof(*ep));
805 1.1 itojun
806 1.1 itojun ep->af = af;
807 1.1 itojun ep->proto = proto;
808 1.1 itojun ep->func = func;
809 1.51 knakahar ep->esw = esw;
810 1.1 itojun ep->arg = arg;
811 1.56 knakahar psref_target_init(&ep->psref, encaptab.elem_class);
812 1.1 itojun
813 1.7 itojun error = encap_add(ep);
814 1.7 itojun if (error)
815 1.7 itojun goto fail;
816 1.1 itojun
817 1.1 itojun error = 0;
818 1.1 itojun splx(s);
819 1.1 itojun return ep;
820 1.1 itojun
821 1.1 itojun fail:
822 1.1 itojun splx(s);
823 1.1 itojun return NULL;
824 1.1 itojun }
825 1.1 itojun
826 1.7 itojun /* XXX encap4_ctlinput() is necessary if we set DF=1 on outer IPv4 header */
827 1.7 itojun
828 1.7 itojun #ifdef INET6
829 1.32 ad void *
830 1.29 dyoung encap6_ctlinput(int cmd, const struct sockaddr *sa, void *d0)
831 1.7 itojun {
832 1.7 itojun void *d = d0;
833 1.7 itojun struct ip6_hdr *ip6;
834 1.7 itojun struct mbuf *m;
835 1.7 itojun int off;
836 1.7 itojun struct ip6ctlparam *ip6cp = NULL;
837 1.7 itojun int nxt;
838 1.56 knakahar int s;
839 1.7 itojun struct encaptab *ep;
840 1.51 knakahar const struct encapsw *esw;
841 1.7 itojun
842 1.7 itojun if (sa->sa_family != AF_INET6 ||
843 1.7 itojun sa->sa_len != sizeof(struct sockaddr_in6))
844 1.32 ad return NULL;
845 1.7 itojun
846 1.7 itojun if ((unsigned)cmd >= PRC_NCMDS)
847 1.32 ad return NULL;
848 1.7 itojun if (cmd == PRC_HOSTDEAD)
849 1.7 itojun d = NULL;
850 1.7 itojun else if (cmd == PRC_MSGSIZE)
851 1.7 itojun ; /* special code is present, see below */
852 1.7 itojun else if (inet6ctlerrmap[cmd] == 0)
853 1.32 ad return NULL;
854 1.7 itojun
855 1.7 itojun /* if the parameter is from icmp6, decode it. */
856 1.7 itojun if (d != NULL) {
857 1.7 itojun ip6cp = (struct ip6ctlparam *)d;
858 1.7 itojun m = ip6cp->ip6c_m;
859 1.7 itojun ip6 = ip6cp->ip6c_ip6;
860 1.7 itojun off = ip6cp->ip6c_off;
861 1.7 itojun nxt = ip6cp->ip6c_nxt;
862 1.15 mycroft
863 1.15 mycroft if (ip6 && cmd == PRC_MSGSIZE) {
864 1.15 mycroft int valid = 0;
865 1.15 mycroft struct encaptab *match;
866 1.56 knakahar struct psref elem_psref;
867 1.15 mycroft
868 1.15 mycroft /*
869 1.15 mycroft * Check to see if we have a valid encap configuration.
870 1.15 mycroft */
871 1.56 knakahar match = encap6_lookup(m, off, nxt, OUTBOUND,
872 1.56 knakahar &elem_psref);
873 1.15 mycroft if (match)
874 1.15 mycroft valid++;
875 1.56 knakahar psref_release(&elem_psref, &match->psref,
876 1.56 knakahar encaptab.elem_class);
877 1.15 mycroft
878 1.15 mycroft /*
879 1.15 mycroft * Depending on the value of "valid" and routing table
880 1.15 mycroft * size (mtudisc_{hi,lo}wat), we will:
881 1.15 mycroft * - recalcurate the new MTU and create the
882 1.15 mycroft * corresponding routing entry, or
883 1.15 mycroft * - ignore the MTU change notification.
884 1.15 mycroft */
885 1.15 mycroft icmp6_mtudisc_update((struct ip6ctlparam *)d, valid);
886 1.15 mycroft }
887 1.7 itojun } else {
888 1.7 itojun m = NULL;
889 1.7 itojun ip6 = NULL;
890 1.7 itojun nxt = -1;
891 1.7 itojun }
892 1.7 itojun
893 1.7 itojun /* inform all listeners */
894 1.56 knakahar
895 1.56 knakahar s = pserialize_read_enter();
896 1.56 knakahar PSLIST_READER_FOREACH(ep, &encap_table, struct encaptab, chain) {
897 1.56 knakahar struct psref elem_psref;
898 1.56 knakahar
899 1.56 knakahar membar_datadep_consumer();
900 1.56 knakahar
901 1.7 itojun if (ep->af != AF_INET6)
902 1.7 itojun continue;
903 1.7 itojun if (ep->proto >= 0 && ep->proto != nxt)
904 1.7 itojun continue;
905 1.7 itojun
906 1.7 itojun /* should optimize by looking at address pairs */
907 1.7 itojun
908 1.7 itojun /* XXX need to pass ep->arg or ep itself to listeners */
909 1.56 knakahar psref_acquire(&elem_psref, &ep->psref,
910 1.56 knakahar encaptab.elem_class);
911 1.51 knakahar esw = ep->esw;
912 1.51 knakahar if (esw && esw->encapsw6.pr_ctlinput) {
913 1.56 knakahar pserialize_read_exit(s);
914 1.56 knakahar /* pr_ctlinput is sleepable. e.g. rtcache_free */
915 1.52 knakahar (*esw->encapsw6.pr_ctlinput)(cmd, sa, d, ep->arg);
916 1.56 knakahar s = pserialize_read_enter();
917 1.51 knakahar }
918 1.56 knakahar psref_release(&elem_psref, &ep->psref,
919 1.56 knakahar encaptab.elem_class);
920 1.7 itojun }
921 1.56 knakahar pserialize_read_exit(s);
922 1.7 itojun
923 1.7 itojun rip6_ctlinput(cmd, sa, d0);
924 1.32 ad return NULL;
925 1.7 itojun }
926 1.7 itojun #endif
927 1.7 itojun
928 1.1 itojun int
929 1.23 perry encap_detach(const struct encaptab *cookie)
930 1.1 itojun {
931 1.1 itojun const struct encaptab *ep = cookie;
932 1.56 knakahar struct encaptab *p;
933 1.7 itojun int error;
934 1.1 itojun
935 1.56 knakahar KASSERT(encap_lock_held());
936 1.56 knakahar
937 1.56 knakahar PSLIST_WRITER_FOREACH(p, &encap_table, struct encaptab, chain) {
938 1.56 knakahar membar_datadep_consumer();
939 1.56 knakahar
940 1.1 itojun if (p == ep) {
941 1.7 itojun error = encap_remove(p);
942 1.7 itojun if (error)
943 1.7 itojun return error;
944 1.56 knakahar else
945 1.56 knakahar break;
946 1.56 knakahar }
947 1.56 knakahar }
948 1.56 knakahar if (p == NULL)
949 1.56 knakahar return ENOENT;
950 1.56 knakahar
951 1.58 knakahar #ifndef USE_RADIX
952 1.58 knakahar /*
953 1.58 knakahar * pserialize_perform(encaptab.psz) is already done in encap_remove().
954 1.58 knakahar */
955 1.56 knakahar pserialize_perform(encaptab.psz);
956 1.58 knakahar #endif
957 1.56 knakahar psref_target_destroy(&p->psref,
958 1.56 knakahar encaptab.elem_class);
959 1.56 knakahar if (!ep->func) {
960 1.56 knakahar kmem_free(p->addrpack, ep->addrpack->sa_len);
961 1.56 knakahar kmem_free(p->maskpack, ep->maskpack->sa_len);
962 1.1 itojun }
963 1.56 knakahar kmem_free(p, sizeof(*p));
964 1.1 itojun
965 1.56 knakahar return 0;
966 1.7 itojun }
967 1.7 itojun
968 1.55 knakahar #ifdef USE_RADIX
969 1.7 itojun static struct radix_node_head *
970 1.23 perry encap_rnh(int af)
971 1.7 itojun {
972 1.7 itojun
973 1.7 itojun switch (af) {
974 1.7 itojun case AF_INET:
975 1.7 itojun return encap_head[0];
976 1.7 itojun #ifdef INET6
977 1.7 itojun case AF_INET6:
978 1.7 itojun return encap_head[1];
979 1.7 itojun #endif
980 1.7 itojun default:
981 1.7 itojun return NULL;
982 1.7 itojun }
983 1.7 itojun }
984 1.7 itojun
985 1.7 itojun static int
986 1.23 perry mask_matchlen(const struct sockaddr *sa)
987 1.7 itojun {
988 1.7 itojun const char *p, *ep;
989 1.7 itojun int l;
990 1.7 itojun
991 1.7 itojun p = (const char *)sa;
992 1.7 itojun ep = p + sa->sa_len;
993 1.7 itojun p += 2; /* sa_len + sa_family */
994 1.7 itojun
995 1.7 itojun l = 0;
996 1.7 itojun while (p < ep) {
997 1.7 itojun l += (*p ? 8 : 0); /* estimate */
998 1.7 itojun p++;
999 1.7 itojun }
1000 1.7 itojun return l;
1001 1.1 itojun }
1002 1.55 knakahar #endif
1003 1.55 knakahar
1004 1.55 knakahar #ifndef USE_RADIX
1005 1.55 knakahar static int
1006 1.55 knakahar mask_match(const struct encaptab *ep,
1007 1.55 knakahar const struct sockaddr *sp,
1008 1.55 knakahar const struct sockaddr *dp)
1009 1.55 knakahar {
1010 1.55 knakahar struct sockaddr_storage s;
1011 1.55 knakahar struct sockaddr_storage d;
1012 1.55 knakahar int i;
1013 1.55 knakahar const u_int8_t *p, *q;
1014 1.55 knakahar u_int8_t *r;
1015 1.55 knakahar int matchlen;
1016 1.55 knakahar
1017 1.55 knakahar KASSERTMSG(ep->func == NULL, "wrong encaptab passed to mask_match");
1018 1.55 knakahar
1019 1.55 knakahar if (sp->sa_len > sizeof(s) || dp->sa_len > sizeof(d))
1020 1.55 knakahar return 0;
1021 1.55 knakahar if (sp->sa_family != ep->af || dp->sa_family != ep->af)
1022 1.55 knakahar return 0;
1023 1.55 knakahar if (sp->sa_len != ep->src->sa_len || dp->sa_len != ep->dst->sa_len)
1024 1.55 knakahar return 0;
1025 1.55 knakahar
1026 1.55 knakahar matchlen = 0;
1027 1.55 knakahar
1028 1.55 knakahar p = (const u_int8_t *)sp;
1029 1.55 knakahar q = (const u_int8_t *)ep->srcmask;
1030 1.55 knakahar r = (u_int8_t *)&s;
1031 1.55 knakahar for (i = 0 ; i < sp->sa_len; i++) {
1032 1.55 knakahar r[i] = p[i] & q[i];
1033 1.55 knakahar /* XXX estimate */
1034 1.55 knakahar matchlen += (q[i] ? 8 : 0);
1035 1.55 knakahar }
1036 1.55 knakahar
1037 1.55 knakahar p = (const u_int8_t *)dp;
1038 1.55 knakahar q = (const u_int8_t *)ep->dstmask;
1039 1.55 knakahar r = (u_int8_t *)&d;
1040 1.55 knakahar for (i = 0 ; i < dp->sa_len; i++) {
1041 1.55 knakahar r[i] = p[i] & q[i];
1042 1.55 knakahar /* XXX rough estimate */
1043 1.55 knakahar matchlen += (q[i] ? 8 : 0);
1044 1.55 knakahar }
1045 1.55 knakahar
1046 1.55 knakahar /* need to overwrite len/family portion as we don't compare them */
1047 1.55 knakahar s.ss_len = sp->sa_len;
1048 1.55 knakahar s.ss_family = sp->sa_family;
1049 1.55 knakahar d.ss_len = dp->sa_len;
1050 1.55 knakahar d.ss_family = dp->sa_family;
1051 1.55 knakahar
1052 1.55 knakahar if (memcmp(&s, ep->src, ep->src->sa_len) == 0 &&
1053 1.55 knakahar memcmp(&d, ep->dst, ep->dst->sa_len) == 0) {
1054 1.55 knakahar return matchlen;
1055 1.55 knakahar } else
1056 1.55 knakahar return 0;
1057 1.55 knakahar }
1058 1.55 knakahar #endif
1059 1.1 itojun
1060 1.1 itojun static void
1061 1.23 perry encap_fillarg(struct mbuf *m, const struct encaptab *ep)
1062 1.1 itojun {
1063 1.12 itojun struct m_tag *mtag;
1064 1.1 itojun
1065 1.12 itojun mtag = m_tag_get(PACKET_TAG_ENCAP, sizeof(void *), M_NOWAIT);
1066 1.12 itojun if (mtag) {
1067 1.12 itojun *(void **)(mtag + 1) = ep->arg;
1068 1.12 itojun m_tag_prepend(m, mtag);
1069 1.1 itojun }
1070 1.1 itojun }
1071 1.1 itojun
1072 1.1 itojun void *
1073 1.23 perry encap_getarg(struct mbuf *m)
1074 1.1 itojun {
1075 1.1 itojun void *p;
1076 1.12 itojun struct m_tag *mtag;
1077 1.1 itojun
1078 1.1 itojun p = NULL;
1079 1.12 itojun mtag = m_tag_find(m, PACKET_TAG_ENCAP, NULL);
1080 1.12 itojun if (mtag != NULL) {
1081 1.13 itojun p = *(void **)(mtag + 1);
1082 1.12 itojun m_tag_delete(m, mtag);
1083 1.1 itojun }
1084 1.1 itojun return p;
1085 1.1 itojun }
1086 1.54 knakahar
1087 1.59 knakahar int
1088 1.54 knakahar encap_lock_enter(void)
1089 1.54 knakahar {
1090 1.59 knakahar int error;
1091 1.59 knakahar
1092 1.59 knakahar mutex_enter(&encap_whole.lock);
1093 1.59 knakahar while (encap_whole.busy != NULL) {
1094 1.59 knakahar error = cv_wait_sig(&encap_whole.cv, &encap_whole.lock);
1095 1.59 knakahar if (error) {
1096 1.59 knakahar mutex_exit(&encap_whole.lock);
1097 1.59 knakahar return error;
1098 1.59 knakahar }
1099 1.59 knakahar }
1100 1.59 knakahar KASSERT(encap_whole.busy == NULL);
1101 1.59 knakahar encap_whole.busy = curlwp;
1102 1.59 knakahar mutex_exit(&encap_whole.lock);
1103 1.54 knakahar
1104 1.59 knakahar return 0;
1105 1.54 knakahar }
1106 1.54 knakahar
1107 1.54 knakahar void
1108 1.54 knakahar encap_lock_exit(void)
1109 1.54 knakahar {
1110 1.54 knakahar
1111 1.59 knakahar mutex_enter(&encap_whole.lock);
1112 1.59 knakahar KASSERT(encap_whole.busy == curlwp);
1113 1.59 knakahar encap_whole.busy = NULL;
1114 1.59 knakahar cv_broadcast(&encap_whole.cv);
1115 1.59 knakahar mutex_exit(&encap_whole.lock);
1116 1.54 knakahar }
1117 1.56 knakahar
1118 1.56 knakahar bool
1119 1.56 knakahar encap_lock_held(void)
1120 1.56 knakahar {
1121 1.56 knakahar
1122 1.59 knakahar return (encap_whole.busy == curlwp);
1123 1.56 knakahar }
1124