bpf.h revision 1.66 1 1.66 christos /* $NetBSD: bpf.h,v 1.66 2014/11/19 19:35:21 christos 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.32 agc * 3. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd *
36 1.19 fvdl * @(#)bpf.h 8.2 (Berkeley) 1/9/95
37 1.17 christos * @(#) Header: bpf.h,v 1.36 97/06/12 14:29:53 leres Exp (LBL)
38 1.1 cgd */
39 1.1 cgd
40 1.8 jtc #ifndef _NET_BPF_H_
41 1.8 jtc #define _NET_BPF_H_
42 1.27 thorpej
43 1.27 thorpej #include <sys/time.h>
44 1.8 jtc
45 1.17 christos /* BSD style release date */
46 1.17 christos #define BPF_RELEASE 199606
47 1.18 christos
48 1.64 alnsn /* Date when COP instructions and external memory have been released. */
49 1.64 alnsn #define BPF_COP_EXTMEM_RELEASE 20140624
50 1.64 alnsn
51 1.59 christos __BEGIN_DECLS
52 1.59 christos
53 1.18 christos typedef int bpf_int32;
54 1.18 christos typedef u_int bpf_u_int32;
55 1.17 christos
56 1.1 cgd /*
57 1.42 perry * Alignment macros. BPF_WORDALIGN rounds up to the next
58 1.42 perry * even multiple of BPF_ALIGNMENT.
59 1.1 cgd */
60 1.1 cgd #define BPF_ALIGNMENT sizeof(long)
61 1.58 bouyer #define BPF_ALIGNMENT32 sizeof(int)
62 1.58 bouyer
63 1.1 cgd #define BPF_WORDALIGN(x) (((x)+(BPF_ALIGNMENT-1))&~(BPF_ALIGNMENT-1))
64 1.58 bouyer #define BPF_WORDALIGN32(x) (((x)+(BPF_ALIGNMENT32-1))&~(BPF_ALIGNMENT32-1))
65 1.1 cgd
66 1.1 cgd #define BPF_MAXINSNS 512
67 1.33 jonathan #define BPF_DFLTBUFSIZE (1024*1024) /* default static upper limit */
68 1.33 jonathan #define BPF_MAXBUFSIZE (1024*1024*16) /* hard limit on sysctl'able value */
69 1.2 cgd #define BPF_MINBUFSIZE 32
70 1.1 cgd
71 1.1 cgd /*
72 1.1 cgd * Structure for BIOCSETF.
73 1.1 cgd */
74 1.1 cgd struct bpf_program {
75 1.1 cgd u_int bf_len;
76 1.1 cgd struct bpf_insn *bf_insns;
77 1.1 cgd };
78 1.42 perry
79 1.1 cgd /*
80 1.43 rpaulo * Struct returned by BIOCGSTATS and net.bpf.stats sysctl.
81 1.1 cgd */
82 1.1 cgd struct bpf_stat {
83 1.45 rpaulo uint64_t bs_recv; /* number of packets received */
84 1.45 rpaulo uint64_t bs_drop; /* number of packets dropped */
85 1.45 rpaulo uint64_t bs_capt; /* number of packets captured */
86 1.45 rpaulo uint64_t bs_padding[13];
87 1.35 darrenr };
88 1.42 perry
89 1.35 darrenr /*
90 1.35 darrenr * Struct returned by BIOCGSTATSOLD.
91 1.35 darrenr */
92 1.35 darrenr struct bpf_stat_old {
93 1.1 cgd u_int bs_recv; /* number of packets received */
94 1.1 cgd u_int bs_drop; /* number of packets dropped */
95 1.1 cgd };
96 1.1 cgd
97 1.1 cgd /*
98 1.42 perry * Struct return by BIOCVERSION. This represents the version number of
99 1.2 cgd * the filter language described by the instruction encodings below.
100 1.2 cgd * bpf understands a program iff kernel_major == filter_major &&
101 1.2 cgd * kernel_minor >= filter_minor, that is, if the value returned by the
102 1.2 cgd * running kernel has the same major number and a minor number equal
103 1.2 cgd * equal to or less than the filter being downloaded. Otherwise, the
104 1.2 cgd * results are undefined, meaning an error may be returned or packets
105 1.2 cgd * may be accepted haphazardly.
106 1.2 cgd * It has nothing to do with the source code version.
107 1.2 cgd */
108 1.2 cgd struct bpf_version {
109 1.2 cgd u_short bv_major;
110 1.2 cgd u_short bv_minor;
111 1.2 cgd };
112 1.9 mycroft /* Current version number of filter architecture. */
113 1.2 cgd #define BPF_MAJOR_VERSION 1
114 1.2 cgd #define BPF_MINOR_VERSION 1
115 1.2 cgd
116 1.2 cgd /*
117 1.1 cgd * BPF ioctls
118 1.1 cgd *
119 1.1 cgd * The first set is for compatibility with Sun's pcc style
120 1.1 cgd * header files. If your using gcc, we assume that you
121 1.1 cgd * have run fixincludes so the latter set should work.
122 1.1 cgd */
123 1.34 darrenr #define BIOCGBLEN _IOR('B',102, u_int)
124 1.34 darrenr #define BIOCSBLEN _IOWR('B',102, u_int)
125 1.34 darrenr #define BIOCSETF _IOW('B',103, struct bpf_program)
126 1.34 darrenr #define BIOCFLUSH _IO('B',104)
127 1.31 thorpej #define BIOCPROMISC _IO('B',105)
128 1.34 darrenr #define BIOCGDLT _IOR('B',106, u_int)
129 1.31 thorpej #define BIOCGETIF _IOR('B',107, struct ifreq)
130 1.31 thorpej #define BIOCSETIF _IOW('B',108, struct ifreq)
131 1.49 christos #ifdef COMPAT_50
132 1.49 christos #include <compat/sys/time.h>
133 1.49 christos #define BIOCSORTIMEOUT _IOW('B',109, struct timeval50)
134 1.49 christos #define BIOCGORTIMEOUT _IOR('B',110, struct timeval50)
135 1.49 christos #endif
136 1.31 thorpej #define BIOCGSTATS _IOR('B',111, struct bpf_stat)
137 1.35 darrenr #define BIOCGSTATSOLD _IOR('B',111, struct bpf_stat_old)
138 1.31 thorpej #define BIOCIMMEDIATE _IOW('B',112, u_int)
139 1.31 thorpej #define BIOCVERSION _IOR('B',113, struct bpf_version)
140 1.31 thorpej #define BIOCSTCPF _IOW('B',114, struct bpf_program)
141 1.31 thorpej #define BIOCSUDPF _IOW('B',115, struct bpf_program)
142 1.34 darrenr #define BIOCGHDRCMPLT _IOR('B',116, u_int)
143 1.34 darrenr #define BIOCSHDRCMPLT _IOW('B',117, u_int)
144 1.34 darrenr #define BIOCSDLT _IOW('B',118, u_int)
145 1.34 darrenr #define BIOCGDLTLIST _IOWR('B',119, struct bpf_dltlist)
146 1.34 darrenr #define BIOCGSEESENT _IOR('B',120, u_int)
147 1.34 darrenr #define BIOCSSEESENT _IOW('B',121, u_int)
148 1.49 christos #define BIOCSRTIMEOUT _IOW('B',122, struct timeval)
149 1.49 christos #define BIOCGRTIMEOUT _IOR('B',123, struct timeval)
150 1.54 christos #define BIOCGFEEDBACK _IOR('B',124, u_int)
151 1.54 christos #define BIOCSFEEDBACK _IOW('B',125, u_int)
152 1.54 christos #define BIOCFEEDBACK BIOCSFEEDBACK /* FreeBSD name */
153 1.1 cgd
154 1.1 cgd /*
155 1.49 christos * Structure prepended to each packet. This is "wire" format, so we
156 1.50 christos * cannot change it unfortunately to 64 bit times on 32 bit systems [yet].
157 1.1 cgd */
158 1.50 christos struct bpf_timeval {
159 1.50 christos long tv_sec;
160 1.50 christos long tv_usec;
161 1.49 christos };
162 1.50 christos
163 1.58 bouyer struct bpf_timeval32 {
164 1.58 bouyer int32_t tv_sec;
165 1.58 bouyer int32_t tv_usec;
166 1.58 bouyer };
167 1.58 bouyer
168 1.1 cgd struct bpf_hdr {
169 1.50 christos struct bpf_timeval bh_tstamp; /* time stamp */
170 1.45 rpaulo uint32_t bh_caplen; /* length of captured portion */
171 1.45 rpaulo uint32_t bh_datalen; /* original length of packet */
172 1.45 rpaulo uint16_t bh_hdrlen; /* length of bpf header (this struct
173 1.1 cgd plus alignment padding) */
174 1.1 cgd };
175 1.58 bouyer
176 1.58 bouyer struct bpf_hdr32 {
177 1.58 bouyer struct bpf_timeval32 bh_tstamp; /* time stamp */
178 1.58 bouyer uint32_t bh_caplen; /* length of captured portion */
179 1.58 bouyer uint32_t bh_datalen; /* original length of packet */
180 1.58 bouyer uint16_t bh_hdrlen; /* length of bpf header (this struct
181 1.58 bouyer plus alignment padding) */
182 1.58 bouyer };
183 1.1 cgd /*
184 1.1 cgd * Because the structure above is not a multiple of 4 bytes, some compilers
185 1.1 cgd * will insist on inserting padding; hence, sizeof(struct bpf_hdr) won't work.
186 1.1 cgd * Only the kernel needs to know about it; applications use bh_hdrlen.
187 1.14 cgd * XXX To save a few bytes on 32-bit machines, we avoid end-of-struct
188 1.14 cgd * XXX padding by using the size of the header data elements. This is
189 1.14 cgd * XXX fail-safe: on new machines, we just use the 'safe' sizeof.
190 1.1 cgd */
191 1.10 jtc #ifdef _KERNEL
192 1.14 cgd #if defined(__arm32__) || defined(__i386__) || defined(__m68k__) || \
193 1.26 eeh defined(__mips__) || defined(__ns32k__) || defined(__vax__) || \
194 1.29 thorpej defined(__sh__) || (defined(__sparc__) && !defined(__sparc64__))
195 1.1 cgd #define SIZEOF_BPF_HDR 18
196 1.58 bouyer #define SIZEOF_BPF_HDR32 18
197 1.14 cgd #else
198 1.14 cgd #define SIZEOF_BPF_HDR sizeof(struct bpf_hdr)
199 1.58 bouyer #define SIZEOF_BPF_HDR32 sizeof(struct bpf_hdr32)
200 1.14 cgd #endif
201 1.1 cgd #endif
202 1.1 cgd
203 1.28 thorpej /* Pull in data-link level type codes. */
204 1.28 thorpej #include <net/dlt.h>
205 1.23 thorpej
206 1.1 cgd /*
207 1.44 rpaulo * The instruction encodings.
208 1.1 cgd */
209 1.2 cgd /* instruction classes */
210 1.1 cgd #define BPF_CLASS(code) ((code) & 0x07)
211 1.1 cgd #define BPF_LD 0x00
212 1.1 cgd #define BPF_LDX 0x01
213 1.1 cgd #define BPF_ST 0x02
214 1.1 cgd #define BPF_STX 0x03
215 1.1 cgd #define BPF_ALU 0x04
216 1.1 cgd #define BPF_JMP 0x05
217 1.1 cgd #define BPF_RET 0x06
218 1.1 cgd #define BPF_MISC 0x07
219 1.1 cgd
220 1.1 cgd /* ld/ldx fields */
221 1.1 cgd #define BPF_SIZE(code) ((code) & 0x18)
222 1.1 cgd #define BPF_W 0x00
223 1.1 cgd #define BPF_H 0x08
224 1.1 cgd #define BPF_B 0x10
225 1.66 christos /* 0x18 reserved; used by BSD/OS */
226 1.1 cgd #define BPF_MODE(code) ((code) & 0xe0)
227 1.1 cgd #define BPF_IMM 0x00
228 1.1 cgd #define BPF_ABS 0x20
229 1.1 cgd #define BPF_IND 0x40
230 1.1 cgd #define BPF_MEM 0x60
231 1.1 cgd #define BPF_LEN 0x80
232 1.1 cgd #define BPF_MSH 0xa0
233 1.66 christos /* 0xc0 reserved; used by BSD/OS */
234 1.66 christos /* 0xe0 reserved; used by BSD/OS */
235 1.1 cgd
236 1.1 cgd /* alu/jmp fields */
237 1.1 cgd #define BPF_OP(code) ((code) & 0xf0)
238 1.1 cgd #define BPF_ADD 0x00
239 1.1 cgd #define BPF_SUB 0x10
240 1.1 cgd #define BPF_MUL 0x20
241 1.1 cgd #define BPF_DIV 0x30
242 1.1 cgd #define BPF_OR 0x40
243 1.1 cgd #define BPF_AND 0x50
244 1.1 cgd #define BPF_LSH 0x60
245 1.1 cgd #define BPF_RSH 0x70
246 1.1 cgd #define BPF_NEG 0x80
247 1.66 christos #define BPF_MOD 0x90
248 1.66 christos #define BPF_XOR 0xa0
249 1.66 christos /* 0xb0 reserved */
250 1.66 christos /* 0xc0 reserved */
251 1.66 christos /* 0xd0 reserved */
252 1.66 christos /* 0xe0 reserved */
253 1.66 christos /* 0xf0 reserved */
254 1.1 cgd #define BPF_JA 0x00
255 1.1 cgd #define BPF_JEQ 0x10
256 1.1 cgd #define BPF_JGT 0x20
257 1.1 cgd #define BPF_JGE 0x30
258 1.1 cgd #define BPF_JSET 0x40
259 1.66 christos /* 0x50 reserved; used by BSD/OS */
260 1.66 christos /* 0x60 reserved */
261 1.66 christos /* 0x70 reserved */
262 1.66 christos /* 0x80 reserved */
263 1.66 christos /* 0x90 reserved */
264 1.66 christos /* 0xa0 reserved */
265 1.66 christos /* 0xb0 reserved */
266 1.66 christos /* 0xc0 reserved */
267 1.66 christos /* 0xd0 reserved */
268 1.66 christos /* 0xe0 reserved */
269 1.66 christos /* 0xf0 reserved */
270 1.1 cgd #define BPF_SRC(code) ((code) & 0x08)
271 1.1 cgd #define BPF_K 0x00
272 1.1 cgd #define BPF_X 0x08
273 1.1 cgd
274 1.1 cgd /* ret - BPF_K and BPF_X also apply */
275 1.1 cgd #define BPF_RVAL(code) ((code) & 0x18)
276 1.1 cgd #define BPF_A 0x10
277 1.66 christos /* 0x18 reserved */
278 1.1 cgd
279 1.1 cgd /* misc */
280 1.1 cgd #define BPF_MISCOP(code) ((code) & 0xf8)
281 1.1 cgd #define BPF_TAX 0x00
282 1.66 christos /* 0x10 reserved */
283 1.66 christos /* 0x18 reserved */
284 1.60 rmind #define BPF_COP 0x20
285 1.66 christos /* 0x28 reserved */
286 1.66 christos /* 0x30 reserved */
287 1.66 christos /* 0x38 reserved */
288 1.66 christos #define BPF_COPX 0x40 /* XXX: also used by BSD/OS */
289 1.66 christos /* 0x48 reserved */
290 1.66 christos /* 0x50 reserved */
291 1.66 christos /* 0x58 reserved */
292 1.66 christos /* 0x60 reserved */
293 1.66 christos /* 0x68 reserved */
294 1.66 christos /* 0x70 reserved */
295 1.66 christos /* 0x78 reserved */
296 1.1 cgd #define BPF_TXA 0x80
297 1.66 christos /* 0x88 reserved */
298 1.66 christos /* 0x90 reserved */
299 1.66 christos /* 0x98 reserved */
300 1.66 christos /* 0xa0 reserved */
301 1.66 christos /* 0xa8 reserved */
302 1.66 christos /* 0xb0 reserved */
303 1.66 christos /* 0xb8 reserved */
304 1.66 christos /* 0xc0 reserved; used by BSD/OS */
305 1.66 christos /* 0xc8 reserved */
306 1.66 christos /* 0xd0 reserved */
307 1.66 christos /* 0xd8 reserved */
308 1.66 christos /* 0xe0 reserved */
309 1.66 christos /* 0xe8 reserved */
310 1.66 christos /* 0xf0 reserved */
311 1.66 christos /* 0xf8 reserved */
312 1.1 cgd
313 1.1 cgd /*
314 1.1 cgd * The instruction data structure.
315 1.1 cgd */
316 1.1 cgd struct bpf_insn {
317 1.45 rpaulo uint16_t code;
318 1.11 cgd u_char jt;
319 1.11 cgd u_char jf;
320 1.46 rpaulo uint32_t k;
321 1.1 cgd };
322 1.1 cgd
323 1.1 cgd /*
324 1.1 cgd * Macros for insn array initializers.
325 1.1 cgd */
326 1.45 rpaulo #define BPF_STMT(code, k) { (uint16_t)(code), 0, 0, k }
327 1.45 rpaulo #define BPF_JUMP(code, k, jt, jf) { (uint16_t)(code), jt, jf, k }
328 1.1 cgd
329 1.30 onoe /*
330 1.63 rmind * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST).
331 1.63 rmind */
332 1.65 rmind #define BPF_MEMWORDS 16
333 1.63 rmind
334 1.63 rmind /*
335 1.65 rmind * bpf_memword_init_t: bits indicate which words in the external memory
336 1.65 rmind * store will be initialised by the caller before BPF program execution.
337 1.64 alnsn */
338 1.64 alnsn typedef uint32_t bpf_memword_init_t;
339 1.65 rmind #define BPF_MEMWORD_INIT(k) (UINT32_C(1) << (k))
340 1.64 alnsn
341 1.65 rmind /* Note: two most significant bits are reserved by bpfjit. */
342 1.64 alnsn __CTASSERT(BPF_MEMWORDS + 2 <= sizeof(bpf_memword_init_t) * NBBY);
343 1.64 alnsn
344 1.64 alnsn #ifdef _KERNEL
345 1.64 alnsn /*
346 1.64 alnsn * Max number of external memory words (for BPF_LD|BPF_MEM and BPF_ST).
347 1.64 alnsn */
348 1.64 alnsn #define BPF_MAX_MEMWORDS 30
349 1.65 rmind
350 1.64 alnsn __CTASSERT(BPF_MAX_MEMWORDS >= BPF_MEMWORDS);
351 1.64 alnsn __CTASSERT(BPF_MAX_MEMWORDS + 2 <= sizeof(bpf_memword_init_t) * NBBY);
352 1.64 alnsn #endif
353 1.64 alnsn
354 1.64 alnsn /*
355 1.30 onoe * Structure to retrieve available DLTs for the interface.
356 1.30 onoe */
357 1.30 onoe struct bpf_dltlist {
358 1.30 onoe u_int bfl_len; /* number of bfd_list array */
359 1.30 onoe u_int *bfl_list; /* array of DLTs */
360 1.30 onoe };
361 1.30 onoe
362 1.63 rmind struct bpf_ctx;
363 1.63 rmind typedef struct bpf_ctx bpf_ctx_t;
364 1.63 rmind
365 1.65 rmind typedef struct bpf_args {
366 1.64 alnsn const uint8_t * pkt;
367 1.64 alnsn size_t wirelen;
368 1.64 alnsn size_t buflen;
369 1.64 alnsn /*
370 1.64 alnsn * The following arguments are used only by some kernel
371 1.64 alnsn * subsystems.
372 1.64 alnsn * They aren't required for classical bpf filter programs.
373 1.64 alnsn * For such programs, bpfjit generated code doesn't read
374 1.64 alnsn * those arguments at all. Note however that bpf interpreter
375 1.64 alnsn * always needs a pointer to memstore.
376 1.64 alnsn */
377 1.64 alnsn uint32_t * mem; /* pointer to external memory store */
378 1.64 alnsn void * arg; /* auxiliary argument for a copfunc */
379 1.65 rmind } bpf_args_t;
380 1.63 rmind
381 1.64 alnsn #if defined(_KERNEL) || defined(__BPF_PRIVATE)
382 1.65 rmind
383 1.64 alnsn typedef uint32_t (*bpf_copfunc_t)(const bpf_ctx_t *, bpf_args_t *, uint32_t);
384 1.64 alnsn
385 1.63 rmind struct bpf_ctx {
386 1.65 rmind /*
387 1.65 rmind * BPF coprocessor functions and the number of them.
388 1.65 rmind */
389 1.63 rmind const bpf_copfunc_t * copfuncs;
390 1.63 rmind size_t nfuncs;
391 1.65 rmind
392 1.64 alnsn /*
393 1.65 rmind * The number of memory words in the external memory store.
394 1.65 rmind * There may be up to BPF_MAX_MEMWORDS words; if zero is set,
395 1.65 rmind * then the internal memory store is used which has a fixed
396 1.65 rmind * number of words (BPF_MEMWORDS).
397 1.64 alnsn */
398 1.64 alnsn size_t extwords;
399 1.65 rmind
400 1.65 rmind /*
401 1.65 rmind * The bitmask indicating which words in the external memstore
402 1.65 rmind * will be initialised by the caller.
403 1.65 rmind */
404 1.65 rmind bpf_memword_init_t preinited;
405 1.63 rmind };
406 1.63 rmind #endif
407 1.63 rmind
408 1.10 jtc #ifdef _KERNEL
409 1.63 rmind #include <net/bpfjit.h>
410 1.55 joerg #include <net/if.h>
411 1.63 rmind
412 1.51 pooka struct bpf_if;
413 1.51 pooka
414 1.52 pooka struct bpf_ops {
415 1.52 pooka void (*bpf_attach)(struct ifnet *, u_int, u_int, struct bpf_if **);
416 1.52 pooka void (*bpf_detach)(struct ifnet *);
417 1.52 pooka void (*bpf_change_type)(struct ifnet *, u_int, u_int);
418 1.52 pooka
419 1.52 pooka void (*bpf_tap)(struct bpf_if *, u_char *, u_int);
420 1.52 pooka void (*bpf_mtap)(struct bpf_if *, struct mbuf *);
421 1.52 pooka void (*bpf_mtap2)(struct bpf_if *, void *, u_int, struct mbuf *);
422 1.52 pooka void (*bpf_mtap_af)(struct bpf_if *, uint32_t, struct mbuf *);
423 1.52 pooka void (*bpf_mtap_sl_in)(struct bpf_if *, u_char *, struct mbuf **);
424 1.52 pooka void (*bpf_mtap_sl_out)(struct bpf_if *, u_char *, struct mbuf *);
425 1.52 pooka };
426 1.55 joerg
427 1.52 pooka extern struct bpf_ops *bpf_ops;
428 1.55 joerg
429 1.55 joerg static inline void
430 1.55 joerg bpf_attach(struct ifnet *_ifp, u_int _dlt, u_int _hdrlen)
431 1.55 joerg {
432 1.55 joerg bpf_ops->bpf_attach(_ifp, _dlt, _hdrlen, &_ifp->if_bpf);
433 1.55 joerg }
434 1.55 joerg
435 1.55 joerg static inline void
436 1.55 joerg bpf_attach2(struct ifnet *_ifp, u_int _dlt, u_int _hdrlen, struct bpf_if **_dp)
437 1.55 joerg {
438 1.55 joerg bpf_ops->bpf_attach(_ifp, _dlt, _hdrlen, _dp);
439 1.55 joerg }
440 1.55 joerg
441 1.55 joerg static inline void
442 1.55 joerg bpf_tap(struct ifnet *_ifp, u_char *_pkt, u_int _len)
443 1.55 joerg {
444 1.55 joerg if (_ifp->if_bpf)
445 1.55 joerg bpf_ops->bpf_tap(_ifp->if_bpf, _pkt, _len);
446 1.55 joerg }
447 1.55 joerg
448 1.55 joerg static inline void
449 1.55 joerg bpf_mtap(struct ifnet *_ifp, struct mbuf *_m)
450 1.55 joerg {
451 1.55 joerg if (_ifp->if_bpf)
452 1.55 joerg bpf_ops->bpf_mtap(_ifp->if_bpf, _m);
453 1.55 joerg }
454 1.55 joerg
455 1.55 joerg static inline void
456 1.55 joerg bpf_mtap2(struct bpf_if *_bpf, void *_data, u_int _dlen, struct mbuf *_m)
457 1.55 joerg {
458 1.55 joerg bpf_ops->bpf_mtap2(_bpf, _data, _dlen, _m);
459 1.55 joerg }
460 1.55 joerg
461 1.55 joerg static inline void
462 1.55 joerg bpf_mtap3(struct bpf_if *_bpf, struct mbuf *_m)
463 1.55 joerg {
464 1.55 joerg if (_bpf)
465 1.55 joerg bpf_ops->bpf_mtap(_bpf, _m);
466 1.55 joerg }
467 1.55 joerg
468 1.55 joerg static inline void
469 1.55 joerg bpf_mtap_af(struct ifnet *_ifp, uint32_t _af, struct mbuf *_m)
470 1.55 joerg {
471 1.55 joerg if (_ifp->if_bpf)
472 1.55 joerg bpf_ops->bpf_mtap_af(_ifp->if_bpf, _af, _m);
473 1.55 joerg }
474 1.55 joerg
475 1.55 joerg static inline void
476 1.55 joerg bpf_change_type(struct ifnet *_ifp, u_int _dlt, u_int _hdrlen)
477 1.55 joerg {
478 1.55 joerg bpf_ops->bpf_change_type(_ifp, _dlt, _hdrlen);
479 1.55 joerg }
480 1.55 joerg
481 1.55 joerg static inline void
482 1.55 joerg bpf_detach(struct ifnet *_ifp)
483 1.55 joerg {
484 1.55 joerg bpf_ops->bpf_detach(_ifp);
485 1.55 joerg }
486 1.55 joerg
487 1.55 joerg static inline void
488 1.55 joerg bpf_mtap_sl_in(struct ifnet *_ifp, u_char *_hdr, struct mbuf **_m)
489 1.55 joerg {
490 1.55 joerg bpf_ops->bpf_mtap_sl_in(_ifp->if_bpf, _hdr, _m);
491 1.55 joerg }
492 1.55 joerg
493 1.55 joerg static inline void
494 1.55 joerg bpf_mtap_sl_out(struct ifnet *_ifp, u_char *_hdr, struct mbuf *_m)
495 1.55 joerg {
496 1.55 joerg if (_ifp->if_bpf)
497 1.55 joerg bpf_ops->bpf_mtap_sl_out(_ifp->if_bpf, _hdr, _m);
498 1.55 joerg }
499 1.55 joerg
500 1.55 joerg
501 1.65 rmind void bpf_setops(void);
502 1.52 pooka
503 1.65 rmind void bpf_ops_handover_enter(struct bpf_ops *);
504 1.65 rmind void bpf_ops_handover_exit(void);
505 1.53 pooka
506 1.65 rmind void bpfilterattach(int);
507 1.52 pooka
508 1.60 rmind bpf_ctx_t *bpf_create(void);
509 1.60 rmind void bpf_destroy(bpf_ctx_t *);
510 1.60 rmind
511 1.65 rmind int bpf_set_cop(bpf_ctx_t *, const bpf_copfunc_t *, size_t);
512 1.65 rmind int bpf_set_extmem(bpf_ctx_t *, size_t, bpf_memword_init_t);
513 1.65 rmind u_int bpf_filter_ext(const bpf_ctx_t *, const struct bpf_insn *, bpf_args_t *);
514 1.65 rmind int bpf_validate_ext(const bpf_ctx_t *, const struct bpf_insn *, int);
515 1.60 rmind
516 1.63 rmind bpfjit_func_t bpf_jit_generate(bpf_ctx_t *, void *, size_t);
517 1.63 rmind void bpf_jit_freecode(bpfjit_func_t);
518 1.63 rmind
519 1.62 rmind #endif
520 1.60 rmind
521 1.60 rmind int bpf_validate(const struct bpf_insn *, int);
522 1.60 rmind u_int bpf_filter(const struct bpf_insn *, const u_char *, u_int, u_int);
523 1.60 rmind
524 1.59 christos __END_DECLS
525 1.59 christos
526 1.48 elad #endif /* !_NET_BPF_H_ */
527