2 * Copyright (c) 1990, 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from the Stanford/CMU enet packet filter,
6 * (net/enet.c) distributed as part of 4.3BSD, and code contributed
7 * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * @(#)bpf.c 8.2 (Berkeley) 3/28/94
40 * $FreeBSD: src/sys/net/bpf.c,v 1.59.2.12 2002/04/14 21:41:48 luigi Exp $
41 * $DragonFly: src/sys/net/bpf.c,v 1.50 2008/09/23 11:28:49 sephe Exp $
46 #include <sys/param.h>
47 #include <sys/systm.h>
49 #include <sys/device.h>
50 #include <sys/malloc.h>
54 #include <sys/signalvar.h>
55 #include <sys/filio.h>
56 #include <sys/sockio.h>
57 #include <sys/ttycom.h>
58 #include <sys/filedesc.h>
62 #include <sys/socket.h>
63 #include <sys/vnode.h>
65 #include <sys/thread2.h>
66 #include <sys/mplock2.h>
70 #include <net/bpfdesc.h>
71 #include <net/netmsg2.h>
73 #include <netinet/in.h>
74 #include <netinet/if_ether.h>
75 #include <sys/kernel.h>
76 #include <sys/sysctl.h>
78 #include <sys/devfs.h>
80 struct netmsg_bpf_output {
81 struct netmsg nm_netmsg;
84 struct sockaddr *nm_dst;
87 MALLOC_DEFINE(M_BPF, "BPF", "BPF data");
88 DEVFS_DECLARE_CLONE_BITMAP(bpf);
91 #define BPF_PREALLOCATED_UNITS 4
93 #define BPF_PREALLOCATED_UNITS NBPF
99 * The default read buffer size is patchable.
101 static int bpf_bufsize = BPF_DEFAULTBUFSIZE;
102 SYSCTL_INT(_debug, OID_AUTO, bpf_bufsize, CTLFLAG_RW,
103 &bpf_bufsize, 0, "");
104 int bpf_maxbufsize = BPF_MAXBUFSIZE;
105 SYSCTL_INT(_debug, OID_AUTO, bpf_maxbufsize, CTLFLAG_RW,
106 &bpf_maxbufsize, 0, "");
109 * bpf_iflist is the list of interfaces; each corresponds to an ifnet
111 static struct bpf_if *bpf_iflist;
113 static int bpf_allocbufs(struct bpf_d *);
114 static void bpf_attachd(struct bpf_d *d, struct bpf_if *bp);
115 static void bpf_detachd(struct bpf_d *d);
116 static void bpf_resetd(struct bpf_d *);
117 static void bpf_freed(struct bpf_d *);
118 static void bpf_mcopy(const void *, void *, size_t);
119 static int bpf_movein(struct uio *, int, struct mbuf **,
120 struct sockaddr *, int *, struct bpf_insn *);
121 static int bpf_setif(struct bpf_d *, struct ifreq *);
122 static void bpf_timed_out(void *);
123 static void bpf_wakeup(struct bpf_d *);
124 static void catchpacket(struct bpf_d *, u_char *, u_int, u_int,
125 void (*)(const void *, void *, size_t),
126 const struct timeval *);
127 static int bpf_setf(struct bpf_d *, struct bpf_program *, u_long cmd);
128 static int bpf_getdltlist(struct bpf_d *, struct bpf_dltlist *);
129 static int bpf_setdlt(struct bpf_d *, u_int);
130 static void bpf_drvinit(void *unused);
132 static d_open_t bpfopen;
133 static d_clone_t bpfclone;
134 static d_close_t bpfclose;
135 static d_read_t bpfread;
136 static d_write_t bpfwrite;
137 static d_ioctl_t bpfioctl;
138 static d_poll_t bpfpoll;
140 #define CDEV_MAJOR 23
141 static struct dev_ops bpf_ops = {
142 { "bpf", CDEV_MAJOR, 0 },
153 bpf_movein(struct uio *uio, int linktype, struct mbuf **mp,
154 struct sockaddr *sockp, int *datlen, struct bpf_insn *wfilter)
166 * Build a sockaddr based on the data link layer type.
167 * We do this at this level because the ethernet header
168 * is copied directly into the data field of the sockaddr.
169 * In the case of SLIP, there is no header and the packet
170 * is forwarded as is.
171 * Also, we are careful to leave room at the front of the mbuf
172 * for the link level header.
176 sockp->sa_family = AF_INET;
181 sockp->sa_family = AF_UNSPEC;
182 /* XXX Would MAXLINKHDR be better? */
183 hlen = sizeof(struct ether_header);
188 sockp->sa_family = AF_UNSPEC;
192 case DLT_ATM_RFC1483:
194 * en atm driver requires 4-byte atm pseudo header.
195 * though it isn't standard, vpi:vci needs to be
198 sockp->sa_family = AF_UNSPEC;
199 hlen = 12; /* XXX 4(ATM_PH) + 3(LLC) + 5(SNAP) */
203 sockp->sa_family = AF_UNSPEC;
204 hlen = 4; /* This should match PPP_HDRLEN */
211 len = uio->uio_resid;
212 *datlen = len - hlen;
213 if ((unsigned)len > MCLBYTES)
216 m = m_getl(len, MB_WAIT, MT_DATA, M_PKTHDR, NULL);
219 m->m_pkthdr.len = m->m_len = len;
220 m->m_pkthdr.rcvif = NULL;
223 if (m->m_len < hlen) {
228 error = uiomove(mtod(m, u_char *), len, uio);
232 slen = bpf_filter(wfilter, mtod(m, u_char *), len, len);
239 * Make room for link header, and copy it to sockaddr.
242 bcopy(m->m_data, sockp->sa_data, hlen);
243 m->m_pkthdr.len -= hlen;
245 m->m_data += hlen; /* XXX */
254 * Attach file to the bpf interface, i.e. make d listen on bp.
255 * Must be called at splimp.
258 bpf_attachd(struct bpf_d *d, struct bpf_if *bp)
261 * Point d at bp, and add d to the interface's list of listeners.
262 * Finally, point the driver's bpf cookie at the interface so
263 * it will divert packets to bpf.
266 SLIST_INSERT_HEAD(&bp->bif_dlist, d, bd_next);
267 *bp->bif_driverp = bp;
269 EVENTHANDLER_INVOKE(bpf_track, bp->bif_ifp, bp->bif_dlt, 1);
273 * Detach a file from its interface.
276 bpf_detachd(struct bpf_d *d)
285 /* Remove d from the interface's descriptor list. */
286 SLIST_REMOVE(&bp->bif_dlist, d, bpf_d, bd_next);
288 if (SLIST_EMPTY(&bp->bif_dlist)) {
290 * Let the driver know that there are no more listeners.
292 *bp->bif_driverp = NULL;
296 EVENTHANDLER_INVOKE(bpf_track, ifp, bp->bif_dlt, 0);
299 * Check if this descriptor had requested promiscuous mode.
300 * If so, turn it off.
304 error = ifpromisc(ifp, 0);
305 if (error != 0 && error != ENXIO) {
307 * ENXIO can happen if a pccard is unplugged,
308 * Something is really wrong if we were able to put
309 * the driver into promiscuous mode, but can't
312 if_printf(ifp, "bpf_detach: ifpromisc failed(%d)\n",
319 * Open ethernet device. Returns ENXIO for illegal minor device number,
320 * EBUSY if file is open by another process.
324 bpfopen(struct dev_open_args *ap)
326 cdev_t dev = ap->a_head.a_dev;
329 if (ap->a_cred->cr_prison)
334 * Each minor can be opened by only one process. If the requested
335 * minor is in use, return EBUSY.
340 MALLOC(d, struct bpf_d *, sizeof *d, M_BPF, M_WAITOK | M_ZERO);
342 d->bd_bufsize = bpf_bufsize;
345 callout_init(&d->bd_callout);
350 bpfclone(struct dev_clone_args *ap)
354 unit = devfs_clone_bitmap_get(&DEVFS_CLONE_BITMAP(bpf), 0);
355 ap->a_dev = make_only_dev(&bpf_ops, unit, 0, 0, 0600, "bpf%d", unit);
361 * Close the descriptor by detaching it from its interface,
362 * deallocating its buffers, and marking it free.
366 bpfclose(struct dev_close_args *ap)
368 cdev_t dev = ap->a_head.a_dev;
369 struct bpf_d *d = dev->si_drv1;
371 funsetown(d->bd_sigio);
373 if (d->bd_state == BPF_WAITING)
374 callout_stop(&d->bd_callout);
375 d->bd_state = BPF_IDLE;
376 if (d->bd_bif != NULL)
381 if (dev->si_uminor >= BPF_PREALLOCATED_UNITS) {
382 devfs_clone_bitmap_put(&DEVFS_CLONE_BITMAP(bpf), dev->si_uminor);
390 * Rotate the packet buffers in descriptor d. Move the store buffer
391 * into the hold slot, and the free buffer into the store slot.
392 * Zero the length of the new store buffer.
394 #define ROTATE_BUFFERS(d) \
395 (d)->bd_hbuf = (d)->bd_sbuf; \
396 (d)->bd_hlen = (d)->bd_slen; \
397 (d)->bd_sbuf = (d)->bd_fbuf; \
401 * bpfread - read next chunk of packets from buffers
404 bpfread(struct dev_read_args *ap)
406 cdev_t dev = ap->a_head.a_dev;
407 struct bpf_d *d = dev->si_drv1;
412 * Restrict application to use a buffer the same size as
415 if (ap->a_uio->uio_resid != d->bd_bufsize)
419 if (d->bd_state == BPF_WAITING)
420 callout_stop(&d->bd_callout);
421 timed_out = (d->bd_state == BPF_TIMED_OUT);
422 d->bd_state = BPF_IDLE;
424 * If the hold buffer is empty, then do a timed sleep, which
425 * ends when the timeout expires or when enough packets
426 * have arrived to fill the store buffer.
428 while (d->bd_hbuf == NULL) {
429 if ((d->bd_immediate || (ap->a_ioflag & IO_NDELAY) || timed_out)
430 && d->bd_slen != 0) {
432 * A packet(s) either arrived since the previous,
433 * We're in immediate mode, or are reading
434 * in non-blocking mode, and a packet(s)
435 * either arrived since the previous
436 * read or arrived while we were asleep.
437 * Rotate the buffers and return what's here.
444 * No data is available, check to see if the bpf device
445 * is still pointed at a real interface. If not, return
446 * ENXIO so that the userland process knows to rebind
447 * it before using it again.
449 if (d->bd_bif == NULL) {
454 if (ap->a_ioflag & IO_NDELAY) {
458 error = tsleep(d, PCATCH, "bpf", d->bd_rtout);
459 if (error == EINTR || error == ERESTART) {
463 if (error == EWOULDBLOCK) {
465 * On a timeout, return what's in the buffer,
466 * which may be nothing. If there is something
467 * in the store buffer, we can rotate the buffers.
471 * We filled up the buffer in between
472 * getting the timeout and arriving
473 * here, so we don't need to rotate.
477 if (d->bd_slen == 0) {
486 * At this point, we know we have something in the hold slot.
491 * Move data from hold buffer into user space.
492 * We know the entire buffer is transferred since
493 * we checked above that the read buffer is bpf_bufsize bytes.
495 error = uiomove(d->bd_hbuf, d->bd_hlen, ap->a_uio);
498 d->bd_fbuf = d->bd_hbuf;
508 * If there are processes sleeping on this descriptor, wake them up.
511 bpf_wakeup(struct bpf_d *d)
513 if (d->bd_state == BPF_WAITING) {
514 callout_stop(&d->bd_callout);
515 d->bd_state = BPF_IDLE;
518 if (d->bd_async && d->bd_sig && d->bd_sigio)
519 pgsigio(d->bd_sigio, d->bd_sig, 0);
522 selwakeup(&d->bd_sel);
525 d->bd_sel.si_pid = 0;
529 bpf_timed_out(void *arg)
531 struct bpf_d *d = (struct bpf_d *)arg;
534 if (d->bd_state == BPF_WAITING) {
535 d->bd_state = BPF_TIMED_OUT;
543 bpf_output_dispatch(struct netmsg *nmsg)
545 struct netmsg_bpf_output *bmsg = (struct netmsg_bpf_output *)nmsg;
546 struct ifnet *ifp = bmsg->nm_ifp;
550 * The driver frees the mbuf.
552 error = ifp->if_output(ifp, bmsg->nm_mbuf, bmsg->nm_dst, NULL);
553 lwkt_replymsg(&nmsg->nm_lmsg, error);
557 bpfwrite(struct dev_write_args *ap)
559 cdev_t dev = ap->a_head.a_dev;
560 struct bpf_d *d = dev->si_drv1;
566 struct netmsg_bpf_output bmsg;
568 if (d->bd_bif == NULL)
571 ifp = d->bd_bif->bif_ifp;
573 if (ap->a_uio->uio_resid == 0)
576 error = bpf_movein(ap->a_uio, (int)d->bd_bif->bif_dlt, &m,
577 &dst, &datlen, d->bd_wfilter);
581 if (datlen > ifp->if_mtu) {
587 dst.sa_family = pseudo_AF_HDRCMPLT;
589 netmsg_init(&bmsg.nm_netmsg, NULL, &curthread->td_msgport,
590 MSGF_MPSAFE, bpf_output_dispatch);
595 return lwkt_domsg(cpu_portfn(0), &bmsg.nm_netmsg.nm_lmsg, 0);
599 * Reset a descriptor by flushing its packet buffer and clearing the
600 * receive and drop counts. Should be called at splimp.
603 bpf_resetd(struct bpf_d *d)
606 /* Free the hold buffer. */
607 d->bd_fbuf = d->bd_hbuf;
617 * FIONREAD Check for read packet available.
618 * SIOCGIFADDR Get interface address - convenient hook to driver.
619 * BIOCGBLEN Get buffer len [for read()].
620 * BIOCSETF Set ethernet read filter.
621 * BIOCSETWF Set ethernet write filter.
622 * BIOCFLUSH Flush read packet buffer.
623 * BIOCPROMISC Put interface into promiscuous mode.
624 * BIOCGDLT Get link layer type.
625 * BIOCGETIF Get interface name.
626 * BIOCSETIF Set interface.
627 * BIOCSRTIMEOUT Set read timeout.
628 * BIOCGRTIMEOUT Get read timeout.
629 * BIOCGSTATS Get packet stats.
630 * BIOCIMMEDIATE Set immediate mode.
631 * BIOCVERSION Get filter language version.
632 * BIOCGHDRCMPLT Get "header already complete" flag
633 * BIOCSHDRCMPLT Set "header already complete" flag
634 * BIOCGSEESENT Get "see packets sent" flag
635 * BIOCSSEESENT Set "see packets sent" flag
636 * BIOCLOCK Set "locked" flag
640 bpfioctl(struct dev_ioctl_args *ap)
642 cdev_t dev = ap->a_head.a_dev;
643 struct bpf_d *d = dev->si_drv1;
647 if (d->bd_state == BPF_WAITING)
648 callout_stop(&d->bd_callout);
649 d->bd_state = BPF_IDLE;
652 if (d->bd_locked == 1) {
680 * Check for read packet available.
692 *(int *)ap->a_data = n;
700 if (d->bd_bif == NULL) {
703 ifp = d->bd_bif->bif_ifp;
704 ifnet_serialize_all(ifp);
705 error = ifp->if_ioctl(ifp, ap->a_cmd,
706 ap->a_data, ap->a_cred);
707 ifnet_deserialize_all(ifp);
713 * Get buffer len [for read()].
716 *(u_int *)ap->a_data = d->bd_bufsize;
723 if (d->bd_bif != NULL) {
726 u_int size = *(u_int *)ap->a_data;
728 if (size > bpf_maxbufsize)
729 *(u_int *)ap->a_data = size = bpf_maxbufsize;
730 else if (size < BPF_MINBUFSIZE)
731 *(u_int *)ap->a_data = size = BPF_MINBUFSIZE;
732 d->bd_bufsize = size;
737 * Set link layer read filter.
741 error = bpf_setf(d, (struct bpf_program *)ap->a_data,
746 * Flush read packet buffer.
755 * Put interface into promiscuous mode.
758 if (d->bd_bif == NULL) {
760 * No interface attached yet.
766 if (d->bd_promisc == 0) {
767 error = ifpromisc(d->bd_bif->bif_ifp, 1);
775 * Get device parameters.
778 if (d->bd_bif == NULL)
781 *(u_int *)ap->a_data = d->bd_bif->bif_dlt;
785 * Get a list of supported data link types.
788 if (d->bd_bif == NULL) {
791 error = bpf_getdltlist(d,
792 (struct bpf_dltlist *)ap->a_data);
797 * Set data link type.
800 if (d->bd_bif == NULL)
803 error = bpf_setdlt(d, *(u_int *)ap->a_data);
807 * Get interface name.
810 if (d->bd_bif == NULL) {
813 struct ifnet *const ifp = d->bd_bif->bif_ifp;
814 struct ifreq *const ifr = (struct ifreq *)ap->a_data;
816 strlcpy(ifr->ifr_name, ifp->if_xname,
817 sizeof ifr->ifr_name);
825 error = bpf_setif(d, (struct ifreq *)ap->a_data);
833 struct timeval *tv = (struct timeval *)ap->a_data;
836 * Subtract 1 tick from tvtohz() since this isn't
839 if ((error = itimerfix(tv)) == 0)
840 d->bd_rtout = tvtohz_low(tv);
849 struct timeval *tv = (struct timeval *)ap->a_data;
851 tv->tv_sec = d->bd_rtout / hz;
852 tv->tv_usec = (d->bd_rtout % hz) * ustick;
861 struct bpf_stat *bs = (struct bpf_stat *)ap->a_data;
863 bs->bs_recv = d->bd_rcount;
864 bs->bs_drop = d->bd_dcount;
869 * Set immediate mode.
872 d->bd_immediate = *(u_int *)ap->a_data;
877 struct bpf_version *bv = (struct bpf_version *)ap->a_data;
879 bv->bv_major = BPF_MAJOR_VERSION;
880 bv->bv_minor = BPF_MINOR_VERSION;
885 * Get "header already complete" flag
888 *(u_int *)ap->a_data = d->bd_hdrcmplt;
892 * Set "header already complete" flag
895 d->bd_hdrcmplt = *(u_int *)ap->a_data ? 1 : 0;
899 * Get "see sent packets" flag
902 *(u_int *)ap->a_data = d->bd_seesent;
906 * Set "see sent packets" flag
909 d->bd_seesent = *(u_int *)ap->a_data;
912 case FIOASYNC: /* Send signal on receive packets */
913 d->bd_async = *(int *)ap->a_data;
917 error = fsetown(*(int *)ap->a_data, &d->bd_sigio);
921 *(int *)ap->a_data = fgetown(d->bd_sigio);
924 /* This is deprecated, FIOSETOWN should be used instead. */
926 error = fsetown(-(*(int *)ap->a_data), &d->bd_sigio);
929 /* This is deprecated, FIOGETOWN should be used instead. */
931 *(int *)ap->a_data = -fgetown(d->bd_sigio);
934 case BIOCSRSIG: /* Set receive signal */
938 sig = *(u_int *)ap->a_data;
947 *(u_int *)ap->a_data = d->bd_sig;
957 * Set d's packet filter program to fp. If this file already has a filter,
958 * free it and replace it. Returns EINVAL for bogus requests.
961 bpf_setf(struct bpf_d *d, struct bpf_program *fp, u_long cmd)
963 struct bpf_insn *fcode, *old;
964 u_int wfilter, flen, size;
966 if (cmd == BIOCSETWF) {
973 if (fp->bf_insns == NULL) {
978 d->bd_wfilter = NULL;
980 d->bd_rfilter = NULL;
988 if (flen > BPF_MAXINSNS)
991 size = flen * sizeof *fp->bf_insns;
992 fcode = (struct bpf_insn *)kmalloc(size, M_BPF, M_WAITOK);
993 if (copyin(fp->bf_insns, fcode, size) == 0 &&
994 bpf_validate(fcode, (int)flen)) {
997 d->bd_wfilter = fcode;
999 d->bd_rfilter = fcode;
1007 kfree(fcode, M_BPF);
1012 * Detach a file from its current interface (if attached at all) and attach
1013 * to the interface indicated by the name stored in ifr.
1014 * Return an errno or 0.
1017 bpf_setif(struct bpf_d *d, struct ifreq *ifr)
1021 struct ifnet *theywant;
1023 theywant = ifunit(ifr->ifr_name);
1024 if (theywant == NULL)
1028 * Look through attached interfaces for the named one.
1030 for (bp = bpf_iflist; bp != NULL; bp = bp->bif_next) {
1031 struct ifnet *ifp = bp->bif_ifp;
1033 if (ifp == NULL || ifp != theywant)
1035 /* skip additional entry */
1036 if (bp->bif_driverp != &ifp->if_bpf)
1039 * We found the requested interface.
1040 * Allocate the packet buffers if we need to.
1041 * If we're already attached to requested interface,
1042 * just flush the buffer.
1044 if (d->bd_sbuf == NULL) {
1045 error = bpf_allocbufs(d);
1050 if (bp != d->bd_bif) {
1051 if (d->bd_bif != NULL) {
1053 * Detach if attached to something else.
1070 * Support for select() and poll() system calls
1072 * Return true iff the specific operation will not block indefinitely.
1073 * Otherwise, return false but make a note that a selwakeup() must be done.
1076 bpfpoll(struct dev_poll_args *ap)
1078 cdev_t dev = ap->a_head.a_dev;
1083 if (d->bd_bif == NULL)
1086 revents = ap->a_events & (POLLOUT | POLLWRNORM);
1088 if (ap->a_events & (POLLIN | POLLRDNORM)) {
1090 * An imitation of the FIONREAD ioctl code.
1091 * XXX not quite. An exact imitation:
1092 * if (d->b_slen != 0 ||
1093 * (d->bd_hbuf != NULL && d->bd_hlen != 0)
1095 if (d->bd_hlen != 0 ||
1096 ((d->bd_immediate || d->bd_state == BPF_TIMED_OUT) &&
1098 revents |= ap->a_events & (POLLIN | POLLRDNORM);
1100 selrecord(curthread, &d->bd_sel);
1101 /* Start the read timeout if necessary. */
1102 if (d->bd_rtout > 0 && d->bd_state == BPF_IDLE) {
1103 callout_reset(&d->bd_callout, d->bd_rtout,
1105 d->bd_state = BPF_WAITING;
1110 ap->a_events = revents;
1115 * Process the packet pkt of length pktlen. The packet is parsed
1116 * by each listener's filter, and if accepted, stashed into the
1117 * corresponding buffer.
1120 bpf_tap(struct bpf_if *bp, u_char *pkt, u_int pktlen)
1136 * Note that the ipl does not have to be raised at this point.
1137 * The only problem that could arise here is that if two different
1138 * interfaces shared any data. This is not the case.
1140 SLIST_FOREACH(d, &bp->bif_dlist, bd_next) {
1142 slen = bpf_filter(d->bd_rfilter, pkt, pktlen, pktlen);
1148 catchpacket(d, pkt, pktlen, slen, ovbcopy, &tv);
1156 * Copy data from an mbuf chain into a buffer. This code is derived
1157 * from m_copydata in sys/uipc_mbuf.c.
1160 bpf_mcopy(const void *src_arg, void *dst_arg, size_t len)
1162 const struct mbuf *m;
1171 count = min(m->m_len, len);
1172 bcopy(mtod(m, void *), dst, count);
1180 * Process the packet in the mbuf chain m. The packet is parsed by each
1181 * listener's filter, and if accepted, stashed into the corresponding
1185 bpf_mtap(struct bpf_if *bp, struct mbuf *m)
1200 /* Don't compute pktlen, if no descriptor is attached. */
1201 if (SLIST_EMPTY(&bp->bif_dlist)) {
1206 pktlen = m_lengthm(m, NULL);
1208 SLIST_FOREACH(d, &bp->bif_dlist, bd_next) {
1209 if (!d->bd_seesent && (m->m_pkthdr.rcvif == NULL))
1212 slen = bpf_filter(d->bd_rfilter, (u_char *)m, pktlen, 0);
1218 catchpacket(d, (u_char *)m, pktlen, slen, bpf_mcopy,
1227 bpf_mtap_family(struct bpf_if *bp, struct mbuf *m, sa_family_t family)
1231 KKASSERT(family != AF_UNSPEC);
1233 family4 = (u_int)family;
1234 bpf_ptap(bp, m, &family4, sizeof(family4));
1238 * Process the packet in the mbuf chain m with the header in m prepended.
1239 * The packet is parsed by each listener's filter, and if accepted,
1240 * stashed into the corresponding buffer.
1243 bpf_ptap(struct bpf_if *bp, struct mbuf *m, const void *data, u_int dlen)
1248 * Craft on-stack mbuf suitable for passing to bpf_mtap.
1249 * Note that we cut corners here; we only setup what's
1250 * absolutely needed--this mbuf should never go anywhere else.
1253 mb.m_data = __DECONST(void *, data); /* LINTED */
1255 mb.m_pkthdr.rcvif = m->m_pkthdr.rcvif;
1261 * Move the packet data from interface memory (pkt) into the
1262 * store buffer. Return 1 if it's time to wakeup a listener (buffer full),
1263 * otherwise 0. "copy" is the routine called to do the actual data
1264 * transfer. bcopy is passed in to copy contiguous chunks, while
1265 * bpf_mcopy is passed in to copy mbuf chains. In the latter case,
1266 * pkt is really an mbuf.
1269 catchpacket(struct bpf_d *d, u_char *pkt, u_int pktlen, u_int snaplen,
1270 void (*cpfn)(const void *, void *, size_t),
1271 const struct timeval *tv)
1275 int hdrlen = d->bd_bif->bif_hdrlen;
1277 * Figure out how many bytes to move. If the packet is
1278 * greater or equal to the snapshot length, transfer that
1279 * much. Otherwise, transfer the whole packet (unless
1280 * we hit the buffer size limit).
1282 totlen = hdrlen + min(snaplen, pktlen);
1283 if (totlen > d->bd_bufsize)
1284 totlen = d->bd_bufsize;
1287 * Round up the end of the previous packet to the next longword.
1289 curlen = BPF_WORDALIGN(d->bd_slen);
1290 if (curlen + totlen > d->bd_bufsize) {
1292 * This packet will overflow the storage buffer.
1293 * Rotate the buffers if we can, then wakeup any
1296 if (d->bd_fbuf == NULL) {
1298 * We haven't completed the previous read yet,
1299 * so drop the packet.
1307 } else if (d->bd_immediate || d->bd_state == BPF_TIMED_OUT) {
1309 * Immediate mode is set, or the read timeout has
1310 * already expired during a select call. A packet
1311 * arrived, so the reader should be woken up.
1317 * Append the bpf header.
1319 hp = (struct bpf_hdr *)(d->bd_sbuf + curlen);
1320 hp->bh_tstamp = *tv;
1321 hp->bh_datalen = pktlen;
1322 hp->bh_hdrlen = hdrlen;
1324 * Copy the packet data into the store buffer and update its length.
1326 (*cpfn)(pkt, (u_char *)hp + hdrlen, (hp->bh_caplen = totlen - hdrlen));
1327 d->bd_slen = curlen + totlen;
1331 * Initialize all nonzero fields of a descriptor.
1334 bpf_allocbufs(struct bpf_d *d)
1336 d->bd_fbuf = kmalloc(d->bd_bufsize, M_BPF, M_WAITOK);
1337 d->bd_sbuf = kmalloc(d->bd_bufsize, M_BPF, M_WAITOK);
1344 * Free buffers and packet filter program currently in use by a descriptor.
1348 bpf_freed(struct bpf_d *d)
1351 * We don't need to lock out interrupts since this descriptor has
1352 * been detached from its interface and it yet hasn't been marked
1355 if (d->bd_sbuf != NULL) {
1356 kfree(d->bd_sbuf, M_BPF);
1357 if (d->bd_hbuf != NULL)
1358 kfree(d->bd_hbuf, M_BPF);
1359 if (d->bd_fbuf != NULL)
1360 kfree(d->bd_fbuf, M_BPF);
1363 kfree(d->bd_rfilter, M_BPF);
1365 kfree(d->bd_wfilter, M_BPF);
1369 * Attach an interface to bpf. ifp is a pointer to the structure
1370 * defining the interface to be attached, dlt is the link layer type,
1371 * and hdrlen is the fixed size of the link header (variable length
1372 * headers are not yet supported).
1375 bpfattach(struct ifnet *ifp, u_int dlt, u_int hdrlen)
1377 bpfattach_dlt(ifp, dlt, hdrlen, &ifp->if_bpf);
1381 bpfattach_dlt(struct ifnet *ifp, u_int dlt, u_int hdrlen, struct bpf_if **driverp)
1385 bp = kmalloc(sizeof *bp, M_BPF, M_WAITOK | M_ZERO);
1387 SLIST_INIT(&bp->bif_dlist);
1390 bp->bif_driverp = driverp;
1391 *bp->bif_driverp = NULL;
1393 bp->bif_next = bpf_iflist;
1397 * Compute the length of the bpf header. This is not necessarily
1398 * equal to SIZEOF_BPF_HDR because we want to insert spacing such
1399 * that the network layer header begins on a longword boundary (for
1400 * performance reasons and to alleviate alignment restrictions).
1402 bp->bif_hdrlen = BPF_WORDALIGN(hdrlen + SIZEOF_BPF_HDR) - hdrlen;
1405 if_printf(ifp, "bpf attached\n");
1409 * Detach bpf from an interface. This involves detaching each descriptor
1410 * associated with the interface, and leaving bd_bif NULL. Notify each
1411 * descriptor as it's detached so that any sleepers wake up and get
1415 bpfdetach(struct ifnet *ifp)
1417 struct bpf_if *bp, *bp_prev;
1422 /* Locate BPF interface information */
1424 for (bp = bpf_iflist; bp != NULL; bp = bp->bif_next) {
1425 if (ifp == bp->bif_ifp)
1430 /* Interface wasn't attached */
1431 if (bp->bif_ifp == NULL) {
1433 kprintf("bpfdetach: %s was not attached\n", ifp->if_xname);
1437 while ((d = SLIST_FIRST(&bp->bif_dlist)) != NULL) {
1442 if (bp_prev != NULL)
1443 bp_prev->bif_next = bp->bif_next;
1445 bpf_iflist = bp->bif_next;
1453 * Get a list of available data link type of the interface.
1456 bpf_getdltlist(struct bpf_d *d, struct bpf_dltlist *bfl)
1462 ifp = d->bd_bif->bif_ifp;
1465 for (bp = bpf_iflist; bp != NULL; bp = bp->bif_next) {
1466 if (bp->bif_ifp != ifp)
1468 if (bfl->bfl_list != NULL) {
1469 if (n >= bfl->bfl_len) {
1472 error = copyout(&bp->bif_dlt,
1473 bfl->bfl_list + n, sizeof(u_int));
1482 * Set the data link type of a BPF instance.
1485 bpf_setdlt(struct bpf_d *d, u_int dlt)
1487 int error, opromisc;
1491 if (d->bd_bif->bif_dlt == dlt)
1493 ifp = d->bd_bif->bif_ifp;
1494 for (bp = bpf_iflist; bp != NULL; bp = bp->bif_next) {
1495 if (bp->bif_ifp == ifp && bp->bif_dlt == dlt)
1499 opromisc = d->bd_promisc;
1505 error = ifpromisc(bp->bif_ifp, 1);
1507 if_printf(bp->bif_ifp,
1508 "bpf_setdlt: ifpromisc failed (%d)\n",
1516 return(bp == NULL ? EINVAL : 0);
1520 bpf_drvinit(void *unused)
1524 make_autoclone_dev(&bpf_ops, &DEVFS_CLONE_BITMAP(bpf),
1525 bpfclone, 0, 0, 0600, "bpf");
1526 for (i = 0; i < BPF_PREALLOCATED_UNITS; i++) {
1527 make_dev(&bpf_ops, i, 0, 0, 0600, "bpf%d", i);
1528 devfs_clone_bitmap_set(&DEVFS_CLONE_BITMAP(bpf), i);
1533 bpf_drvuninit(void *unused)
1535 devfs_clone_handler_del("bpf");
1536 dev_ops_remove_all(&bpf_ops);
1537 devfs_clone_bitmap_uninit(&DEVFS_CLONE_BITMAP(bpf));
1540 SYSINIT(bpfdev,SI_SUB_DRIVERS,SI_ORDER_MIDDLE+CDEV_MAJOR,bpf_drvinit,NULL)
1541 SYSUNINIT(bpfdev, SI_SUB_DRIVERS,SI_ORDER_MIDDLE+CDEV_MAJOR,bpf_drvuninit, NULL);
1545 * NOP stubs to allow bpf-using drivers to load and function.
1547 * A 'better' implementation would allow the core bpf functionality
1548 * to be loaded at runtime.
1552 bpf_tap(struct bpf_if *bp, u_char *pkt, u_int pktlen)
1557 bpf_mtap(struct bpf_if *bp, struct mbuf *m)
1562 bpf_ptap(struct bpf_if *bp, struct mbuf *m, const void *data, u_int dlen)
1567 bpfattach(struct ifnet *ifp, u_int dlt, u_int hdrlen)
1572 bpfattach_dlt(struct ifnet *ifp, u_int dlt, u_int hdrlen, struct bpf_if **driverp)
1577 bpfdetach(struct ifnet *ifp)
1582 bpf_filter(const struct bpf_insn *pc, u_char *p, u_int wirelen, u_int buflen)
1584 return -1; /* "no filter" behaviour */