1 | /* |
---|
2 | * ++Copyright++ 1983, 1990, 1993 |
---|
3 | * - |
---|
4 | * Copyright (c) 1983, 1990, 1993 |
---|
5 | * The Regents of the University of California. All rights reserved. |
---|
6 | * |
---|
7 | * Redistribution and use in source and binary forms, with or without |
---|
8 | * modification, are permitted provided that the following conditions |
---|
9 | * are met: |
---|
10 | * 1. Redistributions of source code must retain the above copyright |
---|
11 | * notice, this list of conditions and the following disclaimer. |
---|
12 | * 2. Redistributions in binary form must reproduce the above copyright |
---|
13 | * notice, this list of conditions and the following disclaimer in the |
---|
14 | * documentation and/or other materials provided with the distribution. |
---|
15 | * 3. All advertising materials mentioning features or use of this software |
---|
16 | * must display the following acknowledgement: |
---|
17 | * This product includes software developed by the University of |
---|
18 | * California, Berkeley and its contributors. |
---|
19 | * 4. Neither the name of the University nor the names of its contributors |
---|
20 | * may be used to endorse or promote products derived from this software |
---|
21 | * without specific prior written permission. |
---|
22 | * |
---|
23 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
---|
24 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
---|
25 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
---|
26 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
---|
27 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
---|
28 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
---|
29 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
---|
30 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
---|
31 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
---|
32 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
---|
33 | * SUCH DAMAGE. |
---|
34 | * - |
---|
35 | * Portions Copyright (c) 1993 by Digital Equipment Corporation. |
---|
36 | * |
---|
37 | * Permission to use, copy, modify, and distribute this software for any |
---|
38 | * purpose with or without fee is hereby granted, provided that the above |
---|
39 | * copyright notice and this permission notice appear in all copies, and that |
---|
40 | * the name of Digital Equipment Corporation not be used in advertising or |
---|
41 | * publicity pertaining to distribution of the document or software without |
---|
42 | * specific, written prior permission. |
---|
43 | * |
---|
44 | * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL |
---|
45 | * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES |
---|
46 | * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT |
---|
47 | * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
---|
48 | * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
---|
49 | * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS |
---|
50 | * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS |
---|
51 | * SOFTWARE. |
---|
52 | * - |
---|
53 | * --Copyright-- |
---|
54 | */ |
---|
55 | |
---|
56 | #if defined(LIBC_SCCS) && !defined(lint) |
---|
57 | static char sccsid[] = "@(#)inet_addr.c 8.1 (Berkeley) 6/17/93"; |
---|
58 | static char rcsid[] = "$Id$"; |
---|
59 | #endif /* LIBC_SCCS and not lint */ |
---|
60 | |
---|
61 | #include <sys/param.h> |
---|
62 | #include <netinet/in.h> |
---|
63 | #include <arpa/inet.h> |
---|
64 | #include <ctype.h> |
---|
65 | |
---|
66 | /* |
---|
67 | * Ascii internet address interpretation routine. |
---|
68 | * The value returned is in network order. |
---|
69 | */ |
---|
70 | u_long |
---|
71 | inet_addr(cp) |
---|
72 | register const char *cp; |
---|
73 | { |
---|
74 | struct in_addr val; |
---|
75 | |
---|
76 | if (inet_aton(cp, &val)) |
---|
77 | return (val.s_addr); |
---|
78 | return (INADDR_NONE); |
---|
79 | } |
---|
80 | |
---|
81 | /* |
---|
82 | * Check whether "cp" is a valid ascii representation |
---|
83 | * of an Internet address and convert to a binary address. |
---|
84 | * Returns 1 if the address is valid, 0 if not. |
---|
85 | * This replaces inet_addr, the return value from which |
---|
86 | * cannot distinguish between failure and a local broadcast address. |
---|
87 | */ |
---|
88 | int |
---|
89 | inet_aton(cp, addr) |
---|
90 | register const char *cp; |
---|
91 | struct in_addr *addr; |
---|
92 | { |
---|
93 | register u_long val; |
---|
94 | register int base, n; |
---|
95 | register char c; |
---|
96 | u_int parts[4]; |
---|
97 | register u_int *pp = parts; |
---|
98 | |
---|
99 | c = *cp; |
---|
100 | for (;;) { |
---|
101 | /* |
---|
102 | * Collect number up to ``.''. |
---|
103 | * Values are specified as for C: |
---|
104 | * 0x=hex, 0=octal, isdigit=decimal. |
---|
105 | */ |
---|
106 | if (!isdigit((int)c)) |
---|
107 | return (0); |
---|
108 | val = 0; base = 10; |
---|
109 | if (c == '0') { |
---|
110 | c = *++cp; |
---|
111 | if (c == 'x' || c == 'X') |
---|
112 | base = 16, c = *++cp; |
---|
113 | else |
---|
114 | base = 8; |
---|
115 | } |
---|
116 | for (;;) { |
---|
117 | if (isascii((int)c) && isdigit((int)c)) { |
---|
118 | val = (val * base) + (c - '0'); |
---|
119 | c = *++cp; |
---|
120 | } else if (base == 16 && isascii((int)c) && isxdigit((int)c)) { |
---|
121 | val = (val << 4) | |
---|
122 | (c + 10 - (islower((int)c) ? 'a' : 'A')); |
---|
123 | c = *++cp; |
---|
124 | } else |
---|
125 | break; |
---|
126 | } |
---|
127 | if (c == '.') { |
---|
128 | /* |
---|
129 | * Internet format: |
---|
130 | * a.b.c.d |
---|
131 | * a.b.c (with c treated as 16 bits) |
---|
132 | * a.b (with b treated as 24 bits) |
---|
133 | */ |
---|
134 | if (pp >= parts + 3) |
---|
135 | return (0); |
---|
136 | *pp++ = val; |
---|
137 | c = *++cp; |
---|
138 | } else |
---|
139 | break; |
---|
140 | } |
---|
141 | /* |
---|
142 | * Check for trailing characters. |
---|
143 | */ |
---|
144 | if (c != '\0' && (!isascii((int)c) || !isspace((int)c))) |
---|
145 | return (0); |
---|
146 | /* |
---|
147 | * Concoct the address according to |
---|
148 | * the number of parts specified. |
---|
149 | */ |
---|
150 | n = pp - parts + 1; |
---|
151 | switch (n) { |
---|
152 | |
---|
153 | case 0: |
---|
154 | return (0); /* initial nondigit */ |
---|
155 | |
---|
156 | case 1: /* a -- 32 bits */ |
---|
157 | break; |
---|
158 | |
---|
159 | case 2: /* a.b -- 8.24 bits */ |
---|
160 | if (val > 0xffffff) |
---|
161 | return (0); |
---|
162 | val |= parts[0] << 24; |
---|
163 | break; |
---|
164 | |
---|
165 | case 3: /* a.b.c -- 8.8.16 bits */ |
---|
166 | if (val > 0xffff) |
---|
167 | return (0); |
---|
168 | val |= (parts[0] << 24) | (parts[1] << 16); |
---|
169 | break; |
---|
170 | |
---|
171 | case 4: /* a.b.c.d -- 8.8.8.8 bits */ |
---|
172 | if (val > 0xff) |
---|
173 | return (0); |
---|
174 | val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8); |
---|
175 | break; |
---|
176 | } |
---|
177 | if (addr) |
---|
178 | addr->s_addr = htonl(val); |
---|
179 | return (1); |
---|
180 | } |
---|