Home
last modified time | relevance | path

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

/src/contrib/unbound/iterator/
H A Diter_delegpt.c229 a->next_usable = dp->usable_list; in delegpt_add_addr()
230 dp->usable_list = a; in delegpt_add_addr()
274 for(a = dp->usable_list; a; a = a->next_usable) { in delegpt_count_addr()
339 struct delegpt_addr* usa = dp->usable_list, *prev = NULL; in delegpt_usable_list_remove_addr()
345 else dp->usable_list = usa->next_usable; in delegpt_usable_list_remove_addr()
366 struct delegpt_addr* usa = dp->usable_list; in delegpt_add_unused_targets()
367 dp->usable_list = NULL; in delegpt_add_unused_targets()
710 a->next_usable = dp->usable_list; in delegpt_add_addr_mlc()
711 dp->usable_list = a; in delegpt_add_addr_mlc()
H A Diter_delegpt.h71 struct delegpt_addr* usable_list; member
H A Diter_utils.c849 for(a = dp->usable_list; a; a = a->next_usable) { in iter_dp_is_useless()
1424 a = dp->usable_list; in iter_merge_retry_counts()
1432 else dp->usable_list = a->next_usable; in iter_merge_retry_counts()
H A Diterator.c2160 if(iq->dp->usable_list) { in processLastResort()
2213 if(iq->dp->usable_list) { in processLastResort()
/src/contrib/unbound/pythonmod/
H A Dinterface.i1102 struct delegpt_addr* usable_list;