bpf.c revision 1.1.1.2 1 1.1.1.2 fvdl /*
2 1.1.1.2 fvdl * Copyright (c) 1990, 1991, 1993
3 1.1.1.2 fvdl * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from the Stanford/CMU enet packet filter,
6 1.1 cgd * (net/enet.c) distributed as part of 4.3BSD, and code contributed
7 1.1.1.2 fvdl * to Berkeley by Steven McCanne and Van Jacobson both of Lawrence
8 1.1.1.2 fvdl * Berkeley Laboratory.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd *
38 1.1.1.2 fvdl * @(#)bpf.c 8.2 (Berkeley) 3/28/94
39 1.1 cgd *
40 1.1 cgd * static char rcsid[] =
41 1.1.1.2 fvdl * "$Header: /tank/opengrok/rsync2/NetBSD/src/sys/net/bpf.c,v 1.1.1.2 1998/03/01 02:10:05 fvdl Exp $";
42 1.1 cgd */
43 1.1 cgd
44 1.1 cgd #include "bpfilter.h"
45 1.1 cgd
46 1.1.1.2 fvdl #if NBPFILTER > 0
47 1.1.1.2 fvdl
48 1.1.1.2 fvdl #ifndef __GNUC__
49 1.1.1.2 fvdl #define inline
50 1.1.1.2 fvdl #else
51 1.1.1.2 fvdl #define inline __inline
52 1.1.1.2 fvdl #endif
53 1.1 cgd
54 1.1 cgd #include <sys/param.h>
55 1.1 cgd #include <sys/systm.h>
56 1.1 cgd #include <sys/mbuf.h>
57 1.1 cgd #include <sys/buf.h>
58 1.1.1.2 fvdl #include <sys/time.h>
59 1.1 cgd #include <sys/proc.h>
60 1.1 cgd #include <sys/user.h>
61 1.1 cgd #include <sys/ioctl.h>
62 1.1.1.2 fvdl #include <sys/map.h>
63 1.1 cgd
64 1.1 cgd #include <sys/file.h>
65 1.1.1.2 fvdl #if defined(sparc) && BSD < 199103
66 1.1 cgd #include <sys/stream.h>
67 1.1 cgd #endif
68 1.1 cgd #include <sys/tty.h>
69 1.1 cgd #include <sys/uio.h>
70 1.1 cgd
71 1.1 cgd #include <sys/protosw.h>
72 1.1 cgd #include <sys/socket.h>
73 1.1 cgd #include <net/if.h>
74 1.1 cgd
75 1.1 cgd #include <net/bpf.h>
76 1.1 cgd #include <net/bpfdesc.h>
77 1.1 cgd
78 1.1 cgd #include <sys/errno.h>
79 1.1 cgd
80 1.1 cgd #include <netinet/in.h>
81 1.1 cgd #include <netinet/if_ether.h>
82 1.1 cgd #include <sys/kernel.h>
83 1.1 cgd
84 1.1.1.2 fvdl /*
85 1.1.1.2 fvdl * Older BSDs don't have kernel malloc.
86 1.1.1.2 fvdl */
87 1.1.1.2 fvdl #if BSD < 199103
88 1.1.1.2 fvdl extern bcopy();
89 1.1.1.2 fvdl static caddr_t bpf_alloc();
90 1.1.1.2 fvdl #include <net/bpf_compat.h>
91 1.1.1.2 fvdl #define BPF_BUFSIZE (MCLBYTES-8)
92 1.1.1.2 fvdl #define UIOMOVE(cp, len, code, uio) uiomove(cp, len, code, uio)
93 1.1.1.2 fvdl #else
94 1.1.1.2 fvdl #define BPF_BUFSIZE 4096
95 1.1.1.2 fvdl #define UIOMOVE(cp, len, code, uio) uiomove(cp, len, uio)
96 1.1.1.2 fvdl #endif
97 1.1.1.2 fvdl
98 1.1 cgd #define PRINET 26 /* interruptible */
99 1.1 cgd
100 1.1 cgd /*
101 1.1 cgd * The default read buffer size is patchable.
102 1.1 cgd */
103 1.1.1.2 fvdl int bpf_bufsize = BPF_BUFSIZE;
104 1.1 cgd
105 1.1 cgd /*
106 1.1 cgd * bpf_iflist is the list of interfaces; each corresponds to an ifnet
107 1.1 cgd * bpf_dtab holds the descriptors, indexed by minor device #
108 1.1.1.2 fvdl */
109 1.1.1.2 fvdl struct bpf_if *bpf_iflist;
110 1.1.1.2 fvdl struct bpf_d bpf_dtab[NBPFILTER];
111 1.1.1.2 fvdl
112 1.1.1.2 fvdl #if BSD >= 199207
113 1.1.1.2 fvdl /*
114 1.1.1.2 fvdl * bpfilterattach() is called at boot time in new systems. We do
115 1.1.1.2 fvdl * nothing here since old systems will not call this.
116 1.1.1.2 fvdl */
117 1.1.1.2 fvdl /* ARGSUSED */
118 1.1.1.2 fvdl void
119 1.1.1.2 fvdl bpfilterattach(n)
120 1.1.1.2 fvdl int n;
121 1.1.1.2 fvdl {
122 1.1.1.2 fvdl }
123 1.1.1.2 fvdl #endif
124 1.1.1.2 fvdl
125 1.1.1.2 fvdl static int bpf_allocbufs __P((struct bpf_d *));
126 1.1.1.2 fvdl static int bpf_allocbufs __P((struct bpf_d *));
127 1.1.1.2 fvdl static void bpf_freed __P((struct bpf_d *));
128 1.1.1.2 fvdl static void bpf_freed __P((struct bpf_d *));
129 1.1.1.2 fvdl static void bpf_ifname __P((struct ifnet *, struct ifreq *));
130 1.1.1.2 fvdl static void bpf_ifname __P((struct ifnet *, struct ifreq *));
131 1.1.1.2 fvdl static void bpf_mcopy __P((const void *, void *, u_int));
132 1.1.1.2 fvdl static int bpf_movein __P((struct uio *, int,
133 1.1.1.2 fvdl struct mbuf **, struct sockaddr *, int *));
134 1.1.1.2 fvdl static int bpf_setif __P((struct bpf_d *, struct ifreq *));
135 1.1.1.2 fvdl static int bpf_setif __P((struct bpf_d *, struct ifreq *));
136 1.1.1.2 fvdl static inline void
137 1.1.1.2 fvdl bpf_wakeup __P((struct bpf_d *));
138 1.1.1.2 fvdl static void catchpacket __P((struct bpf_d *, u_char *, u_int,
139 1.1.1.2 fvdl u_int, void (*)(const void *, void *, u_int)));
140 1.1.1.2 fvdl static void reset_d __P((struct bpf_d *));
141 1.1 cgd
142 1.1 cgd static int
143 1.1.1.2 fvdl bpf_movein(uio, linktype, mp, sockp, datlen)
144 1.1 cgd register struct uio *uio;
145 1.1.1.2 fvdl int linktype, *datlen;
146 1.1 cgd register struct mbuf **mp;
147 1.1 cgd register struct sockaddr *sockp;
148 1.1 cgd {
149 1.1 cgd struct mbuf *m;
150 1.1 cgd int error;
151 1.1 cgd int len;
152 1.1 cgd int hlen;
153 1.1 cgd
154 1.1 cgd /*
155 1.1 cgd * Build a sockaddr based on the data link layer type.
156 1.1 cgd * We do this at this level because the ethernet header
157 1.1 cgd * is copied directly into the data field of the sockaddr.
158 1.1 cgd * In the case of SLIP, there is no header and the packet
159 1.1 cgd * is forwarded as is.
160 1.1 cgd * Also, we are careful to leave room at the front of the mbuf
161 1.1 cgd * for the link level header.
162 1.1 cgd */
163 1.1 cgd switch (linktype) {
164 1.1.1.2 fvdl
165 1.1 cgd case DLT_SLIP:
166 1.1 cgd sockp->sa_family = AF_INET;
167 1.1 cgd hlen = 0;
168 1.1 cgd break;
169 1.1 cgd
170 1.1 cgd case DLT_EN10MB:
171 1.1 cgd sockp->sa_family = AF_UNSPEC;
172 1.1 cgd /* XXX Would MAXLINKHDR be better? */
173 1.1 cgd hlen = sizeof(struct ether_header);
174 1.1 cgd break;
175 1.1 cgd
176 1.1.1.2 fvdl case DLT_FDDI:
177 1.1 cgd sockp->sa_family = AF_UNSPEC;
178 1.1 cgd /* XXX 4(FORMAC)+6(dst)+6(src)+3(LLC)+5(SNAP) */
179 1.1 cgd hlen = 24;
180 1.1 cgd break;
181 1.1 cgd
182 1.1.1.2 fvdl case DLT_NULL:
183 1.1.1.2 fvdl sockp->sa_family = AF_UNSPEC;
184 1.1.1.2 fvdl hlen = 0;
185 1.1.1.2 fvdl break;
186 1.1.1.2 fvdl
187 1.1 cgd default:
188 1.1 cgd return (EIO);
189 1.1 cgd }
190 1.1 cgd
191 1.1 cgd len = uio->uio_resid;
192 1.1.1.2 fvdl *datlen = len - hlen;
193 1.1 cgd if ((unsigned)len > MCLBYTES)
194 1.1 cgd return (EIO);
195 1.1 cgd
196 1.1 cgd MGET(m, M_WAIT, MT_DATA);
197 1.1 cgd if (m == 0)
198 1.1 cgd return (ENOBUFS);
199 1.1 cgd if (len > MLEN) {
200 1.1.1.2 fvdl #if BSD >= 199103
201 1.1 cgd MCLGET(m, M_WAIT);
202 1.1 cgd if ((m->m_flags & M_EXT) == 0) {
203 1.1.1.2 fvdl #else
204 1.1.1.2 fvdl MCLGET(m);
205 1.1.1.2 fvdl if (m->m_len != MCLBYTES) {
206 1.1.1.2 fvdl #endif
207 1.1 cgd error = ENOBUFS;
208 1.1 cgd goto bad;
209 1.1 cgd }
210 1.1 cgd }
211 1.1 cgd m->m_len = len;
212 1.1 cgd *mp = m;
213 1.1 cgd /*
214 1.1 cgd * Make room for link header.
215 1.1 cgd */
216 1.1.1.2 fvdl if (hlen != 0) {
217 1.1 cgd m->m_len -= hlen;
218 1.1.1.2 fvdl #if BSD >= 199103
219 1.1 cgd m->m_data += hlen; /* XXX */
220 1.1.1.2 fvdl #else
221 1.1.1.2 fvdl m->m_off += hlen;
222 1.1.1.2 fvdl #endif
223 1.1.1.2 fvdl error = UIOMOVE((caddr_t)sockp->sa_data, hlen, UIO_WRITE, uio);
224 1.1 cgd if (error)
225 1.1 cgd goto bad;
226 1.1 cgd }
227 1.1.1.2 fvdl error = UIOMOVE(mtod(m, caddr_t), len - hlen, UIO_WRITE, uio);
228 1.1.1.2 fvdl if (!error)
229 1.1 cgd return (0);
230 1.1 cgd bad:
231 1.1 cgd m_freem(m);
232 1.1 cgd return (error);
233 1.1 cgd }
234 1.1 cgd
235 1.1 cgd /*
236 1.1.1.2 fvdl * Attach file to the bpf interface, i.e. make d listen on bp.
237 1.1 cgd * Must be called at splimp.
238 1.1 cgd */
239 1.1 cgd static void
240 1.1 cgd bpf_attachd(d, bp)
241 1.1 cgd struct bpf_d *d;
242 1.1 cgd struct bpf_if *bp;
243 1.1 cgd {
244 1.1.1.2 fvdl /*
245 1.1.1.2 fvdl * Point d at bp, and add d to the interface's list of listeners.
246 1.1.1.2 fvdl * Finally, point the driver's bpf cookie at the interface so
247 1.1.1.2 fvdl * it will divert packets to bpf.
248 1.1.1.2 fvdl */
249 1.1 cgd d->bd_bif = bp;
250 1.1 cgd d->bd_next = bp->bif_dlist;
251 1.1 cgd bp->bif_dlist = d;
252 1.1 cgd
253 1.1 cgd *bp->bif_driverp = bp;
254 1.1 cgd }
255 1.1 cgd
256 1.1.1.2 fvdl /*
257 1.1.1.2 fvdl * Detach a file from its interface.
258 1.1.1.2 fvdl */
259 1.1 cgd static void
260 1.1 cgd bpf_detachd(d)
261 1.1 cgd struct bpf_d *d;
262 1.1 cgd {
263 1.1 cgd struct bpf_d **p;
264 1.1 cgd struct bpf_if *bp;
265 1.1 cgd
266 1.1 cgd bp = d->bd_bif;
267 1.1 cgd /*
268 1.1 cgd * Check if this descriptor had requested promiscuous mode.
269 1.1 cgd * If so, turn it off.
270 1.1 cgd */
271 1.1 cgd if (d->bd_promisc) {
272 1.1 cgd d->bd_promisc = 0;
273 1.1 cgd if (ifpromisc(bp->bif_ifp, 0))
274 1.1 cgd /*
275 1.1 cgd * Something is really wrong if we were able to put
276 1.1 cgd * the driver into promiscuous mode, but can't
277 1.1 cgd * take it out.
278 1.1 cgd */
279 1.1.1.2 fvdl panic("bpf: ifpromisc failed");
280 1.1 cgd }
281 1.1.1.2 fvdl /* Remove d from the interface's descriptor list. */
282 1.1 cgd p = &bp->bif_dlist;
283 1.1 cgd while (*p != d) {
284 1.1 cgd p = &(*p)->bd_next;
285 1.1 cgd if (*p == 0)
286 1.1 cgd panic("bpf_detachd: descriptor not in list");
287 1.1 cgd }
288 1.1 cgd *p = (*p)->bd_next;
289 1.1 cgd if (bp->bif_dlist == 0)
290 1.1 cgd /*
291 1.1 cgd * Let the driver know that there are no more listeners.
292 1.1 cgd */
293 1.1 cgd *d->bd_bif->bif_driverp = 0;
294 1.1 cgd d->bd_bif = 0;
295 1.1 cgd }
296 1.1 cgd
297 1.1 cgd
298 1.1 cgd /*
299 1.1.1.2 fvdl * Mark a descriptor free by making it point to itself.
300 1.1 cgd * This is probably cheaper than marking with a constant since
301 1.1 cgd * the address should be in a register anyway.
302 1.1 cgd */
303 1.1 cgd #define D_ISFREE(d) ((d) == (d)->bd_next)
304 1.1 cgd #define D_MARKFREE(d) ((d)->bd_next = (d))
305 1.1 cgd #define D_MARKUSED(d) ((d)->bd_next = 0)
306 1.1 cgd
307 1.1 cgd /*
308 1.1.1.2 fvdl * Open ethernet device. Returns ENXIO for illegal minor device number,
309 1.1.1.2 fvdl * EBUSY if file is open by another process.
310 1.1 cgd */
311 1.1 cgd /* ARGSUSED */
312 1.1 cgd int
313 1.1 cgd bpfopen(dev, flag)
314 1.1 cgd dev_t dev;
315 1.1 cgd int flag;
316 1.1 cgd {
317 1.1 cgd register struct bpf_d *d;
318 1.1.1.2 fvdl
319 1.1 cgd if (minor(dev) >= NBPFILTER)
320 1.1 cgd return (ENXIO);
321 1.1 cgd /*
322 1.1 cgd * Each minor can be opened by only one process. If the requested
323 1.1 cgd * minor is in use, return EBUSY.
324 1.1 cgd */
325 1.1 cgd d = &bpf_dtab[minor(dev)];
326 1.1.1.2 fvdl if (!D_ISFREE(d))
327 1.1 cgd return (EBUSY);
328 1.1 cgd
329 1.1.1.2 fvdl /* Mark "free" and do most initialization. */
330 1.1.1.2 fvdl bzero((char *)d, sizeof(*d));
331 1.1.1.2 fvdl d->bd_bufsize = bpf_bufsize;
332 1.1.1.2 fvdl
333 1.1 cgd return (0);
334 1.1 cgd }
335 1.1 cgd
336 1.1 cgd /*
337 1.1 cgd * Close the descriptor by detaching it from its interface,
338 1.1 cgd * deallocating its buffers, and marking it free.
339 1.1 cgd */
340 1.1 cgd /* ARGSUSED */
341 1.1.1.2 fvdl int
342 1.1 cgd bpfclose(dev, flag)
343 1.1 cgd dev_t dev;
344 1.1 cgd int flag;
345 1.1 cgd {
346 1.1 cgd register struct bpf_d *d = &bpf_dtab[minor(dev)];
347 1.1.1.2 fvdl register int s;
348 1.1 cgd
349 1.1 cgd s = splimp();
350 1.1 cgd if (d->bd_bif)
351 1.1 cgd bpf_detachd(d);
352 1.1 cgd splx(s);
353 1.1.1.2 fvdl bpf_freed(d);
354 1.1 cgd
355 1.1.1.2 fvdl return (0);
356 1.1 cgd }
357 1.1 cgd
358 1.1 cgd /*
359 1.1.1.2 fvdl * Support for SunOS, which does not have tsleep.
360 1.1.1.2 fvdl */
361 1.1.1.2 fvdl #if BSD < 199103
362 1.1.1.2 fvdl static
363 1.1.1.2 fvdl bpf_timeout(arg)
364 1.1.1.2 fvdl caddr_t arg;
365 1.1.1.2 fvdl {
366 1.1.1.2 fvdl struct bpf_d *d = (struct bpf_d *)arg;
367 1.1.1.2 fvdl d->bd_timedout = 1;
368 1.1.1.2 fvdl wakeup(arg);
369 1.1.1.2 fvdl }
370 1.1.1.2 fvdl
371 1.1.1.2 fvdl #define BPF_SLEEP(chan, pri, s, t) bpf_sleep((struct bpf_d *)chan)
372 1.1.1.2 fvdl
373 1.1.1.2 fvdl int
374 1.1.1.2 fvdl bpf_sleep(d)
375 1.1.1.2 fvdl register struct bpf_d *d;
376 1.1.1.2 fvdl {
377 1.1.1.2 fvdl register int rto = d->bd_rtout;
378 1.1.1.2 fvdl register int st;
379 1.1.1.2 fvdl
380 1.1.1.2 fvdl if (rto != 0) {
381 1.1.1.2 fvdl d->bd_timedout = 0;
382 1.1.1.2 fvdl timeout(bpf_timeout, (caddr_t)d, rto);
383 1.1.1.2 fvdl }
384 1.1.1.2 fvdl st = sleep((caddr_t)d, PRINET|PCATCH);
385 1.1.1.2 fvdl if (rto != 0) {
386 1.1.1.2 fvdl if (d->bd_timedout == 0)
387 1.1.1.2 fvdl untimeout(bpf_timeout, (caddr_t)d);
388 1.1.1.2 fvdl else if (st == 0)
389 1.1.1.2 fvdl return EWOULDBLOCK;
390 1.1.1.2 fvdl }
391 1.1.1.2 fvdl return (st != 0) ? EINTR : 0;
392 1.1.1.2 fvdl }
393 1.1.1.2 fvdl #else
394 1.1.1.2 fvdl #define BPF_SLEEP tsleep
395 1.1.1.2 fvdl #endif
396 1.1.1.2 fvdl
397 1.1.1.2 fvdl /*
398 1.1 cgd * Rotate the packet buffers in descriptor d. Move the store buffer
399 1.1.1.2 fvdl * into the hold slot, and the free buffer into the store slot.
400 1.1 cgd * Zero the length of the new store buffer.
401 1.1 cgd */
402 1.1 cgd #define ROTATE_BUFFERS(d) \
403 1.1 cgd (d)->bd_hbuf = (d)->bd_sbuf; \
404 1.1 cgd (d)->bd_hlen = (d)->bd_slen; \
405 1.1 cgd (d)->bd_sbuf = (d)->bd_fbuf; \
406 1.1 cgd (d)->bd_slen = 0; \
407 1.1.1.2 fvdl (d)->bd_fbuf = 0;
408 1.1 cgd /*
409 1.1 cgd * bpfread - read next chunk of packets from buffers
410 1.1 cgd */
411 1.1 cgd int
412 1.1 cgd bpfread(dev, uio)
413 1.1 cgd dev_t dev;
414 1.1 cgd register struct uio *uio;
415 1.1 cgd {
416 1.1 cgd register struct bpf_d *d = &bpf_dtab[minor(dev)];
417 1.1 cgd int error;
418 1.1 cgd int s;
419 1.1 cgd
420 1.1 cgd /*
421 1.1.1.2 fvdl * Restrict application to use a buffer the same size as
422 1.1 cgd * as kernel buffers.
423 1.1 cgd */
424 1.1 cgd if (uio->uio_resid != d->bd_bufsize)
425 1.1 cgd return (EINVAL);
426 1.1 cgd
427 1.1 cgd s = splimp();
428 1.1 cgd /*
429 1.1.1.2 fvdl * If the hold buffer is empty, then do a timed sleep, which
430 1.1.1.2 fvdl * ends when the timeout expires or when enough packets
431 1.1.1.2 fvdl * have arrived to fill the store buffer.
432 1.1 cgd */
433 1.1 cgd while (d->bd_hbuf == 0) {
434 1.1 cgd if (d->bd_immediate && d->bd_slen != 0) {
435 1.1 cgd /*
436 1.1 cgd * A packet(s) either arrived since the previous
437 1.1 cgd * read or arrived while we were asleep.
438 1.1 cgd * Rotate the buffers and return what's here.
439 1.1 cgd */
440 1.1 cgd ROTATE_BUFFERS(d);
441 1.1 cgd break;
442 1.1 cgd }
443 1.1.1.2 fvdl error = BPF_SLEEP((caddr_t)d, PRINET|PCATCH, "bpf",
444 1.1.1.2 fvdl d->bd_rtout);
445 1.1 cgd if (error == EINTR || error == ERESTART) {
446 1.1 cgd splx(s);
447 1.1 cgd return (error);
448 1.1 cgd }
449 1.1 cgd if (error == EWOULDBLOCK) {
450 1.1 cgd /*
451 1.1 cgd * On a timeout, return what's in the buffer,
452 1.1 cgd * which may be nothing. If there is something
453 1.1 cgd * in the store buffer, we can rotate the buffers.
454 1.1 cgd */
455 1.1 cgd if (d->bd_hbuf)
456 1.1 cgd /*
457 1.1.1.2 fvdl * We filled up the buffer in between
458 1.1 cgd * getting the timeout and arriving
459 1.1 cgd * here, so we don't need to rotate.
460 1.1 cgd */
461 1.1 cgd break;
462 1.1 cgd
463 1.1 cgd if (d->bd_slen == 0) {
464 1.1 cgd splx(s);
465 1.1 cgd return (0);
466 1.1 cgd }
467 1.1 cgd ROTATE_BUFFERS(d);
468 1.1 cgd break;
469 1.1 cgd }
470 1.1 cgd }
471 1.1 cgd /*
472 1.1 cgd * At this point, we know we have something in the hold slot.
473 1.1 cgd */
474 1.1 cgd splx(s);
475 1.1.1.2 fvdl
476 1.1.1.2 fvdl /*
477 1.1 cgd * Move data from hold buffer into user space.
478 1.1 cgd * We know the entire buffer is transferred since
479 1.1 cgd * we checked above that the read buffer is bpf_bufsize bytes.
480 1.1 cgd */
481 1.1.1.2 fvdl error = UIOMOVE(d->bd_hbuf, d->bd_hlen, UIO_READ, uio);
482 1.1 cgd
483 1.1 cgd s = splimp();
484 1.1 cgd d->bd_fbuf = d->bd_hbuf;
485 1.1 cgd d->bd_hbuf = 0;
486 1.1.1.2 fvdl d->bd_hlen = 0;
487 1.1 cgd splx(s);
488 1.1.1.2 fvdl
489 1.1 cgd return (error);
490 1.1 cgd }
491 1.1 cgd
492 1.1 cgd
493 1.1 cgd /*
494 1.1.1.2 fvdl * If there are processes sleeping on this descriptor, wake them up.
495 1.1 cgd */
496 1.1 cgd static inline void
497 1.1 cgd bpf_wakeup(d)
498 1.1 cgd register struct bpf_d *d;
499 1.1 cgd {
500 1.1 cgd wakeup((caddr_t)d);
501 1.1.1.2 fvdl #if BSD >= 199103
502 1.1.1.2 fvdl selwakeup(&d->bd_sel);
503 1.1.1.2 fvdl /* XXX */
504 1.1.1.2 fvdl d->bd_sel.si_pid = 0;
505 1.1.1.2 fvdl #else
506 1.1 cgd if (d->bd_selproc) {
507 1.1 cgd selwakeup(d->bd_selproc, (int)d->bd_selcoll);
508 1.1 cgd d->bd_selcoll = 0;
509 1.1 cgd d->bd_selproc = 0;
510 1.1 cgd }
511 1.1.1.2 fvdl #endif
512 1.1 cgd }
513 1.1 cgd
514 1.1 cgd int
515 1.1 cgd bpfwrite(dev, uio)
516 1.1 cgd dev_t dev;
517 1.1 cgd struct uio *uio;
518 1.1 cgd {
519 1.1 cgd register struct bpf_d *d = &bpf_dtab[minor(dev)];
520 1.1 cgd struct ifnet *ifp;
521 1.1 cgd struct mbuf *m;
522 1.1 cgd int error, s;
523 1.1 cgd static struct sockaddr dst;
524 1.1.1.2 fvdl int datlen;
525 1.1 cgd
526 1.1 cgd if (d->bd_bif == 0)
527 1.1 cgd return (ENXIO);
528 1.1 cgd
529 1.1 cgd ifp = d->bd_bif->bif_ifp;
530 1.1 cgd
531 1.1 cgd if (uio->uio_resid == 0)
532 1.1 cgd return (0);
533 1.1 cgd
534 1.1.1.2 fvdl error = bpf_movein(uio, (int)d->bd_bif->bif_dlt, &m, &dst, &datlen);
535 1.1 cgd if (error)
536 1.1 cgd return (error);
537 1.1 cgd
538 1.1.1.2 fvdl if (datlen > ifp->if_mtu)
539 1.1.1.2 fvdl return (EMSGSIZE);
540 1.1.1.2 fvdl
541 1.1 cgd s = splnet();
542 1.1.1.2 fvdl #if BSD >= 199103
543 1.1.1.2 fvdl error = (*ifp->if_output)(ifp, m, &dst, (struct rtentry *)0);
544 1.1.1.2 fvdl #else
545 1.1 cgd error = (*ifp->if_output)(ifp, m, &dst);
546 1.1.1.2 fvdl #endif
547 1.1 cgd splx(s);
548 1.1 cgd /*
549 1.1.1.2 fvdl * The driver frees the mbuf.
550 1.1 cgd */
551 1.1 cgd return (error);
552 1.1 cgd }
553 1.1 cgd
554 1.1 cgd /*
555 1.1.1.2 fvdl * Reset a descriptor by flushing its packet buffer and clearing the
556 1.1.1.2 fvdl * receive and drop counts. Should be called at splimp.
557 1.1 cgd */
558 1.1 cgd static void
559 1.1 cgd reset_d(d)
560 1.1 cgd struct bpf_d *d;
561 1.1 cgd {
562 1.1 cgd if (d->bd_hbuf) {
563 1.1 cgd /* Free the hold buffer. */
564 1.1 cgd d->bd_fbuf = d->bd_hbuf;
565 1.1 cgd d->bd_hbuf = 0;
566 1.1 cgd }
567 1.1 cgd d->bd_slen = 0;
568 1.1.1.2 fvdl d->bd_hlen = 0;
569 1.1 cgd d->bd_rcount = 0;
570 1.1 cgd d->bd_dcount = 0;
571 1.1 cgd }
572 1.1 cgd
573 1.1 cgd /*
574 1.1 cgd * FIONREAD Check for read packet available.
575 1.1 cgd * SIOCGIFADDR Get interface address - convenient hook to driver.
576 1.1 cgd * BIOCGBLEN Get buffer len [for read()].
577 1.1 cgd * BIOCSETF Set ethernet read filter.
578 1.1 cgd * BIOCFLUSH Flush read packet buffer.
579 1.1 cgd * BIOCPROMISC Put interface into promiscuous mode.
580 1.1 cgd * BIOCGDLT Get link layer type.
581 1.1 cgd * BIOCGETIF Get interface name.
582 1.1 cgd * BIOCSETIF Set interface.
583 1.1 cgd * BIOCSRTIMEOUT Set read timeout.
584 1.1 cgd * BIOCGRTIMEOUT Get read timeout.
585 1.1 cgd * BIOCGSTATS Get packet stats.
586 1.1 cgd * BIOCIMMEDIATE Set immediate mode.
587 1.1.1.2 fvdl * BIOCVERSION Get filter language version.
588 1.1 cgd */
589 1.1 cgd /* ARGSUSED */
590 1.1 cgd int
591 1.1 cgd bpfioctl(dev, cmd, addr, flag)
592 1.1 cgd dev_t dev;
593 1.1 cgd int cmd;
594 1.1 cgd caddr_t addr;
595 1.1 cgd int flag;
596 1.1 cgd {
597 1.1 cgd register struct bpf_d *d = &bpf_dtab[minor(dev)];
598 1.1 cgd int s, error = 0;
599 1.1 cgd
600 1.1 cgd switch (cmd) {
601 1.1 cgd
602 1.1 cgd default:
603 1.1 cgd error = EINVAL;
604 1.1 cgd break;
605 1.1 cgd
606 1.1 cgd /*
607 1.1 cgd * Check for read packet available.
608 1.1 cgd */
609 1.1 cgd case FIONREAD:
610 1.1 cgd {
611 1.1 cgd int n;
612 1.1.1.2 fvdl
613 1.1 cgd s = splimp();
614 1.1 cgd n = d->bd_slen;
615 1.1.1.2 fvdl if (d->bd_hbuf)
616 1.1 cgd n += d->bd_hlen;
617 1.1 cgd splx(s);
618 1.1 cgd
619 1.1 cgd *(int *)addr = n;
620 1.1 cgd break;
621 1.1 cgd }
622 1.1 cgd
623 1.1 cgd case SIOCGIFADDR:
624 1.1 cgd {
625 1.1 cgd struct ifnet *ifp;
626 1.1 cgd
627 1.1 cgd if (d->bd_bif == 0)
628 1.1 cgd error = EINVAL;
629 1.1 cgd else {
630 1.1 cgd ifp = d->bd_bif->bif_ifp;
631 1.1.1.2 fvdl error = (*ifp->if_ioctl)(ifp, cmd, addr);
632 1.1 cgd }
633 1.1 cgd break;
634 1.1 cgd }
635 1.1 cgd
636 1.1 cgd /*
637 1.1 cgd * Get buffer len [for read()].
638 1.1 cgd */
639 1.1 cgd case BIOCGBLEN:
640 1.1 cgd *(u_int *)addr = d->bd_bufsize;
641 1.1 cgd break;
642 1.1 cgd
643 1.1 cgd /*
644 1.1.1.2 fvdl * Set buffer length.
645 1.1 cgd */
646 1.1.1.2 fvdl case BIOCSBLEN:
647 1.1.1.2 fvdl #if BSD < 199103
648 1.1.1.2 fvdl error = EINVAL;
649 1.1.1.2 fvdl #else
650 1.1.1.2 fvdl if (d->bd_bif != 0)
651 1.1.1.2 fvdl error = EINVAL;
652 1.1.1.2 fvdl else {
653 1.1.1.2 fvdl register u_int size = *(u_int *)addr;
654 1.1.1.2 fvdl
655 1.1.1.2 fvdl if (size > BPF_MAXBUFSIZE)
656 1.1.1.2 fvdl *(u_int *)addr = size = BPF_MAXBUFSIZE;
657 1.1.1.2 fvdl else if (size < BPF_MINBUFSIZE)
658 1.1.1.2 fvdl *(u_int *)addr = size = BPF_MINBUFSIZE;
659 1.1.1.2 fvdl d->bd_bufsize = size;
660 1.1.1.2 fvdl }
661 1.1.1.2 fvdl #endif
662 1.1.1.2 fvdl break;
663 1.1.1.2 fvdl
664 1.1.1.2 fvdl /*
665 1.1.1.2 fvdl * Set link layer read filter.
666 1.1.1.2 fvdl */
667 1.1.1.2 fvdl case BIOCSETF:
668 1.1 cgd error = bpf_setf(d, (struct bpf_program *)addr);
669 1.1 cgd break;
670 1.1 cgd
671 1.1 cgd /*
672 1.1 cgd * Flush read packet buffer.
673 1.1 cgd */
674 1.1 cgd case BIOCFLUSH:
675 1.1 cgd s = splimp();
676 1.1 cgd reset_d(d);
677 1.1 cgd splx(s);
678 1.1 cgd break;
679 1.1 cgd
680 1.1 cgd /*
681 1.1 cgd * Put interface into promiscuous mode.
682 1.1 cgd */
683 1.1 cgd case BIOCPROMISC:
684 1.1 cgd if (d->bd_bif == 0) {
685 1.1 cgd /*
686 1.1 cgd * No interface attached yet.
687 1.1 cgd */
688 1.1 cgd error = EINVAL;
689 1.1 cgd break;
690 1.1 cgd }
691 1.1 cgd s = splimp();
692 1.1 cgd if (d->bd_promisc == 0) {
693 1.1 cgd error = ifpromisc(d->bd_bif->bif_ifp, 1);
694 1.1.1.2 fvdl if (error == 0)
695 1.1.1.2 fvdl d->bd_promisc = 1;
696 1.1 cgd }
697 1.1 cgd splx(s);
698 1.1 cgd break;
699 1.1 cgd
700 1.1 cgd /*
701 1.1 cgd * Get device parameters.
702 1.1 cgd */
703 1.1 cgd case BIOCGDLT:
704 1.1 cgd if (d->bd_bif == 0)
705 1.1 cgd error = EINVAL;
706 1.1 cgd else
707 1.1 cgd *(u_int *)addr = d->bd_bif->bif_dlt;
708 1.1 cgd break;
709 1.1 cgd
710 1.1 cgd /*
711 1.1 cgd * Set interface name.
712 1.1 cgd */
713 1.1 cgd case BIOCGETIF:
714 1.1 cgd if (d->bd_bif == 0)
715 1.1 cgd error = EINVAL;
716 1.1 cgd else
717 1.1 cgd bpf_ifname(d->bd_bif->bif_ifp, (struct ifreq *)addr);
718 1.1 cgd break;
719 1.1 cgd
720 1.1 cgd /*
721 1.1 cgd * Set interface.
722 1.1 cgd */
723 1.1 cgd case BIOCSETIF:
724 1.1 cgd error = bpf_setif(d, (struct ifreq *)addr);
725 1.1 cgd break;
726 1.1 cgd
727 1.1 cgd /*
728 1.1 cgd * Set read timeout.
729 1.1 cgd */
730 1.1.1.2 fvdl case BIOCSRTIMEOUT:
731 1.1 cgd {
732 1.1 cgd struct timeval *tv = (struct timeval *)addr;
733 1.1 cgd u_long msec;
734 1.1 cgd
735 1.1 cgd /* Compute number of milliseconds. */
736 1.1 cgd msec = tv->tv_sec * 1000 + tv->tv_usec / 1000;
737 1.1 cgd /* Scale milliseconds to ticks. Assume hard
738 1.1 cgd clock has millisecond or greater resolution
739 1.1 cgd (i.e. tick >= 1000). For 10ms hardclock,
740 1.1 cgd tick/1000 = 10, so rtout<-msec/10. */
741 1.1 cgd d->bd_rtout = msec / (tick / 1000);
742 1.1 cgd break;
743 1.1 cgd }
744 1.1 cgd
745 1.1 cgd /*
746 1.1 cgd * Get read timeout.
747 1.1 cgd */
748 1.1.1.2 fvdl case BIOCGRTIMEOUT:
749 1.1 cgd {
750 1.1 cgd struct timeval *tv = (struct timeval *)addr;
751 1.1 cgd u_long msec = d->bd_rtout;
752 1.1 cgd
753 1.1 cgd msec *= tick / 1000;
754 1.1 cgd tv->tv_sec = msec / 1000;
755 1.1 cgd tv->tv_usec = msec % 1000;
756 1.1 cgd break;
757 1.1 cgd }
758 1.1 cgd
759 1.1 cgd /*
760 1.1 cgd * Get packet stats.
761 1.1 cgd */
762 1.1 cgd case BIOCGSTATS:
763 1.1 cgd {
764 1.1 cgd struct bpf_stat *bs = (struct bpf_stat *)addr;
765 1.1 cgd
766 1.1 cgd bs->bs_recv = d->bd_rcount;
767 1.1 cgd bs->bs_drop = d->bd_dcount;
768 1.1 cgd break;
769 1.1 cgd }
770 1.1 cgd
771 1.1 cgd /*
772 1.1 cgd * Set immediate mode.
773 1.1 cgd */
774 1.1 cgd case BIOCIMMEDIATE:
775 1.1 cgd d->bd_immediate = *(u_int *)addr;
776 1.1 cgd break;
777 1.1.1.2 fvdl
778 1.1.1.2 fvdl case BIOCVERSION:
779 1.1.1.2 fvdl {
780 1.1.1.2 fvdl struct bpf_version *bv = (struct bpf_version *)addr;
781 1.1.1.2 fvdl
782 1.1.1.2 fvdl bv->bv_major = BPF_MAJOR_VERSION;
783 1.1.1.2 fvdl bv->bv_minor = BPF_MINOR_VERSION;
784 1.1.1.2 fvdl break;
785 1.1.1.2 fvdl }
786 1.1 cgd }
787 1.1 cgd return (error);
788 1.1 cgd }
789 1.1 cgd
790 1.1.1.2 fvdl /*
791 1.1.1.2 fvdl * Set d's packet filter program to fp. If this file already has a filter,
792 1.1 cgd * free it and replace it. Returns EINVAL for bogus requests.
793 1.1 cgd */
794 1.1 cgd int
795 1.1 cgd bpf_setf(d, fp)
796 1.1 cgd struct bpf_d *d;
797 1.1 cgd struct bpf_program *fp;
798 1.1 cgd {
799 1.1 cgd struct bpf_insn *fcode, *old;
800 1.1 cgd u_int flen, size;
801 1.1 cgd int s;
802 1.1 cgd
803 1.1 cgd old = d->bd_filter;
804 1.1 cgd if (fp->bf_insns == 0) {
805 1.1 cgd if (fp->bf_len != 0)
806 1.1 cgd return (EINVAL);
807 1.1 cgd s = splimp();
808 1.1 cgd d->bd_filter = 0;
809 1.1 cgd reset_d(d);
810 1.1 cgd splx(s);
811 1.1 cgd if (old != 0)
812 1.1 cgd free((caddr_t)old, M_DEVBUF);
813 1.1 cgd return (0);
814 1.1 cgd }
815 1.1 cgd flen = fp->bf_len;
816 1.1 cgd if (flen > BPF_MAXINSNS)
817 1.1 cgd return (EINVAL);
818 1.1 cgd
819 1.1 cgd size = flen * sizeof(*fp->bf_insns);
820 1.1 cgd fcode = (struct bpf_insn *)malloc(size, M_DEVBUF, M_WAITOK);
821 1.1.1.2 fvdl if (copyin((caddr_t)fp->bf_insns, (caddr_t)fcode, size) == 0 &&
822 1.1.1.2 fvdl bpf_validate(fcode, (int)flen)) {
823 1.1 cgd s = splimp();
824 1.1 cgd d->bd_filter = fcode;
825 1.1 cgd reset_d(d);
826 1.1 cgd splx(s);
827 1.1 cgd if (old != 0)
828 1.1 cgd free((caddr_t)old, M_DEVBUF);
829 1.1 cgd
830 1.1 cgd return (0);
831 1.1 cgd }
832 1.1 cgd free((caddr_t)fcode, M_DEVBUF);
833 1.1 cgd return (EINVAL);
834 1.1 cgd }
835 1.1 cgd
836 1.1 cgd /*
837 1.1.1.2 fvdl * Detach a file from its current interface (if attached at all) and attach
838 1.1.1.2 fvdl * to the interface indicated by the name stored in ifr.
839 1.1.1.2 fvdl * Return an errno or 0.
840 1.1 cgd */
841 1.1 cgd static int
842 1.1 cgd bpf_setif(d, ifr)
843 1.1 cgd struct bpf_d *d;
844 1.1 cgd struct ifreq *ifr;
845 1.1 cgd {
846 1.1 cgd struct bpf_if *bp;
847 1.1 cgd char *cp;
848 1.1.1.2 fvdl int unit, s, error;
849 1.1 cgd
850 1.1 cgd /*
851 1.1 cgd * Separate string into name part and unit number. Put a null
852 1.1.1.2 fvdl * byte at the end of the name part, and compute the number.
853 1.1 cgd * If the a unit number is unspecified, the default is 0,
854 1.1 cgd * as initialized above. XXX This should be common code.
855 1.1 cgd */
856 1.1 cgd unit = 0;
857 1.1 cgd cp = ifr->ifr_name;
858 1.1 cgd cp[sizeof(ifr->ifr_name) - 1] = '\0';
859 1.1 cgd while (*cp++) {
860 1.1 cgd if (*cp >= '0' && *cp <= '9') {
861 1.1 cgd unit = *cp - '0';
862 1.1 cgd *cp++ = '\0';
863 1.1 cgd while (*cp)
864 1.1 cgd unit = 10 * unit + *cp++ - '0';
865 1.1 cgd break;
866 1.1 cgd }
867 1.1 cgd }
868 1.1 cgd /*
869 1.1 cgd * Look through attached interfaces for the named one.
870 1.1 cgd */
871 1.1 cgd for (bp = bpf_iflist; bp != 0; bp = bp->bif_next) {
872 1.1 cgd struct ifnet *ifp = bp->bif_ifp;
873 1.1 cgd
874 1.1.1.2 fvdl if (ifp == 0 || unit != ifp->if_unit
875 1.1 cgd || strcmp(ifp->if_name, ifr->ifr_name) != 0)
876 1.1 cgd continue;
877 1.1 cgd /*
878 1.1.1.2 fvdl * We found the requested interface.
879 1.1 cgd * If it's not up, return an error.
880 1.1.1.2 fvdl * Allocate the packet buffers if we need to.
881 1.1.1.2 fvdl * If we're already attached to requested interface,
882 1.1.1.2 fvdl * just flush the buffer.
883 1.1 cgd */
884 1.1 cgd if ((ifp->if_flags & IFF_UP) == 0)
885 1.1 cgd return (ENETDOWN);
886 1.1.1.2 fvdl
887 1.1.1.2 fvdl if (d->bd_sbuf == 0) {
888 1.1.1.2 fvdl error = bpf_allocbufs(d);
889 1.1.1.2 fvdl if (error != 0)
890 1.1.1.2 fvdl return (error);
891 1.1.1.2 fvdl }
892 1.1 cgd s = splimp();
893 1.1 cgd if (bp != d->bd_bif) {
894 1.1 cgd if (d->bd_bif)
895 1.1.1.2 fvdl /*
896 1.1 cgd * Detach if attached to something else.
897 1.1 cgd */
898 1.1 cgd bpf_detachd(d);
899 1.1 cgd
900 1.1 cgd bpf_attachd(d, bp);
901 1.1 cgd }
902 1.1 cgd reset_d(d);
903 1.1 cgd splx(s);
904 1.1 cgd return (0);
905 1.1 cgd }
906 1.1 cgd /* Not found. */
907 1.1 cgd return (ENXIO);
908 1.1 cgd }
909 1.1 cgd
910 1.1 cgd /*
911 1.1.1.2 fvdl * Convert an interface name plus unit number of an ifp to a single
912 1.1.1.2 fvdl * name which is returned in the ifr.
913 1.1 cgd */
914 1.1 cgd static void
915 1.1 cgd bpf_ifname(ifp, ifr)
916 1.1 cgd struct ifnet *ifp;
917 1.1 cgd struct ifreq *ifr;
918 1.1 cgd {
919 1.1 cgd char *s = ifp->if_name;
920 1.1 cgd char *d = ifr->ifr_name;
921 1.1 cgd
922 1.1 cgd while (*d++ = *s++)
923 1.1.1.2 fvdl continue;
924 1.1 cgd /* XXX Assume that unit number is less than 10. */
925 1.1 cgd *d++ = ifp->if_unit + '0';
926 1.1 cgd *d = '\0';
927 1.1 cgd }
928 1.1 cgd
929 1.1 cgd /*
930 1.1.1.2 fvdl * The new select interface passes down the proc pointer; the old select
931 1.1.1.2 fvdl * stubs had to grab it out of the user struct. This glue allows either case.
932 1.1.1.2 fvdl */
933 1.1.1.2 fvdl #if BSD >= 199103
934 1.1.1.2 fvdl #define bpf_select bpfselect
935 1.1.1.2 fvdl #else
936 1.1.1.2 fvdl int
937 1.1.1.2 fvdl bpfselect(dev, rw)
938 1.1.1.2 fvdl register dev_t dev;
939 1.1.1.2 fvdl int rw;
940 1.1.1.2 fvdl {
941 1.1.1.2 fvdl return (bpf_select(dev, rw, u.u_procp));
942 1.1.1.2 fvdl }
943 1.1.1.2 fvdl #endif
944 1.1.1.2 fvdl
945 1.1.1.2 fvdl /*
946 1.1 cgd * Support for select() system call
947 1.1 cgd *
948 1.1.1.2 fvdl * Return true iff the specific operation will not block indefinitely.
949 1.1.1.2 fvdl * Otherwise, return false but make a note that a selwakeup() must be done.
950 1.1 cgd */
951 1.1 cgd int
952 1.1.1.2 fvdl bpf_select(dev, rw, p)
953 1.1 cgd register dev_t dev;
954 1.1 cgd int rw;
955 1.1 cgd struct proc *p;
956 1.1 cgd {
957 1.1 cgd register struct bpf_d *d;
958 1.1 cgd register int s;
959 1.1.1.2 fvdl
960 1.1 cgd if (rw != FREAD)
961 1.1 cgd return (0);
962 1.1 cgd /*
963 1.1 cgd * An imitation of the FIONREAD ioctl code.
964 1.1 cgd */
965 1.1 cgd d = &bpf_dtab[minor(dev)];
966 1.1.1.2 fvdl
967 1.1 cgd s = splimp();
968 1.1 cgd if (d->bd_hlen != 0 || (d->bd_immediate && d->bd_slen != 0)) {
969 1.1 cgd /*
970 1.1 cgd * There is data waiting.
971 1.1 cgd */
972 1.1 cgd splx(s);
973 1.1 cgd return (1);
974 1.1 cgd }
975 1.1.1.2 fvdl #if BSD >= 199103
976 1.1.1.2 fvdl selrecord(p, &d->bd_sel);
977 1.1.1.2 fvdl #else
978 1.1 cgd /*
979 1.1 cgd * No data ready. If there's already a select() waiting on this
980 1.1.1.2 fvdl * minor device then this is a collision. This shouldn't happen
981 1.1 cgd * because minors really should not be shared, but if a process
982 1.1 cgd * forks while one of these is open, it is possible that both
983 1.1 cgd * processes could select on the same descriptor.
984 1.1 cgd */
985 1.1 cgd if (d->bd_selproc && d->bd_selproc->p_wchan == (caddr_t)&selwait)
986 1.1 cgd d->bd_selcoll = 1;
987 1.1 cgd else
988 1.1 cgd d->bd_selproc = p;
989 1.1.1.2 fvdl #endif
990 1.1.1.2 fvdl splx(s);
991 1.1 cgd return (0);
992 1.1 cgd }
993 1.1 cgd
994 1.1 cgd /*
995 1.1.1.2 fvdl * Incoming linkage from device drivers. Process the packet pkt, of length
996 1.1.1.2 fvdl * pktlen, which is stored in a contiguous buffer. The packet is parsed
997 1.1.1.2 fvdl * by each process' filter, and if accepted, stashed into the corresponding
998 1.1.1.2 fvdl * buffer.
999 1.1 cgd */
1000 1.1 cgd void
1001 1.1 cgd bpf_tap(arg, pkt, pktlen)
1002 1.1 cgd caddr_t arg;
1003 1.1 cgd register u_char *pkt;
1004 1.1 cgd register u_int pktlen;
1005 1.1 cgd {
1006 1.1 cgd struct bpf_if *bp;
1007 1.1 cgd register struct bpf_d *d;
1008 1.1 cgd register u_int slen;
1009 1.1 cgd /*
1010 1.1 cgd * Note that the ipl does not have to be raised at this point.
1011 1.1 cgd * The only problem that could arise here is that if two different
1012 1.1 cgd * interfaces shared any data. This is not the case.
1013 1.1 cgd */
1014 1.1 cgd bp = (struct bpf_if *)arg;
1015 1.1 cgd for (d = bp->bif_dlist; d != 0; d = d->bd_next) {
1016 1.1 cgd ++d->bd_rcount;
1017 1.1 cgd slen = bpf_filter(d->bd_filter, pkt, pktlen, pktlen);
1018 1.1 cgd if (slen != 0)
1019 1.1 cgd catchpacket(d, pkt, pktlen, slen, bcopy);
1020 1.1 cgd }
1021 1.1 cgd }
1022 1.1 cgd
1023 1.1 cgd /*
1024 1.1 cgd * Copy data from an mbuf chain into a buffer. This code is derived
1025 1.1 cgd * from m_copydata in sys/uipc_mbuf.c.
1026 1.1 cgd */
1027 1.1 cgd static void
1028 1.1.1.2 fvdl bpf_mcopy(src_arg, dst_arg, len)
1029 1.1.1.2 fvdl const void *src_arg;
1030 1.1.1.2 fvdl void *dst_arg;
1031 1.1.1.2 fvdl register u_int len;
1032 1.1 cgd {
1033 1.1.1.2 fvdl register const struct mbuf *m;
1034 1.1.1.2 fvdl register u_int count;
1035 1.1.1.2 fvdl u_char *dst;
1036 1.1 cgd
1037 1.1.1.2 fvdl m = src_arg;
1038 1.1.1.2 fvdl dst = dst_arg;
1039 1.1 cgd while (len > 0) {
1040 1.1 cgd if (m == 0)
1041 1.1 cgd panic("bpf_mcopy");
1042 1.1.1.2 fvdl count = min(m->m_len, len);
1043 1.1 cgd bcopy(mtod(m, caddr_t), (caddr_t)dst, count);
1044 1.1 cgd m = m->m_next;
1045 1.1 cgd dst += count;
1046 1.1 cgd len -= count;
1047 1.1 cgd }
1048 1.1 cgd }
1049 1.1 cgd
1050 1.1 cgd /*
1051 1.1.1.2 fvdl * Incoming linkage from device drivers, when packet is in an mbuf chain.
1052 1.1 cgd */
1053 1.1 cgd void
1054 1.1 cgd bpf_mtap(arg, m)
1055 1.1 cgd caddr_t arg;
1056 1.1 cgd struct mbuf *m;
1057 1.1 cgd {
1058 1.1 cgd struct bpf_if *bp = (struct bpf_if *)arg;
1059 1.1 cgd struct bpf_d *d;
1060 1.1 cgd u_int pktlen, slen;
1061 1.1 cgd struct mbuf *m0;
1062 1.1 cgd
1063 1.1 cgd pktlen = 0;
1064 1.1.1.2 fvdl for (m0 = m; m0 != 0; m0 = m0->m_next)
1065 1.1 cgd pktlen += m0->m_len;
1066 1.1 cgd
1067 1.1 cgd for (d = bp->bif_dlist; d != 0; d = d->bd_next) {
1068 1.1 cgd ++d->bd_rcount;
1069 1.1 cgd slen = bpf_filter(d->bd_filter, (u_char *)m, pktlen, 0);
1070 1.1 cgd if (slen != 0)
1071 1.1 cgd catchpacket(d, (u_char *)m, pktlen, slen, bpf_mcopy);
1072 1.1 cgd }
1073 1.1 cgd }
1074 1.1 cgd
1075 1.1 cgd /*
1076 1.1 cgd * Move the packet data from interface memory (pkt) into the
1077 1.1 cgd * store buffer. Return 1 if it's time to wakeup a listener (buffer full),
1078 1.1.1.2 fvdl * otherwise 0. "copy" is the routine called to do the actual data
1079 1.1.1.2 fvdl * transfer. bcopy is passed in to copy contiguous chunks, while
1080 1.1.1.2 fvdl * bpf_mcopy is passed in to copy mbuf chains. In the latter case,
1081 1.1.1.2 fvdl * pkt is really an mbuf.
1082 1.1 cgd */
1083 1.1 cgd static void
1084 1.1 cgd catchpacket(d, pkt, pktlen, snaplen, cpfn)
1085 1.1 cgd register struct bpf_d *d;
1086 1.1 cgd register u_char *pkt;
1087 1.1 cgd register u_int pktlen, snaplen;
1088 1.1.1.2 fvdl register void (*cpfn)(const void *, void *, u_int);
1089 1.1 cgd {
1090 1.1 cgd register struct bpf_hdr *hp;
1091 1.1 cgd register int totlen, curlen;
1092 1.1 cgd register int hdrlen = d->bd_bif->bif_hdrlen;
1093 1.1 cgd /*
1094 1.1 cgd * Figure out how many bytes to move. If the packet is
1095 1.1 cgd * greater or equal to the snapshot length, transfer that
1096 1.1 cgd * much. Otherwise, transfer the whole packet (unless
1097 1.1 cgd * we hit the buffer size limit).
1098 1.1 cgd */
1099 1.1.1.2 fvdl totlen = hdrlen + min(snaplen, pktlen);
1100 1.1 cgd if (totlen > d->bd_bufsize)
1101 1.1 cgd totlen = d->bd_bufsize;
1102 1.1 cgd
1103 1.1 cgd /*
1104 1.1 cgd * Round up the end of the previous packet to the next longword.
1105 1.1 cgd */
1106 1.1 cgd curlen = BPF_WORDALIGN(d->bd_slen);
1107 1.1 cgd if (curlen + totlen > d->bd_bufsize) {
1108 1.1 cgd /*
1109 1.1 cgd * This packet will overflow the storage buffer.
1110 1.1 cgd * Rotate the buffers if we can, then wakeup any
1111 1.1 cgd * pending reads.
1112 1.1 cgd */
1113 1.1 cgd if (d->bd_fbuf == 0) {
1114 1.1.1.2 fvdl /*
1115 1.1.1.2 fvdl * We haven't completed the previous read yet,
1116 1.1 cgd * so drop the packet.
1117 1.1 cgd */
1118 1.1 cgd ++d->bd_dcount;
1119 1.1 cgd return;
1120 1.1 cgd }
1121 1.1 cgd ROTATE_BUFFERS(d);
1122 1.1 cgd bpf_wakeup(d);
1123 1.1 cgd curlen = 0;
1124 1.1 cgd }
1125 1.1.1.2 fvdl else if (d->bd_immediate)
1126 1.1 cgd /*
1127 1.1 cgd * Immediate mode is set. A packet arrived so any
1128 1.1 cgd * reads should be woken up.
1129 1.1 cgd */
1130 1.1 cgd bpf_wakeup(d);
1131 1.1 cgd
1132 1.1 cgd /*
1133 1.1 cgd * Append the bpf header.
1134 1.1 cgd */
1135 1.1 cgd hp = (struct bpf_hdr *)(d->bd_sbuf + curlen);
1136 1.1.1.2 fvdl #if BSD >= 199103
1137 1.1 cgd microtime(&hp->bh_tstamp);
1138 1.1.1.2 fvdl #elif defined(sun)
1139 1.1.1.2 fvdl uniqtime(&hp->bh_tstamp);
1140 1.1 cgd #else
1141 1.1 cgd hp->bh_tstamp = time;
1142 1.1 cgd #endif
1143 1.1 cgd hp->bh_datalen = pktlen;
1144 1.1 cgd hp->bh_hdrlen = hdrlen;
1145 1.1 cgd /*
1146 1.1 cgd * Copy the packet data into the store buffer and update its length.
1147 1.1 cgd */
1148 1.1 cgd (*cpfn)(pkt, (u_char *)hp + hdrlen, (hp->bh_caplen = totlen - hdrlen));
1149 1.1 cgd d->bd_slen = curlen + totlen;
1150 1.1 cgd }
1151 1.1 cgd
1152 1.1.1.2 fvdl /*
1153 1.1 cgd * Initialize all nonzero fields of a descriptor.
1154 1.1 cgd */
1155 1.1 cgd static int
1156 1.1.1.2 fvdl bpf_allocbufs(d)
1157 1.1 cgd register struct bpf_d *d;
1158 1.1 cgd {
1159 1.1 cgd d->bd_fbuf = (caddr_t)malloc(d->bd_bufsize, M_DEVBUF, M_WAITOK);
1160 1.1 cgd if (d->bd_fbuf == 0)
1161 1.1 cgd return (ENOBUFS);
1162 1.1 cgd
1163 1.1 cgd d->bd_sbuf = (caddr_t)malloc(d->bd_bufsize, M_DEVBUF, M_WAITOK);
1164 1.1 cgd if (d->bd_sbuf == 0) {
1165 1.1 cgd free(d->bd_fbuf, M_DEVBUF);
1166 1.1 cgd return (ENOBUFS);
1167 1.1 cgd }
1168 1.1 cgd d->bd_slen = 0;
1169 1.1 cgd d->bd_hlen = 0;
1170 1.1 cgd return (0);
1171 1.1 cgd }
1172 1.1 cgd
1173 1.1 cgd /*
1174 1.1.1.2 fvdl * Free buffers currently in use by a descriptor.
1175 1.1.1.2 fvdl * Called on close.
1176 1.1.1.2 fvdl */
1177 1.1.1.2 fvdl static void
1178 1.1.1.2 fvdl bpf_freed(d)
1179 1.1.1.2 fvdl register struct bpf_d *d;
1180 1.1.1.2 fvdl {
1181 1.1.1.2 fvdl /*
1182 1.1.1.2 fvdl * We don't need to lock out interrupts since this descriptor has
1183 1.1.1.2 fvdl * been detached from its interface and it yet hasn't been marked
1184 1.1.1.2 fvdl * free.
1185 1.1.1.2 fvdl */
1186 1.1.1.2 fvdl if (d->bd_sbuf != 0) {
1187 1.1.1.2 fvdl free(d->bd_sbuf, M_DEVBUF);
1188 1.1.1.2 fvdl if (d->bd_hbuf != 0)
1189 1.1.1.2 fvdl free(d->bd_hbuf, M_DEVBUF);
1190 1.1.1.2 fvdl if (d->bd_fbuf != 0)
1191 1.1.1.2 fvdl free(d->bd_fbuf, M_DEVBUF);
1192 1.1.1.2 fvdl }
1193 1.1.1.2 fvdl if (d->bd_filter)
1194 1.1.1.2 fvdl free((caddr_t)d->bd_filter, M_DEVBUF);
1195 1.1.1.2 fvdl
1196 1.1.1.2 fvdl D_MARKFREE(d);
1197 1.1.1.2 fvdl }
1198 1.1.1.2 fvdl
1199 1.1.1.2 fvdl /*
1200 1.1.1.2 fvdl * Attach an interface to bpf. driverp is a pointer to a (struct bpf_if *)
1201 1.1.1.2 fvdl * in the driver's softc; dlt is the link layer type; hdrlen is the fixed
1202 1.1.1.2 fvdl * size of the link header (variable length headers not yet supported).
1203 1.1 cgd */
1204 1.1 cgd void
1205 1.1 cgd bpfattach(driverp, ifp, dlt, hdrlen)
1206 1.1 cgd caddr_t *driverp;
1207 1.1 cgd struct ifnet *ifp;
1208 1.1 cgd u_int dlt, hdrlen;
1209 1.1 cgd {
1210 1.1 cgd struct bpf_if *bp;
1211 1.1 cgd int i;
1212 1.1.1.2 fvdl #if BSD < 199103
1213 1.1.1.2 fvdl static struct bpf_if bpf_ifs[NBPFILTER];
1214 1.1.1.2 fvdl static int bpfifno;
1215 1.1 cgd
1216 1.1.1.2 fvdl bp = (bpfifno < NBPFILTER) ? &bpf_ifs[bpfifno++] : 0;
1217 1.1.1.2 fvdl #else
1218 1.1 cgd bp = (struct bpf_if *)malloc(sizeof(*bp), M_DEVBUF, M_DONTWAIT);
1219 1.1.1.2 fvdl #endif
1220 1.1 cgd if (bp == 0)
1221 1.1 cgd panic("bpfattach");
1222 1.1 cgd
1223 1.1 cgd bp->bif_dlist = 0;
1224 1.1 cgd bp->bif_driverp = (struct bpf_if **)driverp;
1225 1.1 cgd bp->bif_ifp = ifp;
1226 1.1 cgd bp->bif_dlt = dlt;
1227 1.1 cgd
1228 1.1 cgd bp->bif_next = bpf_iflist;
1229 1.1 cgd bpf_iflist = bp;
1230 1.1 cgd
1231 1.1 cgd *bp->bif_driverp = 0;
1232 1.1 cgd
1233 1.1 cgd /*
1234 1.1 cgd * Compute the length of the bpf header. This is not necessarily
1235 1.1.1.2 fvdl * equal to SIZEOF_BPF_HDR because we want to insert spacing such
1236 1.1.1.2 fvdl * that the network layer header begins on a longword boundary (for
1237 1.1 cgd * performance reasons and to alleviate alignment restrictions).
1238 1.1 cgd */
1239 1.1 cgd bp->bif_hdrlen = BPF_WORDALIGN(hdrlen + SIZEOF_BPF_HDR) - hdrlen;
1240 1.1 cgd
1241 1.1 cgd /*
1242 1.1 cgd * Mark all the descriptors free if this hasn't been done.
1243 1.1 cgd */
1244 1.1 cgd if (!D_ISFREE(&bpf_dtab[0]))
1245 1.1 cgd for (i = 0; i < NBPFILTER; ++i)
1246 1.1 cgd D_MARKFREE(&bpf_dtab[i]);
1247 1.1 cgd
1248 1.1 cgd printf("bpf: %s%d attached\n", ifp->if_name, ifp->if_unit);
1249 1.1 cgd }
1250 1.1 cgd
1251 1.1.1.2 fvdl #if BSD >= 199103
1252 1.1 cgd /* XXX This routine belongs in net/if.c. */
1253 1.1 cgd /*
1254 1.1.1.2 fvdl * Set/clear promiscuous mode on interface ifp based on the truth value
1255 1.1 cgd * of pswitch. The calls are reference counted so that only the first
1256 1.1.1.2 fvdl * "on" request actually has an effect, as does the final "off" request.
1257 1.1.1.2 fvdl * Results are undefined if the "off" and "on" requests are not matched.
1258 1.1 cgd */
1259 1.1 cgd int
1260 1.1 cgd ifpromisc(ifp, pswitch)
1261 1.1 cgd struct ifnet *ifp;
1262 1.1 cgd int pswitch;
1263 1.1 cgd {
1264 1.1 cgd struct ifreq ifr;
1265 1.1.1.2 fvdl /*
1266 1.1 cgd * If the device is not configured up, we cannot put it in
1267 1.1 cgd * promiscuous mode.
1268 1.1 cgd */
1269 1.1 cgd if ((ifp->if_flags & IFF_UP) == 0)
1270 1.1 cgd return (ENETDOWN);
1271 1.1 cgd
1272 1.1 cgd if (pswitch) {
1273 1.1 cgd if (ifp->if_pcount++ != 0)
1274 1.1 cgd return (0);
1275 1.1 cgd ifp->if_flags |= IFF_PROMISC;
1276 1.1 cgd } else {
1277 1.1 cgd if (--ifp->if_pcount > 0)
1278 1.1 cgd return (0);
1279 1.1 cgd ifp->if_flags &= ~IFF_PROMISC;
1280 1.1 cgd }
1281 1.1 cgd ifr.ifr_flags = ifp->if_flags;
1282 1.1 cgd return ((*ifp->if_ioctl)(ifp, SIOCSIFFLAGS, (caddr_t)&ifr));
1283 1.1 cgd }
1284 1.1.1.2 fvdl #endif
1285 1.1.1.2 fvdl
1286 1.1.1.2 fvdl #if BSD < 199103
1287 1.1.1.2 fvdl /*
1288 1.1.1.2 fvdl * Allocate some memory for bpf. This is temporary SunOS support, and
1289 1.1.1.2 fvdl * is admittedly a hack.
1290 1.1.1.2 fvdl * If resources unavaiable, return 0.
1291 1.1.1.2 fvdl */
1292 1.1.1.2 fvdl static caddr_t
1293 1.1.1.2 fvdl bpf_alloc(size, canwait)
1294 1.1.1.2 fvdl register int size;
1295 1.1.1.2 fvdl register int canwait;
1296 1.1.1.2 fvdl {
1297 1.1.1.2 fvdl register struct mbuf *m;
1298 1.1 cgd
1299 1.1.1.2 fvdl if ((unsigned)size > (MCLBYTES-8))
1300 1.1.1.2 fvdl return 0;
1301 1.1.1.2 fvdl
1302 1.1.1.2 fvdl MGET(m, canwait, MT_DATA);
1303 1.1.1.2 fvdl if (m == 0)
1304 1.1.1.2 fvdl return 0;
1305 1.1.1.2 fvdl if ((unsigned)size > (MLEN-8)) {
1306 1.1.1.2 fvdl MCLGET(m);
1307 1.1.1.2 fvdl if (m->m_len != MCLBYTES) {
1308 1.1.1.2 fvdl m_freem(m);
1309 1.1.1.2 fvdl return 0;
1310 1.1.1.2 fvdl }
1311 1.1.1.2 fvdl }
1312 1.1.1.2 fvdl *mtod(m, struct mbuf **) = m;
1313 1.1.1.2 fvdl return mtod(m, caddr_t) + 8;
1314 1.1.1.2 fvdl }
1315 1.1.1.2 fvdl #endif
1316 1.1.1.2 fvdl #endif
1317