Home | History | Annotate | Line # | Download | only in inet
inet_ntop.c revision 1.11
      1 /*	$NetBSD: inet_ntop.c,v 1.11 2014/02/10 16:30:54 christos Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
      5  * Copyright (c) 1996-1999 by Internet Software Consortium.
      6  *
      7  * Permission to use, copy, modify, and distribute this software for any
      8  * purpose with or without fee is hereby granted, provided that the above
      9  * copyright notice and this permission notice appear in all copies.
     10  *
     11  * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
     12  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
     13  * MERCHANTABILITY AND FITNESS.  IN NO EVENT SHALL ISC BE LIABLE FOR
     14  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
     15  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
     16  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
     17  * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
     18  */
     19 
     20 #include <sys/cdefs.h>
     21 #if defined(LIBC_SCCS) && !defined(lint)
     22 #if 0
     23 static const char rcsid[] = "Id: inet_ntop.c,v 1.5 2005/11/03 22:59:52 marka Exp";
     24 #else
     25 __RCSID("$NetBSD: inet_ntop.c,v 1.11 2014/02/10 16:30:54 christos Exp $");
     26 #endif
     27 #endif /* LIBC_SCCS and not lint */
     28 
     29 #include "port_before.h"
     30 
     31 #include "namespace.h"
     32 #include <sys/param.h>
     33 #include <sys/types.h>
     34 #include <sys/socket.h>
     35 
     36 #include <netinet/in.h>
     37 #include <arpa/inet.h>
     38 #include <arpa/nameser.h>
     39 
     40 #include <assert.h>
     41 #include <errno.h>
     42 #include <stdio.h>
     43 #include <stdlib.h>
     44 #include <string.h>
     45 
     46 #include "port_after.h"
     47 
     48 #ifdef __weak_alias
     49 __weak_alias(inet_ntop,_inet_ntop)
     50 #endif
     51 
     52 /*%
     53  * WARNING: Don't even consider trying to compile this on a system where
     54  * sizeof(int) < 4.  sizeof(int) > 4 is fine; all the world's not a VAX.
     55  */
     56 
     57 static const char *inet_ntop4(const u_char *src, char *dst, socklen_t size);
     58 static const char *inet_ntop6(const u_char *src, char *dst, socklen_t size);
     59 
     60 /* char *
     61  * inet_ntop(af, src, dst, size)
     62  *	convert a network format address to presentation format.
     63  * return:
     64  *	pointer to presentation format address (`dst'), or NULL (see errno).
     65  * author:
     66  *	Paul Vixie, 1996.
     67  */
     68 const char *
     69 inet_ntop(int af, const void *src, char *dst, socklen_t size)
     70 {
     71 
     72 	_DIAGASSERT(src != NULL);
     73 	_DIAGASSERT(dst != NULL);
     74 
     75 	switch (af) {
     76 	case AF_INET:
     77 		return inet_ntop4(src, dst, size);
     78 	case AF_INET6:
     79 		return inet_ntop6(src, dst, size);
     80 	default:
     81 		errno = EAFNOSUPPORT;
     82 		return NULL;
     83 	}
     84 	/* NOTREACHED */
     85 }
     86 
     87 /* const char *
     88  * inet_ntop4(src, dst, size)
     89  *	format an IPv4 address, more or less like inet_ntoa()
     90  * return:
     91  *	`dst' (as a const)
     92  * notes:
     93  *	(1) uses no statics
     94  *	(2) takes a u_char* not an in_addr as input
     95  * author:
     96  *	Paul Vixie, 1996.
     97  */
     98 static const char *
     99 inet_ntop4(const u_char *src, char *dst, socklen_t size)
    100 {
    101 	char tmp[sizeof "255.255.255.255"];
    102 	int l;
    103 
    104 	_DIAGASSERT(src != NULL);
    105 	_DIAGASSERT(dst != NULL);
    106 
    107 	l = snprintf(tmp, sizeof(tmp), "%u.%u.%u.%u",
    108 	    src[0], src[1], src[2], src[3]);
    109 	if (l <= 0 || (socklen_t) l >= size)
    110 		return NULL;
    111 	strlcpy(dst, tmp, size);
    112 	return dst;
    113 }
    114 
    115 /* const char *
    116  * inet_ntop6(src, dst, size)
    117  *	convert IPv6 binary address into presentation (printable) format
    118  * author:
    119  *	Paul Vixie, 1996.
    120  */
    121 static const char *
    122 inet_ntop6(const u_char *src, char *dst, socklen_t size)
    123 {
    124 	/*
    125 	 * Note that int32_t and int16_t need only be "at least" large enough
    126 	 * to contain a value of the specified size.  On some systems, like
    127 	 * Crays, there is no such thing as an integer variable with 16 bits.
    128 	 * Keep this in mind if you think this function should have been coded
    129 	 * to use pointer overlays.  All the world's not a VAX.
    130 	 */
    131 	char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"];
    132 	char *tp, *ep;
    133 	struct { int base, len; } best, cur;
    134 	u_int words[NS_IN6ADDRSZ / NS_INT16SZ];
    135 	int i;
    136 	int advance;
    137 
    138 	_DIAGASSERT(src != NULL);
    139 	_DIAGASSERT(dst != NULL);
    140 
    141 	/*
    142 	 * Preprocess:
    143 	 *	Copy the input (bytewise) array into a wordwise array.
    144 	 *	Find the longest run of 0x00's in src[] for :: shorthanding.
    145 	 */
    146 	memset(words, '\0', sizeof words);
    147 	for (i = 0; i < NS_IN6ADDRSZ; i++)
    148 		words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
    149 	best.base = -1;
    150 	best.len = 0;
    151 	cur.base = -1;
    152 	cur.len = 0;
    153 	for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
    154 		if (words[i] == 0) {
    155 			if (cur.base == -1)
    156 				cur.base = i, cur.len = 1;
    157 			else
    158 				cur.len++;
    159 		} else {
    160 			if (cur.base != -1) {
    161 				if (best.base == -1 || cur.len > best.len)
    162 					best = cur;
    163 				cur.base = -1;
    164 			}
    165 		}
    166 	}
    167 	if (cur.base != -1) {
    168 		if (best.base == -1 || cur.len > best.len)
    169 			best = cur;
    170 	}
    171 	if (best.base != -1 && best.len < 2)
    172 		best.base = -1;
    173 
    174 	/*
    175 	 * Format the result.
    176 	 */
    177 	tp = tmp;
    178 	ep = tmp + sizeof(tmp);
    179 	for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
    180 		/* Are we inside the best run of 0x00's? */
    181 		if (best.base != -1 && i >= best.base &&
    182 		    i < (best.base + best.len)) {
    183 			if (i == best.base)
    184 				*tp++ = ':';
    185 			continue;
    186 		}
    187 		/* Are we following an initial run of 0x00s or any real hex? */
    188 		if (i != 0) {
    189 			if (tp + 1 >= ep)
    190 				goto out;
    191 			*tp++ = ':';
    192 		}
    193 		/* Is this address an encapsulated IPv4? */
    194 		if (i == 6 && best.base == 0 &&
    195 		    (best.len == 6 ||
    196 		    (best.len == 7 && words[7] != 0x0001) ||
    197 		    (best.len == 5 && words[5] == 0xffff))) {
    198 			if (!inet_ntop4(src + 12, tp, (socklen_t)(ep - tp)))
    199 				goto out;
    200 			tp += strlen(tp);
    201 			break;
    202 		}
    203 		advance = snprintf(tp, (size_t)(ep - tp), "%x", words[i]);
    204 		if (advance <= 0 || advance >= ep - tp)
    205 			goto out;
    206 		tp += advance;
    207 	}
    208 	/* Was it a trailing run of 0x00's? */
    209 	if (best.base != -1 && (best.base + best.len) ==
    210 	    (NS_IN6ADDRSZ / NS_INT16SZ)) {
    211 		if (tp + 1 >= ep)
    212 			goto out;
    213 		*tp++ = ':';
    214 	}
    215 	if (tp + 1 >= ep)
    216 		goto out;
    217 	*tp++ = '\0';
    218 
    219 	/*
    220 	 * Check for overflow, copy, and we're done.
    221 	 */
    222 	if ((size_t)(tp - tmp) > size)
    223 		goto out;
    224 	strlcpy(dst, tmp, size);
    225 	return dst;
    226 out:
    227 	errno = ENOSPC;
    228 	return NULL;
    229 }
    230 
    231 /*! \file */
    232