resolv.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886
  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. #include <string.h>
  12. #include <stdio.h>
  13. #include <signal.h>
  14. #include <sys/socket.h>
  15. #include <sys/types.h>
  16. #include <netinet/in.h>
  17. #include <arpa/inet.h>
  18. #include <stdlib.h>
  19. #include <unistd.h>
  20. #include <cfgfile.h>
  21. #include <resolv.h>
  22. #define DNS_SERVICE 53
  23. #define MAX_RECURSE 5
  24. #define REPLY_TIMEOUT 10
  25. #define MAX_RETRIES 15
  26. #undef DEBUG
  27. #ifdef DEBUG
  28. #define DPRINTF(X,args...) printf(X,args...)
  29. #else
  30. #define DPRINTF(X,args...)
  31. #endif /* DEBUG */
  32. #ifdef L_encodeh
  33. int encode_header(struct resolv_header *h, unsigned char *dest, int maxlen)
  34. {
  35. if (maxlen < 12)
  36. return -1;
  37. dest[0] = (h->id & 0xff00) >> 8;
  38. dest[1] = (h->id & 0x00ff) >> 0;
  39. dest[2] = (h->qr ? 0x80 : 0) |
  40. ((h->opcode & 0x0f) << 3) |
  41. (h->aa ? 0x04 : 0) | (h->tc ? 0x02 : 0) | (h->rd ? 0x01 : 0);
  42. dest[3] = (h->ra ? 0x80 : 0) | (h->rcode & 0x0f);
  43. dest[4] = (h->qdcount & 0xff00) >> 8;
  44. dest[5] = (h->qdcount & 0x00ff) >> 0;
  45. dest[6] = (h->ancount & 0xff00) >> 8;
  46. dest[7] = (h->ancount & 0x00ff) >> 0;
  47. dest[8] = (h->nscount & 0xff00) >> 8;
  48. dest[9] = (h->nscount & 0x00ff) >> 0;
  49. dest[10] = (h->arcount & 0xff00) >> 8;
  50. dest[11] = (h->arcount & 0x00ff) >> 0;
  51. return 12;
  52. }
  53. #endif
  54. #ifdef L_decodeh
  55. int decode_header(unsigned char *data, struct resolv_header *h)
  56. {
  57. h->id = (data[0] << 8) | data[1];
  58. h->qr = (data[2] & 0x80) ? 1 : 0;
  59. h->opcode = (data[2] >> 3) & 0x0f;
  60. h->aa = (data[2] & 0x04) ? 1 : 0;
  61. h->tc = (data[2] & 0x02) ? 1 : 0;
  62. h->rd = (data[2] & 0x01) ? 1 : 0;
  63. h->ra = (data[3] & 0x80) ? 1 : 0;
  64. h->rcode = data[3] & 0x0f;
  65. h->qdcount = (data[4] << 8) | data[5];
  66. h->ancount = (data[6] << 8) | data[7];
  67. h->nscount = (data[8] << 8) | data[9];
  68. h->arcount = (data[10] << 8) | data[11];
  69. return 12;
  70. }
  71. #endif
  72. #ifdef L_encoded
  73. /* Encode a dotted string into nameserver transport-level encoding.
  74. This routine is fairly dumb, and doesn't attempt to compress
  75. the data */
  76. int encode_dotted(const char *dotted, unsigned char *dest, int maxlen)
  77. {
  78. int used = 0;
  79. while (dotted && *dotted) {
  80. char *c = strchr(dotted, '.');
  81. int l = c ? c - dotted : strlen(dotted);
  82. if (l >= (maxlen - used - 1))
  83. return -1;
  84. dest[used++] = l;
  85. memcpy(dest + used, dotted, l);
  86. used += l;
  87. if (c)
  88. dotted = c + 1;
  89. else
  90. break;
  91. }
  92. if (maxlen < 1)
  93. return -1;
  94. dest[used++] = 0;
  95. return used;
  96. }
  97. #endif
  98. #ifdef L_decoded
  99. /* Decode a dotted string from nameserver transport-level encoding.
  100. This routine understands compressed data. */
  101. int decode_dotted(const unsigned char *data, int offset,
  102. char *dest, int maxlen)
  103. {
  104. int l;
  105. int measure = 1;
  106. int total = 0;
  107. int used = 0;
  108. if (!data)
  109. return -1;
  110. while ((measure && total++), (l = data[offset++])) {
  111. if ((l & 0xc0) == (0xc0)) {
  112. if (measure)
  113. total++;
  114. /* compressed item, redirect */
  115. offset = ((l & 0x3f) << 8) | data[offset];
  116. measure = 0;
  117. continue;
  118. }
  119. if ((used + l + 1) >= maxlen)
  120. return -1;
  121. memcpy(dest + used, data + offset, l);
  122. offset += l;
  123. used += l;
  124. if (measure)
  125. total += l;
  126. if (data[offset] != 0)
  127. dest[used++] = '.';
  128. else
  129. dest[used++] = '\0';
  130. }
  131. DPRINTF("Total decode len = %d\n", total);
  132. return total;
  133. }
  134. #endif
  135. #ifdef L_lengthd
  136. int length_dotted(const unsigned char *data, int offset)
  137. {
  138. int orig_offset = offset;
  139. int l;
  140. if (!data)
  141. return -1;
  142. while ((l = data[offset++])) {
  143. if ((l & 0xc0) == (0xc0)) {
  144. offset++;
  145. break;
  146. }
  147. offset += l;
  148. }
  149. return offset - orig_offset;
  150. }
  151. #endif
  152. #ifdef L_encodeq
  153. int encode_question(struct resolv_question *q,
  154. unsigned char *dest, int maxlen)
  155. {
  156. int i;
  157. i = encode_dotted(q->dotted, dest, maxlen);
  158. if (i < 0)
  159. return i;
  160. dest += i;
  161. maxlen -= i;
  162. if (maxlen < 4)
  163. return -1;
  164. dest[0] = (q->qtype & 0xff00) >> 8;
  165. dest[1] = (q->qtype & 0x00ff) >> 0;
  166. dest[2] = (q->qclass & 0xff00) >> 8;
  167. dest[3] = (q->qclass & 0x00ff) >> 0;
  168. return i + 4;
  169. }
  170. #endif
  171. #ifdef L_decodeq
  172. int decode_question(unsigned char *message, int offset,
  173. struct resolv_question *q)
  174. {
  175. char temp[256];
  176. int i;
  177. i = decode_dotted(message, offset, temp, 256);
  178. if (i < 0)
  179. return i;
  180. offset += i;
  181. q->dotted = strdup(temp);
  182. q->qtype = (message[offset + 0] << 8) | message[offset + 1];
  183. q->qclass = (message[offset + 2] << 8) | message[offset + 3];
  184. return i + 4;
  185. }
  186. #endif
  187. #ifdef L_lengthq
  188. int length_question(unsigned char *message, int offset)
  189. {
  190. int i;
  191. i = length_dotted(message, offset);
  192. if (i < 0)
  193. return i;
  194. return i + 4;
  195. }
  196. #endif
  197. #ifdef L_encodea
  198. int encode_answer(struct resolv_answer *a, unsigned char *dest, int maxlen)
  199. {
  200. int i;
  201. i = encode_dotted(a->dotted, dest, maxlen);
  202. if (i < 0)
  203. return i;
  204. dest += i;
  205. maxlen -= i;
  206. if (maxlen < (10 + a->rdlength))
  207. return -1;
  208. *dest++ = (a->atype & 0xff00) >> 8;
  209. *dest++ = (a->atype & 0x00ff) >> 0;
  210. *dest++ = (a->aclass & 0xff00) >> 8;
  211. *dest++ = (a->aclass & 0x00ff) >> 0;
  212. *dest++ = (a->ttl & 0xff000000) >> 24;
  213. *dest++ = (a->ttl & 0x00ff0000) >> 16;
  214. *dest++ = (a->ttl & 0x0000ff00) >> 8;
  215. *dest++ = (a->ttl & 0x000000ff) >> 0;
  216. *dest++ = (a->rdlength & 0xff00) >> 8;
  217. *dest++ = (a->rdlength & 0x00ff) >> 0;
  218. memcpy(dest, a->rdata, a->rdlength);
  219. return i + 10 + a->rdlength;
  220. }
  221. #endif
  222. #ifdef L_decodea
  223. int decode_answer(unsigned char *message, int offset,
  224. struct resolv_answer *a)
  225. {
  226. char temp[256];
  227. int i;
  228. i = decode_dotted(message, offset, temp, 256);
  229. if (i < 0)
  230. return i;
  231. message += offset + i;
  232. a->dotted = strdup(temp);
  233. a->atype = (message[0] << 8) | message[1];
  234. message += 2;
  235. a->aclass = (message[0] << 8) | message[1];
  236. message += 2;
  237. a->ttl = (message[0] << 24) |
  238. (message[1] << 16) | (message[2] << 8) | (message[3] << 0);
  239. message += 4;
  240. a->rdlength = (message[0] << 8) | message[1];
  241. message += 2;
  242. a->rdata = message;
  243. a->rdoffset = offset + i + 10;
  244. DPRINTF("i=%d,rdlength=%d\n", i, a->rdlength);
  245. return i + 10 + a->rdlength;
  246. }
  247. #endif
  248. #ifdef L_encodep
  249. int encode_packet(struct resolv_header *h,
  250. struct resolv_question **q,
  251. struct resolv_answer **an,
  252. struct resolv_answer **ns,
  253. struct resolv_answer **ar,
  254. unsigned char *dest, int maxlen)
  255. {
  256. int i, total = 0;
  257. int j;
  258. i = encode_header(h, dest, maxlen);
  259. if (i < 0)
  260. return i;
  261. dest += i;
  262. maxlen -= i;
  263. total += i;
  264. for (j = 0; j < h->qdcount; j++) {
  265. i = encode_question(q[j], dest, maxlen);
  266. if (i < 0)
  267. return i;
  268. dest += i;
  269. maxlen -= i;
  270. total += i;
  271. }
  272. for (j = 0; j < h->ancount; j++) {
  273. i = encode_answer(an[j], dest, maxlen);
  274. if (i < 0)
  275. return i;
  276. dest += i;
  277. maxlen -= i;
  278. total += i;
  279. }
  280. for (j = 0; j < h->nscount; j++) {
  281. i = encode_answer(ns[j], dest, maxlen);
  282. if (i < 0)
  283. return i;
  284. dest += i;
  285. maxlen -= i;
  286. total += i;
  287. }
  288. for (j = 0; j < h->arcount; j++) {
  289. i = encode_answer(ar[j], dest, maxlen);
  290. if (i < 0)
  291. return i;
  292. dest += i;
  293. maxlen -= i;
  294. total += i;
  295. }
  296. return total;
  297. }
  298. #endif
  299. #ifdef L_decodep
  300. int decode_packet(unsigned char *data, struct resolv_header *h)
  301. {
  302. return decode_header(data, h);
  303. }
  304. #endif
  305. #ifdef L_formquery
  306. int form_query(int id, const char *name, int type, unsigned char *packet,
  307. int maxlen)
  308. {
  309. struct resolv_header h;
  310. struct resolv_question q;
  311. int i, j;
  312. memset(&h, 0, sizeof(h));
  313. h.id = id;
  314. h.qdcount = 1;
  315. q.dotted = (char *) name;
  316. q.qtype = type;
  317. q.qclass = 1 /*CLASS_IN */ ;
  318. i = encode_header(&h, packet, maxlen);
  319. if (i < 0)
  320. return i;
  321. j = encode_question(&q, packet + i, maxlen - i);
  322. if (j < 0)
  323. return j;
  324. return i + j;
  325. }
  326. #endif
  327. #ifdef L_dnslookup
  328. int dns_caught_signal = 0;
  329. void dns_catch_signal(int signo)
  330. {
  331. dns_caught_signal = 1;
  332. }
  333. int dns_lookup(const char *name, int type, int nscount, const char **nsip,
  334. unsigned char **outpacket, struct resolv_answer *a)
  335. {
  336. static int id = 1;
  337. int i, j, len;
  338. int fd;
  339. int pos;
  340. static int ns = 0;
  341. struct sockaddr_in sa;
  342. int oldalarm;
  343. __sighandler_t oldhandler;
  344. struct resolv_header h;
  345. struct resolv_question q;
  346. int retries = 0;
  347. unsigned char *packet = malloc(512);
  348. if (!packet)
  349. goto fail1;
  350. DPRINTF("Looking up type %d answer for '%s'\n", type, name);
  351. if (!nscount)
  352. goto fail1;
  353. ns %= nscount;
  354. fd = -1;
  355. while (retries++ < MAX_RETRIES) {
  356. if (fd != -1)
  357. close(fd);
  358. fd = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP);
  359. if (fd == -1)
  360. goto fail2;
  361. memset(packet, 0, 512);
  362. memset(&h, 0, sizeof(h));
  363. h.id = ++id;
  364. h.qdcount = 1;
  365. h.rd = 1;
  366. DPRINTF("encoding header\n");
  367. i = encode_header(&h, packet, 512);
  368. if (i < 0)
  369. goto fail3;
  370. q.dotted = (char *) name;
  371. q.qtype = type;
  372. q.qclass = 1 /*CLASS_IN */ ;
  373. j = encode_question(&q, packet + i, 512 - i);
  374. if (j < 0)
  375. goto fail3;
  376. len = i + j;
  377. DPRINTF("On try %d, sending query to port %d of machine %s\n",
  378. retries, DNS_SERVICE, nsip[ns]);
  379. sa.sin_family = AF_INET;
  380. sa.sin_port = htons(DNS_SERVICE);
  381. sa.sin_addr.s_addr = inet_addr(nsip[ns]);
  382. if (connect(fd, (struct sockaddr *) &sa, sizeof(sa)) == -1) {
  383. if (errno == ENETUNREACH) {
  384. /* routing error, presume not transient */
  385. goto tryall;
  386. } else
  387. /* retry */
  388. break;
  389. }
  390. DPRINTF("Transmitting packet of length %d, id=%d, qr=%d\n",
  391. len, h.id, h.qr);
  392. send(fd, packet, len, 0);
  393. dns_caught_signal = 0;
  394. oldalarm = alarm(REPLY_TIMEOUT);
  395. oldhandler = signal(SIGALRM, dns_catch_signal);
  396. i = recv(fd, packet, 512, 0);
  397. alarm(0);
  398. signal(SIGALRM, oldhandler);
  399. alarm(oldalarm);
  400. DPRINTF("Timeout=%d, len=%d\n", dns_caught_signal, i);
  401. if (dns_caught_signal)
  402. /* timed out, so retry send and receive,
  403. to next nameserver on queue */
  404. goto again;
  405. if (i < 12)
  406. /* too short ! */
  407. goto again;
  408. decode_header(packet, &h);
  409. DPRINTF("id = %d, qr = %d\n", h.id, h.qr);
  410. if ((h.id != id) || (!h.qr))
  411. /* unsolicited */
  412. goto again;
  413. DPRINTF("Got response (i think)!\n");
  414. DPRINTF("qrcount=%d,ancount=%d,nscount=%d,arcount=%d\n",
  415. h.qdcount, h.ancount, h.nscount, h.arcount);
  416. DPRINTF("opcode=%d,aa=%d,tc=%d,rd=%d,ra=%d,rcode=%d\n",
  417. h.opcode, h.aa, h.tc, h.rd, h.ra, h.rcode);
  418. if ((h.rcode) || (h.ancount < 1)) {
  419. /* negative result, not present */
  420. goto tryall;
  421. }
  422. pos = 12;
  423. for (j = 0; j < h.qdcount; j++) {
  424. DPRINTF("Skipping question %d at %d\n", j, pos);
  425. i = length_question(packet, pos);
  426. DPRINTF("Length of question %d is %d\n", j, i);
  427. if (i < 0)
  428. goto again;
  429. pos += i;
  430. }
  431. DPRINTF("Decoding answer at pos %d\n", pos);
  432. i = decode_answer(packet, pos, a);
  433. if (i < 0) {
  434. DPRINTF("failed decode %d\n", i);
  435. goto again;
  436. }
  437. DPRINTF("Answer name = |%s|\n", a->dotted);
  438. DPRINTF("Answer type = |%d|\n", a->atype);
  439. close(fd);
  440. if (outpacket)
  441. *outpacket = packet;
  442. else
  443. free(packet);
  444. return (0); /* success! */
  445. tryall:
  446. /* if there are other nameservers, give them a go,
  447. otherwise return with error */
  448. if (retries >= nscount)
  449. break;
  450. again:
  451. ns = (ns + 1) % nscount;
  452. continue;
  453. }
  454. fail3:
  455. close(fd);
  456. fail2:
  457. free(packet);
  458. fail1:
  459. return -1;
  460. }
  461. #endif
  462. #ifdef L_resolveaddress
  463. int resolve_address(const char *address,
  464. int nscount, const char **nsip, struct in_addr *in)
  465. {
  466. unsigned char *packet;
  467. struct resolv_answer a;
  468. char temp[256];
  469. int i;
  470. int nest = 0;
  471. if (!address || !in)
  472. return -1;
  473. strcpy(temp, address);
  474. for (;;) {
  475. i = dns_lookup(temp, 1, nscount, nsip, &packet, &a);
  476. if (i < 0)
  477. return -1;
  478. free(a.dotted);
  479. if (a.atype == 5) { /* CNAME */
  480. i = decode_dotted(packet, a.rdoffset, temp, 256);
  481. free(packet);
  482. if (i < 0)
  483. return -1;
  484. if (++nest > MAX_RECURSE)
  485. return -1;
  486. continue;
  487. } else if (a.atype == 1) { /* ADDRESS */
  488. free(packet);
  489. break;
  490. } else {
  491. free(packet);
  492. return -1;
  493. }
  494. }
  495. if (in)
  496. memcpy(in, a.rdata, 4);
  497. return 0;
  498. }
  499. #endif
  500. #ifdef L_resolvemailbox
  501. int resolve_mailbox(const char *address,
  502. int nscount, const char **nsip, struct in_addr *in)
  503. {
  504. struct resolv_answer a;
  505. unsigned char *packet;
  506. char temp[256];
  507. int nest = 0;
  508. int i;
  509. if (!address || !in)
  510. return -1;
  511. /* look up mail exchange */
  512. i = dns_lookup(address, 15, nscount, nsip, &packet, &a);
  513. strcpy(temp, address);
  514. if (i >= 0) {
  515. i = decode_dotted(packet, a.rdoffset + 2, temp, 256);
  516. free(packet);
  517. }
  518. for (;;) {
  519. i = dns_lookup(temp, 1, nscount, nsip, &packet, &a);
  520. if (i < 0)
  521. return -1;
  522. free(a.dotted);
  523. if (a.atype == 5) { /* CNAME */
  524. i = decode_dotted(packet, a.rdoffset, temp, 256);
  525. free(packet);
  526. if (i < 0)
  527. return i;
  528. if (++nest > MAX_RECURSE)
  529. return -1;
  530. continue;
  531. } else if (a.atype == 1) { /* ADDRESS */
  532. free(packet);
  533. break;
  534. } else {
  535. free(packet);
  536. return -1;
  537. }
  538. }
  539. if (in)
  540. memcpy(in, a.rdata, 4);
  541. return 0;
  542. }
  543. #endif
  544. extern int nameservers;
  545. extern const char *nameserver[3];
  546. #ifdef L_opennameservers
  547. int nameservers;
  548. const char * nameserver[3];
  549. int open_nameservers()
  550. {
  551. FILE *fp;
  552. char **arg;
  553. int i;
  554. if ((fp = fopen("/etc/resolv.conf", "r"))) {
  555. if ((arg = cfgfind(fp, "nameserver"))) {
  556. for (i = 1; arg[i]; i++) {
  557. nameserver[nameservers++] = strdup(arg[i]);
  558. }
  559. }
  560. fclose(fp);
  561. }
  562. return 0;
  563. }
  564. #endif
  565. #ifdef L_closenameservers
  566. void close_nameservers(void)
  567. {
  568. while (nameservers > 0)
  569. free(nameserver[--nameservers]);
  570. }
  571. #endif
  572. #ifdef L_resolvename
  573. const char *resolve_name(const char *name, int mailbox)
  574. {
  575. struct in_addr in;
  576. int i;
  577. /* shortcut: is it a valid IP address to begin with? */
  578. if (inet_aton(name, &in))
  579. return name;
  580. open_nameservers();
  581. DPRINTF("looking up '%s', mailbox=%d, nameservers=%d\n",
  582. name, mailbox, nameservers);
  583. if (mailbox)
  584. i = resolve_mailbox(name, nameservers, nameserver, &in);
  585. else
  586. i = resolve_address(name, nameservers, nameserver, &in);
  587. if (i < 0)
  588. return 0;
  589. DPRINTF("success = '%s'\n", inet_ntoa(in));
  590. return inet_ntoa(in);
  591. }
  592. #endif
  593. #ifdef L_gethostbyname
  594. struct hostent *gethostbyname(const char *name)
  595. {
  596. static struct hostent h;
  597. static char namebuf[256];
  598. static struct in_addr in;
  599. static struct in_addr *addr_list[2];
  600. unsigned char *packet;
  601. struct resolv_answer a;
  602. int i;
  603. int nest = 0;
  604. open_nameservers();
  605. if (!name)
  606. return 0;
  607. memset(&h, 0, sizeof(h));
  608. addr_list[0] = &in;
  609. addr_list[1] = 0;
  610. strcpy(namebuf, name);
  611. for (;;) {
  612. i = dns_lookup(namebuf, 1, nameservers, nameserver, &packet, &a);
  613. if (i < 0)
  614. return 0;
  615. strcpy(namebuf, a.dotted);
  616. free(a.dotted);
  617. if (a.atype == 5) { /* CNAME */
  618. i = decode_dotted(packet, a.rdoffset, namebuf, 256);
  619. free(packet);
  620. if (i < 0)
  621. return 0;
  622. if (++nest > MAX_RECURSE)
  623. return 0;
  624. continue;
  625. } else if (a.atype == 1) { /* ADDRESS */
  626. memcpy(&in, a.rdata, sizeof(in));
  627. h.h_name = namebuf;
  628. h.h_addrtype = AF_INET;
  629. h.h_length = sizeof(in);
  630. h.h_addr_list = (char **) addr_list;
  631. free(packet);
  632. break;
  633. } else {
  634. free(packet);
  635. return 0;
  636. }
  637. }
  638. return &h;
  639. }
  640. #endif
  641. #ifdef L_gethostbyaddr
  642. struct hostent *gethostbyaddr(const char *addr, int len, int type)
  643. {
  644. static struct hostent h;
  645. static char namebuf[256];
  646. static struct in_addr in;
  647. static struct in_addr *addr_list[2];
  648. unsigned char *packet;
  649. struct resolv_answer a;
  650. int i;
  651. int nest = 0;
  652. if (!addr || (len != sizeof(in)) || (type != AF_INET))
  653. return 0;
  654. memcpy(&in.s_addr, addr, len);
  655. open_nameservers();
  656. memset(&h, 0, sizeof(h));
  657. addr_list[0] = &in;
  658. addr_list[1] = 0;
  659. sprintf(namebuf, "%d.%d.%d.%d.in-addr.arpa",
  660. (in.s_addr >> 24) & 0xff,
  661. (in.s_addr >> 16) & 0xff,
  662. (in.s_addr >> 8) & 0xff, (in.s_addr >> 0) & 0xff);
  663. for (;;) {
  664. i = dns_lookup(namebuf, 12, nameservers, nameserver, &packet, &a);
  665. if (i < 0)
  666. return 0;
  667. strcpy(namebuf, a.dotted);
  668. free(a.dotted);
  669. if (a.atype == 5) { /* CNAME */
  670. i = decode_dotted(packet, a.rdoffset, namebuf, 256);
  671. free(packet);
  672. if (i < 0)
  673. return 0;
  674. if (++nest > MAX_RECURSE)
  675. return 0;
  676. continue;
  677. } else if (a.atype == 12) { /* ADDRESS */
  678. i = decode_dotted(packet, a.rdoffset, namebuf, 256);
  679. free(packet);
  680. h.h_name = namebuf;
  681. h.h_addrtype = AF_INET;
  682. h.h_length = sizeof(in);
  683. h.h_addr_list = (char **) addr_list;
  684. break;
  685. } else {
  686. free(packet);
  687. return 0;
  688. }
  689. }
  690. return &h;
  691. }
  692. #endif