2 * iterator/iter_hints.c - iterative resolver module stub and root hints.
4 * Copyright (c) 2007, NLnet Labs. All rights reserved.
6 * This software is open source.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * Redistributions of source code must retain the above copyright notice,
13 * this list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 * this list of conditions and the following disclaimer in the documentation
17 * and/or other materials provided with the distribution.
19 * Neither the name of the NLNET LABS nor the names of its contributors may
20 * be used to endorse or promote products derived from this software without
21 * specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
26 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
27 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
28 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
29 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
30 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
31 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
32 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
33 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39 * This file contains functions to assist the iterator module.
40 * Keep track of stub and root hints, and read those from config.
43 #include "iterator/iter_hints.h"
44 #include "iterator/iter_delegpt.h"
46 #include "util/config_file.h"
47 #include "util/net_help.h"
48 #include "util/data/dname.h"
49 #include "sldns/rrdef.h"
50 #include "sldns/str2wire.h"
51 #include "sldns/wire2str.h"
56 struct iter_hints* hints = (struct iter_hints*)calloc(1,
57 sizeof(struct iter_hints));
63 static void hints_stub_free(struct iter_hints_stub* s)
66 delegpt_free_mlc(s->dp);
70 static void delhintnode(rbnode_type* n, void* ATTR_UNUSED(arg))
72 struct iter_hints_stub* node = (struct iter_hints_stub*)n;
73 hints_stub_free(node);
76 static void hints_del_tree(struct iter_hints* hints)
78 traverse_postorder(&hints->tree, &delhintnode, NULL);
82 hints_delete(struct iter_hints* hints)
86 hints_del_tree(hints);
90 /** add hint to delegation hints */
92 ah(struct delegpt* dp, const char* sv, const char* ip)
94 struct sockaddr_storage addr;
97 uint8_t* dname = sldns_str2wire_dname(sv, &dname_len);
99 log_err("could not parse %s", sv);
102 if(!delegpt_add_ns_mlc(dp, dname, 0) ||
103 !extstrtoaddr(ip, &addr, &addrlen) ||
104 !delegpt_add_target_mlc(dp, dname, dname_len,
105 &addr, addrlen, 0, 0)) {
113 /** obtain compiletime provided root hints */
114 static struct delegpt*
115 compile_time_root_prime(int do_ip4, int do_ip6)
118 ; This file is made available by InterNIC
119 ; under anonymous FTP as
120 ; file /domain/named.cache
121 ; on server FTP.INTERNIC.NET
122 ; -OR- RS.INTERNIC.NET
124 ; related version of root zone: changes-on-20120103
126 struct delegpt* dp = delegpt_create_mlc((uint8_t*)"\000");
129 dp->has_parent_side_NS = 1;
131 if(!ah(dp, "A.ROOT-SERVERS.NET.", "198.41.0.4")) goto failed;
132 if(!ah(dp, "B.ROOT-SERVERS.NET.", "199.9.14.201")) goto failed;
133 if(!ah(dp, "C.ROOT-SERVERS.NET.", "192.33.4.12")) goto failed;
134 if(!ah(dp, "D.ROOT-SERVERS.NET.", "199.7.91.13")) goto failed;
135 if(!ah(dp, "E.ROOT-SERVERS.NET.", "192.203.230.10")) goto failed;
136 if(!ah(dp, "F.ROOT-SERVERS.NET.", "192.5.5.241")) goto failed;
137 if(!ah(dp, "G.ROOT-SERVERS.NET.", "192.112.36.4")) goto failed;
138 if(!ah(dp, "H.ROOT-SERVERS.NET.", "198.97.190.53")) goto failed;
139 if(!ah(dp, "I.ROOT-SERVERS.NET.", "192.36.148.17")) goto failed;
140 if(!ah(dp, "J.ROOT-SERVERS.NET.", "192.58.128.30")) goto failed;
141 if(!ah(dp, "K.ROOT-SERVERS.NET.", "193.0.14.129")) goto failed;
142 if(!ah(dp, "L.ROOT-SERVERS.NET.", "199.7.83.42")) goto failed;
143 if(!ah(dp, "M.ROOT-SERVERS.NET.", "202.12.27.33")) goto failed;
146 if(!ah(dp, "A.ROOT-SERVERS.NET.", "2001:503:ba3e::2:30")) goto failed;
147 if(!ah(dp, "B.ROOT-SERVERS.NET.", "2001:500:200::b")) goto failed;
148 if(!ah(dp, "C.ROOT-SERVERS.NET.", "2001:500:2::c")) goto failed;
149 if(!ah(dp, "D.ROOT-SERVERS.NET.", "2001:500:2d::d")) goto failed;
150 if(!ah(dp, "E.ROOT-SERVERS.NET.", "2001:500:a8::e")) goto failed;
151 if(!ah(dp, "F.ROOT-SERVERS.NET.", "2001:500:2f::f")) goto failed;
152 if(!ah(dp, "G.ROOT-SERVERS.NET.", "2001:500:12::d0d")) goto failed;
153 if(!ah(dp, "H.ROOT-SERVERS.NET.", "2001:500:1::53")) goto failed;
154 if(!ah(dp, "I.ROOT-SERVERS.NET.", "2001:7fe::53")) goto failed;
155 if(!ah(dp, "J.ROOT-SERVERS.NET.", "2001:503:c27::2:30")) goto failed;
156 if(!ah(dp, "K.ROOT-SERVERS.NET.", "2001:7fd::1")) goto failed;
157 if(!ah(dp, "L.ROOT-SERVERS.NET.", "2001:500:9f::42")) goto failed;
158 if(!ah(dp, "M.ROOT-SERVERS.NET.", "2001:dc3::35")) goto failed;
162 delegpt_free_mlc(dp);
166 /** insert new hint info into hint structure */
168 hints_insert(struct iter_hints* hints, uint16_t c, struct delegpt* dp,
171 struct iter_hints_stub* node = (struct iter_hints_stub*)malloc(
172 sizeof(struct iter_hints_stub));
174 delegpt_free_mlc(dp);
178 node->noprime = (uint8_t)noprime;
179 if(!name_tree_insert(&hints->tree, &node->node, dp->name, dp->namelen,
182 dname_str(dp->name, buf);
183 log_err("second hints for zone %s ignored.", buf);
184 delegpt_free_mlc(dp);
191 static struct delegpt*
192 read_stubs_name(struct config_stub* s)
198 log_err("stub zone without a name");
201 dname = sldns_str2wire_dname(s->name, &dname_len);
203 log_err("cannot parse stub zone name %s", s->name);
206 if(!(dp=delegpt_create_mlc(dname))) {
208 log_err("out of memory");
215 /** set stub host names */
217 read_stubs_host(struct config_stub* s, struct delegpt* dp)
219 struct config_strlist* p;
222 for(p = s->hosts; p; p = p->next) {
224 dname = sldns_str2wire_dname(p->str, &dname_len);
226 log_err("cannot parse stub %s nameserver name: '%s'",
230 if(!delegpt_add_ns_mlc(dp, dname, 0)) {
232 log_err("out of memory");
240 /** set stub server addresses */
242 read_stubs_addr(struct config_stub* s, struct delegpt* dp)
244 struct config_strlist* p;
245 struct sockaddr_storage addr;
248 for(p = s->addrs; p; p = p->next) {
250 if(!authextstrtoaddr(p->str, &addr, &addrlen, &auth_name)) {
251 log_err("cannot parse stub %s ip address: '%s'",
255 #if ! defined(HAVE_SSL_SET1_HOST) && ! defined(HAVE_X509_VERIFY_PARAM_SET1_HOST)
257 log_err("no name verification functionality in "
258 "ssl library, ignored name for %s", p->str);
260 if(!delegpt_add_addr_mlc(dp, &addr, addrlen, 0, 0,
262 log_err("out of memory");
269 /** read stubs config */
271 read_stubs(struct iter_hints* hints, struct config_file* cfg)
273 struct config_stub* s;
275 for(s = cfg->stubs; s; s = s->next) {
276 if(!(dp=read_stubs_name(s)))
278 if(!read_stubs_host(s, dp) || !read_stubs_addr(s, dp)) {
279 delegpt_free_mlc(dp);
282 /* the flag is turned off for 'stub-first' so that the
283 * last resort will ask for parent-side NS record and thus
284 * fallback to the internet name servers on a failure */
285 dp->has_parent_side_NS = (uint8_t)!s->isfirst;
286 /* Do not cache if set. */
287 dp->no_cache = s->no_cache;
289 dp->ssl_upstream = (uint8_t)s->ssl_upstream;
290 delegpt_log(VERB_QUERY, dp);
291 if(!hints_insert(hints, LDNS_RR_CLASS_IN, dp, !s->isprime))
297 /** read root hints from file */
299 read_root_hints(struct iter_hints* hints, char* fname)
301 struct sldns_file_parse_state pstate;
303 uint8_t rr[LDNS_RR_BUF_SIZE];
304 size_t rr_len, dname_len;
306 uint16_t c = LDNS_RR_CLASS_IN;
307 FILE* f = fopen(fname, "r");
309 log_err("could not read root hints %s: %s",
310 fname, strerror(errno));
313 dp = delegpt_create_mlc(NULL);
315 log_err("out of memory reading root hints");
319 verbose(VERB_QUERY, "Reading root hints from %s", fname);
320 memset(&pstate, 0, sizeof(pstate));
322 dp->has_parent_side_NS = 1;
326 status = sldns_fp2wire_rr_buf(f, rr, &rr_len, &dname_len,
329 log_err("reading root hints %s %d:%d: %s", fname,
330 pstate.lineno, LDNS_WIREPARSE_OFFSET(status),
331 sldns_get_errorstr_parse(status));
335 continue; /* EMPTY line, TTL or ORIGIN */
336 if(sldns_wirerr_get_type(rr, rr_len, dname_len)
337 == LDNS_RR_TYPE_NS) {
338 if(!delegpt_add_ns_mlc(dp, sldns_wirerr_get_rdata(rr,
339 rr_len, dname_len), 0)) {
340 log_err("out of memory reading root hints");
343 c = sldns_wirerr_get_class(rr, rr_len, dname_len);
345 if(!delegpt_set_name_mlc(dp, rr)) {
346 log_err("out of memory.");
350 } else if(sldns_wirerr_get_type(rr, rr_len, dname_len)
351 == LDNS_RR_TYPE_A && sldns_wirerr_get_rdatalen(rr,
352 rr_len, dname_len) == INET_SIZE) {
353 struct sockaddr_in sa;
354 socklen_t len = (socklen_t)sizeof(sa);
356 sa.sin_family = AF_INET;
357 sa.sin_port = (in_port_t)htons(UNBOUND_DNS_PORT);
358 memmove(&sa.sin_addr,
359 sldns_wirerr_get_rdata(rr, rr_len, dname_len),
361 if(!delegpt_add_target_mlc(dp, rr, dname_len,
362 (struct sockaddr_storage*)&sa, len,
364 log_err("out of memory reading root hints");
367 } else if(sldns_wirerr_get_type(rr, rr_len, dname_len)
368 == LDNS_RR_TYPE_AAAA && sldns_wirerr_get_rdatalen(rr,
369 rr_len, dname_len) == INET6_SIZE) {
370 struct sockaddr_in6 sa;
371 socklen_t len = (socklen_t)sizeof(sa);
373 sa.sin6_family = AF_INET6;
374 sa.sin6_port = (in_port_t)htons(UNBOUND_DNS_PORT);
375 memmove(&sa.sin6_addr,
376 sldns_wirerr_get_rdata(rr, rr_len, dname_len),
378 if(!delegpt_add_target_mlc(dp, rr, dname_len,
379 (struct sockaddr_storage*)&sa, len,
381 log_err("out of memory reading root hints");
386 sldns_wire2str_type_buf(sldns_wirerr_get_type(rr,
387 rr_len, dname_len), buf, sizeof(buf));
388 log_warn("root hints %s:%d skipping type %s",
389 fname, pstate.lineno, buf);
394 log_warn("root hints %s: no NS content", fname);
395 delegpt_free_mlc(dp);
398 if(!hints_insert(hints, c, dp, 0)) {
401 delegpt_log(VERB_QUERY, dp);
405 delegpt_free_mlc(dp);
410 /** read root hints list */
412 read_root_hints_list(struct iter_hints* hints, struct config_file* cfg)
414 struct config_strlist* p;
415 for(p = cfg->root_hints; p; p = p->next) {
417 if(p->str && p->str[0]) {
419 if(cfg->chrootdir && cfg->chrootdir[0] &&
420 strncmp(p->str, cfg->chrootdir,
421 strlen(cfg->chrootdir)) == 0)
422 f += strlen(cfg->chrootdir);
423 if(!read_root_hints(hints, f))
431 hints_apply_cfg(struct iter_hints* hints, struct config_file* cfg)
433 hints_del_tree(hints);
434 name_tree_init(&hints->tree);
436 /* read root hints */
437 if(!read_root_hints_list(hints, cfg))
440 /* read stub hints */
441 if(!read_stubs(hints, cfg))
444 /* use fallback compiletime root hints */
445 if(!hints_lookup_root(hints, LDNS_RR_CLASS_IN)) {
446 struct delegpt* dp = compile_time_root_prime(cfg->do_ip4,
448 verbose(VERB_ALGO, "no config, using builtin root hints.");
451 if(!hints_insert(hints, LDNS_RR_CLASS_IN, dp, 0))
455 name_tree_init_parents(&hints->tree);
460 hints_lookup_root(struct iter_hints* hints, uint16_t qclass)
463 struct iter_hints_stub *stub;
464 stub = (struct iter_hints_stub*)name_tree_find(&hints->tree,
465 &rootlab, 1, 1, qclass);
471 struct iter_hints_stub*
472 hints_lookup_stub(struct iter_hints* hints, uint8_t* qname,
473 uint16_t qclass, struct delegpt* cache_dp)
477 struct iter_hints_stub *r;
479 /* first lookup the stub */
480 labs = dname_count_size_labels(qname, &len);
481 r = (struct iter_hints_stub*)name_tree_lookup(&hints->tree, qname,
485 /* If there is no cache (root prime situation) */
486 if(cache_dp == NULL) {
487 if(r->dp->namelabs != 1)
488 return r; /* no cache dp, use any non-root stub */
493 * If the stub is same as the delegation we got
494 * And has noprime set, we need to 'prime' to use this stub instead.
496 if(r->noprime && query_dname_compare(cache_dp->name, r->dp->name)==0)
497 return r; /* use this stub instead of cached dp */
500 * If our cached delegation point is above the hint, we need to prime.
502 if(dname_strict_subdomain(r->dp->name, r->dp->namelabs,
503 cache_dp->name, cache_dp->namelabs))
504 return r; /* need to prime this stub */
508 int hints_next_root(struct iter_hints* hints, uint16_t* qclass)
510 return name_tree_next_root(&hints->tree, qclass);
514 hints_get_mem(struct iter_hints* hints)
517 struct iter_hints_stub* p;
520 RBTREE_FOR(p, struct iter_hints_stub*, &hints->tree) {
521 s += sizeof(*p) + delegpt_get_mem(p->dp);
527 hints_add_stub(struct iter_hints* hints, uint16_t c, struct delegpt* dp,
530 struct iter_hints_stub *z;
531 if((z=(struct iter_hints_stub*)name_tree_find(&hints->tree,
532 dp->name, dp->namelen, dp->namelabs, c)) != NULL) {
533 (void)rbtree_delete(&hints->tree, &z->node);
536 if(!hints_insert(hints, c, dp, noprime))
538 name_tree_init_parents(&hints->tree);
543 hints_delete_stub(struct iter_hints* hints, uint16_t c, uint8_t* nm)
545 struct iter_hints_stub *z;
547 int labs = dname_count_size_labels(nm, &len);
548 if(!(z=(struct iter_hints_stub*)name_tree_find(&hints->tree,
550 return; /* nothing to do */
551 (void)rbtree_delete(&hints->tree, &z->node);
553 name_tree_init_parents(&hints->tree);