//==========================================================================
|
//==========================================================================
|
//
|
//
|
// src/inet_ntop.c
|
// src/inet_ntop.c
|
//
|
//
|
//==========================================================================
|
//==========================================================================
|
//####BSDCOPYRIGHTBEGIN####
|
//####BSDCOPYRIGHTBEGIN####
|
//
|
//
|
// -------------------------------------------
|
// -------------------------------------------
|
//
|
//
|
// Portions of this software may have been derived from OpenBSD,
|
// Portions of this software may have been derived from OpenBSD,
|
// FreeBSD or other sources, and are covered by the appropriate
|
// FreeBSD or other sources, and are covered by the appropriate
|
// copyright disclaimers included herein.
|
// copyright disclaimers included herein.
|
//
|
//
|
// Portions created by Red Hat are
|
// Portions created by Red Hat are
|
// Copyright (C) 2002 Red Hat, Inc. All Rights Reserved.
|
// Copyright (C) 2002 Red Hat, Inc. All Rights Reserved.
|
//
|
//
|
// -------------------------------------------
|
// -------------------------------------------
|
//
|
//
|
//####BSDCOPYRIGHTEND####
|
//####BSDCOPYRIGHTEND####
|
//==========================================================================
|
//==========================================================================
|
|
|
/* $OpenBSD: inet_ntop.c,v 1.1 1997/03/13 19:07:32 downsj Exp $ */
|
/* $OpenBSD: inet_ntop.c,v 1.1 1997/03/13 19:07:32 downsj Exp $ */
|
|
|
/* Copyright (c) 1996 by Internet Software Consortium.
|
/* Copyright (c) 1996 by Internet Software Consortium.
|
*
|
*
|
* Permission to use, copy, modify, and distribute this software for any
|
* Permission to use, copy, modify, and distribute this software for any
|
* purpose with or without fee is hereby granted, provided that the above
|
* purpose with or without fee is hereby granted, provided that the above
|
* copyright notice and this permission notice appear in all copies.
|
* copyright notice and this permission notice appear in all copies.
|
*
|
*
|
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
|
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
|
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
|
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
|
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
* SOFTWARE.
|
* SOFTWARE.
|
*/
|
*/
|
|
|
#include <sys/param.h>
|
#include <sys/param.h>
|
#include <sys/types.h>
|
#include <sys/types.h>
|
#include <sys/socket.h>
|
#include <sys/socket.h>
|
#include <netinet/in.h>
|
#include <netinet/in.h>
|
#include <arpa/inet.h>
|
#include <arpa/inet.h>
|
#include <arpa/nameser.h>
|
#include <arpa/nameser.h>
|
#include <string.h>
|
#include <string.h>
|
#include <errno.h>
|
#include <errno.h>
|
#ifndef CYGPKG_NET_FREEBSD_STACK
|
#ifndef CYGPKG_NET_FREEBSD_STACK
|
#include <stdio.h>
|
#include <stdio.h>
|
#endif
|
#endif
|
|
|
#ifndef IN6ADDRSZ
|
#ifndef IN6ADDRSZ
|
#define IN6ADDRSZ 16 /* IPv6 T_AAAA */
|
#define IN6ADDRSZ 16 /* IPv6 T_AAAA */
|
#endif
|
#endif
|
#ifndef INT16SZ
|
#ifndef INT16SZ
|
#define INT16SZ sizeof(u_int16_t)
|
#define INT16SZ sizeof(u_int16_t)
|
#endif
|
#endif
|
|
|
/*
|
/*
|
* WARNING: Don't even consider trying to compile this on a system where
|
* WARNING: Don't even consider trying to compile this on a system where
|
* sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
|
* sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
|
*/
|
*/
|
|
|
static const char *inet_ntop4 __P((const u_char *src, char *dst, size_t size));
|
static const char *inet_ntop4 __P((const u_char *src, char *dst, size_t size));
|
#ifdef CYGPKG_NET_INET6
|
#ifdef CYGPKG_NET_INET6
|
static const char *inet_ntop6 __P((const u_char *src, char *dst, size_t size));
|
static const char *inet_ntop6 __P((const u_char *src, char *dst, size_t size));
|
#endif
|
#endif
|
|
|
/* char *
|
/* char *
|
* inet_ntop(af, src, dst, size)
|
* inet_ntop(af, src, dst, size)
|
* convert a network format address to presentation format.
|
* convert a network format address to presentation format.
|
* return:
|
* return:
|
* pointer to presentation format address (`dst'), or NULL (see errno).
|
* pointer to presentation format address (`dst'), or NULL (see errno).
|
* author:
|
* author:
|
* Paul Vixie, 1996.
|
* Paul Vixie, 1996.
|
*/
|
*/
|
const char *
|
const char *
|
inet_ntop(int af, const void *src, char *dst, size_t size)
|
inet_ntop(int af, const void *src, char *dst, size_t size)
|
{
|
{
|
switch (af) {
|
switch (af) {
|
case AF_INET:
|
case AF_INET:
|
return (inet_ntop4(src, dst, size));
|
return (inet_ntop4(src, dst, size));
|
#ifdef CYGPKG_NET_INET6
|
#ifdef CYGPKG_NET_INET6
|
case AF_INET6:
|
case AF_INET6:
|
return (inet_ntop6(src, dst, size));
|
return (inet_ntop6(src, dst, size));
|
#endif
|
#endif
|
default:
|
default:
|
errno = EAFNOSUPPORT;
|
errno = EAFNOSUPPORT;
|
return (NULL);
|
return (NULL);
|
}
|
}
|
/* NOTREACHED */
|
/* NOTREACHED */
|
}
|
}
|
|
|
//
|
//
|
// A more useful conversion routine
|
// A more useful conversion routine
|
// Convert a network [socket] address to presentation format
|
// Convert a network [socket] address to presentation format
|
// This routine handles all of the mapping required and isolates
|
// This routine handles all of the mapping required and isolates
|
// the knowledge of the structure format.
|
// the knowledge of the structure format.
|
//
|
//
|
const char *
|
const char *
|
_inet_ntop(struct sockaddr *sa, char *dst, size_t size)
|
_inet_ntop(struct sockaddr *sa, char *dst, size_t size)
|
{
|
{
|
switch (sa->sa_family) {
|
switch (sa->sa_family) {
|
case AF_INET:
|
case AF_INET:
|
return (inet_ntop(AF_INET, (char *)&((struct sockaddr_in *)sa)->sin_addr,
|
return (inet_ntop(AF_INET, (char *)&((struct sockaddr_in *)sa)->sin_addr,
|
dst, size));
|
dst, size));
|
#ifdef CYGPKG_NET_INET6
|
#ifdef CYGPKG_NET_INET6
|
case AF_INET6:
|
case AF_INET6:
|
return (inet_ntop(AF_INET6, (char *)&((struct sockaddr_in6 *)sa)->sin6_addr,
|
return (inet_ntop(AF_INET6, (char *)&((struct sockaddr_in6 *)sa)->sin6_addr,
|
dst, size));
|
dst, size));
|
#endif
|
#endif
|
default:
|
default:
|
errno = EAFNOSUPPORT;
|
errno = EAFNOSUPPORT;
|
return (NULL);
|
return (NULL);
|
}
|
}
|
}
|
}
|
|
|
u_int16_t
|
u_int16_t
|
_inet_port(struct sockaddr *sa)
|
_inet_port(struct sockaddr *sa)
|
{
|
{
|
switch (sa->sa_family) {
|
switch (sa->sa_family) {
|
case AF_INET:
|
case AF_INET:
|
return (ntohs(((struct sockaddr_in *)sa)->sin_port));
|
return (ntohs(((struct sockaddr_in *)sa)->sin_port));
|
#ifdef CYGPKG_NET_INET6
|
#ifdef CYGPKG_NET_INET6
|
case AF_INET6:
|
case AF_INET6:
|
return (ntohs(((struct sockaddr_in6 *)sa)->sin6_port));
|
return (ntohs(((struct sockaddr_in6 *)sa)->sin6_port));
|
#endif
|
#endif
|
default:
|
default:
|
return 0; // Unknown!
|
return 0; // Unknown!
|
}
|
}
|
}
|
}
|
|
|
/* const char *
|
/* const char *
|
* inet_ntop4(src, dst, size)
|
* inet_ntop4(src, dst, size)
|
* format an IPv4 address, more or less like inet_ntoa()
|
* format an IPv4 address, more or less like inet_ntoa()
|
* return:
|
* return:
|
* `dst' (as a const)
|
* `dst' (as a const)
|
* notes:
|
* notes:
|
* (1) uses no statics
|
* (1) uses no statics
|
* (2) takes a u_char* not an in_addr as input
|
* (2) takes a u_char* not an in_addr as input
|
* author:
|
* author:
|
* Paul Vixie, 1996.
|
* Paul Vixie, 1996.
|
*/
|
*/
|
static const char *
|
static const char *
|
inet_ntop4(src, dst, size)
|
inet_ntop4(src, dst, size)
|
const u_char *src;
|
const u_char *src;
|
char *dst;
|
char *dst;
|
size_t size;
|
size_t size;
|
{
|
{
|
static const char fmt[] = "%u.%u.%u.%u";
|
static const char fmt[] = "%u.%u.%u.%u";
|
char tmp[sizeof "255.255.255.255"];
|
char tmp[sizeof "255.255.255.255"];
|
|
|
if (sprintf(tmp, fmt, src[0], src[1], src[2], src[3]) > size) {
|
if (sprintf(tmp, fmt, src[0], src[1], src[2], src[3]) > size) {
|
errno = ENOSPC;
|
errno = ENOSPC;
|
return (NULL);
|
return (NULL);
|
}
|
}
|
strcpy(dst, tmp);
|
strcpy(dst, tmp);
|
return (dst);
|
return (dst);
|
}
|
}
|
|
|
#ifdef CYGPKG_NET_INET6
|
#ifdef CYGPKG_NET_INET6
|
/* const char *
|
/* const char *
|
* inet_ntop6(src, dst, size)
|
* inet_ntop6(src, dst, size)
|
* convert IPv6 binary address into presentation (printable) format
|
* convert IPv6 binary address into presentation (printable) format
|
* author:
|
* author:
|
* Paul Vixie, 1996.
|
* Paul Vixie, 1996.
|
*/
|
*/
|
static const char *
|
static const char *
|
inet_ntop6(const u_char *src, char *dst, size_t size)
|
inet_ntop6(const u_char *src, char *dst, size_t size)
|
{
|
{
|
/*
|
/*
|
* Note that int32_t and int16_t need only be "at least" large enough
|
* 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
|
* 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.
|
* 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
|
* Keep this in mind if you think this function should have been coded
|
* to use pointer overlays. All the world's not a VAX.
|
* to use pointer overlays. All the world's not a VAX.
|
*/
|
*/
|
#if 0 // This is too optimistic
|
#if 0 // This is too optimistic
|
char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp;
|
char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp;
|
#else
|
#else
|
char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff"], *tp;
|
char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff"], *tp;
|
#endif
|
#endif
|
struct { int base, len; } best, cur;
|
struct { int base, len; } best, cur;
|
u_int words[IN6ADDRSZ / INT16SZ];
|
u_int words[IN6ADDRSZ / INT16SZ];
|
int i;
|
int i;
|
|
|
/*
|
/*
|
* Preprocess:
|
* Preprocess:
|
* Copy the input (bytewise) array into a wordwise array.
|
* Copy the input (bytewise) array into a wordwise array.
|
* Find the longest run of 0x00's in src[] for :: shorthanding.
|
* Find the longest run of 0x00's in src[] for :: shorthanding.
|
*/
|
*/
|
memset(words, '\0', sizeof words);
|
memset(words, '\0', sizeof words);
|
for (i = 0; i < IN6ADDRSZ; i++)
|
for (i = 0; i < IN6ADDRSZ; i++)
|
words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
|
words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
|
best.base = -1;
|
best.base = -1;
|
cur.base = -1;
|
cur.base = -1;
|
for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) {
|
for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) {
|
if (words[i] == 0) {
|
if (words[i] == 0) {
|
if (cur.base == -1)
|
if (cur.base == -1)
|
cur.base = i, cur.len = 1;
|
cur.base = i, cur.len = 1;
|
else
|
else
|
cur.len++;
|
cur.len++;
|
} else {
|
} else {
|
if (cur.base != -1) {
|
if (cur.base != -1) {
|
if (best.base == -1 || cur.len > best.len)
|
if (best.base == -1 || cur.len > best.len)
|
best = cur;
|
best = cur;
|
cur.base = -1;
|
cur.base = -1;
|
}
|
}
|
}
|
}
|
}
|
}
|
if (cur.base != -1) {
|
if (cur.base != -1) {
|
if (best.base == -1 || cur.len > best.len)
|
if (best.base == -1 || cur.len > best.len)
|
best = cur;
|
best = cur;
|
}
|
}
|
if (best.base != -1 && best.len < 2)
|
if (best.base != -1 && best.len < 2)
|
best.base = -1;
|
best.base = -1;
|
|
|
/*
|
/*
|
* Format the result.
|
* Format the result.
|
*/
|
*/
|
tp = tmp;
|
tp = tmp;
|
for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) {
|
for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) {
|
/* Are we inside the best run of 0x00's? */
|
/* Are we inside the best run of 0x00's? */
|
if (best.base != -1 && i >= best.base &&
|
if (best.base != -1 && i >= best.base &&
|
i < (best.base + best.len)) {
|
i < (best.base + best.len)) {
|
if (i == best.base)
|
if (i == best.base)
|
*tp++ = ':';
|
*tp++ = ':';
|
continue;
|
continue;
|
}
|
}
|
/* Are we following an initial run of 0x00s or any real hex? */
|
/* Are we following an initial run of 0x00s or any real hex? */
|
if (i != 0)
|
if (i != 0)
|
*tp++ = ':';
|
*tp++ = ':';
|
/* Is this address an encapsulated IPv4? */
|
/* Is this address an encapsulated IPv4? */
|
if (i == 6 && best.base == 0 &&
|
if (i == 6 && best.base == 0 &&
|
(best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
|
(best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
|
if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp)))
|
if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp)))
|
return (NULL);
|
return (NULL);
|
tp += strlen(tp);
|
tp += strlen(tp);
|
break;
|
break;
|
}
|
}
|
tp += sprintf(tp, "%x", words[i]);
|
tp += sprintf(tp, "%x", words[i]);
|
}
|
}
|
/* Was it a trailing run of 0x00's? */
|
/* Was it a trailing run of 0x00's? */
|
if (best.base != -1 && (best.base + best.len) == (IN6ADDRSZ / INT16SZ))
|
if (best.base != -1 && (best.base + best.len) == (IN6ADDRSZ / INT16SZ))
|
*tp++ = ':';
|
*tp++ = ':';
|
*tp++ = '\0';
|
*tp++ = '\0';
|
|
|
/*
|
/*
|
* Check for overflow, copy, and we're done.
|
* Check for overflow, copy, and we're done.
|
*/
|
*/
|
if ((size_t)(tp - tmp) > size) {
|
if ((size_t)(tp - tmp) > size) {
|
errno = ENOSPC;
|
errno = ENOSPC;
|
return (NULL);
|
return (NULL);
|
}
|
}
|
strcpy(dst, tmp);
|
strcpy(dst, tmp);
|
return (dst);
|
return (dst);
|
}
|
}
|
#endif
|
#endif
|
|
|
