Searched refs:autr (Results 1 - 8 of 8) sorted by relevance
| /openbsd-current/usr.sbin/unbound/validator/ |
| H A D | autotrust.c | 96 log_assert(a->autr && b->autr);
97 if(a->autr->next_probe_time < b->autr->next_probe_time)
99 if(a->autr->next_probe_time > b->autr->next_probe_time)
112 if(anchors->autr)
113 res = anchors->autr->probe.count;
346 tp->autr = (struct autr_point_data*)calloc(1, sizeof(*tp->autr));
[all...] |
| H A D | val_anchor.h | 71 struct autr_global_data* autr; member in struct:val_anchors
110 struct autr_point_data* autr; member in struct:trust_anchor
|
| H A D | val_anchor.c | 86 a->autr = autr_global_create();
87 if(!a->autr) {
93 lock_protect(&a->lock, a->autr, sizeof(*a->autr));
120 if(ta->autr) {
144 lock_unprotect(&anchors->lock, anchors->autr);
150 autr_global_delete(anchors->autr);
997 if(ta->autr || (ta->numDS == 0 && ta->numDNSKEY == 0)) {
1109 /* do autr last, so that it sees what anchors are filled by other
1231 if(ta->keylist || ta->autr || t
[all...] |
| H A D | validator.c | 3221 if(ta->autr) {
|
| /openbsd-current/sbin/unwind/libunbound/validator/ |
| H A D | autotrust.c | 96 log_assert(a->autr && b->autr);
97 if(a->autr->next_probe_time < b->autr->next_probe_time)
99 if(a->autr->next_probe_time > b->autr->next_probe_time)
112 if(anchors->autr)
113 res = anchors->autr->probe.count;
346 tp->autr = (struct autr_point_data*)calloc(1, sizeof(*tp->autr));
[all...] |
| H A D | val_anchor.h | 71 struct autr_global_data* autr; member in struct:val_anchors
110 struct autr_point_data* autr; member in struct:trust_anchor
|
| H A D | val_anchor.c | 86 a->autr = autr_global_create();
87 if(!a->autr) {
93 lock_protect(&a->lock, a->autr, sizeof(*a->autr));
120 if(ta->autr) {
144 lock_unprotect(&anchors->lock, anchors->autr);
150 autr_global_delete(anchors->autr);
997 if(ta->autr || (ta->numDS == 0 && ta->numDNSKEY == 0)) {
1109 /* do autr last, so that it sees what anchors are filled by other
1231 if(ta->keylist || ta->autr || t
[all...] |
| H A D | validator.c | 3221 if(ta->autr) {
|
Completed in 101 milliseconds