ntop.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400
  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. #include <sys/param.h>
  18. #include <sys/types.h>
  19. #include <sys/socket.h>
  20. #include <netinet/in.h>
  21. #include <arpa/inet.h>
  22. #include <arpa/nameser.h>
  23. #include <errno.h>
  24. #include <stdio.h>
  25. #include <string.h>
  26. /*
  27. * WARNING: Don't even consider trying to compile this on a system where
  28. * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.
  29. */
  30. /* const char *
  31. * inet_ntop4(src, dst, size)
  32. * format an IPv4 address
  33. * return:
  34. * `dst' (as a const)
  35. * notes:
  36. * (1) uses no statics
  37. * (2) takes a u_char* not an in_addr as input
  38. * author:
  39. * Paul Vixie, 1996.
  40. */
  41. static const char *
  42. inet_ntop4(src, dst, size)
  43. const u_char *src;
  44. char *dst;
  45. 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 (src[octet] > 255) {
  53. __set_errno (ENOSPC);
  54. return (NULL);
  55. }
  56. tmp[i++] = '0' + src[octet] / 100;
  57. if (tmp[i - 1] == '0') {
  58. tmp[i - 1] = '0' + (src[octet] / 10 % 10);
  59. if (tmp[i - 1] == '0') i--;
  60. } else {
  61. tmp[i++] = '0' + (src[octet] / 10 % 10);
  62. }
  63. tmp[i++] = '0' + src[octet] % 10;
  64. tmp[i++] = '.';
  65. }
  66. tmp[i - 1] = '\0';
  67. if (strlen (tmp) > size) {
  68. __set_errno (ENOSPC);
  69. return (NULL);
  70. }
  71. return strcpy(dst, tmp);
  72. }
  73. /* const char *
  74. * inet_ntop6(src, dst, size)
  75. * convert IPv6 binary address into presentation (printable) format
  76. * author:
  77. * Paul Vixie, 1996.
  78. */
  79. #ifdef INET_IPV6
  80. static const char *
  81. inet_ntop6(src, dst, size)
  82. const u_char *src;
  83. char *dst;
  84. 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 /* INET_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(src, dst)
  178. const char *src;
  179. 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 INET_IPV6
  224. static int
  225. inet_pton6(src, dst)
  226. const char *src;
  227. u_char *dst;
  228. {
  229. static const char xdigits[] = "0123456789abcdef";
  230. u_char tmp[16], *tp, *endp, *colonp;
  231. const char *curtok;
  232. int ch, saw_xdigit;
  233. u_int val;
  234. tp = memset(tmp, '\0', 16);
  235. endp = tp + 16;
  236. colonp = NULL;
  237. /* Leading :: requires some special handling. */
  238. if (*src == ':')
  239. if (*++src != ':')
  240. return (0);
  241. curtok = src;
  242. saw_xdigit = 0;
  243. val = 0;
  244. while ((ch = tolower (*src++)) != '\0') {
  245. const char *pch;
  246. pch = strchr(xdigits, ch);
  247. if (pch != NULL) {
  248. val <<= 4;
  249. val |= (pch - xdigits);
  250. if (val > 0xffff)
  251. return (0);
  252. saw_xdigit = 1;
  253. continue;
  254. }
  255. if (ch == ':') {
  256. curtok = src;
  257. if (!saw_xdigit) {
  258. if (colonp)
  259. return (0);
  260. colonp = tp;
  261. continue;
  262. } else if (*src == '\0') {
  263. return (0);
  264. }
  265. if (tp + 2 > endp)
  266. return (0);
  267. *tp++ = (u_char) (val >> 8) & 0xff;
  268. *tp++ = (u_char) val & 0xff;
  269. saw_xdigit = 0;
  270. val = 0;
  271. continue;
  272. }
  273. if (ch == '.' && ((tp + 4) <= endp) &&
  274. inet_pton4(curtok, tp) > 0) {
  275. tp += 4;
  276. saw_xdigit = 0;
  277. break; /* '\0' was seen by inet_pton4(). */
  278. }
  279. return (0);
  280. }
  281. if (saw_xdigit) {
  282. if (tp + 2 > endp)
  283. return (0);
  284. *tp++ = (u_char) (val >> 8) & 0xff;
  285. *tp++ = (u_char) val & 0xff;
  286. }
  287. if (colonp != NULL) {
  288. /*
  289. * Since some memmove()'s erroneously fail to handle
  290. * overlapping regions, we'll do the shift by hand.
  291. */
  292. const int n = tp - colonp;
  293. int i;
  294. if (tp == endp)
  295. return (0);
  296. for (i = 1; i <= n; i++) {
  297. endp[- i] = colonp[n - i];
  298. colonp[n - i] = 0;
  299. }
  300. tp = endp;
  301. }
  302. if (tp != endp)
  303. return (0);
  304. memcpy(dst, tmp, 16);
  305. return (1);
  306. }
  307. #endif /* INET_IPV6 */
  308. /* char *
  309. * inet_ntop(af, src, dst, size)
  310. * convert a network format address to presentation format.
  311. * return:
  312. * pointer to presentation format address (`dst'), or NULL (see errno).
  313. * author:
  314. * Paul Vixie, 1996.
  315. */
  316. extern const char *
  317. inet_ntop(af, src, dst, size)
  318. int af;
  319. const void *src;
  320. char *dst;
  321. size_t size;
  322. {
  323. switch (af) {
  324. case AF_INET:
  325. return (inet_ntop4(src, dst, size));
  326. #ifdef INET_IPV6
  327. case AF_INET6:
  328. return (inet_ntop6(src, dst, size));
  329. #endif
  330. default:
  331. __set_errno (EAFNOSUPPORT);
  332. return (NULL);
  333. }
  334. /* NOTREACHED */
  335. }
  336. /* int
  337. * inet_pton(af, src, dst)
  338. * convert from presentation format (which usually means ASCII printable)
  339. * to network format (which is usually some kind of binary format).
  340. * return:
  341. * 1 if the address was valid for the specified address family
  342. * 0 if the address wasn't valid (`dst' is untouched in this case)
  343. * -1 if some other error occurred (`dst' is untouched in this case, too)
  344. * author:
  345. * Paul Vixie, 1996.
  346. */
  347. extern int
  348. inet_pton(af, src, dst)
  349. int af;
  350. const char *src;
  351. void *dst;
  352. {
  353. switch (af) {
  354. case AF_INET:
  355. return (inet_pton4(src, dst));
  356. #ifdef INET_IPV6
  357. case AF_INET6:
  358. return (inet_pton6(src, dst));
  359. #endif
  360. default:
  361. __set_errno (EAFNOSUPPORT);
  362. return (-1);
  363. }
  364. /* NOTREACHED */
  365. }