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