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 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * @(#)bpf.c 8.4 (Berkeley) 1/9/95
37 #include <sys/cdefs.h>
38 __FBSDID("$FreeBSD$");
41 #include "opt_netgraph.h"
43 #include <sys/types.h>
44 #include <sys/param.h>
45 #include <sys/systm.h>
47 #include <sys/fcntl.h>
49 #include <sys/malloc.h>
54 #include <sys/signalvar.h>
55 #include <sys/filio.h>
56 #include <sys/sockio.h>
57 #include <sys/ttycom.h>
60 #include <sys/event.h>
65 #include <sys/socket.h>
69 #include <net/bpf_buffer.h>
71 #include <net/bpf_jitter.h>
73 #include <net/bpf_zerocopy.h>
74 #include <net/bpfdesc.h>
77 #include <netinet/in.h>
78 #include <netinet/if_ether.h>
79 #include <sys/kernel.h>
80 #include <sys/sysctl.h>
82 #include <net80211/ieee80211_freebsd.h>
84 #include <security/mac/mac_framework.h>
86 MALLOC_DEFINE(M_BPF, "BPF", "BPF data");
88 #if defined(DEV_BPF) || defined(NETGRAPH_BPF)
90 #define PRINET 26 /* interruptible */
93 * bpf_iflist is a list of BPF interface structures, each corresponding to a
94 * specific DLT. The same network interface might have several BPF interface
95 * structures registered by different layers in the stack (i.e., 802.11
96 * frames, ethernet frames, etc).
98 static LIST_HEAD(, bpf_if) bpf_iflist;
99 static struct mtx bpf_mtx; /* bpf global lock */
100 static int bpf_bpfd_cnt;
102 static void bpf_attachd(struct bpf_d *, struct bpf_if *);
103 static void bpf_detachd(struct bpf_d *);
104 static void bpf_freed(struct bpf_d *);
105 static int bpf_movein(struct uio *, int, struct ifnet *, struct mbuf **,
106 struct sockaddr *, int *, struct bpf_insn *);
107 static int bpf_setif(struct bpf_d *, struct ifreq *);
108 static void bpf_timed_out(void *);
110 bpf_wakeup(struct bpf_d *);
111 static void catchpacket(struct bpf_d *, u_char *, u_int, u_int,
112 void (*)(struct bpf_d *, caddr_t, u_int, void *, u_int),
114 static void reset_d(struct bpf_d *);
115 static int bpf_setf(struct bpf_d *, struct bpf_program *, u_long cmd);
116 static int bpf_getdltlist(struct bpf_d *, struct bpf_dltlist *);
117 static int bpf_setdlt(struct bpf_d *, u_int);
118 static void filt_bpfdetach(struct knote *);
119 static int filt_bpfread(struct knote *, long);
120 static void bpf_drvinit(void *);
121 static int bpf_stats_sysctl(SYSCTL_HANDLER_ARGS);
123 SYSCTL_NODE(_net, OID_AUTO, bpf, CTLFLAG_RW, 0, "bpf sysctl");
124 int bpf_maxinsns = BPF_MAXINSNS;
125 SYSCTL_INT(_net_bpf, OID_AUTO, maxinsns, CTLFLAG_RW,
126 &bpf_maxinsns, 0, "Maximum bpf program instructions");
127 static int bpf_zerocopy_enable = 0;
128 SYSCTL_INT(_net_bpf, OID_AUTO, zerocopy_enable, CTLFLAG_RW,
129 &bpf_zerocopy_enable, 0, "Enable new zero-copy BPF buffer sessions");
130 SYSCTL_NODE(_net_bpf, OID_AUTO, stats, CTLFLAG_MPSAFE | CTLFLAG_RW,
131 bpf_stats_sysctl, "bpf statistics portal");
133 static d_open_t bpfopen;
134 static d_read_t bpfread;
135 static d_write_t bpfwrite;
136 static d_ioctl_t bpfioctl;
137 static d_poll_t bpfpoll;
138 static d_kqfilter_t bpfkqfilter;
140 static struct cdevsw bpf_cdevsw = {
141 .d_version = D_VERSION,
148 .d_kqfilter = bpfkqfilter,
151 static struct filterops bpfread_filtops =
152 { 1, NULL, filt_bpfdetach, filt_bpfread };
155 * Wrapper functions for various buffering methods. If the set of buffer
156 * modes expands, we will probably want to introduce a switch data structure
157 * similar to protosw, et.
160 bpf_append_bytes(struct bpf_d *d, caddr_t buf, u_int offset, void *src,
166 switch (d->bd_bufmode) {
167 case BPF_BUFMODE_BUFFER:
168 return (bpf_buffer_append_bytes(d, buf, offset, src, len));
170 case BPF_BUFMODE_ZBUF:
172 return (bpf_zerocopy_append_bytes(d, buf, offset, src, len));
175 panic("bpf_buf_append_bytes");
180 bpf_append_mbuf(struct bpf_d *d, caddr_t buf, u_int offset, void *src,
186 switch (d->bd_bufmode) {
187 case BPF_BUFMODE_BUFFER:
188 return (bpf_buffer_append_mbuf(d, buf, offset, src, len));
190 case BPF_BUFMODE_ZBUF:
192 return (bpf_zerocopy_append_mbuf(d, buf, offset, src, len));
195 panic("bpf_buf_append_mbuf");
200 * This function gets called when the free buffer is re-assigned.
203 bpf_buf_reclaimed(struct bpf_d *d)
208 switch (d->bd_bufmode) {
209 case BPF_BUFMODE_BUFFER:
212 case BPF_BUFMODE_ZBUF:
213 bpf_zerocopy_buf_reclaimed(d);
217 panic("bpf_buf_reclaimed");
222 * If the buffer mechanism has a way to decide that a held buffer can be made
223 * free, then it is exposed via the bpf_canfreebuf() interface. (1) is
224 * returned if the buffer can be discarded, (0) is returned if it cannot.
227 bpf_canfreebuf(struct bpf_d *d)
232 switch (d->bd_bufmode) {
233 case BPF_BUFMODE_ZBUF:
234 return (bpf_zerocopy_canfreebuf(d));
240 * Allow the buffer model to indicate that the current store buffer is
241 * immutable, regardless of the appearance of space. Return (1) if the
242 * buffer is writable, and (0) if not.
245 bpf_canwritebuf(struct bpf_d *d)
250 switch (d->bd_bufmode) {
251 case BPF_BUFMODE_ZBUF:
252 return (bpf_zerocopy_canwritebuf(d));
258 * Notify buffer model that an attempt to write to the store buffer has
259 * resulted in a dropped packet, in which case the buffer may be considered
263 bpf_buffull(struct bpf_d *d)
268 switch (d->bd_bufmode) {
269 case BPF_BUFMODE_ZBUF:
270 bpf_zerocopy_buffull(d);
276 * Notify the buffer model that a buffer has moved into the hold position.
279 bpf_bufheld(struct bpf_d *d)
284 switch (d->bd_bufmode) {
285 case BPF_BUFMODE_ZBUF:
286 bpf_zerocopy_bufheld(d);
292 bpf_free(struct bpf_d *d)
295 switch (d->bd_bufmode) {
296 case BPF_BUFMODE_BUFFER:
297 return (bpf_buffer_free(d));
299 case BPF_BUFMODE_ZBUF:
300 return (bpf_zerocopy_free(d));
303 panic("bpf_buf_free");
308 bpf_uiomove(struct bpf_d *d, caddr_t buf, u_int len, struct uio *uio)
311 if (d->bd_bufmode != BPF_BUFMODE_BUFFER)
313 return (bpf_buffer_uiomove(d, buf, len, uio));
317 bpf_ioctl_sblen(struct bpf_d *d, u_int *i)
320 if (d->bd_bufmode != BPF_BUFMODE_BUFFER)
322 return (bpf_buffer_ioctl_sblen(d, i));
326 bpf_ioctl_getzmax(struct thread *td, struct bpf_d *d, size_t *i)
329 if (d->bd_bufmode != BPF_BUFMODE_ZBUF)
331 return (bpf_zerocopy_ioctl_getzmax(td, d, i));
335 bpf_ioctl_rotzbuf(struct thread *td, struct bpf_d *d, struct bpf_zbuf *bz)
338 if (d->bd_bufmode != BPF_BUFMODE_ZBUF)
340 return (bpf_zerocopy_ioctl_rotzbuf(td, d, bz));
344 bpf_ioctl_setzbuf(struct thread *td, struct bpf_d *d, struct bpf_zbuf *bz)
347 if (d->bd_bufmode != BPF_BUFMODE_ZBUF)
349 return (bpf_zerocopy_ioctl_setzbuf(td, d, bz));
353 * General BPF functions.
356 bpf_movein(struct uio *uio, int linktype, struct ifnet *ifp, struct mbuf **mp,
357 struct sockaddr *sockp, int *hdrlen, struct bpf_insn *wfilter)
359 const struct ieee80211_bpf_params *p;
360 struct ether_header *eh;
368 * Build a sockaddr based on the data link layer type.
369 * We do this at this level because the ethernet header
370 * is copied directly into the data field of the sockaddr.
371 * In the case of SLIP, there is no header and the packet
372 * is forwarded as is.
373 * Also, we are careful to leave room at the front of the mbuf
374 * for the link level header.
379 sockp->sa_family = AF_INET;
384 sockp->sa_family = AF_UNSPEC;
385 /* XXX Would MAXLINKHDR be better? */
386 hlen = ETHER_HDR_LEN;
390 sockp->sa_family = AF_IMPLINK;
395 sockp->sa_family = AF_UNSPEC;
401 * null interface types require a 4 byte pseudo header which
402 * corresponds to the address family of the packet.
404 sockp->sa_family = AF_UNSPEC;
408 case DLT_ATM_RFC1483:
410 * en atm driver requires 4-byte atm pseudo header.
411 * though it isn't standard, vpi:vci needs to be
414 sockp->sa_family = AF_UNSPEC;
415 hlen = 12; /* XXX 4(ATM_PH) + 3(LLC) + 5(SNAP) */
419 sockp->sa_family = AF_UNSPEC;
420 hlen = 4; /* This should match PPP_HDRLEN */
423 case DLT_IEEE802_11: /* IEEE 802.11 wireless */
424 sockp->sa_family = AF_IEEE80211;
428 case DLT_IEEE802_11_RADIO: /* IEEE 802.11 wireless w/ phy params */
429 sockp->sa_family = AF_IEEE80211;
430 sockp->sa_len = 12; /* XXX != 0 */
431 hlen = sizeof(struct ieee80211_bpf_params);
438 len = uio->uio_resid;
440 if (len - hlen > ifp->if_mtu)
443 if ((unsigned)len > MJUM16BYTES)
447 MGETHDR(m, M_WAIT, MT_DATA);
448 else if (len <= MCLBYTES)
449 m = m_getcl(M_WAIT, MT_DATA, M_PKTHDR);
451 m = m_getjcl(M_WAIT, MT_DATA, M_PKTHDR,
452 #if (MJUMPAGESIZE > MCLBYTES)
453 len <= MJUMPAGESIZE ? MJUMPAGESIZE :
455 (len <= MJUM9BYTES ? MJUM9BYTES : MJUM16BYTES));
456 m->m_pkthdr.len = m->m_len = len;
457 m->m_pkthdr.rcvif = NULL;
460 if (m->m_len < hlen) {
465 error = uiomove(mtod(m, u_char *), len, uio);
469 slen = bpf_filter(wfilter, mtod(m, u_char *), len, len);
475 /* Check for multicast destination */
478 eh = mtod(m, struct ether_header *);
479 if (ETHER_IS_MULTICAST(eh->ether_dhost)) {
480 if (bcmp(ifp->if_broadcastaddr, eh->ether_dhost,
481 ETHER_ADDR_LEN) == 0)
482 m->m_flags |= M_BCAST;
484 m->m_flags |= M_MCAST;
490 * Make room for link header, and copy it to sockaddr
493 if (sockp->sa_family == AF_IEEE80211) {
495 * Collect true length from the parameter header
496 * NB: sockp is known to be zero'd so if we do a
497 * short copy unspecified parameters will be
499 * NB: packet may not be aligned after stripping
503 p = mtod(m, const struct ieee80211_bpf_params *);
505 if (hlen > sizeof(sockp->sa_data)) {
510 bcopy(m->m_data, sockp->sa_data, hlen);
521 * Attach file to the bpf interface, i.e. make d listen on bp.
524 bpf_attachd(struct bpf_d *d, struct bpf_if *bp)
527 * Point d at bp, and add d to the interface's list of listeners.
528 * Finally, point the driver's bpf cookie at the interface so
529 * it will divert packets to bpf.
533 LIST_INSERT_HEAD(&bp->bif_dlist, d, bd_next);
538 EVENTHANDLER_INVOKE(bpf_track, bp->bif_ifp, bp->bif_dlt, 1);
542 * Detach a file from its interface.
545 bpf_detachd(struct bpf_d *d)
554 ifp = d->bd_bif->bif_ifp;
557 * Remove d from the interface's descriptor list.
559 LIST_REMOVE(d, bd_next);
566 EVENTHANDLER_INVOKE(bpf_track, ifp, bp->bif_dlt, 0);
569 * Check if this descriptor had requested promiscuous mode.
570 * If so, turn it off.
574 CURVNET_SET(ifp->if_vnet);
575 error = ifpromisc(ifp, 0);
577 if (error != 0 && error != ENXIO) {
579 * ENXIO can happen if a pccard is unplugged
580 * Something is really wrong if we were able to put
581 * the driver into promiscuous mode, but can't
584 if_printf(bp->bif_ifp,
585 "bpf_detach: ifpromisc failed (%d)\n", error);
591 * Close the descriptor by detaching it from its interface,
592 * deallocating its buffers, and marking it free.
597 struct bpf_d *d = data;
600 if (d->bd_state == BPF_WAITING)
601 callout_stop(&d->bd_callout);
602 d->bd_state = BPF_IDLE;
604 funsetown(&d->bd_sigio);
608 mtx_unlock(&bpf_mtx);
609 selwakeuppri(&d->bd_sel, PRINET);
611 mac_bpfdesc_destroy(d);
613 knlist_destroy(&d->bd_sel.si_note);
619 * Open ethernet device. Returns ENXIO for illegal minor device number,
620 * EBUSY if file is open by another process.
624 bpfopen(struct cdev *dev, int flags, int fmt, struct thread *td)
629 d = malloc(sizeof(*d), M_BPF, M_WAITOK | M_ZERO);
630 error = devfs_set_cdevpriv(d, bpf_dtor);
637 * For historical reasons, perform a one-time initialization call to
638 * the buffer routines, even though we're not yet committed to a
639 * particular buffer method.
642 d->bd_bufmode = BPF_BUFMODE_BUFFER;
644 d->bd_direction = BPF_D_INOUT;
645 d->bd_pid = td->td_proc->p_pid;
648 mac_bpfdesc_create(td->td_ucred, d);
650 mtx_init(&d->bd_mtx, devtoname(dev), "bpf cdev lock", MTX_DEF);
651 callout_init(&d->bd_callout, CALLOUT_MPSAFE);
652 knlist_init_mtx(&d->bd_sel.si_note, &d->bd_mtx);
658 * bpfread - read next chunk of packets from buffers
661 bpfread(struct cdev *dev, struct uio *uio, int ioflag)
667 error = devfs_get_cdevpriv((void **)&d);
672 * Restrict application to use a buffer the same size as
675 if (uio->uio_resid != d->bd_bufsize)
679 d->bd_pid = curthread->td_proc->p_pid;
680 if (d->bd_bufmode != BPF_BUFMODE_BUFFER) {
684 if (d->bd_state == BPF_WAITING)
685 callout_stop(&d->bd_callout);
686 timed_out = (d->bd_state == BPF_TIMED_OUT);
687 d->bd_state = BPF_IDLE;
689 * If the hold buffer is empty, then do a timed sleep, which
690 * ends when the timeout expires or when enough packets
691 * have arrived to fill the store buffer.
693 while (d->bd_hbuf == NULL) {
694 if ((d->bd_immediate || timed_out) && d->bd_slen != 0) {
696 * A packet(s) either arrived since the previous
697 * read or arrived while we were asleep.
698 * Rotate the buffers and return what's here.
705 * No data is available, check to see if the bpf device
706 * is still pointed at a real interface. If not, return
707 * ENXIO so that the userland process knows to rebind
708 * it before using it again.
710 if (d->bd_bif == NULL) {
715 if (ioflag & O_NONBLOCK) {
717 return (EWOULDBLOCK);
719 error = msleep(d, &d->bd_mtx, PRINET|PCATCH,
721 if (error == EINTR || error == ERESTART) {
725 if (error == EWOULDBLOCK) {
727 * On a timeout, return what's in the buffer,
728 * which may be nothing. If there is something
729 * in the store buffer, we can rotate the buffers.
733 * We filled up the buffer in between
734 * getting the timeout and arriving
735 * here, so we don't need to rotate.
739 if (d->bd_slen == 0) {
748 * At this point, we know we have something in the hold slot.
753 * Move data from hold buffer into user space.
754 * We know the entire buffer is transferred since
755 * we checked above that the read buffer is bpf_bufsize bytes.
757 * XXXRW: More synchronization needed here: what if a second thread
758 * issues a read on the same fd at the same time? Don't want this
759 * getting invalidated.
761 error = bpf_uiomove(d, d->bd_hbuf, d->bd_hlen, uio);
764 d->bd_fbuf = d->bd_hbuf;
767 bpf_buf_reclaimed(d);
774 * If there are processes sleeping on this descriptor, wake them up.
777 bpf_wakeup(struct bpf_d *d)
781 if (d->bd_state == BPF_WAITING) {
782 callout_stop(&d->bd_callout);
783 d->bd_state = BPF_IDLE;
786 if (d->bd_async && d->bd_sig && d->bd_sigio)
787 pgsigio(&d->bd_sigio, d->bd_sig, 0);
789 selwakeuppri(&d->bd_sel, PRINET);
790 KNOTE_LOCKED(&d->bd_sel.si_note, 0);
794 bpf_timed_out(void *arg)
796 struct bpf_d *d = (struct bpf_d *)arg;
799 if (d->bd_state == BPF_WAITING) {
800 d->bd_state = BPF_TIMED_OUT;
808 bpf_ready(struct bpf_d *d)
813 if (!bpf_canfreebuf(d) && d->bd_hlen != 0)
815 if ((d->bd_immediate || d->bd_state == BPF_TIMED_OUT) &&
822 bpfwrite(struct cdev *dev, struct uio *uio, int ioflag)
830 error = devfs_get_cdevpriv((void **)&d);
834 d->bd_pid = curthread->td_proc->p_pid;
836 if (d->bd_bif == NULL) {
841 ifp = d->bd_bif->bif_ifp;
843 if ((ifp->if_flags & IFF_UP) == 0) {
848 if (uio->uio_resid == 0) {
853 bzero(&dst, sizeof(dst));
856 error = bpf_movein(uio, (int)d->bd_bif->bif_dlt, ifp,
857 &m, &dst, &hlen, d->bd_wfilter);
864 dst.sa_family = pseudo_AF_HDRCMPLT;
866 if (d->bd_feedback) {
867 mc = m_dup(m, M_DONTWAIT);
869 mc->m_pkthdr.rcvif = ifp;
870 /* Set M_PROMISC for outgoing packets to be discarded. */
871 if (d->bd_direction == BPF_D_INOUT)
872 m->m_flags |= M_PROMISC;
876 m->m_pkthdr.len -= hlen;
878 m->m_data += hlen; /* XXX */
880 CURVNET_SET(ifp->if_vnet);
883 mac_bpfdesc_create_mbuf(d, m);
885 mac_bpfdesc_create_mbuf(d, mc);
889 error = (*ifp->if_output)(ifp, m, &dst, NULL);
895 (*ifp->if_input)(ifp, mc);
905 * Reset a descriptor by flushing its packet buffer and clearing the receive
906 * and drop counts. This is doable for kernel-only buffers, but with
907 * zero-copy buffers, we can't write to (or rotate) buffers that are
908 * currently owned by userspace. It would be nice if we could encapsulate
909 * this logic in the buffer code rather than here.
912 reset_d(struct bpf_d *d)
915 mtx_assert(&d->bd_mtx, MA_OWNED);
917 if ((d->bd_hbuf != NULL) &&
918 (d->bd_bufmode != BPF_BUFMODE_ZBUF || bpf_canfreebuf(d))) {
919 /* Free the hold buffer. */
920 d->bd_fbuf = d->bd_hbuf;
923 bpf_buf_reclaimed(d);
925 if (bpf_canwritebuf(d))
937 * FIONREAD Check for read packet available.
938 * SIOCGIFADDR Get interface address - convenient hook to driver.
939 * BIOCGBLEN Get buffer len [for read()].
940 * BIOCSETF Set read filter.
941 * BIOCSETFNR Set read filter without resetting descriptor.
942 * BIOCSETWF Set write filter.
943 * BIOCFLUSH Flush read packet buffer.
944 * BIOCPROMISC Put interface into promiscuous mode.
945 * BIOCGDLT Get link layer type.
946 * BIOCGETIF Get interface name.
947 * BIOCSETIF Set interface.
948 * BIOCSRTIMEOUT Set read timeout.
949 * BIOCGRTIMEOUT Get read timeout.
950 * BIOCGSTATS Get packet stats.
951 * BIOCIMMEDIATE Set immediate mode.
952 * BIOCVERSION Get filter language version.
953 * BIOCGHDRCMPLT Get "header already complete" flag
954 * BIOCSHDRCMPLT Set "header already complete" flag
955 * BIOCGDIRECTION Get packet direction flag
956 * BIOCSDIRECTION Set packet direction flag
957 * BIOCLOCK Set "locked" flag
958 * BIOCFEEDBACK Set packet feedback mode.
959 * BIOCSETZBUF Set current zero-copy buffer locations.
960 * BIOCGETZMAX Get maximum zero-copy buffer size.
961 * BIOCROTZBUF Force rotation of zero-copy buffer
962 * BIOCSETBUFMODE Set buffer mode.
963 * BIOCGETBUFMODE Get current buffer mode.
967 bpfioctl(struct cdev *dev, u_long cmd, caddr_t addr, int flags,
973 error = devfs_get_cdevpriv((void **)&d);
978 * Refresh PID associated with this descriptor.
981 d->bd_pid = td->td_proc->p_pid;
982 if (d->bd_state == BPF_WAITING)
983 callout_stop(&d->bd_callout);
984 d->bd_state = BPF_IDLE;
987 if (d->bd_locked == 1) {
1011 CURVNET_SET(TD_TO_VNET(td));
1019 * Check for read packet available.
1039 if (d->bd_bif == NULL)
1042 ifp = d->bd_bif->bif_ifp;
1043 error = (*ifp->if_ioctl)(ifp, cmd, addr);
1049 * Get buffer len [for read()].
1052 *(u_int *)addr = d->bd_bufsize;
1056 * Set buffer length.
1059 error = bpf_ioctl_sblen(d, (u_int *)addr);
1063 * Set link layer read filter.
1068 error = bpf_setf(d, (struct bpf_program *)addr, cmd);
1072 * Flush read packet buffer.
1081 * Put interface into promiscuous mode.
1084 if (d->bd_bif == NULL) {
1086 * No interface attached yet.
1091 if (d->bd_promisc == 0) {
1092 error = ifpromisc(d->bd_bif->bif_ifp, 1);
1099 * Get current data link type.
1102 if (d->bd_bif == NULL)
1105 *(u_int *)addr = d->bd_bif->bif_dlt;
1109 * Get a list of supported data link types.
1112 if (d->bd_bif == NULL)
1115 error = bpf_getdltlist(d, (struct bpf_dltlist *)addr);
1119 * Set data link type.
1122 if (d->bd_bif == NULL)
1125 error = bpf_setdlt(d, *(u_int *)addr);
1129 * Get interface name.
1132 if (d->bd_bif == NULL)
1135 struct ifnet *const ifp = d->bd_bif->bif_ifp;
1136 struct ifreq *const ifr = (struct ifreq *)addr;
1138 strlcpy(ifr->ifr_name, ifp->if_xname,
1139 sizeof(ifr->ifr_name));
1147 error = bpf_setif(d, (struct ifreq *)addr);
1155 struct timeval *tv = (struct timeval *)addr;
1158 * Subtract 1 tick from tvtohz() since this isn't
1161 if ((error = itimerfix(tv)) == 0)
1162 d->bd_rtout = tvtohz(tv) - 1;
1171 struct timeval *tv = (struct timeval *)addr;
1173 tv->tv_sec = d->bd_rtout / hz;
1174 tv->tv_usec = (d->bd_rtout % hz) * tick;
1183 struct bpf_stat *bs = (struct bpf_stat *)addr;
1185 /* XXXCSJP overflow */
1186 bs->bs_recv = d->bd_rcount;
1187 bs->bs_drop = d->bd_dcount;
1192 * Set immediate mode.
1195 d->bd_immediate = *(u_int *)addr;
1200 struct bpf_version *bv = (struct bpf_version *)addr;
1202 bv->bv_major = BPF_MAJOR_VERSION;
1203 bv->bv_minor = BPF_MINOR_VERSION;
1208 * Get "header already complete" flag
1211 *(u_int *)addr = d->bd_hdrcmplt;
1215 * Set "header already complete" flag
1218 d->bd_hdrcmplt = *(u_int *)addr ? 1 : 0;
1222 * Get packet direction flag
1224 case BIOCGDIRECTION:
1225 *(u_int *)addr = d->bd_direction;
1229 * Set packet direction flag
1231 case BIOCSDIRECTION:
1235 direction = *(u_int *)addr;
1236 switch (direction) {
1240 d->bd_direction = direction;
1249 d->bd_feedback = *(u_int *)addr;
1256 case FIONBIO: /* Non-blocking I/O */
1259 case FIOASYNC: /* Send signal on receive packets */
1260 d->bd_async = *(int *)addr;
1264 error = fsetown(*(int *)addr, &d->bd_sigio);
1268 *(int *)addr = fgetown(&d->bd_sigio);
1271 /* This is deprecated, FIOSETOWN should be used instead. */
1273 error = fsetown(-(*(int *)addr), &d->bd_sigio);
1276 /* This is deprecated, FIOGETOWN should be used instead. */
1278 *(int *)addr = -fgetown(&d->bd_sigio);
1281 case BIOCSRSIG: /* Set receive signal */
1285 sig = *(u_int *)addr;
1294 *(u_int *)addr = d->bd_sig;
1297 case BIOCGETBUFMODE:
1298 *(u_int *)addr = d->bd_bufmode;
1301 case BIOCSETBUFMODE:
1303 * Allow the buffering mode to be changed as long as we
1304 * haven't yet committed to a particular mode. Our
1305 * definition of commitment, for now, is whether or not a
1306 * buffer has been allocated or an interface attached, since
1307 * that's the point where things get tricky.
1309 switch (*(u_int *)addr) {
1310 case BPF_BUFMODE_BUFFER:
1313 case BPF_BUFMODE_ZBUF:
1314 if (bpf_zerocopy_enable)
1323 if (d->bd_sbuf != NULL || d->bd_hbuf != NULL ||
1324 d->bd_fbuf != NULL || d->bd_bif != NULL) {
1328 d->bd_bufmode = *(u_int *)addr;
1333 return (bpf_ioctl_getzmax(td, d, (size_t *)addr));
1336 return (bpf_ioctl_setzbuf(td, d, (struct bpf_zbuf *)addr));
1339 return (bpf_ioctl_rotzbuf(td, d, (struct bpf_zbuf *)addr));
1346 * Set d's packet filter program to fp. If this file already has a filter,
1347 * free it and replace it. Returns EINVAL for bogus requests.
1350 bpf_setf(struct bpf_d *d, struct bpf_program *fp, u_long cmd)
1352 struct bpf_insn *fcode, *old;
1353 u_int wfilter, flen, size;
1355 bpf_jit_filter *ofunc;
1358 if (cmd == BIOCSETWF) {
1359 old = d->bd_wfilter;
1366 old = d->bd_rfilter;
1368 ofunc = d->bd_bfilter;
1371 if (fp->bf_insns == NULL) {
1372 if (fp->bf_len != 0)
1376 d->bd_wfilter = NULL;
1378 d->bd_rfilter = NULL;
1380 d->bd_bfilter = NULL;
1382 if (cmd == BIOCSETF)
1387 free((caddr_t)old, M_BPF);
1390 bpf_destroy_jit_filter(ofunc);
1395 if (flen > bpf_maxinsns)
1398 size = flen * sizeof(*fp->bf_insns);
1399 fcode = (struct bpf_insn *)malloc(size, M_BPF, M_WAITOK);
1400 if (copyin((caddr_t)fp->bf_insns, (caddr_t)fcode, size) == 0 &&
1401 bpf_validate(fcode, (int)flen)) {
1404 d->bd_wfilter = fcode;
1406 d->bd_rfilter = fcode;
1408 d->bd_bfilter = bpf_jitter(fcode, flen);
1410 if (cmd == BIOCSETF)
1415 free((caddr_t)old, M_BPF);
1418 bpf_destroy_jit_filter(ofunc);
1423 free((caddr_t)fcode, M_BPF);
1428 * Detach a file from its current interface (if attached at all) and attach
1429 * to the interface indicated by the name stored in ifr.
1430 * Return an errno or 0.
1433 bpf_setif(struct bpf_d *d, struct ifreq *ifr)
1436 struct ifnet *theywant;
1438 theywant = ifunit(ifr->ifr_name);
1439 if (theywant == NULL || theywant->if_bpf == NULL)
1442 bp = theywant->if_bpf;
1445 * Behavior here depends on the buffering model. If we're using
1446 * kernel memory buffers, then we can allocate them here. If we're
1447 * using zero-copy, then the user process must have registered
1448 * buffers by the time we get here. If not, return an error.
1450 * XXXRW: There are locking issues here with multi-threaded use: what
1451 * if two threads try to set the interface at once?
1453 switch (d->bd_bufmode) {
1454 case BPF_BUFMODE_BUFFER:
1455 if (d->bd_sbuf == NULL)
1456 bpf_buffer_alloc(d);
1457 KASSERT(d->bd_sbuf != NULL, ("bpf_setif: bd_sbuf NULL"));
1460 case BPF_BUFMODE_ZBUF:
1461 if (d->bd_sbuf == NULL)
1466 panic("bpf_setif: bufmode %d", d->bd_bufmode);
1468 if (bp != d->bd_bif) {
1471 * Detach if attached to something else.
1484 * Support for select() and poll() system calls
1486 * Return true iff the specific operation will not block indefinitely.
1487 * Otherwise, return false but make a note that a selwakeup() must be done.
1490 bpfpoll(struct cdev *dev, int events, struct thread *td)
1495 if (devfs_get_cdevpriv((void **)&d) != 0 || d->bd_bif == NULL)
1497 (POLLHUP|POLLIN|POLLRDNORM|POLLOUT|POLLWRNORM));
1500 * Refresh PID associated with this descriptor.
1502 revents = events & (POLLOUT | POLLWRNORM);
1504 d->bd_pid = td->td_proc->p_pid;
1505 if (events & (POLLIN | POLLRDNORM)) {
1507 revents |= events & (POLLIN | POLLRDNORM);
1509 selrecord(td, &d->bd_sel);
1510 /* Start the read timeout if necessary. */
1511 if (d->bd_rtout > 0 && d->bd_state == BPF_IDLE) {
1512 callout_reset(&d->bd_callout, d->bd_rtout,
1514 d->bd_state = BPF_WAITING;
1523 * Support for kevent() system call. Register EVFILT_READ filters and
1524 * reject all others.
1527 bpfkqfilter(struct cdev *dev, struct knote *kn)
1531 if (devfs_get_cdevpriv((void **)&d) != 0 ||
1532 kn->kn_filter != EVFILT_READ)
1536 * Refresh PID associated with this descriptor.
1539 d->bd_pid = curthread->td_proc->p_pid;
1540 kn->kn_fop = &bpfread_filtops;
1542 knlist_add(&d->bd_sel.si_note, kn, 1);
1549 filt_bpfdetach(struct knote *kn)
1551 struct bpf_d *d = (struct bpf_d *)kn->kn_hook;
1553 knlist_remove(&d->bd_sel.si_note, kn, 0);
1557 filt_bpfread(struct knote *kn, long hint)
1559 struct bpf_d *d = (struct bpf_d *)kn->kn_hook;
1562 BPFD_LOCK_ASSERT(d);
1563 ready = bpf_ready(d);
1565 kn->kn_data = d->bd_slen;
1567 kn->kn_data += d->bd_hlen;
1569 else if (d->bd_rtout > 0 && d->bd_state == BPF_IDLE) {
1570 callout_reset(&d->bd_callout, d->bd_rtout,
1572 d->bd_state = BPF_WAITING;
1579 * Incoming linkage from device drivers. Process the packet pkt, of length
1580 * pktlen, which is stored in a contiguous buffer. The packet is parsed
1581 * by each process' filter, and if accepted, stashed into the corresponding
1585 bpf_tap(struct bpf_if *bp, u_char *pkt, u_int pktlen)
1594 LIST_FOREACH(d, &bp->bif_dlist, bd_next) {
1598 * NB: We dont call BPF_CHECK_DIRECTION() here since there is no
1599 * way for the caller to indiciate to us whether this packet
1600 * is inbound or outbound. In the bpf_mtap() routines, we use
1601 * the interface pointers on the mbuf to figure it out.
1604 if (bpf_jitter_enable != 0 && d->bd_bfilter != NULL)
1605 slen = (*(d->bd_bfilter->func))(pkt, pktlen, pktlen);
1608 slen = bpf_filter(d->bd_rfilter, pkt, pktlen, pktlen);
1616 if (mac_bpfdesc_check_receive(d, bp->bif_ifp) == 0)
1618 catchpacket(d, pkt, pktlen, slen,
1619 bpf_append_bytes, &tv);
1626 #define BPF_CHECK_DIRECTION(d, r, i) \
1627 (((d)->bd_direction == BPF_D_IN && (r) != (i)) || \
1628 ((d)->bd_direction == BPF_D_OUT && (r) == (i)))
1631 * Incoming linkage from device drivers, when packet is in an mbuf chain.
1634 bpf_mtap(struct bpf_if *bp, struct mbuf *m)
1641 /* Skip outgoing duplicate packets. */
1642 if ((m->m_flags & M_PROMISC) != 0 && m->m_pkthdr.rcvif == NULL) {
1643 m->m_flags &= ~M_PROMISC;
1649 pktlen = m_length(m, NULL);
1652 LIST_FOREACH(d, &bp->bif_dlist, bd_next) {
1653 if (BPF_CHECK_DIRECTION(d, m->m_pkthdr.rcvif, bp->bif_ifp))
1658 /* XXX We cannot handle multiple mbufs. */
1659 if (bpf_jitter_enable != 0 && d->bd_bfilter != NULL &&
1661 slen = (*(d->bd_bfilter->func))(mtod(m, u_char *),
1665 slen = bpf_filter(d->bd_rfilter, (u_char *)m, pktlen, 0);
1673 if (mac_bpfdesc_check_receive(d, bp->bif_ifp) == 0)
1675 catchpacket(d, (u_char *)m, pktlen, slen,
1676 bpf_append_mbuf, &tv);
1684 * Incoming linkage from device drivers, when packet is in
1685 * an mbuf chain and to be prepended by a contiguous header.
1688 bpf_mtap2(struct bpf_if *bp, void *data, u_int dlen, struct mbuf *m)
1696 /* Skip outgoing duplicate packets. */
1697 if ((m->m_flags & M_PROMISC) != 0 && m->m_pkthdr.rcvif == NULL) {
1698 m->m_flags &= ~M_PROMISC;
1704 pktlen = m_length(m, NULL);
1706 * Craft on-stack mbuf suitable for passing to bpf_filter.
1707 * Note that we cut corners here; we only setup what's
1708 * absolutely needed--this mbuf should never go anywhere else.
1716 LIST_FOREACH(d, &bp->bif_dlist, bd_next) {
1717 if (BPF_CHECK_DIRECTION(d, m->m_pkthdr.rcvif, bp->bif_ifp))
1721 slen = bpf_filter(d->bd_rfilter, (u_char *)&mb, pktlen, 0);
1729 if (mac_bpfdesc_check_receive(d, bp->bif_ifp) == 0)
1731 catchpacket(d, (u_char *)&mb, pktlen, slen,
1732 bpf_append_mbuf, &tv);
1739 #undef BPF_CHECK_DIRECTION
1742 * Move the packet data from interface memory (pkt) into the
1743 * store buffer. "cpfn" is the routine called to do the actual data
1744 * transfer. bcopy is passed in to copy contiguous chunks, while
1745 * bpf_append_mbuf is passed in to copy mbuf chains. In the latter case,
1746 * pkt is really an mbuf.
1749 catchpacket(struct bpf_d *d, u_char *pkt, u_int pktlen, u_int snaplen,
1750 void (*cpfn)(struct bpf_d *, caddr_t, u_int, void *, u_int),
1755 int hdrlen = d->bd_bif->bif_hdrlen;
1758 BPFD_LOCK_ASSERT(d);
1761 * Detect whether user space has released a buffer back to us, and if
1762 * so, move it from being a hold buffer to a free buffer. This may
1763 * not be the best place to do it (for example, we might only want to
1764 * run this check if we need the space), but for now it's a reliable
1767 if (d->bd_fbuf == NULL && bpf_canfreebuf(d)) {
1768 d->bd_fbuf = d->bd_hbuf;
1771 bpf_buf_reclaimed(d);
1775 * Figure out how many bytes to move. If the packet is
1776 * greater or equal to the snapshot length, transfer that
1777 * much. Otherwise, transfer the whole packet (unless
1778 * we hit the buffer size limit).
1780 totlen = hdrlen + min(snaplen, pktlen);
1781 if (totlen > d->bd_bufsize)
1782 totlen = d->bd_bufsize;
1785 * Round up the end of the previous packet to the next longword.
1787 * Drop the packet if there's no room and no hope of room
1788 * If the packet would overflow the storage buffer or the storage
1789 * buffer is considered immutable by the buffer model, try to rotate
1790 * the buffer and wakeup pending processes.
1792 curlen = BPF_WORDALIGN(d->bd_slen);
1793 if (curlen + totlen > d->bd_bufsize || !bpf_canwritebuf(d)) {
1794 if (d->bd_fbuf == NULL) {
1796 * There's no room in the store buffer, and no
1797 * prospect of room, so drop the packet. Notify the
1807 } else if (d->bd_immediate || d->bd_state == BPF_TIMED_OUT)
1809 * Immediate mode is set, or the read timeout has already
1810 * expired during a select call. A packet arrived, so the
1811 * reader should be woken up.
1816 * Append the bpf header. Note we append the actual header size, but
1817 * move forward the length of the header plus padding.
1819 bzero(&hdr, sizeof(hdr));
1820 hdr.bh_tstamp = *tv;
1821 hdr.bh_datalen = pktlen;
1822 hdr.bh_hdrlen = hdrlen;
1823 hdr.bh_caplen = totlen - hdrlen;
1824 bpf_append_bytes(d, d->bd_sbuf, curlen, &hdr, sizeof(hdr));
1827 * Copy the packet data into the store buffer and update its length.
1829 (*cpfn)(d, d->bd_sbuf, curlen + hdrlen, pkt, hdr.bh_caplen);
1830 d->bd_slen = curlen + totlen;
1837 * Free buffers currently in use by a descriptor.
1841 bpf_freed(struct bpf_d *d)
1845 * We don't need to lock out interrupts since this descriptor has
1846 * been detached from its interface and it yet hasn't been marked
1850 if (d->bd_rfilter) {
1851 free((caddr_t)d->bd_rfilter, M_BPF);
1853 bpf_destroy_jit_filter(d->bd_bfilter);
1857 free((caddr_t)d->bd_wfilter, M_BPF);
1858 mtx_destroy(&d->bd_mtx);
1862 * Attach an interface to bpf. dlt is the link layer type; hdrlen is the
1863 * fixed size of the link header (variable length headers not yet supported).
1866 bpfattach(struct ifnet *ifp, u_int dlt, u_int hdrlen)
1869 bpfattach2(ifp, dlt, hdrlen, &ifp->if_bpf);
1873 * Attach an interface to bpf. ifp is a pointer to the structure
1874 * defining the interface to be attached, dlt is the link layer type,
1875 * and hdrlen is the fixed size of the link header (variable length
1876 * headers are not yet supporrted).
1879 bpfattach2(struct ifnet *ifp, u_int dlt, u_int hdrlen, struct bpf_if **driverp)
1883 bp = malloc(sizeof(*bp), M_BPF, M_NOWAIT | M_ZERO);
1887 LIST_INIT(&bp->bif_dlist);
1890 mtx_init(&bp->bif_mtx, "bpf interface lock", NULL, MTX_DEF);
1891 KASSERT(*driverp == NULL, ("bpfattach2: driverp already initialized"));
1895 LIST_INSERT_HEAD(&bpf_iflist, bp, bif_next);
1896 mtx_unlock(&bpf_mtx);
1899 * Compute the length of the bpf header. This is not necessarily
1900 * equal to SIZEOF_BPF_HDR because we want to insert spacing such
1901 * that the network layer header begins on a longword boundary (for
1902 * performance reasons and to alleviate alignment restrictions).
1904 bp->bif_hdrlen = BPF_WORDALIGN(hdrlen + SIZEOF_BPF_HDR) - hdrlen;
1907 if_printf(ifp, "bpf attached\n");
1911 * Detach bpf from an interface. This involves detaching each descriptor
1912 * associated with the interface, and leaving bd_bif NULL. Notify each
1913 * descriptor as it's detached so that any sleepers wake up and get
1917 bpfdetach(struct ifnet *ifp)
1922 /* Locate BPF interface information */
1924 LIST_FOREACH(bp, &bpf_iflist, bif_next) {
1925 if (ifp == bp->bif_ifp)
1929 /* Interface wasn't attached */
1930 if ((bp == NULL) || (bp->bif_ifp == NULL)) {
1931 mtx_unlock(&bpf_mtx);
1932 printf("bpfdetach: %s was not attached\n", ifp->if_xname);
1936 LIST_REMOVE(bp, bif_next);
1937 mtx_unlock(&bpf_mtx);
1939 while ((d = LIST_FIRST(&bp->bif_dlist)) != NULL) {
1946 mtx_destroy(&bp->bif_mtx);
1951 * Get a list of available data link type of the interface.
1954 bpf_getdltlist(struct bpf_d *d, struct bpf_dltlist *bfl)
1960 ifp = d->bd_bif->bif_ifp;
1964 LIST_FOREACH(bp, &bpf_iflist, bif_next) {
1965 if (bp->bif_ifp != ifp)
1967 if (bfl->bfl_list != NULL) {
1968 if (n >= bfl->bfl_len) {
1969 mtx_unlock(&bpf_mtx);
1972 error = copyout(&bp->bif_dlt,
1973 bfl->bfl_list + n, sizeof(u_int));
1977 mtx_unlock(&bpf_mtx);
1983 * Set the data link type of a BPF instance.
1986 bpf_setdlt(struct bpf_d *d, u_int dlt)
1988 int error, opromisc;
1992 if (d->bd_bif->bif_dlt == dlt)
1994 ifp = d->bd_bif->bif_ifp;
1996 LIST_FOREACH(bp, &bpf_iflist, bif_next) {
1997 if (bp->bif_ifp == ifp && bp->bif_dlt == dlt)
2000 mtx_unlock(&bpf_mtx);
2002 opromisc = d->bd_promisc;
2009 error = ifpromisc(bp->bif_ifp, 1);
2011 if_printf(bp->bif_ifp,
2012 "bpf_setdlt: ifpromisc failed (%d)\n",
2018 return (bp == NULL ? EINVAL : 0);
2022 bpf_drvinit(void *unused)
2026 mtx_init(&bpf_mtx, "bpf global lock", NULL, MTX_DEF);
2027 LIST_INIT(&bpf_iflist);
2029 dev = make_dev(&bpf_cdevsw, 0, UID_ROOT, GID_WHEEL, 0600, "bpf");
2030 /* For compatibility */
2031 make_dev_alias(dev, "bpf0");
2036 * Zero out the various packet counters associated with all of the bpf
2037 * descriptors. At some point, we will probably want to get a bit more
2038 * granular and allow the user to specify descriptors to be zeroed.
2041 bpf_zero_counters(void)
2047 LIST_FOREACH(bp, &bpf_iflist, bif_next) {
2049 LIST_FOREACH(bd, &bp->bif_dlist, bd_next) {
2061 mtx_unlock(&bpf_mtx);
2065 bpfstats_fill_xbpf(struct xbpf_d *d, struct bpf_d *bd)
2068 bzero(d, sizeof(*d));
2069 BPFD_LOCK_ASSERT(bd);
2070 d->bd_structsize = sizeof(*d);
2071 d->bd_immediate = bd->bd_immediate;
2072 d->bd_promisc = bd->bd_promisc;
2073 d->bd_hdrcmplt = bd->bd_hdrcmplt;
2074 d->bd_direction = bd->bd_direction;
2075 d->bd_feedback = bd->bd_feedback;
2076 d->bd_async = bd->bd_async;
2077 d->bd_rcount = bd->bd_rcount;
2078 d->bd_dcount = bd->bd_dcount;
2079 d->bd_fcount = bd->bd_fcount;
2080 d->bd_sig = bd->bd_sig;
2081 d->bd_slen = bd->bd_slen;
2082 d->bd_hlen = bd->bd_hlen;
2083 d->bd_bufsize = bd->bd_bufsize;
2084 d->bd_pid = bd->bd_pid;
2085 strlcpy(d->bd_ifname,
2086 bd->bd_bif->bif_ifp->if_xname, IFNAMSIZ);
2087 d->bd_locked = bd->bd_locked;
2088 d->bd_wcount = bd->bd_wcount;
2089 d->bd_wdcount = bd->bd_wdcount;
2090 d->bd_wfcount = bd->bd_wfcount;
2091 d->bd_zcopy = bd->bd_zcopy;
2092 d->bd_bufmode = bd->bd_bufmode;
2096 bpf_stats_sysctl(SYSCTL_HANDLER_ARGS)
2098 struct xbpf_d *xbdbuf, *xbd, zerostats;
2104 * XXX This is not technically correct. It is possible for non
2105 * privileged users to open bpf devices. It would make sense
2106 * if the users who opened the devices were able to retrieve
2107 * the statistics for them, too.
2109 error = priv_check(req->td, PRIV_NET_BPF);
2113 * Check to see if the user is requesting that the counters be
2114 * zeroed out. Explicitly check that the supplied data is zeroed,
2115 * as we aren't allowing the user to set the counters currently.
2117 if (req->newptr != NULL) {
2118 if (req->newlen != sizeof(zerostats))
2120 bzero(&zerostats, sizeof(zerostats));
2122 if (bcmp(xbd, &zerostats, sizeof(*xbd)) != 0)
2124 bpf_zero_counters();
2127 if (req->oldptr == NULL)
2128 return (SYSCTL_OUT(req, 0, bpf_bpfd_cnt * sizeof(*xbd)));
2129 if (bpf_bpfd_cnt == 0)
2130 return (SYSCTL_OUT(req, 0, 0));
2131 xbdbuf = malloc(req->oldlen, M_BPF, M_WAITOK);
2133 if (req->oldlen < (bpf_bpfd_cnt * sizeof(*xbd))) {
2134 mtx_unlock(&bpf_mtx);
2135 free(xbdbuf, M_BPF);
2139 LIST_FOREACH(bp, &bpf_iflist, bif_next) {
2141 LIST_FOREACH(bd, &bp->bif_dlist, bd_next) {
2142 xbd = &xbdbuf[index++];
2144 bpfstats_fill_xbpf(xbd, bd);
2149 mtx_unlock(&bpf_mtx);
2150 error = SYSCTL_OUT(req, xbdbuf, index * sizeof(*xbd));
2151 free(xbdbuf, M_BPF);
2155 SYSINIT(bpfdev,SI_SUB_DRIVERS,SI_ORDER_MIDDLE,bpf_drvinit,NULL);
2157 #else /* !DEV_BPF && !NETGRAPH_BPF */
2159 * NOP stubs to allow bpf-using drivers to load and function.
2161 * A 'better' implementation would allow the core bpf functionality
2162 * to be loaded at runtime.
2164 static struct bpf_if bp_null;
2167 bpf_tap(struct bpf_if *bp, u_char *pkt, u_int pktlen)
2172 bpf_mtap(struct bpf_if *bp, struct mbuf *m)
2177 bpf_mtap2(struct bpf_if *bp, void *d, u_int l, struct mbuf *m)
2182 bpfattach(struct ifnet *ifp, u_int dlt, u_int hdrlen)
2185 bpfattach2(ifp, dlt, hdrlen, &ifp->if_bpf);
2189 bpfattach2(struct ifnet *ifp, u_int dlt, u_int hdrlen, struct bpf_if **driverp)
2192 *driverp = &bp_null;
2196 bpfdetach(struct ifnet *ifp)
2201 bpf_filter(const struct bpf_insn *pc, u_char *p, u_int wirelen, u_int buflen)
2203 return -1; /* "no filter" behaviour */
2207 bpf_validate(const struct bpf_insn *f, int len)
2209 return 0; /* false */
2212 #endif /* !DEV_BPF && !NETGRAPH_BPF */