1b528cefcSMark Murray /*
2*ae771770SStanislav Sedov * Copyright (c) 1999 - 2001 Kungliga Tekniska Högskolan
3b528cefcSMark Murray * (Royal Institute of Technology, Stockholm, Sweden).
4b528cefcSMark Murray * All rights reserved.
5b528cefcSMark Murray *
6b528cefcSMark Murray * Redistribution and use in source and binary forms, with or without
7b528cefcSMark Murray * modification, are permitted provided that the following conditions
8b528cefcSMark Murray * are met:
9b528cefcSMark Murray *
10b528cefcSMark Murray * 1. Redistributions of source code must retain the above copyright
11b528cefcSMark Murray * notice, this list of conditions and the following disclaimer.
12b528cefcSMark Murray *
13b528cefcSMark Murray * 2. Redistributions in binary form must reproduce the above copyright
14b528cefcSMark Murray * notice, this list of conditions and the following disclaimer in the
15b528cefcSMark Murray * documentation and/or other materials provided with the distribution.
16b528cefcSMark Murray *
17b528cefcSMark Murray * 3. Neither the name of the Institute nor the names of its contributors
18b528cefcSMark Murray * may be used to endorse or promote products derived from this software
19b528cefcSMark Murray * without specific prior written permission.
20b528cefcSMark Murray *
21b528cefcSMark Murray * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22b528cefcSMark Murray * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23b528cefcSMark Murray * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24b528cefcSMark Murray * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25b528cefcSMark Murray * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26b528cefcSMark Murray * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27b528cefcSMark Murray * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28b528cefcSMark Murray * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29b528cefcSMark Murray * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30b528cefcSMark Murray * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31b528cefcSMark Murray * SUCH DAMAGE.
32b528cefcSMark Murray */
33b528cefcSMark Murray
34b528cefcSMark Murray #include <config.h>
35b528cefcSMark Murray
36c19800e8SDoug Rabson #include "roken.h"
37b528cefcSMark Murray
38b528cefcSMark Murray /*
39b528cefcSMark Murray *
40b528cefcSMark Murray */
41b528cefcSMark Murray
42b528cefcSMark Murray static const char *
inet_ntop_v4(const void * src,char * dst,size_t size)43b528cefcSMark Murray inet_ntop_v4 (const void *src, char *dst, size_t size)
44b528cefcSMark Murray {
45b528cefcSMark Murray const char digits[] = "0123456789";
46b528cefcSMark Murray int i;
47b528cefcSMark Murray struct in_addr *addr = (struct in_addr *)src;
48b528cefcSMark Murray u_long a = ntohl(addr->s_addr);
49b528cefcSMark Murray const char *orig_dst = dst;
50b528cefcSMark Murray
51b528cefcSMark Murray if (size < INET_ADDRSTRLEN) {
52b528cefcSMark Murray errno = ENOSPC;
53b528cefcSMark Murray return NULL;
54b528cefcSMark Murray }
55b528cefcSMark Murray for (i = 0; i < 4; ++i) {
56b528cefcSMark Murray int n = (a >> (24 - i * 8)) & 0xFF;
57b528cefcSMark Murray int non_zerop = 0;
58b528cefcSMark Murray
59b528cefcSMark Murray if (non_zerop || n / 100 > 0) {
60b528cefcSMark Murray *dst++ = digits[n / 100];
61b528cefcSMark Murray n %= 100;
62b528cefcSMark Murray non_zerop = 1;
63b528cefcSMark Murray }
64b528cefcSMark Murray if (non_zerop || n / 10 > 0) {
65b528cefcSMark Murray *dst++ = digits[n / 10];
66b528cefcSMark Murray n %= 10;
67b528cefcSMark Murray non_zerop = 1;
68b528cefcSMark Murray }
69b528cefcSMark Murray *dst++ = digits[n];
70b528cefcSMark Murray if (i != 3)
71b528cefcSMark Murray *dst++ = '.';
72b528cefcSMark Murray }
73b528cefcSMark Murray *dst++ = '\0';
74b528cefcSMark Murray return orig_dst;
75b528cefcSMark Murray }
76b528cefcSMark Murray
77b528cefcSMark Murray #ifdef HAVE_IPV6
78b528cefcSMark Murray static const char *
inet_ntop_v6(const void * src,char * dst,size_t size)79b528cefcSMark Murray inet_ntop_v6 (const void *src, char *dst, size_t size)
80b528cefcSMark Murray {
81b528cefcSMark Murray const char xdigits[] = "0123456789abcdef";
82b528cefcSMark Murray int i;
83b528cefcSMark Murray const struct in6_addr *addr = (struct in6_addr *)src;
84b528cefcSMark Murray const u_char *ptr = addr->s6_addr;
85b528cefcSMark Murray const char *orig_dst = dst;
86*ae771770SStanislav Sedov int compressed = 0;
87b528cefcSMark Murray
88b528cefcSMark Murray if (size < INET6_ADDRSTRLEN) {
89b528cefcSMark Murray errno = ENOSPC;
90b528cefcSMark Murray return NULL;
91b528cefcSMark Murray }
92b528cefcSMark Murray for (i = 0; i < 8; ++i) {
93adb0ddaeSAssar Westerlund int non_zerop = 0;
94b528cefcSMark Murray
95*ae771770SStanislav Sedov if (compressed == 0 &&
96*ae771770SStanislav Sedov ptr[0] == 0 && ptr[1] == 0 &&
97*ae771770SStanislav Sedov i <= 5 &&
98*ae771770SStanislav Sedov ptr[2] == 0 && ptr[3] == 0 &&
99*ae771770SStanislav Sedov ptr[4] == 0 && ptr[5] == 0) {
100*ae771770SStanislav Sedov
101*ae771770SStanislav Sedov compressed = 1;
102*ae771770SStanislav Sedov
103*ae771770SStanislav Sedov if (i == 0)
104*ae771770SStanislav Sedov *dst++ = ':';
105*ae771770SStanislav Sedov *dst++ = ':';
106*ae771770SStanislav Sedov
107*ae771770SStanislav Sedov for (ptr += 6, i += 3;
108*ae771770SStanislav Sedov i < 8 && ptr[0] == 0 && ptr[1] == 0;
109*ae771770SStanislav Sedov ++i, ptr += 2);
110*ae771770SStanislav Sedov
111*ae771770SStanislav Sedov if (i >= 8)
112*ae771770SStanislav Sedov break;
113*ae771770SStanislav Sedov }
114*ae771770SStanislav Sedov
115b528cefcSMark Murray if (non_zerop || (ptr[0] >> 4)) {
116b528cefcSMark Murray *dst++ = xdigits[ptr[0] >> 4];
117b528cefcSMark Murray non_zerop = 1;
118b528cefcSMark Murray }
119b528cefcSMark Murray if (non_zerop || (ptr[0] & 0x0F)) {
120b528cefcSMark Murray *dst++ = xdigits[ptr[0] & 0x0F];
121b528cefcSMark Murray non_zerop = 1;
122b528cefcSMark Murray }
123b528cefcSMark Murray if (non_zerop || (ptr[1] >> 4)) {
124b528cefcSMark Murray *dst++ = xdigits[ptr[1] >> 4];
125b528cefcSMark Murray non_zerop = 1;
126b528cefcSMark Murray }
127b528cefcSMark Murray *dst++ = xdigits[ptr[1] & 0x0F];
128b528cefcSMark Murray if (i != 7)
129b528cefcSMark Murray *dst++ = ':';
130b528cefcSMark Murray ptr += 2;
131b528cefcSMark Murray }
132b528cefcSMark Murray *dst++ = '\0';
133b528cefcSMark Murray return orig_dst;
134b528cefcSMark Murray }
135b528cefcSMark Murray #endif /* HAVE_IPV6 */
136b528cefcSMark Murray
137*ae771770SStanislav Sedov ROKEN_LIB_FUNCTION const char * ROKEN_LIB_CALL
inet_ntop(int af,const void * src,char * dst,size_t size)138b528cefcSMark Murray inet_ntop(int af, const void *src, char *dst, size_t size)
139b528cefcSMark Murray {
140b528cefcSMark Murray switch (af) {
141b528cefcSMark Murray case AF_INET :
142b528cefcSMark Murray return inet_ntop_v4 (src, dst, size);
143b528cefcSMark Murray #ifdef HAVE_IPV6
144b528cefcSMark Murray case AF_INET6 :
145b528cefcSMark Murray return inet_ntop_v6 (src, dst, size);
146b528cefcSMark Murray #endif
147b528cefcSMark Murray default :
148b528cefcSMark Murray errno = EAFNOSUPPORT;
149b528cefcSMark Murray return NULL;
150b528cefcSMark Murray }
151b528cefcSMark Murray }
152