resolv.c 35 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624
  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. * 6-Oct-2001 Jari Korva <jari.korva@iki.fi>
  40. * more IPv6 support (IPv6 support for gethostbyaddr();
  41. * address family parameter and improved IPv6 support for get_hosts_byname
  42. * and read_etc_hosts; getnameinfo() port from glibc; defined
  43. * defined ip6addr_any and in6addr_loopback)
  44. */
  45. #define __FORCE_GLIBC
  46. #include <features.h>
  47. #include <string.h>
  48. #include <stdio.h>
  49. #include <signal.h>
  50. #include <errno.h>
  51. #include <sys/socket.h>
  52. #include <sys/types.h>
  53. #include <netinet/in.h>
  54. #include <arpa/inet.h>
  55. #include <stdlib.h>
  56. #include <unistd.h>
  57. #include <resolv.h>
  58. #include <netdb.h>
  59. #include <ctype.h>
  60. #include <arpa/nameser.h>
  61. #define MAX_RECURSE 5
  62. #define REPLY_TIMEOUT 10
  63. #define MAX_RETRIES 15
  64. #define MAX_SERVERS 3
  65. #define MAX_SEARCH 4
  66. #undef DEBUG
  67. /*#define DEBUG*/
  68. #ifdef DEBUG
  69. #define DPRINTF(X,args...) fprintf(stderr, X, ##args)
  70. #else
  71. #define DPRINTF(X,args...)
  72. #endif /* DEBUG */
  73. struct resolv_header {
  74. int id;
  75. int qr,opcode,aa,tc,rd,ra,rcode;
  76. int qdcount;
  77. int ancount;
  78. int nscount;
  79. int arcount;
  80. };
  81. struct resolv_question {
  82. char * dotted;
  83. int qtype;
  84. int qclass;
  85. };
  86. struct resolv_answer {
  87. char * dotted;
  88. int atype;
  89. int aclass;
  90. int ttl;
  91. int rdlength;
  92. unsigned char * rdata;
  93. int rdoffset;
  94. };
  95. extern int nameservers;
  96. extern char * nameserver[MAX_SERVERS];
  97. extern int searchdomains;
  98. extern char * searchdomain[MAX_SEARCH];
  99. extern struct hostent * get_hosts_byname(const char * name, int type);
  100. extern struct hostent * get_hosts_byaddr(const char * addr, int len, int type);
  101. extern struct hostent * read_etc_hosts(const char * name, int type, int ip);
  102. extern int resolve_address(const char * address, int nscount,
  103. char ** nsip, struct in_addr * in);
  104. extern int resolve_mailbox(const char * address, int nscount,
  105. char ** nsip, struct in_addr * in);
  106. extern int dns_lookup(const char * name, int type, int nscount,
  107. char ** nsip, unsigned char ** outpacket, struct resolv_answer * a);
  108. int encode_dotted(const char * dotted, unsigned char * dest, int maxlen);
  109. int decode_dotted(const unsigned char * message, int offset,
  110. char * dest, int maxlen);
  111. int length_dotted(const unsigned char * message, int offset);
  112. int encode_header(struct resolv_header * h, unsigned char * dest, int maxlen);
  113. int decode_header(unsigned char * data, struct resolv_header * h);
  114. int encode_question(struct resolv_question * q,
  115. unsigned char * dest, int maxlen);
  116. int decode_question(unsigned char * message, int offset,
  117. struct resolv_question * q);
  118. int encode_answer(struct resolv_answer * a,
  119. unsigned char * dest, int maxlen);
  120. int decode_answer(unsigned char * message, int offset,
  121. struct resolv_answer * a);
  122. int length_question(unsigned char * message, int offset);
  123. extern int open_nameservers(void);
  124. #ifdef L_encodeh
  125. int encode_header(struct resolv_header *h, unsigned char *dest, int maxlen)
  126. {
  127. if (maxlen < HFIXEDSZ)
  128. return -1;
  129. dest[0] = (h->id & 0xff00) >> 8;
  130. dest[1] = (h->id & 0x00ff) >> 0;
  131. dest[2] = (h->qr ? 0x80 : 0) |
  132. ((h->opcode & 0x0f) << 3) |
  133. (h->aa ? 0x04 : 0) |
  134. (h->tc ? 0x02 : 0) |
  135. (h->rd ? 0x01 : 0);
  136. dest[3] = (h->ra ? 0x80 : 0) | (h->rcode & 0x0f);
  137. dest[4] = (h->qdcount & 0xff00) >> 8;
  138. dest[5] = (h->qdcount & 0x00ff) >> 0;
  139. dest[6] = (h->ancount & 0xff00) >> 8;
  140. dest[7] = (h->ancount & 0x00ff) >> 0;
  141. dest[8] = (h->nscount & 0xff00) >> 8;
  142. dest[9] = (h->nscount & 0x00ff) >> 0;
  143. dest[10] = (h->arcount & 0xff00) >> 8;
  144. dest[11] = (h->arcount & 0x00ff) >> 0;
  145. return HFIXEDSZ;
  146. }
  147. #endif
  148. #ifdef L_decodeh
  149. int decode_header(unsigned char *data, struct resolv_header *h)
  150. {
  151. h->id = (data[0] << 8) | data[1];
  152. h->qr = (data[2] & 0x80) ? 1 : 0;
  153. h->opcode = (data[2] >> 3) & 0x0f;
  154. h->aa = (data[2] & 0x04) ? 1 : 0;
  155. h->tc = (data[2] & 0x02) ? 1 : 0;
  156. h->rd = (data[2] & 0x01) ? 1 : 0;
  157. h->ra = (data[3] & 0x80) ? 1 : 0;
  158. h->rcode = data[3] & 0x0f;
  159. h->qdcount = (data[4] << 8) | data[5];
  160. h->ancount = (data[6] << 8) | data[7];
  161. h->nscount = (data[8] << 8) | data[9];
  162. h->arcount = (data[10] << 8) | data[11];
  163. return HFIXEDSZ;
  164. }
  165. #endif
  166. #ifdef L_encoded
  167. /* Encode a dotted string into nameserver transport-level encoding.
  168. This routine is fairly dumb, and doesn't attempt to compress
  169. the data */
  170. int encode_dotted(const char *dotted, unsigned char *dest, int maxlen)
  171. {
  172. int used = 0;
  173. while (dotted && *dotted) {
  174. char *c = strchr(dotted, '.');
  175. int l = c ? c - dotted : strlen(dotted);
  176. if (l >= (maxlen - used - 1))
  177. return -1;
  178. dest[used++] = l;
  179. memcpy(dest + used, dotted, l);
  180. used += l;
  181. if (c)
  182. dotted = c + 1;
  183. else
  184. break;
  185. }
  186. if (maxlen < 1)
  187. return -1;
  188. dest[used++] = 0;
  189. return used;
  190. }
  191. #endif
  192. #ifdef L_decoded
  193. /* Decode a dotted string from nameserver transport-level encoding.
  194. This routine understands compressed data. */
  195. int decode_dotted(const unsigned char *data, int offset,
  196. char *dest, int maxlen)
  197. {
  198. int l;
  199. int measure = 1;
  200. int total = 0;
  201. int used = 0;
  202. if (!data)
  203. return -1;
  204. while ((l=data[offset++])) {
  205. if (measure)
  206. total++;
  207. if ((l & 0xc0) == (0xc0)) {
  208. if (measure)
  209. total++;
  210. /* compressed item, redirect */
  211. offset = ((l & 0x3f) << 8) | data[offset];
  212. measure = 0;
  213. continue;
  214. }
  215. if ((used + l + 1) >= maxlen)
  216. return -1;
  217. memcpy(dest + used, data + offset, l);
  218. offset += l;
  219. used += l;
  220. if (measure)
  221. total += l;
  222. if (data[offset] != 0)
  223. dest[used++] = '.';
  224. else
  225. dest[used++] = '\0';
  226. }
  227. DPRINTF("Total decode len = %d\n", total);
  228. return total;
  229. }
  230. #endif
  231. #ifdef L_lengthd
  232. int length_dotted(const unsigned char *data, int offset)
  233. {
  234. int orig_offset = offset;
  235. int l;
  236. if (!data)
  237. return -1;
  238. while ((l = data[offset++])) {
  239. if ((l & 0xc0) == (0xc0)) {
  240. offset++;
  241. break;
  242. }
  243. offset += l;
  244. }
  245. return offset - orig_offset;
  246. }
  247. #endif
  248. #ifdef L_encodeq
  249. int encode_question(struct resolv_question *q,
  250. unsigned char *dest, int maxlen)
  251. {
  252. int i;
  253. i = encode_dotted(q->dotted, dest, maxlen);
  254. if (i < 0)
  255. return i;
  256. dest += i;
  257. maxlen -= i;
  258. if (maxlen < 4)
  259. return -1;
  260. dest[0] = (q->qtype & 0xff00) >> 8;
  261. dest[1] = (q->qtype & 0x00ff) >> 0;
  262. dest[2] = (q->qclass & 0xff00) >> 8;
  263. dest[3] = (q->qclass & 0x00ff) >> 0;
  264. return i + 4;
  265. }
  266. #endif
  267. #ifdef L_decodeq
  268. int decode_question(unsigned char *message, int offset,
  269. struct resolv_question *q)
  270. {
  271. char temp[256];
  272. int i;
  273. i = decode_dotted(message, offset, temp, sizeof(temp));
  274. if (i < 0)
  275. return i;
  276. offset += i;
  277. q->dotted = strdup(temp);
  278. q->qtype = (message[offset + 0] << 8) | message[offset + 1];
  279. q->qclass = (message[offset + 2] << 8) | message[offset + 3];
  280. return i + 4;
  281. }
  282. #endif
  283. #ifdef L_lengthq
  284. int length_question(unsigned char *message, int offset)
  285. {
  286. int i;
  287. i = length_dotted(message, offset);
  288. if (i < 0)
  289. return i;
  290. return i + 4;
  291. }
  292. #endif
  293. #ifdef L_encodea
  294. int encode_answer(struct resolv_answer *a, unsigned char *dest, int maxlen)
  295. {
  296. int i;
  297. i = encode_dotted(a->dotted, dest, maxlen);
  298. if (i < 0)
  299. return i;
  300. dest += i;
  301. maxlen -= i;
  302. if (maxlen < (RRFIXEDSZ+a->rdlength))
  303. return -1;
  304. *dest++ = (a->atype & 0xff00) >> 8;
  305. *dest++ = (a->atype & 0x00ff) >> 0;
  306. *dest++ = (a->aclass & 0xff00) >> 8;
  307. *dest++ = (a->aclass & 0x00ff) >> 0;
  308. *dest++ = (a->ttl & 0xff000000) >> 24;
  309. *dest++ = (a->ttl & 0x00ff0000) >> 16;
  310. *dest++ = (a->ttl & 0x0000ff00) >> 8;
  311. *dest++ = (a->ttl & 0x000000ff) >> 0;
  312. *dest++ = (a->rdlength & 0xff00) >> 8;
  313. *dest++ = (a->rdlength & 0x00ff) >> 0;
  314. memcpy(dest, a->rdata, a->rdlength);
  315. return i + RRFIXEDSZ + a->rdlength;
  316. }
  317. #endif
  318. #ifdef L_decodea
  319. int decode_answer(unsigned char *message, int offset,
  320. struct resolv_answer *a)
  321. {
  322. char temp[256];
  323. int i;
  324. i = decode_dotted(message, offset, temp, sizeof(temp));
  325. if (i < 0)
  326. return i;
  327. message += offset + i;
  328. a->dotted = strdup(temp);
  329. a->atype = (message[0] << 8) | message[1];
  330. message += 2;
  331. a->aclass = (message[0] << 8) | message[1];
  332. message += 2;
  333. a->ttl = (message[0] << 24) |
  334. (message[1] << 16) | (message[2] << 8) | (message[3] << 0);
  335. message += 4;
  336. a->rdlength = (message[0] << 8) | message[1];
  337. message += 2;
  338. a->rdata = message;
  339. a->rdoffset = offset + i + RRFIXEDSZ;
  340. DPRINTF("i=%d,rdlength=%d\n", i, a->rdlength);
  341. return i + RRFIXEDSZ + a->rdlength;
  342. }
  343. #endif
  344. #ifdef L_encodep
  345. int encode_packet(struct resolv_header *h,
  346. struct resolv_question **q,
  347. struct resolv_answer **an,
  348. struct resolv_answer **ns,
  349. struct resolv_answer **ar,
  350. unsigned char *dest, int maxlen)
  351. {
  352. int i, total = 0;
  353. int j;
  354. i = encode_header(h, dest, maxlen);
  355. if (i < 0)
  356. return i;
  357. dest += i;
  358. maxlen -= i;
  359. total += i;
  360. for (j = 0; j < h->qdcount; j++) {
  361. i = encode_question(q[j], dest, maxlen);
  362. if (i < 0)
  363. return i;
  364. dest += i;
  365. maxlen -= i;
  366. total += i;
  367. }
  368. for (j = 0; j < h->ancount; j++) {
  369. i = encode_answer(an[j], dest, maxlen);
  370. if (i < 0)
  371. return i;
  372. dest += i;
  373. maxlen -= i;
  374. total += i;
  375. }
  376. for (j = 0; j < h->nscount; j++) {
  377. i = encode_answer(ns[j], dest, maxlen);
  378. if (i < 0)
  379. return i;
  380. dest += i;
  381. maxlen -= i;
  382. total += i;
  383. }
  384. for (j = 0; j < h->arcount; j++) {
  385. i = encode_answer(ar[j], dest, maxlen);
  386. if (i < 0)
  387. return i;
  388. dest += i;
  389. maxlen -= i;
  390. total += i;
  391. }
  392. return total;
  393. }
  394. #endif
  395. #ifdef L_decodep
  396. int decode_packet(unsigned char *data, struct resolv_header *h)
  397. {
  398. return decode_header(data, h);
  399. }
  400. #endif
  401. #ifdef L_formquery
  402. int form_query(int id, const char *name, int type, unsigned char *packet,
  403. int maxlen)
  404. {
  405. struct resolv_header h;
  406. struct resolv_question q;
  407. int i, j;
  408. memset(&h, 0, sizeof(h));
  409. h.id = id;
  410. h.qdcount = 1;
  411. q.dotted = (char *) name;
  412. q.qtype = type;
  413. q.qclass = C_IN; /* CLASS_IN */
  414. i = encode_header(&h, packet, maxlen);
  415. if (i < 0)
  416. return i;
  417. j = encode_question(&q, packet + i, maxlen - i);
  418. if (j < 0)
  419. return j;
  420. return i + j;
  421. }
  422. #endif
  423. #ifdef L_dnslookup
  424. int dns_caught_signal = 0;
  425. void dns_catch_signal(int signo)
  426. {
  427. dns_caught_signal = 1;
  428. }
  429. int dns_lookup(const char *name, int type, int nscount, char **nsip,
  430. unsigned char **outpacket, struct resolv_answer *a)
  431. {
  432. static int id = 1;
  433. int i, j, len, fd, pos;
  434. static int ns = 0;
  435. struct sockaddr_in sa;
  436. #ifdef __UCLIBC_HAS_IPV6__
  437. struct sockaddr_in6 sa6;
  438. #endif /* __UCLIBC_HAS_IPV6__ */
  439. int oldalarm;
  440. __sighandler_t oldhandler;
  441. struct resolv_header h;
  442. struct resolv_question q;
  443. int retries = 0;
  444. unsigned char * packet = malloc(PACKETSZ);
  445. unsigned char * lookup = malloc(MAXDNAME);
  446. int variant = 0;
  447. #ifdef __UCLIBC_HAS_IPV6__
  448. int v6;
  449. #endif /* __UCLIBC_HAS_IPV6__ */
  450. fd = -1;
  451. if (!packet || !lookup || !nscount)
  452. goto fail;
  453. DPRINTF("Looking up type %d answer for '%s'\n", type, name);
  454. ns %= nscount;
  455. while (retries++ < MAX_RETRIES) {
  456. #ifdef __UCLIBC_HAS_IPV6__
  457. v6 = (inet_pton(AF_INET6, nsip[ns], &sa6.sin6_addr) > 0);
  458. #endif /* __UCLIBC_HAS_IPV6__ */
  459. if (fd != -1)
  460. close(fd);
  461. #ifndef __UCLIBC_HAS_IPV6__
  462. fd = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP);
  463. #else /* __UCLIBC_HAS_IPV6__ */
  464. fd = socket(v6 ? AF_INET6 : AF_INET, SOCK_DGRAM, IPPROTO_UDP);
  465. #endif /* __UCLIBC_HAS_IPV6__ */
  466. if (fd == -1)
  467. goto fail;
  468. memset(packet, 0, PACKETSZ);
  469. memset(&h, 0, sizeof(h));
  470. h.id = ++id;
  471. h.qdcount = 1;
  472. h.rd = 1;
  473. DPRINTF("encoding header\n", h.rd);
  474. i = encode_header(&h, packet, PACKETSZ);
  475. if (i < 0)
  476. goto fail;
  477. strncpy(lookup,name,MAXDNAME);
  478. if (variant < searchdomains && strchr(lookup, '.') == NULL)
  479. {
  480. strncat(lookup,".", MAXDNAME);
  481. strncat(lookup,searchdomain[variant], MAXDNAME);
  482. }
  483. DPRINTF("lookup name: %s\n", lookup);
  484. q.dotted = (char *)lookup;
  485. q.qtype = type;
  486. q.qclass = C_IN; /* CLASS_IN */
  487. j = encode_question(&q, packet+i, PACKETSZ-i);
  488. if (j < 0)
  489. goto fail;
  490. len = i + j;
  491. DPRINTF("On try %d, sending query to port %d of machine %s\n",
  492. retries, NAMESERVER_PORT, nsip[ns]);
  493. #ifndef __UCLIBC_HAS_IPV6__
  494. sa.sin_family = AF_INET;
  495. sa.sin_port = htons(NAMESERVER_PORT);
  496. sa.sin_addr.s_addr = inet_addr(nsip[ns]);
  497. #else /* __UCLIBC_HAS_IPV6__ */
  498. if (v6) {
  499. sa6.sin6_family = AF_INET6;
  500. sa6.sin6_port = htons(NAMESERVER_PORT);
  501. /* sa6.sin6_addr is already here */
  502. } else {
  503. sa.sin_family = AF_INET;
  504. sa.sin_port = htons(NAMESERVER_PORT);
  505. sa.sin_addr.s_addr = inet_addr(nsip[ns]);
  506. }
  507. #endif /* __UCLIBC_HAS_IPV6__ */
  508. #ifndef __UCLIBC_HAS_IPV6__
  509. if (connect(fd, (struct sockaddr *) &sa, sizeof(sa)) == -1) {
  510. #else /* __UCLIBC_HAS_IPV6__ */
  511. if (connect(fd, (struct sockaddr *) (v6 ? &sa6 : &sa),
  512. v6 ? sizeof(sa6) : sizeof(sa)) == -1) {
  513. #endif /* __UCLIBC_HAS_IPV6__ */
  514. if (errno == ENETUNREACH) {
  515. /* routing error, presume not transient */
  516. goto tryall;
  517. } else
  518. /* retry */
  519. continue;
  520. }
  521. DPRINTF("Transmitting packet of length %d, id=%d, qr=%d\n",
  522. len, h.id, h.qr);
  523. send(fd, packet, len, 0);
  524. dns_caught_signal = 0;
  525. oldalarm = alarm(REPLY_TIMEOUT);
  526. oldhandler = signal(SIGALRM, dns_catch_signal);
  527. i = recv(fd, packet, PACKETSZ, 0);
  528. alarm(0);
  529. signal(SIGALRM, oldhandler);
  530. alarm(oldalarm);
  531. DPRINTF("Timeout=%d, len=%d\n", dns_caught_signal, i);
  532. if (dns_caught_signal)
  533. /* timed out, so retry send and receive,
  534. to next nameserver on queue */
  535. goto again;
  536. if (i < HFIXEDSZ)
  537. /* too short ! */
  538. goto again;
  539. decode_header(packet, &h);
  540. DPRINTF("id = %d, qr = %d\n", h.id, h.qr);
  541. if ((h.id != id) || (!h.qr))
  542. /* unsolicited */
  543. goto again;
  544. DPRINTF("Got response %s\n", "(i think)!");
  545. DPRINTF("qrcount=%d,ancount=%d,nscount=%d,arcount=%d\n",
  546. h.qdcount, h.ancount, h.nscount, h.arcount);
  547. DPRINTF("opcode=%d,aa=%d,tc=%d,rd=%d,ra=%d,rcode=%d\n",
  548. h.opcode, h.aa, h.tc, h.rd, h.ra, h.rcode);
  549. if ((h.rcode) || (h.ancount < 1)) {
  550. /* negative result, not present */
  551. goto again;
  552. }
  553. pos = HFIXEDSZ;
  554. for (j = 0; j < h.qdcount; j++) {
  555. DPRINTF("Skipping question %d at %d\n", j, pos);
  556. i = length_question(packet, pos);
  557. DPRINTF("Length of question %d is %d\n", j, i);
  558. if (i < 0)
  559. goto again;
  560. pos += i;
  561. }
  562. DPRINTF("Decoding answer at pos %d\n", pos);
  563. for (j=0;j<h.ancount;j++)
  564. {
  565. i = decode_answer(packet, pos, a);
  566. if (i<0) {
  567. DPRINTF("failed decode %d\n", i);
  568. goto again;
  569. }
  570. /* For all but T_SIG, accept first answer */
  571. if (a->atype != T_SIG)
  572. break;
  573. DPRINTF("skipping T_SIG %d\n", i);
  574. free(a->dotted);
  575. pos += i;
  576. }
  577. DPRINTF("Answer name = |%s|\n", a->dotted);
  578. DPRINTF("Answer type = |%d|\n", a->atype);
  579. close(fd);
  580. if (outpacket)
  581. *outpacket = packet;
  582. else
  583. free(packet);
  584. free(lookup);
  585. return (0); /* success! */
  586. tryall:
  587. /* if there are other nameservers, give them a go,
  588. otherwise return with error */
  589. variant = 0;
  590. if (retries >= nscount*(searchdomains+1))
  591. goto fail;
  592. again:
  593. /* if there are searchdomains, try them or fallback as passed */
  594. if (variant < searchdomains) {
  595. /* next search */
  596. variant++;
  597. } else {
  598. /* next server, first search */
  599. ns = (ns + 1) % nscount;
  600. variant = 0;
  601. }
  602. }
  603. fail:
  604. if (fd != -1)
  605. close(fd);
  606. if (lookup)
  607. free(lookup);
  608. if (packet)
  609. free(packet);
  610. return -1;
  611. }
  612. #endif
  613. #ifdef L_resolveaddress
  614. int resolve_address(const char *address, int nscount,
  615. char **nsip, struct in_addr *in)
  616. {
  617. unsigned char *packet;
  618. struct resolv_answer a;
  619. char temp[256];
  620. int i;
  621. int nest = 0;
  622. if (!address || !in)
  623. return -1;
  624. strncpy(temp, address, sizeof(temp));
  625. for (;;) {
  626. i = dns_lookup(temp, T_A, nscount, nsip, &packet, &a);
  627. if (i < 0)
  628. return -1;
  629. free(a.dotted);
  630. if (a.atype == T_CNAME) { /* CNAME */
  631. DPRINTF("Got a CNAME in resolve_address()\n");
  632. i = decode_dotted(packet, a.rdoffset, temp, sizeof(temp));
  633. free(packet);
  634. if (i < 0)
  635. return -1;
  636. if (++nest > MAX_RECURSE)
  637. return -1;
  638. continue;
  639. } else if (a.atype == T_A) { /* ADDRESS */
  640. free(packet);
  641. break;
  642. } else {
  643. free(packet);
  644. return -1;
  645. }
  646. }
  647. if (in)
  648. memcpy(in, a.rdata, INADDRSZ); /* IPv4 T_A */
  649. return 0;
  650. }
  651. #endif
  652. #ifdef L_resolvemailbox
  653. int resolve_mailbox(const char *address, int nscount,
  654. char **nsip, struct in_addr *in)
  655. {
  656. struct resolv_answer a;
  657. unsigned char *packet;
  658. char temp[256];
  659. int nest = 0;
  660. int i;
  661. if (!address || !in)
  662. return -1;
  663. /* look up mail exchange */
  664. i = dns_lookup(address, T_MX, nscount, nsip, &packet, &a);
  665. strncpy(temp, address, sizeof(temp));
  666. if (i >= 0) {
  667. i = decode_dotted(packet, a.rdoffset+2, temp, sizeof(temp));
  668. free(packet);
  669. }
  670. for (;;) {
  671. i = dns_lookup(temp, T_A, nscount, nsip, &packet, &a);
  672. if (i < 0)
  673. return -1;
  674. free(a.dotted);
  675. if (a.atype == T_CNAME) { /* CNAME */
  676. DPRINTF("Got a CNAME in resolve_mailbox()\n");
  677. i = decode_dotted(packet, a.rdoffset, temp, sizeof(temp));
  678. free(packet);
  679. if (i < 0)
  680. return i;
  681. if (++nest > MAX_RECURSE)
  682. return -1;
  683. continue;
  684. } else if (a.atype == T_A) { /* ADDRESS */
  685. free(packet);
  686. break;
  687. } else {
  688. free(packet);
  689. return -1;
  690. }
  691. }
  692. if (in)
  693. memcpy(in, a.rdata, INADDRSZ); /* IPv4 */
  694. return 0;
  695. }
  696. #endif
  697. #ifdef L_opennameservers
  698. int nameservers;
  699. char * nameserver[MAX_SERVERS];
  700. int searchdomains;
  701. char * searchdomain[MAX_SEARCH];
  702. /*
  703. * we currently read formats not quite the same as that on normal
  704. * unix systems, we can have a list of nameservers after the keyword.
  705. */
  706. int open_nameservers()
  707. {
  708. FILE *fp;
  709. int i;
  710. #define RESOLV_ARGS 5
  711. char szBuffer[128], *p, *argv[RESOLV_ARGS];
  712. int argc;
  713. if (nameservers > 0)
  714. return 0;
  715. if ((fp = fopen("/etc/resolv.conf", "r")) ||
  716. (fp = fopen("/etc/config/resolv.conf", "r"))) {
  717. while (fgets(szBuffer, sizeof(szBuffer), fp) != NULL) {
  718. for (p = szBuffer; *p && isspace(*p); p++)
  719. /* skip white space */;
  720. if (*p == '\0' || *p == '\n' || *p == '#') /* skip comments etc */
  721. continue;
  722. argc = 0;
  723. while (*p && argc < RESOLV_ARGS) {
  724. argv[argc++] = p;
  725. while (*p && !isspace(*p) && *p != '\n')
  726. p++;
  727. while (*p && (isspace(*p) || *p == '\n')) /* remove spaces */
  728. *p++ = '\0';
  729. }
  730. if (strcmp(argv[0], "nameserver") == 0) {
  731. for (i = 1; i < argc && nameservers < MAX_SERVERS; i++) {
  732. nameserver[nameservers++] = strdup(argv[i]);
  733. DPRINTF("adding nameserver %s\n", argv[i]);
  734. }
  735. }
  736. /* domain and search are mutually exclusive, the last one wins */
  737. if (strcmp(argv[0],"domain")==0 || strcmp(argv[0],"search")==0) {
  738. while (searchdomains > 0) {
  739. free(searchdomain[--searchdomains]);
  740. searchdomain[searchdomains] = NULL;
  741. }
  742. for (i=1; i < argc && searchdomains < MAX_SEARCH; i++) {
  743. searchdomain[searchdomains++] = strdup(argv[i]);
  744. DPRINTF("adding search %s\n", argv[i]);
  745. }
  746. }
  747. }
  748. fclose(fp);
  749. } else {
  750. DPRINTF("failed to open %s\n", "resolv.conf");
  751. }
  752. DPRINTF("nameservers = %d\n", nameservers);
  753. return 0;
  754. }
  755. #endif
  756. #ifdef L_closenameservers
  757. void close_nameservers(void)
  758. {
  759. while (nameservers > 0) {
  760. free(nameserver[--nameservers]);
  761. nameserver[nameservers] = NULL;
  762. }
  763. while (searchdomains > 0) {
  764. free(searchdomain[--searchdomains]);
  765. searchdomain[searchdomains] = NULL;
  766. }
  767. }
  768. #endif
  769. #ifdef L_resolvename
  770. const char *resolve_name(const char *name, int mailbox)
  771. {
  772. struct in_addr in;
  773. int i;
  774. /* shortcut: is it a valid IP address to begin with? */
  775. if (inet_aton(name, &in))
  776. return name;
  777. open_nameservers();
  778. DPRINTF("looking up '%s', mailbox=%d, nameservers=%d\n",
  779. name, mailbox, nameservers);
  780. if (mailbox)
  781. i = resolve_mailbox(name, nameservers, nameserver, &in);
  782. else
  783. i = resolve_address(name, nameservers, nameserver, &in);
  784. if (i < 0)
  785. return 0;
  786. DPRINTF("success = '%s'\n", inet_ntoa(in));
  787. return inet_ntoa(in);
  788. }
  789. #endif
  790. #ifdef L_gethostbyname
  791. struct hostent *gethostbyname(const char *name)
  792. {
  793. static struct hostent h;
  794. static char namebuf[256];
  795. static struct in_addr in;
  796. static struct in_addr *addr_list[2];
  797. struct hostent *hp;
  798. unsigned char *packet;
  799. struct resolv_answer a;
  800. int i;
  801. int nest = 0;
  802. open_nameservers();
  803. if (!name)
  804. return 0;
  805. if ((hp = get_hosts_byname(name, AF_INET))) /* do /etc/hosts first */
  806. return(hp);
  807. memset(&h, 0, sizeof(h));
  808. addr_list[0] = &in;
  809. addr_list[1] = 0;
  810. strncpy(namebuf, name, sizeof(namebuf));
  811. /* First check if this is already an address */
  812. if (inet_aton(name, &in)) {
  813. h.h_name = namebuf;
  814. h.h_addrtype = AF_INET;
  815. h.h_length = sizeof(in);
  816. h.h_addr_list = (char **) addr_list;
  817. return &h;
  818. }
  819. for (;;) {
  820. i = dns_lookup(namebuf, 1, nameservers, nameserver, &packet, &a);
  821. if (i < 0)
  822. return 0;
  823. strncpy(namebuf, a.dotted, sizeof(namebuf));
  824. free(a.dotted);
  825. if (a.atype == T_CNAME) { /* CNAME */
  826. DPRINTF("Got a CNAME in gethostbyname()\n");
  827. i = decode_dotted(packet, a.rdoffset, namebuf, sizeof(namebuf));
  828. free(packet);
  829. if (i < 0)
  830. return 0;
  831. if (++nest > MAX_RECURSE)
  832. return 0;
  833. continue;
  834. } else if (a.atype == T_A) { /* ADDRESS */
  835. memcpy(&in, a.rdata, sizeof(in));
  836. h.h_name = namebuf;
  837. h.h_addrtype = AF_INET;
  838. h.h_length = sizeof(in);
  839. h.h_addr_list = (char **) addr_list;
  840. free(packet);
  841. break;
  842. } else {
  843. free(packet);
  844. return 0;
  845. }
  846. }
  847. return &h;
  848. }
  849. #endif
  850. #ifdef L_gethostbyname2
  851. #ifdef __UCLIBC_HAS_IPV6__
  852. /* TBD: Not the right place for defining these, I guess */
  853. const struct in6_addr in6addr_any =
  854. { { { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 } } };
  855. const struct in6_addr in6addr_loopback =
  856. { { { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1 } } };
  857. #endif /* __UCLIBC_HAS_IPV6__ */
  858. struct hostent *gethostbyname2(const char *name, int family)
  859. {
  860. #ifndef __UCLIBC_HAS_IPV6__
  861. return family == AF_INET ? gethostbyname(name) : (struct hostent*)0;
  862. #else /* __UCLIBC_HAS_IPV6__ */
  863. static struct hostent h;
  864. static char namebuf[256];
  865. static struct in6_addr in;
  866. static struct in6_addr *addr_list[2];
  867. struct hostent *hp;
  868. unsigned char *packet;
  869. struct resolv_answer a;
  870. int i;
  871. int nest = 0;
  872. if (family == AF_INET)
  873. return gethostbyname(name);
  874. if (family != AF_INET6)
  875. return NULL;
  876. open_nameservers();
  877. if (!name)
  878. return 0;
  879. if ((hp = get_hosts_byname(name, family))) /* do /etc/hosts first */
  880. return(hp);
  881. memset(&h, 0, sizeof(h));
  882. addr_list[0] = &in;
  883. addr_list[1] = 0;
  884. strncpy(namebuf, name, sizeof(namebuf));
  885. /* First check if this is already an address */
  886. if (inet_pton(AF_INET6, name, &in)) {
  887. h.h_name = namebuf;
  888. h.h_addrtype = AF_INET6;
  889. h.h_length = sizeof(in);
  890. h.h_addr_list = (char **) addr_list;
  891. return &h;
  892. }
  893. for (;;) {
  894. i = dns_lookup(namebuf, T_AAAA, nameservers, nameserver, &packet, &a);
  895. if (i < 0)
  896. return 0;
  897. strncpy(namebuf, a.dotted, sizeof(namebuf));
  898. free(a.dotted);
  899. if (a.atype == T_CNAME) { /* CNAME */
  900. DPRINTF("Got a CNAME in gethostbyname()\n");
  901. i = decode_dotted(packet, a.rdoffset, namebuf, sizeof(namebuf));
  902. free(packet);
  903. if (i < 0)
  904. return 0;
  905. if (++nest > MAX_RECURSE)
  906. return 0;
  907. continue;
  908. } else if (a.atype == T_AAAA) { /* ADDRESS */
  909. memcpy(&in, a.rdata, sizeof(in));
  910. h.h_name = namebuf;
  911. h.h_addrtype = AF_INET6;
  912. h.h_length = sizeof(in);
  913. h.h_addr_list = (char **) addr_list;
  914. free(packet);
  915. break;
  916. } else {
  917. free(packet);
  918. return 0;
  919. }
  920. }
  921. return &h;
  922. #endif /* __UCLIBC_HAS_IPV6__ */
  923. }
  924. #endif
  925. #ifdef L_getnetbyname
  926. struct netent * getnetbyname(const char * name)
  927. {
  928. return NULL;
  929. }
  930. #endif
  931. #ifdef L_res_init
  932. int res_init(void)
  933. {
  934. return(0);
  935. }
  936. #endif
  937. #ifdef L_res_query
  938. #ifndef MIN
  939. #define MIN(x, y) ((x) < (y) ? (x) : (y))
  940. #endif
  941. int res_query(const char *dname, int class, int type,
  942. unsigned char *answer, int anslen)
  943. {
  944. unsigned char * packet = 0;
  945. struct resolv_answer a;
  946. int i;
  947. open_nameservers();
  948. if (!dname || class != 1 /* CLASS_IN */)
  949. return(-1);
  950. memset((char *) &a, '\0', sizeof(a));
  951. i = dns_lookup(dname, type, nameservers, nameserver, &packet, &a);
  952. if (i < 0)
  953. return(-1);
  954. free(a.dotted);
  955. if (a.atype == type) { /* CNAME*/
  956. if (anslen && answer)
  957. memcpy(answer, a.rdata, MIN(anslen, a.rdlength));
  958. if (packet)
  959. free(packet);
  960. return(MIN(anslen, a.rdlength));
  961. }
  962. if (packet)
  963. free(packet);
  964. return 0;
  965. }
  966. #endif
  967. #ifdef L_gethostbyaddr
  968. struct hostent *gethostbyaddr (const void *addr, socklen_t len, int type)
  969. {
  970. static struct hostent h;
  971. static char namebuf[256];
  972. static struct in_addr in;
  973. static struct in_addr *addr_list[2];
  974. #ifdef __UCLIBC_HAS_IPV6__
  975. char *qp;
  976. static struct in6_addr in6;
  977. static struct in6_addr *addr_list6[2];
  978. #endif /* __UCLIBC_HAS_IPV6__ */
  979. struct hostent *hp;
  980. unsigned char *packet;
  981. struct resolv_answer a;
  982. int i;
  983. int nest = 0;
  984. if (!addr)
  985. return 0;
  986. switch (type) {
  987. case AF_INET:
  988. if (len != sizeof(struct in_addr))
  989. return 0;
  990. break;
  991. #ifdef __UCLIBC_HAS_IPV6__
  992. case AF_INET6:
  993. if (len != sizeof(struct in6_addr))
  994. return 0;
  995. break;
  996. #endif /* __UCLIBC_HAS_IPV6__ */
  997. default:
  998. return 0;
  999. }
  1000. if ((hp = get_hosts_byaddr(addr, len, type))) /* do /etc/hosts first */
  1001. return(hp);
  1002. open_nameservers();
  1003. memset(&h, 0, sizeof(h));
  1004. if(type == AF_INET) {
  1005. memcpy(&in.s_addr, addr, len);
  1006. addr_list[0] = &in;
  1007. sprintf(namebuf, "%d.%d.%d.%d.in-addr.arpa",
  1008. (in.s_addr >> 24) & 0xff,
  1009. (in.s_addr >> 16) & 0xff,
  1010. (in.s_addr >> 8) & 0xff,
  1011. (in.s_addr >> 0) & 0xff);
  1012. #ifdef __UCLIBC_HAS_IPV6__
  1013. } else {
  1014. memcpy(&in6.s6_addr, addr, len);
  1015. addr_list6[0] = &in6;
  1016. qp = namebuf;
  1017. for (i = len - 1; i >= 0; i--) {
  1018. qp += sprintf(qp, "%x.%x.", in6.s6_addr[i] & 0xf,
  1019. (in6.s6_addr[i] >> 4) & 0xf);
  1020. }
  1021. strcpy(qp, "ip6.int");
  1022. #endif /* __UCLIBC_HAS_IPV6__ */
  1023. }
  1024. addr_list[1] = 0;
  1025. for (;;) {
  1026. i = dns_lookup(namebuf, T_PTR, nameservers, nameserver, &packet, &a);
  1027. if (i < 0)
  1028. return 0;
  1029. strncpy(namebuf, a.dotted, sizeof(namebuf));
  1030. free(a.dotted);
  1031. if (a.atype == T_CNAME) { /* CNAME */
  1032. DPRINTF("Got a CNAME in gethostbyaddr()\n");
  1033. i = decode_dotted(packet, a.rdoffset, namebuf, sizeof(namebuf));
  1034. free(packet);
  1035. if (i < 0)
  1036. return 0;
  1037. if (++nest > MAX_RECURSE)
  1038. return 0;
  1039. continue;
  1040. } else if (a.atype == T_PTR) { /* ADDRESS */
  1041. i = decode_dotted(packet, a.rdoffset, namebuf, sizeof(namebuf));
  1042. free(packet);
  1043. h.h_name = namebuf;
  1044. h.h_addrtype = type;
  1045. if(type == AF_INET) {
  1046. h.h_length = sizeof(in);
  1047. #ifdef __UCLIBC_HAS_IPV6__
  1048. } else {
  1049. h.h_length = sizeof(in6);
  1050. #endif /* __UCLIBC_HAS_IPV6__ */
  1051. }
  1052. h.h_addr_list = (char **) addr_list;
  1053. break;
  1054. } else {
  1055. free(packet);
  1056. return 0;
  1057. }
  1058. }
  1059. return &h;
  1060. }
  1061. #endif
  1062. #ifdef L_read_etc_hosts
  1063. struct hostent * read_etc_hosts(const char * name, int type, int ip)
  1064. {
  1065. static struct hostent h;
  1066. static struct in_addr in;
  1067. static struct in_addr *addr_list[2];
  1068. #ifdef __UCLIBC_HAS_IPV6__
  1069. static struct in6_addr in6;
  1070. static struct in6_addr *addr_list6[2];
  1071. #endif /* __UCLIBC_HAS_IPV6__ */
  1072. static char line[80];
  1073. FILE *fp;
  1074. char *cp;
  1075. #define MAX_ALIAS 5
  1076. char *alias[MAX_ALIAS];
  1077. int aliases, i;
  1078. if ((fp = fopen("/etc/hosts", "r")) == NULL &&
  1079. (fp = fopen("/etc/config/hosts", "r")) == NULL)
  1080. return((struct hostent *) NULL);
  1081. while (fgets(line, sizeof(line), fp)) {
  1082. if ((cp = strchr(line, '#')))
  1083. *cp = '\0';
  1084. aliases = 0;
  1085. cp = line;
  1086. while (*cp) {
  1087. while (*cp && isspace(*cp))
  1088. *cp++ = '\0';
  1089. if (!*cp)
  1090. continue;
  1091. if (aliases < MAX_ALIAS)
  1092. alias[aliases++] = cp;
  1093. while (*cp && !isspace(*cp))
  1094. cp++;
  1095. }
  1096. if (aliases < 2)
  1097. continue; /* syntax error really */
  1098. if (ip) {
  1099. if (strcmp(name, alias[0]) != 0)
  1100. continue;
  1101. } else {
  1102. for (i = 1; i < aliases; i++)
  1103. if (strcasecmp(name, alias[i]) == 0)
  1104. break;
  1105. if (i >= aliases)
  1106. continue;
  1107. }
  1108. if (type == AF_INET && inet_pton(AF_INET, alias[0], &in) > 0) {
  1109. addr_list[0] = &in;
  1110. addr_list[1] = 0;
  1111. h.h_name = alias[1];
  1112. h.h_addrtype = AF_INET;
  1113. h.h_length = sizeof(in);
  1114. h.h_addr_list = (char**) addr_list;
  1115. #ifdef __UCLIBC_HAS_IPV6__
  1116. } else if (type == AF_INET6 && inet_pton(AF_INET6, alias[0], &in6) > 0) {
  1117. addr_list6[0] = &in6;
  1118. addr_list6[1] = 0;
  1119. h.h_name = alias[1];
  1120. h.h_addrtype = AF_INET6;
  1121. h.h_length = sizeof(in6);
  1122. h.h_addr_list = (char**) addr_list6;
  1123. #endif /* __UCLIBC_HAS_IPV6__ */
  1124. } else {
  1125. break; /* bad ip address */
  1126. }
  1127. fclose(fp);
  1128. return(&h);
  1129. }
  1130. fclose(fp);
  1131. return((struct hostent *) NULL);
  1132. }
  1133. #endif
  1134. #ifdef L_get_hosts_byname
  1135. struct hostent * get_hosts_byname(const char * name, int type)
  1136. {
  1137. return(read_etc_hosts(name, type, 0));
  1138. }
  1139. #endif
  1140. #ifdef L_get_hosts_byaddr
  1141. struct hostent * get_hosts_byaddr(const char * addr, int len, int type)
  1142. {
  1143. #ifndef __UCLIBC_HAS_IPV6__
  1144. char ipaddr[INET_ADDRSTRLEN];
  1145. #else
  1146. char ipaddr[INET6_ADDRSTRLEN];
  1147. #endif /* __UCLIBC_HAS_IPV6__ */
  1148. switch (type) {
  1149. case AF_INET:
  1150. if (len != sizeof(struct in_addr))
  1151. return 0;
  1152. break;
  1153. #ifdef __UCLIBC_HAS_IPV6__
  1154. case AF_INET6:
  1155. if (len != sizeof(struct in6_addr))
  1156. return 0;
  1157. break;
  1158. #endif /* __UCLIBC_HAS_IPV6__ */
  1159. default:
  1160. return 0;
  1161. }
  1162. inet_ntop(type, addr, ipaddr, sizeof(ipaddr));
  1163. return(read_etc_hosts(ipaddr, type, 1));
  1164. }
  1165. #endif
  1166. #ifdef L_getnameinfo
  1167. int getnameinfo (const struct sockaddr *sa, socklen_t addrlen, char *host,
  1168. socklen_t hostlen, char *serv, socklen_t servlen,
  1169. unsigned int flags)
  1170. {
  1171. int serrno = errno;
  1172. int ok = 0;
  1173. struct hostent *h = NULL;
  1174. char domain[256];
  1175. if (flags & ~(NI_NUMERICHOST|NI_NUMERICSERV|NI_NOFQDN|NI_NAMEREQD|NI_DGRAM))
  1176. return EAI_BADFLAGS;
  1177. if (sa == NULL || addrlen < sizeof (sa_family_t))
  1178. return EAI_FAMILY;
  1179. switch (sa->sa_family) {
  1180. case AF_LOCAL:
  1181. break;
  1182. case AF_INET:
  1183. if (addrlen < sizeof (struct sockaddr_in))
  1184. return EAI_FAMILY;
  1185. break;
  1186. #ifdef __UCLIBC_HAS_IPV6__
  1187. case AF_INET6:
  1188. if (addrlen < sizeof (struct sockaddr_in6))
  1189. return EAI_FAMILY;
  1190. break;
  1191. #endif /* __UCLIBC_HAS_IPV6__ */
  1192. default:
  1193. return EAI_FAMILY;
  1194. }
  1195. if (host != NULL && hostlen > 0)
  1196. switch (sa->sa_family) {
  1197. case AF_INET:
  1198. #ifdef __UCLIBC_HAS_IPV6__
  1199. case AF_INET6:
  1200. #endif /* __UCLIBC_HAS_IPV6__ */
  1201. if (!(flags & NI_NUMERICHOST)) {
  1202. #ifdef __UCLIBC_HAS_IPV6__
  1203. if (sa->sa_family == AF_INET6)
  1204. h = gethostbyaddr ((const void *) &(((const struct sockaddr_in6 *) sa)->sin6_addr),
  1205. sizeof(struct in6_addr), AF_INET6);
  1206. else
  1207. #endif /* __UCLIBC_HAS_IPV6__ */
  1208. h = gethostbyaddr ((const void *) &(((const struct sockaddr_in *)sa)->sin_addr),
  1209. sizeof(struct in_addr), AF_INET);
  1210. if (h) {
  1211. char *c;
  1212. if ((flags & NI_NOFQDN)
  1213. && (getdomainname (domain, sizeof(domain)) == 0)
  1214. && (c = strstr (h->h_name, domain))
  1215. && (c != h->h_name) && (*(--c) == '.')) {
  1216. strncpy (host, h->h_name,
  1217. min(hostlen, (size_t) (c - h->h_name)));
  1218. host[min(hostlen - 1, (size_t) (c - h->h_name))] = '\0';
  1219. ok = 1;
  1220. } else {
  1221. strncpy (host, h->h_name, hostlen);
  1222. ok = 1;
  1223. }
  1224. }
  1225. }
  1226. if (!ok) {
  1227. if (flags & NI_NAMEREQD) {
  1228. errno = serrno;
  1229. return EAI_NONAME;
  1230. } else {
  1231. const char *c;
  1232. #ifdef __UCLIBC_HAS_IPV6__
  1233. if (sa->sa_family == AF_INET6) {
  1234. const struct sockaddr_in6 *sin6p;
  1235. uint32_t scopeid;
  1236. sin6p = (const struct sockaddr_in6 *) sa;
  1237. c = inet_ntop (AF_INET6,
  1238. (const void *) &sin6p->sin6_addr, host, hostlen);
  1239. #if 0
  1240. /* Does scope id need to be supported? */
  1241. scopeid = sin6p->sin6_scope_id;
  1242. if (scopeid != 0) {
  1243. /* Buffer is >= IFNAMSIZ+1. */
  1244. char scopebuf[IFNAMSIZ + 1];
  1245. char *scopeptr;
  1246. int ni_numericscope = 0;
  1247. size_t real_hostlen = __strnlen (host, hostlen);
  1248. size_t scopelen = 0;
  1249. scopebuf[0] = SCOPE_DELIMITER;
  1250. scopebuf[1] = '\0';
  1251. scopeptr = &scopebuf[1];
  1252. if (IN6_IS_ADDR_LINKLOCAL (&sin6p->sin6_addr)
  1253. || IN6_IS_ADDR_MC_LINKLOCAL (&sin6p->sin6_addr)) {
  1254. if (if_indextoname (scopeid, scopeptr) == NULL)
  1255. ++ni_numericscope;
  1256. else
  1257. scopelen = strlen (scopebuf);
  1258. } else {
  1259. ++ni_numericscope;
  1260. }
  1261. if (ni_numericscope)
  1262. scopelen = 1 + snprintf (scopeptr,
  1263. (scopebuf
  1264. + sizeof scopebuf
  1265. - scopeptr),
  1266. "%u", scopeid);
  1267. if (real_hostlen + scopelen + 1 > hostlen)
  1268. return EAI_SYSTEM;
  1269. memcpy (host + real_hostlen, scopebuf, scopelen + 1);
  1270. }
  1271. #endif
  1272. } else
  1273. #endif /* __UCLIBC_HAS_IPV6__ */
  1274. c = inet_ntop (AF_INET,
  1275. (const void *) &(((const struct sockaddr_in *) sa)->sin_addr),
  1276. host, hostlen);
  1277. if (c == NULL) {
  1278. errno = serrno;
  1279. return EAI_SYSTEM;
  1280. }
  1281. }
  1282. ok = 1;
  1283. }
  1284. break;
  1285. case AF_LOCAL:
  1286. if (!(flags & NI_NUMERICHOST)) {
  1287. struct utsname utsname;
  1288. if (!uname (&utsname)) {
  1289. strncpy (host, utsname.nodename, hostlen);
  1290. break;
  1291. };
  1292. };
  1293. if (flags & NI_NAMEREQD) {
  1294. errno = serrno;
  1295. return EAI_NONAME;
  1296. }
  1297. strncpy (host, "localhost", hostlen);
  1298. break;
  1299. default:
  1300. return EAI_FAMILY;
  1301. }
  1302. if (serv && (servlen > 0)) {
  1303. switch (sa->sa_family) {
  1304. case AF_INET:
  1305. #ifdef __UCLIBC_HAS_IPV6__
  1306. case AF_INET6:
  1307. #endif /* __UCLIBC_HAS_IPV6__ */
  1308. if (!(flags & NI_NUMERICSERV)) {
  1309. struct servent *s;
  1310. s = getservbyport (((const struct sockaddr_in *) sa)->sin_port,
  1311. ((flags & NI_DGRAM) ? "udp" : "tcp"));
  1312. if (s) {
  1313. strncpy (serv, s->s_name, servlen);
  1314. break;
  1315. }
  1316. }
  1317. snprintf (serv, servlen, "%d",
  1318. ntohs (((const struct sockaddr_in *) sa)->sin_port));
  1319. break;
  1320. case AF_LOCAL:
  1321. strncpy (serv, ((const struct sockaddr_un *) sa)->sun_path, servlen);
  1322. break;
  1323. }
  1324. }
  1325. if (host && (hostlen > 0))
  1326. host[hostlen-1] = 0;
  1327. if (serv && (servlen > 0))
  1328. serv[servlen-1] = 0;
  1329. errno = serrno;
  1330. return 0;
  1331. }
  1332. #endif