bpfdesc.h revision 1.41 1 1.41 ozaki /* $NetBSD: bpfdesc.h,v 1.41 2017/02/01 08:07:27 ozaki-r 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.22 kleink #include <sys/selinfo.h> /* for struct selinfo */
46 1.23 rpaulo #include <net/if.h> /* for IFNAMSIZ */
47 1.36 alnsn #include <net/bpfjit.h> /* for bpfjit_function_t */
48 1.4 mycroft
49 1.1 cgd /*
50 1.1 cgd * Descriptor associated with each open bpf file.
51 1.1 cgd */
52 1.1 cgd struct bpf_d {
53 1.1 cgd struct bpf_d *bd_next; /* Linked list of descriptors */
54 1.1 cgd /*
55 1.1 cgd * Buffer slots: two mbuf clusters buffer the incoming packets.
56 1.1 cgd * The model has three slots. Sbuf is always occupied.
57 1.1 cgd * sbuf (store) - Receive interrupt puts packets here.
58 1.1 cgd * hbuf (hold) - When sbuf is full, put cluster here and
59 1.1 cgd * wakeup read (replace sbuf with fbuf).
60 1.1 cgd * fbuf (free) - When read is done, put cluster here.
61 1.1 cgd * On receiving, if sbuf is full and fbuf is 0, packet is dropped.
62 1.1 cgd */
63 1.25 christos void * bd_sbuf; /* store slot */
64 1.25 christos void * bd_hbuf; /* hold slot */
65 1.25 christos void * bd_fbuf; /* free slot */
66 1.1 cgd int bd_slen; /* current length of store buffer */
67 1.1 cgd int bd_hlen; /* current length of hold buffer */
68 1.1 cgd
69 1.1 cgd int bd_bufsize; /* absolute length of buffers */
70 1.1 cgd
71 1.1 cgd struct bpf_if * bd_bif; /* interface descriptor */
72 1.1 cgd u_long bd_rtout; /* Read timeout in 'ticks' */
73 1.1 cgd struct bpf_insn *bd_filter; /* filter code */
74 1.1 cgd u_long bd_rcount; /* number of packets received */
75 1.1 cgd u_long bd_dcount; /* number of packets dropped */
76 1.18 darrenr u_long bd_ccount; /* number of packets captured */
77 1.1 cgd
78 1.1 cgd u_char bd_promisc; /* true if listening promiscuously */
79 1.1 cgd u_char bd_state; /* idle, waiting, or timed out */
80 1.2 cgd u_char bd_immediate; /* true to return on packet arrival */
81 1.15 thorpej int bd_hdrcmplt; /* false to fill in src lladdr */
82 1.17 darrenr int bd_seesent; /* true if bpf should see sent packets */
83 1.32 christos int bd_feedback; /* true to feed back sent packets */
84 1.11 thorpej int bd_async; /* non-zero if packet reception should generate signal */
85 1.11 thorpej pid_t bd_pgid; /* process or group id for signal */
86 1.8 mycroft #if BSD < 199103
87 1.1 cgd u_char bd_selcoll; /* true if selects collide */
88 1.2 cgd int bd_timedout;
89 1.2 cgd struct proc * bd_selproc; /* process that last selected us */
90 1.8 mycroft #else
91 1.3 deraadt u_char bd_pad; /* explicit alignment */
92 1.3 deraadt struct selinfo bd_sel; /* bsd select info */
93 1.3 deraadt #endif
94 1.26 ad callout_t bd_callout; /* for BPF timeouts with select */
95 1.23 rpaulo pid_t bd_pid; /* corresponding PID */
96 1.21 christos LIST_ENTRY(bpf_d) bd_list; /* list of all BPF's */
97 1.28 ad void *bd_sih; /* soft interrupt handle */
98 1.30 christos struct timespec bd_atime; /* access time */
99 1.30 christos struct timespec bd_mtime; /* modification time */
100 1.30 christos struct timespec bd_btime; /* birth time */
101 1.33 bouyer #ifdef _LP64
102 1.33 bouyer int bd_compat32; /* 32-bit stream on LP64 system */
103 1.33 bouyer #endif
104 1.38 rmind bpfjit_func_t bd_jitcode; /* compiled filter program */
105 1.41 ozaki size_t bd_filter_size;
106 1.1 cgd };
107 1.1 cgd
108 1.17 darrenr
109 1.17 darrenr /* Values for bd_state */
110 1.17 darrenr #define BPF_IDLE 0 /* no select in progress */
111 1.17 darrenr #define BPF_WAITING 1 /* waiting for read timeout in select */
112 1.17 darrenr #define BPF_TIMED_OUT 2 /* read timeout has expired in select */
113 1.17 darrenr
114 1.1 cgd /*
115 1.23 rpaulo * Description associated with the external representation of each
116 1.23 rpaulo * open bpf file.
117 1.23 rpaulo */
118 1.23 rpaulo struct bpf_d_ext {
119 1.23 rpaulo int32_t bde_bufsize;
120 1.27 matt uint8_t bde_promisc;
121 1.27 matt uint8_t bde_state;
122 1.27 matt uint8_t bde_immediate;
123 1.23 rpaulo int32_t bde_hdrcmplt;
124 1.23 rpaulo int32_t bde_seesent;
125 1.23 rpaulo pid_t bde_pid;
126 1.27 matt uint64_t bde_rcount; /* number of packets received */
127 1.27 matt uint64_t bde_dcount; /* number of packets dropped */
128 1.27 matt uint64_t bde_ccount; /* number of packets captured */
129 1.23 rpaulo char bde_ifname[IFNAMSIZ];
130 1.23 rpaulo };
131 1.23 rpaulo
132 1.23 rpaulo
133 1.23 rpaulo /*
134 1.1 cgd * Descriptor associated with each attached hardware interface.
135 1.1 cgd */
136 1.1 cgd struct bpf_if {
137 1.1 cgd struct bpf_if *bif_next; /* list of all interfaces */
138 1.1 cgd struct bpf_d *bif_dlist; /* descriptor list */
139 1.1 cgd struct bpf_if **bif_driverp; /* pointer into softc */
140 1.1 cgd u_int bif_dlt; /* link layer type */
141 1.1 cgd u_int bif_hdrlen; /* length of header (with padding) */
142 1.31 dyoung struct ifnet *bif_ifp; /* corresponding interface */
143 1.40 ozaki void *bif_si;
144 1.40 ozaki struct mbuf *bif_mbuf_head;
145 1.40 ozaki struct mbuf *bif_mbuf_tail;
146 1.1 cgd };
147 1.4 mycroft
148 1.24 elad #endif /* !_NET_BPFDESC_H_ */
149