Return to bpfdesc.h CVS log

Up to [Net/2] / Net2 / net

Annotation of Net2/net/bpfdesc.h, revision 1.1.1.1

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

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.