unbound/validator/val_nsec3.c

697  * @param flt: filter with zone name.
703 nsec3_hash_matches_owner(struct nsec3_filter* flt,
717 		query_dname_compare(nm+(size_t)nm[0]+1, flt->zone) == 0) {
727  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
736 find_matching_nsec3(struct module_env* env, struct nsec3_filter* flt,
747 	for(s=filter_first(flt, &i_rs, &i_rr); s;
748 		s=filter_next(flt, &i_rs, &i_rr)) {
757 		else if(nsec3_hash_matches_owner(flt, hash, s)) {
820  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
829 find_covering_nsec3(struct module_env* env, struct nsec3_filter* flt,
840 	for(s=filter_first(flt, &i_rs, &i_rr); s;
841 		s=filter_next(flt, &i_rs, &i_rr)) {
850 		else if(nsec3_covers(flt->zone, hash, s, i_rr,
868  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
875 nsec3_find_closest_encloser(struct module_env* env, struct nsec3_filter* flt,
890 	while(dname_subdomain_c(nm, flt->zone)) {
891 		if(find_matching_nsec3(env, flt, ct, nm, nmlen,
928  * @param flt: the NSEC3 RR filter, contains zone name and RRs.
942 nsec3_prove_closest_encloser(struct module_env* env, struct nsec3_filter* flt,
951 	if(!nsec3_find_closest_encloser(env, flt, ct, qinfo, ce)) {
991 	if(!find_covering_nsec3(env, flt, ct, nc, nc_len,
1022 nsec3_do_prove_nameerror(struct module_env* env, struct nsec3_filter* flt,
1035 	sec = nsec3_prove_closest_encloser(env, flt, ct, qinfo, 1, &ce);
1050 	if(!wc || !find_covering_nsec3(env, flt, ct, wc, wclen,
1070 	struct nsec3_filter flt;
1075 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1076 	if(!flt.zone)
1078 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1081 		flt.zone, 0, 0);
1082 	return nsec3_do_prove_nameerror(env, &flt, &ct, qinfo);
1092 nsec3_do_prove_nodata(struct module_env* env, struct nsec3_filter* flt,
1102 	if(find_matching_nsec3(env, flt, ct, qinfo->qname, qinfo->qname_len,
1151 	sec = nsec3_prove_closest_encloser(env, flt, ct, qinfo, 1, &ce);
1167 	if(wc && find_matching_nsec3(env, flt, ct, wc, wclen, &rrset, &rr)) {
1229 	struct nsec3_filter flt;
1234 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1235 	if(!flt.zone)
1237 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1239 	return nsec3_do_prove_nodata(env, &flt, &ct, qinfo);
1248 	struct nsec3_filter flt;
1258 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1259 	if(!flt.zone)
1261 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1275 	if(!find_covering_nsec3(env, &flt, &ct, nc, nc_len,
1323 	struct nsec3_filter flt;
1336 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1337 	if(!flt.zone) {
1341 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1346 	if(find_matching_nsec3(env, &flt, &ct, qinfo->qname, qinfo->qname_len,
1372 	if(nsec3_prove_closest_encloser(env, &flt, &ct, qinfo, 1, &ce)
1412 	struct nsec3_filter flt;
1418 	filter_init(&flt, list, num, qinfo); /* init RR iterator */
1419 	if(!flt.zone)
1421 	if(nsec3_iteration_count_high(ve, &flt, kkey))
1427 	secnx = nsec3_do_prove_nameerror(env, &flt, &ct, qinfo);
1430 	sec = nsec3_do_prove_nodata(env, &flt, &ct, qinfo);