resolv.c 28 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367
  1. /* resolv.c: DNS Resolver
  2. *
  3. * Copyright (C) 1998 Kenneth Albanowski <kjahds@kjahds.com>,
  4. * The Silver Hammer Group, Ltd.
  5. *
  6. * This library is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Library General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2 of the License, or (at your option) any later version.
  10. *
  11. * 5-Oct-2000 W. Greathouse wgreathouse@smva.com
  12. * Fix memory leak and memory corruption.
  13. * -- Every name resolution resulted in
  14. * a new parse of resolv.conf and new
  15. * copy of nameservers allocated by
  16. * strdup.
  17. * -- Every name resolution resulted in
  18. * a new read of resolv.conf without
  19. * resetting index from prior read...
  20. * resulting in exceeding array bounds.
  21. *
  22. * Limit nameservers read from resolv.conf
  23. *
  24. * Add "search" domains from resolv.conf
  25. *
  26. * Some systems will return a security
  27. * signature along with query answer for
  28. * dynamic DNS entries.
  29. * -- skip/ignore this answer
  30. *
  31. * Include arpa/nameser.h for defines.
  32. *
  33. * General cleanup
  34. *
  35. * 20-Jun-2001 Michal Moskal <malekith@pld.org.pl>
  36. * partial IPv6 support (i.e. gethostbyname2() and resolve_address2()
  37. * functions added), IPv6 nameservers are also supported.
  38. *
  39. */
  40. #define __FORCE_GLIBC__
  41. #include <features.h>
  42. #include <string.h>
  43. #include <stdio.h>
  44. #include <signal.h>
  45. #include <errno.h>
  46. #include <sys/socket.h>
  47. #include <sys/types.h>
  48. #include <netinet/in.h>
  49. #include <arpa/inet.h>
  50. #include <stdlib.h>
  51. #include <unistd.h>
  52. #include <resolv.h>
  53. #include <netdb.h>
  54. #include <ctype.h>
  55. #include <arpa/nameser.h>
  56. #define MAX_RECURSE 5
  57. #define REPLY_TIMEOUT 10
  58. #define MAX_RETRIES 15
  59. #define MAX_SERVERS 3
  60. #define MAX_SEARCH 4
  61. #undef DEBUG
  62. /*#define DEBUG*/
  63. #ifdef DEBUG
  64. #define DPRINTF(X,args...) fprintf(stderr, X, ##args)
  65. #else
  66. #define DPRINTF(X,args...)
  67. #endif /* DEBUG */
  68. struct resolv_header {
  69. int id;
  70. int qr,opcode,aa,tc,rd,ra,rcode;
  71. int qdcount;
  72. int ancount;
  73. int nscount;
  74. int arcount;
  75. };
  76. struct resolv_question {
  77. char * dotted;
  78. int qtype;
  79. int qclass;
  80. };
  81. struct resolv_answer {
  82. char * dotted;
  83. int atype;
  84. int aclass;
  85. int ttl;
  86. int rdlength;
  87. unsigned char * rdata;
  88. int rdoffset;
  89. };
  90. extern int nameservers;
  91. extern char * nameserver[MAX_SERVERS];
  92. extern int searchdomains;
  93. extern char * searchdomain[MAX_SEARCH];
  94. extern struct hostent * get_hosts_byname(const char * name);
  95. extern struct hostent * get_hosts_byaddr(const char * addr, int len, int type);
  96. extern struct hostent * read_etc_hosts(const char * name, int ip);
  97. extern int resolve_address(const char * address, int nscount,
  98. char ** nsip, struct in_addr * in);
  99. extern int resolve_mailbox(const char * address, int nscount,
  100. char ** nsip, struct in_addr * in);
  101. extern int dns_lookup(const char * name, int type, int nscount,
  102. char ** nsip, unsigned char ** outpacket, struct resolv_answer * a);
  103. int encode_dotted(const char * dotted, unsigned char * dest, int maxlen);
  104. int decode_dotted(const unsigned char * message, int offset,
  105. char * dest, int maxlen);
  106. int length_dotted(const unsigned char * message, int offset);
  107. int encode_header(struct resolv_header * h, unsigned char * dest, int maxlen);
  108. int decode_header(unsigned char * data, struct resolv_header * h);
  109. int encode_question(struct resolv_question * q,
  110. unsigned char * dest, int maxlen);
  111. int decode_question(unsigned char * message, int offset,
  112. struct resolv_question * q);
  113. int encode_answer(struct resolv_answer * a,
  114. unsigned char * dest, int maxlen);
  115. int decode_answer(unsigned char * message, int offset,
  116. struct resolv_answer * a);
  117. int length_question(unsigned char * message, int offset);
  118. extern int open_nameservers(void);
  119. #ifdef L_encodeh
  120. int encode_header(struct resolv_header *h, unsigned char *dest, int maxlen)
  121. {
  122. if (maxlen < HFIXEDSZ)
  123. return -1;
  124. dest[0] = (h->id & 0xff00) >> 8;
  125. dest[1] = (h->id & 0x00ff) >> 0;
  126. dest[2] = (h->qr ? 0x80 : 0) |
  127. ((h->opcode & 0x0f) << 3) |
  128. (h->aa ? 0x04 : 0) |
  129. (h->tc ? 0x02 : 0) |
  130. (h->rd ? 0x01 : 0);
  131. dest[3] = (h->ra ? 0x80 : 0) | (h->rcode & 0x0f);
  132. dest[4] = (h->qdcount & 0xff00) >> 8;
  133. dest[5] = (h->qdcount & 0x00ff) >> 0;
  134. dest[6] = (h->ancount & 0xff00) >> 8;
  135. dest[7] = (h->ancount & 0x00ff) >> 0;
  136. dest[8] = (h->nscount & 0xff00) >> 8;
  137. dest[9] = (h->nscount & 0x00ff) >> 0;
  138. dest[10] = (h->arcount & 0xff00) >> 8;
  139. dest[11] = (h->arcount & 0x00ff) >> 0;
  140. return HFIXEDSZ;
  141. }
  142. #endif
  143. #ifdef L_decodeh
  144. int decode_header(unsigned char *data, struct resolv_header *h)
  145. {
  146. h->id = (data[0] << 8) | data[1];
  147. h->qr = (data[2] & 0x80) ? 1 : 0;
  148. h->opcode = (data[2] >> 3) & 0x0f;
  149. h->aa = (data[2] & 0x04) ? 1 : 0;
  150. h->tc = (data[2] & 0x02) ? 1 : 0;
  151. h->rd = (data[2] & 0x01) ? 1 : 0;
  152. h->ra = (data[3] & 0x80) ? 1 : 0;
  153. h->rcode = data[3] & 0x0f;
  154. h->qdcount = (data[4] << 8) | data[5];
  155. h->ancount = (data[6] << 8) | data[7];
  156. h->nscount = (data[8] << 8) | data[9];
  157. h->arcount = (data[10] << 8) | data[11];
  158. return HFIXEDSZ;
  159. }
  160. #endif
  161. #ifdef L_encoded
  162. /* Encode a dotted string into nameserver transport-level encoding.
  163. This routine is fairly dumb, and doesn't attempt to compress
  164. the data */
  165. int encode_dotted(const char *dotted, unsigned char *dest, int maxlen)
  166. {
  167. int used = 0;
  168. while (dotted && *dotted) {
  169. char *c = strchr(dotted, '.');
  170. int l = c ? c - dotted : strlen(dotted);
  171. if (l >= (maxlen - used - 1))
  172. return -1;
  173. dest[used++] = l;
  174. memcpy(dest + used, dotted, l);
  175. used += l;
  176. if (c)
  177. dotted = c + 1;
  178. else
  179. break;
  180. }
  181. if (maxlen < 1)
  182. return -1;
  183. dest[used++] = 0;
  184. return used;
  185. }
  186. #endif
  187. #ifdef L_decoded
  188. /* Decode a dotted string from nameserver transport-level encoding.
  189. This routine understands compressed data. */
  190. int decode_dotted(const unsigned char *data, int offset,
  191. char *dest, int maxlen)
  192. {
  193. int l;
  194. int measure = 1;
  195. int total = 0;
  196. int used = 0;
  197. if (!data)
  198. return -1;
  199. while ((l=data[offset++])) {
  200. if (measure)
  201. total++;
  202. if ((l & 0xc0) == (0xc0)) {
  203. if (measure)
  204. total++;
  205. /* compressed item, redirect */
  206. offset = ((l & 0x3f) << 8) | data[offset];
  207. measure = 0;
  208. continue;
  209. }
  210. if ((used + l + 1) >= maxlen)
  211. return -1;
  212. memcpy(dest + used, data + offset, l);
  213. offset += l;
  214. used += l;
  215. if (measure)
  216. total += l;
  217. if (data[offset] != 0)
  218. dest[used++] = '.';
  219. else
  220. dest[used++] = '\0';
  221. }
  222. DPRINTF("Total decode len = %d\n", total);
  223. return total;
  224. }
  225. #endif
  226. #ifdef L_lengthd
  227. int length_dotted(const unsigned char *data, int offset)
  228. {
  229. int orig_offset = offset;
  230. int l;
  231. if (!data)
  232. return -1;
  233. while ((l = data[offset++])) {
  234. if ((l & 0xc0) == (0xc0)) {
  235. offset++;
  236. break;
  237. }
  238. offset += l;
  239. }
  240. return offset - orig_offset;
  241. }
  242. #endif
  243. #ifdef L_encodeq
  244. int encode_question(struct resolv_question *q,
  245. unsigned char *dest, int maxlen)
  246. {
  247. int i;
  248. i = encode_dotted(q->dotted, dest, maxlen);
  249. if (i < 0)
  250. return i;
  251. dest += i;
  252. maxlen -= i;
  253. if (maxlen < 4)
  254. return -1;
  255. dest[0] = (q->qtype & 0xff00) >> 8;
  256. dest[1] = (q->qtype & 0x00ff) >> 0;
  257. dest[2] = (q->qclass & 0xff00) >> 8;
  258. dest[3] = (q->qclass & 0x00ff) >> 0;
  259. return i + 4;
  260. }
  261. #endif
  262. #ifdef L_decodeq
  263. int decode_question(unsigned char *message, int offset,
  264. struct resolv_question *q)
  265. {
  266. char temp[256];
  267. int i;
  268. i = decode_dotted(message, offset, temp, sizeof(temp));
  269. if (i < 0)
  270. return i;
  271. offset += i;
  272. q->dotted = strdup(temp);
  273. q->qtype = (message[offset + 0] << 8) | message[offset + 1];
  274. q->qclass = (message[offset + 2] << 8) | message[offset + 3];
  275. return i + 4;
  276. }
  277. #endif
  278. #ifdef L_lengthq
  279. int length_question(unsigned char *message, int offset)
  280. {
  281. int i;
  282. i = length_dotted(message, offset);
  283. if (i < 0)
  284. return i;
  285. return i + 4;
  286. }
  287. #endif
  288. #ifdef L_encodea
  289. int encode_answer(struct resolv_answer *a, unsigned char *dest, int maxlen)
  290. {
  291. int i;
  292. i = encode_dotted(a->dotted, dest, maxlen);
  293. if (i < 0)
  294. return i;
  295. dest += i;
  296. maxlen -= i;
  297. if (maxlen < (RRFIXEDSZ+a->rdlength))
  298. return -1;
  299. *dest++ = (a->atype & 0xff00) >> 8;
  300. *dest++ = (a->atype & 0x00ff) >> 0;
  301. *dest++ = (a->aclass & 0xff00) >> 8;
  302. *dest++ = (a->aclass & 0x00ff) >> 0;
  303. *dest++ = (a->ttl & 0xff000000) >> 24;
  304. *dest++ = (a->ttl & 0x00ff0000) >> 16;
  305. *dest++ = (a->ttl & 0x0000ff00) >> 8;
  306. *dest++ = (a->ttl & 0x000000ff) >> 0;
  307. *dest++ = (a->rdlength & 0xff00) >> 8;
  308. *dest++ = (a->rdlength & 0x00ff) >> 0;
  309. memcpy(dest, a->rdata, a->rdlength);
  310. return i + RRFIXEDSZ + a->rdlength;
  311. }
  312. #endif
  313. #ifdef L_decodea
  314. int decode_answer(unsigned char *message, int offset,
  315. struct resolv_answer *a)
  316. {
  317. char temp[256];
  318. int i;
  319. i = decode_dotted(message, offset, temp, sizeof(temp));
  320. if (i < 0)
  321. return i;
  322. message += offset + i;
  323. a->dotted = strdup(temp);
  324. a->atype = (message[0] << 8) | message[1];
  325. message += 2;
  326. a->aclass = (message[0] << 8) | message[1];
  327. message += 2;
  328. a->ttl = (message[0] << 24) |
  329. (message[1] << 16) | (message[2] << 8) | (message[3] << 0);
  330. message += 4;
  331. a->rdlength = (message[0] << 8) | message[1];
  332. message += 2;
  333. a->rdata = message;
  334. a->rdoffset = offset + i + RRFIXEDSZ;
  335. DPRINTF("i=%d,rdlength=%d\n", i, a->rdlength);
  336. return i + RRFIXEDSZ + a->rdlength;
  337. }
  338. #endif
  339. #ifdef L_encodep
  340. int encode_packet(struct resolv_header *h,
  341. struct resolv_question **q,
  342. struct resolv_answer **an,
  343. struct resolv_answer **ns,
  344. struct resolv_answer **ar,
  345. unsigned char *dest, int maxlen)
  346. {
  347. int i, total = 0;
  348. int j;
  349. i = encode_header(h, dest, maxlen);
  350. if (i < 0)
  351. return i;
  352. dest += i;
  353. maxlen -= i;
  354. total += i;
  355. for (j = 0; j < h->qdcount; j++) {
  356. i = encode_question(q[j], dest, maxlen);
  357. if (i < 0)
  358. return i;
  359. dest += i;
  360. maxlen -= i;
  361. total += i;
  362. }
  363. for (j = 0; j < h->ancount; j++) {
  364. i = encode_answer(an[j], dest, maxlen);
  365. if (i < 0)
  366. return i;
  367. dest += i;
  368. maxlen -= i;
  369. total += i;
  370. }
  371. for (j = 0; j < h->nscount; j++) {
  372. i = encode_answer(ns[j], dest, maxlen);
  373. if (i < 0)
  374. return i;
  375. dest += i;
  376. maxlen -= i;
  377. total += i;
  378. }
  379. for (j = 0; j < h->arcount; j++) {
  380. i = encode_answer(ar[j], dest, maxlen);
  381. if (i < 0)
  382. return i;
  383. dest += i;
  384. maxlen -= i;
  385. total += i;
  386. }
  387. return total;
  388. }
  389. #endif
  390. #ifdef L_decodep
  391. int decode_packet(unsigned char *data, struct resolv_header *h)
  392. {
  393. return decode_header(data, h);
  394. }
  395. #endif
  396. #ifdef L_formquery
  397. int form_query(int id, const char *name, int type, unsigned char *packet,
  398. int maxlen)
  399. {
  400. struct resolv_header h;
  401. struct resolv_question q;
  402. int i, j;
  403. memset(&h, 0, sizeof(h));
  404. h.id = id;
  405. h.qdcount = 1;
  406. q.dotted = (char *) name;
  407. q.qtype = type;
  408. q.qclass = C_IN; /* CLASS_IN */
  409. i = encode_header(&h, packet, maxlen);
  410. if (i < 0)
  411. return i;
  412. j = encode_question(&q, packet + i, maxlen - i);
  413. if (j < 0)
  414. return j;
  415. return i + j;
  416. }
  417. #endif
  418. #ifdef L_dnslookup
  419. int dns_caught_signal = 0;
  420. void dns_catch_signal(int signo)
  421. {
  422. dns_caught_signal = 1;
  423. }
  424. int dns_lookup(const char *name, int type, int nscount, char **nsip,
  425. unsigned char **outpacket, struct resolv_answer *a)
  426. {
  427. static int id = 1;
  428. int i, j, len, fd, pos;
  429. static int ns = 0;
  430. struct sockaddr_in sa;
  431. #ifdef __UCLIBC_HAS_IPV6__
  432. struct sockaddr_in6 sa6;
  433. #endif /* __UCLIBC_HAS_IPV6__ */
  434. int oldalarm;
  435. __sighandler_t oldhandler;
  436. struct resolv_header h;
  437. struct resolv_question q;
  438. int retries = 0;
  439. unsigned char * packet = malloc(PACKETSZ);
  440. unsigned char * lookup = malloc(MAXDNAME);
  441. int variant = 0;
  442. #ifdef __UCLIBC_HAS_IPV6__
  443. int v6;
  444. #endif /* __UCLIBC_HAS_IPV6__ */
  445. fd = -1;
  446. if (!packet || !lookup || !nscount)
  447. goto fail;
  448. DPRINTF("Looking up type %d answer for '%s'\n", type, name);
  449. ns %= nscount;
  450. while (retries++ < MAX_RETRIES) {
  451. #ifdef __UCLIBC_HAS_IPV6__
  452. v6 = (inet_pton(AF_INET6, nsip[ns], &sa6.sin6_addr) > 0);
  453. #endif /* __UCLIBC_HAS_IPV6__ */
  454. if (fd != -1)
  455. close(fd);
  456. #ifndef __UCLIBC_HAS_IPV6__
  457. fd = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP);
  458. #else /* __UCLIBC_HAS_IPV6__ */
  459. fd = socket(v6 ? AF_INET6 : AF_INET, SOCK_DGRAM, IPPROTO_UDP);
  460. #endif /* __UCLIBC_HAS_IPV6__ */
  461. if (fd == -1)
  462. goto fail;
  463. memset(packet, 0, PACKETSZ);
  464. memset(&h, 0, sizeof(h));
  465. h.id = ++id;
  466. h.qdcount = 1;
  467. h.rd = 1;
  468. DPRINTF("encoding header\n", h.rd);
  469. i = encode_header(&h, packet, PACKETSZ);
  470. if (i < 0)
  471. goto fail;
  472. strncpy(lookup,name,MAXDNAME);
  473. if (variant < searchdomains && strchr(lookup, '.') == NULL)
  474. {
  475. strncat(lookup,".", MAXDNAME);
  476. strncat(lookup,searchdomain[variant], MAXDNAME);
  477. }
  478. DPRINTF("lookup name: %s\n", lookup);
  479. q.dotted = (char *)lookup;
  480. q.qtype = type;
  481. q.qclass = C_IN; /* CLASS_IN */
  482. j = encode_question(&q, packet+i, PACKETSZ-i);
  483. if (j < 0)
  484. goto fail;
  485. len = i + j;
  486. DPRINTF("On try %d, sending query to port %d of machine %s\n",
  487. retries, NAMESERVER_PORT, nsip[ns]);
  488. #ifndef __UCLIBC_HAS_IPV6__
  489. sa.sin_family = AF_INET;
  490. sa.sin_port = htons(NAMESERVER_PORT);
  491. sa.sin_addr.s_addr = inet_addr(nsip[ns]);
  492. #else /* __UCLIBC_HAS_IPV6__ */
  493. if (v6) {
  494. sa6.sin6_family = AF_INET6;
  495. sa6.sin6_port = htons(NAMESERVER_PORT);
  496. /* sa6.sin6_addr is already here */
  497. } else {
  498. sa.sin_family = AF_INET;
  499. sa.sin_port = htons(NAMESERVER_PORT);
  500. sa.sin_addr.s_addr = inet_addr(nsip[ns]);
  501. }
  502. #endif /* __UCLIBC_HAS_IPV6__ */
  503. #ifndef __UCLIBC_HAS_IPV6__
  504. if (connect(fd, (struct sockaddr *) &sa, sizeof(sa)) == -1) {
  505. #else /* __UCLIBC_HAS_IPV6__ */
  506. if (connect(fd, (struct sockaddr *) (v6 ? &sa6 : &sa),
  507. v6 ? sizeof(sa6) : sizeof(sa)) == -1) {
  508. #endif /* __UCLIBC_HAS_IPV6__ */
  509. if (errno == ENETUNREACH) {
  510. /* routing error, presume not transient */
  511. goto tryall;
  512. } else
  513. /* retry */
  514. continue;
  515. }
  516. DPRINTF("Transmitting packet of length %d, id=%d, qr=%d\n",
  517. len, h.id, h.qr);
  518. send(fd, packet, len, 0);
  519. dns_caught_signal = 0;
  520. oldalarm = alarm(REPLY_TIMEOUT);
  521. oldhandler = signal(SIGALRM, dns_catch_signal);
  522. i = recv(fd, packet, PACKETSZ, 0);
  523. alarm(0);
  524. signal(SIGALRM, oldhandler);
  525. alarm(oldalarm);
  526. DPRINTF("Timeout=%d, len=%d\n", dns_caught_signal, i);
  527. if (dns_caught_signal)
  528. /* timed out, so retry send and receive,
  529. to next nameserver on queue */
  530. goto again;
  531. if (i < HFIXEDSZ)
  532. /* too short ! */
  533. goto again;
  534. decode_header(packet, &h);
  535. DPRINTF("id = %d, qr = %d\n", h.id, h.qr);
  536. if ((h.id != id) || (!h.qr))
  537. /* unsolicited */
  538. goto again;
  539. DPRINTF("Got response %s\n", "(i think)!");
  540. DPRINTF("qrcount=%d,ancount=%d,nscount=%d,arcount=%d\n",
  541. h.qdcount, h.ancount, h.nscount, h.arcount);
  542. DPRINTF("opcode=%d,aa=%d,tc=%d,rd=%d,ra=%d,rcode=%d\n",
  543. h.opcode, h.aa, h.tc, h.rd, h.ra, h.rcode);
  544. if ((h.rcode) || (h.ancount < 1)) {
  545. /* negative result, not present */
  546. goto again;
  547. }
  548. pos = HFIXEDSZ;
  549. for (j = 0; j < h.qdcount; j++) {
  550. DPRINTF("Skipping question %d at %d\n", j, pos);
  551. i = length_question(packet, pos);
  552. DPRINTF("Length of question %d is %d\n", j, i);
  553. if (i < 0)
  554. goto again;
  555. pos += i;
  556. }
  557. DPRINTF("Decoding answer at pos %d\n", pos);
  558. for (j=0;j<h.ancount;j++)
  559. {
  560. i = decode_answer(packet, pos, a);
  561. if (i<0) {
  562. DPRINTF("failed decode %d\n", i);
  563. goto again;
  564. }
  565. /* For all but T_SIG, accept first answer */
  566. if (a->atype != T_SIG)
  567. break;
  568. DPRINTF("skipping T_SIG %d\n", i);
  569. free(a->dotted);
  570. pos += i;
  571. }
  572. DPRINTF("Answer name = |%s|\n", a->dotted);
  573. DPRINTF("Answer type = |%d|\n", a->atype);
  574. close(fd);
  575. if (outpacket)
  576. *outpacket = packet;
  577. else
  578. free(packet);
  579. return (0); /* success! */
  580. tryall:
  581. /* if there are other nameservers, give them a go,
  582. otherwise return with error */
  583. variant = 0;
  584. if (retries >= nscount*(searchdomains+1))
  585. goto fail;
  586. again:
  587. /* if there are searchdomains, try them or fallback as passed */
  588. if (variant < searchdomains) {
  589. /* next search */
  590. variant++;
  591. } else {
  592. /* next server, first search */
  593. ns = (ns + 1) % nscount;
  594. variant = 0;
  595. }
  596. }
  597. fail:
  598. if (fd != -1)
  599. close(fd);
  600. if (lookup)
  601. free(lookup);
  602. if (packet)
  603. free(packet);
  604. return -1;
  605. }
  606. #endif
  607. #ifdef L_resolveaddress
  608. int resolve_address(const char *address, int nscount,
  609. char **nsip, struct in_addr *in)
  610. {
  611. unsigned char *packet;
  612. struct resolv_answer a;
  613. char temp[256];
  614. int i;
  615. int nest = 0;
  616. if (!address || !in)
  617. return -1;
  618. strncpy(temp, address, sizeof(temp));
  619. for (;;) {
  620. i = dns_lookup(temp, T_A, nscount, nsip, &packet, &a);
  621. if (i < 0)
  622. return -1;
  623. free(a.dotted);
  624. if (a.atype == T_CNAME) { /* CNAME */
  625. DPRINTF("Got a CNAME in resolve_address()\n");
  626. i = decode_dotted(packet, a.rdoffset, temp, sizeof(temp));
  627. free(packet);
  628. if (i < 0)
  629. return -1;
  630. if (++nest > MAX_RECURSE)
  631. return -1;
  632. continue;
  633. } else if (a.atype == T_A) { /* ADDRESS */
  634. free(packet);
  635. break;
  636. } else {
  637. free(packet);
  638. return -1;
  639. }
  640. }
  641. if (in)
  642. memcpy(in, a.rdata, INADDRSZ); /* IPv4 T_A */
  643. return 0;
  644. }
  645. #endif
  646. #ifdef L_resolvemailbox
  647. int resolve_mailbox(const char *address, int nscount,
  648. char **nsip, struct in_addr *in)
  649. {
  650. struct resolv_answer a;
  651. unsigned char *packet;
  652. char temp[256];
  653. int nest = 0;
  654. int i;
  655. if (!address || !in)
  656. return -1;
  657. /* look up mail exchange */
  658. i = dns_lookup(address, T_MX, nscount, nsip, &packet, &a);
  659. strncpy(temp, address, sizeof(temp));
  660. if (i >= 0) {
  661. i = decode_dotted(packet, a.rdoffset+2, temp, sizeof(temp));
  662. free(packet);
  663. }
  664. for (;;) {
  665. i = dns_lookup(temp, T_A, nscount, nsip, &packet, &a);
  666. if (i < 0)
  667. return -1;
  668. free(a.dotted);
  669. if (a.atype == T_CNAME) { /* CNAME */
  670. DPRINTF("Got a CNAME in resolve_mailbox()\n");
  671. i = decode_dotted(packet, a.rdoffset, temp, sizeof(temp));
  672. free(packet);
  673. if (i < 0)
  674. return i;
  675. if (++nest > MAX_RECURSE)
  676. return -1;
  677. continue;
  678. } else if (a.atype == T_A) { /* ADDRESS */
  679. free(packet);
  680. break;
  681. } else {
  682. free(packet);
  683. return -1;
  684. }
  685. }
  686. if (in)
  687. memcpy(in, a.rdata, INADDRSZ); /* IPv4 */
  688. return 0;
  689. }
  690. #endif
  691. #ifdef L_opennameservers
  692. int nameservers;
  693. char * nameserver[MAX_SERVERS];
  694. int searchdomains;
  695. char * searchdomain[MAX_SEARCH];
  696. /*
  697. * we currently read formats not quite the same as that on normal
  698. * unix systems, we can have a list of nameservers after the keyword.
  699. */
  700. int open_nameservers()
  701. {
  702. FILE *fp;
  703. int i;
  704. #define RESOLV_ARGS 5
  705. char szBuffer[128], *p, *argv[RESOLV_ARGS];
  706. int argc;
  707. if (nameservers > 0)
  708. return 0;
  709. if ((fp = fopen("/etc/resolv.conf", "r")) ||
  710. (fp = fopen("/etc/config/resolv.conf", "r"))) {
  711. while (fgets(szBuffer, sizeof(szBuffer), fp) != NULL) {
  712. for (p = szBuffer; *p && isspace(*p); p++)
  713. /* skip white space */;
  714. if (*p == '\0' || *p == '\n' || *p == '#') /* skip comments etc */
  715. continue;
  716. argc = 0;
  717. while (*p && argc < RESOLV_ARGS) {
  718. argv[argc++] = p;
  719. while (*p && !isspace(*p) && *p != '\n')
  720. p++;
  721. while (*p && (isspace(*p) || *p == '\n')) /* remove spaces */
  722. *p++ = '\0';
  723. }
  724. if (strcmp(argv[0], "nameserver") == 0) {
  725. for (i = 1; i < argc && nameservers < MAX_SERVERS; i++) {
  726. nameserver[nameservers++] = strdup(argv[i]);
  727. DPRINTF("adding nameserver %s\n", argv[i]);
  728. }
  729. }
  730. /* domain and search are mutually exclusive, the last one wins */
  731. if (strcmp(argv[0],"domain")==0 || strcmp(argv[0],"search")==0) {
  732. while (searchdomains > 0) {
  733. free(searchdomain[--searchdomains]);
  734. searchdomain[searchdomains] = NULL;
  735. }
  736. for (i=1; i < argc && searchdomains < MAX_SEARCH; i++) {
  737. searchdomain[searchdomains++] = strdup(argv[i]);
  738. DPRINTF("adding search %s\n", argv[i]);
  739. }
  740. }
  741. }
  742. fclose(fp);
  743. } else {
  744. DPRINTF("failed to open %s\n", "resolv.conf");
  745. }
  746. DPRINTF("nameservers = %d\n", nameservers);
  747. return 0;
  748. }
  749. #endif
  750. #ifdef L_closenameservers
  751. void close_nameservers(void)
  752. {
  753. while (nameservers > 0) {
  754. free(nameserver[--nameservers]);
  755. nameserver[nameservers] = NULL;
  756. }
  757. while (searchdomains > 0) {
  758. free(searchdomain[--searchdomains]);
  759. searchdomain[searchdomains] = NULL;
  760. }
  761. }
  762. #endif
  763. #ifdef L_resolvename
  764. const char *resolve_name(const char *name, int mailbox)
  765. {
  766. struct in_addr in;
  767. int i;
  768. /* shortcut: is it a valid IP address to begin with? */
  769. if (inet_aton(name, &in))
  770. return name;
  771. open_nameservers();
  772. DPRINTF("looking up '%s', mailbox=%d, nameservers=%d\n",
  773. name, mailbox, nameservers);
  774. if (mailbox)
  775. i = resolve_mailbox(name, nameservers, nameserver, &in);
  776. else
  777. i = resolve_address(name, nameservers, nameserver, &in);
  778. if (i < 0)
  779. return 0;
  780. DPRINTF("success = '%s'\n", inet_ntoa(in));
  781. return inet_ntoa(in);
  782. }
  783. #endif
  784. #ifdef L_gethostbyname
  785. struct hostent *gethostbyname(const char *name)
  786. {
  787. static struct hostent h;
  788. static char namebuf[256];
  789. static struct in_addr in;
  790. static struct in_addr *addr_list[2];
  791. struct hostent *hp;
  792. unsigned char *packet;
  793. struct resolv_answer a;
  794. int i;
  795. int nest = 0;
  796. open_nameservers();
  797. if (!name)
  798. return 0;
  799. if ((hp = get_hosts_byname(name))) /* do /etc/hosts first */
  800. return(hp);
  801. memset(&h, 0, sizeof(h));
  802. addr_list[0] = &in;
  803. addr_list[1] = 0;
  804. strncpy(namebuf, name, sizeof(namebuf));
  805. /* First check if this is already an address */
  806. if (inet_aton(name, &in)) {
  807. h.h_name = namebuf;
  808. h.h_addrtype = AF_INET;
  809. h.h_length = sizeof(in);
  810. h.h_addr_list = (char **) addr_list;
  811. return &h;
  812. }
  813. for (;;) {
  814. i = dns_lookup(namebuf, 1, nameservers, nameserver, &packet, &a);
  815. if (i < 0)
  816. return 0;
  817. strncpy(namebuf, a.dotted, sizeof(namebuf));
  818. free(a.dotted);
  819. if (a.atype == T_CNAME) { /* CNAME */
  820. DPRINTF("Got a CNAME in gethostbyname()\n");
  821. i = decode_dotted(packet, a.rdoffset, namebuf, sizeof(namebuf));
  822. free(packet);
  823. if (i < 0)
  824. return 0;
  825. if (++nest > MAX_RECURSE)
  826. return 0;
  827. continue;
  828. } else if (a.atype == T_A) { /* ADDRESS */
  829. memcpy(&in, a.rdata, sizeof(in));
  830. h.h_name = namebuf;
  831. h.h_addrtype = AF_INET;
  832. h.h_length = sizeof(in);
  833. h.h_addr_list = (char **) addr_list;
  834. free(packet);
  835. break;
  836. } else {
  837. free(packet);
  838. return 0;
  839. }
  840. }
  841. return &h;
  842. }
  843. #endif
  844. #ifdef L_gethostbyname2
  845. struct hostent *gethostbyname2(const char *name, int family)
  846. {
  847. #ifndef __UCLIBC_HAS_IPV6__
  848. return family == AF_INET ? gethostbyname(name) : (struct hostent*)0;
  849. #else /* __UCLIBC_HAS_IPV6__ */
  850. static struct hostent h;
  851. static char namebuf[256];
  852. static struct in6_addr in;
  853. static struct in6_addr *addr_list[2];
  854. struct hostent *hp;
  855. unsigned char *packet;
  856. struct resolv_answer a;
  857. int i;
  858. int nest = 0;
  859. if (family == AF_INET)
  860. return gethostbyname(name);
  861. if (family != AF_INET6)
  862. return NULL;
  863. open_nameservers();
  864. if (!name)
  865. return 0;
  866. if ((hp = get_hosts_byname(name))) /* do /etc/hosts first */
  867. return(hp);
  868. memset(&h, 0, sizeof(h));
  869. addr_list[0] = &in;
  870. addr_list[1] = 0;
  871. strncpy(namebuf, name, sizeof(namebuf));
  872. /* First check if this is already an address */
  873. if (inet_pton(AF_INET6, name, &in)) {
  874. h.h_name = namebuf;
  875. h.h_addrtype = AF_INET6;
  876. h.h_length = sizeof(in);
  877. h.h_addr_list = (char **) addr_list;
  878. return &h;
  879. }
  880. for (;;) {
  881. i = dns_lookup(namebuf, T_AAAA, nameservers, nameserver, &packet, &a);
  882. if (i < 0)
  883. return 0;
  884. strncpy(namebuf, a.dotted, sizeof(namebuf));
  885. free(a.dotted);
  886. if (a.atype == T_CNAME) { /* CNAME */
  887. DPRINTF("Got a CNAME in gethostbyname()\n");
  888. i = decode_dotted(packet, a.rdoffset, namebuf, sizeof(namebuf));
  889. free(packet);
  890. if (i < 0)
  891. return 0;
  892. if (++nest > MAX_RECURSE)
  893. return 0;
  894. continue;
  895. } else if (a.atype == T_AAAA) { /* ADDRESS */
  896. memcpy(&in, a.rdata, sizeof(in));
  897. h.h_name = namebuf;
  898. h.h_addrtype = AF_INET6;
  899. h.h_length = sizeof(in);
  900. h.h_addr_list = (char **) addr_list;
  901. free(packet);
  902. break;
  903. } else {
  904. free(packet);
  905. return 0;
  906. }
  907. }
  908. return &h;
  909. #endif /* __UCLIBC_HAS_IPV6__ */
  910. }
  911. #endif
  912. #ifdef L_getnetbyname
  913. struct netent * getnetbyname(const char * name)
  914. {
  915. return NULL;
  916. }
  917. #endif
  918. #ifdef L_res_init
  919. int res_init(void)
  920. {
  921. return(0);
  922. }
  923. #endif
  924. #ifdef L_res_query
  925. #ifndef MIN
  926. #define MIN(x, y) ((x) < (y) ? (x) : (y))
  927. #endif
  928. int res_query(const char *dname, int class, int type,
  929. unsigned char *answer, int anslen)
  930. {
  931. unsigned char * packet = 0;
  932. struct resolv_answer a;
  933. int i;
  934. open_nameservers();
  935. if (!dname || class != 1 /* CLASS_IN */)
  936. return(-1);
  937. memset((char *) &a, '\0', sizeof(a));
  938. i = dns_lookup(dname, type, nameservers, nameserver, &packet, &a);
  939. if (i < 0)
  940. return(-1);
  941. free(a.dotted);
  942. if (a.atype == type) { /* CNAME*/
  943. if (anslen && answer)
  944. memcpy(answer, a.rdata, MIN(anslen, a.rdlength));
  945. if (packet)
  946. free(packet);
  947. return(MIN(anslen, a.rdlength));
  948. }
  949. if (packet)
  950. free(packet);
  951. return 0;
  952. }
  953. #endif
  954. #ifdef L_gethostbyaddr
  955. struct hostent *gethostbyaddr (const void *addr, socklen_t len, int type)
  956. {
  957. static struct hostent h;
  958. static char namebuf[256];
  959. static struct in_addr in;
  960. static struct in_addr *addr_list[2];
  961. struct hostent *hp;
  962. unsigned char *packet;
  963. struct resolv_answer a;
  964. int i;
  965. int nest = 0;
  966. if (!addr || (len != sizeof(in)) || (type != AF_INET))
  967. return 0;
  968. if ((hp = get_hosts_byaddr(addr, len, type))) /* do /etc/hosts first */
  969. return(hp);
  970. memcpy(&in.s_addr, addr, len);
  971. open_nameservers();
  972. memset(&h, 0, sizeof(h));
  973. addr_list[0] = &in;
  974. addr_list[1] = 0;
  975. sprintf(namebuf, "%d.%d.%d.%d.in-addr.arpa",
  976. (in.s_addr >> 24) & 0xff,
  977. (in.s_addr >> 16) & 0xff,
  978. (in.s_addr >> 8) & 0xff,
  979. (in.s_addr >> 0) & 0xff);
  980. for (;;) {
  981. i = dns_lookup(namebuf, T_PTR, nameservers, nameserver, &packet, &a);
  982. if (i < 0)
  983. return 0;
  984. strncpy(namebuf, a.dotted, sizeof(namebuf));
  985. free(a.dotted);
  986. if (a.atype == T_CNAME) { /* CNAME */
  987. DPRINTF("Got a CNAME in gethostbyaddr()\n");
  988. i = decode_dotted(packet, a.rdoffset, namebuf, sizeof(namebuf));
  989. free(packet);
  990. if (i < 0)
  991. return 0;
  992. if (++nest > MAX_RECURSE)
  993. return 0;
  994. continue;
  995. } else if (a.atype == T_PTR) { /* ADDRESS */
  996. i = decode_dotted(packet, a.rdoffset, namebuf, sizeof(namebuf));
  997. free(packet);
  998. h.h_name = namebuf;
  999. h.h_addrtype = AF_INET;
  1000. h.h_length = sizeof(in);
  1001. h.h_addr_list = (char **) addr_list;
  1002. break;
  1003. } else {
  1004. free(packet);
  1005. return 0;
  1006. }
  1007. }
  1008. return &h;
  1009. }
  1010. #endif
  1011. #ifdef L_read_etc_hosts
  1012. struct hostent * read_etc_hosts(const char * name, int ip)
  1013. {
  1014. static struct hostent h;
  1015. static struct in_addr in;
  1016. static struct in_addr *addr_list[2];
  1017. #ifdef __UCLIBC_HAS_IPV6__
  1018. static struct in6_addr in6;
  1019. static struct in6_addr *addr_list6[2];
  1020. #endif /* __UCLIBC_HAS_IPV6__ */
  1021. static char line[80];
  1022. FILE *fp;
  1023. char *cp;
  1024. #define MAX_ALIAS 5
  1025. char *alias[MAX_ALIAS];
  1026. int aliases, i;
  1027. if ((fp = fopen("/etc/hosts", "r")) == NULL &&
  1028. (fp = fopen("/etc/config/hosts", "r")) == NULL)
  1029. return((struct hostent *) NULL);
  1030. while (fgets(line, sizeof(line), fp)) {
  1031. if ((cp = strchr(line, '#')))
  1032. *cp = '\0';
  1033. aliases = 0;
  1034. cp = line;
  1035. while (*cp) {
  1036. while (*cp && isspace(*cp))
  1037. *cp++ = '\0';
  1038. if (!*cp)
  1039. continue;
  1040. if (aliases < MAX_ALIAS)
  1041. alias[aliases++] = cp;
  1042. while (*cp && !isspace(*cp))
  1043. cp++;
  1044. }
  1045. if (aliases < 2)
  1046. continue; /* syntax error really */
  1047. if (ip) {
  1048. if (strcmp(name, alias[0]) != 0)
  1049. continue;
  1050. } else {
  1051. for (i = 1; i < aliases; i++)
  1052. if (strcasecmp(name, alias[i]) == 0)
  1053. break;
  1054. if (i >= aliases)
  1055. continue;
  1056. }
  1057. #ifndef __UCLIBC_HAS_IPV6__
  1058. if (inet_aton(alias[0], &in) == 0)
  1059. break; /* bad ip address */
  1060. #else /* __UCLIBC_HAS_IPV6__ */
  1061. if (inet_aton(alias[0], &in) == 0) {
  1062. if (inet_pton(AF_INET6, alias[0], &in6) == 0) {
  1063. addr_list6[0] = &in6;
  1064. addr_list6[1] = 0;
  1065. h.h_name = alias[1];
  1066. h.h_addrtype = AF_INET6;
  1067. h.h_length = sizeof(in6);
  1068. h.h_addr_list = (char**) addr_list6;
  1069. fclose(fp);
  1070. return(&h);
  1071. } else
  1072. break; /* bad ip address */
  1073. }
  1074. #endif /* __UCLIBC_HAS_IPV6__ */
  1075. addr_list[0] = &in;
  1076. addr_list[1] = 0;
  1077. h.h_name = alias[1];
  1078. h.h_addrtype = AF_INET;
  1079. h.h_length = sizeof(in);
  1080. h.h_addr_list = (char**) addr_list;
  1081. fclose(fp);
  1082. return(&h);
  1083. }
  1084. fclose(fp);
  1085. return((struct hostent *) NULL);
  1086. }
  1087. #endif
  1088. #ifdef L_get_hosts_byname
  1089. struct hostent * get_hosts_byname(const char * name)
  1090. {
  1091. return(read_etc_hosts(name, 0));
  1092. }
  1093. #endif
  1094. #ifdef L_get_hosts_byaddr
  1095. struct hostent * get_hosts_byaddr(const char * addr, int len, int type)
  1096. {
  1097. char ipaddr[20];
  1098. if (type != AF_INET || len != sizeof(struct in_addr))
  1099. return((struct hostent *) NULL);
  1100. strcpy(ipaddr, inet_ntoa(* (struct in_addr *) addr));
  1101. return(read_etc_hosts(ipaddr, 1));
  1102. }
  1103. #endif