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