1 /* $NetBSD: uipc_accf.c,v 1.9 2009/09/16 15:23:04 pooka Exp $ */
4 * Copyright (c) 2008 The NetBSD Foundation, Inc.
7 * This code is derived from software developed for The NetBSD Foundation
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
33 * Copyright (c) 2000 Paycounter, Inc.
34 * Copyright (c) 2005 Robert N. M. Watson
35 * Author: Alfred Perlstein <alfred@paycounter.com>, <alfred@FreeBSD.org>
36 * All rights reserved.
38 * Redistribution and use in source and binary forms, with or without
39 * modification, are permitted provided that the following conditions
41 * 1. Redistributions of source code must retain the above copyright
42 * notice, this list of conditions and the following disclaimer.
43 * 2. Redistributions in binary form must reproduce the above copyright
44 * notice, this list of conditions and the following disclaimer in the
45 * documentation and/or other materials provided with the distribution.
47 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
48 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
49 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
50 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
51 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
52 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
53 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
54 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
55 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
56 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
60 #include <sys/cdefs.h>
61 __KERNEL_RCSID(0, "$NetBSD: uipc_accf.c,v 1.9 2009/09/16 15:23:04 pooka Exp $");
63 #define ACCEPT_FILTER_MOD
65 #include <sys/param.h>
66 #include <sys/systm.h>
67 #include <sys/domain.h>
68 #include <sys/kernel.h>
72 #include <sys/rwlock.h>
73 #include <sys/protosw.h>
74 #include <sys/sysctl.h>
75 #include <sys/socket.h>
76 #include <sys/socketvar.h>
77 #include <sys/queue.h>
79 #include <sys/atomic.h>
80 #include <sys/module.h>
82 static krwlock_t accept_filter_lock
;
84 static LIST_HEAD(, accept_filter
) accept_filtlsthd
=
85 LIST_HEAD_INITIALIZER(&accept_filtlsthd
);
88 * Names of Accept filter sysctl objects
90 static struct sysctllog
*ctllog
;
92 sysctl_net_inet_accf_setup(void)
95 sysctl_createv(&ctllog
, 0, NULL
, NULL
,
97 CTLTYPE_NODE
, "net", NULL
,
100 sysctl_createv(&ctllog
, 0, NULL
, NULL
,
102 CTLTYPE_NODE
, "inet", NULL
,
104 CTL_NET
, PF_INET
, CTL_EOL
);
105 sysctl_createv(&ctllog
, 0, NULL
, NULL
,
107 CTLTYPE_NODE
, "accf",
108 SYSCTL_DESCR("Accept filters"),
110 CTL_NET
, PF_INET
, SO_ACCEPTFILTER
, CTL_EOL
);
114 accept_filt_add(struct accept_filter
*filt
)
116 struct accept_filter
*p
;
118 accept_filter_init();
120 rw_enter(&accept_filter_lock
, RW_WRITER
);
121 LIST_FOREACH(p
, &accept_filtlsthd
, accf_next
) {
122 if (strcmp(p
->accf_name
, filt
->accf_name
) == 0) {
123 rw_exit(&accept_filter_lock
);
127 LIST_INSERT_HEAD(&accept_filtlsthd
, filt
, accf_next
);
128 rw_exit(&accept_filter_lock
);
134 accept_filt_del(struct accept_filter
*p
)
137 rw_enter(&accept_filter_lock
, RW_WRITER
);
138 if (p
->accf_refcnt
!= 0) {
139 rw_exit(&accept_filter_lock
);
142 LIST_REMOVE(p
, accf_next
);
143 rw_exit(&accept_filter_lock
);
148 struct accept_filter
*
149 accept_filt_get(char *name
)
151 struct accept_filter
*p
;
156 rw_enter(&accept_filter_lock
, RW_READER
);
157 LIST_FOREACH(p
, &accept_filtlsthd
, accf_next
) {
158 if (strcmp(p
->accf_name
, name
) == 0) {
159 atomic_inc_uint(&p
->accf_refcnt
);
163 rw_exit(&accept_filter_lock
);
167 /* Try to autoload a module to satisfy the request. */
168 strcpy(buf
, "accf_");
169 strlcat(buf
, name
, sizeof(buf
));
170 mutex_enter(&module_lock
);
172 (void)module_autoload(buf
, MODULE_CLASS_ANY
);
173 mutex_exit(&module_lock
);
174 } while (gen
!= module_gen
);
180 * Accept filter initialization routine.
181 * This should be called only once.
185 accept_filter_init0(void)
188 rw_init(&accept_filter_lock
);
189 sysctl_net_inet_accf_setup();
195 * Initialization routine: This can also be replaced with
196 * accept_filt_generic_mod_event for attaching new accept filter.
200 accept_filter_init(void)
202 static ONCE_DECL(accept_filter_init_once
);
204 RUN_ONCE(&accept_filter_init_once
, accept_filter_init0
);
208 accept_filt_getopt(struct socket
*so
, struct sockopt
*sopt
)
210 struct accept_filter_arg afa
;
213 KASSERT(solocked(so
));
215 if ((so
->so_options
& SO_ACCEPTCONN
) == 0) {
219 if ((so
->so_options
& SO_ACCEPTFILTER
) == 0) {
224 memset(&afa
, 0, sizeof(afa
));
225 strcpy(afa
.af_name
, so
->so_accf
->so_accept_filter
->accf_name
);
226 if (so
->so_accf
->so_accept_filter_str
!= NULL
)
227 strcpy(afa
.af_arg
, so
->so_accf
->so_accept_filter_str
);
228 error
= sockopt_set(sopt
, &afa
, sizeof(afa
));
234 * Simple delete case, with socket locked.
237 accept_filt_clear(struct socket
*so
)
239 struct accept_filter_arg afa
;
240 struct accept_filter
*afp
;
241 struct socket
*so2
, *next
;
244 KASSERT(solocked(so
));
246 if ((so
->so_options
& SO_ACCEPTCONN
) == 0) {
249 if (so
->so_accf
!= NULL
) {
250 /* Break in-flight processing. */
251 for (so2
= TAILQ_FIRST(&so
->so_q0
); so2
!= NULL
; so2
= next
) {
252 next
= TAILQ_NEXT(so2
, so_qe
);
253 if (so2
->so_upcall
== NULL
) {
256 so2
->so_upcall
= NULL
;
257 so2
->so_upcallarg
= NULL
;
258 so2
->so_options
&= ~SO_ACCEPTFILTER
;
259 so2
->so_rcv
.sb_flags
&= ~SB_UPCALL
;
263 afp
= af
->so_accept_filter
;
264 if (afp
!= NULL
&& afp
->accf_destroy
!= NULL
) {
265 (*afp
->accf_destroy
)(so
);
267 if (af
->so_accept_filter_str
!= NULL
) {
268 kmem_free(af
->so_accept_filter_str
,
269 sizeof(afa
.af_name
));
271 kmem_free(af
, sizeof(*af
));
273 atomic_dec_uint(&afp
->accf_refcnt
);
275 so
->so_options
&= ~SO_ACCEPTFILTER
;
280 * setsockopt() for accept filters. Called with the socket unlocked,
281 * will always return it locked.
284 accept_filt_setopt(struct socket
*so
, const struct sockopt
*sopt
)
286 struct accept_filter_arg afa
;
287 struct accept_filter
*afp
;
288 struct so_accf
*newaf
;
291 if (sopt
== NULL
|| sopt
->sopt_size
== 0) {
293 return accept_filt_clear(so
);
297 * Pre-allocate any memory we may need later to avoid blocking at
298 * untimely moments. This does not optimize for invalid arguments.
300 error
= sockopt_get(sopt
, &afa
, sizeof(afa
));
305 afa
.af_name
[sizeof(afa
.af_name
)-1] = '\0';
306 afa
.af_arg
[sizeof(afa
.af_arg
)-1] = '\0';
307 afp
= accept_filt_get(afa
.af_name
);
313 * Allocate the new accept filter instance storage. We may
314 * have to free it again later if we fail to attach it. If
315 * attached properly, 'newaf' is NULLed to avoid a free()
318 newaf
= kmem_zalloc(sizeof(*newaf
), KM_SLEEP
);
319 if (afp
->accf_create
!= NULL
&& afa
.af_name
[0] != '\0') {
321 * FreeBSD did a variable-size allocation here
322 * with the actual string length from afa.af_name
323 * but it is so short, why bother tracking it?
324 * XXX as others have noted, this is an API mistake;
325 * XXX accept_filter_arg should have a mandatory namelen.
326 * XXX (but it's a bit too late to fix that now)
328 newaf
->so_accept_filter_str
=
329 kmem_alloc(sizeof(afa
.af_name
), KM_SLEEP
);
330 strcpy(newaf
->so_accept_filter_str
, afa
.af_name
);
334 * Require a listen socket; don't try to replace an existing filter
335 * without first removing it.
338 if ((so
->so_options
& SO_ACCEPTCONN
) == 0 || so
->so_accf
!= NULL
) {
344 * Invoke the accf_create() method of the filter if required. The
345 * socket lock is held over this call, so create methods for filters
348 if (afp
->accf_create
!= NULL
) {
349 newaf
->so_accept_filter_arg
=
350 (*afp
->accf_create
)(so
, afa
.af_arg
);
351 if (newaf
->so_accept_filter_arg
== NULL
) {
356 newaf
->so_accept_filter
= afp
;
358 so
->so_options
|= SO_ACCEPTFILTER
;
362 if (newaf
->so_accept_filter_str
!= NULL
)
363 kmem_free(newaf
->so_accept_filter_str
,
364 sizeof(afa
.af_name
));
365 kmem_free(newaf
, sizeof(*newaf
));
366 atomic_dec_uint(&afp
->accf_refcnt
);