1 /* Copyright (c) 1996 by Internet Software Consortium.
3 * Permission to use, copy, modify, and distribute this software for any
4 * purpose with or without fee is hereby granted, provided that the above
5 * copyright notice and this permission notice appear in all copies.
7 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
8 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
9 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
10 * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
11 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
12 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
13 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
19 #include <sys/types.h>
21 #if defined(WIN32) && !defined(WATT32)
24 #ifdef HAVE_SYS_SOCKET_H
25 #include <sys/socket.h>
27 #ifdef HAVE_NETINET_IN_H
28 #include <netinet/in.h>
30 #ifdef HAVE_ARPA_NAMESER_H
31 #include <arpa/nameser.h>
33 #ifdef HAVE_ARPA_INET_H
34 #include <arpa/inet.h>
44 #include "ares_ipv6.h"
45 #include "inet_ntop.h"
48 #if !defined(HAVE_INET_NTOP) || !defined(HAVE_INET_NTOP_IPV6)
51 # define SPRINTF(x) strlen(sprintf/**/x)
53 # define SPRINTF(x) ((size_t)sprintf x)
57 * WARNING: Don't even consider trying to compile this on a system where
58 * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
61 static const char *inet_ntop4(const unsigned char *src, char *dst, size_t size);
62 static const char *inet_ntop6(const unsigned char *src, char *dst, size_t size);
65 * inet_ntop(af, src, dst, size)
66 * convert a network format address to presentation format.
68 * pointer to presentation format address (`dst'), or NULL (see errno).
73 inet_ntop(int af, const void *src, char *dst, size_t size)
78 return (inet_ntop4(src, dst, size));
81 return (inet_ntop6(src, dst, size));
91 * inet_ntop4(src, dst, size)
92 * format an IPv4 address, more or less like inet_ntoa()
97 * (2) takes a unsigned char* not an in_addr as input
102 inet_ntop4(const unsigned char *src, char *dst, size_t size)
104 static const char fmt[] = "%u.%u.%u.%u";
105 char tmp[sizeof "255.255.255.255"];
107 if (SPRINTF((tmp, fmt, src[0], src[1], src[2], src[3])) > size) {
117 * inet_ntop6(src, dst, size)
118 * convert IPv6 binary address into presentation (printable) format
123 inet_ntop6(const unsigned char *src, char *dst, size_t size)
126 * Note that int32_t and int16_t need only be "at least" large enough
127 * to contain a value of the specified size. On some systems, like
128 * Crays, there is no such thing as an integer variable with 16 bits.
129 * Keep this in mind if you think this function should have been coded
130 * to use pointer overlays. All the world's not a VAX.
132 char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp;
133 struct { int base, len; } best, cur;
134 unsigned int words[IN6ADDRSZ / INT16SZ];
139 * Copy the input (bytewise) array into a wordwise array.
140 * Find the longest run of 0x00's in src[] for :: shorthanding.
142 memset(words, '\0', sizeof words);
143 for (i = 0; i < IN6ADDRSZ; i++)
144 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
147 for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) {
150 cur.base = i, cur.len = 1;
154 if (cur.base != -1) {
155 if (best.base == -1 || cur.len > best.len)
161 if (cur.base != -1) {
162 if (best.base == -1 || cur.len > best.len)
165 if (best.base != -1 && best.len < 2)
172 for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) {
173 /* Are we inside the best run of 0x00's? */
174 if (best.base != -1 && i >= best.base &&
175 i < (best.base + best.len)) {
180 /* Are we following an initial run of 0x00s or any real hex? */
183 /* Is this address an encapsulated IPv4? */
184 if (i == 6 && best.base == 0 &&
185 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
186 if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp)))
191 tp += SPRINTF((tp, "%x", words[i]));
193 /* Was it a trailing run of 0x00's? */
194 if (best.base != -1 && (best.base + best.len) == (IN6ADDRSZ / INT16SZ))
199 * Check for overflow, copy, and we're done.
201 if ((size_t)(tp - tmp) > size) {