1/*
2 * Copyright (c) 1982, 1986, 1989, 1993
3 * The Regents of the University of California. 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 *
33 * @(#)if.h 8.1 (Berkeley) 6/10/93
| 1/*
2 * Copyright (c) 1982, 1986, 1989, 1993
3 * The Regents of the University of California. 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 *
33 * @(#)if.h 8.1 (Berkeley) 6/10/93
|
35 */
36
37#ifndef _NET_IF_H_
38#define _NET_IF_H_
39
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, rt)
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
65#include <sys/socket.h> /* for struct sockaddr */
66
67#ifndef _TIME_ /* XXX fast fix for SNMP, going away soon */
68#include <sys/time.h>
69#endif
70
71#ifdef __STDC__
72/*
73 * Forward structure declarations for function prototypes [sic].
74 */
75struct mbuf;
76struct proc;
77struct rtentry;
78struct socket;
79struct ether_header;
80#endif
81
82struct if_data {
83 /* generic interface information */
84 u_char ifi_type; /* ethernet, tokenring, etc */
85 u_char ifi_physical; /* e.g., AUI, Thinnet, 10base-T, etc */
86 u_char ifi_addrlen; /* media address length */
87 u_char ifi_hdrlen; /* media header length */
88 u_long ifi_mtu; /* maximum transmission unit */
89 u_long ifi_metric; /* routing metric (external only) */
90 u_long ifi_baudrate; /* linespeed */
91 /* volatile statistics */
92 u_long ifi_ipackets; /* packets received on interface */
93 u_long ifi_ierrors; /* input errors on interface */
94 u_long ifi_opackets; /* packets sent on interface */
95 u_long ifi_oerrors; /* output errors on interface */
96 u_long ifi_collisions; /* collisions on csma interfaces */
97 u_long ifi_ibytes; /* total number of octets received */
98 u_long ifi_obytes; /* total number of octets sent */
99 u_long ifi_imcasts; /* packets received via multicast */
100 u_long ifi_omcasts; /* packets sent via multicast */
101 u_long ifi_iqdrops; /* dropped on input, this interface */
102 u_long ifi_noproto; /* destined for unsupported protocol */
103 struct timeval ifi_lastchange; /* last updated */
104};
105
106/*
107 * Structure defining a queue for a network interface.
108 *
109 * (Would like to call this struct ``if'', but C isn't PL/1.)
110 */
111
112struct ifqueue {
113 struct mbuf *ifq_head;
114 struct mbuf *ifq_tail;
115 int ifq_len;
116 int ifq_maxlen;
117 int ifq_drops;
118};
119
120/*
121 * Structure describing information about an interface
122 * which may be of interest to management entities.
123 */
124struct ifnet {
125 char *if_name; /* name, e.g. ``en'' or ``lo'' */
126 struct ifnet *if_next; /* all struct ifnets are chained */
127 struct ifaddr *if_addrlist; /* linked list of addresses per if */
128 int if_pcount; /* number of promiscuous listeners */
129 caddr_t if_bpf; /* packet filter structure */
130 u_short if_index; /* numeric abbreviation for this if */
131 short if_unit; /* sub-unit for lower level driver */
132 short if_timer; /* time 'til if_watchdog called */
133 short if_flags; /* up/down, broadcast, etc. */
134 struct if_data if_data;
135/* procedure handles */
136 void (*if_init) /* init routine */
137 __P((int));
138 int (*if_output) /* output routine (enqueue) */
139 __P((struct ifnet *, struct mbuf *, struct sockaddr *,
140 struct rtentry *));
141 void (*if_start) /* initiate output routine */
142 __P((struct ifnet *));
143 int (*if_done) /* output complete routine */
144 __P((struct ifnet *)); /* (XXX not used; fake prototype) */
145 int (*if_ioctl) /* ioctl routine */
146 __P((struct ifnet *, int, caddr_t));
147 void (*if_reset)
148 __P((int)); /* new autoconfig will permit removal */
149 void (*if_watchdog) /* timer routine */
150 __P((int));
151 struct ifqueue if_snd; /* output queue */
152};
153#define if_mtu if_data.ifi_mtu
154#define if_type if_data.ifi_type
155#define if_physical if_data.ifi_physical
156#define if_addrlen if_data.ifi_addrlen
157#define if_hdrlen if_data.ifi_hdrlen
158#define if_metric if_data.ifi_metric
159#define if_baudrate if_data.ifi_baudrate
160#define if_ipackets if_data.ifi_ipackets
161#define if_ierrors if_data.ifi_ierrors
162#define if_opackets if_data.ifi_opackets
163#define if_oerrors if_data.ifi_oerrors
164#define if_collisions if_data.ifi_collisions
165#define if_ibytes if_data.ifi_ibytes
166#define if_obytes if_data.ifi_obytes
167#define if_imcasts if_data.ifi_imcasts
168#define if_omcasts if_data.ifi_omcasts
169#define if_iqdrops if_data.ifi_iqdrops
170#define if_noproto if_data.ifi_noproto
171#define if_lastchange if_data.ifi_lastchange
172#define if_rawoutput(if, m, sa) if_output(if, m, sa, (struct rtentry *)0)
173
174#define IFF_UP 0x1 /* interface is up */
175#define IFF_BROADCAST 0x2 /* broadcast address valid */
176#define IFF_DEBUG 0x4 /* turn on debugging */
177#define IFF_LOOPBACK 0x8 /* is a loopback net */
178#define IFF_POINTOPOINT 0x10 /* interface is point-to-point link */
179#define IFF_NOTRAILERS 0x20 /* avoid use of trailers */
180#define IFF_RUNNING 0x40 /* resources allocated */
181#define IFF_NOARP 0x80 /* no address resolution protocol */
182#define IFF_PROMISC 0x100 /* receive all packets */
183#define IFF_ALLMULTI 0x200 /* receive all multicast packets */
184#define IFF_OACTIVE 0x400 /* transmission in progress */
185#define IFF_SIMPLEX 0x800 /* can't hear own transmissions */
186#define IFF_LINK0 0x1000 /* per link layer defined bit */
187#define IFF_LINK1 0x2000 /* per link layer defined bit */
188#define IFF_LINK2 0x4000 /* per link layer defined bit */
189#define IFF_ALTPHYS IFF_LINK2 /* use alternate physical connection */
190#define IFF_MULTICAST 0x8000 /* supports multicast */
191
192/* flags set internally only: */
193#define IFF_CANTCHANGE \
194 (IFF_BROADCAST|IFF_POINTOPOINT|IFF_RUNNING|IFF_OACTIVE|\
195 IFF_SIMPLEX|IFF_MULTICAST|IFF_ALLMULTI)
196
197
198/*
199 * These really don't belong here, but there's no other obviously appropriate
200 * location.
201 */
202#define IFP_AUI 0
203#define IFP_10BASE2 1
204#define IFP_10BASET 2
205/* etc. */
206
207/*
208 * Output queues (ifp->if_snd) and internetwork datagram level (pup level 1)
209 * input routines have queues of messages stored on ifqueue structures
210 * (defined above). Entries are added to and deleted from these structures
211 * by these macros, which should be called with ipl raised to splimp().
212 */
213#define IF_QFULL(ifq) ((ifq)->ifq_len >= (ifq)->ifq_maxlen)
214#define IF_DROP(ifq) ((ifq)->ifq_drops++)
215#define IF_ENQUEUE(ifq, m) { \
216 (m)->m_nextpkt = 0; \
217 if ((ifq)->ifq_tail == 0) \
218 (ifq)->ifq_head = m; \
219 else \
220 (ifq)->ifq_tail->m_nextpkt = m; \
221 (ifq)->ifq_tail = m; \
222 (ifq)->ifq_len++; \
223}
224#define IF_PREPEND(ifq, m) { \
225 (m)->m_nextpkt = (ifq)->ifq_head; \
226 if ((ifq)->ifq_tail == 0) \
227 (ifq)->ifq_tail = (m); \
228 (ifq)->ifq_head = (m); \
229 (ifq)->ifq_len++; \
230}
231#define IF_DEQUEUE(ifq, m) { \
232 (m) = (ifq)->ifq_head; \
233 if (m) { \
234 if (((ifq)->ifq_head = (m)->m_nextpkt) == 0) \
235 (ifq)->ifq_tail = 0; \
236 (m)->m_nextpkt = 0; \
237 (ifq)->ifq_len--; \
238 } \
239}
240
241#define IFQ_MAXLEN 50
242#define IFNET_SLOWHZ 1 /* granularity is 1 second */
243
244/*
245 * The ifaddr structure contains information about one address
246 * of an interface. They are maintained by the different address families,
247 * are allocated and attached when an address is set, and are linked
248 * together so all addresses for an interface can be located.
249 */
250struct ifaddr {
251 struct sockaddr *ifa_addr; /* address of interface */
252 struct sockaddr *ifa_dstaddr; /* other end of p-to-p link */
253#define ifa_broadaddr ifa_dstaddr /* broadcast address interface */
254 struct sockaddr *ifa_netmask; /* used to determine subnet */
255 struct ifnet *ifa_ifp; /* back-pointer to interface */
256 struct ifaddr *ifa_next; /* next address for interface */
257 void (*ifa_rtrequest) /* check or clean routes (+ or -)'d */
258 __P((int, struct rtentry *, struct sockaddr *));
259 u_short ifa_flags; /* mostly rt_flags for cloning */
260 short ifa_refcnt; /* extra to malloc for link info */
261 int ifa_metric; /* cost of going out this interface */
262#ifdef notdef
263 struct rtentry *ifa_rt; /* XXXX for ROUTETOIF ????? */
264#endif
265};
266#define IFA_ROUTE RTF_UP /* route installed */
267
268/*
269 * Message format for use in obtaining information about interfaces
270 * from getkerninfo and the routing socket
271 */
272struct if_msghdr {
273 u_short ifm_msglen; /* to skip over non-understood messages */
274 u_char ifm_version; /* future binary compatability */
275 u_char ifm_type; /* message type */
276 int ifm_addrs; /* like rtm_addrs */
277 int ifm_flags; /* value of if_flags */
278 u_short ifm_index; /* index for associated ifp */
279 struct if_data ifm_data;/* statistics and other data about if */
280};
281
282/*
283 * Message format for use in obtaining information about interface addresses
284 * from getkerninfo and the routing socket
285 */
286struct ifa_msghdr {
287 u_short ifam_msglen; /* to skip over non-understood messages */
288 u_char ifam_version; /* future binary compatability */
289 u_char ifam_type; /* message type */
290 int ifam_addrs; /* like rtm_addrs */
291 int ifam_flags; /* value of ifa_flags */
292 u_short ifam_index; /* index for associated ifp */
293 int ifam_metric; /* value of ifa_metric */
294};
295
296/*
297 * Interface request structure used for socket
298 * ioctl's. All interface ioctl's must have parameter
299 * definitions which begin with ifr_name. The
300 * remainder may be interface specific.
301 */
302struct ifreq {
303#define IFNAMSIZ 16
304 char ifr_name[IFNAMSIZ]; /* if name, e.g. "en0" */
305 union {
306 struct sockaddr ifru_addr;
307 struct sockaddr ifru_dstaddr;
308 struct sockaddr ifru_broadaddr;
309 short ifru_flags;
310 int ifru_metric;
311 int ifru_mtu;
312 int ifru_phys;
313 caddr_t ifru_data;
314 } ifr_ifru;
315#define ifr_addr ifr_ifru.ifru_addr /* address */
316#define ifr_dstaddr ifr_ifru.ifru_dstaddr /* other end of p-to-p link */
317#define ifr_broadaddr ifr_ifru.ifru_broadaddr /* broadcast address */
318#define ifr_flags ifr_ifru.ifru_flags /* flags */
319#define ifr_metric ifr_ifru.ifru_metric /* metric */
320#define ifr_mtu ifr_ifru.ifru_mtu /* mtu */
321#define ifr_phys ifr_ifru.ifru_phys /* physical wire */
322#define ifr_data ifr_ifru.ifru_data /* for use by interface */
323};
324
325struct ifaliasreq {
326 char ifra_name[IFNAMSIZ]; /* if name, e.g. "en0" */
327 struct sockaddr ifra_addr;
328 struct sockaddr ifra_broadaddr;
329 struct sockaddr ifra_mask;
330};
331
332/*
333 * Structure used in SIOCGIFCONF request.
334 * Used to retrieve interface configuration
335 * for machine (useful for programs which
336 * must know all networks accessible).
337 */
338struct ifconf {
339 int ifc_len; /* size of associated buffer */
340 union {
341 caddr_t ifcu_buf;
342 struct ifreq *ifcu_req;
343 } ifc_ifcu;
344#define ifc_buf ifc_ifcu.ifcu_buf /* buffer address */
345#define ifc_req ifc_ifcu.ifcu_req /* array of structures returned */
346};
347
348#include <net/if_arp.h>
349
350#ifdef KERNEL
351#define IFAFREE(ifa) \
352 if ((ifa)->ifa_refcnt <= 0) \
353 ifafree(ifa); \
354 else \
355 (ifa)->ifa_refcnt--;
356
357extern struct ifnet *ifnet;
358extern int ifqmaxlen;
359extern struct ifnet loif[];
360
361void ether_ifattach __P((struct ifnet *));
362void ether_input __P((struct ifnet *, struct ether_header *, struct mbuf *));
363int ether_output __P((struct ifnet *,
364 struct mbuf *, struct sockaddr *, struct rtentry *));
365char *ether_sprintf __P((u_char *));
366
367void if_attach __P((struct ifnet *));
368void if_down __P((struct ifnet *));
369void if_qflush __P((struct ifqueue *));
370void if_slowtimo __P((void *));
371void if_up __P((struct ifnet *));
372#ifdef vax
373void ifubareset __P((int));
374#endif
375int ifconf __P((int, caddr_t));
376/*void ifinit __P((void));*/ /* declared in systm.h for main() */
377int ifioctl __P((struct socket *, int, caddr_t, struct proc *));
378int ifpromisc __P((struct ifnet *, int));
379struct ifnet *ifunit __P((char *));
380
381struct ifaddr *ifa_ifwithaddr __P((struct sockaddr *));
382struct ifaddr *ifa_ifwithaf __P((int));
383struct ifaddr *ifa_ifwithdstaddr __P((struct sockaddr *));
384struct ifaddr *ifa_ifwithnet __P((struct sockaddr *));
385struct ifaddr *ifa_ifwithroute __P((int, struct sockaddr *,
386 struct sockaddr *));
387struct ifaddr *ifaof_ifpforaddr __P((struct sockaddr *, struct ifnet *));
388void ifafree __P((struct ifaddr *));
389void link_rtrequest __P((int, struct rtentry *, struct sockaddr *));
390
391int loioctl __P((struct ifnet *, int, caddr_t));
| 35 */
36
37#ifndef _NET_IF_H_
38#define _NET_IF_H_
39
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, rt)
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
65#include <sys/socket.h> /* for struct sockaddr */
66
67#ifndef _TIME_ /* XXX fast fix for SNMP, going away soon */
68#include <sys/time.h>
69#endif
70
71#ifdef __STDC__
72/*
73 * Forward structure declarations for function prototypes [sic].
74 */
75struct mbuf;
76struct proc;
77struct rtentry;
78struct socket;
79struct ether_header;
80#endif
81
82struct if_data {
83 /* generic interface information */
84 u_char ifi_type; /* ethernet, tokenring, etc */
85 u_char ifi_physical; /* e.g., AUI, Thinnet, 10base-T, etc */
86 u_char ifi_addrlen; /* media address length */
87 u_char ifi_hdrlen; /* media header length */
88 u_long ifi_mtu; /* maximum transmission unit */
89 u_long ifi_metric; /* routing metric (external only) */
90 u_long ifi_baudrate; /* linespeed */
91 /* volatile statistics */
92 u_long ifi_ipackets; /* packets received on interface */
93 u_long ifi_ierrors; /* input errors on interface */
94 u_long ifi_opackets; /* packets sent on interface */
95 u_long ifi_oerrors; /* output errors on interface */
96 u_long ifi_collisions; /* collisions on csma interfaces */
97 u_long ifi_ibytes; /* total number of octets received */
98 u_long ifi_obytes; /* total number of octets sent */
99 u_long ifi_imcasts; /* packets received via multicast */
100 u_long ifi_omcasts; /* packets sent via multicast */
101 u_long ifi_iqdrops; /* dropped on input, this interface */
102 u_long ifi_noproto; /* destined for unsupported protocol */
103 struct timeval ifi_lastchange; /* last updated */
104};
105
106/*
107 * Structure defining a queue for a network interface.
108 *
109 * (Would like to call this struct ``if'', but C isn't PL/1.)
110 */
111
112struct ifqueue {
113 struct mbuf *ifq_head;
114 struct mbuf *ifq_tail;
115 int ifq_len;
116 int ifq_maxlen;
117 int ifq_drops;
118};
119
120/*
121 * Structure describing information about an interface
122 * which may be of interest to management entities.
123 */
124struct ifnet {
125 char *if_name; /* name, e.g. ``en'' or ``lo'' */
126 struct ifnet *if_next; /* all struct ifnets are chained */
127 struct ifaddr *if_addrlist; /* linked list of addresses per if */
128 int if_pcount; /* number of promiscuous listeners */
129 caddr_t if_bpf; /* packet filter structure */
130 u_short if_index; /* numeric abbreviation for this if */
131 short if_unit; /* sub-unit for lower level driver */
132 short if_timer; /* time 'til if_watchdog called */
133 short if_flags; /* up/down, broadcast, etc. */
134 struct if_data if_data;
135/* procedure handles */
136 void (*if_init) /* init routine */
137 __P((int));
138 int (*if_output) /* output routine (enqueue) */
139 __P((struct ifnet *, struct mbuf *, struct sockaddr *,
140 struct rtentry *));
141 void (*if_start) /* initiate output routine */
142 __P((struct ifnet *));
143 int (*if_done) /* output complete routine */
144 __P((struct ifnet *)); /* (XXX not used; fake prototype) */
145 int (*if_ioctl) /* ioctl routine */
146 __P((struct ifnet *, int, caddr_t));
147 void (*if_reset)
148 __P((int)); /* new autoconfig will permit removal */
149 void (*if_watchdog) /* timer routine */
150 __P((int));
151 struct ifqueue if_snd; /* output queue */
152};
153#define if_mtu if_data.ifi_mtu
154#define if_type if_data.ifi_type
155#define if_physical if_data.ifi_physical
156#define if_addrlen if_data.ifi_addrlen
157#define if_hdrlen if_data.ifi_hdrlen
158#define if_metric if_data.ifi_metric
159#define if_baudrate if_data.ifi_baudrate
160#define if_ipackets if_data.ifi_ipackets
161#define if_ierrors if_data.ifi_ierrors
162#define if_opackets if_data.ifi_opackets
163#define if_oerrors if_data.ifi_oerrors
164#define if_collisions if_data.ifi_collisions
165#define if_ibytes if_data.ifi_ibytes
166#define if_obytes if_data.ifi_obytes
167#define if_imcasts if_data.ifi_imcasts
168#define if_omcasts if_data.ifi_omcasts
169#define if_iqdrops if_data.ifi_iqdrops
170#define if_noproto if_data.ifi_noproto
171#define if_lastchange if_data.ifi_lastchange
172#define if_rawoutput(if, m, sa) if_output(if, m, sa, (struct rtentry *)0)
173
174#define IFF_UP 0x1 /* interface is up */
175#define IFF_BROADCAST 0x2 /* broadcast address valid */
176#define IFF_DEBUG 0x4 /* turn on debugging */
177#define IFF_LOOPBACK 0x8 /* is a loopback net */
178#define IFF_POINTOPOINT 0x10 /* interface is point-to-point link */
179#define IFF_NOTRAILERS 0x20 /* avoid use of trailers */
180#define IFF_RUNNING 0x40 /* resources allocated */
181#define IFF_NOARP 0x80 /* no address resolution protocol */
182#define IFF_PROMISC 0x100 /* receive all packets */
183#define IFF_ALLMULTI 0x200 /* receive all multicast packets */
184#define IFF_OACTIVE 0x400 /* transmission in progress */
185#define IFF_SIMPLEX 0x800 /* can't hear own transmissions */
186#define IFF_LINK0 0x1000 /* per link layer defined bit */
187#define IFF_LINK1 0x2000 /* per link layer defined bit */
188#define IFF_LINK2 0x4000 /* per link layer defined bit */
189#define IFF_ALTPHYS IFF_LINK2 /* use alternate physical connection */
190#define IFF_MULTICAST 0x8000 /* supports multicast */
191
192/* flags set internally only: */
193#define IFF_CANTCHANGE \
194 (IFF_BROADCAST|IFF_POINTOPOINT|IFF_RUNNING|IFF_OACTIVE|\
195 IFF_SIMPLEX|IFF_MULTICAST|IFF_ALLMULTI)
196
197
198/*
199 * These really don't belong here, but there's no other obviously appropriate
200 * location.
201 */
202#define IFP_AUI 0
203#define IFP_10BASE2 1
204#define IFP_10BASET 2
205/* etc. */
206
207/*
208 * Output queues (ifp->if_snd) and internetwork datagram level (pup level 1)
209 * input routines have queues of messages stored on ifqueue structures
210 * (defined above). Entries are added to and deleted from these structures
211 * by these macros, which should be called with ipl raised to splimp().
212 */
213#define IF_QFULL(ifq) ((ifq)->ifq_len >= (ifq)->ifq_maxlen)
214#define IF_DROP(ifq) ((ifq)->ifq_drops++)
215#define IF_ENQUEUE(ifq, m) { \
216 (m)->m_nextpkt = 0; \
217 if ((ifq)->ifq_tail == 0) \
218 (ifq)->ifq_head = m; \
219 else \
220 (ifq)->ifq_tail->m_nextpkt = m; \
221 (ifq)->ifq_tail = m; \
222 (ifq)->ifq_len++; \
223}
224#define IF_PREPEND(ifq, m) { \
225 (m)->m_nextpkt = (ifq)->ifq_head; \
226 if ((ifq)->ifq_tail == 0) \
227 (ifq)->ifq_tail = (m); \
228 (ifq)->ifq_head = (m); \
229 (ifq)->ifq_len++; \
230}
231#define IF_DEQUEUE(ifq, m) { \
232 (m) = (ifq)->ifq_head; \
233 if (m) { \
234 if (((ifq)->ifq_head = (m)->m_nextpkt) == 0) \
235 (ifq)->ifq_tail = 0; \
236 (m)->m_nextpkt = 0; \
237 (ifq)->ifq_len--; \
238 } \
239}
240
241#define IFQ_MAXLEN 50
242#define IFNET_SLOWHZ 1 /* granularity is 1 second */
243
244/*
245 * The ifaddr structure contains information about one address
246 * of an interface. They are maintained by the different address families,
247 * are allocated and attached when an address is set, and are linked
248 * together so all addresses for an interface can be located.
249 */
250struct ifaddr {
251 struct sockaddr *ifa_addr; /* address of interface */
252 struct sockaddr *ifa_dstaddr; /* other end of p-to-p link */
253#define ifa_broadaddr ifa_dstaddr /* broadcast address interface */
254 struct sockaddr *ifa_netmask; /* used to determine subnet */
255 struct ifnet *ifa_ifp; /* back-pointer to interface */
256 struct ifaddr *ifa_next; /* next address for interface */
257 void (*ifa_rtrequest) /* check or clean routes (+ or -)'d */
258 __P((int, struct rtentry *, struct sockaddr *));
259 u_short ifa_flags; /* mostly rt_flags for cloning */
260 short ifa_refcnt; /* extra to malloc for link info */
261 int ifa_metric; /* cost of going out this interface */
262#ifdef notdef
263 struct rtentry *ifa_rt; /* XXXX for ROUTETOIF ????? */
264#endif
265};
266#define IFA_ROUTE RTF_UP /* route installed */
267
268/*
269 * Message format for use in obtaining information about interfaces
270 * from getkerninfo and the routing socket
271 */
272struct if_msghdr {
273 u_short ifm_msglen; /* to skip over non-understood messages */
274 u_char ifm_version; /* future binary compatability */
275 u_char ifm_type; /* message type */
276 int ifm_addrs; /* like rtm_addrs */
277 int ifm_flags; /* value of if_flags */
278 u_short ifm_index; /* index for associated ifp */
279 struct if_data ifm_data;/* statistics and other data about if */
280};
281
282/*
283 * Message format for use in obtaining information about interface addresses
284 * from getkerninfo and the routing socket
285 */
286struct ifa_msghdr {
287 u_short ifam_msglen; /* to skip over non-understood messages */
288 u_char ifam_version; /* future binary compatability */
289 u_char ifam_type; /* message type */
290 int ifam_addrs; /* like rtm_addrs */
291 int ifam_flags; /* value of ifa_flags */
292 u_short ifam_index; /* index for associated ifp */
293 int ifam_metric; /* value of ifa_metric */
294};
295
296/*
297 * Interface request structure used for socket
298 * ioctl's. All interface ioctl's must have parameter
299 * definitions which begin with ifr_name. The
300 * remainder may be interface specific.
301 */
302struct ifreq {
303#define IFNAMSIZ 16
304 char ifr_name[IFNAMSIZ]; /* if name, e.g. "en0" */
305 union {
306 struct sockaddr ifru_addr;
307 struct sockaddr ifru_dstaddr;
308 struct sockaddr ifru_broadaddr;
309 short ifru_flags;
310 int ifru_metric;
311 int ifru_mtu;
312 int ifru_phys;
313 caddr_t ifru_data;
314 } ifr_ifru;
315#define ifr_addr ifr_ifru.ifru_addr /* address */
316#define ifr_dstaddr ifr_ifru.ifru_dstaddr /* other end of p-to-p link */
317#define ifr_broadaddr ifr_ifru.ifru_broadaddr /* broadcast address */
318#define ifr_flags ifr_ifru.ifru_flags /* flags */
319#define ifr_metric ifr_ifru.ifru_metric /* metric */
320#define ifr_mtu ifr_ifru.ifru_mtu /* mtu */
321#define ifr_phys ifr_ifru.ifru_phys /* physical wire */
322#define ifr_data ifr_ifru.ifru_data /* for use by interface */
323};
324
325struct ifaliasreq {
326 char ifra_name[IFNAMSIZ]; /* if name, e.g. "en0" */
327 struct sockaddr ifra_addr;
328 struct sockaddr ifra_broadaddr;
329 struct sockaddr ifra_mask;
330};
331
332/*
333 * Structure used in SIOCGIFCONF request.
334 * Used to retrieve interface configuration
335 * for machine (useful for programs which
336 * must know all networks accessible).
337 */
338struct ifconf {
339 int ifc_len; /* size of associated buffer */
340 union {
341 caddr_t ifcu_buf;
342 struct ifreq *ifcu_req;
343 } ifc_ifcu;
344#define ifc_buf ifc_ifcu.ifcu_buf /* buffer address */
345#define ifc_req ifc_ifcu.ifcu_req /* array of structures returned */
346};
347
348#include <net/if_arp.h>
349
350#ifdef KERNEL
351#define IFAFREE(ifa) \
352 if ((ifa)->ifa_refcnt <= 0) \
353 ifafree(ifa); \
354 else \
355 (ifa)->ifa_refcnt--;
356
357extern struct ifnet *ifnet;
358extern int ifqmaxlen;
359extern struct ifnet loif[];
360
361void ether_ifattach __P((struct ifnet *));
362void ether_input __P((struct ifnet *, struct ether_header *, struct mbuf *));
363int ether_output __P((struct ifnet *,
364 struct mbuf *, struct sockaddr *, struct rtentry *));
365char *ether_sprintf __P((u_char *));
366
367void if_attach __P((struct ifnet *));
368void if_down __P((struct ifnet *));
369void if_qflush __P((struct ifqueue *));
370void if_slowtimo __P((void *));
371void if_up __P((struct ifnet *));
372#ifdef vax
373void ifubareset __P((int));
374#endif
375int ifconf __P((int, caddr_t));
376/*void ifinit __P((void));*/ /* declared in systm.h for main() */
377int ifioctl __P((struct socket *, int, caddr_t, struct proc *));
378int ifpromisc __P((struct ifnet *, int));
379struct ifnet *ifunit __P((char *));
380
381struct ifaddr *ifa_ifwithaddr __P((struct sockaddr *));
382struct ifaddr *ifa_ifwithaf __P((int));
383struct ifaddr *ifa_ifwithdstaddr __P((struct sockaddr *));
384struct ifaddr *ifa_ifwithnet __P((struct sockaddr *));
385struct ifaddr *ifa_ifwithroute __P((int, struct sockaddr *,
386 struct sockaddr *));
387struct ifaddr *ifaof_ifpforaddr __P((struct sockaddr *, struct ifnet *));
388void ifafree __P((struct ifaddr *));
389void link_rtrequest __P((int, struct rtentry *, struct sockaddr *));
390
391int loioctl __P((struct ifnet *, int, caddr_t));
|