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