1411677aeSAaron LI /*
2411677aeSAaron LI * Copyright (c) 1999 Kungliga Tekniska Högskolan
3411677aeSAaron LI * (Royal Institute of Technology, Stockholm, Sweden).
4411677aeSAaron LI * All rights reserved.
5411677aeSAaron LI *
6411677aeSAaron LI * Redistribution and use in source and binary forms, with or without
7411677aeSAaron LI * modification, are permitted provided that the following conditions
8411677aeSAaron LI * are met:
9411677aeSAaron LI *
10411677aeSAaron LI * 1. Redistributions of source code must retain the above copyright
11411677aeSAaron LI * notice, this list of conditions and the following disclaimer.
12411677aeSAaron LI *
13411677aeSAaron LI * 2. Redistributions in binary form must reproduce the above copyright
14411677aeSAaron LI * notice, this list of conditions and the following disclaimer in the
15411677aeSAaron LI * documentation and/or other materials provided with the distribution.
16411677aeSAaron LI *
17411677aeSAaron LI * 3. All advertising materials mentioning features or use of this software
18411677aeSAaron LI * must display the following acknowledgement:
19411677aeSAaron LI * This product includes software developed by the Kungliga Tekniska
20411677aeSAaron LI * Högskolan and its contributors.
21411677aeSAaron LI *
22411677aeSAaron LI * 4. Neither the name of the Institute nor the names of its contributors
23411677aeSAaron LI * may be used to endorse or promote products derived from this software
24411677aeSAaron LI * without specific prior written permission.
25411677aeSAaron LI *
26411677aeSAaron LI * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
27411677aeSAaron LI * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28411677aeSAaron LI * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29411677aeSAaron LI * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
30411677aeSAaron LI * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31411677aeSAaron LI * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32411677aeSAaron LI * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33411677aeSAaron LI * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34411677aeSAaron LI * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35411677aeSAaron LI * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36411677aeSAaron LI * SUCH DAMAGE.
37411677aeSAaron LI */
38411677aeSAaron LI
39411677aeSAaron LI #ifdef HAVE_CONFIG_H
40*ed775ee7SAntonio Huete Jimenez #include <config.h>
41411677aeSAaron LI #endif
42411677aeSAaron LI
43*ed775ee7SAntonio Huete Jimenez #include "netdissect-stdinc.h"
44411677aeSAaron LI #include "addrtostr.h"
45411677aeSAaron LI
46411677aeSAaron LI #include <stdio.h>
47411677aeSAaron LI #include <string.h>
48411677aeSAaron LI
49411677aeSAaron LI /*
50411677aeSAaron LI *
51411677aeSAaron LI */
52411677aeSAaron LI
53411677aeSAaron LI #ifndef IN6ADDRSZ
54411677aeSAaron LI #define IN6ADDRSZ 16 /* IPv6 T_AAAA */
55411677aeSAaron LI #endif
56411677aeSAaron LI
57411677aeSAaron LI #ifndef INT16SZ
58411677aeSAaron LI #define INT16SZ 2 /* word size */
59411677aeSAaron LI #endif
60411677aeSAaron LI
61411677aeSAaron LI const char *
addrtostr(const void * src,char * dst,size_t size)62411677aeSAaron LI addrtostr (const void *src, char *dst, size_t size)
63411677aeSAaron LI {
64411677aeSAaron LI const u_char *srcaddr = (const u_char *)src;
65411677aeSAaron LI const char digits[] = "0123456789";
66411677aeSAaron LI int i;
67411677aeSAaron LI const char *orig_dst = dst;
68411677aeSAaron LI
69411677aeSAaron LI if (size < INET_ADDRSTRLEN) {
70411677aeSAaron LI errno = ENOSPC;
71411677aeSAaron LI return NULL;
72411677aeSAaron LI }
73411677aeSAaron LI for (i = 0; i < 4; ++i) {
74411677aeSAaron LI int n = *srcaddr++;
75411677aeSAaron LI int non_zerop = 0;
76411677aeSAaron LI
77411677aeSAaron LI if (non_zerop || n / 100 > 0) {
78411677aeSAaron LI *dst++ = digits[n / 100];
79411677aeSAaron LI n %= 100;
80411677aeSAaron LI non_zerop = 1;
81411677aeSAaron LI }
82411677aeSAaron LI if (non_zerop || n / 10 > 0) {
83411677aeSAaron LI *dst++ = digits[n / 10];
84411677aeSAaron LI n %= 10;
85411677aeSAaron LI non_zerop = 1;
86411677aeSAaron LI }
87411677aeSAaron LI *dst++ = digits[n];
88411677aeSAaron LI if (i != 3)
89411677aeSAaron LI *dst++ = '.';
90411677aeSAaron LI }
91411677aeSAaron LI *dst++ = '\0';
92411677aeSAaron LI return orig_dst;
93411677aeSAaron LI }
94411677aeSAaron LI
95411677aeSAaron LI /*
96411677aeSAaron LI * Convert IPv6 binary address into presentation (printable) format.
97411677aeSAaron LI */
98411677aeSAaron LI const char *
addrtostr6(const void * src,char * dst,size_t size)99411677aeSAaron LI addrtostr6 (const void *src, char *dst, size_t size)
100411677aeSAaron LI {
101411677aeSAaron LI /*
102411677aeSAaron LI * Note that int32_t and int16_t need only be "at least" large enough
103411677aeSAaron LI * to contain a value of the specified size. On some systems, like
104411677aeSAaron LI * Crays, there is no such thing as an integer variable with 16 bits.
105411677aeSAaron LI * Keep this in mind if you think this function should have been coded
106411677aeSAaron LI * to use pointer overlays. All the world's not a VAX.
107411677aeSAaron LI */
108411677aeSAaron LI const u_char *srcaddr = (const u_char *)src;
109411677aeSAaron LI char *dp;
110411677aeSAaron LI size_t space_left, added_space;
111411677aeSAaron LI int snprintfed;
112411677aeSAaron LI struct {
113411677aeSAaron LI int base;
114411677aeSAaron LI int len;
115411677aeSAaron LI } best, cur;
116411677aeSAaron LI uint16_t words [IN6ADDRSZ / INT16SZ];
117411677aeSAaron LI int i;
118411677aeSAaron LI
119411677aeSAaron LI /* Preprocess:
120411677aeSAaron LI * Copy the input (bytewise) array into a wordwise array.
121411677aeSAaron LI * Find the longest run of 0x00's in src[] for :: shorthanding.
122411677aeSAaron LI */
123411677aeSAaron LI for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++)
124411677aeSAaron LI words[i] = (srcaddr[2*i] << 8) | srcaddr[2*i + 1];
125411677aeSAaron LI
126411677aeSAaron LI best.len = 0;
127411677aeSAaron LI best.base = -1;
128411677aeSAaron LI cur.len = 0;
129411677aeSAaron LI cur.base = -1;
130*ed775ee7SAntonio Huete Jimenez for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++)
131411677aeSAaron LI {
132411677aeSAaron LI if (words[i] == 0)
133411677aeSAaron LI {
134411677aeSAaron LI if (cur.base == -1)
135411677aeSAaron LI cur.base = i, cur.len = 1;
136411677aeSAaron LI else cur.len++;
137411677aeSAaron LI }
138411677aeSAaron LI else if (cur.base != -1)
139411677aeSAaron LI {
140411677aeSAaron LI if (best.base == -1 || cur.len > best.len)
141411677aeSAaron LI best = cur;
142411677aeSAaron LI cur.base = -1;
143411677aeSAaron LI }
144411677aeSAaron LI }
145411677aeSAaron LI if ((cur.base != -1) && (best.base == -1 || cur.len > best.len))
146411677aeSAaron LI best = cur;
147411677aeSAaron LI if (best.base != -1 && best.len < 2)
148411677aeSAaron LI best.base = -1;
149411677aeSAaron LI
150411677aeSAaron LI /* Format the result.
151411677aeSAaron LI */
152411677aeSAaron LI dp = dst;
153411677aeSAaron LI space_left = size;
154411677aeSAaron LI #define APPEND_CHAR(c) \
155411677aeSAaron LI { \
156411677aeSAaron LI if (space_left == 0) { \
157411677aeSAaron LI errno = ENOSPC; \
158411677aeSAaron LI return (NULL); \
159411677aeSAaron LI } \
160411677aeSAaron LI *dp++ = c; \
161411677aeSAaron LI space_left--; \
162411677aeSAaron LI }
163*ed775ee7SAntonio Huete Jimenez for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++)
164411677aeSAaron LI {
165411677aeSAaron LI /* Are we inside the best run of 0x00's?
166411677aeSAaron LI */
167411677aeSAaron LI if (best.base != -1 && i >= best.base && i < (best.base + best.len))
168411677aeSAaron LI {
169411677aeSAaron LI if (i == best.base)
170411677aeSAaron LI APPEND_CHAR(':');
171411677aeSAaron LI continue;
172411677aeSAaron LI }
173411677aeSAaron LI
174411677aeSAaron LI /* Are we following an initial run of 0x00s or any real hex?
175411677aeSAaron LI */
176411677aeSAaron LI if (i != 0)
177411677aeSAaron LI APPEND_CHAR(':');
178411677aeSAaron LI
179411677aeSAaron LI /* Is this address an encapsulated IPv4?
180411677aeSAaron LI */
181411677aeSAaron LI if (i == 6 && best.base == 0 &&
182411677aeSAaron LI (best.len == 6 || (best.len == 5 && words[5] == 0xffff)))
183411677aeSAaron LI {
184411677aeSAaron LI if (!addrtostr(srcaddr+12, dp, space_left))
185411677aeSAaron LI {
186411677aeSAaron LI errno = ENOSPC;
187411677aeSAaron LI return (NULL);
188411677aeSAaron LI }
189411677aeSAaron LI added_space = strlen(dp);
190411677aeSAaron LI dp += added_space;
191411677aeSAaron LI space_left -= added_space;
192411677aeSAaron LI break;
193411677aeSAaron LI }
194411677aeSAaron LI snprintfed = snprintf (dp, space_left, "%x", words[i]);
195411677aeSAaron LI if (snprintfed < 0)
196411677aeSAaron LI return (NULL);
197411677aeSAaron LI if ((size_t) snprintfed >= space_left)
198411677aeSAaron LI {
199411677aeSAaron LI errno = ENOSPC;
200411677aeSAaron LI return (NULL);
201411677aeSAaron LI }
202411677aeSAaron LI dp += snprintfed;
203411677aeSAaron LI space_left -= snprintfed;
204411677aeSAaron LI }
205411677aeSAaron LI
206411677aeSAaron LI /* Was it a trailing run of 0x00's?
207411677aeSAaron LI */
208411677aeSAaron LI if (best.base != -1 && (best.base + best.len) == (IN6ADDRSZ / INT16SZ))
209411677aeSAaron LI APPEND_CHAR(':');
210411677aeSAaron LI APPEND_CHAR('\0');
211411677aeSAaron LI
212411677aeSAaron LI return (dst);
213411677aeSAaron LI }
214