[unix-history] / sys / net / if.h

/*
 * Copyright (c) 1982, 1986, 1989 Regents of the University of California.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	from: @(#)if.h	7.11 (Berkeley) 3/19/91
 *	$Id: if.h,v 1.7 1993/11/13 03:22:12 wollman Exp $
 */

#ifndef _NET_IF_H_
#define _NET_IF_H_ 1

/*
 * Structures defining a network interface, providing a packet
 * transport mechanism (ala level 0 of the PUP protocols).
 *
 * Each interface accepts output datagrams of a specified maximum
 * length, and provides higher level routines with input datagrams
 * received from its medium.
 *
 * Output occurs when the routine if_output is called, with three parameters:
 *	(*ifp->if_output)(ifp, m, dst)
 * Here m is the mbuf chain to be sent and dst is the destination address.
 * The output routine encapsulates the supplied datagram if necessary,
 * and then transmits it on its medium.
 *
 * On input, each interface unwraps the data received by it, and either
 * places it on the input queue of a internetwork datagram routine
 * and posts the associated software interrupt, or passes the datagram to a raw
 * packet input routine.
 *
 * Routines exist for locating interfaces by their addresses
 * or for locating a interface on a certain network, as well as more general
 * routing and gateway routines maintaining information used to locate
 * interfaces.  These routines live in the files if.c and route.c
 */
#ifndef _TIME_ /*  XXX fast fix for SNMP, going away soon */
#ifdef KERNEL
#include "../sys/time.h"
#else
#include <sys/time.h>
#endif
#endif

/*
 * Structure defining a queue for a network interface.
 *
 * (Would like to call this struct ``if'', but C isn't PL/1.)
 */

struct ifnet {
	char	*if_name;		/* name, e.g. ``en'' or ``lo'' */
	short	if_unit;		/* sub-unit for lower level driver */
	u_short	if_mtu;			/* maximum transmission unit */
	short	if_flags;		/* up/down, broadcast, etc. */
	short	if_timer;		/* time 'til if_watchdog called */
	int	if_metric;		/* routing metric (external only) */
	struct	ifaddr *if_addrlist;	/* linked list of addresses per if */
	struct	ifqueue {
		struct	mbuf *ifq_head;
		struct	mbuf *ifq_tail;
		int	ifq_len;
		int	ifq_maxlen;
		int	ifq_drops;
	} if_snd;			/* output queue */
/* procedure handles */
	int	(*if_init)();		/* init routine */
	int	(*if_output)();		/* output routine (enqueue) */
	int	(*if_start)();		/* initiate output routine */
	int	(*if_done)();		/* output complete routine */
	int	(*if_ioctl)();		/* ioctl routine */
	int	(*if_reset)();		/* bus reset routine */
	int	(*if_watchdog)();	/* timer routine */
/* generic interface statistics */
	int	if_ipackets;		/* packets received on interface */
	int	if_ierrors;		/* input errors on interface */
	int	if_opackets;		/* packets sent on interface */
	int	if_oerrors;		/* output errors on interface */
	int	if_collisions;		/* collisions on csma interfaces */
/* end statistics */
	struct	ifnet *if_next;
	u_char	if_type;		/* ethernet, tokenring, etc */
	u_char	if_addrlen;		/* media address length */
	u_char	if_hdrlen;		/* media header length */
	u_char	if_index;		/* numeric abbreviation for this if  */
/* more statistics here to avoid recompiling netstat */
	struct	timeval if_lastchange;	/* last updated */
	int	if_ibytes;		/* total number of octets received */
	int	if_obytes;		/* total number of octets sent */
	int	if_imcasts;		/* packets received via multicast */
	int	if_omcasts;		/* packets sent via multicast */
	int	if_iqdrops;		/* dropped on input, this interface */
	int	if_noproto;		/* destined for unsupported protocol */
	int	if_baudrate;		/* linespeed */
        int	if_pcount;		/* number of promiscuous listeners */
};

#define	IFF_UP		0x1		/* interface is up */
#define	IFF_BROADCAST	0x2		/* broadcast address valid */
#define	IFF_DEBUG	0x4		/* turn on debugging */
#define	IFF_LOOPBACK	0x8		/* is a loopback net */
#define	IFF_POINTOPOINT	0x10		/* interface is point-to-point link */
#define	IFF_NOTRAILERS	0x20		/* avoid use of trailers */
#define	IFF_RUNNING	0x40		/* resources allocated */
#define	IFF_NOARP	0x80		/* no address resolution protocol */
/* next two not supported now, but reserved: */
#define	IFF_PROMISC	0x100		/* receive all packets */
#define	IFF_ALLMULTI	0x200		/* receive all multicast packets */
#define	IFF_OACTIVE	0x400		/* transmission in progress */
#define	IFF_SIMPLEX	0x800		/* can't hear own transmissions */
#define	IFF_LLC0	0x1000		/* IEEE 802.2 LLC class 0 */
#define	IFF_LLC1	0x2000		/* IEEE 802.2 LLC class 1 */
#define	IFF_LLC2	0x4000		/* IEEE 802.2 LLC class 2 */
#ifdef notyet
#define IFF_ALTPHYS	0x8000	/* alternative physical connection */
#define IFF_MULTICAST	0x10000	/* i'face supports multicast */
#define IFF_VIRTUAL	0x20000	/* i'face is really a VIF */

