1c398230bSWarner Losh /*- 2df8bae1dSRodney W. Grimes * Copyright (c) 1990, 1991, 1993 3253a3814SLawrence Stewart * The Regents of the University of California. All rights reserved. 4df8bae1dSRodney W. Grimes * 5df8bae1dSRodney W. Grimes * This code is derived from the Stanford/CMU enet packet filter, 6df8bae1dSRodney W. Grimes * (net/enet.c) distributed as part of 4.3BSD, and code contributed 7df8bae1dSRodney W. Grimes * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence 8df8bae1dSRodney W. Grimes * Berkeley Laboratory. 9df8bae1dSRodney W. Grimes * 10df8bae1dSRodney W. Grimes * Redistribution and use in source and binary forms, with or without 11df8bae1dSRodney W. Grimes * modification, are permitted provided that the following conditions 12df8bae1dSRodney W. Grimes * are met: 13df8bae1dSRodney W. Grimes * 1. Redistributions of source code must retain the above copyright 14df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer. 15df8bae1dSRodney W. Grimes * 2. Redistributions in binary form must reproduce the above copyright 16df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer in the 17df8bae1dSRodney W. Grimes * documentation and/or other materials provided with the distribution. 18*fbbd9655SWarner Losh * 3. Neither the name of the University nor the names of its contributors 19df8bae1dSRodney W. Grimes * may be used to endorse or promote products derived from this software 20df8bae1dSRodney W. Grimes * without specific prior written permission. 21df8bae1dSRodney W. Grimes * 22df8bae1dSRodney W. Grimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23df8bae1dSRodney W. Grimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24df8bae1dSRodney W. Grimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25df8bae1dSRodney W. Grimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26df8bae1dSRodney W. Grimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27df8bae1dSRodney W. Grimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28df8bae1dSRodney W. Grimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29df8bae1dSRodney W. Grimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30df8bae1dSRodney W. Grimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31df8bae1dSRodney W. Grimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32df8bae1dSRodney W. Grimes * SUCH DAMAGE. 33df8bae1dSRodney W. Grimes * 34df8bae1dSRodney W. Grimes * @(#)bpf.h 8.1 (Berkeley) 6/10/93 3511a53ef3SPaul Traina * @(#)bpf.h 1.34 (LBL) 6/16/96 36df8bae1dSRodney W. Grimes * 37c3aac50fSPeter Wemm * $FreeBSD$ 38df8bae1dSRodney W. Grimes */ 39df8bae1dSRodney W. Grimes 40cea1da3bSPaul Richards #ifndef _NET_BPF_H_ 41cea1da3bSPaul Richards #define _NET_BPF_H_ 42cea1da3bSPaul Richards 4311a53ef3SPaul Traina /* BSD style release date */ 4411a53ef3SPaul Traina #define BPF_RELEASE 199606 4511a53ef3SPaul Traina 4611a53ef3SPaul Traina typedef int32_t bpf_int32; 4711a53ef3SPaul Traina typedef u_int32_t bpf_u_int32; 48547d94bdSJung-uk Kim typedef int64_t bpf_int64; 49547d94bdSJung-uk Kim typedef u_int64_t bpf_u_int64; 5011a53ef3SPaul Traina 51df8bae1dSRodney W. Grimes /* 52df8bae1dSRodney W. Grimes * Alignment macros. BPF_WORDALIGN rounds up to the next 53df8bae1dSRodney W. Grimes * even multiple of BPF_ALIGNMENT. 54df8bae1dSRodney W. Grimes */ 55ba136d4fSAlexander Langer #define BPF_ALIGNMENT sizeof(long) 56df8bae1dSRodney W. Grimes #define BPF_WORDALIGN(x) (((x)+(BPF_ALIGNMENT-1))&~(BPF_ALIGNMENT-1)) 57df8bae1dSRodney W. Grimes 58df8bae1dSRodney W. Grimes #define BPF_MAXINSNS 512 59eba2a1aeSPoul-Henning Kamp #define BPF_MAXBUFSIZE 0x80000 60df8bae1dSRodney W. Grimes #define BPF_MINBUFSIZE 32 61df8bae1dSRodney W. Grimes 62df8bae1dSRodney W. Grimes /* 63df8bae1dSRodney W. Grimes * Structure for BIOCSETF. 64df8bae1dSRodney W. Grimes */ 65df8bae1dSRodney W. Grimes struct bpf_program { 66df8bae1dSRodney W. Grimes u_int bf_len; 67df8bae1dSRodney W. Grimes struct bpf_insn *bf_insns; 68df8bae1dSRodney W. Grimes }; 69df8bae1dSRodney W. Grimes 70df8bae1dSRodney W. Grimes /* 71df8bae1dSRodney W. Grimes * Struct returned by BIOCGSTATS. 72df8bae1dSRodney W. Grimes */ 73df8bae1dSRodney W. Grimes struct bpf_stat { 74df8bae1dSRodney W. Grimes u_int bs_recv; /* number of packets received */ 75df8bae1dSRodney W. Grimes u_int bs_drop; /* number of packets dropped */ 76df8bae1dSRodney W. Grimes }; 77df8bae1dSRodney W. Grimes 78df8bae1dSRodney W. Grimes /* 79df8bae1dSRodney W. Grimes * Struct return by BIOCVERSION. This represents the version number of 80df8bae1dSRodney W. Grimes * the filter language described by the instruction encodings below. 81df8bae1dSRodney W. Grimes * bpf understands a program iff kernel_major == filter_major && 82df8bae1dSRodney W. Grimes * kernel_minor >= filter_minor, that is, if the value returned by the 83df8bae1dSRodney W. Grimes * running kernel has the same major number and a minor number equal 84df8bae1dSRodney W. Grimes * equal to or less than the filter being downloaded. Otherwise, the 85df8bae1dSRodney W. Grimes * results are undefined, meaning an error may be returned or packets 86df8bae1dSRodney W. Grimes * may be accepted haphazardly. 87df8bae1dSRodney W. Grimes * It has nothing to do with the source code version. 88df8bae1dSRodney W. Grimes */ 89df8bae1dSRodney W. Grimes struct bpf_version { 90df8bae1dSRodney W. Grimes u_short bv_major; 91df8bae1dSRodney W. Grimes u_short bv_minor; 92df8bae1dSRodney W. Grimes }; 9311a53ef3SPaul Traina /* Current version number of filter architecture. */ 94df8bae1dSRodney W. Grimes #define BPF_MAJOR_VERSION 1 95df8bae1dSRodney W. Grimes #define BPF_MINOR_VERSION 1 96df8bae1dSRodney W. Grimes 974d621040SChristian S.J. Peron /* 984d621040SChristian S.J. Peron * Historically, BPF has supported a single buffering model, first using mbuf 994d621040SChristian S.J. Peron * clusters in kernel, and later using malloc(9) buffers in kernel. We now 1004d621040SChristian S.J. Peron * support multiple buffering modes, which may be queried and set using 1014d621040SChristian S.J. Peron * BIOCGETBUFMODE and BIOCSETBUFMODE. So as to avoid handling the complexity 1024d621040SChristian S.J. Peron * of changing modes while sniffing packets, the mode becomes fixed once an 1034d621040SChristian S.J. Peron * interface has been attached to the BPF descriptor. 1044d621040SChristian S.J. Peron */ 1054d621040SChristian S.J. Peron #define BPF_BUFMODE_BUFFER 1 /* Kernel buffers with read(). */ 1064d621040SChristian S.J. Peron #define BPF_BUFMODE_ZBUF 2 /* Zero-copy buffers. */ 1074d621040SChristian S.J. Peron 1084d621040SChristian S.J. Peron /*- 1094d621040SChristian S.J. Peron * Struct used by BIOCSETZBUF, BIOCROTZBUF: describes up to two zero-copy 1104d621040SChristian S.J. Peron * buffer as used by BPF. 1114d621040SChristian S.J. Peron */ 1124d621040SChristian S.J. Peron struct bpf_zbuf { 1134d621040SChristian S.J. Peron void *bz_bufa; /* Location of 'a' zero-copy buffer. */ 1144d621040SChristian S.J. Peron void *bz_bufb; /* Location of 'b' zero-copy buffer. */ 1154d621040SChristian S.J. Peron size_t bz_buflen; /* Size of zero-copy buffers. */ 1164d621040SChristian S.J. Peron }; 1174d621040SChristian S.J. Peron 118df8bae1dSRodney W. Grimes #define BIOCGBLEN _IOR('B', 102, u_int) 119df8bae1dSRodney W. Grimes #define BIOCSBLEN _IOWR('B', 102, u_int) 120df8bae1dSRodney W. Grimes #define BIOCSETF _IOW('B', 103, struct bpf_program) 121df8bae1dSRodney W. Grimes #define BIOCFLUSH _IO('B', 104) 122df8bae1dSRodney W. Grimes #define BIOCPROMISC _IO('B', 105) 123df8bae1dSRodney W. Grimes #define BIOCGDLT _IOR('B', 106, u_int) 124df8bae1dSRodney W. Grimes #define BIOCGETIF _IOR('B', 107, struct ifreq) 125df8bae1dSRodney W. Grimes #define BIOCSETIF _IOW('B', 108, struct ifreq) 126df8bae1dSRodney W. Grimes #define BIOCSRTIMEOUT _IOW('B', 109, struct timeval) 127df8bae1dSRodney W. Grimes #define BIOCGRTIMEOUT _IOR('B', 110, struct timeval) 128df8bae1dSRodney W. Grimes #define BIOCGSTATS _IOR('B', 111, struct bpf_stat) 129df8bae1dSRodney W. Grimes #define BIOCIMMEDIATE _IOW('B', 112, u_int) 130df8bae1dSRodney W. Grimes #define BIOCVERSION _IOR('B', 113, struct bpf_version) 13100a83887SPaul Traina #define BIOCGRSIG _IOR('B', 114, u_int) 13200a83887SPaul Traina #define BIOCSRSIG _IOW('B', 115, u_int) 133114ae644SMike Smith #define BIOCGHDRCMPLT _IOR('B', 116, u_int) 134114ae644SMike Smith #define BIOCSHDRCMPLT _IOW('B', 117, u_int) 135560a54e1SJung-uk Kim #define BIOCGDIRECTION _IOR('B', 118, u_int) 136560a54e1SJung-uk Kim #define BIOCSDIRECTION _IOW('B', 119, u_int) 1378eab61f3SSam Leffler #define BIOCSDLT _IOW('B', 120, u_int) 1388eab61f3SSam Leffler #define BIOCGDLTLIST _IOWR('B', 121, struct bpf_dltlist) 13993e39f0bSChristian S.J. Peron #define BIOCLOCK _IO('B', 122) 14093e39f0bSChristian S.J. Peron #define BIOCSETWF _IOW('B', 123, struct bpf_program) 141560a54e1SJung-uk Kim #define BIOCFEEDBACK _IOW('B', 124, u_int) 1424d621040SChristian S.J. Peron #define BIOCGETBUFMODE _IOR('B', 125, u_int) 1434d621040SChristian S.J. Peron #define BIOCSETBUFMODE _IOW('B', 126, u_int) 1444d621040SChristian S.J. Peron #define BIOCGETZMAX _IOR('B', 127, size_t) 1454d621040SChristian S.J. Peron #define BIOCROTZBUF _IOR('B', 128, struct bpf_zbuf) 1464d621040SChristian S.J. Peron #define BIOCSETZBUF _IOW('B', 129, struct bpf_zbuf) 147f11c3508SDavid Malone #define BIOCSETFNR _IOW('B', 130, struct bpf_program) 148547d94bdSJung-uk Kim #define BIOCGTSTAMP _IOR('B', 131, u_int) 149547d94bdSJung-uk Kim #define BIOCSTSTAMP _IOW('B', 132, u_int) 150560a54e1SJung-uk Kim 151560a54e1SJung-uk Kim /* Obsolete */ 152560a54e1SJung-uk Kim #define BIOCGSEESENT BIOCGDIRECTION 153560a54e1SJung-uk Kim #define BIOCSSEESENT BIOCSDIRECTION 154560a54e1SJung-uk Kim 155560a54e1SJung-uk Kim /* Packet directions */ 156560a54e1SJung-uk Kim enum bpf_direction { 157560a54e1SJung-uk Kim BPF_D_IN, /* See incoming packets */ 158560a54e1SJung-uk Kim BPF_D_INOUT, /* See incoming and outgoing packets */ 159560a54e1SJung-uk Kim BPF_D_OUT /* See outgoing packets */ 160560a54e1SJung-uk Kim }; 161df8bae1dSRodney W. Grimes 162547d94bdSJung-uk Kim /* Time stamping functions */ 163547d94bdSJung-uk Kim #define BPF_T_MICROTIME 0x0000 164547d94bdSJung-uk Kim #define BPF_T_NANOTIME 0x0001 165547d94bdSJung-uk Kim #define BPF_T_BINTIME 0x0002 166547d94bdSJung-uk Kim #define BPF_T_NONE 0x0003 167547d94bdSJung-uk Kim #define BPF_T_FORMAT_MASK 0x0003 168547d94bdSJung-uk Kim #define BPF_T_NORMAL 0x0000 169253a3814SLawrence Stewart #define BPF_T_FAST 0x0100 170253a3814SLawrence Stewart #define BPF_T_MONOTONIC 0x0200 171253a3814SLawrence Stewart #define BPF_T_MONOTONIC_FAST (BPF_T_FAST | BPF_T_MONOTONIC) 172253a3814SLawrence Stewart #define BPF_T_FLAG_MASK 0x0300 173547d94bdSJung-uk Kim #define BPF_T_FORMAT(t) ((t) & BPF_T_FORMAT_MASK) 174547d94bdSJung-uk Kim #define BPF_T_FLAG(t) ((t) & BPF_T_FLAG_MASK) 175547d94bdSJung-uk Kim #define BPF_T_VALID(t) \ 176547d94bdSJung-uk Kim ((t) == BPF_T_NONE || (BPF_T_FORMAT(t) != BPF_T_NONE && \ 177547d94bdSJung-uk Kim ((t) & ~(BPF_T_FORMAT_MASK | BPF_T_FLAG_MASK)) == 0)) 178547d94bdSJung-uk Kim 179253a3814SLawrence Stewart #define BPF_T_MICROTIME_FAST (BPF_T_MICROTIME | BPF_T_FAST) 180253a3814SLawrence Stewart #define BPF_T_NANOTIME_FAST (BPF_T_NANOTIME | BPF_T_FAST) 181253a3814SLawrence Stewart #define BPF_T_BINTIME_FAST (BPF_T_BINTIME | BPF_T_FAST) 182547d94bdSJung-uk Kim #define BPF_T_MICROTIME_MONOTONIC (BPF_T_MICROTIME | BPF_T_MONOTONIC) 183547d94bdSJung-uk Kim #define BPF_T_NANOTIME_MONOTONIC (BPF_T_NANOTIME | BPF_T_MONOTONIC) 184547d94bdSJung-uk Kim #define BPF_T_BINTIME_MONOTONIC (BPF_T_BINTIME | BPF_T_MONOTONIC) 185253a3814SLawrence Stewart #define BPF_T_MICROTIME_MONOTONIC_FAST (BPF_T_MICROTIME | BPF_T_MONOTONIC_FAST) 186253a3814SLawrence Stewart #define BPF_T_NANOTIME_MONOTONIC_FAST (BPF_T_NANOTIME | BPF_T_MONOTONIC_FAST) 187253a3814SLawrence Stewart #define BPF_T_BINTIME_MONOTONIC_FAST (BPF_T_BINTIME | BPF_T_MONOTONIC_FAST) 188547d94bdSJung-uk Kim 189df8bae1dSRodney W. Grimes /* 190df8bae1dSRodney W. Grimes * Structure prepended to each packet. 191df8bae1dSRodney W. Grimes */ 192547d94bdSJung-uk Kim struct bpf_ts { 193547d94bdSJung-uk Kim bpf_int64 bt_sec; /* seconds */ 194547d94bdSJung-uk Kim bpf_u_int64 bt_frac; /* fraction */ 195547d94bdSJung-uk Kim }; 196547d94bdSJung-uk Kim struct bpf_xhdr { 197547d94bdSJung-uk Kim struct bpf_ts bh_tstamp; /* time stamp */ 198547d94bdSJung-uk Kim bpf_u_int32 bh_caplen; /* length of captured portion */ 199547d94bdSJung-uk Kim bpf_u_int32 bh_datalen; /* original length of packet */ 200547d94bdSJung-uk Kim u_short bh_hdrlen; /* length of bpf header (this struct 201547d94bdSJung-uk Kim plus alignment padding) */ 202547d94bdSJung-uk Kim }; 203547d94bdSJung-uk Kim /* Obsolete */ 204df8bae1dSRodney W. Grimes struct bpf_hdr { 205df8bae1dSRodney W. Grimes struct timeval bh_tstamp; /* time stamp */ 20611a53ef3SPaul Traina bpf_u_int32 bh_caplen; /* length of captured portion */ 20711a53ef3SPaul Traina bpf_u_int32 bh_datalen; /* original length of packet */ 208df8bae1dSRodney W. Grimes u_short bh_hdrlen; /* length of bpf header (this struct 209df8bae1dSRodney W. Grimes plus alignment padding) */ 210df8bae1dSRodney W. Grimes }; 211664a31e4SPeter Wemm #ifdef _KERNEL 212547d94bdSJung-uk Kim #define MTAG_BPF 0x627066 213547d94bdSJung-uk Kim #define MTAG_BPF_TIMESTAMP 0 214df8bae1dSRodney W. Grimes #endif 215df8bae1dSRodney W. Grimes 216df8bae1dSRodney W. Grimes /* 2174d621040SChristian S.J. Peron * When using zero-copy BPF buffers, a shared memory header is present 2184d621040SChristian S.J. Peron * allowing the kernel BPF implementation and user process to synchronize 2194d621040SChristian S.J. Peron * without using system calls. This structure defines that header. When 2204d621040SChristian S.J. Peron * accessing these fields, appropriate atomic operation and memory barriers 2214d621040SChristian S.J. Peron * are required in order not to see stale or out-of-order data; see bpf(4) 2224d621040SChristian S.J. Peron * for reference code to access these fields from userspace. 2234d621040SChristian S.J. Peron * 2244d621040SChristian S.J. Peron * The layout of this structure is critical, and must not be changed; if must 2254d621040SChristian S.J. Peron * fit in a single page on all architectures. 2264d621040SChristian S.J. Peron */ 2274d621040SChristian S.J. Peron struct bpf_zbuf_header { 2284d621040SChristian S.J. Peron volatile u_int bzh_kernel_gen; /* Kernel generation number. */ 2294d621040SChristian S.J. Peron volatile u_int bzh_kernel_len; /* Length of data in the buffer. */ 2304d621040SChristian S.J. Peron volatile u_int bzh_user_gen; /* User generation number. */ 2314d621040SChristian S.J. Peron u_int _bzh_pad[5]; 2324d621040SChristian S.J. Peron }; 2334d621040SChristian S.J. Peron 234ada6f083SXin LI /* Pull in data-link level type codes. */ 235ada6f083SXin LI #include <net/dlt.h> 236dcf377edSRui Paulo 237dcf377edSRui Paulo /* 2386c5e9bbdSMike Pritchard * The instruction encodings. 239681ed54cSXin LI * 240681ed54cSXin LI * Please inform tcpdump-workers@lists.tcpdump.org if you use any 241681ed54cSXin LI * of the reserved values, so that we can note that they're used 242681ed54cSXin LI * (and perhaps implement it in the reference BPF implementation 243681ed54cSXin LI * and encourage its implementation elsewhere). 244df8bae1dSRodney W. Grimes */ 245681ed54cSXin LI 246681ed54cSXin LI /* 247681ed54cSXin LI * The upper 8 bits of the opcode aren't used. BSD/OS used 0x8000. 248681ed54cSXin LI */ 249681ed54cSXin LI 250df8bae1dSRodney W. Grimes /* instruction classes */ 251df8bae1dSRodney W. Grimes #define BPF_CLASS(code) ((code) & 0x07) 252df8bae1dSRodney W. Grimes #define BPF_LD 0x00 253df8bae1dSRodney W. Grimes #define BPF_LDX 0x01 254df8bae1dSRodney W. Grimes #define BPF_ST 0x02 255df8bae1dSRodney W. Grimes #define BPF_STX 0x03 256df8bae1dSRodney W. Grimes #define BPF_ALU 0x04 257df8bae1dSRodney W. Grimes #define BPF_JMP 0x05 258df8bae1dSRodney W. Grimes #define BPF_RET 0x06 259df8bae1dSRodney W. Grimes #define BPF_MISC 0x07 260df8bae1dSRodney W. Grimes 261df8bae1dSRodney W. Grimes /* ld/ldx fields */ 262df8bae1dSRodney W. Grimes #define BPF_SIZE(code) ((code) & 0x18) 263df8bae1dSRodney W. Grimes #define BPF_W 0x00 264df8bae1dSRodney W. Grimes #define BPF_H 0x08 265df8bae1dSRodney W. Grimes #define BPF_B 0x10 266681ed54cSXin LI /* 0x18 reserved; used by BSD/OS */ 267df8bae1dSRodney W. Grimes #define BPF_MODE(code) ((code) & 0xe0) 268df8bae1dSRodney W. Grimes #define BPF_IMM 0x00 269df8bae1dSRodney W. Grimes #define BPF_ABS 0x20 270df8bae1dSRodney W. Grimes #define BPF_IND 0x40 271df8bae1dSRodney W. Grimes #define BPF_MEM 0x60 272df8bae1dSRodney W. Grimes #define BPF_LEN 0x80 273df8bae1dSRodney W. Grimes #define BPF_MSH 0xa0 274681ed54cSXin LI /* 0xc0 reserved; used by BSD/OS */ 275681ed54cSXin LI /* 0xe0 reserved; used by BSD/OS */ 276df8bae1dSRodney W. Grimes 277df8bae1dSRodney W. Grimes /* alu/jmp fields */ 278df8bae1dSRodney W. Grimes #define BPF_OP(code) ((code) & 0xf0) 279df8bae1dSRodney W. Grimes #define BPF_ADD 0x00 280df8bae1dSRodney W. Grimes #define BPF_SUB 0x10 281df8bae1dSRodney W. Grimes #define BPF_MUL 0x20 282df8bae1dSRodney W. Grimes #define BPF_DIV 0x30 283df8bae1dSRodney W. Grimes #define BPF_OR 0x40 284df8bae1dSRodney W. Grimes #define BPF_AND 0x50 285df8bae1dSRodney W. Grimes #define BPF_LSH 0x60 286df8bae1dSRodney W. Grimes #define BPF_RSH 0x70 287df8bae1dSRodney W. Grimes #define BPF_NEG 0x80 288681ed54cSXin LI #define BPF_MOD 0x90 289681ed54cSXin LI #define BPF_XOR 0xa0 290681ed54cSXin LI /* 0xb0 reserved */ 291681ed54cSXin LI /* 0xc0 reserved */ 292681ed54cSXin LI /* 0xd0 reserved */ 293681ed54cSXin LI /* 0xe0 reserved */ 294681ed54cSXin LI /* 0xf0 reserved */ 295681ed54cSXin LI 296df8bae1dSRodney W. Grimes #define BPF_JA 0x00 297df8bae1dSRodney W. Grimes #define BPF_JEQ 0x10 298df8bae1dSRodney W. Grimes #define BPF_JGT 0x20 299df8bae1dSRodney W. Grimes #define BPF_JGE 0x30 300df8bae1dSRodney W. Grimes #define BPF_JSET 0x40 301681ed54cSXin LI /* 0x50 reserved; used on BSD/OS */ 302681ed54cSXin LI /* 0x60 reserved */ 303681ed54cSXin LI /* 0x70 reserved */ 304681ed54cSXin LI /* 0x80 reserved */ 305681ed54cSXin LI /* 0x90 reserved */ 306681ed54cSXin LI /* 0xa0 reserved */ 307681ed54cSXin LI /* 0xb0 reserved */ 308681ed54cSXin LI /* 0xc0 reserved */ 309681ed54cSXin LI /* 0xd0 reserved */ 310681ed54cSXin LI /* 0xe0 reserved */ 311681ed54cSXin LI /* 0xf0 reserved */ 312df8bae1dSRodney W. Grimes #define BPF_SRC(code) ((code) & 0x08) 313df8bae1dSRodney W. Grimes #define BPF_K 0x00 314df8bae1dSRodney W. Grimes #define BPF_X 0x08 315df8bae1dSRodney W. Grimes 316df8bae1dSRodney W. Grimes /* ret - BPF_K and BPF_X also apply */ 317df8bae1dSRodney W. Grimes #define BPF_RVAL(code) ((code) & 0x18) 318df8bae1dSRodney W. Grimes #define BPF_A 0x10 319681ed54cSXin LI /* 0x18 reserved */ 320df8bae1dSRodney W. Grimes 321df8bae1dSRodney W. Grimes /* misc */ 322df8bae1dSRodney W. Grimes #define BPF_MISCOP(code) ((code) & 0xf8) 323df8bae1dSRodney W. Grimes #define BPF_TAX 0x00 324681ed54cSXin LI /* 0x08 reserved */ 325681ed54cSXin LI /* 0x10 reserved */ 326681ed54cSXin LI /* 0x18 reserved */ 327681ed54cSXin LI /* #define BPF_COP 0x20 NetBSD "coprocessor" extensions */ 328681ed54cSXin LI /* 0x28 reserved */ 329681ed54cSXin LI /* 0x30 reserved */ 330681ed54cSXin LI /* 0x38 reserved */ 331681ed54cSXin LI /* #define BPF_COPX 0x40 NetBSD "coprocessor" extensions */ 332681ed54cSXin LI /* also used on BSD/OS */ 333681ed54cSXin LI /* 0x48 reserved */ 334681ed54cSXin LI /* 0x50 reserved */ 335681ed54cSXin LI /* 0x58 reserved */ 336681ed54cSXin LI /* 0x60 reserved */ 337681ed54cSXin LI /* 0x68 reserved */ 338681ed54cSXin LI /* 0x70 reserved */ 339681ed54cSXin LI /* 0x78 reserved */ 340df8bae1dSRodney W. Grimes #define BPF_TXA 0x80 341681ed54cSXin LI /* 0x88 reserved */ 342681ed54cSXin LI /* 0x90 reserved */ 343681ed54cSXin LI /* 0x98 reserved */ 344681ed54cSXin LI /* 0xa0 reserved */ 345681ed54cSXin LI /* 0xa8 reserved */ 346681ed54cSXin LI /* 0xb0 reserved */ 347681ed54cSXin LI /* 0xb8 reserved */ 348681ed54cSXin LI /* 0xc0 reserved; used on BSD/OS */ 349681ed54cSXin LI /* 0xc8 reserved */ 350681ed54cSXin LI /* 0xd0 reserved */ 351681ed54cSXin LI /* 0xd8 reserved */ 352681ed54cSXin LI /* 0xe0 reserved */ 353681ed54cSXin LI /* 0xe8 reserved */ 354681ed54cSXin LI /* 0xf0 reserved */ 355681ed54cSXin LI /* 0xf8 reserved */ 356df8bae1dSRodney W. Grimes 357df8bae1dSRodney W. Grimes /* 358df8bae1dSRodney W. Grimes * The instruction data structure. 359df8bae1dSRodney W. Grimes */ 360df8bae1dSRodney W. Grimes struct bpf_insn { 361df8bae1dSRodney W. Grimes u_short code; 362df8bae1dSRodney W. Grimes u_char jt; 363df8bae1dSRodney W. Grimes u_char jf; 36411a53ef3SPaul Traina bpf_u_int32 k; 365df8bae1dSRodney W. Grimes }; 366df8bae1dSRodney W. Grimes 367df8bae1dSRodney W. Grimes /* 368df8bae1dSRodney W. Grimes * Macros for insn array initializers. 369df8bae1dSRodney W. Grimes */ 370df8bae1dSRodney W. Grimes #define BPF_STMT(code, k) { (u_short)(code), 0, 0, k } 371df8bae1dSRodney W. Grimes #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k } 372df8bae1dSRodney W. Grimes 3738eab61f3SSam Leffler /* 3748eab61f3SSam Leffler * Structure to retrieve available DLTs for the interface. 3758eab61f3SSam Leffler */ 3768eab61f3SSam Leffler struct bpf_dltlist { 3778eab61f3SSam Leffler u_int bfl_len; /* number of bfd_list array */ 3788eab61f3SSam Leffler u_int *bfl_list; /* array of DLTs */ 3798eab61f3SSam Leffler }; 3808eab61f3SSam Leffler 381664a31e4SPeter Wemm #ifdef _KERNEL 3824d621040SChristian S.J. Peron #ifdef MALLOC_DECLARE 3834d621040SChristian S.J. Peron MALLOC_DECLARE(M_BPF); 3844d621040SChristian S.J. Peron #endif 3854d621040SChristian S.J. Peron #ifdef SYSCTL_DECL 3864d621040SChristian S.J. Peron SYSCTL_DECL(_net_bpf); 3874d621040SChristian S.J. Peron #endif 3884d621040SChristian S.J. Peron 3894d621040SChristian S.J. Peron /* 3904d621040SChristian S.J. Peron * Rotate the packet buffers in descriptor d. Move the store buffer into the 391f87e372eSLuiz Otavio O Souza * hold slot, and the free buffer into the store slot. Zero the length of the 392f87e372eSLuiz Otavio O Souza * new store buffer. Descriptor lock should be held. One must be careful to 393f87e372eSLuiz Otavio O Souza * not rotate the buffers twice, i.e. if fbuf != NULL. 3944d621040SChristian S.J. Peron */ 3954d621040SChristian S.J. Peron #define ROTATE_BUFFERS(d) do { \ 3964d621040SChristian S.J. Peron (d)->bd_hbuf = (d)->bd_sbuf; \ 3974d621040SChristian S.J. Peron (d)->bd_hlen = (d)->bd_slen; \ 3984d621040SChristian S.J. Peron (d)->bd_sbuf = (d)->bd_fbuf; \ 3994d621040SChristian S.J. Peron (d)->bd_slen = 0; \ 4004d621040SChristian S.J. Peron (d)->bd_fbuf = NULL; \ 4014d621040SChristian S.J. Peron bpf_bufheld(d); \ 4024d621040SChristian S.J. Peron } while (0) 4034d621040SChristian S.J. Peron 40416d878ccSChristian S.J. Peron /* 40516d878ccSChristian S.J. Peron * Descriptor associated with each attached hardware interface. 406b23cbbe6SMark Johnston * Part of this structure is exposed to external callers to speed up 407b23cbbe6SMark Johnston * bpf_peers_present() calls. 40816d878ccSChristian S.J. Peron */ 409b23cbbe6SMark Johnston struct bpf_if; 410b23cbbe6SMark Johnston 411b23cbbe6SMark Johnston struct bpf_if_ext { 41216d878ccSChristian S.J. Peron LIST_ENTRY(bpf_if) bif_next; /* list of all interfaces */ 41316d878ccSChristian S.J. Peron LIST_HEAD(, bpf_d) bif_dlist; /* descriptor list */ 41416d878ccSChristian S.J. Peron }; 41516d878ccSChristian S.J. Peron 4164d621040SChristian S.J. Peron void bpf_bufheld(struct bpf_d *d); 417929ddbbbSAlfred Perlstein int bpf_validate(const struct bpf_insn *, int); 41824a229f4SSam Leffler void bpf_tap(struct bpf_if *, u_char *, u_int); 41924a229f4SSam Leffler void bpf_mtap(struct bpf_if *, struct mbuf *); 420437ffe18SSam Leffler void bpf_mtap2(struct bpf_if *, void *, u_int, struct mbuf *); 421929ddbbbSAlfred Perlstein void bpfattach(struct ifnet *, u_int, u_int); 42224a229f4SSam Leffler void bpfattach2(struct ifnet *, u_int, u_int, struct bpf_if **); 423929ddbbbSAlfred Perlstein void bpfdetach(struct ifnet *); 42405fc4164SBjoern A. Zeeb #ifdef VIMAGE 42505fc4164SBjoern A. Zeeb int bpf_get_bp_params(struct bpf_if *, u_int *, u_int *); 42605fc4164SBjoern A. Zeeb #endif 427de5d9935SRobert Watson 428929ddbbbSAlfred Perlstein void bpfilterattach(int); 42918b6f055SJung-uk Kim u_int bpf_filter(const struct bpf_insn *, u_char *, u_int, u_int); 43024a229f4SSam Leffler 43116d878ccSChristian S.J. Peron static __inline int 43216d878ccSChristian S.J. Peron bpf_peers_present(struct bpf_if *bpf) 43316d878ccSChristian S.J. Peron { 434b23cbbe6SMark Johnston struct bpf_if_ext *ext; 43516d878ccSChristian S.J. Peron 436b23cbbe6SMark Johnston ext = (struct bpf_if_ext *)bpf; 437b23cbbe6SMark Johnston if (!LIST_EMPTY(&ext->bif_dlist)) 438ffdc0471SChristian S.J. Peron return (1); 4395255290cSChristian S.J. Peron return (0); 44016d878ccSChristian S.J. Peron } 44116d878ccSChristian S.J. Peron 44224a229f4SSam Leffler #define BPF_TAP(_ifp,_pkt,_pktlen) do { \ 44316d878ccSChristian S.J. Peron if (bpf_peers_present((_ifp)->if_bpf)) \ 44424a229f4SSam Leffler bpf_tap((_ifp)->if_bpf, (_pkt), (_pktlen)); \ 44524a229f4SSam Leffler } while (0) 44624a229f4SSam Leffler #define BPF_MTAP(_ifp,_m) do { \ 44716d878ccSChristian S.J. Peron if (bpf_peers_present((_ifp)->if_bpf)) { \ 448437ffe18SSam Leffler M_ASSERTVALID(_m); \ 44924a229f4SSam Leffler bpf_mtap((_ifp)->if_bpf, (_m)); \ 450437ffe18SSam Leffler } \ 451437ffe18SSam Leffler } while (0) 452437ffe18SSam Leffler #define BPF_MTAP2(_ifp,_data,_dlen,_m) do { \ 45316d878ccSChristian S.J. Peron if (bpf_peers_present((_ifp)->if_bpf)) { \ 454437ffe18SSam Leffler M_ASSERTVALID(_m); \ 455437ffe18SSam Leffler bpf_mtap2((_ifp)->if_bpf,(_data),(_dlen),(_m)); \ 456437ffe18SSam Leffler } \ 45724a229f4SSam Leffler } while (0) 458df8bae1dSRodney W. Grimes #endif 459df8bae1dSRodney W. Grimes 460df8bae1dSRodney W. Grimes /* 461df8bae1dSRodney W. Grimes * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST). 462df8bae1dSRodney W. Grimes */ 463df8bae1dSRodney W. Grimes #define BPF_MEMWORDS 16 464df8bae1dSRodney W. Grimes 465eaeb0c13SGleb Smirnoff #ifdef _SYS_EVENTHANDLER_H_ 4667ced9c2fSGleb Smirnoff /* BPF attach/detach events */ 4677ced9c2fSGleb Smirnoff struct ifnet; 4687ced9c2fSGleb Smirnoff typedef void (*bpf_track_fn)(void *, struct ifnet *, int /* dlt */, 4697ced9c2fSGleb Smirnoff int /* 1 =>'s attach */); 4707ced9c2fSGleb Smirnoff EVENTHANDLER_DECLARE(bpf_track, bpf_track_fn); 471eaeb0c13SGleb Smirnoff #endif /* _SYS_EVENTHANDLER_H_ */ 4727ced9c2fSGleb Smirnoff 47324a229f4SSam Leffler #endif /* _NET_BPF_H_ */ 474