Update.
[glibc.git] / resolv / inet_ntop.c
blobe5553a1d3b364dc991423cd04973bed9e69fa6a4
1 /*
2 * Copyright (c) 1996-1999 by Internet Software Consortium.
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.
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.
18 #if defined(LIBC_SCCS) && !defined(lint)
19 static const char rcsid[] = "$BINDId: inet_ntop.c,v 1.8 1999/10/13 16:39:28 vixie Exp $";
20 #endif /* LIBC_SCCS and not lint */
22 #include <sys/param.h>
23 #include <sys/types.h>
24 #include <sys/socket.h>
26 #include <netinet/in.h>
27 #include <arpa/inet.h>
28 #include <arpa/nameser.h>
30 #include <errno.h>
31 #include <stdio.h>
32 #include <string.h>
34 #ifdef SPRINTF_CHAR
35 # define SPRINTF(x) strlen(sprintf/**/x)
36 #else
37 # define SPRINTF(x) ((size_t)sprintf x)
38 #endif
41 * WARNING: Don't even consider trying to compile this on a system where
42 * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
45 static const char *inet_ntop4 (const u_char *src, char *dst, socklen_t size)
46 internal_function;
47 static const char *inet_ntop6 (const u_char *src, char *dst, socklen_t size)
48 internal_function;
50 /* char *
51 * inet_ntop(af, src, dst, size)
52 * convert a network format address to presentation format.
53 * return:
54 * pointer to presentation format address (`dst'), or NULL (see errno).
55 * author:
56 * Paul Vixie, 1996.
58 const char *
59 inet_ntop(af, src, dst, size)
60 int af;
61 const void *src;
62 char *dst;
63 socklen_t size;
65 switch (af) {
66 case AF_INET:
67 return (inet_ntop4(src, dst, size));
68 case AF_INET6:
69 return (inet_ntop6(src, dst, size));
70 default:
71 __set_errno (EAFNOSUPPORT);
72 return (NULL);
74 /* NOTREACHED */
76 libc_hidden_def (inet_ntop)
78 /* const char *
79 * inet_ntop4(src, dst, size)
80 * format an IPv4 address
81 * return:
82 * `dst' (as a const)
83 * notes:
84 * (1) uses no statics
85 * (2) takes a u_char* not an in_addr as input
86 * author:
87 * Paul Vixie, 1996.
89 static const char *
90 internal_function
91 inet_ntop4(src, dst, size)
92 const u_char *src;
93 char *dst;
94 socklen_t size;
96 static const char fmt[] = "%u.%u.%u.%u";
97 char tmp[sizeof "255.255.255.255"];
99 if (SPRINTF((tmp, fmt, src[0], src[1], src[2], src[3])) > size) {
100 __set_errno (ENOSPC);
101 return (NULL);
103 return strcpy(dst, tmp);
106 /* const char *
107 * inet_ntop6(src, dst, size)
108 * convert IPv6 binary address into presentation (printable) format
109 * author:
110 * Paul Vixie, 1996.
112 static const char *
113 internal_function
114 inet_ntop6(src, dst, size)
115 const u_char *src;
116 char *dst;
117 socklen_t size;
120 * Note that int32_t and int16_t need only be "at least" large enough
121 * to contain a value of the specified size. On some systems, like
122 * Crays, there is no such thing as an integer variable with 16 bits.
123 * Keep this in mind if you think this function should have been coded
124 * to use pointer overlays. All the world's not a VAX.
126 char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp;
127 struct { int base, len; } best, cur;
128 u_int words[NS_IN6ADDRSZ / NS_INT16SZ];
129 int i;
132 * Preprocess:
133 * Copy the input (bytewise) array into a wordwise array.
134 * Find the longest run of 0x00's in src[] for :: shorthanding.
136 memset(words, '\0', sizeof words);
137 for (i = 0; i < NS_IN6ADDRSZ; i += 2)
138 words[i / 2] = (src[i] << 8) | src[i + 1];
139 best.base = -1;
140 cur.base = -1;
141 for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
142 if (words[i] == 0) {
143 if (cur.base == -1)
144 cur.base = i, cur.len = 1;
145 else
146 cur.len++;
147 } else {
148 if (cur.base != -1) {
149 if (best.base == -1 || cur.len > best.len)
150 best = cur;
151 cur.base = -1;
155 if (cur.base != -1) {
156 if (best.base == -1 || cur.len > best.len)
157 best = cur;
159 if (best.base != -1 && best.len < 2)
160 best.base = -1;
163 * Format the result.
165 tp = tmp;
166 for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
167 /* Are we inside the best run of 0x00's? */
168 if (best.base != -1 && i >= best.base &&
169 i < (best.base + best.len)) {
170 if (i == best.base)
171 *tp++ = ':';
172 continue;
174 /* Are we following an initial run of 0x00s or any real hex? */
175 if (i != 0)
176 *tp++ = ':';
177 /* Is this address an encapsulated IPv4? */
178 if (i == 6 && best.base == 0 &&
179 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
180 if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp)))
181 return (NULL);
182 tp += strlen(tp);
183 break;
185 tp += SPRINTF((tp, "%x", words[i]));
187 /* Was it a trailing run of 0x00's? */
188 if (best.base != -1 && (best.base + best.len) ==
189 (NS_IN6ADDRSZ / NS_INT16SZ))
190 *tp++ = ':';
191 *tp++ = '\0';
194 * Check for overflow, copy, and we're done.
196 if ((socklen_t)(tp - tmp) > size) {
197 __set_errno (ENOSPC);
198 return (NULL);
200 return strcpy(dst, tmp);