2 * iterator/iter_utils.c - iterative resolver module utility functions.
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 assist the iterator module.
40 * Configuration options. Forward zones.
43 #include "iterator/iter_utils.h"
44 #include "iterator/iterator.h"
45 #include "iterator/iter_hints.h"
46 #include "iterator/iter_fwd.h"
47 #include "iterator/iter_donotq.h"
48 #include "iterator/iter_delegpt.h"
49 #include "iterator/iter_priv.h"
50 #include "services/cache/infra.h"
51 #include "services/cache/dns.h"
52 #include "services/cache/rrset.h"
53 #include "util/net_help.h"
54 #include "util/module.h"
56 #include "util/config_file.h"
57 #include "util/regional.h"
58 #include "util/data/msgparse.h"
59 #include "util/data/dname.h"
60 #include "util/random.h"
61 #include "util/fptr_wlist.h"
62 #include "validator/val_anchor.h"
63 #include "validator/val_kcache.h"
64 #include "validator/val_kentry.h"
65 #include "validator/val_utils.h"
66 #include "validator/val_sigcrypt.h"
67 #include "ldns/sbuffer.h"
69 /** time when nameserver glue is said to be 'recent' */
70 #define SUSPICION_RECENT_EXPIRY 86400
71 /** penalty to validation failed blacklisted IPs */
72 #define BLACKLIST_PENALTY (USEFUL_SERVER_TOP_TIMEOUT*4)
74 /** fillup fetch policy array */
76 fetch_fill(struct iter_env* ie, const char* str)
78 char* s = (char*)str, *e;
80 for(i=0; i<ie->max_dependency_depth+1; i++) {
81 ie->target_fetch_policy[i] = strtol(s, &e, 10);
83 fatal_exit("cannot parse fetch policy number %s", s);
88 /** Read config string that represents the target fetch policy */
90 read_fetch_policy(struct iter_env* ie, const char* str)
92 int count = cfg_count_numbers(str);
94 log_err("Cannot parse target fetch policy: \"%s\"", str);
97 ie->max_dependency_depth = count - 1;
98 ie->target_fetch_policy = (int*)calloc(
99 (size_t)ie->max_dependency_depth+1, sizeof(int));
100 if(!ie->target_fetch_policy) {
101 log_err("alloc fetch policy: out of memory");
109 iter_apply_cfg(struct iter_env* iter_env, struct config_file* cfg)
112 /* target fetch policy */
113 if(!read_fetch_policy(iter_env, cfg->target_fetch_policy))
115 for(i=0; i<iter_env->max_dependency_depth+1; i++)
116 verbose(VERB_QUERY, "target fetch policy for level %d is %d",
117 i, iter_env->target_fetch_policy[i]);
119 if(!iter_env->donotq)
120 iter_env->donotq = donotq_create();
121 if(!iter_env->donotq || !donotq_apply_cfg(iter_env->donotq, cfg)) {
122 log_err("Could not set donotqueryaddresses");
126 iter_env->priv = priv_create();
127 if(!iter_env->priv || !priv_apply_cfg(iter_env->priv, cfg)) {
128 log_err("Could not set private addresses");
131 iter_env->supports_ipv6 = cfg->do_ip6;
132 iter_env->supports_ipv4 = cfg->do_ip4;
136 /** filter out unsuitable targets
137 * @param iter_env: iterator environment with ipv6-support flag.
138 * @param env: module environment with infra cache.
139 * @param name: zone name
140 * @param namelen: length of name
141 * @param qtype: query type (host order).
142 * @param now: current time
143 * @param a: address in delegation point we are examining.
144 * @return an integer that signals the target suitability.
146 * -1: The address should be omitted from the list.
148 * o The address is bogus (DNSSEC validation failure).
149 * o Listed as donotquery
150 * o is ipv6 but no ipv6 support (in operating system).
151 * o is ipv4 but no ipv4 support (in operating system).
153 * Otherwise, an rtt in milliseconds.
154 * 0 .. USEFUL_SERVER_TOP_TIMEOUT-1
155 * The roundtrip time timeout estimate. less than 2 minutes.
156 * Note that util/rtt.c has a MIN_TIMEOUT of 50 msec, thus
157 * values 0 .. 49 are not used, unless that is changed.
158 * USEFUL_SERVER_TOP_TIMEOUT
159 * This value exactly is given for unresponsive blacklisted.
160 * USEFUL_SERVER_TOP_TIMEOUT+1
161 * For non-blacklisted servers: huge timeout, but has traffic.
162 * USEFUL_SERVER_TOP_TIMEOUT*1 ..
163 * parent-side lame servers get this penalty. A dispreferential
164 * server. (lame in delegpt).
165 * USEFUL_SERVER_TOP_TIMEOUT*2 ..
166 * dnsseclame servers get penalty
167 * USEFUL_SERVER_TOP_TIMEOUT*3 ..
168 * recursion lame servers get penalty
169 * UNKNOWN_SERVER_NICENESS
170 * If no information is known about the server, this is
171 * returned. 376 msec or so.
172 * +BLACKLIST_PENALTY (of USEFUL_TOP_TIMEOUT*4) for dnssec failed IPs.
174 * When a final value is chosen that is dnsseclame ; dnsseclameness checking
175 * is turned off (so we do not discard the reply).
176 * When a final value is chosen that is recursionlame; RD bit is set on query.
177 * Because of the numbers this means recursionlame also have dnssec lameness
178 * checking turned off.
181 iter_filter_unsuitable(struct iter_env* iter_env, struct module_env* env,
182 uint8_t* name, size_t namelen, uint16_t qtype, time_t now,
183 struct delegpt_addr* a)
185 int rtt, lame, reclame, dnsseclame;
187 return -1; /* address of server is bogus */
188 if(donotq_lookup(iter_env->donotq, &a->addr, a->addrlen)) {
189 log_addr(VERB_ALGO, "skip addr on the donotquery list",
190 &a->addr, a->addrlen);
191 return -1; /* server is on the donotquery list */
193 if(!iter_env->supports_ipv6 && addr_is_ip6(&a->addr, a->addrlen)) {
194 return -1; /* there is no ip6 available */
196 if(!iter_env->supports_ipv4 && !addr_is_ip6(&a->addr, a->addrlen)) {
197 return -1; /* there is no ip4 available */
199 /* check lameness - need zone , class info */
200 if(infra_get_lame_rtt(env->infra_cache, &a->addr, a->addrlen,
201 name, namelen, qtype, &lame, &dnsseclame, &reclame,
203 log_addr(VERB_ALGO, "servselect", &a->addr, a->addrlen);
204 verbose(VERB_ALGO, " rtt=%d%s%s%s%s", rtt,
206 dnsseclame?" DNSSEC_LAME":"",
207 reclame?" REC_LAME":"",
208 a->lame?" ADDR_LAME":"");
210 return -1; /* server is lame */
211 else if(rtt >= USEFUL_SERVER_TOP_TIMEOUT)
212 /* server is unresponsive,
213 * we used to return TOP_TIMOUT, but fairly useless,
214 * because if == TOP_TIMEOUT is dropped because
215 * blacklisted later, instead, remove it here, so
216 * other choices (that are not blacklisted) can be
219 /* select remainder from worst to best */
221 return rtt+USEFUL_SERVER_TOP_TIMEOUT*3; /* nonpref */
222 else if(dnsseclame || a->dnsseclame)
223 return rtt+USEFUL_SERVER_TOP_TIMEOUT*2; /* nonpref */
225 return rtt+USEFUL_SERVER_TOP_TIMEOUT+1; /* nonpref */
228 /* no server information present */
230 return UNKNOWN_SERVER_NICENESS+USEFUL_SERVER_TOP_TIMEOUT*2; /* nonpref */
232 return USEFUL_SERVER_TOP_TIMEOUT+1+UNKNOWN_SERVER_NICENESS; /* nonpref */
233 return UNKNOWN_SERVER_NICENESS;
236 /** lookup RTT information, and also store fastest rtt (if any) */
238 iter_fill_rtt(struct iter_env* iter_env, struct module_env* env,
239 uint8_t* name, size_t namelen, uint16_t qtype, time_t now,
240 struct delegpt* dp, int* best_rtt, struct sock_list* blacklist)
243 struct delegpt_addr* a;
245 return 0; /* NS bogus, all bogus, nothing found */
246 for(a=dp->result_list; a; a = a->next_result) {
247 a->sel_rtt = iter_filter_unsuitable(iter_env, env,
248 name, namelen, qtype, now, a);
249 if(a->sel_rtt != -1) {
250 if(sock_list_find(blacklist, &a->addr, a->addrlen))
251 a->sel_rtt += BLACKLIST_PENALTY;
254 *best_rtt = a->sel_rtt;
256 } else if(a->sel_rtt < *best_rtt) {
257 *best_rtt = a->sel_rtt;
264 /** filter the addres list, putting best targets at front,
265 * returns number of best targets (or 0, no suitable targets) */
267 iter_filter_order(struct iter_env* iter_env, struct module_env* env,
268 uint8_t* name, size_t namelen, uint16_t qtype, time_t now,
269 struct delegpt* dp, int* selected_rtt, int open_target,
270 struct sock_list* blacklist)
272 int got_num = 0, low_rtt = 0, swap_to_front;
273 struct delegpt_addr* a, *n, *prev=NULL;
275 /* fillup sel_rtt and find best rtt in the bunch */
276 got_num = iter_fill_rtt(iter_env, env, name, namelen, qtype, now, dp,
277 &low_rtt, blacklist);
280 if(low_rtt >= USEFUL_SERVER_TOP_TIMEOUT &&
281 (delegpt_count_missing_targets(dp) > 0 || open_target > 0)) {
282 verbose(VERB_ALGO, "Bad choices, trying to get more choice");
283 return 0; /* we want more choice. The best choice is a bad one.
284 return 0 to force the caller to fetch more */
290 /* skip unsuitable targets */
291 if(a->sel_rtt == -1) {
296 /* classify the server address and determine what to do */
298 if(a->sel_rtt >= low_rtt && a->sel_rtt - low_rtt <= RTT_BAND) {
301 } else if(a->sel_rtt<low_rtt && low_rtt-a->sel_rtt<=RTT_BAND) {
305 /* swap to front if necessary, or move to next result */
306 if(swap_to_front && prev) {
308 prev->next_result = n;
309 a->next_result = dp->result_list;
317 *selected_rtt = low_rtt;
322 iter_server_selection(struct iter_env* iter_env,
323 struct module_env* env, struct delegpt* dp,
324 uint8_t* name, size_t namelen, uint16_t qtype, int* dnssec_lame,
325 int* chase_to_rd, int open_target, struct sock_list* blacklist)
329 struct delegpt_addr* a, *prev;
330 int num = iter_filter_order(iter_env, env, name, namelen, qtype,
331 *env->now, dp, &selrtt, open_target, blacklist);
335 verbose(VERB_ALGO, "selrtt %d", selrtt);
336 if(selrtt > BLACKLIST_PENALTY) {
337 if(selrtt-BLACKLIST_PENALTY > USEFUL_SERVER_TOP_TIMEOUT*3) {
338 verbose(VERB_ALGO, "chase to "
339 "blacklisted recursion lame server");
342 if(selrtt-BLACKLIST_PENALTY > USEFUL_SERVER_TOP_TIMEOUT*2) {
343 verbose(VERB_ALGO, "chase to "
344 "blacklisted dnssec lame server");
348 if(selrtt > USEFUL_SERVER_TOP_TIMEOUT*3) {
349 verbose(VERB_ALGO, "chase to recursion lame server");
352 if(selrtt > USEFUL_SERVER_TOP_TIMEOUT*2) {
353 verbose(VERB_ALGO, "chase to dnssec lame server");
356 if(selrtt == USEFUL_SERVER_TOP_TIMEOUT) {
357 verbose(VERB_ALGO, "chase to blacklisted lame server");
364 if(++a->attempts < OUTBOUND_MSG_RETRY)
366 dp->result_list = a->next_result;
370 /* randomly select a target from the list */
372 /* grab secure random number, to pick unexpected server.
373 * also we need it to be threadsafe. */
374 sel = ub_random_max(env->rnd, num);
377 while(sel > 0 && a) {
382 if(!a) /* robustness */
384 if(++a->attempts < OUTBOUND_MSG_RETRY)
386 /* remove it from the delegation point result list */
388 prev->next_result = a->next_result;
389 else dp->result_list = a->next_result;
394 dns_alloc_msg(sldns_buffer* pkt, struct msg_parse* msg,
395 struct regional* region)
397 struct dns_msg* m = (struct dns_msg*)regional_alloc(region,
398 sizeof(struct dns_msg));
401 memset(m, 0, sizeof(*m));
402 if(!parse_create_msg(pkt, msg, NULL, &m->qinfo, &m->rep, region)) {
403 log_err("malloc failure: allocating incoming dns_msg");
410 dns_copy_msg(struct dns_msg* from, struct regional* region)
412 struct dns_msg* m = (struct dns_msg*)regional_alloc(region,
413 sizeof(struct dns_msg));
416 m->qinfo = from->qinfo;
417 if(!(m->qinfo.qname = regional_alloc_init(region, from->qinfo.qname,
418 from->qinfo.qname_len)))
420 if(!(m->rep = reply_info_copy(from->rep, NULL, region)))
426 iter_dns_store(struct module_env* env, struct query_info* msgqinf,
427 struct reply_info* msgrep, int is_referral, time_t leeway, int pside,
428 struct regional* region, uint16_t flags)
430 if(!dns_cache_store(env, msgqinf, msgrep, is_referral, leeway,
431 pside, region, flags))
432 log_err("out of memory: cannot store data in cache");
436 iter_ns_probability(struct ub_randstate* rnd, int n, int m)
439 if(n == m) /* 100% chance */
441 /* we do not need secure random numbers here, but
442 * we do need it to be threadsafe, so we use this */
443 sel = ub_random_max(rnd, m);
447 /** detect dependency cycle for query and target */
449 causes_cycle(struct module_qstate* qstate, uint8_t* name, size_t namelen,
450 uint16_t t, uint16_t c)
452 struct query_info qinf;
454 qinf.qname_len = namelen;
457 fptr_ok(fptr_whitelist_modenv_detect_cycle(
458 qstate->env->detect_cycle));
459 return (*qstate->env->detect_cycle)(qstate, &qinf,
460 (uint16_t)(BIT_RD|BIT_CD), qstate->is_priming,
465 iter_mark_cycle_targets(struct module_qstate* qstate, struct delegpt* dp)
467 struct delegpt_ns* ns;
468 for(ns = dp->nslist; ns; ns = ns->next) {
471 /* see if this ns as target causes dependency cycle */
472 if(causes_cycle(qstate, ns->name, ns->namelen,
473 LDNS_RR_TYPE_AAAA, qstate->qinfo.qclass) ||
474 causes_cycle(qstate, ns->name, ns->namelen,
475 LDNS_RR_TYPE_A, qstate->qinfo.qclass)) {
476 log_nametypeclass(VERB_QUERY, "skipping target due "
477 "to dependency cycle (harden-glue: no may "
478 "fix some of the cycles)",
479 ns->name, LDNS_RR_TYPE_A,
480 qstate->qinfo.qclass);
487 iter_mark_pside_cycle_targets(struct module_qstate* qstate, struct delegpt* dp)
489 struct delegpt_ns* ns;
490 for(ns = dp->nslist; ns; ns = ns->next) {
491 if(ns->done_pside4 && ns->done_pside6)
493 /* see if this ns as target causes dependency cycle */
494 if(causes_cycle(qstate, ns->name, ns->namelen,
495 LDNS_RR_TYPE_A, qstate->qinfo.qclass)) {
496 log_nametypeclass(VERB_QUERY, "skipping target due "
497 "to dependency cycle", ns->name,
498 LDNS_RR_TYPE_A, qstate->qinfo.qclass);
501 if(causes_cycle(qstate, ns->name, ns->namelen,
502 LDNS_RR_TYPE_AAAA, qstate->qinfo.qclass)) {
503 log_nametypeclass(VERB_QUERY, "skipping target due "
504 "to dependency cycle", ns->name,
505 LDNS_RR_TYPE_AAAA, qstate->qinfo.qclass);
512 iter_dp_is_useless(struct query_info* qinfo, uint16_t qflags,
515 struct delegpt_ns* ns;
518 * o no addresses are provided.
519 * o all NS items are required glue.
522 * o no addresses are provided.
523 * o the query is for one of the nameservers in dp,
524 * and that nameserver is a glue-name for this dp.
528 /* either available or unused targets */
529 if(dp->usable_list || dp->result_list)
532 /* see if query is for one of the nameservers, which is glue */
533 if( (qinfo->qtype == LDNS_RR_TYPE_A ||
534 qinfo->qtype == LDNS_RR_TYPE_AAAA) &&
535 dname_subdomain_c(qinfo->qname, dp->name) &&
536 delegpt_find_ns(dp, qinfo->qname, qinfo->qname_len))
539 for(ns = dp->nslist; ns; ns = ns->next) {
540 if(ns->resolved) /* skip failed targets */
542 if(!dname_subdomain_c(ns->name, dp->name))
543 return 0; /* one address is not required glue */
549 iter_indicates_dnssec(struct module_env* env, struct delegpt* dp,
550 struct dns_msg* msg, uint16_t dclass)
552 struct trust_anchor* a;
553 /* information not available, !env->anchors can be common */
554 if(!env || !env->anchors || !dp || !dp->name)
556 /* a trust anchor exists with this name, RRSIGs expected */
557 if((a=anchor_find(env->anchors, dp->name, dp->namelabs, dp->namelen,
559 lock_basic_unlock(&a->lock);
562 /* see if DS rrset was given, in AUTH section */
563 if(msg && msg->rep &&
564 reply_find_rrset_section_ns(msg->rep, dp->name, dp->namelen,
565 LDNS_RR_TYPE_DS, dclass))
567 /* look in key cache */
569 struct key_entry_key* kk = key_cache_obtain(env->key_cache,
570 dp->name, dp->namelen, dclass, env->scratch, *env->now);
572 if(query_dname_compare(kk->name, dp->name) == 0) {
573 if(key_entry_isgood(kk) || key_entry_isbad(kk)) {
574 regional_free_all(env->scratch);
576 } else if(key_entry_isnull(kk)) {
577 regional_free_all(env->scratch);
581 regional_free_all(env->scratch);
588 iter_msg_has_dnssec(struct dns_msg* msg)
591 if(!msg || !msg->rep)
593 for(i=0; i<msg->rep->an_numrrsets + msg->rep->ns_numrrsets; i++) {
594 if(((struct packed_rrset_data*)msg->rep->rrsets[i]->
595 entry.data)->rrsig_count > 0)
598 /* empty message has no DNSSEC info, with DNSSEC the reply is
599 * not empty (NSEC) */
603 int iter_msg_from_zone(struct dns_msg* msg, struct delegpt* dp,
604 enum response_type type, uint16_t dclass)
606 if(!msg || !dp || !msg->rep || !dp->name)
608 /* SOA RRset - always from reply zone */
609 if(reply_find_rrset_section_an(msg->rep, dp->name, dp->namelen,
610 LDNS_RR_TYPE_SOA, dclass) ||
611 reply_find_rrset_section_ns(msg->rep, dp->name, dp->namelen,
612 LDNS_RR_TYPE_SOA, dclass))
614 if(type == RESPONSE_TYPE_REFERRAL) {
616 /* if it adds a single label, i.e. we expect .com,
617 * and referral to example.com. NS ... , then origin zone
618 * is .com. For a referral to sub.example.com. NS ... then
619 * we do not know, since example.com. may be in between. */
620 for(i=0; i<msg->rep->an_numrrsets+msg->rep->ns_numrrsets;
622 struct ub_packed_rrset_key* s = msg->rep->rrsets[i];
623 if(ntohs(s->rk.type) == LDNS_RR_TYPE_NS &&
624 ntohs(s->rk.rrset_class) == dclass) {
625 int l = dname_count_labels(s->rk.dname);
626 if(l == dp->namelabs + 1 &&
627 dname_strict_subdomain(s->rk.dname,
628 l, dp->name, dp->namelabs))
634 log_assert(type==RESPONSE_TYPE_ANSWER || type==RESPONSE_TYPE_CNAME);
635 /* not a referral, and not lame delegation (upwards), so,
636 * any NS rrset must be from the zone itself */
637 if(reply_find_rrset_section_an(msg->rep, dp->name, dp->namelen,
638 LDNS_RR_TYPE_NS, dclass) ||
639 reply_find_rrset_section_ns(msg->rep, dp->name, dp->namelen,
640 LDNS_RR_TYPE_NS, dclass))
642 /* a DNSKEY set is expected at the zone apex as well */
643 /* this is for 'minimal responses' for DNSKEYs */
644 if(reply_find_rrset_section_an(msg->rep, dp->name, dp->namelen,
645 LDNS_RR_TYPE_DNSKEY, dclass))
651 * check equality of two rrsets
654 * @return true if equal
657 rrset_equal(struct ub_packed_rrset_key* k1, struct ub_packed_rrset_key* k2)
659 struct packed_rrset_data* d1 = (struct packed_rrset_data*)
661 struct packed_rrset_data* d2 = (struct packed_rrset_data*)
664 if(k1->rk.dname_len != k2->rk.dname_len ||
665 k1->rk.flags != k2->rk.flags ||
666 k1->rk.type != k2->rk.type ||
667 k1->rk.rrset_class != k2->rk.rrset_class ||
668 query_dname_compare(k1->rk.dname, k2->rk.dname) != 0)
670 if( /* do not check ttl: d1->ttl != d2->ttl || */
671 d1->count != d2->count ||
672 d1->rrsig_count != d2->rrsig_count ||
673 d1->trust != d2->trust ||
674 d1->security != d2->security)
676 t = d1->count + d1->rrsig_count;
678 if(d1->rr_len[i] != d2->rr_len[i] ||
679 /* no ttl check: d1->rr_ttl[i] != d2->rr_ttl[i] ||*/
680 memcmp(d1->rr_data[i], d2->rr_data[i],
688 reply_equal(struct reply_info* p, struct reply_info* q, struct regional* region)
691 if(p->flags != q->flags ||
692 p->qdcount != q->qdcount ||
693 /* do not check TTL, this may differ */
696 p->prefetch_ttl != q->prefetch_ttl ||
698 p->security != q->security ||
699 p->an_numrrsets != q->an_numrrsets ||
700 p->ns_numrrsets != q->ns_numrrsets ||
701 p->ar_numrrsets != q->ar_numrrsets ||
702 p->rrset_count != q->rrset_count)
704 for(i=0; i<p->rrset_count; i++) {
705 if(!rrset_equal(p->rrsets[i], q->rrsets[i])) {
706 if(!rrset_canonical_equal(region, p->rrsets[i],
708 regional_free_all(region);
711 regional_free_all(region);
718 iter_store_parentside_rrset(struct module_env* env,
719 struct ub_packed_rrset_key* rrset)
721 struct rrset_ref ref;
722 rrset = packed_rrset_copy_alloc(rrset, env->alloc, *env->now);
724 log_err("malloc failure in store_parentside_rrset");
727 rrset->rk.flags |= PACKED_RRSET_PARENT_SIDE;
728 rrset->entry.hash = rrset_key_hash(&rrset->rk);
731 /* ignore ret: if it was in the cache, ref updated */
732 (void)rrset_cache_update(env->rrset_cache, &ref, env->alloc, *env->now);
735 /** fetch NS record from reply, if any */
736 static struct ub_packed_rrset_key*
737 reply_get_NS_rrset(struct reply_info* rep)
740 for(i=0; i<rep->rrset_count; i++) {
741 if(rep->rrsets[i]->rk.type == htons(LDNS_RR_TYPE_NS)) {
742 return rep->rrsets[i];
749 iter_store_parentside_NS(struct module_env* env, struct reply_info* rep)
751 struct ub_packed_rrset_key* rrset = reply_get_NS_rrset(rep);
753 log_rrset_key(VERB_ALGO, "store parent-side NS", rrset);
754 iter_store_parentside_rrset(env, rrset);
758 void iter_store_parentside_neg(struct module_env* env,
759 struct query_info* qinfo, struct reply_info* rep)
761 /* TTL: NS from referral in iq->deleg_msg,
762 * or first RR from iq->response,
763 * or servfail5secs if !iq->response */
764 time_t ttl = NORR_TTL;
765 struct ub_packed_rrset_key* neg;
766 struct packed_rrset_data* newd;
768 struct ub_packed_rrset_key* rrset = reply_get_NS_rrset(rep);
769 if(!rrset && rep->rrset_count != 0) rrset = rep->rrsets[0];
770 if(rrset) ttl = ub_packed_rrset_ttl(rrset);
772 /* create empty rrset to store */
773 neg = (struct ub_packed_rrset_key*)regional_alloc(env->scratch,
774 sizeof(struct ub_packed_rrset_key));
776 log_err("out of memory in store_parentside_neg");
779 memset(&neg->entry, 0, sizeof(neg->entry));
780 neg->entry.key = neg;
781 neg->rk.type = htons(qinfo->qtype);
782 neg->rk.rrset_class = htons(qinfo->qclass);
784 neg->rk.dname = regional_alloc_init(env->scratch, qinfo->qname,
787 log_err("out of memory in store_parentside_neg");
790 neg->rk.dname_len = qinfo->qname_len;
791 neg->entry.hash = rrset_key_hash(&neg->rk);
792 newd = (struct packed_rrset_data*)regional_alloc_zero(env->scratch,
793 sizeof(struct packed_rrset_data) + sizeof(size_t) +
794 sizeof(uint8_t*) + sizeof(time_t) + sizeof(uint16_t));
796 log_err("out of memory in store_parentside_neg");
799 neg->entry.data = newd;
801 /* entry must have one RR, otherwise not valid in cache.
802 * put in one RR with empty rdata: those are ignored as nameserver */
804 newd->rrsig_count = 0;
805 newd->trust = rrset_trust_ans_noAA;
806 newd->rr_len = (size_t*)((uint8_t*)newd +
807 sizeof(struct packed_rrset_data));
808 newd->rr_len[0] = 0 /* zero len rdata */ + sizeof(uint16_t);
809 packed_rrset_ptr_fixup(newd);
810 newd->rr_ttl[0] = newd->ttl;
811 sldns_write_uint16(newd->rr_data[0], 0 /* zero len rdata */);
813 log_rrset_key(VERB_ALGO, "store parent-side negative", neg);
814 iter_store_parentside_rrset(env, neg);
818 iter_lookup_parent_NS_from_cache(struct module_env* env, struct delegpt* dp,
819 struct regional* region, struct query_info* qinfo)
821 struct ub_packed_rrset_key* akey;
822 akey = rrset_cache_lookup(env->rrset_cache, dp->name,
823 dp->namelen, LDNS_RR_TYPE_NS, qinfo->qclass,
824 PACKED_RRSET_PARENT_SIDE, *env->now, 0);
826 log_rrset_key(VERB_ALGO, "found parent-side NS in cache", akey);
827 dp->has_parent_side_NS = 1;
828 /* and mark the new names as lame */
829 if(!delegpt_rrset_add_ns(dp, region, akey, 1)) {
830 lock_rw_unlock(&akey->entry.lock);
833 lock_rw_unlock(&akey->entry.lock);
838 int iter_lookup_parent_glue_from_cache(struct module_env* env,
839 struct delegpt* dp, struct regional* region, struct query_info* qinfo)
841 struct ub_packed_rrset_key* akey;
842 struct delegpt_ns* ns;
843 size_t num = delegpt_count_targets(dp);
844 for(ns = dp->nslist; ns; ns = ns->next) {
845 /* get cached parentside A */
846 akey = rrset_cache_lookup(env->rrset_cache, ns->name,
847 ns->namelen, LDNS_RR_TYPE_A, qinfo->qclass,
848 PACKED_RRSET_PARENT_SIDE, *env->now, 0);
850 log_rrset_key(VERB_ALGO, "found parent-side", akey);
852 /* a negative-cache-element has no addresses it adds */
853 if(!delegpt_add_rrset_A(dp, region, akey, 1))
854 log_err("malloc failure in lookup_parent_glue");
855 lock_rw_unlock(&akey->entry.lock);
857 /* get cached parentside AAAA */
858 akey = rrset_cache_lookup(env->rrset_cache, ns->name,
859 ns->namelen, LDNS_RR_TYPE_AAAA, qinfo->qclass,
860 PACKED_RRSET_PARENT_SIDE, *env->now, 0);
862 log_rrset_key(VERB_ALGO, "found parent-side", akey);
864 /* a negative-cache-element has no addresses it adds */
865 if(!delegpt_add_rrset_AAAA(dp, region, akey, 1))
866 log_err("malloc failure in lookup_parent_glue");
867 lock_rw_unlock(&akey->entry.lock);
870 /* see if new (but lame) addresses have become available */
871 return delegpt_count_targets(dp) != num;
875 iter_get_next_root(struct iter_hints* hints, struct iter_forwards* fwd,
878 uint16_t c1 = *c, c2 = *c;
879 int r1 = hints_next_root(hints, &c1);
880 int r2 = forwards_next_root(fwd, &c2);
881 if(!r1 && !r2) /* got none, end of list */
883 else if(!r1) /* got one, return that */
887 else if(c1 < c2) /* got both take smallest */
894 iter_scrub_ds(struct dns_msg* msg, struct ub_packed_rrset_key* ns, uint8_t* z)
896 /* Only the DS record for the delegation itself is expected.
897 * We allow DS for everything between the bailiwick and the
898 * zonecut, thus DS records must be at or above the zonecut.
899 * And the DS records must be below the server authority zone.
900 * The answer section is already scrubbed. */
901 size_t i = msg->rep->an_numrrsets;
902 while(i < (msg->rep->an_numrrsets + msg->rep->ns_numrrsets)) {
903 struct ub_packed_rrset_key* s = msg->rep->rrsets[i];
904 if(ntohs(s->rk.type) == LDNS_RR_TYPE_DS &&
905 (!ns || !dname_subdomain_c(ns->rk.dname, s->rk.dname)
906 || query_dname_compare(z, s->rk.dname) == 0)) {
907 log_nametypeclass(VERB_ALGO, "removing irrelevant DS",
908 s->rk.dname, ntohs(s->rk.type),
909 ntohs(s->rk.rrset_class));
910 memmove(msg->rep->rrsets+i, msg->rep->rrsets+i+1,
911 sizeof(struct ub_packed_rrset_key*) *
912 (msg->rep->rrset_count-i-1));
913 msg->rep->ns_numrrsets--;
914 msg->rep->rrset_count--;
915 /* stay at same i, but new record */
922 void iter_dec_attempts(struct delegpt* dp, int d)
924 struct delegpt_addr* a;
925 for(a=dp->target_list; a; a = a->next_target) {
926 if(a->attempts >= OUTBOUND_MSG_RETRY) {
927 /* add back to result list */
928 a->next_result = dp->result_list;
933 else a->attempts = 0;
937 void iter_merge_retry_counts(struct delegpt* dp, struct delegpt* old)
939 struct delegpt_addr* a, *o, *prev;
940 for(a=dp->target_list; a; a = a->next_target) {
941 o = delegpt_find_addr(old, &a->addr, a->addrlen);
943 log_addr(VERB_ALGO, "copy attempt count previous dp",
944 &a->addr, a->addrlen);
945 a->attempts = o->attempts;
951 if(a->attempts >= OUTBOUND_MSG_RETRY) {
952 log_addr(VERB_ALGO, "remove from usable list dp",
953 &a->addr, a->addrlen);
954 /* remove from result list */
956 prev->next_usable = a->next_usable;
957 else dp->usable_list = a->next_usable;
958 /* prev stays the same */
968 iter_ds_toolow(struct dns_msg* msg, struct delegpt* dp)
970 /* if for query example.com, there is example.com SOA or a subdomain
971 * of example.com, then we are too low and need to fetch NS. */
973 /* if we have a DNAME or CNAME we are probably wrong */
974 /* if we have a qtype DS in the answer section, its fine */
975 for(i=0; i < msg->rep->an_numrrsets; i++) {
976 struct ub_packed_rrset_key* s = msg->rep->rrsets[i];
977 if(ntohs(s->rk.type) == LDNS_RR_TYPE_DNAME ||
978 ntohs(s->rk.type) == LDNS_RR_TYPE_CNAME) {
979 /* not the right answer, maybe too low, check the
980 * RRSIG signer name (if there is any) for a hint
981 * that it is from the dp zone anyway */
984 val_find_rrset_signer(s, &sname, &slen);
985 if(sname && query_dname_compare(dp->name, sname)==0)
986 return 0; /* it is fine, from the right dp */
989 if(ntohs(s->rk.type) == LDNS_RR_TYPE_DS)
990 return 0; /* fine, we have a DS record */
992 for(i=msg->rep->an_numrrsets;
993 i < msg->rep->an_numrrsets + msg->rep->ns_numrrsets; i++) {
994 struct ub_packed_rrset_key* s = msg->rep->rrsets[i];
995 if(ntohs(s->rk.type) == LDNS_RR_TYPE_SOA) {
996 if(dname_subdomain_c(s->rk.dname, msg->qinfo.qname))
997 return 1; /* point is too low */
998 if(query_dname_compare(s->rk.dname, dp->name)==0)
999 return 0; /* right dp */
1001 if(ntohs(s->rk.type) == LDNS_RR_TYPE_NSEC ||
1002 ntohs(s->rk.type) == LDNS_RR_TYPE_NSEC3) {
1005 val_find_rrset_signer(s, &sname, &slen);
1006 if(sname && query_dname_compare(dp->name, sname)==0)
1007 return 0; /* it is fine, from the right dp */
1011 /* we do not know */
1015 int iter_dp_cangodown(struct query_info* qinfo, struct delegpt* dp)
1017 /* no delegation point, do not see how we can go down,
1018 * robust check, it should really exist */
1021 /* see if dp equals the qname, then we cannot go down further */
1022 if(query_dname_compare(qinfo->qname, dp->name) == 0)
1024 /* if dp is one label above the name we also cannot go down further */
1025 if(dname_count_labels(qinfo->qname) == dp->namelabs+1)