2 * iterator/iter_delegpt.c - delegation point with NS and address information.
4 * Copyright (c) 2007, NLnet Labs. All rights reserved.
6 * This software is open source.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * Redistributions of source code must retain the above copyright notice,
13 * this list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 * this list of conditions and the following disclaimer in the documentation
17 * and/or other materials provided with the distribution.
19 * Neither the name of the NLNET LABS nor the names of its contributors may
20 * be used to endorse or promote products derived from this software without
21 * specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
26 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
27 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
28 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
29 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
30 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
31 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
32 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
33 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39 * This file implements the Delegation Point. It contains a list of name servers
40 * and their addresses if known.
43 #include "iterator/iter_delegpt.h"
44 #include "services/cache/dns.h"
45 #include "util/regional.h"
46 #include "util/data/dname.h"
47 #include "util/data/packed_rrset.h"
48 #include "util/data/msgreply.h"
49 #include "util/net_help.h"
50 #include "ldns/rrdef.h"
51 #include "ldns/sbuffer.h"
54 delegpt_create(struct regional* region)
56 struct delegpt* dp=(struct delegpt*)regional_alloc(
60 memset(dp, 0, sizeof(*dp));
64 struct delegpt* delegpt_copy(struct delegpt* dp, struct regional* region)
66 struct delegpt* copy = delegpt_create(region);
67 struct delegpt_ns* ns;
68 struct delegpt_addr* a;
71 if(!delegpt_set_name(copy, region, dp->name))
73 copy->bogus = dp->bogus;
74 copy->has_parent_side_NS = dp->has_parent_side_NS;
75 for(ns = dp->nslist; ns; ns = ns->next) {
76 if(!delegpt_add_ns(copy, region, ns->name, ns->lame))
78 copy->nslist->resolved = ns->resolved;
79 copy->nslist->got4 = ns->got4;
80 copy->nslist->got6 = ns->got6;
81 copy->nslist->done_pside4 = ns->done_pside4;
82 copy->nslist->done_pside6 = ns->done_pside6;
84 for(a = dp->target_list; a; a = a->next_target) {
85 if(!delegpt_add_addr(copy, region, &a->addr, a->addrlen,
93 delegpt_set_name(struct delegpt* dp, struct regional* region, uint8_t* name)
95 log_assert(!dp->dp_type_mlc);
96 dp->namelabs = dname_count_size_labels(name, &dp->namelen);
97 dp->name = regional_alloc_init(region, name, dp->namelen);
102 delegpt_add_ns(struct delegpt* dp, struct regional* region, uint8_t* name,
105 struct delegpt_ns* ns;
107 (void)dname_count_size_labels(name, &len);
108 log_assert(!dp->dp_type_mlc);
109 /* slow check for duplicates to avoid counting failures when
110 * adding the same server as a dependency twice */
111 if(delegpt_find_ns(dp, name, len))
113 ns = (struct delegpt_ns*)regional_alloc(region,
114 sizeof(struct delegpt_ns));
117 ns->next = dp->nslist;
120 ns->name = regional_alloc_init(region, name, ns->namelen);
127 return ns->name != 0;
131 delegpt_find_ns(struct delegpt* dp, uint8_t* name, size_t namelen)
133 struct delegpt_ns* p = dp->nslist;
135 if(namelen == p->namelen &&
136 query_dname_compare(name, p->name) == 0) {
145 delegpt_find_addr(struct delegpt* dp, struct sockaddr_storage* addr,
148 struct delegpt_addr* p = dp->target_list;
150 if(sockaddr_cmp_addr(addr, addrlen, &p->addr, p->addrlen)==0) {
159 delegpt_add_target(struct delegpt* dp, struct regional* region,
160 uint8_t* name, size_t namelen, struct sockaddr_storage* addr,
161 socklen_t addrlen, uint8_t bogus, uint8_t lame)
163 struct delegpt_ns* ns = delegpt_find_ns(dp, name, namelen);
164 log_assert(!dp->dp_type_mlc);
170 if(addr_is_ip6(addr, addrlen))
173 if(ns->got4 && ns->got6)
176 return delegpt_add_addr(dp, region, addr, addrlen, bogus, lame);
180 delegpt_add_addr(struct delegpt* dp, struct regional* region,
181 struct sockaddr_storage* addr, socklen_t addrlen, uint8_t bogus,
184 struct delegpt_addr* a;
185 log_assert(!dp->dp_type_mlc);
186 /* check for duplicates */
187 if((a = delegpt_find_addr(dp, addr, addrlen))) {
195 a = (struct delegpt_addr*)regional_alloc(region,
196 sizeof(struct delegpt_addr));
199 a->next_target = dp->target_list;
202 a->next_usable = dp->usable_list;
204 memcpy(&a->addr, addr, addrlen);
205 a->addrlen = addrlen;
214 delegpt_count_ns(struct delegpt* dp, size_t* numns, size_t* missing)
216 struct delegpt_ns* ns;
219 for(ns = dp->nslist; ns; ns = ns->next) {
227 delegpt_count_addr(struct delegpt* dp, size_t* numaddr, size_t* numres,
230 struct delegpt_addr* a;
234 for(a = dp->target_list; a; a = a->next_target) {
237 for(a = dp->result_list; a; a = a->next_result) {
240 for(a = dp->usable_list; a; a = a->next_usable) {
245 void delegpt_log(enum verbosity_value v, struct delegpt* dp)
247 char buf[LDNS_MAX_DOMAINLEN+1];
248 struct delegpt_ns* ns;
249 struct delegpt_addr* a;
250 size_t missing=0, numns=0, numaddr=0, numres=0, numavail=0;
253 dname_str(dp->name, buf);
254 if(dp->nslist == NULL && dp->target_list == NULL) {
255 log_info("DelegationPoint<%s>: empty", buf);
258 delegpt_count_ns(dp, &numns, &missing);
259 delegpt_count_addr(dp, &numaddr, &numres, &numavail);
260 log_info("DelegationPoint<%s>: %u names (%u missing), "
261 "%u addrs (%u result, %u avail)%s",
262 buf, (unsigned)numns, (unsigned)missing,
263 (unsigned)numaddr, (unsigned)numres, (unsigned)numavail,
264 (dp->has_parent_side_NS?" parentNS":" cacheNS"));
265 if(verbosity >= VERB_ALGO) {
266 for(ns = dp->nslist; ns; ns = ns->next) {
267 dname_str(ns->name, buf);
268 log_info(" %s %s%s%s%s%s%s%s", buf,
269 (ns->resolved?"*":""),
270 (ns->got4?" A":""), (ns->got6?" AAAA":""),
271 (dp->bogus?" BOGUS":""), (ns->lame?" PARENTSIDE":""),
272 (ns->done_pside4?" PSIDE_A":""),
273 (ns->done_pside6?" PSIDE_AAAA":""));
275 for(a = dp->target_list; a; a = a->next_target) {
276 const char* str = " ";
277 if(a->bogus && a->lame) str = " BOGUS ADDR_LAME ";
278 else if(a->bogus) str = " BOGUS ";
279 else if(a->lame) str = " ADDR_LAME ";
280 log_addr(VERB_ALGO, str, &a->addr, a->addrlen);
286 delegpt_add_unused_targets(struct delegpt* dp)
288 struct delegpt_addr* usa = dp->usable_list;
289 dp->usable_list = NULL;
291 usa->next_result = dp->result_list;
292 dp->result_list = usa;
293 usa = usa->next_usable;
298 delegpt_count_targets(struct delegpt* dp)
300 struct delegpt_addr* a;
302 for(a = dp->target_list; a; a = a->next_target)
308 delegpt_count_missing_targets(struct delegpt* dp)
310 struct delegpt_ns* ns;
312 for(ns = dp->nslist; ns; ns = ns->next)
318 /** find NS rrset in given list */
319 static struct ub_packed_rrset_key*
320 find_NS(struct reply_info* rep, size_t from, size_t to)
323 for(i=from; i<to; i++) {
324 if(ntohs(rep->rrsets[i]->rk.type) == LDNS_RR_TYPE_NS)
325 return rep->rrsets[i];
331 delegpt_from_message(struct dns_msg* msg, struct regional* region)
333 struct ub_packed_rrset_key* ns_rrset = NULL;
336 /* look for NS records in the authority section... */
337 ns_rrset = find_NS(msg->rep, msg->rep->an_numrrsets,
338 msg->rep->an_numrrsets+msg->rep->ns_numrrsets);
340 /* In some cases (even legitimate, perfectly legal cases), the
341 * NS set for the "referral" might be in the answer section. */
343 ns_rrset = find_NS(msg->rep, 0, msg->rep->an_numrrsets);
345 /* If there was no NS rrset in the authority section, then this
346 * wasn't a referral message. (It might not actually be a
347 * referral message anyway) */
351 /* If we found any, then Yay! we have a delegation point. */
352 dp = delegpt_create(region);
355 dp->has_parent_side_NS = 1; /* created from message */
356 if(!delegpt_set_name(dp, region, ns_rrset->rk.dname))
358 if(!delegpt_rrset_add_ns(dp, region, ns_rrset, 0))
361 /* add glue, A and AAAA in answer and additional section */
362 for(i=0; i<msg->rep->rrset_count; i++) {
363 struct ub_packed_rrset_key* s = msg->rep->rrsets[i];
364 /* skip auth section. FIXME really needed?*/
365 if(msg->rep->an_numrrsets <= i &&
366 i < (msg->rep->an_numrrsets+msg->rep->ns_numrrsets))
369 if(ntohs(s->rk.type) == LDNS_RR_TYPE_A) {
370 if(!delegpt_add_rrset_A(dp, region, s, 0))
372 } else if(ntohs(s->rk.type) == LDNS_RR_TYPE_AAAA) {
373 if(!delegpt_add_rrset_AAAA(dp, region, s, 0))
381 delegpt_rrset_add_ns(struct delegpt* dp, struct regional* region,
382 struct ub_packed_rrset_key* ns_rrset, uint8_t lame)
384 struct packed_rrset_data* nsdata = (struct packed_rrset_data*)
385 ns_rrset->entry.data;
387 log_assert(!dp->dp_type_mlc);
388 if(nsdata->security == sec_status_bogus)
390 for(i=0; i<nsdata->count; i++) {
391 if(nsdata->rr_len[i] < 2+1) continue; /* len + root label */
392 if(dname_valid(nsdata->rr_data[i]+2, nsdata->rr_len[i]-2) !=
393 (size_t)sldns_read_uint16(nsdata->rr_data[i]))
394 continue; /* bad format */
395 /* add rdata of NS (= wirefmt dname), skip rdatalen bytes */
396 if(!delegpt_add_ns(dp, region, nsdata->rr_data[i]+2, lame))
403 delegpt_add_rrset_A(struct delegpt* dp, struct regional* region,
404 struct ub_packed_rrset_key* ak, uint8_t lame)
406 struct packed_rrset_data* d=(struct packed_rrset_data*)ak->entry.data;
408 struct sockaddr_in sa;
409 socklen_t len = (socklen_t)sizeof(sa);
410 log_assert(!dp->dp_type_mlc);
412 sa.sin_family = AF_INET;
413 sa.sin_port = (in_port_t)htons(UNBOUND_DNS_PORT);
414 for(i=0; i<d->count; i++) {
415 if(d->rr_len[i] != 2 + INET_SIZE)
417 memmove(&sa.sin_addr, d->rr_data[i]+2, INET_SIZE);
418 if(!delegpt_add_target(dp, region, ak->rk.dname,
419 ak->rk.dname_len, (struct sockaddr_storage*)&sa,
420 len, (d->security==sec_status_bogus), lame))
427 delegpt_add_rrset_AAAA(struct delegpt* dp, struct regional* region,
428 struct ub_packed_rrset_key* ak, uint8_t lame)
430 struct packed_rrset_data* d=(struct packed_rrset_data*)ak->entry.data;
432 struct sockaddr_in6 sa;
433 socklen_t len = (socklen_t)sizeof(sa);
434 log_assert(!dp->dp_type_mlc);
436 sa.sin6_family = AF_INET6;
437 sa.sin6_port = (in_port_t)htons(UNBOUND_DNS_PORT);
438 for(i=0; i<d->count; i++) {
439 if(d->rr_len[i] != 2 + INET6_SIZE) /* rdatalen + len of IP6 */
441 memmove(&sa.sin6_addr, d->rr_data[i]+2, INET6_SIZE);
442 if(!delegpt_add_target(dp, region, ak->rk.dname,
443 ak->rk.dname_len, (struct sockaddr_storage*)&sa,
444 len, (d->security==sec_status_bogus), lame))
451 delegpt_add_rrset(struct delegpt* dp, struct regional* region,
452 struct ub_packed_rrset_key* rrset, uint8_t lame)
456 if(ntohs(rrset->rk.type) == LDNS_RR_TYPE_NS)
457 return delegpt_rrset_add_ns(dp, region, rrset, lame);
458 else if(ntohs(rrset->rk.type) == LDNS_RR_TYPE_A)
459 return delegpt_add_rrset_A(dp, region, rrset, lame);
460 else if(ntohs(rrset->rk.type) == LDNS_RR_TYPE_AAAA)
461 return delegpt_add_rrset_AAAA(dp, region, rrset, lame);
462 log_warn("Unknown rrset type added to delegpt");
466 void delegpt_add_neg_msg(struct delegpt* dp, struct msgreply_entry* msg)
468 struct reply_info* rep = (struct reply_info*)msg->entry.data;
471 /* if error or no answers */
472 if(FLAGS_GET_RCODE(rep->flags) != 0 || rep->an_numrrsets == 0) {
473 struct delegpt_ns* ns = delegpt_find_ns(dp, msg->key.qname,
476 if(msg->key.qtype == LDNS_RR_TYPE_A)
478 else if(msg->key.qtype == LDNS_RR_TYPE_AAAA)
480 if(ns->got4 && ns->got6)
486 void delegpt_no_ipv6(struct delegpt* dp)
488 struct delegpt_ns* ns;
489 for(ns = dp->nslist; ns; ns = ns->next) {
490 /* no ipv6, so only ipv4 is enough to resolve a nameserver */
496 void delegpt_no_ipv4(struct delegpt* dp)
498 struct delegpt_ns* ns;
499 for(ns = dp->nslist; ns; ns = ns->next) {
500 /* no ipv4, so only ipv6 is enough to resolve a nameserver */
506 struct delegpt* delegpt_create_mlc(uint8_t* name)
508 struct delegpt* dp=(struct delegpt*)calloc(1, sizeof(*dp));
513 dp->namelabs = dname_count_size_labels(name, &dp->namelen);
514 dp->name = memdup(name, dp->namelen);
523 void delegpt_free_mlc(struct delegpt* dp)
525 struct delegpt_ns* n, *nn;
526 struct delegpt_addr* a, *na;
528 log_assert(dp->dp_type_mlc);
546 int delegpt_set_name_mlc(struct delegpt* dp, uint8_t* name)
548 log_assert(dp->dp_type_mlc);
549 dp->namelabs = dname_count_size_labels(name, &dp->namelen);
550 dp->name = memdup(name, dp->namelen);
551 return (dp->name != NULL);
554 int delegpt_add_ns_mlc(struct delegpt* dp, uint8_t* name, uint8_t lame)
556 struct delegpt_ns* ns;
558 (void)dname_count_size_labels(name, &len);
559 log_assert(dp->dp_type_mlc);
560 /* slow check for duplicates to avoid counting failures when
561 * adding the same server as a dependency twice */
562 if(delegpt_find_ns(dp, name, len))
564 ns = (struct delegpt_ns*)malloc(sizeof(struct delegpt_ns));
568 ns->name = memdup(name, ns->namelen);
573 ns->next = dp->nslist;
578 ns->lame = (uint8_t)lame;
584 int delegpt_add_addr_mlc(struct delegpt* dp, struct sockaddr_storage* addr,
585 socklen_t addrlen, uint8_t bogus, uint8_t lame)
587 struct delegpt_addr* a;
588 log_assert(dp->dp_type_mlc);
589 /* check for duplicates */
590 if((a = delegpt_find_addr(dp, addr, addrlen))) {
598 a = (struct delegpt_addr*)malloc(sizeof(struct delegpt_addr));
601 a->next_target = dp->target_list;
604 a->next_usable = dp->usable_list;
606 memcpy(&a->addr, addr, addrlen);
607 a->addrlen = addrlen;
615 int delegpt_add_target_mlc(struct delegpt* dp, uint8_t* name, size_t namelen,
616 struct sockaddr_storage* addr, socklen_t addrlen, uint8_t bogus,
619 struct delegpt_ns* ns = delegpt_find_ns(dp, name, namelen);
620 log_assert(dp->dp_type_mlc);
626 if(addr_is_ip6(addr, addrlen))
629 if(ns->got4 && ns->got6)
632 return delegpt_add_addr_mlc(dp, addr, addrlen, bogus, lame);
635 size_t delegpt_get_mem(struct delegpt* dp)
637 struct delegpt_ns* ns;
640 s = sizeof(*dp) + dp->namelen +
641 delegpt_count_targets(dp)*sizeof(struct delegpt_addr);
642 for(ns=dp->nslist; ns; ns=ns->next)
643 s += sizeof(*ns)+ns->namelen;