![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to bpfdesc.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Net/2] / Net2 / net|
Return to bpfdesc.h CVS log | Up to [Net/2] / Net2 / net |
1.1 root 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
1.1.1.2 ! root 7: * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
! 8: * Berkeley Laboratory.
1.1 root 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: *
1.1.1.2 ! root 40: * @(#) $Header: /cvsroot/src/sys/net/bpfdesc.h,v 1.3 1993/04/06 06:50:20 deraadt Exp $ (LBL)
1.1 root 41: */
42:
43: /*
44: * Descriptor associated with each open bpf file.
45: */
46: struct bpf_d {
47: struct bpf_d *bd_next; /* Linked list of descriptors */
48: /*
49: * Buffer slots: two mbuf clusters buffer the incoming packets.
50: * The model has three slots. Sbuf is always occupied.
51: * sbuf (store) - Receive interrupt puts packets here.
52: * hbuf (hold) - When sbuf is full, put cluster here and
53: * wakeup read (replace sbuf with fbuf).
54: * fbuf (free) - When read is done, put cluster here.
55: * On receiving, if sbuf is full and fbuf is 0, packet is dropped.
56: */
57: caddr_t bd_sbuf; /* store slot */
58: caddr_t bd_hbuf; /* hold slot */
59: caddr_t bd_fbuf; /* free slot */
60: int bd_slen; /* current length of store buffer */
61: int bd_hlen; /* current length of hold buffer */
62:
63: int bd_bufsize; /* absolute length of buffers */
64:
65: struct bpf_if * bd_bif; /* interface descriptor */
66: u_long bd_rtout; /* Read timeout in 'ticks' */
67: struct bpf_insn *bd_filter; /* filter code */
68: u_long bd_rcount; /* number of packets received */
69: u_long bd_dcount; /* number of packets dropped */
70:
71: u_char bd_promisc; /* true if listening promiscuously */
72: u_char bd_state; /* idle, waiting, or timed out */
73: u_char bd_immediate; /* true to return on packet arrival */
1.1.1.2 ! root 74: #if BSD <= 199103
! 75: u_char bd_selcoll; /* true if selects collide */
! 76: int bd_timedout;
! 77: #if defined(__386BSD__)
! 78: pid_t bd_selpid; /* process that last selected us */
! 79: #else
! 80: struct proc * bd_selproc; /* process that last selected us */
! 81: #endif
! 82: #else /* BSD > 199103 */
! 83: u_char bd_pad; /* explicit alignment */
! 84: struct selinfo bd_sel; /* bsd select info */
! 85: #endif
1.1 root 86: };
87:
88: /*
89: * Descriptor associated with each attached hardware interface.
90: */
91: struct bpf_if {
92: struct bpf_if *bif_next; /* list of all interfaces */
93: struct bpf_d *bif_dlist; /* descriptor list */
94: struct bpf_if **bif_driverp; /* pointer into softc */
95: u_int bif_dlt; /* link layer type */
96: u_int bif_hdrlen; /* length of header (with padding) */
97: struct ifnet *bif_ifp; /* correspoding interface */
98: };
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.