2 * services/localzone.c - local zones authority service.
4 * Copyright (c) 2007, NLnet Labs. All rights reserved.
6 * This software is open source.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * Redistributions of source code must retain the above copyright notice,
13 * this list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 * this list of conditions and the following disclaimer in the documentation
17 * and/or other materials provided with the distribution.
19 * Neither the name of the NLNET LABS nor the names of its contributors may
20 * be used to endorse or promote products derived from this software without
21 * specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
26 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
27 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
28 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
29 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
30 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
31 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
32 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
33 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39 * This file contains functions to enable local zone authority service.
42 #include "services/localzone.h"
43 #include "sldns/str2wire.h"
44 #include "sldns/sbuffer.h"
45 #include "util/regional.h"
46 #include "util/config_file.h"
47 #include "util/data/dname.h"
48 #include "util/data/packed_rrset.h"
49 #include "util/data/msgencode.h"
50 #include "util/net_help.h"
51 #include "util/netevent.h"
52 #include "util/data/msgreply.h"
53 #include "util/data/msgparse.h"
54 #include "util/as112.h"
55 #include "util/config_file.h"
57 /* maximum RRs in an RRset, to cap possible 'endless' list RRs.
58 * with 16 bytes for an A record, a 64K packet has about 4000 max */
59 #define LOCALZONE_RRSET_COUNT_MAX 4096
62 local_zones_create(void)
64 struct local_zones* zones = (struct local_zones*)calloc(1,
68 rbtree_init(&zones->ztree, &local_zone_cmp);
69 lock_rw_init(&zones->lock);
70 lock_protect(&zones->lock, &zones->ztree, sizeof(zones->ztree));
71 /* also lock protects the rbnode's in struct local_zone */
75 /** helper traverse to delete zones */
77 lzdel(rbnode_t* n, void* ATTR_UNUSED(arg))
79 struct local_zone* z = (struct local_zone*)n->key;
84 local_zones_delete(struct local_zones* zones)
88 lock_rw_destroy(&zones->lock);
89 /* walk through zones and delete them all */
90 traverse_postorder(&zones->ztree, lzdel, NULL);
95 local_zone_delete(struct local_zone* z)
99 lock_rw_destroy(&z->lock);
100 regional_destroy(z->region);
107 local_zone_cmp(const void* z1, const void* z2)
109 /* first sort on class, so that hierarchy can be maintained within
111 struct local_zone* a = (struct local_zone*)z1;
112 struct local_zone* b = (struct local_zone*)z2;
114 if(a->dclass != b->dclass) {
115 if(a->dclass < b->dclass)
119 return dname_lab_cmp(a->name, a->namelabs, b->name, b->namelabs, &m);
123 local_data_cmp(const void* d1, const void* d2)
125 struct local_data* a = (struct local_data*)d1;
126 struct local_data* b = (struct local_data*)d2;
128 return dname_canon_lab_cmp(a->name, a->namelabs, b->name,
132 /* form wireformat from text format domain name */
134 parse_dname(const char* str, uint8_t** res, size_t* len, int* labs)
136 *res = sldns_str2wire_dname(str, len);
139 log_err("cannot parse name %s", str);
142 *labs = dname_count_size_labels(*res, len);
146 /** create a new localzone */
147 static struct local_zone*
148 local_zone_create(uint8_t* nm, size_t len, int labs,
149 enum localzone_type t, uint16_t dclass)
151 struct local_zone* z = (struct local_zone*)calloc(1, sizeof(*z));
161 lock_rw_init(&z->lock);
162 z->region = regional_create_custom(sizeof(struct regional));
167 rbtree_init(&z->data, &local_data_cmp);
168 lock_protect(&z->lock, &z->parent, sizeof(*z)-sizeof(rbnode_t));
169 /* also the zones->lock protects node, parent, name*, class */
173 /** enter a new zone with allocated dname returns with WRlock */
174 static struct local_zone*
175 lz_enter_zone_dname(struct local_zones* zones, uint8_t* nm, size_t len,
176 int labs, enum localzone_type t, uint16_t c)
178 struct local_zone* z = local_zone_create(nm, len, labs, t, c);
181 log_err("out of memory");
186 lock_rw_wrlock(&zones->lock);
187 lock_rw_wrlock(&z->lock);
188 if(!rbtree_insert(&zones->ztree, &z->node)) {
189 struct local_zone* oldz;
190 log_warn("duplicate local-zone");
191 lock_rw_unlock(&z->lock);
192 /* save zone name locally before deallocation,
193 * otherwise, nm is gone if we zone_delete now. */
195 /* find the correct zone, so not an error for duplicate */
196 z = local_zones_find(zones, nm, len, labs, c);
197 lock_rw_wrlock(&z->lock);
198 lock_rw_unlock(&zones->lock);
199 local_zone_delete(oldz);
202 lock_rw_unlock(&zones->lock);
206 /** enter a new zone */
207 static struct local_zone*
208 lz_enter_zone(struct local_zones* zones, const char* name, const char* type,
211 struct local_zone* z;
212 enum localzone_type t;
216 if(!parse_dname(name, &nm, &len, &labs)) {
217 log_err("bad zone name %s %s", name, type);
220 if(!local_zone_str2type(type, &t)) {
221 log_err("bad lz_enter_zone type %s %s", name, type);
225 if(!(z=lz_enter_zone_dname(zones, nm, len, labs, t, dclass))) {
226 log_err("could not enter zone %s %s", name, type);
232 /** return name and class and rdata of rr; parses string */
234 get_rr_content(const char* str, uint8_t** nm, uint16_t* type,
235 uint16_t* dclass, time_t* ttl, uint8_t* rr, size_t len,
236 uint8_t** rdata, size_t* rdata_len)
238 size_t dname_len = 0;
239 int e = sldns_str2wire_rr_buf(str, rr, &len, &dname_len, 3600,
242 log_err("error parsing local-data at %d: '%s': %s",
243 LDNS_WIREPARSE_OFFSET(e), str,
244 sldns_get_errorstr_parse(e));
247 *nm = memdup(rr, dname_len);
249 log_err("out of memory");
252 *dclass = sldns_wirerr_get_class(rr, len, dname_len);
253 *type = sldns_wirerr_get_type(rr, len, dname_len);
254 *ttl = (time_t)sldns_wirerr_get_ttl(rr, len, dname_len);
255 *rdata = sldns_wirerr_get_rdatawl(rr, len, dname_len);
256 *rdata_len = sldns_wirerr_get_rdatalen(rr, len, dname_len)+2;
260 /** return name and class of rr; parses string */
262 get_rr_nameclass(const char* str, uint8_t** nm, uint16_t* dclass)
264 uint8_t rr[LDNS_RR_BUF_SIZE];
265 size_t len = sizeof(rr), dname_len = 0;
266 int s = sldns_str2wire_rr_buf(str, rr, &len, &dname_len, 3600,
269 log_err("error parsing local-data at %d '%s': %s",
270 LDNS_WIREPARSE_OFFSET(s), str,
271 sldns_get_errorstr_parse(s));
274 *nm = memdup(rr, dname_len);
275 *dclass = sldns_wirerr_get_class(rr, len, dname_len);
277 log_err("out of memory");
284 * Find an rrset in local data structure.
285 * @param data: local data domain name structure.
286 * @param type: type to look for (host order).
287 * @param alias_ok: 1 if matching a non-exact, alias type such as CNAME is
288 * allowed. otherwise 0.
289 * @return rrset pointer or NULL if not found.
291 static struct local_rrset*
292 local_data_find_type(struct local_data* data, uint16_t type, int alias_ok)
294 struct local_rrset* p;
296 for(p = data->rrsets; p; p = p->next) {
297 if(p->rrset->rk.type == type)
299 if(alias_ok && p->rrset->rk.type == htons(LDNS_RR_TYPE_CNAME))
305 /** check for RR duplicates */
307 rr_is_duplicate(struct packed_rrset_data* pd, uint8_t* rdata, size_t rdata_len)
310 for(i=0; i<pd->count; i++) {
311 if(pd->rr_len[i] == rdata_len &&
312 memcmp(pd->rr_data[i], rdata, rdata_len) == 0)
318 /** new local_rrset */
319 static struct local_rrset*
320 new_local_rrset(struct regional* region, struct local_data* node,
321 uint16_t rrtype, uint16_t rrclass)
323 struct packed_rrset_data* pd;
324 struct local_rrset* rrset = (struct local_rrset*)
325 regional_alloc_zero(region, sizeof(*rrset));
327 log_err("out of memory");
330 rrset->next = node->rrsets;
331 node->rrsets = rrset;
332 rrset->rrset = (struct ub_packed_rrset_key*)
333 regional_alloc_zero(region, sizeof(*rrset->rrset));
335 log_err("out of memory");
338 rrset->rrset->entry.key = rrset->rrset;
339 pd = (struct packed_rrset_data*)regional_alloc_zero(region,
342 log_err("out of memory");
345 pd->trust = rrset_trust_prim_noglue;
346 pd->security = sec_status_insecure;
347 rrset->rrset->entry.data = pd;
348 rrset->rrset->rk.dname = node->name;
349 rrset->rrset->rk.dname_len = node->namelen;
350 rrset->rrset->rk.type = htons(rrtype);
351 rrset->rrset->rk.rrset_class = htons(rrclass);
355 /** insert RR into RRset data structure; Wastes a couple of bytes */
357 insert_rr(struct regional* region, struct packed_rrset_data* pd,
358 uint8_t* rdata, size_t rdata_len, time_t ttl, const char* rrstr)
360 size_t* oldlen = pd->rr_len;
361 time_t* oldttl = pd->rr_ttl;
362 uint8_t** olddata = pd->rr_data;
364 /* add RR to rrset */
365 if(pd->count > LOCALZONE_RRSET_COUNT_MAX) {
366 log_warn("RRset '%s' has more than %d records, record ignored",
367 rrstr, LOCALZONE_RRSET_COUNT_MAX);
371 pd->rr_len = regional_alloc(region, sizeof(*pd->rr_len)*pd->count);
372 pd->rr_ttl = regional_alloc(region, sizeof(*pd->rr_ttl)*pd->count);
373 pd->rr_data = regional_alloc(region, sizeof(*pd->rr_data)*pd->count);
374 if(!pd->rr_len || !pd->rr_ttl || !pd->rr_data) {
375 log_err("out of memory");
379 memcpy(pd->rr_len+1, oldlen,
380 sizeof(*pd->rr_len)*(pd->count-1));
381 memcpy(pd->rr_ttl+1, oldttl,
382 sizeof(*pd->rr_ttl)*(pd->count-1));
383 memcpy(pd->rr_data+1, olddata,
384 sizeof(*pd->rr_data)*(pd->count-1));
386 pd->rr_len[0] = rdata_len;
388 pd->rr_data[0] = regional_alloc_init(region, rdata, rdata_len);
389 if(!pd->rr_data[0]) {
390 log_err("out of memory");
396 /** find a data node by exact name */
397 static struct local_data*
398 lz_find_node(struct local_zone* z, uint8_t* nm, size_t nmlen, int nmlabs)
400 struct local_data key;
404 key.namelabs = nmlabs;
405 return (struct local_data*)rbtree_search(&z->data, &key.node);
408 /** find a node, create it if not and all its empty nonterminal parents */
410 lz_find_create_node(struct local_zone* z, uint8_t* nm, size_t nmlen,
411 int nmlabs, struct local_data** res)
413 struct local_data* ld = lz_find_node(z, nm, nmlen, nmlabs);
415 /* create a domain name to store rr. */
416 ld = (struct local_data*)regional_alloc_zero(z->region,
419 log_err("out of memory adding local data");
423 ld->name = regional_alloc_init(z->region, nm, nmlen);
425 log_err("out of memory");
429 ld->namelabs = nmlabs;
430 if(!rbtree_insert(&z->data, &ld->node)) {
431 log_assert(0); /* duplicate name */
433 /* see if empty nonterminals need to be created */
434 if(nmlabs > z->namelabs) {
435 dname_remove_label(&nm, &nmlen);
436 if(!lz_find_create_node(z, nm, nmlen, nmlabs-1, res))
444 /** enter data RR into auth zone */
446 lz_enter_rr_into_zone(struct local_zone* z, const char* rrstr)
451 struct local_data* node;
452 struct local_rrset* rrset;
453 struct packed_rrset_data* pd;
454 uint16_t rrtype = 0, rrclass = 0;
456 uint8_t rr[LDNS_RR_BUF_SIZE];
459 if(!get_rr_content(rrstr, &nm, &rrtype, &rrclass, &ttl, rr, sizeof(rr),
460 &rdata, &rdata_len)) {
461 log_err("bad local-data: %s", rrstr);
464 log_assert(z->dclass == rrclass);
465 if(z->type == local_zone_redirect &&
466 query_dname_compare(z->name, nm) != 0) {
467 log_err("local-data in redirect zone must reside at top of zone"
468 ", not at %s", rrstr);
472 nmlabs = dname_count_size_labels(nm, &nmlen);
473 if(!lz_find_create_node(z, nm, nmlen, nmlabs, &node)) {
480 /* Reject it if we would end up having CNAME and other data (including
481 * another CNAME) for a redirect zone. */
482 if(z->type == local_zone_redirect && node->rrsets) {
483 const char* othertype = NULL;
484 if (rrtype == LDNS_RR_TYPE_CNAME)
486 else if (node->rrsets->rrset->rk.type ==
487 htons(LDNS_RR_TYPE_CNAME)) {
491 log_err("local-data '%s' in redirect zone must not "
492 "coexist with %s local-data", rrstr, othertype);
496 rrset = local_data_find_type(node, rrtype, 0);
498 rrset = new_local_rrset(z->region, node, rrtype, rrclass);
501 if(query_dname_compare(node->name, z->name) == 0) {
502 if(rrtype == LDNS_RR_TYPE_NSEC)
503 rrset->rrset->rk.flags = PACKED_RRSET_NSEC_AT_APEX;
504 if(rrtype == LDNS_RR_TYPE_SOA)
505 z->soa = rrset->rrset;
508 pd = (struct packed_rrset_data*)rrset->rrset->entry.data;
509 log_assert(rrset && pd);
511 /* check for duplicate RR */
512 if(rr_is_duplicate(pd, rdata, rdata_len)) {
513 verbose(VERB_ALGO, "ignoring duplicate RR: %s", rrstr);
516 return insert_rr(z->region, pd, rdata, rdata_len, ttl, rrstr);
519 /** enter a data RR into auth data; a zone for it must exist */
521 lz_enter_rr_str(struct local_zones* zones, const char* rr)
527 struct local_zone* z;
529 if(!get_rr_nameclass(rr, &rr_name, &rr_class)) {
530 log_err("bad rr %s", rr);
533 labs = dname_count_size_labels(rr_name, &len);
534 lock_rw_rdlock(&zones->lock);
535 z = local_zones_lookup(zones, rr_name, len, labs, rr_class);
537 lock_rw_unlock(&zones->lock);
538 fatal_exit("internal error: no zone for rr %s", rr);
540 lock_rw_wrlock(&z->lock);
541 lock_rw_unlock(&zones->lock);
543 r = lz_enter_rr_into_zone(z, rr);
544 lock_rw_unlock(&z->lock);
548 /** enter tagstring into zone */
550 lz_enter_zone_tag(struct local_zones* zones, char* zname, uint8_t* list,
551 size_t len, uint16_t rr_class)
553 uint8_t dname[LDNS_MAX_DOMAINLEN+1];
554 size_t dname_len = sizeof(dname);
555 int dname_labs, r = 0;
556 struct local_zone* z;
558 if(sldns_str2wire_dname_buf(zname, dname, &dname_len) != 0) {
559 log_err("cannot parse zone name in local-zone-tag: %s", zname);
562 dname_labs = dname_count_labels(dname);
564 lock_rw_rdlock(&zones->lock);
565 z = local_zones_find(zones, dname, dname_len, dname_labs, rr_class);
567 lock_rw_unlock(&zones->lock);
568 log_err("no local-zone for tag %s", zname);
571 lock_rw_wrlock(&z->lock);
572 lock_rw_unlock(&zones->lock);
574 z->taglist = memdup(list, len);
578 lock_rw_unlock(&z->lock);
582 /** enter override into zone */
584 lz_enter_override(struct local_zones* zones, char* zname, char* netblock,
585 char* type, uint16_t rr_class)
587 uint8_t dname[LDNS_MAX_DOMAINLEN+1];
588 size_t dname_len = sizeof(dname);
590 struct sockaddr_storage addr;
593 struct local_zone* z;
594 enum localzone_type t;
596 /* parse zone name */
597 if(sldns_str2wire_dname_buf(zname, dname, &dname_len) != 0) {
598 log_err("cannot parse zone name in local-zone-override: %s %s",
602 dname_labs = dname_count_labels(dname);
605 if(!netblockstrtoaddr(netblock, UNBOUND_DNS_PORT, &addr, &addrlen,
607 log_err("cannot parse netblock in local-zone-override: %s %s",
612 /* parse zone type */
613 if(!local_zone_str2type(type, &t)) {
614 log_err("cannot parse type in local-zone-override: %s %s %s",
615 zname, netblock, type);
619 /* find localzone entry */
620 lock_rw_rdlock(&zones->lock);
621 z = local_zones_find(zones, dname, dname_len, dname_labs, rr_class);
623 lock_rw_unlock(&zones->lock);
624 log_err("no local-zone for local-zone-override %s", zname);
627 lock_rw_wrlock(&z->lock);
628 lock_rw_unlock(&zones->lock);
630 /* create netblock addr_tree if not present yet */
631 if(!z->override_tree) {
632 z->override_tree = (struct rbtree_t*)regional_alloc_zero(
633 z->region, sizeof(*z->override_tree));
634 if(!z->override_tree) {
635 lock_rw_unlock(&z->lock);
636 log_err("out of memory");
639 addr_tree_init(z->override_tree);
641 /* add new elem to tree */
642 if(z->override_tree) {
643 struct local_zone_override* n;
644 n = (struct local_zone_override*)regional_alloc_zero(
645 z->region, sizeof(*n));
647 lock_rw_unlock(&z->lock);
648 log_err("out of memory");
652 if(!addr_tree_insert(z->override_tree,
653 (struct addr_tree_node*)n, &addr, addrlen, net)) {
654 lock_rw_unlock(&z->lock);
655 log_err("duplicate local-zone-override %s %s",
661 lock_rw_unlock(&z->lock);
665 /** parse local-zone: statements */
667 lz_enter_zones(struct local_zones* zones, struct config_file* cfg)
669 struct config_str2list* p;
670 struct local_zone* z;
671 for(p = cfg->local_zones; p; p = p->next) {
672 if(!(z=lz_enter_zone(zones, p->str, p->str2,
675 lock_rw_unlock(&z->lock);
680 /** lookup a zone in rbtree; exact match only; SLOW due to parse */
682 lz_exists(struct local_zones* zones, const char* name)
686 z.dclass = LDNS_RR_CLASS_IN;
687 if(!parse_dname(name, &z.name, &z.namelen, &z.namelabs)) {
688 log_err("bad name %s", name);
691 lock_rw_rdlock(&zones->lock);
692 if(rbtree_search(&zones->ztree, &z.node)) {
693 lock_rw_unlock(&zones->lock);
697 lock_rw_unlock(&zones->lock);
702 /** lookup a zone in cfg->nodefault list */
704 lz_nodefault(struct config_file* cfg, const char* name)
706 struct config_strlist* p;
707 size_t len = strlen(name);
708 if(len == 0) return 0;
709 if(name[len-1] == '.') len--;
711 for(p = cfg->local_zones_nodefault; p; p = p->next) {
712 /* compare zone name, lowercase, compare without ending . */
713 if(strncasecmp(p->str, name, len) == 0 &&
714 (strlen(p->str) == len || (strlen(p->str)==len+1 &&
715 p->str[len] == '.')))
721 /** enter AS112 default zone */
723 add_as112_default(struct local_zones* zones, struct config_file* cfg,
726 struct local_zone* z;
727 char str[1024]; /* known long enough */
728 if(lz_exists(zones, name) || lz_nodefault(cfg, name))
729 return 1; /* do not enter default content */
730 if(!(z=lz_enter_zone(zones, name, "static", LDNS_RR_CLASS_IN)))
732 snprintf(str, sizeof(str), "%s 10800 IN SOA localhost. "
733 "nobody.invalid. 1 3600 1200 604800 10800", name);
734 if(!lz_enter_rr_into_zone(z, str)) {
735 lock_rw_unlock(&z->lock);
738 snprintf(str, sizeof(str), "%s 10800 IN NS localhost. ", name);
739 if(!lz_enter_rr_into_zone(z, str)) {
740 lock_rw_unlock(&z->lock);
743 lock_rw_unlock(&z->lock);
747 /** enter default zones */
749 lz_enter_defaults(struct local_zones* zones, struct config_file* cfg)
751 struct local_zone* z;
754 /* this list of zones is from RFC 6303 and RFC 7686 */
756 /* block localhost level zones first, then onion and later the LAN zones */
758 /* localhost. zone */
759 if(!lz_exists(zones, "localhost.") &&
760 !lz_nodefault(cfg, "localhost.")) {
761 if(!(z=lz_enter_zone(zones, "localhost.", "static",
762 LDNS_RR_CLASS_IN)) ||
763 !lz_enter_rr_into_zone(z,
764 "localhost. 10800 IN NS localhost.") ||
765 !lz_enter_rr_into_zone(z,
766 "localhost. 10800 IN SOA localhost. nobody.invalid. "
767 "1 3600 1200 604800 10800") ||
768 !lz_enter_rr_into_zone(z,
769 "localhost. 10800 IN A 127.0.0.1") ||
770 !lz_enter_rr_into_zone(z,
771 "localhost. 10800 IN AAAA ::1")) {
772 log_err("out of memory adding default zone");
773 if(z) { lock_rw_unlock(&z->lock); }
776 lock_rw_unlock(&z->lock);
778 /* reverse ip4 zone */
779 if(!lz_exists(zones, "127.in-addr.arpa.") &&
780 !lz_nodefault(cfg, "127.in-addr.arpa.")) {
781 if(!(z=lz_enter_zone(zones, "127.in-addr.arpa.", "static",
782 LDNS_RR_CLASS_IN)) ||
783 !lz_enter_rr_into_zone(z,
784 "127.in-addr.arpa. 10800 IN NS localhost.") ||
785 !lz_enter_rr_into_zone(z,
786 "127.in-addr.arpa. 10800 IN SOA localhost. "
787 "nobody.invalid. 1 3600 1200 604800 10800") ||
788 !lz_enter_rr_into_zone(z,
789 "1.0.0.127.in-addr.arpa. 10800 IN PTR localhost.")) {
790 log_err("out of memory adding default zone");
791 if(z) { lock_rw_unlock(&z->lock); }
794 lock_rw_unlock(&z->lock);
796 /* reverse ip6 zone */
797 if(!lz_exists(zones, "1.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.ip6.arpa.") &&
798 !lz_nodefault(cfg, "1.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.ip6.arpa.")) {
799 if(!(z=lz_enter_zone(zones, "1.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.ip6.arpa.", "static",
800 LDNS_RR_CLASS_IN)) ||
801 !lz_enter_rr_into_zone(z,
802 "1.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.ip6.arpa. 10800 IN NS localhost.") ||
803 !lz_enter_rr_into_zone(z,
804 "1.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.ip6.arpa. 10800 IN SOA localhost. "
805 "nobody.invalid. 1 3600 1200 604800 10800") ||
806 !lz_enter_rr_into_zone(z,
807 "1.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.ip6.arpa. 10800 IN PTR localhost.")) {
808 log_err("out of memory adding default zone");
809 if(z) { lock_rw_unlock(&z->lock); }
812 lock_rw_unlock(&z->lock);
814 /* onion. zone (RFC 7686) */
815 if(!lz_exists(zones, "onion.") &&
816 !lz_nodefault(cfg, "onion.")) {
817 if(!(z=lz_enter_zone(zones, "onion.", "static",
818 LDNS_RR_CLASS_IN)) ||
819 !lz_enter_rr_into_zone(z,
820 "onion. 10800 IN NS localhost.") ||
821 !lz_enter_rr_into_zone(z,
822 "onion. 10800 IN SOA localhost. nobody.invalid. "
823 "1 3600 1200 604800 10800")) {
824 log_err("out of memory adding default zone");
825 if(z) { lock_rw_unlock(&z->lock); }
828 lock_rw_unlock(&z->lock);
831 /* block AS112 zones, unless asked not to */
832 if(!cfg->unblock_lan_zones) {
833 for(zstr = as112_zones; *zstr; zstr++) {
834 if(!add_as112_default(zones, cfg, *zstr)) {
835 log_err("out of memory adding default zone");
843 /** parse local-zone-override: statements */
845 lz_enter_overrides(struct local_zones* zones, struct config_file* cfg)
847 struct config_str3list* p;
848 for(p = cfg->local_zone_overrides; p; p = p->next) {
849 if(!lz_enter_override(zones, p->str, p->str2, p->str3,
856 /** setup parent pointers, so that a lookup can be done for closest match */
858 init_parents(struct local_zones* zones)
860 struct local_zone* node, *prev = NULL, *p;
862 lock_rw_wrlock(&zones->lock);
863 RBTREE_FOR(node, struct local_zone*, &zones->ztree) {
864 lock_rw_wrlock(&node->lock);
866 if(!prev || prev->dclass != node->dclass) {
868 lock_rw_unlock(&node->lock);
871 (void)dname_lab_cmp(prev->name, prev->namelabs, node->name,
872 node->namelabs, &m); /* we know prev is smaller */
873 /* sort order like: . com. bla.com. zwb.com. net. */
874 /* find the previous, or parent-parent-parent */
875 for(p = prev; p; p = p->parent)
876 /* looking for name with few labels, a parent */
877 if(p->namelabs <= m) {
878 /* ==: since prev matched m, this is closest*/
879 /* <: prev matches more, but is not a parent,
880 * this one is a (grand)parent */
886 if(node->override_tree)
887 addr_tree_init_parents(node->override_tree);
888 lock_rw_unlock(&node->lock);
890 lock_rw_unlock(&zones->lock);
893 /** enter implicit transparent zone for local-data: without local-zone: */
895 lz_setup_implicit(struct local_zones* zones, struct config_file* cfg)
897 /* walk over all items that have no parent zone and find
898 * the name that covers them all (could be the root) and
899 * add that as a transparent zone */
900 struct config_strlist* p;
902 int have_other_classes = 0;
907 int match = 0; /* number of labels match count */
909 init_parents(zones); /* to enable local_zones_lookup() */
910 for(p = cfg->local_data; p; p = p->next) {
915 if(!get_rr_nameclass(p->str, &rr_name, &rr_class)) {
916 log_err("Bad local-data RR %s", p->str);
919 labs = dname_count_size_labels(rr_name, &len);
920 lock_rw_rdlock(&zones->lock);
921 if(!local_zones_lookup(zones, rr_name, len, labs, rr_class)) {
931 if(rr_class != dclass) {
932 /* process other classes later */
934 have_other_classes = 1;
935 lock_rw_unlock(&zones->lock);
938 /* find smallest shared topdomain */
939 (void)dname_lab_cmp(nm, nmlabs,
945 } else free(rr_name);
946 lock_rw_unlock(&zones->lock);
950 struct local_zone* z;
951 /* allocate zone of smallest shared topdomain to contain em */
953 dname_remove_labels(&n2, &nmlen, nmlabs - match);
954 n2 = memdup(n2, nmlen);
957 log_err("out of memory");
960 log_nametypeclass(VERB_ALGO, "implicit transparent local-zone",
962 if(!(z=lz_enter_zone_dname(zones, n2, nmlen, match,
963 local_zone_transparent, dclass))) {
966 lock_rw_unlock(&z->lock);
968 if(have_other_classes) {
969 /* restart to setup other class */
970 return lz_setup_implicit(zones, cfg);
975 /** enter local-zone-tag info */
977 lz_enter_zone_tags(struct local_zones* zones, struct config_file* cfg)
979 struct config_strbytelist* p;
981 for(p = cfg->local_zone_tags; p; p = p->next) {
982 if(!lz_enter_zone_tag(zones, p->str, p->str2, p->str2len,
987 if(c) verbose(VERB_ALGO, "applied tags to %d local zones", c);
991 /** enter auth data */
993 lz_enter_data(struct local_zones* zones, struct config_file* cfg)
995 struct config_strlist* p;
996 for(p = cfg->local_data; p; p = p->next) {
997 if(!lz_enter_rr_str(zones, p->str))
1003 /** free memory from config */
1005 lz_freeup_cfg(struct config_file* cfg)
1007 config_deldblstrlist(cfg->local_zones);
1008 cfg->local_zones = NULL;
1009 config_delstrlist(cfg->local_zones_nodefault);
1010 cfg->local_zones_nodefault = NULL;
1011 config_delstrlist(cfg->local_data);
1012 cfg->local_data = NULL;
1016 local_zones_apply_cfg(struct local_zones* zones, struct config_file* cfg)
1018 /* create zones from zone statements. */
1019 if(!lz_enter_zones(zones, cfg)) {
1022 /* apply default zones+content (unless disabled, or overridden) */
1023 if(!lz_enter_defaults(zones, cfg)) {
1026 /* enter local zone overrides */
1027 if(!lz_enter_overrides(zones, cfg)) {
1030 /* create implicit transparent zone from data. */
1031 if(!lz_setup_implicit(zones, cfg)) {
1035 /* setup parent ptrs for lookup during data entry */
1036 init_parents(zones);
1037 /* insert local zone tags */
1038 if(!lz_enter_zone_tags(zones, cfg)) {
1041 /* insert local data */
1042 if(!lz_enter_data(zones, cfg)) {
1045 /* freeup memory from cfg struct. */
1051 local_zones_lookup(struct local_zones* zones,
1052 uint8_t* name, size_t len, int labs, uint16_t dclass)
1054 return local_zones_tags_lookup(zones, name, len, labs,
1055 dclass, NULL, 0, 1);
1059 local_zones_tags_lookup(struct local_zones* zones,
1060 uint8_t* name, size_t len, int labs, uint16_t dclass,
1061 uint8_t* taglist, size_t taglen, int ignoretags)
1063 rbnode_t* res = NULL;
1064 struct local_zone *result;
1065 struct local_zone key;
1067 key.node.key = &key;
1068 key.dclass = dclass;
1071 key.namelabs = labs;
1072 rbtree_find_less_equal(&zones->ztree, &key, &res);
1073 result = (struct local_zone*)res;
1074 /* exact or smaller element (or no element) */
1075 if(!result || result->dclass != dclass)
1077 /* count number of labels matched */
1078 (void)dname_lab_cmp(result->name, result->namelabs, key.name,
1080 while(result) { /* go up until qname is zone or subdomain of zone */
1081 if(result->namelabs <= m)
1082 if(ignoretags || !result->taglist ||
1083 taglist_intersect(result->taglist,
1084 result->taglen, taglist, taglen))
1086 result = result->parent;
1092 local_zones_find(struct local_zones* zones,
1093 uint8_t* name, size_t len, int labs, uint16_t dclass)
1095 struct local_zone key;
1096 key.node.key = &key;
1097 key.dclass = dclass;
1100 key.namelabs = labs;
1102 return (struct local_zone*)rbtree_search(&zones->ztree, &key);
1105 /** print all RRsets in local zone */
1107 local_zone_out(struct local_zone* z)
1109 struct local_data* d;
1110 struct local_rrset* p;
1111 RBTREE_FOR(d, struct local_data*, &z->data) {
1112 for(p = d->rrsets; p; p = p->next) {
1113 log_nametypeclass(0, "rrset", d->name,
1114 ntohs(p->rrset->rk.type),
1115 ntohs(p->rrset->rk.rrset_class));
1120 void local_zones_print(struct local_zones* zones)
1122 struct local_zone* z;
1123 lock_rw_rdlock(&zones->lock);
1124 log_info("number of auth zones %u", (unsigned)zones->ztree.count);
1125 RBTREE_FOR(z, struct local_zone*, &zones->ztree) {
1126 lock_rw_rdlock(&z->lock);
1128 case local_zone_deny:
1129 log_nametypeclass(0, "deny zone",
1130 z->name, 0, z->dclass);
1132 case local_zone_refuse:
1133 log_nametypeclass(0, "refuse zone",
1134 z->name, 0, z->dclass);
1136 case local_zone_redirect:
1137 log_nametypeclass(0, "redirect zone",
1138 z->name, 0, z->dclass);
1140 case local_zone_transparent:
1141 log_nametypeclass(0, "transparent zone",
1142 z->name, 0, z->dclass);
1144 case local_zone_typetransparent:
1145 log_nametypeclass(0, "typetransparent zone",
1146 z->name, 0, z->dclass);
1148 case local_zone_static:
1149 log_nametypeclass(0, "static zone",
1150 z->name, 0, z->dclass);
1152 case local_zone_inform:
1153 log_nametypeclass(0, "inform zone",
1154 z->name, 0, z->dclass);
1156 case local_zone_inform_deny:
1157 log_nametypeclass(0, "inform_deny zone",
1158 z->name, 0, z->dclass);
1160 case local_zone_always_transparent:
1161 log_nametypeclass(0, "always_transparent zone",
1162 z->name, 0, z->dclass);
1164 case local_zone_always_refuse:
1165 log_nametypeclass(0, "always_refuse zone",
1166 z->name, 0, z->dclass);
1168 case local_zone_always_nxdomain:
1169 log_nametypeclass(0, "always_nxdomain zone",
1170 z->name, 0, z->dclass);
1173 log_nametypeclass(0, "badtyped zone",
1174 z->name, 0, z->dclass);
1178 lock_rw_unlock(&z->lock);
1180 lock_rw_unlock(&zones->lock);
1183 /** encode answer consisting of 1 rrset */
1185 local_encode(struct query_info* qinfo, struct module_env* env,
1186 struct edns_data* edns, sldns_buffer* buf, struct regional* temp,
1187 struct ub_packed_rrset_key* rrset, int ansec, int rcode)
1189 struct reply_info rep;
1191 /* make answer with time=0 for fixed TTL values */
1192 memset(&rep, 0, sizeof(rep));
1193 rep.flags = (uint16_t)((BIT_QR | BIT_AA | BIT_RA) | rcode);
1196 rep.an_numrrsets = 1;
1197 else rep.ns_numrrsets = 1;
1198 rep.rrset_count = 1;
1199 rep.rrsets = &rrset;
1200 udpsize = edns->udp_size;
1201 edns->edns_version = EDNS_ADVERTISED_VERSION;
1202 edns->udp_size = EDNS_ADVERTISED_SIZE;
1203 edns->ext_rcode = 0;
1204 edns->bits &= EDNS_DO;
1205 if(!inplace_cb_reply_local_call(env, qinfo, NULL, &rep, rcode, edns, temp)
1206 || !reply_info_answer_encode(qinfo, &rep,
1207 *(uint16_t*)sldns_buffer_begin(buf),
1208 sldns_buffer_read_u16_at(buf, 2),
1209 buf, 0, 0, temp, udpsize, edns,
1210 (int)(edns->bits&EDNS_DO), 0))
1211 error_encode(buf, (LDNS_RCODE_SERVFAIL|BIT_AA), qinfo,
1212 *(uint16_t*)sldns_buffer_begin(buf),
1213 sldns_buffer_read_u16_at(buf, 2), edns);
1217 /** find local data tag string match for the given type in the list */
1219 find_tag_datas(struct query_info* qinfo, struct config_strlist* list,
1220 struct ub_packed_rrset_key* r, struct regional* temp)
1222 struct config_strlist* p;
1224 uint8_t rr[LDNS_RR_BUF_SIZE];
1227 struct packed_rrset_data* d;
1228 for(p=list; p; p=p->next) {
1232 /* does this element match the type? */
1233 snprintf(buf, sizeof(buf), ". %s", p->str);
1234 res = sldns_str2wire_rr_buf(buf, rr, &len, NULL, 3600,
1237 /* parse errors are already checked before, in
1238 * acllist check_data, skip this for robustness */
1240 if(len < 1 /* . */ + 8 /* typeclassttl*/ + 2 /*rdatalen*/)
1242 rdr_type = sldns_wirerr_get_type(rr, len, 1);
1243 if(rdr_type != qinfo->qtype && rdr_type != LDNS_RR_TYPE_CNAME)
1246 /* do we have entries already? if not setup key */
1247 if(r->rk.dname == NULL) {
1249 r->rk.dname = qinfo->qname;
1250 r->rk.dname_len = qinfo->qname_len;
1251 r->rk.type = htons(rdr_type);
1252 r->rk.rrset_class = htons(qinfo->qclass);
1254 d = (struct packed_rrset_data*)regional_alloc_zero(
1255 temp, sizeof(struct packed_rrset_data)
1256 + sizeof(size_t) + sizeof(uint8_t*) +
1258 if(!d) return 0; /* out of memory */
1260 d->ttl = sldns_wirerr_get_ttl(rr, len, 1);
1261 d->rr_len = (size_t*)((uint8_t*)d +
1262 sizeof(struct packed_rrset_data));
1263 d->rr_data = (uint8_t**)&(d->rr_len[1]);
1264 d->rr_ttl = (time_t*)&(d->rr_data[1]);
1266 d = (struct packed_rrset_data*)r->entry.data;
1267 /* add entry to the data */
1269 size_t* oldlen = d->rr_len;
1270 uint8_t** olddata = d->rr_data;
1271 time_t* oldttl = d->rr_ttl;
1272 /* increase arrays for lookup */
1273 /* this is of course slow for very many records,
1274 * but most redirects are expected with few records */
1275 d->rr_len = (size_t*)regional_alloc_zero(temp,
1276 (d->count+1)*sizeof(size_t));
1277 d->rr_data = (uint8_t**)regional_alloc_zero(temp,
1278 (d->count+1)*sizeof(uint8_t*));
1279 d->rr_ttl = (time_t*)regional_alloc_zero(temp,
1280 (d->count+1)*sizeof(time_t));
1281 if(!d->rr_len || !d->rr_data || !d->rr_ttl)
1282 return 0; /* out of memory */
1283 /* first one was allocated after struct d, but new
1284 * ones get their own array increment alloc, so
1285 * copy old content */
1286 memmove(d->rr_len, oldlen, d->count*sizeof(size_t));
1287 memmove(d->rr_data, olddata, d->count*sizeof(uint8_t*));
1288 memmove(d->rr_ttl, oldttl, d->count*sizeof(time_t));
1291 d->rr_len[d->count] = sldns_wirerr_get_rdatalen(rr, len, 1)+2;
1292 d->rr_ttl[d->count] = sldns_wirerr_get_ttl(rr, len, 1);
1293 d->rr_data[d->count] = regional_alloc_init(temp,
1294 sldns_wirerr_get_rdatawl(rr, len, 1),
1295 d->rr_len[d->count]);
1296 if(!d->rr_data[d->count])
1297 if(!d) return 0; /* out of memory */
1300 /* If we've found a non-exact alias type of local data, make a shallow
1301 * copy of the RRset and remember it in qinfo to complete the alias
1303 if(r->rk.dname && qinfo->qtype != LDNS_RR_TYPE_CNAME &&
1304 r->rk.type == htons(LDNS_RR_TYPE_CNAME)) {
1305 qinfo->local_alias =
1306 regional_alloc_zero(temp, sizeof(struct local_rrset));
1307 if(!qinfo->local_alias)
1308 return 0; /* out of memory */
1309 qinfo->local_alias->rrset =
1310 regional_alloc_init(temp, r, sizeof(*r));
1311 if(!qinfo->local_alias->rrset)
1312 return 0; /* out of memory */
1319 /** answer local data match */
1321 local_data_answer(struct local_zone* z, struct module_env* env,
1322 struct query_info* qinfo, struct edns_data* edns, sldns_buffer* buf,
1323 struct regional* temp, int labs, struct local_data** ldp,
1324 enum localzone_type lz_type, int tag, struct config_strlist** tag_datas,
1325 size_t tag_datas_size, char** tagname, int num_tags)
1327 struct local_data key;
1328 struct local_data* ld;
1329 struct local_rrset* lr;
1330 key.node.key = &key;
1331 key.name = qinfo->qname;
1332 key.namelen = qinfo->qname_len;
1333 key.namelabs = labs;
1334 if(lz_type == local_zone_redirect) {
1336 key.namelen = z->namelen;
1337 key.namelabs = z->namelabs;
1338 if(tag != -1 && (size_t)tag<tag_datas_size && tag_datas[tag]) {
1339 struct ub_packed_rrset_key r;
1340 memset(&r, 0, sizeof(r));
1341 if(find_tag_datas(qinfo, tag_datas[tag], &r, temp)) {
1342 verbose(VERB_ALGO, "redirect with tag data [%d] %s",
1343 tag, (tag<num_tags?tagname[tag]:"null"));
1345 /* If we found a matching alias, we should
1346 * use it as part of the answer, but we can't
1347 * encode it until we complete the alias
1349 if(qinfo->local_alias)
1351 return local_encode(qinfo, env, edns, buf, temp,
1352 &r, 1, LDNS_RCODE_NOERROR);
1356 ld = (struct local_data*)rbtree_search(&z->data, &key.node);
1361 lr = local_data_find_type(ld, qinfo->qtype, 1);
1365 /* Special case for alias matching. See local_data_answer(). */
1366 if(lz_type == local_zone_redirect &&
1367 qinfo->qtype != LDNS_RR_TYPE_CNAME &&
1368 lr->rrset->rk.type == htons(LDNS_RR_TYPE_CNAME)) {
1369 qinfo->local_alias =
1370 regional_alloc_zero(temp, sizeof(struct local_rrset));
1371 if(!qinfo->local_alias)
1372 return 0; /* out of memory */
1373 qinfo->local_alias->rrset =
1374 regional_alloc_init(temp, lr->rrset, sizeof(*lr->rrset));
1375 if(!qinfo->local_alias->rrset)
1376 return 0; /* out of memory */
1377 qinfo->local_alias->rrset->rk.dname = qinfo->qname;
1378 qinfo->local_alias->rrset->rk.dname_len = qinfo->qname_len;
1381 if(lz_type == local_zone_redirect) {
1382 /* convert rrset name to query name; like a wildcard */
1383 struct ub_packed_rrset_key r = *lr->rrset;
1384 r.rk.dname = qinfo->qname;
1385 r.rk.dname_len = qinfo->qname_len;
1386 return local_encode(qinfo, env, edns, buf, temp, &r, 1,
1387 LDNS_RCODE_NOERROR);
1389 return local_encode(qinfo, env, edns, buf, temp, lr->rrset, 1,
1390 LDNS_RCODE_NOERROR);
1394 * answer in case where no exact match is found
1395 * @param z: zone for query
1396 * @param env: module environment
1397 * @param qinfo: query
1398 * @param edns: edns from query
1399 * @param buf: buffer for answer.
1400 * @param temp: temp region for encoding
1401 * @param ld: local data, if NULL, no such name exists in localdata.
1402 * @param lz_type: type of the local zone
1403 * @return 1 if a reply is to be sent, 0 if not.
1406 lz_zone_answer(struct local_zone* z, struct module_env* env,
1407 struct query_info* qinfo, struct edns_data* edns, sldns_buffer* buf,
1408 struct regional* temp, struct local_data* ld, enum localzone_type lz_type)
1410 if(lz_type == local_zone_deny || lz_type == local_zone_inform_deny) {
1411 /** no reply at all, signal caller by clearing buffer. */
1412 sldns_buffer_clear(buf);
1413 sldns_buffer_flip(buf);
1415 } else if(lz_type == local_zone_refuse
1416 || lz_type == local_zone_always_refuse) {
1417 error_encode(buf, (LDNS_RCODE_REFUSED|BIT_AA), qinfo,
1418 *(uint16_t*)sldns_buffer_begin(buf),
1419 sldns_buffer_read_u16_at(buf, 2), edns);
1421 } else if(lz_type == local_zone_static ||
1422 lz_type == local_zone_redirect ||
1423 lz_type == local_zone_always_nxdomain) {
1424 /* for static, reply nodata or nxdomain
1425 * for redirect, reply nodata */
1426 /* no additional section processing,
1427 * cname, dname or wildcard processing,
1428 * or using closest match for NSEC.
1429 * or using closest match for returning delegation downwards
1431 int rcode = (ld || lz_type == local_zone_redirect)?
1432 LDNS_RCODE_NOERROR:LDNS_RCODE_NXDOMAIN;
1434 return local_encode(qinfo, env, edns, buf, temp,
1436 error_encode(buf, (rcode|BIT_AA), qinfo,
1437 *(uint16_t*)sldns_buffer_begin(buf),
1438 sldns_buffer_read_u16_at(buf, 2), edns);
1440 } else if(lz_type == local_zone_typetransparent
1441 || lz_type == local_zone_always_transparent) {
1442 /* no NODATA or NXDOMAINS for this zone type */
1445 /* else lz_type == local_zone_transparent */
1447 /* if the zone is transparent and the name exists, but the type
1448 * does not, then we should make this noerror/nodata */
1449 if(ld && ld->rrsets) {
1450 int rcode = LDNS_RCODE_NOERROR;
1452 return local_encode(qinfo, env, edns, buf, temp,
1454 error_encode(buf, (rcode|BIT_AA), qinfo,
1455 *(uint16_t*)sldns_buffer_begin(buf),
1456 sldns_buffer_read_u16_at(buf, 2), edns);
1460 /* stop here, and resolve further on */
1464 /** print log information for an inform zone query */
1466 lz_inform_print(struct local_zone* z, struct query_info* qinfo,
1467 struct comm_reply* repinfo)
1469 char ip[128], txt[512];
1470 char zname[LDNS_MAX_DOMAINLEN+1];
1471 uint16_t port = ntohs(((struct sockaddr_in*)&repinfo->addr)->sin_port);
1472 dname_str(z->name, zname);
1473 addr_to_str(&repinfo->addr, repinfo->addrlen, ip, sizeof(ip));
1474 snprintf(txt, sizeof(txt), "%s inform %s@%u", zname, ip,
1476 log_nametypeclass(0, txt, qinfo->qname, qinfo->qtype, qinfo->qclass);
1479 static enum localzone_type
1480 lz_type(uint8_t *taglist, size_t taglen, uint8_t *taglist2, size_t taglen2,
1481 uint8_t *tagactions, size_t tagactionssize, enum localzone_type lzt,
1482 struct comm_reply* repinfo, struct rbtree_t* override_tree, int* tag,
1483 char** tagname, int num_tags)
1487 struct local_zone_override* lzo;
1488 if(repinfo && override_tree) {
1489 lzo = (struct local_zone_override*)addr_tree_lookup(
1490 override_tree, &repinfo->addr, repinfo->addrlen);
1491 if(lzo && lzo->type) {
1492 verbose(VERB_ALGO, "local zone override to type %s",
1493 local_zone_type2str(lzo->type));
1497 if(!taglist || !taglist2)
1499 for(i=0; i<taglen && i<taglen2; i++) {
1500 tagmatch = (taglist[i] & taglist2[i]);
1501 for(j=0; j<8 && tagmatch>0; j++) {
1502 if((tagmatch & 0x1)) {
1503 *tag = (int)(i*8+j);
1504 verbose(VERB_ALGO, "matched tag [%d] %s",
1505 *tag, (*tag<num_tags?tagname[*tag]:"null"));
1506 /* does this tag have a tag action? */
1507 if(i*8+j < tagactionssize && tagactions
1508 && tagactions[i*8+j] != 0) {
1509 verbose(VERB_ALGO, "tag action [%d] %s to type %s",
1510 *tag, (*tag<num_tags?tagname[*tag]:"null"),
1511 local_zone_type2str(
1512 (enum localzone_type)
1513 tagactions[i*8+j]));
1514 return (enum localzone_type)tagactions[i*8+j];
1525 local_zones_answer(struct local_zones* zones, struct module_env* env,
1526 struct query_info* qinfo, struct edns_data* edns, sldns_buffer* buf,
1527 struct regional* temp, struct comm_reply* repinfo, uint8_t* taglist,
1528 size_t taglen, uint8_t* tagactions, size_t tagactionssize,
1529 struct config_strlist** tag_datas, size_t tag_datas_size,
1530 char** tagname, int num_tags, struct view* view)
1532 /* see if query is covered by a zone,
1533 * if so: - try to match (exact) local data
1534 * - look at zone type for negative response. */
1535 int labs = dname_count_labels(qinfo->qname);
1536 struct local_data* ld = NULL;
1537 struct local_zone* z = NULL;
1538 enum localzone_type lzt = local_zone_transparent;
1542 lock_rw_rdlock(&view->lock);
1543 if(view->local_zones &&
1544 (z = local_zones_lookup(view->local_zones,
1545 qinfo->qname, qinfo->qname_len, labs,
1548 "using localzone from view: %s",
1550 lock_rw_rdlock(&z->lock);
1553 if(!z && !view->isfirst){
1554 lock_rw_unlock(&view->lock);
1557 lock_rw_unlock(&view->lock);
1560 /* try global local_zones tree */
1561 lock_rw_rdlock(&zones->lock);
1562 if(!(z = local_zones_tags_lookup(zones, qinfo->qname,
1563 qinfo->qname_len, labs, qinfo->qclass, taglist,
1565 lock_rw_unlock(&zones->lock);
1568 lock_rw_rdlock(&z->lock);
1570 lzt = lz_type(taglist, taglen, z->taglist, z->taglen,
1571 tagactions, tagactionssize, z->type, repinfo,
1572 z->override_tree, &tag, tagname, num_tags);
1573 lock_rw_unlock(&zones->lock);
1575 if((lzt == local_zone_inform || lzt == local_zone_inform_deny)
1577 lz_inform_print(z, qinfo, repinfo);
1579 if(lzt != local_zone_always_refuse
1580 && lzt != local_zone_always_transparent
1581 && lzt != local_zone_always_nxdomain
1582 && local_data_answer(z, env, qinfo, edns, buf, temp, labs, &ld, lzt,
1583 tag, tag_datas, tag_datas_size, tagname, num_tags)) {
1584 lock_rw_unlock(&z->lock);
1585 /* We should tell the caller that encode is deferred if we found
1587 return !qinfo->local_alias;
1589 r = lz_zone_answer(z, env, qinfo, edns, buf, temp, ld, lzt);
1590 lock_rw_unlock(&z->lock);
1591 return r && !qinfo->local_alias; /* see above */
1594 const char* local_zone_type2str(enum localzone_type t)
1597 case local_zone_unset: return "unset";
1598 case local_zone_deny: return "deny";
1599 case local_zone_refuse: return "refuse";
1600 case local_zone_redirect: return "redirect";
1601 case local_zone_transparent: return "transparent";
1602 case local_zone_typetransparent: return "typetransparent";
1603 case local_zone_static: return "static";
1604 case local_zone_nodefault: return "nodefault";
1605 case local_zone_inform: return "inform";
1606 case local_zone_inform_deny: return "inform_deny";
1607 case local_zone_always_transparent: return "always_transparent";
1608 case local_zone_always_refuse: return "always_refuse";
1609 case local_zone_always_nxdomain: return "always_nxdomain";
1614 int local_zone_str2type(const char* type, enum localzone_type* t)
1616 if(strcmp(type, "deny") == 0)
1617 *t = local_zone_deny;
1618 else if(strcmp(type, "refuse") == 0)
1619 *t = local_zone_refuse;
1620 else if(strcmp(type, "static") == 0)
1621 *t = local_zone_static;
1622 else if(strcmp(type, "transparent") == 0)
1623 *t = local_zone_transparent;
1624 else if(strcmp(type, "typetransparent") == 0)
1625 *t = local_zone_typetransparent;
1626 else if(strcmp(type, "redirect") == 0)
1627 *t = local_zone_redirect;
1628 else if(strcmp(type, "inform") == 0)
1629 *t = local_zone_inform;
1630 else if(strcmp(type, "inform_deny") == 0)
1631 *t = local_zone_inform_deny;
1632 else if(strcmp(type, "always_transparent") == 0)
1633 *t = local_zone_always_transparent;
1634 else if(strcmp(type, "always_refuse") == 0)
1635 *t = local_zone_always_refuse;
1636 else if(strcmp(type, "always_nxdomain") == 0)
1637 *t = local_zone_always_nxdomain;
1642 /** iterate over the kiddies of the given name and set their parent ptr */
1644 set_kiddo_parents(struct local_zone* z, struct local_zone* match,
1645 struct local_zone* newp)
1647 /* both zones and z are locked already */
1648 /* in the sorted rbtree, the kiddies of z are located after z */
1649 /* z must be present in the tree */
1650 struct local_zone* p = z;
1651 p = (struct local_zone*)rbtree_next(&p->node);
1652 while(p!=(struct local_zone*)RBTREE_NULL &&
1653 p->dclass == z->dclass && dname_strict_subdomain(p->name,
1654 p->namelabs, z->name, z->namelabs)) {
1655 /* update parent ptr */
1656 /* only when matches with existing parent pointer, so that
1657 * deeper child structures are not touched, i.e.
1658 * update of x, and a.x, b.x, f.b.x, g.b.x, c.x, y
1659 * gets to update a.x, b.x and c.x */
1660 lock_rw_wrlock(&p->lock);
1661 if(p->parent == match)
1663 lock_rw_unlock(&p->lock);
1664 p = (struct local_zone*)rbtree_next(&p->node);
1668 struct local_zone* local_zones_add_zone(struct local_zones* zones,
1669 uint8_t* name, size_t len, int labs, uint16_t dclass,
1670 enum localzone_type tp)
1673 struct local_zone* z = local_zone_create(name, len, labs, tp, dclass);
1678 lock_rw_wrlock(&z->lock);
1680 /* find the closest parent */
1681 z->parent = local_zones_find(zones, name, len, labs, dclass);
1683 /* insert into the tree */
1684 if(!rbtree_insert(&zones->ztree, &z->node)) {
1685 /* duplicate entry! */
1686 lock_rw_unlock(&z->lock);
1687 local_zone_delete(z);
1688 log_err("internal: duplicate entry in local_zones_add_zone");
1692 /* set parent pointers right */
1693 set_kiddo_parents(z, z->parent, z);
1695 lock_rw_unlock(&z->lock);
1699 void local_zones_del_zone(struct local_zones* zones, struct local_zone* z)
1701 /* fix up parents in tree */
1702 lock_rw_wrlock(&z->lock);
1703 set_kiddo_parents(z, z, z->parent);
1705 /* remove from tree */
1706 (void)rbtree_delete(&zones->ztree, z);
1708 /* delete the zone */
1709 lock_rw_unlock(&z->lock);
1710 local_zone_delete(z);
1714 local_zones_add_RR(struct local_zones* zones, const char* rr)
1720 struct local_zone* z;
1722 if(!get_rr_nameclass(rr, &rr_name, &rr_class)) {
1725 labs = dname_count_size_labels(rr_name, &len);
1726 /* could first try readlock then get writelock if zone does not exist,
1727 * but we do not add enough RRs (from multiple threads) to optimize */
1728 lock_rw_wrlock(&zones->lock);
1729 z = local_zones_lookup(zones, rr_name, len, labs, rr_class);
1731 z = local_zones_add_zone(zones, rr_name, len, labs, rr_class,
1732 local_zone_transparent);
1734 lock_rw_unlock(&zones->lock);
1740 lock_rw_wrlock(&z->lock);
1741 lock_rw_unlock(&zones->lock);
1742 r = lz_enter_rr_into_zone(z, rr);
1743 lock_rw_unlock(&z->lock);
1747 /** returns true if the node is terminal so no deeper domain names exist */
1749 is_terminal(struct local_data* d)
1751 /* for empty nonterminals, the deeper domain names are sorted
1752 * right after them, so simply check the next name in the tree
1754 struct local_data* n = (struct local_data*)rbtree_next(&d->node);
1755 if(n == (struct local_data*)RBTREE_NULL)
1756 return 1; /* last in tree, no deeper node */
1757 if(dname_strict_subdomain(n->name, n->namelabs, d->name, d->namelabs))
1758 return 0; /* there is a deeper node */
1762 /** delete empty terminals from tree when final data is deleted */
1764 del_empty_term(struct local_zone* z, struct local_data* d,
1765 uint8_t* name, size_t len, int labs)
1767 while(d && d->rrsets == NULL && is_terminal(d)) {
1768 /* is this empty nonterminal? delete */
1769 /* note, no memory recycling in zone region */
1770 (void)rbtree_delete(&z->data, d);
1772 /* go up and to the next label */
1773 if(dname_is_root(name))
1775 dname_remove_label(&name, &len);
1777 d = lz_find_node(z, name, len, labs);
1781 void local_zones_del_data(struct local_zones* zones,
1782 uint8_t* name, size_t len, int labs, uint16_t dclass)
1785 struct local_zone* z;
1786 struct local_data* d;
1787 lock_rw_rdlock(&zones->lock);
1788 z = local_zones_lookup(zones, name, len, labs, dclass);
1790 /* no such zone, we're done */
1791 lock_rw_unlock(&zones->lock);
1794 lock_rw_wrlock(&z->lock);
1795 lock_rw_unlock(&zones->lock);
1797 /* find the domain */
1798 d = lz_find_node(z, name, len, labs);
1800 /* no memory recycling for zone deletions ... */
1802 /* did we delete the soa record ? */
1803 if(query_dname_compare(d->name, z->name) == 0)
1806 /* cleanup the empty nonterminals for this name */
1807 del_empty_term(z, d, name, len, labs);
1810 lock_rw_unlock(&z->lock);