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.h 8.1 (Berkeley) 6/10/93
39 * @(#)bpf.h 1.34 (LBL) 6/16/96
41 * $FreeBSD: src/sys/net/bpf.h,v 1.21.2.4 2002/07/05 14:40:00 fenner Exp $
42 * $DragonFly: src/sys/net/bpf.h,v 1.12 2008/03/14 09:52:10 matthias Exp $
49 #include <sys/types.h>
57 /* BSD style release date */
58 #define BPF_RELEASE 199606
60 typedef int32_t bpf_int32
;
61 typedef u_int32_t bpf_u_int32
;
64 * Alignment macros. BPF_WORDALIGN rounds up to the next
65 * even multiple of BPF_ALIGNMENT.
67 #define BPF_ALIGNMENT sizeof(long)
68 #define BPF_WORDALIGN(x) (((x)+(BPF_ALIGNMENT-1))&~(BPF_ALIGNMENT-1))
70 #define BPF_MAXINSNS 512
71 #define BPF_MAXBUFSIZE 0x80000
72 #define BPF_DEFAULTBUFSIZE 4096
73 #define BPF_MINBUFSIZE 32
76 * Structure for BIOCSETF.
80 struct bpf_insn
*bf_insns
;
84 * Struct returned by BIOCGSTATS.
87 u_int bs_recv
; /* number of packets received */
88 u_int bs_drop
; /* number of packets dropped */
92 * Struct return by BIOCVERSION. This represents the version number of
93 * the filter language described by the instruction encodings below.
94 * bpf understands a program iff kernel_major == filter_major &&
95 * kernel_minor >= filter_minor, that is, if the value returned by the
96 * running kernel has the same major number and a minor number equal
97 * equal to or less than the filter being downloaded. Otherwise, the
98 * results are undefined, meaning an error may be returned or packets
99 * may be accepted haphazardly.
100 * It has nothing to do with the source code version.
106 /* Current version number of filter architecture. */
107 #define BPF_MAJOR_VERSION 1
108 #define BPF_MINOR_VERSION 1
110 #define BIOCGBLEN _IOR('B',102, u_int)
111 #define BIOCSBLEN _IOWR('B',102, u_int)
112 #define BIOCSETF _IOW('B',103, struct bpf_program)
113 #define BIOCFLUSH _IO('B',104)
114 #define BIOCPROMISC _IO('B',105)
115 #define BIOCGDLT _IOR('B',106, u_int)
116 #define BIOCGETIF _IOR('B',107, struct ifreq)
117 #define BIOCSETIF _IOW('B',108, struct ifreq)
118 #define BIOCSRTIMEOUT _IOW('B',109, struct timeval)
119 #define BIOCGRTIMEOUT _IOR('B',110, struct timeval)
120 #define BIOCGSTATS _IOR('B',111, struct bpf_stat)
121 #define BIOCIMMEDIATE _IOW('B',112, u_int)
122 #define BIOCVERSION _IOR('B',113, struct bpf_version)
123 #define BIOCGRSIG _IOR('B',114, u_int)
124 #define BIOCSRSIG _IOW('B',115, u_int)
125 #define BIOCGHDRCMPLT _IOR('B',116, u_int)
126 #define BIOCSHDRCMPLT _IOW('B',117, u_int)
127 #define BIOCGSEESENT _IOR('B',118, u_int)
128 #define BIOCSSEESENT _IOW('B',119, u_int)
129 #define BIOCSDLT _IOW('B',120, u_int)
130 #define BIOCGDLTLIST _IOWR('B',121, struct bpf_dltlist)
131 #define BIOCLOCK _IO('B', 122)
132 #define BIOCSETWF _IOW('B',123, struct bpf_program)
135 * Structure prepended to each packet.
138 struct timeval bh_tstamp
; /* time stamp */
139 bpf_u_int32 bh_caplen
; /* length of captured portion */
140 bpf_u_int32 bh_datalen
; /* original length of packet */
141 u_short bh_hdrlen
; /* length of bpf header (this struct
142 plus alignment padding) */
145 * Because the structure above is not a multiple of 4 bytes, some compilers
146 * will insist on inserting padding; hence, sizeof(struct bpf_hdr) won't work.
147 * Only the kernel needs to know about it; applications use bh_hdrlen.
150 #define SIZEOF_BPF_HDR (sizeof(struct bpf_hdr) <= 20 ? 18 : \
151 sizeof(struct bpf_hdr))
159 * The instruction encodings.
161 /* instruction classes */
162 #define BPF_CLASS(code) ((code) & 0x07)
170 #define BPF_MISC 0x07
173 #define BPF_SIZE(code) ((code) & 0x18)
177 #define BPF_MODE(code) ((code) & 0xe0)
186 #define BPF_OP(code) ((code) & 0xf0)
200 #define BPF_JSET 0x40
201 #define BPF_SRC(code) ((code) & 0x08)
205 /* ret - BPF_K and BPF_X also apply */
206 #define BPF_RVAL(code) ((code) & 0x18)
210 #define BPF_MISCOP(code) ((code) & 0xf8)
215 * The instruction data structure.
225 * Macros for insn array initializers.
227 #define BPF_STMT(code, k) { (u_short)(code), 0, 0, k }
228 #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k }
231 * Structure to retrieve available DLTs for the interface.
234 u_int bfl_len
; /* number of bfd_list array */
235 u_int
*bfl_list
; /* array of DLTs */
243 int bpf_validate(const struct bpf_insn
*, int);
244 void bpf_tap(struct bpf_if
*, u_char
*, u_int
);
245 void bpf_mtap(struct bpf_if
*, struct mbuf
*);
246 void bpf_mtap_family(struct bpf_if
*, struct mbuf
*m
, __uint8_t family
);
247 void bpf_ptap(struct bpf_if
*, struct mbuf
*, const void *, u_int
);
248 void bpfattach(struct ifnet
*, u_int
, u_int
);
249 void bpfattach_dlt(struct ifnet
*, u_int
, u_int
, struct bpf_if
**);
250 void bpfdetach(struct ifnet
*);
252 void bpfilterattach(int);
253 u_int
bpf_filter(const struct bpf_insn
*, u_char
*, u_int
, u_int
);
255 #define BPF_TAP(_ifp,_pkt,_pktlen) do { \
256 if ((_ifp)->if_bpf) \
257 bpf_tap((_ifp)->if_bpf, (_pkt), (_pktlen)); \
259 #define BPF_MTAP(_ifp,_m) do { \
260 if ((_ifp)->if_bpf) \
261 bpf_mtap((_ifp)->if_bpf, (_m)); \
266 * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST).
268 #define BPF_MEMWORDS 16
272 #endif /* !_NET_BPF_H_ */