dn.c 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <ip.h>
  4. #include <pool.h>
  5. #include <ctype.h>
  6. #include "dns.h"
  7. /*
  8. * Hash table for domain names. The hash is based only on the
  9. * first element of the domain name.
  10. */
  11. DN *ht[HTLEN];
  12. static struct
  13. {
  14. Lock;
  15. ulong names; /* names allocated */
  16. ulong oldest; /* longest we'll leave a name around */
  17. int active;
  18. int mutex;
  19. int id;
  20. } dnvars;
  21. /* names of RR types */
  22. char *rrtname[] =
  23. {
  24. [Ta] "ip",
  25. [Tns] "ns",
  26. [Tmd] "md",
  27. [Tmf] "mf",
  28. [Tcname] "cname",
  29. [Tsoa] "soa",
  30. [Tmb] "mb",
  31. [Tmg] "mg",
  32. [Tmr] "mr",
  33. [Tnull] "null",
  34. [Twks] "wks",
  35. [Tptr] "ptr",
  36. [Thinfo] "hinfo",
  37. [Tminfo] "minfo",
  38. [Tmx] "mx",
  39. [Ttxt] "txt",
  40. [Trp] "rp",
  41. [Tkey] "key",
  42. [Tcert] "cert",
  43. [Tsig] "sig",
  44. [Taaaa] "ipv6",
  45. [Tixfr] "ixfr",
  46. [Taxfr] "axfr",
  47. [Tall] "all",
  48. 0,
  49. };
  50. /* names of response codes */
  51. char *rname[Rmask+1] =
  52. {
  53. [Rok] "ok",
  54. [Rformat] "format error",
  55. [Rserver] "server failure",
  56. [Rname] "bad name",
  57. [Runimplimented] "unimplemented",
  58. [Rrefused] "we don't like you",
  59. };
  60. /* names of op codes */
  61. char *opname[] =
  62. {
  63. [Oquery] "query",
  64. [Oinverse] "inverse",
  65. [Ostatus] "status",
  66. };
  67. Lock dnlock;
  68. static int sencodefmt(Fmt*);
  69. /*
  70. * set up a pipe to use as a lock
  71. */
  72. void
  73. dninit(void)
  74. {
  75. fmtinstall('E', eipfmt);
  76. fmtinstall('I', eipfmt);
  77. fmtinstall('V', eipfmt);
  78. fmtinstall('R', rrfmt);
  79. fmtinstall('Q', rravfmt);
  80. fmtinstall('H', sencodefmt);
  81. dnvars.oldest = maxage;
  82. dnvars.names = 0;
  83. }
  84. /*
  85. * hash for a domain name
  86. */
  87. static ulong
  88. dnhash(char *name)
  89. {
  90. ulong hash;
  91. uchar *val = (uchar*)name;
  92. for(hash = 0; *val; val++)
  93. hash = (hash*13) + tolower(*val)-'a';
  94. return hash % HTLEN;
  95. }
  96. /*
  97. * lookup a symbol. if enter is not zero and the name is
  98. * not found, create it.
  99. */
  100. DN*
  101. dnlookup(char *name, int class, int enter)
  102. {
  103. DN **l;
  104. DN *dp;
  105. l = &ht[dnhash(name)];
  106. lock(&dnlock);
  107. for(dp = *l; dp; dp = dp->next) {
  108. assert(dp->magic == DNmagic);
  109. if(dp->class == class && cistrcmp(dp->name, name) == 0){
  110. dp->referenced = now;
  111. unlock(&dnlock);
  112. return dp;
  113. }
  114. l = &dp->next;
  115. }
  116. if(enter == 0){
  117. unlock(&dnlock);
  118. return 0;
  119. }
  120. dnvars.names++;
  121. dp = emalloc(sizeof(*dp));
  122. dp->magic = DNmagic;
  123. dp->name = estrdup(name);
  124. assert(dp->name != 0);
  125. dp->class = class;
  126. dp->rr = 0;
  127. dp->next = 0;
  128. dp->referenced = now;
  129. *l = dp;
  130. unlock(&dnlock);
  131. return dp;
  132. }
  133. /*
  134. * dump the cache
  135. */
  136. void
  137. dndump(char *file)
  138. {
  139. DN *dp;
  140. int i, fd;
  141. RR *rp;
  142. fd = open(file, OWRITE|OTRUNC);
  143. if(fd < 0)
  144. return;
  145. lock(&dnlock);
  146. for(i = 0; i < HTLEN; i++){
  147. for(dp = ht[i]; dp; dp = dp->next){
  148. fprint(fd, "%s\n", dp->name);
  149. for(rp = dp->rr; rp; rp = rp->next)
  150. fprint(fd, " %R %c%c %lud/%lud\n", rp, rp->auth?'A':'U',
  151. rp->db?'D':'N', rp->expire, rp->ttl);
  152. }
  153. }
  154. unlock(&dnlock);
  155. close(fd);
  156. }
  157. /*
  158. * purge all records
  159. */
  160. void
  161. dnpurge(void)
  162. {
  163. DN *dp;
  164. RR *rp;
  165. int i;
  166. lock(&dnlock);
  167. for(i = 0; i < HTLEN; i++)
  168. for(dp = ht[i]; dp; dp = dp->next){
  169. rp = dp->rr;
  170. dp->rr = nil;
  171. for(; rp != nil; rp = rp->next)
  172. rp->cached = 0;
  173. rrfreelist(dp->rr);
  174. }
  175. unlock(&dnlock);
  176. }
  177. /*
  178. * check the age of resource records, free any that have timed out
  179. */
  180. void
  181. dnage(DN *dp)
  182. {
  183. RR **l;
  184. RR *rp, *next;
  185. ulong diff;
  186. diff = now - dp->referenced;
  187. if(diff < Reserved)
  188. return;
  189. l = &dp->rr;
  190. for(rp = dp->rr; rp; rp = next){
  191. assert(rp->magic == RRmagic && rp->cached);
  192. next = rp->next;
  193. if(!rp->db)
  194. if(rp->expire < now || diff > dnvars.oldest){
  195. *l = next;
  196. rp->cached = 0;
  197. rrfree(rp);
  198. continue;
  199. }
  200. l = &rp->next;
  201. }
  202. }
  203. #define REF(x) if(x) x->refs++
  204. /*
  205. * our target is 4000 names cached, this should be larger on large servers
  206. */
  207. #define TARGET 4000
  208. /*
  209. * periodicly sweep for old records and remove unreferenced domain names
  210. *
  211. * only called when all other threads are locked out
  212. */
  213. void
  214. dnageall(int doit)
  215. {
  216. DN *dp, **l;
  217. int i;
  218. RR *rp;
  219. static ulong nextage;
  220. if(dnvars.names < TARGET && now < nextage && !doit){
  221. dnvars.oldest = maxage;
  222. return;
  223. }
  224. if(dnvars.names > TARGET)
  225. dnvars.oldest /= 2;
  226. nextage = now + maxage;
  227. lock(&dnlock);
  228. /* time out all old entries (and set refs to 0) */
  229. for(i = 0; i < HTLEN; i++)
  230. for(dp = ht[i]; dp; dp = dp->next){
  231. dp->refs = 0;
  232. dnage(dp);
  233. }
  234. /* mark all referenced domain names */
  235. for(i = 0; i < HTLEN; i++)
  236. for(dp = ht[i]; dp; dp = dp->next)
  237. for(rp = dp->rr; rp; rp = rp->next){
  238. REF(rp->owner);
  239. if(rp->negative){
  240. REF(rp->negsoaowner);
  241. continue;
  242. }
  243. switch(rp->type){
  244. case Thinfo:
  245. REF(rp->cpu);
  246. REF(rp->os);
  247. break;
  248. case Ttxt:
  249. break;
  250. case Tcname:
  251. case Tmb:
  252. case Tmd:
  253. case Tmf:
  254. case Tns:
  255. REF(rp->host);
  256. break;
  257. case Tmg:
  258. case Tmr:
  259. REF(rp->mb);
  260. break;
  261. case Tminfo:
  262. REF(rp->rmb);
  263. REF(rp->mb);
  264. break;
  265. case Trp:
  266. REF(rp->rmb);
  267. REF(rp->rp);
  268. break;
  269. case Tmx:
  270. REF(rp->host);
  271. break;
  272. case Ta:
  273. case Taaaa:
  274. REF(rp->ip);
  275. break;
  276. case Tptr:
  277. REF(rp->ptr);
  278. break;
  279. case Tsoa:
  280. REF(rp->host);
  281. REF(rp->rmb);
  282. break;
  283. }
  284. }
  285. /* sweep and remove unreferenced domain names */
  286. for(i = 0; i < HTLEN; i++){
  287. l = &ht[i];
  288. for(dp = *l; dp; dp = *l){
  289. if(dp->rr == 0 && dp->refs == 0){
  290. *l = dp->next;
  291. if(dp->name)
  292. free(dp->name);
  293. dnvars.names--;
  294. free(dp);
  295. continue;
  296. }
  297. l = &dp->next;
  298. }
  299. }
  300. unlock(&dnlock);
  301. }
  302. /*
  303. * timeout all database records (used when rereading db)
  304. */
  305. void
  306. dnagedb(void)
  307. {
  308. DN *dp;
  309. int i;
  310. RR *rp;
  311. static ulong nextage;
  312. lock(&dnlock);
  313. /* time out all database entries */
  314. for(i = 0; i < HTLEN; i++)
  315. for(dp = ht[i]; dp; dp = dp->next)
  316. for(rp = dp->rr; rp; rp = rp->next)
  317. if(rp->db)
  318. rp->expire = 0;
  319. unlock(&dnlock);
  320. }
  321. /*
  322. * mark all local db records about my area as authoritative, time out any others
  323. */
  324. void
  325. dnauthdb(void)
  326. {
  327. DN *dp;
  328. int i;
  329. Area *area;
  330. RR *rp;
  331. static ulong nextage;
  332. lock(&dnlock);
  333. /* time out all database entries */
  334. for(i = 0; i < HTLEN; i++)
  335. for(dp = ht[i]; dp; dp = dp->next){
  336. area = inmyarea(dp->name);
  337. for(rp = dp->rr; rp; rp = rp->next)
  338. if(rp->db){
  339. if(area){
  340. if(rp->ttl < area->soarr->soa->minttl)
  341. rp->ttl = area->soarr->soa->minttl;
  342. rp->auth = 1;
  343. }
  344. if(rp->expire == 0){
  345. rp->db = 0;
  346. dp->referenced = now - Reserved - 1;
  347. }
  348. }
  349. }
  350. unlock(&dnlock);
  351. }
  352. /*
  353. * keep track of other processes to know if we can
  354. * garbage collect. block while garbage collecting.
  355. */
  356. int
  357. getactivity(Request *req)
  358. {
  359. int rv;
  360. if(traceactivity) syslog(0, "dns", "get %d by %d", dnvars.active, getpid());
  361. lock(&dnvars);
  362. while(dnvars.mutex){
  363. unlock(&dnvars);
  364. sleep(200);
  365. lock(&dnvars);
  366. }
  367. rv = ++dnvars.active;
  368. now = time(0);
  369. req->id = ++dnvars.id;
  370. unlock(&dnvars);
  371. return rv;
  372. }
  373. void
  374. putactivity(void)
  375. {
  376. static ulong lastclean;
  377. if(traceactivity) syslog(0, "dns", "put %d by %d", dnvars.active, getpid());
  378. lock(&dnvars);
  379. dnvars.active--;
  380. assert(dnvars.active >= 0); /* "dnvars.active %d", dnvars.active */;
  381. /*
  382. * clean out old entries and check for new db periodicly
  383. */
  384. if(dnvars.mutex || (needrefresh == 0 && dnvars.active > 0)){
  385. unlock(&dnvars);
  386. return;
  387. }
  388. /* wait till we're alone */
  389. dnvars.mutex = 1;
  390. while(dnvars.active > 0){
  391. unlock(&dnvars);
  392. sleep(100);
  393. lock(&dnvars);
  394. }
  395. unlock(&dnvars);
  396. db2cache(needrefresh);
  397. dnageall(0);
  398. /* let others back in */
  399. lastclean = now;
  400. needrefresh = 0;
  401. dnvars.mutex = 0;
  402. }
  403. /*
  404. * Attach a single resource record to a domain name.
  405. * - Avoid duplicates with already present RR's
  406. * - Chain all RR's of the same type adjacent to one another
  407. * - chain authoritative RR's ahead of non-authoritative ones
  408. */
  409. static void
  410. rrattach1(RR *new, int auth)
  411. {
  412. RR **l;
  413. RR *rp;
  414. DN *dp;
  415. assert(new->magic == RRmagic && !new->cached);
  416. if(!new->db)
  417. new->expire = new->ttl;
  418. else
  419. new->expire = now + Year;
  420. dp = new->owner;
  421. assert(dp->magic == DNmagic);
  422. new->auth |= auth;
  423. new->next = 0;
  424. /*
  425. * find first rr of the right type
  426. */
  427. l = &dp->rr;
  428. for(rp = *l; rp; rp = *l){
  429. assert(rp->magic == RRmagic && rp->cached);
  430. if(rp->type == new->type)
  431. break;
  432. l = &rp->next;
  433. }
  434. /*
  435. * negative entries replace positive entries
  436. * positive entries replace negative entries
  437. * newer entries replace older entries with the same fields
  438. */
  439. for(rp = *l; rp; rp = *l){
  440. assert(rp->magic == RRmagic && rp->cached);
  441. if(rp->type != new->type)
  442. break;
  443. if(rp->db == new->db && rp->auth == new->auth){
  444. /* negative drives out positive and vice versa */
  445. if(rp->negative != new->negative){
  446. *l = rp->next;
  447. rp->cached = 0;
  448. rrfree(rp);
  449. continue;
  450. }
  451. /* all things equal, pick the newer one */
  452. if(rp->arg0 == new->arg0 && rp->arg1 == new->arg1){
  453. /* new drives out old */
  454. if(new->ttl > rp->ttl || new->expire > rp->expire){
  455. *l = rp->next;
  456. rp->cached = 0;
  457. rrfree(rp);
  458. continue;
  459. } else {
  460. rrfree(new);
  461. return;
  462. }
  463. }
  464. /* Hack for pointer records. This makes sure
  465. * the ordering in the list reflects the ordering
  466. * received or read from the database
  467. */
  468. if(rp->type == Tptr){
  469. if(!rp->negative && !new->negative
  470. && rp->ptr->ordinal > new->ptr->ordinal)
  471. break;
  472. }
  473. }
  474. l = &rp->next;
  475. }
  476. /*
  477. * add to chain
  478. */
  479. new->cached = 1;
  480. new->next = *l;
  481. *l = new;
  482. }
  483. /*
  484. * Attach a list of resource records to a domain name.
  485. * - Avoid duplicates with already present RR's
  486. * - Chain all RR's of the same type adjacent to one another
  487. * - chain authoritative RR's ahead of non-authoritative ones
  488. * - remove any expired RR's
  489. */
  490. void
  491. rrattach(RR *rp, int auth)
  492. {
  493. RR *next;
  494. lock(&dnlock);
  495. for(; rp; rp = next){
  496. next = rp->next;
  497. rp->next = 0;
  498. /* avoid any outside spoofing */
  499. if(cachedb && !rp->db && inmyarea(rp->owner->name))
  500. rrfree(rp);
  501. else
  502. rrattach1(rp, auth);
  503. }
  504. unlock(&dnlock);
  505. }
  506. /*
  507. * allocate a resource record of a given type
  508. */
  509. RR*
  510. rralloc(int type)
  511. {
  512. RR *rp;
  513. rp = emalloc(sizeof(*rp));
  514. rp->magic = RRmagic;
  515. rp->pc = getcallerpc(&type);
  516. rp->type = type;
  517. switch(type){
  518. case Tsoa:
  519. rp->soa = emalloc(sizeof(*rp->soa));
  520. rp->soa->slaves = nil;
  521. break;
  522. case Tkey:
  523. rp->key = emalloc(sizeof(*rp->key));
  524. break;
  525. case Tcert:
  526. rp->cert = emalloc(sizeof(*rp->cert));
  527. break;
  528. case Tsig:
  529. rp->sig = emalloc(sizeof(*rp->sig));
  530. break;
  531. case Tnull:
  532. rp->null = emalloc(sizeof(*rp->null));
  533. break;
  534. }
  535. rp->ttl = 0;
  536. rp->expire = 0;
  537. rp->next = 0;
  538. return rp;
  539. }
  540. /*
  541. * free a resource record and any related structs
  542. */
  543. void
  544. rrfree(RR *rp)
  545. {
  546. DN *dp;
  547. RR *nrp;
  548. Txt *t;
  549. assert(!rp->cached);
  550. dp = rp->owner;
  551. if(dp){
  552. assert(dp->magic == DNmagic);
  553. for(nrp = dp->rr; nrp; nrp = nrp->next)
  554. assert(nrp != rp); /* "rrfree of live rr" */;
  555. }
  556. switch(rp->type){
  557. case Tsoa:
  558. freeserverlist(rp->soa->slaves);
  559. free(rp->soa);
  560. break;
  561. case Tkey:
  562. free(rp->key->data);
  563. free(rp->key);
  564. break;
  565. case Tcert:
  566. free(rp->cert->data);
  567. free(rp->cert);
  568. break;
  569. case Tsig:
  570. free(rp->sig->data);
  571. free(rp->sig);
  572. break;
  573. case Tnull:
  574. free(rp->null->data);
  575. free(rp->null);
  576. break;
  577. case Ttxt:
  578. while(rp->txt != nil){
  579. t = rp->txt;
  580. rp->txt = t->next;
  581. free(t->p);
  582. free(t);
  583. }
  584. break;
  585. }
  586. free(rp);
  587. }
  588. /*
  589. * free a list of resource records and any related structs
  590. */
  591. void
  592. rrfreelist(RR *rp)
  593. {
  594. RR *next;
  595. for(; rp; rp = next){
  596. next = rp->next;
  597. rrfree(rp);
  598. }
  599. }
  600. extern RR**
  601. rrcopy(RR *rp, RR **last)
  602. {
  603. RR *nrp;
  604. SOA *soa;
  605. Key *key;
  606. Cert *cert;
  607. Sig *sig;
  608. Null *null;
  609. Txt *t, *nt, **l;
  610. nrp = rralloc(rp->type);
  611. switch(rp->type){
  612. case Ttxt:
  613. *nrp = *rp;
  614. l = &nrp->txt;
  615. *l = nil;
  616. for(t = rp->txt; t != nil; t = t->next){
  617. nt = emalloc(sizeof(*nt));
  618. nt->p = estrdup(t->p);
  619. nt->next = nil;
  620. *l = nt;
  621. l = &nt->next;
  622. }
  623. break;
  624. case Tsoa:
  625. soa = nrp->soa;
  626. *nrp = *rp;
  627. nrp->soa = soa;
  628. *nrp->soa = *rp->soa;
  629. nrp->soa->slaves = copyserverlist(rp->soa->slaves);
  630. break;
  631. case Tkey:
  632. key = nrp->key;
  633. *nrp = *rp;
  634. nrp->key = key;
  635. *key = *rp->key;
  636. key->data = emalloc(key->dlen);
  637. memmove(key->data, rp->key->data, rp->key->dlen);
  638. break;
  639. case Tsig:
  640. sig = nrp->sig;
  641. *nrp = *rp;
  642. nrp->sig = sig;
  643. *sig = *rp->sig;
  644. sig->data = emalloc(sig->dlen);
  645. memmove(sig->data, rp->sig->data, rp->sig->dlen);
  646. break;
  647. case Tcert:
  648. cert = nrp->cert;
  649. *nrp = *rp;
  650. nrp->cert = cert;
  651. *cert = *rp->cert;
  652. cert->data = emalloc(cert->dlen);
  653. memmove(cert->data, rp->cert->data, rp->cert->dlen);
  654. break;
  655. case Tnull:
  656. null = nrp->null;
  657. *nrp = *rp;
  658. nrp->null = null;
  659. *null = *rp->null;
  660. null->data = emalloc(null->dlen);
  661. memmove(null->data, rp->null->data, rp->null->dlen);
  662. break;
  663. default:
  664. *nrp = *rp;
  665. break;
  666. }
  667. nrp->cached = 0;
  668. nrp->next = 0;
  669. *last = nrp;
  670. return &nrp->next;
  671. }
  672. /*
  673. * lookup a resource record of a particular type and
  674. * class attached to a domain name. Return copies.
  675. *
  676. * Priority ordering is:
  677. * db authoritative
  678. * not timed out network authoritative
  679. * not timed out network unauthoritative
  680. * unauthoritative db
  681. *
  682. * if flag NOneg is set, don't return negative cached entries.
  683. * return nothing instead.
  684. */
  685. RR*
  686. rrlookup(DN *dp, int type, int flag)
  687. {
  688. RR *rp, *first, **last;
  689. assert(dp->magic == DNmagic);
  690. first = 0;
  691. last = &first;
  692. lock(&dnlock);
  693. /* try for an authoritative db entry */
  694. for(rp = dp->rr; rp; rp = rp->next){
  695. assert(rp->magic == RRmagic && rp->cached);
  696. if(rp->db)
  697. if(rp->auth)
  698. if(tsame(type, rp->type))
  699. last = rrcopy(rp, last);
  700. }
  701. if(first)
  702. goto out;
  703. /* try for an living authoritative network entry */
  704. for(rp = dp->rr; rp; rp = rp->next){
  705. if(!rp->db)
  706. if(rp->auth)
  707. if(rp->ttl + 60 > now)
  708. if(tsame(type, rp->type)){
  709. if(flag == NOneg && rp->negative)
  710. goto out;
  711. last = rrcopy(rp, last);
  712. }
  713. }
  714. if(first)
  715. goto out;
  716. /* try for an living unauthoritative network entry */
  717. for(rp = dp->rr; rp; rp = rp->next){
  718. if(!rp->db)
  719. if(rp->ttl + 60 > now)
  720. if(tsame(type, rp->type)){
  721. if(flag == NOneg && rp->negative)
  722. goto out;
  723. last = rrcopy(rp, last);
  724. }
  725. }
  726. if(first)
  727. goto out;
  728. /* try for an unauthoritative db entry */
  729. for(rp = dp->rr; rp; rp = rp->next){
  730. if(rp->db)
  731. if(tsame(type, rp->type))
  732. last = rrcopy(rp, last);
  733. }
  734. if(first)
  735. goto out;
  736. /* otherwise, settle for anything we got (except for negative caches) */
  737. for(rp = dp->rr; rp; rp = rp->next){
  738. if(tsame(type, rp->type)){
  739. if(rp->negative)
  740. goto out;
  741. last = rrcopy(rp, last);
  742. }
  743. }
  744. out:
  745. unlock(&dnlock);
  746. unique(first);
  747. return first;
  748. }
  749. /*
  750. * convert an ascii RR type name to its integer representation
  751. */
  752. int
  753. rrtype(char *atype)
  754. {
  755. int i;
  756. for(i = 0; i <= Tall; i++)
  757. if(rrtname[i] && strcmp(rrtname[i], atype) == 0)
  758. return i;
  759. // make any a synonym for all
  760. if(strcmp(atype, "any") == 0)
  761. return Tall;
  762. return atoi(atype);
  763. }
  764. /*
  765. * convert an integer RR type to it's ascii name
  766. */
  767. char*
  768. rrname(int type, char *buf, int len)
  769. {
  770. char *t;
  771. t = 0;
  772. if(type <= Tall)
  773. t = rrtname[type];
  774. if(t==0){
  775. snprint(buf, len, "%d", type);
  776. t = buf;
  777. }
  778. return t;
  779. }
  780. /*
  781. * return 0 if not a supported rr type
  782. */
  783. int
  784. rrsupported(int type)
  785. {
  786. if(type < 0 || type >Tall)
  787. return 0;
  788. return rrtname[type] != 0;
  789. }
  790. /*
  791. * compare 2 types
  792. */
  793. int
  794. tsame(int t1, int t2)
  795. {
  796. return t1 == t2 || t1 == Tall;
  797. }
  798. /*
  799. * Add resource records to a list, duplicate them if they are cached
  800. * RR's since these are shared.
  801. */
  802. RR*
  803. rrcat(RR **start, RR *rp)
  804. {
  805. RR **last;
  806. last = start;
  807. while(*last != 0)
  808. last = &(*last)->next;
  809. *last = rp;
  810. return *start;
  811. }
  812. /*
  813. * remove negative cache rr's from an rr list
  814. */
  815. RR*
  816. rrremneg(RR **l)
  817. {
  818. RR **nl, *rp;
  819. RR *first;
  820. first = nil;
  821. nl = &first;
  822. while(*l != nil){
  823. rp = *l;
  824. if(rp->negative){
  825. *l = rp->next;
  826. *nl = rp;
  827. nl = &rp->next;
  828. *nl = nil;
  829. } else
  830. l = &rp->next;
  831. }
  832. return first;
  833. }
  834. /*
  835. * remove rr's of a particular type from an rr list
  836. */
  837. RR*
  838. rrremtype(RR **l, int type)
  839. {
  840. RR **nl, *rp;
  841. RR *first;
  842. first = nil;
  843. nl = &first;
  844. while(*l != nil){
  845. rp = *l;
  846. if(rp->type == type){
  847. *l = rp->next;
  848. *nl = rp;
  849. nl = &rp->next;
  850. *nl = nil;
  851. } else
  852. l = &(*l)->next;
  853. }
  854. return first;
  855. }
  856. /*
  857. * print conversion for rr records
  858. */
  859. int
  860. rrfmt(Fmt *f)
  861. {
  862. RR *rp;
  863. char *strp;
  864. Fmt fstr;
  865. int rv;
  866. char buf[Domlen];
  867. Server *s;
  868. Txt *t;
  869. fmtstrinit(&fstr);
  870. rp = va_arg(f->args, RR*);
  871. if(rp == 0){
  872. fmtprint(&fstr, "<null>");
  873. goto out;
  874. }
  875. fmtprint(&fstr, "%s %s", rp->owner->name,
  876. rrname(rp->type, buf, sizeof buf));
  877. if(rp->negative){
  878. fmtprint(&fstr, "\tnegative - rcode %d", rp->negrcode);
  879. goto out;
  880. }
  881. switch(rp->type){
  882. case Thinfo:
  883. fmtprint(&fstr, "\t%s %s", rp->cpu->name, rp->os->name);
  884. break;
  885. case Tcname:
  886. case Tmb:
  887. case Tmd:
  888. case Tmf:
  889. case Tns:
  890. fmtprint(&fstr, "\t%s", rp->host->name);
  891. break;
  892. case Tmg:
  893. case Tmr:
  894. fmtprint(&fstr, "\t%s", rp->mb->name);
  895. break;
  896. case Tminfo:
  897. fmtprint(&fstr, "\t%s %s", rp->mb->name, rp->rmb->name);
  898. break;
  899. case Tmx:
  900. fmtprint(&fstr, "\t%lud %s", rp->pref, rp->host->name);
  901. break;
  902. case Ta:
  903. case Taaaa:
  904. fmtprint(&fstr, "\t%s", rp->ip->name);
  905. break;
  906. case Tptr:
  907. fmtprint(&fstr, "\t%s(%lud)", rp->ptr->name, rp->ptr->ordinal);
  908. break;
  909. case Tsoa:
  910. fmtprint(&fstr, "\t%s %s %lud %lud %lud %lud %lud", rp->host->name,
  911. rp->rmb->name, rp->soa->serial, rp->soa->refresh, rp->soa->retry,
  912. rp->soa->expire, rp->soa->minttl);
  913. for(s = rp->soa->slaves; s != nil; s = s->next)
  914. fmtprint(&fstr, " %s", s->name);
  915. break;
  916. case Tnull:
  917. fmtprint(&fstr, "\t%.*H", rp->null->dlen, rp->null->data);
  918. break;
  919. case Ttxt:
  920. fmtprint(&fstr, "\t");
  921. for(t = rp->txt; t != nil; t = t->next)
  922. fmtprint(&fstr, "%s", t->p);
  923. break;
  924. case Trp:
  925. fmtprint(&fstr, "\t%s %s", rp->rmb->name, rp->rp->name);
  926. break;
  927. case Tkey:
  928. fmtprint(&fstr, "\t%d %d %d", rp->key->flags, rp->key->proto,
  929. rp->key->alg);
  930. break;
  931. case Tsig:
  932. fmtprint(&fstr, "\t%d %d %d %lud %lud %lud %d %s",
  933. rp->sig->type, rp->sig->alg, rp->sig->labels, rp->sig->ttl,
  934. rp->sig->exp, rp->sig->incep, rp->sig->tag, rp->sig->signer->name);
  935. break;
  936. case Tcert:
  937. fmtprint(&fstr, "\t%d %d %d",
  938. rp->sig->type, rp->sig->tag, rp->sig->alg);
  939. break;
  940. default:
  941. break;
  942. }
  943. out:
  944. strp = fmtstrflush(&fstr);
  945. rv = fmtstrcpy(f, strp);
  946. free(strp);
  947. return rv;
  948. }
  949. /*
  950. * print conversion for rr records in attribute value form
  951. */
  952. int
  953. rravfmt(Fmt *f)
  954. {
  955. RR *rp;
  956. char *strp;
  957. Fmt fstr;
  958. int rv;
  959. Server *s;
  960. Txt *t;
  961. int quote;
  962. fmtstrinit(&fstr);
  963. rp = va_arg(f->args, RR*);
  964. if(rp == 0){
  965. fmtprint(&fstr, "<null>");
  966. goto out;
  967. }
  968. if(rp->type == Tptr)
  969. fmtprint(&fstr, "ptr=%s", rp->owner->name);
  970. else
  971. fmtprint(&fstr, "dom=%s", rp->owner->name);
  972. switch(rp->type){
  973. case Thinfo:
  974. fmtprint(&fstr, " cpu=%s os=%s", rp->cpu->name, rp->os->name);
  975. break;
  976. case Tcname:
  977. fmtprint(&fstr, " cname=%s", rp->host->name);
  978. break;
  979. case Tmb:
  980. case Tmd:
  981. case Tmf:
  982. fmtprint(&fstr, " mbox=%s", rp->host->name);
  983. break;
  984. case Tns:
  985. fmtprint(&fstr, " ns=%s", rp->host->name);
  986. break;
  987. case Tmg:
  988. case Tmr:
  989. fmtprint(&fstr, " mbox=%s", rp->mb->name);
  990. break;
  991. case Tminfo:
  992. fmtprint(&fstr, " mbox=%s mbox=%s", rp->mb->name, rp->rmb->name);
  993. break;
  994. case Tmx:
  995. fmtprint(&fstr, " pref=%lud mx=%s", rp->pref, rp->host->name);
  996. break;
  997. case Ta:
  998. case Taaaa:
  999. fmtprint(&fstr, " ip=%s", rp->ip->name);
  1000. break;
  1001. case Tptr:
  1002. fmtprint(&fstr, " dom=%s", rp->ptr->name);
  1003. break;
  1004. case Tsoa:
  1005. fmtprint(&fstr, " ns=%s mbox=%s serial=%lud refresh=%lud retry=%lud expire=%lud ttl=%lud",
  1006. rp->host->name, rp->rmb->name, rp->soa->serial,
  1007. rp->soa->refresh, rp->soa->retry,
  1008. rp->soa->expire, rp->soa->minttl);
  1009. for(s = rp->soa->slaves; s != nil; s = s->next)
  1010. fmtprint(&fstr, " dnsslave=%s", s->name);
  1011. break;
  1012. case Tnull:
  1013. fmtprint(&fstr, " null=%.*H", rp->null->dlen, rp->null->data);
  1014. break;
  1015. case Ttxt:
  1016. fmtprint(&fstr, " txt=");
  1017. quote = 0;
  1018. for(t = rp->txt; t != nil; t = t->next)
  1019. if(strchr(t->p, ' '))
  1020. quote = 1;
  1021. if(quote)
  1022. fmtprint(&fstr, "\"");
  1023. for(t = rp->txt; t != nil; t = t->next)
  1024. fmtprint(&fstr, "%s", t->p);
  1025. if(quote)
  1026. fmtprint(&fstr, "\"");
  1027. break;
  1028. case Trp:
  1029. fmtprint(&fstr, " rp=%s txt=%s", rp->rmb->name, rp->rp->name);
  1030. break;
  1031. case Tkey:
  1032. fmtprint(&fstr, " flags=%d proto=%d alg=%d",
  1033. rp->key->flags, rp->key->proto, rp->key->alg);
  1034. break;
  1035. case Tsig:
  1036. fmtprint(&fstr, " type=%d alg=%d labels=%d ttl=%lud exp=%lud incep=%lud tag=%d signer=%s",
  1037. rp->sig->type, rp->sig->alg, rp->sig->labels, rp->sig->ttl,
  1038. rp->sig->exp, rp->sig->incep, rp->sig->tag, rp->sig->signer->name);
  1039. break;
  1040. case Tcert:
  1041. fmtprint(&fstr, " type=%d tag=%d alg=%d",
  1042. rp->sig->type, rp->sig->tag, rp->sig->alg);
  1043. break;
  1044. default:
  1045. break;
  1046. }
  1047. out:
  1048. strp = fmtstrflush(&fstr);
  1049. rv = fmtstrcpy(f, strp);
  1050. free(strp);
  1051. return rv;
  1052. }
  1053. void
  1054. warning(char *fmt, ...)
  1055. {
  1056. char dnserr[128];
  1057. va_list arg;
  1058. va_start(arg, fmt);
  1059. vseprint(dnserr, dnserr+sizeof(dnserr), fmt, arg);
  1060. va_end(arg);
  1061. syslog(1, "dns", dnserr);
  1062. }
  1063. /*
  1064. * create a slave process to handle a request to avoid one request blocking
  1065. * another
  1066. */
  1067. void
  1068. slave(Request *req)
  1069. {
  1070. static int slaveid;
  1071. if(req->isslave)
  1072. return; /* we're already a slave process */
  1073. /* limit parallelism */
  1074. if(getactivity(req) > Maxactive){
  1075. putactivity();
  1076. return;
  1077. }
  1078. switch(rfork(RFPROC|RFNOTEG|RFMEM|RFNOWAIT)){
  1079. case -1:
  1080. putactivity();
  1081. break;
  1082. case 0:
  1083. req->isslave = 1;
  1084. break;
  1085. default:
  1086. longjmp(req->mret, 1);
  1087. }
  1088. }
  1089. /*
  1090. * chasing down double free's
  1091. */
  1092. void
  1093. dncheck(void *p, int dolock)
  1094. {
  1095. int i;
  1096. DN *dp;
  1097. RR *rp;
  1098. extern Pool *mainmem;
  1099. if(p != nil){
  1100. dp = p;
  1101. assert(dp->magic == DNmagic);
  1102. }
  1103. if(!testing)
  1104. return;
  1105. if(dolock)
  1106. lock(&dnlock);
  1107. poolcheck(mainmem);
  1108. for(i = 0; i < HTLEN; i++)
  1109. for(dp = ht[i]; dp; dp = dp->next){
  1110. assert(dp != p);
  1111. assert(dp->magic == DNmagic);
  1112. for(rp = dp->rr; rp; rp = rp->next){
  1113. assert(rp->magic == RRmagic);
  1114. assert(rp->cached);
  1115. assert(rp->owner == dp);
  1116. }
  1117. }
  1118. if(dolock)
  1119. unlock(&dnlock);
  1120. }
  1121. static int
  1122. rrequiv(RR *r1, RR *r2)
  1123. {
  1124. return r1->owner == r2->owner
  1125. && r1->type == r2->type
  1126. && r1->arg0 == r2->arg0
  1127. && r1->arg1 == r2->arg1;
  1128. }
  1129. void
  1130. unique(RR *rp)
  1131. {
  1132. RR **l, *nrp;
  1133. for(; rp; rp = rp->next){
  1134. l = &rp->next;
  1135. for(nrp = *l; nrp; nrp = *l){
  1136. if(rrequiv(rp, nrp)){
  1137. *l = nrp->next;
  1138. rrfree(nrp);
  1139. } else
  1140. l = &nrp->next;
  1141. }
  1142. }
  1143. }
  1144. /*
  1145. * true if second domain is subsumed by the first
  1146. */
  1147. int
  1148. subsume(char *higher, char *lower)
  1149. {
  1150. int hn, ln;
  1151. ln = strlen(lower);
  1152. hn = strlen(higher);
  1153. if(ln < hn)
  1154. return 0;
  1155. if(cistrcmp(lower + ln - hn, higher) != 0)
  1156. return 0;
  1157. if(ln > hn && hn != 0 && lower[ln - hn - 1] != '.')
  1158. return 0;
  1159. return 1;
  1160. }
  1161. /*
  1162. * randomize the order we return items to provide some
  1163. * load balancing for servers.
  1164. *
  1165. * only randomize the first class of entries
  1166. */
  1167. RR*
  1168. randomize(RR *rp)
  1169. {
  1170. RR *first, *last, *x, *base;
  1171. ulong n;
  1172. if(rp == nil || rp->next == nil)
  1173. return rp;
  1174. /* just randomize addresses and mx's */
  1175. for(x = rp; x; x = x->next)
  1176. if(x->type != Ta && x->type != Tmx && x->type != Tns)
  1177. return rp;
  1178. base = rp;
  1179. n = rand();
  1180. last = first = nil;
  1181. while(rp != nil){
  1182. /* stop randomizing if we've moved past our class */
  1183. if(base->auth != rp->auth || base->db != rp->db){
  1184. last->next = rp;
  1185. break;
  1186. }
  1187. /* unchain */
  1188. x = rp;
  1189. rp = x->next;
  1190. x->next = nil;
  1191. if(n&1){
  1192. /* add to tail */
  1193. if(last == nil)
  1194. first = x;
  1195. else
  1196. last->next = x;
  1197. last = x;
  1198. } else {
  1199. /* add to head */
  1200. if(last == nil)
  1201. last = x;
  1202. x->next = first;
  1203. first = x;
  1204. }
  1205. /* reroll the dice */
  1206. n >>= 1;
  1207. }
  1208. return first;
  1209. }
  1210. static int
  1211. sencodefmt(Fmt *f)
  1212. {
  1213. char *out;
  1214. char *buf;
  1215. int i, len;
  1216. int ilen;
  1217. int rv;
  1218. uchar *b;
  1219. char obuf[64]; // rsc optimization
  1220. if(!(f->flags&FmtPrec) || f->prec < 1)
  1221. goto error;
  1222. b = va_arg(f->args, uchar*);
  1223. if(b == nil)
  1224. goto error;
  1225. /* if it's a printable, go for it */
  1226. len = f->prec;
  1227. for(i = 0; i < len; i++)
  1228. if(!isprint(b[i]))
  1229. break;
  1230. if(i == len){
  1231. if(len >= sizeof obuf)
  1232. len = sizeof(obuf)-1;
  1233. memmove(obuf, b, len);
  1234. obuf[len] = 0;
  1235. fmtstrcpy(f, obuf);
  1236. return 0;
  1237. }
  1238. ilen = f->prec;
  1239. f->prec = 0;
  1240. f->flags &= ~FmtPrec;
  1241. switch(f->r){
  1242. case '<':
  1243. len = (8*ilen+4)/5 + 3;
  1244. break;
  1245. case '[':
  1246. len = (8*ilen+5)/6 + 4;
  1247. break;
  1248. case 'H':
  1249. len = 2*ilen + 1;
  1250. break;
  1251. default:
  1252. goto error;
  1253. }
  1254. if(len > sizeof(obuf)){
  1255. buf = malloc(len);
  1256. if(buf == nil)
  1257. goto error;
  1258. } else
  1259. buf = obuf;
  1260. // convert
  1261. out = buf;
  1262. switch(f->r){
  1263. case '<':
  1264. rv = enc32(out, len, b, ilen);
  1265. break;
  1266. case '[':
  1267. rv = enc64(out, len, b, ilen);
  1268. break;
  1269. case 'H':
  1270. rv = enc16(out, len, b, ilen);
  1271. break;
  1272. default:
  1273. rv = -1;
  1274. break;
  1275. }
  1276. if(rv < 0)
  1277. goto error;
  1278. fmtstrcpy(f, buf);
  1279. if(buf != obuf)
  1280. free(buf);
  1281. return 0;
  1282. error:
  1283. return fmtstrcpy(f, "<encodefmt>");
  1284. }
  1285. void*
  1286. emalloc(int size)
  1287. {
  1288. char *x;
  1289. x = mallocz(size, 1);
  1290. if(x == nil)
  1291. abort();
  1292. return x;
  1293. }
  1294. char*
  1295. estrdup(char *s)
  1296. {
  1297. int size;
  1298. char *p;
  1299. size = strlen(s)+1;
  1300. p = mallocz(size, 0);
  1301. if(p == nil)
  1302. abort();
  1303. memmove(p, s, size);
  1304. return p;
  1305. }
  1306. /*
  1307. * create a pointer record
  1308. */
  1309. static RR*
  1310. mkptr(DN *dp, char *ptr, ulong ttl)
  1311. {
  1312. DN *ipdp;
  1313. RR *rp;
  1314. ipdp = dnlookup(ptr, Cin, 1);
  1315. rp = rralloc(Tptr);
  1316. rp->ptr = dp;
  1317. rp->owner = ipdp;
  1318. rp->db = 1;
  1319. if(ttl)
  1320. rp->ttl = ttl;
  1321. return rp;
  1322. }
  1323. /*
  1324. * look for all ip addresses in this network and make
  1325. * pointer records for them.
  1326. */
  1327. void
  1328. dnptr(uchar *net, uchar *mask, char *dom, int bytes, int ttl)
  1329. {
  1330. int i, j;
  1331. DN *dp;
  1332. RR *rp, *nrp, *first, **l;
  1333. uchar ip[IPaddrlen];
  1334. uchar nnet[IPaddrlen];
  1335. char ptr[Domlen];
  1336. char *p, *e;
  1337. l = &first;
  1338. first = nil;
  1339. for(i = 0; i < HTLEN; i++){
  1340. for(dp = ht[i]; dp; dp = dp->next){
  1341. for(rp = dp->rr; rp; rp = rp->next){
  1342. if(rp->type != Ta || rp->negative)
  1343. continue;
  1344. parseip(ip, rp->ip->name);
  1345. maskip(ip, mask, nnet);
  1346. if(ipcmp(net, nnet) != 0)
  1347. continue;
  1348. p = ptr;
  1349. e = ptr+sizeof(ptr);
  1350. for(j = IPaddrlen-1; j >= IPaddrlen-bytes; j--)
  1351. p = seprint(p, e, "%d.", ip[j]);
  1352. seprint(p, e, "%s", dom);
  1353. nrp = mkptr(dp, ptr, ttl);
  1354. *l = nrp;
  1355. l = &nrp->next;
  1356. }
  1357. }
  1358. }
  1359. for(rp = first; rp != nil; rp = nrp){
  1360. nrp = rp->next;
  1361. rp->next = nil;
  1362. rrattach(rp, 1);
  1363. }
  1364. }
  1365. void
  1366. freeserverlist(Server *s)
  1367. {
  1368. Server *next;
  1369. for(; s != nil; s = next){
  1370. next = s->next;
  1371. free(s);
  1372. }
  1373. }
  1374. void
  1375. addserver(Server **l, char *name)
  1376. {
  1377. Server *s;
  1378. while(*l)
  1379. l = &(*l)->next;
  1380. s = malloc(sizeof(Server)+strlen(name)+1);
  1381. if(s == nil)
  1382. return;
  1383. s->name = (char*)(s+1);
  1384. strcpy(s->name, name);
  1385. s->next = nil;
  1386. *l = s;
  1387. }
  1388. Server*
  1389. copyserverlist(Server *s)
  1390. {
  1391. Server *ns;
  1392. for(ns = nil; s != nil; s = s->next)
  1393. addserver(&ns, s->name);
  1394. return ns;
  1395. }