ntop.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396
  1. /*
  2. * Copyright (c) 1996-1999 by Internet Software Consortium.
  3. *
  4. * Permission to use, copy, modify, and distribute this software for any
  5. * purpose with or without fee is hereby granted, provided that the above
  6. * copyright notice and this permission notice appear in all copies.
  7. *
  8. * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
  9. * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
  10. * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
  11. * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  12. * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  13. * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
  14. * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
  15. * SOFTWARE.
  16. */
  17. #define __FORCE_GLIBC
  18. #include <features.h>
  19. #include <sys/param.h>
  20. #include <sys/types.h>
  21. #include <sys/socket.h>
  22. #include <netinet/in.h>
  23. #include <arpa/inet.h>
  24. #include <arpa/nameser.h>
  25. #include <errno.h>
  26. #include <stdio.h>
  27. #include <string.h>
  28. #include <ctype.h>
  29. /*
  30. * WARNING: Don't even consider trying to compile this on a system where
  31. * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
  32. */
  33. /* const char *
  34. * inet_ntop4(src, dst, size)
  35. * format an IPv4 address
  36. * return:
  37. * `dst' (as a const)
  38. * notes:
  39. * (1) uses no statics
  40. * (2) takes a u_char* not an in_addr as input
  41. * author:
  42. * Paul Vixie, 1996.
  43. */
  44. static const char *
  45. inet_ntop4(const u_char *src, char *dst, size_t size)
  46. {
  47. char tmp[sizeof ("255.255.255.255") + 1];
  48. int octet;
  49. int i;
  50. tmp[0] = '\0';
  51. i = 0;
  52. for (octet = 0; octet <= 3; octet++) {
  53. #if 0 /* since src is unsigned char, it will never be > 255 ... */
  54. if (src[octet] > 255) {
  55. __set_errno(ENOSPC);
  56. return NULL;
  57. }
  58. #endif
  59. tmp[i++] = '0' + src[octet] / 100;
  60. if (tmp[i - 1] == '0') {
  61. tmp[i - 1] = '0' + (src[octet] / 10 % 10);
  62. if (tmp[i - 1] == '0') i--;
  63. } else {
  64. tmp[i++] = '0' + (src[octet] / 10 % 10);
  65. }
  66. tmp[i++] = '0' + src[octet] % 10;
  67. tmp[i++] = '.';
  68. }
  69. tmp[i - 1] = '\0';
  70. if (strlen(tmp) > size) {
  71. __set_errno(ENOSPC);
  72. return NULL;
  73. }
  74. return strcpy(dst, tmp);
  75. }
  76. /* const char *
  77. * inet_ntop6(src, dst, size)
  78. * convert IPv6 binary address into presentation (printable) format
  79. * author:
  80. * Paul Vixie, 1996.
  81. */
  82. #ifdef __UCLIBC_HAS_IPV6__
  83. static const char *
  84. inet_ntop6(const u_char *src, char *dst, size_t size)
  85. {
  86. /*
  87. * Note that int32_t and int16_t need only be "at least" large enough
  88. * to contain a value of the specified size. On some systems, like
  89. * Crays, there is no such thing as an integer variable with 16 bits.
  90. * Keep this in mind if you think this function should have been coded
  91. * to use pointer overlays. All the world's not a VAX.
  92. */
  93. char tmp[sizeof ("ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255")], *tp;
  94. struct { int base, len; } best, cur;
  95. u_int words[8];
  96. int i;
  97. /*
  98. * Preprocess:
  99. * Copy the input (bytewise) array into a wordwise array.
  100. * Find the longest run of 0x00's in src[] for :: shorthanding.
  101. */
  102. memset(words, '\0', sizeof words);
  103. for (i = 0; i < 16; i += 2)
  104. words[i / 2] = (src[i] << 8) | src[i + 1];
  105. best.base = -1;
  106. cur.base = -1;
  107. best.len = best.len; /* shutting up compiler warning */
  108. cur.len = cur.len; /* shutting up compiler warning */
  109. for (i = 0; i < 8; i++) {
  110. if (words[i] == 0) {
  111. if (cur.base == -1)
  112. cur.base = i, cur.len = 1;
  113. else
  114. cur.len++;
  115. } else {
  116. if (cur.base != -1) {
  117. if (best.base == -1 || cur.len > best.len)
  118. best = cur;
  119. cur.base = -1;
  120. }
  121. }
  122. }
  123. if (cur.base != -1) {
  124. if (best.base == -1 || cur.len > best.len)
  125. best = cur;
  126. }
  127. if (best.base != -1 && best.len < 2)
  128. best.base = -1;
  129. /*
  130. * Format the result.
  131. */
  132. tp = tmp;
  133. for (i = 0; i < 8; i++) {
  134. /* Are we inside the best run of 0x00's? */
  135. if (best.base != -1 && i >= best.base &&
  136. i < (best.base + best.len)) {
  137. if (i == best.base)
  138. *tp++ = ':';
  139. continue;
  140. }
  141. /* Are we following an initial run of 0x00s or any real hex? */
  142. if (i != 0)
  143. *tp++ = ':';
  144. /* Is this address an encapsulated IPv4? */
  145. if (i == 6 && best.base == 0 &&
  146. (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
  147. if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp)))
  148. return NULL;
  149. tp += strlen(tp);
  150. break;
  151. }
  152. tp += sprintf(tp, "%x", words[i]);
  153. }
  154. /* Was it a trailing run of 0x00's? */
  155. if (best.base != -1 && (best.base + best.len) == 8)
  156. *tp++ = ':';
  157. *tp++ = '\0';
  158. /*
  159. * Check for overflow, copy, and we're done.
  160. */
  161. if ((size_t)(tp - tmp) > size) {
  162. __set_errno(ENOSPC);
  163. return NULL;
  164. }
  165. return strcpy(dst, tmp);
  166. }
  167. #endif /* __UCLIBC_HAS_IPV6__ */
  168. /* int
  169. * inet_pton4(src, dst)
  170. * like inet_aton() but without all the hexadecimal and shorthand.
  171. * return:
  172. * 1 if `src' is a valid dotted quad, else 0.
  173. * notice:
  174. * does not touch `dst' unless it's returning 1.
  175. * author:
  176. * Paul Vixie, 1996.
  177. */
  178. static int
  179. inet_pton4(const char *src, u_char *dst)
  180. {
  181. int saw_digit, octets, ch;
  182. u_char tmp[4], *tp;
  183. saw_digit = 0;
  184. octets = 0;
  185. *(tp = tmp) = 0;
  186. while ((ch = *src++) != '\0') {
  187. if (ch >= '0' && ch <= '9') {
  188. u_int new = *tp * 10 + (ch - '0');
  189. if (new > 255)
  190. return 0;
  191. *tp = new;
  192. if (! saw_digit) {
  193. if (++octets > 4)
  194. return 0;
  195. saw_digit = 1;
  196. }
  197. } else if (ch == '.' && saw_digit) {
  198. if (octets == 4)
  199. return 0;
  200. *++tp = 0;
  201. saw_digit = 0;
  202. } else
  203. return 0;
  204. }
  205. if (octets < 4)
  206. return 0;
  207. memcpy(dst, tmp, 4);
  208. return 1;
  209. }
  210. /* int
  211. * inet_pton6(src, dst)
  212. * convert presentation level address to network order binary form.
  213. * return:
  214. * 1 if `src' is a valid [RFC1884 2.2] address, else 0.
  215. * notice:
  216. * (1) does not touch `dst' unless it's returning 1.
  217. * (2) :: in a full address is silently ignored.
  218. * credit:
  219. * inspired by Mark Andrews.
  220. * author:
  221. * Paul Vixie, 1996.
  222. */
  223. #ifdef __UCLIBC_HAS_IPV6__
  224. static int
  225. inet_pton6(const char *src, u_char *dst)
  226. {
  227. static const char xdigits[] = "0123456789abcdef";
  228. u_char tmp[16], *tp, *endp, *colonp;
  229. const char *curtok;
  230. int ch, saw_xdigit;
  231. u_int val;
  232. tp = memset(tmp, '\0', 16);
  233. endp = tp + 16;
  234. colonp = NULL;
  235. /* Leading :: requires some special handling. */
  236. if (*src == ':')
  237. if (*++src != ':')
  238. return 0;
  239. curtok = src;
  240. saw_xdigit = 0;
  241. val = 0;
  242. while ((ch = *src++) != '\0') {
  243. const char *pch;
  244. /* | 0x20 is cheap tolower(), valid for letters/numbers only */
  245. pch = strchr(xdigits, (ch | 0x20));
  246. if (pch != NULL) {
  247. val <<= 4;
  248. val |= (pch - xdigits);
  249. if (val > 0xffff)
  250. return 0;
  251. saw_xdigit = 1;
  252. continue;
  253. }
  254. if (ch == ':') {
  255. curtok = src;
  256. if (!saw_xdigit) {
  257. if (colonp)
  258. return 0;
  259. colonp = tp;
  260. continue;
  261. }
  262. if (*src == '\0')
  263. return 0;
  264. if (tp + 2 > endp)
  265. return 0;
  266. *tp++ = (u_char) (val >> 8);
  267. *tp++ = (u_char) val;
  268. saw_xdigit = 0;
  269. val = 0;
  270. continue;
  271. }
  272. if (ch == '.' && ((tp + 4) <= endp) &&
  273. inet_pton4(curtok, tp) > 0) {
  274. tp += 4;
  275. saw_xdigit = 0;
  276. break; /* '\0' was seen by inet_pton4(). */
  277. }
  278. return 0;
  279. }
  280. if (saw_xdigit) {
  281. if (tp + 2 > endp)
  282. return 0;
  283. *tp++ = (u_char) (val >> 8);
  284. *tp++ = (u_char) val;
  285. }
  286. if (colonp != NULL) {
  287. /*
  288. * Since some memmove()'s erroneously fail to handle
  289. * overlapping regions, we'll do the shift by hand.
  290. */
  291. const int n = tp - colonp;
  292. int i;
  293. if (tp == endp)
  294. return 0;
  295. for (i = 1; i <= n; i++) {
  296. endp[- i] = colonp[n - i];
  297. colonp[n - i] = 0;
  298. }
  299. tp = endp;
  300. }
  301. if (tp != endp)
  302. return 0;
  303. memcpy(dst, tmp, 16);
  304. return 1;
  305. }
  306. #endif /* __UCLIBC_HAS_IPV6__ */
  307. /* char *
  308. * inet_ntop(af, src, dst, size)
  309. * convert a network format address to presentation format.
  310. * return:
  311. * pointer to presentation format address (`dst'), or NULL (see errno).
  312. * author:
  313. * Paul Vixie, 1996.
  314. */
  315. const char *
  316. inet_ntop(int af, const void *src, char *dst, socklen_t size)
  317. {
  318. switch (af) {
  319. case AF_INET:
  320. return inet_ntop4(src, dst, size);
  321. #ifdef __UCLIBC_HAS_IPV6__
  322. case AF_INET6:
  323. return inet_ntop6(src, dst, size);
  324. #endif
  325. default:
  326. __set_errno(EAFNOSUPPORT);
  327. return NULL;
  328. }
  329. /* NOTREACHED */
  330. }
  331. libc_hidden_def(inet_ntop)
  332. /* int
  333. * inet_pton(af, src, dst)
  334. * convert from presentation format (which usually means ASCII printable)
  335. * to network format (which is usually some kind of binary format).
  336. * return:
  337. * 1 if the address was valid for the specified address family
  338. * 0 if the address wasn't valid (`dst' is untouched in this case)
  339. * -1 if some other error occurred (`dst' is untouched in this case, too)
  340. * author:
  341. * Paul Vixie, 1996.
  342. */
  343. int
  344. inet_pton(int af, const char *src, void *dst)
  345. {
  346. switch (af) {
  347. case AF_INET:
  348. return inet_pton4(src, dst);
  349. #ifdef __UCLIBC_HAS_IPV6__
  350. case AF_INET6:
  351. return inet_pton6(src, dst);
  352. #endif
  353. default:
  354. __set_errno(EAFNOSUPPORT);
  355. return -1;
  356. }
  357. /* NOTREACHED */
  358. }
  359. libc_hidden_def(inet_pton)