2000-01-30 00:45:58 +00:00
|
|
|
|
/*
|
|
|
|
|
* Copyright (c) 1999 Kungliga Tekniska H<EFBFBD>gskolan
|
|
|
|
|
* (Royal Institute of Technology, Stockholm, Sweden).
|
|
|
|
|
* All rights reserved.
|
2004-03-31 09:17:26 +00:00
|
|
|
|
*
|
2000-01-30 00:45:58 +00:00
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
|
* are met:
|
2004-03-31 09:17:26 +00:00
|
|
|
|
*
|
2000-01-30 00:45:58 +00:00
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
2004-03-31 09:17:26 +00:00
|
|
|
|
*
|
2000-01-30 00:45:58 +00:00
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
2004-03-31 09:17:26 +00:00
|
|
|
|
*
|
2000-01-30 00:45:58 +00:00
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
|
* This product includes software developed by the Kungliga Tekniska
|
|
|
|
|
* H<EFBFBD>gskolan and its contributors.
|
2004-03-31 09:17:26 +00:00
|
|
|
|
*
|
2000-01-30 00:45:58 +00:00
|
|
|
|
* 4. Neither the name of the Institute nor the names of its contributors
|
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
|
* without specific prior written permission.
|
2004-03-31 09:17:26 +00:00
|
|
|
|
*
|
2000-01-30 00:45:58 +00:00
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
|
*/
|
|
|
|
|
|
2015-01-06 19:03:11 +00:00
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
|
#include "config.h"
|
2000-01-30 00:45:58 +00:00
|
|
|
|
#endif
|
|
|
|
|
|
2004-03-31 09:17:26 +00:00
|
|
|
|
#include <tcpdump-stdinc.h>
|
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
|
2005-05-29 18:24:21 +00:00
|
|
|
|
#ifndef IN6ADDRSZ
|
|
|
|
|
#define IN6ADDRSZ 16 /* IPv6 T_AAAA */
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifndef INT16SZ
|
|
|
|
|
#define INT16SZ 2 /* word size */
|
2000-01-30 00:45:58 +00:00
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
static const char *
|
|
|
|
|
inet_ntop_v4 (const void *src, char *dst, size_t size)
|
|
|
|
|
{
|
|
|
|
|
const char digits[] = "0123456789";
|
|
|
|
|
int i;
|
|
|
|
|
struct in_addr *addr = (struct in_addr *)src;
|
|
|
|
|
u_long a = ntohl(addr->s_addr);
|
|
|
|
|
const char *orig_dst = dst;
|
|
|
|
|
|
|
|
|
|
if (size < INET_ADDRSTRLEN) {
|
|
|
|
|
errno = ENOSPC;
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
for (i = 0; i < 4; ++i) {
|
|
|
|
|
int n = (a >> (24 - i * 8)) & 0xFF;
|
|
|
|
|
int non_zerop = 0;
|
|
|
|
|
|
|
|
|
|
if (non_zerop || n / 100 > 0) {
|
|
|
|
|
*dst++ = digits[n / 100];
|
|
|
|
|
n %= 100;
|
|
|
|
|
non_zerop = 1;
|
|
|
|
|
}
|
|
|
|
|
if (non_zerop || n / 10 > 0) {
|
|
|
|
|
*dst++ = digits[n / 10];
|
|
|
|
|
n %= 10;
|
|
|
|
|
non_zerop = 1;
|
|
|
|
|
}
|
|
|
|
|
*dst++ = digits[n];
|
|
|
|
|
if (i != 3)
|
|
|
|
|
*dst++ = '.';
|
|
|
|
|
}
|
|
|
|
|
*dst++ = '\0';
|
|
|
|
|
return orig_dst;
|
|
|
|
|
}
|
|
|
|
|
|
2005-05-29 18:24:21 +00:00
|
|
|
|
#ifdef INET6
|
|
|
|
|
/*
|
|
|
|
|
* Convert IPv6 binary address into presentation (printable) format.
|
|
|
|
|
*/
|
|
|
|
|
static const char *
|
|
|
|
|
inet_ntop_v6 (const u_char *src, char *dst, size_t size)
|
|
|
|
|
{
|
|
|
|
|
/*
|
|
|
|
|
* Note that int32_t and int16_t need only be "at least" large enough
|
|
|
|
|
* to contain a value of the specified size. On some systems, like
|
|
|
|
|
* Crays, there is no such thing as an integer variable with 16 bits.
|
|
|
|
|
* Keep this in mind if you think this function should have been coded
|
|
|
|
|
* to use pointer overlays. All the world's not a VAX.
|
|
|
|
|
*/
|
|
|
|
|
char tmp [INET6_ADDRSTRLEN+1];
|
|
|
|
|
char *tp;
|
|
|
|
|
struct {
|
|
|
|
|
long base;
|
|
|
|
|
long len;
|
|
|
|
|
} best, cur;
|
|
|
|
|
u_long words [IN6ADDRSZ / INT16SZ];
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
/* Preprocess:
|
|
|
|
|
* Copy the input (bytewise) array into a wordwise array.
|
|
|
|
|
* Find the longest run of 0x00's in src[] for :: shorthanding.
|
|
|
|
|
*/
|
|
|
|
|
memset (words, 0, sizeof(words));
|
|
|
|
|
for (i = 0; i < IN6ADDRSZ; i++)
|
|
|
|
|
words[i/2] |= (src[i] << ((1 - (i % 2)) << 3));
|
|
|
|
|
|
2015-01-06 19:03:11 +00:00
|
|
|
|
best.len = 0;
|
2005-05-29 18:24:21 +00:00
|
|
|
|
best.base = -1;
|
2015-01-06 19:03:11 +00:00
|
|
|
|
cur.len = 0;
|
2005-05-29 18:24:21 +00:00
|
|
|
|
cur.base = -1;
|
|
|
|
|
for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++)
|
|
|
|
|
{
|
|
|
|
|
if (words[i] == 0)
|
|
|
|
|
{
|
|
|
|
|
if (cur.base == -1)
|
|
|
|
|
cur.base = i, cur.len = 1;
|
|
|
|
|
else cur.len++;
|
|
|
|
|
}
|
|
|
|
|
else if (cur.base != -1)
|
|
|
|
|
{
|
|
|
|
|
if (best.base == -1 || cur.len > best.len)
|
|
|
|
|
best = cur;
|
|
|
|
|
cur.base = -1;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if ((cur.base != -1) && (best.base == -1 || cur.len > best.len))
|
|
|
|
|
best = cur;
|
|
|
|
|
if (best.base != -1 && best.len < 2)
|
|
|
|
|
best.base = -1;
|
|
|
|
|
|
|
|
|
|
/* Format the result.
|
|
|
|
|
*/
|
|
|
|
|
tp = tmp;
|
|
|
|
|
for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++)
|
|
|
|
|
{
|
|
|
|
|
/* Are we inside the best run of 0x00's?
|
|
|
|
|
*/
|
|
|
|
|
if (best.base != -1 && i >= best.base && i < (best.base + best.len))
|
|
|
|
|
{
|
|
|
|
|
if (i == best.base)
|
|
|
|
|
*tp++ = ':';
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Are we following an initial run of 0x00s or any real hex?
|
|
|
|
|
*/
|
|
|
|
|
if (i != 0)
|
|
|
|
|
*tp++ = ':';
|
|
|
|
|
|
|
|
|
|
/* Is this address an encapsulated IPv4?
|
|
|
|
|
*/
|
|
|
|
|
if (i == 6 && best.base == 0 &&
|
|
|
|
|
(best.len == 6 || (best.len == 5 && words[5] == 0xffff)))
|
|
|
|
|
{
|
|
|
|
|
if (!inet_ntop_v4(src+12, tp, sizeof(tmp) - (tp - tmp)))
|
|
|
|
|
{
|
|
|
|
|
errno = ENOSPC;
|
|
|
|
|
return (NULL);
|
|
|
|
|
}
|
|
|
|
|
tp += strlen(tp);
|
|
|
|
|
break;
|
|
|
|
|
}
|
2015-01-06 19:03:11 +00:00
|
|
|
|
tp += sprintf (tp, "%lx", words[i]);
|
2005-05-29 18:24:21 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Was it a trailing run of 0x00's?
|
|
|
|
|
*/
|
|
|
|
|
if (best.base != -1 && (best.base + best.len) == (IN6ADDRSZ / INT16SZ))
|
|
|
|
|
*tp++ = ':';
|
|
|
|
|
*tp++ = '\0';
|
|
|
|
|
|
|
|
|
|
/* Check for overflow, copy, and we're done.
|
|
|
|
|
*/
|
|
|
|
|
if ((size_t)(tp - tmp) > size)
|
|
|
|
|
{
|
|
|
|
|
errno = ENOSPC;
|
|
|
|
|
return (NULL);
|
|
|
|
|
}
|
|
|
|
|
return strcpy (dst, tmp);
|
|
|
|
|
}
|
|
|
|
|
#endif /* INET6 */
|
|
|
|
|
|
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
|
const char *
|
|
|
|
|
inet_ntop(int af, const void *src, char *dst, size_t size)
|
|
|
|
|
{
|
|
|
|
|
switch (af) {
|
|
|
|
|
case AF_INET :
|
|
|
|
|
return inet_ntop_v4 (src, dst, size);
|
2005-05-29 18:24:21 +00:00
|
|
|
|
#ifdef INET6
|
|
|
|
|
case AF_INET6:
|
|
|
|
|
return inet_ntop_v6 ((const u_char*)src, dst, size);
|
|
|
|
|
#endif
|
2000-01-30 00:45:58 +00:00
|
|
|
|
default :
|
|
|
|
|
errno = EAFNOSUPPORT;
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
}
|