iter_utils.c revision 1.8
1/* 2 * iterator/iter_utils.c - iterative resolver module utility functions. 3 * 4 * Copyright (c) 2007, NLnet Labs. All rights reserved. 5 * 6 * This software is open source. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 12 * Redistributions of source code must retain the above copyright notice, 13 * this list of conditions and the following disclaimer. 14 * 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. 18 * 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. 22 * 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. 34 */ 35 36/** 37 * \file 38 * 39 * This file contains functions to assist the iterator module. 40 * Configuration options. Forward zones. 41 */ 42#include "config.h" 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" 55#include "util/log.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 "sldns/sbuffer.h" 68#include "sldns/str2wire.h" 69 70/** time when nameserver glue is said to be 'recent' */ 71#define SUSPICION_RECENT_EXPIRY 86400 72/** penalty to validation failed blacklisted IPs */ 73#define BLACKLIST_PENALTY (USEFUL_SERVER_TOP_TIMEOUT*4) 74 75/** fillup fetch policy array */ 76static void 77fetch_fill(struct iter_env* ie, const char* str) 78{ 79 char* s = (char*)str, *e; 80 int i; 81 for(i=0; i<ie->max_dependency_depth+1; i++) { 82 ie->target_fetch_policy[i] = strtol(s, &e, 10); 83 if(s == e) 84 fatal_exit("cannot parse fetch policy number %s", s); 85 s = e; 86 } 87} 88 89/** Read config string that represents the target fetch policy */ 90static int 91read_fetch_policy(struct iter_env* ie, const char* str) 92{ 93 int count = cfg_count_numbers(str); 94 if(count < 1) { 95 log_err("Cannot parse target fetch policy: \"%s\"", str); 96 return 0; 97 } 98 ie->max_dependency_depth = count - 1; 99 ie->target_fetch_policy = (int*)calloc( 100 (size_t)ie->max_dependency_depth+1, sizeof(int)); 101 if(!ie->target_fetch_policy) { 102 log_err("alloc fetch policy: out of memory"); 103 return 0; 104 } 105 fetch_fill(ie, str); 106 return 1; 107} 108 109/** apply config caps whitelist items to name tree */ 110static int 111caps_white_apply_cfg(rbtree_type* ntree, struct config_file* cfg) 112{ 113 struct config_strlist* p; 114 for(p=cfg->caps_whitelist; p; p=p->next) { 115 struct name_tree_node* n; 116 size_t len; 117 uint8_t* nm = sldns_str2wire_dname(p->str, &len); 118 if(!nm) { 119 log_err("could not parse %s", p->str); 120 return 0; 121 } 122 n = (struct name_tree_node*)calloc(1, sizeof(*n)); 123 if(!n) { 124 log_err("out of memory"); 125 free(nm); 126 return 0; 127 } 128 n->node.key = n; 129 n->name = nm; 130 n->len = len; 131 n->labs = dname_count_labels(nm); 132 n->dclass = LDNS_RR_CLASS_IN; 133 if(!name_tree_insert(ntree, n, nm, len, n->labs, n->dclass)) { 134 /* duplicate element ignored, idempotent */ 135 free(n->name); 136 free(n); 137 } 138 } 139 name_tree_init_parents(ntree); 140 return 1; 141} 142 143int 144iter_apply_cfg(struct iter_env* iter_env, struct config_file* cfg) 145{ 146 int i; 147 /* target fetch policy */ 148 if(!read_fetch_policy(iter_env, cfg->target_fetch_policy)) 149 return 0; 150 for(i=0; i<iter_env->max_dependency_depth+1; i++) 151 verbose(VERB_QUERY, "target fetch policy for level %d is %d", 152 i, iter_env->target_fetch_policy[i]); 153 154 if(!iter_env->donotq) 155 iter_env->donotq = donotq_create(); 156 if(!iter_env->donotq || !donotq_apply_cfg(iter_env->donotq, cfg)) { 157 log_err("Could not set donotqueryaddresses"); 158 return 0; 159 } 160 if(!iter_env->priv) 161 iter_env->priv = priv_create(); 162 if(!iter_env->priv || !priv_apply_cfg(iter_env->priv, cfg)) { 163 log_err("Could not set private addresses"); 164 return 0; 165 } 166 if(cfg->caps_whitelist) { 167 if(!iter_env->caps_white) 168 iter_env->caps_white = rbtree_create(name_tree_compare); 169 if(!iter_env->caps_white || !caps_white_apply_cfg( 170 iter_env->caps_white, cfg)) { 171 log_err("Could not set capsforid whitelist"); 172 return 0; 173 } 174 175 } 176 iter_env->supports_ipv6 = cfg->do_ip6; 177 iter_env->supports_ipv4 = cfg->do_ip4; 178 return 1; 179} 180 181/** filter out unsuitable targets 182 * @param iter_env: iterator environment with ipv6-support flag. 183 * @param env: module environment with infra cache. 184 * @param name: zone name 185 * @param namelen: length of name 186 * @param qtype: query type (host order). 187 * @param now: current time 188 * @param a: address in delegation point we are examining. 189 * @return an integer that signals the target suitability. 190 * as follows: 191 * -1: The address should be omitted from the list. 192 * Because: 193 * o The address is bogus (DNSSEC validation failure). 194 * o Listed as donotquery 195 * o is ipv6 but no ipv6 support (in operating system). 196 * o is ipv4 but no ipv4 support (in operating system). 197 * o is lame 198 * Otherwise, an rtt in milliseconds. 199 * 0 .. USEFUL_SERVER_TOP_TIMEOUT-1 200 * The roundtrip time timeout estimate. less than 2 minutes. 201 * Note that util/rtt.c has a MIN_TIMEOUT of 50 msec, thus 202 * values 0 .. 49 are not used, unless that is changed. 203 * USEFUL_SERVER_TOP_TIMEOUT 204 * This value exactly is given for unresponsive blacklisted. 205 * USEFUL_SERVER_TOP_TIMEOUT+1 206 * For non-blacklisted servers: huge timeout, but has traffic. 207 * USEFUL_SERVER_TOP_TIMEOUT*1 .. 208 * parent-side lame servers get this penalty. A dispreferential 209 * server. (lame in delegpt). 210 * USEFUL_SERVER_TOP_TIMEOUT*2 .. 211 * dnsseclame servers get penalty 212 * USEFUL_SERVER_TOP_TIMEOUT*3 .. 213 * recursion lame servers get penalty 214 * UNKNOWN_SERVER_NICENESS 215 * If no information is known about the server, this is 216 * returned. 376 msec or so. 217 * +BLACKLIST_PENALTY (of USEFUL_TOP_TIMEOUT*4) for dnssec failed IPs. 218 * 219 * When a final value is chosen that is dnsseclame ; dnsseclameness checking 220 * is turned off (so we do not discard the reply). 221 * When a final value is chosen that is recursionlame; RD bit is set on query. 222 * Because of the numbers this means recursionlame also have dnssec lameness 223 * checking turned off. 224 */ 225static int 226iter_filter_unsuitable(struct iter_env* iter_env, struct module_env* env, 227 uint8_t* name, size_t namelen, uint16_t qtype, time_t now, 228 struct delegpt_addr* a) 229{ 230 int rtt, lame, reclame, dnsseclame; 231 if(a->bogus) 232 return -1; /* address of server is bogus */ 233 if(donotq_lookup(iter_env->donotq, &a->addr, a->addrlen)) { 234 log_addr(VERB_ALGO, "skip addr on the donotquery list", 235 &a->addr, a->addrlen); 236 return -1; /* server is on the donotquery list */ 237 } 238 if(!iter_env->supports_ipv6 && addr_is_ip6(&a->addr, a->addrlen)) { 239 return -1; /* there is no ip6 available */ 240 } 241 if(!iter_env->supports_ipv4 && !addr_is_ip6(&a->addr, a->addrlen)) { 242 return -1; /* there is no ip4 available */ 243 } 244 /* check lameness - need zone , class info */ 245 if(infra_get_lame_rtt(env->infra_cache, &a->addr, a->addrlen, 246 name, namelen, qtype, &lame, &dnsseclame, &reclame, 247 &rtt, now)) { 248 log_addr(VERB_ALGO, "servselect", &a->addr, a->addrlen); 249 verbose(VERB_ALGO, " rtt=%d%s%s%s%s", rtt, 250 lame?" LAME":"", 251 dnsseclame?" DNSSEC_LAME":"", 252 reclame?" REC_LAME":"", 253 a->lame?" ADDR_LAME":""); 254 if(lame) 255 return -1; /* server is lame */ 256 else if(rtt >= USEFUL_SERVER_TOP_TIMEOUT) 257 /* server is unresponsive, 258 * we used to return TOP_TIMEOUT, but fairly useless, 259 * because if == TOP_TIMEOUT is dropped because 260 * blacklisted later, instead, remove it here, so 261 * other choices (that are not blacklisted) can be 262 * tried */ 263 return -1; 264 /* select remainder from worst to best */ 265 else if(reclame) 266 return rtt+USEFUL_SERVER_TOP_TIMEOUT*3; /* nonpref */ 267 else if(dnsseclame || a->dnsseclame) 268 return rtt+USEFUL_SERVER_TOP_TIMEOUT*2; /* nonpref */ 269 else if(a->lame) 270 return rtt+USEFUL_SERVER_TOP_TIMEOUT+1; /* nonpref */ 271 else return rtt; 272 } 273 /* no server information present */ 274 if(a->dnsseclame) 275 return UNKNOWN_SERVER_NICENESS+USEFUL_SERVER_TOP_TIMEOUT*2; /* nonpref */ 276 else if(a->lame) 277 return USEFUL_SERVER_TOP_TIMEOUT+1+UNKNOWN_SERVER_NICENESS; /* nonpref */ 278 return UNKNOWN_SERVER_NICENESS; 279} 280 281/** lookup RTT information, and also store fastest rtt (if any) */ 282static int 283iter_fill_rtt(struct iter_env* iter_env, struct module_env* env, 284 uint8_t* name, size_t namelen, uint16_t qtype, time_t now, 285 struct delegpt* dp, int* best_rtt, struct sock_list* blacklist) 286{ 287 int got_it = 0; 288 struct delegpt_addr* a; 289 if(dp->bogus) 290 return 0; /* NS bogus, all bogus, nothing found */ 291 for(a=dp->result_list; a; a = a->next_result) { 292 a->sel_rtt = iter_filter_unsuitable(iter_env, env, 293 name, namelen, qtype, now, a); 294 if(a->sel_rtt != -1) { 295 if(sock_list_find(blacklist, &a->addr, a->addrlen)) 296 a->sel_rtt += BLACKLIST_PENALTY; 297 298 if(!got_it) { 299 *best_rtt = a->sel_rtt; 300 got_it = 1; 301 } else if(a->sel_rtt < *best_rtt) { 302 *best_rtt = a->sel_rtt; 303 } 304 } 305 } 306 return got_it; 307} 308 309/** filter the address list, putting best targets at front, 310 * returns number of best targets (or 0, no suitable targets) */ 311static int 312iter_filter_order(struct iter_env* iter_env, struct module_env* env, 313 uint8_t* name, size_t namelen, uint16_t qtype, time_t now, 314 struct delegpt* dp, int* selected_rtt, int open_target, 315 struct sock_list* blacklist) 316{ 317 int got_num = 0, low_rtt = 0, swap_to_front; 318 struct delegpt_addr* a, *n, *prev=NULL; 319 320 /* fillup sel_rtt and find best rtt in the bunch */ 321 got_num = iter_fill_rtt(iter_env, env, name, namelen, qtype, now, dp, 322 &low_rtt, blacklist); 323 if(got_num == 0) 324 return 0; 325 if(low_rtt >= USEFUL_SERVER_TOP_TIMEOUT && 326 (delegpt_count_missing_targets(dp) > 0 || open_target > 0)) { 327 verbose(VERB_ALGO, "Bad choices, trying to get more choice"); 328 return 0; /* we want more choice. The best choice is a bad one. 329 return 0 to force the caller to fetch more */ 330 } 331 332 got_num = 0; 333 a = dp->result_list; 334 while(a) { 335 /* skip unsuitable targets */ 336 if(a->sel_rtt == -1) { 337 prev = a; 338 a = a->next_result; 339 continue; 340 } 341 /* classify the server address and determine what to do */ 342 swap_to_front = 0; 343 if(a->sel_rtt >= low_rtt && a->sel_rtt - low_rtt <= RTT_BAND) { 344 got_num++; 345 swap_to_front = 1; 346 } else if(a->sel_rtt<low_rtt && low_rtt-a->sel_rtt<=RTT_BAND) { 347 got_num++; 348 swap_to_front = 1; 349 } 350 /* swap to front if necessary, or move to next result */ 351 if(swap_to_front && prev) { 352 n = a->next_result; 353 prev->next_result = n; 354 a->next_result = dp->result_list; 355 dp->result_list = a; 356 a = n; 357 } else { 358 prev = a; 359 a = a->next_result; 360 } 361 } 362 *selected_rtt = low_rtt; 363 364 if (env->cfg->prefer_ip6) { 365 int got_num6 = 0; 366 int low_rtt6 = 0; 367 int i; 368 prev = NULL; 369 a = dp->result_list; 370 for(i = 0; i < got_num; i++) { 371 swap_to_front = 0; 372 if(a->addr.ss_family == AF_INET6) { 373 got_num6++; 374 swap_to_front = 1; 375 if(low_rtt6 == 0 || a->sel_rtt < low_rtt6) { 376 low_rtt6 = a->sel_rtt; 377 } 378 } 379 /* swap to front if IPv6, or move to next result */ 380 if(swap_to_front && prev) { 381 n = a->next_result; 382 prev->next_result = n; 383 a->next_result = dp->result_list; 384 dp->result_list = a; 385 a = n; 386 } else { 387 prev = a; 388 a = a->next_result; 389 } 390 } 391 if(got_num6 > 0) { 392 got_num = got_num6; 393 *selected_rtt = low_rtt6; 394 } 395 } 396 return got_num; 397} 398 399struct delegpt_addr* 400iter_server_selection(struct iter_env* iter_env, 401 struct module_env* env, struct delegpt* dp, 402 uint8_t* name, size_t namelen, uint16_t qtype, int* dnssec_lame, 403 int* chase_to_rd, int open_target, struct sock_list* blacklist) 404{ 405 int sel; 406 int selrtt; 407 struct delegpt_addr* a, *prev; 408 int num = iter_filter_order(iter_env, env, name, namelen, qtype, 409 *env->now, dp, &selrtt, open_target, blacklist); 410 411 if(num == 0) 412 return NULL; 413 verbose(VERB_ALGO, "selrtt %d", selrtt); 414 if(selrtt > BLACKLIST_PENALTY) { 415 if(selrtt-BLACKLIST_PENALTY > USEFUL_SERVER_TOP_TIMEOUT*3) { 416 verbose(VERB_ALGO, "chase to " 417 "blacklisted recursion lame server"); 418 *chase_to_rd = 1; 419 } 420 if(selrtt-BLACKLIST_PENALTY > USEFUL_SERVER_TOP_TIMEOUT*2) { 421 verbose(VERB_ALGO, "chase to " 422 "blacklisted dnssec lame server"); 423 *dnssec_lame = 1; 424 } 425 } else { 426 if(selrtt > USEFUL_SERVER_TOP_TIMEOUT*3) { 427 verbose(VERB_ALGO, "chase to recursion lame server"); 428 *chase_to_rd = 1; 429 } 430 if(selrtt > USEFUL_SERVER_TOP_TIMEOUT*2) { 431 verbose(VERB_ALGO, "chase to dnssec lame server"); 432 *dnssec_lame = 1; 433 } 434 if(selrtt == USEFUL_SERVER_TOP_TIMEOUT) { 435 verbose(VERB_ALGO, "chase to blacklisted lame server"); 436 return NULL; 437 } 438 } 439 440 if(num == 1) { 441 a = dp->result_list; 442 if(++a->attempts < OUTBOUND_MSG_RETRY) 443 return a; 444 dp->result_list = a->next_result; 445 return a; 446 } 447 448 /* randomly select a target from the list */ 449 log_assert(num > 1); 450 /* grab secure random number, to pick unexpected server. 451 * also we need it to be threadsafe. */ 452 sel = ub_random_max(env->rnd, num); 453 a = dp->result_list; 454 prev = NULL; 455 while(sel > 0 && a) { 456 prev = a; 457 a = a->next_result; 458 sel--; 459 } 460 if(!a) /* robustness */ 461 return NULL; 462 if(++a->attempts < OUTBOUND_MSG_RETRY) 463 return a; 464 /* remove it from the delegation point result list */ 465 if(prev) 466 prev->next_result = a->next_result; 467 else dp->result_list = a->next_result; 468 return a; 469} 470 471struct dns_msg* 472dns_alloc_msg(sldns_buffer* pkt, struct msg_parse* msg, 473 struct regional* region) 474{ 475 struct dns_msg* m = (struct dns_msg*)regional_alloc(region, 476 sizeof(struct dns_msg)); 477 if(!m) 478 return NULL; 479 memset(m, 0, sizeof(*m)); 480 if(!parse_create_msg(pkt, msg, NULL, &m->qinfo, &m->rep, region)) { 481 log_err("malloc failure: allocating incoming dns_msg"); 482 return NULL; 483 } 484 return m; 485} 486 487struct dns_msg* 488dns_copy_msg(struct dns_msg* from, struct regional* region) 489{ 490 struct dns_msg* m = (struct dns_msg*)regional_alloc(region, 491 sizeof(struct dns_msg)); 492 if(!m) 493 return NULL; 494 m->qinfo = from->qinfo; 495 if(!(m->qinfo.qname = regional_alloc_init(region, from->qinfo.qname, 496 from->qinfo.qname_len))) 497 return NULL; 498 if(!(m->rep = reply_info_copy(from->rep, NULL, region))) 499 return NULL; 500 return m; 501} 502 503void 504iter_dns_store(struct module_env* env, struct query_info* msgqinf, 505 struct reply_info* msgrep, int is_referral, time_t leeway, int pside, 506 struct regional* region, uint16_t flags) 507{ 508 if(!dns_cache_store(env, msgqinf, msgrep, is_referral, leeway, 509 pside, region, flags)) 510 log_err("out of memory: cannot store data in cache"); 511} 512 513int 514iter_ns_probability(struct ub_randstate* rnd, int n, int m) 515{ 516 int sel; 517 if(n == m) /* 100% chance */ 518 return 1; 519 /* we do not need secure random numbers here, but 520 * we do need it to be threadsafe, so we use this */ 521 sel = ub_random_max(rnd, m); 522 return (sel < n); 523} 524 525/** detect dependency cycle for query and target */ 526static int 527causes_cycle(struct module_qstate* qstate, uint8_t* name, size_t namelen, 528 uint16_t t, uint16_t c) 529{ 530 struct query_info qinf; 531 qinf.qname = name; 532 qinf.qname_len = namelen; 533 qinf.qtype = t; 534 qinf.qclass = c; 535 qinf.local_alias = NULL; 536 fptr_ok(fptr_whitelist_modenv_detect_cycle( 537 qstate->env->detect_cycle)); 538 return (*qstate->env->detect_cycle)(qstate, &qinf, 539 (uint16_t)(BIT_RD|BIT_CD), qstate->is_priming, 540 qstate->is_valrec); 541} 542 543void 544iter_mark_cycle_targets(struct module_qstate* qstate, struct delegpt* dp) 545{ 546 struct delegpt_ns* ns; 547 for(ns = dp->nslist; ns; ns = ns->next) { 548 if(ns->resolved) 549 continue; 550 /* see if this ns as target causes dependency cycle */ 551 if(causes_cycle(qstate, ns->name, ns->namelen, 552 LDNS_RR_TYPE_AAAA, qstate->qinfo.qclass) || 553 causes_cycle(qstate, ns->name, ns->namelen, 554 LDNS_RR_TYPE_A, qstate->qinfo.qclass)) { 555 log_nametypeclass(VERB_QUERY, "skipping target due " 556 "to dependency cycle (harden-glue: no may " 557 "fix some of the cycles)", 558 ns->name, LDNS_RR_TYPE_A, 559 qstate->qinfo.qclass); 560 ns->resolved = 1; 561 } 562 } 563} 564 565void 566iter_mark_pside_cycle_targets(struct module_qstate* qstate, struct delegpt* dp) 567{ 568 struct delegpt_ns* ns; 569 for(ns = dp->nslist; ns; ns = ns->next) { 570 if(ns->done_pside4 && ns->done_pside6) 571 continue; 572 /* see if this ns as target causes dependency cycle */ 573 if(causes_cycle(qstate, ns->name, ns->namelen, 574 LDNS_RR_TYPE_A, qstate->qinfo.qclass)) { 575 log_nametypeclass(VERB_QUERY, "skipping target due " 576 "to dependency cycle", ns->name, 577 LDNS_RR_TYPE_A, qstate->qinfo.qclass); 578 ns->done_pside4 = 1; 579 } 580 if(causes_cycle(qstate, ns->name, ns->namelen, 581 LDNS_RR_TYPE_AAAA, qstate->qinfo.qclass)) { 582 log_nametypeclass(VERB_QUERY, "skipping target due " 583 "to dependency cycle", ns->name, 584 LDNS_RR_TYPE_AAAA, qstate->qinfo.qclass); 585 ns->done_pside6 = 1; 586 } 587 } 588} 589 590int 591iter_dp_is_useless(struct query_info* qinfo, uint16_t qflags, 592 struct delegpt* dp) 593{ 594 struct delegpt_ns* ns; 595 /* check: 596 * o RD qflag is on. 597 * o no addresses are provided. 598 * o all NS items are required glue. 599 * OR 600 * o RD qflag is on. 601 * o no addresses are provided. 602 * o the query is for one of the nameservers in dp, 603 * and that nameserver is a glue-name for this dp. 604 */ 605 if(!(qflags&BIT_RD)) 606 return 0; 607 /* either available or unused targets */ 608 if(dp->usable_list || dp->result_list) 609 return 0; 610 611 /* see if query is for one of the nameservers, which is glue */ 612 if( (qinfo->qtype == LDNS_RR_TYPE_A || 613 qinfo->qtype == LDNS_RR_TYPE_AAAA) && 614 dname_subdomain_c(qinfo->qname, dp->name) && 615 delegpt_find_ns(dp, qinfo->qname, qinfo->qname_len)) 616 return 1; 617 618 for(ns = dp->nslist; ns; ns = ns->next) { 619 if(ns->resolved) /* skip failed targets */ 620 continue; 621 if(!dname_subdomain_c(ns->name, dp->name)) 622 return 0; /* one address is not required glue */ 623 } 624 return 1; 625} 626 627int 628iter_indicates_dnssec_fwd(struct module_env* env, struct query_info *qinfo) 629{ 630 struct trust_anchor* a; 631 if(!env || !env->anchors || !qinfo || !qinfo->qname) 632 return 0; 633 /* a trust anchor exists above the name? */ 634 if((a=anchors_lookup(env->anchors, qinfo->qname, qinfo->qname_len, 635 qinfo->qclass))) { 636 if(a->numDS == 0 && a->numDNSKEY == 0) { 637 /* insecure trust point */ 638 lock_basic_unlock(&a->lock); 639 return 0; 640 } 641 lock_basic_unlock(&a->lock); 642 return 1; 643 } 644 /* no trust anchor above it. */ 645 return 0; 646} 647 648int 649iter_indicates_dnssec(struct module_env* env, struct delegpt* dp, 650 struct dns_msg* msg, uint16_t dclass) 651{ 652 struct trust_anchor* a; 653 /* information not available, !env->anchors can be common */ 654 if(!env || !env->anchors || !dp || !dp->name) 655 return 0; 656 /* a trust anchor exists with this name, RRSIGs expected */ 657 if((a=anchor_find(env->anchors, dp->name, dp->namelabs, dp->namelen, 658 dclass))) { 659 if(a->numDS == 0 && a->numDNSKEY == 0) { 660 /* insecure trust point */ 661 lock_basic_unlock(&a->lock); 662 return 0; 663 } 664 lock_basic_unlock(&a->lock); 665 return 1; 666 } 667 /* see if DS rrset was given, in AUTH section */ 668 if(msg && msg->rep && 669 reply_find_rrset_section_ns(msg->rep, dp->name, dp->namelen, 670 LDNS_RR_TYPE_DS, dclass)) 671 return 1; 672 /* look in key cache */ 673 if(env->key_cache) { 674 struct key_entry_key* kk = key_cache_obtain(env->key_cache, 675 dp->name, dp->namelen, dclass, env->scratch, *env->now); 676 if(kk) { 677 if(query_dname_compare(kk->name, dp->name) == 0) { 678 if(key_entry_isgood(kk) || key_entry_isbad(kk)) { 679 regional_free_all(env->scratch); 680 return 1; 681 } else if(key_entry_isnull(kk)) { 682 regional_free_all(env->scratch); 683 return 0; 684 } 685 } 686 regional_free_all(env->scratch); 687 } 688 } 689 return 0; 690} 691 692int 693iter_msg_has_dnssec(struct dns_msg* msg) 694{ 695 size_t i; 696 if(!msg || !msg->rep) 697 return 0; 698 for(i=0; i<msg->rep->an_numrrsets + msg->rep->ns_numrrsets; i++) { 699 if(((struct packed_rrset_data*)msg->rep->rrsets[i]-> 700 entry.data)->rrsig_count > 0) 701 return 1; 702 } 703 /* empty message has no DNSSEC info, with DNSSEC the reply is 704 * not empty (NSEC) */ 705 return 0; 706} 707 708int iter_msg_from_zone(struct dns_msg* msg, struct delegpt* dp, 709 enum response_type type, uint16_t dclass) 710{ 711 if(!msg || !dp || !msg->rep || !dp->name) 712 return 0; 713 /* SOA RRset - always from reply zone */ 714 if(reply_find_rrset_section_an(msg->rep, dp->name, dp->namelen, 715 LDNS_RR_TYPE_SOA, dclass) || 716 reply_find_rrset_section_ns(msg->rep, dp->name, dp->namelen, 717 LDNS_RR_TYPE_SOA, dclass)) 718 return 1; 719 if(type == RESPONSE_TYPE_REFERRAL) { 720 size_t i; 721 /* if it adds a single label, i.e. we expect .com, 722 * and referral to example.com. NS ... , then origin zone 723 * is .com. For a referral to sub.example.com. NS ... then 724 * we do not know, since example.com. may be in between. */ 725 for(i=0; i<msg->rep->an_numrrsets+msg->rep->ns_numrrsets; 726 i++) { 727 struct ub_packed_rrset_key* s = msg->rep->rrsets[i]; 728 if(ntohs(s->rk.type) == LDNS_RR_TYPE_NS && 729 ntohs(s->rk.rrset_class) == dclass) { 730 int l = dname_count_labels(s->rk.dname); 731 if(l == dp->namelabs + 1 && 732 dname_strict_subdomain(s->rk.dname, 733 l, dp->name, dp->namelabs)) 734 return 1; 735 } 736 } 737 return 0; 738 } 739 log_assert(type==RESPONSE_TYPE_ANSWER || type==RESPONSE_TYPE_CNAME); 740 /* not a referral, and not lame delegation (upwards), so, 741 * any NS rrset must be from the zone itself */ 742 if(reply_find_rrset_section_an(msg->rep, dp->name, dp->namelen, 743 LDNS_RR_TYPE_NS, dclass) || 744 reply_find_rrset_section_ns(msg->rep, dp->name, dp->namelen, 745 LDNS_RR_TYPE_NS, dclass)) 746 return 1; 747 /* a DNSKEY set is expected at the zone apex as well */ 748 /* this is for 'minimal responses' for DNSKEYs */ 749 if(reply_find_rrset_section_an(msg->rep, dp->name, dp->namelen, 750 LDNS_RR_TYPE_DNSKEY, dclass)) 751 return 1; 752 return 0; 753} 754 755/** 756 * check equality of two rrsets 757 * @param k1: rrset 758 * @param k2: rrset 759 * @return true if equal 760 */ 761static int 762rrset_equal(struct ub_packed_rrset_key* k1, struct ub_packed_rrset_key* k2) 763{ 764 struct packed_rrset_data* d1 = (struct packed_rrset_data*) 765 k1->entry.data; 766 struct packed_rrset_data* d2 = (struct packed_rrset_data*) 767 k2->entry.data; 768 size_t i, t; 769 if(k1->rk.dname_len != k2->rk.dname_len || 770 k1->rk.flags != k2->rk.flags || 771 k1->rk.type != k2->rk.type || 772 k1->rk.rrset_class != k2->rk.rrset_class || 773 query_dname_compare(k1->rk.dname, k2->rk.dname) != 0) 774 return 0; 775 if( /* do not check ttl: d1->ttl != d2->ttl || */ 776 d1->count != d2->count || 777 d1->rrsig_count != d2->rrsig_count || 778 d1->trust != d2->trust || 779 d1->security != d2->security) 780 return 0; 781 t = d1->count + d1->rrsig_count; 782 for(i=0; i<t; i++) { 783 if(d1->rr_len[i] != d2->rr_len[i] || 784 /* no ttl check: d1->rr_ttl[i] != d2->rr_ttl[i] ||*/ 785 memcmp(d1->rr_data[i], d2->rr_data[i], 786 d1->rr_len[i]) != 0) 787 return 0; 788 } 789 return 1; 790} 791 792int 793reply_equal(struct reply_info* p, struct reply_info* q, struct regional* region) 794{ 795 size_t i; 796 if(p->flags != q->flags || 797 p->qdcount != q->qdcount || 798 /* do not check TTL, this may differ */ 799 /* 800 p->ttl != q->ttl || 801 p->prefetch_ttl != q->prefetch_ttl || 802 */ 803 p->security != q->security || 804 p->an_numrrsets != q->an_numrrsets || 805 p->ns_numrrsets != q->ns_numrrsets || 806 p->ar_numrrsets != q->ar_numrrsets || 807 p->rrset_count != q->rrset_count) 808 return 0; 809 for(i=0; i<p->rrset_count; i++) { 810 if(!rrset_equal(p->rrsets[i], q->rrsets[i])) { 811 if(!rrset_canonical_equal(region, p->rrsets[i], 812 q->rrsets[i])) { 813 regional_free_all(region); 814 return 0; 815 } 816 regional_free_all(region); 817 } 818 } 819 return 1; 820} 821 822void 823caps_strip_reply(struct reply_info* rep) 824{ 825 size_t i; 826 if(!rep) return; 827 /* see if message is a referral, in which case the additional and 828 * NS record cannot be removed */ 829 /* referrals have the AA flag unset (strict check, not elsewhere in 830 * unbound, but for 0x20 this is very convenient). */ 831 if(!(rep->flags&BIT_AA)) 832 return; 833 /* remove the additional section from the reply */ 834 if(rep->ar_numrrsets != 0) { 835 verbose(VERB_ALGO, "caps fallback: removing additional section"); 836 rep->rrset_count -= rep->ar_numrrsets; 837 rep->ar_numrrsets = 0; 838 } 839 /* is there an NS set in the authority section to remove? */ 840 /* the failure case (Cisco firewalls) only has one rrset in authsec */ 841 for(i=rep->an_numrrsets; i<rep->an_numrrsets+rep->ns_numrrsets; i++) { 842 struct ub_packed_rrset_key* s = rep->rrsets[i]; 843 if(ntohs(s->rk.type) == LDNS_RR_TYPE_NS) { 844 /* remove NS rrset and break from loop (loop limits 845 * have changed) */ 846 /* move last rrset into this position (there is no 847 * additional section any more) */ 848 verbose(VERB_ALGO, "caps fallback: removing NS rrset"); 849 if(i < rep->rrset_count-1) 850 rep->rrsets[i]=rep->rrsets[rep->rrset_count-1]; 851 rep->rrset_count --; 852 rep->ns_numrrsets --; 853 break; 854 } 855 } 856} 857 858int caps_failed_rcode(struct reply_info* rep) 859{ 860 return !(FLAGS_GET_RCODE(rep->flags) == LDNS_RCODE_NOERROR || 861 FLAGS_GET_RCODE(rep->flags) == LDNS_RCODE_NXDOMAIN); 862} 863 864void 865iter_store_parentside_rrset(struct module_env* env, 866 struct ub_packed_rrset_key* rrset) 867{ 868 struct rrset_ref ref; 869 rrset = packed_rrset_copy_alloc(rrset, env->alloc, *env->now); 870 if(!rrset) { 871 log_err("malloc failure in store_parentside_rrset"); 872 return; 873 } 874 rrset->rk.flags |= PACKED_RRSET_PARENT_SIDE; 875 rrset->entry.hash = rrset_key_hash(&rrset->rk); 876 ref.key = rrset; 877 ref.id = rrset->id; 878 /* ignore ret: if it was in the cache, ref updated */ 879 (void)rrset_cache_update(env->rrset_cache, &ref, env->alloc, *env->now); 880} 881 882/** fetch NS record from reply, if any */ 883static struct ub_packed_rrset_key* 884reply_get_NS_rrset(struct reply_info* rep) 885{ 886 size_t i; 887 for(i=0; i<rep->rrset_count; i++) { 888 if(rep->rrsets[i]->rk.type == htons(LDNS_RR_TYPE_NS)) { 889 return rep->rrsets[i]; 890 } 891 } 892 return NULL; 893} 894 895void 896iter_store_parentside_NS(struct module_env* env, struct reply_info* rep) 897{ 898 struct ub_packed_rrset_key* rrset = reply_get_NS_rrset(rep); 899 if(rrset) { 900 log_rrset_key(VERB_ALGO, "store parent-side NS", rrset); 901 iter_store_parentside_rrset(env, rrset); 902 } 903} 904 905void iter_store_parentside_neg(struct module_env* env, 906 struct query_info* qinfo, struct reply_info* rep) 907{ 908 /* TTL: NS from referral in iq->deleg_msg, 909 * or first RR from iq->response, 910 * or servfail5secs if !iq->response */ 911 time_t ttl = NORR_TTL; 912 struct ub_packed_rrset_key* neg; 913 struct packed_rrset_data* newd; 914 if(rep) { 915 struct ub_packed_rrset_key* rrset = reply_get_NS_rrset(rep); 916 if(!rrset && rep->rrset_count != 0) rrset = rep->rrsets[0]; 917 if(rrset) ttl = ub_packed_rrset_ttl(rrset); 918 } 919 /* create empty rrset to store */ 920 neg = (struct ub_packed_rrset_key*)regional_alloc(env->scratch, 921 sizeof(struct ub_packed_rrset_key)); 922 if(!neg) { 923 log_err("out of memory in store_parentside_neg"); 924 return; 925 } 926 memset(&neg->entry, 0, sizeof(neg->entry)); 927 neg->entry.key = neg; 928 neg->rk.type = htons(qinfo->qtype); 929 neg->rk.rrset_class = htons(qinfo->qclass); 930 neg->rk.flags = 0; 931 neg->rk.dname = regional_alloc_init(env->scratch, qinfo->qname, 932 qinfo->qname_len); 933 if(!neg->rk.dname) { 934 log_err("out of memory in store_parentside_neg"); 935 return; 936 } 937 neg->rk.dname_len = qinfo->qname_len; 938 neg->entry.hash = rrset_key_hash(&neg->rk); 939 newd = (struct packed_rrset_data*)regional_alloc_zero(env->scratch, 940 sizeof(struct packed_rrset_data) + sizeof(size_t) + 941 sizeof(uint8_t*) + sizeof(time_t) + sizeof(uint16_t)); 942 if(!newd) { 943 log_err("out of memory in store_parentside_neg"); 944 return; 945 } 946 neg->entry.data = newd; 947 newd->ttl = ttl; 948 /* entry must have one RR, otherwise not valid in cache. 949 * put in one RR with empty rdata: those are ignored as nameserver */ 950 newd->count = 1; 951 newd->rrsig_count = 0; 952 newd->trust = rrset_trust_ans_noAA; 953 newd->rr_len = (size_t*)((uint8_t*)newd + 954 sizeof(struct packed_rrset_data)); 955 newd->rr_len[0] = 0 /* zero len rdata */ + sizeof(uint16_t); 956 packed_rrset_ptr_fixup(newd); 957 newd->rr_ttl[0] = newd->ttl; 958 sldns_write_uint16(newd->rr_data[0], 0 /* zero len rdata */); 959 /* store it */ 960 log_rrset_key(VERB_ALGO, "store parent-side negative", neg); 961 iter_store_parentside_rrset(env, neg); 962} 963 964int 965iter_lookup_parent_NS_from_cache(struct module_env* env, struct delegpt* dp, 966 struct regional* region, struct query_info* qinfo) 967{ 968 struct ub_packed_rrset_key* akey; 969 akey = rrset_cache_lookup(env->rrset_cache, dp->name, 970 dp->namelen, LDNS_RR_TYPE_NS, qinfo->qclass, 971 PACKED_RRSET_PARENT_SIDE, *env->now, 0); 972 if(akey) { 973 log_rrset_key(VERB_ALGO, "found parent-side NS in cache", akey); 974 dp->has_parent_side_NS = 1; 975 /* and mark the new names as lame */ 976 if(!delegpt_rrset_add_ns(dp, region, akey, 1)) { 977 lock_rw_unlock(&akey->entry.lock); 978 return 0; 979 } 980 lock_rw_unlock(&akey->entry.lock); 981 } 982 return 1; 983} 984 985int iter_lookup_parent_glue_from_cache(struct module_env* env, 986 struct delegpt* dp, struct regional* region, struct query_info* qinfo) 987{ 988 struct ub_packed_rrset_key* akey; 989 struct delegpt_ns* ns; 990 size_t num = delegpt_count_targets(dp); 991 for(ns = dp->nslist; ns; ns = ns->next) { 992 /* get cached parentside A */ 993 akey = rrset_cache_lookup(env->rrset_cache, ns->name, 994 ns->namelen, LDNS_RR_TYPE_A, qinfo->qclass, 995 PACKED_RRSET_PARENT_SIDE, *env->now, 0); 996 if(akey) { 997 log_rrset_key(VERB_ALGO, "found parent-side", akey); 998 ns->done_pside4 = 1; 999 /* a negative-cache-element has no addresses it adds */ 1000 if(!delegpt_add_rrset_A(dp, region, akey, 1)) 1001 log_err("malloc failure in lookup_parent_glue"); 1002 lock_rw_unlock(&akey->entry.lock); 1003 } 1004 /* get cached parentside AAAA */ 1005 akey = rrset_cache_lookup(env->rrset_cache, ns->name, 1006 ns->namelen, LDNS_RR_TYPE_AAAA, qinfo->qclass, 1007 PACKED_RRSET_PARENT_SIDE, *env->now, 0); 1008 if(akey) { 1009 log_rrset_key(VERB_ALGO, "found parent-side", akey); 1010 ns->done_pside6 = 1; 1011 /* a negative-cache-element has no addresses it adds */ 1012 if(!delegpt_add_rrset_AAAA(dp, region, akey, 1)) 1013 log_err("malloc failure in lookup_parent_glue"); 1014 lock_rw_unlock(&akey->entry.lock); 1015 } 1016 } 1017 /* see if new (but lame) addresses have become available */ 1018 return delegpt_count_targets(dp) != num; 1019} 1020 1021int 1022iter_get_next_root(struct iter_hints* hints, struct iter_forwards* fwd, 1023 uint16_t* c) 1024{ 1025 uint16_t c1 = *c, c2 = *c; 1026 int r1 = hints_next_root(hints, &c1); 1027 int r2 = forwards_next_root(fwd, &c2); 1028 if(!r1 && !r2) /* got none, end of list */ 1029 return 0; 1030 else if(!r1) /* got one, return that */ 1031 *c = c2; 1032 else if(!r2) 1033 *c = c1; 1034 else if(c1 < c2) /* got both take smallest */ 1035 *c = c1; 1036 else *c = c2; 1037 return 1; 1038} 1039 1040void 1041iter_scrub_ds(struct dns_msg* msg, struct ub_packed_rrset_key* ns, uint8_t* z) 1042{ 1043 /* Only the DS record for the delegation itself is expected. 1044 * We allow DS for everything between the bailiwick and the 1045 * zonecut, thus DS records must be at or above the zonecut. 1046 * And the DS records must be below the server authority zone. 1047 * The answer section is already scrubbed. */ 1048 size_t i = msg->rep->an_numrrsets; 1049 while(i < (msg->rep->an_numrrsets + msg->rep->ns_numrrsets)) { 1050 struct ub_packed_rrset_key* s = msg->rep->rrsets[i]; 1051 if(ntohs(s->rk.type) == LDNS_RR_TYPE_DS && 1052 (!ns || !dname_subdomain_c(ns->rk.dname, s->rk.dname) 1053 || query_dname_compare(z, s->rk.dname) == 0)) { 1054 log_nametypeclass(VERB_ALGO, "removing irrelevant DS", 1055 s->rk.dname, ntohs(s->rk.type), 1056 ntohs(s->rk.rrset_class)); 1057 memmove(msg->rep->rrsets+i, msg->rep->rrsets+i+1, 1058 sizeof(struct ub_packed_rrset_key*) * 1059 (msg->rep->rrset_count-i-1)); 1060 msg->rep->ns_numrrsets--; 1061 msg->rep->rrset_count--; 1062 /* stay at same i, but new record */ 1063 continue; 1064 } 1065 i++; 1066 } 1067} 1068 1069void iter_dec_attempts(struct delegpt* dp, int d) 1070{ 1071 struct delegpt_addr* a; 1072 for(a=dp->target_list; a; a = a->next_target) { 1073 if(a->attempts >= OUTBOUND_MSG_RETRY) { 1074 /* add back to result list */ 1075 a->next_result = dp->result_list; 1076 dp->result_list = a; 1077 } 1078 if(a->attempts > d) 1079 a->attempts -= d; 1080 else a->attempts = 0; 1081 } 1082} 1083 1084void iter_merge_retry_counts(struct delegpt* dp, struct delegpt* old) 1085{ 1086 struct delegpt_addr* a, *o, *prev; 1087 for(a=dp->target_list; a; a = a->next_target) { 1088 o = delegpt_find_addr(old, &a->addr, a->addrlen); 1089 if(o) { 1090 log_addr(VERB_ALGO, "copy attempt count previous dp", 1091 &a->addr, a->addrlen); 1092 a->attempts = o->attempts; 1093 } 1094 } 1095 prev = NULL; 1096 a = dp->usable_list; 1097 while(a) { 1098 if(a->attempts >= OUTBOUND_MSG_RETRY) { 1099 log_addr(VERB_ALGO, "remove from usable list dp", 1100 &a->addr, a->addrlen); 1101 /* remove from result list */ 1102 if(prev) 1103 prev->next_usable = a->next_usable; 1104 else dp->usable_list = a->next_usable; 1105 /* prev stays the same */ 1106 a = a->next_usable; 1107 continue; 1108 } 1109 prev = a; 1110 a = a->next_usable; 1111 } 1112} 1113 1114int 1115iter_ds_toolow(struct dns_msg* msg, struct delegpt* dp) 1116{ 1117 /* if for query example.com, there is example.com SOA or a subdomain 1118 * of example.com, then we are too low and need to fetch NS. */ 1119 size_t i; 1120 /* if we have a DNAME or CNAME we are probably wrong */ 1121 /* if we have a qtype DS in the answer section, its fine */ 1122 for(i=0; i < msg->rep->an_numrrsets; i++) { 1123 struct ub_packed_rrset_key* s = msg->rep->rrsets[i]; 1124 if(ntohs(s->rk.type) == LDNS_RR_TYPE_DNAME || 1125 ntohs(s->rk.type) == LDNS_RR_TYPE_CNAME) { 1126 /* not the right answer, maybe too low, check the 1127 * RRSIG signer name (if there is any) for a hint 1128 * that it is from the dp zone anyway */ 1129 uint8_t* sname; 1130 size_t slen; 1131 val_find_rrset_signer(s, &sname, &slen); 1132 if(sname && query_dname_compare(dp->name, sname)==0) 1133 return 0; /* it is fine, from the right dp */ 1134 return 1; 1135 } 1136 if(ntohs(s->rk.type) == LDNS_RR_TYPE_DS) 1137 return 0; /* fine, we have a DS record */ 1138 } 1139 for(i=msg->rep->an_numrrsets; 1140 i < msg->rep->an_numrrsets + msg->rep->ns_numrrsets; i++) { 1141 struct ub_packed_rrset_key* s = msg->rep->rrsets[i]; 1142 if(ntohs(s->rk.type) == LDNS_RR_TYPE_SOA) { 1143 if(dname_subdomain_c(s->rk.dname, msg->qinfo.qname)) 1144 return 1; /* point is too low */ 1145 if(query_dname_compare(s->rk.dname, dp->name)==0) 1146 return 0; /* right dp */ 1147 } 1148 if(ntohs(s->rk.type) == LDNS_RR_TYPE_NSEC || 1149 ntohs(s->rk.type) == LDNS_RR_TYPE_NSEC3) { 1150 uint8_t* sname; 1151 size_t slen; 1152 val_find_rrset_signer(s, &sname, &slen); 1153 if(sname && query_dname_compare(dp->name, sname)==0) 1154 return 0; /* it is fine, from the right dp */ 1155 return 1; 1156 } 1157 } 1158 /* we do not know */ 1159 return 1; 1160} 1161 1162int iter_dp_cangodown(struct query_info* qinfo, struct delegpt* dp) 1163{ 1164 /* no delegation point, do not see how we can go down, 1165 * robust check, it should really exist */ 1166 if(!dp) return 0; 1167 1168 /* see if dp equals the qname, then we cannot go down further */ 1169 if(query_dname_compare(qinfo->qname, dp->name) == 0) 1170 return 0; 1171 /* if dp is one label above the name we also cannot go down further */ 1172 if(dname_count_labels(qinfo->qname) == dp->namelabs+1) 1173 return 0; 1174 return 1; 1175} 1176