bpf.h revision 1.9
1 /* $NetBSD: bpf.h,v 1.9 1995/03/06 10:56:06 mycroft Exp $ */ 2 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. All advertising materials mentioning features or use of this software 21 * must display the following acknowledgement: 22 * This product includes software developed by the University of 23 * California, Berkeley and its contributors. 24 * 4. Neither the name of the University nor the names of its contributors 25 * may be used to endorse or promote products derived from this software 26 * without specific prior written permission. 27 * 28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 38 * SUCH DAMAGE. 39 * 40 * @(#)bpf.h 8.1 (Berkeley) 6/10/93 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 of filter architecture. */ 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_int32_t bh_caplen; /* length of captured portion */ 135 u_int32_t 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 */ 151 #define DLT_NULL 0 /* no link-layer encapsulation */ 152 #define DLT_EN10MB 1 /* Ethernet (10Mb) */ 153 #define DLT_EN3MB 2 /* Experimental Ethernet (3Mb) */ 154 #define DLT_AX25 3 /* Amateur Radio AX.25 */ 155 #define DLT_PRONET 4 /* Proteon ProNET Token Ring */ 156 #define DLT_CHAOS 5 /* Chaos */ 157 #define DLT_IEEE802 6 /* IEEE 802 Networks */ 158 #define DLT_ARCNET 7 /* ARCNET */ 159 #define DLT_SLIP 8 /* Serial Line IP */ 160 #define DLT_PPP 9 /* Point-to-point Protocol */ 161 #define DLT_FDDI 10 /* FDDI */ 162 163 /* 164 * The instruction encondings. 165 */ 166 /* instruction classes */ 167 #define BPF_CLASS(code) ((code) & 0x07) 168 #define BPF_LD 0x00 169 #define BPF_LDX 0x01 170 #define BPF_ST 0x02 171 #define BPF_STX 0x03 172 #define BPF_ALU 0x04 173 #define BPF_JMP 0x05 174 #define BPF_RET 0x06 175 #define BPF_MISC 0x07 176 177 /* ld/ldx fields */ 178 #define BPF_SIZE(code) ((code) & 0x18) 179 #define BPF_W 0x00 180 #define BPF_H 0x08 181 #define BPF_B 0x10 182 #define BPF_MODE(code) ((code) & 0xe0) 183 #define BPF_IMM 0x00 184 #define BPF_ABS 0x20 185 #define BPF_IND 0x40 186 #define BPF_MEM 0x60 187 #define BPF_LEN 0x80 188 #define BPF_MSH 0xa0 189 190 /* alu/jmp fields */ 191 #define BPF_OP(code) ((code) & 0xf0) 192 #define BPF_ADD 0x00 193 #define BPF_SUB 0x10 194 #define BPF_MUL 0x20 195 #define BPF_DIV 0x30 196 #define BPF_OR 0x40 197 #define BPF_AND 0x50 198 #define BPF_LSH 0x60 199 #define BPF_RSH 0x70 200 #define BPF_NEG 0x80 201 #define BPF_JA 0x00 202 #define BPF_JEQ 0x10 203 #define BPF_JGT 0x20 204 #define BPF_JGE 0x30 205 #define BPF_JSET 0x40 206 #define BPF_SRC(code) ((code) & 0x08) 207 #define BPF_K 0x00 208 #define BPF_X 0x08 209 210 /* ret - BPF_K and BPF_X also apply */ 211 #define BPF_RVAL(code) ((code) & 0x18) 212 #define BPF_A 0x10 213 214 /* misc */ 215 #define BPF_MISCOP(code) ((code) & 0xf8) 216 #define BPF_TAX 0x00 217 #define BPF_TXA 0x80 218 219 /* 220 * The instruction data structure. 221 */ 222 struct bpf_insn { 223 u_short code; 224 u_char jt; 225 u_char jf; 226 int32_t k; 227 }; 228 229 /* 230 * Macros for insn array initializers. 231 */ 232 #define BPF_STMT(code, k) { (u_short)(code), 0, 0, k } 233 #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k } 234 235 #ifdef KERNEL 236 int bpf_validate __P((struct bpf_insn *, int)); 237 int bpfopen __P((dev_t, int)); 238 int bpfclose __P((dev_t, int)); 239 int bpfread __P((dev_t, struct uio *)); 240 int bpfwrite __P((dev_t, struct uio *)); 241 int bpfioctl __P((dev_t, u_long, caddr_t, int)); 242 int bpf_select __P((dev_t, int, struct proc *)); 243 void bpf_tap __P((caddr_t, u_char *, u_int)); 244 void bpf_mtap __P((caddr_t, struct mbuf *)); 245 void bpfattach __P((caddr_t *, struct ifnet *, u_int, u_int)); 246 void bpfilterattach __P((int)); 247 u_int bpf_filter __P((struct bpf_insn *, u_char *, u_int, u_int)); 248 #endif 249 250 /* 251 * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST). 252 */ 253 #define BPF_MEMWORDS 16 254 255 #endif /* _NET_BPF_H_ */ 256
Indexes created Mon Sep 22 10:09:38 GMT 2025