4 * Copyright (C) 1996-2001 Internet Software Consortium.
6 * Permission to use, copy, modify, and distribute this software for any
7 * purpose with or without fee is hereby granted, provided that the above
8 * copyright notice and this permission notice appear in all copies.
10 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM
11 * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL
12 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL
13 * INTERNET SOFTWARE CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT,
14 * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING
15 * FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
16 * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
17 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
20 #if defined(LIBC_SCCS) && !defined(lint)
22 "Id: inet_ntop.c,v 1.13 2001/11/27 01:56:00 gson Exp";
23 #endif /* LIBC_SCCS and not lint */
33 #include "ntp_sprintf.h"
36 #define NS_IN6ADDRSZ 16
39 * WARNING: Don't even consider trying to compile this on a system where
40 * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
43 static const char *inet_ntop4(const unsigned char *src
, char *dst
,
47 static const char *inet_ntop6(const unsigned char *src
, char *dst
,
52 * isc_net_ntop(af, src, dst, size)
53 * convert a network format address to presentation format.
55 * pointer to presentation format address (`dst'), or NULL (see errno).
60 isc_net_ntop(int af
, const void *src
, char *dst
, size_t size
)
64 return (inet_ntop4(src
, dst
, size
));
67 return (inet_ntop6(src
, dst
, size
));
77 * inet_ntop4(src, dst, size)
78 * format an IPv4 address
83 * (2) takes a unsigned char* not an in_addr as input
88 inet_ntop4(const unsigned char *src
, char *dst
, size_t size
)
90 static const char *fmt
= "%u.%u.%u.%u";
91 char tmp
[sizeof("255.255.255.255")];
93 if (SPRINTF((tmp
, fmt
, src
[0], src
[1], src
[2], src
[3])) >= size
)
104 * isc_inet_ntop6(src, dst, size)
105 * convert IPv6 binary address into presentation (printable) format
111 inet_ntop6(const unsigned char *src
, char *dst
, size_t size
)
114 * Note that int32_t and int16_t need only be "at least" large enough
115 * to contain a value of the specified size. On some systems, like
116 * Crays, there is no such thing as an integer variable with 16 bits.
117 * Keep this in mind if you think this function should have been coded
118 * to use pointer overlays. All the world's not a VAX.
120 char tmp
[sizeof("ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255")], *tp
;
121 struct { int base
, len
; } best
, cur
;
122 unsigned int words
[NS_IN6ADDRSZ
/ NS_INT16SZ
];
127 * Copy the input (bytewise) array into a wordwise array.
128 * Find the longest run of 0x00's in src[] for :: shorthanding.
130 memset(words
, '\0', sizeof(words
));
131 for (i
= 0; i
< NS_IN6ADDRSZ
; i
++)
132 words
[i
/ 2] |= (src
[i
] << ((1 - (i
% 2)) << 3));
137 for (i
= 0; i
< (NS_IN6ADDRSZ
/ NS_INT16SZ
); i
++) {
140 cur
.base
= i
, cur
.len
= 1;
144 if (cur
.base
!= -1) {
145 if (best
.base
== -1 || cur
.len
> best
.len
)
151 if (cur
.base
!= -1) {
152 if (best
.base
== -1 || cur
.len
> best
.len
)
155 if (best
.base
!= -1 && best
.len
< 2)
162 for (i
= 0; i
< (NS_IN6ADDRSZ
/ NS_INT16SZ
); i
++) {
163 /* Are we inside the best run of 0x00's? */
164 if (best
.base
!= -1 && i
>= best
.base
&&
165 i
< (best
.base
+ best
.len
)) {
170 /* Are we following an initial run of 0x00s or any real hex? */
173 /* Is this address an encapsulated IPv4? */
174 if (i
== 6 && best
.base
== 0 &&
175 (best
.len
== 6 || (best
.len
== 5 && words
[5] == 0xffff))) {
176 if (!inet_ntop4(src
+12, tp
,
177 sizeof(tmp
) - (tp
- tmp
)))
182 tp
+= SPRINTF((tp
, "%x", words
[i
]));
184 /* Was it a trailing run of 0x00's? */
185 if (best
.base
!= -1 && (best
.base
+ best
.len
) ==
186 (NS_IN6ADDRSZ
/ NS_INT16SZ
))
191 * Check for overflow, copy, and we're done.
193 if ((size_t)(tp
- tmp
) > size
) {
200 #endif /* AF_INET6 */