projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| 15637ed4 RG |
1 | /*- |
| 2 | * Copyright (c) 1991 The Regents of the University of California. | |
| 3 | * 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 | * @(#)bpfdesc.h 7.1 (Berkeley) 5/7/91 | |
| 39 | * | |
| 40 | * @(#) $Header: bpfdesc.h,v 1.10 92/02/24 21:28:24 mccanne Exp $ (LBL) | |
| 41 | * | |
| 42 | * PATCHES MAGIC LEVEL PATCH THAT GOT US HERE | |
| 43 | * -------------------- ----- ---------------------- | |
| 44 | * CURRENT PATCH LEVEL: 1 00112 | |
| 45 | * -------------------- ----- ---------------------- | |
| 46 | * | |
| 47 | * 14 Mar 93 David Greenman Upgrade bpf to match tcpdump 2.2.1 | |
| 48 | */ | |
| 49 | ||
| 50 | /* | |
| 51 | * Descriptor associated with each open bpf file. | |
| 52 | */ | |
| 53 | struct bpf_d { | |
| 54 | struct bpf_d *bd_next; /* Linked list of descriptors */ | |
| 55 | /* | |
| 56 | * Buffer slots: two mbuf clusters buffer the incoming packets. | |
| 57 | * The model has three slots. Sbuf is always occupied. | |
| 58 | * sbuf (store) - Receive interrupt puts packets here. | |
| 59 | * hbuf (hold) - When sbuf is full, put cluster here and | |
| 60 | * wakeup read (replace sbuf with fbuf). | |
| 61 | * fbuf (free) - When read is done, put cluster here. | |
| 62 | * On receiving, if sbuf is full and fbuf is 0, packet is dropped. | |
| 63 | */ | |
| 64 | caddr_t bd_sbuf; /* store slot */ | |
| 65 | caddr_t bd_hbuf; /* hold slot */ | |
| 66 | caddr_t bd_fbuf; /* free slot */ | |
| 67 | int bd_slen; /* current length of store buffer */ | |
| 68 | int bd_hlen; /* current length of hold buffer */ | |
| 69 | ||
| 70 | int bd_bufsize; /* absolute length of buffers */ | |
| 71 | ||
| 72 | struct bpf_if * bd_bif; /* interface descriptor */ | |
| 73 | u_long bd_rtout; /* Read timeout in 'ticks' */ | |
| 74 | struct bpf_insn *bd_filter; /* filter code */ | |
| 75 | u_long bd_rcount; /* number of packets received */ | |
| 76 | u_long bd_dcount; /* number of packets dropped */ | |
| 77 | ||
| 78 | u_char bd_promisc; /* true if listening promiscuously */ | |
| 79 | u_char bd_state; /* idle, waiting, or timed out */ | |
| 80 | u_char bd_immediate; /* true to return on packet arrival */ | |
| 81 | u_char bd_selcoll; /* true if selects collide */ | |
| 82 | int bd_timedout; | |
| 83 | struct proc * bd_selproc; /* process that last selected us */ | |
| 84 | }; | |
| 85 | ||
| 86 | /* | |
| 87 | * Descriptor associated with each attached hardware interface. | |
| 88 | */ | |
| 89 | struct bpf_if { | |
| 90 | struct bpf_if *bif_next; /* list of all interfaces */ | |
| 91 | struct bpf_d *bif_dlist; /* descriptor list */ | |
| 92 | struct bpf_if **bif_driverp; /* pointer into softc */ | |
| 93 | u_int bif_dlt; /* link layer type */ | |
| 94 | u_int bif_hdrlen; /* length of header (with padding) */ | |
| 95 | struct ifnet *bif_ifp; /* correspoding interface */ | |
| 96 | }; |