Home
last modified time | relevance | path

Searched refs:usable_list (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/unbound/iterator/
H A Diter_delegpt.c244 a->next_usable = dp->usable_list; in delegpt_add_addr()
245 dp->usable_list = a; in delegpt_add_addr()
276 for(a = dp->usable_list; a; a = a->next_usable) { in delegpt_count_addr()
341 struct delegpt_addr* usa = dp->usable_list, *prev = NULL; in delegpt_usable_list_remove_addr()
347 else dp->usable_list = usa->next_usable; in delegpt_usable_list_remove_addr()
368 struct delegpt_addr* usa = dp->usable_list; in delegpt_add_unused_targets()
369 dp->usable_list = NULL; in delegpt_add_unused_targets()
732 a->next_usable = dp->usable_list; in delegpt_add_addr_mlc()
733 dp->usable_list = a; in delegpt_add_addr_mlc()
H A Diter_delegpt.h71 struct delegpt_addr* usable_list; member
H A Diter_utils.c886 for(a = dp->usable_list; a; a = a->next_usable) { in iter_dp_is_useless()
1462 a = dp->usable_list; in iter_merge_retry_counts()
1470 else dp->usable_list = a->next_usable; in iter_merge_retry_counts()
H A Diterator.c2187 if(iq->dp->usable_list) { in processLastResort()
2240 if(iq->dp->usable_list) { in processLastResort()