in_var.h revision 1.21 1 1.21 tls /* $NetBSD: in_var.h,v 1.21 1998/02/13 18:21:42 tls Exp $ */
2 1.8 cgd
3 1.1 cgd /*
4 1.7 mycroft * Copyright (c) 1985, 1986, 1993
5 1.7 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd *
35 1.19 thorpej * @(#)in_var.h 8.2 (Berkeley) 1/9/95
36 1.1 cgd */
37 1.1 cgd
38 1.20 perry #ifndef _NETINET_IN_VAR_H_
39 1.20 perry #define _NETINET_IN_VAR_H_
40 1.20 perry
41 1.15 mycroft #include <sys/queue.h>
42 1.15 mycroft
43 1.1 cgd /*
44 1.1 cgd * Interface address, Internet version. One of these structures
45 1.1 cgd * is allocated for each interface with an Internet address.
46 1.1 cgd * The ifaddr structure contains the protocol-independent part
47 1.1 cgd * of the structure and is assumed to be first.
48 1.1 cgd */
49 1.1 cgd struct in_ifaddr {
50 1.1 cgd struct ifaddr ia_ifa; /* protocol-independent info */
51 1.1 cgd #define ia_ifp ia_ifa.ifa_ifp
52 1.7 mycroft #define ia_flags ia_ifa.ifa_flags
53 1.1 cgd /* ia_{,sub}net{,mask} in host order */
54 1.11 cgd u_int32_t ia_net; /* network number of interface */
55 1.11 cgd u_int32_t ia_netmask; /* mask of net part */
56 1.11 cgd u_int32_t ia_subnet; /* subnet number, including net */
57 1.11 cgd u_int32_t ia_subnetmask; /* mask of subnet part */
58 1.1 cgd struct in_addr ia_netbroadcast; /* to recognize net broadcasts */
59 1.21 tls LIST_ENTRY(in_ifaddr) ia_hash; /* entry in bucket of inet addresses */
60 1.15 mycroft TAILQ_ENTRY(in_ifaddr) ia_list; /* list of internet addresses */
61 1.1 cgd struct sockaddr_in ia_addr; /* reserve space for interface name */
62 1.11 cgd struct sockaddr_in ia_dstaddr; /* reserve space for broadcast addr */
63 1.1 cgd #define ia_broadaddr ia_dstaddr
64 1.1 cgd struct sockaddr_in ia_sockmask; /* reserve space for general netmask */
65 1.15 mycroft LIST_HEAD(, in_multi) ia_multiaddrs; /* list of multicast addresses */
66 1.1 cgd };
67 1.1 cgd
68 1.1 cgd struct in_aliasreq {
69 1.1 cgd char ifra_name[IFNAMSIZ]; /* if name, e.g. "en0" */
70 1.1 cgd struct sockaddr_in ifra_addr;
71 1.14 mycroft struct sockaddr_in ifra_dstaddr;
72 1.14 mycroft #define ifra_broadaddr ifra_dstaddr
73 1.1 cgd struct sockaddr_in ifra_mask;
74 1.1 cgd };
75 1.1 cgd /*
76 1.1 cgd * Given a pointer to an in_ifaddr (ifaddr),
77 1.1 cgd * return a pointer to the addr as a sockaddr_in.
78 1.1 cgd */
79 1.1 cgd #define IA_SIN(ia) (&(((struct in_ifaddr *)(ia))->ia_addr))
80 1.1 cgd
81 1.7 mycroft
82 1.10 briggs #ifdef _KERNEL
83 1.21 tls #ifndef IN_IFADDR_HASH_SIZE
84 1.21 tls #define IN_IFADDR_HASH_SIZE 293
85 1.21 tls #endif
86 1.21 tls
87 1.21 tls #define IN_IFADDR_HASH(x) in_ifaddrhashtbl[(u_long)(x) % IN_IFADDR_HASH_SIZE]
88 1.21 tls
89 1.21 tls u_long in_ifaddrhash; /* size of hash table - 1 */
90 1.21 tls int in_ifaddrentries; /* total number of addrs */
91 1.21 tls LIST_HEAD(in_ifaddrhashhead, in_ifaddr); /* Type of the hash head */
92 1.21 tls TAILQ_HEAD(in_ifaddrhead, in_ifaddr); /* Type of the list head */
93 1.21 tls
94 1.21 tls extern struct in_ifaddrhashhead *in_ifaddrhashtbl; /* Hash table head */
95 1.21 tls extern struct in_ifaddrhead in_ifaddr; /* List head (in ip_input) */
96 1.21 tls
97 1.7 mycroft extern struct ifqueue ipintrq; /* ip packet input queue */
98 1.7 mycroft void in_socktrim __P((struct sockaddr_in *));
99 1.7 mycroft
100 1.2 mycroft
101 1.4 hpeyerl /*
102 1.21 tls * Macro for finding whether an internet address (in_addr) belongs to one
103 1.21 tls * of our interfaces (in_ifaddr). NULL if the address isn't ours.
104 1.21 tls */
105 1.21 tls #define INADDR_TO_IA(addr, ia) \
106 1.21 tls /* struct in_addr addr; */ \
107 1.21 tls /* struct in_ifaddr *ia; */ \
108 1.21 tls { \
109 1.21 tls for (ia = IN_IFADDR_HASH((addr).s_addr).lh_first; \
110 1.21 tls ia != NULL && !in_hosteq(ia->ia_addr.sin_addr, (addr)); \
111 1.21 tls ia = ia->ia_hash.le_next) \
112 1.21 tls continue; \
113 1.21 tls }
114 1.21 tls
115 1.21 tls /*
116 1.4 hpeyerl * Macro for finding the interface (ifnet structure) corresponding to one
117 1.4 hpeyerl * of our IP addresses.
118 1.4 hpeyerl */
119 1.7 mycroft #define INADDR_TO_IFP(addr, ifp) \
120 1.4 hpeyerl /* struct in_addr addr; */ \
121 1.4 hpeyerl /* struct ifnet *ifp; */ \
122 1.4 hpeyerl { \
123 1.4 hpeyerl register struct in_ifaddr *ia; \
124 1.4 hpeyerl \
125 1.21 tls INADDR_TO_IA(addr, ia); \
126 1.4 hpeyerl (ifp) = (ia == NULL) ? NULL : ia->ia_ifp; \
127 1.4 hpeyerl }
128 1.4 hpeyerl
129 1.4 hpeyerl /*
130 1.21 tls * Macro for finding an internet address structure (in_ifaddr) corresponding
131 1.4 hpeyerl * to a given interface (ifnet structure).
132 1.4 hpeyerl */
133 1.7 mycroft #define IFP_TO_IA(ifp, ia) \
134 1.4 hpeyerl /* struct ifnet *ifp; */ \
135 1.4 hpeyerl /* struct in_ifaddr *ia; */ \
136 1.4 hpeyerl { \
137 1.21 tls register struct ifaddr *ifa; \
138 1.21 tls \
139 1.21 tls for (ifa = (ifp)->if_addrlist.tqh_first; \
140 1.21 tls ifa != NULL && ifa->ifa_addr->sa_family != AF_INET; \
141 1.21 tls ifa = ifa->ifa_list.tqe_next) \
142 1.4 hpeyerl continue; \
143 1.21 tls (ia) = ifatoia(ifa); \
144 1.4 hpeyerl }
145 1.4 hpeyerl #endif
146 1.4 hpeyerl
147 1.4 hpeyerl /*
148 1.12 mycroft * Per-interface router version information.
149 1.12 mycroft */
150 1.12 mycroft struct router_info {
151 1.12 mycroft struct ifnet *rti_ifp;
152 1.12 mycroft int rti_type; /* type of router on this interface */
153 1.12 mycroft int rti_age; /* time since last v1 query */
154 1.12 mycroft struct router_info *rti_next;
155 1.12 mycroft };
156 1.12 mycroft
157 1.12 mycroft /*
158 1.4 hpeyerl * Internet multicast address structure. There is one of these for each IP
159 1.4 hpeyerl * multicast group to which this host belongs on a given network interface.
160 1.4 hpeyerl * They are kept in a linked list, rooted in the interface's in_ifaddr
161 1.4 hpeyerl * structure.
162 1.4 hpeyerl */
163 1.4 hpeyerl struct in_multi {
164 1.4 hpeyerl struct in_addr inm_addr; /* IP multicast address */
165 1.4 hpeyerl struct ifnet *inm_ifp; /* back pointer to ifnet */
166 1.4 hpeyerl struct in_ifaddr *inm_ia; /* back pointer to in_ifaddr */
167 1.4 hpeyerl u_int inm_refcount; /* no. membership claims by sockets */
168 1.4 hpeyerl u_int inm_timer; /* IGMP membership report timer */
169 1.15 mycroft LIST_ENTRY(in_multi) inm_list; /* list of multicast addresses */
170 1.12 mycroft u_int inm_state; /* state of membership */
171 1.12 mycroft struct router_info *inm_rti; /* router version info */
172 1.4 hpeyerl };
173 1.4 hpeyerl
174 1.9 jtc #ifdef _KERNEL
175 1.4 hpeyerl /*
176 1.4 hpeyerl * Structure used by macros below to remember position when stepping through
177 1.4 hpeyerl * all of the in_multi records.
178 1.4 hpeyerl */
179 1.4 hpeyerl struct in_multistep {
180 1.4 hpeyerl struct in_ifaddr *i_ia;
181 1.4 hpeyerl struct in_multi *i_inm;
182 1.4 hpeyerl };
183 1.4 hpeyerl
184 1.4 hpeyerl /*
185 1.4 hpeyerl * Macro for looking up the in_multi record for a given IP multicast address
186 1.4 hpeyerl * on a given interface. If no matching record is found, "inm" returns NULL.
187 1.4 hpeyerl */
188 1.7 mycroft #define IN_LOOKUP_MULTI(addr, ifp, inm) \
189 1.4 hpeyerl /* struct in_addr addr; */ \
190 1.4 hpeyerl /* struct ifnet *ifp; */ \
191 1.4 hpeyerl /* struct in_multi *inm; */ \
192 1.4 hpeyerl { \
193 1.4 hpeyerl register struct in_ifaddr *ia; \
194 1.4 hpeyerl \
195 1.21 tls IFP_TO_IA((ifp), ia); /* multicast */ \
196 1.4 hpeyerl if (ia == NULL) \
197 1.4 hpeyerl (inm) = NULL; \
198 1.4 hpeyerl else \
199 1.15 mycroft for ((inm) = ia->ia_multiaddrs.lh_first; \
200 1.21 tls (inm) != NULL && !in_hosteq((inm)->inm_addr, (addr)); \
201 1.15 mycroft (inm) = inm->inm_list.le_next) \
202 1.4 hpeyerl continue; \
203 1.4 hpeyerl }
204 1.4 hpeyerl
205 1.4 hpeyerl /*
206 1.4 hpeyerl * Macro to step through all of the in_multi records, one at a time.
207 1.4 hpeyerl * The current position is remembered in "step", which the caller must
208 1.4 hpeyerl * provide. IN_FIRST_MULTI(), below, must be called to initialize "step"
209 1.4 hpeyerl * and get the first record. Both macros return a NULL "inm" when there
210 1.4 hpeyerl * are no remaining records.
211 1.4 hpeyerl */
212 1.7 mycroft #define IN_NEXT_MULTI(step, inm) \
213 1.4 hpeyerl /* struct in_multistep step; */ \
214 1.4 hpeyerl /* struct in_multi *inm; */ \
215 1.4 hpeyerl { \
216 1.4 hpeyerl if (((inm) = (step).i_inm) != NULL) \
217 1.15 mycroft (step).i_inm = (inm)->inm_list.le_next; \
218 1.4 hpeyerl else \
219 1.4 hpeyerl while ((step).i_ia != NULL) { \
220 1.15 mycroft (inm) = (step).i_ia->ia_multiaddrs.lh_first; \
221 1.15 mycroft (step).i_ia = (step).i_ia->ia_list.tqe_next; \
222 1.4 hpeyerl if ((inm) != NULL) { \
223 1.15 mycroft (step).i_inm = (inm)->inm_list.le_next; \
224 1.4 hpeyerl break; \
225 1.4 hpeyerl } \
226 1.4 hpeyerl } \
227 1.4 hpeyerl }
228 1.4 hpeyerl
229 1.7 mycroft #define IN_FIRST_MULTI(step, inm) \
230 1.4 hpeyerl /* struct in_multistep step; */ \
231 1.4 hpeyerl /* struct in_multi *inm; */ \
232 1.4 hpeyerl { \
233 1.15 mycroft (step).i_ia = in_ifaddr.tqh_first; \
234 1.4 hpeyerl (step).i_inm = NULL; \
235 1.4 hpeyerl IN_NEXT_MULTI((step), (inm)); \
236 1.4 hpeyerl }
237 1.4 hpeyerl
238 1.7 mycroft int in_ifinit __P((struct ifnet *,
239 1.7 mycroft struct in_ifaddr *, struct sockaddr_in *, int));
240 1.7 mycroft struct in_multi *in_addmulti __P((struct in_addr *, struct ifnet *));
241 1.16 christos void in_delmulti __P((struct in_multi *));
242 1.7 mycroft void in_ifscrub __P((struct ifnet *, struct in_ifaddr *));
243 1.18 thorpej void in_setmaxmtu __P ((void));
244 1.17 mycroft int in_control __P((struct socket *, u_long, caddr_t, struct ifnet *,
245 1.17 mycroft struct proc *));
246 1.4 hpeyerl #endif
247 1.20 perry
248 1.20 perry #endif /* _NETINET_IN_VAR_H_ */
249