Lines Matching refs:autr
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;
356 tp->autr = (struct autr_point_data*)calloc(1, sizeof(*tp->autr));
357 if(!tp->autr) {
362 tp->autr->pnode.key = tp;
371 free(tp->autr);
375 if(!rbtree_insert(&anchors->autr->probe, &tp->autr->pnode)) {
382 free(tp->autr);
388 lock_protect(&tp->lock, tp->autr, sizeof(*tp->autr));
418 lock_unprotect(&tp->lock, tp->autr);
422 if(tp->autr) {
423 struct autr_ta* p = tp->autr->keys, *np;
429 free(tp->autr->file);
430 free(tp->autr);
445 if(!tp->autr) {
474 ta->next = (*tp)->autr->keys;
475 (*tp)->autr->keys = ta;
562 log_assert(tp->autr->keys == ta);
563 tp->autr->keys = ta->next;
568 if(!tp->autr->file) {
569 tp->autr->file = strdup(fname);
570 if(!tp->autr->file) {
776 if(assemble_iterate_hasfirst(assemble_iterate_ds, tp->autr->keys)) {
778 assemble_iterate_ds, tp->autr->keys);
782 assemble_iterate_ds, tp->autr->keys);
788 if(assemble_iterate_hasfirst(assemble_iterate_dnskey, tp->autr->keys)) {
790 assemble_iterate_dnskey, tp->autr->keys);
794 assemble_iterate_dnskey, tp->autr->keys);
815 tp->autr->keys);
817 tp->autr->keys);
888 if(*anchor && !(*anchor)->autr->file) {
889 (*anchor)->autr->file = strdup(nm);
890 if(!(*anchor)->autr->file) {
907 tp->autr->last_queried = (time_t)parse_int(line+16, &r);
912 tp->autr->last_success = (time_t)parse_int(line+16, &r);
918 (void)rbtree_delete(&anchors->autr->probe, tp);
919 tp->autr->next_probe_time = (time_t)parse_int(line+19, &r);
920 (void)rbtree_insert(&anchors->autr->probe, &tp->autr->pnode);
926 tp->autr->query_failed = (uint8_t)parse_int(line+16, &r);
931 tp->autr->query_interval = (time_t)parse_int(line+18, &r);
936 tp->autr->retry_time = (time_t)parse_int(line+14, &r);
1162 if(tp->autr->revoked) {
1177 (unsigned int)tp->autr->last_queried,
1178 autr_ctime_r(&(tp->autr->last_queried), tmi)) < 0 ||
1180 (unsigned int)tp->autr->last_success,
1181 autr->last_success), tmi)) < 0 ||
1183 (unsigned int)tp->autr->next_probe_time,
1184 autr_ctime_r(&(tp->autr->next_probe_time), tmi)) < 0 ||
1185 fprintf(out, ";;query_failed: %d\n", (int)tp->autr->query_failed)<0
1187 (int)tp->autr->query_interval) < 0 ||
1188 fprintf(out, ";;retry_time: %d\n", (int)tp->autr->retry_time) < 0) {
1194 for(ta=tp->autr->keys; ta; ta=ta->next) {
1228 char* fname = tp->autr->file;
1233 log_assert(tp->autr);
1473 for(ta=tp->autr->keys; ta; ta=ta->next) {
1510 ta->next = tp->autr->keys;
1511 tp->autr->keys = ta;
1528 time_t x, qi = tp->autr->query_interval, rt = tp->autr->retry_time;
1539 tp->autr->query_interval = 3600;
1540 else tp->autr->query_interval = x;
1541 } else tp->autr->query_interval = x;
1552 tp->autr->retry_time = 3600;
1553 else tp->autr->retry_time = x;
1554 } else tp->autr->retry_time = x;
1556 if(qi != tp->autr->query_interval || rt != tp->autr->retry_time) {
1562 (int)tp->autr->query_interval,
1563 (int)tp->autr->retry_time);
1572 for(ta=tp->autr->keys; ta; ta=ta->next) {
1914 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1925 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1947 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1967 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
2005 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
2020 for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
2032 prevp = &tp->autr->keys;
2033 p = tp->autr->keys;
2077 rbnode_type* t = rbtree_first(&anchors->autr->probe);
2079 return ((struct trust_anchor*)t->key)->autr->next_probe_time;
2145 (void)rbtree_delete(&env->anchors->autr->probe, tp);
2146 tp->autr->next_probe_time = calc_next_probe(env,
2147 tp->autr->query_interval);
2148 (void)rbtree_insert(&env->anchors->autr->probe, &tp->autr->pnode);
2153 (int)tp->autr->next_probe_time - (int)*env->now);
2172 tp->autr->revoked = 1;
2177 key.autr = &pd;
2180 pd.next_probe_time = tp->autr->next_probe_time;
2193 (void)rbtree_delete(&env->anchors->autr->probe, &key);
2203 del_tp->autr->next_probe_time = 0; /* no more probing for it */
2219 log_assert(tp && tp->autr);
2225 if(tp->autr->revoked) {
2234 tp->autr->last_queried = *env->now;
2267 tp->autr->last_success = *env->now;
2277 if(tp->autr->last_success) {
2278 tp->autr->query_failed += 1;
2284 tp->autr->last_success = *env->now;
2285 tp->autr->query_failed = 0;
2354 if(!tp->autr)
2366 log_info("file %s", (tp->autr->file?tp->autr->file:"null"));
2367 (void)autr_ctime_r(&tp->autr->last_queried, buf);
2369 log_info("last_queried: %u %s", (unsigned)tp->autr->last_queried, buf);
2370 (void)autr_ctime_r(&tp->autr->last_success, buf);
2372 log_info("last_success: %u %s", (unsigned)tp->autr->last_success, buf);
2373 (void)autr_ctime_r(&tp->autr->next_probe_time, buf);
2375 log_info("next_probe_time: %u %s", (unsigned)tp->autr->next_probe_time,
2377 log_info("query_interval: %u", (unsigned)tp->autr->query_interval);
2378 log_info("retry_time: %u", (unsigned)tp->autr->retry_time);
2379 log_info("query_failed: %u", (unsigned)tp->autr->query_failed);
2381 for(ta=tp->autr->keys; ta; ta=ta->next) {
2437 (int)tp->autr->next_probe_time - (int)*env->now);
2477 if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) {
2488 if((time_t)tp->autr->next_probe_time > *env->now) {
2490 *next = (time_t)tp->autr->next_probe_time - *env->now;
2497 (void)rbtree_delete(&env->anchors->autr->probe, tp);
2498 tp->autr->next_probe_time = calc_next_probe(env, tp->autr->retry_time);
2499 (void)rbtree_insert(&env->anchors->autr->probe, &tp->autr->pnode);
Indexes created Sun Oct 04 00:26:11 UTC 2026