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 * 40 * $Id: bpf.h,v 1.2 1994/08/02 07:45:54 davidg Exp $ 41 */ 42 43 #ifndef _NET_BPF_H_ 44 #define _NET_BPF_H_ 45 46 /* 47 * Alignment macros. BPF_WORDALIGN rounds up to the next 48 * even multiple of BPF_ALIGNMENT. 49 */ 50 #define BPF_ALIGNMENT sizeof(long) 51 #define BPF_WORDALIGN(x) (((x)+(BPF_ALIGNMENT-1))&~(BPF_ALIGNMENT-1)) 52 53 #define BPF_MAXINSNS 512 54 #define BPF_MAXBUFSIZE 0x8000 55 #define BPF_MINBUFSIZE 32 56 57 /* 58 * Structure for BIOCSETF. 59 */ 60 struct bpf_program { 61 u_int bf_len; 62 struct bpf_insn *bf_insns; 63 }; 64 65 /* 66 * Struct returned by BIOCGSTATS. 67 */ 68 struct bpf_stat { 69 u_int bs_recv; /* number of packets received */ 70 u_int bs_drop; /* number of packets dropped */ 71 }; 72 73 /* 74 * Struct return by BIOCVERSION. This represents the version number of 75 * the filter language described by the instruction encodings below. 76 * bpf understands a program iff kernel_major == filter_major && 77 * kernel_minor >= filter_minor, that is, if the value returned by the 78 * running kernel has the same major number and a minor number equal 79 * equal to or less than the filter being downloaded. Otherwise, the 80 * results are undefined, meaning an error may be returned or packets 81 * may be accepted haphazardly. 82 * It has nothing to do with the source code version. 83 */ 84 struct bpf_version { 85 u_short bv_major; 86 u_short bv_minor; 87 }; 88 /* Current version number. */ 89 #define BPF_MAJOR_VERSION 1 90 #define BPF_MINOR_VERSION 1 91 92 /* 93 * BPF ioctls 94 * 95 * The first set is for compatibility with Sun's pcc style 96 * header files. If your using gcc, we assume that you 97 * have run fixincludes so the latter set should work. 98 */ 99 #if (defined(sun) || defined(ibm032)) && !defined(__GNUC__) 100 #define BIOCGBLEN _IOR(B,102, u_int) 101 #define BIOCSBLEN _IOWR(B,102, u_int) 102 #define BIOCSETF _IOW(B,103, struct bpf_program) 103 #define BIOCFLUSH _IO(B,104) 104 #define BIOCPROMISC _IO(B,105) 105 #define BIOCGDLT _IOR(B,106, u_int) 106 #define BIOCGETIF _IOR(B,107, struct ifreq) 107 #define BIOCSETIF _IOW(B,108, struct ifreq) 108 #define BIOCSRTIMEOUT _IOW(B,109, struct timeval) 109 #define BIOCGRTIMEOUT _IOR(B,110, struct timeval) 110 #define BIOCGSTATS _IOR(B,111, struct bpf_stat) 111 #define BIOCIMMEDIATE _IOW(B,112, u_int) 112 #define BIOCVERSION _IOR(B,113, struct bpf_version) 113 #else 114 #define BIOCGBLEN _IOR('B',102, u_int) 115 #define BIOCSBLEN _IOWR('B',102, u_int) 116 #define BIOCSETF _IOW('B',103, struct bpf_program) 117 #define BIOCFLUSH _IO('B',104) 118 #define BIOCPROMISC _IO('B',105) 119 #define BIOCGDLT _IOR('B',106, u_int) 120 #define BIOCGETIF _IOR('B',107, struct ifreq) 121 #define BIOCSETIF _IOW('B',108, struct ifreq) 122 #define BIOCSRTIMEOUT _IOW('B',109, struct timeval) 123 #define BIOCGRTIMEOUT _IOR('B',110, struct timeval) 124 #define BIOCGSTATS _IOR('B',111, struct bpf_stat) 125 #define BIOCIMMEDIATE _IOW('B',112, u_int) 126 #define BIOCVERSION _IOR('B',113, struct bpf_version) 127 #endif 128 129 /* 130 * Structure prepended to each packet. 131 */ 132 struct bpf_hdr { 133 struct timeval bh_tstamp; /* time stamp */ 134 u_long bh_caplen; /* length of captured portion */ 135 u_long bh_datalen; /* original length of packet */ 136 u_short bh_hdrlen; /* length of bpf header (this struct 137 plus alignment padding) */ 138 }; 139 /* 140 * Because the structure above is not a multiple of 4 bytes, some compilers 141 * will insist on inserting padding; hence, sizeof(struct bpf_hdr) won't work. 142 * Only the kernel needs to know about it; applications use bh_hdrlen. 143 */ 144 #ifdef KERNEL 145 #define SIZEOF_BPF_HDR 18 146 #endif 147 148 /* 149 * Data-link level type codes. 150 * Currently, only DLT_EN10MB and DLT_SLIP are supported. 151 */ 152 #define DLT_NULL 0 /* no link-layer encapsulation */ 153 #define DLT_EN10MB 1 /* Ethernet (10Mb) */ 154 #define DLT_EN3MB 2 /* Experimental Ethernet (3Mb) */ 155 #define DLT_AX25 3 /* Amateur Radio AX.25 */ 156 #define DLT_PRONET 4 /* Proteon ProNET Token Ring */ 157 #define DLT_CHAOS 5 /* Chaos */ 158 #define DLT_IEEE802 6 /* IEEE 802 Networks */ 159 #define DLT_ARCNET 7 /* ARCNET */ 160 #define DLT_SLIP 8 /* Serial Line IP */ 161 #define DLT_PPP 9 /* Point-to-point Protocol */ 162 #define DLT_FDDI 10 /* FDDI */ 163 164 /* 165 * The instruction encondings. 166 */ 167 /* instruction classes */ 168 #define BPF_CLASS(code) ((code) & 0x07) 169 #define BPF_LD 0x00 170 #define BPF_LDX 0x01 171 #define BPF_ST 0x02 172 #define BPF_STX 0x03 173 #define BPF_ALU 0x04 174 #define BPF_JMP 0x05 175 #define BPF_RET 0x06 176 #define BPF_MISC 0x07 177 178 /* ld/ldx fields */ 179 #define BPF_SIZE(code) ((code) & 0x18) 180 #define BPF_W 0x00 181 #define BPF_H 0x08 182 #define BPF_B 0x10 183 #define BPF_MODE(code) ((code) & 0xe0) 184 #define BPF_IMM 0x00 185 #define BPF_ABS 0x20 186 #define BPF_IND 0x40 187 #define BPF_MEM 0x60 188 #define BPF_LEN 0x80 189 #define BPF_MSH 0xa0 190 191 /* alu/jmp fields */ 192 #define BPF_OP(code) ((code) & 0xf0) 193 #define BPF_ADD 0x00 194 #define BPF_SUB 0x10 195 #define BPF_MUL 0x20 196 #define BPF_DIV 0x30 197 #define BPF_OR 0x40 198 #define BPF_AND 0x50 199 #define BPF_LSH 0x60 200 #define BPF_RSH 0x70 201 #define BPF_NEG 0x80 202 #define BPF_JA 0x00 203 #define BPF_JEQ 0x10 204 #define BPF_JGT 0x20 205 #define BPF_JGE 0x30 206 #define BPF_JSET 0x40 207 #define BPF_SRC(code) ((code) & 0x08) 208 #define BPF_K 0x00 209 #define BPF_X 0x08 210 211 /* ret - BPF_K and BPF_X also apply */ 212 #define BPF_RVAL(code) ((code) & 0x18) 213 #define BPF_A 0x10 214 215 /* misc */ 216 #define BPF_MISCOP(code) ((code) & 0xf8) 217 #define BPF_TAX 0x00 218 #define BPF_TXA 0x80 219 220 /* 221 * The instruction data structure. 222 */ 223 struct bpf_insn { 224 u_short code; 225 u_char jt; 226 u_char jf; 227 long k; 228 }; 229 230 /* 231 * Macros for insn array initializers. 232 */ 233 #define BPF_STMT(code, k) { (u_short)(code), 0, 0, k } 234 #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k } 235 236 #ifdef KERNEL 237 int bpf_validate __P((struct bpf_insn *, int)); 238 int bpfopen __P((dev_t, int)); 239 int bpfclose __P((dev_t, int)); 240 int bpfread __P((dev_t, struct uio *)); 241 int bpfwrite __P((dev_t, struct uio *)); 242 int bpfioctl __P((dev_t, int, caddr_t, int)); 243 int bpf_select __P((dev_t, int, struct proc *)); 244 void bpf_tap __P((caddr_t, u_char *, u_int)); 245 void bpf_mtap __P((caddr_t, struct mbuf *)); 246 void bpfattach __P((caddr_t *, struct ifnet *, u_int, u_int)); 247 void bpfilterattach __P((int)); 248 u_int bpf_filter __P((struct bpf_insn *, u_char *, u_int, u_int)); 249 #endif 250 251 /* 252 * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST). 253 */ 254 #define BPF_MEMWORDS 16 255 256 #endif 257