2 * Copyright (c) 1985, 1986, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
33 * @(#)in_var.h 8.1 (Berkeley) 6/10/93
36 #ifndef _NETINET_IN_VAR_H_
37 #define _NETINET_IN_VAR_H_
39 #include <sys/queue.h>
41 * Interface address, Internet version. One of these structures
42 * is allocated for each interface with an Internet address.
43 * The ifaddr structure contains the protocol-independent part
44 * of the structure and is assumed to be first.
47 struct ifaddr ia_ifa
; /* protocol-independent info */
48 #define ia_ifp ia_ifa.ifa_ifp
49 #define ia_flags ia_ifa.ifa_flags
50 /* ia_{,sub}net{,mask} in host order */
51 u_long ia_net
; /* network number of interface */
52 u_long ia_netmask
; /* mask of net part */
53 u_long ia_subnet
; /* subnet number, including net */
54 u_long ia_subnetmask
; /* mask of subnet part */
55 struct in_addr ia_netbroadcast
; /* to recognize net broadcasts */
56 struct in_ifaddr
*ia_next
; /* next in list of internet addresses */
57 struct sockaddr_in ia_addr
; /* reserve space for interface name */
58 struct sockaddr_in ia_dstaddr
; /* reserve space for broadcast addr */
59 #define ia_broadaddr ia_dstaddr
60 struct sockaddr_in ia_sockmask
; /* reserve space for general netmask */
61 LIST_HEAD(in_multihead
, in_multi
) ia_multiaddrs
;
62 /* list of multicast addresses */
66 char ifra_name
[IFNAMSIZ
]; /* if name, e.g. "en0" */
67 struct sockaddr_in ifra_addr
;
68 struct sockaddr_in ifra_broadaddr
;
69 #define ifra_dstaddr ifra_broadaddr
70 struct sockaddr_in ifra_mask
;
73 * Given a pointer to an in_ifaddr (ifaddr),
74 * return a pointer to the addr as a sockaddr_in.
76 #define IA_SIN(ia) (&(((struct in_ifaddr *)(ia))->ia_addr))
77 #define IA_DSTSIN(ia) (&(((struct in_ifaddr *)(ia))->ia_dstaddr))
79 #define IN_LNAOF(in, ifa) \
80 ((ntohl((in).s_addr) & ~((struct in_ifaddr *)(ifa)->ia_subnetmask))
84 extern struct in_ifaddr
*in_ifaddr
;
85 extern struct ifqueue ipintrq
; /* ip packet input queue */
86 extern struct in_addr zeroin_addr
;
87 extern u_char inetctlerrmap
[];
88 extern int rtq_reallyold
; /* XXX */
89 extern int rtq_minreallyold
; /* XXX */
90 extern int rtq_toomany
; /* XXX */
93 * Macro for finding the interface (ifnet structure) corresponding to one
94 * of our IP addresses.
96 #define INADDR_TO_IFP(addr, ifp) \
97 /* struct in_addr addr; */ \
98 /* struct ifnet *ifp; */ \
100 register struct in_ifaddr *ia; \
102 for (ia = in_ifaddr; \
103 ia != NULL && ((ia->ia_ifp->if_flags & IFF_POINTOPOINT)? \
104 IA_DSTSIN(ia):IA_SIN(ia))->sin_addr.s_addr != (addr).s_addr; \
108 for (ia = in_ifaddr; \
111 if (ia->ia_ifp->if_flags & IFF_POINTOPOINT && \
112 IA_SIN(ia)->sin_addr.s_addr == (addr).s_addr) \
114 (ifp) = (ia == NULL) ? NULL : ia->ia_ifp; \
118 * Macro for finding the internet address structure (in_ifaddr) corresponding
119 * to a given interface (ifnet structure).
121 #define IFP_TO_IA(ifp, ia) \
122 /* struct ifnet *ifp; */ \
123 /* struct in_ifaddr *ia; */ \
125 for ((ia) = in_ifaddr; \
126 (ia) != NULL && (ia)->ia_ifp != (ifp); \
127 (ia) = (ia)->ia_next) \
133 * This information should be part of the ifnet structure but we don't wish
134 * to change that - as it might break a number of things
139 int type
; /* type of router which is querier on this interface */
140 int time
; /* # of slow timeouts since last old query */
141 struct router_info
*next
;
145 * Internet multicast address structure. There is one of these for each IP
146 * multicast group to which this host belongs on a given network interface.
147 * They are kept in a linked list, rooted in the interface's in_ifaddr
151 LIST_ENTRY(in_multi
) inm_entry
; /* list glue */
152 struct in_addr inm_addr
; /* IP multicast address */
153 struct ifnet
*inm_ifp
; /* back pointer to ifnet */
154 struct in_ifaddr
*inm_ia
; /* back pointer to in_ifaddr */
155 u_int inm_refcount
; /* no. membership claims by sockets */
156 u_int inm_timer
; /* IGMP membership report timer */
157 u_int inm_state
; /* state of the membership */
158 struct router_info
*inm_rti
; /* router info*/
163 * Structure used by macros below to remember position when stepping through
164 * all of the in_multi records.
166 struct in_multistep
{
167 struct in_ifaddr
*i_ia
;
168 struct in_multi
*i_inm
;
172 * Macro for looking up the in_multi record for a given IP multicast address
173 * on a given interface. If no matching record is found, "inm" returns NULL.
175 #define IN_LOOKUP_MULTI(addr, ifp, inm) \
176 /* struct in_addr addr; */ \
177 /* struct ifnet *ifp; */ \
178 /* struct in_multi *inm; */ \
180 register struct in_ifaddr *ia; \
182 IFP_TO_IA((ifp), ia); \
186 for ((inm) = ia->ia_multiaddrs.lh_first; \
187 (inm) != NULL && (inm)->inm_addr.s_addr != (addr).s_addr; \
188 (inm) = inm->inm_entry.le_next) \
193 * Macro to step through all of the in_multi records, one at a time.
194 * The current position is remembered in "step", which the caller must
195 * provide. IN_FIRST_MULTI(), below, must be called to initialize "step"
196 * and get the first record. Both macros return a NULL "inm" when there
197 * are no remaining records.
199 #define IN_NEXT_MULTI(step, inm) \
200 /* struct in_multistep step; */ \
201 /* struct in_multi *inm; */ \
203 if (((inm) = (step).i_inm) != NULL) \
204 (step).i_inm = (inm)->inm_entry.le_next; \
206 while ((step).i_ia != NULL) { \
207 (inm) = (step).i_ia->ia_multiaddrs.lh_first; \
208 (step).i_ia = (step).i_ia->ia_next; \
209 if ((inm) != NULL) { \
210 (step).i_inm = (inm)->inm_entry.le_next; \
216 #define IN_FIRST_MULTI(step, inm) \
217 /* struct in_multistep step; */ \
218 /* struct in_multi *inm; */ \
220 (step).i_ia = in_ifaddr; \
221 (step).i_inm = NULL; \
222 IN_NEXT_MULTI((step), (inm)); \
225 int in_ifinit
__P((struct ifnet
*,
226 struct in_ifaddr
*, struct sockaddr_in
*, int));
227 struct in_multi
*in_addmulti
__P((struct in_addr
*, struct ifnet
*));
228 void in_delmulti
__P((struct in_multi
*));
229 void in_ifscrub
__P((struct ifnet
*, struct in_ifaddr
*));
230 int in_control
__P((struct socket
*, int, caddr_t
, struct ifnet
*));