Libinfo-129.tar.gz
[apple/libinfo.git] / gen.subproj / inet_pton.c
1 /*
2 * Copyright (c) 1996,1999 by Internet Software Consortium.
3 *
4 * Permission to use, copy, modify, and distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
7 *
8 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
9 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
10 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
11 * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
12 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
13 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
14 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
15 * SOFTWARE.
16 */
17
18 #if defined(LIBC_SCCS) && !defined(lint)
19 static char rcsid[] = "$Id: inet_pton.c,v 1.2 2002/01/17 22:22:25 majka Exp $";
20 #endif /* LIBC_SCCS and not lint */
21
22 #ifdef HAVE_CONFIG_H
23 #include <config.h>
24 #endif
25
26 #include <sys/param.h>
27 #include <sys/types.h>
28 #include <sys/socket.h>
29 #include <netinet/in.h>
30 #include <arpa/inet.h>
31 #include <arpa/nameser.h>
32 #include <string.h>
33 #include <errno.h>
34
35 #define IN6ADDRSZ 16
36
37 #if 0
38 #ifndef HAVE_PORTABLE_PROTOTYPE
39 #include "cdecl_ext.h"
40 #endif
41
42 #ifndef HAVE_U_INT16_T
43 #include "bittypes.h"
44 #endif
45 #if !(defined(HAVE_INADDRSZ) && defined(HAVE_IN6ADDRSZ))
46 #include "addrsize.h"
47 #endif
48 #endif
49 #ifndef NS_INADDRSZ
50 #define NS_INADDRSZ INADDRSZ
51 #endif
52 #ifndef NS_IN6ADDRSZ
53 #define NS_IN6ADDRSZ IN6ADDRSZ
54 #endif
55 #ifndef NS_INT16SZ
56 #define NS_INT16SZ sizeof(u_int16_t)
57 #endif
58
59 /*
60 * WARNING: Don't even consider trying to compile this on a system where
61 * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
62 */
63
64 static int inet_pton4 __P((const char *src, u_char *dst));
65 #ifdef INET6
66 static int inet_pton6 __P((const char *src, u_char *dst));
67 #endif
68
69 /* int
70 * inet_pton(af, src, dst)
71 * convert from presentation format (which usually means ASCII printable)
72 * to network format (which is usually some kind of binary format).
73 * return:
74 * 1 if the address was valid for the specified address family
75 * 0 if the address wasn't valid (`dst' is untouched in this case)
76 * -1 if some other error occurred (`dst' is untouched in this case, too)
77 * author:
78 * Paul Vixie, 1996.
79 */
80 int
81 inet_pton(af, src, dst)
82 int af;
83 const char *src;
84 void *dst;
85 {
86 switch (af) {
87 case AF_INET:
88 return (inet_pton4(src, dst));
89 #ifdef INET6
90 case AF_INET6:
91 return (inet_pton6(src, dst));
92 #endif
93 default:
94 errno = EAFNOSUPPORT;
95 return (-1);
96 }
97 /* NOTREACHED */
98 }
99
100 /* int
101 * inet_pton4(src, dst)
102 * like inet_aton() but without all the hexadecimal and shorthand.
103 * return:
104 * 1 if `src' is a valid dotted quad, else 0.
105 * notice:
106 * does not touch `dst' unless it's returning 1.
107 * author:
108 * Paul Vixie, 1996.
109 */
110 static int
111 inet_pton4(src, dst)
112 const char *src;
113 u_char *dst;
114 {
115 static const char digits[] = "0123456789";
116 int saw_digit, octets, ch;
117 u_char tmp[NS_INADDRSZ], *tp;
118
119 saw_digit = 0;
120 octets = 0;
121 *(tp = tmp) = 0;
122 while ((ch = *src++) != '\0') {
123 const char *pch;
124
125 if ((pch = strchr(digits, ch)) != NULL) {
126 u_int new = *tp * 10 + (pch - digits);
127
128 if (new > 255)
129 return (0);
130 *tp = new;
131 if (! saw_digit) {
132 if (++octets > 4)
133 return (0);
134 saw_digit = 1;
135 }
136 } else if (ch == '.' && saw_digit) {
137 if (octets == 4)
138 return (0);
139 *++tp = 0;
140 saw_digit = 0;
141 } else
142 return (0);
143 }
144 if (octets < 4)
145 return (0);
146 memcpy(dst, tmp, NS_INADDRSZ);
147 return (1);
148 }
149
150 #ifdef INET6
151 /* int
152 * inet_pton6(src, dst)
153 * convert presentation level address to network order binary form.
154 * return:
155 * 1 if `src' is a valid [RFC1884 2.2] address, else 0.
156 * notice:
157 * (1) does not touch `dst' unless it's returning 1.
158 * (2) :: in a full address is silently ignored.
159 * credit:
160 * inspired by Mark Andrews.
161 * author:
162 * Paul Vixie, 1996.
163 */
164 static int
165 inet_pton6(src, dst)
166 const char *src;
167 u_char *dst;
168 {
169 static const char xdigits_l[] = "0123456789abcdef",
170 xdigits_u[] = "0123456789ABCDEF";
171 u_char tmp[NS_IN6ADDRSZ], *tp, *endp, *colonp;
172 const char *xdigits, *curtok;
173 int ch, saw_xdigit;
174 u_int val;
175
176 memset((tp = tmp), '\0', NS_IN6ADDRSZ);
177 endp = tp + NS_IN6ADDRSZ;
178 colonp = NULL;
179 /* Leading :: requires some special handling. */
180 if (*src == ':')
181 if (*++src != ':')
182 return (0);
183 curtok = src;
184 saw_xdigit = 0;
185 val = 0;
186 while ((ch = *src++) != '\0') {
187 const char *pch;
188
189 if ((pch = strchr((xdigits = xdigits_l), ch)) == NULL)
190 pch = strchr((xdigits = xdigits_u), ch);
191 if (pch != NULL) {
192 val <<= 4;
193 val |= (pch - xdigits);
194 if (val > 0xffff)
195 return (0);
196 saw_xdigit = 1;
197 continue;
198 }
199 if (ch == ':') {
200 curtok = src;
201 if (!saw_xdigit) {
202 if (colonp)
203 return (0);
204 colonp = tp;
205 continue;
206 } else if (*src == '\0') {
207 return (0);
208 }
209 if (tp + NS_INT16SZ > endp)
210 return (0);
211 *tp++ = (u_char) (val >> 8) & 0xff;
212 *tp++ = (u_char) val & 0xff;
213 saw_xdigit = 0;
214 val = 0;
215 continue;
216 }
217 if (ch == '.' && ((tp + NS_INADDRSZ) <= endp) &&
218 inet_pton4(curtok, tp) > 0) {
219 tp += NS_INADDRSZ;
220 saw_xdigit = 0;
221 break; /* '\0' was seen by inet_pton4(). */
222 }
223 return (0);
224 }
225 if (saw_xdigit) {
226 if (tp + NS_INT16SZ > endp)
227 return (0);
228 *tp++ = (u_char) (val >> 8) & 0xff;
229 *tp++ = (u_char) val & 0xff;
230 }
231 if (colonp != NULL) {
232 /*
233 * Since some memmove()'s erroneously fail to handle
234 * overlapping regions, we'll do the shift by hand.
235 */
236 const int n = tp - colonp;
237 int i;
238
239 if (tp == endp)
240 return (0);
241 for (i = 1; i <= n; i++) {
242 endp[- i] = colonp[n - i];
243 colonp[n - i] = 0;
244 }
245 tp = endp;
246 }
247 if (tp != endp)
248 return (0);
249 memcpy(dst, tmp, NS_IN6ADDRSZ);
250 return (1);
251 }
252 #endif /*INET6*/