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