]> git.ipfire.org Git - thirdparty/glibc.git/blame - resolv/inet_pton.c
* include/libc-symbols.h (hidden_weak): Define it for [__ASSEMBLER__].
[thirdparty/glibc.git] / resolv / inet_pton.c
CommitLineData
e685e07d
UD
1/*
2 * Copyright (c) 1996,1999 by Internet Software Consortium.
fa0bc87c
RM
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)
e685e07d 19static const char rcsid[] = "$BINDId: inet_pton.c,v 1.7 1999/10/13 16:39:28 vixie Exp $";
fa0bc87c
RM
20#endif /* LIBC_SCCS and not lint */
21
22#include <sys/param.h>
23#include <sys/types.h>
24#include <sys/socket.h>
25#include <netinet/in.h>
26#include <arpa/inet.h>
27#include <arpa/nameser.h>
8a40ed68 28#include <ctype.h>
fa0bc87c
RM
29#include <string.h>
30#include <errno.h>
fa0bc87c
RM
31
32/*
33 * WARNING: Don't even consider trying to compile this on a system where
34 * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
35 */
36
2588068b
UD
37static int inet_pton4 (const char *src, u_char *dst) internal_function;
38static int inet_pton6 (const char *src, u_char *dst) internal_function;
fa0bc87c
RM
39
40/* int
613a76ff 41 * inet_pton(af, src, dst)
fa0bc87c
RM
42 * convert from presentation format (which usually means ASCII printable)
43 * to network format (which is usually some kind of binary format).
44 * return:
45 * 1 if the address was valid for the specified address family
46 * 0 if the address wasn't valid (`dst' is untouched in this case)
47 * -1 if some other error occurred (`dst' is untouched in this case, too)
48 * author:
49 * Paul Vixie, 1996.
50 */
51int
613a76ff 52inet_pton(af, src, dst)
fa0bc87c
RM
53 int af;
54 const char *src;
55 void *dst;
fa0bc87c
RM
56{
57 switch (af) {
58 case AF_INET:
fa0bc87c
RM
59 return (inet_pton4(src, dst));
60 case AF_INET6:
fa0bc87c
RM
61 return (inet_pton6(src, dst));
62 default:
c4029823 63 __set_errno (EAFNOSUPPORT);
fa0bc87c
RM
64 return (-1);
65 }
66 /* NOTREACHED */
67}
c5598d47 68libc_hidden_def (inet_pton)
fa0bc87c
RM
69
70/* int
71 * inet_pton4(src, dst)
df21c858 72 * like inet_aton() but without all the hexadecimal and shorthand.
fa0bc87c
RM
73 * return:
74 * 1 if `src' is a valid dotted quad, else 0.
75 * notice:
76 * does not touch `dst' unless it's returning 1.
77 * author:
78 * Paul Vixie, 1996.
79 */
80static int
dfd2257a 81internal_function
fa0bc87c
RM
82inet_pton4(src, dst)
83 const char *src;
84 u_char *dst;
85{
fa0bc87c 86 int saw_digit, octets, ch;
e685e07d 87 u_char tmp[NS_INADDRSZ], *tp;
fa0bc87c
RM
88
89 saw_digit = 0;
90 octets = 0;
91 *(tp = tmp) = 0;
92 while ((ch = *src++) != '\0') {
fa0bc87c 93
61fab08a
UD
94 if (ch >= '0' && ch <= '9') {
95 u_int new = *tp * 10 + (ch - '0');
fa0bc87c
RM
96
97 if (new > 255)
98 return (0);
99 *tp = new;
100 if (! saw_digit) {
101 if (++octets > 4)
102 return (0);
103 saw_digit = 1;
104 }
105 } else if (ch == '.' && saw_digit) {
106 if (octets == 4)
107 return (0);
108 *++tp = 0;
109 saw_digit = 0;
110 } else
111 return (0);
112 }
113 if (octets < 4)
114 return (0);
e685e07d 115 memcpy(dst, tmp, NS_INADDRSZ);
fa0bc87c
RM
116 return (1);
117}
118
119/* int
120 * inet_pton6(src, dst)
121 * convert presentation level address to network order binary form.
122 * return:
123 * 1 if `src' is a valid [RFC1884 2.2] address, else 0.
124 * notice:
125 * (1) does not touch `dst' unless it's returning 1.
126 * (2) :: in a full address is silently ignored.
127 * credit:
128 * inspired by Mark Andrews.
129 * author:
130 * Paul Vixie, 1996.
131 */
132static int
dfd2257a 133internal_function
fa0bc87c
RM
134inet_pton6(src, dst)
135 const char *src;
136 u_char *dst;
137{
61fab08a 138 static const char xdigits[] = "0123456789abcdef";
e685e07d 139 u_char tmp[NS_IN6ADDRSZ], *tp, *endp, *colonp;
61fab08a 140 const char *curtok;
fa0bc87c
RM
141 int ch, saw_xdigit;
142 u_int val;
143
e685e07d
UD
144 tp = memset(tmp, '\0', NS_IN6ADDRSZ);
145 endp = tp + NS_IN6ADDRSZ;
fa0bc87c
RM
146 colonp = NULL;
147 /* Leading :: requires some special handling. */
148 if (*src == ':')
149 if (*++src != ':')
150 return (0);
151 curtok = src;
152 saw_xdigit = 0;
153 val = 0;
61fab08a 154 while ((ch = tolower (*src++)) != '\0') {
fa0bc87c
RM
155 const char *pch;
156
61fab08a 157 pch = strchr(xdigits, ch);
fa0bc87c
RM
158 if (pch != NULL) {
159 val <<= 4;
160 val |= (pch - xdigits);
161 if (val > 0xffff)
162 return (0);
163 saw_xdigit = 1;
164 continue;
165 }
166 if (ch == ':') {
167 curtok = src;
168 if (!saw_xdigit) {
169 if (colonp)
170 return (0);
171 colonp = tp;
172 continue;
e685e07d
UD
173 } else if (*src == '\0') {
174 return (0);
fa0bc87c 175 }
e685e07d 176 if (tp + NS_INT16SZ > endp)
fa0bc87c
RM
177 return (0);
178 *tp++ = (u_char) (val >> 8) & 0xff;
179 *tp++ = (u_char) val & 0xff;
180 saw_xdigit = 0;
181 val = 0;
182 continue;
183 }
e685e07d 184 if (ch == '.' && ((tp + NS_INADDRSZ) <= endp) &&
fa0bc87c 185 inet_pton4(curtok, tp) > 0) {
e685e07d 186 tp += NS_INADDRSZ;
fa0bc87c
RM
187 saw_xdigit = 0;
188 break; /* '\0' was seen by inet_pton4(). */
189 }
190 return (0);
191 }
192 if (saw_xdigit) {
e685e07d 193 if (tp + NS_INT16SZ > endp)
fa0bc87c
RM
194 return (0);
195 *tp++ = (u_char) (val >> 8) & 0xff;
196 *tp++ = (u_char) val & 0xff;
197 }
198 if (colonp != NULL) {
199 /*
200 * Since some memmove()'s erroneously fail to handle
201 * overlapping regions, we'll do the shift by hand.
202 */
613a76ff 203 const int n = tp - colonp;
fa0bc87c
RM
204 int i;
205
e685e07d
UD
206 if (tp == endp)
207 return (0);
613a76ff
RM
208 for (i = 1; i <= n; i++) {
209 endp[- i] = colonp[n - i];
210 colonp[n - i] = 0;
fa0bc87c
RM
211 }
212 tp = endp;
213 }
214 if (tp != endp)
215 return (0);
e685e07d 216 memcpy(dst, tmp, NS_IN6ADDRSZ);
fa0bc87c
RM
217 return (1);
218}