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
17 #include "apr_private.h"
18 #include "apr_arch_networkio.h"
19 #include "apr_strings.h"
21 #if APR_HAVE_SYS_TYPES_H
22 #include <sys/types.h>
24 #if APR_HAVE_SYS_SOCKET_H
25 #include <sys/socket.h>
27 #if APR_HAVE_NETINET_IN_H
28 #include <netinet/in.h>
30 #if APR_HAVE_ARPA_INET_H
31 #include <arpa/inet.h>
44 #define INT16SZ sizeof(apr_int16_t)
51 #if !defined(EAFNOSUPPORT) && defined(WSAEAFNOSUPPORT)
52 #define EAFNOSUPPORT WSAEAFNOSUPPORT
56 * WARNING: Don't even consider trying to compile this on a system where
57 * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
60 static const char *inet_ntop4 __P((const unsigned char *src, char *dst, apr_size_t size));
62 static const char *inet_ntop6 __P((const unsigned char *src, char *dst, apr_size_t size));
66 * inet_ntop(af, src, dst, size)
67 * convert a network format address to presentation format.
69 * pointer to presentation format address (`dst'), or NULL (see errno).
74 apr_inet_ntop(int af, const void *src, char *dst, apr_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 u_char* not an in_addr as input
102 inet_ntop4(const unsigned char *src, char *dst, apr_size_t size)
104 const apr_size_t MIN_SIZE = 16; /* space for 255.255.255.255\0 */
108 if (size < MIN_SIZE) {
113 unsigned char u = *src++;
115 *next++ = '0' + u/100;
117 *next++ = '0' + u/10;
121 *next++ = '0' + u/10;
134 * inet_ntop6(src, dst, size)
135 * convert IPv6 binary address into presentation (printable) format
140 inet_ntop6(const unsigned char *src, char *dst, apr_size_t size)
143 * Note that int32_t and int16_t need only be "at least" large enough
144 * to contain a value of the specified size. On some systems, like
145 * Crays, there is no such thing as an integer variable with 16 bits.
146 * Keep this in mind if you think this function should have been coded
147 * to use pointer overlays. All the world's not a VAX.
149 char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp;
150 struct { int base, len; } best = {-1, 0}, cur = {-1, 0};
151 unsigned int words[IN6ADDRSZ / INT16SZ];
153 const unsigned char *next_src, *src_end;
154 unsigned int *next_dest;
158 * Copy the input (bytewise) array into a wordwise array.
159 * Find the longest run of 0x00's in src[] for :: shorthanding.
162 src_end = src + IN6ADDRSZ;
166 unsigned int next_word = (unsigned int)*next_src++;
168 next_word |= (unsigned int)*next_src++;
169 *next_dest++ = next_word;
171 if (next_word == 0) {
172 if (cur.base == -1) {
180 if (cur.base != -1) {
181 if (best.base == -1 || cur.len > best.len) {
189 } while (next_src < src_end);
191 if (cur.base != -1) {
192 if (best.base == -1 || cur.len > best.len) {
196 if (best.base != -1 && best.len < 2) {
204 for (i = 0; i < (IN6ADDRSZ / INT16SZ);) {
205 /* Are we inside the best run of 0x00's? */
206 if (i == best.base) {
211 /* Are we following an initial run of 0x00s or any real hex? */
215 /* Is this address an encapsulated IPv4? */
216 if (i == 6 && best.base == 0 &&
217 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
218 if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp))) {
224 tp += apr_snprintf(tp, sizeof tmp - (tp - tmp), "%x", words[i]);
227 /* Was it a trailing run of 0x00's? */
228 if (best.base != -1 && (best.base + best.len) == (IN6ADDRSZ / INT16SZ)) {
234 * Check for overflow, copy, and we're done.
236 if ((apr_size_t)(tp - tmp) > size) {