dnresolve.c 29 KB

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