inet.c revision 1.4 1 1.4 mycroft /* $NetBSD: inet.c,v 1.4 1995/12/10 10:07:03 mycroft Exp $ */
2 1.3 thorpej
3 1.1 brezak /*
4 1.1 brezak * The mrouted program is covered by the license in the accompanying file
5 1.1 brezak * named "LICENSE". Use of the mrouted program represents acceptance of
6 1.1 brezak * the terms and conditions listed in that file.
7 1.1 brezak *
8 1.1 brezak * The mrouted program is COPYRIGHT 1989 by The Board of Trustees of
9 1.1 brezak * Leland Stanford Junior University.
10 1.1 brezak */
11 1.1 brezak
12 1.1 brezak
13 1.1 brezak #include "defs.h"
14 1.1 brezak
15 1.1 brezak
16 1.1 brezak /*
17 1.1 brezak * Exported variables.
18 1.1 brezak */
19 1.2 mycroft char s1[19]; /* buffers to hold the string representations */
20 1.2 mycroft char s2[19]; /* of IP addresses, to be passed to inet_fmt() */
21 1.2 mycroft char s3[19]; /* or inet_fmts(). */
22 1.2 mycroft char s4[19];
23 1.1 brezak
24 1.1 brezak
25 1.1 brezak /*
26 1.1 brezak * Verify that a given IP address is credible as a host address.
27 1.1 brezak * (Without a mask, cannot detect addresses of the form {subnet,0} or
28 1.1 brezak * {subnet,-1}.)
29 1.1 brezak */
30 1.4 mycroft int
31 1.4 mycroft inet_valid_host(naddr)
32 1.2 mycroft u_int32_t naddr;
33 1.1 brezak {
34 1.2 mycroft register u_int32_t addr;
35 1.1 brezak
36 1.1 brezak addr = ntohl(naddr);
37 1.1 brezak
38 1.1 brezak return (!(IN_MULTICAST(addr) ||
39 1.1 brezak IN_BADCLASS (addr) ||
40 1.1 brezak (addr & 0xff000000) == 0));
41 1.1 brezak }
42 1.1 brezak
43 1.4 mycroft /*
44 1.4 mycroft * Verify that a given netmask is plausible;
45 1.4 mycroft * make sure that it is a series of 1's followed by
46 1.4 mycroft * a series of 0's with no discontiguous 1's.
47 1.4 mycroft */
48 1.4 mycroft int
49 1.4 mycroft inet_valid_mask(mask)
50 1.4 mycroft u_int32_t mask;
51 1.4 mycroft {
52 1.4 mycroft if (~(((mask & -mask) - 1) | mask) != 0) {
53 1.4 mycroft /* Mask is not contiguous */
54 1.4 mycroft return (FALSE);
55 1.4 mycroft }
56 1.4 mycroft
57 1.4 mycroft return (TRUE);
58 1.4 mycroft }
59 1.1 brezak
60 1.1 brezak /*
61 1.1 brezak * Verify that a given subnet number and mask pair are credible.
62 1.2 mycroft *
63 1.2 mycroft * With CIDR, almost any subnet and mask are credible. mrouted still
64 1.2 mycroft * can't handle aggregated class A's, so we still check that, but
65 1.2 mycroft * otherwise the only requirements are that the subnet address is
66 1.2 mycroft * within the [ABC] range and that the host bits of the subnet
67 1.2 mycroft * are all 0.
68 1.1 brezak */
69 1.4 mycroft int
70 1.4 mycroft inet_valid_subnet(nsubnet, nmask)
71 1.2 mycroft u_int32_t nsubnet, nmask;
72 1.1 brezak {
73 1.2 mycroft register u_int32_t subnet, mask;
74 1.1 brezak
75 1.1 brezak subnet = ntohl(nsubnet);
76 1.1 brezak mask = ntohl(nmask);
77 1.1 brezak
78 1.1 brezak if ((subnet & mask) != subnet) return (FALSE);
79 1.1 brezak
80 1.4 mycroft if (subnet == 0)
81 1.4 mycroft return (mask == 0);
82 1.2 mycroft
83 1.1 brezak if (IN_CLASSA(subnet)) {
84 1.1 brezak if (mask < 0xff000000 ||
85 1.4 mycroft (subnet & 0xff000000) == 0x7f000000 ||
86 1.4 mycroft (subnet & 0xff000000) == 0x00000000) return (FALSE);
87 1.1 brezak }
88 1.2 mycroft else if (IN_CLASSD(subnet) || IN_BADCLASS(subnet)) {
89 1.2 mycroft /* Above Class C address space */
90 1.2 mycroft return (FALSE);
91 1.1 brezak }
92 1.4 mycroft if (subnet & ~mask) {
93 1.2 mycroft /* Host bits are set in the subnet */
94 1.2 mycroft return (FALSE);
95 1.1 brezak }
96 1.4 mycroft if (!inet_valid_mask(mask)) {
97 1.4 mycroft /* Netmask is not contiguous */
98 1.4 mycroft return (FALSE);
99 1.4 mycroft }
100 1.1 brezak
101 1.1 brezak return (TRUE);
102 1.1 brezak }
103 1.1 brezak
104 1.1 brezak
105 1.1 brezak /*
106 1.1 brezak * Convert an IP address in u_long (network) format into a printable string.
107 1.1 brezak */
108 1.4 mycroft char *
109 1.4 mycroft inet_fmt(addr, s)
110 1.2 mycroft u_int32_t addr;
111 1.1 brezak char *s;
112 1.1 brezak {
113 1.1 brezak register u_char *a;
114 1.1 brezak
115 1.1 brezak a = (u_char *)&addr;
116 1.1 brezak sprintf(s, "%u.%u.%u.%u", a[0], a[1], a[2], a[3]);
117 1.1 brezak return (s);
118 1.1 brezak }
119 1.1 brezak
120 1.1 brezak
121 1.1 brezak /*
122 1.1 brezak * Convert an IP subnet number in u_long (network) format into a printable
123 1.2 mycroft * string including the netmask as a number of bits.
124 1.1 brezak */
125 1.4 mycroft char *
126 1.4 mycroft inet_fmts(addr, mask, s)
127 1.2 mycroft u_int32_t addr, mask;
128 1.1 brezak char *s;
129 1.1 brezak {
130 1.1 brezak register u_char *a, *m;
131 1.2 mycroft int bits;
132 1.1 brezak
133 1.2 mycroft if ((addr == 0) && (mask == 0)) {
134 1.2 mycroft sprintf(s, "default");
135 1.2 mycroft return (s);
136 1.2 mycroft }
137 1.1 brezak a = (u_char *)&addr;
138 1.1 brezak m = (u_char *)&mask;
139 1.2 mycroft bits = 33 - ffs(ntohl(mask));
140 1.1 brezak
141 1.2 mycroft if (m[3] != 0) sprintf(s, "%u.%u.%u.%u/%d", a[0], a[1], a[2], a[3],
142 1.2 mycroft bits);
143 1.2 mycroft else if (m[2] != 0) sprintf(s, "%u.%u.%u/%d", a[0], a[1], a[2], bits);
144 1.2 mycroft else if (m[1] != 0) sprintf(s, "%u.%u/%d", a[0], a[1], bits);
145 1.2 mycroft else sprintf(s, "%u/%d", a[0], bits);
146 1.1 brezak
147 1.1 brezak return (s);
148 1.1 brezak }
149 1.1 brezak
150 1.1 brezak /*
151 1.1 brezak * Convert the printable string representation of an IP address into the
152 1.1 brezak * u_long (network) format. Return 0xffffffff on error. (To detect the
153 1.1 brezak * legal address with that value, you must explicitly compare the string
154 1.1 brezak * with "255.255.255.255".)
155 1.1 brezak */
156 1.4 mycroft u_int32_t
157 1.4 mycroft inet_parse(s)
158 1.1 brezak char *s;
159 1.1 brezak {
160 1.2 mycroft u_int32_t a = 0;
161 1.1 brezak u_int a0, a1, a2, a3;
162 1.1 brezak char c;
163 1.1 brezak
164 1.1 brezak if (sscanf(s, "%u.%u.%u.%u%c", &a0, &a1, &a2, &a3, &c) != 4 ||
165 1.1 brezak a0 > 255 || a1 > 255 || a2 > 255 || a3 > 255)
166 1.1 brezak return (0xffffffff);
167 1.1 brezak
168 1.1 brezak ((u_char *)&a)[0] = a0;
169 1.1 brezak ((u_char *)&a)[1] = a1;
170 1.1 brezak ((u_char *)&a)[2] = a2;
171 1.1 brezak ((u_char *)&a)[3] = a3;
172 1.1 brezak
173 1.1 brezak return (a);
174 1.1 brezak }
175 1.1 brezak
176 1.1 brezak
177 1.1 brezak /*
178 1.1 brezak * inet_cksum extracted from:
179 1.1 brezak * P I N G . C
180 1.1 brezak *
181 1.1 brezak * Author -
182 1.1 brezak * Mike Muuss
183 1.1 brezak * U. S. Army Ballistic Research Laboratory
184 1.1 brezak * December, 1983
185 1.1 brezak * Modified at Uc Berkeley
186 1.1 brezak *
187 1.1 brezak * (ping.c) Status -
188 1.1 brezak * Public Domain. Distribution Unlimited.
189 1.1 brezak *
190 1.1 brezak * I N _ C K S U M
191 1.1 brezak *
192 1.1 brezak * Checksum routine for Internet Protocol family headers (C Version)
193 1.1 brezak *
194 1.1 brezak */
195 1.4 mycroft int
196 1.4 mycroft inet_cksum(addr, len)
197 1.1 brezak u_short *addr;
198 1.1 brezak u_int len;
199 1.1 brezak {
200 1.1 brezak register int nleft = (int)len;
201 1.1 brezak register u_short *w = addr;
202 1.1 brezak u_short answer = 0;
203 1.1 brezak register int sum = 0;
204 1.1 brezak
205 1.1 brezak /*
206 1.1 brezak * Our algorithm is simple, using a 32 bit accumulator (sum),
207 1.1 brezak * we add sequential 16 bit words to it, and at the end, fold
208 1.1 brezak * back all the carry bits from the top 16 bits into the lower
209 1.1 brezak * 16 bits.
210 1.1 brezak */
211 1.4 mycroft while (nleft > 1) {
212 1.1 brezak sum += *w++;
213 1.1 brezak nleft -= 2;
214 1.1 brezak }
215 1.1 brezak
216 1.1 brezak /* mop up an odd byte, if necessary */
217 1.4 mycroft if (nleft == 1) {
218 1.1 brezak *(u_char *) (&answer) = *(u_char *)w ;
219 1.1 brezak sum += answer;
220 1.1 brezak }
221 1.1 brezak
222 1.1 brezak /*
223 1.1 brezak * add back carry outs from top 16 bits to low 16 bits
224 1.1 brezak */
225 1.1 brezak sum = (sum >> 16) + (sum & 0xffff); /* add hi 16 to low 16 */
226 1.1 brezak sum += (sum >> 16); /* add carry */
227 1.1 brezak answer = ~sum; /* truncate to 16 bits */
228 1.1 brezak return (answer);
229 1.1 brezak }
230