xref: /netbsd/sys/net/bpfdesc.h (revision bf9ec67e)
1 /*	$NetBSD: bpfdesc.h,v 1.15 1998/04/30 00:08:19 thorpej Exp $	*/
2 
3 /*
4  * Copyright (c) 1990, 1991, 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * This code is derived from the Stanford/CMU enet packet filter,
8  * (net/enet.c) distributed as part of 4.3BSD, and code contributed
9  * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
10  * Berkeley Laboratory.
11  *
12  * Redistribution and use in source and binary forms, with or without
13  * modification, are permitted provided that the following conditions
14  * are met:
15  * 1. Redistributions of source code must retain the above copyright
16  *    notice, this list of conditions and the following disclaimer.
17  * 2. Redistributions in binary form must reproduce the above copyright
18  *    notice, this list of conditions and the following disclaimer in the
19  *    documentation and/or other materials provided with the distribution.
20  * 3. All advertising materials mentioning features or use of this software
21  *    must display the following acknowledgement:
22  *	This product includes software developed by the University of
23  *	California, Berkeley and its contributors.
24  * 4. Neither the name of the University nor the names of its contributors
25  *    may be used to endorse or promote products derived from this software
26  *    without specific prior written permission.
27  *
28  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38  * SUCH DAMAGE.
39  *
40  *	@(#)bpfdesc.h	8.1 (Berkeley) 6/10/93
41  *
42  * @(#) Header: bpfdesc.h,v 1.14 96/06/16 22:28:07 leres Exp  (LBL)
43  */
44 
45 #ifndef _NET_BPFDESC_H_
46 #define _NET_BPFDESC_H_
47 
48 #include <sys/select.h>
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 	int		bd_hdrcmplt;	/* false to fill in src lladdr */
82 	int		bd_async;	/* non-zero if packet reception should generate signal */
83 	pid_t		bd_pgid;	/* process or group id for signal */
84 #if BSD < 199103
85 	u_char		bd_selcoll;	/* true if selects collide */
86 	int		bd_timedout;
87 	struct proc *	bd_selproc;	/* process that last selected us */
88 #else
89 	u_char		bd_pad;		/* explicit alignment */
90 	struct selinfo	bd_sel;		/* bsd select info */
91 #endif
92 };
93 
94 /*
95  * Descriptor associated with each attached hardware interface.
96  */
97 struct bpf_if {
98 	struct bpf_if *bif_next;	/* list of all interfaces */
99 	struct bpf_d *bif_dlist;	/* descriptor list */
100 	struct bpf_if **bif_driverp;	/* pointer into softc */
101 	u_int bif_dlt;			/* link layer type */
102 	u_int bif_hdrlen;		/* length of header (with padding) */
103 	struct ifnet *bif_ifp;		/* correspoding interface */
104 };
105 
106 #ifdef _KERNEL
107 int	 bpf_setf __P((struct bpf_d *, struct bpf_program *));
108 #endif
109 
110 #endif /* _NET_BPFDESC_H_ */
111