1238106Sdes/* 2238106Sdes * validator/val_utils.c - validator utility functions. 3238106Sdes * 4238106Sdes * Copyright (c) 2007, NLnet Labs. All rights reserved. 5238106Sdes * 6238106Sdes * This software is open source. 7238106Sdes * 8238106Sdes * Redistribution and use in source and binary forms, with or without 9238106Sdes * modification, are permitted provided that the following conditions 10238106Sdes * are met: 11238106Sdes * 12238106Sdes * Redistributions of source code must retain the above copyright notice, 13238106Sdes * this list of conditions and the following disclaimer. 14238106Sdes * 15238106Sdes * Redistributions in binary form must reproduce the above copyright notice, 16238106Sdes * this list of conditions and the following disclaimer in the documentation 17238106Sdes * and/or other materials provided with the distribution. 18238106Sdes * 19238106Sdes * Neither the name of the NLNET LABS nor the names of its contributors may 20238106Sdes * be used to endorse or promote products derived from this software without 21238106Sdes * specific prior written permission. 22238106Sdes * 23238106Sdes * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 24266114Sdes * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 25266114Sdes * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 26266114Sdes * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 27266114Sdes * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 28266114Sdes * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED 29266114Sdes * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 30266114Sdes * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 31266114Sdes * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 32266114Sdes * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 33266114Sdes * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 34238106Sdes */ 35238106Sdes 36238106Sdes/** 37238106Sdes * \file 38238106Sdes * 39238106Sdes * This file contains helper functions for the validator module. 40238106Sdes */ 41238106Sdes#include "config.h" 42238106Sdes#include "validator/val_utils.h" 43238106Sdes#include "validator/validator.h" 44238106Sdes#include "validator/val_kentry.h" 45238106Sdes#include "validator/val_sigcrypt.h" 46238106Sdes#include "validator/val_anchor.h" 47238106Sdes#include "validator/val_nsec.h" 48238106Sdes#include "validator/val_neg.h" 49238106Sdes#include "services/cache/rrset.h" 50238106Sdes#include "services/cache/dns.h" 51238106Sdes#include "util/data/msgreply.h" 52238106Sdes#include "util/data/packed_rrset.h" 53238106Sdes#include "util/data/dname.h" 54238106Sdes#include "util/net_help.h" 55238106Sdes#include "util/module.h" 56238106Sdes#include "util/regional.h" 57296415Sdes#include "sldns/wire2str.h" 58296415Sdes#include "sldns/parseutil.h" 59238106Sdes 60238106Sdesenum val_classification 61238106Sdesval_classify_response(uint16_t query_flags, struct query_info* origqinf, 62238106Sdes struct query_info* qinf, struct reply_info* rep, size_t skip) 63238106Sdes{ 64238106Sdes int rcode = (int)FLAGS_GET_RCODE(rep->flags); 65238106Sdes size_t i; 66238106Sdes 67238106Sdes /* Normal Name Error's are easy to detect -- but don't mistake a CNAME 68238106Sdes * chain ending in NXDOMAIN. */ 69238106Sdes if(rcode == LDNS_RCODE_NXDOMAIN && rep->an_numrrsets == 0) 70238106Sdes return VAL_CLASS_NAMEERROR; 71238106Sdes 72238106Sdes /* check for referral: nonRD query and it looks like a nodata */ 73238106Sdes if(!(query_flags&BIT_RD) && rep->an_numrrsets == 0 && 74238106Sdes rcode == LDNS_RCODE_NOERROR) { 75238106Sdes /* SOA record in auth indicates it is NODATA instead. 76238106Sdes * All validation requiring NODATA messages have SOA in 77238106Sdes * authority section. */ 78238106Sdes /* uses fact that answer section is empty */ 79238106Sdes int saw_ns = 0; 80238106Sdes for(i=0; i<rep->ns_numrrsets; i++) { 81238106Sdes if(ntohs(rep->rrsets[i]->rk.type) == LDNS_RR_TYPE_SOA) 82238106Sdes return VAL_CLASS_NODATA; 83238106Sdes if(ntohs(rep->rrsets[i]->rk.type) == LDNS_RR_TYPE_DS) 84238106Sdes return VAL_CLASS_REFERRAL; 85238106Sdes if(ntohs(rep->rrsets[i]->rk.type) == LDNS_RR_TYPE_NS) 86238106Sdes saw_ns = 1; 87238106Sdes } 88238106Sdes return saw_ns?VAL_CLASS_REFERRAL:VAL_CLASS_NODATA; 89238106Sdes } 90238106Sdes /* root referral where NS set is in the answer section */ 91238106Sdes if(!(query_flags&BIT_RD) && rep->ns_numrrsets == 0 && 92238106Sdes rep->an_numrrsets == 1 && rcode == LDNS_RCODE_NOERROR && 93238106Sdes ntohs(rep->rrsets[0]->rk.type) == LDNS_RR_TYPE_NS && 94238106Sdes query_dname_compare(rep->rrsets[0]->rk.dname, 95238106Sdes origqinf->qname) != 0) 96238106Sdes return VAL_CLASS_REFERRAL; 97238106Sdes 98238106Sdes /* dump bad messages */ 99238106Sdes if(rcode != LDNS_RCODE_NOERROR && rcode != LDNS_RCODE_NXDOMAIN) 100238106Sdes return VAL_CLASS_UNKNOWN; 101238106Sdes /* next check if the skip into the answer section shows no answer */ 102238106Sdes if(skip>0 && rep->an_numrrsets <= skip) 103238106Sdes return VAL_CLASS_CNAMENOANSWER; 104238106Sdes 105238106Sdes /* Next is NODATA */ 106238106Sdes if(rcode == LDNS_RCODE_NOERROR && rep->an_numrrsets == 0) 107238106Sdes return VAL_CLASS_NODATA; 108238106Sdes 109238106Sdes /* We distinguish between CNAME response and other positive/negative 110238106Sdes * responses because CNAME answers require extra processing. */ 111238106Sdes 112238106Sdes /* We distinguish between ANY and CNAME or POSITIVE because 113238106Sdes * ANY responses are validated differently. */ 114238106Sdes if(rcode == LDNS_RCODE_NOERROR && qinf->qtype == LDNS_RR_TYPE_ANY) 115238106Sdes return VAL_CLASS_ANY; 116238106Sdes 117238106Sdes /* Note that DNAMEs will be ignored here, unless qtype=DNAME. Unless 118238106Sdes * qtype=CNAME, this will yield a CNAME response. */ 119238106Sdes for(i=skip; i<rep->an_numrrsets; i++) { 120238106Sdes if(rcode == LDNS_RCODE_NOERROR && 121238106Sdes ntohs(rep->rrsets[i]->rk.type) == qinf->qtype) 122238106Sdes return VAL_CLASS_POSITIVE; 123238106Sdes if(ntohs(rep->rrsets[i]->rk.type) == LDNS_RR_TYPE_CNAME) 124238106Sdes return VAL_CLASS_CNAME; 125238106Sdes } 126238106Sdes log_dns_msg("validator: error. failed to classify response message: ", 127238106Sdes qinf, rep); 128238106Sdes return VAL_CLASS_UNKNOWN; 129238106Sdes} 130238106Sdes 131238106Sdes/** Get signer name from RRSIG */ 132238106Sdesstatic void 133238106Sdesrrsig_get_signer(uint8_t* data, size_t len, uint8_t** sname, size_t* slen) 134238106Sdes{ 135238106Sdes /* RRSIG rdata is not allowed to be compressed, it is stored 136238106Sdes * uncompressed in memory as well, so return a ptr to the name */ 137238106Sdes if(len < 21) { 138238106Sdes /* too short RRSig: 139238106Sdes * short, byte, byte, long, long, long, short, "." is 140238106Sdes * 2 1 1 4 4 4 2 1 = 19 141238106Sdes * and a skip of 18 bytes to the name. 142238106Sdes * +2 for the rdatalen is 21 bytes len for root label */ 143238106Sdes *sname = NULL; 144238106Sdes *slen = 0; 145238106Sdes return; 146238106Sdes } 147238106Sdes data += 20; /* skip the fixed size bits */ 148238106Sdes len -= 20; 149238106Sdes *slen = dname_valid(data, len); 150238106Sdes if(!*slen) { 151238106Sdes /* bad dname in this rrsig. */ 152238106Sdes *sname = NULL; 153238106Sdes return; 154238106Sdes } 155238106Sdes *sname = data; 156238106Sdes} 157238106Sdes 158238106Sdesvoid 159238106Sdesval_find_rrset_signer(struct ub_packed_rrset_key* rrset, uint8_t** sname, 160238106Sdes size_t* slen) 161238106Sdes{ 162238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 163238106Sdes rrset->entry.data; 164238106Sdes /* return signer for first signature, or NULL */ 165238106Sdes if(d->rrsig_count == 0) { 166238106Sdes *sname = NULL; 167238106Sdes *slen = 0; 168238106Sdes return; 169238106Sdes } 170238106Sdes /* get rrsig signer name out of the signature */ 171238106Sdes rrsig_get_signer(d->rr_data[d->count], d->rr_len[d->count], 172238106Sdes sname, slen); 173238106Sdes} 174238106Sdes 175238106Sdes/** 176238106Sdes * Find best signer name in this set of rrsigs. 177238106Sdes * @param rrset: which rrsigs to look through. 178238106Sdes * @param qinf: the query name that needs validation. 179238106Sdes * @param signer_name: the best signer_name. Updated if a better one is found. 180238106Sdes * @param signer_len: length of signer name. 181238106Sdes * @param matchcount: count of current best name (starts at 0 for no match). 182238106Sdes * Updated if match is improved. 183238106Sdes */ 184238106Sdesstatic void 185238106Sdesval_find_best_signer(struct ub_packed_rrset_key* rrset, 186238106Sdes struct query_info* qinf, uint8_t** signer_name, size_t* signer_len, 187238106Sdes int* matchcount) 188238106Sdes{ 189238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 190238106Sdes rrset->entry.data; 191238106Sdes uint8_t* sign; 192238106Sdes size_t i; 193238106Sdes int m; 194238106Sdes for(i=d->count; i<d->count+d->rrsig_count; i++) { 195238106Sdes sign = d->rr_data[i]+2+18; 196238106Sdes /* look at signatures that are valid (long enough), 197238106Sdes * and have a signer name that is a superdomain of qname, 198238106Sdes * and then check the number of labels in the shared topdomain 199238106Sdes * improve the match if possible */ 200238106Sdes if(d->rr_len[i] > 2+19 && /* rdata, sig + root label*/ 201238106Sdes dname_subdomain_c(qinf->qname, sign)) { 202238106Sdes (void)dname_lab_cmp(qinf->qname, 203238106Sdes dname_count_labels(qinf->qname), 204238106Sdes sign, dname_count_labels(sign), &m); 205238106Sdes if(m > *matchcount) { 206238106Sdes *matchcount = m; 207238106Sdes *signer_name = sign; 208238106Sdes (void)dname_count_size_labels(*signer_name, 209238106Sdes signer_len); 210238106Sdes } 211238106Sdes } 212238106Sdes } 213238106Sdes} 214238106Sdes 215238106Sdesvoid 216238106Sdesval_find_signer(enum val_classification subtype, struct query_info* qinf, 217238106Sdes struct reply_info* rep, size_t skip, uint8_t** signer_name, 218238106Sdes size_t* signer_len) 219238106Sdes{ 220238106Sdes size_t i; 221238106Sdes 222238106Sdes if(subtype == VAL_CLASS_POSITIVE || subtype == VAL_CLASS_ANY) { 223238106Sdes /* check for the answer rrset */ 224238106Sdes for(i=skip; i<rep->an_numrrsets; i++) { 225238106Sdes if(query_dname_compare(qinf->qname, 226238106Sdes rep->rrsets[i]->rk.dname) == 0) { 227238106Sdes val_find_rrset_signer(rep->rrsets[i], 228238106Sdes signer_name, signer_len); 229238106Sdes return; 230238106Sdes } 231238106Sdes } 232238106Sdes *signer_name = NULL; 233238106Sdes *signer_len = 0; 234238106Sdes } else if(subtype == VAL_CLASS_CNAME) { 235238106Sdes /* check for the first signed cname/dname rrset */ 236238106Sdes for(i=skip; i<rep->an_numrrsets; i++) { 237238106Sdes val_find_rrset_signer(rep->rrsets[i], 238238106Sdes signer_name, signer_len); 239238106Sdes if(*signer_name) 240238106Sdes return; 241238106Sdes if(ntohs(rep->rrsets[i]->rk.type) != LDNS_RR_TYPE_DNAME) 242238106Sdes break; /* only check CNAME after a DNAME */ 243238106Sdes } 244238106Sdes *signer_name = NULL; 245238106Sdes *signer_len = 0; 246238106Sdes } else if(subtype == VAL_CLASS_NAMEERROR 247238106Sdes || subtype == VAL_CLASS_NODATA) { 248238106Sdes /*Check to see if the AUTH section NSEC record(s) have rrsigs*/ 249238106Sdes for(i=rep->an_numrrsets; i< 250238106Sdes rep->an_numrrsets+rep->ns_numrrsets; i++) { 251238106Sdes if(ntohs(rep->rrsets[i]->rk.type) == LDNS_RR_TYPE_NSEC 252238106Sdes || ntohs(rep->rrsets[i]->rk.type) == 253238106Sdes LDNS_RR_TYPE_NSEC3) { 254238106Sdes val_find_rrset_signer(rep->rrsets[i], 255238106Sdes signer_name, signer_len); 256238106Sdes return; 257238106Sdes } 258238106Sdes } 259238106Sdes } else if(subtype == VAL_CLASS_CNAMENOANSWER) { 260238106Sdes /* find closest superdomain signer name in authority section 261238106Sdes * NSEC and NSEC3s */ 262238106Sdes int matchcount = 0; 263238106Sdes *signer_name = NULL; 264238106Sdes *signer_len = 0; 265238106Sdes for(i=rep->an_numrrsets; i<rep->an_numrrsets+rep-> 266238106Sdes ns_numrrsets; i++) { 267238106Sdes if(ntohs(rep->rrsets[i]->rk.type) == LDNS_RR_TYPE_NSEC 268238106Sdes || ntohs(rep->rrsets[i]->rk.type) == 269238106Sdes LDNS_RR_TYPE_NSEC3) { 270238106Sdes val_find_best_signer(rep->rrsets[i], qinf, 271238106Sdes signer_name, signer_len, &matchcount); 272238106Sdes } 273238106Sdes } 274238106Sdes } else if(subtype == VAL_CLASS_REFERRAL) { 275238106Sdes /* find keys for the item at skip */ 276238106Sdes if(skip < rep->rrset_count) { 277238106Sdes val_find_rrset_signer(rep->rrsets[skip], 278238106Sdes signer_name, signer_len); 279238106Sdes return; 280238106Sdes } 281238106Sdes *signer_name = NULL; 282238106Sdes *signer_len = 0; 283238106Sdes } else { 284238106Sdes verbose(VERB_QUERY, "find_signer: could not find signer name" 285238106Sdes " for unknown type response"); 286238106Sdes *signer_name = NULL; 287238106Sdes *signer_len = 0; 288238106Sdes } 289238106Sdes} 290238106Sdes 291238106Sdes/** return number of rrs in an rrset */ 292238106Sdesstatic size_t 293238106Sdesrrset_get_count(struct ub_packed_rrset_key* rrset) 294238106Sdes{ 295238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 296238106Sdes rrset->entry.data; 297238106Sdes if(!d) return 0; 298238106Sdes return d->count; 299238106Sdes} 300238106Sdes 301238106Sdes/** return TTL of rrset */ 302238106Sdesstatic uint32_t 303238106Sdesrrset_get_ttl(struct ub_packed_rrset_key* rrset) 304238106Sdes{ 305238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*) 306238106Sdes rrset->entry.data; 307238106Sdes if(!d) return 0; 308238106Sdes return d->ttl; 309238106Sdes} 310238106Sdes 311238106Sdesenum sec_status 312238106Sdesval_verify_rrset(struct module_env* env, struct val_env* ve, 313238106Sdes struct ub_packed_rrset_key* rrset, struct ub_packed_rrset_key* keys, 314238106Sdes uint8_t* sigalg, char** reason) 315238106Sdes{ 316238106Sdes enum sec_status sec; 317238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*)rrset-> 318238106Sdes entry.data; 319238106Sdes if(d->security == sec_status_secure) { 320238106Sdes /* re-verify all other statuses, because keyset may change*/ 321238106Sdes log_nametypeclass(VERB_ALGO, "verify rrset cached", 322238106Sdes rrset->rk.dname, ntohs(rrset->rk.type), 323238106Sdes ntohs(rrset->rk.rrset_class)); 324238106Sdes return d->security; 325238106Sdes } 326238106Sdes /* check in the cache if verification has already been done */ 327238106Sdes rrset_check_sec_status(env->rrset_cache, rrset, *env->now); 328238106Sdes if(d->security == sec_status_secure) { 329238106Sdes log_nametypeclass(VERB_ALGO, "verify rrset from cache", 330238106Sdes rrset->rk.dname, ntohs(rrset->rk.type), 331238106Sdes ntohs(rrset->rk.rrset_class)); 332238106Sdes return d->security; 333238106Sdes } 334238106Sdes log_nametypeclass(VERB_ALGO, "verify rrset", rrset->rk.dname, 335238106Sdes ntohs(rrset->rk.type), ntohs(rrset->rk.rrset_class)); 336238106Sdes sec = dnskeyset_verify_rrset(env, ve, rrset, keys, sigalg, reason); 337238106Sdes verbose(VERB_ALGO, "verify result: %s", sec_status_to_string(sec)); 338238106Sdes regional_free_all(env->scratch); 339238106Sdes 340238106Sdes /* update rrset security status 341238106Sdes * only improves security status 342238106Sdes * and bogus is set only once, even if we rechecked the status */ 343238106Sdes if(sec > d->security) { 344238106Sdes d->security = sec; 345238106Sdes if(sec == sec_status_secure) 346238106Sdes d->trust = rrset_trust_validated; 347238106Sdes else if(sec == sec_status_bogus) { 348238106Sdes size_t i; 349238106Sdes /* update ttl for rrset to fixed value. */ 350238106Sdes d->ttl = ve->bogus_ttl; 351238106Sdes for(i=0; i<d->count+d->rrsig_count; i++) 352238106Sdes d->rr_ttl[i] = ve->bogus_ttl; 353238106Sdes /* leave RR specific TTL: not used for determine 354238106Sdes * if RRset timed out and clients see proper value. */ 355238106Sdes lock_basic_lock(&ve->bogus_lock); 356238106Sdes ve->num_rrset_bogus++; 357238106Sdes lock_basic_unlock(&ve->bogus_lock); 358238106Sdes } 359238106Sdes /* if status updated - store in cache for reuse */ 360238106Sdes rrset_update_sec_status(env->rrset_cache, rrset, *env->now); 361238106Sdes } 362238106Sdes 363238106Sdes return sec; 364238106Sdes} 365238106Sdes 366238106Sdesenum sec_status 367238106Sdesval_verify_rrset_entry(struct module_env* env, struct val_env* ve, 368238106Sdes struct ub_packed_rrset_key* rrset, struct key_entry_key* kkey, 369238106Sdes char** reason) 370238106Sdes{ 371238106Sdes /* temporary dnskey rrset-key */ 372238106Sdes struct ub_packed_rrset_key dnskey; 373238106Sdes struct key_entry_data* kd = (struct key_entry_data*)kkey->entry.data; 374238106Sdes enum sec_status sec; 375238106Sdes dnskey.rk.type = htons(kd->rrset_type); 376238106Sdes dnskey.rk.rrset_class = htons(kkey->key_class); 377238106Sdes dnskey.rk.flags = 0; 378238106Sdes dnskey.rk.dname = kkey->name; 379238106Sdes dnskey.rk.dname_len = kkey->namelen; 380238106Sdes dnskey.entry.key = &dnskey; 381238106Sdes dnskey.entry.data = kd->rrset_data; 382238106Sdes sec = val_verify_rrset(env, ve, rrset, &dnskey, kd->algo, reason); 383238106Sdes return sec; 384238106Sdes} 385238106Sdes 386238106Sdes/** verify that a DS RR hashes to a key and that key signs the set */ 387238106Sdesstatic enum sec_status 388238106Sdesverify_dnskeys_with_ds_rr(struct module_env* env, struct val_env* ve, 389238106Sdes struct ub_packed_rrset_key* dnskey_rrset, 390238106Sdes struct ub_packed_rrset_key* ds_rrset, size_t ds_idx, char** reason) 391238106Sdes{ 392238106Sdes enum sec_status sec = sec_status_bogus; 393238106Sdes size_t i, num, numchecked = 0, numhashok = 0; 394238106Sdes num = rrset_get_count(dnskey_rrset); 395238106Sdes for(i=0; i<num; i++) { 396238106Sdes /* Skip DNSKEYs that don't match the basic criteria. */ 397238106Sdes if(ds_get_key_algo(ds_rrset, ds_idx) 398238106Sdes != dnskey_get_algo(dnskey_rrset, i) 399238106Sdes || dnskey_calc_keytag(dnskey_rrset, i) 400238106Sdes != ds_get_keytag(ds_rrset, ds_idx)) { 401238106Sdes continue; 402238106Sdes } 403238106Sdes numchecked++; 404238106Sdes verbose(VERB_ALGO, "attempt DS match algo %d keytag %d", 405238106Sdes ds_get_key_algo(ds_rrset, ds_idx), 406238106Sdes ds_get_keytag(ds_rrset, ds_idx)); 407238106Sdes 408238106Sdes /* Convert the candidate DNSKEY into a hash using the 409238106Sdes * same DS hash algorithm. */ 410238106Sdes if(!ds_digest_match_dnskey(env, dnskey_rrset, i, ds_rrset, 411238106Sdes ds_idx)) { 412238106Sdes verbose(VERB_ALGO, "DS match attempt failed"); 413238106Sdes continue; 414238106Sdes } 415238106Sdes numhashok++; 416238106Sdes verbose(VERB_ALGO, "DS match digest ok, trying signature"); 417238106Sdes 418238106Sdes /* Otherwise, we have a match! Make sure that the DNSKEY 419238106Sdes * verifies *with this key* */ 420238106Sdes sec = dnskey_verify_rrset(env, ve, dnskey_rrset, 421238106Sdes dnskey_rrset, i, reason); 422238106Sdes if(sec == sec_status_secure) { 423238106Sdes return sec; 424238106Sdes } 425238106Sdes /* If it didn't validate with the DNSKEY, try the next one! */ 426238106Sdes } 427238106Sdes if(numchecked == 0) 428238106Sdes algo_needs_reason(env, ds_get_key_algo(ds_rrset, ds_idx), 429238106Sdes reason, "no keys have a DS"); 430238106Sdes else if(numhashok == 0) 431238106Sdes *reason = "DS hash mismatches key"; 432238106Sdes else if(!*reason) 433238106Sdes *reason = "keyset not secured by DNSKEY that matches DS"; 434238106Sdes return sec_status_bogus; 435238106Sdes} 436238106Sdes 437238106Sdesint val_favorite_ds_algo(struct ub_packed_rrset_key* ds_rrset) 438238106Sdes{ 439238106Sdes size_t i, num = rrset_get_count(ds_rrset); 440238106Sdes int d, digest_algo = 0; /* DS digest algo 0 is not used. */ 441238106Sdes /* find favorite algo, for now, highest number supported */ 442238106Sdes for(i=0; i<num; i++) { 443238106Sdes if(!ds_digest_algo_is_supported(ds_rrset, i) || 444238106Sdes !ds_key_algo_is_supported(ds_rrset, i)) { 445238106Sdes continue; 446238106Sdes } 447238106Sdes d = ds_get_digest_algo(ds_rrset, i); 448238106Sdes if(d > digest_algo) 449238106Sdes digest_algo = d; 450238106Sdes } 451238106Sdes return digest_algo; 452238106Sdes} 453238106Sdes 454238106Sdesenum sec_status 455238106Sdesval_verify_DNSKEY_with_DS(struct module_env* env, struct val_env* ve, 456238106Sdes struct ub_packed_rrset_key* dnskey_rrset, 457238106Sdes struct ub_packed_rrset_key* ds_rrset, uint8_t* sigalg, char** reason) 458238106Sdes{ 459238106Sdes /* as long as this is false, we can consider this DS rrset to be 460238106Sdes * equivalent to no DS rrset. */ 461238106Sdes int has_useful_ds = 0, digest_algo, alg; 462238106Sdes struct algo_needs needs; 463238106Sdes size_t i, num; 464238106Sdes enum sec_status sec; 465238106Sdes 466238106Sdes if(dnskey_rrset->rk.dname_len != ds_rrset->rk.dname_len || 467238106Sdes query_dname_compare(dnskey_rrset->rk.dname, ds_rrset->rk.dname) 468238106Sdes != 0) { 469238106Sdes verbose(VERB_QUERY, "DNSKEY RRset did not match DS RRset " 470238106Sdes "by name"); 471238106Sdes *reason = "DNSKEY RRset did not match DS RRset by name"; 472238106Sdes return sec_status_bogus; 473238106Sdes } 474238106Sdes 475238106Sdes digest_algo = val_favorite_ds_algo(ds_rrset); 476238106Sdes if(sigalg) 477238106Sdes algo_needs_init_ds(&needs, ds_rrset, digest_algo, sigalg); 478238106Sdes num = rrset_get_count(ds_rrset); 479238106Sdes for(i=0; i<num; i++) { 480238106Sdes /* Check to see if we can understand this DS. 481238106Sdes * And check it is the strongest digest */ 482238106Sdes if(!ds_digest_algo_is_supported(ds_rrset, i) || 483238106Sdes !ds_key_algo_is_supported(ds_rrset, i) || 484238106Sdes ds_get_digest_algo(ds_rrset, i) != digest_algo) { 485238106Sdes continue; 486238106Sdes } 487238106Sdes 488238106Sdes /* Once we see a single DS with a known digestID and 489238106Sdes * algorithm, we cannot return INSECURE (with a 490238106Sdes * "null" KeyEntry). */ 491266114Sdes has_useful_ds = 1; 492238106Sdes 493238106Sdes sec = verify_dnskeys_with_ds_rr(env, ve, dnskey_rrset, 494238106Sdes ds_rrset, i, reason); 495238106Sdes if(sec == sec_status_secure) { 496238106Sdes if(!sigalg || algo_needs_set_secure(&needs, 497238106Sdes (uint8_t)ds_get_key_algo(ds_rrset, i))) { 498238106Sdes verbose(VERB_ALGO, "DS matched DNSKEY."); 499238106Sdes return sec_status_secure; 500238106Sdes } 501238106Sdes } else if(sigalg && sec == sec_status_bogus) { 502238106Sdes algo_needs_set_bogus(&needs, 503238106Sdes (uint8_t)ds_get_key_algo(ds_rrset, i)); 504238106Sdes } 505238106Sdes } 506238106Sdes 507238106Sdes /* None of the DS's worked out. */ 508238106Sdes 509238106Sdes /* If no DSs were understandable, then this is OK. */ 510238106Sdes if(!has_useful_ds) { 511238106Sdes verbose(VERB_ALGO, "No usable DS records were found -- " 512238106Sdes "treating as insecure."); 513238106Sdes return sec_status_insecure; 514238106Sdes } 515238106Sdes /* If any were understandable, then it is bad. */ 516238106Sdes verbose(VERB_QUERY, "Failed to match any usable DS to a DNSKEY."); 517238106Sdes if(sigalg && (alg=algo_needs_missing(&needs)) != 0) { 518238106Sdes algo_needs_reason(env, alg, reason, "missing verification of " 519238106Sdes "DNSKEY signature"); 520238106Sdes } 521238106Sdes return sec_status_bogus; 522238106Sdes} 523238106Sdes 524238106Sdesstruct key_entry_key* 525238106Sdesval_verify_new_DNSKEYs(struct regional* region, struct module_env* env, 526238106Sdes struct val_env* ve, struct ub_packed_rrset_key* dnskey_rrset, 527238106Sdes struct ub_packed_rrset_key* ds_rrset, int downprot, char** reason) 528238106Sdes{ 529238106Sdes uint8_t sigalg[ALGO_NEEDS_MAX+1]; 530238106Sdes enum sec_status sec = val_verify_DNSKEY_with_DS(env, ve, 531238106Sdes dnskey_rrset, ds_rrset, downprot?sigalg:NULL, reason); 532238106Sdes 533238106Sdes if(sec == sec_status_secure) { 534238106Sdes return key_entry_create_rrset(region, 535238106Sdes ds_rrset->rk.dname, ds_rrset->rk.dname_len, 536238106Sdes ntohs(ds_rrset->rk.rrset_class), dnskey_rrset, 537238106Sdes downprot?sigalg:NULL, *env->now); 538238106Sdes } else if(sec == sec_status_insecure) { 539238106Sdes return key_entry_create_null(region, ds_rrset->rk.dname, 540238106Sdes ds_rrset->rk.dname_len, 541238106Sdes ntohs(ds_rrset->rk.rrset_class), 542238106Sdes rrset_get_ttl(ds_rrset), *env->now); 543238106Sdes } 544238106Sdes return key_entry_create_bad(region, ds_rrset->rk.dname, 545238106Sdes ds_rrset->rk.dname_len, ntohs(ds_rrset->rk.rrset_class), 546238106Sdes BOGUS_KEY_TTL, *env->now); 547238106Sdes} 548238106Sdes 549238106Sdesenum sec_status 550238106Sdesval_verify_DNSKEY_with_TA(struct module_env* env, struct val_env* ve, 551238106Sdes struct ub_packed_rrset_key* dnskey_rrset, 552238106Sdes struct ub_packed_rrset_key* ta_ds, 553238106Sdes struct ub_packed_rrset_key* ta_dnskey, uint8_t* sigalg, char** reason) 554238106Sdes{ 555238106Sdes /* as long as this is false, we can consider this anchor to be 556238106Sdes * equivalent to no anchor. */ 557238106Sdes int has_useful_ta = 0, digest_algo = 0, alg; 558238106Sdes struct algo_needs needs; 559238106Sdes size_t i, num; 560238106Sdes enum sec_status sec; 561238106Sdes 562238106Sdes if(ta_ds && (dnskey_rrset->rk.dname_len != ta_ds->rk.dname_len || 563238106Sdes query_dname_compare(dnskey_rrset->rk.dname, ta_ds->rk.dname) 564238106Sdes != 0)) { 565238106Sdes verbose(VERB_QUERY, "DNSKEY RRset did not match DS RRset " 566238106Sdes "by name"); 567238106Sdes *reason = "DNSKEY RRset did not match DS RRset by name"; 568238106Sdes return sec_status_bogus; 569238106Sdes } 570238106Sdes if(ta_dnskey && (dnskey_rrset->rk.dname_len != ta_dnskey->rk.dname_len 571238106Sdes || query_dname_compare(dnskey_rrset->rk.dname, ta_dnskey->rk.dname) 572238106Sdes != 0)) { 573238106Sdes verbose(VERB_QUERY, "DNSKEY RRset did not match anchor RRset " 574238106Sdes "by name"); 575238106Sdes *reason = "DNSKEY RRset did not match anchor RRset by name"; 576238106Sdes return sec_status_bogus; 577238106Sdes } 578238106Sdes 579238106Sdes if(ta_ds) 580238106Sdes digest_algo = val_favorite_ds_algo(ta_ds); 581238106Sdes if(sigalg) { 582238106Sdes if(ta_ds) 583238106Sdes algo_needs_init_ds(&needs, ta_ds, digest_algo, sigalg); 584238106Sdes else memset(&needs, 0, sizeof(needs)); 585238106Sdes if(ta_dnskey) 586238106Sdes algo_needs_init_dnskey_add(&needs, ta_dnskey, sigalg); 587238106Sdes } 588238106Sdes if(ta_ds) { 589238106Sdes num = rrset_get_count(ta_ds); 590238106Sdes for(i=0; i<num; i++) { 591238106Sdes /* Check to see if we can understand this DS. 592238106Sdes * And check it is the strongest digest */ 593238106Sdes if(!ds_digest_algo_is_supported(ta_ds, i) || 594238106Sdes !ds_key_algo_is_supported(ta_ds, i) || 595238106Sdes ds_get_digest_algo(ta_ds, i) != digest_algo) 596238106Sdes continue; 597238106Sdes 598238106Sdes /* Once we see a single DS with a known digestID and 599238106Sdes * algorithm, we cannot return INSECURE (with a 600238106Sdes * "null" KeyEntry). */ 601266114Sdes has_useful_ta = 1; 602238106Sdes 603238106Sdes sec = verify_dnskeys_with_ds_rr(env, ve, dnskey_rrset, 604238106Sdes ta_ds, i, reason); 605238106Sdes if(sec == sec_status_secure) { 606238106Sdes if(!sigalg || algo_needs_set_secure(&needs, 607238106Sdes (uint8_t)ds_get_key_algo(ta_ds, i))) { 608238106Sdes verbose(VERB_ALGO, "DS matched DNSKEY."); 609238106Sdes return sec_status_secure; 610238106Sdes } 611238106Sdes } else if(sigalg && sec == sec_status_bogus) { 612238106Sdes algo_needs_set_bogus(&needs, 613238106Sdes (uint8_t)ds_get_key_algo(ta_ds, i)); 614238106Sdes } 615238106Sdes } 616238106Sdes } 617238106Sdes 618238106Sdes /* None of the DS's worked out: check the DNSKEYs. */ 619238106Sdes if(ta_dnskey) { 620238106Sdes num = rrset_get_count(ta_dnskey); 621238106Sdes for(i=0; i<num; i++) { 622238106Sdes /* Check to see if we can understand this DNSKEY */ 623238106Sdes if(!dnskey_algo_is_supported(ta_dnskey, i)) 624238106Sdes continue; 625238106Sdes 626238106Sdes /* we saw a useful TA */ 627266114Sdes has_useful_ta = 1; 628238106Sdes 629238106Sdes sec = dnskey_verify_rrset(env, ve, dnskey_rrset, 630238106Sdes ta_dnskey, i, reason); 631238106Sdes if(sec == sec_status_secure) { 632238106Sdes if(!sigalg || algo_needs_set_secure(&needs, 633238106Sdes (uint8_t)dnskey_get_algo(ta_dnskey, i))) { 634238106Sdes verbose(VERB_ALGO, "anchor matched DNSKEY."); 635238106Sdes return sec_status_secure; 636238106Sdes } 637238106Sdes } else if(sigalg && sec == sec_status_bogus) { 638238106Sdes algo_needs_set_bogus(&needs, 639238106Sdes (uint8_t)dnskey_get_algo(ta_dnskey, i)); 640238106Sdes } 641238106Sdes } 642238106Sdes } 643238106Sdes 644238106Sdes /* If no DSs were understandable, then this is OK. */ 645238106Sdes if(!has_useful_ta) { 646238106Sdes verbose(VERB_ALGO, "No usable trust anchors were found -- " 647238106Sdes "treating as insecure."); 648238106Sdes return sec_status_insecure; 649238106Sdes } 650238106Sdes /* If any were understandable, then it is bad. */ 651238106Sdes verbose(VERB_QUERY, "Failed to match any usable anchor to a DNSKEY."); 652238106Sdes if(sigalg && (alg=algo_needs_missing(&needs)) != 0) { 653238106Sdes algo_needs_reason(env, alg, reason, "missing verification of " 654238106Sdes "DNSKEY signature"); 655238106Sdes } 656238106Sdes return sec_status_bogus; 657238106Sdes} 658238106Sdes 659238106Sdesstruct key_entry_key* 660238106Sdesval_verify_new_DNSKEYs_with_ta(struct regional* region, struct module_env* env, 661238106Sdes struct val_env* ve, struct ub_packed_rrset_key* dnskey_rrset, 662238106Sdes struct ub_packed_rrset_key* ta_ds_rrset, 663238106Sdes struct ub_packed_rrset_key* ta_dnskey_rrset, int downprot, 664238106Sdes char** reason) 665238106Sdes{ 666238106Sdes uint8_t sigalg[ALGO_NEEDS_MAX+1]; 667238106Sdes enum sec_status sec = val_verify_DNSKEY_with_TA(env, ve, 668238106Sdes dnskey_rrset, ta_ds_rrset, ta_dnskey_rrset, 669238106Sdes downprot?sigalg:NULL, reason); 670238106Sdes 671238106Sdes if(sec == sec_status_secure) { 672238106Sdes return key_entry_create_rrset(region, 673238106Sdes dnskey_rrset->rk.dname, dnskey_rrset->rk.dname_len, 674238106Sdes ntohs(dnskey_rrset->rk.rrset_class), dnskey_rrset, 675238106Sdes downprot?sigalg:NULL, *env->now); 676238106Sdes } else if(sec == sec_status_insecure) { 677238106Sdes return key_entry_create_null(region, dnskey_rrset->rk.dname, 678238106Sdes dnskey_rrset->rk.dname_len, 679238106Sdes ntohs(dnskey_rrset->rk.rrset_class), 680238106Sdes rrset_get_ttl(dnskey_rrset), *env->now); 681238106Sdes } 682238106Sdes return key_entry_create_bad(region, dnskey_rrset->rk.dname, 683238106Sdes dnskey_rrset->rk.dname_len, ntohs(dnskey_rrset->rk.rrset_class), 684238106Sdes BOGUS_KEY_TTL, *env->now); 685238106Sdes} 686238106Sdes 687238106Sdesint 688238106Sdesval_dsset_isusable(struct ub_packed_rrset_key* ds_rrset) 689238106Sdes{ 690238106Sdes size_t i; 691238106Sdes for(i=0; i<rrset_get_count(ds_rrset); i++) { 692238106Sdes if(ds_digest_algo_is_supported(ds_rrset, i) && 693238106Sdes ds_key_algo_is_supported(ds_rrset, i)) 694238106Sdes return 1; 695238106Sdes } 696296415Sdes if(verbosity < VERB_ALGO) 697296415Sdes return 0; 698296415Sdes if(rrset_get_count(ds_rrset) == 0) 699296415Sdes verbose(VERB_ALGO, "DS is not usable"); 700296415Sdes else { 701296415Sdes /* report usability for the first DS RR */ 702296415Sdes sldns_lookup_table *lt; 703296415Sdes char herr[64], aerr[64]; 704296415Sdes lt = sldns_lookup_by_id(sldns_hashes, 705296415Sdes (int)ds_get_digest_algo(ds_rrset, i)); 706296415Sdes if(lt) snprintf(herr, sizeof(herr), "%s", lt->name); 707296415Sdes else snprintf(herr, sizeof(herr), "%d", 708296415Sdes (int)ds_get_digest_algo(ds_rrset, i)); 709296415Sdes lt = sldns_lookup_by_id(sldns_algorithms, 710296415Sdes (int)ds_get_key_algo(ds_rrset, i)); 711296415Sdes if(lt) snprintf(aerr, sizeof(aerr), "%s", lt->name); 712296415Sdes else snprintf(aerr, sizeof(aerr), "%d", 713296415Sdes (int)ds_get_key_algo(ds_rrset, i)); 714296415Sdes verbose(VERB_ALGO, "DS unsupported, hash %s %s, " 715296415Sdes "key algorithm %s %s", herr, 716296415Sdes (ds_digest_algo_is_supported(ds_rrset, 0)? 717296415Sdes "(supported)":"(unsupported)"), aerr, 718296415Sdes (ds_key_algo_is_supported(ds_rrset, 0)? 719296415Sdes "(supported)":"(unsupported)")); 720296415Sdes } 721238106Sdes return 0; 722238106Sdes} 723238106Sdes 724238106Sdes/** get label count for a signature */ 725238106Sdesstatic uint8_t 726238106Sdesrrsig_get_labcount(struct packed_rrset_data* d, size_t sig) 727238106Sdes{ 728238106Sdes if(d->rr_len[sig] < 2+4) 729238106Sdes return 0; /* bad sig length */ 730238106Sdes return d->rr_data[sig][2+3]; 731238106Sdes} 732238106Sdes 733238106Sdesint 734238106Sdesval_rrset_wildcard(struct ub_packed_rrset_key* rrset, uint8_t** wc) 735238106Sdes{ 736238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*)rrset-> 737238106Sdes entry.data; 738238106Sdes uint8_t labcount; 739238106Sdes int labdiff; 740238106Sdes uint8_t* wn; 741238106Sdes size_t i, wl; 742238106Sdes if(d->rrsig_count == 0) { 743238106Sdes return 1; 744238106Sdes } 745238106Sdes labcount = rrsig_get_labcount(d, d->count + 0); 746238106Sdes /* check rest of signatures identical */ 747238106Sdes for(i=1; i<d->rrsig_count; i++) { 748238106Sdes if(labcount != rrsig_get_labcount(d, d->count + i)) { 749238106Sdes return 0; 750238106Sdes } 751238106Sdes } 752238106Sdes /* OK the rrsigs check out */ 753238106Sdes /* if the RRSIG label count is shorter than the number of actual 754238106Sdes * labels, then this rrset was synthesized from a wildcard. 755238106Sdes * Note that the RRSIG label count doesn't count the root label. */ 756238106Sdes wn = rrset->rk.dname; 757238106Sdes wl = rrset->rk.dname_len; 758238106Sdes /* skip a leading wildcard label in the dname (RFC4035 2.2) */ 759238106Sdes if(dname_is_wild(wn)) { 760238106Sdes wn += 2; 761238106Sdes wl -= 2; 762238106Sdes } 763238106Sdes labdiff = (dname_count_labels(wn) - 1) - (int)labcount; 764238106Sdes if(labdiff > 0) { 765238106Sdes *wc = wn; 766238106Sdes dname_remove_labels(wc, &wl, labdiff); 767238106Sdes return 1; 768238106Sdes } 769238106Sdes return 1; 770238106Sdes} 771238106Sdes 772238106Sdesint 773238106Sdesval_chase_cname(struct query_info* qchase, struct reply_info* rep, 774238106Sdes size_t* cname_skip) { 775238106Sdes size_t i; 776238106Sdes /* skip any DNAMEs, go to the CNAME for next part */ 777238106Sdes for(i = *cname_skip; i < rep->an_numrrsets; i++) { 778238106Sdes if(ntohs(rep->rrsets[i]->rk.type) == LDNS_RR_TYPE_CNAME && 779238106Sdes query_dname_compare(qchase->qname, rep->rrsets[i]-> 780238106Sdes rk.dname) == 0) { 781238106Sdes qchase->qname = NULL; 782238106Sdes get_cname_target(rep->rrsets[i], &qchase->qname, 783238106Sdes &qchase->qname_len); 784238106Sdes if(!qchase->qname) 785238106Sdes return 0; /* bad CNAME rdata */ 786238106Sdes (*cname_skip) = i+1; 787238106Sdes return 1; 788238106Sdes } 789238106Sdes } 790238106Sdes return 0; /* CNAME classified but no matching CNAME ?! */ 791238106Sdes} 792238106Sdes 793238106Sdes/** see if rrset has signer name as one of the rrsig signers */ 794238106Sdesstatic int 795238106Sdesrrset_has_signer(struct ub_packed_rrset_key* rrset, uint8_t* name, size_t len) 796238106Sdes{ 797238106Sdes struct packed_rrset_data* d = (struct packed_rrset_data*)rrset-> 798238106Sdes entry.data; 799238106Sdes size_t i; 800238106Sdes for(i = d->count; i< d->count+d->rrsig_count; i++) { 801238106Sdes if(d->rr_len[i] > 2+18+len) { 802238106Sdes /* at least rdatalen + signature + signame (+1 sig)*/ 803266114Sdes if(!dname_valid(d->rr_data[i]+2+18, d->rr_len[i]-2-18)) 804266114Sdes continue; 805238106Sdes if(query_dname_compare(name, d->rr_data[i]+2+18) == 0) 806238106Sdes { 807238106Sdes return 1; 808238106Sdes } 809238106Sdes } 810238106Sdes } 811238106Sdes return 0; 812238106Sdes} 813238106Sdes 814238106Sdesvoid 815238106Sdesval_fill_reply(struct reply_info* chase, struct reply_info* orig, 816238106Sdes size_t skip, uint8_t* name, size_t len, uint8_t* signer) 817238106Sdes{ 818238106Sdes size_t i; 819238106Sdes int seen_dname = 0; 820238106Sdes chase->rrset_count = 0; 821238106Sdes chase->an_numrrsets = 0; 822238106Sdes chase->ns_numrrsets = 0; 823238106Sdes chase->ar_numrrsets = 0; 824238106Sdes /* ANSWER section */ 825238106Sdes for(i=skip; i<orig->an_numrrsets; i++) { 826238106Sdes if(!signer) { 827238106Sdes if(query_dname_compare(name, 828238106Sdes orig->rrsets[i]->rk.dname) == 0) 829238106Sdes chase->rrsets[chase->an_numrrsets++] = 830238106Sdes orig->rrsets[i]; 831238106Sdes } else if(seen_dname && ntohs(orig->rrsets[i]->rk.type) == 832238106Sdes LDNS_RR_TYPE_CNAME) { 833238106Sdes chase->rrsets[chase->an_numrrsets++] = orig->rrsets[i]; 834238106Sdes seen_dname = 0; 835238106Sdes } else if(rrset_has_signer(orig->rrsets[i], name, len)) { 836238106Sdes chase->rrsets[chase->an_numrrsets++] = orig->rrsets[i]; 837238106Sdes if(ntohs(orig->rrsets[i]->rk.type) == 838238106Sdes LDNS_RR_TYPE_DNAME) { 839238106Sdes seen_dname = 1; 840238106Sdes } 841238106Sdes } 842238106Sdes } 843238106Sdes /* AUTHORITY section */ 844238106Sdes for(i = (skip > orig->an_numrrsets)?skip:orig->an_numrrsets; 845238106Sdes i<orig->an_numrrsets+orig->ns_numrrsets; 846238106Sdes i++) { 847238106Sdes if(!signer) { 848238106Sdes if(query_dname_compare(name, 849238106Sdes orig->rrsets[i]->rk.dname) == 0) 850238106Sdes chase->rrsets[chase->an_numrrsets+ 851238106Sdes chase->ns_numrrsets++] = orig->rrsets[i]; 852238106Sdes } else if(rrset_has_signer(orig->rrsets[i], name, len)) { 853238106Sdes chase->rrsets[chase->an_numrrsets+ 854238106Sdes chase->ns_numrrsets++] = orig->rrsets[i]; 855238106Sdes } 856238106Sdes } 857238106Sdes /* ADDITIONAL section */ 858238106Sdes for(i= (skip>orig->an_numrrsets+orig->ns_numrrsets)? 859238106Sdes skip:orig->an_numrrsets+orig->ns_numrrsets; 860238106Sdes i<orig->rrset_count; i++) { 861238106Sdes if(!signer) { 862238106Sdes if(query_dname_compare(name, 863238106Sdes orig->rrsets[i]->rk.dname) == 0) 864238106Sdes chase->rrsets[chase->an_numrrsets 865238106Sdes +orig->ns_numrrsets+chase->ar_numrrsets++] 866238106Sdes = orig->rrsets[i]; 867238106Sdes } else if(rrset_has_signer(orig->rrsets[i], name, len)) { 868238106Sdes chase->rrsets[chase->an_numrrsets+orig->ns_numrrsets+ 869238106Sdes chase->ar_numrrsets++] = orig->rrsets[i]; 870238106Sdes } 871238106Sdes } 872238106Sdes chase->rrset_count = chase->an_numrrsets + chase->ns_numrrsets + 873238106Sdes chase->ar_numrrsets; 874238106Sdes} 875238106Sdes 876282089Sdesvoid val_reply_remove_auth(struct reply_info* rep, size_t index) 877282089Sdes{ 878282089Sdes log_assert(index < rep->rrset_count); 879282089Sdes log_assert(index >= rep->an_numrrsets); 880282089Sdes log_assert(index < rep->an_numrrsets+rep->ns_numrrsets); 881282089Sdes memmove(rep->rrsets+index, rep->rrsets+index+1, 882282089Sdes sizeof(struct ub_packed_rrset_key*)* 883282089Sdes (rep->rrset_count - index - 1)); 884282089Sdes rep->ns_numrrsets--; 885282089Sdes rep->rrset_count--; 886282089Sdes} 887282089Sdes 888238106Sdesvoid 889238106Sdesval_check_nonsecure(struct val_env* ve, struct reply_info* rep) 890238106Sdes{ 891238106Sdes size_t i; 892238106Sdes /* authority */ 893238106Sdes for(i=rep->an_numrrsets; i<rep->an_numrrsets+rep->ns_numrrsets; i++) { 894238106Sdes if(((struct packed_rrset_data*)rep->rrsets[i]->entry.data) 895238106Sdes ->security != sec_status_secure) { 896238106Sdes /* because we want to return the authentic original 897238106Sdes * message when presented with CD-flagged queries, 898238106Sdes * we need to preserve AUTHORITY section data. 899238106Sdes * However, this rrset is not signed or signed 900238106Sdes * with the wrong keys. Validation has tried to 901238106Sdes * verify this rrset with the keysets of import. 902238106Sdes * But this rrset did not verify. 903238106Sdes * Therefore the message is bogus. 904238106Sdes */ 905238106Sdes 906238106Sdes /* check if authority consists of only an NS record 907238106Sdes * which is bad, and there is an answer section with 908238106Sdes * data. In that case, delete NS and additional to 909238106Sdes * be lenient and make a minimal response */ 910238106Sdes if(rep->an_numrrsets != 0 && rep->ns_numrrsets == 1 && 911238106Sdes ntohs(rep->rrsets[i]->rk.type) 912238106Sdes == LDNS_RR_TYPE_NS) { 913238106Sdes verbose(VERB_ALGO, "truncate to minimal"); 914238106Sdes rep->ns_numrrsets = 0; 915238106Sdes rep->ar_numrrsets = 0; 916238106Sdes rep->rrset_count = rep->an_numrrsets; 917238106Sdes return; 918238106Sdes } 919238106Sdes 920238106Sdes log_nametypeclass(VERB_QUERY, "message is bogus, " 921238106Sdes "non secure rrset", 922238106Sdes rep->rrsets[i]->rk.dname, 923238106Sdes ntohs(rep->rrsets[i]->rk.type), 924238106Sdes ntohs(rep->rrsets[i]->rk.rrset_class)); 925238106Sdes rep->security = sec_status_bogus; 926238106Sdes return; 927238106Sdes } 928238106Sdes } 929238106Sdes /* additional */ 930238106Sdes if(!ve->clean_additional) 931238106Sdes return; 932238106Sdes for(i=rep->an_numrrsets+rep->ns_numrrsets; i<rep->rrset_count; i++) { 933238106Sdes if(((struct packed_rrset_data*)rep->rrsets[i]->entry.data) 934238106Sdes ->security != sec_status_secure) { 935238106Sdes /* This does not cause message invalidation. It was 936238106Sdes * simply unsigned data in the additional. The 937238106Sdes * RRSIG must have been truncated off the message. 938238106Sdes * 939238106Sdes * However, we do not want to return possible bogus 940238106Sdes * data to clients that rely on this service for 941238106Sdes * their authentication. 942238106Sdes */ 943238106Sdes /* remove this unneeded additional rrset */ 944238106Sdes memmove(rep->rrsets+i, rep->rrsets+i+1, 945238106Sdes sizeof(struct ub_packed_rrset_key*)* 946238106Sdes (rep->rrset_count - i - 1)); 947238106Sdes rep->ar_numrrsets--; 948238106Sdes rep->rrset_count--; 949238106Sdes i--; 950238106Sdes } 951238106Sdes } 952238106Sdes} 953238106Sdes 954238106Sdes/** check no anchor and unlock */ 955238106Sdesstatic int 956238106Sdescheck_no_anchor(struct val_anchors* anchors, uint8_t* nm, size_t l, uint16_t c) 957238106Sdes{ 958238106Sdes struct trust_anchor* ta; 959238106Sdes if((ta=anchors_lookup(anchors, nm, l, c))) { 960238106Sdes lock_basic_unlock(&ta->lock); 961238106Sdes } 962238106Sdes return !ta; 963238106Sdes} 964238106Sdes 965238106Sdesvoid 966238106Sdesval_mark_indeterminate(struct reply_info* rep, struct val_anchors* anchors, 967238106Sdes struct rrset_cache* r, struct module_env* env) 968238106Sdes{ 969238106Sdes size_t i; 970238106Sdes struct packed_rrset_data* d; 971238106Sdes for(i=0; i<rep->rrset_count; i++) { 972238106Sdes d = (struct packed_rrset_data*)rep->rrsets[i]->entry.data; 973238106Sdes if(d->security == sec_status_unchecked && 974238106Sdes check_no_anchor(anchors, rep->rrsets[i]->rk.dname, 975238106Sdes rep->rrsets[i]->rk.dname_len, 976238106Sdes ntohs(rep->rrsets[i]->rk.rrset_class))) 977238106Sdes { 978238106Sdes /* mark as indeterminate */ 979238106Sdes d->security = sec_status_indeterminate; 980238106Sdes rrset_update_sec_status(r, rep->rrsets[i], *env->now); 981238106Sdes } 982238106Sdes } 983238106Sdes} 984238106Sdes 985238106Sdesvoid 986238106Sdesval_mark_insecure(struct reply_info* rep, uint8_t* kname, 987238106Sdes struct rrset_cache* r, struct module_env* env) 988238106Sdes{ 989238106Sdes size_t i; 990238106Sdes struct packed_rrset_data* d; 991238106Sdes for(i=0; i<rep->rrset_count; i++) { 992238106Sdes d = (struct packed_rrset_data*)rep->rrsets[i]->entry.data; 993238106Sdes if(d->security == sec_status_unchecked && 994238106Sdes dname_subdomain_c(rep->rrsets[i]->rk.dname, kname)) { 995238106Sdes /* mark as insecure */ 996238106Sdes d->security = sec_status_insecure; 997238106Sdes rrset_update_sec_status(r, rep->rrsets[i], *env->now); 998238106Sdes } 999238106Sdes } 1000238106Sdes} 1001238106Sdes 1002238106Sdessize_t 1003238106Sdesval_next_unchecked(struct reply_info* rep, size_t skip) 1004238106Sdes{ 1005238106Sdes size_t i; 1006238106Sdes struct packed_rrset_data* d; 1007238106Sdes for(i=skip+1; i<rep->rrset_count; i++) { 1008238106Sdes d = (struct packed_rrset_data*)rep->rrsets[i]->entry.data; 1009238106Sdes if(d->security == sec_status_unchecked) { 1010238106Sdes return i; 1011238106Sdes } 1012238106Sdes } 1013238106Sdes return rep->rrset_count; 1014238106Sdes} 1015238106Sdes 1016238106Sdesconst char* 1017238106Sdesval_classification_to_string(enum val_classification subtype) 1018238106Sdes{ 1019238106Sdes switch(subtype) { 1020238106Sdes case VAL_CLASS_UNTYPED: return "untyped"; 1021238106Sdes case VAL_CLASS_UNKNOWN: return "unknown"; 1022238106Sdes case VAL_CLASS_POSITIVE: return "positive"; 1023238106Sdes case VAL_CLASS_CNAME: return "cname"; 1024238106Sdes case VAL_CLASS_NODATA: return "nodata"; 1025238106Sdes case VAL_CLASS_NAMEERROR: return "nameerror"; 1026238106Sdes case VAL_CLASS_CNAMENOANSWER: return "cnamenoanswer"; 1027238106Sdes case VAL_CLASS_REFERRAL: return "referral"; 1028238106Sdes case VAL_CLASS_ANY: return "qtype_any"; 1029238106Sdes default: 1030238106Sdes return "bad_val_classification"; 1031238106Sdes } 1032238106Sdes} 1033238106Sdes 1034238106Sdes/** log a sock_list entry */ 1035238106Sdesstatic void 1036238106Sdessock_list_logentry(enum verbosity_value v, const char* s, struct sock_list* p) 1037238106Sdes{ 1038238106Sdes if(p->len) 1039238106Sdes log_addr(v, s, &p->addr, p->len); 1040238106Sdes else verbose(v, "%s cache", s); 1041238106Sdes} 1042238106Sdes 1043238106Sdesvoid val_blacklist(struct sock_list** blacklist, struct regional* region, 1044238106Sdes struct sock_list* origin, int cross) 1045238106Sdes{ 1046238106Sdes /* debug printout */ 1047238106Sdes if(verbosity >= VERB_ALGO) { 1048238106Sdes struct sock_list* p; 1049238106Sdes for(p=*blacklist; p; p=p->next) 1050238106Sdes sock_list_logentry(VERB_ALGO, "blacklist", p); 1051238106Sdes if(!origin) 1052238106Sdes verbose(VERB_ALGO, "blacklist add: cache"); 1053238106Sdes for(p=origin; p; p=p->next) 1054238106Sdes sock_list_logentry(VERB_ALGO, "blacklist add", p); 1055238106Sdes } 1056238106Sdes /* blacklist the IPs or the cache */ 1057238106Sdes if(!origin) { 1058238106Sdes /* only add if nothing there. anything else also stops cache*/ 1059238106Sdes if(!*blacklist) 1060238106Sdes sock_list_insert(blacklist, NULL, 0, region); 1061238106Sdes } else if(!cross) 1062238106Sdes sock_list_prepend(blacklist, origin); 1063238106Sdes else sock_list_merge(blacklist, region, origin); 1064238106Sdes} 1065238106Sdes 1066238106Sdesint val_has_signed_nsecs(struct reply_info* rep, char** reason) 1067238106Sdes{ 1068238106Sdes size_t i, num_nsec = 0, num_nsec3 = 0; 1069238106Sdes struct packed_rrset_data* d; 1070238106Sdes for(i=rep->an_numrrsets; i<rep->an_numrrsets+rep->ns_numrrsets; i++) { 1071238106Sdes if(rep->rrsets[i]->rk.type == htons(LDNS_RR_TYPE_NSEC)) 1072238106Sdes num_nsec++; 1073238106Sdes else if(rep->rrsets[i]->rk.type == htons(LDNS_RR_TYPE_NSEC3)) 1074238106Sdes num_nsec3++; 1075238106Sdes else continue; 1076238106Sdes d = (struct packed_rrset_data*)rep->rrsets[i]->entry.data; 1077238106Sdes if(d && d->rrsig_count != 0) { 1078238106Sdes return 1; 1079238106Sdes } 1080238106Sdes } 1081238106Sdes if(num_nsec == 0 && num_nsec3 == 0) 1082238106Sdes *reason = "no DNSSEC records"; 1083238106Sdes else if(num_nsec != 0) 1084238106Sdes *reason = "no signatures over NSECs"; 1085238106Sdes else *reason = "no signatures over NSEC3s"; 1086238106Sdes return 0; 1087238106Sdes} 1088238106Sdes 1089238106Sdesstruct dns_msg* 1090238106Sdesval_find_DS(struct module_env* env, uint8_t* nm, size_t nmlen, uint16_t c, 1091238106Sdes struct regional* region, uint8_t* topname) 1092238106Sdes{ 1093238106Sdes struct dns_msg* msg; 1094238106Sdes struct query_info qinfo; 1095238106Sdes struct ub_packed_rrset_key *rrset = rrset_cache_lookup( 1096238106Sdes env->rrset_cache, nm, nmlen, LDNS_RR_TYPE_DS, c, 0, 1097238106Sdes *env->now, 0); 1098238106Sdes if(rrset) { 1099238106Sdes /* DS rrset exists. Return it to the validator immediately*/ 1100238106Sdes struct ub_packed_rrset_key* copy = packed_rrset_copy_region( 1101238106Sdes rrset, region, *env->now); 1102238106Sdes lock_rw_unlock(&rrset->entry.lock); 1103238106Sdes if(!copy) 1104238106Sdes return NULL; 1105238106Sdes msg = dns_msg_create(nm, nmlen, LDNS_RR_TYPE_DS, c, region, 1); 1106238106Sdes if(!msg) 1107238106Sdes return NULL; 1108238106Sdes msg->rep->rrsets[0] = copy; 1109238106Sdes msg->rep->rrset_count++; 1110238106Sdes msg->rep->an_numrrsets++; 1111238106Sdes return msg; 1112238106Sdes } 1113238106Sdes /* lookup in rrset and negative cache for NSEC/NSEC3 */ 1114238106Sdes qinfo.qname = nm; 1115238106Sdes qinfo.qname_len = nmlen; 1116238106Sdes qinfo.qtype = LDNS_RR_TYPE_DS; 1117238106Sdes qinfo.qclass = c; 1118238106Sdes /* do not add SOA to reply message, it is going to be used internal */ 1119238106Sdes msg = val_neg_getmsg(env->neg_cache, &qinfo, region, env->rrset_cache, 1120238106Sdes env->scratch_buffer, *env->now, 0, topname); 1121238106Sdes return msg; 1122238106Sdes} 1123