inet_ntop.c 4.68 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
/* Copyright (c) 1996 by Internet Software Consortium.
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
 * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
 * 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
 * SOFTWARE.
 */

17
#include "config.h"
18 19 20 21 22 23 24

#include <ctype.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

25
#include <sys/types.h>
26

27
#include "sofia-sip/su.h"
28 29 30 31 32 33 34

/*
 * 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.
 */

static const char *inet_ntop4(const unsigned char *src, char *dst, size_t size);
35
#if HAVE_SIN6
36
static const char *inet_ntop6(const unsigned char *src, char *dst, size_t size);
37
#endif
38 39 40 41 42 43 44 45 46 47

/* char *
 * inet_ntop(af, src, dst, size)
 *	convert a network format address to presentation format.
 * return:
 *	pointer to presentation format address (`dst'), or NULL (see errno).
 * author:
 *	Paul Vixie, 1996.
 */
const char *
Michael Jerris's avatar
Michael Jerris committed
48
su_inet_ntop(int af, void const *src, char *dst, size_t size)
49 50 51 52
{

	switch (af) {
	case AF_INET:
53 54
		return inet_ntop4(src, dst, size);
#if HAVE_SIN6
55
	case AF_INET6:
56
		return inet_ntop6(src, dst, size);
57 58
#endif
	default:
59 60
		su_seterrno(EAFNOSUPPORT);
		return NULL;
61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81
	}
	/* NOTREACHED */
}

/* const char *
 * inet_ntop4(src, dst, size)
 *	format an IPv4 address, more or less like inet_ntoa()
 * return:
 *	`dst' (as a const)
 * notes:
 *	(1) uses no statics
 *	(2) takes a unsigned char* not an in_addr as input
 * author:
 *	Paul Vixie, 1996.
 */
static const char *
inet_ntop4(const unsigned char *src, char *dst, size_t size)
{
	static const char fmt[] = "%u.%u.%u.%u";
	char tmp[sizeof "255.255.255.255"];

Michael Jerris's avatar
Michael Jerris committed
82
	if (snprintf(tmp, sizeof tmp, fmt,
83
		     src[0], src[1], src[2], src[3]) >= size) {
84 85
		su_seterrno(ENOSPC);
		return NULL;
86
	}
87 88

	return strcpy(dst, tmp);
89 90
}

91
#if HAVE_SIN6
92 93 94 95 96 97 98
/* const char *
 * inet_ntop6(src, dst, size)
 *	convert IPv6 binary address into presentation (printable) format
 * author:
 *	Paul Vixie, 1996.
 */
static const char *
99
inet_ntop6(unsigned char const *src, char *dst, size_t size)
100 101 102 103 104 105 106 107 108
{
	/*
	 * 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[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp;
109
	struct { int base, len; } best = { -1 , 0 }, cur = { -1, 0 };
110
	unsigned int words[8];
111 112 113 114 115 116 117
	int i;

	/*
	 * Preprocess:
	 *	Copy the input (bytewise) array into a wordwise array.
	 *	Find the longest run of 0x00's in src[] for :: shorthanding.
	 */
118 119
	for (i = 0; i < 16; i += 2)
		words[i / 2] = (src[i] << 8) | (src[i + 1]);
120 121
	best.base = -1;
	cur.base = -1;
122
	for (i = 0; i < 8; i++) {
123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146
		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) {
		if (best.base == -1 || cur.len > best.len)
			best = cur;
	}
	if (best.base != -1 && best.len < 2)
		best.base = -1;

	/*
	 * Format the result.
	 */
	tp = tmp;
147
	for (i = 0; i < 8; i++) {
148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165
		/* 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_ntop4(src+12, tp, sizeof tmp - (tp - tmp)))
				return (NULL);
			tp += strlen(tp);
			break;
		}
166
		tp += sprintf(tp, "%x", words[i]);
167 168
	}
	/* Was it a trailing run of 0x00's? */
169
	if (best.base != -1 && (best.base + best.len) == 8)
170 171 172 173 174 175
		*tp++ = ':';
	*tp++ = '\0';

	/*
	 * Check for overflow, copy, and we're done.
	 */
176
	if ((size_t)(tp - tmp) >= size) {
177 178
		su_seterrno(ENOSPC);
		return NULL;
179 180
	}

181 182
	return strcpy(dst, tmp);
}
183
#endif