]> The Tcpdump Group git mirrors - libpcap/blob - bpf/net/bpf.h
IPv6 packet filtering code.
[libpcap] / bpf / net / bpf.h
1 /*-
2 * Copyright (c) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997
3 * The Regents of the University of California. All rights reserved.
4 *
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
8 * Berkeley Laboratory.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
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.
25 *
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
36 * SUCH DAMAGE.
37 *
38 * @(#)bpf.h 7.1 (Berkeley) 5/7/91
39 *
40 * @(#) $Header: /tcpdump/master/libpcap/bpf/net/Attic/bpf.h,v 1.37 1999-10-19 15:18:31 itojun Exp $ (LBL)
41 */
42
43 #ifndef BPF_MAJOR_VERSION
44
45 /* BSD style release date */
46 #define BPF_RELEASE 199606
47
48 typedef int bpf_int32;
49 typedef u_int bpf_u_int32;
50
51 /*
52 * Alignment macros. BPF_WORDALIGN rounds up to the next
53 * even multiple of BPF_ALIGNMENT.
54 */
55 #ifndef __NetBSD__
56 #define BPF_ALIGNMENT sizeof(bpf_int32)
57 #else
58 #define BPF_ALIGNMENT sizeof(long)
59 #endif
60 #define BPF_WORDALIGN(x) (((x)+(BPF_ALIGNMENT-1))&~(BPF_ALIGNMENT-1))
61
62 #define BPF_MAXINSNS 512
63 #define BPF_MAXBUFSIZE 0x8000
64 #define BPF_MINBUFSIZE 32
65
66 /*
67 * Structure for BIOCSETF.
68 */
69 struct bpf_program {
70 u_int bf_len;
71 struct bpf_insn *bf_insns;
72 };
73
74 /*
75 * Struct returned by BIOCGSTATS.
76 */
77 struct bpf_stat {
78 u_int bs_recv; /* number of packets received */
79 u_int bs_drop; /* number of packets dropped */
80 };
81
82 /*
83 * Struct return by BIOCVERSION. This represents the version number of
84 * the filter language described by the instruction encodings below.
85 * bpf understands a program iff kernel_major == filter_major &&
86 * kernel_minor >= filter_minor, that is, if the value returned by the
87 * running kernel has the same major number and a minor number equal
88 * equal to or less than the filter being downloaded. Otherwise, the
89 * results are undefined, meaning an error may be returned or packets
90 * may be accepted haphazardly.
91 * It has nothing to do with the source code version.
92 */
93 struct bpf_version {
94 u_short bv_major;
95 u_short bv_minor;
96 };
97 /* Current version number of filter architecture. */
98 #define BPF_MAJOR_VERSION 1
99 #define BPF_MINOR_VERSION 1
100
101 /*
102 * BPF ioctls
103 *
104 * The first set is for compatibility with Sun's pcc style
105 * header files. If your using gcc, we assume that you
106 * have run fixincludes so the latter set should work.
107 */
108 #if (defined(sun) || defined(ibm032)) && !defined(__GNUC__)
109 #define BIOCGBLEN _IOR(B,102, u_int)
110 #define BIOCSBLEN _IOWR(B,102, u_int)
111 #define BIOCSETF _IOW(B,103, struct bpf_program)
112 #define BIOCFLUSH _IO(B,104)
113 #define BIOCPROMISC _IO(B,105)
114 #define BIOCGDLT _IOR(B,106, u_int)
115 #define BIOCGETIF _IOR(B,107, struct ifreq)
116 #define BIOCSETIF _IOW(B,108, struct ifreq)
117 #define BIOCSRTIMEOUT _IOW(B,109, struct timeval)
118 #define BIOCGRTIMEOUT _IOR(B,110, struct timeval)
119 #define BIOCGSTATS _IOR(B,111, struct bpf_stat)
120 #define BIOCIMMEDIATE _IOW(B,112, u_int)
121 #define BIOCVERSION _IOR(B,113, struct bpf_version)
122 #define BIOCSTCPF _IOW(B,114, struct bpf_program)
123 #define BIOCSUDPF _IOW(B,115, struct bpf_program)
124 #else
125 #define BIOCGBLEN _IOR('B',102, u_int)
126 #define BIOCSBLEN _IOWR('B',102, u_int)
127 #define BIOCSETF _IOW('B',103, struct bpf_program)
128 #define BIOCFLUSH _IO('B',104)
129 #define BIOCPROMISC _IO('B',105)
130 #define BIOCGDLT _IOR('B',106, u_int)
131 #define BIOCGETIF _IOR('B',107, struct ifreq)
132 #define BIOCSETIF _IOW('B',108, struct ifreq)
133 #define BIOCSRTIMEOUT _IOW('B',109, struct timeval)
134 #define BIOCGRTIMEOUT _IOR('B',110, struct timeval)
135 #define BIOCGSTATS _IOR('B',111, struct bpf_stat)
136 #define BIOCIMMEDIATE _IOW('B',112, u_int)
137 #define BIOCVERSION _IOR('B',113, struct bpf_version)
138 #define BIOCSTCPF _IOW('B',114, struct bpf_program)
139 #define BIOCSUDPF _IOW('B',115, struct bpf_program)
140 #endif
141
142 /*
143 * Structure prepended to each packet.
144 */
145 struct bpf_hdr {
146 struct timeval bh_tstamp; /* time stamp */
147 bpf_u_int32 bh_caplen; /* length of captured portion */
148 bpf_u_int32 bh_datalen; /* original length of packet */
149 u_short bh_hdrlen; /* length of bpf header (this struct
150 plus alignment padding) */
151 };
152 /*
153 * Because the structure above is not a multiple of 4 bytes, some compilers
154 * will insist on inserting padding; hence, sizeof(struct bpf_hdr) won't work.
155 * Only the kernel needs to know about it; applications use bh_hdrlen.
156 */
157 #ifdef KERNEL
158 #define SIZEOF_BPF_HDR 18
159 #endif
160
161 /*
162 * Data-link level type codes.
163 */
164 #define DLT_NULL 0 /* no link-layer encapsulation */
165 #define DLT_EN10MB 1 /* Ethernet (10Mb) */
166 #define DLT_EN3MB 2 /* Experimental Ethernet (3Mb) */
167 #define DLT_AX25 3 /* Amateur Radio AX.25 */
168 #define DLT_PRONET 4 /* Proteon ProNET Token Ring */
169 #define DLT_CHAOS 5 /* Chaos */
170 #define DLT_IEEE802 6 /* IEEE 802 Networks */
171 #define DLT_ARCNET 7 /* ARCNET */
172 #define DLT_SLIP 8 /* Serial Line IP */
173 #define DLT_PPP 9 /* Point-to-point Protocol */
174 #define DLT_FDDI 10 /* FDDI */
175 #ifdef __FreeBSD__
176 #define DLT_ATM_RFC1483 11 /* LLC/SNAP encapsulated atm */
177 #endif
178 #ifdef __OpenBSD__
179 #define DLT_ATM_RFC1483 11 /* LLC/SNAP encapsulated atm */
180 #define DLT_LOOP 12 /* loopback */
181 #endif
182 /* offset to avoid collision with BSD/OS values */
183 #ifndef DLT_ATM_RFC1483
184 #define DLT_ATM_RFC1483 100 /* LLC/SNAP encapsulated atm */
185 #endif
186 #define DLT_RAW 101 /* raw IP */
187 #define DLT_SLIP_BSDOS 102 /* BSD/OS Serial Line IP */
188 #define DLT_PPP_BSDOS 103 /* BSD/OS Point-to-point Protocol */
189 #define DLT_CHDLC 104 /* Cisco HDLC */
190
191 /*
192 * The instruction encondings.
193 */
194 /* instruction classes */
195 #define BPF_CLASS(code) ((code) & 0x07)
196 #define BPF_LD 0x00
197 #define BPF_LDX 0x01
198 #define BPF_ST 0x02
199 #define BPF_STX 0x03
200 #define BPF_ALU 0x04
201 #define BPF_JMP 0x05
202 #define BPF_RET 0x06
203 #define BPF_MISC 0x07
204
205 /* ld/ldx fields */
206 #define BPF_SIZE(code) ((code) & 0x18)
207 #define BPF_W 0x00
208 #define BPF_H 0x08
209 #define BPF_B 0x10
210 #define BPF_MODE(code) ((code) & 0xe0)
211 #define BPF_IMM 0x00
212 #define BPF_ABS 0x20
213 #define BPF_IND 0x40
214 #define BPF_MEM 0x60
215 #define BPF_LEN 0x80
216 #define BPF_MSH 0xa0
217
218 /* alu/jmp fields */
219 #define BPF_OP(code) ((code) & 0xf0)
220 #define BPF_ADD 0x00
221 #define BPF_SUB 0x10
222 #define BPF_MUL 0x20
223 #define BPF_DIV 0x30
224 #define BPF_OR 0x40
225 #define BPF_AND 0x50
226 #define BPF_LSH 0x60
227 #define BPF_RSH 0x70
228 #define BPF_NEG 0x80
229 #define BPF_JA 0x00
230 #define BPF_JEQ 0x10
231 #define BPF_JGT 0x20
232 #define BPF_JGE 0x30
233 #define BPF_JSET 0x40
234 #define BPF_SRC(code) ((code) & 0x08)
235 #define BPF_K 0x00
236 #define BPF_X 0x08
237
238 /* ret - BPF_K and BPF_X also apply */
239 #define BPF_RVAL(code) ((code) & 0x18)
240 #define BPF_A 0x10
241
242 /* misc */
243 #define BPF_MISCOP(code) ((code) & 0xf8)
244 #define BPF_TAX 0x00
245 #define BPF_TXA 0x80
246
247 /*
248 * The instruction data structure.
249 */
250 struct bpf_insn {
251 u_short code;
252 u_char jt;
253 u_char jf;
254 bpf_int32 k;
255 };
256
257 /*
258 * Macros for insn array initializers.
259 */
260 #define BPF_STMT(code, k) { (u_short)(code), 0, 0, k }
261 #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k }
262
263 #ifdef KERNEL
264 extern u_int bpf_filter();
265 extern void bpfattach();
266 extern void bpf_tap();
267 extern void bpf_mtap();
268 #else
269 #if __STDC__
270 extern u_int bpf_filter(struct bpf_insn *, u_char *, u_int, u_int);
271 #endif
272 #endif
273
274 /*
275 * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST).
276 */
277 #define BPF_MEMWORDS 16
278
279 #endif