inet.c 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282
  1. #include "precompile.h"
  2. #include <stdio.h>
  3. #include <string.h>
  4. # include <stdint.h>
  5. #include "toolkit.h"
  6. #include "memutil.h"
  7. #include "strutil.h"
  8. #define TOOLKIT__INET_ADDRSTRLEN 16
  9. #define TOOLKIT__INET6_ADDRSTRLEN 46
  10. static int inet_ntop4(const unsigned char *src, char *dst, size_t size);
  11. static int inet_ntop6(const unsigned char *src, char *dst, size_t size);
  12. static int inet_pton4(const char *src, unsigned char *dst);
  13. static int inet_pton6(const char *src, unsigned char *dst);
  14. int toolkit_inet_ntop(int af, const void* src, char* dst, size_t size) {
  15. switch (af) {
  16. case AF_INET:
  17. return (inet_ntop4(src, dst, size));
  18. case AF_INET6:
  19. return (inet_ntop6(src, dst, size));
  20. default:
  21. return TOOLKIT_EAFNOSUPPORT;
  22. }
  23. /* NOTREACHED */
  24. }
  25. static int inet_ntop4(const unsigned char *src, char *dst, size_t size) {
  26. static const char fmt[] = "%u.%u.%u.%u";
  27. char tmp[TOOLKIT__INET_ADDRSTRLEN];
  28. int l;
  29. l = snprintf(tmp, sizeof(tmp), fmt, src[0], src[1], src[2], src[3]);
  30. if (l <= 0 || (size_t) l >= size) {
  31. return TOOLKIT_ENOSPC;
  32. }
  33. strlcpy(dst, tmp, size);
  34. return 0;
  35. }
  36. static int inet_ntop6(const unsigned char *src, char *dst, size_t size) {
  37. /*
  38. * Note that int32_t and int16_t need only be "at least" large enough
  39. * to contain a value of the specified size. On some systems, like
  40. * Crays, there is no such thing as an integer variable with 16 bits.
  41. * Keep this in mind if you think this function should have been coded
  42. * to use pointer overlays. All the world's not a VAX.
  43. */
  44. char tmp[TOOLKIT__INET6_ADDRSTRLEN], *tp;
  45. struct { int base, len; } best, cur;
  46. unsigned int words[sizeof(struct in6_addr) / sizeof(uint16_t)];
  47. int i;
  48. /*
  49. * Preprocess:
  50. * Copy the input (bytewise) array into a wordwise array.
  51. * Find the longest run of 0x00's in src[] for :: shorthanding.
  52. */
  53. memset(words, '\0', sizeof words);
  54. for (i = 0; i < (int) sizeof(struct in6_addr); i++)
  55. words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
  56. best.base = -1;
  57. best.len = 0;
  58. cur.base = -1;
  59. cur.len = 0;
  60. for (i = 0; i < (int) array_size(words); i++) {
  61. if (words[i] == 0) {
  62. if (cur.base == -1)
  63. cur.base = i, cur.len = 1;
  64. else
  65. cur.len++;
  66. } else {
  67. if (cur.base != -1) {
  68. if (best.base == -1 || cur.len > best.len)
  69. best = cur;
  70. cur.base = -1;
  71. }
  72. }
  73. }
  74. if (cur.base != -1) {
  75. if (best.base == -1 || cur.len > best.len)
  76. best = cur;
  77. }
  78. if (best.base != -1 && best.len < 2)
  79. best.base = -1;
  80. /*
  81. * Format the result.
  82. */
  83. tp = tmp;
  84. for (i = 0; i < (int) array_size(words); i++) {
  85. /* Are we inside the best run of 0x00's? */
  86. if (best.base != -1 && i >= best.base &&
  87. i < (best.base + best.len)) {
  88. if (i == best.base)
  89. *tp++ = ':';
  90. continue;
  91. }
  92. /* Are we following an initial run of 0x00s or any real hex? */
  93. if (i != 0)
  94. *tp++ = ':';
  95. /* Is this address an encapsulated IPv4? */
  96. if (i == 6 && best.base == 0 && (best.len == 6 ||
  97. (best.len == 7 && words[7] != 0x0001) ||
  98. (best.len == 5 && words[5] == 0xffff))) {
  99. int err = inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp));
  100. if (err)
  101. return err;
  102. tp += strlen(tp);
  103. break;
  104. }
  105. tp += sprintf(tp, "%x", words[i]);
  106. }
  107. /* Was it a trailing run of 0x00's? */
  108. if (best.base != -1 && (best.base + best.len) == array_size(words))
  109. *tp++ = ':';
  110. *tp++ = '\0';
  111. if (TOOLKIT_E2BIG == strlcpy(dst, tmp, size))
  112. return TOOLKIT_ENOSPC;
  113. return 0;
  114. }
  115. int toolkit_inet_pton(int af, const char* src, void* dst) {
  116. if (src == NULL || dst == NULL)
  117. return TOOLKIT_EINVAL;
  118. switch (af) {
  119. case AF_INET:
  120. return (inet_pton4(src, dst));
  121. case AF_INET6: {
  122. int len;
  123. char tmp[TOOLKIT__INET6_ADDRSTRLEN], *s, *p;
  124. s = (char*) src;
  125. p = strchr(src, '%');
  126. if (p != NULL) {
  127. s = tmp;
  128. len = p - src;
  129. if (len > TOOLKIT__INET6_ADDRSTRLEN-1)
  130. return TOOLKIT_EINVAL;
  131. memcpy(s, src, len);
  132. s[len] = '\0';
  133. }
  134. return inet_pton6(s, dst);
  135. }
  136. default:
  137. return TOOLKIT_EAFNOSUPPORT;
  138. }
  139. /* NOTREACHED */
  140. }
  141. static int inet_pton4(const char *src, unsigned char *dst) {
  142. static const char digits[] = "0123456789";
  143. int saw_digit, octets, ch;
  144. unsigned char tmp[sizeof(struct in_addr)], *tp;
  145. saw_digit = 0;
  146. octets = 0;
  147. *(tp = tmp) = 0;
  148. while ((ch = *src++) != '\0') {
  149. const char *pch;
  150. if ((pch = strchr(digits, ch)) != NULL) {
  151. unsigned int nw = *tp * 10 + (pch - digits);
  152. if (saw_digit && *tp == 0)
  153. return TOOLKIT_EINVAL;
  154. if (nw > 255)
  155. return TOOLKIT_EINVAL;
  156. *tp = nw;
  157. if (!saw_digit) {
  158. if (++octets > 4)
  159. return TOOLKIT_EINVAL;
  160. saw_digit = 1;
  161. }
  162. } else if (ch == '.' && saw_digit) {
  163. if (octets == 4)
  164. return TOOLKIT_EINVAL;
  165. *++tp = 0;
  166. saw_digit = 0;
  167. } else
  168. return TOOLKIT_EINVAL;
  169. }
  170. if (octets < 4)
  171. return TOOLKIT_EINVAL;
  172. memcpy(dst, tmp, sizeof(struct in_addr));
  173. return 0;
  174. }
  175. static int inet_pton6(const char *src, unsigned char *dst) {
  176. static const char xdigits_l[] = "0123456789abcdef",
  177. xdigits_u[] = "0123456789ABCDEF";
  178. unsigned char tmp[sizeof(struct in6_addr)], *tp, *endp, *colonp;
  179. const char *xdigits, *curtok;
  180. int ch, seen_xdigits;
  181. unsigned int val;
  182. memset((tp = tmp), '\0', sizeof tmp);
  183. endp = tp + sizeof tmp;
  184. colonp = NULL;
  185. /* Leading :: requires some special handling. */
  186. if (*src == ':')
  187. if (*++src != ':')
  188. return TOOLKIT_EINVAL;
  189. curtok = src;
  190. seen_xdigits = 0;
  191. val = 0;
  192. while ((ch = *src++) != '\0') {
  193. const char *pch;
  194. if ((pch = strchr((xdigits = xdigits_l), ch)) == NULL)
  195. pch = strchr((xdigits = xdigits_u), ch);
  196. if (pch != NULL) {
  197. val <<= 4;
  198. val |= (pch - xdigits);
  199. if (++seen_xdigits > 4)
  200. return TOOLKIT_EINVAL;
  201. continue;
  202. }
  203. if (ch == ':') {
  204. curtok = src;
  205. if (!seen_xdigits) {
  206. if (colonp)
  207. return TOOLKIT_EINVAL;
  208. colonp = tp;
  209. continue;
  210. } else if (*src == '\0') {
  211. return TOOLKIT_EINVAL;
  212. }
  213. if (tp + sizeof(uint16_t) > endp)
  214. return TOOLKIT_EINVAL;
  215. *tp++ = (unsigned char) (val >> 8) & 0xff;
  216. *tp++ = (unsigned char) val & 0xff;
  217. seen_xdigits = 0;
  218. val = 0;
  219. continue;
  220. }
  221. if (ch == '.' && ((tp + sizeof(struct in_addr)) <= endp)) {
  222. int err = inet_pton4(curtok, tp);
  223. if (err == 0) {
  224. tp += sizeof(struct in_addr);
  225. seen_xdigits = 0;
  226. break; /*%< '\\0' was seen by inet_pton4(). */
  227. }
  228. }
  229. return TOOLKIT_EINVAL;
  230. }
  231. if (seen_xdigits) {
  232. if (tp + sizeof(uint16_t) > endp)
  233. return TOOLKIT_EINVAL;
  234. *tp++ = (unsigned char) (val >> 8) & 0xff;
  235. *tp++ = (unsigned char) val & 0xff;
  236. }
  237. if (colonp != NULL) {
  238. /*
  239. * Since some memmove()'s erroneously fail to handle
  240. * overlapping regions, we'll do the shift by hand.
  241. */
  242. const int n = tp - colonp;
  243. int i;
  244. if (tp == endp)
  245. return TOOLKIT_EINVAL;
  246. for (i = 1; i <= n; i++) {
  247. endp[- i] = colonp[n - i];
  248. colonp[n - i] = 0;
  249. }
  250. tp = endp;
  251. }
  252. if (tp != endp)
  253. return TOOLKIT_EINVAL;
  254. memcpy(dst, tmp, sizeof tmp);
  255. return 0;
  256. }