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