mirror of
https://github.com/NLnetLabs/unbound.git
synced 2025-12-20 23:00:56 -05:00
- Fix #670: SERVFAIL problems with unbound 1.15.0 running on
OpenBSD 7.1.
This commit is contained in:
parent
1289c53c1a
commit
b61b0af5d6
2 changed files with 21 additions and 14 deletions
|
|
@ -1,3 +1,7 @@
|
||||||
|
28 April 2022: Wouter
|
||||||
|
- Fix #670: SERVFAIL problems with unbound 1.15.0 running on
|
||||||
|
OpenBSD 7.1.
|
||||||
|
|
||||||
8 April 2022: Wouter
|
8 April 2022: Wouter
|
||||||
- Fix zonemd check to allow unsupported algorithms to load.
|
- Fix zonemd check to allow unsupported algorithms to load.
|
||||||
If there are only unsupported algorithms, or unsupported schemes,
|
If there are only unsupported algorithms, or unsupported schemes,
|
||||||
|
|
|
||||||
|
|
@ -1831,6 +1831,23 @@ query_for_targets(struct module_qstate* qstate, struct iter_qstate* iq,
|
||||||
int missing;
|
int missing;
|
||||||
int toget = 0;
|
int toget = 0;
|
||||||
|
|
||||||
|
iter_mark_cycle_targets(qstate, iq->dp);
|
||||||
|
missing = (int)delegpt_count_missing_targets(iq->dp);
|
||||||
|
log_assert(maxtargets != 0); /* that would not be useful */
|
||||||
|
|
||||||
|
/* Generate target requests. Basically, any missing targets
|
||||||
|
* are queried for here, regardless if it is necessary to do
|
||||||
|
* so to continue processing. */
|
||||||
|
if(maxtargets < 0 || maxtargets > missing)
|
||||||
|
toget = missing;
|
||||||
|
else toget = maxtargets;
|
||||||
|
if(toget == 0) {
|
||||||
|
*num = 0;
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* now that we are sure that a target query is going to be made,
|
||||||
|
* check the limits. */
|
||||||
if(iq->depth == ie->max_dependency_depth)
|
if(iq->depth == ie->max_dependency_depth)
|
||||||
return 0;
|
return 0;
|
||||||
if(iq->depth > 0 && iq->target_count &&
|
if(iq->depth > 0 && iq->target_count &&
|
||||||
|
|
@ -1850,20 +1867,6 @@ query_for_targets(struct module_qstate* qstate, struct iter_qstate* iq,
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
iter_mark_cycle_targets(qstate, iq->dp);
|
|
||||||
missing = (int)delegpt_count_missing_targets(iq->dp);
|
|
||||||
log_assert(maxtargets != 0); /* that would not be useful */
|
|
||||||
|
|
||||||
/* Generate target requests. Basically, any missing targets
|
|
||||||
* are queried for here, regardless if it is necessary to do
|
|
||||||
* so to continue processing. */
|
|
||||||
if(maxtargets < 0 || maxtargets > missing)
|
|
||||||
toget = missing;
|
|
||||||
else toget = maxtargets;
|
|
||||||
if(toget == 0) {
|
|
||||||
*num = 0;
|
|
||||||
return 1;
|
|
||||||
}
|
|
||||||
/* select 'toget' items from the total of 'missing' items */
|
/* select 'toget' items from the total of 'missing' items */
|
||||||
log_assert(toget <= missing);
|
log_assert(toget <= missing);
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in a new issue