2 * validator/autotrust.c - RFC5011 trust anchor management for unbound.
4 * Copyright (c) 2009, 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 * Contains autotrust implementation. The implementation was taken from
40 * the autotrust daemon (BSD licensed), written by Matthijs Mekking.
41 * It was modified to fit into unbound. The state table process is the same.
44 #include "validator/autotrust.h"
45 #include "validator/val_anchor.h"
46 #include "validator/val_utils.h"
47 #include "validator/val_sigcrypt.h"
48 #include "util/data/dname.h"
49 #include "util/data/packed_rrset.h"
51 #include "util/module.h"
52 #include "util/net_help.h"
53 #include "util/config_file.h"
54 #include "util/regional.h"
55 #include "util/random.h"
56 #include "util/data/msgparse.h"
57 #include "services/mesh.h"
58 #include "services/cache/rrset.h"
59 #include "validator/val_kcache.h"
60 #include "sldns/sbuffer.h"
61 #include "sldns/wire2str.h"
62 #include "sldns/str2wire.h"
63 #include "sldns/keyraw.h"
64 #include "sldns/rrdef.h"
68 /** number of times a key must be seen before it can become valid */
69 #define MIN_PENDINGCOUNT 2
72 static void do_revoked(struct module_env* env, struct autr_ta* anchor, int* c);
74 struct autr_global_data* autr_global_create(void)
76 struct autr_global_data* global;
77 global = (struct autr_global_data*)malloc(sizeof(*global));
80 rbtree_init(&global->probe, &probetree_cmp);
84 void autr_global_delete(struct autr_global_data* global)
88 /* elements deleted by parent */
89 memset(global, 0, sizeof(*global));
93 int probetree_cmp(const void* x, const void* y)
95 struct trust_anchor* a = (struct trust_anchor*)x;
96 struct trust_anchor* b = (struct trust_anchor*)y;
97 log_assert(a->autr && b->autr);
98 if(a->autr->next_probe_time < b->autr->next_probe_time)
100 if(a->autr->next_probe_time > b->autr->next_probe_time)
102 /* time is equal, sort on trust point identity */
103 return anchor_cmp(x, y);
107 autr_get_num_anchors(struct val_anchors* anchors)
112 lock_basic_lock(&anchors->lock);
114 res = anchors->autr->probe.count;
115 lock_basic_unlock(&anchors->lock);
119 /** Position in string */
121 position_in_string(char *str, const char* sub)
123 char* pos = strstr(str, sub);
125 return (int)(pos-str)+(int)strlen(sub);
129 /** Debug routine to print pretty key information */
131 verbose_key(struct autr_ta* ta, enum verbosity_value level,
132 const char* format, ...) ATTR_FORMAT(printf, 3, 4);
135 * Implementation of debug pretty key print
136 * @param ta: trust anchor key with DNSKEY data.
137 * @param level: verbosity level to print at.
138 * @param format: printf style format string.
141 verbose_key(struct autr_ta* ta, enum verbosity_value level,
142 const char* format, ...)
145 va_start(args, format);
146 if(verbosity >= level) {
147 char* str = sldns_wire2str_dname(ta->rr, ta->dname_len);
148 int keytag = (int)sldns_calc_keytag_raw(sldns_wirerr_get_rdata(
149 ta->rr, ta->rr_len, ta->dname_len),
150 sldns_wirerr_get_rdatalen(ta->rr, ta->rr_len,
152 char msg[MAXSYSLOGMSGLEN];
153 vsnprintf(msg, sizeof(msg), format, args);
154 verbose(level, "%s key %d %s", str?str:"??", keytag, msg);
162 * @param str: to parse
163 * @param ta: trust key autotrust metadata
164 * @return false on failure.
167 parse_comments(char* str, struct autr_ta* ta)
169 int len = (int)strlen(str), pos = 0, timestamp = 0;
170 char* comment = (char*) malloc(sizeof(char)*len+1);
171 char* comments = comment;
173 log_err("malloc failure in parse");
176 /* skip over whitespace and data at start of line */
177 while (*str != '\0' && *str != ';')
193 pos = position_in_string(comments, "state=");
194 if (pos >= (int) strlen(comments))
196 log_err("parse error");
201 ta->s = AUTR_STATE_VALID;
204 int s = (int) comments[pos] - '0';
207 case AUTR_STATE_START:
208 case AUTR_STATE_ADDPEND:
209 case AUTR_STATE_VALID:
210 case AUTR_STATE_MISSING:
211 case AUTR_STATE_REVOKED:
212 case AUTR_STATE_REMOVED:
216 verbose_key(ta, VERB_OPS, "has undefined "
217 "state, considered NewKey");
218 ta->s = AUTR_STATE_START;
222 /* read pending count */
223 pos = position_in_string(comments, "count=");
224 if (pos >= (int) strlen(comments))
226 log_err("parse error");
231 ta->pending_count = 0;
235 ta->pending_count = (uint8_t)atoi(comments);
238 /* read last change */
239 pos = position_in_string(comments, "lastchange=");
240 if (pos >= (int) strlen(comments))
242 log_err("parse error");
249 timestamp = atoi(comments);
251 if (pos < 0 || !timestamp)
254 ta->last_change = (time_t)timestamp;
260 /** Check if a line contains data (besides comments) */
262 str_contains_data(char* str, char comment)
264 while (*str != '\0') {
265 if (*str == comment || *str == '\n')
267 if (*str != ' ' && *str != '\t')
275 * rdata without rdatalen in front of it. */
277 dnskey_flags(uint16_t t, uint8_t* rdata, size_t len)
280 if(t != LDNS_RR_TYPE_DNSKEY)
284 memmove(&f, rdata, 2);
289 /** Check if KSK DNSKEY.
290 * pass rdata without rdatalen in front of it */
292 rr_is_dnskey_sep(uint16_t t, uint8_t* rdata, size_t len)
294 return (dnskey_flags(t, rdata, len)&DNSKEY_BIT_SEP);
297 /** Check if TA is KSK DNSKEY */
299 ta_is_dnskey_sep(struct autr_ta* ta)
301 return (dnskey_flags(
302 sldns_wirerr_get_type(ta->rr, ta->rr_len, ta->dname_len),
303 sldns_wirerr_get_rdata(ta->rr, ta->rr_len, ta->dname_len),
304 sldns_wirerr_get_rdatalen(ta->rr, ta->rr_len, ta->dname_len)
308 /** Check if REVOKED DNSKEY
309 * pass rdata without rdatalen in front of it */
311 rr_is_dnskey_revoked(uint16_t t, uint8_t* rdata, size_t len)
313 return (dnskey_flags(t, rdata, len)&LDNS_KEY_REVOKE_KEY);
317 static struct autr_ta*
318 autr_ta_create(uint8_t* rr, size_t rr_len, size_t dname_len)
320 struct autr_ta* ta = (struct autr_ta*)calloc(1, sizeof(*ta));
327 ta->dname_len = dname_len;
332 static struct trust_anchor*
333 autr_tp_create(struct val_anchors* anchors, uint8_t* own, size_t own_len,
336 struct trust_anchor* tp = (struct trust_anchor*)calloc(1, sizeof(*tp));
338 tp->name = memdup(own, own_len);
343 tp->namelen = own_len;
344 tp->namelabs = dname_count_labels(tp->name);
347 tp->autr = (struct autr_point_data*)calloc(1, sizeof(*tp->autr));
353 tp->autr->pnode.key = tp;
355 lock_basic_lock(&anchors->lock);
356 if(!rbtree_insert(anchors->tree, &tp->node)) {
357 lock_basic_unlock(&anchors->lock);
358 log_err("trust anchor presented twice");
364 if(!rbtree_insert(&anchors->autr->probe, &tp->autr->pnode)) {
365 (void)rbtree_delete(anchors->tree, tp);
366 lock_basic_unlock(&anchors->lock);
367 log_err("trust anchor in probetree twice");
373 lock_basic_unlock(&anchors->lock);
374 lock_basic_init(&tp->lock);
375 lock_protect(&tp->lock, tp, sizeof(*tp));
376 lock_protect(&tp->lock, tp->autr, sizeof(*tp->autr));
380 /** delete assembled rrsets */
382 autr_rrset_delete(struct ub_packed_rrset_key* r)
391 void autr_point_delete(struct trust_anchor* tp)
395 lock_unprotect(&tp->lock, tp);
396 lock_unprotect(&tp->lock, tp->autr);
397 lock_basic_destroy(&tp->lock);
398 autr_rrset_delete(tp->ds_rrset);
399 autr_rrset_delete(tp->dnskey_rrset);
401 struct autr_ta* p = tp->autr->keys, *np;
408 free(tp->autr->file);
415 /** find or add a new trust point for autotrust */
416 static struct trust_anchor*
417 find_add_tp(struct val_anchors* anchors, uint8_t* rr, size_t rr_len,
420 struct trust_anchor* tp;
421 tp = anchor_find(anchors, rr, dname_count_labels(rr), dname_len,
422 sldns_wirerr_get_class(rr, rr_len, dname_len));
425 log_err("anchor cannot be with and without autotrust");
426 lock_basic_unlock(&tp->lock);
431 tp = autr_tp_create(anchors, rr, dname_len, sldns_wirerr_get_class(rr,
433 lock_basic_lock(&tp->lock);
437 /** Add trust anchor from RR */
438 static struct autr_ta*
439 add_trustanchor_frm_rr(struct val_anchors* anchors, uint8_t* rr, size_t rr_len,
440 size_t dname_len, struct trust_anchor** tp)
442 struct autr_ta* ta = autr_ta_create(rr, rr_len, dname_len);
445 *tp = find_add_tp(anchors, rr, rr_len, dname_len);
452 ta->next = (*tp)->autr->keys;
453 (*tp)->autr->keys = ta;
454 lock_basic_unlock(&(*tp)->lock);
459 * Add new trust anchor from a string in file.
460 * @param anchors: all anchors
461 * @param str: string with anchor and comments, if any comments.
462 * @param tp: trust point returned.
463 * @param origin: what to use for @
464 * @param origin_len: length of origin
465 * @param prev: previous rr name
466 * @param prev_len: length of prev
467 * @param skip: if true, the result is NULL, but not an error, skip it.
468 * @return new key in trust point.
470 static struct autr_ta*
471 add_trustanchor_frm_str(struct val_anchors* anchors, char* str,
472 struct trust_anchor** tp, uint8_t* origin, size_t origin_len,
473 uint8_t** prev, size_t* prev_len, int* skip)
475 uint8_t rr[LDNS_RR_BUF_SIZE];
476 size_t rr_len = sizeof(rr), dname_len;
479 if (!str_contains_data(str, ';')) {
481 return NULL; /* empty line */
483 if(0 != (lstatus = sldns_str2wire_rr_buf(str, rr, &rr_len, &dname_len,
484 0, origin, origin_len, *prev, *prev_len)))
486 log_err("ldns error while converting string to RR at%d: %s: %s",
487 LDNS_WIREPARSE_OFFSET(lstatus),
488 sldns_get_errorstr_parse(lstatus), str);
492 *prev = memdup(rr, dname_len);
493 *prev_len = dname_len;
495 log_err("malloc failure in add_trustanchor");
498 if(sldns_wirerr_get_type(rr, rr_len, dname_len)!=LDNS_RR_TYPE_DNSKEY &&
499 sldns_wirerr_get_type(rr, rr_len, dname_len)!=LDNS_RR_TYPE_DS) {
501 return NULL; /* only DS and DNSKEY allowed */
503 drr = memdup(rr, rr_len);
505 log_err("malloc failure in add trustanchor");
508 return add_trustanchor_frm_rr(anchors, drr, rr_len, dname_len, tp);
513 * @param anchors: all points.
514 * @param str: comments line
515 * @param fname: filename
516 * @param origin: the $ORIGIN.
517 * @param origin_len: length of origin
518 * @param prev: passed to ldns.
519 * @param prev_len: length of prev
520 * @param skip: if true, the result is NULL, but not an error, skip it.
521 * @return false on failure, otherwise the tp read.
523 static struct trust_anchor*
524 load_trustanchor(struct val_anchors* anchors, char* str, const char* fname,
525 uint8_t* origin, size_t origin_len, uint8_t** prev, size_t* prev_len,
528 struct autr_ta* ta = NULL;
529 struct trust_anchor* tp = NULL;
531 ta = add_trustanchor_frm_str(anchors, str, &tp, origin, origin_len,
532 prev, prev_len, skip);
535 lock_basic_lock(&tp->lock);
536 if(!parse_comments(str, ta)) {
537 lock_basic_unlock(&tp->lock);
540 if(!tp->autr->file) {
541 tp->autr->file = strdup(fname);
542 if(!tp->autr->file) {
543 lock_basic_unlock(&tp->lock);
544 log_err("malloc failure");
548 lock_basic_unlock(&tp->lock);
552 /** iterator for DSes from keylist. return true if a next element exists */
554 assemble_iterate_ds(struct autr_ta** list, uint8_t** rr, size_t* rr_len,
558 if(sldns_wirerr_get_type((*list)->rr, (*list)->rr_len,
559 (*list)->dname_len) == LDNS_RR_TYPE_DS) {
561 *rr_len = (*list)->rr_len;
562 *dname_len = (*list)->dname_len;
563 *list = (*list)->next;
566 *list = (*list)->next;
571 /** iterator for DNSKEYs from keylist. return true if a next element exists */
573 assemble_iterate_dnskey(struct autr_ta** list, uint8_t** rr, size_t* rr_len,
577 if(sldns_wirerr_get_type((*list)->rr, (*list)->rr_len,
578 (*list)->dname_len) != LDNS_RR_TYPE_DS &&
579 ((*list)->s == AUTR_STATE_VALID ||
580 (*list)->s == AUTR_STATE_MISSING)) {
582 *rr_len = (*list)->rr_len;
583 *dname_len = (*list)->dname_len;
584 *list = (*list)->next;
587 *list = (*list)->next;
592 /** see if iterator-list has any elements in it, or it is empty */
594 assemble_iterate_hasfirst(int iter(struct autr_ta**, uint8_t**, size_t*,
595 size_t*), struct autr_ta* list)
598 size_t rr_len = 0, dname_len = 0;
599 return iter(&list, &rr, &rr_len, &dname_len);
602 /** number of elements in iterator list */
604 assemble_iterate_count(int iter(struct autr_ta**, uint8_t**, size_t*,
605 size_t*), struct autr_ta* list)
608 size_t i = 0, rr_len = 0, dname_len = 0;
609 while(iter(&list, &rr, &rr_len, &dname_len)) {
616 * Create a ub_packed_rrset_key allocated on the heap.
617 * It therefore does not have the correct ID value, and cannot be used
618 * inside the cache. It can be used in storage outside of the cache.
619 * Keys for the cache have to be obtained from alloc.h .
620 * @param iter: iterator over the elements in the list. It filters elements.
621 * @param list: the list.
622 * @return key allocated or NULL on failure.
624 static struct ub_packed_rrset_key*
625 ub_packed_rrset_heap_key(int iter(struct autr_ta**, uint8_t**, size_t*,
626 size_t*), struct autr_ta* list)
629 size_t rr_len = 0, dname_len = 0;
630 struct ub_packed_rrset_key* k;
631 if(!iter(&list, &rr, &rr_len, &dname_len))
633 k = (struct ub_packed_rrset_key*)calloc(1, sizeof(*k));
636 k->rk.type = htons(sldns_wirerr_get_type(rr, rr_len, dname_len));
637 k->rk.rrset_class = htons(sldns_wirerr_get_class(rr, rr_len, dname_len));
638 k->rk.dname_len = dname_len;
639 k->rk.dname = memdup(rr, dname_len);
648 * Create packed_rrset data on the heap.
649 * @param iter: iterator over the elements in the list. It filters elements.
650 * @param list: the list.
651 * @return data allocated or NULL on failure.
653 static struct packed_rrset_data*
654 packed_rrset_heap_data(int iter(struct autr_ta**, uint8_t**, size_t*,
655 size_t*), struct autr_ta* list)
658 size_t rr_len = 0, dname_len = 0;
659 struct packed_rrset_data* data;
660 size_t count=0, rrsig_count=0, len=0, i, total;
662 struct autr_ta* list_i;
666 while(iter(&list_i, &rr, &rr_len, &dname_len)) {
667 if(sldns_wirerr_get_type(rr, rr_len, dname_len) ==
671 /* sizeof the rdlength + rdatalen */
672 len += 2 + sldns_wirerr_get_rdatalen(rr, rr_len, dname_len);
673 ttl = (time_t)sldns_wirerr_get_ttl(rr, rr_len, dname_len);
675 if(count == 0 && rrsig_count == 0)
679 total = count + rrsig_count;
680 len += sizeof(*data) + total*(sizeof(size_t) + sizeof(time_t) +
682 data = (struct packed_rrset_data*)calloc(1, len);
689 data->rrsig_count = rrsig_count;
690 data->rr_len = (size_t*)((uint8_t*)data +
691 sizeof(struct packed_rrset_data));
692 data->rr_data = (uint8_t**)&(data->rr_len[total]);
693 data->rr_ttl = (time_t*)&(data->rr_data[total]);
694 nextrdata = (uint8_t*)&(data->rr_ttl[total]);
696 /* fill out len, ttl, fields */
699 while(iter(&list_i, &rr, &rr_len, &dname_len)) {
700 data->rr_ttl[i] = (time_t)sldns_wirerr_get_ttl(rr, rr_len,
702 if(data->rr_ttl[i] < data->ttl)
703 data->ttl = data->rr_ttl[i];
704 data->rr_len[i] = 2 /* the rdlength */ +
705 sldns_wirerr_get_rdatalen(rr, rr_len, dname_len);
709 /* fixup rest of ptrs */
710 for(i=0; i<total; i++) {
711 data->rr_data[i] = nextrdata;
712 nextrdata += data->rr_len[i];
715 /* copy data in there */
718 while(iter(&list_i, &rr, &rr_len, &dname_len)) {
719 memmove(data->rr_data[i],
720 sldns_wirerr_get_rdatawl(rr, rr_len, dname_len),
725 if(data->rrsig_count && data->count == 0) {
726 data->count = data->rrsig_count; /* rrset type is RRSIG */
727 data->rrsig_count = 0;
733 * Assemble the trust anchors into DS and DNSKEY packed rrsets.
734 * Uses only VALID and MISSING DNSKEYs.
735 * Read the sldns_rrs and builds packed rrsets
736 * @param tp: the trust point. Must be locked.
737 * @return false on malloc failure.
740 autr_assemble(struct trust_anchor* tp)
742 struct ub_packed_rrset_key* ubds=NULL, *ubdnskey=NULL;
744 /* make packed rrset keys - malloced with no ID number, they
745 * are not in the cache */
746 /* make packed rrset data (if there is a key) */
747 if(assemble_iterate_hasfirst(assemble_iterate_ds, tp->autr->keys)) {
748 ubds = ub_packed_rrset_heap_key(
749 assemble_iterate_ds, tp->autr->keys);
752 ubds->entry.data = packed_rrset_heap_data(
753 assemble_iterate_ds, tp->autr->keys);
754 if(!ubds->entry.data)
758 /* make packed DNSKEY data */
759 if(assemble_iterate_hasfirst(assemble_iterate_dnskey, tp->autr->keys)) {
760 ubdnskey = ub_packed_rrset_heap_key(
761 assemble_iterate_dnskey, tp->autr->keys);
764 ubdnskey->entry.data = packed_rrset_heap_data(
765 assemble_iterate_dnskey, tp->autr->keys);
766 if(!ubdnskey->entry.data) {
768 autr_rrset_delete(ubds);
769 autr_rrset_delete(ubdnskey);
774 /* we have prepared the new keys so nothing can go wrong any more.
775 * And we are sure we cannot be left without trustanchor after
776 * any errors. Put in the new keys and remove old ones. */
778 /* free the old data */
779 autr_rrset_delete(tp->ds_rrset);
780 autr_rrset_delete(tp->dnskey_rrset);
782 /* assign the data to replace the old */
784 tp->dnskey_rrset = ubdnskey;
785 tp->numDS = assemble_iterate_count(assemble_iterate_ds,
787 tp->numDNSKEY = assemble_iterate_count(assemble_iterate_dnskey,
794 parse_int(char* line, int* ret)
797 unsigned int x = (unsigned int)strtol(line, &e, 10);
799 *ret = -1; /* parse error */
802 *ret = 1; /* matched */
806 /** parse id sequence for anchor */
807 static struct trust_anchor*
808 parse_id(struct val_anchors* anchors, char* line)
810 struct trust_anchor *tp;
815 /* read the owner name */
816 char* next = strchr(line, ' ');
820 dname = sldns_str2wire_dname(line, &dname_len);
825 dclass = parse_int(next+1, &r);
831 /* find the trust point */
832 tp = autr_tp_create(anchors, dname, dname_len, dclass);
838 * Parse variable from trustanchor header
839 * @param line: to parse
840 * @param anchors: the anchor is added to this, if "id:" is seen.
841 * @param anchor: the anchor as result value or previously returned anchor
842 * value to read the variable lines into.
843 * @return: 0 no match, -1 failed syntax error, +1 success line read.
844 * +2 revoked trust anchor file.
847 parse_var_line(char* line, struct val_anchors* anchors,
848 struct trust_anchor** anchor)
850 struct trust_anchor* tp = *anchor;
852 if(strncmp(line, ";;id: ", 6) == 0) {
853 *anchor = parse_id(anchors, line+6);
854 if(!*anchor) return -1;
856 } else if(strncmp(line, ";;REVOKED", 9) == 0) {
858 log_err("REVOKED statement must be at start of file");
862 } else if(strncmp(line, ";;last_queried: ", 16) == 0) {
864 lock_basic_lock(&tp->lock);
865 tp->autr->last_queried = (time_t)parse_int(line+16, &r);
866 lock_basic_unlock(&tp->lock);
867 } else if(strncmp(line, ";;last_success: ", 16) == 0) {
869 lock_basic_lock(&tp->lock);
870 tp->autr->last_success = (time_t)parse_int(line+16, &r);
871 lock_basic_unlock(&tp->lock);
872 } else if(strncmp(line, ";;next_probe_time: ", 19) == 0) {
874 lock_basic_lock(&anchors->lock);
875 lock_basic_lock(&tp->lock);
876 (void)rbtree_delete(&anchors->autr->probe, tp);
877 tp->autr->next_probe_time = (time_t)parse_int(line+19, &r);
878 (void)rbtree_insert(&anchors->autr->probe, &tp->autr->pnode);
879 lock_basic_unlock(&tp->lock);
880 lock_basic_unlock(&anchors->lock);
881 } else if(strncmp(line, ";;query_failed: ", 16) == 0) {
883 lock_basic_lock(&tp->lock);
884 tp->autr->query_failed = (uint8_t)parse_int(line+16, &r);
885 lock_basic_unlock(&tp->lock);
886 } else if(strncmp(line, ";;query_interval: ", 18) == 0) {
888 lock_basic_lock(&tp->lock);
889 tp->autr->query_interval = (time_t)parse_int(line+18, &r);
890 lock_basic_unlock(&tp->lock);
891 } else if(strncmp(line, ";;retry_time: ", 14) == 0) {
893 lock_basic_lock(&tp->lock);
894 tp->autr->retry_time = (time_t)parse_int(line+14, &r);
895 lock_basic_unlock(&tp->lock);
900 /** handle origin lines */
902 handle_origin(char* line, uint8_t** origin, size_t* origin_len)
905 while(isspace((unsigned char)*line))
907 if(strncmp(line, "$ORIGIN", 7) != 0)
911 while(isspace((unsigned char)*line))
913 *origin = sldns_str2wire_dname(line, &len);
916 log_warn("malloc failure or parse error in $ORIGIN");
920 /** Read one line and put multiline RRs onto one line string */
922 read_multiline(char* buf, size_t len, FILE* in, int* linenr)
928 while(left > 0 && fgets(pos, (int)left, in) != NULL) {
929 size_t i, poslen = strlen(pos);
932 /* check what the new depth is after the line */
933 /* this routine cannot handle braces inside quotes,
934 say for TXT records, but this routine only has to read keys */
935 for(i=0; i<poslen; i++) {
938 } else if(pos[i] == ')') {
940 log_err("mismatch: too many ')'");
944 } else if(pos[i] == ';') {
949 /* normal oneline or last line: keeps newline and comments */
954 /* more lines expected, snip off comments and newline */
956 pos[poslen-1] = 0; /* strip newline */
958 strchr(pos, ';')[0] = 0; /* strip comments */
960 /* move to paste other lines behind this one */
961 poslen = strlen(pos);
964 /* the newline is changed into a space */
965 if(left <= 2 /* space and eos */) {
966 log_err("line too long");
975 log_err("mismatch: too many '('");
983 int autr_read_file(struct val_anchors* anchors, const char* nm)
985 /* the file descriptor */
987 /* keep track of line numbers */
991 /* trust point being read */
992 struct trust_anchor *tp = NULL, *tp2;
994 /* for $ORIGIN parsing */
995 uint8_t *origin=NULL, *prev=NULL;
996 size_t origin_len=0, prev_len=0;
998 if (!(fd = fopen(nm, "r"))) {
999 log_err("unable to open %s for reading: %s",
1000 nm, strerror(errno));
1003 verbose(VERB_ALGO, "reading autotrust anchor file %s", nm);
1004 while ( (r=read_multiline(line, sizeof(line), fd, &line_nr)) != 0) {
1005 if(r == -1 || (r = parse_var_line(line, anchors, &tp)) == -1) {
1006 log_err("could not parse auto-trust-anchor-file "
1007 "%s line %d", nm, line_nr);
1015 log_warn("trust anchor %s has been revoked", nm);
1021 if (!str_contains_data(line, ';'))
1022 continue; /* empty lines allowed */
1023 if(handle_origin(line, &origin, &origin_len))
1026 if(!(tp2=load_trustanchor(anchors, line, nm, origin,
1027 origin_len, &prev, &prev_len, &r))) {
1028 if(!r) log_err("failed to load trust anchor from %s "
1029 "at line %i, skipping", nm, line_nr);
1030 /* try to do the rest */
1033 if(tp && tp != tp2) {
1034 log_err("file %s has mismatching data inside: "
1035 "the file may only contain keys for one name, "
1036 "remove keys for other domain names", nm);
1048 log_err("failed to read %s", nm);
1052 /* now assemble the data into DNSKEY and DS packed rrsets */
1053 lock_basic_lock(&tp->lock);
1054 if(!autr_assemble(tp)) {
1055 lock_basic_unlock(&tp->lock);
1056 log_err("malloc failure assembling %s", nm);
1059 lock_basic_unlock(&tp->lock);
1063 /** string for a trustanchor state */
1065 trustanchor_state2str(autr_state_t s)
1068 case AUTR_STATE_START: return " START ";
1069 case AUTR_STATE_ADDPEND: return " ADDPEND ";
1070 case AUTR_STATE_VALID: return " VALID ";
1071 case AUTR_STATE_MISSING: return " MISSING ";
1072 case AUTR_STATE_REVOKED: return " REVOKED ";
1073 case AUTR_STATE_REMOVED: return " REMOVED ";
1078 /** print ID to file */
1080 print_id(FILE* out, char* fname, uint8_t* nm, size_t nmlen, uint16_t dclass)
1082 char* s = sldns_wire2str_dname(nm, nmlen);
1084 log_err("malloc failure in write to %s", fname);
1087 if(fprintf(out, ";;id: %s %d\n", s, (int)dclass) < 0) {
1088 log_err("could not write to %s: %s", fname, strerror(errno));
1097 autr_write_contents(FILE* out, char* fn, struct trust_anchor* tp)
1103 /* write pretty header */
1104 if(fprintf(out, "; autotrust trust anchor file\n") < 0) {
1105 log_err("could not write to %s: %s", fn, strerror(errno));
1108 if(tp->autr->revoked) {
1109 if(fprintf(out, ";;REVOKED\n") < 0 ||
1110 fprintf(out, "; The zone has all keys revoked, and is\n"
1111 "; considered as if it has no trust anchors.\n"
1112 "; the remainder of the file is the last probe.\n"
1113 "; to restart the trust anchor, overwrite this file.\n"
1114 "; with one containing valid DNSKEYs or DSes.\n") < 0) {
1115 log_err("could not write to %s: %s", fn, strerror(errno));
1119 if(!print_id(out, fn, tp->name, tp->namelen, tp->dclass)) {
1122 if(fprintf(out, ";;last_queried: %u ;;%s",
1123 (unsigned int)tp->autr->last_queried,
1124 ctime_r(&(tp->autr->last_queried), tmi)) < 0 ||
1125 fprintf(out, ";;last_success: %u ;;%s",
1126 (unsigned int)tp->autr->last_success,
1127 ctime_r(&(tp->autr->last_success), tmi)) < 0 ||
1128 fprintf(out, ";;next_probe_time: %u ;;%s",
1129 (unsigned int)tp->autr->next_probe_time,
1130 ctime_r(&(tp->autr->next_probe_time), tmi)) < 0 ||
1131 fprintf(out, ";;query_failed: %d\n", (int)tp->autr->query_failed)<0
1132 || fprintf(out, ";;query_interval: %d\n",
1133 (int)tp->autr->query_interval) < 0 ||
1134 fprintf(out, ";;retry_time: %d\n", (int)tp->autr->retry_time) < 0) {
1135 log_err("could not write to %s: %s", fn, strerror(errno));
1140 for(ta=tp->autr->keys; ta; ta=ta->next) {
1141 /* by default do not store START and REMOVED keys */
1142 if(ta->s == AUTR_STATE_START)
1144 if(ta->s == AUTR_STATE_REMOVED)
1146 /* only store keys */
1147 if(sldns_wirerr_get_type(ta->rr, ta->rr_len, ta->dname_len)
1148 != LDNS_RR_TYPE_DNSKEY)
1150 str = sldns_wire2str_rr(ta->rr, ta->rr_len);
1151 if(!str || !str[0]) {
1153 log_err("malloc failure writing %s", fn);
1156 str[strlen(str)-1] = 0; /* remove newline */
1157 if(fprintf(out, "%s ;;state=%d [%s] ;;count=%d "
1158 ";;lastchange=%u ;;%s", str, (int)ta->s,
1159 trustanchor_state2str(ta->s), (int)ta->pending_count,
1160 (unsigned int)ta->last_change,
1161 ctime_r(&(ta->last_change), tmi)) < 0) {
1162 log_err("could not write to %s: %s", fn, strerror(errno));
1171 void autr_write_file(struct module_env* env, struct trust_anchor* tp)
1174 char* fname = tp->autr->file;
1176 log_assert(tp->autr);
1178 log_err("autr_write_file: Module environment is NULL.");
1181 /* unique name with pid number and thread number */
1182 snprintf(tempf, sizeof(tempf), "%s.%d-%d", fname, (int)getpid(),
1183 env->worker?*(int*)env->worker:0);
1184 verbose(VERB_ALGO, "autotrust: write to disk: %s", tempf);
1185 out = fopen(tempf, "w");
1187 fatal_exit("could not open autotrust file for writing, %s: %s",
1188 tempf, strerror(errno));
1191 if(!autr_write_contents(out, tempf, tp)) {
1192 /* failed to write contents (completely) */
1195 fatal_exit("could not completely write: %s", fname);
1198 if(fclose(out) != 0) {
1199 fatal_exit("could not complete write: %s: %s",
1200 fname, strerror(errno));
1204 /* success; overwrite actual file */
1205 verbose(VERB_ALGO, "autotrust: replaced %s", fname);
1206 #ifdef UB_ON_WINDOWS
1207 (void)unlink(fname); /* windows does not replace file with rename() */
1209 if(rename(tempf, fname) < 0) {
1210 fatal_exit("rename(%s to %s): %s", tempf, fname, strerror(errno));
1215 * Verify if dnskey works for trust point
1216 * @param env: environment (with time) for verification
1217 * @param ve: validator environment (with options) for verification.
1218 * @param tp: trust point to verify with
1219 * @param rrset: DNSKEY rrset to verify.
1220 * @return false on failure, true if verification successful.
1223 verify_dnskey(struct module_env* env, struct val_env* ve,
1224 struct trust_anchor* tp, struct ub_packed_rrset_key* rrset)
1226 char* reason = NULL;
1227 uint8_t sigalg[ALGO_NEEDS_MAX+1];
1228 int downprot = env->cfg->harden_algo_downgrade;
1229 enum sec_status sec = val_verify_DNSKEY_with_TA(env, ve, rrset,
1230 tp->ds_rrset, tp->dnskey_rrset, downprot?sigalg:NULL, &reason);
1231 /* sigalg is ignored, it returns algorithms signalled to exist, but
1232 * in 5011 there are no other rrsets to check. if downprot is
1233 * enabled, then it checks that the DNSKEY is signed with all
1234 * algorithms available in the trust store. */
1235 verbose(VERB_ALGO, "autotrust: validate DNSKEY with anchor: %s",
1236 sec_status_to_string(sec));
1237 return sec == sec_status_secure;
1241 rrsig_get_expiry(uint8_t* d, size_t len)
1243 /* rrsig: 2(rdlen), 2(type) 1(alg) 1(v) 4(origttl), then 4(expi), (4)incep) */
1246 return sldns_read_uint32(d+2+8);
1249 /** Find minimum expiration interval from signatures */
1251 min_expiry(struct module_env* env, struct packed_rrset_data* dd)
1254 int32_t t, r = 15 * 24 * 3600; /* 15 days max */
1255 for(i=dd->count; i<dd->count+dd->rrsig_count; i++) {
1256 t = rrsig_get_expiry(dd->rr_data[i], dd->rr_len[i]);
1257 if((int32_t)t - (int32_t)*env->now > 0) {
1258 t -= (int32_t)*env->now;
1266 /** Is rr self-signed revoked key */
1268 rr_is_selfsigned_revoked(struct module_env* env, struct val_env* ve,
1269 struct ub_packed_rrset_key* dnskey_rrset, size_t i)
1271 enum sec_status sec;
1272 char* reason = NULL;
1273 verbose(VERB_ALGO, "seen REVOKE flag, check self-signed, rr %d",
1275 /* no algorithm downgrade protection necessary, if it is selfsigned
1276 * revoked it can be removed. */
1277 sec = dnskey_verify_rrset(env, ve, dnskey_rrset, dnskey_rrset, i,
1279 return (sec == sec_status_secure);
1282 /** Set fetched value */
1284 seen_trustanchor(struct autr_ta* ta, uint8_t seen)
1287 if(ta->pending_count < 250) /* no numerical overflow, please */
1288 ta->pending_count++;
1291 /** set revoked value */
1293 seen_revoked_trustanchor(struct autr_ta* ta, uint8_t revoked)
1295 ta->revoked = revoked;
1298 /** revoke a trust anchor */
1300 revoke_dnskey(struct autr_ta* ta, int off)
1304 if(sldns_wirerr_get_type(ta->rr, ta->rr_len, ta->dname_len) !=
1305 LDNS_RR_TYPE_DNSKEY)
1307 if(sldns_wirerr_get_rdatalen(ta->rr, ta->rr_len, ta->dname_len) < 2)
1309 data = sldns_wirerr_get_rdata(ta->rr, ta->rr_len, ta->dname_len);
1310 flags = sldns_read_uint16(data);
1311 if (off && (flags&LDNS_KEY_REVOKE_KEY))
1312 flags ^= LDNS_KEY_REVOKE_KEY; /* flip */
1314 flags |= LDNS_KEY_REVOKE_KEY;
1315 sldns_write_uint16(data, flags);
1318 /** Compare two RRs skipping the REVOKED bit. Pass rdata(no len) */
1320 dnskey_compare_skip_revbit(uint8_t* a, size_t a_len, uint8_t* b, size_t b_len)
1325 /* compare RRs RDATA byte for byte. */
1326 for(i = 0; i < a_len; i++)
1332 /* this is the second part of the flags field */
1333 rdf1 |= LDNS_KEY_REVOKE_KEY;
1334 rdf2 |= LDNS_KEY_REVOKE_KEY;
1336 if (rdf1 < rdf2) return -1;
1337 else if (rdf1 > rdf2) return 1;
1343 /** compare trust anchor with rdata, 0 if equal. Pass rdata(no len) */
1345 ta_compare(struct autr_ta* a, uint16_t t, uint8_t* b, size_t b_len)
1348 else if(!b) return -1;
1349 else if(sldns_wirerr_get_type(a->rr, a->rr_len, a->dname_len) != t)
1350 return (int)sldns_wirerr_get_type(a->rr, a->rr_len,
1351 a->dname_len) - (int)t;
1352 else if(t == LDNS_RR_TYPE_DNSKEY) {
1353 return dnskey_compare_skip_revbit(
1354 sldns_wirerr_get_rdata(a->rr, a->rr_len, a->dname_len),
1355 sldns_wirerr_get_rdatalen(a->rr, a->rr_len,
1356 a->dname_len), b, b_len);
1358 else if(t == LDNS_RR_TYPE_DS) {
1359 if(sldns_wirerr_get_rdatalen(a->rr, a->rr_len, a->dname_len) !=
1362 return memcmp(sldns_wirerr_get_rdata(a->rr,
1363 a->rr_len, a->dname_len), b, b_len);
1370 * @param tp: to search in
1371 * @param t: rr type of the rdata.
1372 * @param rdata: to look for (no rdatalen in it)
1373 * @param rdata_len: length of rdata
1374 * @param result: returns NULL or the ta key looked for.
1375 * @return false on malloc failure during search. if true examine result.
1378 find_key(struct trust_anchor* tp, uint16_t t, uint8_t* rdata, size_t rdata_len,
1379 struct autr_ta** result)
1386 for(ta=tp->autr->keys; ta; ta=ta->next) {
1387 if(ta_compare(ta, t, rdata, rdata_len) == 0) {
1396 /** add key and clone RR and tp already locked. rdata without rdlen. */
1397 static struct autr_ta*
1398 add_key(struct trust_anchor* tp, uint32_t ttl, uint8_t* rdata, size_t rdata_len)
1402 size_t rr_len, dname_len;
1403 uint16_t rrtype = htons(LDNS_RR_TYPE_DNSKEY);
1404 uint16_t rrclass = htons(LDNS_RR_CLASS_IN);
1405 uint16_t rdlen = htons(rdata_len);
1406 dname_len = tp->namelen;
1408 rr_len = dname_len + 10 /* type,class,ttl,rdatalen */ + rdata_len;
1409 rr = (uint8_t*)malloc(rr_len);
1410 if(!rr) return NULL;
1411 memmove(rr, tp->name, tp->namelen);
1412 memmove(rr+dname_len, &rrtype, 2);
1413 memmove(rr+dname_len+2, &rrclass, 2);
1414 memmove(rr+dname_len+4, &ttl, 4);
1415 memmove(rr+dname_len+8, &rdlen, 2);
1416 memmove(rr+dname_len+10, rdata, rdata_len);
1417 ta = autr_ta_create(rr, rr_len, dname_len);
1419 /* rr freed in autr_ta_create */
1422 /* link in, tp already locked */
1423 ta->next = tp->autr->keys;
1424 tp->autr->keys = ta;
1428 /** get TTL from DNSKEY rrset */
1430 key_ttl(struct ub_packed_rrset_key* k)
1432 struct packed_rrset_data* d = (struct packed_rrset_data*)k->entry.data;
1436 /** update the time values for the trustpoint */
1438 set_tp_times(struct trust_anchor* tp, time_t rrsig_exp_interval,
1439 time_t origttl, int* changed)
1441 time_t x, qi = tp->autr->query_interval, rt = tp->autr->retry_time;
1443 /* x = MIN(15days, ttl/2, expire/2) */
1447 if(rrsig_exp_interval/2 < x)
1448 x = rrsig_exp_interval/2;
1450 if(!autr_permit_small_holddown) {
1452 tp->autr->query_interval = 3600;
1453 else tp->autr->query_interval = x;
1454 } else tp->autr->query_interval = x;
1456 /* x= MIN(1day, ttl/10, expire/10) */
1460 if(rrsig_exp_interval/10 < x)
1461 x = rrsig_exp_interval/10;
1463 if(!autr_permit_small_holddown) {
1465 tp->autr->retry_time = 3600;
1466 else tp->autr->retry_time = x;
1467 } else tp->autr->retry_time = x;
1469 if(qi != tp->autr->query_interval || rt != tp->autr->retry_time) {
1471 verbose(VERB_ALGO, "orig_ttl is %d", (int)origttl);
1472 verbose(VERB_ALGO, "rrsig_exp_interval is %d",
1473 (int)rrsig_exp_interval);
1474 verbose(VERB_ALGO, "query_interval: %d, retry_time: %d",
1475 (int)tp->autr->query_interval,
1476 (int)tp->autr->retry_time);
1480 /** init events to zero */
1482 init_events(struct trust_anchor* tp)
1485 for(ta=tp->autr->keys; ta; ta=ta->next) {
1490 /** check for revoked keys without trusting any other information */
1492 check_contains_revoked(struct module_env* env, struct val_env* ve,
1493 struct trust_anchor* tp, struct ub_packed_rrset_key* dnskey_rrset,
1496 struct packed_rrset_data* dd = (struct packed_rrset_data*)
1497 dnskey_rrset->entry.data;
1499 log_assert(ntohs(dnskey_rrset->rk.type) == LDNS_RR_TYPE_DNSKEY);
1500 for(i=0; i<dd->count; i++) {
1501 struct autr_ta* ta = NULL;
1502 if(!rr_is_dnskey_sep(ntohs(dnskey_rrset->rk.type),
1503 dd->rr_data[i]+2, dd->rr_len[i]-2) ||
1504 !rr_is_dnskey_revoked(ntohs(dnskey_rrset->rk.type),
1505 dd->rr_data[i]+2, dd->rr_len[i]-2))
1506 continue; /* not a revoked KSK */
1507 if(!find_key(tp, ntohs(dnskey_rrset->rk.type),
1508 dd->rr_data[i]+2, dd->rr_len[i]-2, &ta)) {
1509 log_err("malloc failure");
1510 continue; /* malloc fail in compare*/
1513 continue; /* key not found */
1514 if(rr_is_selfsigned_revoked(env, ve, dnskey_rrset, i)) {
1515 /* checked if there is an rrsig signed by this key. */
1516 /* same keytag, but stored can be revoked already, so
1517 * compare keytags, with +0 or +128(REVOKE flag) */
1518 log_assert(dnskey_calc_keytag(dnskey_rrset, i)-128 ==
1519 sldns_calc_keytag_raw(sldns_wirerr_get_rdata(
1520 ta->rr, ta->rr_len, ta->dname_len),
1521 sldns_wirerr_get_rdatalen(ta->rr, ta->rr_len,
1523 dnskey_calc_keytag(dnskey_rrset, i) ==
1524 sldns_calc_keytag_raw(sldns_wirerr_get_rdata(
1525 ta->rr, ta->rr_len, ta->dname_len),
1526 sldns_wirerr_get_rdatalen(ta->rr, ta->rr_len,
1527 ta->dname_len))); /* checks conversion*/
1528 verbose_key(ta, VERB_ALGO, "is self-signed revoked");
1531 seen_revoked_trustanchor(ta, 1);
1532 do_revoked(env, ta, changed);
1537 /** See if a DNSKEY is verified by one of the DSes */
1539 key_matches_a_ds(struct module_env* env, struct val_env* ve,
1540 struct ub_packed_rrset_key* dnskey_rrset, size_t key_idx,
1541 struct ub_packed_rrset_key* ds_rrset)
1543 struct packed_rrset_data* dd = (struct packed_rrset_data*)
1544 ds_rrset->entry.data;
1545 size_t ds_idx, num = dd->count;
1546 int d = val_favorite_ds_algo(ds_rrset);
1548 for(ds_idx=0; ds_idx<num; ds_idx++) {
1549 if(!ds_digest_algo_is_supported(ds_rrset, ds_idx) ||
1550 !ds_key_algo_is_supported(ds_rrset, ds_idx) ||
1551 ds_get_digest_algo(ds_rrset, ds_idx) != d)
1553 if(ds_get_key_algo(ds_rrset, ds_idx)
1554 != dnskey_get_algo(dnskey_rrset, key_idx)
1555 || dnskey_calc_keytag(dnskey_rrset, key_idx)
1556 != ds_get_keytag(ds_rrset, ds_idx)) {
1559 if(!ds_digest_match_dnskey(env, dnskey_rrset, key_idx,
1560 ds_rrset, ds_idx)) {
1561 verbose(VERB_ALGO, "DS match attempt failed");
1564 if(dnskey_verify_rrset(env, ve, dnskey_rrset,
1565 dnskey_rrset, key_idx, &reason) == sec_status_secure) {
1568 verbose(VERB_ALGO, "DS match failed because the key "
1569 "does not verify the keyset: %s", reason);
1575 /** Set update events */
1577 update_events(struct module_env* env, struct val_env* ve,
1578 struct trust_anchor* tp, struct ub_packed_rrset_key* dnskey_rrset,
1581 struct packed_rrset_data* dd = (struct packed_rrset_data*)
1582 dnskey_rrset->entry.data;
1584 log_assert(ntohs(dnskey_rrset->rk.type) == LDNS_RR_TYPE_DNSKEY);
1586 for(i=0; i<dd->count; i++) {
1587 struct autr_ta* ta = NULL;
1588 if(!rr_is_dnskey_sep(ntohs(dnskey_rrset->rk.type),
1589 dd->rr_data[i]+2, dd->rr_len[i]-2))
1591 if(rr_is_dnskey_revoked(ntohs(dnskey_rrset->rk.type),
1592 dd->rr_data[i]+2, dd->rr_len[i]-2)) {
1593 /* self-signed revoked keys already detected before,
1594 * other revoked keys are not 'added' again */
1597 /* is a key of this type supported?. Note rr_list and
1598 * packed_rrset are in the same order. */
1599 if(!dnskey_algo_is_supported(dnskey_rrset, i)) {
1600 /* skip unknown algorithm key, it is useless to us */
1601 log_nametypeclass(VERB_DETAIL, "trust point has "
1602 "unsupported algorithm at",
1603 tp->name, LDNS_RR_TYPE_DNSKEY, tp->dclass);
1607 /* is it new? if revocation bit set, find the unrevoked key */
1608 if(!find_key(tp, ntohs(dnskey_rrset->rk.type),
1609 dd->rr_data[i]+2, dd->rr_len[i]-2, &ta)) {
1613 ta = add_key(tp, (uint32_t)dd->rr_ttl[i],
1614 dd->rr_data[i]+2, dd->rr_len[i]-2);
1616 /* first time seen, do we have DSes? if match: VALID */
1617 if(ta && tp->ds_rrset && key_matches_a_ds(env, ve,
1618 dnskey_rrset, i, tp->ds_rrset)) {
1619 verbose_key(ta, VERB_ALGO, "verified by DS");
1620 ta->s = AUTR_STATE_VALID;
1626 seen_trustanchor(ta, 1);
1627 verbose_key(ta, VERB_ALGO, "in DNS response");
1629 set_tp_times(tp, min_expiry(env, dd), key_ttl(dnskey_rrset), changed);
1634 * Check if the holddown time has already exceeded
1635 * setting: add-holddown: add holddown timer
1636 * setting: del-holddown: del holddown timer
1637 * @param env: environment with current time
1638 * @param ta: trust anchor to check for.
1639 * @param holddown: the timer value
1640 * @return number of seconds the holddown has passed.
1643 check_holddown(struct module_env* env, struct autr_ta* ta,
1644 unsigned int holddown)
1647 if(*env->now < ta->last_change) {
1648 log_warn("time goes backwards. delaying key holddown");
1651 elapsed = *env->now - ta->last_change;
1652 if (elapsed > (time_t)holddown) {
1653 return elapsed-(time_t)holddown;
1655 verbose_key(ta, VERB_ALGO, "holddown time " ARG_LL "d seconds to go",
1656 (long long) ((time_t)holddown-elapsed));
1661 /** Set last_change to now */
1663 reset_holddown(struct module_env* env, struct autr_ta* ta, int* changed)
1665 ta->last_change = *env->now;
1669 /** Set the state for this trust anchor */
1671 set_trustanchor_state(struct module_env* env, struct autr_ta* ta, int* changed,
1674 verbose_key(ta, VERB_ALGO, "update: %s to %s",
1675 trustanchor_state2str(ta->s), trustanchor_state2str(s));
1677 reset_holddown(env, ta, changed);
1681 /** Event: NewKey */
1683 do_newkey(struct module_env* env, struct autr_ta* anchor, int* c)
1685 if (anchor->s == AUTR_STATE_START)
1686 set_trustanchor_state(env, anchor, c, AUTR_STATE_ADDPEND);
1689 /** Event: AddTime */
1691 do_addtime(struct module_env* env, struct autr_ta* anchor, int* c)
1693 /* This not according to RFC, this is 30 days, but the RFC demands
1694 * MAX(30days, TTL expire time of first DNSKEY set with this key),
1695 * The value may be too small if a very large TTL was used. */
1696 time_t exceeded = check_holddown(env, anchor, env->cfg->add_holddown);
1697 if (exceeded && anchor->s == AUTR_STATE_ADDPEND) {
1698 verbose_key(anchor, VERB_ALGO, "add-holddown time exceeded "
1699 ARG_LL "d seconds ago, and pending-count %d",
1700 (long long)exceeded, anchor->pending_count);
1701 if(anchor->pending_count >= MIN_PENDINGCOUNT) {
1702 set_trustanchor_state(env, anchor, c, AUTR_STATE_VALID);
1703 anchor->pending_count = 0;
1706 verbose_key(anchor, VERB_ALGO, "add-holddown time sanity check "
1707 "failed (pending count: %d)", anchor->pending_count);
1711 /** Event: RemTime */
1713 do_remtime(struct module_env* env, struct autr_ta* anchor, int* c)
1715 time_t exceeded = check_holddown(env, anchor, env->cfg->del_holddown);
1716 if(exceeded && anchor->s == AUTR_STATE_REVOKED) {
1717 verbose_key(anchor, VERB_ALGO, "del-holddown time exceeded "
1718 ARG_LL "d seconds ago", (long long)exceeded);
1719 set_trustanchor_state(env, anchor, c, AUTR_STATE_REMOVED);
1723 /** Event: KeyRem */
1725 do_keyrem(struct module_env* env, struct autr_ta* anchor, int* c)
1727 if(anchor->s == AUTR_STATE_ADDPEND) {
1728 set_trustanchor_state(env, anchor, c, AUTR_STATE_START);
1729 anchor->pending_count = 0;
1730 } else if(anchor->s == AUTR_STATE_VALID)
1731 set_trustanchor_state(env, anchor, c, AUTR_STATE_MISSING);
1734 /** Event: KeyPres */
1736 do_keypres(struct module_env* env, struct autr_ta* anchor, int* c)
1738 if(anchor->s == AUTR_STATE_MISSING)
1739 set_trustanchor_state(env, anchor, c, AUTR_STATE_VALID);
1742 /* Event: Revoked */
1744 do_revoked(struct module_env* env, struct autr_ta* anchor, int* c)
1746 if(anchor->s == AUTR_STATE_VALID || anchor->s == AUTR_STATE_MISSING) {
1747 set_trustanchor_state(env, anchor, c, AUTR_STATE_REVOKED);
1748 verbose_key(anchor, VERB_ALGO, "old id, prior to revocation");
1749 revoke_dnskey(anchor, 0);
1750 verbose_key(anchor, VERB_ALGO, "new id, after revocation");
1754 /** Do statestable transition matrix for anchor */
1756 anchor_state_update(struct module_env* env, struct autr_ta* anchor, int* c)
1761 case AUTR_STATE_START:
1762 /* NewKey: ADDPEND */
1763 if (anchor->fetched)
1764 do_newkey(env, anchor, c);
1767 case AUTR_STATE_ADDPEND:
1769 if (!anchor->fetched)
1770 do_keyrem(env, anchor, c);
1771 /* AddTime: VALID */
1772 else do_addtime(env, anchor, c);
1775 case AUTR_STATE_VALID:
1776 /* RevBit: REVOKED */
1777 if (anchor->revoked)
1778 do_revoked(env, anchor, c);
1779 /* KeyRem: MISSING */
1780 else if (!anchor->fetched)
1781 do_keyrem(env, anchor, c);
1782 else if(!anchor->last_change) {
1783 verbose_key(anchor, VERB_ALGO, "first seen");
1784 reset_holddown(env, anchor, c);
1788 case AUTR_STATE_MISSING:
1789 /* RevBit: REVOKED */
1790 if (anchor->revoked)
1791 do_revoked(env, anchor, c);
1793 else if (anchor->fetched)
1794 do_keypres(env, anchor, c);
1797 case AUTR_STATE_REVOKED:
1798 if (anchor->fetched)
1799 reset_holddown(env, anchor, c);
1800 /* RemTime: REMOVED */
1801 else do_remtime(env, anchor, c);
1804 case AUTR_STATE_REMOVED:
1810 /** if ZSK init then trust KSKs */
1812 init_zsk_to_ksk(struct module_env* env, struct trust_anchor* tp, int* changed)
1814 /* search for VALID ZSKs */
1815 struct autr_ta* anchor;
1818 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1819 /* last_change test makes sure it was manually configured */
1820 if(sldns_wirerr_get_type(anchor->rr, anchor->rr_len,
1821 anchor->dname_len) == LDNS_RR_TYPE_DNSKEY &&
1822 anchor->last_change == 0 &&
1823 !ta_is_dnskey_sep(anchor) &&
1824 anchor->s == AUTR_STATE_VALID)
1829 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1830 if (ta_is_dnskey_sep(anchor) &&
1831 anchor->s == AUTR_STATE_ADDPEND) {
1832 verbose_key(anchor, VERB_ALGO, "trust KSK from "
1834 set_trustanchor_state(env, anchor, changed,
1842 /** Remove missing trustanchors so the list does not grow forever */
1844 remove_missing_trustanchors(struct module_env* env, struct trust_anchor* tp,
1847 struct autr_ta* anchor;
1850 /* see if we have anchors that are valid */
1851 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1853 if (!ta_is_dnskey_sep(anchor))
1855 if (anchor->s == AUTR_STATE_VALID)
1858 /* if there are no SEP Valid anchors, see if we started out with
1859 * a ZSK (last-change=0) anchor, which is VALID and there are KSKs
1860 * now that can be made valid. Do this immediately because there
1861 * is no guarantee that the ZSKs get announced long enough. Usually
1862 * this is immediately after init with a ZSK trusted, unless the domain
1863 * was not advertising any KSKs at all. In which case we perfectly
1864 * track the zero number of KSKs. */
1866 valid = init_zsk_to_ksk(env, tp, changed);
1871 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1872 /* ignore ZSKs if newly added */
1873 if(anchor->s == AUTR_STATE_START)
1875 /* remove ZSKs if a KSK is present */
1876 if (!ta_is_dnskey_sep(anchor)) {
1878 verbose_key(anchor, VERB_ALGO, "remove ZSK "
1879 "[%d key(s) VALID]", valid);
1880 set_trustanchor_state(env, anchor, changed,
1881 AUTR_STATE_REMOVED);
1885 /* Only do MISSING keys */
1886 if (anchor->s != AUTR_STATE_MISSING)
1888 if(env->cfg->keep_missing == 0)
1889 continue; /* keep forever */
1891 exceeded = check_holddown(env, anchor, env->cfg->keep_missing);
1892 /* If keep_missing has exceeded and we still have more than
1893 * one valid KSK: remove missing trust anchor */
1894 if (exceeded && valid > 0) {
1895 verbose_key(anchor, VERB_ALGO, "keep-missing time "
1896 "exceeded " ARG_LL "d seconds ago, [%d key(s) VALID]",
1897 (long long)exceeded, valid);
1898 set_trustanchor_state(env, anchor, changed,
1899 AUTR_STATE_REMOVED);
1904 /** Do the statetable from RFC5011 transition matrix */
1906 do_statetable(struct module_env* env, struct trust_anchor* tp, int* changed)
1908 struct autr_ta* anchor;
1909 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1911 if(!ta_is_dnskey_sep(anchor))
1913 anchor_state_update(env, anchor, changed);
1915 remove_missing_trustanchors(env, tp, changed);
1919 /** See if time alone makes ADDPEND to VALID transition */
1921 autr_holddown_exceed(struct module_env* env, struct trust_anchor* tp, int* c)
1923 struct autr_ta* anchor;
1924 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1925 if(ta_is_dnskey_sep(anchor) &&
1926 anchor->s == AUTR_STATE_ADDPEND)
1927 do_addtime(env, anchor, c);
1931 /** cleanup key list */
1933 autr_cleanup_keys(struct trust_anchor* tp)
1935 struct autr_ta* p, **prevp;
1936 prevp = &tp->autr->keys;
1939 /* do we want to remove this key? */
1940 if(p->s == AUTR_STATE_START || p->s == AUTR_STATE_REMOVED ||
1941 sldns_wirerr_get_type(p->rr, p->rr_len, p->dname_len)
1942 != LDNS_RR_TYPE_DNSKEY) {
1943 struct autr_ta* np = p->next;
1947 /* snip and go to next item */
1952 /* remove pending counts if no longer pending */
1953 if(p->s != AUTR_STATE_ADDPEND)
1954 p->pending_count = 0;
1960 /** calculate next probe time */
1962 calc_next_probe(struct module_env* env, time_t wait)
1964 /* make it random, 90-100% */
1966 if(!autr_permit_small_holddown) {
1970 if(wait == 0) wait = 1;
1974 rnd = (time_t)ub_random_max(env->rnd, (long int)rnd);
1975 return (time_t)(*env->now + rest + rnd);
1978 /** what is first probe time (anchors must be locked) */
1980 wait_probe_time(struct val_anchors* anchors)
1982 rbnode_t* t = rbtree_first(&anchors->autr->probe);
1983 if(t != RBTREE_NULL)
1984 return ((struct trust_anchor*)t->key)->autr->next_probe_time;
1988 /** reset worker timer */
1990 reset_worker_timer(struct module_env* env)
1994 time_t next = (time_t)wait_probe_time(env->anchors);
1995 /* in case this is libunbound, no timer */
1996 if(!env->probe_timer)
1998 if(next > *env->now)
1999 tv.tv_sec = (time_t)(next - *env->now);
2003 comm_timer_set(env->probe_timer, &tv);
2004 verbose(VERB_ALGO, "scheduled next probe in " ARG_LL "d sec", (long long)tv.tv_sec);
2007 /** set next probe for trust anchor */
2009 set_next_probe(struct module_env* env, struct trust_anchor* tp,
2010 struct ub_packed_rrset_key* dnskey_rrset)
2012 struct trust_anchor key, *tp2;
2014 /* use memory allocated in rrset for temporary name storage */
2015 key.node.key = &key;
2016 key.name = dnskey_rrset->rk.dname;
2017 key.namelen = dnskey_rrset->rk.dname_len;
2018 key.namelabs = dname_count_labels(key.name);
2019 key.dclass = tp->dclass;
2020 lock_basic_unlock(&tp->lock);
2022 /* fetch tp again and lock anchors, so that we can modify the trees */
2023 lock_basic_lock(&env->anchors->lock);
2024 tp2 = (struct trust_anchor*)rbtree_search(env->anchors->tree, &key);
2026 verbose(VERB_ALGO, "trustpoint was deleted in set_next_probe");
2027 lock_basic_unlock(&env->anchors->lock);
2030 log_assert(tp == tp2);
2031 lock_basic_lock(&tp->lock);
2034 mold = wait_probe_time(env->anchors);
2035 (void)rbtree_delete(&env->anchors->autr->probe, tp);
2036 tp->autr->next_probe_time = calc_next_probe(env,
2037 tp->autr->query_interval);
2038 (void)rbtree_insert(&env->anchors->autr->probe, &tp->autr->pnode);
2039 mnew = wait_probe_time(env->anchors);
2041 lock_basic_unlock(&env->anchors->lock);
2042 verbose(VERB_ALGO, "next probe set in %d seconds",
2043 (int)tp->autr->next_probe_time - (int)*env->now);
2045 reset_worker_timer(env);
2050 /** Revoke and Delete a trust point */
2052 autr_tp_remove(struct module_env* env, struct trust_anchor* tp,
2053 struct ub_packed_rrset_key* dnskey_rrset)
2055 struct trust_anchor* del_tp;
2056 struct trust_anchor key;
2057 struct autr_point_data pd;
2060 log_nametypeclass(VERB_OPS, "trust point was revoked",
2061 tp->name, LDNS_RR_TYPE_DNSKEY, tp->dclass);
2062 tp->autr->revoked = 1;
2064 /* use space allocated for dnskey_rrset to save name of anchor */
2065 memset(&key, 0, sizeof(key));
2066 memset(&pd, 0, sizeof(pd));
2068 key.node.key = &key;
2069 pd.pnode.key = &key;
2070 pd.next_probe_time = tp->autr->next_probe_time;
2071 key.name = dnskey_rrset->rk.dname;
2072 key.namelen = tp->namelen;
2073 key.namelabs = tp->namelabs;
2074 key.dclass = tp->dclass;
2077 lock_basic_unlock(&tp->lock);
2079 /* take from tree. It could be deleted by someone else,hence (void). */
2080 lock_basic_lock(&env->anchors->lock);
2081 del_tp = (struct trust_anchor*)rbtree_delete(env->anchors->tree, &key);
2082 mold = wait_probe_time(env->anchors);
2083 (void)rbtree_delete(&env->anchors->autr->probe, &key);
2084 mnew = wait_probe_time(env->anchors);
2085 anchors_init_parents_locked(env->anchors);
2086 lock_basic_unlock(&env->anchors->lock);
2088 /* if !del_tp then the trust point is no longer present in the tree,
2089 * it was deleted by someone else, who will write the zonefile and
2090 * clean up the structure */
2093 del_tp->autr->next_probe_time = 0; /* no more probing for it */
2094 autr_write_file(env, del_tp);
2097 autr_point_delete(del_tp);
2100 reset_worker_timer(env);
2104 int autr_process_prime(struct module_env* env, struct val_env* ve,
2105 struct trust_anchor* tp, struct ub_packed_rrset_key* dnskey_rrset)
2108 log_assert(tp && tp->autr);
2109 /* autotrust update trust anchors */
2110 /* the tp is locked, and stays locked unless it is deleted */
2112 /* we could just catch the anchor here while another thread
2113 * is busy deleting it. Just unlock and let the other do its job */
2114 if(tp->autr->revoked) {
2115 log_nametypeclass(VERB_ALGO, "autotrust not processed, "
2116 "trust point revoked", tp->name,
2117 LDNS_RR_TYPE_DNSKEY, tp->dclass);
2118 lock_basic_unlock(&tp->lock);
2119 return 0; /* it is revoked */
2122 /* query_dnskeys(): */
2123 tp->autr->last_queried = *env->now;
2125 log_nametypeclass(VERB_ALGO, "autotrust process for",
2126 tp->name, LDNS_RR_TYPE_DNSKEY, tp->dclass);
2127 /* see if time alone makes some keys valid */
2128 autr_holddown_exceed(env, tp, &changed);
2130 verbose(VERB_ALGO, "autotrust: morekeys, reassemble");
2131 if(!autr_assemble(tp)) {
2132 log_err("malloc failure assembling autotrust keys");
2133 return 1; /* unchanged */
2136 /* did we get any data? */
2138 verbose(VERB_ALGO, "autotrust: no dnskey rrset");
2139 /* no update of query_failed, because then we would have
2140 * to write to disk. But we cannot because we maybe are
2141 * still 'initialising' with DS records, that we cannot write
2142 * in the full format (which only contains KSKs). */
2143 return 1; /* trust point exists */
2145 /* check for revoked keys to remove immediately */
2146 check_contains_revoked(env, ve, tp, dnskey_rrset, &changed);
2148 verbose(VERB_ALGO, "autotrust: revokedkeys, reassemble");
2149 if(!autr_assemble(tp)) {
2150 log_err("malloc failure assembling autotrust keys");
2151 return 1; /* unchanged */
2153 if(!tp->ds_rrset && !tp->dnskey_rrset) {
2154 /* no more keys, all are revoked */
2155 /* this is a success for this probe attempt */
2156 tp->autr->last_success = *env->now;
2157 autr_tp_remove(env, tp, dnskey_rrset);
2158 return 0; /* trust point removed */
2161 /* verify the dnskey rrset and see if it is valid. */
2162 if(!verify_dnskey(env, ve, tp, dnskey_rrset)) {
2163 verbose(VERB_ALGO, "autotrust: dnskey did not verify.");
2164 /* only increase failure count if this is not the first prime,
2165 * this means there was a previous succesful probe */
2166 if(tp->autr->last_success) {
2167 tp->autr->query_failed += 1;
2168 autr_write_file(env, tp);
2170 return 1; /* trust point exists */
2173 tp->autr->last_success = *env->now;
2174 tp->autr->query_failed = 0;
2176 /* Add new trust anchors to the data structure
2177 * - note which trust anchors are seen this probe.
2178 * Set trustpoint query_interval and retry_time.
2179 * - find minimum rrsig expiration interval
2181 if(!update_events(env, ve, tp, dnskey_rrset, &changed)) {
2182 log_err("malloc failure in autotrust update_events. "
2183 "trust point unchanged.");
2184 return 1; /* trust point unchanged, so exists */
2187 /* - for every SEP key do the 5011 statetable.
2188 * - remove missing trustanchors (if veryold and we have new anchors).
2190 if(!do_statetable(env, tp, &changed)) {
2191 log_err("malloc failure in autotrust do_statetable. "
2192 "trust point unchanged.");
2193 return 1; /* trust point unchanged, so exists */
2196 autr_cleanup_keys(tp);
2197 if(!set_next_probe(env, tp, dnskey_rrset))
2198 return 0; /* trust point does not exist */
2199 autr_write_file(env, tp);
2201 verbose(VERB_ALGO, "autotrust: changed, reassemble");
2202 if(!autr_assemble(tp)) {
2203 log_err("malloc failure assembling autotrust keys");
2204 return 1; /* unchanged */
2206 if(!tp->ds_rrset && !tp->dnskey_rrset) {
2207 /* no more keys, all are revoked */
2208 autr_tp_remove(env, tp, dnskey_rrset);
2209 return 0; /* trust point removed */
2211 } else verbose(VERB_ALGO, "autotrust: no changes");
2213 return 1; /* trust point exists */
2216 /** debug print a trust anchor key */
2218 autr_debug_print_ta(struct autr_ta* ta)
2221 char* str = sldns_wire2str_rr(ta->rr, ta->rr_len);
2223 log_info("out of memory in debug_print_ta");
2226 if(str && str[0]) str[strlen(str)-1]=0; /* remove newline */
2227 ctime_r(&ta->last_change, buf);
2228 if(buf[0]) buf[strlen(buf)-1]=0; /* remove newline */
2229 log_info("[%s] %s ;;state:%d ;;pending_count:%d%s%s last:%s",
2230 trustanchor_state2str(ta->s), str, ta->s, ta->pending_count,
2231 ta->fetched?" fetched":"", ta->revoked?" revoked":"", buf);
2235 /** debug print a trust point */
2237 autr_debug_print_tp(struct trust_anchor* tp)
2243 dname_str(tp->name, buf);
2244 log_info("trust point %s : %d", buf, (int)tp->dclass);
2245 log_info("assembled %d DS and %d DNSKEYs",
2246 (int)tp->numDS, (int)tp->numDNSKEY);
2248 log_packed_rrset(0, "DS:", tp->ds_rrset);
2250 if(tp->dnskey_rrset) {
2251 log_packed_rrset(0, "DNSKEY:", tp->dnskey_rrset);
2253 log_info("file %s", tp->autr->file);
2254 ctime_r(&tp->autr->last_queried, buf);
2255 if(buf[0]) buf[strlen(buf)-1]=0; /* remove newline */
2256 log_info("last_queried: %u %s", (unsigned)tp->autr->last_queried, buf);
2257 ctime_r(&tp->autr->last_success, buf);
2258 if(buf[0]) buf[strlen(buf)-1]=0; /* remove newline */
2259 log_info("last_success: %u %s", (unsigned)tp->autr->last_success, buf);
2260 ctime_r(&tp->autr->next_probe_time, buf);
2261 if(buf[0]) buf[strlen(buf)-1]=0; /* remove newline */
2262 log_info("next_probe_time: %u %s", (unsigned)tp->autr->next_probe_time,
2264 log_info("query_interval: %u", (unsigned)tp->autr->query_interval);
2265 log_info("retry_time: %u", (unsigned)tp->autr->retry_time);
2266 log_info("query_failed: %u", (unsigned)tp->autr->query_failed);
2268 for(ta=tp->autr->keys; ta; ta=ta->next) {
2269 autr_debug_print_ta(ta);
2274 autr_debug_print(struct val_anchors* anchors)
2276 struct trust_anchor* tp;
2277 lock_basic_lock(&anchors->lock);
2278 RBTREE_FOR(tp, struct trust_anchor*, anchors->tree) {
2279 lock_basic_lock(&tp->lock);
2280 autr_debug_print_tp(tp);
2281 lock_basic_unlock(&tp->lock);
2283 lock_basic_unlock(&anchors->lock);
2286 void probe_answer_cb(void* arg, int ATTR_UNUSED(rcode),
2287 sldns_buffer* ATTR_UNUSED(buf), enum sec_status ATTR_UNUSED(sec),
2288 char* ATTR_UNUSED(why_bogus))
2290 /* retry was set before the query was done,
2291 * re-querytime is set when query succeeded, but that may not
2292 * have reset this timer because the query could have been
2293 * handled by another thread. In that case, this callback would
2294 * get called after the original timeout is done.
2295 * By not resetting the timer, it may probe more often, but not
2297 * Unless the new lookup resulted in smaller TTLs and thus smaller
2298 * timeout values. In that case one old TTL could be mistakenly done.
2300 struct module_env* env = (struct module_env*)arg;
2301 verbose(VERB_ALGO, "autotrust probe answer cb");
2302 reset_worker_timer(env);
2305 /** probe a trust anchor DNSKEY and unlocks tp */
2307 probe_anchor(struct module_env* env, struct trust_anchor* tp)
2309 struct query_info qinfo;
2310 uint16_t qflags = BIT_RD;
2311 struct edns_data edns;
2312 sldns_buffer* buf = env->scratch_buffer;
2313 qinfo.qname = regional_alloc_init(env->scratch, tp->name, tp->namelen);
2315 log_err("out of memory making 5011 probe");
2318 qinfo.qname_len = tp->namelen;
2319 qinfo.qtype = LDNS_RR_TYPE_DNSKEY;
2320 qinfo.qclass = tp->dclass;
2321 log_query_info(VERB_ALGO, "autotrust probe", &qinfo);
2322 verbose(VERB_ALGO, "retry probe set in %d seconds",
2323 (int)tp->autr->next_probe_time - (int)*env->now);
2324 edns.edns_present = 1;
2326 edns.edns_version = 0;
2327 edns.bits = EDNS_DO;
2328 if(sldns_buffer_capacity(buf) < 65535)
2329 edns.udp_size = (uint16_t)sldns_buffer_capacity(buf);
2330 else edns.udp_size = 65535;
2332 /* can't hold the lock while mesh_run is processing */
2333 lock_basic_unlock(&tp->lock);
2335 /* delete the DNSKEY from rrset and key cache so an active probe
2336 * is done. First the rrset so another thread does not use it
2337 * to recreate the key entry in a race condition. */
2338 rrset_cache_remove(env->rrset_cache, qinfo.qname, qinfo.qname_len,
2339 qinfo.qtype, qinfo.qclass, 0);
2340 key_cache_remove(env->key_cache, qinfo.qname, qinfo.qname_len,
2343 if(!mesh_new_callback(env->mesh, &qinfo, qflags, &edns, buf, 0,
2344 &probe_answer_cb, env)) {
2345 log_err("out of memory making 5011 probe");
2349 /** fetch first to-probe trust-anchor and lock it and set retrytime */
2350 static struct trust_anchor*
2351 todo_probe(struct module_env* env, time_t* next)
2353 struct trust_anchor* tp;
2356 lock_basic_lock(&env->anchors->lock);
2357 if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) {
2358 /* in case of revoked anchors */
2359 lock_basic_unlock(&env->anchors->lock);
2360 /* signal that there are no anchors to probe */
2364 tp = (struct trust_anchor*)el->key;
2365 lock_basic_lock(&tp->lock);
2367 /* is it eligible? */
2368 if((time_t)tp->autr->next_probe_time > *env->now) {
2369 /* no more to probe */
2370 *next = (time_t)tp->autr->next_probe_time - *env->now;
2371 lock_basic_unlock(&tp->lock);
2372 lock_basic_unlock(&env->anchors->lock);
2376 /* reset its next probe time */
2377 (void)rbtree_delete(&env->anchors->autr->probe, tp);
2378 tp->autr->next_probe_time = calc_next_probe(env, tp->autr->retry_time);
2379 (void)rbtree_insert(&env->anchors->autr->probe, &tp->autr->pnode);
2380 lock_basic_unlock(&env->anchors->lock);
2386 autr_probe_timer(struct module_env* env)
2388 struct trust_anchor* tp;
2389 time_t next_probe = 3600;
2391 if(autr_permit_small_holddown) next_probe = 1;
2392 verbose(VERB_ALGO, "autotrust probe timer callback");
2393 /* while there are still anchors to probe */
2394 while( (tp = todo_probe(env, &next_probe)) ) {
2395 /* make a probe for this anchor */
2396 probe_anchor(env, tp);
2399 regional_free_all(env->scratch);
2401 return 0; /* no trust points to probe */
2402 verbose(VERB_ALGO, "autotrust probe timer %d callbacks done", num);