1 /* 2 * Copyright (c) 1999 Kungliga Tekniska Högskolan 3 * (Royal Institute of Technology, Stockholm, Sweden). 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions 8 * are met: 9 * 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 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. 16 * 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. 21 * 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. 25 * 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 36 * SUCH DAMAGE. 37 */ 38 39 #ifdef HAVE_CONFIG_H 40 #include "config.h" 41 #endif 42 43 #include <netdissect-stdinc.h> 44 #include "addrtostr.h" 45 46 #include <stdio.h> 47 #include <string.h> 48 49 /* 50 * 51 */ 52 53 #ifndef IN6ADDRSZ 54 #define IN6ADDRSZ 16 /* IPv6 T_AAAA */ 55 #endif 56 57 #ifndef INT16SZ 58 #define INT16SZ 2 /* word size */ 59 #endif 60 61 const char * 62 addrtostr (const void *src, char *dst, size_t size) 63 { 64 const u_char *srcaddr = (const u_char *)src; 65 const char digits[] = "0123456789"; 66 int i; 67 const char *orig_dst = dst; 68 69 if (size < INET_ADDRSTRLEN) { 70 errno = ENOSPC; 71 return NULL; 72 } 73 for (i = 0; i < 4; ++i) { 74 int n = *srcaddr++; 75 int non_zerop = 0; 76 77 if (non_zerop || n / 100 > 0) { 78 *dst++ = digits[n / 100]; 79 n %= 100; 80 non_zerop = 1; 81 } 82 if (non_zerop || n / 10 > 0) { 83 *dst++ = digits[n / 10]; 84 n %= 10; 85 non_zerop = 1; 86 } 87 *dst++ = digits[n]; 88 if (i != 3) 89 *dst++ = '.'; 90 } 91 *dst++ = '\0'; 92 return orig_dst; 93 } 94 95 /* 96 * Convert IPv6 binary address into presentation (printable) format. 97 */ 98 const char * 99 addrtostr6 (const void *src, char *dst, size_t size) 100 { 101 /* 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. 107 */ 108 const u_char *srcaddr = (const u_char *)src; 109 char *dp; 110 size_t space_left, added_space; 111 int snprintfed; 112 struct { 113 long base; 114 long len; 115 } best, cur; 116 u_long words [IN6ADDRSZ / INT16SZ]; 117 int i; 118 119 /* Preprocess: 120 * Copy the input (bytewise) array into a wordwise array. 121 * Find the longest run of 0x00's in src[] for :: shorthanding. 122 */ 123 memset (words, 0, sizeof(words)); 124 for (i = 0; i < IN6ADDRSZ; i++) 125 words[i/2] |= (srcaddr[i] << ((1 - (i % 2)) << 3)); 126 127 best.len = 0; 128 best.base = -1; 129 cur.len = 0; 130 cur.base = -1; 131 for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) 132 { 133 if (words[i] == 0) 134 { 135 if (cur.base == -1) 136 cur.base = i, cur.len = 1; 137 else cur.len++; 138 } 139 else if (cur.base != -1) 140 { 141 if (best.base == -1 || cur.len > best.len) 142 best = cur; 143 cur.base = -1; 144 } 145 } 146 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len)) 147 best = cur; 148 if (best.base != -1 && best.len < 2) 149 best.base = -1; 150 151 /* Format the result. 152 */ 153 dp = dst; 154 space_left = size; 155 #define APPEND_CHAR(c) \ 156 { \ 157 if (space_left == 0) { \ 158 errno = ENOSPC; \ 159 return (NULL); \ 160 } \ 161 *dp++ = c; \ 162 space_left--; \ 163 } 164 for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) 165 { 166 /* Are we inside the best run of 0x00's? 167 */ 168 if (best.base != -1 && i >= best.base && i < (best.base + best.len)) 169 { 170 if (i == best.base) 171 APPEND_CHAR(':'); 172 continue; 173 } 174 175 /* Are we following an initial run of 0x00s or any real hex? 176 */ 177 if (i != 0) 178 APPEND_CHAR(':'); 179 180 /* Is this address an encapsulated IPv4? 181 */ 182 if (i == 6 && best.base == 0 && 183 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) 184 { 185 if (!addrtostr(srcaddr+12, dp, space_left)) 186 { 187 errno = ENOSPC; 188 return (NULL); 189 } 190 added_space = strlen(dp); 191 dp += added_space; 192 space_left -= added_space; 193 break; 194 } 195 snprintfed = snprintf (dp, space_left, "%lx", words[i]); 196 if (snprintfed < 0) 197 return (NULL); 198 if ((size_t) snprintfed >= space_left) 199 { 200 errno = ENOSPC; 201 return (NULL); 202 } 203 dp += snprintfed; 204 space_left -= snprintfed; 205 } 206 207 /* Was it a trailing run of 0x00's? 208 */ 209 if (best.base != -1 && (best.base + best.len) == (IN6ADDRSZ / INT16SZ)) 210 APPEND_CHAR(':'); 211 APPEND_CHAR('\0'); 212 213 return (dst); 214 } 215