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