ntop.c 8.7 KB

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