ntop.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406
  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 memmove __memmove
  18. #define __FORCE_GLIBC
  19. #include <features.h>
  20. #include <sys/param.h>
  21. #include <sys/types.h>
  22. #include <sys/socket.h>
  23. #include <netinet/in.h>
  24. #include <arpa/inet.h>
  25. #include <arpa/nameser.h>
  26. #include <errno.h>
  27. #include <stdio.h>
  28. #include <string.h>
  29. #include <ctype.h>
  30. /*
  31. * WARNING: Don't even consider trying to compile this on a system where
  32. * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
  33. */
  34. /* const char *
  35. * inet_ntop4(src, dst, size)
  36. * format an IPv4 address
  37. * return:
  38. * `dst' (as a const)
  39. * notes:
  40. * (1) uses no statics
  41. * (2) takes a u_char* not an in_addr as input
  42. * author:
  43. * Paul Vixie, 1996.
  44. */
  45. static const char *
  46. inet_ntop4(const u_char *src, char *dst, size_t size)
  47. {
  48. char tmp[sizeof ("255.255.255.255") + 1] = "\0";
  49. int octet;
  50. int i;
  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. for (i = 0; i < 8; i++) {
  108. if (words[i] == 0) {
  109. if (cur.base == -1)
  110. cur.base = i, cur.len = 1;
  111. else
  112. cur.len++;
  113. } else {
  114. if (cur.base != -1) {
  115. if (best.base == -1 || cur.len > best.len)
  116. best = cur;
  117. cur.base = -1;
  118. }
  119. }
  120. }
  121. if (cur.base != -1) {
  122. if (best.base == -1 || cur.len > best.len)
  123. best = cur;
  124. }
  125. if (best.base != -1 && best.len < 2)
  126. best.base = -1;
  127. /*
  128. * Format the result.
  129. */
  130. tp = tmp;
  131. for (i = 0; i < 8; i++) {
  132. /* Are we inside the best run of 0x00's? */
  133. if (best.base != -1 && i >= best.base &&
  134. i < (best.base + best.len)) {
  135. if (i == best.base)
  136. *tp++ = ':';
  137. continue;
  138. }
  139. /* Are we following an initial run of 0x00s or any real hex? */
  140. if (i != 0)
  141. *tp++ = ':';
  142. /* Is this address an encapsulated IPv4? */
  143. if (i == 6 && best.base == 0 &&
  144. (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
  145. if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp)))
  146. return (NULL);
  147. tp += strlen(tp);
  148. break;
  149. }
  150. tp += sprintf(tp, "%x", words[i]);
  151. }
  152. /* Was it a trailing run of 0x00's? */
  153. if (best.base != -1 && (best.base + best.len) == 8)
  154. *tp++ = ':';
  155. *tp++ = '\0';
  156. /*
  157. * Check for overflow, copy, and we're done.
  158. */
  159. if ((size_t)(tp - tmp) > size) {
  160. __set_errno (ENOSPC);
  161. return (NULL);
  162. }
  163. return strcpy(dst, tmp);
  164. }
  165. #endif /* __UCLIBC_HAS_IPV6__ */
  166. /* int
  167. * inet_pton4(src, dst)
  168. * like inet_aton() but without all the hexadecimal and shorthand.
  169. * return:
  170. * 1 if `src' is a valid dotted quad, else 0.
  171. * notice:
  172. * does not touch `dst' unless it's returning 1.
  173. * author:
  174. * Paul Vixie, 1996.
  175. */
  176. static int
  177. inet_pton4(const char *src, u_char *dst)
  178. {
  179. int saw_digit, octets, ch;
  180. u_char tmp[4], *tp;
  181. saw_digit = 0;
  182. octets = 0;
  183. *(tp = tmp) = 0;
  184. while ((ch = *src++) != '\0') {
  185. if (ch >= '0' && ch <= '9') {
  186. u_int new = *tp * 10 + (ch - '0');
  187. if (new > 255)
  188. return (0);
  189. *tp = new;
  190. if (! saw_digit) {
  191. if (++octets > 4)
  192. return (0);
  193. saw_digit = 1;
  194. }
  195. } else if (ch == '.' && saw_digit) {
  196. if (octets == 4)
  197. return (0);
  198. *++tp = 0;
  199. saw_digit = 0;
  200. } else
  201. return (0);
  202. }
  203. if (octets < 4)
  204. return (0);
  205. memcpy(dst, tmp, 4);
  206. return (1);
  207. }
  208. /* int
  209. * inet_pton6(src, dst)
  210. * convert presentation level address to network order binary form.
  211. * return:
  212. * 1 if `src' is a valid [RFC1884 2.2] address, else 0.
  213. * notice:
  214. * (1) does not touch `dst' unless it's returning 1.
  215. * (2) :: in a full address is silently ignored.
  216. * credit:
  217. * inspired by Mark Andrews.
  218. * author:
  219. * Paul Vixie, 1996.
  220. */
  221. #ifdef __UCLIBC_HAS_IPV6__
  222. /* We cannot use the macro version of tolower() or very bad
  223. * things happen when '*src++' gets evaluated multiple times.
  224. * So * undef it here so we get the function version of tolower
  225. * instead.
  226. */
  227. #undef tolower
  228. static int
  229. inet_pton6(const char *src, u_char *dst)
  230. {
  231. static const char xdigits[] = "0123456789abcdef";
  232. u_char tmp[16], *tp, *endp, *colonp;
  233. const char *curtok;
  234. int ch, saw_xdigit;
  235. u_int val;
  236. tp = memset(tmp, '\0', 16);
  237. endp = tp + 16;
  238. colonp = NULL;
  239. /* Leading :: requires some special handling. */
  240. if (*src == ':')
  241. if (*++src != ':')
  242. return (0);
  243. curtok = src;
  244. saw_xdigit = 0;
  245. val = 0;
  246. while ((ch = tolower (*src++)) != '\0') {
  247. const char *pch;
  248. pch = strchr(xdigits, ch);
  249. if (pch != NULL) {
  250. val <<= 4;
  251. val |= (pch - xdigits);
  252. if (val > 0xffff)
  253. return (0);
  254. saw_xdigit = 1;
  255. continue;
  256. }
  257. if (ch == ':') {
  258. curtok = src;
  259. if (!saw_xdigit) {
  260. if (colonp)
  261. return (0);
  262. colonp = tp;
  263. continue;
  264. } else if (*src == '\0') {
  265. return (0);
  266. }
  267. if (tp + 2 > endp)
  268. return (0);
  269. *tp++ = (u_char) (val >> 8) & 0xff;
  270. *tp++ = (u_char) val & 0xff;
  271. saw_xdigit = 0;
  272. val = 0;
  273. continue;
  274. }
  275. if (ch == '.' && ((tp + 4) <= endp) &&
  276. inet_pton4(curtok, tp) > 0) {
  277. tp += 4;
  278. saw_xdigit = 0;
  279. break; /* '\0' was seen by inet_pton4(). */
  280. }
  281. return (0);
  282. }
  283. if (saw_xdigit) {
  284. if (tp + 2 > endp)
  285. return (0);
  286. *tp++ = (u_char) (val >> 8) & 0xff;
  287. *tp++ = (u_char) val & 0xff;
  288. }
  289. if (colonp != NULL) {
  290. /*
  291. * Since some memmove()'s erroneously fail to handle
  292. * overlapping regions, we'll do the shift by hand.
  293. */
  294. const int n = tp - colonp;
  295. int i;
  296. if (tp == endp)
  297. return (0);
  298. for (i = 1; i <= n; i++) {
  299. endp[- i] = colonp[n - i];
  300. colonp[n - i] = 0;
  301. }
  302. tp = endp;
  303. }
  304. if (tp != endp)
  305. return (0);
  306. memcpy(dst, tmp, 16);
  307. return (1);
  308. }
  309. #endif /* __UCLIBC_HAS_IPV6__ */
  310. /* char *
  311. * inet_ntop(af, src, dst, size)
  312. * convert a network format address to presentation format.
  313. * return:
  314. * pointer to presentation format address (`dst'), or NULL (see errno).
  315. * author:
  316. * Paul Vixie, 1996.
  317. */
  318. extern const char *
  319. inet_ntop(af, src, dst, size)
  320. int af;
  321. const void *src;
  322. char *dst;
  323. 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. /* int
  339. * inet_pton(af, src, dst)
  340. * convert from presentation format (which usually means ASCII printable)
  341. * to network format (which is usually some kind of binary format).
  342. * return:
  343. * 1 if the address was valid for the specified address family
  344. * 0 if the address wasn't valid (`dst' is untouched in this case)
  345. * -1 if some other error occurred (`dst' is untouched in this case, too)
  346. * author:
  347. * Paul Vixie, 1996.
  348. */
  349. extern int
  350. inet_pton(af, src, dst)
  351. int af;
  352. const char *src;
  353. void *dst;
  354. {
  355. switch (af) {
  356. case AF_INET:
  357. return (inet_pton4(src, dst));
  358. #ifdef __UCLIBC_HAS_IPV6__
  359. case AF_INET6:
  360. return (inet_pton6(src, dst));
  361. #endif
  362. default:
  363. __set_errno (EAFNOSUPPORT);
  364. return (-1);
  365. }
  366. /* NOTREACHED */
  367. }