unbound/validator/val_nsec3.c

13  * this list of conditions and the following disclaimer.
16  * this list of conditions and the following disclaimer in the documentation
108 	/** the list of NSEC3s to filter; array */
109 	struct ub_packed_rrset_key** list;
110 	/** number of rrsets in list */
313  * Iterate through NSEC3 list, per RR
314  * This routine gives the next RR in the list (or sets rrset null).
339 	if(!filter->zone) /* empty list */
343 		if(ntohs(filter->list[i]->rk.type) != LDNS_RR_TYPE_NSEC3 ||
344 			ntohs(filter->list[i]->rk.rrset_class) !=
348 		nm = filter->list[i]->rk.dname;
349 		nmlen = filter->list[i]->rk.dname_len;
356 		for(; r < (int)rrset_get_count(filter->list[i]); r++) {
358 			if(nsec3_unknown_flags(filter->list[i], r) ||
359 				!nsec3_known_algo(filter->list[i], r))
364 			return filter->list[i];
376  *	the first RR to examine. Is NULL on empty list.
404  * @param list: list of rrsets, an array of them.
405  * @param num: number of rrsets in list.
412 filter_init(struct nsec3_filter* filter, struct ub_packed_rrset_key** list,
420 	filter->list = list;
424 		/* ignore other stuff in the list */
425 		if(ntohs(list[i]->rk.type) != LDNS_RR_TYPE_NSEC3 ||
426 			ntohs(list[i]->rk.rrset_class) != qinfo->qclass)
429 		if(!nsec3_rrset_has_known(list[i]))
434 		nm = list[i]->rk.dname;
435 		nmlen = list[i]->rk.dname_len;
867  * Given a name, find a covering NSEC3 from among a list of NSEC3s.
914  * Given a name and a list of NSEC3s, find the candidate closest encloser.
1116 	struct ub_packed_rrset_key** list, size_t num,
1122 	if(!list || num == 0 || !kkey || !key_entry_isgood(kkey))
1125 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1275 	struct ub_packed_rrset_key** list, size_t num,
1281 	if(!list || num == 0 || !kkey || !key_entry_isgood(kkey))
1284 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1294         struct ub_packed_rrset_key** list, size_t num,
1305 	if(!list || num == 0 || !kkey || !key_entry_isgood(kkey))
1308 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1338 /** test if list is all secure */
1341 	struct ub_packed_rrset_key** list, size_t num,
1347 		d = (struct packed_rrset_data*)list[i]->entry.data;
1348 		if(list[i]->rk.type != htons(LDNS_RR_TYPE_NSEC3))
1352 		rrset_check_sec_status(env->rrset_cache, list[i], *env->now);
1355 		d->security = val_verify_rrset_entry(env, ve, list[i], kkey,
1361 		rrset_update_sec_status(env->rrset_cache, list[i], *env->now);
1368 	struct ub_packed_rrset_key** list, size_t num,
1378 	if(!list || num == 0 || !kkey || !key_entry_isgood(kkey)) {
1382 	if(!list_is_secure(env, ve, list, num, kkey, reason))
1385 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1456 	struct ub_packed_rrset_key** list, size_t num,
1464 	if(!list || num == 0 || !kkey || !key_entry_isgood(kkey))
1467 	filter_init(&flt, list, num, qinfo); /* init RR iterator */