bpf.c revision 1.185 1 1.185 dholland /* $NetBSD: bpf.c,v 1.185 2014/07/25 08:10:40 dholland Exp $ */
2 1.13 cgd
3 1.12 mycroft /*
4 1.12 mycroft * Copyright (c) 1990, 1991, 1993
5 1.12 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from the Stanford/CMU enet packet filter,
8 1.1 cgd * (net/enet.c) distributed as part of 4.3BSD, and code contributed
9 1.36 christos * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
10 1.2 cgd * Berkeley Laboratory.
11 1.1 cgd *
12 1.1 cgd * Redistribution and use in source and binary forms, with or without
13 1.1 cgd * modification, are permitted provided that the following conditions
14 1.1 cgd * are met:
15 1.1 cgd * 1. Redistributions of source code must retain the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer.
17 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
18 1.1 cgd * notice, this list of conditions and the following disclaimer in the
19 1.1 cgd * documentation and/or other materials provided with the distribution.
20 1.83 agc * 3. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd *
36 1.39 fvdl * @(#)bpf.c 8.4 (Berkeley) 1/9/95
37 1.36 christos * static char rcsid[] =
38 1.36 christos * "Header: bpf.c,v 1.67 96/09/26 22:00:52 leres Exp ";
39 1.1 cgd */
40 1.63 lukem
41 1.63 lukem #include <sys/cdefs.h>
42 1.185 dholland __KERNEL_RCSID(0, "$NetBSD: bpf.c,v 1.185 2014/07/25 08:10:40 dholland Exp $");
43 1.127 christos
44 1.127 christos #if defined(_KERNEL_OPT)
45 1.127 christos #include "opt_bpf.h"
46 1.127 christos #include "sl.h"
47 1.127 christos #include "strip.h"
48 1.127 christos #endif
49 1.1 cgd
50 1.1 cgd #include <sys/param.h>
51 1.1 cgd #include <sys/systm.h>
52 1.1 cgd #include <sys/mbuf.h>
53 1.1 cgd #include <sys/buf.h>
54 1.12 mycroft #include <sys/time.h>
55 1.1 cgd #include <sys/proc.h>
56 1.1 cgd #include <sys/ioctl.h>
57 1.25 christos #include <sys/conf.h>
58 1.51 enami #include <sys/vnode.h>
59 1.105 christos #include <sys/queue.h>
60 1.145 christos #include <sys/stat.h>
61 1.154 pooka #include <sys/module.h>
62 1.154 pooka #include <sys/once.h>
63 1.155 pooka #include <sys/atomic.h>
64 1.11 deraadt
65 1.1 cgd #include <sys/file.h>
66 1.105 christos #include <sys/filedesc.h>
67 1.1 cgd #include <sys/tty.h>
68 1.1 cgd #include <sys/uio.h>
69 1.11 deraadt
70 1.1 cgd #include <sys/protosw.h>
71 1.1 cgd #include <sys/socket.h>
72 1.30 mycroft #include <sys/errno.h>
73 1.30 mycroft #include <sys/kernel.h>
74 1.30 mycroft #include <sys/poll.h>
75 1.89 jonathan #include <sys/sysctl.h>
76 1.117 elad #include <sys/kauth.h>
77 1.30 mycroft
78 1.11 deraadt #include <net/if.h>
79 1.104 christos #include <net/slip.h>
80 1.8 mycroft
81 1.1 cgd #include <net/bpf.h>
82 1.1 cgd #include <net/bpfdesc.h>
83 1.173 alnsn #include <net/bpfjit.h>
84 1.1 cgd
85 1.35 scottr #include <net/if_arc.h>
86 1.34 is #include <net/if_ether.h>
87 1.34 is
88 1.12 mycroft #include <netinet/in.h>
89 1.34 is #include <netinet/if_inarp.h>
90 1.65 wrstuden
91 1.127 christos
92 1.127 christos #include <compat/sys/sockio.h>
93 1.11 deraadt
94 1.55 jonathan #ifndef BPF_BUFSIZE
95 1.87 jonathan /*
96 1.87 jonathan * 4096 is too small for FDDI frames. 8192 is too small for gigabit Ethernet
97 1.87 jonathan * jumbos (circa 9k), ATM, or Intel gig/10gig ethernet jumbos (16k).
98 1.87 jonathan */
99 1.87 jonathan # define BPF_BUFSIZE 32768
100 1.55 jonathan #endif
101 1.1 cgd
102 1.12 mycroft #define PRINET 26 /* interruptible */
103 1.2 cgd
104 1.1 cgd /*
105 1.89 jonathan * The default read buffer size, and limit for BIOCSBLEN, is sysctl'able.
106 1.89 jonathan * XXX the default values should be computed dynamically based
107 1.89 jonathan * on available memory size and available mbuf clusters.
108 1.1 cgd */
109 1.2 cgd int bpf_bufsize = BPF_BUFSIZE;
110 1.89 jonathan int bpf_maxbufsize = BPF_DFLTBUFSIZE; /* XXX set dynamically, see above */
111 1.173 alnsn bool bpf_jit = false;
112 1.173 alnsn
113 1.173 alnsn struct bpfjit_ops bpfjit_module_ops = {
114 1.173 alnsn .bj_generate_code = NULL,
115 1.173 alnsn .bj_free_code = NULL
116 1.173 alnsn };
117 1.1 cgd
118 1.110 rpaulo /*
119 1.110 rpaulo * Global BPF statistics returned by net.bpf.stats sysctl.
120 1.110 rpaulo */
121 1.110 rpaulo struct bpf_stat bpf_gstats;
122 1.110 rpaulo
123 1.110 rpaulo /*
124 1.110 rpaulo * Use a mutex to avoid a race condition between gathering the stats/peers
125 1.110 rpaulo * and opening/closing the device.
126 1.110 rpaulo */
127 1.130 xtraeme static kmutex_t bpf_mtx;
128 1.110 rpaulo
129 1.1 cgd /*
130 1.1 cgd * bpf_iflist is the list of interfaces; each corresponds to an ifnet
131 1.1 cgd * bpf_dtab holds the descriptors, indexed by minor device #
132 1.1 cgd */
133 1.12 mycroft struct bpf_if *bpf_iflist;
134 1.105 christos LIST_HEAD(, bpf_d) bpf_list;
135 1.1 cgd
136 1.103 christos static int bpf_allocbufs(struct bpf_d *);
137 1.101 dyoung static void bpf_deliver(struct bpf_if *,
138 1.137 christos void *(*cpfn)(void *, const void *, size_t),
139 1.169 rmind void *, u_int, u_int, const bool);
140 1.103 christos static void bpf_freed(struct bpf_d *);
141 1.103 christos static void bpf_ifname(struct ifnet *, struct ifreq *);
142 1.137 christos static void *bpf_mcpy(void *, const void *, size_t);
143 1.160 christos static int bpf_movein(struct uio *, int, uint64_t,
144 1.103 christos struct mbuf **, struct sockaddr *);
145 1.103 christos static void bpf_attachd(struct bpf_d *, struct bpf_if *);
146 1.103 christos static void bpf_detachd(struct bpf_d *);
147 1.103 christos static int bpf_setif(struct bpf_d *, struct ifreq *);
148 1.103 christos static void bpf_timed_out(void *);
149 1.114 perry static inline void
150 1.103 christos bpf_wakeup(struct bpf_d *);
151 1.166 bouyer static int bpf_hdrlen(struct bpf_d *);
152 1.103 christos static void catchpacket(struct bpf_d *, u_char *, u_int, u_int,
153 1.142 christos void *(*)(void *, const void *, size_t), struct timespec *);
154 1.103 christos static void reset_d(struct bpf_d *);
155 1.103 christos static int bpf_getdltlist(struct bpf_d *, struct bpf_dltlist *);
156 1.103 christos static int bpf_setdlt(struct bpf_d *, u_int);
157 1.12 mycroft
158 1.117 elad static int bpf_read(struct file *, off_t *, struct uio *, kauth_cred_t,
159 1.105 christos int);
160 1.117 elad static int bpf_write(struct file *, off_t *, struct uio *, kauth_cred_t,
161 1.105 christos int);
162 1.135 ad static int bpf_ioctl(struct file *, u_long, void *);
163 1.135 ad static int bpf_poll(struct file *, int);
164 1.145 christos static int bpf_stat(struct file *, struct stat *);
165 1.135 ad static int bpf_close(struct file *);
166 1.105 christos static int bpf_kqfilter(struct file *, struct knote *);
167 1.139 ad static void bpf_softintr(void *);
168 1.105 christos
169 1.105 christos static const struct fileops bpf_fileops = {
170 1.144 ad .fo_read = bpf_read,
171 1.144 ad .fo_write = bpf_write,
172 1.144 ad .fo_ioctl = bpf_ioctl,
173 1.144 ad .fo_fcntl = fnullop_fcntl,
174 1.144 ad .fo_poll = bpf_poll,
175 1.145 christos .fo_stat = bpf_stat,
176 1.144 ad .fo_close = bpf_close,
177 1.144 ad .fo_kqfilter = bpf_kqfilter,
178 1.150 dsl .fo_restart = fnullop_restart,
179 1.105 christos };
180 1.105 christos
181 1.67 gehenna dev_type_open(bpfopen);
182 1.67 gehenna
183 1.67 gehenna const struct cdevsw bpf_cdevsw = {
184 1.182 dholland .d_open = bpfopen,
185 1.182 dholland .d_close = noclose,
186 1.182 dholland .d_read = noread,
187 1.182 dholland .d_write = nowrite,
188 1.182 dholland .d_ioctl = noioctl,
189 1.182 dholland .d_stop = nostop,
190 1.182 dholland .d_tty = notty,
191 1.182 dholland .d_poll = nopoll,
192 1.182 dholland .d_mmap = nommap,
193 1.182 dholland .d_kqfilter = nokqfilter,
194 1.185 dholland .d_discard = nodiscard,
195 1.182 dholland .d_flag = D_OTHER
196 1.67 gehenna };
197 1.67 gehenna
198 1.178 rmind bpfjit_func_t
199 1.178 rmind bpf_jit_generate(bpf_ctx_t *bc, void *code, size_t size)
200 1.178 rmind {
201 1.183 alnsn
202 1.178 rmind membar_consumer();
203 1.178 rmind if (bpfjit_module_ops.bj_generate_code != NULL) {
204 1.178 rmind return bpfjit_module_ops.bj_generate_code(bc, code, size);
205 1.178 rmind }
206 1.178 rmind return NULL;
207 1.178 rmind }
208 1.178 rmind
209 1.178 rmind void
210 1.178 rmind bpf_jit_freecode(bpfjit_func_t jcode)
211 1.178 rmind {
212 1.178 rmind KASSERT(bpfjit_module_ops.bj_free_code != NULL);
213 1.178 rmind bpfjit_module_ops.bj_free_code(jcode);
214 1.178 rmind }
215 1.178 rmind
216 1.12 mycroft static int
217 1.160 christos bpf_movein(struct uio *uio, int linktype, uint64_t mtu, struct mbuf **mp,
218 1.111 rpaulo struct sockaddr *sockp)
219 1.12 mycroft {
220 1.12 mycroft struct mbuf *m;
221 1.12 mycroft int error;
222 1.160 christos size_t len;
223 1.160 christos size_t hlen;
224 1.160 christos size_t align;
225 1.12 mycroft
226 1.12 mycroft /*
227 1.12 mycroft * Build a sockaddr based on the data link layer type.
228 1.12 mycroft * We do this at this level because the ethernet header
229 1.12 mycroft * is copied directly into the data field of the sockaddr.
230 1.12 mycroft * In the case of SLIP, there is no header and the packet
231 1.12 mycroft * is forwarded as is.
232 1.12 mycroft * Also, we are careful to leave room at the front of the mbuf
233 1.12 mycroft * for the link level header.
234 1.12 mycroft */
235 1.12 mycroft switch (linktype) {
236 1.12 mycroft
237 1.12 mycroft case DLT_SLIP:
238 1.12 mycroft sockp->sa_family = AF_INET;
239 1.12 mycroft hlen = 0;
240 1.36 christos align = 0;
241 1.12 mycroft break;
242 1.12 mycroft
243 1.12 mycroft case DLT_PPP:
244 1.12 mycroft sockp->sa_family = AF_UNSPEC;
245 1.12 mycroft hlen = 0;
246 1.36 christos align = 0;
247 1.12 mycroft break;
248 1.12 mycroft
249 1.12 mycroft case DLT_EN10MB:
250 1.12 mycroft sockp->sa_family = AF_UNSPEC;
251 1.12 mycroft /* XXX Would MAXLINKHDR be better? */
252 1.36 christos /* 6(dst)+6(src)+2(type) */
253 1.12 mycroft hlen = sizeof(struct ether_header);
254 1.36 christos align = 2;
255 1.17 glass break;
256 1.17 glass
257 1.17 glass case DLT_ARCNET:
258 1.17 glass sockp->sa_family = AF_UNSPEC;
259 1.17 glass hlen = ARC_HDRLEN;
260 1.36 christos align = 5;
261 1.12 mycroft break;
262 1.12 mycroft
263 1.12 mycroft case DLT_FDDI:
264 1.56 matt sockp->sa_family = AF_LINK;
265 1.56 matt /* XXX 4(FORMAC)+6(dst)+6(src) */
266 1.56 matt hlen = 16;
267 1.36 christos align = 0;
268 1.62 bjh21 break;
269 1.62 bjh21
270 1.62 bjh21 case DLT_ECONET:
271 1.62 bjh21 sockp->sa_family = AF_UNSPEC;
272 1.62 bjh21 hlen = 6;
273 1.62 bjh21 align = 2;
274 1.12 mycroft break;
275 1.12 mycroft
276 1.12 mycroft case DLT_NULL:
277 1.12 mycroft sockp->sa_family = AF_UNSPEC;
278 1.12 mycroft hlen = 0;
279 1.36 christos align = 0;
280 1.12 mycroft break;
281 1.12 mycroft
282 1.12 mycroft default:
283 1.12 mycroft return (EIO);
284 1.12 mycroft }
285 1.12 mycroft
286 1.12 mycroft len = uio->uio_resid;
287 1.36 christos /*
288 1.36 christos * If there aren't enough bytes for a link level header or the
289 1.36 christos * packet length exceeds the interface mtu, return an error.
290 1.36 christos */
291 1.160 christos if (len - hlen > mtu)
292 1.36 christos return (EMSGSIZE);
293 1.36 christos
294 1.36 christos /*
295 1.36 christos * XXX Avoid complicated buffer chaining ---
296 1.36 christos * bail if it won't fit in a single mbuf.
297 1.36 christos * (Take into account possible alignment bytes)
298 1.36 christos */
299 1.160 christos if (len + align > MCLBYTES)
300 1.12 mycroft return (EIO);
301 1.12 mycroft
302 1.77 matt m = m_gethdr(M_WAIT, MT_DATA);
303 1.20 mycroft m->m_pkthdr.rcvif = 0;
304 1.160 christos m->m_pkthdr.len = (int)(len - hlen);
305 1.160 christos if (len + align > MHLEN) {
306 1.77 matt m_clget(m, M_WAIT);
307 1.12 mycroft if ((m->m_flags & M_EXT) == 0) {
308 1.12 mycroft error = ENOBUFS;
309 1.12 mycroft goto bad;
310 1.12 mycroft }
311 1.12 mycroft }
312 1.36 christos
313 1.36 christos /* Insure the data is properly aligned */
314 1.36 christos if (align > 0) {
315 1.36 christos m->m_data += align;
316 1.160 christos m->m_len -= (int)align;
317 1.36 christos }
318 1.36 christos
319 1.103 christos error = uiomove(mtod(m, void *), len, uio);
320 1.36 christos if (error)
321 1.36 christos goto bad;
322 1.12 mycroft if (hlen != 0) {
323 1.103 christos memcpy(sockp->sa_data, mtod(m, void *), hlen);
324 1.12 mycroft m->m_data += hlen; /* XXX */
325 1.36 christos len -= hlen;
326 1.12 mycroft }
327 1.160 christos m->m_len = (int)len;
328 1.36 christos *mp = m;
329 1.38 mycroft return (0);
330 1.38 mycroft
331 1.38 mycroft bad:
332 1.12 mycroft m_freem(m);
333 1.12 mycroft return (error);
334 1.12 mycroft }
335 1.1 cgd
336 1.1 cgd /*
337 1.2 cgd * Attach file to the bpf interface, i.e. make d listen on bp.
338 1.61 thorpej * Must be called at splnet.
339 1.1 cgd */
340 1.1 cgd static void
341 1.111 rpaulo bpf_attachd(struct bpf_d *d, struct bpf_if *bp)
342 1.1 cgd {
343 1.2 cgd /*
344 1.2 cgd * Point d at bp, and add d to the interface's list of listeners.
345 1.2 cgd * Finally, point the driver's bpf cookie at the interface so
346 1.2 cgd * it will divert packets to bpf.
347 1.2 cgd */
348 1.1 cgd d->bd_bif = bp;
349 1.1 cgd d->bd_next = bp->bif_dlist;
350 1.1 cgd bp->bif_dlist = d;
351 1.1 cgd
352 1.1 cgd *bp->bif_driverp = bp;
353 1.1 cgd }
354 1.1 cgd
355 1.2 cgd /*
356 1.2 cgd * Detach a file from its interface.
357 1.2 cgd */
358 1.1 cgd static void
359 1.111 rpaulo bpf_detachd(struct bpf_d *d)
360 1.1 cgd {
361 1.1 cgd struct bpf_d **p;
362 1.1 cgd struct bpf_if *bp;
363 1.1 cgd
364 1.1 cgd bp = d->bd_bif;
365 1.1 cgd /*
366 1.1 cgd * Check if this descriptor had requested promiscuous mode.
367 1.1 cgd * If so, turn it off.
368 1.1 cgd */
369 1.1 cgd if (d->bd_promisc) {
370 1.180 christos int error __diagused;
371 1.18 mycroft
372 1.1 cgd d->bd_promisc = 0;
373 1.36 christos /*
374 1.36 christos * Take device out of promiscuous mode. Since we were
375 1.36 christos * able to enter promiscuous mode, we should be able
376 1.36 christos * to turn it off. But we can get an error if
377 1.36 christos * the interface was configured down, so only panic
378 1.36 christos * if we don't get an unexpected error.
379 1.36 christos */
380 1.36 christos error = ifpromisc(bp->bif_ifp, 0);
381 1.180 christos #ifdef DIAGNOSTIC
382 1.180 christos if (error)
383 1.180 christos printf("%s: ifpromisc failed: %d", __func__, error);
384 1.180 christos #endif
385 1.1 cgd }
386 1.2 cgd /* Remove d from the interface's descriptor list. */
387 1.1 cgd p = &bp->bif_dlist;
388 1.1 cgd while (*p != d) {
389 1.1 cgd p = &(*p)->bd_next;
390 1.1 cgd if (*p == 0)
391 1.147 christos panic("%s: descriptor not in list", __func__);
392 1.1 cgd }
393 1.1 cgd *p = (*p)->bd_next;
394 1.1 cgd if (bp->bif_dlist == 0)
395 1.1 cgd /*
396 1.1 cgd * Let the driver know that there are no more listeners.
397 1.1 cgd */
398 1.1 cgd *d->bd_bif->bif_driverp = 0;
399 1.1 cgd d->bd_bif = 0;
400 1.1 cgd }
401 1.1 cgd
402 1.154 pooka static int
403 1.154 pooka doinit(void)
404 1.154 pooka {
405 1.154 pooka
406 1.154 pooka mutex_init(&bpf_mtx, MUTEX_DEFAULT, IPL_NONE);
407 1.154 pooka
408 1.154 pooka LIST_INIT(&bpf_list);
409 1.154 pooka
410 1.154 pooka bpf_gstats.bs_recv = 0;
411 1.154 pooka bpf_gstats.bs_drop = 0;
412 1.154 pooka bpf_gstats.bs_capt = 0;
413 1.154 pooka
414 1.154 pooka return 0;
415 1.154 pooka }
416 1.1 cgd
417 1.1 cgd /*
418 1.46 bouyer * bpfilterattach() is called at boot time.
419 1.46 bouyer */
420 1.46 bouyer /* ARGSUSED */
421 1.46 bouyer void
422 1.125 christos bpfilterattach(int n)
423 1.46 bouyer {
424 1.154 pooka static ONCE_DECL(control);
425 1.151 pooka
426 1.154 pooka RUN_ONCE(&control, doinit);
427 1.46 bouyer }
428 1.46 bouyer
429 1.46 bouyer /*
430 1.105 christos * Open ethernet device. Clones.
431 1.1 cgd */
432 1.1 cgd /* ARGSUSED */
433 1.1 cgd int
434 1.125 christos bpfopen(dev_t dev, int flag, int mode, struct lwp *l)
435 1.1 cgd {
436 1.53 augustss struct bpf_d *d;
437 1.105 christos struct file *fp;
438 1.105 christos int error, fd;
439 1.12 mycroft
440 1.105 christos /* falloc() will use the descriptor for us. */
441 1.135 ad if ((error = fd_allocfile(&fp, &fd)) != 0)
442 1.105 christos return error;
443 1.2 cgd
444 1.141 christos d = malloc(sizeof(*d), M_DEVBUF, M_WAITOK|M_ZERO);
445 1.2 cgd d->bd_bufsize = bpf_bufsize;
446 1.91 darrenr d->bd_seesent = 1;
447 1.156 christos d->bd_feedback = 0;
448 1.112 christos d->bd_pid = l->l_proc->p_pid;
449 1.166 bouyer #ifdef _LP64
450 1.166 bouyer if (curproc->p_flag & PK_32)
451 1.166 bouyer d->bd_compat32 = 1;
452 1.166 bouyer #endif
453 1.145 christos getnanotime(&d->bd_btime);
454 1.145 christos d->bd_atime = d->bd_mtime = d->bd_btime;
455 1.129 ad callout_init(&d->bd_callout, 0);
456 1.134 rmind selinit(&d->bd_sel);
457 1.139 ad d->bd_sih = softint_establish(SOFTINT_CLOCK, bpf_softintr, d);
458 1.173 alnsn d->bd_jitcode = NULL;
459 1.1 cgd
460 1.130 xtraeme mutex_enter(&bpf_mtx);
461 1.105 christos LIST_INSERT_HEAD(&bpf_list, d, bd_list);
462 1.130 xtraeme mutex_exit(&bpf_mtx);
463 1.105 christos
464 1.135 ad return fd_clone(fp, fd, flag, &bpf_fileops, d);
465 1.1 cgd }
466 1.1 cgd
467 1.1 cgd /*
468 1.1 cgd * Close the descriptor by detaching it from its interface,
469 1.1 cgd * deallocating its buffers, and marking it free.
470 1.1 cgd */
471 1.1 cgd /* ARGSUSED */
472 1.105 christos static int
473 1.135 ad bpf_close(struct file *fp)
474 1.1 cgd {
475 1.105 christos struct bpf_d *d = fp->f_data;
476 1.53 augustss int s;
477 1.1 cgd
478 1.140 ad KERNEL_LOCK(1, NULL);
479 1.140 ad
480 1.110 rpaulo /*
481 1.110 rpaulo * Refresh the PID associated with this bpf file.
482 1.110 rpaulo */
483 1.135 ad d->bd_pid = curproc->p_pid;
484 1.110 rpaulo
485 1.61 thorpej s = splnet();
486 1.91 darrenr if (d->bd_state == BPF_WAITING)
487 1.91 darrenr callout_stop(&d->bd_callout);
488 1.91 darrenr d->bd_state = BPF_IDLE;
489 1.1 cgd if (d->bd_bif)
490 1.1 cgd bpf_detachd(d);
491 1.1 cgd splx(s);
492 1.2 cgd bpf_freed(d);
493 1.130 xtraeme mutex_enter(&bpf_mtx);
494 1.105 christos LIST_REMOVE(d, bd_list);
495 1.130 xtraeme mutex_exit(&bpf_mtx);
496 1.129 ad callout_destroy(&d->bd_callout);
497 1.134 rmind seldestroy(&d->bd_sel);
498 1.139 ad softint_disestablish(d->bd_sih);
499 1.105 christos free(d, M_DEVBUF);
500 1.105 christos fp->f_data = NULL;
501 1.2 cgd
502 1.140 ad KERNEL_UNLOCK_ONE(NULL);
503 1.140 ad
504 1.2 cgd return (0);
505 1.2 cgd }
506 1.2 cgd
507 1.2 cgd /*
508 1.1 cgd * Rotate the packet buffers in descriptor d. Move the store buffer
509 1.12 mycroft * into the hold slot, and the free buffer into the store slot.
510 1.1 cgd * Zero the length of the new store buffer.
511 1.1 cgd */
512 1.1 cgd #define ROTATE_BUFFERS(d) \
513 1.100 darrenr (d)->bd_hbuf = (d)->bd_sbuf; \
514 1.100 darrenr (d)->bd_hlen = (d)->bd_slen; \
515 1.100 darrenr (d)->bd_sbuf = (d)->bd_fbuf; \
516 1.100 darrenr (d)->bd_slen = 0; \
517 1.100 darrenr (d)->bd_fbuf = 0;
518 1.1 cgd /*
519 1.1 cgd * bpfread - read next chunk of packets from buffers
520 1.1 cgd */
521 1.105 christos static int
522 1.125 christos bpf_read(struct file *fp, off_t *offp, struct uio *uio,
523 1.125 christos kauth_cred_t cred, int flags)
524 1.1 cgd {
525 1.105 christos struct bpf_d *d = fp->f_data;
526 1.91 darrenr int timed_out;
527 1.1 cgd int error;
528 1.1 cgd int s;
529 1.1 cgd
530 1.145 christos getnanotime(&d->bd_atime);
531 1.1 cgd /*
532 1.12 mycroft * Restrict application to use a buffer the same size as
533 1.121 martin * the kernel buffers.
534 1.1 cgd */
535 1.1 cgd if (uio->uio_resid != d->bd_bufsize)
536 1.1 cgd return (EINVAL);
537 1.1 cgd
538 1.140 ad KERNEL_LOCK(1, NULL);
539 1.61 thorpej s = splnet();
540 1.91 darrenr if (d->bd_state == BPF_WAITING)
541 1.91 darrenr callout_stop(&d->bd_callout);
542 1.91 darrenr timed_out = (d->bd_state == BPF_TIMED_OUT);
543 1.91 darrenr d->bd_state = BPF_IDLE;
544 1.1 cgd /*
545 1.2 cgd * If the hold buffer is empty, then do a timed sleep, which
546 1.2 cgd * ends when the timeout expires or when enough packets
547 1.2 cgd * have arrived to fill the store buffer.
548 1.1 cgd */
549 1.1 cgd while (d->bd_hbuf == 0) {
550 1.105 christos if (fp->f_flag & FNONBLOCK) {
551 1.93 darrenr if (d->bd_slen == 0) {
552 1.100 darrenr splx(s);
553 1.140 ad KERNEL_UNLOCK_ONE(NULL);
554 1.93 darrenr return (EWOULDBLOCK);
555 1.93 darrenr }
556 1.93 darrenr ROTATE_BUFFERS(d);
557 1.93 darrenr break;
558 1.93 darrenr }
559 1.93 darrenr
560 1.91 darrenr if ((d->bd_immediate || timed_out) && d->bd_slen != 0) {
561 1.1 cgd /*
562 1.1 cgd * A packet(s) either arrived since the previous
563 1.1 cgd * read or arrived while we were asleep.
564 1.1 cgd * Rotate the buffers and return what's here.
565 1.1 cgd */
566 1.1 cgd ROTATE_BUFFERS(d);
567 1.1 cgd break;
568 1.1 cgd }
569 1.103 christos error = tsleep(d, PRINET|PCATCH, "bpf",
570 1.93 darrenr d->bd_rtout);
571 1.12 mycroft if (error == EINTR || error == ERESTART) {
572 1.12 mycroft splx(s);
573 1.140 ad KERNEL_UNLOCK_ONE(NULL);
574 1.12 mycroft return (error);
575 1.12 mycroft }
576 1.12 mycroft if (error == EWOULDBLOCK) {
577 1.12 mycroft /*
578 1.12 mycroft * On a timeout, return what's in the buffer,
579 1.12 mycroft * which may be nothing. If there is something
580 1.12 mycroft * in the store buffer, we can rotate the buffers.
581 1.12 mycroft */
582 1.12 mycroft if (d->bd_hbuf)
583 1.1 cgd /*
584 1.12 mycroft * We filled up the buffer in between
585 1.12 mycroft * getting the timeout and arriving
586 1.12 mycroft * here, so we don't need to rotate.
587 1.1 cgd */
588 1.1 cgd break;
589 1.12 mycroft
590 1.100 darrenr if (d->bd_slen == 0) {
591 1.100 darrenr splx(s);
592 1.140 ad KERNEL_UNLOCK_ONE(NULL);
593 1.100 darrenr return (0);
594 1.1 cgd }
595 1.100 darrenr ROTATE_BUFFERS(d);
596 1.100 darrenr break;
597 1.1 cgd }
598 1.36 christos if (error != 0)
599 1.100 darrenr goto done;
600 1.1 cgd }
601 1.100 darrenr /*
602 1.100 darrenr * At this point, we know we have something in the hold slot.
603 1.100 darrenr */
604 1.100 darrenr splx(s);
605 1.100 darrenr
606 1.100 darrenr /*
607 1.100 darrenr * Move data from hold buffer into user space.
608 1.100 darrenr * We know the entire buffer is transferred since
609 1.100 darrenr * we checked above that the read buffer is bpf_bufsize bytes.
610 1.100 darrenr */
611 1.100 darrenr error = uiomove(d->bd_hbuf, d->bd_hlen, uio);
612 1.12 mycroft
613 1.100 darrenr s = splnet();
614 1.100 darrenr d->bd_fbuf = d->bd_hbuf;
615 1.100 darrenr d->bd_hbuf = 0;
616 1.100 darrenr d->bd_hlen = 0;
617 1.100 darrenr done:
618 1.100 darrenr splx(s);
619 1.140 ad KERNEL_UNLOCK_ONE(NULL);
620 1.100 darrenr return (error);
621 1.1 cgd }
622 1.1 cgd
623 1.1 cgd
624 1.1 cgd /*
625 1.12 mycroft * If there are processes sleeping on this descriptor, wake them up.
626 1.1 cgd */
627 1.114 perry static inline void
628 1.111 rpaulo bpf_wakeup(struct bpf_d *d)
629 1.1 cgd {
630 1.103 christos wakeup(d);
631 1.85 jdolecek if (d->bd_async)
632 1.139 ad softint_schedule(d->bd_sih);
633 1.134 rmind selnotify(&d->bd_sel, 0, 0);
634 1.1 cgd }
635 1.1 cgd
636 1.139 ad static void
637 1.139 ad bpf_softintr(void *cookie)
638 1.139 ad {
639 1.139 ad struct bpf_d *d;
640 1.139 ad
641 1.139 ad d = cookie;
642 1.139 ad if (d->bd_async)
643 1.139 ad fownsignal(d->bd_pgid, SIGIO, 0, 0, NULL);
644 1.139 ad }
645 1.91 darrenr
646 1.91 darrenr static void
647 1.111 rpaulo bpf_timed_out(void *arg)
648 1.91 darrenr {
649 1.103 christos struct bpf_d *d = arg;
650 1.91 darrenr int s;
651 1.91 darrenr
652 1.91 darrenr s = splnet();
653 1.91 darrenr if (d->bd_state == BPF_WAITING) {
654 1.91 darrenr d->bd_state = BPF_TIMED_OUT;
655 1.91 darrenr if (d->bd_slen != 0)
656 1.91 darrenr bpf_wakeup(d);
657 1.91 darrenr }
658 1.91 darrenr splx(s);
659 1.91 darrenr }
660 1.91 darrenr
661 1.91 darrenr
662 1.105 christos static int
663 1.125 christos bpf_write(struct file *fp, off_t *offp, struct uio *uio,
664 1.125 christos kauth_cred_t cred, int flags)
665 1.1 cgd {
666 1.105 christos struct bpf_d *d = fp->f_data;
667 1.12 mycroft struct ifnet *ifp;
668 1.156 christos struct mbuf *m, *mc;
669 1.12 mycroft int error, s;
670 1.56 matt static struct sockaddr_storage dst;
671 1.1 cgd
672 1.116 mrg m = NULL; /* XXX gcc */
673 1.116 mrg
674 1.140 ad KERNEL_LOCK(1, NULL);
675 1.140 ad
676 1.140 ad if (d->bd_bif == 0) {
677 1.140 ad KERNEL_UNLOCK_ONE(NULL);
678 1.1 cgd return (ENXIO);
679 1.140 ad }
680 1.145 christos getnanotime(&d->bd_mtime);
681 1.1 cgd
682 1.12 mycroft ifp = d->bd_bif->bif_ifp;
683 1.11 deraadt
684 1.140 ad if (uio->uio_resid == 0) {
685 1.140 ad KERNEL_UNLOCK_ONE(NULL);
686 1.12 mycroft return (0);
687 1.140 ad }
688 1.11 deraadt
689 1.56 matt error = bpf_movein(uio, (int)d->bd_bif->bif_dlt, ifp->if_mtu, &m,
690 1.56 matt (struct sockaddr *) &dst);
691 1.140 ad if (error) {
692 1.140 ad KERNEL_UNLOCK_ONE(NULL);
693 1.12 mycroft return (error);
694 1.140 ad }
695 1.11 deraadt
696 1.109 peter if (m->m_pkthdr.len > ifp->if_mtu) {
697 1.140 ad KERNEL_UNLOCK_ONE(NULL);
698 1.109 peter m_freem(m);
699 1.1 cgd return (EMSGSIZE);
700 1.109 peter }
701 1.1 cgd
702 1.40 thorpej if (d->bd_hdrcmplt)
703 1.56 matt dst.ss_family = pseudo_AF_HDRCMPLT;
704 1.40 thorpej
705 1.156 christos if (d->bd_feedback) {
706 1.156 christos mc = m_dup(m, 0, M_COPYALL, M_NOWAIT);
707 1.156 christos if (mc != NULL)
708 1.156 christos mc->m_pkthdr.rcvif = ifp;
709 1.156 christos /* Set M_PROMISC for outgoing packets to be discarded. */
710 1.156 christos if (1 /*d->bd_direction == BPF_D_INOUT*/)
711 1.156 christos m->m_flags |= M_PROMISC;
712 1.156 christos } else
713 1.156 christos mc = NULL;
714 1.156 christos
715 1.21 mycroft s = splsoftnet();
716 1.56 matt error = (*ifp->if_output)(ifp, m, (struct sockaddr *) &dst, NULL);
717 1.156 christos
718 1.156 christos if (mc != NULL) {
719 1.156 christos if (error == 0)
720 1.156 christos (*ifp->if_input)(ifp, mc);
721 1.156 christos m_freem(mc);
722 1.167 christos }
723 1.1 cgd splx(s);
724 1.140 ad KERNEL_UNLOCK_ONE(NULL);
725 1.1 cgd /*
726 1.12 mycroft * The driver frees the mbuf.
727 1.1 cgd */
728 1.1 cgd return (error);
729 1.1 cgd }
730 1.1 cgd
731 1.1 cgd /*
732 1.2 cgd * Reset a descriptor by flushing its packet buffer and clearing the
733 1.61 thorpej * receive and drop counts. Should be called at splnet.
734 1.1 cgd */
735 1.1 cgd static void
736 1.111 rpaulo reset_d(struct bpf_d *d)
737 1.1 cgd {
738 1.1 cgd if (d->bd_hbuf) {
739 1.1 cgd /* Free the hold buffer. */
740 1.1 cgd d->bd_fbuf = d->bd_hbuf;
741 1.1 cgd d->bd_hbuf = 0;
742 1.1 cgd }
743 1.1 cgd d->bd_slen = 0;
744 1.2 cgd d->bd_hlen = 0;
745 1.1 cgd d->bd_rcount = 0;
746 1.1 cgd d->bd_dcount = 0;
747 1.94 darrenr d->bd_ccount = 0;
748 1.1 cgd }
749 1.1 cgd
750 1.1 cgd /*
751 1.1 cgd * FIONREAD Check for read packet available.
752 1.1 cgd * BIOCGBLEN Get buffer len [for read()].
753 1.1 cgd * BIOCSETF Set ethernet read filter.
754 1.1 cgd * BIOCFLUSH Flush read packet buffer.
755 1.1 cgd * BIOCPROMISC Put interface into promiscuous mode.
756 1.1 cgd * BIOCGDLT Get link layer type.
757 1.1 cgd * BIOCGETIF Get interface name.
758 1.1 cgd * BIOCSETIF Set interface.
759 1.1 cgd * BIOCSRTIMEOUT Set read timeout.
760 1.1 cgd * BIOCGRTIMEOUT Get read timeout.
761 1.1 cgd * BIOCGSTATS Get packet stats.
762 1.1 cgd * BIOCIMMEDIATE Set immediate mode.
763 1.2 cgd * BIOCVERSION Get filter language version.
764 1.113 rpaulo * BIOCGHDRCMPLT Get "header already complete" flag.
765 1.113 rpaulo * BIOCSHDRCMPLT Set "header already complete" flag.
766 1.156 christos * BIOCSFEEDBACK Set packet feedback mode.
767 1.156 christos * BIOCGFEEDBACK Get packet feedback mode.
768 1.156 christos * BIOCGSEESENT Get "see sent packets" mode.
769 1.156 christos * BIOCSSEESENT Set "see sent packets" mode.
770 1.1 cgd */
771 1.1 cgd /* ARGSUSED */
772 1.105 christos static int
773 1.135 ad bpf_ioctl(struct file *fp, u_long cmd, void *addr)
774 1.1 cgd {
775 1.105 christos struct bpf_d *d = fp->f_data;
776 1.1 cgd int s, error = 0;
777 1.1 cgd
778 1.110 rpaulo /*
779 1.110 rpaulo * Refresh the PID associated with this bpf file.
780 1.110 rpaulo */
781 1.140 ad KERNEL_LOCK(1, NULL);
782 1.135 ad d->bd_pid = curproc->p_pid;
783 1.166 bouyer #ifdef _LP64
784 1.166 bouyer if (curproc->p_flag & PK_32)
785 1.166 bouyer d->bd_compat32 = 1;
786 1.166 bouyer else
787 1.166 bouyer d->bd_compat32 = 0;
788 1.166 bouyer #endif
789 1.120 christos
790 1.91 darrenr s = splnet();
791 1.91 darrenr if (d->bd_state == BPF_WAITING)
792 1.91 darrenr callout_stop(&d->bd_callout);
793 1.91 darrenr d->bd_state = BPF_IDLE;
794 1.91 darrenr splx(s);
795 1.91 darrenr
796 1.1 cgd switch (cmd) {
797 1.1 cgd
798 1.1 cgd default:
799 1.1 cgd error = EINVAL;
800 1.1 cgd break;
801 1.1 cgd
802 1.1 cgd /*
803 1.1 cgd * Check for read packet available.
804 1.1 cgd */
805 1.1 cgd case FIONREAD:
806 1.1 cgd {
807 1.1 cgd int n;
808 1.12 mycroft
809 1.61 thorpej s = splnet();
810 1.1 cgd n = d->bd_slen;
811 1.12 mycroft if (d->bd_hbuf)
812 1.1 cgd n += d->bd_hlen;
813 1.1 cgd splx(s);
814 1.1 cgd
815 1.1 cgd *(int *)addr = n;
816 1.1 cgd break;
817 1.1 cgd }
818 1.1 cgd
819 1.1 cgd /*
820 1.2 cgd * Get buffer len [for read()].
821 1.1 cgd */
822 1.2 cgd case BIOCGBLEN:
823 1.2 cgd *(u_int *)addr = d->bd_bufsize;
824 1.1 cgd break;
825 1.2 cgd
826 1.1 cgd /*
827 1.2 cgd * Set buffer length.
828 1.1 cgd */
829 1.2 cgd case BIOCSBLEN:
830 1.2 cgd if (d->bd_bif != 0)
831 1.2 cgd error = EINVAL;
832 1.2 cgd else {
833 1.53 augustss u_int size = *(u_int *)addr;
834 1.2 cgd
835 1.87 jonathan if (size > bpf_maxbufsize)
836 1.87 jonathan *(u_int *)addr = size = bpf_maxbufsize;
837 1.2 cgd else if (size < BPF_MINBUFSIZE)
838 1.2 cgd *(u_int *)addr = size = BPF_MINBUFSIZE;
839 1.2 cgd d->bd_bufsize = size;
840 1.2 cgd }
841 1.1 cgd break;
842 1.1 cgd
843 1.1 cgd /*
844 1.2 cgd * Set link layer read filter.
845 1.1 cgd */
846 1.12 mycroft case BIOCSETF:
847 1.103 christos error = bpf_setf(d, addr);
848 1.1 cgd break;
849 1.1 cgd
850 1.1 cgd /*
851 1.1 cgd * Flush read packet buffer.
852 1.1 cgd */
853 1.1 cgd case BIOCFLUSH:
854 1.61 thorpej s = splnet();
855 1.1 cgd reset_d(d);
856 1.1 cgd splx(s);
857 1.1 cgd break;
858 1.1 cgd
859 1.1 cgd /*
860 1.1 cgd * Put interface into promiscuous mode.
861 1.1 cgd */
862 1.1 cgd case BIOCPROMISC:
863 1.1 cgd if (d->bd_bif == 0) {
864 1.1 cgd /*
865 1.1 cgd * No interface attached yet.
866 1.1 cgd */
867 1.1 cgd error = EINVAL;
868 1.1 cgd break;
869 1.1 cgd }
870 1.61 thorpej s = splnet();
871 1.1 cgd if (d->bd_promisc == 0) {
872 1.1 cgd error = ifpromisc(d->bd_bif->bif_ifp, 1);
873 1.2 cgd if (error == 0)
874 1.2 cgd d->bd_promisc = 1;
875 1.1 cgd }
876 1.1 cgd splx(s);
877 1.1 cgd break;
878 1.1 cgd
879 1.1 cgd /*
880 1.1 cgd * Get device parameters.
881 1.1 cgd */
882 1.1 cgd case BIOCGDLT:
883 1.1 cgd if (d->bd_bif == 0)
884 1.1 cgd error = EINVAL;
885 1.1 cgd else
886 1.1 cgd *(u_int *)addr = d->bd_bif->bif_dlt;
887 1.1 cgd break;
888 1.1 cgd
889 1.1 cgd /*
890 1.66 onoe * Get a list of supported device parameters.
891 1.66 onoe */
892 1.66 onoe case BIOCGDLTLIST:
893 1.66 onoe if (d->bd_bif == 0)
894 1.66 onoe error = EINVAL;
895 1.66 onoe else
896 1.103 christos error = bpf_getdltlist(d, addr);
897 1.66 onoe break;
898 1.66 onoe
899 1.66 onoe /*
900 1.66 onoe * Set device parameters.
901 1.66 onoe */
902 1.66 onoe case BIOCSDLT:
903 1.66 onoe if (d->bd_bif == 0)
904 1.66 onoe error = EINVAL;
905 1.66 onoe else
906 1.66 onoe error = bpf_setdlt(d, *(u_int *)addr);
907 1.66 onoe break;
908 1.66 onoe
909 1.66 onoe /*
910 1.1 cgd * Set interface name.
911 1.1 cgd */
912 1.127 christos #ifdef OBIOCGETIF
913 1.127 christos case OBIOCGETIF:
914 1.127 christos #endif
915 1.1 cgd case BIOCGETIF:
916 1.1 cgd if (d->bd_bif == 0)
917 1.1 cgd error = EINVAL;
918 1.1 cgd else
919 1.103 christos bpf_ifname(d->bd_bif->bif_ifp, addr);
920 1.1 cgd break;
921 1.1 cgd
922 1.1 cgd /*
923 1.1 cgd * Set interface.
924 1.1 cgd */
925 1.127 christos #ifdef OBIOCSETIF
926 1.127 christos case OBIOCSETIF:
927 1.127 christos #endif
928 1.1 cgd case BIOCSETIF:
929 1.103 christos error = bpf_setif(d, addr);
930 1.1 cgd break;
931 1.1 cgd
932 1.1 cgd /*
933 1.1 cgd * Set read timeout.
934 1.1 cgd */
935 1.12 mycroft case BIOCSRTIMEOUT:
936 1.1 cgd {
937 1.103 christos struct timeval *tv = addr;
938 1.1 cgd
939 1.19 cgd /* Compute number of ticks. */
940 1.19 cgd d->bd_rtout = tv->tv_sec * hz + tv->tv_usec / tick;
941 1.33 thorpej if ((d->bd_rtout == 0) && (tv->tv_usec != 0))
942 1.33 thorpej d->bd_rtout = 1;
943 1.1 cgd break;
944 1.1 cgd }
945 1.1 cgd
946 1.142 christos #ifdef BIOCGORTIMEOUT
947 1.142 christos /*
948 1.142 christos * Get read timeout.
949 1.142 christos */
950 1.142 christos case BIOCGORTIMEOUT:
951 1.142 christos {
952 1.142 christos struct timeval50 *tv = addr;
953 1.142 christos
954 1.142 christos tv->tv_sec = d->bd_rtout / hz;
955 1.142 christos tv->tv_usec = (d->bd_rtout % hz) * tick;
956 1.142 christos break;
957 1.142 christos }
958 1.142 christos #endif
959 1.142 christos
960 1.142 christos #ifdef BIOCSORTIMEOUT
961 1.142 christos /*
962 1.142 christos * Set read timeout.
963 1.142 christos */
964 1.142 christos case BIOCSORTIMEOUT:
965 1.142 christos {
966 1.142 christos struct timeval50 *tv = addr;
967 1.142 christos
968 1.142 christos /* Compute number of ticks. */
969 1.142 christos d->bd_rtout = tv->tv_sec * hz + tv->tv_usec / tick;
970 1.142 christos if ((d->bd_rtout == 0) && (tv->tv_usec != 0))
971 1.142 christos d->bd_rtout = 1;
972 1.142 christos break;
973 1.142 christos }
974 1.142 christos #endif
975 1.142 christos
976 1.1 cgd /*
977 1.1 cgd * Get read timeout.
978 1.1 cgd */
979 1.12 mycroft case BIOCGRTIMEOUT:
980 1.1 cgd {
981 1.103 christos struct timeval *tv = addr;
982 1.1 cgd
983 1.19 cgd tv->tv_sec = d->bd_rtout / hz;
984 1.19 cgd tv->tv_usec = (d->bd_rtout % hz) * tick;
985 1.1 cgd break;
986 1.1 cgd }
987 1.1 cgd /*
988 1.1 cgd * Get packet stats.
989 1.1 cgd */
990 1.1 cgd case BIOCGSTATS:
991 1.1 cgd {
992 1.103 christos struct bpf_stat *bs = addr;
993 1.1 cgd
994 1.1 cgd bs->bs_recv = d->bd_rcount;
995 1.1 cgd bs->bs_drop = d->bd_dcount;
996 1.94 darrenr bs->bs_capt = d->bd_ccount;
997 1.94 darrenr break;
998 1.94 darrenr }
999 1.94 darrenr
1000 1.94 darrenr case BIOCGSTATSOLD:
1001 1.94 darrenr {
1002 1.103 christos struct bpf_stat_old *bs = addr;
1003 1.94 darrenr
1004 1.94 darrenr bs->bs_recv = d->bd_rcount;
1005 1.94 darrenr bs->bs_drop = d->bd_dcount;
1006 1.1 cgd break;
1007 1.1 cgd }
1008 1.1 cgd
1009 1.1 cgd /*
1010 1.1 cgd * Set immediate mode.
1011 1.1 cgd */
1012 1.1 cgd case BIOCIMMEDIATE:
1013 1.1 cgd d->bd_immediate = *(u_int *)addr;
1014 1.1 cgd break;
1015 1.2 cgd
1016 1.2 cgd case BIOCVERSION:
1017 1.2 cgd {
1018 1.103 christos struct bpf_version *bv = addr;
1019 1.2 cgd
1020 1.2 cgd bv->bv_major = BPF_MAJOR_VERSION;
1021 1.2 cgd bv->bv_minor = BPF_MINOR_VERSION;
1022 1.2 cgd break;
1023 1.12 mycroft }
1024 1.23 thorpej
1025 1.40 thorpej case BIOCGHDRCMPLT: /* get "header already complete" flag */
1026 1.40 thorpej *(u_int *)addr = d->bd_hdrcmplt;
1027 1.40 thorpej break;
1028 1.40 thorpej
1029 1.40 thorpej case BIOCSHDRCMPLT: /* set "header already complete" flag */
1030 1.40 thorpej d->bd_hdrcmplt = *(u_int *)addr ? 1 : 0;
1031 1.40 thorpej break;
1032 1.23 thorpej
1033 1.91 darrenr /*
1034 1.91 darrenr * Get "see sent packets" flag
1035 1.91 darrenr */
1036 1.91 darrenr case BIOCGSEESENT:
1037 1.91 darrenr *(u_int *)addr = d->bd_seesent;
1038 1.91 darrenr break;
1039 1.91 darrenr
1040 1.91 darrenr /*
1041 1.91 darrenr * Set "see sent" packets flag
1042 1.91 darrenr */
1043 1.91 darrenr case BIOCSSEESENT:
1044 1.91 darrenr d->bd_seesent = *(u_int *)addr;
1045 1.91 darrenr break;
1046 1.91 darrenr
1047 1.156 christos /*
1048 1.156 christos * Set "feed packets from bpf back to input" mode
1049 1.156 christos */
1050 1.156 christos case BIOCSFEEDBACK:
1051 1.156 christos d->bd_feedback = *(u_int *)addr;
1052 1.156 christos break;
1053 1.156 christos
1054 1.156 christos /*
1055 1.156 christos * Get "feed packets from bpf back to input" mode
1056 1.156 christos */
1057 1.156 christos case BIOCGFEEDBACK:
1058 1.156 christos *(u_int *)addr = d->bd_feedback;
1059 1.156 christos break;
1060 1.156 christos
1061 1.23 thorpej case FIONBIO: /* Non-blocking I/O */
1062 1.93 darrenr /*
1063 1.93 darrenr * No need to do anything special as we use IO_NDELAY in
1064 1.93 darrenr * bpfread() as an indication of whether or not to block
1065 1.93 darrenr * the read.
1066 1.93 darrenr */
1067 1.23 thorpej break;
1068 1.23 thorpej
1069 1.23 thorpej case FIOASYNC: /* Send signal on receive packets */
1070 1.23 thorpej d->bd_async = *(int *)addr;
1071 1.23 thorpej break;
1072 1.23 thorpej
1073 1.23 thorpej case TIOCSPGRP: /* Process or group to send signals to */
1074 1.85 jdolecek case FIOSETOWN:
1075 1.135 ad error = fsetown(&d->bd_pgid, cmd, addr);
1076 1.23 thorpej break;
1077 1.23 thorpej
1078 1.23 thorpej case TIOCGPGRP:
1079 1.85 jdolecek case FIOGETOWN:
1080 1.135 ad error = fgetown(d->bd_pgid, cmd, addr);
1081 1.23 thorpej break;
1082 1.1 cgd }
1083 1.140 ad KERNEL_UNLOCK_ONE(NULL);
1084 1.1 cgd return (error);
1085 1.1 cgd }
1086 1.1 cgd
1087 1.12 mycroft /*
1088 1.2 cgd * Set d's packet filter program to fp. If this file already has a filter,
1089 1.1 cgd * free it and replace it. Returns EINVAL for bogus requests.
1090 1.1 cgd */
1091 1.1 cgd int
1092 1.103 christos bpf_setf(struct bpf_d *d, struct bpf_program *fp)
1093 1.1 cgd {
1094 1.1 cgd struct bpf_insn *fcode, *old;
1095 1.178 rmind bpfjit_func_t jcode, oldj;
1096 1.169 rmind size_t flen, size;
1097 1.1 cgd int s;
1098 1.1 cgd
1099 1.173 alnsn jcode = NULL;
1100 1.169 rmind flen = fp->bf_len;
1101 1.169 rmind
1102 1.169 rmind if ((fp->bf_insns == NULL && flen) || flen > BPF_MAXINSNS) {
1103 1.169 rmind return EINVAL;
1104 1.169 rmind }
1105 1.169 rmind
1106 1.169 rmind if (flen) {
1107 1.169 rmind /*
1108 1.169 rmind * Allocate the buffer, copy the byte-code from
1109 1.169 rmind * userspace and validate it.
1110 1.169 rmind */
1111 1.169 rmind size = flen * sizeof(*fp->bf_insns);
1112 1.169 rmind fcode = malloc(size, M_DEVBUF, M_WAITOK);
1113 1.169 rmind if (copyin(fp->bf_insns, fcode, size) != 0 ||
1114 1.169 rmind !bpf_validate(fcode, (int)flen)) {
1115 1.169 rmind free(fcode, M_DEVBUF);
1116 1.169 rmind return EINVAL;
1117 1.169 rmind }
1118 1.173 alnsn membar_consumer();
1119 1.183 alnsn if (bpf_jit)
1120 1.183 alnsn jcode = bpf_jit_generate(NULL, fcode, flen);
1121 1.169 rmind } else {
1122 1.169 rmind fcode = NULL;
1123 1.1 cgd }
1124 1.1 cgd
1125 1.169 rmind s = splnet();
1126 1.169 rmind old = d->bd_filter;
1127 1.169 rmind d->bd_filter = fcode;
1128 1.173 alnsn oldj = d->bd_jitcode;
1129 1.173 alnsn d->bd_jitcode = jcode;
1130 1.169 rmind reset_d(d);
1131 1.169 rmind splx(s);
1132 1.1 cgd
1133 1.169 rmind if (old) {
1134 1.169 rmind free(old, M_DEVBUF);
1135 1.169 rmind }
1136 1.178 rmind if (oldj) {
1137 1.178 rmind bpf_jit_freecode(oldj);
1138 1.173 alnsn }
1139 1.173 alnsn
1140 1.169 rmind return 0;
1141 1.1 cgd }
1142 1.1 cgd
1143 1.1 cgd /*
1144 1.2 cgd * Detach a file from its current interface (if attached at all) and attach
1145 1.2 cgd * to the interface indicated by the name stored in ifr.
1146 1.2 cgd * Return an errno or 0.
1147 1.1 cgd */
1148 1.1 cgd static int
1149 1.103 christos bpf_setif(struct bpf_d *d, struct ifreq *ifr)
1150 1.1 cgd {
1151 1.1 cgd struct bpf_if *bp;
1152 1.1 cgd char *cp;
1153 1.26 thorpej int unit_seen, i, s, error;
1154 1.1 cgd
1155 1.1 cgd /*
1156 1.26 thorpej * Make sure the provided name has a unit number, and default
1157 1.26 thorpej * it to '0' if not specified.
1158 1.26 thorpej * XXX This is ugly ... do this differently?
1159 1.1 cgd */
1160 1.26 thorpej unit_seen = 0;
1161 1.1 cgd cp = ifr->ifr_name;
1162 1.26 thorpej cp[sizeof(ifr->ifr_name) - 1] = '\0'; /* sanity */
1163 1.26 thorpej while (*cp++)
1164 1.26 thorpej if (*cp >= '0' && *cp <= '9')
1165 1.26 thorpej unit_seen = 1;
1166 1.26 thorpej if (!unit_seen) {
1167 1.26 thorpej /* Make sure to leave room for the '\0'. */
1168 1.26 thorpej for (i = 0; i < (IFNAMSIZ - 1); ++i) {
1169 1.26 thorpej if ((ifr->ifr_name[i] >= 'a' &&
1170 1.26 thorpej ifr->ifr_name[i] <= 'z') ||
1171 1.26 thorpej (ifr->ifr_name[i] >= 'A' &&
1172 1.26 thorpej ifr->ifr_name[i] <= 'Z'))
1173 1.26 thorpej continue;
1174 1.26 thorpej ifr->ifr_name[i] = '0';
1175 1.1 cgd }
1176 1.1 cgd }
1177 1.26 thorpej
1178 1.1 cgd /*
1179 1.1 cgd * Look through attached interfaces for the named one.
1180 1.1 cgd */
1181 1.1 cgd for (bp = bpf_iflist; bp != 0; bp = bp->bif_next) {
1182 1.1 cgd struct ifnet *ifp = bp->bif_ifp;
1183 1.1 cgd
1184 1.26 thorpej if (ifp == 0 ||
1185 1.26 thorpej strcmp(ifp->if_xname, ifr->ifr_name) != 0)
1186 1.1 cgd continue;
1187 1.66 onoe /* skip additional entry */
1188 1.152 pooka if (bp->bif_driverp != &ifp->if_bpf)
1189 1.66 onoe continue;
1190 1.1 cgd /*
1191 1.2 cgd * We found the requested interface.
1192 1.2 cgd * Allocate the packet buffers if we need to.
1193 1.2 cgd * If we're already attached to requested interface,
1194 1.2 cgd * just flush the buffer.
1195 1.1 cgd */
1196 1.2 cgd if (d->bd_sbuf == 0) {
1197 1.2 cgd error = bpf_allocbufs(d);
1198 1.2 cgd if (error != 0)
1199 1.2 cgd return (error);
1200 1.2 cgd }
1201 1.61 thorpej s = splnet();
1202 1.1 cgd if (bp != d->bd_bif) {
1203 1.1 cgd if (d->bd_bif)
1204 1.12 mycroft /*
1205 1.1 cgd * Detach if attached to something else.
1206 1.1 cgd */
1207 1.1 cgd bpf_detachd(d);
1208 1.1 cgd
1209 1.1 cgd bpf_attachd(d, bp);
1210 1.1 cgd }
1211 1.1 cgd reset_d(d);
1212 1.1 cgd splx(s);
1213 1.1 cgd return (0);
1214 1.1 cgd }
1215 1.1 cgd /* Not found. */
1216 1.1 cgd return (ENXIO);
1217 1.1 cgd }
1218 1.1 cgd
1219 1.1 cgd /*
1220 1.26 thorpej * Copy the interface name to the ifreq.
1221 1.1 cgd */
1222 1.1 cgd static void
1223 1.103 christos bpf_ifname(struct ifnet *ifp, struct ifreq *ifr)
1224 1.1 cgd {
1225 1.41 perry memcpy(ifr->ifr_name, ifp->if_xname, IFNAMSIZ);
1226 1.1 cgd }
1227 1.1 cgd
1228 1.145 christos static int
1229 1.145 christos bpf_stat(struct file *fp, struct stat *st)
1230 1.145 christos {
1231 1.145 christos struct bpf_d *d = fp->f_data;
1232 1.145 christos
1233 1.145 christos (void)memset(st, 0, sizeof(*st));
1234 1.145 christos KERNEL_LOCK(1, NULL);
1235 1.145 christos st->st_dev = makedev(cdevsw_lookup_major(&bpf_cdevsw), d->bd_pid);
1236 1.145 christos st->st_atimespec = d->bd_atime;
1237 1.145 christos st->st_mtimespec = d->bd_mtime;
1238 1.145 christos st->st_ctimespec = st->st_birthtimespec = d->bd_btime;
1239 1.146 christos st->st_uid = kauth_cred_geteuid(fp->f_cred);
1240 1.146 christos st->st_gid = kauth_cred_getegid(fp->f_cred);
1241 1.164 christos st->st_mode = S_IFCHR;
1242 1.145 christos KERNEL_UNLOCK_ONE(NULL);
1243 1.145 christos return 0;
1244 1.145 christos }
1245 1.145 christos
1246 1.1 cgd /*
1247 1.36 christos * Support for poll() system call
1248 1.1 cgd *
1249 1.64 darrenr * Return true iff the specific operation will not block indefinitely - with
1250 1.64 darrenr * the assumption that it is safe to positively acknowledge a request for the
1251 1.64 darrenr * ability to write to the BPF device.
1252 1.134 rmind * Otherwise, return false but make a note that a selnotify() must be done.
1253 1.1 cgd */
1254 1.105 christos static int
1255 1.135 ad bpf_poll(struct file *fp, int events)
1256 1.1 cgd {
1257 1.105 christos struct bpf_d *d = fp->f_data;
1258 1.61 thorpej int s = splnet();
1259 1.64 darrenr int revents;
1260 1.12 mycroft
1261 1.110 rpaulo /*
1262 1.110 rpaulo * Refresh the PID associated with this bpf file.
1263 1.110 rpaulo */
1264 1.140 ad KERNEL_LOCK(1, NULL);
1265 1.135 ad d->bd_pid = curproc->p_pid;
1266 1.120 christos
1267 1.64 darrenr revents = events & (POLLOUT | POLLWRNORM);
1268 1.44 thorpej if (events & (POLLIN | POLLRDNORM)) {
1269 1.64 darrenr /*
1270 1.64 darrenr * An imitation of the FIONREAD ioctl code.
1271 1.64 darrenr */
1272 1.138 scw if (d->bd_hlen != 0 ||
1273 1.138 scw ((d->bd_immediate || d->bd_state == BPF_TIMED_OUT) &&
1274 1.138 scw d->bd_slen != 0)) {
1275 1.30 mycroft revents |= events & (POLLIN | POLLRDNORM);
1276 1.92 darrenr } else {
1277 1.135 ad selrecord(curlwp, &d->bd_sel);
1278 1.91 darrenr /* Start the read timeout if necessary */
1279 1.91 darrenr if (d->bd_rtout > 0 && d->bd_state == BPF_IDLE) {
1280 1.91 darrenr callout_reset(&d->bd_callout, d->bd_rtout,
1281 1.91 darrenr bpf_timed_out, d);
1282 1.91 darrenr d->bd_state = BPF_WAITING;
1283 1.91 darrenr }
1284 1.91 darrenr }
1285 1.44 thorpej }
1286 1.12 mycroft
1287 1.140 ad KERNEL_UNLOCK_ONE(NULL);
1288 1.12 mycroft splx(s);
1289 1.30 mycroft return (revents);
1290 1.75 jdolecek }
1291 1.75 jdolecek
1292 1.75 jdolecek static void
1293 1.75 jdolecek filt_bpfrdetach(struct knote *kn)
1294 1.75 jdolecek {
1295 1.75 jdolecek struct bpf_d *d = kn->kn_hook;
1296 1.75 jdolecek int s;
1297 1.75 jdolecek
1298 1.140 ad KERNEL_LOCK(1, NULL);
1299 1.75 jdolecek s = splnet();
1300 1.76 christos SLIST_REMOVE(&d->bd_sel.sel_klist, kn, knote, kn_selnext);
1301 1.75 jdolecek splx(s);
1302 1.140 ad KERNEL_UNLOCK_ONE(NULL);
1303 1.75 jdolecek }
1304 1.75 jdolecek
1305 1.75 jdolecek static int
1306 1.125 christos filt_bpfread(struct knote *kn, long hint)
1307 1.75 jdolecek {
1308 1.75 jdolecek struct bpf_d *d = kn->kn_hook;
1309 1.140 ad int rv;
1310 1.75 jdolecek
1311 1.140 ad KERNEL_LOCK(1, NULL);
1312 1.75 jdolecek kn->kn_data = d->bd_hlen;
1313 1.75 jdolecek if (d->bd_immediate)
1314 1.75 jdolecek kn->kn_data += d->bd_slen;
1315 1.140 ad rv = (kn->kn_data > 0);
1316 1.140 ad KERNEL_UNLOCK_ONE(NULL);
1317 1.140 ad return rv;
1318 1.75 jdolecek }
1319 1.75 jdolecek
1320 1.75 jdolecek static const struct filterops bpfread_filtops =
1321 1.75 jdolecek { 1, NULL, filt_bpfrdetach, filt_bpfread };
1322 1.75 jdolecek
1323 1.105 christos static int
1324 1.105 christos bpf_kqfilter(struct file *fp, struct knote *kn)
1325 1.75 jdolecek {
1326 1.105 christos struct bpf_d *d = fp->f_data;
1327 1.75 jdolecek struct klist *klist;
1328 1.75 jdolecek int s;
1329 1.75 jdolecek
1330 1.140 ad KERNEL_LOCK(1, NULL);
1331 1.140 ad
1332 1.75 jdolecek switch (kn->kn_filter) {
1333 1.75 jdolecek case EVFILT_READ:
1334 1.76 christos klist = &d->bd_sel.sel_klist;
1335 1.75 jdolecek kn->kn_fop = &bpfread_filtops;
1336 1.75 jdolecek break;
1337 1.75 jdolecek
1338 1.75 jdolecek default:
1339 1.140 ad KERNEL_UNLOCK_ONE(NULL);
1340 1.131 pooka return (EINVAL);
1341 1.75 jdolecek }
1342 1.75 jdolecek
1343 1.75 jdolecek kn->kn_hook = d;
1344 1.75 jdolecek
1345 1.75 jdolecek s = splnet();
1346 1.75 jdolecek SLIST_INSERT_HEAD(klist, kn, kn_selnext);
1347 1.75 jdolecek splx(s);
1348 1.140 ad KERNEL_UNLOCK_ONE(NULL);
1349 1.75 jdolecek
1350 1.75 jdolecek return (0);
1351 1.1 cgd }
1352 1.1 cgd
1353 1.1 cgd /*
1354 1.1 cgd * Copy data from an mbuf chain into a buffer. This code is derived
1355 1.1 cgd * from m_copydata in sys/uipc_mbuf.c.
1356 1.1 cgd */
1357 1.43 perry static void *
1358 1.137 christos bpf_mcpy(void *dst_arg, const void *src_arg, size_t len)
1359 1.12 mycroft {
1360 1.137 christos const struct mbuf *m;
1361 1.53 augustss u_int count;
1362 1.1 cgd u_char *dst;
1363 1.1 cgd
1364 1.12 mycroft m = src_arg;
1365 1.12 mycroft dst = dst_arg;
1366 1.1 cgd while (len > 0) {
1367 1.137 christos if (m == NULL)
1368 1.41 perry panic("bpf_mcpy");
1369 1.12 mycroft count = min(m->m_len, len);
1370 1.137 christos memcpy(dst, mtod(m, const void *), count);
1371 1.1 cgd m = m->m_next;
1372 1.1 cgd dst += count;
1373 1.1 cgd len -= count;
1374 1.1 cgd }
1375 1.137 christos return dst_arg;
1376 1.1 cgd }
1377 1.1 cgd
1378 1.1 cgd /*
1379 1.96 dyoung * Dispatch a packet to all the listeners on interface bp.
1380 1.96 dyoung *
1381 1.169 rmind * pkt pointer to the packet, either a data buffer or an mbuf chain
1382 1.169 rmind * buflen buffer length, if pkt is a data buffer
1383 1.169 rmind * cpfn a function that can copy pkt into the listener's buffer
1384 1.96 dyoung * pktlen length of the packet
1385 1.169 rmind * rcv true if packet came in
1386 1.96 dyoung */
1387 1.114 perry static inline void
1388 1.137 christos bpf_deliver(struct bpf_if *bp, void *(*cpfn)(void *, const void *, size_t),
1389 1.169 rmind void *pkt, u_int pktlen, u_int buflen, const bool rcv)
1390 1.96 dyoung {
1391 1.183 alnsn struct timespec ts;
1392 1.184 christos bpf_args_t args = {
1393 1.184 christos .pkt = (const uint8_t *)pkt,
1394 1.184 christos .wirelen = pktlen,
1395 1.184 christos .buflen = buflen,
1396 1.184 christos .mem = NULL,
1397 1.184 christos .arg = NULL
1398 1.184 christos };
1399 1.96 dyoung struct bpf_d *d;
1400 1.183 alnsn
1401 1.183 alnsn const bpf_ctx_t *bc = NULL;
1402 1.169 rmind bool gottime = false;
1403 1.169 rmind
1404 1.169 rmind /*
1405 1.169 rmind * Note that the IPL does not have to be raised at this point.
1406 1.169 rmind * The only problem that could arise here is that if two different
1407 1.169 rmind * interfaces shared any data. This is not the case.
1408 1.169 rmind */
1409 1.169 rmind for (d = bp->bif_dlist; d != NULL; d = d->bd_next) {
1410 1.169 rmind u_int slen;
1411 1.96 dyoung
1412 1.169 rmind if (!d->bd_seesent && !rcv) {
1413 1.96 dyoung continue;
1414 1.120 christos }
1415 1.169 rmind d->bd_rcount++;
1416 1.169 rmind bpf_gstats.bs_recv++;
1417 1.169 rmind
1418 1.179 rmind if (d->bd_jitcode)
1419 1.183 alnsn slen = d->bd_jitcode(bc, &args);
1420 1.173 alnsn else
1421 1.179 rmind slen = bpf_filter_ext(bc, d->bd_filter, &args);
1422 1.173 alnsn
1423 1.169 rmind if (!slen) {
1424 1.169 rmind continue;
1425 1.169 rmind }
1426 1.169 rmind if (!gottime) {
1427 1.169 rmind gottime = true;
1428 1.169 rmind nanotime(&ts);
1429 1.169 rmind }
1430 1.169 rmind catchpacket(d, pkt, pktlen, slen, cpfn, &ts);
1431 1.96 dyoung }
1432 1.96 dyoung }
1433 1.96 dyoung
1434 1.96 dyoung /*
1435 1.169 rmind * Incoming linkage from device drivers. Process the packet pkt, of length
1436 1.169 rmind * pktlen, which is stored in a contiguous buffer. The packet is parsed
1437 1.169 rmind * by each process' filter, and if accepted, stashed into the corresponding
1438 1.169 rmind * buffer.
1439 1.169 rmind */
1440 1.169 rmind static void
1441 1.169 rmind _bpf_tap(struct bpf_if *bp, u_char *pkt, u_int pktlen)
1442 1.169 rmind {
1443 1.169 rmind
1444 1.171 alnsn bpf_deliver(bp, memcpy, pkt, pktlen, pktlen, true);
1445 1.169 rmind }
1446 1.169 rmind
1447 1.169 rmind /*
1448 1.96 dyoung * Incoming linkage from device drivers, when the head of the packet is in
1449 1.96 dyoung * a buffer, and the tail is in an mbuf chain.
1450 1.96 dyoung */
1451 1.153 pooka static void
1452 1.157 joerg _bpf_mtap2(struct bpf_if *bp, void *data, u_int dlen, struct mbuf *m)
1453 1.96 dyoung {
1454 1.96 dyoung u_int pktlen;
1455 1.96 dyoung struct mbuf mb;
1456 1.96 dyoung
1457 1.156 christos /* Skip outgoing duplicate packets. */
1458 1.156 christos if ((m->m_flags & M_PROMISC) != 0 && m->m_pkthdr.rcvif == NULL) {
1459 1.156 christos m->m_flags &= ~M_PROMISC;
1460 1.156 christos return;
1461 1.156 christos }
1462 1.156 christos
1463 1.101 dyoung pktlen = m_length(m) + dlen;
1464 1.96 dyoung
1465 1.96 dyoung /*
1466 1.96 dyoung * Craft on-stack mbuf suitable for passing to bpf_filter.
1467 1.96 dyoung * Note that we cut corners here; we only setup what's
1468 1.162 christos * absolutely needed--this mbuf should never go anywhere else.
1469 1.162 christos */
1470 1.101 dyoung (void)memset(&mb, 0, sizeof(mb));
1471 1.96 dyoung mb.m_next = m;
1472 1.96 dyoung mb.m_data = data;
1473 1.96 dyoung mb.m_len = dlen;
1474 1.96 dyoung
1475 1.169 rmind bpf_deliver(bp, bpf_mcpy, &mb, pktlen, 0, m->m_pkthdr.rcvif != NULL);
1476 1.96 dyoung }
1477 1.96 dyoung
1478 1.96 dyoung /*
1479 1.2 cgd * Incoming linkage from device drivers, when packet is in an mbuf chain.
1480 1.1 cgd */
1481 1.153 pooka static void
1482 1.157 joerg _bpf_mtap(struct bpf_if *bp, struct mbuf *m)
1483 1.1 cgd {
1484 1.137 christos void *(*cpfn)(void *, const void *, size_t);
1485 1.96 dyoung u_int pktlen, buflen;
1486 1.91 darrenr void *marg;
1487 1.1 cgd
1488 1.156 christos /* Skip outgoing duplicate packets. */
1489 1.156 christos if ((m->m_flags & M_PROMISC) != 0 && m->m_pkthdr.rcvif == NULL) {
1490 1.156 christos m->m_flags &= ~M_PROMISC;
1491 1.156 christos return;
1492 1.156 christos }
1493 1.156 christos
1494 1.101 dyoung pktlen = m_length(m);
1495 1.1 cgd
1496 1.91 darrenr if (pktlen == m->m_len) {
1497 1.136 yamt cpfn = (void *)memcpy;
1498 1.91 darrenr marg = mtod(m, void *);
1499 1.91 darrenr buflen = pktlen;
1500 1.91 darrenr } else {
1501 1.91 darrenr cpfn = bpf_mcpy;
1502 1.91 darrenr marg = m;
1503 1.91 darrenr buflen = 0;
1504 1.91 darrenr }
1505 1.91 darrenr
1506 1.169 rmind bpf_deliver(bp, cpfn, marg, pktlen, buflen, m->m_pkthdr.rcvif != NULL);
1507 1.1 cgd }
1508 1.1 cgd
1509 1.1 cgd /*
1510 1.104 christos * We need to prepend the address family as
1511 1.104 christos * a four byte field. Cons up a dummy header
1512 1.104 christos * to pacify bpf. This is safe because bpf
1513 1.104 christos * will only read from the mbuf (i.e., it won't
1514 1.104 christos * try to free it or keep a pointer a to it).
1515 1.104 christos */
1516 1.153 pooka static void
1517 1.157 joerg _bpf_mtap_af(struct bpf_if *bp, uint32_t af, struct mbuf *m)
1518 1.104 christos {
1519 1.104 christos struct mbuf m0;
1520 1.107 perry
1521 1.104 christos m0.m_flags = 0;
1522 1.104 christos m0.m_next = m;
1523 1.104 christos m0.m_len = 4;
1524 1.104 christos m0.m_data = (char *)⁡
1525 1.104 christos
1526 1.157 joerg _bpf_mtap(bp, &m0);
1527 1.104 christos }
1528 1.104 christos
1529 1.104 christos /*
1530 1.104 christos * Put the SLIP pseudo-"link header" in place.
1531 1.104 christos * Note this M_PREPEND() should never fail,
1532 1.104 christos * swince we know we always have enough space
1533 1.104 christos * in the input buffer.
1534 1.104 christos */
1535 1.153 pooka static void
1536 1.157 joerg _bpf_mtap_sl_in(struct bpf_if *bp, u_char *chdr, struct mbuf **m)
1537 1.104 christos {
1538 1.104 christos int s;
1539 1.104 christos u_char *hp;
1540 1.104 christos
1541 1.104 christos M_PREPEND(*m, SLIP_HDRLEN, M_DONTWAIT);
1542 1.104 christos if (*m == NULL)
1543 1.104 christos return;
1544 1.104 christos
1545 1.104 christos hp = mtod(*m, u_char *);
1546 1.104 christos hp[SLX_DIR] = SLIPDIR_IN;
1547 1.104 christos (void)memcpy(&hp[SLX_CHDR], chdr, CHDR_LEN);
1548 1.104 christos
1549 1.104 christos s = splnet();
1550 1.157 joerg _bpf_mtap(bp, *m);
1551 1.104 christos splx(s);
1552 1.104 christos
1553 1.104 christos m_adj(*m, SLIP_HDRLEN);
1554 1.104 christos }
1555 1.104 christos
1556 1.104 christos /*
1557 1.104 christos * Put the SLIP pseudo-"link header" in
1558 1.104 christos * place. The compressed header is now
1559 1.104 christos * at the beginning of the mbuf.
1560 1.104 christos */
1561 1.153 pooka static void
1562 1.157 joerg _bpf_mtap_sl_out(struct bpf_if *bp, u_char *chdr, struct mbuf *m)
1563 1.104 christos {
1564 1.104 christos struct mbuf m0;
1565 1.104 christos u_char *hp;
1566 1.104 christos int s;
1567 1.104 christos
1568 1.104 christos m0.m_flags = 0;
1569 1.104 christos m0.m_next = m;
1570 1.104 christos m0.m_data = m0.m_dat;
1571 1.104 christos m0.m_len = SLIP_HDRLEN;
1572 1.104 christos
1573 1.104 christos hp = mtod(&m0, u_char *);
1574 1.104 christos
1575 1.104 christos hp[SLX_DIR] = SLIPDIR_OUT;
1576 1.104 christos (void)memcpy(&hp[SLX_CHDR], chdr, CHDR_LEN);
1577 1.104 christos
1578 1.104 christos s = splnet();
1579 1.157 joerg _bpf_mtap(bp, &m0);
1580 1.104 christos splx(s);
1581 1.104 christos m_freem(m);
1582 1.104 christos }
1583 1.104 christos
1584 1.166 bouyer static int
1585 1.166 bouyer bpf_hdrlen(struct bpf_d *d)
1586 1.166 bouyer {
1587 1.166 bouyer int hdrlen = d->bd_bif->bif_hdrlen;
1588 1.166 bouyer /*
1589 1.166 bouyer * Compute the length of the bpf header. This is not necessarily
1590 1.166 bouyer * equal to SIZEOF_BPF_HDR because we want to insert spacing such
1591 1.166 bouyer * that the network layer header begins on a longword boundary (for
1592 1.166 bouyer * performance reasons and to alleviate alignment restrictions).
1593 1.166 bouyer */
1594 1.166 bouyer #ifdef _LP64
1595 1.166 bouyer if (d->bd_compat32)
1596 1.166 bouyer return (BPF_WORDALIGN32(hdrlen + SIZEOF_BPF_HDR32) - hdrlen);
1597 1.166 bouyer else
1598 1.166 bouyer #endif
1599 1.166 bouyer return (BPF_WORDALIGN(hdrlen + SIZEOF_BPF_HDR) - hdrlen);
1600 1.166 bouyer }
1601 1.168 christos
1602 1.104 christos /*
1603 1.1 cgd * Move the packet data from interface memory (pkt) into the
1604 1.168 christos * store buffer. Call the wakeup functions if it's time to wakeup
1605 1.168 christos * a listener (buffer full), "cpfn" is the routine called to do the
1606 1.168 christos * actual data transfer. memcpy is passed in to copy contiguous chunks,
1607 1.168 christos * while bpf_mcpy is passed in to copy mbuf chains. In the latter case,
1608 1.2 cgd * pkt is really an mbuf.
1609 1.1 cgd */
1610 1.1 cgd static void
1611 1.103 christos catchpacket(struct bpf_d *d, u_char *pkt, u_int pktlen, u_int snaplen,
1612 1.142 christos void *(*cpfn)(void *, const void *, size_t), struct timespec *ts)
1613 1.53 augustss {
1614 1.176 christos char *h;
1615 1.176 christos int totlen, curlen, caplen;
1616 1.166 bouyer int hdrlen = bpf_hdrlen(d);
1617 1.138 scw int do_wakeup = 0;
1618 1.94 darrenr
1619 1.94 darrenr ++d->bd_ccount;
1620 1.110 rpaulo ++bpf_gstats.bs_capt;
1621 1.1 cgd /*
1622 1.1 cgd * Figure out how many bytes to move. If the packet is
1623 1.1 cgd * greater or equal to the snapshot length, transfer that
1624 1.1 cgd * much. Otherwise, transfer the whole packet (unless
1625 1.1 cgd * we hit the buffer size limit).
1626 1.1 cgd */
1627 1.12 mycroft totlen = hdrlen + min(snaplen, pktlen);
1628 1.1 cgd if (totlen > d->bd_bufsize)
1629 1.1 cgd totlen = d->bd_bufsize;
1630 1.176 christos /*
1631 1.176 christos * If we adjusted totlen to fit the bufsize, it could be that
1632 1.176 christos * totlen is smaller than hdrlen because of the link layer header.
1633 1.176 christos */
1634 1.176 christos caplen = totlen - hdrlen;
1635 1.176 christos if (caplen < 0)
1636 1.176 christos caplen = 0;
1637 1.1 cgd
1638 1.1 cgd /*
1639 1.1 cgd * Round up the end of the previous packet to the next longword.
1640 1.1 cgd */
1641 1.166 bouyer #ifdef _LP64
1642 1.166 bouyer if (d->bd_compat32)
1643 1.166 bouyer curlen = BPF_WORDALIGN32(d->bd_slen);
1644 1.166 bouyer else
1645 1.166 bouyer #endif
1646 1.166 bouyer curlen = BPF_WORDALIGN(d->bd_slen);
1647 1.1 cgd if (curlen + totlen > d->bd_bufsize) {
1648 1.1 cgd /*
1649 1.1 cgd * This packet will overflow the storage buffer.
1650 1.1 cgd * Rotate the buffers if we can, then wakeup any
1651 1.1 cgd * pending reads.
1652 1.1 cgd */
1653 1.100 darrenr if (d->bd_fbuf == 0) {
1654 1.12 mycroft /*
1655 1.12 mycroft * We haven't completed the previous read yet,
1656 1.1 cgd * so drop the packet.
1657 1.1 cgd */
1658 1.1 cgd ++d->bd_dcount;
1659 1.110 rpaulo ++bpf_gstats.bs_drop;
1660 1.1 cgd return;
1661 1.1 cgd }
1662 1.1 cgd ROTATE_BUFFERS(d);
1663 1.138 scw do_wakeup = 1;
1664 1.1 cgd curlen = 0;
1665 1.138 scw } else if (d->bd_immediate || d->bd_state == BPF_TIMED_OUT) {
1666 1.138 scw /*
1667 1.138 scw * Immediate mode is set, or the read timeout has
1668 1.138 scw * already expired during a select call. A packet
1669 1.138 scw * arrived, so the reader should be woken up.
1670 1.138 scw */
1671 1.138 scw do_wakeup = 1;
1672 1.97 darrenr }
1673 1.1 cgd
1674 1.1 cgd /*
1675 1.1 cgd * Append the bpf header.
1676 1.1 cgd */
1677 1.176 christos h = (char *)d->bd_sbuf + curlen;
1678 1.166 bouyer #ifdef _LP64
1679 1.166 bouyer if (d->bd_compat32) {
1680 1.176 christos struct bpf_hdr32 *hp32;
1681 1.176 christos
1682 1.176 christos hp32 = (struct bpf_hdr32 *)h;
1683 1.166 bouyer hp32->bh_tstamp.tv_sec = ts->tv_sec;
1684 1.166 bouyer hp32->bh_tstamp.tv_usec = ts->tv_nsec / 1000;
1685 1.166 bouyer hp32->bh_datalen = pktlen;
1686 1.166 bouyer hp32->bh_hdrlen = hdrlen;
1687 1.176 christos hp32->bh_caplen = caplen;
1688 1.166 bouyer } else
1689 1.166 bouyer #endif
1690 1.166 bouyer {
1691 1.176 christos struct bpf_hdr *hp;
1692 1.176 christos
1693 1.176 christos hp = (struct bpf_hdr *)h;
1694 1.166 bouyer hp->bh_tstamp.tv_sec = ts->tv_sec;
1695 1.166 bouyer hp->bh_tstamp.tv_usec = ts->tv_nsec / 1000;
1696 1.166 bouyer hp->bh_datalen = pktlen;
1697 1.166 bouyer hp->bh_hdrlen = hdrlen;
1698 1.176 christos hp->bh_caplen = caplen;
1699 1.166 bouyer }
1700 1.176 christos
1701 1.176 christos /*
1702 1.176 christos * Copy the packet data into the store buffer and update its length.
1703 1.176 christos */
1704 1.176 christos (*cpfn)(h + hdrlen, pkt, caplen);
1705 1.1 cgd d->bd_slen = curlen + totlen;
1706 1.97 darrenr
1707 1.97 darrenr /*
1708 1.97 darrenr * Call bpf_wakeup after bd_slen has been updated so that kevent(2)
1709 1.97 darrenr * will cause filt_bpfread() to be called with it adjusted.
1710 1.97 darrenr */
1711 1.138 scw if (do_wakeup)
1712 1.97 darrenr bpf_wakeup(d);
1713 1.1 cgd }
1714 1.1 cgd
1715 1.12 mycroft /*
1716 1.1 cgd * Initialize all nonzero fields of a descriptor.
1717 1.1 cgd */
1718 1.1 cgd static int
1719 1.103 christos bpf_allocbufs(struct bpf_d *d)
1720 1.1 cgd {
1721 1.50 enami
1722 1.163 bouyer d->bd_fbuf = malloc(d->bd_bufsize, M_DEVBUF, M_WAITOK | M_CANFAIL);
1723 1.100 darrenr if (!d->bd_fbuf)
1724 1.79 itojun return (ENOBUFS);
1725 1.163 bouyer d->bd_sbuf = malloc(d->bd_bufsize, M_DEVBUF, M_WAITOK | M_CANFAIL);
1726 1.100 darrenr if (!d->bd_sbuf) {
1727 1.100 darrenr free(d->bd_fbuf, M_DEVBUF);
1728 1.79 itojun return (ENOBUFS);
1729 1.79 itojun }
1730 1.1 cgd d->bd_slen = 0;
1731 1.1 cgd d->bd_hlen = 0;
1732 1.1 cgd return (0);
1733 1.1 cgd }
1734 1.1 cgd
1735 1.1 cgd /*
1736 1.2 cgd * Free buffers currently in use by a descriptor.
1737 1.2 cgd * Called on close.
1738 1.2 cgd */
1739 1.2 cgd static void
1740 1.103 christos bpf_freed(struct bpf_d *d)
1741 1.2 cgd {
1742 1.2 cgd /*
1743 1.2 cgd * We don't need to lock out interrupts since this descriptor has
1744 1.2 cgd * been detached from its interface and it yet hasn't been marked
1745 1.2 cgd * free.
1746 1.2 cgd */
1747 1.171 alnsn if (d->bd_sbuf != NULL) {
1748 1.100 darrenr free(d->bd_sbuf, M_DEVBUF);
1749 1.171 alnsn if (d->bd_hbuf != NULL)
1750 1.100 darrenr free(d->bd_hbuf, M_DEVBUF);
1751 1.171 alnsn if (d->bd_fbuf != NULL)
1752 1.100 darrenr free(d->bd_fbuf, M_DEVBUF);
1753 1.100 darrenr }
1754 1.2 cgd if (d->bd_filter)
1755 1.103 christos free(d->bd_filter, M_DEVBUF);
1756 1.173 alnsn
1757 1.173 alnsn if (d->bd_jitcode != NULL) {
1758 1.178 rmind bpf_jit_freecode(d->bd_jitcode);
1759 1.173 alnsn }
1760 1.2 cgd }
1761 1.2 cgd
1762 1.2 cgd /*
1763 1.153 pooka * Attach an interface to bpf. dlt is the link layer type;
1764 1.66 onoe * hdrlen is the fixed size of the link header for the specified dlt
1765 1.66 onoe * (variable length headers not yet supported).
1766 1.66 onoe */
1767 1.153 pooka static void
1768 1.157 joerg _bpfattach(struct ifnet *ifp, u_int dlt, u_int hdrlen, struct bpf_if **driverp)
1769 1.66 onoe {
1770 1.1 cgd struct bpf_if *bp;
1771 1.103 christos bp = malloc(sizeof(*bp), M_DEVBUF, M_DONTWAIT);
1772 1.12 mycroft if (bp == 0)
1773 1.12 mycroft panic("bpfattach");
1774 1.12 mycroft
1775 1.1 cgd bp->bif_dlist = 0;
1776 1.103 christos bp->bif_driverp = driverp;
1777 1.1 cgd bp->bif_ifp = ifp;
1778 1.1 cgd bp->bif_dlt = dlt;
1779 1.1 cgd
1780 1.1 cgd bp->bif_next = bpf_iflist;
1781 1.1 cgd bpf_iflist = bp;
1782 1.1 cgd
1783 1.1 cgd *bp->bif_driverp = 0;
1784 1.1 cgd
1785 1.166 bouyer bp->bif_hdrlen = hdrlen;
1786 1.11 deraadt #if 0
1787 1.32 christos printf("bpf: %s attached\n", ifp->if_xname);
1788 1.11 deraadt #endif
1789 1.48 thorpej }
1790 1.48 thorpej
1791 1.48 thorpej /*
1792 1.48 thorpej * Remove an interface from bpf.
1793 1.48 thorpej */
1794 1.153 pooka static void
1795 1.157 joerg _bpfdetach(struct ifnet *ifp)
1796 1.48 thorpej {
1797 1.48 thorpej struct bpf_if *bp, **pbp;
1798 1.51 enami struct bpf_d *d;
1799 1.105 christos int s;
1800 1.51 enami
1801 1.52 soren /* Nuke the vnodes for any open instances */
1802 1.132 dyoung LIST_FOREACH(d, &bpf_list, bd_list) {
1803 1.105 christos if (d->bd_bif != NULL && d->bd_bif->bif_ifp == ifp) {
1804 1.51 enami /*
1805 1.51 enami * Detach the descriptor from an interface now.
1806 1.51 enami * It will be free'ed later by close routine.
1807 1.51 enami */
1808 1.61 thorpej s = splnet();
1809 1.51 enami d->bd_promisc = 0; /* we can't touch device. */
1810 1.51 enami bpf_detachd(d);
1811 1.51 enami splx(s);
1812 1.51 enami }
1813 1.51 enami }
1814 1.48 thorpej
1815 1.66 onoe again:
1816 1.48 thorpej for (bp = bpf_iflist, pbp = &bpf_iflist;
1817 1.48 thorpej bp != NULL; pbp = &bp->bif_next, bp = bp->bif_next) {
1818 1.48 thorpej if (bp->bif_ifp == ifp) {
1819 1.48 thorpej *pbp = bp->bif_next;
1820 1.48 thorpej free(bp, M_DEVBUF);
1821 1.66 onoe goto again;
1822 1.48 thorpej }
1823 1.48 thorpej }
1824 1.47 thorpej }
1825 1.47 thorpej
1826 1.47 thorpej /*
1827 1.66 onoe * Change the data link type of a interface.
1828 1.47 thorpej */
1829 1.153 pooka static void
1830 1.157 joerg _bpf_change_type(struct ifnet *ifp, u_int dlt, u_int hdrlen)
1831 1.47 thorpej {
1832 1.47 thorpej struct bpf_if *bp;
1833 1.47 thorpej
1834 1.47 thorpej for (bp = bpf_iflist; bp != NULL; bp = bp->bif_next) {
1835 1.152 pooka if (bp->bif_driverp == &ifp->if_bpf)
1836 1.47 thorpej break;
1837 1.47 thorpej }
1838 1.47 thorpej if (bp == NULL)
1839 1.47 thorpej panic("bpf_change_type");
1840 1.47 thorpej
1841 1.47 thorpej bp->bif_dlt = dlt;
1842 1.47 thorpej
1843 1.166 bouyer bp->bif_hdrlen = hdrlen;
1844 1.66 onoe }
1845 1.66 onoe
1846 1.66 onoe /*
1847 1.66 onoe * Get a list of available data link type of the interface.
1848 1.66 onoe */
1849 1.66 onoe static int
1850 1.103 christos bpf_getdltlist(struct bpf_d *d, struct bpf_dltlist *bfl)
1851 1.66 onoe {
1852 1.66 onoe int n, error;
1853 1.66 onoe struct ifnet *ifp;
1854 1.66 onoe struct bpf_if *bp;
1855 1.66 onoe
1856 1.66 onoe ifp = d->bd_bif->bif_ifp;
1857 1.66 onoe n = 0;
1858 1.66 onoe error = 0;
1859 1.66 onoe for (bp = bpf_iflist; bp != NULL; bp = bp->bif_next) {
1860 1.66 onoe if (bp->bif_ifp != ifp)
1861 1.66 onoe continue;
1862 1.66 onoe if (bfl->bfl_list != NULL) {
1863 1.66 onoe if (n >= bfl->bfl_len)
1864 1.66 onoe return ENOMEM;
1865 1.66 onoe error = copyout(&bp->bif_dlt,
1866 1.66 onoe bfl->bfl_list + n, sizeof(u_int));
1867 1.66 onoe }
1868 1.66 onoe n++;
1869 1.66 onoe }
1870 1.66 onoe bfl->bfl_len = n;
1871 1.66 onoe return error;
1872 1.66 onoe }
1873 1.66 onoe
1874 1.66 onoe /*
1875 1.66 onoe * Set the data link type of a BPF instance.
1876 1.66 onoe */
1877 1.66 onoe static int
1878 1.103 christos bpf_setdlt(struct bpf_d *d, u_int dlt)
1879 1.66 onoe {
1880 1.69 thorpej int s, error, opromisc;
1881 1.66 onoe struct ifnet *ifp;
1882 1.66 onoe struct bpf_if *bp;
1883 1.66 onoe
1884 1.66 onoe if (d->bd_bif->bif_dlt == dlt)
1885 1.66 onoe return 0;
1886 1.66 onoe ifp = d->bd_bif->bif_ifp;
1887 1.66 onoe for (bp = bpf_iflist; bp != NULL; bp = bp->bif_next) {
1888 1.66 onoe if (bp->bif_ifp == ifp && bp->bif_dlt == dlt)
1889 1.66 onoe break;
1890 1.66 onoe }
1891 1.66 onoe if (bp == NULL)
1892 1.66 onoe return EINVAL;
1893 1.66 onoe s = splnet();
1894 1.69 thorpej opromisc = d->bd_promisc;
1895 1.66 onoe bpf_detachd(d);
1896 1.66 onoe bpf_attachd(d, bp);
1897 1.66 onoe reset_d(d);
1898 1.69 thorpej if (opromisc) {
1899 1.69 thorpej error = ifpromisc(bp->bif_ifp, 1);
1900 1.69 thorpej if (error)
1901 1.69 thorpej printf("%s: bpf_setdlt: ifpromisc failed (%d)\n",
1902 1.69 thorpej bp->bif_ifp->if_xname, error);
1903 1.69 thorpej else
1904 1.69 thorpej d->bd_promisc = 1;
1905 1.69 thorpej }
1906 1.66 onoe splx(s);
1907 1.66 onoe return 0;
1908 1.1 cgd }
1909 1.89 jonathan
1910 1.89 jonathan static int
1911 1.89 jonathan sysctl_net_bpf_maxbufsize(SYSCTLFN_ARGS)
1912 1.89 jonathan {
1913 1.89 jonathan int newsize, error;
1914 1.89 jonathan struct sysctlnode node;
1915 1.89 jonathan
1916 1.89 jonathan node = *rnode;
1917 1.89 jonathan node.sysctl_data = &newsize;
1918 1.89 jonathan newsize = bpf_maxbufsize;
1919 1.89 jonathan error = sysctl_lookup(SYSCTLFN_CALL(&node));
1920 1.89 jonathan if (error || newp == NULL)
1921 1.89 jonathan return (error);
1922 1.89 jonathan
1923 1.89 jonathan if (newsize < BPF_MINBUFSIZE || newsize > BPF_MAXBUFSIZE)
1924 1.89 jonathan return (EINVAL);
1925 1.89 jonathan
1926 1.89 jonathan bpf_maxbufsize = newsize;
1927 1.89 jonathan
1928 1.89 jonathan return (0);
1929 1.89 jonathan }
1930 1.89 jonathan
1931 1.110 rpaulo static int
1932 1.173 alnsn sysctl_net_bpf_jit(SYSCTLFN_ARGS)
1933 1.173 alnsn {
1934 1.173 alnsn bool newval;
1935 1.173 alnsn int error;
1936 1.173 alnsn struct sysctlnode node;
1937 1.173 alnsn
1938 1.173 alnsn node = *rnode;
1939 1.173 alnsn node.sysctl_data = &newval;
1940 1.173 alnsn newval = bpf_jit;
1941 1.173 alnsn error = sysctl_lookup(SYSCTLFN_CALL(&node));
1942 1.173 alnsn if (error != 0 || newp == NULL)
1943 1.173 alnsn return error;
1944 1.173 alnsn
1945 1.173 alnsn bpf_jit = newval;
1946 1.173 alnsn
1947 1.173 alnsn /*
1948 1.173 alnsn * Do a full sync to publish new bpf_jit value and
1949 1.173 alnsn * update bpfjit_module_ops.bj_generate_code variable.
1950 1.173 alnsn */
1951 1.173 alnsn membar_sync();
1952 1.173 alnsn
1953 1.173 alnsn if (newval && bpfjit_module_ops.bj_generate_code == NULL) {
1954 1.173 alnsn printf("WARNING jit activation is postponed "
1955 1.173 alnsn "until after bpfjit module is loaded\n");
1956 1.173 alnsn }
1957 1.173 alnsn
1958 1.173 alnsn return 0;
1959 1.173 alnsn }
1960 1.173 alnsn
1961 1.173 alnsn static int
1962 1.110 rpaulo sysctl_net_bpf_peers(SYSCTLFN_ARGS)
1963 1.110 rpaulo {
1964 1.110 rpaulo int error, elem_count;
1965 1.110 rpaulo struct bpf_d *dp;
1966 1.110 rpaulo struct bpf_d_ext dpe;
1967 1.110 rpaulo size_t len, needed, elem_size, out_size;
1968 1.110 rpaulo char *sp;
1969 1.110 rpaulo
1970 1.110 rpaulo if (namelen == 1 && name[0] == CTL_QUERY)
1971 1.110 rpaulo return (sysctl_query(SYSCTLFN_CALL(rnode)));
1972 1.110 rpaulo
1973 1.110 rpaulo if (namelen != 2)
1974 1.110 rpaulo return (EINVAL);
1975 1.110 rpaulo
1976 1.124 elad /* BPF peers is privileged information. */
1977 1.124 elad error = kauth_authorize_network(l->l_cred, KAUTH_NETWORK_INTERFACE,
1978 1.124 elad KAUTH_REQ_NETWORK_INTERFACE_GETPRIV, NULL, NULL, NULL);
1979 1.124 elad if (error)
1980 1.124 elad return (EPERM);
1981 1.110 rpaulo
1982 1.110 rpaulo len = (oldp != NULL) ? *oldlenp : 0;
1983 1.110 rpaulo sp = oldp;
1984 1.110 rpaulo elem_size = name[0];
1985 1.110 rpaulo elem_count = name[1];
1986 1.110 rpaulo out_size = MIN(sizeof(dpe), elem_size);
1987 1.110 rpaulo needed = 0;
1988 1.110 rpaulo
1989 1.110 rpaulo if (elem_size < 1 || elem_count < 0)
1990 1.110 rpaulo return (EINVAL);
1991 1.120 christos
1992 1.130 xtraeme mutex_enter(&bpf_mtx);
1993 1.110 rpaulo LIST_FOREACH(dp, &bpf_list, bd_list) {
1994 1.110 rpaulo if (len >= elem_size && elem_count > 0) {
1995 1.110 rpaulo #define BPF_EXT(field) dpe.bde_ ## field = dp->bd_ ## field
1996 1.110 rpaulo BPF_EXT(bufsize);
1997 1.110 rpaulo BPF_EXT(promisc);
1998 1.110 rpaulo BPF_EXT(state);
1999 1.110 rpaulo BPF_EXT(immediate);
2000 1.110 rpaulo BPF_EXT(hdrcmplt);
2001 1.110 rpaulo BPF_EXT(seesent);
2002 1.110 rpaulo BPF_EXT(pid);
2003 1.110 rpaulo BPF_EXT(rcount);
2004 1.110 rpaulo BPF_EXT(dcount);
2005 1.110 rpaulo BPF_EXT(ccount);
2006 1.110 rpaulo #undef BPF_EXT
2007 1.110 rpaulo if (dp->bd_bif)
2008 1.110 rpaulo (void)strlcpy(dpe.bde_ifname,
2009 1.110 rpaulo dp->bd_bif->bif_ifp->if_xname,
2010 1.110 rpaulo IFNAMSIZ - 1);
2011 1.110 rpaulo else
2012 1.110 rpaulo dpe.bde_ifname[0] = '\0';
2013 1.120 christos
2014 1.110 rpaulo error = copyout(&dpe, sp, out_size);
2015 1.110 rpaulo if (error)
2016 1.110 rpaulo break;
2017 1.110 rpaulo sp += elem_size;
2018 1.110 rpaulo len -= elem_size;
2019 1.110 rpaulo }
2020 1.143 mrg needed += elem_size;
2021 1.143 mrg if (elem_count > 0 && elem_count != INT_MAX)
2022 1.143 mrg elem_count--;
2023 1.110 rpaulo }
2024 1.130 xtraeme mutex_exit(&bpf_mtx);
2025 1.110 rpaulo
2026 1.110 rpaulo *oldlenp = needed;
2027 1.120 christos
2028 1.110 rpaulo return (error);
2029 1.110 rpaulo }
2030 1.110 rpaulo
2031 1.159 pooka static struct sysctllog *bpf_sysctllog;
2032 1.159 pooka static void
2033 1.159 pooka sysctl_net_bpf_setup(void)
2034 1.89 jonathan {
2035 1.108 atatat const struct sysctlnode *node;
2036 1.89 jonathan
2037 1.89 jonathan node = NULL;
2038 1.159 pooka sysctl_createv(&bpf_sysctllog, 0, NULL, &node,
2039 1.90 atatat CTLFLAG_PERMANENT,
2040 1.98 atatat CTLTYPE_NODE, "bpf",
2041 1.98 atatat SYSCTL_DESCR("BPF options"),
2042 1.89 jonathan NULL, 0, NULL, 0,
2043 1.89 jonathan CTL_NET, CTL_CREATE, CTL_EOL);
2044 1.110 rpaulo if (node != NULL) {
2045 1.159 pooka sysctl_createv(&bpf_sysctllog, 0, NULL, NULL,
2046 1.90 atatat CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
2047 1.173 alnsn CTLTYPE_BOOL, "jit",
2048 1.173 alnsn SYSCTL_DESCR("Toggle Just-In-Time compilation"),
2049 1.173 alnsn sysctl_net_bpf_jit, 0, &bpf_jit, 0,
2050 1.173 alnsn CTL_NET, node->sysctl_num, CTL_CREATE, CTL_EOL);
2051 1.173 alnsn sysctl_createv(&bpf_sysctllog, 0, NULL, NULL,
2052 1.173 alnsn CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
2053 1.98 atatat CTLTYPE_INT, "maxbufsize",
2054 1.98 atatat SYSCTL_DESCR("Maximum size for data capture buffer"),
2055 1.89 jonathan sysctl_net_bpf_maxbufsize, 0, &bpf_maxbufsize, 0,
2056 1.89 jonathan CTL_NET, node->sysctl_num, CTL_CREATE, CTL_EOL);
2057 1.159 pooka sysctl_createv(&bpf_sysctllog, 0, NULL, NULL,
2058 1.110 rpaulo CTLFLAG_PERMANENT,
2059 1.110 rpaulo CTLTYPE_STRUCT, "stats",
2060 1.110 rpaulo SYSCTL_DESCR("BPF stats"),
2061 1.110 rpaulo NULL, 0, &bpf_gstats, sizeof(bpf_gstats),
2062 1.110 rpaulo CTL_NET, node->sysctl_num, CTL_CREATE, CTL_EOL);
2063 1.159 pooka sysctl_createv(&bpf_sysctllog, 0, NULL, NULL,
2064 1.110 rpaulo CTLFLAG_PERMANENT,
2065 1.110 rpaulo CTLTYPE_STRUCT, "peers",
2066 1.110 rpaulo SYSCTL_DESCR("BPF peers"),
2067 1.110 rpaulo sysctl_net_bpf_peers, 0, NULL, 0,
2068 1.110 rpaulo CTL_NET, node->sysctl_num, CTL_CREATE, CTL_EOL);
2069 1.110 rpaulo }
2070 1.120 christos
2071 1.89 jonathan }
2072 1.153 pooka
2073 1.153 pooka struct bpf_ops bpf_ops_kernel = {
2074 1.157 joerg .bpf_attach = _bpfattach,
2075 1.157 joerg .bpf_detach = _bpfdetach,
2076 1.157 joerg .bpf_change_type = _bpf_change_type,
2077 1.157 joerg
2078 1.157 joerg .bpf_tap = _bpf_tap,
2079 1.157 joerg .bpf_mtap = _bpf_mtap,
2080 1.157 joerg .bpf_mtap2 = _bpf_mtap2,
2081 1.157 joerg .bpf_mtap_af = _bpf_mtap_af,
2082 1.157 joerg .bpf_mtap_sl_in = _bpf_mtap_sl_in,
2083 1.157 joerg .bpf_mtap_sl_out = _bpf_mtap_sl_out,
2084 1.153 pooka };
2085 1.153 pooka
2086 1.154 pooka MODULE(MODULE_CLASS_DRIVER, bpf, NULL);
2087 1.154 pooka
2088 1.154 pooka static int
2089 1.154 pooka bpf_modcmd(modcmd_t cmd, void *arg)
2090 1.153 pooka {
2091 1.154 pooka devmajor_t bmajor, cmajor;
2092 1.154 pooka int error;
2093 1.154 pooka
2094 1.154 pooka bmajor = cmajor = NODEVMAJOR;
2095 1.154 pooka
2096 1.154 pooka switch (cmd) {
2097 1.154 pooka case MODULE_CMD_INIT:
2098 1.154 pooka bpfilterattach(0);
2099 1.154 pooka error = devsw_attach("bpf", NULL, &bmajor,
2100 1.154 pooka &bpf_cdevsw, &cmajor);
2101 1.154 pooka if (error == EEXIST)
2102 1.154 pooka error = 0; /* maybe built-in ... improve eventually */
2103 1.154 pooka if (error)
2104 1.154 pooka break;
2105 1.154 pooka
2106 1.154 pooka bpf_ops_handover_enter(&bpf_ops_kernel);
2107 1.154 pooka atomic_swap_ptr(&bpf_ops, &bpf_ops_kernel);
2108 1.154 pooka bpf_ops_handover_exit();
2109 1.159 pooka sysctl_net_bpf_setup();
2110 1.154 pooka break;
2111 1.154 pooka
2112 1.154 pooka case MODULE_CMD_FINI:
2113 1.154 pooka /*
2114 1.158 pooka * While there is no reference counting for bpf callers,
2115 1.158 pooka * unload could at least in theory be done similarly to
2116 1.158 pooka * system call disestablishment. This should even be
2117 1.158 pooka * a little simpler:
2118 1.158 pooka *
2119 1.158 pooka * 1) replace op vector with stubs
2120 1.158 pooka * 2) post update to all cpus with xc
2121 1.158 pooka * 3) check that nobody is in bpf anymore
2122 1.158 pooka * (it's doubtful we'd want something like l_sysent,
2123 1.158 pooka * but we could do something like *signed* percpu
2124 1.158 pooka * counters. if the sum is 0, we're good).
2125 1.158 pooka * 4) if fail, unroll changes
2126 1.158 pooka *
2127 1.158 pooka * NOTE: change won't be atomic to the outside. some
2128 1.158 pooka * packets may be not captured even if unload is
2129 1.158 pooka * not succesful. I think packet capture not working
2130 1.158 pooka * is a perfectly logical consequence of trying to
2131 1.158 pooka * disable packet capture.
2132 1.154 pooka */
2133 1.154 pooka error = EOPNOTSUPP;
2134 1.159 pooka /* insert sysctl teardown */
2135 1.154 pooka break;
2136 1.153 pooka
2137 1.154 pooka default:
2138 1.154 pooka error = ENOTTY;
2139 1.154 pooka break;
2140 1.154 pooka }
2141 1.154 pooka
2142 1.154 pooka return error;
2143 1.153 pooka }
2144