1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216
|
/*
* Copyright (c) 1983, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*
* From: @(#)inet.c 5.8 (Berkeley) 6/1/90
* From: @(#)inet.c 8.2 (Berkeley) 8/14/93
*/
char inet_rcsid[] =
"$Id: inet.c,v 1.5 1997/04/05 22:26:22 dholland Exp $";
/*
* Temporarily, copy these routines from the kernel,
* as we need to know about subnets.
*/
#include "defs.h"
extern struct interface *ifnet;
#if !defined(__GLIBC__) || (__GLIBC__ < 2)
/*
* Formulate an Internet address from network + host.
*/
struct in_addr inet_makeaddr(u_long net, u_long host)
{
struct interface *ifp;
u_long mask;
u_long addr;
if (IN_CLASSA(net))
mask = IN_CLASSA_HOST;
else if (IN_CLASSB(net))
mask = IN_CLASSB_HOST;
else
mask = IN_CLASSC_HOST;
for (ifp = ifnet; ifp; ifp = ifp->int_next)
if ((ifp->int_netmask & net) == ifp->int_net) {
mask = ~ifp->int_subnetmask;
break;
}
addr = net | (host & mask);
addr = htonl(addr);
return (*(struct in_addr *)&addr);
}
#endif /* not glibc */
/*
* Return the network number from an internet address.
*/
u_long inet_netof_subnet(struct in_addr in)
{
u_long i = ntohl(in.s_addr);
u_long net;
struct interface *ifp;
if (IN_CLASSA(i))
net = i & IN_CLASSA_NET;
else if (IN_CLASSB(i))
net = i & IN_CLASSB_NET;
else
net = i & IN_CLASSC_NET;
/*
* Check whether network is a subnet;
* if so, return subnet number.
*/
for (ifp = ifnet; ifp; ifp = ifp->int_next)
if ((ifp->int_netmask & net) == ifp->int_net)
return (i & ifp->int_subnetmask);
return (net);
}
/*
* Return the netmask pertaining to an internet address.
*/
int inet_maskof(u_long inaddr)
{
u_long i = ntohl(inaddr);
u_long mask;
struct interface *ifp;
if (i == 0) {
mask = 0;
} else if (IN_CLASSA(i)) {
mask = IN_CLASSA_NET;
} else if (IN_CLASSB(i)) {
mask = IN_CLASSB_NET;
} else
mask = IN_CLASSC_NET;
/*
* Check whether network is a subnet;
* if so, use the modified interpretation of `host'.
*/
for (ifp = ifnet; ifp; ifp = ifp->int_next)
if ((ifp->int_netmask & i) == ifp->int_net)
mask = ifp->int_subnetmask;
return (htonl(mask));
}
/*
* Return RTF_HOST if the address is
* for an Internet host, RTF_SUBNET for a subnet,
* 0 for a network.
*/
int inet_rtflags(struct sockaddr *sa)
{
struct sockaddr_in *sin=(struct sockaddr_in *)sa;
u_long i = ntohl(sin->sin_addr.s_addr);
u_long net, host;
struct interface *ifp;
if (IN_CLASSA(i)) {
net = i & IN_CLASSA_NET;
host = i & IN_CLASSA_HOST;
} else if (IN_CLASSB(i)) {
net = i & IN_CLASSB_NET;
host = i & IN_CLASSB_HOST;
} else {
net = i & IN_CLASSC_NET;
host = i & IN_CLASSC_HOST;
}
/*
* Check whether this network is subnetted;
* if so, check whether this is a subnet or a host.
*/
for (ifp = ifnet; ifp; ifp = ifp->int_next)
if (net == ifp->int_net) {
if (host &~ ifp->int_subnetmask)
return (RTF_HOST);
else if (ifp->int_subnetmask != ifp->int_netmask)
return (RTF_SUBNET);
else
return (0); /* network */
}
if (host == 0)
return (0); /* network */
else
return (RTF_HOST);
}
/*
* Return true if a route to subnet/host of route rt should be sent to dst.
* Send it only if dst is on the same logical network if not "internal",
* otherwise only if the route is the "internal" route for the logical net.
*/
int inet_sendroute(struct rt_entry *rt, struct sockaddr *sa)
{
struct sockaddr_in *dst=(struct sockaddr_in *)sa;
u_long r =
ntohl(((struct sockaddr_in *)&rt->rt_dst)->sin_addr.s_addr);
u_long d = ntohl(dst->sin_addr.s_addr);
if (IN_CLASSA(r)) {
if ((r & IN_CLASSA_NET) == (d & IN_CLASSA_NET)) {
if ((r & IN_CLASSA_HOST) == 0)
return ((rt->rt_state & RTS_INTERNAL) == 0);
return (1);
}
if (r & IN_CLASSA_HOST)
return (0);
return ((rt->rt_state & RTS_INTERNAL) != 0);
} else if (IN_CLASSB(r)) {
if ((r & IN_CLASSB_NET) == (d & IN_CLASSB_NET)) {
if ((r & IN_CLASSB_HOST) == 0)
return ((rt->rt_state & RTS_INTERNAL) == 0);
return (1);
}
if (r & IN_CLASSB_HOST)
return (0);
return ((rt->rt_state & RTS_INTERNAL) != 0);
} else {
if ((r & IN_CLASSC_NET) == (d & IN_CLASSC_NET)) {
if ((r & IN_CLASSC_HOST) == 0)
return ((rt->rt_state & RTS_INTERNAL) == 0);
return (1);
}
if (r & IN_CLASSC_HOST)
return (0);
return ((rt->rt_state & RTS_INTERNAL) != 0);
}
}
|