bpfdesc.h revision 1.21 1 1.21 christos /* $NetBSD: bpfdesc.h,v 1.21 2004/11/30 04:28:43 christos Exp $ */
2 1.9 cgd
3 1.8 mycroft /*
4 1.8 mycroft * Copyright (c) 1990, 1991, 1993
5 1.8 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from the Stanford/CMU enet packet filter,
8 1.1 cgd * (net/enet.c) distributed as part of 4.3BSD, and code contributed
9 1.8 mycroft * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
10 1.2 cgd * Berkeley Laboratory.
11 1.1 cgd *
12 1.1 cgd * Redistribution and use in source and binary forms, with or without
13 1.1 cgd * modification, are permitted provided that the following conditions
14 1.1 cgd * are met:
15 1.1 cgd * 1. Redistributions of source code must retain the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer.
17 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
18 1.1 cgd * notice, this list of conditions and the following disclaimer in the
19 1.1 cgd * documentation and/or other materials provided with the distribution.
20 1.16 agc * 3. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd *
36 1.9 cgd * @(#)bpfdesc.h 8.1 (Berkeley) 6/10/93
37 1.12 christos *
38 1.12 christos * @(#) Header: bpfdesc.h,v 1.14 96/06/16 22:28:07 leres Exp (LBL)
39 1.1 cgd */
40 1.1 cgd
41 1.14 perry #ifndef _NET_BPFDESC_H_
42 1.14 perry #define _NET_BPFDESC_H_
43 1.14 perry
44 1.17 darrenr #include <sys/callout.h>
45 1.8 mycroft #include <sys/select.h>
46 1.4 mycroft
47 1.1 cgd /*
48 1.1 cgd * Descriptor associated with each open bpf file.
49 1.1 cgd */
50 1.1 cgd struct bpf_d {
51 1.1 cgd struct bpf_d *bd_next; /* Linked list of descriptors */
52 1.1 cgd /*
53 1.1 cgd * Buffer slots: two mbuf clusters buffer the incoming packets.
54 1.1 cgd * The model has three slots. Sbuf is always occupied.
55 1.1 cgd * sbuf (store) - Receive interrupt puts packets here.
56 1.1 cgd * hbuf (hold) - When sbuf is full, put cluster here and
57 1.1 cgd * wakeup read (replace sbuf with fbuf).
58 1.1 cgd * fbuf (free) - When read is done, put cluster here.
59 1.1 cgd * On receiving, if sbuf is full and fbuf is 0, packet is dropped.
60 1.1 cgd */
61 1.1 cgd caddr_t bd_sbuf; /* store slot */
62 1.1 cgd caddr_t bd_hbuf; /* hold slot */
63 1.1 cgd caddr_t bd_fbuf; /* free slot */
64 1.1 cgd int bd_slen; /* current length of store buffer */
65 1.1 cgd int bd_hlen; /* current length of hold buffer */
66 1.1 cgd
67 1.1 cgd int bd_bufsize; /* absolute length of buffers */
68 1.1 cgd
69 1.1 cgd struct bpf_if * bd_bif; /* interface descriptor */
70 1.1 cgd u_long bd_rtout; /* Read timeout in 'ticks' */
71 1.1 cgd struct bpf_insn *bd_filter; /* filter code */
72 1.1 cgd u_long bd_rcount; /* number of packets received */
73 1.1 cgd u_long bd_dcount; /* number of packets dropped */
74 1.18 darrenr u_long bd_ccount; /* number of packets captured */
75 1.1 cgd
76 1.1 cgd u_char bd_promisc; /* true if listening promiscuously */
77 1.1 cgd u_char bd_state; /* idle, waiting, or timed out */
78 1.2 cgd u_char bd_immediate; /* true to return on packet arrival */
79 1.15 thorpej int bd_hdrcmplt; /* false to fill in src lladdr */
80 1.17 darrenr int bd_seesent; /* true if bpf should see sent packets */
81 1.11 thorpej int bd_async; /* non-zero if packet reception should generate signal */
82 1.11 thorpej pid_t bd_pgid; /* process or group id for signal */
83 1.8 mycroft #if BSD < 199103
84 1.1 cgd u_char bd_selcoll; /* true if selects collide */
85 1.2 cgd int bd_timedout;
86 1.2 cgd struct proc * bd_selproc; /* process that last selected us */
87 1.8 mycroft #else
88 1.3 deraadt u_char bd_pad; /* explicit alignment */
89 1.3 deraadt struct selinfo bd_sel; /* bsd select info */
90 1.3 deraadt #endif
91 1.17 darrenr struct callout bd_callout; /* for BPF timeouts with select */
92 1.21 christos LIST_ENTRY(bpf_d) bd_list; /* list of all BPF's */
93 1.1 cgd };
94 1.1 cgd
95 1.17 darrenr
96 1.17 darrenr /* Values for bd_state */
97 1.17 darrenr #define BPF_IDLE 0 /* no select in progress */
98 1.17 darrenr #define BPF_WAITING 1 /* waiting for read timeout in select */
99 1.17 darrenr #define BPF_TIMED_OUT 2 /* read timeout has expired in select */
100 1.17 darrenr
101 1.1 cgd /*
102 1.1 cgd * Descriptor associated with each attached hardware interface.
103 1.1 cgd */
104 1.1 cgd struct bpf_if {
105 1.1 cgd struct bpf_if *bif_next; /* list of all interfaces */
106 1.1 cgd struct bpf_d *bif_dlist; /* descriptor list */
107 1.1 cgd struct bpf_if **bif_driverp; /* pointer into softc */
108 1.1 cgd u_int bif_dlt; /* link layer type */
109 1.1 cgd u_int bif_hdrlen; /* length of header (with padding) */
110 1.1 cgd struct ifnet *bif_ifp; /* correspoding interface */
111 1.1 cgd };
112 1.4 mycroft
113 1.10 jtc #ifdef _KERNEL
114 1.8 mycroft int bpf_setf __P((struct bpf_d *, struct bpf_program *));
115 1.8 mycroft #endif
116 1.14 perry
117 1.14 perry #endif /* _NET_BPFDESC_H_ */
118