1 | /* |
2 | * Copyright (c) 1983, 1990, 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 | * 4. Neither the name of the University nor the names of its contributors |
14 | * may be used to endorse or promote products derived from this software |
15 | * without specific prior written permission. |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
18 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
19 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
20 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
21 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
22 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
23 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
24 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
25 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
26 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
27 | * SUCH DAMAGE. |
28 | */ |
29 | |
30 | /* |
31 | * Portions Copyright (c) 1993 by Digital Equipment Corporation. |
32 | * |
33 | * Permission to use, copy, modify, and distribute this software for any |
34 | * purpose with or without fee is hereby granted, provided that the above |
35 | * copyright notice and this permission notice appear in all copies, and that |
36 | * the name of Digital Equipment Corporation not be used in advertising or |
37 | * publicity pertaining to distribution of the document or software without |
38 | * specific, written prior permission. |
39 | * |
40 | * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL |
41 | * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES |
42 | * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT |
43 | * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
44 | * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
45 | * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS |
46 | * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS |
47 | * SOFTWARE. |
48 | */ |
49 | |
50 | /* |
51 | * Portions Copyright (c) 1996-1999 by Internet Software Consortium. |
52 | * |
53 | * Permission to use, copy, modify, and distribute this software for any |
54 | * purpose with or without fee is hereby granted, provided that the above |
55 | * copyright notice and this permission notice appear in all copies. |
56 | * |
57 | * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS |
58 | * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES |
59 | * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE |
60 | * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
61 | * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
62 | * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS |
63 | * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS |
64 | * SOFTWARE. |
65 | */ |
66 | |
67 | #if defined(LIBC_SCCS) && !defined(lint) |
68 | static const char sccsid[] = "@(#)inet_addr.c 8.1 (Berkeley) 6/17/93" ; |
69 | static const char rcsid[] = "$BINDId: inet_addr.c,v 8.11 1999/10/13 16:39:25 vixie Exp $" ; |
70 | #endif /* LIBC_SCCS and not lint */ |
71 | |
72 | #include <sys/types.h> |
73 | #include <sys/param.h> |
74 | |
75 | #include <netinet/in.h> |
76 | #include <arpa/inet.h> |
77 | |
78 | #include <ctype.h> |
79 | |
80 | #ifdef _LIBC |
81 | # include <endian.h> |
82 | # include <stdint.h> |
83 | # include <stdlib.h> |
84 | # include <limits.h> |
85 | # include <errno.h> |
86 | #endif |
87 | |
88 | /* |
89 | * Ascii internet address interpretation routine. |
90 | * The value returned is in network order. |
91 | */ |
92 | in_addr_t |
93 | __inet_addr(const char *cp) { |
94 | struct in_addr val; |
95 | |
96 | if (__inet_aton(cp, &val)) |
97 | return (val.s_addr); |
98 | return (INADDR_NONE); |
99 | } |
100 | weak_alias (__inet_addr, inet_addr) |
101 | |
102 | /* |
103 | * Check whether "cp" is a valid ascii representation |
104 | * of an Internet address and convert to a binary address. |
105 | * Returns 1 if the address is valid, 0 if not. |
106 | * This replaces inet_addr, the return value from which |
107 | * cannot distinguish between failure and a local broadcast address. |
108 | */ |
109 | int |
110 | __inet_aton(const char *cp, struct in_addr *addr) |
111 | { |
112 | static const in_addr_t max[4] = { 0xffffffff, 0xffffff, 0xffff, 0xff }; |
113 | in_addr_t val; |
114 | #ifndef _LIBC |
115 | int base; |
116 | #endif |
117 | char c; |
118 | union iaddr { |
119 | uint8_t bytes[4]; |
120 | uint32_t word; |
121 | } res; |
122 | uint8_t *pp = res.bytes; |
123 | int digit; |
124 | |
125 | #ifdef _LIBC |
126 | int saved_errno = errno; |
127 | __set_errno (0); |
128 | #endif |
129 | |
130 | res.word = 0; |
131 | |
132 | c = *cp; |
133 | for (;;) { |
134 | /* |
135 | * Collect number up to ``.''. |
136 | * Values are specified as for C: |
137 | * 0x=hex, 0=octal, isdigit=decimal. |
138 | */ |
139 | if (!isdigit(c)) |
140 | goto ret_0; |
141 | #ifdef _LIBC |
142 | { |
143 | char *endp; |
144 | unsigned long ul = strtoul (cp, (char **) &endp, 0); |
145 | if (ul == ULONG_MAX && errno == ERANGE) |
146 | goto ret_0; |
147 | if (ul > 0xfffffffful) |
148 | goto ret_0; |
149 | val = ul; |
150 | digit = cp != endp; |
151 | cp = endp; |
152 | } |
153 | c = *cp; |
154 | #else |
155 | val = 0; base = 10; digit = 0; |
156 | if (c == '0') { |
157 | c = *++cp; |
158 | if (c == 'x' || c == 'X') |
159 | base = 16, c = *++cp; |
160 | else { |
161 | base = 8; |
162 | digit = 1 ; |
163 | } |
164 | } |
165 | for (;;) { |
166 | if (isascii(c) && isdigit(c)) { |
167 | if (base == 8 && (c == '8' || c == '9')) |
168 | return (0); |
169 | val = (val * base) + (c - '0'); |
170 | c = *++cp; |
171 | digit = 1; |
172 | } else if (base == 16 && isascii(c) && isxdigit(c)) { |
173 | val = (val << 4) | |
174 | (c + 10 - (islower(c) ? 'a' : 'A')); |
175 | c = *++cp; |
176 | digit = 1; |
177 | } else |
178 | break; |
179 | } |
180 | #endif |
181 | if (c == '.') { |
182 | /* |
183 | * Internet format: |
184 | * a.b.c.d |
185 | * a.b.c (with c treated as 16 bits) |
186 | * a.b (with b treated as 24 bits) |
187 | */ |
188 | if (pp > res.bytes + 2 || val > 0xff) |
189 | goto ret_0; |
190 | *pp++ = val; |
191 | c = *++cp; |
192 | } else |
193 | break; |
194 | } |
195 | /* |
196 | * Check for trailing characters. |
197 | */ |
198 | if (c != '\0' && (!isascii(c) || !isspace(c))) |
199 | goto ret_0; |
200 | /* |
201 | * Did we get a valid digit? |
202 | */ |
203 | if (!digit) |
204 | goto ret_0; |
205 | |
206 | /* Check whether the last part is in its limits depending on |
207 | the number of parts in total. */ |
208 | if (val > max[pp - res.bytes]) |
209 | goto ret_0; |
210 | |
211 | if (addr != NULL) |
212 | addr->s_addr = res.word | htonl (val); |
213 | |
214 | #ifdef _LIBC |
215 | __set_errno (saved_errno); |
216 | #endif |
217 | return (1); |
218 | |
219 | ret_0: |
220 | #ifdef _LIBC |
221 | __set_errno (saved_errno); |
222 | #endif |
223 | return (0); |
224 | } |
225 | weak_alias (__inet_aton, inet_aton) |
226 | libc_hidden_def (__inet_aton) |
227 | libc_hidden_weak (inet_aton) |
228 | |