bpf.c revision 1.117 1 1.117 elad /* $NetBSD: bpf.c,v 1.117 2006/05/14 21:19:33 elad 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.117 elad __KERNEL_RCSID(0, "$NetBSD: bpf.c,v 1.117 2006/05/14 21:19:33 elad Exp $");
43 1.1 cgd
44 1.1 cgd #include <sys/param.h>
45 1.1 cgd #include <sys/systm.h>
46 1.1 cgd #include <sys/mbuf.h>
47 1.1 cgd #include <sys/buf.h>
48 1.12 mycroft #include <sys/time.h>
49 1.1 cgd #include <sys/proc.h>
50 1.1 cgd #include <sys/user.h>
51 1.1 cgd #include <sys/ioctl.h>
52 1.25 christos #include <sys/conf.h>
53 1.51 enami #include <sys/vnode.h>
54 1.105 christos #include <sys/queue.h>
55 1.11 deraadt
56 1.1 cgd #include <sys/file.h>
57 1.105 christos #include <sys/filedesc.h>
58 1.1 cgd #include <sys/tty.h>
59 1.1 cgd #include <sys/uio.h>
60 1.11 deraadt
61 1.1 cgd #include <sys/protosw.h>
62 1.1 cgd #include <sys/socket.h>
63 1.30 mycroft #include <sys/errno.h>
64 1.30 mycroft #include <sys/kernel.h>
65 1.30 mycroft #include <sys/poll.h>
66 1.89 jonathan #include <sys/sysctl.h>
67 1.117 elad #include <sys/kauth.h>
68 1.30 mycroft
69 1.11 deraadt #include <net/if.h>
70 1.104 christos #include <net/slip.h>
71 1.8 mycroft
72 1.1 cgd #include <net/bpf.h>
73 1.1 cgd #include <net/bpfdesc.h>
74 1.1 cgd
75 1.35 scottr #include <net/if_arc.h>
76 1.34 is #include <net/if_ether.h>
77 1.34 is
78 1.12 mycroft #include <netinet/in.h>
79 1.34 is #include <netinet/if_inarp.h>
80 1.65 wrstuden
81 1.65 wrstuden #if defined(_KERNEL_OPT)
82 1.84 wrstuden #include "opt_bpf.h"
83 1.104 christos #include "sl.h"
84 1.104 christos #include "strip.h"
85 1.65 wrstuden #endif
86 1.11 deraadt
87 1.55 jonathan #ifndef BPF_BUFSIZE
88 1.87 jonathan /*
89 1.87 jonathan * 4096 is too small for FDDI frames. 8192 is too small for gigabit Ethernet
90 1.87 jonathan * jumbos (circa 9k), ATM, or Intel gig/10gig ethernet jumbos (16k).
91 1.87 jonathan */
92 1.87 jonathan # define BPF_BUFSIZE 32768
93 1.55 jonathan #endif
94 1.1 cgd
95 1.12 mycroft #define PRINET 26 /* interruptible */
96 1.2 cgd
97 1.1 cgd /*
98 1.89 jonathan * The default read buffer size, and limit for BIOCSBLEN, is sysctl'able.
99 1.89 jonathan * XXX the default values should be computed dynamically based
100 1.89 jonathan * on available memory size and available mbuf clusters.
101 1.1 cgd */
102 1.2 cgd int bpf_bufsize = BPF_BUFSIZE;
103 1.89 jonathan int bpf_maxbufsize = BPF_DFLTBUFSIZE; /* XXX set dynamically, see above */
104 1.1 cgd
105 1.110 rpaulo
106 1.110 rpaulo /*
107 1.110 rpaulo * Global BPF statistics returned by net.bpf.stats sysctl.
108 1.110 rpaulo */
109 1.110 rpaulo struct bpf_stat bpf_gstats;
110 1.110 rpaulo
111 1.110 rpaulo /*
112 1.110 rpaulo * Use a mutex to avoid a race condition between gathering the stats/peers
113 1.110 rpaulo * and opening/closing the device.
114 1.110 rpaulo */
115 1.110 rpaulo struct simplelock bpf_slock;
116 1.110 rpaulo
117 1.1 cgd /*
118 1.1 cgd * bpf_iflist is the list of interfaces; each corresponds to an ifnet
119 1.1 cgd * bpf_dtab holds the descriptors, indexed by minor device #
120 1.1 cgd */
121 1.12 mycroft struct bpf_if *bpf_iflist;
122 1.105 christos LIST_HEAD(, bpf_d) bpf_list;
123 1.1 cgd
124 1.103 christos static int bpf_allocbufs(struct bpf_d *);
125 1.101 dyoung static void bpf_deliver(struct bpf_if *,
126 1.101 dyoung void *(*cpfn)(void *, const void *, size_t),
127 1.101 dyoung void *, u_int, u_int, struct ifnet *);
128 1.103 christos static void bpf_freed(struct bpf_d *);
129 1.103 christos static void bpf_ifname(struct ifnet *, struct ifreq *);
130 1.103 christos static void *bpf_mcpy(void *, const void *, size_t);
131 1.103 christos static int bpf_movein(struct uio *, int, int,
132 1.103 christos struct mbuf **, struct sockaddr *);
133 1.103 christos static void bpf_attachd(struct bpf_d *, struct bpf_if *);
134 1.103 christos static void bpf_detachd(struct bpf_d *);
135 1.103 christos static int bpf_setif(struct bpf_d *, struct ifreq *);
136 1.103 christos static void bpf_timed_out(void *);
137 1.114 perry static inline void
138 1.103 christos bpf_wakeup(struct bpf_d *);
139 1.103 christos static void catchpacket(struct bpf_d *, u_char *, u_int, u_int,
140 1.103 christos void *(*)(void *, const void *, size_t));
141 1.103 christos static void reset_d(struct bpf_d *);
142 1.103 christos static int bpf_getdltlist(struct bpf_d *, struct bpf_dltlist *);
143 1.103 christos static int bpf_setdlt(struct bpf_d *, u_int);
144 1.12 mycroft
145 1.117 elad static int bpf_read(struct file *, off_t *, struct uio *, kauth_cred_t,
146 1.105 christos int);
147 1.117 elad static int bpf_write(struct file *, off_t *, struct uio *, kauth_cred_t,
148 1.105 christos int);
149 1.112 christos static int bpf_ioctl(struct file *, u_long, void *, struct lwp *);
150 1.112 christos static int bpf_poll(struct file *, int, struct lwp *);
151 1.112 christos static int bpf_close(struct file *, struct lwp *);
152 1.105 christos static int bpf_kqfilter(struct file *, struct knote *);
153 1.105 christos
154 1.105 christos static const struct fileops bpf_fileops = {
155 1.105 christos bpf_read,
156 1.105 christos bpf_write,
157 1.105 christos bpf_ioctl,
158 1.105 christos fnullop_fcntl,
159 1.105 christos bpf_poll,
160 1.105 christos fbadop_stat,
161 1.105 christos bpf_close,
162 1.105 christos bpf_kqfilter,
163 1.105 christos };
164 1.105 christos
165 1.67 gehenna dev_type_open(bpfopen);
166 1.67 gehenna
167 1.67 gehenna const struct cdevsw bpf_cdevsw = {
168 1.105 christos bpfopen, noclose, noread, nowrite, noioctl,
169 1.105 christos nostop, notty, nopoll, nommap, nokqfilter,
170 1.67 gehenna };
171 1.67 gehenna
172 1.12 mycroft static int
173 1.111 rpaulo bpf_movein(struct uio *uio, int linktype, int mtu, struct mbuf **mp,
174 1.111 rpaulo struct sockaddr *sockp)
175 1.12 mycroft {
176 1.12 mycroft struct mbuf *m;
177 1.12 mycroft int error;
178 1.12 mycroft int len;
179 1.12 mycroft int hlen;
180 1.36 christos int align;
181 1.12 mycroft
182 1.12 mycroft /*
183 1.12 mycroft * Build a sockaddr based on the data link layer type.
184 1.12 mycroft * We do this at this level because the ethernet header
185 1.12 mycroft * is copied directly into the data field of the sockaddr.
186 1.12 mycroft * In the case of SLIP, there is no header and the packet
187 1.12 mycroft * is forwarded as is.
188 1.12 mycroft * Also, we are careful to leave room at the front of the mbuf
189 1.12 mycroft * for the link level header.
190 1.12 mycroft */
191 1.12 mycroft switch (linktype) {
192 1.12 mycroft
193 1.12 mycroft case DLT_SLIP:
194 1.12 mycroft sockp->sa_family = AF_INET;
195 1.12 mycroft hlen = 0;
196 1.36 christos align = 0;
197 1.12 mycroft break;
198 1.12 mycroft
199 1.12 mycroft case DLT_PPP:
200 1.12 mycroft sockp->sa_family = AF_UNSPEC;
201 1.12 mycroft hlen = 0;
202 1.36 christos align = 0;
203 1.12 mycroft break;
204 1.12 mycroft
205 1.12 mycroft case DLT_EN10MB:
206 1.12 mycroft sockp->sa_family = AF_UNSPEC;
207 1.12 mycroft /* XXX Would MAXLINKHDR be better? */
208 1.36 christos /* 6(dst)+6(src)+2(type) */
209 1.12 mycroft hlen = sizeof(struct ether_header);
210 1.36 christos align = 2;
211 1.17 glass break;
212 1.17 glass
213 1.17 glass case DLT_ARCNET:
214 1.17 glass sockp->sa_family = AF_UNSPEC;
215 1.17 glass hlen = ARC_HDRLEN;
216 1.36 christos align = 5;
217 1.12 mycroft break;
218 1.12 mycroft
219 1.12 mycroft case DLT_FDDI:
220 1.56 matt sockp->sa_family = AF_LINK;
221 1.56 matt /* XXX 4(FORMAC)+6(dst)+6(src) */
222 1.56 matt hlen = 16;
223 1.36 christos align = 0;
224 1.62 bjh21 break;
225 1.62 bjh21
226 1.62 bjh21 case DLT_ECONET:
227 1.62 bjh21 sockp->sa_family = AF_UNSPEC;
228 1.62 bjh21 hlen = 6;
229 1.62 bjh21 align = 2;
230 1.12 mycroft break;
231 1.12 mycroft
232 1.12 mycroft case DLT_NULL:
233 1.12 mycroft sockp->sa_family = AF_UNSPEC;
234 1.12 mycroft hlen = 0;
235 1.36 christos align = 0;
236 1.12 mycroft break;
237 1.12 mycroft
238 1.12 mycroft default:
239 1.12 mycroft return (EIO);
240 1.12 mycroft }
241 1.12 mycroft
242 1.12 mycroft len = uio->uio_resid;
243 1.36 christos /*
244 1.36 christos * If there aren't enough bytes for a link level header or the
245 1.36 christos * packet length exceeds the interface mtu, return an error.
246 1.36 christos */
247 1.36 christos if (len < hlen || len - hlen > mtu)
248 1.36 christos return (EMSGSIZE);
249 1.36 christos
250 1.36 christos /*
251 1.36 christos * XXX Avoid complicated buffer chaining ---
252 1.36 christos * bail if it won't fit in a single mbuf.
253 1.36 christos * (Take into account possible alignment bytes)
254 1.36 christos */
255 1.36 christos if ((unsigned)len > MCLBYTES - align)
256 1.12 mycroft return (EIO);
257 1.12 mycroft
258 1.77 matt m = m_gethdr(M_WAIT, MT_DATA);
259 1.20 mycroft m->m_pkthdr.rcvif = 0;
260 1.20 mycroft m->m_pkthdr.len = len - hlen;
261 1.36 christos if (len > MHLEN - align) {
262 1.77 matt m_clget(m, M_WAIT);
263 1.12 mycroft if ((m->m_flags & M_EXT) == 0) {
264 1.12 mycroft error = ENOBUFS;
265 1.12 mycroft goto bad;
266 1.12 mycroft }
267 1.12 mycroft }
268 1.36 christos
269 1.36 christos /* Insure the data is properly aligned */
270 1.36 christos if (align > 0) {
271 1.36 christos m->m_data += align;
272 1.36 christos m->m_len -= align;
273 1.36 christos }
274 1.36 christos
275 1.103 christos error = uiomove(mtod(m, void *), len, uio);
276 1.36 christos if (error)
277 1.36 christos goto bad;
278 1.12 mycroft if (hlen != 0) {
279 1.103 christos memcpy(sockp->sa_data, mtod(m, void *), hlen);
280 1.12 mycroft m->m_data += hlen; /* XXX */
281 1.36 christos len -= hlen;
282 1.12 mycroft }
283 1.36 christos m->m_len = len;
284 1.36 christos *mp = m;
285 1.38 mycroft return (0);
286 1.38 mycroft
287 1.38 mycroft bad:
288 1.12 mycroft m_freem(m);
289 1.12 mycroft return (error);
290 1.12 mycroft }
291 1.1 cgd
292 1.1 cgd /*
293 1.2 cgd * Attach file to the bpf interface, i.e. make d listen on bp.
294 1.61 thorpej * Must be called at splnet.
295 1.1 cgd */
296 1.1 cgd static void
297 1.111 rpaulo bpf_attachd(struct bpf_d *d, struct bpf_if *bp)
298 1.1 cgd {
299 1.2 cgd /*
300 1.2 cgd * Point d at bp, and add d to the interface's list of listeners.
301 1.2 cgd * Finally, point the driver's bpf cookie at the interface so
302 1.2 cgd * it will divert packets to bpf.
303 1.2 cgd */
304 1.1 cgd d->bd_bif = bp;
305 1.1 cgd d->bd_next = bp->bif_dlist;
306 1.1 cgd bp->bif_dlist = d;
307 1.1 cgd
308 1.1 cgd *bp->bif_driverp = bp;
309 1.1 cgd }
310 1.1 cgd
311 1.2 cgd /*
312 1.2 cgd * Detach a file from its interface.
313 1.2 cgd */
314 1.1 cgd static void
315 1.111 rpaulo bpf_detachd(struct bpf_d *d)
316 1.1 cgd {
317 1.1 cgd struct bpf_d **p;
318 1.1 cgd struct bpf_if *bp;
319 1.1 cgd
320 1.1 cgd bp = d->bd_bif;
321 1.1 cgd /*
322 1.1 cgd * Check if this descriptor had requested promiscuous mode.
323 1.1 cgd * If so, turn it off.
324 1.1 cgd */
325 1.1 cgd if (d->bd_promisc) {
326 1.18 mycroft int error;
327 1.18 mycroft
328 1.1 cgd d->bd_promisc = 0;
329 1.36 christos /*
330 1.36 christos * Take device out of promiscuous mode. Since we were
331 1.36 christos * able to enter promiscuous mode, we should be able
332 1.36 christos * to turn it off. But we can get an error if
333 1.36 christos * the interface was configured down, so only panic
334 1.36 christos * if we don't get an unexpected error.
335 1.36 christos */
336 1.36 christos error = ifpromisc(bp->bif_ifp, 0);
337 1.18 mycroft if (error && error != EINVAL)
338 1.2 cgd panic("bpf: ifpromisc failed");
339 1.1 cgd }
340 1.2 cgd /* Remove d from the interface's descriptor list. */
341 1.1 cgd p = &bp->bif_dlist;
342 1.1 cgd while (*p != d) {
343 1.1 cgd p = &(*p)->bd_next;
344 1.1 cgd if (*p == 0)
345 1.1 cgd panic("bpf_detachd: descriptor not in list");
346 1.1 cgd }
347 1.1 cgd *p = (*p)->bd_next;
348 1.1 cgd if (bp->bif_dlist == 0)
349 1.1 cgd /*
350 1.1 cgd * Let the driver know that there are no more listeners.
351 1.1 cgd */
352 1.1 cgd *d->bd_bif->bif_driverp = 0;
353 1.1 cgd d->bd_bif = 0;
354 1.1 cgd }
355 1.1 cgd
356 1.1 cgd
357 1.1 cgd /*
358 1.12 mycroft * Mark a descriptor free by making it point to itself.
359 1.1 cgd * This is probably cheaper than marking with a constant since
360 1.1 cgd * the address should be in a register anyway.
361 1.1 cgd */
362 1.1 cgd
363 1.1 cgd /*
364 1.46 bouyer * bpfilterattach() is called at boot time.
365 1.46 bouyer */
366 1.46 bouyer /* ARGSUSED */
367 1.46 bouyer void
368 1.111 rpaulo bpfilterattach(int n)
369 1.46 bouyer {
370 1.110 rpaulo simple_lock_init(&bpf_slock);
371 1.110 rpaulo
372 1.110 rpaulo simple_lock(&bpf_slock);
373 1.105 christos LIST_INIT(&bpf_list);
374 1.110 rpaulo simple_unlock(&bpf_slock);
375 1.110 rpaulo
376 1.110 rpaulo bpf_gstats.bs_recv = 0;
377 1.110 rpaulo bpf_gstats.bs_drop = 0;
378 1.110 rpaulo bpf_gstats.bs_capt = 0;
379 1.46 bouyer }
380 1.46 bouyer
381 1.46 bouyer /*
382 1.105 christos * Open ethernet device. Clones.
383 1.1 cgd */
384 1.1 cgd /* ARGSUSED */
385 1.1 cgd int
386 1.112 christos bpfopen(dev_t dev, int flag, int mode, struct lwp *l)
387 1.1 cgd {
388 1.53 augustss struct bpf_d *d;
389 1.105 christos struct file *fp;
390 1.105 christos int error, fd;
391 1.12 mycroft
392 1.105 christos /* falloc() will use the descriptor for us. */
393 1.112 christos if ((error = falloc(l->l_proc, &fp, &fd)) != 0)
394 1.105 christos return error;
395 1.2 cgd
396 1.105 christos d = malloc(sizeof(*d), M_DEVBUF, M_WAITOK);
397 1.105 christos (void)memset(d, 0, sizeof(*d));
398 1.2 cgd d->bd_bufsize = bpf_bufsize;
399 1.91 darrenr d->bd_seesent = 1;
400 1.112 christos d->bd_pid = l->l_proc->p_pid;
401 1.91 darrenr callout_init(&d->bd_callout);
402 1.1 cgd
403 1.110 rpaulo simple_lock(&bpf_slock);
404 1.105 christos LIST_INSERT_HEAD(&bpf_list, d, bd_list);
405 1.110 rpaulo simple_unlock(&bpf_slock);
406 1.105 christos
407 1.112 christos return fdclone(l, fp, fd, flag, &bpf_fileops, d);
408 1.1 cgd }
409 1.1 cgd
410 1.1 cgd /*
411 1.1 cgd * Close the descriptor by detaching it from its interface,
412 1.1 cgd * deallocating its buffers, and marking it free.
413 1.1 cgd */
414 1.1 cgd /* ARGSUSED */
415 1.105 christos static int
416 1.112 christos bpf_close(struct file *fp, struct lwp *l)
417 1.1 cgd {
418 1.105 christos struct bpf_d *d = fp->f_data;
419 1.53 augustss int s;
420 1.1 cgd
421 1.110 rpaulo /*
422 1.110 rpaulo * Refresh the PID associated with this bpf file.
423 1.110 rpaulo */
424 1.112 christos d->bd_pid = l->l_proc->p_pid;
425 1.110 rpaulo
426 1.61 thorpej s = splnet();
427 1.91 darrenr if (d->bd_state == BPF_WAITING)
428 1.91 darrenr callout_stop(&d->bd_callout);
429 1.91 darrenr d->bd_state = BPF_IDLE;
430 1.1 cgd if (d->bd_bif)
431 1.1 cgd bpf_detachd(d);
432 1.1 cgd splx(s);
433 1.2 cgd bpf_freed(d);
434 1.110 rpaulo simple_lock(&bpf_slock);
435 1.105 christos LIST_REMOVE(d, bd_list);
436 1.110 rpaulo simple_unlock(&bpf_slock);
437 1.105 christos free(d, M_DEVBUF);
438 1.105 christos fp->f_data = NULL;
439 1.2 cgd
440 1.2 cgd return (0);
441 1.2 cgd }
442 1.2 cgd
443 1.2 cgd /*
444 1.1 cgd * Rotate the packet buffers in descriptor d. Move the store buffer
445 1.12 mycroft * into the hold slot, and the free buffer into the store slot.
446 1.1 cgd * Zero the length of the new store buffer.
447 1.1 cgd */
448 1.1 cgd #define ROTATE_BUFFERS(d) \
449 1.100 darrenr (d)->bd_hbuf = (d)->bd_sbuf; \
450 1.100 darrenr (d)->bd_hlen = (d)->bd_slen; \
451 1.100 darrenr (d)->bd_sbuf = (d)->bd_fbuf; \
452 1.100 darrenr (d)->bd_slen = 0; \
453 1.100 darrenr (d)->bd_fbuf = 0;
454 1.1 cgd /*
455 1.1 cgd * bpfread - read next chunk of packets from buffers
456 1.1 cgd */
457 1.105 christos static int
458 1.105 christos bpf_read(struct file *fp, off_t *offp, struct uio *uio,
459 1.117 elad kauth_cred_t cred, int flags)
460 1.1 cgd {
461 1.105 christos struct bpf_d *d = fp->f_data;
462 1.91 darrenr int timed_out;
463 1.1 cgd int error;
464 1.1 cgd int s;
465 1.1 cgd
466 1.1 cgd /*
467 1.12 mycroft * Restrict application to use a buffer the same size as
468 1.1 cgd * as kernel buffers.
469 1.1 cgd */
470 1.1 cgd if (uio->uio_resid != d->bd_bufsize)
471 1.1 cgd return (EINVAL);
472 1.1 cgd
473 1.61 thorpej s = splnet();
474 1.91 darrenr if (d->bd_state == BPF_WAITING)
475 1.91 darrenr callout_stop(&d->bd_callout);
476 1.91 darrenr timed_out = (d->bd_state == BPF_TIMED_OUT);
477 1.91 darrenr d->bd_state = BPF_IDLE;
478 1.1 cgd /*
479 1.2 cgd * If the hold buffer is empty, then do a timed sleep, which
480 1.2 cgd * ends when the timeout expires or when enough packets
481 1.2 cgd * have arrived to fill the store buffer.
482 1.1 cgd */
483 1.1 cgd while (d->bd_hbuf == 0) {
484 1.105 christos if (fp->f_flag & FNONBLOCK) {
485 1.93 darrenr if (d->bd_slen == 0) {
486 1.100 darrenr splx(s);
487 1.93 darrenr return (EWOULDBLOCK);
488 1.93 darrenr }
489 1.93 darrenr ROTATE_BUFFERS(d);
490 1.93 darrenr break;
491 1.93 darrenr }
492 1.93 darrenr
493 1.91 darrenr if ((d->bd_immediate || timed_out) && d->bd_slen != 0) {
494 1.1 cgd /*
495 1.1 cgd * A packet(s) either arrived since the previous
496 1.1 cgd * read or arrived while we were asleep.
497 1.1 cgd * Rotate the buffers and return what's here.
498 1.1 cgd */
499 1.1 cgd ROTATE_BUFFERS(d);
500 1.1 cgd break;
501 1.1 cgd }
502 1.103 christos error = tsleep(d, PRINET|PCATCH, "bpf",
503 1.93 darrenr d->bd_rtout);
504 1.12 mycroft if (error == EINTR || error == ERESTART) {
505 1.12 mycroft splx(s);
506 1.12 mycroft return (error);
507 1.12 mycroft }
508 1.12 mycroft if (error == EWOULDBLOCK) {
509 1.12 mycroft /*
510 1.12 mycroft * On a timeout, return what's in the buffer,
511 1.12 mycroft * which may be nothing. If there is something
512 1.12 mycroft * in the store buffer, we can rotate the buffers.
513 1.12 mycroft */
514 1.12 mycroft if (d->bd_hbuf)
515 1.1 cgd /*
516 1.12 mycroft * We filled up the buffer in between
517 1.12 mycroft * getting the timeout and arriving
518 1.12 mycroft * here, so we don't need to rotate.
519 1.1 cgd */
520 1.1 cgd break;
521 1.12 mycroft
522 1.100 darrenr if (d->bd_slen == 0) {
523 1.100 darrenr splx(s);
524 1.100 darrenr return (0);
525 1.1 cgd }
526 1.100 darrenr ROTATE_BUFFERS(d);
527 1.100 darrenr break;
528 1.1 cgd }
529 1.36 christos if (error != 0)
530 1.100 darrenr goto done;
531 1.1 cgd }
532 1.100 darrenr /*
533 1.100 darrenr * At this point, we know we have something in the hold slot.
534 1.100 darrenr */
535 1.100 darrenr splx(s);
536 1.100 darrenr
537 1.100 darrenr /*
538 1.100 darrenr * Move data from hold buffer into user space.
539 1.100 darrenr * We know the entire buffer is transferred since
540 1.100 darrenr * we checked above that the read buffer is bpf_bufsize bytes.
541 1.100 darrenr */
542 1.100 darrenr error = uiomove(d->bd_hbuf, d->bd_hlen, uio);
543 1.12 mycroft
544 1.100 darrenr s = splnet();
545 1.100 darrenr d->bd_fbuf = d->bd_hbuf;
546 1.100 darrenr d->bd_hbuf = 0;
547 1.100 darrenr d->bd_hlen = 0;
548 1.100 darrenr done:
549 1.100 darrenr splx(s);
550 1.100 darrenr return (error);
551 1.1 cgd }
552 1.1 cgd
553 1.1 cgd
554 1.1 cgd /*
555 1.12 mycroft * If there are processes sleeping on this descriptor, wake them up.
556 1.1 cgd */
557 1.114 perry static inline void
558 1.111 rpaulo bpf_wakeup(struct bpf_d *d)
559 1.1 cgd {
560 1.103 christos wakeup(d);
561 1.85 jdolecek if (d->bd_async)
562 1.86 christos fownsignal(d->bd_pgid, SIGIO, 0, 0, NULL);
563 1.23 thorpej
564 1.75 jdolecek selnotify(&d->bd_sel, 0);
565 1.2 cgd /* XXX */
566 1.76 christos d->bd_sel.sel_pid = 0;
567 1.1 cgd }
568 1.1 cgd
569 1.91 darrenr
570 1.91 darrenr static void
571 1.111 rpaulo bpf_timed_out(void *arg)
572 1.91 darrenr {
573 1.103 christos struct bpf_d *d = arg;
574 1.91 darrenr int s;
575 1.91 darrenr
576 1.91 darrenr s = splnet();
577 1.91 darrenr if (d->bd_state == BPF_WAITING) {
578 1.91 darrenr d->bd_state = BPF_TIMED_OUT;
579 1.91 darrenr if (d->bd_slen != 0)
580 1.91 darrenr bpf_wakeup(d);
581 1.91 darrenr }
582 1.91 darrenr splx(s);
583 1.91 darrenr }
584 1.91 darrenr
585 1.91 darrenr
586 1.105 christos static int
587 1.105 christos bpf_write(struct file *fp, off_t *offp, struct uio *uio,
588 1.117 elad kauth_cred_t cred, int flags)
589 1.1 cgd {
590 1.105 christos struct bpf_d *d = fp->f_data;
591 1.12 mycroft struct ifnet *ifp;
592 1.12 mycroft struct mbuf *m;
593 1.12 mycroft int error, s;
594 1.56 matt static struct sockaddr_storage dst;
595 1.1 cgd
596 1.116 mrg m = NULL; /* XXX gcc */
597 1.116 mrg
598 1.12 mycroft if (d->bd_bif == 0)
599 1.1 cgd return (ENXIO);
600 1.1 cgd
601 1.12 mycroft ifp = d->bd_bif->bif_ifp;
602 1.11 deraadt
603 1.12 mycroft if (uio->uio_resid == 0)
604 1.12 mycroft return (0);
605 1.11 deraadt
606 1.56 matt error = bpf_movein(uio, (int)d->bd_bif->bif_dlt, ifp->if_mtu, &m,
607 1.56 matt (struct sockaddr *) &dst);
608 1.12 mycroft if (error)
609 1.12 mycroft return (error);
610 1.11 deraadt
611 1.109 peter if (m->m_pkthdr.len > ifp->if_mtu) {
612 1.109 peter m_freem(m);
613 1.1 cgd return (EMSGSIZE);
614 1.109 peter }
615 1.1 cgd
616 1.40 thorpej if (d->bd_hdrcmplt)
617 1.56 matt dst.ss_family = pseudo_AF_HDRCMPLT;
618 1.40 thorpej
619 1.21 mycroft s = splsoftnet();
620 1.56 matt error = (*ifp->if_output)(ifp, m, (struct sockaddr *) &dst, NULL);
621 1.1 cgd splx(s);
622 1.1 cgd /*
623 1.12 mycroft * The driver frees the mbuf.
624 1.1 cgd */
625 1.1 cgd return (error);
626 1.1 cgd }
627 1.1 cgd
628 1.1 cgd /*
629 1.2 cgd * Reset a descriptor by flushing its packet buffer and clearing the
630 1.61 thorpej * receive and drop counts. Should be called at splnet.
631 1.1 cgd */
632 1.1 cgd static void
633 1.111 rpaulo reset_d(struct bpf_d *d)
634 1.1 cgd {
635 1.1 cgd if (d->bd_hbuf) {
636 1.1 cgd /* Free the hold buffer. */
637 1.1 cgd d->bd_fbuf = d->bd_hbuf;
638 1.1 cgd d->bd_hbuf = 0;
639 1.1 cgd }
640 1.1 cgd d->bd_slen = 0;
641 1.2 cgd d->bd_hlen = 0;
642 1.1 cgd d->bd_rcount = 0;
643 1.1 cgd d->bd_dcount = 0;
644 1.94 darrenr d->bd_ccount = 0;
645 1.1 cgd }
646 1.1 cgd
647 1.1 cgd /*
648 1.1 cgd * FIONREAD Check for read packet available.
649 1.1 cgd * BIOCGBLEN Get buffer len [for read()].
650 1.1 cgd * BIOCSETF Set ethernet read filter.
651 1.1 cgd * BIOCFLUSH Flush read packet buffer.
652 1.1 cgd * BIOCPROMISC Put interface into promiscuous mode.
653 1.1 cgd * BIOCGDLT Get link layer type.
654 1.1 cgd * BIOCGETIF Get interface name.
655 1.1 cgd * BIOCSETIF Set interface.
656 1.1 cgd * BIOCSRTIMEOUT Set read timeout.
657 1.1 cgd * BIOCGRTIMEOUT Get read timeout.
658 1.1 cgd * BIOCGSTATS Get packet stats.
659 1.1 cgd * BIOCIMMEDIATE Set immediate mode.
660 1.2 cgd * BIOCVERSION Get filter language version.
661 1.113 rpaulo * BIOCGHDRCMPLT Get "header already complete" flag.
662 1.113 rpaulo * BIOCSHDRCMPLT Set "header already complete" flag.
663 1.1 cgd */
664 1.1 cgd /* ARGSUSED */
665 1.105 christos static int
666 1.112 christos bpf_ioctl(struct file *fp, u_long cmd, void *addr, struct lwp *l)
667 1.1 cgd {
668 1.105 christos struct bpf_d *d = fp->f_data;
669 1.1 cgd int s, error = 0;
670 1.1 cgd
671 1.110 rpaulo /*
672 1.110 rpaulo * Refresh the PID associated with this bpf file.
673 1.110 rpaulo */
674 1.112 christos d->bd_pid = l->l_proc->p_pid;
675 1.110 rpaulo
676 1.91 darrenr s = splnet();
677 1.91 darrenr if (d->bd_state == BPF_WAITING)
678 1.91 darrenr callout_stop(&d->bd_callout);
679 1.91 darrenr d->bd_state = BPF_IDLE;
680 1.91 darrenr splx(s);
681 1.91 darrenr
682 1.1 cgd switch (cmd) {
683 1.1 cgd
684 1.1 cgd default:
685 1.1 cgd error = EINVAL;
686 1.1 cgd break;
687 1.1 cgd
688 1.1 cgd /*
689 1.1 cgd * Check for read packet available.
690 1.1 cgd */
691 1.1 cgd case FIONREAD:
692 1.1 cgd {
693 1.1 cgd int n;
694 1.12 mycroft
695 1.61 thorpej s = splnet();
696 1.1 cgd n = d->bd_slen;
697 1.12 mycroft if (d->bd_hbuf)
698 1.1 cgd n += d->bd_hlen;
699 1.1 cgd splx(s);
700 1.1 cgd
701 1.1 cgd *(int *)addr = n;
702 1.1 cgd break;
703 1.1 cgd }
704 1.1 cgd
705 1.1 cgd /*
706 1.2 cgd * Get buffer len [for read()].
707 1.1 cgd */
708 1.2 cgd case BIOCGBLEN:
709 1.2 cgd *(u_int *)addr = d->bd_bufsize;
710 1.1 cgd break;
711 1.2 cgd
712 1.1 cgd /*
713 1.2 cgd * Set buffer length.
714 1.1 cgd */
715 1.2 cgd case BIOCSBLEN:
716 1.2 cgd if (d->bd_bif != 0)
717 1.2 cgd error = EINVAL;
718 1.2 cgd else {
719 1.53 augustss u_int size = *(u_int *)addr;
720 1.2 cgd
721 1.87 jonathan if (size > bpf_maxbufsize)
722 1.87 jonathan *(u_int *)addr = size = bpf_maxbufsize;
723 1.2 cgd else if (size < BPF_MINBUFSIZE)
724 1.2 cgd *(u_int *)addr = size = BPF_MINBUFSIZE;
725 1.2 cgd d->bd_bufsize = size;
726 1.2 cgd }
727 1.1 cgd break;
728 1.1 cgd
729 1.1 cgd /*
730 1.2 cgd * Set link layer read filter.
731 1.1 cgd */
732 1.12 mycroft case BIOCSETF:
733 1.103 christos error = bpf_setf(d, addr);
734 1.1 cgd break;
735 1.1 cgd
736 1.1 cgd /*
737 1.1 cgd * Flush read packet buffer.
738 1.1 cgd */
739 1.1 cgd case BIOCFLUSH:
740 1.61 thorpej s = splnet();
741 1.1 cgd reset_d(d);
742 1.1 cgd splx(s);
743 1.1 cgd break;
744 1.1 cgd
745 1.1 cgd /*
746 1.1 cgd * Put interface into promiscuous mode.
747 1.1 cgd */
748 1.1 cgd case BIOCPROMISC:
749 1.1 cgd if (d->bd_bif == 0) {
750 1.1 cgd /*
751 1.1 cgd * No interface attached yet.
752 1.1 cgd */
753 1.1 cgd error = EINVAL;
754 1.1 cgd break;
755 1.1 cgd }
756 1.61 thorpej s = splnet();
757 1.1 cgd if (d->bd_promisc == 0) {
758 1.1 cgd error = ifpromisc(d->bd_bif->bif_ifp, 1);
759 1.2 cgd if (error == 0)
760 1.2 cgd d->bd_promisc = 1;
761 1.1 cgd }
762 1.1 cgd splx(s);
763 1.1 cgd break;
764 1.1 cgd
765 1.1 cgd /*
766 1.1 cgd * Get device parameters.
767 1.1 cgd */
768 1.1 cgd case BIOCGDLT:
769 1.1 cgd if (d->bd_bif == 0)
770 1.1 cgd error = EINVAL;
771 1.1 cgd else
772 1.1 cgd *(u_int *)addr = d->bd_bif->bif_dlt;
773 1.1 cgd break;
774 1.1 cgd
775 1.1 cgd /*
776 1.66 onoe * Get a list of supported device parameters.
777 1.66 onoe */
778 1.66 onoe case BIOCGDLTLIST:
779 1.66 onoe if (d->bd_bif == 0)
780 1.66 onoe error = EINVAL;
781 1.66 onoe else
782 1.103 christos error = bpf_getdltlist(d, addr);
783 1.66 onoe break;
784 1.66 onoe
785 1.66 onoe /*
786 1.66 onoe * Set device parameters.
787 1.66 onoe */
788 1.66 onoe case BIOCSDLT:
789 1.66 onoe if (d->bd_bif == 0)
790 1.66 onoe error = EINVAL;
791 1.66 onoe else
792 1.66 onoe error = bpf_setdlt(d, *(u_int *)addr);
793 1.66 onoe break;
794 1.66 onoe
795 1.66 onoe /*
796 1.1 cgd * Set interface name.
797 1.1 cgd */
798 1.1 cgd case BIOCGETIF:
799 1.1 cgd if (d->bd_bif == 0)
800 1.1 cgd error = EINVAL;
801 1.1 cgd else
802 1.103 christos bpf_ifname(d->bd_bif->bif_ifp, addr);
803 1.1 cgd break;
804 1.1 cgd
805 1.1 cgd /*
806 1.1 cgd * Set interface.
807 1.1 cgd */
808 1.1 cgd case BIOCSETIF:
809 1.103 christos error = bpf_setif(d, addr);
810 1.1 cgd break;
811 1.1 cgd
812 1.1 cgd /*
813 1.1 cgd * Set read timeout.
814 1.1 cgd */
815 1.12 mycroft case BIOCSRTIMEOUT:
816 1.1 cgd {
817 1.103 christos struct timeval *tv = addr;
818 1.1 cgd
819 1.19 cgd /* Compute number of ticks. */
820 1.19 cgd d->bd_rtout = tv->tv_sec * hz + tv->tv_usec / tick;
821 1.33 thorpej if ((d->bd_rtout == 0) && (tv->tv_usec != 0))
822 1.33 thorpej d->bd_rtout = 1;
823 1.1 cgd break;
824 1.1 cgd }
825 1.1 cgd
826 1.1 cgd /*
827 1.1 cgd * Get read timeout.
828 1.1 cgd */
829 1.12 mycroft case BIOCGRTIMEOUT:
830 1.1 cgd {
831 1.103 christos struct timeval *tv = addr;
832 1.1 cgd
833 1.19 cgd tv->tv_sec = d->bd_rtout / hz;
834 1.19 cgd tv->tv_usec = (d->bd_rtout % hz) * tick;
835 1.1 cgd break;
836 1.1 cgd }
837 1.1 cgd
838 1.1 cgd /*
839 1.1 cgd * Get packet stats.
840 1.1 cgd */
841 1.1 cgd case BIOCGSTATS:
842 1.1 cgd {
843 1.103 christos struct bpf_stat *bs = addr;
844 1.1 cgd
845 1.1 cgd bs->bs_recv = d->bd_rcount;
846 1.1 cgd bs->bs_drop = d->bd_dcount;
847 1.94 darrenr bs->bs_capt = d->bd_ccount;
848 1.94 darrenr break;
849 1.94 darrenr }
850 1.94 darrenr
851 1.94 darrenr case BIOCGSTATSOLD:
852 1.94 darrenr {
853 1.103 christos struct bpf_stat_old *bs = addr;
854 1.94 darrenr
855 1.94 darrenr bs->bs_recv = d->bd_rcount;
856 1.94 darrenr bs->bs_drop = d->bd_dcount;
857 1.1 cgd break;
858 1.1 cgd }
859 1.1 cgd
860 1.1 cgd /*
861 1.1 cgd * Set immediate mode.
862 1.1 cgd */
863 1.1 cgd case BIOCIMMEDIATE:
864 1.1 cgd d->bd_immediate = *(u_int *)addr;
865 1.1 cgd break;
866 1.2 cgd
867 1.2 cgd case BIOCVERSION:
868 1.2 cgd {
869 1.103 christos struct bpf_version *bv = addr;
870 1.2 cgd
871 1.2 cgd bv->bv_major = BPF_MAJOR_VERSION;
872 1.2 cgd bv->bv_minor = BPF_MINOR_VERSION;
873 1.2 cgd break;
874 1.12 mycroft }
875 1.23 thorpej
876 1.40 thorpej case BIOCGHDRCMPLT: /* get "header already complete" flag */
877 1.40 thorpej *(u_int *)addr = d->bd_hdrcmplt;
878 1.40 thorpej break;
879 1.40 thorpej
880 1.40 thorpej case BIOCSHDRCMPLT: /* set "header already complete" flag */
881 1.40 thorpej d->bd_hdrcmplt = *(u_int *)addr ? 1 : 0;
882 1.40 thorpej break;
883 1.23 thorpej
884 1.91 darrenr /*
885 1.91 darrenr * Get "see sent packets" flag
886 1.91 darrenr */
887 1.91 darrenr case BIOCGSEESENT:
888 1.91 darrenr *(u_int *)addr = d->bd_seesent;
889 1.91 darrenr break;
890 1.91 darrenr
891 1.91 darrenr /*
892 1.91 darrenr * Set "see sent" packets flag
893 1.91 darrenr */
894 1.91 darrenr case BIOCSSEESENT:
895 1.91 darrenr d->bd_seesent = *(u_int *)addr;
896 1.91 darrenr break;
897 1.91 darrenr
898 1.23 thorpej case FIONBIO: /* Non-blocking I/O */
899 1.93 darrenr /*
900 1.93 darrenr * No need to do anything special as we use IO_NDELAY in
901 1.93 darrenr * bpfread() as an indication of whether or not to block
902 1.93 darrenr * the read.
903 1.93 darrenr */
904 1.23 thorpej break;
905 1.23 thorpej
906 1.23 thorpej case FIOASYNC: /* Send signal on receive packets */
907 1.23 thorpej d->bd_async = *(int *)addr;
908 1.23 thorpej break;
909 1.23 thorpej
910 1.23 thorpej case TIOCSPGRP: /* Process or group to send signals to */
911 1.85 jdolecek case FIOSETOWN:
912 1.112 christos error = fsetown(l->l_proc, &d->bd_pgid, cmd, addr);
913 1.23 thorpej break;
914 1.23 thorpej
915 1.23 thorpej case TIOCGPGRP:
916 1.85 jdolecek case FIOGETOWN:
917 1.112 christos error = fgetown(l->l_proc, d->bd_pgid, cmd, addr);
918 1.23 thorpej break;
919 1.1 cgd }
920 1.1 cgd return (error);
921 1.1 cgd }
922 1.1 cgd
923 1.12 mycroft /*
924 1.2 cgd * Set d's packet filter program to fp. If this file already has a filter,
925 1.1 cgd * free it and replace it. Returns EINVAL for bogus requests.
926 1.1 cgd */
927 1.1 cgd int
928 1.103 christos bpf_setf(struct bpf_d *d, struct bpf_program *fp)
929 1.1 cgd {
930 1.1 cgd struct bpf_insn *fcode, *old;
931 1.1 cgd u_int flen, size;
932 1.1 cgd int s;
933 1.1 cgd
934 1.1 cgd old = d->bd_filter;
935 1.1 cgd if (fp->bf_insns == 0) {
936 1.1 cgd if (fp->bf_len != 0)
937 1.1 cgd return (EINVAL);
938 1.61 thorpej s = splnet();
939 1.1 cgd d->bd_filter = 0;
940 1.1 cgd reset_d(d);
941 1.1 cgd splx(s);
942 1.1 cgd if (old != 0)
943 1.103 christos free(old, M_DEVBUF);
944 1.1 cgd return (0);
945 1.1 cgd }
946 1.1 cgd flen = fp->bf_len;
947 1.1 cgd if (flen > BPF_MAXINSNS)
948 1.1 cgd return (EINVAL);
949 1.1 cgd
950 1.1 cgd size = flen * sizeof(*fp->bf_insns);
951 1.103 christos fcode = malloc(size, M_DEVBUF, M_WAITOK);
952 1.103 christos if (copyin(fp->bf_insns, fcode, size) == 0 &&
953 1.2 cgd bpf_validate(fcode, (int)flen)) {
954 1.61 thorpej s = splnet();
955 1.1 cgd d->bd_filter = fcode;
956 1.1 cgd reset_d(d);
957 1.1 cgd splx(s);
958 1.1 cgd if (old != 0)
959 1.103 christos free(old, M_DEVBUF);
960 1.1 cgd
961 1.1 cgd return (0);
962 1.1 cgd }
963 1.103 christos free(fcode, M_DEVBUF);
964 1.1 cgd return (EINVAL);
965 1.1 cgd }
966 1.1 cgd
967 1.1 cgd /*
968 1.2 cgd * Detach a file from its current interface (if attached at all) and attach
969 1.2 cgd * to the interface indicated by the name stored in ifr.
970 1.2 cgd * Return an errno or 0.
971 1.1 cgd */
972 1.1 cgd static int
973 1.103 christos bpf_setif(struct bpf_d *d, struct ifreq *ifr)
974 1.1 cgd {
975 1.1 cgd struct bpf_if *bp;
976 1.1 cgd char *cp;
977 1.26 thorpej int unit_seen, i, s, error;
978 1.1 cgd
979 1.1 cgd /*
980 1.26 thorpej * Make sure the provided name has a unit number, and default
981 1.26 thorpej * it to '0' if not specified.
982 1.26 thorpej * XXX This is ugly ... do this differently?
983 1.1 cgd */
984 1.26 thorpej unit_seen = 0;
985 1.1 cgd cp = ifr->ifr_name;
986 1.26 thorpej cp[sizeof(ifr->ifr_name) - 1] = '\0'; /* sanity */
987 1.26 thorpej while (*cp++)
988 1.26 thorpej if (*cp >= '0' && *cp <= '9')
989 1.26 thorpej unit_seen = 1;
990 1.26 thorpej if (!unit_seen) {
991 1.26 thorpej /* Make sure to leave room for the '\0'. */
992 1.26 thorpej for (i = 0; i < (IFNAMSIZ - 1); ++i) {
993 1.26 thorpej if ((ifr->ifr_name[i] >= 'a' &&
994 1.26 thorpej ifr->ifr_name[i] <= 'z') ||
995 1.26 thorpej (ifr->ifr_name[i] >= 'A' &&
996 1.26 thorpej ifr->ifr_name[i] <= 'Z'))
997 1.26 thorpej continue;
998 1.26 thorpej ifr->ifr_name[i] = '0';
999 1.1 cgd }
1000 1.1 cgd }
1001 1.26 thorpej
1002 1.1 cgd /*
1003 1.1 cgd * Look through attached interfaces for the named one.
1004 1.1 cgd */
1005 1.1 cgd for (bp = bpf_iflist; bp != 0; bp = bp->bif_next) {
1006 1.1 cgd struct ifnet *ifp = bp->bif_ifp;
1007 1.1 cgd
1008 1.26 thorpej if (ifp == 0 ||
1009 1.26 thorpej strcmp(ifp->if_xname, ifr->ifr_name) != 0)
1010 1.1 cgd continue;
1011 1.66 onoe /* skip additional entry */
1012 1.66 onoe if (bp->bif_driverp != (struct bpf_if **)&ifp->if_bpf)
1013 1.66 onoe continue;
1014 1.1 cgd /*
1015 1.2 cgd * We found the requested interface.
1016 1.2 cgd * Allocate the packet buffers if we need to.
1017 1.2 cgd * If we're already attached to requested interface,
1018 1.2 cgd * just flush the buffer.
1019 1.1 cgd */
1020 1.2 cgd if (d->bd_sbuf == 0) {
1021 1.2 cgd error = bpf_allocbufs(d);
1022 1.2 cgd if (error != 0)
1023 1.2 cgd return (error);
1024 1.2 cgd }
1025 1.61 thorpej s = splnet();
1026 1.1 cgd if (bp != d->bd_bif) {
1027 1.1 cgd if (d->bd_bif)
1028 1.12 mycroft /*
1029 1.1 cgd * Detach if attached to something else.
1030 1.1 cgd */
1031 1.1 cgd bpf_detachd(d);
1032 1.1 cgd
1033 1.1 cgd bpf_attachd(d, bp);
1034 1.1 cgd }
1035 1.1 cgd reset_d(d);
1036 1.1 cgd splx(s);
1037 1.1 cgd return (0);
1038 1.1 cgd }
1039 1.1 cgd /* Not found. */
1040 1.1 cgd return (ENXIO);
1041 1.1 cgd }
1042 1.1 cgd
1043 1.1 cgd /*
1044 1.26 thorpej * Copy the interface name to the ifreq.
1045 1.1 cgd */
1046 1.1 cgd static void
1047 1.103 christos bpf_ifname(struct ifnet *ifp, struct ifreq *ifr)
1048 1.1 cgd {
1049 1.41 perry memcpy(ifr->ifr_name, ifp->if_xname, IFNAMSIZ);
1050 1.1 cgd }
1051 1.1 cgd
1052 1.1 cgd /*
1053 1.36 christos * Support for poll() system call
1054 1.1 cgd *
1055 1.64 darrenr * Return true iff the specific operation will not block indefinitely - with
1056 1.64 darrenr * the assumption that it is safe to positively acknowledge a request for the
1057 1.64 darrenr * ability to write to the BPF device.
1058 1.2 cgd * Otherwise, return false but make a note that a selwakeup() must be done.
1059 1.1 cgd */
1060 1.105 christos static int
1061 1.112 christos bpf_poll(struct file *fp, int events, struct lwp *l)
1062 1.1 cgd {
1063 1.105 christos struct bpf_d *d = fp->f_data;
1064 1.61 thorpej int s = splnet();
1065 1.64 darrenr int revents;
1066 1.12 mycroft
1067 1.110 rpaulo /*
1068 1.110 rpaulo * Refresh the PID associated with this bpf file.
1069 1.110 rpaulo */
1070 1.112 christos d->bd_pid = l->l_proc->p_pid;
1071 1.110 rpaulo
1072 1.64 darrenr revents = events & (POLLOUT | POLLWRNORM);
1073 1.44 thorpej if (events & (POLLIN | POLLRDNORM)) {
1074 1.64 darrenr /*
1075 1.64 darrenr * An imitation of the FIONREAD ioctl code.
1076 1.64 darrenr */
1077 1.93 darrenr if ((d->bd_hlen != 0) ||
1078 1.93 darrenr (d->bd_immediate && d->bd_slen != 0)) {
1079 1.30 mycroft revents |= events & (POLLIN | POLLRDNORM);
1080 1.93 darrenr } else if (d->bd_state == BPF_TIMED_OUT) {
1081 1.95 darrenr if (d->bd_slen != 0)
1082 1.95 darrenr revents |= events & (POLLIN | POLLRDNORM);
1083 1.95 darrenr else
1084 1.95 darrenr revents |= events & POLLIN;
1085 1.92 darrenr } else {
1086 1.112 christos selrecord(l, &d->bd_sel);
1087 1.91 darrenr /* Start the read timeout if necessary */
1088 1.91 darrenr if (d->bd_rtout > 0 && d->bd_state == BPF_IDLE) {
1089 1.91 darrenr callout_reset(&d->bd_callout, d->bd_rtout,
1090 1.91 darrenr bpf_timed_out, d);
1091 1.91 darrenr d->bd_state = BPF_WAITING;
1092 1.91 darrenr }
1093 1.91 darrenr }
1094 1.44 thorpej }
1095 1.12 mycroft
1096 1.12 mycroft splx(s);
1097 1.30 mycroft return (revents);
1098 1.75 jdolecek }
1099 1.75 jdolecek
1100 1.75 jdolecek static void
1101 1.75 jdolecek filt_bpfrdetach(struct knote *kn)
1102 1.75 jdolecek {
1103 1.75 jdolecek struct bpf_d *d = kn->kn_hook;
1104 1.75 jdolecek int s;
1105 1.75 jdolecek
1106 1.75 jdolecek s = splnet();
1107 1.76 christos SLIST_REMOVE(&d->bd_sel.sel_klist, kn, knote, kn_selnext);
1108 1.75 jdolecek splx(s);
1109 1.75 jdolecek }
1110 1.75 jdolecek
1111 1.75 jdolecek static int
1112 1.75 jdolecek filt_bpfread(struct knote *kn, long hint)
1113 1.75 jdolecek {
1114 1.75 jdolecek struct bpf_d *d = kn->kn_hook;
1115 1.75 jdolecek
1116 1.75 jdolecek kn->kn_data = d->bd_hlen;
1117 1.75 jdolecek if (d->bd_immediate)
1118 1.75 jdolecek kn->kn_data += d->bd_slen;
1119 1.75 jdolecek return (kn->kn_data > 0);
1120 1.75 jdolecek }
1121 1.75 jdolecek
1122 1.75 jdolecek static const struct filterops bpfread_filtops =
1123 1.75 jdolecek { 1, NULL, filt_bpfrdetach, filt_bpfread };
1124 1.75 jdolecek
1125 1.105 christos static int
1126 1.105 christos bpf_kqfilter(struct file *fp, struct knote *kn)
1127 1.75 jdolecek {
1128 1.105 christos struct bpf_d *d = fp->f_data;
1129 1.75 jdolecek struct klist *klist;
1130 1.75 jdolecek int s;
1131 1.75 jdolecek
1132 1.75 jdolecek switch (kn->kn_filter) {
1133 1.75 jdolecek case EVFILT_READ:
1134 1.76 christos klist = &d->bd_sel.sel_klist;
1135 1.75 jdolecek kn->kn_fop = &bpfread_filtops;
1136 1.75 jdolecek break;
1137 1.75 jdolecek
1138 1.75 jdolecek default:
1139 1.75 jdolecek return (1);
1140 1.75 jdolecek }
1141 1.75 jdolecek
1142 1.75 jdolecek kn->kn_hook = d;
1143 1.75 jdolecek
1144 1.75 jdolecek s = splnet();
1145 1.75 jdolecek SLIST_INSERT_HEAD(klist, kn, kn_selnext);
1146 1.75 jdolecek splx(s);
1147 1.75 jdolecek
1148 1.75 jdolecek return (0);
1149 1.1 cgd }
1150 1.1 cgd
1151 1.1 cgd /*
1152 1.2 cgd * Incoming linkage from device drivers. Process the packet pkt, of length
1153 1.2 cgd * pktlen, which is stored in a contiguous buffer. The packet is parsed
1154 1.2 cgd * by each process' filter, and if accepted, stashed into the corresponding
1155 1.2 cgd * buffer.
1156 1.1 cgd */
1157 1.1 cgd void
1158 1.103 christos bpf_tap(void *arg, u_char *pkt, u_int pktlen)
1159 1.1 cgd {
1160 1.1 cgd struct bpf_if *bp;
1161 1.53 augustss struct bpf_d *d;
1162 1.53 augustss u_int slen;
1163 1.1 cgd /*
1164 1.1 cgd * Note that the ipl does not have to be raised at this point.
1165 1.1 cgd * The only problem that could arise here is that if two different
1166 1.1 cgd * interfaces shared any data. This is not the case.
1167 1.1 cgd */
1168 1.103 christos bp = arg;
1169 1.1 cgd for (d = bp->bif_dlist; d != 0; d = d->bd_next) {
1170 1.1 cgd ++d->bd_rcount;
1171 1.110 rpaulo ++bpf_gstats.bs_recv;
1172 1.1 cgd slen = bpf_filter(d->bd_filter, pkt, pktlen, pktlen);
1173 1.1 cgd if (slen != 0)
1174 1.41 perry catchpacket(d, pkt, pktlen, slen, memcpy);
1175 1.1 cgd }
1176 1.1 cgd }
1177 1.1 cgd
1178 1.1 cgd /*
1179 1.1 cgd * Copy data from an mbuf chain into a buffer. This code is derived
1180 1.1 cgd * from m_copydata in sys/uipc_mbuf.c.
1181 1.1 cgd */
1182 1.43 perry static void *
1183 1.103 christos bpf_mcpy(void *dst_arg, const void *src_arg, size_t len)
1184 1.12 mycroft {
1185 1.53 augustss const struct mbuf *m;
1186 1.53 augustss u_int count;
1187 1.1 cgd u_char *dst;
1188 1.1 cgd
1189 1.12 mycroft m = src_arg;
1190 1.12 mycroft dst = dst_arg;
1191 1.1 cgd while (len > 0) {
1192 1.1 cgd if (m == 0)
1193 1.41 perry panic("bpf_mcpy");
1194 1.12 mycroft count = min(m->m_len, len);
1195 1.103 christos memcpy(dst, mtod(m, void *), count);
1196 1.1 cgd m = m->m_next;
1197 1.1 cgd dst += count;
1198 1.1 cgd len -= count;
1199 1.1 cgd }
1200 1.68 itojun return (dst_arg);
1201 1.1 cgd }
1202 1.1 cgd
1203 1.1 cgd /*
1204 1.96 dyoung * Dispatch a packet to all the listeners on interface bp.
1205 1.96 dyoung *
1206 1.96 dyoung * marg pointer to the packet, either a data buffer or an mbuf chain
1207 1.96 dyoung * buflen buffer length, if marg is a data buffer
1208 1.96 dyoung * cpfn a function that can copy marg into the listener's buffer
1209 1.96 dyoung * pktlen length of the packet
1210 1.96 dyoung * rcvif either NULL or the interface the packet came in on.
1211 1.96 dyoung */
1212 1.114 perry static inline void
1213 1.96 dyoung bpf_deliver(struct bpf_if *bp, void *(*cpfn)(void *, const void *, size_t),
1214 1.111 rpaulo void *marg, u_int pktlen, u_int buflen, struct ifnet *rcvif)
1215 1.96 dyoung {
1216 1.96 dyoung u_int slen;
1217 1.96 dyoung struct bpf_d *d;
1218 1.96 dyoung
1219 1.96 dyoung for (d = bp->bif_dlist; d != 0; d = d->bd_next) {
1220 1.96 dyoung if (!d->bd_seesent && (rcvif == NULL))
1221 1.96 dyoung continue;
1222 1.96 dyoung ++d->bd_rcount;
1223 1.110 rpaulo ++bpf_gstats.bs_recv;
1224 1.96 dyoung slen = bpf_filter(d->bd_filter, marg, pktlen, buflen);
1225 1.96 dyoung if (slen != 0)
1226 1.96 dyoung catchpacket(d, marg, pktlen, slen, cpfn);
1227 1.96 dyoung }
1228 1.96 dyoung }
1229 1.96 dyoung
1230 1.96 dyoung /*
1231 1.96 dyoung * Incoming linkage from device drivers, when the head of the packet is in
1232 1.96 dyoung * a buffer, and the tail is in an mbuf chain.
1233 1.96 dyoung */
1234 1.96 dyoung void
1235 1.103 christos bpf_mtap2(void *arg, void *data, u_int dlen, struct mbuf *m)
1236 1.96 dyoung {
1237 1.103 christos struct bpf_if *bp = arg;
1238 1.96 dyoung u_int pktlen;
1239 1.96 dyoung struct mbuf mb;
1240 1.96 dyoung
1241 1.101 dyoung pktlen = m_length(m) + dlen;
1242 1.96 dyoung
1243 1.96 dyoung /*
1244 1.96 dyoung * Craft on-stack mbuf suitable for passing to bpf_filter.
1245 1.96 dyoung * Note that we cut corners here; we only setup what's
1246 1.96 dyoung * absolutely needed--this mbuf should never go anywhere else.
1247 1.96 dyoung */
1248 1.101 dyoung (void)memset(&mb, 0, sizeof(mb));
1249 1.96 dyoung mb.m_next = m;
1250 1.96 dyoung mb.m_data = data;
1251 1.96 dyoung mb.m_len = dlen;
1252 1.96 dyoung
1253 1.96 dyoung bpf_deliver(bp, bpf_mcpy, &mb, pktlen, 0, m->m_pkthdr.rcvif);
1254 1.96 dyoung }
1255 1.96 dyoung
1256 1.96 dyoung /*
1257 1.2 cgd * Incoming linkage from device drivers, when packet is in an mbuf chain.
1258 1.1 cgd */
1259 1.1 cgd void
1260 1.103 christos bpf_mtap(void *arg, struct mbuf *m)
1261 1.1 cgd {
1262 1.103 christos void *(*cpfn)(void *, const void *, size_t);
1263 1.103 christos struct bpf_if *bp = arg;
1264 1.96 dyoung u_int pktlen, buflen;
1265 1.91 darrenr void *marg;
1266 1.1 cgd
1267 1.101 dyoung pktlen = m_length(m);
1268 1.1 cgd
1269 1.91 darrenr if (pktlen == m->m_len) {
1270 1.91 darrenr cpfn = memcpy;
1271 1.91 darrenr marg = mtod(m, void *);
1272 1.91 darrenr buflen = pktlen;
1273 1.91 darrenr } else {
1274 1.91 darrenr cpfn = bpf_mcpy;
1275 1.91 darrenr marg = m;
1276 1.91 darrenr buflen = 0;
1277 1.91 darrenr }
1278 1.91 darrenr
1279 1.96 dyoung bpf_deliver(bp, cpfn, marg, pktlen, buflen, m->m_pkthdr.rcvif);
1280 1.1 cgd }
1281 1.1 cgd
1282 1.1 cgd /*
1283 1.104 christos * We need to prepend the address family as
1284 1.104 christos * a four byte field. Cons up a dummy header
1285 1.104 christos * to pacify bpf. This is safe because bpf
1286 1.104 christos * will only read from the mbuf (i.e., it won't
1287 1.104 christos * try to free it or keep a pointer a to it).
1288 1.104 christos */
1289 1.104 christos void
1290 1.104 christos bpf_mtap_af(void *arg, u_int32_t af, struct mbuf *m)
1291 1.104 christos {
1292 1.104 christos struct mbuf m0;
1293 1.107 perry
1294 1.104 christos m0.m_flags = 0;
1295 1.104 christos m0.m_next = m;
1296 1.104 christos m0.m_len = 4;
1297 1.104 christos m0.m_data = (char *)⁡
1298 1.104 christos
1299 1.104 christos bpf_mtap(arg, &m0);
1300 1.104 christos }
1301 1.104 christos
1302 1.104 christos void
1303 1.104 christos bpf_mtap_et(void *arg, u_int16_t et, struct mbuf *m)
1304 1.104 christos {
1305 1.104 christos struct mbuf m0;
1306 1.104 christos
1307 1.104 christos m0.m_flags = 0;
1308 1.104 christos m0.m_next = m;
1309 1.104 christos m0.m_len = 14;
1310 1.104 christos m0.m_data = m0.m_dat;
1311 1.104 christos
1312 1.104 christos ((u_int32_t *)m0.m_data)[0] = 0;
1313 1.104 christos ((u_int32_t *)m0.m_data)[1] = 0;
1314 1.104 christos ((u_int32_t *)m0.m_data)[2] = 0;
1315 1.104 christos ((u_int16_t *)m0.m_data)[6] = et;
1316 1.104 christos
1317 1.104 christos bpf_mtap(arg, &m0);
1318 1.104 christos }
1319 1.104 christos
1320 1.104 christos #if NSL > 0 || NSTRIP > 0
1321 1.104 christos /*
1322 1.104 christos * Put the SLIP pseudo-"link header" in place.
1323 1.104 christos * Note this M_PREPEND() should never fail,
1324 1.104 christos * swince we know we always have enough space
1325 1.104 christos * in the input buffer.
1326 1.104 christos */
1327 1.104 christos void
1328 1.104 christos bpf_mtap_sl_in(void *arg, u_char *chdr, struct mbuf **m)
1329 1.104 christos {
1330 1.104 christos int s;
1331 1.104 christos u_char *hp;
1332 1.104 christos
1333 1.104 christos M_PREPEND(*m, SLIP_HDRLEN, M_DONTWAIT);
1334 1.104 christos if (*m == NULL)
1335 1.104 christos return;
1336 1.104 christos
1337 1.104 christos hp = mtod(*m, u_char *);
1338 1.104 christos hp[SLX_DIR] = SLIPDIR_IN;
1339 1.104 christos (void)memcpy(&hp[SLX_CHDR], chdr, CHDR_LEN);
1340 1.104 christos
1341 1.104 christos s = splnet();
1342 1.104 christos bpf_mtap(arg, *m);
1343 1.104 christos splx(s);
1344 1.104 christos
1345 1.104 christos m_adj(*m, SLIP_HDRLEN);
1346 1.104 christos }
1347 1.104 christos
1348 1.104 christos /*
1349 1.104 christos * Put the SLIP pseudo-"link header" in
1350 1.104 christos * place. The compressed header is now
1351 1.104 christos * at the beginning of the mbuf.
1352 1.104 christos */
1353 1.104 christos void
1354 1.104 christos bpf_mtap_sl_out(void *arg, u_char *chdr, struct mbuf *m)
1355 1.104 christos {
1356 1.104 christos struct mbuf m0;
1357 1.104 christos u_char *hp;
1358 1.104 christos int s;
1359 1.104 christos
1360 1.104 christos m0.m_flags = 0;
1361 1.104 christos m0.m_next = m;
1362 1.104 christos m0.m_data = m0.m_dat;
1363 1.104 christos m0.m_len = SLIP_HDRLEN;
1364 1.104 christos
1365 1.104 christos hp = mtod(&m0, u_char *);
1366 1.104 christos
1367 1.104 christos hp[SLX_DIR] = SLIPDIR_OUT;
1368 1.104 christos (void)memcpy(&hp[SLX_CHDR], chdr, CHDR_LEN);
1369 1.104 christos
1370 1.104 christos s = splnet();
1371 1.104 christos bpf_mtap(arg, &m0);
1372 1.104 christos splx(s);
1373 1.104 christos m_freem(m);
1374 1.104 christos }
1375 1.104 christos #endif
1376 1.104 christos
1377 1.104 christos /*
1378 1.1 cgd * Move the packet data from interface memory (pkt) into the
1379 1.1 cgd * store buffer. Return 1 if it's time to wakeup a listener (buffer full),
1380 1.2 cgd * otherwise 0. "copy" is the routine called to do the actual data
1381 1.41 perry * transfer. memcpy is passed in to copy contiguous chunks, while
1382 1.41 perry * bpf_mcpy is passed in to copy mbuf chains. In the latter case,
1383 1.2 cgd * pkt is really an mbuf.
1384 1.1 cgd */
1385 1.1 cgd static void
1386 1.103 christos catchpacket(struct bpf_d *d, u_char *pkt, u_int pktlen, u_int snaplen,
1387 1.111 rpaulo void *(*cpfn)(void *, const void *, size_t))
1388 1.53 augustss {
1389 1.53 augustss struct bpf_hdr *hp;
1390 1.53 augustss int totlen, curlen;
1391 1.53 augustss int hdrlen = d->bd_bif->bif_hdrlen;
1392 1.94 darrenr
1393 1.94 darrenr ++d->bd_ccount;
1394 1.110 rpaulo ++bpf_gstats.bs_capt;
1395 1.1 cgd /*
1396 1.1 cgd * Figure out how many bytes to move. If the packet is
1397 1.1 cgd * greater or equal to the snapshot length, transfer that
1398 1.1 cgd * much. Otherwise, transfer the whole packet (unless
1399 1.1 cgd * we hit the buffer size limit).
1400 1.1 cgd */
1401 1.12 mycroft totlen = hdrlen + min(snaplen, pktlen);
1402 1.1 cgd if (totlen > d->bd_bufsize)
1403 1.1 cgd totlen = d->bd_bufsize;
1404 1.1 cgd
1405 1.1 cgd /*
1406 1.1 cgd * Round up the end of the previous packet to the next longword.
1407 1.1 cgd */
1408 1.1 cgd curlen = BPF_WORDALIGN(d->bd_slen);
1409 1.1 cgd if (curlen + totlen > d->bd_bufsize) {
1410 1.1 cgd /*
1411 1.1 cgd * This packet will overflow the storage buffer.
1412 1.1 cgd * Rotate the buffers if we can, then wakeup any
1413 1.1 cgd * pending reads.
1414 1.1 cgd */
1415 1.100 darrenr if (d->bd_fbuf == 0) {
1416 1.12 mycroft /*
1417 1.12 mycroft * We haven't completed the previous read yet,
1418 1.1 cgd * so drop the packet.
1419 1.1 cgd */
1420 1.1 cgd ++d->bd_dcount;
1421 1.110 rpaulo ++bpf_gstats.bs_drop;
1422 1.1 cgd return;
1423 1.1 cgd }
1424 1.1 cgd ROTATE_BUFFERS(d);
1425 1.1 cgd bpf_wakeup(d);
1426 1.1 cgd curlen = 0;
1427 1.97 darrenr }
1428 1.1 cgd
1429 1.1 cgd /*
1430 1.1 cgd * Append the bpf header.
1431 1.1 cgd */
1432 1.1 cgd hp = (struct bpf_hdr *)(d->bd_sbuf + curlen);
1433 1.2 cgd microtime(&hp->bh_tstamp);
1434 1.1 cgd hp->bh_datalen = pktlen;
1435 1.1 cgd hp->bh_hdrlen = hdrlen;
1436 1.1 cgd /*
1437 1.1 cgd * Copy the packet data into the store buffer and update its length.
1438 1.1 cgd */
1439 1.41 perry (*cpfn)((u_char *)hp + hdrlen, pkt, (hp->bh_caplen = totlen - hdrlen));
1440 1.1 cgd d->bd_slen = curlen + totlen;
1441 1.97 darrenr
1442 1.97 darrenr /*
1443 1.97 darrenr * Call bpf_wakeup after bd_slen has been updated so that kevent(2)
1444 1.97 darrenr * will cause filt_bpfread() to be called with it adjusted.
1445 1.97 darrenr */
1446 1.97 darrenr if (d->bd_immediate || d->bd_state == BPF_TIMED_OUT)
1447 1.97 darrenr /*
1448 1.97 darrenr * Immediate mode is set, or the read timeout has
1449 1.97 darrenr * already expired during a select call. A packet
1450 1.97 darrenr * arrived, so the reader should be woken up.
1451 1.97 darrenr */
1452 1.97 darrenr bpf_wakeup(d);
1453 1.1 cgd }
1454 1.1 cgd
1455 1.12 mycroft /*
1456 1.1 cgd * Initialize all nonzero fields of a descriptor.
1457 1.1 cgd */
1458 1.1 cgd static int
1459 1.103 christos bpf_allocbufs(struct bpf_d *d)
1460 1.1 cgd {
1461 1.50 enami
1462 1.103 christos d->bd_fbuf = malloc(d->bd_bufsize, M_DEVBUF, M_NOWAIT);
1463 1.100 darrenr if (!d->bd_fbuf)
1464 1.79 itojun return (ENOBUFS);
1465 1.103 christos d->bd_sbuf = malloc(d->bd_bufsize, M_DEVBUF, M_NOWAIT);
1466 1.100 darrenr if (!d->bd_sbuf) {
1467 1.100 darrenr free(d->bd_fbuf, M_DEVBUF);
1468 1.79 itojun return (ENOBUFS);
1469 1.79 itojun }
1470 1.1 cgd d->bd_slen = 0;
1471 1.1 cgd d->bd_hlen = 0;
1472 1.1 cgd return (0);
1473 1.1 cgd }
1474 1.1 cgd
1475 1.1 cgd /*
1476 1.2 cgd * Free buffers currently in use by a descriptor.
1477 1.2 cgd * Called on close.
1478 1.2 cgd */
1479 1.2 cgd static void
1480 1.103 christos bpf_freed(struct bpf_d *d)
1481 1.2 cgd {
1482 1.2 cgd /*
1483 1.2 cgd * We don't need to lock out interrupts since this descriptor has
1484 1.2 cgd * been detached from its interface and it yet hasn't been marked
1485 1.2 cgd * free.
1486 1.2 cgd */
1487 1.100 darrenr if (d->bd_sbuf != 0) {
1488 1.100 darrenr free(d->bd_sbuf, M_DEVBUF);
1489 1.100 darrenr if (d->bd_hbuf != 0)
1490 1.100 darrenr free(d->bd_hbuf, M_DEVBUF);
1491 1.100 darrenr if (d->bd_fbuf != 0)
1492 1.100 darrenr free(d->bd_fbuf, M_DEVBUF);
1493 1.100 darrenr }
1494 1.2 cgd if (d->bd_filter)
1495 1.103 christos free(d->bd_filter, M_DEVBUF);
1496 1.2 cgd }
1497 1.2 cgd
1498 1.2 cgd /*
1499 1.60 thorpej * Attach an interface to bpf. dlt is the link layer type; hdrlen is the
1500 1.60 thorpej * fixed size of the link header (variable length headers not yet supported).
1501 1.1 cgd */
1502 1.1 cgd void
1503 1.103 christos bpfattach(struct ifnet *ifp, u_int dlt, u_int hdrlen)
1504 1.1 cgd {
1505 1.66 onoe
1506 1.66 onoe bpfattach2(ifp, dlt, hdrlen, &ifp->if_bpf);
1507 1.66 onoe }
1508 1.66 onoe
1509 1.66 onoe /*
1510 1.66 onoe * Attach additional dlt for a interface to bpf. dlt is the link layer type;
1511 1.66 onoe * hdrlen is the fixed size of the link header for the specified dlt
1512 1.66 onoe * (variable length headers not yet supported).
1513 1.66 onoe */
1514 1.66 onoe void
1515 1.103 christos bpfattach2(struct ifnet *ifp, u_int dlt, u_int hdrlen, void *driverp)
1516 1.66 onoe {
1517 1.1 cgd struct bpf_if *bp;
1518 1.103 christos bp = malloc(sizeof(*bp), M_DEVBUF, M_DONTWAIT);
1519 1.12 mycroft if (bp == 0)
1520 1.12 mycroft panic("bpfattach");
1521 1.12 mycroft
1522 1.1 cgd bp->bif_dlist = 0;
1523 1.103 christos bp->bif_driverp = driverp;
1524 1.1 cgd bp->bif_ifp = ifp;
1525 1.1 cgd bp->bif_dlt = dlt;
1526 1.1 cgd
1527 1.1 cgd bp->bif_next = bpf_iflist;
1528 1.1 cgd bpf_iflist = bp;
1529 1.1 cgd
1530 1.1 cgd *bp->bif_driverp = 0;
1531 1.1 cgd
1532 1.1 cgd /*
1533 1.1 cgd * Compute the length of the bpf header. This is not necessarily
1534 1.12 mycroft * equal to SIZEOF_BPF_HDR because we want to insert spacing such
1535 1.12 mycroft * that the network layer header begins on a longword boundary (for
1536 1.1 cgd * performance reasons and to alleviate alignment restrictions).
1537 1.1 cgd */
1538 1.1 cgd bp->bif_hdrlen = BPF_WORDALIGN(hdrlen + SIZEOF_BPF_HDR) - hdrlen;
1539 1.1 cgd
1540 1.11 deraadt #if 0
1541 1.32 christos printf("bpf: %s attached\n", ifp->if_xname);
1542 1.11 deraadt #endif
1543 1.48 thorpej }
1544 1.48 thorpej
1545 1.48 thorpej /*
1546 1.48 thorpej * Remove an interface from bpf.
1547 1.48 thorpej */
1548 1.48 thorpej void
1549 1.103 christos bpfdetach(struct ifnet *ifp)
1550 1.48 thorpej {
1551 1.48 thorpej struct bpf_if *bp, **pbp;
1552 1.51 enami struct bpf_d *d;
1553 1.105 christos int s;
1554 1.51 enami
1555 1.52 soren /* Nuke the vnodes for any open instances */
1556 1.105 christos for (d = LIST_FIRST(&bpf_list); d != NULL; d = LIST_NEXT(d, bd_list)) {
1557 1.105 christos if (d->bd_bif != NULL && d->bd_bif->bif_ifp == ifp) {
1558 1.51 enami /*
1559 1.51 enami * Detach the descriptor from an interface now.
1560 1.51 enami * It will be free'ed later by close routine.
1561 1.51 enami */
1562 1.61 thorpej s = splnet();
1563 1.51 enami d->bd_promisc = 0; /* we can't touch device. */
1564 1.51 enami bpf_detachd(d);
1565 1.51 enami splx(s);
1566 1.51 enami }
1567 1.51 enami }
1568 1.48 thorpej
1569 1.66 onoe again:
1570 1.48 thorpej for (bp = bpf_iflist, pbp = &bpf_iflist;
1571 1.48 thorpej bp != NULL; pbp = &bp->bif_next, bp = bp->bif_next) {
1572 1.48 thorpej if (bp->bif_ifp == ifp) {
1573 1.48 thorpej *pbp = bp->bif_next;
1574 1.48 thorpej free(bp, M_DEVBUF);
1575 1.66 onoe goto again;
1576 1.48 thorpej }
1577 1.48 thorpej }
1578 1.47 thorpej }
1579 1.47 thorpej
1580 1.47 thorpej /*
1581 1.66 onoe * Change the data link type of a interface.
1582 1.47 thorpej */
1583 1.47 thorpej void
1584 1.103 christos bpf_change_type(struct ifnet *ifp, u_int dlt, u_int hdrlen)
1585 1.47 thorpej {
1586 1.47 thorpej struct bpf_if *bp;
1587 1.47 thorpej
1588 1.47 thorpej for (bp = bpf_iflist; bp != NULL; bp = bp->bif_next) {
1589 1.59 thorpej if (bp->bif_driverp == (struct bpf_if **)&ifp->if_bpf)
1590 1.47 thorpej break;
1591 1.47 thorpej }
1592 1.47 thorpej if (bp == NULL)
1593 1.47 thorpej panic("bpf_change_type");
1594 1.47 thorpej
1595 1.47 thorpej bp->bif_dlt = dlt;
1596 1.47 thorpej
1597 1.47 thorpej /*
1598 1.47 thorpej * Compute the length of the bpf header. This is not necessarily
1599 1.47 thorpej * equal to SIZEOF_BPF_HDR because we want to insert spacing such
1600 1.47 thorpej * that the network layer header begins on a longword boundary (for
1601 1.47 thorpej * performance reasons and to alleviate alignment restrictions).
1602 1.47 thorpej */
1603 1.47 thorpej bp->bif_hdrlen = BPF_WORDALIGN(hdrlen + SIZEOF_BPF_HDR) - hdrlen;
1604 1.66 onoe }
1605 1.66 onoe
1606 1.66 onoe /*
1607 1.66 onoe * Get a list of available data link type of the interface.
1608 1.66 onoe */
1609 1.66 onoe static int
1610 1.103 christos bpf_getdltlist(struct bpf_d *d, struct bpf_dltlist *bfl)
1611 1.66 onoe {
1612 1.66 onoe int n, error;
1613 1.66 onoe struct ifnet *ifp;
1614 1.66 onoe struct bpf_if *bp;
1615 1.66 onoe
1616 1.66 onoe ifp = d->bd_bif->bif_ifp;
1617 1.66 onoe n = 0;
1618 1.66 onoe error = 0;
1619 1.66 onoe for (bp = bpf_iflist; bp != NULL; bp = bp->bif_next) {
1620 1.66 onoe if (bp->bif_ifp != ifp)
1621 1.66 onoe continue;
1622 1.66 onoe if (bfl->bfl_list != NULL) {
1623 1.66 onoe if (n >= bfl->bfl_len)
1624 1.66 onoe return ENOMEM;
1625 1.66 onoe error = copyout(&bp->bif_dlt,
1626 1.66 onoe bfl->bfl_list + n, sizeof(u_int));
1627 1.66 onoe }
1628 1.66 onoe n++;
1629 1.66 onoe }
1630 1.66 onoe bfl->bfl_len = n;
1631 1.66 onoe return error;
1632 1.66 onoe }
1633 1.66 onoe
1634 1.66 onoe /*
1635 1.66 onoe * Set the data link type of a BPF instance.
1636 1.66 onoe */
1637 1.66 onoe static int
1638 1.103 christos bpf_setdlt(struct bpf_d *d, u_int dlt)
1639 1.66 onoe {
1640 1.69 thorpej int s, error, opromisc;
1641 1.66 onoe struct ifnet *ifp;
1642 1.66 onoe struct bpf_if *bp;
1643 1.66 onoe
1644 1.66 onoe if (d->bd_bif->bif_dlt == dlt)
1645 1.66 onoe return 0;
1646 1.66 onoe ifp = d->bd_bif->bif_ifp;
1647 1.66 onoe for (bp = bpf_iflist; bp != NULL; bp = bp->bif_next) {
1648 1.66 onoe if (bp->bif_ifp == ifp && bp->bif_dlt == dlt)
1649 1.66 onoe break;
1650 1.66 onoe }
1651 1.66 onoe if (bp == NULL)
1652 1.66 onoe return EINVAL;
1653 1.66 onoe s = splnet();
1654 1.69 thorpej opromisc = d->bd_promisc;
1655 1.66 onoe bpf_detachd(d);
1656 1.66 onoe bpf_attachd(d, bp);
1657 1.66 onoe reset_d(d);
1658 1.69 thorpej if (opromisc) {
1659 1.69 thorpej error = ifpromisc(bp->bif_ifp, 1);
1660 1.69 thorpej if (error)
1661 1.69 thorpej printf("%s: bpf_setdlt: ifpromisc failed (%d)\n",
1662 1.69 thorpej bp->bif_ifp->if_xname, error);
1663 1.69 thorpej else
1664 1.69 thorpej d->bd_promisc = 1;
1665 1.69 thorpej }
1666 1.66 onoe splx(s);
1667 1.66 onoe return 0;
1668 1.1 cgd }
1669 1.89 jonathan
1670 1.89 jonathan static int
1671 1.89 jonathan sysctl_net_bpf_maxbufsize(SYSCTLFN_ARGS)
1672 1.89 jonathan {
1673 1.89 jonathan int newsize, error;
1674 1.89 jonathan struct sysctlnode node;
1675 1.89 jonathan
1676 1.89 jonathan node = *rnode;
1677 1.89 jonathan node.sysctl_data = &newsize;
1678 1.89 jonathan newsize = bpf_maxbufsize;
1679 1.89 jonathan error = sysctl_lookup(SYSCTLFN_CALL(&node));
1680 1.89 jonathan if (error || newp == NULL)
1681 1.89 jonathan return (error);
1682 1.89 jonathan
1683 1.89 jonathan if (newsize < BPF_MINBUFSIZE || newsize > BPF_MAXBUFSIZE)
1684 1.89 jonathan return (EINVAL);
1685 1.89 jonathan
1686 1.89 jonathan bpf_maxbufsize = newsize;
1687 1.89 jonathan
1688 1.89 jonathan return (0);
1689 1.89 jonathan }
1690 1.89 jonathan
1691 1.110 rpaulo static int
1692 1.110 rpaulo sysctl_net_bpf_peers(SYSCTLFN_ARGS)
1693 1.110 rpaulo {
1694 1.110 rpaulo int error, elem_count;
1695 1.110 rpaulo struct bpf_d *dp;
1696 1.110 rpaulo struct bpf_d_ext dpe;
1697 1.110 rpaulo size_t len, needed, elem_size, out_size;
1698 1.110 rpaulo char *sp;
1699 1.110 rpaulo
1700 1.110 rpaulo if (namelen == 1 && name[0] == CTL_QUERY)
1701 1.110 rpaulo return (sysctl_query(SYSCTLFN_CALL(rnode)));
1702 1.110 rpaulo
1703 1.110 rpaulo if (namelen != 2)
1704 1.110 rpaulo return (EINVAL);
1705 1.110 rpaulo
1706 1.117 elad if ((error = kauth_authorize_generic(l->l_proc->p_cred,
1707 1.117 elad KAUTH_GENERIC_ISSUSER,
1708 1.117 elad &l->l_proc->p_acflag)))
1709 1.110 rpaulo return (error);
1710 1.110 rpaulo
1711 1.110 rpaulo len = (oldp != NULL) ? *oldlenp : 0;
1712 1.110 rpaulo sp = oldp;
1713 1.110 rpaulo elem_size = name[0];
1714 1.110 rpaulo elem_count = name[1];
1715 1.110 rpaulo out_size = MIN(sizeof(dpe), elem_size);
1716 1.110 rpaulo needed = 0;
1717 1.110 rpaulo
1718 1.110 rpaulo if (elem_size < 1 || elem_count < 0)
1719 1.110 rpaulo return (EINVAL);
1720 1.110 rpaulo
1721 1.110 rpaulo simple_lock(&bpf_slock);
1722 1.110 rpaulo LIST_FOREACH(dp, &bpf_list, bd_list) {
1723 1.110 rpaulo if (len >= elem_size && elem_count > 0) {
1724 1.110 rpaulo #define BPF_EXT(field) dpe.bde_ ## field = dp->bd_ ## field
1725 1.110 rpaulo BPF_EXT(bufsize);
1726 1.110 rpaulo BPF_EXT(promisc);
1727 1.110 rpaulo BPF_EXT(promisc);
1728 1.110 rpaulo BPF_EXT(state);
1729 1.110 rpaulo BPF_EXT(immediate);
1730 1.110 rpaulo BPF_EXT(hdrcmplt);
1731 1.110 rpaulo BPF_EXT(seesent);
1732 1.110 rpaulo BPF_EXT(pid);
1733 1.110 rpaulo BPF_EXT(rcount);
1734 1.110 rpaulo BPF_EXT(dcount);
1735 1.110 rpaulo BPF_EXT(ccount);
1736 1.110 rpaulo #undef BPF_EXT
1737 1.110 rpaulo if (dp->bd_bif)
1738 1.110 rpaulo (void)strlcpy(dpe.bde_ifname,
1739 1.110 rpaulo dp->bd_bif->bif_ifp->if_xname,
1740 1.110 rpaulo IFNAMSIZ - 1);
1741 1.110 rpaulo else
1742 1.110 rpaulo dpe.bde_ifname[0] = '\0';
1743 1.110 rpaulo
1744 1.110 rpaulo error = copyout(&dpe, sp, out_size);
1745 1.110 rpaulo if (error)
1746 1.110 rpaulo break;
1747 1.110 rpaulo sp += elem_size;
1748 1.110 rpaulo len -= elem_size;
1749 1.110 rpaulo }
1750 1.110 rpaulo if (elem_count > 0) {
1751 1.110 rpaulo needed += elem_size;
1752 1.110 rpaulo if (elem_count != INT_MAX)
1753 1.110 rpaulo elem_count--;
1754 1.110 rpaulo }
1755 1.110 rpaulo }
1756 1.110 rpaulo simple_unlock(&bpf_slock);
1757 1.110 rpaulo
1758 1.110 rpaulo *oldlenp = needed;
1759 1.110 rpaulo
1760 1.110 rpaulo return (error);
1761 1.110 rpaulo }
1762 1.110 rpaulo
1763 1.110 rpaulo SYSCTL_SETUP(sysctl_net_bpf_setup, "sysctl net.bpf subtree setup")
1764 1.89 jonathan {
1765 1.108 atatat const struct sysctlnode *node;
1766 1.89 jonathan
1767 1.90 atatat sysctl_createv(clog, 0, NULL, NULL,
1768 1.90 atatat CTLFLAG_PERMANENT,
1769 1.89 jonathan CTLTYPE_NODE, "net", NULL,
1770 1.89 jonathan NULL, 0, NULL, 0,
1771 1.89 jonathan CTL_NET, CTL_EOL);
1772 1.89 jonathan
1773 1.89 jonathan node = NULL;
1774 1.90 atatat sysctl_createv(clog, 0, NULL, &node,
1775 1.90 atatat CTLFLAG_PERMANENT,
1776 1.98 atatat CTLTYPE_NODE, "bpf",
1777 1.98 atatat SYSCTL_DESCR("BPF options"),
1778 1.89 jonathan NULL, 0, NULL, 0,
1779 1.89 jonathan CTL_NET, CTL_CREATE, CTL_EOL);
1780 1.110 rpaulo if (node != NULL) {
1781 1.90 atatat sysctl_createv(clog, 0, NULL, NULL,
1782 1.90 atatat CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
1783 1.98 atatat CTLTYPE_INT, "maxbufsize",
1784 1.98 atatat SYSCTL_DESCR("Maximum size for data capture buffer"),
1785 1.89 jonathan sysctl_net_bpf_maxbufsize, 0, &bpf_maxbufsize, 0,
1786 1.89 jonathan CTL_NET, node->sysctl_num, CTL_CREATE, CTL_EOL);
1787 1.110 rpaulo sysctl_createv(clog, 0, NULL, NULL,
1788 1.110 rpaulo CTLFLAG_PERMANENT,
1789 1.110 rpaulo CTLTYPE_STRUCT, "stats",
1790 1.110 rpaulo SYSCTL_DESCR("BPF stats"),
1791 1.110 rpaulo NULL, 0, &bpf_gstats, sizeof(bpf_gstats),
1792 1.110 rpaulo CTL_NET, node->sysctl_num, CTL_CREATE, CTL_EOL);
1793 1.110 rpaulo sysctl_createv(clog, 0, NULL, NULL,
1794 1.110 rpaulo CTLFLAG_PERMANENT,
1795 1.110 rpaulo CTLTYPE_STRUCT, "peers",
1796 1.110 rpaulo SYSCTL_DESCR("BPF peers"),
1797 1.110 rpaulo sysctl_net_bpf_peers, 0, NULL, 0,
1798 1.110 rpaulo CTL_NET, node->sysctl_num, CTL_CREATE, CTL_EOL);
1799 1.110 rpaulo }
1800 1.110 rpaulo
1801 1.89 jonathan }
1802