unbound/validator/val_nsec3.c

721  * @param flt: filter with zone name.
727 nsec3_hash_matches_owner(struct nsec3_filter* flt,
742 		query_dname_compare(nm+(size_t)nm[0]+1, flt->zone) == 0) {
752  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
762 find_matching_nsec3(struct module_env* env, struct nsec3_filter* flt,
775 	for(s=filter_first(flt, &i_rs, &i_rr); s;
776 		s=filter_next(flt, &i_rs, &i_rr)) {
797 			if(nsec3_hash_matches_owner(flt, hash, s)) {
862  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
872 find_covering_nsec3(struct module_env* env, struct nsec3_filter* flt,
885 	for(s=filter_first(flt, &i_rs, &i_rr); s;
886 		s=filter_next(flt, &i_rs, &i_rr)) {
907 			if(nsec3_covers(flt->zone, hash, s, i_rr,
926  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
934 nsec3_find_closest_encloser(struct module_env* env, struct nsec3_filter* flt,
950 	while(dname_subdomain_c(nm, flt->zone)) {
955 		if(find_matching_nsec3(env, flt, ct, nm, nmlen,
992  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
1008 nsec3_prove_closest_encloser(struct module_env* env, struct nsec3_filter* flt,
1017 	if(!nsec3_find_closest_encloser(env, flt, ct, qinfo, ce, calculations)) {
1071 	if(!find_covering_nsec3(env, flt, ct, nc, nc_len,
1116 nsec3_do_prove_nameerror(struct module_env* env, struct nsec3_filter* flt,
1129 	sec = nsec3_prove_closest_encloser(env, flt, ct, qinfo, 1, &ce, calc);
1153 	if(!find_covering_nsec3(env, flt, ct, wc, wclen, &wc_rrset, &wc_rr, calc)) {
1186 	struct nsec3_filter flt;
1190 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1191 	if(!flt.zone)
1193 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1196 		flt.zone, 0, 0);
1197 	return nsec3_do_prove_nameerror(env, &flt, ct, qinfo, calc);
1207 nsec3_do_prove_nodata(struct module_env* env, struct nsec3_filter* flt,
1218 	if(find_matching_nsec3(env, flt, ct, qinfo->qname, qinfo->qname_len,
1279 	sec = nsec3_prove_closest_encloser(env, flt, ct, qinfo, 1, &ce, calc);
1297 	if(wc && find_matching_nsec3(env, flt, ct, wc, wclen, &rrset, &rr,
1372 	struct nsec3_filter flt;
1376 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1377 	if(!flt.zone)
1379 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1381 	return nsec3_do_prove_nodata(env, &flt, ct, qinfo, calc);
1390 	struct nsec3_filter flt;
1399 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1400 	if(!flt.zone)
1402 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1416 	if(!find_covering_nsec3(env, &flt, ct, nc, nc_len,
1481 	struct nsec3_filter flt;
1498 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1499 	if(!flt.zone) {
1503 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1508 	if(find_matching_nsec3(env, &flt, ct, qinfo->qname, qinfo->qname_len,
1546 	sec = nsec3_prove_closest_encloser(env, &flt, ct, qinfo, 1, &ce, &calc);
1588 	struct nsec3_filter flt;
1593 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1594 	if(!flt.zone)
1596 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1602 	secnx = nsec3_do_prove_nameerror(env, &flt, ct, qinfo, calc);
1607 	sec = nsec3_do_prove_nodata(env, &flt, ct, qinfo, calc);