1 |
1254 |
phoenix |
//==========================================================================
|
2 |
|
|
//
|
3 |
|
|
// include/net/bpf.h
|
4 |
|
|
//
|
5 |
|
|
//
|
6 |
|
|
//
|
7 |
|
|
//==========================================================================
|
8 |
|
|
//####BSDCOPYRIGHTBEGIN####
|
9 |
|
|
//
|
10 |
|
|
// -------------------------------------------
|
11 |
|
|
//
|
12 |
|
|
// Portions of this software may have been derived from OpenBSD or other sources,
|
13 |
|
|
// and are covered by the appropriate copyright disclaimers included herein.
|
14 |
|
|
//
|
15 |
|
|
// -------------------------------------------
|
16 |
|
|
//
|
17 |
|
|
//####BSDCOPYRIGHTEND####
|
18 |
|
|
//==========================================================================
|
19 |
|
|
//#####DESCRIPTIONBEGIN####
|
20 |
|
|
//
|
21 |
|
|
// Author(s): gthomas
|
22 |
|
|
// Contributors: gthomas
|
23 |
|
|
// Date: 2000-01-10
|
24 |
|
|
// Purpose:
|
25 |
|
|
// Description:
|
26 |
|
|
//
|
27 |
|
|
//
|
28 |
|
|
//####DESCRIPTIONEND####
|
29 |
|
|
//
|
30 |
|
|
//==========================================================================
|
31 |
|
|
|
32 |
|
|
|
33 |
|
|
/* $OpenBSD: bpf.h,v 1.12 1999/08/08 00:43:00 niklas Exp $ */
|
34 |
|
|
/* $NetBSD: bpf.h,v 1.15 1996/12/13 07:57:33 mikel Exp $ */
|
35 |
|
|
|
36 |
|
|
/*
|
37 |
|
|
* Copyright (c) 1990, 1991, 1993
|
38 |
|
|
* The Regents of the University of California. All rights reserved.
|
39 |
|
|
*
|
40 |
|
|
* This code is derived from the Stanford/CMU enet packet filter,
|
41 |
|
|
* (net/enet.c) distributed as part of 4.3BSD, and code contributed
|
42 |
|
|
* to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
|
43 |
|
|
* Berkeley Laboratory.
|
44 |
|
|
*
|
45 |
|
|
* Redistribution and use in source and binary forms, with or without
|
46 |
|
|
* modification, are permitted provided that the following conditions
|
47 |
|
|
* are met:
|
48 |
|
|
* 1. Redistributions of source code must retain the above copyright
|
49 |
|
|
* notice, this list of conditions and the following disclaimer.
|
50 |
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
51 |
|
|
* notice, this list of conditions and the following disclaimer in the
|
52 |
|
|
* documentation and/or other materials provided with the distribution.
|
53 |
|
|
* 3. All advertising materials mentioning features or use of this software
|
54 |
|
|
* must display the following acknowledgement:
|
55 |
|
|
* This product includes software developed by the University of
|
56 |
|
|
* California, Berkeley and its contributors.
|
57 |
|
|
* 4. Neither the name of the University nor the names of its contributors
|
58 |
|
|
* may be used to endorse or promote products derived from this software
|
59 |
|
|
* without specific prior written permission.
|
60 |
|
|
*
|
61 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
62 |
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
63 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
64 |
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
65 |
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
66 |
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
67 |
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
68 |
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
69 |
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
70 |
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
71 |
|
|
* SUCH DAMAGE.
|
72 |
|
|
*
|
73 |
|
|
* @(#)bpf.h 8.1 (Berkeley) 6/10/93
|
74 |
|
|
*/
|
75 |
|
|
|
76 |
|
|
#ifndef _NET_BPF_H_
|
77 |
|
|
#define _NET_BPF_H_
|
78 |
|
|
|
79 |
|
|
/* BSD style release date */
|
80 |
|
|
#define BPF_RELEASE 199606
|
81 |
|
|
|
82 |
|
|
typedef int32_t bpf_int32;
|
83 |
|
|
typedef u_int32_t bpf_u_int32;
|
84 |
|
|
/*
|
85 |
|
|
* Alignment macros. BPF_WORDALIGN rounds up to the next even multiple of
|
86 |
|
|
* BPF_ALIGNMENT (which is at least as much as what a timeval needs).
|
87 |
|
|
*/
|
88 |
|
|
#define BPF_ALIGNMENT sizeof(long)
|
89 |
|
|
#define BPF_WORDALIGN(x) (((x) + (BPF_ALIGNMENT - 1)) & ~(BPF_ALIGNMENT - 1))
|
90 |
|
|
|
91 |
|
|
#define BPF_MAXINSNS 512
|
92 |
|
|
#define BPF_MAXBUFSIZE 0x80000
|
93 |
|
|
#define BPF_MINBUFSIZE 32
|
94 |
|
|
|
95 |
|
|
/*
|
96 |
|
|
* Structure for BIOCSETF.
|
97 |
|
|
*/
|
98 |
|
|
struct bpf_program {
|
99 |
|
|
u_int bf_len;
|
100 |
|
|
struct bpf_insn *bf_insns;
|
101 |
|
|
};
|
102 |
|
|
|
103 |
|
|
/*
|
104 |
|
|
* Struct returned by BIOCGSTATS.
|
105 |
|
|
*/
|
106 |
|
|
struct bpf_stat {
|
107 |
|
|
u_int bs_recv; /* number of packets received */
|
108 |
|
|
u_int bs_drop; /* number of packets dropped */
|
109 |
|
|
};
|
110 |
|
|
|
111 |
|
|
/*
|
112 |
|
|
* Struct return by BIOCVERSION. This represents the version number of
|
113 |
|
|
* the filter language described by the instruction encodings below.
|
114 |
|
|
* bpf understands a program iff kernel_major == filter_major &&
|
115 |
|
|
* kernel_minor >= filter_minor, that is, if the value returned by the
|
116 |
|
|
* running kernel has the same major number and a minor number equal
|
117 |
|
|
* equal to or less than the filter being downloaded. Otherwise, the
|
118 |
|
|
* results are undefined, meaning an error may be returned or packets
|
119 |
|
|
* may be accepted haphazardly.
|
120 |
|
|
* It has nothing to do with the source code version.
|
121 |
|
|
*/
|
122 |
|
|
struct bpf_version {
|
123 |
|
|
u_short bv_major;
|
124 |
|
|
u_short bv_minor;
|
125 |
|
|
};
|
126 |
|
|
/* Current version number of filter architecture. */
|
127 |
|
|
#define BPF_MAJOR_VERSION 1
|
128 |
|
|
#define BPF_MINOR_VERSION 1
|
129 |
|
|
|
130 |
|
|
/*
|
131 |
|
|
* BPF ioctls
|
132 |
|
|
*
|
133 |
|
|
* The first set is for compatibility with Sun's pcc style
|
134 |
|
|
* header files. If you're using gcc, we assume that you
|
135 |
|
|
* have run fixincludes so the latter set should work.
|
136 |
|
|
*/
|
137 |
|
|
#if (defined(sun) || defined(ibm032)) && !defined(__GNUC__)
|
138 |
|
|
#define BIOCGBLEN _IOR(B,102, u_int)
|
139 |
|
|
#define BIOCSBLEN _IOWR(B,102, u_int)
|
140 |
|
|
#define BIOCSETF _IOW(B,103, struct bpf_program)
|
141 |
|
|
#define BIOCFLUSH _IO(B,104)
|
142 |
|
|
#define BIOCPROMISC _IO(B,105)
|
143 |
|
|
#define BIOCGDLT _IOR(B,106, u_int)
|
144 |
|
|
#define BIOCGETIF _IOR(B,107, struct ifreq)
|
145 |
|
|
#define BIOCSETIF _IOW(B,108, struct ifreq)
|
146 |
|
|
#define BIOCSRTIMEOUT _IOW(B,109, struct timeval)
|
147 |
|
|
#define BIOCGRTIMEOUT _IOR(B,110, struct timeval)
|
148 |
|
|
#define BIOCGSTATS _IOR(B,111, struct bpf_stat)
|
149 |
|
|
#define BIOCIMMEDIATE _IOW(B,112, u_int)
|
150 |
|
|
#define BIOCVERSION _IOR(B,113, struct bpf_version)
|
151 |
|
|
#define BIOCSRSIG _IOW(B,114, u_int)
|
152 |
|
|
#define BIOCGRSIG _IOR(B,115, u_int)
|
153 |
|
|
#else
|
154 |
|
|
#define BIOCGBLEN _IOR('B',102, u_int)
|
155 |
|
|
#define BIOCSBLEN _IOWR('B',102, u_int)
|
156 |
|
|
#define BIOCSETF _IOW('B',103, struct bpf_program)
|
157 |
|
|
#define BIOCFLUSH _IO('B',104)
|
158 |
|
|
#define BIOCPROMISC _IO('B',105)
|
159 |
|
|
#define BIOCGDLT _IOR('B',106, u_int)
|
160 |
|
|
#define BIOCGETIF _IOR('B',107, struct ifreq)
|
161 |
|
|
#define BIOCSETIF _IOW('B',108, struct ifreq)
|
162 |
|
|
#define BIOCSRTIMEOUT _IOW('B',109, struct timeval)
|
163 |
|
|
#define BIOCGRTIMEOUT _IOR('B',110, struct timeval)
|
164 |
|
|
#define BIOCGSTATS _IOR('B',111, struct bpf_stat)
|
165 |
|
|
#define BIOCIMMEDIATE _IOW('B',112, u_int)
|
166 |
|
|
#define BIOCVERSION _IOR('B',113, struct bpf_version)
|
167 |
|
|
#define BIOCSRSIG _IOW('B',114, u_int)
|
168 |
|
|
#define BIOCGRSIG _IOR('B',115, u_int)
|
169 |
|
|
#endif
|
170 |
|
|
|
171 |
|
|
/*
|
172 |
|
|
* Structure prepended to each packet.
|
173 |
|
|
*/
|
174 |
|
|
struct bpf_hdr {
|
175 |
|
|
struct timeval bh_tstamp; /* time stamp */
|
176 |
|
|
u_int32_t bh_caplen; /* length of captured portion */
|
177 |
|
|
u_int32_t bh_datalen; /* original length of packet */
|
178 |
|
|
u_int16_t bh_hdrlen; /* length of bpf header (this struct
|
179 |
|
|
plus alignment padding) */
|
180 |
|
|
};
|
181 |
|
|
/*
|
182 |
|
|
* Because the structure above is not a multiple of 4 bytes, some compilers
|
183 |
|
|
* will insist on inserting padding; hence, sizeof(struct bpf_hdr) won't work.
|
184 |
|
|
* Only the kernel needs to know about it; applications use bh_hdrlen.
|
185 |
|
|
* XXX To save a few bytes on 32-bit machines, we avoid end-of-struct
|
186 |
|
|
* XXX padding by using the size of the header data elements. This is
|
187 |
|
|
* XXX fail-safe: on new machines, we just use the 'safe' sizeof.
|
188 |
|
|
*/
|
189 |
|
|
#ifdef _KERNEL
|
190 |
|
|
#if defined(__arm32__) || defined(__i386__) || defined(__m68k__) || \
|
191 |
|
|
defined(__mips__) || defined(__ns32k__) || defined(__sparc__) || \
|
192 |
|
|
defined(__vax__)
|
193 |
|
|
#define SIZEOF_BPF_HDR 18
|
194 |
|
|
#else
|
195 |
|
|
#define SIZEOF_BPF_HDR sizeof(struct bpf_hdr)
|
196 |
|
|
#endif
|
197 |
|
|
#endif
|
198 |
|
|
|
199 |
|
|
/*
|
200 |
|
|
* Data-link level type codes.
|
201 |
|
|
*/
|
202 |
|
|
#define DLT_NULL 0 /* no link-layer encapsulation */
|
203 |
|
|
#define DLT_EN10MB 1 /* Ethernet (10Mb) */
|
204 |
|
|
#define DLT_EN3MB 2 /* Experimental Ethernet (3Mb) */
|
205 |
|
|
#define DLT_AX25 3 /* Amateur Radio AX.25 */
|
206 |
|
|
#define DLT_PRONET 4 /* Proteon ProNET Token Ring */
|
207 |
|
|
#define DLT_CHAOS 5 /* Chaos */
|
208 |
|
|
#define DLT_IEEE802 6 /* IEEE 802 Networks */
|
209 |
|
|
#define DLT_ARCNET 7 /* ARCNET */
|
210 |
|
|
#define DLT_SLIP 8 /* Serial Line IP */
|
211 |
|
|
#define DLT_PPP 9 /* Point-to-point Protocol */
|
212 |
|
|
#define DLT_FDDI 10 /* FDDI */
|
213 |
|
|
#define DLT_ATM_RFC1483 11 /* LLC/SNAP encapsulated atm */
|
214 |
|
|
#define DLT_LOOP 12 /* loopback type (af header) */
|
215 |
|
|
#define DLT_ENC 13 /* IPSEC enc type (af header, spi, flags) */
|
216 |
|
|
#define DLT_RAW 14 /* raw IP */
|
217 |
|
|
#define DLT_SLIP_BSDOS 15 /* BSD/OS Serial Line IP */
|
218 |
|
|
#define DLT_PPP_BSDOS 16 /* BSD/OS Point-to-point Protocol */
|
219 |
|
|
|
220 |
|
|
/*
|
221 |
|
|
* The instruction encodings.
|
222 |
|
|
*/
|
223 |
|
|
/* instruction classes */
|
224 |
|
|
#define BPF_CLASS(code) ((code) & 0x07)
|
225 |
|
|
#define BPF_LD 0x00
|
226 |
|
|
#define BPF_LDX 0x01
|
227 |
|
|
#define BPF_ST 0x02
|
228 |
|
|
#define BPF_STX 0x03
|
229 |
|
|
#define BPF_ALU 0x04
|
230 |
|
|
#define BPF_JMP 0x05
|
231 |
|
|
#define BPF_RET 0x06
|
232 |
|
|
#define BPF_MISC 0x07
|
233 |
|
|
|
234 |
|
|
/* ld/ldx fields */
|
235 |
|
|
#define BPF_SIZE(code) ((code) & 0x18)
|
236 |
|
|
#define BPF_W 0x00
|
237 |
|
|
#define BPF_H 0x08
|
238 |
|
|
#define BPF_B 0x10
|
239 |
|
|
#define BPF_MODE(code) ((code) & 0xe0)
|
240 |
|
|
#define BPF_IMM 0x00
|
241 |
|
|
#define BPF_ABS 0x20
|
242 |
|
|
#define BPF_IND 0x40
|
243 |
|
|
#define BPF_MEM 0x60
|
244 |
|
|
#define BPF_LEN 0x80
|
245 |
|
|
#define BPF_MSH 0xa0
|
246 |
|
|
|
247 |
|
|
/* alu/jmp fields */
|
248 |
|
|
#define BPF_OP(code) ((code) & 0xf0)
|
249 |
|
|
#define BPF_ADD 0x00
|
250 |
|
|
#define BPF_SUB 0x10
|
251 |
|
|
#define BPF_MUL 0x20
|
252 |
|
|
#define BPF_DIV 0x30
|
253 |
|
|
#define BPF_OR 0x40
|
254 |
|
|
#define BPF_AND 0x50
|
255 |
|
|
#define BPF_LSH 0x60
|
256 |
|
|
#define BPF_RSH 0x70
|
257 |
|
|
#define BPF_NEG 0x80
|
258 |
|
|
#define BPF_JA 0x00
|
259 |
|
|
#define BPF_JEQ 0x10
|
260 |
|
|
#define BPF_JGT 0x20
|
261 |
|
|
#define BPF_JGE 0x30
|
262 |
|
|
#define BPF_JSET 0x40
|
263 |
|
|
#define BPF_SRC(code) ((code) & 0x08)
|
264 |
|
|
#define BPF_K 0x00
|
265 |
|
|
#define BPF_X 0x08
|
266 |
|
|
|
267 |
|
|
/* ret - BPF_K and BPF_X also apply */
|
268 |
|
|
#define BPF_RVAL(code) ((code) & 0x18)
|
269 |
|
|
#define BPF_A 0x10
|
270 |
|
|
|
271 |
|
|
/* misc */
|
272 |
|
|
#define BPF_MISCOP(code) ((code) & 0xf8)
|
273 |
|
|
#define BPF_TAX 0x00
|
274 |
|
|
#define BPF_TXA 0x80
|
275 |
|
|
|
276 |
|
|
/*
|
277 |
|
|
* The instruction data structure.
|
278 |
|
|
*/
|
279 |
|
|
struct bpf_insn {
|
280 |
|
|
u_int16_t code;
|
281 |
|
|
u_char jt;
|
282 |
|
|
u_char jf;
|
283 |
|
|
int32_t k;
|
284 |
|
|
};
|
285 |
|
|
|
286 |
|
|
/*
|
287 |
|
|
* Macros for insn array initializers.
|
288 |
|
|
*/
|
289 |
|
|
#define BPF_STMT(code, k) { (u_int16_t)(code), 0, 0, k }
|
290 |
|
|
#define BPF_JUMP(code, k, jt, jf) { (u_int16_t)(code), jt, jf, k }
|
291 |
|
|
|
292 |
|
|
#ifdef _KERNEL
|
293 |
|
|
int bpf_validate __P((struct bpf_insn *, int));
|
294 |
|
|
void bpf_tap __P((caddr_t, u_char *, u_int));
|
295 |
|
|
void bpf_mtap __P((caddr_t, struct mbuf *));
|
296 |
|
|
void bpfattach __P((caddr_t *, struct ifnet *, u_int, u_int));
|
297 |
|
|
void bpfdetach __P((struct ifnet *));
|
298 |
|
|
void bpfilterattach __P((int));
|
299 |
|
|
u_int bpf_filter __P((struct bpf_insn *, u_char *, u_int, u_int));
|
300 |
|
|
#endif
|
301 |
|
|
|
302 |
|
|
/*
|
303 |
|
|
* Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST).
|
304 |
|
|
*/
|
305 |
|
|
#define BPF_MEMWORDS 16
|
306 |
|
|
|
307 |
|
|
extern int ticks; /* from kern/kern_clock.c; incremented each */
|
308 |
|
|
/* clock tick. */
|
309 |
|
|
|
310 |
|
|
#endif /* _NET_BPF_H_ */
|