bpf.h revision 127673
1/*
2 * Copyright (c) 1990, 1991, 1993
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	8.1 (Berkeley) 6/10/93
39 *	@(#)bpf.h	1.34 (LBL)     6/16/96
40 *
41 * $FreeBSD: head/sys/net/bpf.h 127673 2004-03-31 14:09:26Z bms $
42 */
43
44#ifndef _NET_BPF_H_
45#define _NET_BPF_H_
46
47/* BSD style release date */
48#define	BPF_RELEASE 199606
49
50typedef	int32_t	  bpf_int32;
51typedef	u_int32_t bpf_u_int32;
52
53/*
54 * Alignment macros.  BPF_WORDALIGN rounds up to the next
55 * even multiple of BPF_ALIGNMENT.
56 */
57#define BPF_ALIGNMENT sizeof(long)
58#define BPF_WORDALIGN(x) (((x)+(BPF_ALIGNMENT-1))&~(BPF_ALIGNMENT-1))
59
60#define BPF_MAXINSNS 512
61#define BPF_MAXBUFSIZE 0x80000
62#define BPF_MINBUFSIZE 32
63
64/*
65 *  Structure for BIOCSETF.
66 */
67struct bpf_program {
68	u_int bf_len;
69	struct bpf_insn *bf_insns;
70};
71
72/*
73 * Struct returned by BIOCGSTATS.
74 */
75struct bpf_stat {
76	u_int bs_recv;		/* number of packets received */
77	u_int bs_drop;		/* number of packets dropped */
78};
79
80/*
81 * Struct return by BIOCVERSION.  This represents the version number of
82 * the filter language described by the instruction encodings below.
83 * bpf understands a program iff kernel_major == filter_major &&
84 * kernel_minor >= filter_minor, that is, if the value returned by the
85 * running kernel has the same major number and a minor number equal
86 * equal to or less than the filter being downloaded.  Otherwise, the
87 * results are undefined, meaning an error may be returned or packets
88 * may be accepted haphazardly.
89 * It has nothing to do with the source code version.
90 */
91struct bpf_version {
92	u_short bv_major;
93	u_short bv_minor;
94};
95/* Current version number of filter architecture. */
96#define BPF_MAJOR_VERSION 1
97#define BPF_MINOR_VERSION 1
98
99#define	BIOCGBLEN	_IOR('B',102, u_int)
100#define	BIOCSBLEN	_IOWR('B',102, u_int)
101#define	BIOCSETF	_IOW('B',103, struct bpf_program)
102#define	BIOCFLUSH	_IO('B',104)
103#define BIOCPROMISC	_IO('B',105)
104#define	BIOCGDLT	_IOR('B',106, u_int)
105#define BIOCGETIF	_IOR('B',107, struct ifreq)
106#define BIOCSETIF	_IOW('B',108, struct ifreq)
107#define BIOCSRTIMEOUT	_IOW('B',109, struct timeval)
108#define BIOCGRTIMEOUT	_IOR('B',110, struct timeval)
109#define BIOCGSTATS	_IOR('B',111, struct bpf_stat)
110#define BIOCIMMEDIATE	_IOW('B',112, u_int)
111#define BIOCVERSION	_IOR('B',113, struct bpf_version)
112#define BIOCGRSIG	_IOR('B',114, u_int)
113#define BIOCSRSIG	_IOW('B',115, u_int)
114#define BIOCGHDRCMPLT	_IOR('B',116, u_int)
115#define BIOCSHDRCMPLT	_IOW('B',117, u_int)
116#define BIOCGSEESENT	_IOR('B',118, u_int)
117#define BIOCSSEESENT	_IOW('B',119, u_int)
118#define	BIOCSDLT	_IOW('B',120, u_int)
119#define	BIOCGDLTLIST	_IOWR('B',121, struct bpf_dltlist)
120
121/*
122 * Structure prepended to each packet.
123 */
124struct bpf_hdr {
125	struct timeval	bh_tstamp;	/* time stamp */
126	bpf_u_int32	bh_caplen;	/* length of captured portion */
127	bpf_u_int32	bh_datalen;	/* original length of packet */
128	u_short		bh_hdrlen;	/* length of bpf header (this struct
129					   plus alignment padding) */
130};
131/*
132 * Because the structure above is not a multiple of 4 bytes, some compilers
133 * will insist on inserting padding; hence, sizeof(struct bpf_hdr) won't work.
134 * Only the kernel needs to know about it; applications use bh_hdrlen.
135 */
136#ifdef _KERNEL
137#define	SIZEOF_BPF_HDR	(sizeof(struct bpf_hdr) <= 20 ? 18 : \
138    sizeof(struct bpf_hdr))
139#endif
140
141/*
142 * Data-link level type codes.
143 */
144#define DLT_NULL	0	/* no link-layer encapsulation */
145#define DLT_EN10MB	1	/* Ethernet (10Mb) */
146#define DLT_EN3MB	2	/* Experimental Ethernet (3Mb) */
147#define DLT_AX25	3	/* Amateur Radio AX.25 */
148#define DLT_PRONET	4	/* Proteon ProNET Token Ring */
149#define DLT_CHAOS	5	/* Chaos */
150#define DLT_IEEE802	6	/* IEEE 802 Networks */
151#define DLT_ARCNET	7	/* ARCNET */
152#define DLT_SLIP	8	/* Serial Line IP */
153#define DLT_PPP		9	/* Point-to-point Protocol */
154#define DLT_FDDI	10	/* FDDI */
155#define DLT_ATM_RFC1483	11	/* LLC/SNAP encapsulated atm */
156#define DLT_RAW		12	/* raw IP */
157
158/*
159 * These are values from BSD/OS's "bpf.h".
160 * These are not the same as the values from the traditional libpcap
161 * "bpf.h"; however, these values shouldn't be generated by any
162 * OS other than BSD/OS, so the correct values to use here are the
163 * BSD/OS values.
164 *
165 * Platforms that have already assigned these values to other
166 * DLT_ codes, however, should give these codes the values
167 * from that platform, so that programs that use these codes will
168 * continue to compile - even though they won't correctly read
169 * files of these types.
170 */
171#define DLT_SLIP_BSDOS	15	/* BSD/OS Serial Line IP */
172#define DLT_PPP_BSDOS	16	/* BSD/OS Point-to-point Protocol */
173
174#define DLT_ATM_CLIP	19	/* Linux Classical-IP over ATM */
175
176/*
177 * These values are defined by NetBSD; other platforms should refrain from
178 * using them for other purposes, so that NetBSD savefiles with link
179 * types of 50 or 51 can be read as this type on all platforms.
180 */
181#define DLT_PPP_SERIAL	50	/* PPP over serial with HDLC encapsulation */
182#define DLT_PPP_ETHER	51	/* PPP over Ethernet */
183
184/*
185 * This value was defined by libpcap 0.5; platforms that have defined
186 * it with a different value should define it here with that value -
187 * a link type of 104 in a save file will be mapped to DLT_C_HDLC,
188 * whatever value that happens to be, so programs will correctly
189 * handle files with that link type regardless of the value of
190 * DLT_C_HDLC.
191 *
192 * The name DLT_C_HDLC was used by BSD/OS; we use that name for source
193 * compatibility with programs written for BSD/OS.
194 *
195 * libpcap 0.5 defined it as DLT_CHDLC; we define DLT_CHDLC as well,
196 * for source compatibility with programs written for libpcap 0.5.
197 */
198#define DLT_C_HDLC	104	/* Cisco HDLC */
199#define DLT_CHDLC	DLT_C_HDLC
200
201#define DLT_IEEE802_11	105	/* IEEE 802.11 wireless */
202
203/*
204 * Values between 106 and 107 are used in capture file headers as
205 * link-layer types corresponding to DLT_ types that might differ
206 * between platforms; don't use those values for new DLT_ new types.
207 */
208
209/*
210 * Frame Relay; BSD/OS has a DLT_FR with a value of 11, but that collides
211 * with other values.
212 * DLT_FR and DLT_FRELAY packets start with the Q.922 Frame Relay header
213 * (DLCI, etc.).
214 */
215#define DLT_FRELAY	107
216
217/*
218 * OpenBSD DLT_LOOP, for loopback devices; it's like DLT_NULL, except
219 * that the AF_ type in the link-layer header is in network byte order.
220 *
221 * OpenBSD defines it as 12, but that collides with DLT_RAW, so we
222 * define it as 108 here.  If OpenBSD picks up this file, it should
223 * define DLT_LOOP as 12 in its version, as per the comment above -
224 * and should not use 108 as a DLT_ value.
225 */
226#define DLT_LOOP	108
227
228/*
229 * Values between 109 and 112 are used in capture file headers as
230 * link-layer types corresponding to DLT_ types that might differ
231 * between platforms; don't use those values for new DLT_ new types.
232 */
233
234/*
235 * Encapsulated packets for IPsec; DLT_ENC is 13 in OpenBSD, but that's
236 * DLT_SLIP_BSDOS in NetBSD, so we don't use 13 for it in OSes other
237 * than OpenBSD.
238 */
239#define DLT_ENC	109
240
241/*
242 * This is for Linux cooked sockets.
243 */
244#define DLT_LINUX_SLL	113
245
246/*
247 * Apple LocalTalk hardware.
248 */
249#define DLT_LTALK	114
250
251/*
252 * Acorn Econet.
253 */
254#define DLT_ECONET	115
255
256/*
257 * Reserved for use with OpenBSD ipfilter.
258 */
259#define DLT_IPFILTER	116
260
261/*
262 * Reserved for use in capture-file headers as a link-layer type
263 * corresponding to OpenBSD DLT_PFLOG; DLT_PFLOG is 17 in OpenBSD,
264 * but that's DLT_LANE8023 in SuSE 6.3, so we can't use 17 for it
265 * in capture-file headers.
266 */
267#define DLT_PFLOG	117
268
269/*
270 * Registered for Cisco-internal use.
271 */
272#define DLT_CISCO_IOS	118
273
274/*
275 * Reserved for 802.11 cards using the Prism II chips, with a link-layer
276 * header including Prism monitor mode information plus an 802.11
277 * header.
278 */
279#define DLT_PRISM_HEADER	119
280
281/*
282 * Reserved for Aironet 802.11 cards, with an Aironet link-layer header
283 * (see Doug Ambrisko's FreeBSD patches).
284 */
285#define DLT_AIRONET_HEADER	120
286
287/*
288 * Reserved for use by OpenBSD's pfsync device.
289 */
290#define DLT_PFSYNC	121
291
292/*
293 * Reserved for RFC 2625 IP-over-Fibre Channel.
294 */
295#define DLT_IP_OVER_FC	122
296
297/*
298 * Reserved for Full Frontal ATM on Solaris.
299 */
300#define DLT_SUNATM	123
301
302/*
303 * BSD header for 802.11 plus a number of bits of link-layer information
304 * including radio information.
305 */
306#ifndef DLT_IEEE802_11_RADIO
307#define DLT_IEEE802_11_RADIO	127
308#endif
309
310/*
311 * Reserved for Linux ARCNET.
312 */
313#define DLT_ARCNET_LINUX	129
314
315/*
316 * Reserved for Apple IP-over-IEEE-1394.
317 */
318#define DLT_APPLE_IP_OVER_IEEE1394	138
319
320/*
321 * Reserved for Linux IrDA.
322 */
323#define DLT_LINUX_IRDA	144
324
325/*
326 * Reserved for AbsoluteValue Systems 802.11 capture.
327 */
328#define DLT_IEEE802_11_RADIO_AVS	163
329
330/*
331 * The instruction encodings.
332 */
333/* instruction classes */
334#define BPF_CLASS(code) ((code) & 0x07)
335#define		BPF_LD		0x00
336#define		BPF_LDX		0x01
337#define		BPF_ST		0x02
338#define		BPF_STX		0x03
339#define		BPF_ALU		0x04
340#define		BPF_JMP		0x05
341#define		BPF_RET		0x06
342#define		BPF_MISC	0x07
343
344/* ld/ldx fields */
345#define BPF_SIZE(code)	((code) & 0x18)
346#define		BPF_W		0x00
347#define		BPF_H		0x08
348#define		BPF_B		0x10
349#define BPF_MODE(code)	((code) & 0xe0)
350#define		BPF_IMM 	0x00
351#define		BPF_ABS		0x20
352#define		BPF_IND		0x40
353#define		BPF_MEM		0x60
354#define		BPF_LEN		0x80
355#define		BPF_MSH		0xa0
356
357/* alu/jmp fields */
358#define BPF_OP(code)	((code) & 0xf0)
359#define		BPF_ADD		0x00
360#define		BPF_SUB		0x10
361#define		BPF_MUL		0x20
362#define		BPF_DIV		0x30
363#define		BPF_OR		0x40
364#define		BPF_AND		0x50
365#define		BPF_LSH		0x60
366#define		BPF_RSH		0x70
367#define		BPF_NEG		0x80
368#define		BPF_JA		0x00
369#define		BPF_JEQ		0x10
370#define		BPF_JGT		0x20
371#define		BPF_JGE		0x30
372#define		BPF_JSET	0x40
373#define BPF_SRC(code)	((code) & 0x08)
374#define		BPF_K		0x00
375#define		BPF_X		0x08
376
377/* ret - BPF_K and BPF_X also apply */
378#define BPF_RVAL(code)	((code) & 0x18)
379#define		BPF_A		0x10
380
381/* misc */
382#define BPF_MISCOP(code) ((code) & 0xf8)
383#define		BPF_TAX		0x00
384#define		BPF_TXA		0x80
385
386/*
387 * The instruction data structure.
388 */
389struct bpf_insn {
390	u_short		code;
391	u_char		jt;
392	u_char		jf;
393	bpf_u_int32	k;
394};
395
396/*
397 * Macros for insn array initializers.
398 */
399#define BPF_STMT(code, k) { (u_short)(code), 0, 0, k }
400#define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k }
401
402/*
403 * Structure to retrieve available DLTs for the interface.
404 */
405struct bpf_dltlist {
406	u_int	bfl_len;	/* number of bfd_list array */
407	u_int	*bfl_list;	/* array of DLTs */
408};
409
410#ifdef _KERNEL
411struct bpf_if;
412int	 bpf_validate(const struct bpf_insn *, int);
413void	 bpf_tap(struct bpf_if *, u_char *, u_int);
414void	 bpf_mtap(struct bpf_if *, struct mbuf *);
415void	 bpf_mtap2(struct bpf_if *, void *, u_int, struct mbuf *);
416void	 bpfattach(struct ifnet *, u_int, u_int);
417void	 bpfattach2(struct ifnet *, u_int, u_int, struct bpf_if **);
418void	 bpfdetach(struct ifnet *);
419
420void	 bpfilterattach(int);
421u_int	 bpf_filter(const struct bpf_insn *, u_char *, u_int, u_int);
422
423#define	BPF_TAP(_ifp,_pkt,_pktlen) do {				\
424	if ((_ifp)->if_bpf)					\
425		bpf_tap((_ifp)->if_bpf, (_pkt), (_pktlen));	\
426} while (0)
427#define	BPF_MTAP(_ifp,_m) do {					\
428	if ((_ifp)->if_bpf) {					\
429		M_ASSERTVALID(_m);				\
430		bpf_mtap((_ifp)->if_bpf, (_m));			\
431	}							\
432} while (0)
433#define	BPF_MTAP2(_ifp,_data,_dlen,_m) do {			\
434	if ((_ifp)->if_bpf) {					\
435		M_ASSERTVALID(_m);				\
436		bpf_mtap2((_ifp)->if_bpf,(_data),(_dlen),(_m));	\
437	}							\
438} while (0)
439#endif
440
441/*
442 * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST).
443 */
444#define BPF_MEMWORDS 16
445
446#endif /* _NET_BPF_H_ */
447