2 * Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
3 * Copyright (c) 1996-1999 by Internet Software Consortium.
5 * Permission to use, copy, modify, and distribute this software for any
6 * purpose with or without fee is hereby granted, provided that the above
7 * copyright notice and this permission notice appear in all copies.
9 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
10 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
12 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
15 * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
18 #include "ares_setup.h"
20 #ifdef HAVE_SYS_SOCKET_H
21 # include <sys/socket.h>
23 #ifdef HAVE_NETINET_IN_H
24 # include <netinet/in.h>
26 #ifdef HAVE_ARPA_INET_H
27 # include <arpa/inet.h>
29 #ifdef HAVE_ARPA_NAMESER_H
30 # include <arpa/nameser.h>
34 #ifdef HAVE_ARPA_NAMESER_COMPAT_H
35 # include <arpa/nameser_compat.h>
39 #include "ares_ipv6.h"
40 #include "inet_ntop.h"
43 #ifndef HAVE_INET_NTOP
46 * WARNING: Don't even consider trying to compile this on a system where
47 * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
50 static const char *inet_ntop4(const unsigned char *src, char *dst, size_t size);
51 static const char *inet_ntop6(const unsigned char *src, char *dst, size_t size);
54 * inet_ntop(af, src, dst, size)
55 * convert a network format address to presentation format.
57 * pointer to presentation format address (`dst'), or NULL (see errno).
59 * On Windows we store the error in the thread errno, not
60 * in the winsock error code. This is to avoid loosing the
61 * actual last winsock error. So use macro ERRNO to fetch the
62 * errno this funtion sets when returning NULL, not SOCKERRNO.
67 ares_inet_ntop(int af, const void *src, char *dst, size_t size)
71 return (inet_ntop4(src, dst, size));
73 return (inet_ntop6(src, dst, size));
75 SET_ERRNO(EAFNOSUPPORT);
82 * inet_ntop4(src, dst, size)
83 * format an IPv4 address
88 * (2) takes a unsigned char* not an in_addr as input
93 inet_ntop4(const unsigned char *src, char *dst, size_t size)
95 static const char fmt[] = "%u.%u.%u.%u";
96 char tmp[sizeof("255.255.255.255")];
98 if ((size_t)sprintf(tmp, fmt, src[0], src[1], src[2], src[3]) >= size) {
107 * inet_ntop6(src, dst, size)
108 * convert IPv6 binary address into presentation (printable) format
113 inet_ntop6(const unsigned char *src, char *dst, size_t size)
116 * Note that int32_t and int16_t need only be "at least" large enough
117 * to contain a value of the specified size. On some systems, like
118 * Crays, there is no such thing as an integer variable with 16 bits.
119 * Keep this in mind if you think this function should have been coded
120 * to use pointer overlays. All the world's not a VAX.
122 char tmp[sizeof("ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255")];
124 struct { int base, len; } best, cur;
125 unsigned int words[NS_IN6ADDRSZ / NS_INT16SZ];
130 * Copy the input (bytewise) array into a wordwise array.
131 * Find the longest run of 0x00's in src[] for :: shorthanding.
133 memset(words, '\0', sizeof(words));
134 for (i = 0; i < NS_IN6ADDRSZ; i++)
135 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
140 for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
143 cur.base = i, cur.len = 1;
147 if (cur.base != -1) {
148 if (best.base == -1 || cur.len > best.len)
154 if (cur.base != -1) {
155 if (best.base == -1 || cur.len > best.len)
158 if (best.base != -1 && best.len < 2)
165 for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
166 /* Are we inside the best run of 0x00's? */
167 if (best.base != -1 && i >= best.base &&
168 i < (best.base + best.len)) {
173 /* Are we following an initial run of 0x00s or any real hex? */
176 /* Is this address an encapsulated IPv4? */
177 if (i == 6 && best.base == 0 && (best.len == 6 ||
178 (best.len == 7 && words[7] != 0x0001) ||
179 (best.len == 5 && words[5] == 0xffff))) {
180 if (!inet_ntop4(src+12, tp, sizeof(tmp) - (tp - tmp)))
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))
194 * Check for overflow, copy, and we're done.
196 if ((size_t)(tp - tmp) > size) {