/* flags set internally only: */
#define	IFF_CANTCHANGE \
	(IFF_BROADCAST|IFF_POINTOPOINT|IFF_RUNNING|IFF_OACTIVE|IFF_SIMPLEX\
	 IFF_MULTICAST|IFF_VIRTUAL)
#else /* current code */
/* flags set internally only: */
#define	IFF_CANTCHANGE \
	(IFF_BROADCAST|IFF_POINTOPOINT|IFF_RUNNING|IFF_OACTIVE|IFF_SIMPLEX)
#endif /* not notyet */


/*
 * Output queues (ifp->if_snd) and internetwork datagram level (pup level 1)
 * input routines have queues of messages stored on ifqueue structures
 * (defined above).  Entries are added to and deleted from these structures
 * by these macros, which should be called with ipl raised to splimp().
 */
#define	IF_QFULL(ifq)		((ifq)->ifq_len >= (ifq)->ifq_maxlen)
#define	IF_DROP(ifq)		((ifq)->ifq_drops++)
#define	IF_ENQUEUE(ifq, m) { \
	(m)->m_nextpkt = 0; \
	if ((ifq)->ifq_tail == 0) \
		(ifq)->ifq_head = m; \
	else \
		(ifq)->ifq_tail->m_nextpkt = m; \
	(ifq)->ifq_tail = m; \
	(ifq)->ifq_len++; \
}
#define	IF_PREPEND(ifq, m) { \
	(m)->m_nextpkt = (ifq)->ifq_head; \
	if ((ifq)->ifq_tail == 0) \
		(ifq)->ifq_tail = (m); \
	(ifq)->ifq_head = (m); \
	(ifq)->ifq_len++; \
}
#define	IF_DEQUEUE(ifq, m) { \
	(m) = (ifq)->ifq_head; \
	if (m) { \
		if (((ifq)->ifq_head = (m)->m_nextpkt) == 0) \
			(ifq)->ifq_tail = 0; \
		(m)->m_nextpkt = 0; \
		(ifq)->ifq_len--; \
	} \
}

#define	IFQ_MAXLEN	50
#define	IFNET_SLOWHZ	1		/* granularity is 1 second */

/*
 * The ifaddr structure contains information about one address
 * of an interface.  They are maintained by the different address families,
 * are allocated and attached when an address is set, and are linked
 * together so all addresses for an interface can be located.
 */
struct ifaddr {
	struct	sockaddr *ifa_addr;	/* address of interface */
	struct	sockaddr *ifa_dstaddr;	/* other end of p-to-p link */
#define	ifa_broadaddr	ifa_dstaddr	/* broadcast address interface */
	struct	sockaddr *ifa_netmask;	/* used to determine subnet */
	struct	ifnet *ifa_ifp;		/* back-pointer to interface */
	struct	ifaddr *ifa_next;	/* next address for interface */
	int	(*ifa_rtrequest)();	/* check or clean routes (+ or -)'d */
	struct 	rtentry *ifa_rt;	/* ??? for ROUTETOIF */
	u_short	ifa_flags;		/* mostly rt_flags for cloning */
	u_short	ifa_llinfolen;		/* extra to malloc for link info */
};
#define IFA_ROUTE	RTF_UP		/* route installed */
/*
 * Interface request structure used for socket
 * ioctl's.  All interface ioctl's must have parameter
 * definitions which begin with ifr_name.  The
 * remainder may be interface specific.
 */
struct	ifreq {
#define	IFNAMSIZ	16
	char	ifr_name[IFNAMSIZ];		/* if name, e.g. "en0" */
	union {
		struct	sockaddr ifru_addr;
		struct	sockaddr ifru_dstaddr;
		struct	sockaddr ifru_broadaddr;
		short	ifru_flags;
		int	ifru_metric;
		caddr_t	ifru_data;
	} ifr_ifru;
#define	ifr_addr	ifr_ifru.ifru_addr	/* address */
#define	ifr_dstaddr	ifr_ifru.ifru_dstaddr	/* other end of p-to-p link */
#define	ifr_broadaddr	ifr_ifru.ifru_broadaddr	/* broadcast address */
#define	ifr_flags	ifr_ifru.ifru_flags	/* flags */
#define	ifr_metric	ifr_ifru.ifru_metric	/* metric */
#define	ifr_data	ifr_ifru.ifru_data	/* for use by interface */
};

struct ifaliasreq {
	char	ifra_name[IFNAMSIZ];		/* if name, e.g. "en0" */
	struct	sockaddr ifra_addr;
	struct	sockaddr ifra_broadaddr;
	struct	sockaddr ifra_mask;
};

/*
 * Structure used in SIOCGIFCONF request.
 * Used to retrieve interface configuration
 * for machine (useful for programs which
 * must know all networks accessible).
 */
struct	ifconf {
	int	ifc_len;		/* size of associated buffer */
	union {
		caddr_t	ifcu_buf;
		struct	ifreq *ifcu_req;
	} ifc_ifcu;
#define	ifc_buf	ifc_ifcu.ifcu_buf	/* buffer address */
#define	ifc_req	ifc_ifcu.ifcu_req	/* array of structures returned */
};

#ifdef KERNEL
#include "../net/if_arp.h"
extern struct	ifqueue rawintrq;		/* raw packet input queue */
extern struct	ifnet *ifnet;
struct	ifaddr *ifa_ifwithaddr(), *ifa_ifwithnet();
struct	ifaddr *ifa_ifwithdstaddr();
extern struct	ifnet loif;

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