|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. ! 3: * ! 4: * @APPLE_LICENSE_HEADER_START@ ! 5: * ! 6: * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights ! 7: * Reserved. This file contains Original Code and/or Modifications of ! 8: * Original Code as defined in and that are subject to the Apple Public ! 9: * Source License Version 1.1 (the "License"). You may not use this file ! 10: * except in compliance with the License. Please obtain a copy of the ! 11: * License at http://www.apple.com/publicsource and read it before using ! 12: * this file. ! 13: * ! 14: * The Original Code and all software distributed under the License are ! 15: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER ! 16: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, ! 17: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, ! 18: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the ! 19: * License for the specific language governing rights and limitations ! 20: * under the License. ! 21: * ! 22: * @APPLE_LICENSE_HEADER_END@ ! 23: */ ! 24: ! 25: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */ ! 26: /* ! 27: * Copyright (c) 1990, 1991, 1993 ! 28: * The Regents of the University of California. All rights reserved. ! 29: * ! 30: * This code is derived from the Stanford/CMU enet packet filter, ! 31: * (net/enet.c) distributed as part of 4.3BSD, and code contributed ! 32: * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence ! 33: * Berkeley Laboratory. ! 34: * ! 35: * Redistribution and use in source and binary forms, with or without ! 36: * modification, are permitted provided that the following conditions ! 37: * are met: ! 38: * 1. Redistributions of source code must retain the above copyright ! 39: * notice, this list of conditions and the following disclaimer. ! 40: * 2. Redistributions in binary form must reproduce the above copyright ! 41: * notice, this list of conditions and the following disclaimer in the ! 42: * documentation and/or other materials provided with the distribution. ! 43: * 3. All advertising materials mentioning features or use of this software ! 44: * must display the following acknowledgement: ! 45: * This product includes software developed by the University of ! 46: * California, Berkeley and its contributors. ! 47: * 4. Neither the name of the University nor the names of its contributors ! 48: * may be used to endorse or promote products derived from this software ! 49: * without specific prior written permission. ! 50: * ! 51: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ! 52: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE ! 53: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ! 54: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE ! 55: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL ! 56: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS ! 57: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) ! 58: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT ! 59: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY ! 60: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF ! 61: * SUCH DAMAGE. ! 62: * ! 63: * @(#)bpf.h 8.2 (Berkeley) 1/9/95 ! 64: * ! 65: */ ! 66: ! 67: #ifndef _NET_BPF_H_ ! 68: #define _NET_BPF_H_ ! 69: ! 70: /* ! 71: * Alignment macros. BPF_WORDALIGN rounds up to the next ! 72: * even multiple of BPF_ALIGNMENT. ! 73: */ ! 74: #define BPF_ALIGNMENT sizeof(long) ! 75: #define BPF_WORDALIGN(x) (((x)+(BPF_ALIGNMENT-1))&~(BPF_ALIGNMENT-1)) ! 76: ! 77: #define BPF_MAXINSNS 512 ! 78: #define BPF_MAXBUFSIZE 0x8000 ! 79: #define BPF_MINBUFSIZE 32 ! 80: ! 81: /* ! 82: * Structure for BIOCSETF. ! 83: */ ! 84: struct bpf_program { ! 85: u_int bf_len; ! 86: struct bpf_insn *bf_insns; ! 87: }; ! 88: ! 89: /* ! 90: * Struct returned by BIOCGSTATS. ! 91: */ ! 92: struct bpf_stat { ! 93: u_int bs_recv; /* number of packets received */ ! 94: u_int bs_drop; /* number of packets dropped */ ! 95: }; ! 96: ! 97: /* ! 98: * Struct return by BIOCVERSION. This represents the version number of ! 99: * the filter language described by the instruction encodings below. ! 100: * bpf understands a program iff kernel_major == filter_major && ! 101: * kernel_minor >= filter_minor, that is, if the value returned by the ! 102: * running kernel has the same major number and a minor number equal ! 103: * equal to or less than the filter being downloaded. Otherwise, the ! 104: * results are undefined, meaning an error may be returned or packets ! 105: * may be accepted haphazardly. ! 106: * It has nothing to do with the source code version. ! 107: */ ! 108: struct bpf_version { ! 109: u_short bv_major; ! 110: u_short bv_minor; ! 111: }; ! 112: /* Current version number. */ ! 113: #define BPF_MAJOR_VERSION 1 ! 114: #define BPF_MINOR_VERSION 1 ! 115: ! 116: /* ! 117: * BPF ioctls ! 118: * ! 119: * The first set is for compatibility with Sun's pcc style ! 120: * header files. If your using gcc, we assume that you ! 121: * have run fixincludes so the latter set should work. ! 122: */ ! 123: #if (defined(sun) || defined(ibm032)) && !defined(__GNUC__) ! 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: #else ! 138: #define BIOCGBLEN _IOR('B',102, u_int) ! 139: #define BIOCSBLEN _IOWR('B',102, u_int) ! 140: #define BIOCSETF _IOW('B',103, struct bpf_program) ! 141: #define BIOCFLUSH _IO('B',104) ! 142: #define BIOCPROMISC _IO('B',105) ! 143: #define BIOCGDLT _IOR('B',106, u_int) ! 144: #define BIOCGETIF _IOR('B',107, struct ifreq) ! 145: #define BIOCSETIF _IOW('B',108, struct ifreq) ! 146: #define BIOCSRTIMEOUT _IOW('B',109, struct timeval) ! 147: #define BIOCGRTIMEOUT _IOR('B',110, struct timeval) ! 148: #define BIOCGSTATS _IOR('B',111, struct bpf_stat) ! 149: #define BIOCIMMEDIATE _IOW('B',112, u_int) ! 150: #define BIOCVERSION _IOR('B',113, struct bpf_version) ! 151: #endif ! 152: ! 153: /* ! 154: * Structure prepended to each packet. ! 155: */ ! 156: struct bpf_hdr { ! 157: struct timeval bh_tstamp; /* time stamp */ ! 158: u_int32_t bh_caplen; /* length of captured portion */ ! 159: u_int32_t bh_datalen; /* original length of packet */ ! 160: u_short bh_hdrlen; /* length of bpf header (this struct ! 161: plus alignment padding) */ ! 162: }; ! 163: /* ! 164: * Because the structure above is not a multiple of 4 bytes, some compilers ! 165: * will insist on inserting padding; hence, sizeof(struct bpf_hdr) won't work. ! 166: * Only the kernel needs to know about it; applications use bh_hdrlen. ! 167: */ ! 168: #ifdef _KERNEL ! 169: #define SIZEOF_BPF_HDR 18 ! 170: #endif ! 171: ! 172: /* ! 173: * Data-link level type codes. ! 174: */ ! 175: #define DLT_NULL 0 /* no link-layer encapsulation */ ! 176: #define DLT_EN10MB 1 /* Ethernet (10Mb) */ ! 177: #define DLT_EN3MB 2 /* Experimental Ethernet (3Mb) */ ! 178: #define DLT_AX25 3 /* Amateur Radio AX.25 */ ! 179: #define DLT_PRONET 4 /* Proteon ProNET Token Ring */ ! 180: #define DLT_CHAOS 5 /* Chaos */ ! 181: #define DLT_IEEE802 6 /* IEEE 802 Networks */ ! 182: #define DLT_ARCNET 7 /* ARCNET */ ! 183: #define DLT_SLIP 8 /* Serial Line IP */ ! 184: #define DLT_PPP 9 /* Point-to-point Protocol */ ! 185: #define DLT_FDDI 10 /* FDDI */ ! 186: ! 187: /* ! 188: * The instruction encondings. ! 189: */ ! 190: /* instruction classes */ ! 191: #define BPF_CLASS(code) ((code) & 0x07) ! 192: #define BPF_LD 0x00 ! 193: #define BPF_LDX 0x01 ! 194: #define BPF_ST 0x02 ! 195: #define BPF_STX 0x03 ! 196: #define BPF_ALU 0x04 ! 197: #define BPF_JMP 0x05 ! 198: #define BPF_RET 0x06 ! 199: #define BPF_MISC 0x07 ! 200: ! 201: /* ld/ldx fields */ ! 202: #define BPF_SIZE(code) ((code) & 0x18) ! 203: #define BPF_W 0x00 ! 204: #define BPF_H 0x08 ! 205: #define BPF_B 0x10 ! 206: #define BPF_MODE(code) ((code) & 0xe0) ! 207: #define BPF_IMM 0x00 ! 208: #define BPF_ABS 0x20 ! 209: #define BPF_IND 0x40 ! 210: #define BPF_MEM 0x60 ! 211: #define BPF_LEN 0x80 ! 212: #define BPF_MSH 0xa0 ! 213: ! 214: /* alu/jmp fields */ ! 215: #define BPF_OP(code) ((code) & 0xf0) ! 216: #define BPF_ADD 0x00 ! 217: #define BPF_SUB 0x10 ! 218: #define BPF_MUL 0x20 ! 219: #define BPF_DIV 0x30 ! 220: #define BPF_OR 0x40 ! 221: #define BPF_AND 0x50 ! 222: #define BPF_LSH 0x60 ! 223: #define BPF_RSH 0x70 ! 224: #define BPF_NEG 0x80 ! 225: #define BPF_JA 0x00 ! 226: #define BPF_JEQ 0x10 ! 227: #define BPF_JGT 0x20 ! 228: #define BPF_JGE 0x30 ! 229: #define BPF_JSET 0x40 ! 230: #define BPF_SRC(code) ((code) & 0x08) ! 231: #define BPF_K 0x00 ! 232: #define BPF_X 0x08 ! 233: ! 234: /* ret - BPF_K and BPF_X also apply */ ! 235: #define BPF_RVAL(code) ((code) & 0x18) ! 236: #define BPF_A 0x10 ! 237: ! 238: /* misc */ ! 239: #define BPF_MISCOP(code) ((code) & 0xf8) ! 240: #define BPF_TAX 0x00 ! 241: #define BPF_TXA 0x80 ! 242: ! 243: /* ! 244: * The instruction data structure. ! 245: */ ! 246: struct bpf_insn { ! 247: u_short code; ! 248: u_char jt; ! 249: u_char jf; ! 250: int32_t k; ! 251: }; ! 252: ! 253: /* ! 254: * Macros for insn array initializers. ! 255: */ ! 256: #define BPF_STMT(code, k) { (u_short)(code), 0, 0, k } ! 257: #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k } ! 258: ! 259: #ifdef _KERNEL ! 260: int bpf_validate __P((struct bpf_insn *, int)); ! 261: int bpfopen __P((dev_t, int)); ! 262: int bpfclose __P((dev_t, int)); ! 263: int bpfread __P((dev_t, struct uio *)); ! 264: int bpfwrite __P((dev_t, struct uio *)); ! 265: int bpfioctl __P((dev_t, u_long, caddr_t, int)); ! 266: int bpf_select __P((dev_t, int, struct proc *)); ! 267: void bpf_tap __P((caddr_t, u_char *, u_int)); ! 268: void bpf_mtap __P((caddr_t, struct mbuf *)); ! 269: void bpfattach __P((caddr_t *, struct ifnet *, u_int, u_int)); ! 270: void bpfilterattach __P((int)); ! 271: u_int bpf_filter __P((struct bpf_insn *, u_char *, u_int, u_int)); ! 272: #endif ! 273: ! 274: /* ! 275: * Number of scratch memory words (for BPF_LD|BPF_MEM and BPF_ST). ! 276: */ ! 277: #define BPF_MEMWORDS 16 ! 278: ! 279: #ifdef _KERNEL ! 280: ! 281: extern int nbpfilter; ! 282: ! 283: typedef struct { ! 284: void (*bpf_tap) (caddr_t, u_char *, u_int); ! 285: void (*bpf_mtap)(caddr_t, struct mbuf *); ! 286: } bpfops_t; ! 287: ! 288: extern bpfops_t bpfops; ! 289: ! 290: #define BPF_TAP(arg, pkt, pktlen) \ ! 291: {if (bpfops.bpf_tap != NULL) (*bpfops.bpf_tap)(arg, pkt, pktlen);} ! 292: ! 293: extern void _bpf_tap(caddr_t, u_char *, u_int); ! 294: ! 295: #define BPF_MTAP(arg, m) \ ! 296: {if (bpfops.bpf_mtap != NULL) (*bpfops.bpf_mtap)(arg, m);} ! 297: ! 298: #endif /* _KERNEL */ ! 299: ! 300: #endif /* _NET_BPF_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.