Return to bpfdesc.h CVS log

Up to [Apple XNU] / XNU / bsd / net

Annotation of XNU/bsd/net/bpfdesc.h, revision 1.1

1.1     ! root        1: /*
        !             2:  * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
        !             3:  *
        !             4:  * @APPLE_LICENSE_HEADER_START@
        !             5:  * 
        !             6:  * The contents of this file constitute Original Code as defined in and
        !             7:  * are subject to the Apple Public Source License Version 1.1 (the
        !             8:  * "License").  You may not use this file except in compliance with the
        !             9:  * License.  Please obtain a copy of the License at
        !            10:  * http://www.apple.com/publicsource and read it before using this file.
        !            11:  * 
        !            12:  * This Original Code and all software distributed under the License are
        !            13:  * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
        !            14:  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
        !            15:  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
        !            16:  * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT.  Please see the
        !            17:  * License for the specific language governing rights and limitations
        !            18:  * under the License.
        !            19:  * 
        !            20:  * @APPLE_LICENSE_HEADER_END@
        !            21:  */
        !            22: /*
        !            23:  * Copyright (c) 1990, 1991, 1993
        !            24:  *     The Regents of the University of California.  All rights reserved.
        !            25:  *
        !            26:  * This code is derived from the Stanford/CMU enet packet filter,
        !            27:  * (net/enet.c) distributed as part of 4.3BSD, and code contributed
        !            28:  * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
        !            29:  * Berkeley Laboratory.
        !            30:  *
        !            31:  * Redistribution and use in source and binary forms, with or without
        !            32:  * modification, are permitted provided that the following conditions
        !            33:  * are met:
        !            34:  * 1. Redistributions of source code must retain the above copyright
        !            35:  *    notice, this list of conditions and the following disclaimer.
        !            36:  * 2. Redistributions in binary form must reproduce the above copyright
        !            37:  *    notice, this list of conditions and the following disclaimer in the
        !            38:  *    documentation and/or other materials provided with the distribution.
        !            39:  * 3. All advertising materials mentioning features or use of this software
        !            40:  *    must display the following acknowledgement:
        !            41:  *     This product includes software developed by the University of
        !            42:  *     California, Berkeley and its contributors.
        !            43:  * 4. Neither the name of the University nor the names of its contributors
        !            44:  *    may be used to endorse or promote products derived from this software
        !            45:  *    without specific prior written permission.
        !            46:  *
        !            47:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
        !            48:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
        !            49:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
        !            50:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
        !            51:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
        !            52:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
        !            53:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
        !            54:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
        !            55:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
        !            56:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
        !            57:  * SUCH DAMAGE.
        !            58:  *
        !            59:  *      @(#)bpfdesc.h  8.1 (Berkeley) 6/10/93
        !            60:  *
        !            61:  */
        !            62: 
        !            63: #ifndef _NET_BPFDESC_H_
        !            64: #define _NET_BPFDESC_H_
        !            65: 
        !            66: #include <sys/select.h>
        !            67: 
        !            68: /*
        !            69:  * Descriptor associated with each open bpf file.
        !            70:  */
        !            71: struct bpf_d {
        !            72:        struct bpf_d    *bd_next;       /* Linked list of descriptors */
        !            73:        /*
        !            74:         * Buffer slots: two mbuf clusters buffer the incoming packets.
        !            75:         *   The model has three slots.  Sbuf is always occupied.
        !            76:         *   sbuf (store) - Receive interrupt puts packets here.
        !            77:         *   hbuf (hold) - When sbuf is full, put cluster here and
        !            78:         *                 wakeup read (replace sbuf with fbuf).
        !            79:         *   fbuf (free) - When read is done, put cluster here.
        !            80:         * On receiving, if sbuf is full and fbuf is 0, packet is dropped.
        !            81:         */
        !            82:        caddr_t         bd_sbuf;        /* store slot */
        !            83:        caddr_t         bd_hbuf;        /* hold slot */
        !            84:        caddr_t         bd_fbuf;        /* free slot */
        !            85:        int             bd_slen;        /* current length of store buffer */
        !            86:        int             bd_hlen;        /* current length of hold buffer */
        !            87: 
        !            88:        int             bd_bufsize;     /* absolute length of buffers */
        !            89: 
        !            90:        struct bpf_if * bd_bif;         /* interface descriptor */
        !            91:        u_long          bd_rtout;       /* Read timeout in 'ticks' */
        !            92:        struct bpf_insn *bd_filter;     /* filter code */
        !            93:        u_long          bd_rcount;      /* number of packets received */
        !            94:        u_long          bd_dcount;      /* number of packets dropped */
        !            95: 
        !            96:        u_char          bd_promisc;     /* true if listening promiscuously */
        !            97:        u_char          bd_state;       /* idle, waiting, or timed out */
        !            98:        u_char          bd_immediate;   /* true to return on packet arrival */
        !            99:        int             bd_async;       /* non-zero if packet reception should generate signal */
        !           100:        int             bd_sig;         /* signal to send upon packet reception */
        !           101: #if ISFB31
        !           102:        struct sigio *  bd_sigio;       /* information for async I/O */
        !           103: #else
        !           104:        pid_t           bd_sigio;
        !           105: #endif
        !           106: 
        !           107: #if BSD < 199103
        !           108:        u_char          bd_selcoll;     /* true if selects collide */
        !           109:        int             bd_timedout;
        !           110:        struct proc *   bd_selproc;     /* process that last selected us */
        !           111: #else
        !           112:        u_char          bd_pad;         /* explicit alignment */
        !           113:        struct selinfo  bd_sel;         /* bsd select info */
        !           114: #endif
        !           115: };
        !           116: 
        !           117: /*
        !           118:  * Descriptor associated with each attached hardware interface.
        !           119:  */
        !           120: struct bpf_if {
        !           121:        struct bpf_if *bif_next;        /* list of all interfaces */
        !           122:        struct bpf_d *bif_dlist;        /* descriptor list */
        !           123:        u_int bif_dlt;                  /* link layer type */
        !           124:        u_int bif_hdrlen;               /* length of header (with padding) */
        !           125:        struct ifnet *bif_ifp;          /* corresponding interface */
        !           126: };
        !           127: 
        !           128: #endif

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