Home | History | Annotate | Line # | Download | only in common
loop-bsd.c revision 1.6
      1  1.6  mycroft /*	$NetBSD: loop-bsd.c,v 1.6 2002/09/20 14:16:03 mycroft Exp $	*/
      2  1.2  thorpej 
      3  1.1      cjs /*
      4  1.1      cjs  * Copyright (c) 1993-95 Mats O Jansson.  All rights reserved.
      5  1.1      cjs  *
      6  1.1      cjs  * Redistribution and use in source and binary forms, with or without
      7  1.1      cjs  * modification, are permitted provided that the following conditions
      8  1.1      cjs  * are met:
      9  1.1      cjs  * 1. Redistributions of source code must retain the above copyright
     10  1.1      cjs  *    notice, this list of conditions and the following disclaimer.
     11  1.1      cjs  * 2. Redistributions in binary form must reproduce the above copyright
     12  1.1      cjs  *    notice, this list of conditions and the following disclaimer in the
     13  1.1      cjs  *    documentation and/or other materials provided with the distribution.
     14  1.1      cjs  * 3. All advertising materials mentioning features or use of this software
     15  1.1      cjs  *    must display the following acknowledgement:
     16  1.1      cjs  *	This product includes software developed by Mats O Jansson.
     17  1.1      cjs  * 4. The name of the author may not be used to endorse or promote products
     18  1.1      cjs  *    derived from this software without specific prior written permission.
     19  1.1      cjs  *
     20  1.1      cjs  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     21  1.1      cjs  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     22  1.1      cjs  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     23  1.1      cjs  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     24  1.1      cjs  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     25  1.1      cjs  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     26  1.1      cjs  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     27  1.1      cjs  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     28  1.1      cjs  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     29  1.1      cjs  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     30  1.1      cjs  */
     31  1.1      cjs 
     32  1.3    lukem #include <sys/cdefs.h>
     33  1.3    lukem #ifndef lint
     34  1.6  mycroft __RCSID("$NetBSD: loop-bsd.c,v 1.6 2002/09/20 14:16:03 mycroft Exp $");
     35  1.1      cjs #endif
     36  1.1      cjs 
     37  1.5   kleink #include <errno.h>
     38  1.1      cjs #include <stdlib.h>
     39  1.1      cjs #include <strings.h>
     40  1.1      cjs #include <unistd.h>
     41  1.4    perry #if defined(__bsdi__) || defined(__FreeBSD__) || defined(__NetBSD__)
     42  1.1      cjs #include <sys/time.h>
     43  1.1      cjs #endif
     44  1.1      cjs #include <net/bpf.h>
     45  1.1      cjs #include <sys/ioctl.h>
     46  1.6  mycroft #include <sys/poll.h>
     47  1.6  mycroft #include <assert.h>
     48  1.1      cjs 
     49  1.1      cjs #include "os.h"
     50  1.3    lukem #include "common.h"
     51  1.3    lukem #include "device.h"
     52  1.3    lukem #include "mopdef.h"
     53  1.1      cjs 
     54  1.1      cjs int
     55  1.1      cjs mopOpenRC(p, trans)
     56  1.1      cjs 	struct if_info *p;
     57  1.1      cjs 	int	trans;
     58  1.1      cjs {
     59  1.1      cjs #ifndef NORC
     60  1.1      cjs 	return (*(p->iopen))(p->if_name,
     61  1.1      cjs 			     O_RDWR,
     62  1.1      cjs 			     MOP_K_PROTO_RC,
     63  1.1      cjs 			     trans);
     64  1.1      cjs #else
     65  1.1      cjs 	return -1;
     66  1.1      cjs #endif
     67  1.1      cjs }
     68  1.1      cjs 
     69  1.1      cjs int
     70  1.1      cjs mopOpenDL(p, trans)
     71  1.1      cjs 	struct if_info *p;
     72  1.1      cjs 	int	trans;
     73  1.1      cjs {
     74  1.1      cjs #ifndef NODL
     75  1.1      cjs 	return (*(p->iopen))(p->if_name,
     76  1.1      cjs 			     O_RDWR,
     77  1.1      cjs 			     MOP_K_PROTO_DL,
     78  1.1      cjs 			     trans);
     79  1.1      cjs #else
     80  1.1      cjs 	return -1;
     81  1.1      cjs #endif
     82  1.1      cjs }
     83  1.1      cjs 
     84  1.1      cjs void
     85  1.1      cjs mopReadRC()
     86  1.1      cjs {
     87  1.1      cjs }
     88  1.1      cjs 
     89  1.1      cjs void
     90  1.1      cjs mopReadDL()
     91  1.1      cjs {
     92  1.1      cjs }
     93  1.1      cjs 
     94  1.1      cjs /*
     95  1.1      cjs  * The list of all interfaces that are being listened to.  loop()
     96  1.1      cjs  * "selects" on the descriptors in this list.
     97  1.1      cjs  */
     98  1.1      cjs struct if_info *iflist;
     99  1.1      cjs 
    100  1.1      cjs void   mopProcess    __P((struct if_info *, u_char *));
    101  1.1      cjs 
    102  1.1      cjs /*
    103  1.1      cjs  * Loop indefinitely listening for MOP requests on the
    104  1.1      cjs  * interfaces in 'iflist'.
    105  1.1      cjs  */
    106  1.1      cjs void
    107  1.1      cjs Loop()
    108  1.1      cjs {
    109  1.1      cjs 	u_char *buf, *bp, *ep;
    110  1.6  mycroft 	int     cc, n, m;
    111  1.6  mycroft 	struct	pollfd *set;
    112  1.6  mycroft 	int     bufsize;
    113  1.6  mycroft 	struct	if_info *ii;
    114  1.1      cjs 
    115  1.1      cjs 	if (iflist == 0) {
    116  1.1      cjs 		syslog(LOG_ERR, "no interfaces");
    117  1.1      cjs 		exit(0);
    118  1.1      cjs 	}
    119  1.1      cjs 	if (iflist->fd != -1) {
    120  1.1      cjs 		if (ioctl(iflist->fd, BIOCGBLEN, (caddr_t) & bufsize) < 0) {
    121  1.1      cjs 			syslog(LOG_ERR, "BIOCGBLEN: %m");
    122  1.1      cjs 			exit(0);
    123  1.1      cjs 	        }
    124  1.1      cjs 	}
    125  1.1      cjs 	buf = (u_char *) malloc((unsigned) bufsize);
    126  1.1      cjs 	if (buf == 0) {
    127  1.1      cjs 		syslog(LOG_ERR, "malloc: %m");
    128  1.1      cjs 		exit(0);
    129  1.1      cjs 	}
    130  1.1      cjs 	/*
    131  1.1      cjs          * Find the highest numbered file descriptor for select().
    132  1.1      cjs          * Initialize the set of descriptors to listen to.
    133  1.1      cjs          */
    134  1.6  mycroft 	for (ii = iflist, n = 0; ii; ii = ii->next, n++)
    135  1.6  mycroft 		;
    136  1.6  mycroft 	set = malloc(n * sizeof(*set));
    137  1.6  mycroft 	for (ii = iflist, m = 0; ii; ii = ii->next, m++) {
    138  1.6  mycroft 		assert(ii->fd != -1);
    139  1.6  mycroft 		set[m].fd = ii->fd;
    140  1.6  mycroft 		set[m].events = POLLIN;
    141  1.1      cjs 	}
    142  1.6  mycroft 	for (;;) {
    143  1.6  mycroft 		if (poll(set, n, INFTIM) < 0) {
    144  1.6  mycroft 			syslog(LOG_ERR, "poll: %m");
    145  1.1      cjs 			exit(0);
    146  1.1      cjs 		}
    147  1.6  mycroft 		for (ii = iflist, m = 0; ii; ii = ii->next, m++) {
    148  1.6  mycroft 			if (!(set[m].revents & POLLIN))
    149  1.6  mycroft 				continue;
    150  1.1      cjs 	again:
    151  1.1      cjs 			cc = read(ii->fd, (char *) buf, bufsize);
    152  1.1      cjs 			/* Don't choke when we get ptraced */
    153  1.1      cjs 			if (cc < 0 && errno == EINTR)
    154  1.1      cjs 				goto again;
    155  1.1      cjs 			/* Due to a SunOS bug, after 2^31 bytes, the file
    156  1.1      cjs 			 * offset overflows and read fails with EINVAL.  The
    157  1.1      cjs 			 * lseek() to 0 will fix things. */
    158  1.1      cjs 			if (cc < 0) {
    159  1.1      cjs 				if (errno == EINVAL &&
    160  1.1      cjs 				    (lseek(ii->fd, 0, SEEK_CUR) + bufsize) < 0) {
    161  1.1      cjs 					(void) lseek(ii->fd, 0, 0);
    162  1.1      cjs 					goto again;
    163  1.1      cjs 				}
    164  1.1      cjs 				syslog(LOG_ERR, "read: %m");
    165  1.1      cjs 				exit(0);
    166  1.1      cjs 			}
    167  1.1      cjs 			/* Loop through the packet(s) */
    168  1.1      cjs #define bhp ((struct bpf_hdr *)bp)
    169  1.1      cjs 			bp = buf;
    170  1.1      cjs 			ep = bp + cc;
    171  1.1      cjs 			while (bp < ep) {
    172  1.3    lukem 				int caplen, hdrlen;
    173  1.1      cjs 
    174  1.1      cjs 				caplen = bhp->bh_caplen;
    175  1.1      cjs 				hdrlen = bhp->bh_hdrlen;
    176  1.1      cjs 				mopProcess(ii, bp + hdrlen);
    177  1.1      cjs 				bp += BPF_WORDALIGN(hdrlen + caplen);
    178  1.1      cjs 			}
    179  1.1      cjs 		}
    180  1.1      cjs 	}
    181  1.1      cjs }
    182