Home | History | Annotate | Line # | Download | only in net
bpfdesc.h revision 1.2
      1  1.1  cgd /*-
      2  1.1  cgd  * Copyright (c) 1991 The Regents of the University of California.
      3  1.1  cgd  * All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * This code is derived from the Stanford/CMU enet packet filter,
      6  1.1  cgd  * (net/enet.c) distributed as part of 4.3BSD, and code contributed
      7  1.2  cgd  * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
      8  1.2  cgd  * Berkeley Laboratory.
      9  1.1  cgd  *
     10  1.1  cgd  * Redistribution and use in source and binary forms, with or without
     11  1.1  cgd  * modification, are permitted provided that the following conditions
     12  1.1  cgd  * are met:
     13  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     14  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     15  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     16  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     17  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     18  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     19  1.1  cgd  *    must display the following acknowledgement:
     20  1.1  cgd  *	This product includes software developed by the University of
     21  1.1  cgd  *	California, Berkeley and its contributors.
     22  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     23  1.1  cgd  *    may be used to endorse or promote products derived from this software
     24  1.1  cgd  *    without specific prior written permission.
     25  1.1  cgd  *
     26  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36  1.1  cgd  * SUCH DAMAGE.
     37  1.1  cgd  *
     38  1.1  cgd  *	@(#)bpfdesc.h	7.1 (Berkeley) 5/7/91
     39  1.1  cgd  *
     40  1.2  cgd  * @(#) $Header: /tank/opengrok/rsync2/NetBSD/src/sys/net/bpfdesc.h,v 1.2 1993/03/25 00:27:55 cgd Exp $ (LBL)
     41  1.1  cgd  */
     42  1.1  cgd 
     43  1.1  cgd /*
     44  1.1  cgd  * Descriptor associated with each open bpf file.
     45  1.1  cgd  */
     46  1.1  cgd struct bpf_d {
     47  1.1  cgd 	struct bpf_d	*bd_next;	/* Linked list of descriptors */
     48  1.1  cgd 	/*
     49  1.1  cgd 	 * Buffer slots: two mbuf clusters buffer the incoming packets.
     50  1.1  cgd 	 *   The model has three slots.  Sbuf is always occupied.
     51  1.1  cgd 	 *   sbuf (store) - Receive interrupt puts packets here.
     52  1.1  cgd 	 *   hbuf (hold) - When sbuf is full, put cluster here and
     53  1.1  cgd 	 *                 wakeup read (replace sbuf with fbuf).
     54  1.1  cgd 	 *   fbuf (free) - When read is done, put cluster here.
     55  1.1  cgd 	 * On receiving, if sbuf is full and fbuf is 0, packet is dropped.
     56  1.1  cgd 	 */
     57  1.1  cgd 	caddr_t		bd_sbuf;	/* store slot */
     58  1.1  cgd 	caddr_t		bd_hbuf;	/* hold slot */
     59  1.1  cgd 	caddr_t		bd_fbuf;	/* free slot */
     60  1.1  cgd 	int 		bd_slen;	/* current length of store buffer */
     61  1.1  cgd 	int 		bd_hlen;	/* current length of hold buffer */
     62  1.1  cgd 
     63  1.1  cgd 	int		bd_bufsize;	/* absolute length of buffers */
     64  1.1  cgd 
     65  1.1  cgd 	struct bpf_if *	bd_bif;		/* interface descriptor */
     66  1.1  cgd 	u_long		bd_rtout;	/* Read timeout in 'ticks' */
     67  1.1  cgd 	struct bpf_insn *bd_filter; 	/* filter code */
     68  1.1  cgd 	u_long		bd_rcount;	/* number of packets received */
     69  1.1  cgd 	u_long		bd_dcount;	/* number of packets dropped */
     70  1.1  cgd 
     71  1.1  cgd 	u_char		bd_promisc;	/* true if listening promiscuously */
     72  1.1  cgd 	u_char		bd_state;	/* idle, waiting, or timed out */
     73  1.2  cgd 	u_char		bd_immediate;	/* true to return on packet arrival */
     74  1.1  cgd 	u_char		bd_selcoll;	/* true if selects collide */
     75  1.2  cgd 	int		bd_timedout;
     76  1.2  cgd 	struct proc *	bd_selproc;	/* process that last selected us */
     77  1.1  cgd };
     78  1.1  cgd 
     79  1.1  cgd /*
     80  1.1  cgd  * Descriptor associated with each attached hardware interface.
     81  1.1  cgd  */
     82  1.1  cgd struct bpf_if {
     83  1.1  cgd 	struct bpf_if *bif_next;	/* list of all interfaces */
     84  1.1  cgd 	struct bpf_d *bif_dlist;	/* descriptor list */
     85  1.1  cgd 	struct bpf_if **bif_driverp;	/* pointer into softc */
     86  1.1  cgd 	u_int bif_dlt;			/* link layer type */
     87  1.1  cgd 	u_int bif_hdrlen;		/* length of header (with padding) */
     88  1.1  cgd 	struct ifnet *bif_ifp;		/* correspoding interface */
     89  1.1  cgd };
     90