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,
435 lock_basic_lock(&tp->lock);
439 /** Add trust anchor from RR */
440 static struct autr_ta*
441 add_trustanchor_frm_rr(struct val_anchors* anchors, uint8_t* rr, size_t rr_len,
442 size_t dname_len, struct trust_anchor** tp)
444 struct autr_ta* ta = autr_ta_create(rr, rr_len, dname_len);
447 *tp = find_add_tp(anchors, rr, rr_len, dname_len);
454 ta->next = (*tp)->autr->keys;
455 (*tp)->autr->keys = ta;
456 lock_basic_unlock(&(*tp)->lock);
461 * Add new trust anchor from a string in file.
462 * @param anchors: all anchors
463 * @param str: string with anchor and comments, if any comments.
464 * @param tp: trust point returned.
465 * @param origin: what to use for @
466 * @param origin_len: length of origin
467 * @param prev: previous rr name
468 * @param prev_len: length of prev
469 * @param skip: if true, the result is NULL, but not an error, skip it.
470 * @return new key in trust point.
472 static struct autr_ta*
473 add_trustanchor_frm_str(struct val_anchors* anchors, char* str,
474 struct trust_anchor** tp, uint8_t* origin, size_t origin_len,
475 uint8_t** prev, size_t* prev_len, int* skip)
477 uint8_t rr[LDNS_RR_BUF_SIZE];
478 size_t rr_len = sizeof(rr), dname_len;
481 if (!str_contains_data(str, ';')) {
483 return NULL; /* empty line */
485 if(0 != (lstatus = sldns_str2wire_rr_buf(str, rr, &rr_len, &dname_len,
486 0, origin, origin_len, *prev, *prev_len)))
488 log_err("ldns error while converting string to RR at%d: %s: %s",
489 LDNS_WIREPARSE_OFFSET(lstatus),
490 sldns_get_errorstr_parse(lstatus), str);
494 *prev = memdup(rr, dname_len);
495 *prev_len = dname_len;
497 log_err("malloc failure in add_trustanchor");
500 if(sldns_wirerr_get_type(rr, rr_len, dname_len)!=LDNS_RR_TYPE_DNSKEY &&
501 sldns_wirerr_get_type(rr, rr_len, dname_len)!=LDNS_RR_TYPE_DS) {
503 return NULL; /* only DS and DNSKEY allowed */
505 drr = memdup(rr, rr_len);
507 log_err("malloc failure in add trustanchor");
510 return add_trustanchor_frm_rr(anchors, drr, rr_len, dname_len, tp);
515 * @param anchors: all points.
516 * @param str: comments line
517 * @param fname: filename
518 * @param origin: the $ORIGIN.
519 * @param origin_len: length of origin
520 * @param prev: passed to ldns.
521 * @param prev_len: length of prev
522 * @param skip: if true, the result is NULL, but not an error, skip it.
523 * @return false on failure, otherwise the tp read.
525 static struct trust_anchor*
526 load_trustanchor(struct val_anchors* anchors, char* str, const char* fname,
527 uint8_t* origin, size_t origin_len, uint8_t** prev, size_t* prev_len,
530 struct autr_ta* ta = NULL;
531 struct trust_anchor* tp = NULL;
533 ta = add_trustanchor_frm_str(anchors, str, &tp, origin, origin_len,
534 prev, prev_len, skip);
537 lock_basic_lock(&tp->lock);
538 if(!parse_comments(str, ta)) {
539 lock_basic_unlock(&tp->lock);
542 if(!tp->autr->file) {
543 tp->autr->file = strdup(fname);
544 if(!tp->autr->file) {
545 lock_basic_unlock(&tp->lock);
546 log_err("malloc failure");
550 lock_basic_unlock(&tp->lock);
554 /** iterator for DSes from keylist. return true if a next element exists */
556 assemble_iterate_ds(struct autr_ta** list, uint8_t** rr, size_t* rr_len,
560 if(sldns_wirerr_get_type((*list)->rr, (*list)->rr_len,
561 (*list)->dname_len) == LDNS_RR_TYPE_DS) {
563 *rr_len = (*list)->rr_len;
564 *dname_len = (*list)->dname_len;
565 *list = (*list)->next;
568 *list = (*list)->next;
573 /** iterator for DNSKEYs from keylist. return true if a next element exists */
575 assemble_iterate_dnskey(struct autr_ta** list, uint8_t** rr, size_t* rr_len,
579 if(sldns_wirerr_get_type((*list)->rr, (*list)->rr_len,
580 (*list)->dname_len) != LDNS_RR_TYPE_DS &&
581 ((*list)->s == AUTR_STATE_VALID ||
582 (*list)->s == AUTR_STATE_MISSING)) {
584 *rr_len = (*list)->rr_len;
585 *dname_len = (*list)->dname_len;
586 *list = (*list)->next;
589 *list = (*list)->next;
594 /** see if iterator-list has any elements in it, or it is empty */
596 assemble_iterate_hasfirst(int iter(struct autr_ta**, uint8_t**, size_t*,
597 size_t*), struct autr_ta* list)
600 size_t rr_len = 0, dname_len = 0;
601 return iter(&list, &rr, &rr_len, &dname_len);
604 /** number of elements in iterator list */
606 assemble_iterate_count(int iter(struct autr_ta**, uint8_t**, size_t*,
607 size_t*), struct autr_ta* list)
610 size_t i = 0, rr_len = 0, dname_len = 0;
611 while(iter(&list, &rr, &rr_len, &dname_len)) {
618 * Create a ub_packed_rrset_key allocated on the heap.
619 * It therefore does not have the correct ID value, and cannot be used
620 * inside the cache. It can be used in storage outside of the cache.
621 * Keys for the cache have to be obtained from alloc.h .
622 * @param iter: iterator over the elements in the list. It filters elements.
623 * @param list: the list.
624 * @return key allocated or NULL on failure.
626 static struct ub_packed_rrset_key*
627 ub_packed_rrset_heap_key(int iter(struct autr_ta**, uint8_t**, size_t*,
628 size_t*), struct autr_ta* list)
631 size_t rr_len = 0, dname_len = 0;
632 struct ub_packed_rrset_key* k;
633 if(!iter(&list, &rr, &rr_len, &dname_len))
635 k = (struct ub_packed_rrset_key*)calloc(1, sizeof(*k));
638 k->rk.type = htons(sldns_wirerr_get_type(rr, rr_len, dname_len));
639 k->rk.rrset_class = htons(sldns_wirerr_get_class(rr, rr_len, dname_len));
640 k->rk.dname_len = dname_len;
641 k->rk.dname = memdup(rr, dname_len);
650 * Create packed_rrset data on the heap.
651 * @param iter: iterator over the elements in the list. It filters elements.
652 * @param list: the list.
653 * @return data allocated or NULL on failure.
655 static struct packed_rrset_data*
656 packed_rrset_heap_data(int iter(struct autr_ta**, uint8_t**, size_t*,
657 size_t*), struct autr_ta* list)
660 size_t rr_len = 0, dname_len = 0;
661 struct packed_rrset_data* data;
662 size_t count=0, rrsig_count=0, len=0, i, total;
664 struct autr_ta* list_i;
668 while(iter(&list_i, &rr, &rr_len, &dname_len)) {
669 if(sldns_wirerr_get_type(rr, rr_len, dname_len) ==
673 /* sizeof the rdlength + rdatalen */
674 len += 2 + sldns_wirerr_get_rdatalen(rr, rr_len, dname_len);
675 ttl = (time_t)sldns_wirerr_get_ttl(rr, rr_len, dname_len);
677 if(count == 0 && rrsig_count == 0)
681 total = count + rrsig_count;
682 len += sizeof(*data) + total*(sizeof(size_t) + sizeof(time_t) +
684 data = (struct packed_rrset_data*)calloc(1, len);
691 data->rrsig_count = rrsig_count;
692 data->rr_len = (size_t*)((uint8_t*)data +
693 sizeof(struct packed_rrset_data));
694 data->rr_data = (uint8_t**)&(data->rr_len[total]);
695 data->rr_ttl = (time_t*)&(data->rr_data[total]);
696 nextrdata = (uint8_t*)&(data->rr_ttl[total]);
698 /* fill out len, ttl, fields */
701 while(iter(&list_i, &rr, &rr_len, &dname_len)) {
702 data->rr_ttl[i] = (time_t)sldns_wirerr_get_ttl(rr, rr_len,
704 if(data->rr_ttl[i] < data->ttl)
705 data->ttl = data->rr_ttl[i];
706 data->rr_len[i] = 2 /* the rdlength */ +
707 sldns_wirerr_get_rdatalen(rr, rr_len, dname_len);
711 /* fixup rest of ptrs */
712 for(i=0; i<total; i++) {
713 data->rr_data[i] = nextrdata;
714 nextrdata += data->rr_len[i];
717 /* copy data in there */
720 while(iter(&list_i, &rr, &rr_len, &dname_len)) {
721 memmove(data->rr_data[i],
722 sldns_wirerr_get_rdatawl(rr, rr_len, dname_len),
727 if(data->rrsig_count && data->count == 0) {
728 data->count = data->rrsig_count; /* rrset type is RRSIG */
729 data->rrsig_count = 0;
735 * Assemble the trust anchors into DS and DNSKEY packed rrsets.
736 * Uses only VALID and MISSING DNSKEYs.
737 * Read the sldns_rrs and builds packed rrsets
738 * @param tp: the trust point. Must be locked.
739 * @return false on malloc failure.
742 autr_assemble(struct trust_anchor* tp)
744 struct ub_packed_rrset_key* ubds=NULL, *ubdnskey=NULL;
746 /* make packed rrset keys - malloced with no ID number, they
747 * are not in the cache */
748 /* make packed rrset data (if there is a key) */
749 if(assemble_iterate_hasfirst(assemble_iterate_ds, tp->autr->keys)) {
750 ubds = ub_packed_rrset_heap_key(
751 assemble_iterate_ds, tp->autr->keys);
754 ubds->entry.data = packed_rrset_heap_data(
755 assemble_iterate_ds, tp->autr->keys);
756 if(!ubds->entry.data)
760 /* make packed DNSKEY data */
761 if(assemble_iterate_hasfirst(assemble_iterate_dnskey, tp->autr->keys)) {
762 ubdnskey = ub_packed_rrset_heap_key(
763 assemble_iterate_dnskey, tp->autr->keys);
766 ubdnskey->entry.data = packed_rrset_heap_data(
767 assemble_iterate_dnskey, tp->autr->keys);
768 if(!ubdnskey->entry.data) {
770 autr_rrset_delete(ubds);
771 autr_rrset_delete(ubdnskey);
776 /* we have prepared the new keys so nothing can go wrong any more.
777 * And we are sure we cannot be left without trustanchor after
778 * any errors. Put in the new keys and remove old ones. */
780 /* free the old data */
781 autr_rrset_delete(tp->ds_rrset);
782 autr_rrset_delete(tp->dnskey_rrset);
784 /* assign the data to replace the old */
786 tp->dnskey_rrset = ubdnskey;
787 tp->numDS = assemble_iterate_count(assemble_iterate_ds,
789 tp->numDNSKEY = assemble_iterate_count(assemble_iterate_dnskey,
796 parse_int(char* line, int* ret)
799 unsigned int x = (unsigned int)strtol(line, &e, 10);
801 *ret = -1; /* parse error */
804 *ret = 1; /* matched */
808 /** parse id sequence for anchor */
809 static struct trust_anchor*
810 parse_id(struct val_anchors* anchors, char* line)
812 struct trust_anchor *tp;
817 /* read the owner name */
818 char* next = strchr(line, ' ');
822 dname = sldns_str2wire_dname(line, &dname_len);
827 dclass = parse_int(next+1, &r);
833 /* find the trust point */
834 tp = autr_tp_create(anchors, dname, dname_len, dclass);
840 * Parse variable from trustanchor header
841 * @param line: to parse
842 * @param anchors: the anchor is added to this, if "id:" is seen.
843 * @param anchor: the anchor as result value or previously returned anchor
844 * value to read the variable lines into.
845 * @return: 0 no match, -1 failed syntax error, +1 success line read.
846 * +2 revoked trust anchor file.
849 parse_var_line(char* line, struct val_anchors* anchors,
850 struct trust_anchor** anchor)
852 struct trust_anchor* tp = *anchor;
854 if(strncmp(line, ";;id: ", 6) == 0) {
855 *anchor = parse_id(anchors, line+6);
856 if(!*anchor) return -1;
858 } else if(strncmp(line, ";;REVOKED", 9) == 0) {
860 log_err("REVOKED statement must be at start of file");
864 } else if(strncmp(line, ";;last_queried: ", 16) == 0) {
866 lock_basic_lock(&tp->lock);
867 tp->autr->last_queried = (time_t)parse_int(line+16, &r);
868 lock_basic_unlock(&tp->lock);
869 } else if(strncmp(line, ";;last_success: ", 16) == 0) {
871 lock_basic_lock(&tp->lock);
872 tp->autr->last_success = (time_t)parse_int(line+16, &r);
873 lock_basic_unlock(&tp->lock);
874 } else if(strncmp(line, ";;next_probe_time: ", 19) == 0) {
876 lock_basic_lock(&anchors->lock);
877 lock_basic_lock(&tp->lock);
878 (void)rbtree_delete(&anchors->autr->probe, tp);
879 tp->autr->next_probe_time = (time_t)parse_int(line+19, &r);
880 (void)rbtree_insert(&anchors->autr->probe, &tp->autr->pnode);
881 lock_basic_unlock(&tp->lock);
882 lock_basic_unlock(&anchors->lock);
883 } else if(strncmp(line, ";;query_failed: ", 16) == 0) {
885 lock_basic_lock(&tp->lock);
886 tp->autr->query_failed = (uint8_t)parse_int(line+16, &r);
887 lock_basic_unlock(&tp->lock);
888 } else if(strncmp(line, ";;query_interval: ", 18) == 0) {
890 lock_basic_lock(&tp->lock);
891 tp->autr->query_interval = (time_t)parse_int(line+18, &r);
892 lock_basic_unlock(&tp->lock);
893 } else if(strncmp(line, ";;retry_time: ", 14) == 0) {
895 lock_basic_lock(&tp->lock);
896 tp->autr->retry_time = (time_t)parse_int(line+14, &r);
897 lock_basic_unlock(&tp->lock);
902 /** handle origin lines */
904 handle_origin(char* line, uint8_t** origin, size_t* origin_len)
907 while(isspace((unsigned char)*line))
909 if(strncmp(line, "$ORIGIN", 7) != 0)
913 while(isspace((unsigned char)*line))
915 *origin = sldns_str2wire_dname(line, &len);
918 log_warn("malloc failure or parse error in $ORIGIN");
922 /** Read one line and put multiline RRs onto one line string */
924 read_multiline(char* buf, size_t len, FILE* in, int* linenr)
930 while(left > 0 && fgets(pos, (int)left, in) != NULL) {
931 size_t i, poslen = strlen(pos);
934 /* check what the new depth is after the line */
935 /* this routine cannot handle braces inside quotes,
936 say for TXT records, but this routine only has to read keys */
937 for(i=0; i<poslen; i++) {
940 } else if(pos[i] == ')') {
942 log_err("mismatch: too many ')'");
946 } else if(pos[i] == ';') {
951 /* normal oneline or last line: keeps newline and comments */
956 /* more lines expected, snip off comments and newline */
958 pos[poslen-1] = 0; /* strip newline */
960 strchr(pos, ';')[0] = 0; /* strip comments */
962 /* move to paste other lines behind this one */
963 poslen = strlen(pos);
966 /* the newline is changed into a space */
967 if(left <= 2 /* space and eos */) {
968 log_err("line too long");
977 log_err("mismatch: too many '('");
985 int autr_read_file(struct val_anchors* anchors, const char* nm)
987 /* the file descriptor */
989 /* keep track of line numbers */
993 /* trust point being read */
994 struct trust_anchor *tp = NULL, *tp2;
996 /* for $ORIGIN parsing */
997 uint8_t *origin=NULL, *prev=NULL;
998 size_t origin_len=0, prev_len=0;
1000 if (!(fd = fopen(nm, "r"))) {
1001 log_err("unable to open %s for reading: %s",
1002 nm, strerror(errno));
1005 verbose(VERB_ALGO, "reading autotrust anchor file %s", nm);
1006 while ( (r=read_multiline(line, sizeof(line), fd, &line_nr)) != 0) {
1007 if(r == -1 || (r = parse_var_line(line, anchors, &tp)) == -1) {
1008 log_err("could not parse auto-trust-anchor-file "
1009 "%s line %d", nm, line_nr);
1017 log_warn("trust anchor %s has been revoked", nm);
1023 if (!str_contains_data(line, ';'))
1024 continue; /* empty lines allowed */
1025 if(handle_origin(line, &origin, &origin_len))
1028 if(!(tp2=load_trustanchor(anchors, line, nm, origin,
1029 origin_len, &prev, &prev_len, &r))) {
1030 if(!r) log_err("failed to load trust anchor from %s "
1031 "at line %i, skipping", nm, line_nr);
1032 /* try to do the rest */
1035 if(tp && tp != tp2) {
1036 log_err("file %s has mismatching data inside: "
1037 "the file may only contain keys for one name, "
1038 "remove keys for other domain names", nm);
1050 log_err("failed to read %s", nm);
1054 /* now assemble the data into DNSKEY and DS packed rrsets */
1055 lock_basic_lock(&tp->lock);
1056 if(!autr_assemble(tp)) {
1057 lock_basic_unlock(&tp->lock);
1058 log_err("malloc failure assembling %s", nm);
1061 lock_basic_unlock(&tp->lock);
1065 /** string for a trustanchor state */
1067 trustanchor_state2str(autr_state_t s)
1070 case AUTR_STATE_START: return " START ";
1071 case AUTR_STATE_ADDPEND: return " ADDPEND ";
1072 case AUTR_STATE_VALID: return " VALID ";
1073 case AUTR_STATE_MISSING: return " MISSING ";
1074 case AUTR_STATE_REVOKED: return " REVOKED ";
1075 case AUTR_STATE_REMOVED: return " REMOVED ";
1080 /** print ID to file */
1082 print_id(FILE* out, char* fname, uint8_t* nm, size_t nmlen, uint16_t dclass)
1084 char* s = sldns_wire2str_dname(nm, nmlen);
1086 log_err("malloc failure in write to %s", fname);
1089 if(fprintf(out, ";;id: %s %d\n", s, (int)dclass) < 0) {
1090 log_err("could not write to %s: %s", fname, strerror(errno));
1099 autr_write_contents(FILE* out, char* fn, struct trust_anchor* tp)
1105 /* write pretty header */
1106 if(fprintf(out, "; autotrust trust anchor file\n") < 0) {
1107 log_err("could not write to %s: %s", fn, strerror(errno));
1110 if(tp->autr->revoked) {
1111 if(fprintf(out, ";;REVOKED\n") < 0 ||
1112 fprintf(out, "; The zone has all keys revoked, and is\n"
1113 "; considered as if it has no trust anchors.\n"
1114 "; the remainder of the file is the last probe.\n"
1115 "; to restart the trust anchor, overwrite this file.\n"
1116 "; with one containing valid DNSKEYs or DSes.\n") < 0) {
1117 log_err("could not write to %s: %s", fn, strerror(errno));
1121 if(!print_id(out, fn, tp->name, tp->namelen, tp->dclass)) {
1124 if(fprintf(out, ";;last_queried: %u ;;%s",
1125 (unsigned int)tp->autr->last_queried,
1126 ctime_r(&(tp->autr->last_queried), tmi)) < 0 ||
1127 fprintf(out, ";;last_success: %u ;;%s",
1128 (unsigned int)tp->autr->last_success,
1129 ctime_r(&(tp->autr->last_success), tmi)) < 0 ||
1130 fprintf(out, ";;next_probe_time: %u ;;%s",
1131 (unsigned int)tp->autr->next_probe_time,
1132 ctime_r(&(tp->autr->next_probe_time), tmi)) < 0 ||
1133 fprintf(out, ";;query_failed: %d\n", (int)tp->autr->query_failed)<0
1134 || fprintf(out, ";;query_interval: %d\n",
1135 (int)tp->autr->query_interval) < 0 ||
1136 fprintf(out, ";;retry_time: %d\n", (int)tp->autr->retry_time) < 0) {
1137 log_err("could not write to %s: %s", fn, strerror(errno));
1142 for(ta=tp->autr->keys; ta; ta=ta->next) {
1143 /* by default do not store START and REMOVED keys */
1144 if(ta->s == AUTR_STATE_START)
1146 if(ta->s == AUTR_STATE_REMOVED)
1148 /* only store keys */
1149 if(sldns_wirerr_get_type(ta->rr, ta->rr_len, ta->dname_len)
1150 != LDNS_RR_TYPE_DNSKEY)
1152 str = sldns_wire2str_rr(ta->rr, ta->rr_len);
1153 if(!str || !str[0]) {
1155 log_err("malloc failure writing %s", fn);
1158 str[strlen(str)-1] = 0; /* remove newline */
1159 if(fprintf(out, "%s ;;state=%d [%s] ;;count=%d "
1160 ";;lastchange=%u ;;%s", str, (int)ta->s,
1161 trustanchor_state2str(ta->s), (int)ta->pending_count,
1162 (unsigned int)ta->last_change,
1163 ctime_r(&(ta->last_change), tmi)) < 0) {
1164 log_err("could not write to %s: %s", fn, strerror(errno));
1173 void autr_write_file(struct module_env* env, struct trust_anchor* tp)
1176 char* fname = tp->autr->file;
1178 log_assert(tp->autr);
1180 log_err("autr_write_file: Module environment is NULL.");
1183 /* unique name with pid number and thread number */
1184 snprintf(tempf, sizeof(tempf), "%s.%d-%d", fname, (int)getpid(),
1185 env->worker?*(int*)env->worker:0);
1186 verbose(VERB_ALGO, "autotrust: write to disk: %s", tempf);
1187 out = fopen(tempf, "w");
1189 fatal_exit("could not open autotrust file for writing, %s: %s",
1190 tempf, strerror(errno));
1193 if(!autr_write_contents(out, tempf, tp)) {
1194 /* failed to write contents (completely) */
1197 fatal_exit("could not completely write: %s", fname);
1200 if(fflush(out) != 0)
1201 log_err("could not fflush(%s): %s", fname, strerror(errno));
1203 if(fsync(fileno(out)) != 0)
1204 log_err("could not fsync(%s): %s", fname, strerror(errno));
1206 FlushFileBuffers((HANDLE)_get_osfhandle(_fileno(out)));
1208 if(fclose(out) != 0) {
1209 fatal_exit("could not complete write: %s: %s",
1210 fname, strerror(errno));
1214 /* success; overwrite actual file */
1215 verbose(VERB_ALGO, "autotrust: replaced %s", fname);
1216 #ifdef UB_ON_WINDOWS
1217 (void)unlink(fname); /* windows does not replace file with rename() */
1219 if(rename(tempf, fname) < 0) {
1220 fatal_exit("rename(%s to %s): %s", tempf, fname, strerror(errno));
1225 * Verify if dnskey works for trust point
1226 * @param env: environment (with time) for verification
1227 * @param ve: validator environment (with options) for verification.
1228 * @param tp: trust point to verify with
1229 * @param rrset: DNSKEY rrset to verify.
1230 * @return false on failure, true if verification successful.
1233 verify_dnskey(struct module_env* env, struct val_env* ve,
1234 struct trust_anchor* tp, struct ub_packed_rrset_key* rrset)
1236 char* reason = NULL;
1237 uint8_t sigalg[ALGO_NEEDS_MAX+1];
1238 int downprot = env->cfg->harden_algo_downgrade;
1239 enum sec_status sec = val_verify_DNSKEY_with_TA(env, ve, rrset,
1240 tp->ds_rrset, tp->dnskey_rrset, downprot?sigalg:NULL, &reason);
1241 /* sigalg is ignored, it returns algorithms signalled to exist, but
1242 * in 5011 there are no other rrsets to check. if downprot is
1243 * enabled, then it checks that the DNSKEY is signed with all
1244 * algorithms available in the trust store. */
1245 verbose(VERB_ALGO, "autotrust: validate DNSKEY with anchor: %s",
1246 sec_status_to_string(sec));
1247 return sec == sec_status_secure;
1251 rrsig_get_expiry(uint8_t* d, size_t len)
1253 /* rrsig: 2(rdlen), 2(type) 1(alg) 1(v) 4(origttl), then 4(expi), (4)incep) */
1256 return sldns_read_uint32(d+2+8);
1259 /** Find minimum expiration interval from signatures */
1261 min_expiry(struct module_env* env, struct packed_rrset_data* dd)
1264 int32_t t, r = 15 * 24 * 3600; /* 15 days max */
1265 for(i=dd->count; i<dd->count+dd->rrsig_count; i++) {
1266 t = rrsig_get_expiry(dd->rr_data[i], dd->rr_len[i]);
1267 if((int32_t)t - (int32_t)*env->now > 0) {
1268 t -= (int32_t)*env->now;
1276 /** Is rr self-signed revoked key */
1278 rr_is_selfsigned_revoked(struct module_env* env, struct val_env* ve,
1279 struct ub_packed_rrset_key* dnskey_rrset, size_t i)
1281 enum sec_status sec;
1282 char* reason = NULL;
1283 verbose(VERB_ALGO, "seen REVOKE flag, check self-signed, rr %d",
1285 /* no algorithm downgrade protection necessary, if it is selfsigned
1286 * revoked it can be removed. */
1287 sec = dnskey_verify_rrset(env, ve, dnskey_rrset, dnskey_rrset, i,
1289 return (sec == sec_status_secure);
1292 /** Set fetched value */
1294 seen_trustanchor(struct autr_ta* ta, uint8_t seen)
1297 if(ta->pending_count < 250) /* no numerical overflow, please */
1298 ta->pending_count++;
1301 /** set revoked value */
1303 seen_revoked_trustanchor(struct autr_ta* ta, uint8_t revoked)
1305 ta->revoked = revoked;
1308 /** revoke a trust anchor */
1310 revoke_dnskey(struct autr_ta* ta, int off)
1314 if(sldns_wirerr_get_type(ta->rr, ta->rr_len, ta->dname_len) !=
1315 LDNS_RR_TYPE_DNSKEY)
1317 if(sldns_wirerr_get_rdatalen(ta->rr, ta->rr_len, ta->dname_len) < 2)
1319 data = sldns_wirerr_get_rdata(ta->rr, ta->rr_len, ta->dname_len);
1320 flags = sldns_read_uint16(data);
1321 if (off && (flags&LDNS_KEY_REVOKE_KEY))
1322 flags ^= LDNS_KEY_REVOKE_KEY; /* flip */
1324 flags |= LDNS_KEY_REVOKE_KEY;
1325 sldns_write_uint16(data, flags);
1328 /** Compare two RRs skipping the REVOKED bit. Pass rdata(no len) */
1330 dnskey_compare_skip_revbit(uint8_t* a, size_t a_len, uint8_t* b, size_t b_len)
1335 /* compare RRs RDATA byte for byte. */
1336 for(i = 0; i < a_len; i++)
1342 /* this is the second part of the flags field */
1343 rdf1 |= LDNS_KEY_REVOKE_KEY;
1344 rdf2 |= LDNS_KEY_REVOKE_KEY;
1346 if (rdf1 < rdf2) return -1;
1347 else if (rdf1 > rdf2) return 1;
1353 /** compare trust anchor with rdata, 0 if equal. Pass rdata(no len) */
1355 ta_compare(struct autr_ta* a, uint16_t t, uint8_t* b, size_t b_len)
1358 else if(!b) return -1;
1359 else if(sldns_wirerr_get_type(a->rr, a->rr_len, a->dname_len) != t)
1360 return (int)sldns_wirerr_get_type(a->rr, a->rr_len,
1361 a->dname_len) - (int)t;
1362 else if(t == LDNS_RR_TYPE_DNSKEY) {
1363 return dnskey_compare_skip_revbit(
1364 sldns_wirerr_get_rdata(a->rr, a->rr_len, a->dname_len),
1365 sldns_wirerr_get_rdatalen(a->rr, a->rr_len,
1366 a->dname_len), b, b_len);
1368 else if(t == LDNS_RR_TYPE_DS) {
1369 if(sldns_wirerr_get_rdatalen(a->rr, a->rr_len, a->dname_len) !=
1372 return memcmp(sldns_wirerr_get_rdata(a->rr,
1373 a->rr_len, a->dname_len), b, b_len);
1380 * @param tp: to search in
1381 * @param t: rr type of the rdata.
1382 * @param rdata: to look for (no rdatalen in it)
1383 * @param rdata_len: length of rdata
1384 * @param result: returns NULL or the ta key looked for.
1385 * @return false on malloc failure during search. if true examine result.
1388 find_key(struct trust_anchor* tp, uint16_t t, uint8_t* rdata, size_t rdata_len,
1389 struct autr_ta** result)
1396 for(ta=tp->autr->keys; ta; ta=ta->next) {
1397 if(ta_compare(ta, t, rdata, rdata_len) == 0) {
1406 /** add key and clone RR and tp already locked. rdata without rdlen. */
1407 static struct autr_ta*
1408 add_key(struct trust_anchor* tp, uint32_t ttl, uint8_t* rdata, size_t rdata_len)
1412 size_t rr_len, dname_len;
1413 uint16_t rrtype = htons(LDNS_RR_TYPE_DNSKEY);
1414 uint16_t rrclass = htons(LDNS_RR_CLASS_IN);
1415 uint16_t rdlen = htons(rdata_len);
1416 dname_len = tp->namelen;
1418 rr_len = dname_len + 10 /* type,class,ttl,rdatalen */ + rdata_len;
1419 rr = (uint8_t*)malloc(rr_len);
1420 if(!rr) return NULL;
1421 memmove(rr, tp->name, tp->namelen);
1422 memmove(rr+dname_len, &rrtype, 2);
1423 memmove(rr+dname_len+2, &rrclass, 2);
1424 memmove(rr+dname_len+4, &ttl, 4);
1425 memmove(rr+dname_len+8, &rdlen, 2);
1426 memmove(rr+dname_len+10, rdata, rdata_len);
1427 ta = autr_ta_create(rr, rr_len, dname_len);
1429 /* rr freed in autr_ta_create */
1432 /* link in, tp already locked */
1433 ta->next = tp->autr->keys;
1434 tp->autr->keys = ta;
1438 /** get TTL from DNSKEY rrset */
1440 key_ttl(struct ub_packed_rrset_key* k)
1442 struct packed_rrset_data* d = (struct packed_rrset_data*)k->entry.data;
1446 /** update the time values for the trustpoint */
1448 set_tp_times(struct trust_anchor* tp, time_t rrsig_exp_interval,
1449 time_t origttl, int* changed)
1451 time_t x, qi = tp->autr->query_interval, rt = tp->autr->retry_time;
1453 /* x = MIN(15days, ttl/2, expire/2) */
1457 if(rrsig_exp_interval/2 < x)
1458 x = rrsig_exp_interval/2;
1460 if(!autr_permit_small_holddown) {
1462 tp->autr->query_interval = 3600;
1463 else tp->autr->query_interval = x;
1464 } else tp->autr->query_interval = x;
1466 /* x= MIN(1day, ttl/10, expire/10) */
1470 if(rrsig_exp_interval/10 < x)
1471 x = rrsig_exp_interval/10;
1473 if(!autr_permit_small_holddown) {
1475 tp->autr->retry_time = 3600;
1476 else tp->autr->retry_time = x;
1477 } else tp->autr->retry_time = x;
1479 if(qi != tp->autr->query_interval || rt != tp->autr->retry_time) {
1481 verbose(VERB_ALGO, "orig_ttl is %d", (int)origttl);
1482 verbose(VERB_ALGO, "rrsig_exp_interval is %d",
1483 (int)rrsig_exp_interval);
1484 verbose(VERB_ALGO, "query_interval: %d, retry_time: %d",
1485 (int)tp->autr->query_interval,
1486 (int)tp->autr->retry_time);
1490 /** init events to zero */
1492 init_events(struct trust_anchor* tp)
1495 for(ta=tp->autr->keys; ta; ta=ta->next) {
1500 /** check for revoked keys without trusting any other information */
1502 check_contains_revoked(struct module_env* env, struct val_env* ve,
1503 struct trust_anchor* tp, struct ub_packed_rrset_key* dnskey_rrset,
1506 struct packed_rrset_data* dd = (struct packed_rrset_data*)
1507 dnskey_rrset->entry.data;
1509 log_assert(ntohs(dnskey_rrset->rk.type) == LDNS_RR_TYPE_DNSKEY);
1510 for(i=0; i<dd->count; i++) {
1511 struct autr_ta* ta = NULL;
1512 if(!rr_is_dnskey_sep(ntohs(dnskey_rrset->rk.type),
1513 dd->rr_data[i]+2, dd->rr_len[i]-2) ||
1514 !rr_is_dnskey_revoked(ntohs(dnskey_rrset->rk.type),
1515 dd->rr_data[i]+2, dd->rr_len[i]-2))
1516 continue; /* not a revoked KSK */
1517 if(!find_key(tp, ntohs(dnskey_rrset->rk.type),
1518 dd->rr_data[i]+2, dd->rr_len[i]-2, &ta)) {
1519 log_err("malloc failure");
1520 continue; /* malloc fail in compare*/
1523 continue; /* key not found */
1524 if(rr_is_selfsigned_revoked(env, ve, dnskey_rrset, i)) {
1525 /* checked if there is an rrsig signed by this key. */
1526 /* same keytag, but stored can be revoked already, so
1527 * compare keytags, with +0 or +128(REVOKE flag) */
1528 log_assert(dnskey_calc_keytag(dnskey_rrset, i)-128 ==
1529 sldns_calc_keytag_raw(sldns_wirerr_get_rdata(
1530 ta->rr, ta->rr_len, ta->dname_len),
1531 sldns_wirerr_get_rdatalen(ta->rr, ta->rr_len,
1533 dnskey_calc_keytag(dnskey_rrset, i) ==
1534 sldns_calc_keytag_raw(sldns_wirerr_get_rdata(
1535 ta->rr, ta->rr_len, ta->dname_len),
1536 sldns_wirerr_get_rdatalen(ta->rr, ta->rr_len,
1537 ta->dname_len))); /* checks conversion*/
1538 verbose_key(ta, VERB_ALGO, "is self-signed revoked");
1541 seen_revoked_trustanchor(ta, 1);
1542 do_revoked(env, ta, changed);
1547 /** See if a DNSKEY is verified by one of the DSes */
1549 key_matches_a_ds(struct module_env* env, struct val_env* ve,
1550 struct ub_packed_rrset_key* dnskey_rrset, size_t key_idx,
1551 struct ub_packed_rrset_key* ds_rrset)
1553 struct packed_rrset_data* dd = (struct packed_rrset_data*)
1554 ds_rrset->entry.data;
1555 size_t ds_idx, num = dd->count;
1556 int d = val_favorite_ds_algo(ds_rrset);
1558 for(ds_idx=0; ds_idx<num; ds_idx++) {
1559 if(!ds_digest_algo_is_supported(ds_rrset, ds_idx) ||
1560 !ds_key_algo_is_supported(ds_rrset, ds_idx) ||
1561 ds_get_digest_algo(ds_rrset, ds_idx) != d)
1563 if(ds_get_key_algo(ds_rrset, ds_idx)
1564 != dnskey_get_algo(dnskey_rrset, key_idx)
1565 || dnskey_calc_keytag(dnskey_rrset, key_idx)
1566 != ds_get_keytag(ds_rrset, ds_idx)) {
1569 if(!ds_digest_match_dnskey(env, dnskey_rrset, key_idx,
1570 ds_rrset, ds_idx)) {
1571 verbose(VERB_ALGO, "DS match attempt failed");
1574 if(dnskey_verify_rrset(env, ve, dnskey_rrset,
1575 dnskey_rrset, key_idx, &reason) == sec_status_secure) {
1578 verbose(VERB_ALGO, "DS match failed because the key "
1579 "does not verify the keyset: %s", reason);
1585 /** Set update events */
1587 update_events(struct module_env* env, struct val_env* ve,
1588 struct trust_anchor* tp, struct ub_packed_rrset_key* dnskey_rrset,
1591 struct packed_rrset_data* dd = (struct packed_rrset_data*)
1592 dnskey_rrset->entry.data;
1594 log_assert(ntohs(dnskey_rrset->rk.type) == LDNS_RR_TYPE_DNSKEY);
1596 for(i=0; i<dd->count; i++) {
1597 struct autr_ta* ta = NULL;
1598 if(!rr_is_dnskey_sep(ntohs(dnskey_rrset->rk.type),
1599 dd->rr_data[i]+2, dd->rr_len[i]-2))
1601 if(rr_is_dnskey_revoked(ntohs(dnskey_rrset->rk.type),
1602 dd->rr_data[i]+2, dd->rr_len[i]-2)) {
1603 /* self-signed revoked keys already detected before,
1604 * other revoked keys are not 'added' again */
1607 /* is a key of this type supported?. Note rr_list and
1608 * packed_rrset are in the same order. */
1609 if(!dnskey_algo_is_supported(dnskey_rrset, i)) {
1610 /* skip unknown algorithm key, it is useless to us */
1611 log_nametypeclass(VERB_DETAIL, "trust point has "
1612 "unsupported algorithm at",
1613 tp->name, LDNS_RR_TYPE_DNSKEY, tp->dclass);
1617 /* is it new? if revocation bit set, find the unrevoked key */
1618 if(!find_key(tp, ntohs(dnskey_rrset->rk.type),
1619 dd->rr_data[i]+2, dd->rr_len[i]-2, &ta)) {
1623 ta = add_key(tp, (uint32_t)dd->rr_ttl[i],
1624 dd->rr_data[i]+2, dd->rr_len[i]-2);
1626 /* first time seen, do we have DSes? if match: VALID */
1627 if(ta && tp->ds_rrset && key_matches_a_ds(env, ve,
1628 dnskey_rrset, i, tp->ds_rrset)) {
1629 verbose_key(ta, VERB_ALGO, "verified by DS");
1630 ta->s = AUTR_STATE_VALID;
1636 seen_trustanchor(ta, 1);
1637 verbose_key(ta, VERB_ALGO, "in DNS response");
1639 set_tp_times(tp, min_expiry(env, dd), key_ttl(dnskey_rrset), changed);
1644 * Check if the holddown time has already exceeded
1645 * setting: add-holddown: add holddown timer
1646 * setting: del-holddown: del holddown timer
1647 * @param env: environment with current time
1648 * @param ta: trust anchor to check for.
1649 * @param holddown: the timer value
1650 * @return number of seconds the holddown has passed.
1653 check_holddown(struct module_env* env, struct autr_ta* ta,
1654 unsigned int holddown)
1657 if(*env->now < ta->last_change) {
1658 log_warn("time goes backwards. delaying key holddown");
1661 elapsed = *env->now - ta->last_change;
1662 if (elapsed > (time_t)holddown) {
1663 return elapsed-(time_t)holddown;
1665 verbose_key(ta, VERB_ALGO, "holddown time " ARG_LL "d seconds to go",
1666 (long long) ((time_t)holddown-elapsed));
1671 /** Set last_change to now */
1673 reset_holddown(struct module_env* env, struct autr_ta* ta, int* changed)
1675 ta->last_change = *env->now;
1679 /** Set the state for this trust anchor */
1681 set_trustanchor_state(struct module_env* env, struct autr_ta* ta, int* changed,
1684 verbose_key(ta, VERB_ALGO, "update: %s to %s",
1685 trustanchor_state2str(ta->s), trustanchor_state2str(s));
1687 reset_holddown(env, ta, changed);
1691 /** Event: NewKey */
1693 do_newkey(struct module_env* env, struct autr_ta* anchor, int* c)
1695 if (anchor->s == AUTR_STATE_START)
1696 set_trustanchor_state(env, anchor, c, AUTR_STATE_ADDPEND);
1699 /** Event: AddTime */
1701 do_addtime(struct module_env* env, struct autr_ta* anchor, int* c)
1703 /* This not according to RFC, this is 30 days, but the RFC demands
1704 * MAX(30days, TTL expire time of first DNSKEY set with this key),
1705 * The value may be too small if a very large TTL was used. */
1706 time_t exceeded = check_holddown(env, anchor, env->cfg->add_holddown);
1707 if (exceeded && anchor->s == AUTR_STATE_ADDPEND) {
1708 verbose_key(anchor, VERB_ALGO, "add-holddown time exceeded "
1709 ARG_LL "d seconds ago, and pending-count %d",
1710 (long long)exceeded, anchor->pending_count);
1711 if(anchor->pending_count >= MIN_PENDINGCOUNT) {
1712 set_trustanchor_state(env, anchor, c, AUTR_STATE_VALID);
1713 anchor->pending_count = 0;
1716 verbose_key(anchor, VERB_ALGO, "add-holddown time sanity check "
1717 "failed (pending count: %d)", anchor->pending_count);
1721 /** Event: RemTime */
1723 do_remtime(struct module_env* env, struct autr_ta* anchor, int* c)
1725 time_t exceeded = check_holddown(env, anchor, env->cfg->del_holddown);
1726 if(exceeded && anchor->s == AUTR_STATE_REVOKED) {
1727 verbose_key(anchor, VERB_ALGO, "del-holddown time exceeded "
1728 ARG_LL "d seconds ago", (long long)exceeded);
1729 set_trustanchor_state(env, anchor, c, AUTR_STATE_REMOVED);
1733 /** Event: KeyRem */
1735 do_keyrem(struct module_env* env, struct autr_ta* anchor, int* c)
1737 if(anchor->s == AUTR_STATE_ADDPEND) {
1738 set_trustanchor_state(env, anchor, c, AUTR_STATE_START);
1739 anchor->pending_count = 0;
1740 } else if(anchor->s == AUTR_STATE_VALID)
1741 set_trustanchor_state(env, anchor, c, AUTR_STATE_MISSING);
1744 /** Event: KeyPres */
1746 do_keypres(struct module_env* env, struct autr_ta* anchor, int* c)
1748 if(anchor->s == AUTR_STATE_MISSING)
1749 set_trustanchor_state(env, anchor, c, AUTR_STATE_VALID);
1752 /* Event: Revoked */
1754 do_revoked(struct module_env* env, struct autr_ta* anchor, int* c)
1756 if(anchor->s == AUTR_STATE_VALID || anchor->s == AUTR_STATE_MISSING) {
1757 set_trustanchor_state(env, anchor, c, AUTR_STATE_REVOKED);
1758 verbose_key(anchor, VERB_ALGO, "old id, prior to revocation");
1759 revoke_dnskey(anchor, 0);
1760 verbose_key(anchor, VERB_ALGO, "new id, after revocation");
1764 /** Do statestable transition matrix for anchor */
1766 anchor_state_update(struct module_env* env, struct autr_ta* anchor, int* c)
1771 case AUTR_STATE_START:
1772 /* NewKey: ADDPEND */
1773 if (anchor->fetched)
1774 do_newkey(env, anchor, c);
1777 case AUTR_STATE_ADDPEND:
1779 if (!anchor->fetched)
1780 do_keyrem(env, anchor, c);
1781 /* AddTime: VALID */
1782 else do_addtime(env, anchor, c);
1785 case AUTR_STATE_VALID:
1786 /* RevBit: REVOKED */
1787 if (anchor->revoked)
1788 do_revoked(env, anchor, c);
1789 /* KeyRem: MISSING */
1790 else if (!anchor->fetched)
1791 do_keyrem(env, anchor, c);
1792 else if(!anchor->last_change) {
1793 verbose_key(anchor, VERB_ALGO, "first seen");
1794 reset_holddown(env, anchor, c);
1798 case AUTR_STATE_MISSING:
1799 /* RevBit: REVOKED */
1800 if (anchor->revoked)
1801 do_revoked(env, anchor, c);
1803 else if (anchor->fetched)
1804 do_keypres(env, anchor, c);
1807 case AUTR_STATE_REVOKED:
1808 if (anchor->fetched)
1809 reset_holddown(env, anchor, c);
1810 /* RemTime: REMOVED */
1811 else do_remtime(env, anchor, c);
1814 case AUTR_STATE_REMOVED:
1820 /** if ZSK init then trust KSKs */
1822 init_zsk_to_ksk(struct module_env* env, struct trust_anchor* tp, int* changed)
1824 /* search for VALID ZSKs */
1825 struct autr_ta* anchor;
1828 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1829 /* last_change test makes sure it was manually configured */
1830 if(sldns_wirerr_get_type(anchor->rr, anchor->rr_len,
1831 anchor->dname_len) == LDNS_RR_TYPE_DNSKEY &&
1832 anchor->last_change == 0 &&
1833 !ta_is_dnskey_sep(anchor) &&
1834 anchor->s == AUTR_STATE_VALID)
1839 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1840 if (ta_is_dnskey_sep(anchor) &&
1841 anchor->s == AUTR_STATE_ADDPEND) {
1842 verbose_key(anchor, VERB_ALGO, "trust KSK from "
1844 set_trustanchor_state(env, anchor, changed,
1852 /** Remove missing trustanchors so the list does not grow forever */
1854 remove_missing_trustanchors(struct module_env* env, struct trust_anchor* tp,
1857 struct autr_ta* anchor;
1860 /* see if we have anchors that are valid */
1861 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1863 if (!ta_is_dnskey_sep(anchor))
1865 if (anchor->s == AUTR_STATE_VALID)
1868 /* if there are no SEP Valid anchors, see if we started out with
1869 * a ZSK (last-change=0) anchor, which is VALID and there are KSKs
1870 * now that can be made valid. Do this immediately because there
1871 * is no guarantee that the ZSKs get announced long enough. Usually
1872 * this is immediately after init with a ZSK trusted, unless the domain
1873 * was not advertising any KSKs at all. In which case we perfectly
1874 * track the zero number of KSKs. */
1876 valid = init_zsk_to_ksk(env, tp, changed);
1881 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1882 /* ignore ZSKs if newly added */
1883 if(anchor->s == AUTR_STATE_START)
1885 /* remove ZSKs if a KSK is present */
1886 if (!ta_is_dnskey_sep(anchor)) {
1888 verbose_key(anchor, VERB_ALGO, "remove ZSK "
1889 "[%d key(s) VALID]", valid);
1890 set_trustanchor_state(env, anchor, changed,
1891 AUTR_STATE_REMOVED);
1895 /* Only do MISSING keys */
1896 if (anchor->s != AUTR_STATE_MISSING)
1898 if(env->cfg->keep_missing == 0)
1899 continue; /* keep forever */
1901 exceeded = check_holddown(env, anchor, env->cfg->keep_missing);
1902 /* If keep_missing has exceeded and we still have more than
1903 * one valid KSK: remove missing trust anchor */
1904 if (exceeded && valid > 0) {
1905 verbose_key(anchor, VERB_ALGO, "keep-missing time "
1906 "exceeded " ARG_LL "d seconds ago, [%d key(s) VALID]",
1907 (long long)exceeded, valid);
1908 set_trustanchor_state(env, anchor, changed,
1909 AUTR_STATE_REMOVED);
1914 /** Do the statetable from RFC5011 transition matrix */
1916 do_statetable(struct module_env* env, struct trust_anchor* tp, int* changed)
1918 struct autr_ta* anchor;
1919 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1921 if(!ta_is_dnskey_sep(anchor))
1923 anchor_state_update(env, anchor, changed);
1925 remove_missing_trustanchors(env, tp, changed);
1929 /** See if time alone makes ADDPEND to VALID transition */
1931 autr_holddown_exceed(struct module_env* env, struct trust_anchor* tp, int* c)
1933 struct autr_ta* anchor;
1934 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1935 if(ta_is_dnskey_sep(anchor) &&
1936 anchor->s == AUTR_STATE_ADDPEND)
1937 do_addtime(env, anchor, c);
1941 /** cleanup key list */
1943 autr_cleanup_keys(struct trust_anchor* tp)
1945 struct autr_ta* p, **prevp;
1946 prevp = &tp->autr->keys;
1949 /* do we want to remove this key? */
1950 if(p->s == AUTR_STATE_START || p->s == AUTR_STATE_REMOVED ||
1951 sldns_wirerr_get_type(p->rr, p->rr_len, p->dname_len)
1952 != LDNS_RR_TYPE_DNSKEY) {
1953 struct autr_ta* np = p->next;
1957 /* snip and go to next item */
1962 /* remove pending counts if no longer pending */
1963 if(p->s != AUTR_STATE_ADDPEND)
1964 p->pending_count = 0;
1970 /** calculate next probe time */
1972 calc_next_probe(struct module_env* env, time_t wait)
1974 /* make it random, 90-100% */
1976 if(!autr_permit_small_holddown) {
1980 if(wait == 0) wait = 1;
1984 rnd = (time_t)ub_random_max(env->rnd, (long int)rnd);
1985 return (time_t)(*env->now + rest + rnd);
1988 /** what is first probe time (anchors must be locked) */
1990 wait_probe_time(struct val_anchors* anchors)
1992 rbnode_t* t = rbtree_first(&anchors->autr->probe);
1993 if(t != RBTREE_NULL)
1994 return ((struct trust_anchor*)t->key)->autr->next_probe_time;
1998 /** reset worker timer */
2000 reset_worker_timer(struct module_env* env)
2004 time_t next = (time_t)wait_probe_time(env->anchors);
2005 /* in case this is libunbound, no timer */
2006 if(!env->probe_timer)
2008 if(next > *env->now)
2009 tv.tv_sec = (time_t)(next - *env->now);
2013 comm_timer_set(env->probe_timer, &tv);
2014 verbose(VERB_ALGO, "scheduled next probe in " ARG_LL "d sec", (long long)tv.tv_sec);
2017 /** set next probe for trust anchor */
2019 set_next_probe(struct module_env* env, struct trust_anchor* tp,
2020 struct ub_packed_rrset_key* dnskey_rrset)
2022 struct trust_anchor key, *tp2;
2024 /* use memory allocated in rrset for temporary name storage */
2025 key.node.key = &key;
2026 key.name = dnskey_rrset->rk.dname;
2027 key.namelen = dnskey_rrset->rk.dname_len;
2028 key.namelabs = dname_count_labels(key.name);
2029 key.dclass = tp->dclass;
2030 lock_basic_unlock(&tp->lock);
2032 /* fetch tp again and lock anchors, so that we can modify the trees */
2033 lock_basic_lock(&env->anchors->lock);
2034 tp2 = (struct trust_anchor*)rbtree_search(env->anchors->tree, &key);
2036 verbose(VERB_ALGO, "trustpoint was deleted in set_next_probe");
2037 lock_basic_unlock(&env->anchors->lock);
2040 log_assert(tp == tp2);
2041 lock_basic_lock(&tp->lock);
2044 mold = wait_probe_time(env->anchors);
2045 (void)rbtree_delete(&env->anchors->autr->probe, tp);
2046 tp->autr->next_probe_time = calc_next_probe(env,
2047 tp->autr->query_interval);
2048 (void)rbtree_insert(&env->anchors->autr->probe, &tp->autr->pnode);
2049 mnew = wait_probe_time(env->anchors);
2051 lock_basic_unlock(&env->anchors->lock);
2052 verbose(VERB_ALGO, "next probe set in %d seconds",
2053 (int)tp->autr->next_probe_time - (int)*env->now);
2055 reset_worker_timer(env);
2060 /** Revoke and Delete a trust point */
2062 autr_tp_remove(struct module_env* env, struct trust_anchor* tp,
2063 struct ub_packed_rrset_key* dnskey_rrset)
2065 struct trust_anchor* del_tp;
2066 struct trust_anchor key;
2067 struct autr_point_data pd;
2070 log_nametypeclass(VERB_OPS, "trust point was revoked",
2071 tp->name, LDNS_RR_TYPE_DNSKEY, tp->dclass);
2072 tp->autr->revoked = 1;
2074 /* use space allocated for dnskey_rrset to save name of anchor */
2075 memset(&key, 0, sizeof(key));
2076 memset(&pd, 0, sizeof(pd));
2078 key.node.key = &key;
2079 pd.pnode.key = &key;
2080 pd.next_probe_time = tp->autr->next_probe_time;
2081 key.name = dnskey_rrset->rk.dname;
2082 key.namelen = tp->namelen;
2083 key.namelabs = tp->namelabs;
2084 key.dclass = tp->dclass;
2087 lock_basic_unlock(&tp->lock);
2089 /* take from tree. It could be deleted by someone else,hence (void). */
2090 lock_basic_lock(&env->anchors->lock);
2091 del_tp = (struct trust_anchor*)rbtree_delete(env->anchors->tree, &key);
2092 mold = wait_probe_time(env->anchors);
2093 (void)rbtree_delete(&env->anchors->autr->probe, &key);
2094 mnew = wait_probe_time(env->anchors);
2095 anchors_init_parents_locked(env->anchors);
2096 lock_basic_unlock(&env->anchors->lock);
2098 /* if !del_tp then the trust point is no longer present in the tree,
2099 * it was deleted by someone else, who will write the zonefile and
2100 * clean up the structure */
2103 del_tp->autr->next_probe_time = 0; /* no more probing for it */
2104 autr_write_file(env, del_tp);
2107 autr_point_delete(del_tp);
2110 reset_worker_timer(env);
2114 int autr_process_prime(struct module_env* env, struct val_env* ve,
2115 struct trust_anchor* tp, struct ub_packed_rrset_key* dnskey_rrset)
2118 log_assert(tp && tp->autr);
2119 /* autotrust update trust anchors */
2120 /* the tp is locked, and stays locked unless it is deleted */
2122 /* we could just catch the anchor here while another thread
2123 * is busy deleting it. Just unlock and let the other do its job */
2124 if(tp->autr->revoked) {
2125 log_nametypeclass(VERB_ALGO, "autotrust not processed, "
2126 "trust point revoked", tp->name,
2127 LDNS_RR_TYPE_DNSKEY, tp->dclass);
2128 lock_basic_unlock(&tp->lock);
2129 return 0; /* it is revoked */
2132 /* query_dnskeys(): */
2133 tp->autr->last_queried = *env->now;
2135 log_nametypeclass(VERB_ALGO, "autotrust process for",
2136 tp->name, LDNS_RR_TYPE_DNSKEY, tp->dclass);
2137 /* see if time alone makes some keys valid */
2138 autr_holddown_exceed(env, tp, &changed);
2140 verbose(VERB_ALGO, "autotrust: morekeys, reassemble");
2141 if(!autr_assemble(tp)) {
2142 log_err("malloc failure assembling autotrust keys");
2143 return 1; /* unchanged */
2146 /* did we get any data? */
2148 verbose(VERB_ALGO, "autotrust: no dnskey rrset");
2149 /* no update of query_failed, because then we would have
2150 * to write to disk. But we cannot because we maybe are
2151 * still 'initialising' with DS records, that we cannot write
2152 * in the full format (which only contains KSKs). */
2153 return 1; /* trust point exists */
2155 /* check for revoked keys to remove immediately */
2156 check_contains_revoked(env, ve, tp, dnskey_rrset, &changed);
2158 verbose(VERB_ALGO, "autotrust: revokedkeys, reassemble");
2159 if(!autr_assemble(tp)) {
2160 log_err("malloc failure assembling autotrust keys");
2161 return 1; /* unchanged */
2163 if(!tp->ds_rrset && !tp->dnskey_rrset) {
2164 /* no more keys, all are revoked */
2165 /* this is a success for this probe attempt */
2166 tp->autr->last_success = *env->now;
2167 autr_tp_remove(env, tp, dnskey_rrset);
2168 return 0; /* trust point removed */
2171 /* verify the dnskey rrset and see if it is valid. */
2172 if(!verify_dnskey(env, ve, tp, dnskey_rrset)) {
2173 verbose(VERB_ALGO, "autotrust: dnskey did not verify.");
2174 /* only increase failure count if this is not the first prime,
2175 * this means there was a previous successful probe */
2176 if(tp->autr->last_success) {
2177 tp->autr->query_failed += 1;
2178 autr_write_file(env, tp);
2180 return 1; /* trust point exists */
2183 tp->autr->last_success = *env->now;
2184 tp->autr->query_failed = 0;
2186 /* Add new trust anchors to the data structure
2187 * - note which trust anchors are seen this probe.
2188 * Set trustpoint query_interval and retry_time.
2189 * - find minimum rrsig expiration interval
2191 if(!update_events(env, ve, tp, dnskey_rrset, &changed)) {
2192 log_err("malloc failure in autotrust update_events. "
2193 "trust point unchanged.");
2194 return 1; /* trust point unchanged, so exists */
2197 /* - for every SEP key do the 5011 statetable.
2198 * - remove missing trustanchors (if veryold and we have new anchors).
2200 if(!do_statetable(env, tp, &changed)) {
2201 log_err("malloc failure in autotrust do_statetable. "
2202 "trust point unchanged.");
2203 return 1; /* trust point unchanged, so exists */
2206 autr_cleanup_keys(tp);
2207 if(!set_next_probe(env, tp, dnskey_rrset))
2208 return 0; /* trust point does not exist */
2209 autr_write_file(env, tp);
2211 verbose(VERB_ALGO, "autotrust: changed, reassemble");
2212 if(!autr_assemble(tp)) {
2213 log_err("malloc failure assembling autotrust keys");
2214 return 1; /* unchanged */
2216 if(!tp->ds_rrset && !tp->dnskey_rrset) {
2217 /* no more keys, all are revoked */
2218 autr_tp_remove(env, tp, dnskey_rrset);
2219 return 0; /* trust point removed */
2221 } else verbose(VERB_ALGO, "autotrust: no changes");
2223 return 1; /* trust point exists */
2226 /** debug print a trust anchor key */
2228 autr_debug_print_ta(struct autr_ta* ta)
2231 char* str = sldns_wire2str_rr(ta->rr, ta->rr_len);
2233 log_info("out of memory in debug_print_ta");
2236 if(str && str[0]) str[strlen(str)-1]=0; /* remove newline */
2237 ctime_r(&ta->last_change, buf);
2238 if(buf[0]) buf[strlen(buf)-1]=0; /* remove newline */
2239 log_info("[%s] %s ;;state:%d ;;pending_count:%d%s%s last:%s",
2240 trustanchor_state2str(ta->s), str, ta->s, ta->pending_count,
2241 ta->fetched?" fetched":"", ta->revoked?" revoked":"", buf);
2245 /** debug print a trust point */
2247 autr_debug_print_tp(struct trust_anchor* tp)
2253 dname_str(tp->name, buf);
2254 log_info("trust point %s : %d", buf, (int)tp->dclass);
2255 log_info("assembled %d DS and %d DNSKEYs",
2256 (int)tp->numDS, (int)tp->numDNSKEY);
2258 log_packed_rrset(0, "DS:", tp->ds_rrset);
2260 if(tp->dnskey_rrset) {
2261 log_packed_rrset(0, "DNSKEY:", tp->dnskey_rrset);
2263 log_info("file %s", tp->autr->file);
2264 ctime_r(&tp->autr->last_queried, buf);
2265 if(buf[0]) buf[strlen(buf)-1]=0; /* remove newline */
2266 log_info("last_queried: %u %s", (unsigned)tp->autr->last_queried, buf);
2267 ctime_r(&tp->autr->last_success, buf);
2268 if(buf[0]) buf[strlen(buf)-1]=0; /* remove newline */
2269 log_info("last_success: %u %s", (unsigned)tp->autr->last_success, buf);
2270 ctime_r(&tp->autr->next_probe_time, buf);
2271 if(buf[0]) buf[strlen(buf)-1]=0; /* remove newline */
2272 log_info("next_probe_time: %u %s", (unsigned)tp->autr->next_probe_time,
2274 log_info("query_interval: %u", (unsigned)tp->autr->query_interval);
2275 log_info("retry_time: %u", (unsigned)tp->autr->retry_time);
2276 log_info("query_failed: %u", (unsigned)tp->autr->query_failed);
2278 for(ta=tp->autr->keys; ta; ta=ta->next) {
2279 autr_debug_print_ta(ta);
2284 autr_debug_print(struct val_anchors* anchors)
2286 struct trust_anchor* tp;
2287 lock_basic_lock(&anchors->lock);
2288 RBTREE_FOR(tp, struct trust_anchor*, anchors->tree) {
2289 lock_basic_lock(&tp->lock);
2290 autr_debug_print_tp(tp);
2291 lock_basic_unlock(&tp->lock);
2293 lock_basic_unlock(&anchors->lock);
2296 void probe_answer_cb(void* arg, int ATTR_UNUSED(rcode),
2297 sldns_buffer* ATTR_UNUSED(buf), enum sec_status ATTR_UNUSED(sec),
2298 char* ATTR_UNUSED(why_bogus))
2300 /* retry was set before the query was done,
2301 * re-querytime is set when query succeeded, but that may not
2302 * have reset this timer because the query could have been
2303 * handled by another thread. In that case, this callback would
2304 * get called after the original timeout is done.
2305 * By not resetting the timer, it may probe more often, but not
2307 * Unless the new lookup resulted in smaller TTLs and thus smaller
2308 * timeout values. In that case one old TTL could be mistakenly done.
2310 struct module_env* env = (struct module_env*)arg;
2311 verbose(VERB_ALGO, "autotrust probe answer cb");
2312 reset_worker_timer(env);
2315 /** probe a trust anchor DNSKEY and unlocks tp */
2317 probe_anchor(struct module_env* env, struct trust_anchor* tp)
2319 struct query_info qinfo;
2320 uint16_t qflags = BIT_RD;
2321 struct edns_data edns;
2322 sldns_buffer* buf = env->scratch_buffer;
2323 qinfo.qname = regional_alloc_init(env->scratch, tp->name, tp->namelen);
2325 log_err("out of memory making 5011 probe");
2328 qinfo.qname_len = tp->namelen;
2329 qinfo.qtype = LDNS_RR_TYPE_DNSKEY;
2330 qinfo.qclass = tp->dclass;
2331 log_query_info(VERB_ALGO, "autotrust probe", &qinfo);
2332 verbose(VERB_ALGO, "retry probe set in %d seconds",
2333 (int)tp->autr->next_probe_time - (int)*env->now);
2334 edns.edns_present = 1;
2336 edns.edns_version = 0;
2337 edns.bits = EDNS_DO;
2338 edns.opt_list = NULL;
2339 if(sldns_buffer_capacity(buf) < 65535)
2340 edns.udp_size = (uint16_t)sldns_buffer_capacity(buf);
2341 else edns.udp_size = 65535;
2343 /* can't hold the lock while mesh_run is processing */
2344 lock_basic_unlock(&tp->lock);
2346 /* delete the DNSKEY from rrset and key cache so an active probe
2347 * is done. First the rrset so another thread does not use it
2348 * to recreate the key entry in a race condition. */
2349 rrset_cache_remove(env->rrset_cache, qinfo.qname, qinfo.qname_len,
2350 qinfo.qtype, qinfo.qclass, 0);
2351 key_cache_remove(env->key_cache, qinfo.qname, qinfo.qname_len,
2354 if(!mesh_new_callback(env->mesh, &qinfo, qflags, &edns, buf, 0,
2355 &probe_answer_cb, env)) {
2356 log_err("out of memory making 5011 probe");
2360 /** fetch first to-probe trust-anchor and lock it and set retrytime */
2361 static struct trust_anchor*
2362 todo_probe(struct module_env* env, time_t* next)
2364 struct trust_anchor* tp;
2367 lock_basic_lock(&env->anchors->lock);
2368 if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) {
2369 /* in case of revoked anchors */
2370 lock_basic_unlock(&env->anchors->lock);
2371 /* signal that there are no anchors to probe */
2375 tp = (struct trust_anchor*)el->key;
2376 lock_basic_lock(&tp->lock);
2378 /* is it eligible? */
2379 if((time_t)tp->autr->next_probe_time > *env->now) {
2380 /* no more to probe */
2381 *next = (time_t)tp->autr->next_probe_time - *env->now;
2382 lock_basic_unlock(&tp->lock);
2383 lock_basic_unlock(&env->anchors->lock);
2387 /* reset its next probe time */
2388 (void)rbtree_delete(&env->anchors->autr->probe, tp);
2389 tp->autr->next_probe_time = calc_next_probe(env, tp->autr->retry_time);
2390 (void)rbtree_insert(&env->anchors->autr->probe, &tp->autr->pnode);
2391 lock_basic_unlock(&env->anchors->lock);
2397 autr_probe_timer(struct module_env* env)
2399 struct trust_anchor* tp;
2400 time_t next_probe = 3600;
2402 if(autr_permit_small_holddown) next_probe = 1;
2403 verbose(VERB_ALGO, "autotrust probe timer callback");
2404 /* while there are still anchors to probe */
2405 while( (tp = todo_probe(env, &next_probe)) ) {
2406 /* make a probe for this anchor */
2407 probe_anchor(env, tp);
2410 regional_free_all(env->scratch);
2412 return 0; /* no trust points to probe */
2413 verbose(VERB_ALGO, "autotrust probe timer %d callbacks done", num);