sys/src/cmd/ndb/dn.c

   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 /*
   9  *  this comment used to say `our target is 4000 names cached, this should
  10  *  be larger on large servers'.  dns at Bell Labs starts off with
  11  *  about 1780 names.
  12  *
  13  * aging seems to corrupt the cache, so raise the trigger from 4000 until we
  14  * figure it out.
  15  */
  16 enum {
  17 //      Deftarget       = 1<<30,        /* effectively disable aging */
  18 //      Minage          = 1<<30,
  19 //      Defagefreq      = 1<<30,        /* age names this often (seconds) */
  20
  21         /* these settings will trigger frequent aging */
  22         Deftarget       = 4000,
  23         Minage          =  5*60,
  24         Defagefreq      = 15*60,        /* age names this often (seconds) */
  25 };
  26
  27 /*
  28  *  Hash table for domain names.  The hash is based only on the
  29  *  first element of the domain name.
  30  */
  31 DN *ht[HTLEN];
  32
  33 static struct {
  34         Lock;
  35         ulong   names;          /* names allocated */
  36         ulong   oldest;         /* longest we'll leave a name around */
  37         int     active;
  38         int     mutex;
  39         ushort  id;             /* same size as in packet */
  40 } dnvars;
  41
  42 /* names of RR types */
  43 char *rrtname[] =
  44 {
  45 [Ta]            "ip",
  46 [Tns]           "ns",
  47 [Tmd]           "md",
  48 [Tmf]           "mf",
  49 [Tcname]        "cname",
  50 [Tsoa]          "soa",
  51 [Tmb]           "mb",
  52 [Tmg]           "mg",
  53 [Tmr]           "mr",
  54 [Tnull]         "null",
  55 [Twks]          "wks",
  56 [Tptr]          "ptr",
  57 [Thinfo]        "hinfo",
  58 [Tminfo]        "minfo",
  59 [Tmx]           "mx",
  60 [Ttxt]          "txt",
  61 [Trp]           "rp",
  62 [Tafsdb]        "afsdb",
  63 [Tx25]          "x.25",
  64 [Tisdn]         "isdn",
  65 [Trt]           "rt",
  66 [Tnsap]         "nsap",
  67 [Tnsapptr]      "nsap-ptr",
  68 [Tsig]          "sig",
  69 [Tkey]          "key",
  70 [Tpx]           "px",
  71 [Tgpos]         "gpos",
  72 [Taaaa]         "ipv6",
  73 [Tloc]          "loc",
  74 [Tnxt]          "nxt",
  75 [Teid]          "eid",
  76 [Tnimloc]       "nimrod",
  77 [Tsrv]          "srv",
  78 [Tatma]         "atma",
  79 [Tnaptr]        "naptr",
  80 [Tkx]           "kx",
  81 [Tcert]         "cert",
  82 [Ta6]           "a6",
  83 [Tdname]        "dname",
  84 [Tsink]         "sink",
  85 [Topt]          "opt",
  86 [Tapl]          "apl",
  87 [Tds]           "ds",
  88 [Tsshfp]        "sshfp",
  89 [Tipseckey]     "ipseckey",
  90 [Trrsig]        "rrsig",
  91 [Tnsec]         "nsec",
  92 [Tdnskey]       "dnskey",
  93 [Tspf]          "spf",
  94 [Tuinfo]        "uinfo",
  95 [Tuid]          "uid",
  96 [Tgid]          "gid",
  97 [Tunspec]       "unspec",
  98 [Ttkey]         "tkey",
  99 [Ttsig]         "tsig",
 100 [Tixfr]         "ixfr",
 101 [Taxfr]         "axfr",
 102 [Tmailb]        "mailb",
 103 [Tmaila]        "maila",
 104 [Tall]          "all",
 105                 0,
 106 };
 107
 108 /* names of response codes */
 109 char *rname[Rmask+1] =
 110 {
 111 [Rok]                   "ok",
 112 [Rformat]               "format error",
 113 [Rserver]               "server failure",
 114 [Rname]                 "bad name",
 115 [Runimplimented]        "unimplemented",
 116 [Rrefused]              "we don't like you",
 117 [Ryxdomain]             "name should not exist",
 118 [Ryxrrset]              "rr set should not exist",
 119 [Rnxrrset]              "rr set should exist",
 120 [Rnotauth]              "not authorative",
 121 [Rnotzone]              "not in zone",
 122 [Rbadvers]              "bad opt version",
 123 /* [Rbadsig]            "bad signature", */
 124 [Rbadkey]               "bad key",
 125 [Rbadtime]              "bad signature time",
 126 [Rbadmode]              "bad mode",
 127 [Rbadname]              "duplicate key name",
 128 [Rbadalg]               "bad algorithm",
 129 };
 130 unsigned nrname = nelem(rname);
 131
 132 /* names of op codes */
 133 char *opname[] =
 134 {
 135 [Oquery]        "query",
 136 [Oinverse]      "inverse query (retired)",
 137 [Ostatus]       "status",
 138 [Oupdate]       "update",
 139 };
 140
 141 ulong target = Deftarget;
 142 Lock    dnlock;
 143
 144 static ulong agefreq = Defagefreq;
 145
 146 static int rrequiv(RR *r1, RR *r2);
 147 static int sencodefmt(Fmt*);
 148
 149 static void
 150 ding(void*, char *msg)
 151 {
 152         if(strstr(msg, "alarm") != nil) {
 153                 stats.alarms++;
 154                 noted(NCONT);           /* resume with system call error */
 155         } else
 156                 noted(NDFLT);           /* die */
 157 }
 158
 159 void
 160 dninit(void)
 161 {
 162         fmtinstall('E', eipfmt);
 163         fmtinstall('I', eipfmt);
 164         fmtinstall('V', eipfmt);
 165         fmtinstall('R', rrfmt);
 166         fmtinstall('Q', rravfmt);
 167         fmtinstall('H', sencodefmt);
 168
 169         dnvars.oldest = maxage;
 170         dnvars.names = 0;
 171         dnvars.id = truerand(); /* don't start with same id every time */
 172
 173         notify(ding);
 174 }
 175
 176 /*
 177  *  hash for a domain name
 178  */
 179 static ulong
 180 dnhash(char *name)
 181 {
 182         ulong hash;
 183         uchar *val = (uchar*)name;
 184
 185         for(hash = 0; *val; val++)
 186                 hash = hash*13 + tolower(*val)-'a';
 187         return hash % HTLEN;
 188 }
 189
 190 /*
 191  *  lookup a symbol.  if enter is not zero and the name is
 192  *  not found, create it.
 193  */
 194 DN*
 195 dnlookup(char *name, int class, int enter)
 196 {
 197         DN **l;
 198         DN *dp;
 199
 200         l = &ht[dnhash(name)];
 201         lock(&dnlock);
 202         for(dp = *l; dp; dp = dp->next) {
 203                 assert(dp->magic == DNmagic);
 204                 if(dp->class == class && cistrcmp(dp->name, name) == 0){
 205                         dp->referenced = now;
 206                         unlock(&dnlock);
 207                         return dp;
 208                 }
 209                 l = &dp->next;
 210         }
 211
 212         if(!enter){
 213                 unlock(&dnlock);
 214                 return 0;
 215         }
 216         dnvars.names++;
 217         dp = emalloc(sizeof(*dp));
 218         dp->magic = DNmagic;
 219         dp->name = estrdup(name);
 220         dp->class = class;
 221         dp->rr = nil;
 222         dp->referenced = now;
 223         /* add new DN to tail of the hash list.  *l points to last next ptr. */
 224         dp->next = nil;
 225         *l = dp;
 226         unlock(&dnlock);
 227
 228         return dp;
 229 }
 230
 231 static int
 232 rrsame(RR *rr1, RR *rr2)
 233 {
 234         return rr1 == rr2 || rr2 && rrequiv(rr1, rr2) &&
 235                 rr1->db == rr2->db && rr1->auth == rr2->auth;
 236 }
 237
 238 static int
 239 rronlist(RR *rp, RR *lp)
 240 {
 241         for(; lp; lp = lp->next)
 242                 if (rrsame(lp, rp))
 243                         return 1;
 244         return 0;
 245 }
 246
 247 /*
 248  * dump the stats
 249  */
 250 void
 251 dnstats(char *file)
 252 {
 253         int i, fd;
 254
 255         fd = create(file, OWRITE, 0666);
 256         if(fd < 0)
 257                 return;
 258
 259         qlock(&stats);
 260         fprint(fd, "# system %s\n", sysname());
 261         fprint(fd, "# slave procs high-water mark\t%lud\n", stats.slavehiwat);
 262         fprint(fd, "# queries received by 9p\t%lud\n", stats.qrecvd9p);
 263         fprint(fd, "# queries received by udp\t%lud\n", stats.qrecvdudp);
 264         fprint(fd, "# queries answered from memory\t%lud\n", stats.answinmem);
 265         fprint(fd, "# queries sent by udp\t%lud\n", stats.qsent);
 266         for (i = 0; i < nelem(stats.under10ths); i++)
 267                 if (stats.under10ths[i] || i == nelem(stats.under10ths) - 1)
 268                         fprint(fd, "# responses arriving within %.1f s.\t%lud\n",
 269                                 (double)(i+1)/10, stats.under10ths[i]);
 270         fprint(fd, "\n# queries sent & timed-out\t%lud\n", stats.tmout);
 271         fprint(fd, "# cname queries timed-out\t%lud\n", stats.tmoutcname);
 272         fprint(fd, "# ipv6  queries timed-out\t%lud\n", stats.tmoutv6);
 273         fprint(fd, "\n# negative answers received\t%lud\n", stats.negans);
 274         fprint(fd, "# negative answers w Rserver set\t%lud\n", stats.negserver);
 275         fprint(fd, "# negative answers w bad delegation\t%lud\n",
 276                 stats.negbaddeleg);
 277         fprint(fd, "# negative answers w bad delegation & no answers\t%lud\n",
 278                 stats.negbdnoans);
 279         fprint(fd, "# negative answers w no Rname set\t%lud\n", stats.negnorname);
 280         fprint(fd, "# negative answers cached\t%lud\n", stats.negcached);
 281         qunlock(&stats);
 282
 283         lock(&dnlock);
 284         fprint(fd, "\n# domain names %lud target %lud\n", dnvars.names, target);
 285         unlock(&dnlock);
 286         close(fd);
 287 }
 288
 289 /*
 290  *  dump the cache
 291  */
 292 void
 293 dndump(char *file)
 294 {
 295         int i, fd;
 296         DN *dp;
 297         RR *rp;
 298
 299         fd = create(file, OWRITE, 0666);
 300         if(fd < 0)
 301                 return;
 302
 303         lock(&dnlock);
 304         for(i = 0; i < HTLEN; i++)
 305                 for(dp = ht[i]; dp; dp = dp->next){
 306                         fprint(fd, "%s\n", dp->name);
 307                         for(rp = dp->rr; rp; rp = rp->next) {
 308                                 fprint(fd, "\t%R %c%c %lud/%lud\n",
 309                                         rp, rp->auth? 'A': 'U',
 310                                         rp->db? 'D': 'N', rp->expire, rp->ttl);
 311                                 if (rronlist(rp, rp->next))
 312                                         fprint(fd, "*** duplicate:\n");
 313                         }
 314                 }
 315         unlock(&dnlock);
 316         close(fd);
 317 }
 318
 319 /*
 320  *  purge all records
 321  */
 322 void
 323 dnpurge(void)
 324 {
 325         DN *dp;
 326         RR *rp, *srp;
 327         int i;
 328
 329         lock(&dnlock);
 330
 331         for(i = 0; i < HTLEN; i++)
 332                 for(dp = ht[i]; dp; dp = dp->next){
 333                         srp = rp = dp->rr;
 334                         dp->rr = nil;
 335                         for(; rp != nil; rp = rp->next)
 336                                 rp->cached = 0;
 337                         rrfreelist(srp);
 338                 }
 339
 340         unlock(&dnlock);
 341 }
 342
 343 /*
 344  *  delete head of *l and free the old head.
 345  *  call with dnlock held.
 346  */
 347 static void
 348 rrdelhead(RR **l)
 349 {
 350         RR *rp;
 351
 352         if (canlock(&dnlock))
 353                 abort();        /* rrdelhead called with dnlock not held */
 354         rp = *l;
 355         if(rp == nil)
 356                 return;
 357         *l = rp->next;          /* unlink head */
 358         rp->cached = 0;         /* avoid blowing an assertion in rrfree */
 359         rrfree(rp);
 360 }
 361
 362 /*
 363  *  check the age of resource records, free any that have timed out.
 364  *  call with dnlock held.
 365  */
 366 void
 367 dnage(DN *dp)
 368 {
 369         RR **l, *rp;
 370         ulong diff;
 371
 372         if (canlock(&dnlock))
 373                 abort();        /* dnage called with dnlock not held */
 374         diff = now - dp->referenced;
 375         if(diff < Reserved || dp->keep)
 376                 return;
 377
 378         l = &dp->rr;
 379         while ((rp = *l) != nil){
 380                 assert(rp->magic == RRmagic && rp->cached);
 381                 if(!rp->db && (rp->expire < now || diff > dnvars.oldest))
 382                         rrdelhead(l); /* rp == *l before; *l == rp->next after */
 383                 else
 384                         l = &rp->next;
 385         }
 386 }
 387
 388 #define MARK(dp)        { if (dp) (dp)->keep = 1; }
 389
 390 /* mark a domain name and those in its RRs as never to be aged */
 391 void
 392 dnagenever(DN *dp, int dolock)
 393 {
 394         RR *rp;
 395
 396         if (dolock)
 397                 lock(&dnlock);
 398
 399         /* mark all referenced domain names */
 400         MARK(dp);
 401         for(rp = dp->rr; rp; rp = rp->next){
 402                 MARK(rp->owner);
 403                 if(rp->negative){
 404                         MARK(rp->negsoaowner);
 405                         continue;
 406                 }
 407                 switch(rp->type){
 408                 case Thinfo:
 409                         MARK(rp->cpu);
 410                         MARK(rp->os);
 411                         break;
 412                 case Ttxt:
 413                         break;
 414                 case Tcname:
 415                 case Tmb:
 416                 case Tmd:
 417                 case Tmf:
 418                 case Tns:
 419                 case Tmx:
 420                 case Tsrv:
 421                         MARK(rp->host);
 422                         break;
 423                 case Tmg:
 424                 case Tmr:
 425                         MARK(rp->mb);
 426                         break;
 427                 case Tminfo:
 428                         MARK(rp->rmb);
 429                         MARK(rp->mb);
 430                         break;
 431                 case Trp:
 432                         MARK(rp->rmb);
 433                         MARK(rp->rp);
 434                         break;
 435                 case Ta:
 436                 case Taaaa:
 437                         MARK(rp->ip);
 438                         break;
 439                 case Tptr:
 440                         MARK(rp->ptr);
 441                         break;
 442                 case Tsoa:
 443                         MARK(rp->host);
 444                         MARK(rp->rmb);
 445                         break;
 446                 case Tsig:
 447                         MARK(rp->sig->signer);
 448                         break;
 449                 }
 450         }
 451
 452         if (dolock)
 453                 unlock(&dnlock);
 454 }
 455
 456 #define REF(dp) { if (dp) (dp)->refs++; }
 457
 458 /*
 459  *  periodicly sweep for old records and remove unreferenced domain names
 460  *
 461  *  only called when all other threads are locked out
 462  */
 463 void
 464 dnageall(int doit)
 465 {
 466         DN *dp, **l;
 467         int i;
 468         RR *rp;
 469         static ulong nextage;
 470
 471         if(dnvars.names < target || (now < nextage && !doit)){
 472                 dnvars.oldest = maxage;
 473                 return;
 474         }
 475
 476         if(dnvars.names >= target) {
 477                 dnslog("more names (%lud) than target (%lud)", dnvars.names,
 478                         target);
 479                 dnvars.oldest /= 2;
 480                 if (dnvars.oldest < Minage)
 481                         dnvars.oldest = Minage;         /* don't be silly */
 482         }
 483         if (agefreq > dnvars.oldest / 2)
 484                 nextage = now + dnvars.oldest / 2;
 485         else
 486                 nextage = now + agefreq;
 487
 488         lock(&dnlock);
 489
 490         /* time out all old entries (and set refs to 0) */
 491         for(i = 0; i < HTLEN; i++)
 492                 for(dp = ht[i]; dp; dp = dp->next){
 493                         dp->refs = 0;
 494                         dnage(dp);
 495                 }
 496
 497         /* mark all referenced domain names */
 498         for(i = 0; i < HTLEN; i++)
 499                 for(dp = ht[i]; dp; dp = dp->next)
 500                         for(rp = dp->rr; rp; rp = rp->next){
 501                                 REF(rp->owner);
 502                                 if(rp->negative){
 503                                         REF(rp->negsoaowner);
 504                                         continue;
 505                                 }
 506                                 switch(rp->type){
 507                                 case Thinfo:
 508                                         REF(rp->cpu);
 509                                         REF(rp->os);
 510                                         break;
 511                                 case Ttxt:
 512                                         break;
 513                                 case Tcname:
 514                                 case Tmb:
 515                                 case Tmd:
 516                                 case Tmf:
 517                                 case Tns:
 518                                 case Tmx:
 519                                 case Tsrv:
 520                                         REF(rp->host);
 521                                         break;
 522                                 case Tmg:
 523                                 case Tmr:
 524                                         REF(rp->mb);
 525                                         break;
 526                                 case Tminfo:
 527                                         REF(rp->rmb);
 528                                         REF(rp->mb);
 529                                         break;
 530                                 case Trp:
 531                                         REF(rp->rmb);
 532                                         REF(rp->rp);
 533                                         break;
 534                                 case Ta:
 535                                 case Taaaa:
 536                                         REF(rp->ip);
 537                                         break;
 538                                 case Tptr:
 539                                         REF(rp->ptr);
 540                                         break;
 541                                 case Tsoa:
 542                                         REF(rp->host);
 543                                         REF(rp->rmb);
 544                                         break;
 545                                 case Tsig:
 546                                         REF(rp->sig->signer);
 547                                         break;
 548                                 }
 549                         }
 550
 551         /* sweep and remove unreferenced domain names */
 552         for(i = 0; i < HTLEN; i++){
 553                 l = &ht[i];
 554                 for(dp = *l; dp; dp = *l){
 555                         if(dp->rr == nil && dp->refs == 0 && dp->keep == 0){
 556                                 assert(dp->magic == DNmagic);
 557                                 *l = dp->next;
 558
 559                                 free(dp->name);
 560                                 memset(dp, 0, sizeof *dp); /* cause trouble */
 561                                 dp->magic = ~DNmagic;
 562                                 free(dp);
 563
 564                                 dnvars.names--;
 565                                 continue;
 566                         }
 567                         l = &dp->next;
 568                 }
 569         }
 570
 571         unlock(&dnlock);
 572 }
 573
 574 /*
 575  *  timeout all database records (used when rereading db)
 576  */
 577 void
 578 dnagedb(void)
 579 {
 580         DN *dp;
 581         int i;
 582         RR *rp;
 583
 584         lock(&dnlock);
 585
 586         /* time out all database entries */
 587         for(i = 0; i < HTLEN; i++)
 588                 for(dp = ht[i]; dp; dp = dp->next) {
 589                         dp->keep = 0;
 590                         for(rp = dp->rr; rp; rp = rp->next)
 591                                 if(rp->db)
 592                                         rp->expire = 0;
 593                 }
 594
 595         unlock(&dnlock);
 596 }
 597
 598 /*
 599  *  mark all local db records about my area as authoritative,
 600  *  delete timed out ones
 601  */
 602 void
 603 dnauthdb(void)
 604 {
 605         int i;
 606         ulong minttl;
 607         Area *area;
 608         DN *dp;
 609         RR *rp, **l;
 610
 611         lock(&dnlock);
 612
 613         /* time out all database entries */
 614         for(i = 0; i < HTLEN; i++)
 615                 for(dp = ht[i]; dp; dp = dp->next){
 616                         area = inmyarea(dp->name);
 617                         l = &dp->rr;
 618                         for(rp = *l; rp; rp = *l){
 619                                 if(rp->db){
 620                                         if(rp->expire == 0){
 621                                                 rrdelhead(l);
 622                                                 continue;
 623                                         }
 624                                         if(area){
 625                                                 minttl = area->soarr->soa->minttl;
 626                                                 if(rp->ttl < minttl)
 627                                                         rp->ttl = minttl;
 628                                                 rp->auth = 1;
 629                                         }
 630                                 }
 631                                 l = &rp->next;
 632                         }
 633                 }
 634
 635         unlock(&dnlock);
 636 }
 637
 638 /*
 639  *  keep track of other processes to know if we can
 640  *  garbage collect.  block while garbage collecting.
 641  */
 642 int
 643 getactivity(Request *req, int recursive)
 644 {
 645         int rv;
 646
 647         if(traceactivity)
 648                 dnslog("get: %d active by pid %d from %p",
 649                         dnvars.active, getpid(), getcallerpc(&req));
 650         lock(&dnvars);
 651         /*
 652          * can't block here if we're already holding one
 653          * of the dnvars.active (recursive).  will deadlock.
 654          */
 655         while(!recursive && dnvars.mutex){
 656                 unlock(&dnvars);
 657                 sleep(100);                     /* tune; was 200 */
 658                 lock(&dnvars);
 659         }
 660         rv = ++dnvars.active;
 661         now = time(nil);
 662         nowns = nsec();
 663         req->id = ++dnvars.id;
 664         unlock(&dnvars);
 665
 666         return rv;
 667 }
 668 void
 669 putactivity(int recursive)
 670 {
 671         static ulong lastclean;
 672
 673         if(traceactivity)
 674                 dnslog("put: %d active by pid %d",
 675                         dnvars.active, getpid());
 676         lock(&dnvars);
 677         dnvars.active--;
 678         assert(dnvars.active >= 0); /* "dnvars.active %d", dnvars.active */
 679
 680         /*
 681          *  clean out old entries and check for new db periodicly
 682          *  can't block here if being called to let go a "recursive" lock
 683          *  or we'll deadlock waiting for ourselves to give up the dnvars.active.
 684          */
 685         if (recursive || dnvars.mutex ||
 686             (needrefresh == 0 && dnvars.active > 0)){
 687                 unlock(&dnvars);
 688                 return;
 689         }
 690
 691         /* wait till we're alone */
 692         dnvars.mutex = 1;
 693         while(dnvars.active > 0){
 694                 unlock(&dnvars);
 695                 sleep(100);             /* tune; was 100 */
 696                 lock(&dnvars);
 697         }
 698         unlock(&dnvars);
 699
 700         dncheck();
 701
 702         db2cache(needrefresh);
 703         dncheck();
 704
 705         dnageall(0);
 706
 707         dncheck();
 708
 709         /* let others back in */
 710         lastclean = now;
 711         needrefresh = 0;
 712         dnvars.mutex = 0;
 713 }
 714
 715 int
 716 rrlistlen(RR *rp)
 717 {
 718         int n;
 719
 720         n = 0;
 721         for(; rp; rp = rp->next)
 722                 ++n;
 723         return n;
 724 }
 725
 726 /*
 727  *  Attach a single resource record to a domain name (new->owner).
 728  *      - Avoid duplicates with already present RR's
 729  *      - Chain all RR's of the same type adjacent to one another
 730  *      - chain authoritative RR's ahead of non-authoritative ones
 731  *      - remove any expired RR's
 732  *  If new is a stale duplicate, rrfree it.
 733  *  Must be called with dnlock held.
 734  */
 735 static void
 736 rrattach1(RR *new, int auth)
 737 {
 738         RR **l;
 739         RR *rp;
 740         DN *dp;
 741
 742         assert(new->magic == RRmagic && !new->cached);
 743         if(!new->db) {
 744                 /*
 745                  * try not to let responses expire before we
 746                  * can use them to complete this query, by extending
 747                  * past (or nearly past) expiration time.
 748                  */
 749                 new->expire = new->ttl > now + Min? new->ttl: now + 10*Min;
 750         } else
 751                 new->expire = now + Year;
 752         dp = new->owner;
 753         assert(dp != nil && dp->magic == DNmagic);
 754         new->auth |= auth;
 755         new->next = 0;
 756
 757         /*
 758          *  find first rr of the right type
 759          */
 760         l = &dp->rr;
 761         for(rp = *l; rp; rp = *l){
 762                 assert(rp->magic == RRmagic && rp->cached);
 763                 if(rp->type == new->type)
 764                         break;
 765                 l = &rp->next;
 766         }
 767
 768         /*
 769          *  negative entries replace positive entries
 770          *  positive entries replace negative entries
 771          *  newer entries replace older entries with the same fields
 772          *
 773          *  look farther ahead than just the next entry when looking
 774          *  for duplicates; RRs of a given type can have different rdata
 775          *  fields (e.g. multiple NS servers).
 776          */
 777         while ((rp = *l) != nil){
 778                 assert(rp->magic == RRmagic && rp->cached);
 779                 if(rp->type != new->type)
 780                         break;
 781
 782                 if(rp->db == new->db && rp->auth == new->auth){
 783                         /* negative drives out positive and vice versa */
 784                         if(rp->negative != new->negative) {
 785                                 /* rp == *l before; *l == rp->next after */
 786                                 rrdelhead(l);
 787                                 continue;
 788                         }
 789                         /* all things equal, pick the newer one */
 790                         else if(rp->arg0 == new->arg0 && rp->arg1 == new->arg1){
 791                                 /* new drives out old */
 792                                 if (new->ttl <= rp->ttl &&
 793                                     new->expire <= rp->expire) {
 794                                         rrfree(new);
 795                                         return;
 796                                 }
 797                                 /* rp == *l before; *l == rp->next after */
 798                                 rrdelhead(l);
 799                                 continue;
 800                         }
 801                         /*
 802                          *  Hack for pointer records.  This makes sure
 803                          *  the ordering in the list reflects the ordering
 804                          *  received or read from the database
 805                          */
 806                         else if(rp->type == Tptr &&
 807                             !rp->negative && !new->negative &&
 808                             rp->ptr->ordinal > new->ptr->ordinal)
 809                                 break;
 810                 }
 811                 l = &rp->next;
 812         }
 813
 814         if (rronlist(new, rp)) {
 815                 /* should not happen; duplicates were processed above */
 816                 dnslog("adding duplicate %R to list of %R; aborting", new, rp);
 817                 abort();
 818         }
 819         /*
 820          *  add to chain
 821          */
 822         new->cached = 1;
 823         new->next = rp;
 824         *l = new;
 825 }
 826
 827 /*
 828  *  Attach a list of resource records to a domain name.
 829  *  May rrfree any stale duplicate RRs; dismembers the list.
 830  *  Upon return, every RR in the list will have been rrfree-d
 831  *  or attached to its domain name.
 832  *  See rrattach1 for properties preserved.
 833  */
 834 void
 835 rrattach(RR *rp, int auth)
 836 {
 837         RR *next;
 838         DN *dp;
 839
 840         lock(&dnlock);
 841         for(; rp; rp = next){
 842                 next = rp->next;
 843                 rp->next = nil;
 844                 dp = rp->owner;
 845                 /* avoid any outside spoofing; leave keepers alone */
 846                 if(cfg.cachedb && !rp->db && (dp->keep || inmyarea(dp->name)))
 847                         rrfree(rp);
 848                 else
 849                         rrattach1(rp, auth);
 850         }
 851         unlock(&dnlock);
 852 }
 853
 854 RR**
 855 rrcopy(RR *rp, RR **last)
 856 {
 857         RR *nrp;
 858         SOA *soa;
 859         Srv *srv;
 860         Key *key;
 861         Cert *cert;
 862         Sig *sig;
 863         Null *null;
 864         Txt *t, *nt, **l;
 865
 866         assert(rp->magic == RRmagic);
 867         nrp = rralloc(rp->type);
 868         switch(rp->type){
 869         case Tsoa:
 870                 soa = nrp->soa;
 871                 *nrp = *rp;
 872                 nrp->soa = soa;
 873                 *soa = *rp->soa;
 874                 soa->slaves = copyserverlist(rp->soa->slaves);
 875                 break;
 876         case Tsrv:
 877                 srv = nrp->srv;
 878                 *nrp = *rp;
 879                 nrp->srv = srv;
 880                 *srv = *rp->srv;
 881                 break;
 882         case Tkey:
 883                 key = nrp->key;
 884                 *nrp = *rp;
 885                 nrp->key = key;
 886                 *key = *rp->key;
 887                 key->data = emalloc(key->dlen);
 888                 memmove(key->data, rp->key->data, rp->key->dlen);
 889                 break;
 890         case Tcert:
 891                 cert = nrp->cert;
 892                 *nrp = *rp;
 893                 nrp->cert = cert;
 894                 *cert = *rp->cert;
 895                 cert->data = emalloc(cert->dlen);
 896                 memmove(cert->data, rp->cert->data, rp->cert->dlen);
 897                 break;
 898         case Tsig:
 899                 sig = nrp->sig;
 900                 *nrp = *rp;
 901                 nrp->sig = sig;
 902                 *sig = *rp->sig;
 903                 sig->data = emalloc(sig->dlen);
 904                 memmove(sig->data, rp->sig->data, rp->sig->dlen);
 905                 break;
 906         case Tnull:
 907                 null = nrp->null;
 908                 *nrp = *rp;
 909                 nrp->null = null;
 910                 *null = *rp->null;
 911                 null->data = emalloc(null->dlen);
 912                 memmove(null->data, rp->null->data, rp->null->dlen);
 913                 break;
 914         case Ttxt:
 915                 *nrp = *rp;
 916                 l = &nrp->txt;
 917                 *l = nil;
 918                 for(t = rp->txt; t != nil; t = t->next){
 919                         nt = emalloc(sizeof(*nt));
 920                         nt->p = estrdup(t->p);
 921                         nt->next = nil;
 922                         *l = nt;
 923                         l = &nt->next;
 924                 }
 925                 break;
 926         default:
 927                 *nrp = *rp;
 928                 break;
 929         }
 930         nrp->pc = getcallerpc(&rp);
 931         setmalloctag(nrp, nrp->pc);
 932         nrp->cached = 0;
 933         nrp->next = nil;
 934         *last = nrp;
 935         return &nrp->next;
 936 }
 937
 938 /*
 939  *  lookup a resource record of a particular type and
 940  *  class attached to a domain name.  Return copies.
 941  *
 942  *  Priority ordering is:
 943  *      db authoritative
 944  *      not timed out network authoritative
 945  *      not timed out network unauthoritative
 946  *      unauthoritative db
 947  *
 948  *  if flag NOneg is set, don't return negative cached entries.
 949  *  return nothing instead.
 950  */
 951 RR*
 952 rrlookup(DN *dp, int type, int flag)
 953 {
 954         RR *rp, *first, **last;
 955
 956         assert(dp->magic == DNmagic);
 957
 958         first = nil;
 959         last = &first;
 960         lock(&dnlock);
 961
 962         /* try for an authoritative db entry */
 963         for(rp = dp->rr; rp; rp = rp->next){
 964                 assert(rp->magic == RRmagic && rp->cached);
 965                 if(rp->db)
 966                 if(rp->auth)
 967                 if(tsame(type, rp->type))
 968                         last = rrcopy(rp, last);
 969         }
 970         if(first)
 971                 goto out;
 972
 973         /* try for a living authoritative network entry */
 974         for(rp = dp->rr; rp; rp = rp->next){
 975                 if(!rp->db)
 976                 if(rp->auth)
 977                 if(rp->ttl + 60 > now)
 978                 if(tsame(type, rp->type)){
 979                         if(flag == NOneg && rp->negative)
 980                                 goto out;
 981                         last = rrcopy(rp, last);
 982                 }
 983         }
 984         if(first)
 985                 goto out;
 986
 987         /* try for a living unauthoritative network entry */
 988         for(rp = dp->rr; rp; rp = rp->next){
 989                 if(!rp->db)
 990                 if(rp->ttl + 60 > now)
 991                 if(tsame(type, rp->type)){
 992                         if(flag == NOneg && rp->negative)
 993                                 goto out;
 994                         last = rrcopy(rp, last);
 995                 }
 996         }
 997         if(first)
 998                 goto out;
 999
1000         /* try for an unauthoritative db entry */
1001         for(rp = dp->rr; rp; rp = rp->next){
1002                 if(rp->db)
1003                 if(tsame(type, rp->type))
1004                         last = rrcopy(rp, last);
1005         }
1006         if(first)
1007                 goto out;
1008
1009         /* otherwise, settle for anything we got (except for negative caches) */
1010         for(rp = dp->rr; rp; rp = rp->next)
1011                 if(tsame(type, rp->type)){
1012                         if(rp->negative)
1013                                 goto out;
1014                         last = rrcopy(rp, last);
1015                 }
1016
1017 out:
1018         unlock(&dnlock);
1019         unique(first);
1020         return first;
1021 }
1022
1023 /*
1024  *  convert an ascii RR type name to its integer representation
1025  */
1026 int
1027 rrtype(char *atype)
1028 {
1029         int i;
1030
1031         for(i = 0; i <= Tall; i++)
1032                 if(rrtname[i] && strcmp(rrtname[i], atype) == 0)
1033                         return i;
1034
1035         /* make any a synonym for all */
1036         if(strcmp(atype, "any") == 0)
1037                 return Tall;
1038         else if(isascii(atype[0]) && isdigit(atype[0]))
1039                 return atoi(atype);
1040         else
1041                 return -1;
1042 }
1043
1044 /*
1045  *  return 0 if not a supported rr type
1046  */
1047 int
1048 rrsupported(int type)
1049 {
1050         if(type < 0 || type >Tall)
1051                 return 0;
1052         return rrtname[type] != nil;
1053 }
1054
1055 /*
1056  *  compare 2 types
1057  */
1058 int
1059 tsame(int t1, int t2)
1060 {
1061         return t1 == t2 || t1 == Tall;
1062 }
1063
1064 /*
1065  *  Add resource records to a list.
1066  */
1067 RR*
1068 rrcat(RR **start, RR *rp)
1069 {
1070         RR *olp, *nlp;
1071         RR **last;
1072
1073         /* check for duplicates */
1074         for (olp = *start; 0 && olp; olp = olp->next)
1075                 for (nlp = rp; nlp; nlp = nlp->next)
1076                         if (rrsame(nlp, olp))
1077                                 dnslog("rrcat: duplicate RR: %R", nlp);
1078         USED(olp);
1079
1080         last = start;
1081         while(*last != nil)
1082                 last = &(*last)->next;
1083
1084         *last = rp;
1085         return *start;
1086 }
1087
1088 /*
1089  *  remove negative cache rr's from an rr list
1090  */
1091 RR*
1092 rrremneg(RR **l)
1093 {
1094         RR **nl, *rp;
1095         RR *first;
1096
1097         first = nil;
1098         nl = &first;
1099         while(*l != nil){
1100                 rp = *l;
1101                 if(rp->negative){
1102                         *l = rp->next;
1103                         *nl = rp;
1104                         nl = &rp->next;
1105                         *nl = nil;
1106                 } else
1107                         l = &rp->next;
1108         }
1109
1110         return first;
1111 }
1112
1113 /*
1114  *  remove rr's of a particular type from an rr list
1115  */
1116 RR*
1117 rrremtype(RR **l, int type)
1118 {
1119         RR *first, *rp;
1120         RR **nl;
1121
1122         first = nil;
1123         nl = &first;
1124         while(*l != nil){
1125                 rp = *l;
1126                 if(rp->type == type){
1127                         *l = rp->next;
1128                         *nl = rp;
1129                         nl = &rp->next;
1130                         *nl = nil;
1131                 } else
1132                         l = &(*l)->next;
1133         }
1134
1135         return first;
1136 }
1137
1138 static char *
1139 dnname(DN *dn)
1140 {
1141         return dn? dn->name: "<null>";
1142 }
1143
1144 /*
1145  *  print conversion for rr records
1146  */
1147 int
1148 rrfmt(Fmt *f)
1149 {
1150         int rv;
1151         char *strp;
1152         char buf[Domlen];
1153         Fmt fstr;
1154         RR *rp;
1155         Server *s;
1156         SOA *soa;
1157         Srv *srv;
1158         Txt *t;
1159
1160         fmtstrinit(&fstr);
1161
1162         rp = va_arg(f->args, RR*);
1163         if(rp == nil){
1164                 fmtprint(&fstr, "<null>");
1165                 goto out;
1166         }
1167
1168         fmtprint(&fstr, "%s %s", dnname(rp->owner),
1169                 rrname(rp->type, buf, sizeof buf));
1170
1171         if(rp->negative){
1172                 fmtprint(&fstr, "\tnegative - rcode %d", rp->negrcode);
1173                 goto out;
1174         }
1175
1176         switch(rp->type){
1177         case Thinfo:
1178                 fmtprint(&fstr, "\t%s %s", dnname(rp->cpu), dnname(rp->os));
1179                 break;
1180         case Tcname:
1181         case Tmb:
1182         case Tmd:
1183         case Tmf:
1184         case Tns:
1185                 fmtprint(&fstr, "\t%s", dnname(rp->host));
1186                 break;
1187         case Tmg:
1188         case Tmr:
1189                 fmtprint(&fstr, "\t%s", dnname(rp->mb));
1190                 break;
1191         case Tminfo:
1192                 fmtprint(&fstr, "\t%s %s", dnname(rp->mb), dnname(rp->rmb));
1193                 break;
1194         case Tmx:
1195                 fmtprint(&fstr, "\t%lud %s", rp->pref, dnname(rp->host));
1196                 break;
1197         case Ta:
1198         case Taaaa:
1199                 fmtprint(&fstr, "\t%s", dnname(rp->ip));
1200                 break;
1201         case Tptr:
1202                 fmtprint(&fstr, "\t%s", dnname(rp->ptr));
1203                 break;
1204         case Tsoa:
1205                 soa = rp->soa;
1206                 fmtprint(&fstr, "\t%s %s %lud %lud %lud %lud %lud",
1207                         dnname(rp->host), dnname(rp->rmb),
1208                         (soa? soa->serial: 0),
1209                         (soa? soa->refresh: 0), (soa? soa->retry: 0),
1210                         (soa? soa->expire: 0), (soa? soa->minttl: 0));
1211                 if (soa)
1212                         for(s = soa->slaves; s != nil; s = s->next)
1213                                 fmtprint(&fstr, " %s", s->name);
1214                 break;
1215         case Tsrv:
1216                 srv = rp->srv;
1217                 fmtprint(&fstr, "\t%ud %ud %ud %s",
1218                         (srv? srv->pri: 0), (srv? srv->weight: 0),
1219                         rp->port, dnname(rp->host));
1220                 break;
1221         case Tnull:
1222                 if (rp->null == nil)
1223                         fmtprint(&fstr, "\t<null>");
1224                 else
1225                         fmtprint(&fstr, "\t%.*H", rp->null->dlen,
1226                                 rp->null->data);
1227                 break;
1228         case Ttxt:
1229                 fmtprint(&fstr, "\t");
1230                 for(t = rp->txt; t != nil; t = t->next)
1231                         fmtprint(&fstr, "%s", t->p);
1232                 break;
1233         case Trp:
1234                 fmtprint(&fstr, "\t%s %s", dnname(rp->rmb), dnname(rp->rp));
1235                 break;
1236         case Tkey:
1237                 if (rp->key == nil)
1238                         fmtprint(&fstr, "\t<null> <null> <null>");
1239                 else
1240                         fmtprint(&fstr, "\t%d %d %d", rp->key->flags,
1241                                 rp->key->proto, rp->key->alg);
1242                 break;
1243         case Tsig:
1244                 if (rp->sig == nil)
1245                         fmtprint(&fstr,
1246                    "\t<null> <null> <null> <null> <null> <null> <null> <null>");
1247                 else
1248                         fmtprint(&fstr, "\t%d %d %d %lud %lud %lud %d %s",
1249                                 rp->sig->type, rp->sig->alg, rp->sig->labels,
1250                                 rp->sig->ttl, rp->sig->exp, rp->sig->incep,
1251                                 rp->sig->tag, dnname(rp->sig->signer));
1252                 break;
1253         case Tcert:
1254                 if (rp->cert == nil)
1255                         fmtprint(&fstr, "\t<null> <null> <null>");
1256                 else
1257                         fmtprint(&fstr, "\t%d %d %d",
1258                                 rp->cert->type, rp->cert->tag, rp->cert->alg);
1259                 break;
1260         }
1261 out:
1262         strp = fmtstrflush(&fstr);
1263         rv = fmtstrcpy(f, strp);
1264         free(strp);
1265         return rv;
1266 }
1267
1268 /*
1269  *  print conversion for rr records in attribute value form
1270  */
1271 int
1272 rravfmt(Fmt *f)
1273 {
1274         int rv, quote;
1275         char *strp;
1276         Fmt fstr;
1277         RR *rp;
1278         Server *s;
1279         SOA *soa;
1280         Srv *srv;
1281         Txt *t;
1282
1283         fmtstrinit(&fstr);
1284
1285         rp = va_arg(f->args, RR*);
1286         if(rp == nil){
1287                 fmtprint(&fstr, "<null>");
1288                 goto out;
1289         }
1290
1291         if(rp->type == Tptr)
1292                 fmtprint(&fstr, "ptr=%s", dnname(rp->owner));
1293         else
1294                 fmtprint(&fstr, "dom=%s", dnname(rp->owner));
1295
1296         switch(rp->type){
1297         case Thinfo:
1298                 fmtprint(&fstr, " cpu=%s os=%s",
1299                         dnname(rp->cpu), dnname(rp->os));
1300                 break;
1301         case Tcname:
1302                 fmtprint(&fstr, " cname=%s", dnname(rp->host));
1303                 break;
1304         case Tmb:
1305         case Tmd:
1306         case Tmf:
1307                 fmtprint(&fstr, " mbox=%s", dnname(rp->host));
1308                 break;
1309         case Tns:
1310                 fmtprint(&fstr,  " ns=%s", dnname(rp->host));
1311                 break;
1312         case Tmg:
1313         case Tmr:
1314                 fmtprint(&fstr, " mbox=%s", dnname(rp->mb));
1315                 break;
1316         case Tminfo:
1317                 fmtprint(&fstr, " mbox=%s mbox=%s",
1318                         dnname(rp->mb), dnname(rp->rmb));
1319                 break;
1320         case Tmx:
1321                 fmtprint(&fstr, " pref=%lud mx=%s", rp->pref, dnname(rp->host));
1322                 break;
1323         case Ta:
1324         case Taaaa:
1325                 fmtprint(&fstr, " ip=%s", dnname(rp->ip));
1326                 break;
1327         case Tptr:
1328                 fmtprint(&fstr, " dom=%s", dnname(rp->ptr));
1329                 break;
1330         case Tsoa:
1331                 soa = rp->soa;
1332                 fmtprint(&fstr,
1333 " ns=%s mbox=%s serial=%lud refresh=%lud retry=%lud expire=%lud ttl=%lud",
1334                         dnname(rp->host), dnname(rp->rmb),
1335                         (soa? soa->serial: 0),
1336                         (soa? soa->refresh: 0), (soa? soa->retry: 0),
1337                         (soa? soa->expire: 0), (soa? soa->minttl: 0));
1338                 for(s = soa->slaves; s != nil; s = s->next)
1339                         fmtprint(&fstr, " dnsslave=%s", s->name);
1340                 break;
1341         case Tsrv:
1342                 srv = rp->srv;
1343                 fmtprint(&fstr, " pri=%ud weight=%ud port=%ud target=%s",
1344                         (srv? srv->pri: 0), (srv? srv->weight: 0),
1345                         rp->port, dnname(rp->host));
1346                 break;
1347         case Tnull:
1348                 if (rp->null == nil)
1349                         fmtprint(&fstr, " null=<null>");
1350                 else
1351                         fmtprint(&fstr, " null=%.*H", rp->null->dlen,
1352                                 rp->null->data);
1353                 break;
1354         case Ttxt:
1355                 fmtprint(&fstr, " txt=");
1356                 quote = 0;
1357                 for(t = rp->txt; t != nil; t = t->next)
1358                         if(strchr(t->p, ' '))
1359                                 quote = 1;
1360                 if(quote)
1361                         fmtprint(&fstr, "\"");
1362                 for(t = rp->txt; t != nil; t = t->next)
1363                         fmtprint(&fstr, "%s", t->p);
1364                 if(quote)
1365                         fmtprint(&fstr, "\"");
1366                 break;
1367         case Trp:
1368                 fmtprint(&fstr, " rp=%s txt=%s",
1369                         dnname(rp->rmb), dnname(rp->rp));
1370                 break;
1371         case Tkey:
1372                 if (rp->key == nil)
1373                         fmtprint(&fstr, " flags=<null> proto=<null> alg=<null>");
1374                 else
1375                         fmtprint(&fstr, " flags=%d proto=%d alg=%d",
1376                                 rp->key->flags, rp->key->proto, rp->key->alg);
1377                 break;
1378         case Tsig:
1379                 if (rp->sig == nil)
1380                         fmtprint(&fstr,
1381 " type=<null> alg=<null> labels=<null> ttl=<null> exp=<null> incep=<null> tag=<null> signer=<null>");
1382                 else
1383                         fmtprint(&fstr,
1384 " type=%d alg=%d labels=%d ttl=%lud exp=%lud incep=%lud tag=%d signer=%s",
1385                                 rp->sig->type, rp->sig->alg, rp->sig->labels,
1386                                 rp->sig->ttl, rp->sig->exp, rp->sig->incep,
1387                                 rp->sig->tag, dnname(rp->sig->signer));
1388                 break;
1389         case Tcert:
1390                 if (rp->cert == nil)
1391                         fmtprint(&fstr, " type=<null> tag=<null> alg=<null>");
1392                 else
1393                         fmtprint(&fstr, " type=%d tag=%d alg=%d",
1394                                 rp->cert->type, rp->cert->tag, rp->cert->alg);
1395                 break;
1396         }
1397 out:
1398         strp = fmtstrflush(&fstr);
1399         rv = fmtstrcpy(f, strp);
1400         free(strp);
1401         return rv;
1402 }
1403
1404 void
1405 warning(char *fmt, ...)
1406 {
1407         char dnserr[256];
1408         va_list arg;
1409
1410         va_start(arg, fmt);
1411         vseprint(dnserr, dnserr+sizeof(dnserr), fmt, arg);
1412         va_end(arg);
1413         syslog(1, logfile, dnserr);             /* on console too */
1414 }
1415
1416 void
1417 dnslog(char *fmt, ...)
1418 {
1419         char dnserr[256];
1420         va_list arg;
1421
1422         va_start(arg, fmt);
1423         vseprint(dnserr, dnserr+sizeof(dnserr), fmt, arg);
1424         va_end(arg);
1425         syslog(0, logfile, dnserr);
1426 }
1427
1428 /*
1429  * based on libthread's threadsetname, but drags in less library code.
1430  * actually just sets the arguments displayed.
1431  */
1432 void
1433 procsetname(char *fmt, ...)
1434 {
1435         int fd;
1436         char *cmdname;
1437         char buf[128];
1438         va_list arg;
1439
1440         va_start(arg, fmt);
1441         cmdname = vsmprint(fmt, arg);
1442         va_end(arg);
1443         if (cmdname == nil)
1444                 return;
1445         snprint(buf, sizeof buf, "#p/%d/args", getpid());
1446         if((fd = open(buf, OWRITE)) >= 0){
1447                 write(fd, cmdname, strlen(cmdname)+1);
1448                 close(fd);
1449         }
1450         free(cmdname);
1451 }
1452
1453 /*
1454  *  create a slave process to handle a request to avoid one request blocking
1455  *  another
1456  */
1457 void
1458 slave(Request *req)
1459 {
1460         int ppid, procs;
1461
1462         if(req->isslave)
1463                 return;         /* we're already a slave process */
1464
1465         /*
1466          * These calls to putactivity cannot block.
1467          * After getactivity(), the current process is counted
1468          * twice in dnvars.active (one will pass to the child).
1469          * If putactivity tries to wait for dnvars.active == 0,
1470          * it will never happen.
1471          */
1472
1473         /* limit parallelism */
1474         procs = getactivity(req, 1);
1475         if(procs > stats.slavehiwat)
1476                 stats.slavehiwat = procs;
1477         if(procs > Maxactive){
1478                 if(traceactivity)
1479                         dnslog("[%d] too much activity", getpid());
1480                 putactivity(1);
1481                 return;
1482         }
1483
1484         /*
1485          * parent returns to main loop, child does the work.
1486          * don't change note group.
1487          */
1488         ppid = getpid();
1489         switch(rfork(RFPROC|RFMEM|RFNOWAIT)){
1490         case -1:
1491                 putactivity(1);
1492                 break;
1493         case 0:
1494                 procsetname("request slave of pid %d", ppid);
1495                 if(traceactivity)
1496                         dnslog("[%d] take activity from %d", getpid(), ppid);
1497                 req->isslave = 1;       /* why not `= getpid()'? */
1498                 break;
1499         default:
1500                 /*
1501                  * this relies on rfork producing separate, initially-identical
1502                  * stacks, thus giving us two copies of `req', one in each
1503                  * process.
1504                  */
1505                 alarm(0);
1506                 longjmp(req->mret, 1);
1507         }
1508 }
1509
1510 /*
1511  *  chasing down double free's
1512  */
1513 void
1514 dncheck(void)
1515 {
1516         int i;
1517         DN *dp;
1518         RR *rp;
1519
1520         if(!testing)
1521                 return;
1522
1523         lock(&dnlock);
1524         poolcheck(mainmem);
1525         for(i = 0; i < HTLEN; i++)
1526                 for(dp = ht[i]; dp; dp = dp->next){
1527                         assert(dp->magic == DNmagic);
1528                         for(rp = dp->rr; rp; rp = rp->next){
1529                                 assert(rp->magic == RRmagic);
1530                                 assert(rp->cached);
1531                                 assert(rp->owner == dp);
1532                                 /* also check for duplicate rrs */
1533                                 if (rronlist(rp, rp->next)) {
1534                                         dnslog("%R duplicates its next chain "
1535                                                 "(%R); aborting", rp, rp->next);
1536                                         abort();
1537                                 }
1538                         }
1539                 }
1540         unlock(&dnlock);
1541 }
1542
1543 static int
1544 rrequiv(RR *r1, RR *r2)
1545 {
1546         return r1->owner == r2->owner
1547                 && r1->type == r2->type
1548                 && r1->arg0 == r2->arg0
1549                 && r1->arg1 == r2->arg1;
1550 }
1551
1552 void
1553 unique(RR *rp)
1554 {
1555         RR **l, *nrp;
1556
1557         for(; rp; rp = rp->next){
1558                 l = &rp->next;
1559                 for(nrp = *l; nrp; nrp = *l)
1560                         if(rrequiv(rp, nrp)){
1561                                 *l = nrp->next;
1562                                 rrfree(nrp);
1563                         } else
1564                                 l = &nrp->next;
1565         }
1566 }
1567
1568 /*
1569  *  true if second domain is subsumed by the first
1570  */
1571 int
1572 subsume(char *higher, char *lower)
1573 {
1574         int hn, ln;
1575
1576         ln = strlen(lower);
1577         hn = strlen(higher);
1578         if (ln < hn || cistrcmp(lower + ln - hn, higher) != 0 ||
1579             ln > hn && hn != 0 && lower[ln - hn - 1] != '.')
1580                 return 0;
1581         return 1;
1582 }
1583
1584 /*
1585  *  randomize the order we return items to provide some
1586  *  load balancing for servers.
1587  *
1588  *  only randomize the first class of entries
1589  */
1590 RR*
1591 randomize(RR *rp)
1592 {
1593         RR *first, *last, *x, *base;
1594         ulong n;
1595
1596         if(rp == nil || rp->next == nil)
1597                 return rp;
1598
1599         /* just randomize addresses, mx's and ns's */
1600         for(x = rp; x; x = x->next)
1601                 if(x->type != Ta && x->type != Taaaa &&
1602                     x->type != Tmx && x->type != Tns)
1603                         return rp;
1604
1605         base = rp;
1606
1607         n = rand();
1608         last = first = nil;
1609         while(rp != nil){
1610                 /* stop randomizing if we've moved past our class */
1611                 if(base->auth != rp->auth || base->db != rp->db){
1612                         last->next = rp;
1613                         break;
1614                 }
1615
1616                 /* unchain */
1617                 x = rp;
1618                 rp = x->next;
1619                 x->next = nil;
1620
1621                 if(n&1){
1622                         /* add to tail */
1623                         if(last == nil)
1624                                 first = x;
1625                         else
1626                                 last->next = x;
1627                         last = x;
1628                 } else {
1629                         /* add to head */
1630                         if(last == nil)
1631                                 last = x;
1632                         x->next = first;
1633                         first = x;
1634                 }
1635
1636                 /* reroll the dice */
1637                 n >>= 1;
1638         }
1639
1640         return first;
1641 }
1642
1643 static int
1644 sencodefmt(Fmt *f)
1645 {
1646         int i, len, ilen, rv;
1647         char *out, *buf;
1648         uchar *b;
1649         char obuf[64];          /* rsc optimization */
1650
1651         if(!(f->flags&FmtPrec) || f->prec < 1)
1652                 goto error;
1653
1654         b = va_arg(f->args, uchar*);
1655         if(b == nil)
1656                 goto error;
1657
1658         /* if it's a printable, go for it */
1659         len = f->prec;
1660         for(i = 0; i < len; i++)
1661                 if(!isprint(b[i]))
1662                         break;
1663         if(i == len){
1664                 if(len >= sizeof obuf)
1665                         len = sizeof(obuf)-1;
1666                 memmove(obuf, b, len);
1667                 obuf[len] = 0;
1668                 fmtstrcpy(f, obuf);
1669                 return 0;
1670         }
1671
1672         ilen = f->prec;
1673         f->prec = 0;
1674         f->flags &= ~FmtPrec;
1675         switch(f->r){
1676         case '<':
1677                 len = (8*ilen+4)/5 + 3;
1678                 break;
1679         case '[':
1680                 len = (8*ilen+5)/6 + 4;
1681                 break;
1682         case 'H':
1683                 len = 2*ilen + 1;
1684                 break;
1685         default:
1686                 goto error;
1687         }
1688
1689         if(len > sizeof(obuf)){
1690                 buf = malloc(len);
1691                 if(buf == nil)
1692                         goto error;
1693         } else
1694                 buf = obuf;
1695
1696         /* convert */
1697         out = buf;
1698         switch(f->r){
1699         case '<':
1700                 rv = enc32(out, len, b, ilen);
1701                 break;
1702         case '[':
1703                 rv = enc64(out, len, b, ilen);
1704                 break;
1705         case 'H':
1706                 rv = enc16(out, len, b, ilen);
1707                 break;
1708         default:
1709                 rv = -1;
1710                 break;
1711         }
1712         if(rv < 0)
1713                 goto error;
1714
1715         fmtstrcpy(f, buf);
1716         if(buf != obuf)
1717                 free(buf);
1718         return 0;
1719
1720 error:
1721         return fmtstrcpy(f, "<encodefmt>");
1722 }
1723
1724 void*
1725 emalloc(int size)
1726 {
1727         char *x;
1728
1729         x = mallocz(size, 1);
1730         if(x == nil)
1731                 abort();
1732         setmalloctag(x, getcallerpc(&size));
1733         return x;
1734 }
1735
1736 char*
1737 estrdup(char *s)
1738 {
1739         int size;
1740         char *p;
1741
1742         size = strlen(s);
1743         p = mallocz(size+1, 0);
1744         if(p == nil)
1745                 abort();
1746         memmove(p, s, size);
1747         p[size] = 0;
1748         setmalloctag(p, getcallerpc(&s));
1749         return p;
1750 }
1751
1752 /*
1753  *  create a pointer record
1754  */
1755 static RR*
1756 mkptr(DN *dp, char *ptr, ulong ttl)
1757 {
1758         DN *ipdp;
1759         RR *rp;
1760
1761         ipdp = dnlookup(ptr, Cin, 1);
1762
1763         rp = rralloc(Tptr);
1764         rp->ptr = dp;
1765         rp->owner = ipdp;
1766         rp->db = 1;
1767         if(ttl)
1768                 rp->ttl = ttl;
1769         return rp;
1770 }
1771
1772 void    bytes2nibbles(uchar *nibbles, uchar *bytes, int nbytes);
1773
1774 /*
1775  *  look for all ip addresses in this network and make
1776  *  pointer records for them.
1777  */
1778 void
1779 dnptr(uchar *net, uchar *mask, char *dom, int forwtype, int subdoms, int ttl)
1780 {
1781         int i, j, len;
1782         char *p, *e;
1783         char ptr[Domlen];
1784         uchar *ipp;
1785         uchar ip[IPaddrlen], nnet[IPaddrlen];
1786         uchar nibip[IPaddrlen*2];
1787         DN *dp;
1788         RR *rp, *nrp, *first, **l;
1789
1790         l = &first;
1791         first = nil;
1792         for(i = 0; i < HTLEN; i++)
1793                 for(dp = ht[i]; dp; dp = dp->next)
1794                         for(rp = dp->rr; rp; rp = rp->next){
1795                                 if(rp->type != forwtype || rp->negative)
1796                                         continue;
1797                                 parseip(ip, rp->ip->name);
1798                                 maskip(ip, mask, nnet);
1799                                 if(ipcmp(net, nnet) != 0)
1800                                         continue;
1801
1802                                 ipp = ip;
1803                                 len = IPaddrlen;
1804                                 if (forwtype == Taaaa) {
1805                                         bytes2nibbles(nibip, ip, IPaddrlen);
1806                                         ipp = nibip;
1807                                         len = 2*IPaddrlen;
1808                                 }
1809
1810                                 p = ptr;
1811                                 e = ptr+sizeof(ptr);
1812                                 for(j = len - 1; j >= len - subdoms; j--)
1813                                         p = seprint(p, e, (forwtype == Ta?
1814                                                 "%d.": "%x."), ipp[j]);
1815                                 seprint(p, e, "%s", dom);
1816
1817                                 nrp = mkptr(dp, ptr, ttl);
1818                                 *l = nrp;
1819                                 l = &nrp->next;
1820                         }
1821
1822         for(rp = first; rp != nil; rp = nrp){
1823                 nrp = rp->next;
1824                 rp->next = nil;
1825                 rrattach(rp, Authoritative);
1826         }
1827 }
1828
1829 void
1830 addserver(Server **l, char *name)
1831 {
1832         Server *s;
1833         int n;
1834
1835         while(*l)
1836                 l = &(*l)->next;
1837         n = strlen(name);
1838         s = malloc(sizeof(Server)+n+1);
1839         if(s == nil)
1840                 return;
1841         s->name = (char*)(s+1);
1842         memmove(s->name, name, n);
1843         s->name[n] = 0;
1844         s->next = nil;
1845         *l = s;
1846 }
1847
1848 Server*
1849 copyserverlist(Server *s)
1850 {
1851         Server *ns;
1852
1853         for(ns = nil; s != nil; s = s->next)
1854                 addserver(&ns, s->name);
1855         return ns;
1856 }
1857
1858
1859 /* from here down is copied to ip/snoopy/dns.c periodically to update it */
1860
1861 /*
1862  *  convert an integer RR type to it's ascii name
1863  */
1864 char*
1865 rrname(int type, char *buf, int len)
1866 {
1867         char *t;
1868
1869         t = nil;
1870         if(type >= 0 && type <= Tall)
1871                 t = rrtname[type];
1872         if(t==nil){
1873                 snprint(buf, len, "%d", type);
1874                 t = buf;
1875         }
1876         return t;
1877 }
1878
1879 /*
1880  *  free a list of resource records and any related structs
1881  */
1882 void
1883 rrfreelist(RR *rp)
1884 {
1885         RR *next;
1886
1887         for(; rp; rp = next){
1888                 next = rp->next;
1889                 rrfree(rp);
1890         }
1891 }
1892
1893 void
1894 freeserverlist(Server *s)
1895 {
1896         Server *next;
1897
1898         for(; s != nil; s = next){
1899                 next = s->next;
1900                 memset(s, 0, sizeof *s);        /* cause trouble */
1901                 free(s);
1902         }
1903 }
1904
1905 /*
1906  *  allocate a resource record of a given type
1907  */
1908 RR*
1909 rralloc(int type)
1910 {
1911         RR *rp;
1912
1913         rp = emalloc(sizeof(*rp));
1914         rp->magic = RRmagic;
1915         rp->pc = getcallerpc(&type);
1916         rp->type = type;
1917         if (rp->type != type)
1918                 dnslog("rralloc: bogus type %d", type);
1919         setmalloctag(rp, rp->pc);
1920         switch(type){
1921         case Tsoa:
1922                 rp->soa = emalloc(sizeof(*rp->soa));
1923                 rp->soa->slaves = nil;
1924                 setmalloctag(rp->soa, rp->pc);
1925                 break;
1926         case Tsrv:
1927                 rp->srv = emalloc(sizeof(*rp->srv));
1928                 setmalloctag(rp->srv, rp->pc);
1929                 break;
1930         case Tkey:
1931                 rp->key = emalloc(sizeof(*rp->key));
1932                 setmalloctag(rp->key, rp->pc);
1933                 break;
1934         case Tcert:
1935                 rp->cert = emalloc(sizeof(*rp->cert));
1936                 setmalloctag(rp->cert, rp->pc);
1937                 break;
1938         case Tsig:
1939                 rp->sig = emalloc(sizeof(*rp->sig));
1940                 setmalloctag(rp->sig, rp->pc);
1941                 break;
1942         case Tnull:
1943                 rp->null = emalloc(sizeof(*rp->null));
1944                 setmalloctag(rp->null, rp->pc);
1945                 break;
1946         }
1947         rp->ttl = 0;
1948         rp->expire = 0;
1949         rp->next = 0;
1950         return rp;
1951 }
1952
1953 /*
1954  *  free a resource record and any related structs
1955  */
1956 void
1957 rrfree(RR *rp)
1958 {
1959         Txt *t;
1960
1961         assert(rp->magic == RRmagic && !rp->cached);
1962
1963         switch(rp->type){
1964         case Tsoa:
1965                 freeserverlist(rp->soa->slaves);
1966                 memset(rp->soa, 0, sizeof *rp->soa);    /* cause trouble */
1967                 free(rp->soa);
1968                 break;
1969         case Tsrv:
1970                 memset(rp->srv, 0, sizeof *rp->srv);    /* cause trouble */
1971                 free(rp->srv);
1972                 break;
1973         case Tkey:
1974                 free(rp->key->data);
1975                 memset(rp->key, 0, sizeof *rp->key);    /* cause trouble */
1976                 free(rp->key);
1977                 break;
1978         case Tcert:
1979                 free(rp->cert->data);
1980                 memset(rp->cert, 0, sizeof *rp->cert);  /* cause trouble */
1981                 free(rp->cert);
1982                 break;
1983         case Tsig:
1984                 free(rp->sig->data);
1985                 memset(rp->sig, 0, sizeof *rp->sig);    /* cause trouble */
1986                 free(rp->sig);
1987                 break;
1988         case Tnull:
1989                 free(rp->null->data);
1990                 memset(rp->null, 0, sizeof *rp->null);  /* cause trouble */
1991                 free(rp->null);
1992                 break;
1993         case Ttxt:
1994                 while(t = rp->txt){
1995                         rp->txt = t->next;
1996                         free(t->p);
1997                         memset(t, 0, sizeof *t);        /* cause trouble */
1998                         free(t);
1999                 }
2000                 break;
2001         }
2002
2003         memset(rp, 0, sizeof *rp);              /* cause trouble */
2004         rp->magic = ~RRmagic;
2005         free(rp);
2006 }