2 * Berkeley Packet Filter.
5 * Copyright (c) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997
6 * The Regents of the University of California. All rights reserved.
8 * This code is derived from the Stanford/CMU enet packet filter,
9 * (net/enet.c) distributed as part of 4.3BSD, and code contributed
10 * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
11 * Berkeley Laboratory.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 * may be used to endorse or promote products derived from this software
27 * without specific prior written permission.
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 * @(#)bpf.h 8.1 (Berkeley) 6/10/93
42 * @(#) Header: bpf.h,v 1.36 97/06/12 14:29:53 leres Exp (LBL)
48 #ifndef __SYS_WTYPES_H
49 #include <sys/wtypes.h>
53 #include <sys/wtime.h>
56 /* BSD style release date */
57 #define BPF_RELEASE 199606
59 typedef long bpf_int32;
60 typedef u_int32_t bpf_u_int32;
63 * Alignment macros. BPF_WORDALIGN rounds up to the next
64 * even multiple of BPF_ALIGNMENT.
66 #define BPF_ALIGNMENT sizeof(long)
67 #define BPF_WORDALIGN(x) (((x)+(BPF_ALIGNMENT-1)) & ~(BPF_ALIGNMENT-1))
69 #define BPF_MAXINSNS 512
70 #define BPF_MAXBUFSIZE 0x8000
71 #define BPF_MINBUFSIZE 32
74 * Structure for BIOCSETF.
78 struct bpf_insn *bf_insns;
82 * Struct returned by BIOCGSTATS.
85 u_int bs_recv; /* number of packets received */
86 u_int bs_drop; /* number of packets dropped */
90 * Struct return by BIOCVERSION. This represents the version number of
91 * the filter language described by the instruction encodings below.
92 * bpf understands a program iff kernel_major == filter_major &&
93 * kernel_minor >= filter_minor, that is, if the value returned by the
94 * running kernel has the same major number and a minor number equal
95 * equal to or less than the filter being downloaded. Otherwise, the
96 * results are undefined, meaning an error may be returned or packets
97 * may be accepted haphazardly.
98 * It has nothing to do with the source code version.
105 /* Current version number of filter architecture. */
106 #define BPF_MAJOR_VERSION 1
107 #define BPF_MINOR_VERSION 1
112 * The first set is for compatibility with Sun's pcc style
113 * header files. If your using gcc, we assume that you
114 * have run fixincludes so the latter set should work.
116 #if (defined(sun) || defined(ibm032)) && !defined(__GNUC__)
117 # define BIOCGBLEN _IOR(B,102, u_int)
118 # define BIOCSBLEN _IOWR(B,102, u_int)
119 # define BIOCSETF _IOW(B,103, struct bpf_program)
120 # define BIOCFLUSH _IO(B,104)
121 # define BIOCPROMISC _IO(B,105)
122 # define BIOCGDLT _IOR(B,106, u_int)
123 # define BIOCGETIF _IOR(B,107, struct ifreq)
124 # define BIOCSETIF _IOW(B,108, struct ifreq)
125 # define BIOCSRTIMEOUT _IOW(B,109, struct timeval)
126 # define BIOCGRTIMEOUT _IOR(B,110, struct timeval)
127 # define BIOCGSTATS _IOR(B,111, struct bpf_stat)
128 # define BIOCIMMEDIATE _IOW(B,112, u_int)
129 # define BIOCVERSION _IOR(B,113, struct bpf_version)
130 # define BIOCSTCPF _IOW(B,114, struct bpf_program)
131 # define BIOCSUDPF _IOW(B,115, struct bpf_program)
133 # define BIOCGBLEN _IOR('B',102, u_int)
134 # define BIOCSBLEN _IOWR('B',102, u_int)
135 # define BIOCSETF _IOW('B',103, struct bpf_program)
136 # define BIOCFLUSH _IO('B',104)
137 # define BIOCPROMISC _IO('B',105)
138 # define BIOCGDLT _IOR('B',106, u_int)
139 # define BIOCGETIF _IOR('B',107, struct ifreq)
140 # define BIOCSETIF _IOW('B',108, struct ifreq)
141 # define BIOCSRTIMEOUT _IOW('B',109, struct timeval)
142 # define BIOCGRTIMEOUT _IOR('B',110, struct timeval)
143 # define BIOCGSTATS _IOR('B',111, struct bpf_stat)
144 # define BIOCIMMEDIATE _IOW('B',112, u_int)
145 # define BIOCVERSION _IOR('B',113, struct bpf_version)
146 # define BIOCSTCPF _IOW('B',114, struct bpf_program)
147 # define BIOCSUDPF _IOW('B',115, struct bpf_program)
151 * Structure prepended to each packet.
154 struct timeval bh_tstamp; /* time stamp */
155 u_int32_t bh_caplen; /* length of captured portion */
156 u_int32_t bh_datalen; /* original length of packet */
157 u_int16_t bh_hdrlen; /* length of bpf header (this struct */
158 }; /* plus alignment padding) */
161 * Because the structure above is not a multiple of 4 bytes, some compilers
162 * will insist on inserting padding; hence, sizeof(struct bpf_hdr) won't work.
163 * Only the kernel needs to know about it; applications use bh_hdrlen.
164 * XXX To save a few bytes on 32-bit machines, we avoid end-of-struct
165 * XXX padding by using the size of the header data elements. This is
166 * XXX fail-safe: on new machines, we just use the 'safe' sizeof.
168 #define SIZEOF_BPF_HDR sizeof(struct bpf_hdr)
171 * Data-link level type codes.
173 #define DLT_NULL 0 /* no link-layer encapsulation */
174 #define DLT_EN10MB 1 /* Ethernet (10Mb) */
175 #define DLT_EN3MB 2 /* Experimental Ethernet (3Mb) */
176 #define DLT_AX25 3 /* Amateur Radio AX.25 */
177 #define DLT_PRONET 4 /* Proteon ProNET Token Ring */
178 #define DLT_CHAOS 5 /* Chaos */
179 #define DLT_IEEE802 6 /* IEEE 802 Networks */
180 #define DLT_ARCNET 7 /* ARCNET */
181 #define DLT_SLIP 8 /* Serial Line IP */
182 #define DLT_PPP 9 /* Point-to-point Protocol */
183 #define DLT_FDDI 10 /* FDDI */
184 #define DLT_ATM_RFC1483 11 /* LLC/SNAP encapsulated atm */
185 #define DLT_RAW 12 /* raw IP */
186 #define DLT_SLIP_BSDOS 13 /* BSD/OS Serial Line IP */
187 #define DLT_PPP_BSDOS 14 /* BSD/OS Point-to-point Protocol */
188 #define DLT_LANE8023 15 /* LANE 802.3(Ethernet) */
189 #define DLT_CIP 16 /* ATM Classical IP */
193 * The instruction encondings.
195 /* instruction classes */
196 #define BPF_CLASS(code) ((code) & 0x07)
204 #define BPF_MISC 0x07
207 #define BPF_SIZE(code) ((code) & 0x18)
211 #define BPF_MODE(code) ((code) & 0xe0)
220 #define BPF_OP(code) ((code) & 0xf0)
234 #define BPF_JSET 0x40
235 #define BPF_SRC(code) ((code) & 0x08)
239 /* ret - BPF_K and BPF_X also apply */
240 #define BPF_RVAL(code) ((code) & 0x18)
244 #define BPF_MISCOP(code) ((code) & 0xf8)
249 * The instruction data structure.
259 * Macros for insn array initializers.
261 #define BPF_STMT(code, k) { (u_int16_t)(code), 0, 0, k }
262 #define BPF_JUMP(code, k, jt, jf) { (u_int16_t)(code), jt, jf, k }
264 u_int bpf_filter (struct bpf_insn *, u_char *, u_int, u_int);
267 * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST).
269 #define BPF_MEMWORDS 16