unbound/validator/val_nsec3.c

747  * @param flt: filter with zone name.
753 nsec3_hash_matches_owner(struct nsec3_filter* flt,
767 		query_dname_compare(nm+(size_t)nm[0]+1, flt->zone) == 0) {
777  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
786 find_matching_nsec3(struct module_env* env, struct nsec3_filter* flt,
797 	for(s=filter_first(flt, &i_rs, &i_rr); s;
798 		s=filter_next(flt, &i_rs, &i_rr)) {
807 		else if(nsec3_hash_matches_owner(flt, hash, s)) {
870  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
879 find_covering_nsec3(struct module_env* env, struct nsec3_filter* flt,
890 	for(s=filter_first(flt, &i_rs, &i_rr); s;
891 		s=filter_next(flt, &i_rs, &i_rr)) {
900 		else if(nsec3_covers(flt->zone, hash, s, i_rr,
918  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
925 nsec3_find_closest_encloser(struct module_env* env, struct nsec3_filter* flt,
940 	while(dname_subdomain_c(nm, flt->zone)) {
941 		if(find_matching_nsec3(env, flt, ct, nm, nmlen,
978  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
992 nsec3_prove_closest_encloser(struct module_env* env, struct nsec3_filter* flt,
1001 	if(!nsec3_find_closest_encloser(env, flt, ct, qinfo, ce)) {
1041 	if(!find_covering_nsec3(env, flt, ct, nc, nc_len,
1072 nsec3_do_prove_nameerror(struct module_env* env, struct nsec3_filter* flt,
1085 	sec = nsec3_prove_closest_encloser(env, flt, ct, qinfo, 1, &ce);
1100 	if(!wc || !find_covering_nsec3(env, flt, ct, wc, wclen,
1120 	struct nsec3_filter flt;
1125 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1126 	if(!flt.zone)
1128 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1131 		flt.zone, 0, 0);
1132 	return nsec3_do_prove_nameerror(env, &flt, &ct, qinfo);
1142 nsec3_do_prove_nodata(struct module_env* env, struct nsec3_filter* flt,
1152 	if(find_matching_nsec3(env, flt, ct, qinfo->qname, qinfo->qname_len,
1201 	sec = nsec3_prove_closest_encloser(env, flt, ct, qinfo, 1, &ce);
1217 	if(wc && find_matching_nsec3(env, flt, ct, wc, wclen, &rrset, &rr)) {
1279 	struct nsec3_filter flt;
1284 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1285 	if(!flt.zone)
1287 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1289 	return nsec3_do_prove_nodata(env, &flt, &ct, qinfo);
1298 	struct nsec3_filter flt;
1308 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1309 	if(!flt.zone)
1311 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1325 	if(!find_covering_nsec3(env, &flt, &ct, nc, nc_len,
1372 	struct nsec3_filter flt;
1385 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1386 	if(!flt.zone) {
1390 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1395 	if(find_matching_nsec3(env, &flt, &ct, qinfo->qname, qinfo->qname_len,
1421 	if(nsec3_prove_closest_encloser(env, &flt, &ct, qinfo, 1, &ce)
1461 	struct nsec3_filter flt;
1467 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1468 	if(!flt.zone)
1470 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1476 	secnx = nsec3_do_prove_nameerror(env, &flt, &ct, qinfo);
1479 	sec = nsec3_do_prove_nodata(env, &flt, &ct, qinfo);