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