765 	int* calculations)  in find_matching_nsec3()  argument
778 		if(*calculations >= MAX_NSEC3_CALCULATIONS) {  in find_matching_nsec3()
779 			if(calc_errors == *calculations) {  in find_matching_nsec3()
780 				*calculations = MAX_NSEC3_ERRORS;  in find_matching_nsec3()
793 			(*calculations)++;  in find_matching_nsec3()
796 			if(r == 1) (*calculations)++;  in find_matching_nsec3()
875 	int* calculations)  in find_covering_nsec3()  argument
888 		if(*calculations >= MAX_NSEC3_CALCULATIONS) {  in find_covering_nsec3()
889 			if(calc_errors == *calculations) {  in find_covering_nsec3()
890 				*calculations = MAX_NSEC3_ERRORS;  in find_covering_nsec3()
903 			(*calculations)++;  in find_covering_nsec3()
906 			if(r == 1) (*calculations)++;  in find_covering_nsec3()
936 	struct ce_response* ce, int* calculations)  in nsec3_find_closest_encloser()  argument
951 		if(*calculations >= MAX_NSEC3_CALCULATIONS ||  in nsec3_find_closest_encloser()
952 			*calculations == MAX_NSEC3_ERRORS) {  in nsec3_find_closest_encloser()
956 			&ce->ce_rrset, &ce->ce_rr, calculations)) {  in nsec3_find_closest_encloser()
1010 	int prove_does_not_exist, struct ce_response* ce, int* calculations)  in nsec3_prove_closest_encloser()  argument
1017 	if(!nsec3_find_closest_encloser(env, flt, ct, qinfo, ce, calculations)) {  in nsec3_prove_closest_encloser()
1018 		if(*calculations == MAX_NSEC3_ERRORS) {  in nsec3_prove_closest_encloser()
1024 		} else if(*calculations >= MAX_NSEC3_CALCULATIONS) {  in nsec3_prove_closest_encloser()
1072 		&ce->nc_rrset, &ce->nc_rr, calculations)) {  in nsec3_prove_closest_encloser()
1073 		if(*calculations == MAX_NSEC3_ERRORS) {  in nsec3_prove_closest_encloser()
1079 		} else if(*calculations >= MAX_NSEC3_CALCULATIONS) {  in nsec3_prove_closest_encloser()