FreeBSD/Linux Kernel Cross Reference
sys/net/bpfdesc.h
1 /*-
2 * Copyright (c) 1990, 1991, 1993
3 * The Regents of the University of California. 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 and Van Jacobson both of Lawrence
8 * Berkeley Laboratory.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
34 * @(#)bpfdesc.h 8.1 (Berkeley) 6/10/93
35 *
36 * $FreeBSD$
37 */
38
39 #ifndef _NET_BPFDESC_H_
40 #define _NET_BPFDESC_H_
41
42 #include <sys/callout.h>
43 #include <sys/selinfo.h>
44 #include <sys/queue.h>
45 #include <sys/conf.h>
46 #include <net/if.h>
47
48 /*
49 * Descriptor associated with each open bpf file.
50 */
51 struct bpf_d {
52 LIST_ENTRY(bpf_d) bd_next; /* Linked list of descriptors */
53 /*
54 * Buffer slots: two mbuf clusters buffer the incoming packets.
55 * The model has three slots. Sbuf is always occupied.
56 * sbuf (store) - Receive interrupt puts packets here.
57 * hbuf (hold) - When sbuf is full, put cluster here and
58 * wakeup read (replace sbuf with fbuf).
59 * fbuf (free) - When read is done, put cluster here.
60 * On receiving, if sbuf is full and fbuf is 0, packet is dropped.
61 */
62 caddr_t bd_sbuf; /* store slot */
63 caddr_t bd_hbuf; /* hold slot */
64 caddr_t bd_fbuf; /* free slot */
65 int bd_slen; /* current length of store buffer */
66 int bd_hlen; /* current length of hold buffer */
67
68 int bd_bufsize; /* absolute length of buffers */
69
70 struct bpf_if * bd_bif; /* interface descriptor */
71 u_long bd_rtout; /* Read timeout in 'ticks' */
72 struct bpf_insn *bd_rfilter; /* read filter code */
73 struct bpf_insn *bd_wfilter; /* write filter code */
74 u_long bd_rcount; /* number of packets received */
75 u_long bd_dcount; /* number of packets dropped */
76
77 u_char bd_promisc; /* true if listening promiscuously */
78 u_char bd_state; /* idle, waiting, or timed out */
79 u_char bd_immediate; /* true to return on packet arrival */
80 int bd_hdrcmplt; /* false to fill in src lladdr automatically */
81 int bd_seesent; /* true if bpf should see sent packets */
82 int bd_async; /* non-zero if packet reception should generate signal */
83 int bd_sig; /* signal to send upon packet reception */
84 struct sigio * bd_sigio; /* information for async I/O */
85 #if BSD < 199103
86 u_char bd_selcoll; /* true if selects collide */
87 int bd_timedout;
88 struct thread * bd_selthread; /* process that last selected us */
89 #else
90 u_char bd_pad; /* explicit alignment */
91 struct selinfo bd_sel; /* bsd select info */
92 #endif
93 struct mtx bd_mtx; /* mutex for this descriptor */
94 struct callout bd_callout; /* for BPF timeouts with select */
95 struct label *bd_label; /* MAC label for descriptor */
96 u_long bd_fcount; /* number of packets which matched filter */
97 pid_t bd_pid; /* PID which created descriptor */
98 char bd_pcomm[MAXCOMLEN + 1];
99 int bd_locked; /* true if descriptor is locked */
100 };
101
102 /* Values for bd_state */
103 #define BPF_IDLE 0 /* no select in progress */
104 #define BPF_WAITING 1 /* waiting for read timeout in select */
105 #define BPF_TIMED_OUT 2 /* read timeout has expired in select */
106
107 #define BPFD_LOCK(bd) mtx_lock(&(bd)->bd_mtx)
108 #define BPFD_UNLOCK(bd) mtx_unlock(&(bd)->bd_mtx)
109 #define BPFD_LOCK_ASSERT(bd) do { \
110 mtx_assert(&(bd)->bd_mtx, MA_OWNED); \
111 NET_ASSERT_GIANT(); \
112 } while (0)
113
114 /* Test whether a BPF is ready for read(). */
115 #define bpf_ready(bd) \
116 ((bd)->bd_hlen != 0 || \
117 (((bd)->bd_immediate || (bd)->bd_state == BPF_TIMED_OUT) && \
118 (bd)->bd_slen != 0))
119
120 /*
121 * External representation of the bpf descriptor
122 */
123 struct xbpf_d {
124 u_char bd_promisc;
125 u_char bd_immediate;
126 int bd_hdrcmplt;
127 int bd_seesent;
128 int bd_async;
129 u_long bd_rcount;
130 u_long bd_dcount;
131 u_long bd_fcount;
132 int bd_sig;
133 int bd_slen;
134 int bd_hlen;
135 int bd_bufsize;
136 pid_t bd_pid;
137 char bd_ifname[IFNAMSIZ];
138 char bd_pcomm[MAXCOMLEN + 1];
139 int bd_locked;
140 };
141
142 #define BPFIF_LOCK(bif) mtx_lock(&(bif)->bif_mtx)
143 #define BPFIF_UNLOCK(bif) mtx_unlock(&(bif)->bif_mtx)
144
145 #endif
Cache object: bb3bb31c0219fe8b3072dcfcf9db1fc5
|