dnresolve.c 34 KB

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