dnresolve.c 29 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373
  1. /*
  2. * domain name resolvers, see rfcs 1035 and 1123
  3. */
  4. #include <u.h>
  5. #include <libc.h>
  6. #include <ip.h>
  7. #include <bio.h>
  8. #include <ndb.h>
  9. #include "dns.h"
  10. typedef struct Dest Dest;
  11. typedef struct Ipaddr Ipaddr;
  12. typedef struct Query Query;
  13. typedef struct Sluggards Sluggards;
  14. enum
  15. {
  16. Udp, Tcp,
  17. Maxdest= 24, /* maximum destinations for a request message */
  18. Maxtrans= 3, /* maximum transmissions to a server */
  19. Destmagic= 0xcafebabe,
  20. Querymagic= 0xdeadbeef,
  21. };
  22. struct Ipaddr {
  23. Ipaddr *next;
  24. uchar ip[IPaddrlen];
  25. };
  26. struct Dest
  27. {
  28. uchar a[IPaddrlen]; /* ip address */
  29. DN *s; /* name server */
  30. int nx; /* number of transmissions */
  31. int code; /* response code; used to clear dp->respcode */
  32. ulong magic;
  33. };
  34. struct Query {
  35. DN *dp; /* domain */
  36. int type; /* and type to look up */
  37. Request *req;
  38. RR *nsrp; /* name servers to consult */
  39. Dest *dest; /* array of destinations */
  40. Dest *curdest; /* pointer to one of them */
  41. int ndest;
  42. int udpfd; /* can be shared by all udp users */
  43. QLock tcplock; /* only one tcp call at a time per query */
  44. int tcpset;
  45. int tcpfd; /* if Tcp, read replies from here */
  46. int tcpctlfd;
  47. uchar tcpip[IPaddrlen];
  48. ulong magic;
  49. };
  50. /* a list of sluggardly name servers */
  51. struct Sluggards {
  52. QLock;
  53. Ipaddr *head;
  54. Ipaddr *tail;
  55. };
  56. static Sluggards slugs;
  57. static RR* dnresolve1(char*, int, int, Request*, int, int);
  58. static int netquery(Query *, int);
  59. static Ipaddr *
  60. newslug(void)
  61. {
  62. return emalloc(sizeof(Ipaddr));
  63. }
  64. static void
  65. addslug(uchar nsip[])
  66. {
  67. Ipaddr *sp;
  68. static uchar zip[IPaddrlen];
  69. if (memcmp(nsip, zip, IPaddrlen) == 0)
  70. return;
  71. qlock(&slugs);
  72. for (sp = slugs.head; sp != nil; sp = sp->next)
  73. if (memcmp(sp->ip, nsip, IPaddrlen) == 0) {
  74. qunlock(&slugs); /* already know it */
  75. return;
  76. }
  77. if (slugs.head == nil)
  78. slugs.head = slugs.tail = newslug();
  79. else {
  80. slugs.tail->next = newslug();
  81. slugs.tail = slugs.tail->next;
  82. }
  83. memmove(slugs.tail->ip, nsip, IPaddrlen);
  84. qunlock(&slugs);
  85. dnslog("%I is a slug", nsip);
  86. }
  87. int
  88. isaslug(uchar nsip[])
  89. {
  90. Ipaddr *sp;
  91. qlock(&slugs);
  92. for (sp = slugs.head; sp != nil; sp = sp->next)
  93. if (memcmp(sp->ip, nsip, IPaddrlen) == 0) {
  94. qunlock(&slugs);
  95. return 1;
  96. }
  97. qunlock(&slugs);
  98. return 0;
  99. }
  100. /*
  101. * reading /proc/pid/args yields either "name" or "name [display args]",
  102. * so return only display args, if any.
  103. */
  104. static char *
  105. procgetname(void)
  106. {
  107. int fd, n;
  108. char *lp, *rp;
  109. char buf[256];
  110. snprint(buf, sizeof buf, "#p/%d/args", getpid());
  111. if((fd = open(buf, OREAD)) < 0)
  112. return strdup("");
  113. *buf = '\0';
  114. n = read(fd, buf, sizeof buf-1);
  115. close(fd);
  116. if (n >= 0)
  117. buf[n] = '\0';
  118. if ((lp = strchr(buf, '[')) == nil ||
  119. (rp = strrchr(buf, ']')) == nil)
  120. return strdup("");
  121. *rp = '\0';
  122. return strdup(lp+1);
  123. }
  124. /*
  125. * lookup 'type' info for domain name 'name'. If it doesn't exist, try
  126. * looking it up as a canonical name.
  127. */
  128. RR*
  129. dnresolve(char *name, int class, int type, Request *req, RR **cn, int depth,
  130. int recurse, int rooted, int *status)
  131. {
  132. RR *rp, *nrp, *drp;
  133. DN *dp;
  134. int loops;
  135. char *procname;
  136. char nname[Domlen];
  137. if(status)
  138. *status = 0;
  139. procname = procgetname();
  140. /*
  141. * hack for systems that don't have resolve search
  142. * lists. Just look up the simple name in the database.
  143. */
  144. if(!rooted && strchr(name, '.') == 0){
  145. rp = nil;
  146. drp = domainlist(class);
  147. for(nrp = drp; nrp != nil; nrp = nrp->next){
  148. snprint(nname, sizeof nname, "%s.%s", name,
  149. nrp->ptr->name);
  150. rp = dnresolve(nname, class, type, req, cn, depth,
  151. recurse, rooted, status);
  152. rrfreelist(rrremneg(&rp));
  153. if(rp != nil)
  154. break;
  155. }
  156. if(drp != nil)
  157. rrfree(drp);
  158. procsetname(procname);
  159. free(procname);
  160. return rp;
  161. }
  162. /*
  163. * try the name directly
  164. */
  165. rp = dnresolve1(name, class, type, req, depth, recurse);
  166. if(rp) {
  167. procsetname(procname);
  168. free(procname);
  169. return randomize(rp);
  170. }
  171. /* try it as a canonical name if we weren't told the name didn't exist */
  172. dp = dnlookup(name, class, 0);
  173. if(type != Tptr && dp->respcode != Rname)
  174. for(loops = 0; rp == nil && loops < 32; loops++){
  175. rp = dnresolve1(name, class, Tcname, req, depth, recurse);
  176. if(rp == nil)
  177. break;
  178. if(rp->negative){
  179. rrfreelist(rp);
  180. rp = nil;
  181. break;
  182. }
  183. name = rp->host->name;
  184. if(cn)
  185. rrcat(cn, rp);
  186. else
  187. rrfreelist(rp);
  188. rp = dnresolve1(name, class, type, req, depth, recurse);
  189. }
  190. /* distinction between not found and not good */
  191. if(rp == nil && status != nil && dp->respcode != 0)
  192. *status = dp->respcode;
  193. procsetname(procname);
  194. free(procname);
  195. return randomize(rp);
  196. }
  197. static void
  198. queryinit(Query *qp, DN *dp, int type, Request *req)
  199. {
  200. memset(qp, 0, sizeof *qp);
  201. qp->udpfd = qp->tcpfd = qp->tcpctlfd = -1;
  202. qp->dp = dp;
  203. qp->type = type;
  204. qp->req = req;
  205. qp->nsrp = nil;
  206. qp->dest = qp->curdest = nil;
  207. qp->magic = Querymagic;
  208. }
  209. static void
  210. queryck(Query *qp)
  211. {
  212. assert(qp);
  213. assert(qp->magic == Querymagic);
  214. }
  215. static void
  216. querydestroy(Query *qp)
  217. {
  218. queryck(qp);
  219. if (qp->udpfd > 0)
  220. close(qp->udpfd);
  221. if (qp->tcpfd > 0)
  222. close(qp->tcpfd);
  223. if (qp->tcpctlfd > 0) {
  224. hangup(qp->tcpctlfd);
  225. close(qp->tcpctlfd);
  226. }
  227. memset(qp, 0, sizeof *qp); /* prevent accidents */
  228. qp->udpfd = qp->tcpfd = qp->tcpctlfd = -1;
  229. }
  230. static void
  231. destinit(Dest *p)
  232. {
  233. memset(p, 0, sizeof *p);
  234. p->magic = Destmagic;
  235. }
  236. static void
  237. destck(Dest *p)
  238. {
  239. assert(p);
  240. assert(p->magic == Destmagic);
  241. }
  242. static RR*
  243. dnresolve1(char *name, int class, int type, Request *req, int depth,
  244. int recurse)
  245. {
  246. DN *dp, *nsdp;
  247. RR *rp, *nsrp, *dbnsrp;
  248. char *cp;
  249. Query query;
  250. if(debug)
  251. dnslog("[%d] dnresolve1 %s %d %d", getpid(), name, type, class);
  252. /* only class Cin implemented so far */
  253. if(class != Cin)
  254. return nil;
  255. dp = dnlookup(name, class, 1);
  256. /*
  257. * Try the cache first
  258. */
  259. rp = rrlookup(dp, type, OKneg);
  260. if(rp)
  261. if(rp->db){
  262. /* unauthoritative db entries are hints */
  263. if(rp->auth)
  264. return rp;
  265. } else
  266. /* cached entry must still be valid */
  267. if(rp->ttl > now)
  268. /* but Tall entries are special */
  269. if(type != Tall || rp->query == Tall)
  270. return rp;
  271. rrfreelist(rp);
  272. /*
  273. * try the cache for a canonical name. if found punt
  274. * since we'll find it during the canonical name search
  275. * in dnresolve().
  276. */
  277. if(type != Tcname){
  278. rp = rrlookup(dp, Tcname, NOneg);
  279. rrfreelist(rp);
  280. if(rp)
  281. return nil;
  282. }
  283. queryinit(&query, dp, type, req);
  284. /*
  285. * if we're running as just a resolver, query our
  286. * designated name servers
  287. */
  288. if(cfg.resolver){
  289. nsrp = randomize(getdnsservers(class));
  290. if(nsrp != nil) {
  291. query.nsrp = nsrp;
  292. if(netquery(&query, depth+1)){
  293. rrfreelist(nsrp);
  294. querydestroy(&query);
  295. return rrlookup(dp, type, OKneg);
  296. }
  297. rrfreelist(nsrp);
  298. }
  299. }
  300. /*
  301. * walk up the domain name looking for
  302. * a name server for the domain.
  303. */
  304. for(cp = name; cp; cp = walkup(cp)){
  305. /*
  306. * if this is a local (served by us) domain,
  307. * return answer
  308. */
  309. dbnsrp = randomize(dblookup(cp, class, Tns, 0, 0));
  310. if(dbnsrp && dbnsrp->local){
  311. rp = dblookup(name, class, type, 1, dbnsrp->ttl);
  312. rrfreelist(dbnsrp);
  313. querydestroy(&query);
  314. return rp;
  315. }
  316. /*
  317. * if recursion isn't set, just accept local
  318. * entries
  319. */
  320. if(recurse == Dontrecurse){
  321. if(dbnsrp)
  322. rrfreelist(dbnsrp);
  323. continue;
  324. }
  325. /* look for ns in cache */
  326. nsdp = dnlookup(cp, class, 0);
  327. nsrp = nil;
  328. if(nsdp)
  329. nsrp = randomize(rrlookup(nsdp, Tns, NOneg));
  330. /* if the entry timed out, ignore it */
  331. if(nsrp && nsrp->ttl < now){
  332. rrfreelist(nsrp);
  333. nsrp = nil;
  334. }
  335. if(nsrp){
  336. rrfreelist(dbnsrp);
  337. /* query the name servers found in cache */
  338. query.nsrp = nsrp;
  339. if(netquery(&query, depth+1)){
  340. rrfreelist(nsrp);
  341. querydestroy(&query);
  342. return rrlookup(dp, type, OKneg);
  343. }
  344. rrfreelist(nsrp);
  345. continue;
  346. }
  347. /* use ns from db */
  348. if(dbnsrp){
  349. /* try the name servers found in db */
  350. query.nsrp = dbnsrp;
  351. if(netquery(&query, depth+1)){
  352. /* we got an answer */
  353. rrfreelist(dbnsrp);
  354. querydestroy(&query);
  355. return rrlookup(dp, type, NOneg);
  356. }
  357. rrfreelist(dbnsrp);
  358. }
  359. }
  360. querydestroy(&query);
  361. /* settle for a non-authoritative answer */
  362. rp = rrlookup(dp, type, OKneg);
  363. if(rp)
  364. return rp;
  365. /* noone answered. try the database, we might have a chance. */
  366. return dblookup(name, class, type, 0, 0);
  367. }
  368. /*
  369. * walk a domain name one element to the right.
  370. * return a pointer to that element.
  371. * in other words, return a pointer to the parent domain name.
  372. */
  373. char*
  374. walkup(char *name)
  375. {
  376. char *cp;
  377. cp = strchr(name, '.');
  378. if(cp)
  379. return cp+1;
  380. else if(*name)
  381. return "";
  382. else
  383. return 0;
  384. }
  385. /*
  386. * Get a udpport for requests and replies. Put the port
  387. * into "headers" mode.
  388. */
  389. static char *hmsg = "headers";
  390. int
  391. udpport(char *mtpt)
  392. {
  393. int fd, ctl;
  394. char ds[64], adir[64];
  395. /* get a udp port */
  396. snprint(ds, sizeof ds, "%s/udp!*!0", (mtpt? mtpt: "/net"));
  397. ctl = announce(ds, adir);
  398. if(ctl < 0){
  399. /* warning("can't get udp port"); */
  400. return -1;
  401. }
  402. /* turn on header style interface */
  403. if(write(ctl, hmsg, strlen(hmsg)) , 0){
  404. close(ctl);
  405. warning(hmsg);
  406. return -1;
  407. }
  408. /* grab the data file */
  409. snprint(ds, sizeof ds, "%s/data", adir);
  410. fd = open(ds, ORDWR);
  411. close(ctl);
  412. if(fd < 0)
  413. warning("can't open udp port %s: %r", ds);
  414. return fd;
  415. }
  416. /* generate a DNS UDP query packet */
  417. int
  418. mkreq(DN *dp, int type, uchar *buf, int flags, ushort reqno)
  419. {
  420. DNSmsg m;
  421. int len;
  422. Udphdr *uh = (Udphdr*)buf;
  423. /* stuff port number into output buffer */
  424. memset(uh, 0, sizeof *uh);
  425. hnputs(uh->rport, 53);
  426. /* make request and convert it to output format */
  427. memset(&m, 0, sizeof m);
  428. m.flags = flags;
  429. m.id = reqno;
  430. m.qd = rralloc(type);
  431. m.qd->owner = dp;
  432. m.qd->type = type;
  433. len = convDNS2M(&m, &buf[Udphdrsize], Maxudp);
  434. rrfree(m.qd);
  435. return len;
  436. }
  437. /* for alarms in readreply */
  438. static void
  439. ding(void *x, char *msg)
  440. {
  441. USED(x);
  442. if(strcmp(msg, "alarm") == 0)
  443. noted(NCONT);
  444. else
  445. noted(NDFLT);
  446. }
  447. static void
  448. freeanswers(DNSmsg *mp)
  449. {
  450. rrfreelist(mp->qd);
  451. rrfreelist(mp->an);
  452. rrfreelist(mp->ns);
  453. rrfreelist(mp->ar);
  454. mp->qd = mp->an = mp->ns = mp->ar = nil;
  455. }
  456. /* sets srcip */
  457. static int
  458. readnet(Query *qp, int medium, uchar *ibuf, ulong endtime, uchar **replyp,
  459. uchar *srcip)
  460. {
  461. int len, fd;
  462. uchar *reply;
  463. uchar lenbuf[2];
  464. /* timed read of reply */
  465. alarm((endtime - time(nil)) * 1000);
  466. reply = ibuf;
  467. len = -1; /* pessimism */
  468. memset(srcip, 0, IPaddrlen);
  469. if (medium == Udp) {
  470. if (qp->udpfd <= 0)
  471. dnslog("readnet: qp->udpfd closed");
  472. else {
  473. len = read(qp->udpfd, ibuf, Udphdrsize+Maxudpin);
  474. if (len >= IPaddrlen)
  475. memmove(srcip, ibuf, IPaddrlen);
  476. if (len >= Udphdrsize) {
  477. len -= Udphdrsize;
  478. reply += Udphdrsize;
  479. }
  480. }
  481. } else {
  482. if (!qp->tcpset)
  483. dnslog("readnet: tcp params not set");
  484. fd = qp->tcpfd;
  485. if (fd <= 0)
  486. dnslog("readnet: %s: tcp fd unset for dest %I",
  487. qp->dp->name, qp->tcpip);
  488. else if (readn(fd, lenbuf, 2) != 2) {
  489. dnslog("readnet: short read of tcp size from %I",
  490. qp->tcpip);
  491. /*
  492. * probably a time-out; demote the ns.
  493. * actually, the problem may be the query, not the ns.
  494. */
  495. addslug(qp->tcpip);
  496. } else {
  497. len = lenbuf[0]<<8 | lenbuf[1];
  498. if (readn(fd, ibuf, len) != len) {
  499. dnslog("readnet: short read of tcp data from %I",
  500. qp->tcpip);
  501. /* probably a time-out; demote the ns */
  502. addslug(qp->tcpip);
  503. len = -1;
  504. }
  505. }
  506. memmove(srcip, qp->tcpip, IPaddrlen);
  507. }
  508. alarm(0);
  509. *replyp = reply;
  510. return len;
  511. }
  512. /*
  513. * read replies to a request and remember the rrs in the answer(s).
  514. * ignore any of the wrong type.
  515. * wait at most until endtime.
  516. */
  517. static int
  518. readreply(Query *qp, int medium, ushort req, uchar *ibuf, DNSmsg *mp,
  519. ulong endtime)
  520. {
  521. int len = -1, rv;
  522. char *err;
  523. uchar *reply;
  524. uchar srcip[IPaddrlen];
  525. RR *rp;
  526. notify(ding);
  527. queryck(qp);
  528. rv = 0;
  529. memset(mp, 0, sizeof *mp);
  530. if (time(nil) >= endtime)
  531. return -1; /* timed out before we started */
  532. for (; time(nil) < endtime &&
  533. (len = readnet(qp, medium, ibuf, endtime, &reply, srcip)) >= 0;
  534. freeanswers(mp)){
  535. /* convert into internal format */
  536. memset(mp, 0, sizeof *mp);
  537. err = convM2DNS(reply, len, mp, nil);
  538. if (mp->flags & Ftrunc) {
  539. // dnslog("readreply: %s: truncated reply, len %d from %I",
  540. // qp->dp->name, len, srcip);
  541. /* notify the caller to retry the query via tcp. */
  542. return -1;
  543. } else if(err){
  544. dnslog("readreply: %s: input err, len %d: %s: %I",
  545. qp->dp->name, len, err, srcip);
  546. free(err);
  547. continue;
  548. }
  549. if (err)
  550. free(err);
  551. if(debug)
  552. logreply(qp->req->id, srcip, mp);
  553. /* answering the right question? */
  554. if(mp->id != req)
  555. dnslog("%d: id %d instead of %d: %I", qp->req->id,
  556. mp->id, req, srcip);
  557. else if(mp->qd == 0)
  558. dnslog("%d: no question RR: %I", qp->req->id, srcip);
  559. else if(mp->qd->owner != qp->dp)
  560. dnslog("%d: owner %s instead of %s: %I", qp->req->id,
  561. mp->qd->owner->name, qp->dp->name, srcip);
  562. else if(mp->qd->type != qp->type)
  563. dnslog("%d: qp->type %d instead of %d: %I",
  564. qp->req->id, mp->qd->type, qp->type, srcip);
  565. else {
  566. /* remember what request this is in answer to */
  567. for(rp = mp->an; rp; rp = rp->next)
  568. rp->query = qp->type;
  569. return rv;
  570. }
  571. }
  572. if (time(nil) >= endtime)
  573. addslug(srcip);
  574. else
  575. dnslog("readreply: %s: %I read error or eof (returned %d)",
  576. qp->dp->name, srcip, len);
  577. return -1;
  578. }
  579. /*
  580. * return non-0 if first list includes second list
  581. */
  582. int
  583. contains(RR *rp1, RR *rp2)
  584. {
  585. RR *trp1, *trp2;
  586. for(trp2 = rp2; trp2; trp2 = trp2->next){
  587. for(trp1 = rp1; trp1; trp1 = trp1->next)
  588. if(trp1->type == trp2->type)
  589. if(trp1->host == trp2->host)
  590. if(trp1->owner == trp2->owner)
  591. break;
  592. if(trp1 == nil)
  593. return 0;
  594. }
  595. return 1;
  596. }
  597. /*
  598. * return multicast version if any
  599. */
  600. int
  601. ipisbm(uchar *ip)
  602. {
  603. if(isv4(ip)){
  604. if (ip[IPv4off] >= 0xe0 && ip[IPv4off] < 0xf0 ||
  605. ipcmp(ip, IPv4bcast) == 0)
  606. return 4;
  607. } else
  608. if(ip[0] == 0xff)
  609. return 6;
  610. return 0;
  611. }
  612. /*
  613. * Get next server address
  614. */
  615. static int
  616. serveraddrs(Query *qp, int nd, int depth)
  617. {
  618. RR *rp, *arp, *trp;
  619. Dest *cur;
  620. if(nd >= Maxdest)
  621. return 0;
  622. /*
  623. * look for a server whose address we already know.
  624. * if we find one, mark it so we ignore this on
  625. * subsequent passes.
  626. */
  627. arp = 0;
  628. for(rp = qp->nsrp; rp; rp = rp->next){
  629. assert(rp->magic == RRmagic);
  630. if(rp->marker)
  631. continue;
  632. arp = rrlookup(rp->host, Ta, NOneg);
  633. if(arp){
  634. rp->marker = 1;
  635. break;
  636. }
  637. arp = dblookup(rp->host->name, Cin, Ta, 0, 0);
  638. if(arp){
  639. rp->marker = 1;
  640. break;
  641. }
  642. }
  643. /*
  644. * if the cache and database lookup didn't find any new
  645. * server addresses, try resolving one via the network.
  646. * Mark any we try to resolve so we don't try a second time.
  647. */
  648. if(arp == 0)
  649. for(rp = qp->nsrp; rp; rp = rp->next){
  650. if(rp->marker)
  651. continue;
  652. rp->marker = 1;
  653. /*
  654. * avoid loops looking up a server under itself
  655. */
  656. if(subsume(rp->owner->name, rp->host->name))
  657. continue;
  658. arp = dnresolve(rp->host->name, Cin, Ta, qp->req, 0,
  659. depth+1, Recurse, 1, 0);
  660. rrfreelist(rrremneg(&arp));
  661. if(arp)
  662. break;
  663. }
  664. /* use any addresses that we found */
  665. for(trp = arp; trp && nd < Maxdest; trp = trp->next){
  666. cur = &qp->dest[nd];
  667. parseip(cur->a, trp->ip->name);
  668. /*
  669. * straddling servers can reject all nameservers if they are all
  670. * inside, so be sure to list at least one outside ns at
  671. * the end of the ns list in /lib/ndb for `dom='.
  672. */
  673. if (ipisbm(cur->a) ||
  674. cfg.straddle && !insideaddr(qp->dp->name) && insidens(cur->a))
  675. continue;
  676. cur->nx = 0;
  677. cur->s = trp->owner;
  678. cur->code = Rtimeout;
  679. nd++;
  680. }
  681. rrfreelist(arp);
  682. return nd;
  683. }
  684. /*
  685. * cache negative responses
  686. */
  687. static void
  688. cacheneg(DN *dp, int type, int rcode, RR *soarr)
  689. {
  690. RR *rp;
  691. DN *soaowner;
  692. ulong ttl;
  693. /* no cache time specified, don't make anything up */
  694. if(soarr != nil){
  695. if(soarr->next != nil){
  696. rrfreelist(soarr->next);
  697. soarr->next = nil;
  698. }
  699. soaowner = soarr->owner;
  700. } else
  701. soaowner = nil;
  702. /* the attach can cause soarr to be freed so mine it now */
  703. if(soarr != nil && soarr->soa != nil)
  704. ttl = soarr->soa->minttl+now;
  705. else
  706. ttl = 5*Min;
  707. /* add soa and negative RR to the database */
  708. rrattach(soarr, 1);
  709. rp = rralloc(type);
  710. rp->owner = dp;
  711. rp->negative = 1;
  712. rp->negsoaowner = soaowner;
  713. rp->negrcode = rcode;
  714. rp->ttl = ttl;
  715. rrattach(rp, 1);
  716. }
  717. static int
  718. setdestoutns(Dest *p, int n)
  719. {
  720. uchar *outns = outsidens(n);
  721. destck(p);
  722. destinit(p);
  723. if (outns == nil) {
  724. if (n == 0)
  725. dnslog("[%d] no outside-ns in ndb", getpid());
  726. return -1;
  727. }
  728. memmove(p->a, outns, sizeof p->a);
  729. p->s = dnlookup("outside-ns-ips", Cin, 1);
  730. return 0;
  731. }
  732. /*
  733. * issue query via UDP or TCP as appropriate.
  734. * for TCP, returns with qp->tcpip set from udppkt header.
  735. */
  736. static int
  737. mydnsquery(Query *qp, int medium, uchar *udppkt, int len)
  738. {
  739. int rv = -1;
  740. char *domain;
  741. char conndir[40];
  742. NetConnInfo *nci;
  743. queryck(qp);
  744. switch (medium) {
  745. case Udp:
  746. if (qp->udpfd <= 0)
  747. dnslog("mydnsquery: qp->udpfd closed");
  748. else {
  749. if (write(qp->udpfd, udppkt, len+Udphdrsize) !=
  750. len+Udphdrsize)
  751. warning("sending udp msg %r");
  752. rv = 0;
  753. }
  754. break;
  755. case Tcp:
  756. /* send via TCP & keep fd around for reply */
  757. domain = smprint("%I", udppkt);
  758. alarm(10*1000);
  759. qp->tcpfd = rv = dial(netmkaddr(domain, "tcp", "dns"), nil,
  760. conndir, &qp->tcpctlfd);
  761. alarm(0);
  762. if (qp->tcpfd < 0) {
  763. dnslog("can't dial tcp!%s!dns: %r", domain);
  764. addslug(udppkt);
  765. } else {
  766. uchar belen[2];
  767. nci = getnetconninfo(conndir, qp->tcpfd);
  768. if (nci) {
  769. parseip(qp->tcpip, nci->rsys);
  770. freenetconninfo(nci);
  771. } else
  772. dnslog("mydnsquery: getnetconninfo failed");
  773. qp->tcpset = 1;
  774. belen[0] = len >> 8;
  775. belen[1] = len;
  776. if (write(qp->tcpfd, belen, 2) != 2 ||
  777. write(qp->tcpfd, udppkt + Udphdrsize, len) != len)
  778. warning("sending tcp msg %r");
  779. }
  780. free(domain);
  781. break;
  782. default:
  783. sysfatal("mydnsquery: bad medium");
  784. }
  785. return rv;
  786. }
  787. /*
  788. * send query to all UDP destinations or one TCP destination,
  789. * taken from obuf (udp packet) header
  790. */
  791. static int
  792. xmitquery(Query *qp, int medium, int depth, uchar *obuf, int inns, int len)
  793. {
  794. int j, n;
  795. char buf[32];
  796. Dest *p;
  797. queryck(qp);
  798. if(time(nil) >= qp->req->aborttime)
  799. return -1;
  800. /*
  801. * get a nameserver address if we need one.
  802. * serveraddrs populates qp->dest.
  803. */
  804. p = qp->dest;
  805. destck(p);
  806. if (qp->ndest < 0 || qp->ndest > Maxdest)
  807. dnslog("qp->ndest %d out of range", qp->ndest);
  808. if (qp->ndest > qp->curdest - p)
  809. qp->curdest = &qp->dest[serveraddrs(qp, qp->curdest - p, depth)];
  810. destck(qp->curdest);
  811. /* no servers, punt */
  812. if (qp->curdest == qp->dest)
  813. if (cfg.straddle && cfg.inside) {
  814. /* get ips of "outside-ns-ips" */
  815. p = qp->curdest = qp->dest;
  816. for(n = 0; n < Maxdest; n++, qp->curdest++)
  817. if (setdestoutns(qp->curdest, n) < 0)
  818. break;
  819. } else {
  820. /* it's probably just a bogus domain, don't log it */
  821. // dnslog("xmitquery: %s: no nameservers", qp->dp->name);
  822. return -1;
  823. }
  824. /* send to first 'qp->ndest' destinations */
  825. j = 0;
  826. if (medium == Tcp) {
  827. j++;
  828. queryck(qp);
  829. assert(qp->dp);
  830. procsetname("tcp %sside query for %s %s", (inns? "in": "out"),
  831. qp->dp->name, rrname(qp->type, buf, sizeof buf));
  832. mydnsquery(qp, medium, obuf, len); /* sets qp->tcpip from obuf */
  833. if(debug)
  834. logsend(qp->req->id, depth, qp->tcpip, "", qp->dp->name,
  835. qp->type);
  836. } else
  837. for(; p < &qp->dest[qp->ndest] && p < qp->curdest; p++){
  838. /* skip destinations we've finished with */
  839. if(p->nx >= Maxtrans)
  840. continue;
  841. j++;
  842. /* exponential backoff of requests */
  843. if((1<<p->nx) > qp->ndest)
  844. continue;
  845. procsetname("udp %sside query to %I/%s %s %s",
  846. (inns? "in": "out"), p->a, p->s->name,
  847. qp->dp->name, rrname(qp->type, buf, sizeof buf));
  848. if(debug)
  849. logsend(qp->req->id, depth, p->a, p->s->name,
  850. qp->dp->name, qp->type);
  851. /* fill in UDP destination addr & send it */
  852. memmove(obuf, p->a, sizeof p->a);
  853. mydnsquery(qp, medium, obuf, len);
  854. p->nx++;
  855. }
  856. if(j == 0) {
  857. // dnslog("xmitquery: %s: no destinations left", qp->dp->name);
  858. return -1;
  859. }
  860. return 0;
  861. }
  862. static int
  863. procansw(Query *qp, DNSmsg *mp, uchar *srcip, int depth, Dest *p)
  864. {
  865. int rv;
  866. char buf[32];
  867. DN *ndp;
  868. Query nquery;
  869. RR *tp, *soarr;
  870. /* ignore any error replies */
  871. if((mp->flags & Rmask) == Rserver){
  872. rrfreelist(mp->qd);
  873. rrfreelist(mp->an);
  874. rrfreelist(mp->ar);
  875. rrfreelist(mp->ns);
  876. if(p != qp->curdest)
  877. p->code = Rserver;
  878. return -1;
  879. }
  880. /* ignore any bad delegations */
  881. if(mp->ns && baddelegation(mp->ns, qp->nsrp, srcip)){
  882. rrfreelist(mp->ns);
  883. mp->ns = nil;
  884. if(mp->an == nil){
  885. rrfreelist(mp->qd);
  886. rrfreelist(mp->ar);
  887. if(p != qp->curdest)
  888. p->code = Rserver;
  889. return -1;
  890. }
  891. }
  892. /* remove any soa's from the authority section */
  893. soarr = rrremtype(&mp->ns, Tsoa);
  894. /* incorporate answers */
  895. if(mp->an)
  896. rrattach(mp->an, (mp->flags & Fauth) != 0);
  897. if(mp->ar)
  898. rrattach(mp->ar, 0);
  899. if(mp->ns){
  900. ndp = mp->ns->owner;
  901. rrattach(mp->ns, 0);
  902. } else
  903. ndp = nil;
  904. /* free the question */
  905. if(mp->qd)
  906. rrfreelist(mp->qd);
  907. /*
  908. * Any reply from an authoritative server,
  909. * or a positive reply terminates the search
  910. */
  911. if(mp->an != nil || (mp->flags & Fauth)){
  912. if(mp->an == nil && (mp->flags & Rmask) == Rname)
  913. qp->dp->respcode = Rname;
  914. else
  915. qp->dp->respcode = 0;
  916. /*
  917. * cache any negative responses, free soarr
  918. */
  919. if((mp->flags & Fauth) && mp->an == nil)
  920. cacheneg(qp->dp, qp->type, (mp->flags & Rmask), soarr);
  921. else
  922. rrfreelist(soarr);
  923. return 1;
  924. }
  925. rrfreelist(soarr);
  926. /*
  927. * if we've been given better name servers,
  928. * recurse. we're called from udpquery, called from
  929. * netquery, which current holds qp->dp->querylck,
  930. * so release it now and acquire it upon return.
  931. */
  932. if(!mp->ns)
  933. return 0;
  934. tp = rrlookup(ndp, Tns, NOneg);
  935. if(contains(qp->nsrp, tp)){
  936. rrfreelist(tp);
  937. return 0;
  938. }
  939. procsetname("recursive query for %s %s", qp->dp->name,
  940. rrname(qp->type, buf, sizeof buf));
  941. // qunlock(&qp->dp->querylck);
  942. queryinit(&nquery, qp->dp, qp->type, qp->req);
  943. nquery.nsrp = tp;
  944. rv = netquery(&nquery, depth+1);
  945. // qlock(&qp->dp->querylck);
  946. rrfreelist(tp);
  947. querydestroy(&nquery);
  948. return rv;
  949. }
  950. /*
  951. * send a query via tcp to a single address (from ibuf's udp header)
  952. * and read the answer(s) into mp->an.
  953. */
  954. static int
  955. tcpquery(Query *qp, DNSmsg *mp, int depth, uchar *ibuf, uchar *obuf, int len,
  956. int waitsecs, int inns, ushort req)
  957. {
  958. int rv = 0;
  959. ulong endtime;
  960. endtime = time(nil) + waitsecs;
  961. if(endtime > qp->req->aborttime)
  962. endtime = qp->req->aborttime;
  963. dnslog("%s: udp reply truncated; retrying query via tcp to %I",
  964. qp->dp->name, qp->tcpip);
  965. qlock(&qp->tcplock);
  966. memmove(obuf, ibuf, IPaddrlen); /* send back to respondent */
  967. /* sets qp->tcpip from obuf's udp header */
  968. if (xmitquery(qp, Tcp, depth, obuf, inns, len) < 0 ||
  969. readreply(qp, Tcp, req, ibuf, mp, endtime) < 0)
  970. rv = -1;
  971. if (qp->tcpfd > 0) {
  972. hangup(qp->tcpctlfd);
  973. close(qp->tcpctlfd);
  974. close(qp->tcpfd);
  975. }
  976. qp->tcpfd = qp->tcpctlfd = -1;
  977. qunlock(&qp->tcplock);
  978. return rv;
  979. }
  980. /*
  981. * query name servers. If the name server returns a pointer to another
  982. * name server, recurse.
  983. */
  984. static int
  985. netquery1(Query *qp, int depth, uchar *ibuf, uchar *obuf, int waitsecs, int inns)
  986. {
  987. int ndest, len, replywaits, rv;
  988. ushort req;
  989. ulong endtime;
  990. char buf[12];
  991. uchar srcip[IPaddrlen];
  992. DNSmsg m;
  993. Dest *p, *np;
  994. Dest dest[Maxdest];
  995. /* pack request into a udp message */
  996. req = rand();
  997. len = mkreq(qp->dp, qp->type, obuf, Frecurse|Oquery, req);
  998. /* no server addresses yet */
  999. queryck(qp);
  1000. for (p = dest; p < dest + nelem(dest); p++)
  1001. destinit(p);
  1002. qp->curdest = qp->dest = dest;
  1003. /*
  1004. * transmit udp requests and wait for answers.
  1005. * at most Maxtrans attempts to each address.
  1006. * each cycle send one more message than the previous.
  1007. * retry a query via tcp if its response is truncated.
  1008. */
  1009. for(ndest = 1; ndest < Maxdest; ndest++){
  1010. qp->ndest = ndest;
  1011. qp->tcpset = 0;
  1012. if (xmitquery(qp, Udp, depth, obuf, inns, len) < 0)
  1013. break;
  1014. endtime = time(nil) + waitsecs;
  1015. if(endtime > qp->req->aborttime)
  1016. endtime = qp->req->aborttime;
  1017. for(replywaits = 0; replywaits < ndest; replywaits++){
  1018. procsetname("reading %sside reply from %s%I for %s %s",
  1019. (inns? "in": "out"),
  1020. (isaslug(qp->tcpip)? "sluggard ": ""), obuf,
  1021. qp->dp->name, rrname(qp->type, buf, sizeof buf));
  1022. /* read udp answer */
  1023. if (readreply(qp, Udp, req, ibuf, &m, endtime) >= 0)
  1024. memmove(srcip, ibuf, IPaddrlen);
  1025. else if (!(m.flags & Ftrunc)) {
  1026. addslug(ibuf);
  1027. break; /* timed out on this dest */
  1028. } else {
  1029. /* whoops, it was truncated! ask again via tcp */
  1030. rv = tcpquery(qp, &m, depth, ibuf, obuf, len,
  1031. waitsecs, inns, req);
  1032. if (rv < 0)
  1033. break; /* failed via tcp too */
  1034. memmove(srcip, qp->tcpip, IPaddrlen);
  1035. }
  1036. /* find responder */
  1037. // dnslog("netquery1 got reply from %I", srcip);
  1038. for(p = qp->dest; p < qp->curdest; p++)
  1039. if(memcmp(p->a, srcip, sizeof p->a) == 0)
  1040. break;
  1041. /* remove all addrs of responding server from list */
  1042. for(np = qp->dest; np < qp->curdest; np++)
  1043. if(np->s == p->s)
  1044. p->nx = Maxtrans;
  1045. rv = procansw(qp, &m, srcip, depth, p);
  1046. if (rv > 0)
  1047. return rv;
  1048. }
  1049. }
  1050. /* if all servers returned failure, propagate it */
  1051. qp->dp->respcode = Rserver;
  1052. for(p = dest; p < qp->curdest; p++) {
  1053. destck(p);
  1054. if(p->code != Rserver)
  1055. qp->dp->respcode = 0;
  1056. p->magic = 0; /* prevent accidents */
  1057. }
  1058. // if (qp->dp->respcode)
  1059. // dnslog("netquery1 setting Rserver for %s", qp->dp->name);
  1060. qp->dest = qp->curdest = nil; /* prevent accidents */
  1061. return 0;
  1062. }
  1063. /*
  1064. * run a command with a supplied fd as standard input
  1065. */
  1066. char *
  1067. system(int fd, char *cmd)
  1068. {
  1069. int pid, p, i;
  1070. static Waitmsg msg;
  1071. if((pid = fork()) == -1)
  1072. sysfatal("fork failed: %r");
  1073. else if(pid == 0){
  1074. dup(fd, 0);
  1075. close(fd);
  1076. for (i = 3; i < 200; i++)
  1077. close(i); /* don't leak fds */
  1078. execl("/bin/rc", "rc", "-c", cmd, nil);
  1079. sysfatal("exec rc: %r");
  1080. }
  1081. for(p = waitpid(); p >= 0; p = waitpid())
  1082. if(p == pid)
  1083. return msg.msg;
  1084. return "lost child";
  1085. }
  1086. enum { Hurry, Patient, };
  1087. enum { Outns, Inns, };
  1088. enum { Remntretry = 15, }; /* min. sec.s between remount attempts */
  1089. static int
  1090. udpquery(Query *qp, char *mntpt, int depth, int patient, int inns)
  1091. {
  1092. int fd, rv = 0;
  1093. long now;
  1094. char *msg;
  1095. uchar *obuf, *ibuf;
  1096. static QLock mntlck;
  1097. static ulong lastmount;
  1098. /* use alloced buffers rather than ones from the stack */
  1099. // ibuf = emalloc(Maxudpin+Udphdrsize);
  1100. ibuf = emalloc(64*1024); /* max. tcp reply size */
  1101. obuf = emalloc(Maxudp+Udphdrsize);
  1102. fd = udpport(mntpt);
  1103. while (fd < 0 && cfg.straddle && strcmp(mntpt, "/net.alt") == 0) {
  1104. /* HACK: remount /net.alt */
  1105. now = time(nil);
  1106. if (now < lastmount + Remntretry)
  1107. sleep((lastmount + Remntretry - now)*1000);
  1108. qlock(&mntlck);
  1109. fd = udpport(mntpt); /* try again under lock */
  1110. if (fd < 0) {
  1111. dnslog("[%d] remounting /net.alt", getpid());
  1112. unmount(nil, "/net.alt");
  1113. msg = system(open("/dev/null", ORDWR), "outside");
  1114. lastmount = time(nil);
  1115. if (msg && *msg) {
  1116. dnslog("[%d] can't remount /net.alt: %s",
  1117. getpid(), msg);
  1118. sleep(10*1000); /* don't spin wildly */
  1119. } else
  1120. fd = udpport(mntpt);
  1121. }
  1122. qunlock(&mntlck);
  1123. }
  1124. if(fd >= 0) {
  1125. qp->req->aborttime = time(nil) + (patient? Maxreqtm: Maxreqtm/2);
  1126. qp->udpfd = fd;
  1127. /* tune; was (patient? 15: 10) */
  1128. rv = netquery1(qp, depth, ibuf, obuf, (patient? 10: 5), inns);
  1129. close(fd);
  1130. } else
  1131. dnslog("can't get udpport for %s query of name %s: %r",
  1132. mntpt, qp->dp->name);
  1133. free(obuf);
  1134. free(ibuf);
  1135. return rv;
  1136. }
  1137. /* look up (dp->name,type) via *nsrp with results in *reqp */
  1138. static int
  1139. netquery(Query *qp, int depth)
  1140. {
  1141. int lock, rv, triedin, inname;
  1142. RR *rp;
  1143. if(depth > 12) /* in a recursive loop? */
  1144. return 0;
  1145. slave(qp->req);
  1146. /*
  1147. * slave might have forked. if so, the parent process longjmped to
  1148. * req->mret; we're usually the child slave, but if there are too
  1149. * many children already, we're still the same process.
  1150. */
  1151. /* don't lock before call to slave so only children can block */
  1152. if (0)
  1153. lock = qp->req->isslave != 0;
  1154. if(0 && lock) {
  1155. procsetname("query lock wait for %s", qp->dp->name);
  1156. /*
  1157. * don't make concurrent queries for this name.
  1158. *
  1159. * this seemed like a good idea, to avoid swamping
  1160. * an overloaded ns, but in practice, dns processes
  1161. * pile up quickly and dns becomes unresponsive for a while.
  1162. */
  1163. qlock(&qp->dp->querylck);
  1164. }
  1165. procsetname("netquery: %s", qp->dp->name);
  1166. /* prepare server RR's for incremental lookup */
  1167. for(rp = qp->nsrp; rp; rp = rp->next)
  1168. rp->marker = 0;
  1169. rv = 0; /* pessimism */
  1170. triedin = 0;
  1171. qp->nsrp = qp->nsrp;
  1172. /*
  1173. * normal resolvers and servers will just use mntpt for all addresses,
  1174. * even on the outside. straddling servers will use mntpt (/net)
  1175. * for inside addresses and /net.alt for outside addresses,
  1176. * thus bypassing other inside nameservers.
  1177. */
  1178. inname = insideaddr(qp->dp->name);
  1179. if (!cfg.straddle || inname) {
  1180. rv = udpquery(qp, mntpt, depth, Hurry, (cfg.inside? Inns: Outns));
  1181. triedin = 1;
  1182. }
  1183. /*
  1184. * if we're still looking, are inside, and have an outside domain,
  1185. * try it on our outside interface, if any.
  1186. */
  1187. if (rv == 0 && cfg.inside && !inname) {
  1188. if (triedin)
  1189. dnslog(
  1190. "[%d] netquery: internal nameservers failed for %s; trying external",
  1191. getpid(), qp->dp->name);
  1192. /* prepare server RR's for incremental lookup */
  1193. for(rp = qp->nsrp; rp; rp = rp->next)
  1194. rp->marker = 0;
  1195. rv = udpquery(qp, "/net.alt", depth, Patient, Outns);
  1196. }
  1197. // if (rv == 0) /* could ask /net.alt/dns directly */
  1198. // askoutdns(qp->dp, qp->type);
  1199. if(0 && lock)
  1200. qunlock(&qp->dp->querylck);
  1201. return rv;
  1202. }
  1203. int
  1204. seerootns(void)
  1205. {
  1206. int rv;
  1207. char root[] = "";
  1208. Request req;
  1209. Query query;
  1210. memset(&req, 0, sizeof req);
  1211. req.isslave = 1;
  1212. req.aborttime = now + Maxreqtm;
  1213. queryinit(&query, dnlookup(root, Cin, 1), Tns, &req);
  1214. query.nsrp = dblookup(root, Cin, Tns, 0, 0);
  1215. rv = netquery(&query, 0);
  1216. querydestroy(&query);
  1217. return rv;
  1218. }