1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1990, 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from the Stanford/CMU enet packet filter, 8 * (net/enet.c) distributed as part of 4.3BSD, and code contributed 9 * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence 10 * Berkeley Laboratory. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)bpf.h 8.1 (Berkeley) 6/10/93 37 * @(#)bpf.h 1.34 (LBL) 6/16/96 38 * 39 * $FreeBSD$ 40 */ 41 42 #ifndef _NET_BPF_H_ 43 #define _NET_BPF_H_ 44 45 #include <sys/_eventhandler.h> 46 #include <sys/ck.h> 47 #include <net/dlt.h> 48 49 /* BSD style release date */ 50 #define BPF_RELEASE 199606 51 52 typedef int32_t bpf_int32; 53 typedef u_int32_t bpf_u_int32; 54 typedef int64_t bpf_int64; 55 typedef u_int64_t bpf_u_int64; 56 57 /* 58 * Alignment macros. BPF_WORDALIGN rounds up to the next 59 * even multiple of BPF_ALIGNMENT. 60 */ 61 #define BPF_ALIGNMENT sizeof(long) 62 #define BPF_WORDALIGN(x) (((x)+(BPF_ALIGNMENT-1))&~(BPF_ALIGNMENT-1)) 63 64 #define BPF_MAXINSNS 512 65 #define BPF_MAXBUFSIZE 0x80000 66 #define BPF_MINBUFSIZE 32 67 68 /* 69 * Structure for BIOCSETF. 70 */ 71 struct bpf_program { 72 u_int bf_len; 73 struct bpf_insn *bf_insns; 74 }; 75 76 /* 77 * Struct returned by BIOCGSTATS. 78 */ 79 struct bpf_stat { 80 u_int bs_recv; /* number of packets received */ 81 u_int bs_drop; /* number of packets dropped */ 82 }; 83 84 /* 85 * Struct return by BIOCVERSION. This represents the version number of 86 * the filter language described by the instruction encodings below. 87 * bpf understands a program iff kernel_major == filter_major && 88 * kernel_minor >= filter_minor, that is, if the value returned by the 89 * running kernel has the same major number and a minor number equal 90 * equal to or less than the filter being downloaded. Otherwise, the 91 * results are undefined, meaning an error may be returned or packets 92 * may be accepted haphazardly. 93 * It has nothing to do with the source code version. 94 */ 95 struct bpf_version { 96 u_short bv_major; 97 u_short bv_minor; 98 }; 99 /* Current version number of filter architecture. */ 100 #define BPF_MAJOR_VERSION 1 101 #define BPF_MINOR_VERSION 1 102 103 /* 104 * Historically, BPF has supported a single buffering model, first using mbuf 105 * clusters in kernel, and later using malloc(9) buffers in kernel. We now 106 * support multiple buffering modes, which may be queried and set using 107 * BIOCGETBUFMODE and BIOCSETBUFMODE. So as to avoid handling the complexity 108 * of changing modes while sniffing packets, the mode becomes fixed once an 109 * interface has been attached to the BPF descriptor. 110 */ 111 #define BPF_BUFMODE_BUFFER 1 /* Kernel buffers with read(). */ 112 #define BPF_BUFMODE_ZBUF 2 /* Zero-copy buffers. */ 113 114 /*- 115 * Struct used by BIOCSETZBUF, BIOCROTZBUF: describes up to two zero-copy 116 * buffer as used by BPF. 117 */ 118 struct bpf_zbuf { 119 void *bz_bufa; /* Location of 'a' zero-copy buffer. */ 120 void *bz_bufb; /* Location of 'b' zero-copy buffer. */ 121 size_t bz_buflen; /* Size of zero-copy buffers. */ 122 }; 123 124 #define BIOCGBLEN _IOR('B', 102, u_int) 125 #define BIOCSBLEN _IOWR('B', 102, u_int) 126 #define BIOCSETF _IOW('B', 103, struct bpf_program) 127 #define BIOCFLUSH _IO('B', 104) 128 #define BIOCPROMISC _IO('B', 105) 129 #define BIOCGDLT _IOR('B', 106, u_int) 130 #define BIOCGETIF _IOR('B', 107, struct ifreq) 131 #define BIOCSETIF _IOW('B', 108, struct ifreq) 132 #define BIOCSRTIMEOUT _IOW('B', 109, struct timeval) 133 #define BIOCGRTIMEOUT _IOR('B', 110, struct timeval) 134 #define BIOCGSTATS _IOR('B', 111, struct bpf_stat) 135 #define BIOCIMMEDIATE _IOW('B', 112, u_int) 136 #define BIOCVERSION _IOR('B', 113, struct bpf_version) 137 #define BIOCGRSIG _IOR('B', 114, u_int) 138 #define BIOCSRSIG _IOW('B', 115, u_int) 139 #define BIOCGHDRCMPLT _IOR('B', 116, u_int) 140 #define BIOCSHDRCMPLT _IOW('B', 117, u_int) 141 #define BIOCGDIRECTION _IOR('B', 118, u_int) 142 #define BIOCSDIRECTION _IOW('B', 119, u_int) 143 #define BIOCSDLT _IOW('B', 120, u_int) 144 #define BIOCGDLTLIST _IOWR('B', 121, struct bpf_dltlist) 145 #define BIOCLOCK _IO('B', 122) 146 #define BIOCSETWF _IOW('B', 123, struct bpf_program) 147 #define BIOCFEEDBACK _IOW('B', 124, u_int) 148 #define BIOCGETBUFMODE _IOR('B', 125, u_int) 149 #define BIOCSETBUFMODE _IOW('B', 126, u_int) 150 #define BIOCGETZMAX _IOR('B', 127, size_t) 151 #define BIOCROTZBUF _IOR('B', 128, struct bpf_zbuf) 152 #define BIOCSETZBUF _IOW('B', 129, struct bpf_zbuf) 153 #define BIOCSETFNR _IOW('B', 130, struct bpf_program) 154 #define BIOCGTSTAMP _IOR('B', 131, u_int) 155 #define BIOCSTSTAMP _IOW('B', 132, u_int) 156 #define BIOCSETVLANPCP _IOW('B', 133, u_int) 157 158 /* Obsolete */ 159 #define BIOCGSEESENT BIOCGDIRECTION 160 #define BIOCSSEESENT BIOCSDIRECTION 161 162 /* Packet directions */ 163 enum bpf_direction { 164 BPF_D_IN, /* See incoming packets */ 165 BPF_D_INOUT, /* See incoming and outgoing packets */ 166 BPF_D_OUT /* See outgoing packets */ 167 }; 168 169 /* Time stamping functions */ 170 #define BPF_T_MICROTIME 0x0000 171 #define BPF_T_NANOTIME 0x0001 172 #define BPF_T_BINTIME 0x0002 173 #define BPF_T_NONE 0x0003 174 #define BPF_T_FORMAT_MASK 0x0003 175 #define BPF_T_NORMAL 0x0000 176 #define BPF_T_FAST 0x0100 177 #define BPF_T_MONOTONIC 0x0200 178 #define BPF_T_MONOTONIC_FAST (BPF_T_FAST | BPF_T_MONOTONIC) 179 #define BPF_T_FLAG_MASK 0x0300 180 #define BPF_T_FORMAT(t) ((t) & BPF_T_FORMAT_MASK) 181 #define BPF_T_FLAG(t) ((t) & BPF_T_FLAG_MASK) 182 #define BPF_T_VALID(t) \ 183 ((t) == BPF_T_NONE || (BPF_T_FORMAT(t) != BPF_T_NONE && \ 184 ((t) & ~(BPF_T_FORMAT_MASK | BPF_T_FLAG_MASK)) == 0)) 185 186 #define BPF_T_MICROTIME_FAST (BPF_T_MICROTIME | BPF_T_FAST) 187 #define BPF_T_NANOTIME_FAST (BPF_T_NANOTIME | BPF_T_FAST) 188 #define BPF_T_BINTIME_FAST (BPF_T_BINTIME | BPF_T_FAST) 189 #define BPF_T_MICROTIME_MONOTONIC (BPF_T_MICROTIME | BPF_T_MONOTONIC) 190 #define BPF_T_NANOTIME_MONOTONIC (BPF_T_NANOTIME | BPF_T_MONOTONIC) 191 #define BPF_T_BINTIME_MONOTONIC (BPF_T_BINTIME | BPF_T_MONOTONIC) 192 #define BPF_T_MICROTIME_MONOTONIC_FAST (BPF_T_MICROTIME | BPF_T_MONOTONIC_FAST) 193 #define BPF_T_NANOTIME_MONOTONIC_FAST (BPF_T_NANOTIME | BPF_T_MONOTONIC_FAST) 194 #define BPF_T_BINTIME_MONOTONIC_FAST (BPF_T_BINTIME | BPF_T_MONOTONIC_FAST) 195 196 /* 197 * Structure prepended to each packet. 198 */ 199 struct bpf_ts { 200 bpf_int64 bt_sec; /* seconds */ 201 bpf_u_int64 bt_frac; /* fraction */ 202 }; 203 struct bpf_xhdr { 204 struct bpf_ts bh_tstamp; /* time stamp */ 205 bpf_u_int32 bh_caplen; /* length of captured portion */ 206 bpf_u_int32 bh_datalen; /* original length of packet */ 207 u_short bh_hdrlen; /* length of bpf header (this struct 208 plus alignment padding) */ 209 }; 210 /* Obsolete */ 211 struct bpf_hdr { 212 struct timeval bh_tstamp; /* time stamp */ 213 bpf_u_int32 bh_caplen; /* length of captured portion */ 214 bpf_u_int32 bh_datalen; /* original length of packet */ 215 u_short bh_hdrlen; /* length of bpf header (this struct 216 plus alignment padding) */ 217 }; 218 #ifdef _KERNEL 219 #define MTAG_BPF 0x627066 220 #define MTAG_BPF_TIMESTAMP 0 221 #endif 222 223 /* 224 * When using zero-copy BPF buffers, a shared memory header is present 225 * allowing the kernel BPF implementation and user process to synchronize 226 * without using system calls. This structure defines that header. When 227 * accessing these fields, appropriate atomic operation and memory barriers 228 * are required in order not to see stale or out-of-order data; see bpf(4) 229 * for reference code to access these fields from userspace. 230 * 231 * The layout of this structure is critical, and must not be changed; if must 232 * fit in a single page on all architectures. 233 */ 234 struct bpf_zbuf_header { 235 volatile u_int bzh_kernel_gen; /* Kernel generation number. */ 236 volatile u_int bzh_kernel_len; /* Length of data in the buffer. */ 237 volatile u_int bzh_user_gen; /* User generation number. */ 238 u_int _bzh_pad[5]; 239 }; 240 241 /* 242 * The instruction encodings. 243 * 244 * Please inform tcpdump-workers@lists.tcpdump.org if you use any 245 * of the reserved values, so that we can note that they're used 246 * (and perhaps implement it in the reference BPF implementation 247 * and encourage its implementation elsewhere). 248 */ 249 250 /* 251 * The upper 8 bits of the opcode aren't used. BSD/OS used 0x8000. 252 */ 253 254 /* instruction classes */ 255 #define BPF_CLASS(code) ((code) & 0x07) 256 #define BPF_LD 0x00 257 #define BPF_LDX 0x01 258 #define BPF_ST 0x02 259 #define BPF_STX 0x03 260 #define BPF_ALU 0x04 261 #define BPF_JMP 0x05 262 #define BPF_RET 0x06 263 #define BPF_MISC 0x07 264 265 /* ld/ldx fields */ 266 #define BPF_SIZE(code) ((code) & 0x18) 267 #define BPF_W 0x00 268 #define BPF_H 0x08 269 #define BPF_B 0x10 270 /* 0x18 reserved; used by BSD/OS */ 271 #define BPF_MODE(code) ((code) & 0xe0) 272 #define BPF_IMM 0x00 273 #define BPF_ABS 0x20 274 #define BPF_IND 0x40 275 #define BPF_MEM 0x60 276 #define BPF_LEN 0x80 277 #define BPF_MSH 0xa0 278 /* 0xc0 reserved; used by BSD/OS */ 279 /* 0xe0 reserved; used by BSD/OS */ 280 281 /* alu/jmp fields */ 282 #define BPF_OP(code) ((code) & 0xf0) 283 #define BPF_ADD 0x00 284 #define BPF_SUB 0x10 285 #define BPF_MUL 0x20 286 #define BPF_DIV 0x30 287 #define BPF_OR 0x40 288 #define BPF_AND 0x50 289 #define BPF_LSH 0x60 290 #define BPF_RSH 0x70 291 #define BPF_NEG 0x80 292 #define BPF_MOD 0x90 293 #define BPF_XOR 0xa0 294 /* 0xb0 reserved */ 295 /* 0xc0 reserved */ 296 /* 0xd0 reserved */ 297 /* 0xe0 reserved */ 298 /* 0xf0 reserved */ 299 300 #define BPF_JA 0x00 301 #define BPF_JEQ 0x10 302 #define BPF_JGT 0x20 303 #define BPF_JGE 0x30 304 #define BPF_JSET 0x40 305 /* 0x50 reserved; used on BSD/OS */ 306 /* 0x60 reserved */ 307 /* 0x70 reserved */ 308 /* 0x80 reserved */ 309 /* 0x90 reserved */ 310 /* 0xa0 reserved */ 311 /* 0xb0 reserved */ 312 /* 0xc0 reserved */ 313 /* 0xd0 reserved */ 314 /* 0xe0 reserved */ 315 /* 0xf0 reserved */ 316 #define BPF_SRC(code) ((code) & 0x08) 317 #define BPF_K 0x00 318 #define BPF_X 0x08 319 320 /* ret - BPF_K and BPF_X also apply */ 321 #define BPF_RVAL(code) ((code) & 0x18) 322 #define BPF_A 0x10 323 /* 0x18 reserved */ 324 325 /* misc */ 326 #define BPF_MISCOP(code) ((code) & 0xf8) 327 #define BPF_TAX 0x00 328 /* 0x08 reserved */ 329 /* 0x10 reserved */ 330 /* 0x18 reserved */ 331 /* #define BPF_COP 0x20 NetBSD "coprocessor" extensions */ 332 /* 0x28 reserved */ 333 /* 0x30 reserved */ 334 /* 0x38 reserved */ 335 /* #define BPF_COPX 0x40 NetBSD "coprocessor" extensions */ 336 /* also used on BSD/OS */ 337 /* 0x48 reserved */ 338 /* 0x50 reserved */ 339 /* 0x58 reserved */ 340 /* 0x60 reserved */ 341 /* 0x68 reserved */ 342 /* 0x70 reserved */ 343 /* 0x78 reserved */ 344 #define BPF_TXA 0x80 345 /* 0x88 reserved */ 346 /* 0x90 reserved */ 347 /* 0x98 reserved */ 348 /* 0xa0 reserved */ 349 /* 0xa8 reserved */ 350 /* 0xb0 reserved */ 351 /* 0xb8 reserved */ 352 /* 0xc0 reserved; used on BSD/OS */ 353 /* 0xc8 reserved */ 354 /* 0xd0 reserved */ 355 /* 0xd8 reserved */ 356 /* 0xe0 reserved */ 357 /* 0xe8 reserved */ 358 /* 0xf0 reserved */ 359 /* 0xf8 reserved */ 360 361 /* 362 * The instruction data structure. 363 */ 364 struct bpf_insn { 365 u_short code; 366 u_char jt; 367 u_char jf; 368 bpf_u_int32 k; 369 }; 370 371 /* 372 * Macros for insn array initializers. 373 */ 374 #define BPF_STMT(code, k) { (u_short)(code), 0, 0, k } 375 #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k } 376 377 /* 378 * Structure to retrieve available DLTs for the interface. 379 */ 380 struct bpf_dltlist { 381 u_int bfl_len; /* number of bfd_list array */ 382 u_int *bfl_list; /* array of DLTs */ 383 }; 384 385 #ifdef _KERNEL 386 #ifdef MALLOC_DECLARE 387 MALLOC_DECLARE(M_BPF); 388 #endif 389 #ifdef SYSCTL_DECL 390 SYSCTL_DECL(_net_bpf); 391 #endif 392 393 /* 394 * Rotate the packet buffers in descriptor d. Move the store buffer into the 395 * hold slot, and the free buffer into the store slot. Zero the length of the 396 * new store buffer. Descriptor lock should be held. One must be careful to 397 * not rotate the buffers twice, i.e. if fbuf != NULL. 398 */ 399 #define ROTATE_BUFFERS(d) do { \ 400 (d)->bd_hbuf = (d)->bd_sbuf; \ 401 (d)->bd_hlen = (d)->bd_slen; \ 402 (d)->bd_sbuf = (d)->bd_fbuf; \ 403 (d)->bd_slen = 0; \ 404 (d)->bd_fbuf = NULL; \ 405 bpf_bufheld(d); \ 406 } while (0) 407 408 /* 409 * Descriptor associated with each attached hardware interface. 410 * Part of this structure is exposed to external callers to speed up 411 * bpf_peers_present() calls. 412 */ 413 struct bpf_if; 414 CK_LIST_HEAD(bpfd_list, bpf_d); 415 416 struct bpf_if_ext { 417 CK_LIST_ENTRY(bpf_if) bif_next; /* list of all interfaces */ 418 struct bpfd_list bif_dlist; /* descriptor list */ 419 }; 420 421 void bpf_bufheld(struct bpf_d *d); 422 int bpf_validate(const struct bpf_insn *, int); 423 void bpf_tap(struct bpf_if *, u_char *, u_int); 424 void bpf_mtap(struct bpf_if *, struct mbuf *); 425 void bpf_mtap2(struct bpf_if *, void *, u_int, struct mbuf *); 426 void bpfattach(struct ifnet *, u_int, u_int); 427 void bpfattach2(struct ifnet *, u_int, u_int, struct bpf_if **); 428 void bpfdetach(struct ifnet *); 429 #ifdef VIMAGE 430 int bpf_get_bp_params(struct bpf_if *, u_int *, u_int *); 431 #endif 432 433 void bpfilterattach(int); 434 u_int bpf_filter(const struct bpf_insn *, u_char *, u_int, u_int); 435 436 static __inline int 437 bpf_peers_present(struct bpf_if *bpf) 438 { 439 struct bpf_if_ext *ext; 440 441 ext = (struct bpf_if_ext *)bpf; 442 if (!CK_LIST_EMPTY(&ext->bif_dlist)) 443 return (1); 444 return (0); 445 } 446 447 #define BPF_TAP(_ifp,_pkt,_pktlen) do { \ 448 if (bpf_peers_present((_ifp)->if_bpf)) \ 449 bpf_tap((_ifp)->if_bpf, (_pkt), (_pktlen)); \ 450 } while (0) 451 #define BPF_MTAP(_ifp,_m) do { \ 452 if (bpf_peers_present((_ifp)->if_bpf)) { \ 453 M_ASSERTVALID(_m); \ 454 bpf_mtap((_ifp)->if_bpf, (_m)); \ 455 } \ 456 } while (0) 457 #define BPF_MTAP2(_ifp,_data,_dlen,_m) do { \ 458 if (bpf_peers_present((_ifp)->if_bpf)) { \ 459 M_ASSERTVALID(_m); \ 460 bpf_mtap2((_ifp)->if_bpf,(_data),(_dlen),(_m)); \ 461 } \ 462 } while (0) 463 #endif 464 465 /* 466 * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST). 467 */ 468 #define BPF_MEMWORDS 16 469 470 /* BPF attach/detach events */ 471 struct ifnet; 472 typedef void (*bpf_track_fn)(void *, struct ifnet *, int /* dlt */, 473 int /* 1 =>'s attach */); 474 EVENTHANDLER_DECLARE(bpf_track, bpf_track_fn); 475 476 #endif /* _NET_BPF_H_ */ 477