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 | * | |
78ed81a3 | 33 | * from: @(#)if.h 7.11 (Berkeley) 3/19/91 |
34 | * $Id$ | |
15637ed4 RG |
35 | */ |
36 | ||
37 | /* | |
38 | * Structures defining a network interface, providing a packet | |
39 | * transport mechanism (ala level 0 of the PUP protocols). | |
40 | * | |
41 | * Each interface accepts output datagrams of a specified maximum | |
42 | * length, and provides higher level routines with input datagrams | |
43 | * received from its medium. | |
44 | * | |
45 | * Output occurs when the routine if_output is called, with three parameters: | |
46 | * (*ifp->if_output)(ifp, m, dst) | |
47 | * Here m is the mbuf chain to be sent and dst is the destination address. | |
48 | * The output routine encapsulates the supplied datagram if necessary, | |
49 | * and then transmits it on its medium. | |
50 | * | |
51 | * On input, each interface unwraps the data received by it, and either | |
52 | * places it on the input queue of a internetwork datagram routine | |
53 | * and posts the associated software interrupt, or passes the datagram to a raw | |
54 | * packet input routine. | |
55 | * | |
56 | * Routines exist for locating interfaces by their addresses | |
57 | * or for locating a interface on a certain network, as well as more general | |
58 | * routing and gateway routines maintaining information used to locate | |
59 | * interfaces. These routines live in the files if.c and route.c | |
60 | */ | |
61 | #ifndef _TIME_ /* XXX fast fix for SNMP, going away soon */ | |
62 | #ifdef KERNEL | |
63 | #include "../sys/time.h" | |
64 | #else | |
65 | #include <sys/time.h> | |
66 | #endif | |
67 | #endif | |
68 | ||
69 | /* | |
70 | * Structure defining a queue for a network interface. | |
71 | * | |
72 | * (Would like to call this struct ``if'', but C isn't PL/1.) | |
73 | */ | |
74 | ||
75 | struct ifnet { | |
76 | char *if_name; /* name, e.g. ``en'' or ``lo'' */ | |
77 | short if_unit; /* sub-unit for lower level driver */ | |
78 | short if_mtu; /* maximum transmission unit */ | |
79 | short if_flags; /* up/down, broadcast, etc. */ | |
80 | short if_timer; /* time 'til if_watchdog called */ | |
81 | int if_metric; /* routing metric (external only) */ | |
82 | struct ifaddr *if_addrlist; /* linked list of addresses per if */ | |
83 | struct ifqueue { | |
84 | struct mbuf *ifq_head; | |
85 | struct mbuf *ifq_tail; | |
86 | int ifq_len; | |
87 | int ifq_maxlen; | |
88 | int ifq_drops; | |
89 | } if_snd; /* output queue */ | |
90 | /* procedure handles */ | |
91 | int (*if_init)(); /* init routine */ | |
92 | int (*if_output)(); /* output routine (enqueue) */ | |
93 | int (*if_start)(); /* initiate output routine */ | |
94 | int (*if_done)(); /* output complete routine */ | |
95 | int (*if_ioctl)(); /* ioctl routine */ | |
96 | int (*if_reset)(); /* bus reset routine */ | |
97 | int (*if_watchdog)(); /* timer routine */ | |
98 | /* generic interface statistics */ | |
99 | int if_ipackets; /* packets received on interface */ | |
100 | int if_ierrors; /* input errors on interface */ | |
101 | int if_opackets; /* packets sent on interface */ | |
102 | int if_oerrors; /* output errors on interface */ | |
103 | int if_collisions; /* collisions on csma interfaces */ | |
104 | /* end statistics */ | |
105 | struct ifnet *if_next; | |
106 | u_char if_type; /* ethernet, tokenring, etc */ | |
107 | u_char if_addrlen; /* media address length */ | |
108 | u_char if_hdrlen; /* media header length */ | |
109 | u_char if_index; /* numeric abbreviation for this if */ | |
110 | /* more statistics here to avoid recompiling netstat */ | |
111 | struct timeval if_lastchange; /* last updated */ | |
112 | int if_ibytes; /* total number of octets received */ | |
113 | int if_obytes; /* total number of octets sent */ | |
114 | int if_imcasts; /* packets received via multicast */ | |
115 | int if_omcasts; /* packets sent via multicast */ | |
116 | int if_iqdrops; /* dropped on input, this interface */ | |
117 | int if_noproto; /* destined for unsupported protocol */ | |
118 | int if_baudrate; /* linespeed */ | |
119 | int if_pcount; /* number of promiscuous listeners */ | |
120 | }; | |
121 | ||
122 | #define IFF_UP 0x1 /* interface is up */ | |
123 | #define IFF_BROADCAST 0x2 /* broadcast address valid */ | |
124 | #define IFF_DEBUG 0x4 /* turn on debugging */ | |
125 | #define IFF_LOOPBACK 0x8 /* is a loopback net */ | |
126 | #define IFF_POINTOPOINT 0x10 /* interface is point-to-point link */ | |
127 | #define IFF_NOTRAILERS 0x20 /* avoid use of trailers */ | |
128 | #define IFF_RUNNING 0x40 /* resources allocated */ | |
129 | #define IFF_NOARP 0x80 /* no address resolution protocol */ | |
130 | /* next two not supported now, but reserved: */ | |
131 | #define IFF_PROMISC 0x100 /* receive all packets */ | |
132 | #define IFF_ALLMULTI 0x200 /* receive all multicast packets */ | |
133 | #define IFF_OACTIVE 0x400 /* transmission in progress */ | |
134 | #define IFF_SIMPLEX 0x800 /* can't hear own transmissions */ | |
135 | #define IFF_LLC0 0x1000 /* interface driver control/status */ | |
136 | #define IFF_LLC1 0x2000 /* interface driver control/status */ | |
137 | #define IFF_LLC2 0x4000 /* interface driver control/status */ | |
138 | ||
139 | /* flags set internally only: */ | |
140 | #define IFF_CANTCHANGE \ | |
141 | (IFF_BROADCAST|IFF_POINTOPOINT|IFF_RUNNING|IFF_OACTIVE|IFF_SIMPLEX) | |
142 | ||
143 | /* | |
144 | * Output queues (ifp->if_snd) and internetwork datagram level (pup level 1) | |
145 | * input routines have queues of messages stored on ifqueue structures | |
146 | * (defined above). Entries are added to and deleted from these structures | |
147 | * by these macros, which should be called with ipl raised to splimp(). | |
148 | */ | |
149 | #define IF_QFULL(ifq) ((ifq)->ifq_len >= (ifq)->ifq_maxlen) | |
150 | #define IF_DROP(ifq) ((ifq)->ifq_drops++) | |
151 | #define IF_ENQUEUE(ifq, m) { \ | |
152 | (m)->m_nextpkt = 0; \ | |
153 | if ((ifq)->ifq_tail == 0) \ | |
154 | (ifq)->ifq_head = m; \ | |
155 | else \ | |
156 | (ifq)->ifq_tail->m_nextpkt = m; \ | |
157 | (ifq)->ifq_tail = m; \ | |
158 | (ifq)->ifq_len++; \ | |
159 | } | |
160 | #define IF_PREPEND(ifq, m) { \ | |
161 | (m)->m_nextpkt = (ifq)->ifq_head; \ | |
162 | if ((ifq)->ifq_tail == 0) \ | |
163 | (ifq)->ifq_tail = (m); \ | |
164 | (ifq)->ifq_head = (m); \ | |
165 | (ifq)->ifq_len++; \ | |
166 | } | |
167 | #define IF_DEQUEUE(ifq, m) { \ | |
168 | (m) = (ifq)->ifq_head; \ | |
169 | if (m) { \ | |
170 | if (((ifq)->ifq_head = (m)->m_nextpkt) == 0) \ | |
171 | (ifq)->ifq_tail = 0; \ | |
172 | (m)->m_nextpkt = 0; \ | |
173 | (ifq)->ifq_len--; \ | |
174 | } \ | |
175 | } | |
176 | ||
177 | #define IFQ_MAXLEN 50 | |
178 | #define IFNET_SLOWHZ 1 /* granularity is 1 second */ | |
179 | ||
180 | /* | |
181 | * The ifaddr structure contains information about one address | |
182 | * of an interface. They are maintained by the different address families, | |
183 | * are allocated and attached when an address is set, and are linked | |
184 | * together so all addresses for an interface can be located. | |
185 | */ | |
186 | struct ifaddr { | |
187 | struct sockaddr *ifa_addr; /* address of interface */ | |
188 | struct sockaddr *ifa_dstaddr; /* other end of p-to-p link */ | |
189 | #define ifa_broadaddr ifa_dstaddr /* broadcast address interface */ | |
190 | struct sockaddr *ifa_netmask; /* used to determine subnet */ | |
191 | struct ifnet *ifa_ifp; /* back-pointer to interface */ | |
192 | struct ifaddr *ifa_next; /* next address for interface */ | |
193 | int (*ifa_rtrequest)(); /* check or clean routes (+ or -)'d */ | |
194 | struct rtentry *ifa_rt; /* ??? for ROUTETOIF */ | |
195 | u_short ifa_flags; /* mostly rt_flags for cloning */ | |
196 | u_short ifa_llinfolen; /* extra to malloc for link info */ | |
197 | }; | |
198 | #define IFA_ROUTE RTF_UP /* route installed */ | |
199 | /* | |
200 | * Interface request structure used for socket | |
201 | * ioctl's. All interface ioctl's must have parameter | |
202 | * definitions which begin with ifr_name. The | |
203 | * remainder may be interface specific. | |
204 | */ | |
205 | struct ifreq { | |
206 | #define IFNAMSIZ 16 | |
207 | char ifr_name[IFNAMSIZ]; /* if name, e.g. "en0" */ | |
208 | union { | |
209 | struct sockaddr ifru_addr; | |
210 | struct sockaddr ifru_dstaddr; | |
211 | struct sockaddr ifru_broadaddr; | |
212 | short ifru_flags; | |
213 | int ifru_metric; | |
214 | caddr_t ifru_data; | |
215 | } ifr_ifru; | |
216 | #define ifr_addr ifr_ifru.ifru_addr /* address */ | |
217 | #define ifr_dstaddr ifr_ifru.ifru_dstaddr /* other end of p-to-p link */ | |
218 | #define ifr_broadaddr ifr_ifru.ifru_broadaddr /* broadcast address */ | |
219 | #define ifr_flags ifr_ifru.ifru_flags /* flags */ | |
220 | #define ifr_metric ifr_ifru.ifru_metric /* metric */ | |
221 | #define ifr_data ifr_ifru.ifru_data /* for use by interface */ | |
222 | }; | |
223 | ||
224 | struct ifaliasreq { | |
225 | char ifra_name[IFNAMSIZ]; /* if name, e.g. "en0" */ | |
226 | struct sockaddr ifra_addr; | |
227 | struct sockaddr ifra_broadaddr; | |
228 | struct sockaddr ifra_mask; | |
229 | }; | |
230 | ||
231 | /* | |
232 | * Structure used in SIOCGIFCONF request. | |
233 | * Used to retrieve interface configuration | |
234 | * for machine (useful for programs which | |
235 | * must know all networks accessible). | |
236 | */ | |
237 | struct ifconf { | |
238 | int ifc_len; /* size of associated buffer */ | |
239 | union { | |
240 | caddr_t ifcu_buf; | |
241 | struct ifreq *ifcu_req; | |
242 | } ifc_ifcu; | |
243 | #define ifc_buf ifc_ifcu.ifcu_buf /* buffer address */ | |
244 | #define ifc_req ifc_ifcu.ifcu_req /* array of structures returned */ | |
245 | }; | |
246 | ||
247 | #ifdef KERNEL | |
248 | #include "../net/if_arp.h" | |
249 | struct ifqueue rawintrq; /* raw packet input queue */ | |
250 | struct ifnet *ifnet; | |
251 | struct ifaddr *ifa_ifwithaddr(), *ifa_ifwithnet(); | |
252 | struct ifaddr *ifa_ifwithdstaddr(); | |
253 | #else KERNEL | |
254 | #include <net/if_arp.h> | |
255 | #endif KERNEL |