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