libunbound/validator/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));
347 	if(!tp->autr) {
352 	tp->autr->pnode.key = tp;
361 		free(tp->autr);
365 	if(!rbtree_insert(&anchors->autr->probe, &tp->autr->pnode)) {
372 		free(tp->autr);
378 	lock_protect(&tp->lock, tp->autr, sizeof(*tp->autr));
399 	lock_unprotect(&tp->lock, tp->autr);
403 	if(tp->autr) {
404 		struct autr_ta* p = tp->autr->keys, *np;
411 		free(tp->autr->file);
412 		free(tp->autr);
427 		if(!tp->autr) {
457 	ta->next = (*tp)->autr->keys;
458 	(*tp)->autr->keys = ta;
545 	if(!tp->autr->file) {
546 		tp->autr->file = strdup(fname);
547 		if(!tp->autr->file) {
753 	if(assemble_iterate_hasfirst(assemble_iterate_ds, tp->autr->keys)) {
755 			assemble_iterate_ds, tp->autr->keys);
759 			assemble_iterate_ds, tp->autr->keys);
765 	if(assemble_iterate_hasfirst(assemble_iterate_dnskey, tp->autr->keys)) {
767 			assemble_iterate_dnskey, tp->autr->keys);
771 			assemble_iterate_dnskey, tp->autr->keys);
792 		tp->autr->keys);
794 		tp->autr->keys);
871 		tp->autr->last_queried = (time_t)parse_int(line+16, &r);
876 		tp->autr->last_success = (time_t)parse_int(line+16, &r);
882 		(void)rbtree_delete(&anchors->autr->probe, tp);
883 		tp->autr->next_probe_time = (time_t)parse_int(line+19, &r);
884 		(void)rbtree_insert(&anchors->autr->probe, &tp->autr->pnode);
890 		tp->autr->query_failed = (uint8_t)parse_int(line+16, &r);
895 		tp->autr->query_interval = (time_t)parse_int(line+18, &r);
900 		tp->autr->retry_time = (time_t)parse_int(line+14, &r);
1129 	if(tp->autr->revoked) {
1144 		(unsigned int)tp->autr->last_queried,
1145 		autr_ctime_r(&(tp->autr->last_queried), tmi)) < 0 ||
1147 		(unsigned int)tp->autr->last_success,
1148 		autr_ctime_r(&(tp->autr->last_success), tmi)) < 0 ||
1150 		(unsigned int)tp->autr->next_probe_time,
1151 		autr_ctime_r(&(tp->autr->next_probe_time), tmi)) < 0 ||
1152 	   fprintf(out, ";;query_failed: %d\n", (int)tp->autr->query_failed)<0
1154 	   (int)tp->autr->query_interval) < 0 ||
1155 	   fprintf(out, ";;retry_time: %d\n", (int)tp->autr->retry_time) < 0) {
1161 	for(ta=tp->autr->keys; ta; ta=ta->next) {
1195 	char* fname = tp->autr->file;
1200 	log_assert(tp->autr);
1431 	for(ta=tp->autr->keys; ta; ta=ta->next) {
1468 	ta->next = tp->autr->keys;
1469 	tp->autr->keys = ta;
1486 	time_t x, qi = tp->autr->query_interval, rt = tp->autr->retry_time;
1497 			tp->autr->query_interval = 3600;
1498 		else	tp->autr->query_interval = x;
1499 	}	else    tp->autr->query_interval = x;
1510 			tp->autr->retry_time = 3600;
1511 		else	tp->autr->retry_time = x;
1512 	}	else    tp->autr->retry_time = x;
1514 	if(qi != tp->autr->query_interval || rt != tp->autr->retry_time) {
1520 			(int)tp->autr->query_interval,
1521 			(int)tp->autr->retry_time);
1530 	for(ta=tp->autr->keys; ta; ta=ta->next) {
1871 	for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1882 	for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1904 	for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1924 	for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1962 	for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1977 	for(anchor = tp->autr->keys; anchor; anchor = anchor->next) {
1989 	prevp = &tp->autr->keys;
1990 	p = tp->autr->keys;
2035 	rbnode_type* t = rbtree_first(&anchors->autr->probe);
2037 		return ((struct trust_anchor*)t->key)->autr->next_probe_time;
2088 	(void)rbtree_delete(&env->anchors->autr->probe, tp);
2089 	tp->autr->next_probe_time = calc_next_probe(env,
2090 		tp->autr->query_interval);
2091 	(void)rbtree_insert(&env->anchors->autr->probe, &tp->autr->pnode);
2096 		(int)tp->autr->next_probe_time - (int)*env->now);
2115 	tp->autr->revoked = 1;
2120 	key.autr = &pd;
2123 	pd.next_probe_time = tp->autr->next_probe_time;
2136 	(void)rbtree_delete(&env->anchors->autr->probe, &key);
2146 		del_tp->autr->next_probe_time = 0; /* no more probing for it */
2162 	log_assert(tp && tp->autr);
2168 	if(tp->autr->revoked) {
2177 	tp->autr->last_queried = *env->now;
2210 			tp->autr->last_success = *env->now;
2220 		if(tp->autr->last_success) {
2221 			tp->autr->query_failed += 1;
2227 	tp->autr->last_success = *env->now;
2228 	tp->autr->query_failed = 0;
2295 	if(!tp->autr)
2307 	log_info("file %s", tp->autr->file);
2308 	(void)autr_ctime_r(&tp->autr->last_queried, buf);
2310 	log_info("last_queried: %u %s", (unsigned)tp->autr->last_queried, buf);
2311 	(void)autr_ctime_r(&tp->autr->last_success, buf);
2313 	log_info("last_success: %u %s", (unsigned)tp->autr->last_success, buf);
2314 	(void)autr_ctime_r(&tp->autr->next_probe_time, buf);
2316 	log_info("next_probe_time: %u %s", (unsigned)tp->autr->next_probe_time,
2318 	log_info("query_interval: %u", (unsigned)tp->autr->query_interval);
2319 	log_info("retry_time: %u", (unsigned)tp->autr->retry_time);
2320 	log_info("query_failed: %u", (unsigned)tp->autr->query_failed);
2322 	for(ta=tp->autr->keys; ta; ta=ta->next) {
2378 		(int)tp->autr->next_probe_time - (int)*env->now);
2418 	if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) {
2429 	if((time_t)tp->autr->next_probe_time > *env->now) {
2431 		*next = (time_t)tp->autr->next_probe_time - *env->now;
2438 	(void)rbtree_delete(&env->anchors->autr->probe, tp);
2439 	tp->autr->next_probe_time = calc_next_probe(env, tp->autr->retry_time);
2440 	(void)rbtree_insert(&env->anchors->autr->probe, &tp->autr->pnode);