1 /* 2 * Copyright (c) 1985, 1986, 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 * @(#)in_var.h 8.2 (Berkeley) 1/9/95 34 * $FreeBSD$ 35 */ 36 37 #ifndef _NETINET_IN_VAR_H_ 38 #define _NETINET_IN_VAR_H_ 39 40 #include <sys/queue.h> 41 42 /* 43 * Interface address, Internet version. One of these structures 44 * is allocated for each Internet address on an interface. 45 * The ifaddr structure contains the protocol-independent part 46 * of the structure and is assumed to be first. 47 */ 48 struct in_ifaddr { 49 struct ifaddr ia_ifa; /* protocol-independent info */ 50 #define ia_ifp ia_ifa.ifa_ifp 51 #define ia_flags ia_ifa.ifa_flags 52 /* ia_{,sub}net{,mask} in host order */ 53 u_long ia_net; /* network number of interface */ 54 u_long ia_netmask; /* mask of net part */ 55 u_long ia_subnet; /* subnet number, including net */ 56 u_long ia_subnetmask; /* mask of subnet part */ 57 struct in_addr ia_netbroadcast; /* to recognize net broadcasts */ 58 TAILQ_ENTRY(in_ifaddr) ia_link; /* tailq macro glue */ 59 struct sockaddr_in ia_addr; /* reserve space for interface name */ 60 struct sockaddr_in ia_dstaddr; /* reserve space for broadcast addr */ 61 #define ia_broadaddr ia_dstaddr 62 struct sockaddr_in ia_sockmask; /* reserve space for general netmask */ 63 }; 64 65 struct in_aliasreq { 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; 71 }; 72 /* 73 * Given a pointer to an in_ifaddr (ifaddr), 74 * return a pointer to the addr as a sockaddr_in. 75 */ 76 #define IA_SIN(ia) (&(((struct in_ifaddr *)(ia))->ia_addr)) 77 #define IA_DSTSIN(ia) (&(((struct in_ifaddr *)(ia))->ia_dstaddr)) 78 79 #define IN_LNAOF(in, ifa) \ 80 ((ntohl((in).s_addr) & ~((struct in_ifaddr *)(ifa)->ia_subnetmask)) 81 82 83 #ifdef _KERNEL 84 extern TAILQ_HEAD(in_ifaddrhead, in_ifaddr) in_ifaddrhead; 85 extern struct ifqueue ipintrq; /* ip packet input queue */ 86 extern struct in_addr zeroin_addr; 87 extern u_char inetctlerrmap[]; 88 89 /* 90 * Macro for finding the interface (ifnet structure) corresponding to one 91 * of our IP addresses. 92 */ 93 #define INADDR_TO_IFP(addr, ifp) \ 94 /* struct in_addr addr; */ \ 95 /* struct ifnet *ifp; */ \ 96 { \ 97 struct in_ifaddr *ia; \ 98 \ 99 TAILQ_FOREACH(ia, &in_ifaddrhead, ia_link) \ 100 if (IA_SIN(ia)->sin_addr.s_addr == (addr).s_addr) \ 101 break; \ 102 (ifp) = (ia == NULL) ? NULL : ia->ia_ifp; \ 103 } 104 105 /* 106 * Macro for finding the internet address structure (in_ifaddr) corresponding 107 * to a given interface (ifnet structure). 108 */ 109 #define IFP_TO_IA(ifp, ia) \ 110 /* struct ifnet *ifp; */ \ 111 /* struct in_ifaddr *ia; */ \ 112 { \ 113 for ((ia) = TAILQ_FIRST(&in_ifaddrhead); \ 114 (ia) != NULL && (ia)->ia_ifp != (ifp); \ 115 (ia) = TAILQ_NEXT((ia), ia_link)) \ 116 continue; \ 117 } 118 #endif 119 120 /* 121 * This information should be part of the ifnet structure but we don't wish 122 * to change that - as it might break a number of things 123 */ 124 125 struct router_info { 126 struct ifnet *rti_ifp; 127 int rti_type; /* type of router which is querier on this interface */ 128 int rti_time; /* # of slow timeouts since last old query */ 129 struct router_info *rti_next; 130 }; 131 132 /* 133 * Internet multicast address structure. There is one of these for each IP 134 * multicast group to which this host belongs on a given network interface. 135 * For every entry on the interface's if_multiaddrs list which represents 136 * an IP multicast group, there is one of these structures. They are also 137 * kept on a system-wide list to make it easier to keep our legacy IGMP code 138 * compatible with the rest of the world (see IN_FIRST_MULTI et al, below). 139 */ 140 struct in_multi { 141 LIST_ENTRY(in_multi) inm_link; /* queue macro glue */ 142 struct in_addr inm_addr; /* IP multicast address, convenience */ 143 struct ifnet *inm_ifp; /* back pointer to ifnet */ 144 struct ifmultiaddr *inm_ifma; /* back pointer to ifmultiaddr */ 145 u_int inm_timer; /* IGMP membership report timer */ 146 u_int inm_state; /* state of the membership */ 147 struct router_info *inm_rti; /* router info*/ 148 }; 149 150 #ifdef _KERNEL 151 152 #ifdef SYSCTL_DECL 153 SYSCTL_DECL(_net_inet_ip); 154 SYSCTL_DECL(_net_inet_raw); 155 #endif 156 157 extern LIST_HEAD(in_multihead, in_multi) in_multihead; 158 159 /* 160 * Structure used by macros below to remember position when stepping through 161 * all of the in_multi records. 162 */ 163 struct in_multistep { 164 struct in_multi *i_inm; 165 }; 166 167 /* 168 * Macro for looking up the in_multi record for a given IP multicast address 169 * on a given interface. If no matching record is found, "inm" is set null. 170 */ 171 #define IN_LOOKUP_MULTI(addr, ifp, inm) \ 172 /* struct in_addr addr; */ \ 173 /* struct ifnet *ifp; */ \ 174 /* struct in_multi *inm; */ \ 175 do { \ 176 struct ifmultiaddr *ifma; \ 177 \ 178 TAILQ_FOREACH(ifma, &((ifp)->if_multiaddrs), ifma_link) { \ 179 if (ifma->ifma_addr->sa_family == AF_INET \ 180 && ((struct sockaddr_in *)ifma->ifma_addr)->sin_addr.s_addr == \ 181 (addr).s_addr) \ 182 break; \ 183 } \ 184 (inm) = ifma ? ifma->ifma_protospec : 0; \ 185 } while(0) 186 187 /* 188 * Macro to step through all of the in_multi records, one at a time. 189 * The current position is remembered in "step", which the caller must 190 * provide. IN_FIRST_MULTI(), below, must be called to initialize "step" 191 * and get the first record. Both macros return a NULL "inm" when there 192 * are no remaining records. 193 */ 194 #define IN_NEXT_MULTI(step, inm) \ 195 /* struct in_multistep step; */ \ 196 /* struct in_multi *inm; */ \ 197 do { \ 198 if (((inm) = (step).i_inm) != NULL) \ 199 (step).i_inm = LIST_NEXT((step).i_inm, inm_link); \ 200 } while(0) 201 202 #define IN_FIRST_MULTI(step, inm) \ 203 /* struct in_multistep step; */ \ 204 /* struct in_multi *inm; */ \ 205 do { \ 206 (step).i_inm = LIST_FIRST(&in_multihead); \ 207 IN_NEXT_MULTI((step), (inm)); \ 208 } while(0) 209 210 struct route; 211 struct in_multi *in_addmulti __P((struct in_addr *, struct ifnet *)); 212 void in_delmulti __P((struct in_multi *)); 213 int in_control __P((struct socket *, u_long, caddr_t, struct ifnet *, 214 struct thread *)); 215 void in_rtqdrain __P((void)); 216 void ip_input __P((struct mbuf *)); 217 int in_ifadown __P((struct ifaddr *ifa, int)); 218 void in_ifscrub __P((struct ifnet *, struct in_ifaddr *)); 219 int ipflow_fastforward __P((struct mbuf *)); 220 void ipflow_create __P((const struct route *, struct mbuf *)); 221 void ipflow_slowtimo __P((void)); 222 223 #endif /* _KERNEL */ 224 225 /* INET6 stuff */ 226 #include <netinet6/in6_var.h> 227 228 #endif /* _NETINET_IN_VAR_H_ */ 229