__dns.c 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273
  1. #include <stdint.h>
  2. #include <netdb.h>
  3. #include <stdio.h>
  4. #include <fcntl.h>
  5. #include <limits.h>
  6. #include <string.h>
  7. #include <sys/socket.h>
  8. #include <poll.h>
  9. #include <netinet/in.h>
  10. #include <time.h>
  11. #include <ctype.h>
  12. #include <unistd.h>
  13. #include <pthread.h>
  14. #include "__dns.h"
  15. #include "stdio_impl.h"
  16. #define TIMEOUT 5
  17. #define RETRY 1000
  18. #define PACKET_MAX 512
  19. #define PTR_MAX (64 + sizeof ".in-addr.arpa")
  20. int __dns_doqueries(unsigned char *dest, const char *name, int *rr, int rrcnt)
  21. {
  22. time_t t0 = time(0);
  23. int fd;
  24. FILE *f, _f;
  25. unsigned char _buf[64];
  26. char line[64], *s, *z;
  27. union {
  28. struct sockaddr_in sin;
  29. struct sockaddr_in6 sin6;
  30. } sa = {0}, ns[3] = {{0}};
  31. socklen_t sl;
  32. int nns = 0;
  33. int family = AF_UNSPEC;
  34. unsigned char q[280] = "", *r = dest;
  35. int ql;
  36. int rlen;
  37. int got = 0, failed = 0;
  38. int errcode = EAI_AGAIN;
  39. int i, j;
  40. struct timespec ts;
  41. struct pollfd pfd;
  42. int id;
  43. int cs;
  44. /* Construct query template - RR and ID will be filled later */
  45. if (strlen(name)-1 >= 254U) return EAI_NONAME;
  46. q[2] = q[5] = 1;
  47. strcpy((char *)q+13, name);
  48. for (i=13; q[i]; i=j+1) {
  49. for (j=i; q[j] && q[j] != '.'; j++);
  50. if (j-i-1u > 62u) return EAI_NONAME;
  51. q[i-1] = j-i;
  52. }
  53. q[i+3] = 1;
  54. ql = i+4;
  55. /* Make a reasonably unpredictable id */
  56. clock_gettime(CLOCK_REALTIME, &ts);
  57. id = ts.tv_nsec + ts.tv_nsec/65536UL & 0xffff;
  58. /* Get nameservers from resolv.conf, fallback to localhost */
  59. f = __fopen_rb_ca("/etc/resolv.conf", &_f, _buf, sizeof _buf);
  60. if (f) for (nns=0; nns<3 && fgets(line, sizeof line, f); ) {
  61. if (strncmp(line, "nameserver", 10) || !isspace(line[10]))
  62. continue;
  63. for (s=line+11; isspace(*s); s++);
  64. for (z=s; *z && !isspace(*z); z++);
  65. *z=0;
  66. if (__ipparse(ns+nns, family, s) < 0) continue;
  67. ns[nns].sin.sin_port = htons(53);
  68. family = ns[nns++].sin.sin_family;
  69. sl = family==AF_INET6 ? sizeof sa.sin6 : sizeof sa.sin;
  70. }
  71. if (f) __fclose_ca(f);
  72. if (!nns) {
  73. ns[0].sin.sin_family = AF_INET;
  74. ns[0].sin.sin_port = htons(53);
  75. nns=1;
  76. sl = sizeof sa.sin;
  77. }
  78. pthread_setcancelstate(PTHREAD_CANCEL_DISABLE, &cs);
  79. /* Get local address and open/bind a socket */
  80. sa.sin.sin_family = family;
  81. fd = socket(family, SOCK_DGRAM, 0);
  82. if (bind(fd, (void *)&sa, sl) < 0) {
  83. errcode = EAI_SYSTEM;
  84. goto out;
  85. }
  86. /* Nonblocking to work around Linux UDP select bug */
  87. fcntl(fd, F_SETFL, fcntl(fd, F_GETFL, 0) | O_NONBLOCK);
  88. pfd.fd = fd;
  89. pfd.events = POLLIN;
  90. /* Loop until we timeout; break early on success */
  91. for (; time(0)-t0 < TIMEOUT; ) {
  92. /* Query all configured namservers in parallel */
  93. for (i=0; i<rrcnt; i++) if (rr[i]) for (j=0; j<nns; j++) {
  94. q[0] = id+i >> 8;
  95. q[1] = id+i;
  96. q[ql-3] = rr[i];
  97. sendto(fd, q, ql, MSG_NOSIGNAL, (void *)&ns[j], sl);
  98. }
  99. /* Wait for a response, or until time to retry */
  100. if (poll(&pfd, 1, RETRY) <= 0) continue;
  101. /* Process any and all replies */
  102. while (got+failed < rrcnt && (rlen = recvfrom(fd, r, 512, 0,
  103. (void *)&sa, (socklen_t[1]){sl})) >= 2)
  104. {
  105. /* Ignore replies from addresses we didn't send to */
  106. for (i=0; i<nns; i++) if (!memcmp(ns+i, &sa, sl)) break;
  107. if (i==nns) continue;
  108. /* Compute index of the query from id */
  109. i = r[0]*256+r[1] - id & 0xffff;
  110. if ((unsigned)i >= rrcnt || !rr[i]) continue;
  111. /* Interpret the result code */
  112. switch (r[3] & 15) {
  113. case 0:
  114. got++;
  115. break;
  116. case 3:
  117. if (1) errcode = EAI_NONAME; else
  118. default:
  119. errcode = EAI_FAIL;
  120. failed++;
  121. }
  122. /* Mark this record as answered */
  123. rr[i] = 0;
  124. r += 512;
  125. }
  126. /* Check to see if we have answers to all queries */
  127. if (got+failed == rrcnt) break;
  128. }
  129. out:
  130. close(fd);
  131. pthread_setcancelstate(cs, 0);
  132. /* Return the number of results, or an error code if none */
  133. if (got) return got;
  134. return errcode;
  135. }
  136. static void mkptr4(char *s, const unsigned char *ip)
  137. {
  138. sprintf(s, "%d.%d.%d.%d.in-addr.arpa",
  139. ip[3], ip[2], ip[1], ip[0]);
  140. }
  141. static void mkptr6(char *s, const unsigned char *ip)
  142. {
  143. static const char xdigits[] = "0123456789abcdef";
  144. int i;
  145. for (i=15; i>=0; i--) {
  146. *s++ = xdigits[ip[i]&15]; *s++ = '.';
  147. *s++ = xdigits[ip[i]>>4]; *s++ = '.';
  148. }
  149. strcpy(s, "ip6.arpa");
  150. }
  151. int __dns_query(unsigned char *r, const void *a, int family, int ptr)
  152. {
  153. char buf[PTR_MAX];
  154. int rr[2], rrcnt = 1;
  155. if (ptr) {
  156. if (family == AF_INET6) mkptr6(buf, a);
  157. else mkptr4(buf, a);
  158. rr[0] = RR_PTR;
  159. a = buf;
  160. } else if (family == AF_INET6) {
  161. rr[0] = RR_AAAA;
  162. } else {
  163. rr[0] = RR_A;
  164. if (family != AF_INET) rr[rrcnt++] = RR_AAAA;
  165. }
  166. return __dns_doqueries(r, a, rr, rrcnt);
  167. }
  168. #define BITOP(a,b,op) \
  169. ((a)[(size_t)(b)/(8*sizeof *(a))] op (size_t)1<<((size_t)(b)%(8*sizeof *(a))))
  170. static int decname(char *s, const unsigned char *b, const unsigned char *p)
  171. {
  172. /* Remember jump destinations to detect loops and abort */
  173. size_t seen[PACKET_MAX/8/sizeof(size_t)] = { 0 };
  174. char *sz = s + HOST_NAME_MAX;
  175. const unsigned char *pz = b+512;
  176. for (;;) {
  177. if (p>=pz) return -1;
  178. else if (*p&0xc0) {
  179. int j = (p[0]&1) | p[1];
  180. if (BITOP(seen, j, &)) return -1;
  181. BITOP(seen, j, |=);
  182. p = b + j;
  183. } else if (*p) {
  184. if (p+*p+1>=pz || s+*p>=sz) return -1;
  185. memcpy(s, p+1, *p);
  186. s += *p+1;
  187. p += *p+1;
  188. s[-1] = *p ? '.' : 0;
  189. } else return 0;
  190. }
  191. }
  192. int __dns_get_rr(void *dest, size_t stride, size_t maxlen, size_t limit, const unsigned char *r, int rr, int dec)
  193. {
  194. int qdcount, ancount;
  195. const unsigned char *p;
  196. char tmp[256];
  197. int found = 0;
  198. int len;
  199. if ((r[3]&15)) return 0;
  200. p = r+12;
  201. qdcount = r[4]*256 + r[5];
  202. ancount = r[6]*256 + r[7];
  203. if (qdcount+ancount > 64) return -1;
  204. while (qdcount--) {
  205. while (p-r < 512 && *p-1U < 127) p++;
  206. if (*p>193 || (*p==193 && p[1]>254) || p>r+506)
  207. return -1;
  208. p += 5 + !!*p;
  209. }
  210. while (ancount--) {
  211. while (p-r < 512 && *p-1U < 127) p++;
  212. if (*p>193 || (*p==193 && p[1]>254) || p>r+506)
  213. return -1;
  214. p += 1 + !!*p;
  215. len = p[8]*256 + p[9];
  216. if (p+len > r+512) return -1;
  217. if (p[1]==rr && len <= maxlen) {
  218. if (dec && decname(tmp, r, p+10)<0) return -1;
  219. if (dest && limit) {
  220. if (dec) strcpy(dest, tmp);
  221. else memcpy(dest, p+10, len);
  222. dest = (char *)dest + stride;
  223. limit--;
  224. }
  225. found++;
  226. }
  227. p += 10 + len;
  228. }
  229. return found;
  230. }
  231. int __dns_count_addrs(const unsigned char *r, int cnt)
  232. {
  233. int found=0, res, i;
  234. static const int p[2][2] = { { 4, RR_A }, { 16, RR_AAAA } };
  235. while (cnt--) {
  236. for (i=0; i<2; i++) {
  237. res = __dns_get_rr(0, 0, p[i][0], -1, r, p[i][1], 0);
  238. if (res < 0) return res;
  239. found += res;
  240. }
  241. r += 512;
  242. }
  243. return found;
  244. }