nexmon – Blame information for rev 1

Subversion Repositories:
Rev:
Rev Author Line No. Line
1 office 1 #include "inet_aton.h"
2 #ifdef __cplusplus
3 extern "C" {
4 #endif
5  
6 /*
7 * Copyright (C) 1996-2001 Internet Software Consortium.
8 *
9 * Permission to use, copy, modify, and distribute this software for any
10 * purpose with or without fee is hereby granted, provided that the above
11 * copyright notice and this permission notice appear in all copies.
12 *
13 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM
14 * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL
16 * INTERNET SOFTWARE CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT,
17 * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING
18 * FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
19 * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
20 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
21 */
22  
23 #ifndef HAVE_INET_NTOP
24 #define NS_INT16SZ 2
25 #define NS_INADDRSZ 4
26 #define NS_IN6ADDRSZ 16
27  
28 /*
29 * WARNING: Don't even consider trying to compile this on a system where
30 * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
31 */
32  
33  
34 /* char *
35 * isc_net_ntop(af, src, dst, size)
36 * convert a network format address to presentation format.
37 * return:
38 * pointer to presentation format address (`dst'), or NULL (see errno).
39 * author:
40 * Paul Vixie, 1996.
41 */
42 const char*
43 inet_ntop(int af, const void *src, char *dst, socklen_t size) {
44 switch ( af ) {
45 case AF_INET:
46 return(inet_ntop4(src, dst, size));
47 #ifdef HAVE_IPV6
48 case AF_INET6:
49 return(inet_ntop6(src, dst, size));
50 #endif
51 default:
52 return NULL;
53 }
54 /* NOTREACHED */
55 }
56  
57 /* const char *
58 * inet_ntop4(src, dst, size)
59 * format an IPv4 address
60 * return:
61 * `dst' (as a const)
62 * notes:
63 * (1) uses no statics
64 * (2) takes a unsigned char* not an in_addr as input
65 * author:
66 * Paul Vixie, 1996.
67 */
68 const char*
69 inet_ntop4(const unsigned char *src, char *dst, socklen_t size) {
70 static const char *fmt = "%u.%u.%u.%u";
71 char tmp[sizeof "255.255.255.255"];
72  
73 if ( (size_t)sprintf(tmp, fmt, src[0], src[1], src[2], src[3]) >= size ) {
74 return NULL;
75 }
76 strcpy(dst, tmp);
77  
78 return dst;
79 }
80  
81 /* const char *
82 * isc_inet_ntop6(src, dst, size)
83 * convert IPv6 binary address into presentation (printable) format
84 * author:
85 * Paul Vixie, 1996.
86 */
87 #ifdef HAVE_IPV6
88 const char*
89 inet_ntop6(const unsigned char *src, char *dst, socklen_t size) {
90 /*
91 * Note that int32_t and int16_t need only be "at least" large enough
92 * to contain a value of the specified size. On some systems, like
93 * Crays, there is no such thing as an integer variable with 16 bits.
94 * Keep this in mind if you think this function should have been coded
95 * to use pointer overlays. All the world's not a VAX.
96 */
97 char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp;
98 struct {
99 int base, len;
100 } best, cur;
101 unsigned int words[NS_IN6ADDRSZ / NS_INT16SZ];
102 int i;
103  
104 /*
105 * Preprocess:
106 * Copy the input (bytewise) array into a wordwise array.
107 * Find the longest run of 0x00's in src[] for :: shorthanding.
108 */
109 memset(words, '\0', sizeof words);
110 for ( i = 0; i < NS_IN6ADDRSZ; i++ )
111 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
112 best.base = -1;
113 cur.base = -1;
114 for ( i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++ ) {
115 if ( words[i] == 0 ) {
116 if ( cur.base == -1 )
117 cur.base = i, cur.len = 1;
118 else
119 cur.len++;
120 } else {
121 if ( cur.base != -1 ) {
122 if ( best.base == -1 || cur.len > best.len )
123 best = cur;
124 cur.base = -1;
125 }
126 }
127 }
128 if ( cur.base != -1 ) {
129 if ( best.base == -1 || cur.len > best.len )
130 best = cur;
131 }
132 if ( best.base != -1 && best.len < 2 )
133 best.base = -1;
134  
135 /*
136 * Format the result.
137 */
138 tp = tmp;
139 for ( i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++ ) {
140 /* Are we inside the best run of 0x00's? */
141 if ( best.base != -1 && i >= best.base &&
142 i < (best.base + best.len) ) {
143 if ( i == best.base )
144 *tp++ = ':';
145 continue;
146 }
147 /* Are we following an initial run of 0x00s or any real hex? */
148 if ( i != 0 )
149 *tp++ = ':';
150 /* Is this address an encapsulated IPv4? */
151 if ( i == 6 && best.base == 0 &&
152 (best.len == 6 || (best.len == 5 && words[5] == 0xffff)) ) {
153 if ( !inet_ntop4(src+12, tp,
154 sizeof tmp - (tp - tmp)) )
155 return NULL;
156 tp += strlen(tp);
157 break;
158 }
159 tp += sprintf(tp, "%x", words[i]);
160 }
161 /* Was it a trailing run of 0x00's? */
162 if ( best.base != -1 && (best.base + best.len) ==
163 (NS_IN6ADDRSZ / NS_INT16SZ) )
164 *tp++ = ':';
165 *tp++ = '\0';
166  
167 /*
168 * Check for overflow, copy, and we're done.
169 */
170 if ( (size_t)(tp - tmp) > size ) {
171 errno = ENOSPC;
172 return NULL;
173 }
174 strcpy(dst, tmp);
175 return dst;
176 }
177 #endif /* HAVE_IPV6 */
178 #endif /* HAVE_INET_NTOP */
179  
180 #ifdef __cplusplus
181 } /* end extern "C" */
182 #endif
183