2 * Copyright (c) 1999 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the Kungliga Tekniska
20 * Högskolan and its contributors.
22 * 4. Neither the name of the Institute nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 #include <netdissect-stdinc.h>
44 #include "addrtostr.h"
54 #define IN6ADDRSZ 16 /* IPv6 T_AAAA */
58 #define INT16SZ 2 /* word size */
62 addrtostr (const void *src, char *dst, size_t size)
64 const u_char *srcaddr = (const u_char *)src;
65 const char digits[] = "0123456789";
67 const char *orig_dst = dst;
69 if (size < INET_ADDRSTRLEN) {
73 for (i = 0; i < 4; ++i) {
77 if (non_zerop || n / 100 > 0) {
78 *dst++ = digits[n / 100];
82 if (non_zerop || n / 10 > 0) {
83 *dst++ = digits[n / 10];
96 * Convert IPv6 binary address into presentation (printable) format.
99 addrtostr6 (const void *src, char *dst, size_t size)
102 * Note that int32_t and int16_t need only be "at least" large enough
103 * to contain a value of the specified size. On some systems, like
104 * Crays, there is no such thing as an integer variable with 16 bits.
105 * Keep this in mind if you think this function should have been coded
106 * to use pointer overlays. All the world's not a VAX.
108 const u_char *srcaddr = (const u_char *)src;
110 size_t space_left, added_space;
116 u_long words [IN6ADDRSZ / INT16SZ];
120 * Copy the input (bytewise) array into a wordwise array.
121 * Find the longest run of 0x00's in src[] for :: shorthanding.
123 memset (words, 0, sizeof(words));
124 for (i = 0; i < IN6ADDRSZ; i++)
125 words[i/2] |= (srcaddr[i] << ((1 - (i % 2)) << 3));
131 for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++)
136 cur.base = i, cur.len = 1;
139 else if (cur.base != -1)
141 if (best.base == -1 || cur.len > best.len)
146 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len))
148 if (best.base != -1 && best.len < 2)
151 /* Format the result.
155 #define APPEND_CHAR(c) \
157 if (space_left == 0) { \
164 for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++)
166 /* Are we inside the best run of 0x00's?
168 if (best.base != -1 && i >= best.base && i < (best.base + best.len))
175 /* Are we following an initial run of 0x00s or any real hex?
180 /* Is this address an encapsulated IPv4?
182 if (i == 6 && best.base == 0 &&
183 (best.len == 6 || (best.len == 5 && words[5] == 0xffff)))
185 if (!addrtostr(srcaddr+12, dp, space_left))
190 added_space = strlen(dp);
192 space_left -= added_space;
195 snprintfed = snprintf (dp, space_left, "%lx", words[i]);
198 if ((size_t) snprintfed >= space_left)
204 space_left -= snprintfed;
207 /* Was it a trailing run of 0x00's?
209 if (best.base != -1 && (best.base + best.len) == (IN6ADDRSZ / INT16SZ))