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