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
18 #include "../git-compat-util.h"
24 #define NS_IN6ADDRSZ 16
31 * WARNING: Don't even consider trying to compile this on a system where
32 * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
36 * inet_ntop4(src, dst, size)
37 * format an IPv4 address
42 * (2) takes a u_char* not an in_addr as input
47 inet_ntop4(const u_char
*src
, char *dst
, size_t size
)
49 static const char fmt
[] = "%u.%u.%u.%u";
50 char tmp
[sizeof "255.255.255.255"];
53 nprinted
= snprintf(tmp
, sizeof(tmp
), fmt
, src
[0], src
[1], src
[2], src
[3]);
55 return (NULL
); /* we assume "errno" was set by "snprintf()" */
56 if ((size_t)nprinted
> size
) {
66 * inet_ntop6(src, dst, size)
67 * convert IPv6 binary address into presentation (printable) format
72 inet_ntop6(const u_char
*src
, char *dst
, size_t size
)
75 * Note that int32_t and int16_t need only be "at least" large enough
76 * to contain a value of the specified size. On some systems, like
77 * Crays, there is no such thing as an integer variable with 16 bits.
78 * Keep this in mind if you think this function should have been coded
79 * to use pointer overlays. All the world's not a VAX.
81 char tmp
[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp
;
82 struct { int base
, len
; } best
, cur
;
83 unsigned int words
[NS_IN6ADDRSZ
/ NS_INT16SZ
];
88 * Copy the input (bytewise) array into a wordwise array.
89 * Find the longest run of 0x00's in src[] for :: shorthanding.
91 memset(words
, '\0', sizeof words
);
92 for (i
= 0; i
< NS_IN6ADDRSZ
; i
++)
93 words
[i
/ 2] |= (src
[i
] << ((1 - (i
% 2)) << 3));
98 for (i
= 0; i
< (NS_IN6ADDRSZ
/ NS_INT16SZ
); i
++) {
101 cur
.base
= i
, cur
.len
= 1;
105 if (cur
.base
!= -1) {
106 if (best
.base
== -1 || cur
.len
> best
.len
)
112 if (cur
.base
!= -1) {
113 if (best
.base
== -1 || cur
.len
> best
.len
)
116 if (best
.base
!= -1 && best
.len
< 2)
123 for (i
= 0; i
< (NS_IN6ADDRSZ
/ NS_INT16SZ
); i
++) {
124 /* Are we inside the best run of 0x00's? */
125 if (best
.base
!= -1 && i
>= best
.base
&&
126 i
< (best
.base
+ best
.len
)) {
131 /* Are we following an initial run of 0x00s or any real hex? */
134 /* Is this address an encapsulated IPv4? */
135 if (i
== 6 && best
.base
== 0 &&
136 (best
.len
== 6 || (best
.len
== 5 && words
[5] == 0xffff))) {
137 if (!inet_ntop4(src
+12, tp
, sizeof tmp
- (tp
- tmp
)))
142 tp
+= snprintf(tp
, sizeof tmp
- (tp
- tmp
), "%x", words
[i
]);
144 /* Was it a trailing run of 0x00's? */
145 if (best
.base
!= -1 && (best
.base
+ best
.len
) ==
146 (NS_IN6ADDRSZ
/ NS_INT16SZ
))
151 * Check for overflow, copy, and we're done.
153 if ((size_t)(tp
- tmp
) > size
) {
163 * inet_ntop(af, src, dst, size)
164 * convert a network format address to presentation format.
166 * pointer to presentation format address (`dst'), or NULL (see errno).
171 inet_ntop(int af
, const void *src
, char *dst
, size_t size
)
175 return (inet_ntop4(src
, dst
, size
));
178 return (inet_ntop6(src
, dst
, size
));
181 errno
= EAFNOSUPPORT
;