Watt-32 tcp/ip  2.2 dev-rel.10
bpf.h
Go to the documentation of this file.
1 
4 /*
5  * Copyright (c) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997
6  * The Regents of the University of California. All rights reserved.
7  *
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.
12  *
13  * Redistribution and use in source and binary forms, with or without
14  * modification, are permitted provided that the following conditions
15  * are met:
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.
28  *
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
39  * SUCH DAMAGE.
40  *
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)
43  */
44 
45 #ifndef __NET_BPF_H
46 #define __NET_BPF_H
47 
48 #ifndef __SYS_WTYPES_H
49 #include <sys/wtypes.h>
50 #endif
51 
52 #ifndef __SYS_WTIME_H
53 #include <sys/wtime.h>
54 #endif
55 
56 /* BSD style release date */
57 #define BPF_RELEASE 199606
58 
59 typedef long bpf_int32;
60 typedef u_int32_t bpf_u_int32;
61 
62 /*
63  * Alignment macros. BPF_WORDALIGN rounds up to the next
64  * even multiple of BPF_ALIGNMENT.
65  */
66 #define BPF_ALIGNMENT sizeof(long)
67 #define BPF_WORDALIGN(x) (((x)+(BPF_ALIGNMENT-1)) & ~(BPF_ALIGNMENT-1))
68 
69 #define BPF_MAXINSNS 512
70 #define BPF_MAXBUFSIZE 0x8000
71 #define BPF_MINBUFSIZE 32
72 
73 /*
74  * Structure for BIOCSETF.
75  */
76 struct bpf_program {
77  u_int bf_len;
78  struct bpf_insn *bf_insns;
79  };
80 
81 /*
82  * Struct returned by BIOCGSTATS.
83  */
84 struct bpf_stat {
85  u_int bs_recv; /* number of packets received */
86  u_int bs_drop; /* number of packets dropped */
87  };
88 
89 /*
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.
99  */
100 struct bpf_version {
101  u_short bv_major;
102  u_short bv_minor;
103  };
104 
105 /* Current version number of filter architecture. */
106 #define BPF_MAJOR_VERSION 1
107 #define BPF_MINOR_VERSION 1
108 
109 /*
110  * BPF ioctls
111  *
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.
115  */
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)
132 #else
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)
148 #endif
149 
150 /*
151  * Structure prepended to each packet.
152  */
153 struct bpf_hdr {
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) */
159 
160 /*
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.
167  */
168 #define SIZEOF_BPF_HDR sizeof(struct bpf_hdr)
169 
170 /*
171  * Data-link level type codes.
172  */
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 */
190 
191 
192 /*
193  * The instruction encondings.
194  */
195 /* instruction classes */
196 #define BPF_CLASS(code) ((code) & 0x07)
197 #define BPF_LD 0x00
198 #define BPF_LDX 0x01
199 #define BPF_ST 0x02
200 #define BPF_STX 0x03
201 #define BPF_ALU 0x04
202 #define BPF_JMP 0x05
203 #define BPF_RET 0x06
204 #define BPF_MISC 0x07
205 
206 /* ld/ldx fields */
207 #define BPF_SIZE(code) ((code) & 0x18)
208 #define BPF_W 0x00
209 #define BPF_H 0x08
210 #define BPF_B 0x10
211 #define BPF_MODE(code) ((code) & 0xe0)
212 #define BPF_IMM 0x00
213 #define BPF_ABS 0x20
214 #define BPF_IND 0x40
215 #define BPF_MEM 0x60
216 #define BPF_LEN 0x80
217 #define BPF_MSH 0xa0
218 
219 /* alu/jmp fields */
220 #define BPF_OP(code) ((code) & 0xf0)
221 #define BPF_ADD 0x00
222 #define BPF_SUB 0x10
223 #define BPF_MUL 0x20
224 #define BPF_DIV 0x30
225 #define BPF_OR 0x40
226 #define BPF_AND 0x50
227 #define BPF_LSH 0x60
228 #define BPF_RSH 0x70
229 #define BPF_NEG 0x80
230 #define BPF_JA 0x00
231 #define BPF_JEQ 0x10
232 #define BPF_JGT 0x20
233 #define BPF_JGE 0x30
234 #define BPF_JSET 0x40
235 #define BPF_SRC(code) ((code) & 0x08)
236 #define BPF_K 0x00
237 #define BPF_X 0x08
238 
239 /* ret - BPF_K and BPF_X also apply */
240 #define BPF_RVAL(code) ((code) & 0x18)
241 #define BPF_A 0x10
242 
243 /* misc */
244 #define BPF_MISCOP(code) ((code) & 0xf8)
245 #define BPF_TAX 0x00
246 #define BPF_TXA 0x80
247 
248 /*
249  * The instruction data structure.
250  */
251 struct bpf_insn {
252  u_int16_t code;
253  u_char jt;
254  u_char jf;
255  int32_t k;
256  };
257 
258 /*
259  * Macros for insn array initializers.
260  */
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 }
263 
264 u_int bpf_filter (struct bpf_insn *, u_char *, u_int, u_int);
265 
266 /*
267  * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST).
268  */
269 #define BPF_MEMWORDS 16
270 
271 #endif
Definition: bpf.h:251
Definition: wtime.h:38
Definition: zinftree.h:24
Berkeley Packet Filter header.
Definition: packet32.h:232