1 /* $OpenBSD: bpf.h,v 1.27 2004/05/16 04:34:58 brad Exp $ */ 2 /* $NetBSD: bpf.h,v 1.15 1996/12/13 07:57:33 mikel Exp $ */ 3 4 /* 5 * Copyright (c) 1990, 1991, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * This code is derived from the Stanford/CMU enet packet filter, 9 * (net/enet.c) distributed as part of 4.3BSD, and code contributed 10 * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence 11 * Berkeley Laboratory. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 3. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 * 37 * @(#)bpf.h 8.1 (Berkeley) 6/10/93 38 */ 39 40 #ifndef _NET_BPF_H_ 41 #define _NET_BPF_H_ 42 43 /* BSD style release date */ 44 #define BPF_RELEASE 199606 45 46 typedef int32_t bpf_int32; 47 typedef u_int32_t bpf_u_int32; 48 /* 49 * Alignment macros. BPF_WORDALIGN rounds up to the next even multiple of 50 * BPF_ALIGNMENT (which is at least as much as what a timeval needs). 51 */ 52 #define BPF_ALIGNMENT sizeof(long) 53 #define BPF_WORDALIGN(x) (((x) + (BPF_ALIGNMENT - 1)) & ~(BPF_ALIGNMENT - 1)) 54 55 #define BPF_MAXINSNS 512 56 #define BPF_MAXBUFSIZE (2 * 1024 * 1024) 57 #define BPF_MINBUFSIZE 32 58 59 /* 60 * Structure for BIOCSETF. 61 */ 62 struct bpf_program { 63 u_int bf_len; 64 struct bpf_insn *bf_insns; 65 }; 66 67 /* 68 * Struct returned by BIOCGSTATS. 69 */ 70 struct bpf_stat { 71 u_int bs_recv; /* number of packets received */ 72 u_int bs_drop; /* number of packets dropped */ 73 }; 74 75 /* 76 * Struct return by BIOCVERSION. This represents the version number of 77 * the filter language described by the instruction encodings below. 78 * bpf understands a program iff kernel_major == filter_major && 79 * kernel_minor >= filter_minor, that is, if the value returned by the 80 * running kernel has the same major number and a minor number equal 81 * equal to or less than the filter being downloaded. Otherwise, the 82 * results are undefined, meaning an error may be returned or packets 83 * may be accepted haphazardly. 84 * It has nothing to do with the source code version. 85 */ 86 struct bpf_version { 87 u_short bv_major; 88 u_short bv_minor; 89 }; 90 /* Current version number of filter architecture. */ 91 #define BPF_MAJOR_VERSION 1 92 #define BPF_MINOR_VERSION 1 93 94 /* 95 * BPF ioctls 96 */ 97 #define BIOCGBLEN _IOR('B',102, u_int) 98 #define BIOCSBLEN _IOWR('B',102, u_int) 99 #define BIOCSETF _IOW('B',103, struct bpf_program) 100 #define BIOCFLUSH _IO('B',104) 101 #define BIOCPROMISC _IO('B',105) 102 #define BIOCGDLT _IOR('B',106, u_int) 103 #define BIOCGETIF _IOR('B',107, struct ifreq) 104 #define BIOCSETIF _IOW('B',108, struct ifreq) 105 #define BIOCSRTIMEOUT _IOW('B',109, struct timeval) 106 #define BIOCGRTIMEOUT _IOR('B',110, struct timeval) 107 #define BIOCGSTATS _IOR('B',111, struct bpf_stat) 108 #define BIOCIMMEDIATE _IOW('B',112, u_int) 109 #define BIOCVERSION _IOR('B',113, struct bpf_version) 110 #define BIOCSRSIG _IOW('B',114, u_int) 111 #define BIOCGRSIG _IOR('B',115, u_int) 112 #define BIOCGHDRCMPLT _IOR('B',116, u_int) 113 #define BIOCSHDRCMPLT _IOW('B',117, u_int) 114 #define BIOCLOCK _IO('B',118) 115 #define BIOCSETWF _IOW('B',119, struct bpf_program) 116 117 struct bpf_timeval { 118 u_int32_t tv_sec; 119 u_int32_t tv_usec; 120 }; 121 122 /* 123 * Structure prepended to each packet. 124 */ 125 struct bpf_hdr { 126 struct bpf_timeval bh_tstamp; /* time stamp */ 127 u_int32_t bh_caplen; /* length of captured portion */ 128 u_int32_t bh_datalen; /* original length of packet */ 129 u_int16_t bh_hdrlen; /* length of bpf header (this struct 130 plus alignment padding) */ 131 }; 132 /* 133 * Because the structure above is not a multiple of 4 bytes, some compilers 134 * will insist on inserting padding; hence, sizeof(struct bpf_hdr) won't work. 135 * Only the kernel needs to know about it; applications use bh_hdrlen. 136 * XXX To save a few bytes on 32-bit machines, we avoid end-of-struct 137 * XXX padding by using the size of the header data elements. This is 138 * XXX fail-safe: on new machines, we just use the 'safe' sizeof. 139 */ 140 #ifdef _KERNEL 141 #if defined(__arm32__) || defined(__i386__) || defined(__m68k__) || \ 142 defined(__mips__) || defined(__ns32k__) || defined(__sparc__) || \ 143 defined(__vax__) 144 #define SIZEOF_BPF_HDR 18 145 #else 146 #define SIZEOF_BPF_HDR sizeof(struct bpf_hdr) 147 #endif 148 #endif 149 150 /* 151 * Data-link level type codes. 152 */ 153 #define DLT_NULL 0 /* no link-layer encapsulation */ 154 #define DLT_EN10MB 1 /* Ethernet (10Mb) */ 155 #define DLT_EN3MB 2 /* Experimental Ethernet (3Mb) */ 156 #define DLT_AX25 3 /* Amateur Radio AX.25 */ 157 #define DLT_PRONET 4 /* Proteon ProNET Token Ring */ 158 #define DLT_CHAOS 5 /* Chaos */ 159 #define DLT_IEEE802 6 /* IEEE 802 Networks */ 160 #define DLT_ARCNET 7 /* ARCNET */ 161 #define DLT_SLIP 8 /* Serial Line IP */ 162 #define DLT_PPP 9 /* Point-to-point Protocol */ 163 #define DLT_FDDI 10 /* FDDI */ 164 #define DLT_ATM_RFC1483 11 /* LLC/SNAP encapsulated atm */ 165 #define DLT_LOOP 12 /* loopback type (af header) */ 166 #define DLT_ENC 13 /* IPSEC enc type (af header, spi, flags) */ 167 #define DLT_RAW 14 /* raw IP */ 168 #define DLT_SLIP_BSDOS 15 /* BSD/OS Serial Line IP */ 169 #define DLT_PPP_BSDOS 16 /* BSD/OS Point-to-point Protocol */ 170 #define DLT_OLD_PFLOG 17 /* Packet filter logging, old (XXX remove?) */ 171 #define DLT_PFSYNC 18 /* Packet filter state syncing */ 172 #define DLT_PPP_ETHER 51 /* PPP over Ethernet; session only, w/o ether header */ 173 #define DLT_IEEE802_11 105 /* IEEE 802.11 wireless */ 174 #define DLT_PFLOG 117 /* Packet filter logging, by pcap people */ 175 176 /* 177 * The instruction encodings. 178 */ 179 /* instruction classes */ 180 #define BPF_CLASS(code) ((code) & 0x07) 181 #define BPF_LD 0x00 182 #define BPF_LDX 0x01 183 #define BPF_ST 0x02 184 #define BPF_STX 0x03 185 #define BPF_ALU 0x04 186 #define BPF_JMP 0x05 187 #define BPF_RET 0x06 188 #define BPF_MISC 0x07 189 190 /* ld/ldx fields */ 191 #define BPF_SIZE(code) ((code) & 0x18) 192 #define BPF_W 0x00 193 #define BPF_H 0x08 194 #define BPF_B 0x10 195 #define BPF_MODE(code) ((code) & 0xe0) 196 #define BPF_IMM 0x00 197 #define BPF_ABS 0x20 198 #define BPF_IND 0x40 199 #define BPF_MEM 0x60 200 #define BPF_LEN 0x80 201 #define BPF_MSH 0xa0 202 203 /* alu/jmp fields */ 204 #define BPF_OP(code) ((code) & 0xf0) 205 #define BPF_ADD 0x00 206 #define BPF_SUB 0x10 207 #define BPF_MUL 0x20 208 #define BPF_DIV 0x30 209 #define BPF_OR 0x40 210 #define BPF_AND 0x50 211 #define BPF_LSH 0x60 212 #define BPF_RSH 0x70 213 #define BPF_NEG 0x80 214 #define BPF_JA 0x00 215 #define BPF_JEQ 0x10 216 #define BPF_JGT 0x20 217 #define BPF_JGE 0x30 218 #define BPF_JSET 0x40 219 #define BPF_SRC(code) ((code) & 0x08) 220 #define BPF_K 0x00 221 #define BPF_X 0x08 222 223 /* ret - BPF_K and BPF_X also apply */ 224 #define BPF_RVAL(code) ((code) & 0x18) 225 #define BPF_A 0x10 226 227 /* misc */ 228 #define BPF_MISCOP(code) ((code) & 0xf8) 229 #define BPF_TAX 0x00 230 #define BPF_TXA 0x80 231 232 /* 233 * The instruction data structure. 234 */ 235 struct bpf_insn { 236 u_int16_t code; 237 u_char jt; 238 u_char jf; 239 u_int32_t k; 240 }; 241 242 /* 243 * Macros for insn array initializers. 244 */ 245 #define BPF_STMT(code, k) { (u_int16_t)(code), 0, 0, k } 246 #define BPF_JUMP(code, k, jt, jf) { (u_int16_t)(code), jt, jf, k } 247 248 #ifdef _KERNEL 249 int bpf_validate(struct bpf_insn *, int); 250 void bpf_tap(caddr_t, u_char *, u_int); 251 void bpf_mtap(caddr_t, struct mbuf *); 252 void bpfattach(caddr_t *, struct ifnet *, u_int, u_int); 253 void bpfdetach(struct ifnet *); 254 void bpfilterattach(int); 255 u_int bpf_filter(struct bpf_insn *, u_char *, u_int, u_int); 256 #endif /* _KERNEL */ 257 258 /* 259 * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST). 260 */ 261 #define BPF_MEMWORDS 16 262 263 extern int ticks; /* from kern/kern_clock.c; incremented each */ 264 /* clock tick. */ 265 266 #endif /* _NET_BPF_H_ */ 267