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