Home | History | Annotate | Line # | Download | only in net
if.h revision 1.4
      1  1.1      cgd /*
      2  1.1      cgd  * Copyright (c) 1982, 1986, 1989 Regents of the University of California.
      3  1.1      cgd  * All rights reserved.
      4  1.1      cgd  *
      5  1.1      cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1      cgd  * modification, are permitted provided that the following conditions
      7  1.1      cgd  * are met:
      8  1.1      cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1      cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1      cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1      cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1      cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1      cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1      cgd  *    must display the following acknowledgement:
     15  1.1      cgd  *	This product includes software developed by the University of
     16  1.1      cgd  *	California, Berkeley and its contributors.
     17  1.1      cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1      cgd  *    may be used to endorse or promote products derived from this software
     19  1.1      cgd  *    without specific prior written permission.
     20  1.1      cgd  *
     21  1.1      cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1      cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1      cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1      cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1      cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1      cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1      cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1      cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1      cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1      cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1      cgd  * SUCH DAMAGE.
     32  1.1      cgd  *
     33  1.3      cgd  *	from: @(#)if.h	7.11 (Berkeley) 3/19/91
     34  1.4  hpeyerl  *	$Id: if.h,v 1.4 1993/12/06 04:17:41 hpeyerl Exp $
     35  1.1      cgd  */
     36  1.1      cgd 
     37  1.2  mycroft #ifndef _NET_IF_H_
     38  1.2  mycroft #define _NET_IF_H_
     39  1.2  mycroft 
     40  1.1      cgd /*
     41  1.1      cgd  * Structures defining a network interface, providing a packet
     42  1.1      cgd  * transport mechanism (ala level 0 of the PUP protocols).
     43  1.1      cgd  *
     44  1.1      cgd  * Each interface accepts output datagrams of a specified maximum
     45  1.1      cgd  * length, and provides higher level routines with input datagrams
     46  1.1      cgd  * received from its medium.
     47  1.1      cgd  *
     48  1.1      cgd  * Output occurs when the routine if_output is called, with three parameters:
     49  1.1      cgd  *	(*ifp->if_output)(ifp, m, dst)
     50  1.1      cgd  * Here m is the mbuf chain to be sent and dst is the destination address.
     51  1.1      cgd  * The output routine encapsulates the supplied datagram if necessary,
     52  1.1      cgd  * and then transmits it on its medium.
     53  1.1      cgd  *
     54  1.1      cgd  * On input, each interface unwraps the data received by it, and either
     55  1.1      cgd  * places it on the input queue of a internetwork datagram routine
     56  1.1      cgd  * and posts the associated software interrupt, or passes the datagram to a raw
     57  1.1      cgd  * packet input routine.
     58  1.1      cgd  *
     59  1.1      cgd  * Routines exist for locating interfaces by their addresses
     60  1.1      cgd  * or for locating a interface on a certain network, as well as more general
     61  1.1      cgd  * routing and gateway routines maintaining information used to locate
     62  1.1      cgd  * interfaces.  These routines live in the files if.c and route.c
     63  1.1      cgd  */
     64  1.1      cgd #ifndef _TIME_ /*  XXX fast fix for SNMP, going away soon */
     65  1.1      cgd #ifdef KERNEL
     66  1.1      cgd #include "../sys/time.h"
     67  1.1      cgd #else
     68  1.1      cgd #include <sys/time.h>
     69  1.1      cgd #endif
     70  1.1      cgd #endif
     71  1.1      cgd 
     72  1.1      cgd /*
     73  1.1      cgd  * Structure defining a queue for a network interface.
     74  1.1      cgd  *
     75  1.1      cgd  * (Would like to call this struct ``if'', but C isn't PL/1.)
     76  1.1      cgd  */
     77  1.1      cgd 
     78  1.1      cgd struct ifnet {
     79  1.1      cgd 	char	*if_name;		/* name, e.g. ``en'' or ``lo'' */
     80  1.1      cgd 	short	if_unit;		/* sub-unit for lower level driver */
     81  1.1      cgd 	short	if_mtu;			/* maximum transmission unit */
     82  1.1      cgd 	short	if_flags;		/* up/down, broadcast, etc. */
     83  1.1      cgd 	short	if_timer;		/* time 'til if_watchdog called */
     84  1.1      cgd 	int	if_metric;		/* routing metric (external only) */
     85  1.1      cgd 	struct	ifaddr *if_addrlist;	/* linked list of addresses per if */
     86  1.1      cgd 	struct	ifqueue {
     87  1.1      cgd 		struct	mbuf *ifq_head;
     88  1.1      cgd 		struct	mbuf *ifq_tail;
     89  1.1      cgd 		int	ifq_len;
     90  1.1      cgd 		int	ifq_maxlen;
     91  1.1      cgd 		int	ifq_drops;
     92  1.1      cgd 	} if_snd;			/* output queue */
     93  1.1      cgd /* procedure handles */
     94  1.1      cgd 	int	(*if_init)();		/* init routine */
     95  1.1      cgd 	int	(*if_output)();		/* output routine (enqueue) */
     96  1.1      cgd 	int	(*if_start)();		/* initiate output routine */
     97  1.1      cgd 	int	(*if_done)();		/* output complete routine */
     98  1.1      cgd 	int	(*if_ioctl)();		/* ioctl routine */
     99  1.1      cgd 	int	(*if_reset)();		/* bus reset routine */
    100  1.1      cgd 	int	(*if_watchdog)();	/* timer routine */
    101  1.1      cgd /* generic interface statistics */
    102  1.1      cgd 	int	if_ipackets;		/* packets received on interface */
    103  1.1      cgd 	int	if_ierrors;		/* input errors on interface */
    104  1.1      cgd 	int	if_opackets;		/* packets sent on interface */
    105  1.1      cgd 	int	if_oerrors;		/* output errors on interface */
    106  1.1      cgd 	int	if_collisions;		/* collisions on csma interfaces */
    107  1.1      cgd /* end statistics */
    108  1.1      cgd 	struct	ifnet *if_next;
    109  1.1      cgd 	u_char	if_type;		/* ethernet, tokenring, etc */
    110  1.1      cgd 	u_char	if_addrlen;		/* media address length */
    111  1.1      cgd 	u_char	if_hdrlen;		/* media header length */
    112  1.1      cgd 	u_char	if_index;		/* numeric abbreviation for this if  */
    113  1.1      cgd /* more statistics here to avoid recompiling netstat */
    114  1.1      cgd 	struct	timeval if_lastchange;	/* last updated */
    115  1.1      cgd 	int	if_ibytes;		/* total number of octets received */
    116  1.1      cgd 	int	if_obytes;		/* total number of octets sent */
    117  1.1      cgd 	int	if_imcasts;		/* packets received via multicast */
    118  1.1      cgd 	int	if_omcasts;		/* packets sent via multicast */
    119  1.1      cgd 	int	if_iqdrops;		/* dropped on input, this interface */
    120  1.1      cgd 	int	if_noproto;		/* destined for unsupported protocol */
    121  1.1      cgd 	int	if_baudrate;		/* linespeed */
    122  1.1      cgd         int	if_pcount;		/* number of promiscuous listeners */
    123  1.1      cgd };
    124  1.1      cgd 
    125  1.1      cgd #define	IFF_UP		0x1		/* interface is up */
    126  1.1      cgd #define	IFF_BROADCAST	0x2		/* broadcast address valid */
    127  1.1      cgd #define	IFF_DEBUG	0x4		/* turn on debugging */
    128  1.1      cgd #define	IFF_LOOPBACK	0x8		/* is a loopback net */
    129  1.1      cgd #define	IFF_POINTOPOINT	0x10		/* interface is point-to-point link */
    130  1.1      cgd #define	IFF_NOTRAILERS	0x20		/* avoid use of trailers */
    131  1.1      cgd #define	IFF_RUNNING	0x40		/* resources allocated */
    132  1.1      cgd #define	IFF_NOARP	0x80		/* no address resolution protocol */
    133  1.1      cgd /* next two not supported now, but reserved: */
    134  1.1      cgd #define	IFF_PROMISC	0x100		/* receive all packets */
    135  1.1      cgd #define	IFF_ALLMULTI	0x200		/* receive all multicast packets */
    136  1.1      cgd #define	IFF_OACTIVE	0x400		/* transmission in progress */
    137  1.1      cgd #define	IFF_SIMPLEX	0x800		/* can't hear own transmissions */
    138  1.1      cgd #define	IFF_LLC0	0x1000		/* interface driver control/status */
    139  1.1      cgd #define	IFF_LLC1	0x2000		/* interface driver control/status */
    140  1.1      cgd #define	IFF_LLC2	0x4000		/* interface driver control/status */
    141  1.1      cgd 
    142  1.4  hpeyerl #ifdef MULTICAST
    143  1.4  hpeyerl #define IFF_MULTICAST	0x8000		/* supports multicast */
    144  1.4  hpeyerl #endif
    145  1.4  hpeyerl 
    146  1.1      cgd /* flags set internally only: */
    147  1.4  hpeyerl #ifdef MULTICAST
    148  1.4  hpeyerl #define IFF_CANTCHANGE \
    149  1.4  hpeyerl 	(IFF_BROADCAST|IFF_POINTOPOINT|IFF_RUNNING|IFF_OACTIVE| \
    150  1.4  hpeyerl 	IFF_SIMPLEX|IFF_MULTICAST)
    151  1.4  hpeyerl #else
    152  1.1      cgd #define	IFF_CANTCHANGE \
    153  1.1      cgd 	(IFF_BROADCAST|IFF_POINTOPOINT|IFF_RUNNING|IFF_OACTIVE|IFF_SIMPLEX)
    154  1.4  hpeyerl #endif
    155  1.1      cgd 
    156  1.1      cgd /*
    157  1.1      cgd  * Output queues (ifp->if_snd) and internetwork datagram level (pup level 1)
    158  1.1      cgd  * input routines have queues of messages stored on ifqueue structures
    159  1.1      cgd  * (defined above).  Entries are added to and deleted from these structures
    160  1.1      cgd  * by these macros, which should be called with ipl raised to splimp().
    161  1.1      cgd  */
    162  1.1      cgd #define	IF_QFULL(ifq)		((ifq)->ifq_len >= (ifq)->ifq_maxlen)
    163  1.1      cgd #define	IF_DROP(ifq)		((ifq)->ifq_drops++)
    164  1.1      cgd #define	IF_ENQUEUE(ifq, m) { \
    165  1.1      cgd 	(m)->m_nextpkt = 0; \
    166  1.1      cgd 	if ((ifq)->ifq_tail == 0) \
    167  1.1      cgd 		(ifq)->ifq_head = m; \
    168  1.1      cgd 	else \
    169  1.1      cgd 		(ifq)->ifq_tail->m_nextpkt = m; \
    170  1.1      cgd 	(ifq)->ifq_tail = m; \
    171  1.1      cgd 	(ifq)->ifq_len++; \
    172  1.1      cgd }
    173  1.1      cgd #define	IF_PREPEND(ifq, m) { \
    174  1.1      cgd 	(m)->m_nextpkt = (ifq)->ifq_head; \
    175  1.1      cgd 	if ((ifq)->ifq_tail == 0) \
    176  1.1      cgd 		(ifq)->ifq_tail = (m); \
    177  1.1      cgd 	(ifq)->ifq_head = (m); \
    178  1.1      cgd 	(ifq)->ifq_len++; \
    179  1.1      cgd }
    180  1.1      cgd #define	IF_DEQUEUE(ifq, m) { \
    181  1.1      cgd 	(m) = (ifq)->ifq_head; \
    182  1.1      cgd 	if (m) { \
    183  1.1      cgd 		if (((ifq)->ifq_head = (m)->m_nextpkt) == 0) \
    184  1.1      cgd 			(ifq)->ifq_tail = 0; \
    185  1.1      cgd 		(m)->m_nextpkt = 0; \
    186  1.1      cgd 		(ifq)->ifq_len--; \
    187  1.1      cgd 	} \
    188  1.1      cgd }
    189  1.1      cgd 
    190  1.1      cgd #define	IFQ_MAXLEN	50
    191  1.1      cgd #define	IFNET_SLOWHZ	1		/* granularity is 1 second */
    192  1.1      cgd 
    193  1.1      cgd /*
    194  1.1      cgd  * The ifaddr structure contains information about one address
    195  1.1      cgd  * of an interface.  They are maintained by the different address families,
    196  1.1      cgd  * are allocated and attached when an address is set, and are linked
    197  1.1      cgd  * together so all addresses for an interface can be located.
    198  1.1      cgd  */
    199  1.1      cgd struct ifaddr {
    200  1.1      cgd 	struct	sockaddr *ifa_addr;	/* address of interface */
    201  1.1      cgd 	struct	sockaddr *ifa_dstaddr;	/* other end of p-to-p link */
    202  1.1      cgd #define	ifa_broadaddr	ifa_dstaddr	/* broadcast address interface */
    203  1.1      cgd 	struct	sockaddr *ifa_netmask;	/* used to determine subnet */
    204  1.1      cgd 	struct	ifnet *ifa_ifp;		/* back-pointer to interface */
    205  1.1      cgd 	struct	ifaddr *ifa_next;	/* next address for interface */
    206  1.1      cgd 	int	(*ifa_rtrequest)();	/* check or clean routes (+ or -)'d */
    207  1.1      cgd 	struct 	rtentry *ifa_rt;	/* ??? for ROUTETOIF */
    208  1.1      cgd 	u_short	ifa_flags;		/* mostly rt_flags for cloning */
    209  1.1      cgd 	u_short	ifa_llinfolen;		/* extra to malloc for link info */
    210  1.1      cgd };
    211  1.1      cgd #define IFA_ROUTE	RTF_UP		/* route installed */
    212  1.1      cgd /*
    213  1.1      cgd  * Interface request structure used for socket
    214  1.1      cgd  * ioctl's.  All interface ioctl's must have parameter
    215  1.1      cgd  * definitions which begin with ifr_name.  The
    216  1.1      cgd  * remainder may be interface specific.
    217  1.1      cgd  */
    218  1.1      cgd struct	ifreq {
    219  1.1      cgd #define	IFNAMSIZ	16
    220  1.1      cgd 	char	ifr_name[IFNAMSIZ];		/* if name, e.g. "en0" */
    221  1.1      cgd 	union {
    222  1.1      cgd 		struct	sockaddr ifru_addr;
    223  1.1      cgd 		struct	sockaddr ifru_dstaddr;
    224  1.1      cgd 		struct	sockaddr ifru_broadaddr;
    225  1.1      cgd 		short	ifru_flags;
    226  1.1      cgd 		int	ifru_metric;
    227  1.1      cgd 		caddr_t	ifru_data;
    228  1.1      cgd 	} ifr_ifru;
    229  1.1      cgd #define	ifr_addr	ifr_ifru.ifru_addr	/* address */
    230  1.1      cgd #define	ifr_dstaddr	ifr_ifru.ifru_dstaddr	/* other end of p-to-p link */
    231  1.1      cgd #define	ifr_broadaddr	ifr_ifru.ifru_broadaddr	/* broadcast address */
    232  1.1      cgd #define	ifr_flags	ifr_ifru.ifru_flags	/* flags */
    233  1.1      cgd #define	ifr_metric	ifr_ifru.ifru_metric	/* metric */
    234  1.1      cgd #define	ifr_data	ifr_ifru.ifru_data	/* for use by interface */
    235  1.1      cgd };
    236  1.1      cgd 
    237  1.1      cgd struct ifaliasreq {
    238  1.1      cgd 	char	ifra_name[IFNAMSIZ];		/* if name, e.g. "en0" */
    239  1.1      cgd 	struct	sockaddr ifra_addr;
    240  1.1      cgd 	struct	sockaddr ifra_broadaddr;
    241  1.1      cgd 	struct	sockaddr ifra_mask;
    242  1.1      cgd };
    243  1.1      cgd 
    244  1.1      cgd /*
    245  1.1      cgd  * Structure used in SIOCGIFCONF request.
    246  1.1      cgd  * Used to retrieve interface configuration
    247  1.1      cgd  * for machine (useful for programs which
    248  1.1      cgd  * must know all networks accessible).
    249  1.1      cgd  */
    250  1.1      cgd struct	ifconf {
    251  1.1      cgd 	int	ifc_len;		/* size of associated buffer */
    252  1.1      cgd 	union {
    253  1.1      cgd 		caddr_t	ifcu_buf;
    254  1.1      cgd 		struct	ifreq *ifcu_req;
    255  1.1      cgd 	} ifc_ifcu;
    256  1.1      cgd #define	ifc_buf	ifc_ifcu.ifcu_buf	/* buffer address */
    257  1.1      cgd #define	ifc_req	ifc_ifcu.ifcu_req	/* array of structures returned */
    258  1.1      cgd };
    259  1.1      cgd 
    260  1.1      cgd #ifdef KERNEL
    261  1.1      cgd #include "../net/if_arp.h"
    262  1.1      cgd struct	ifqueue rawintrq;		/* raw packet input queue */
    263  1.1      cgd struct	ifnet *ifnet;
    264  1.1      cgd struct	ifaddr *ifa_ifwithaddr(), *ifa_ifwithnet();
    265  1.1      cgd struct	ifaddr *ifa_ifwithdstaddr();
    266  1.1      cgd #else KERNEL
    267  1.1      cgd #include <net/if_arp.h>
    268  1.1      cgd #endif KERNEL
    269  1.2  mycroft 
    270  1.2  mycroft #endif /* !_NET_IF_H_ */
    271