ntop.c 9.1 KB

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