Iterator hints structure. More...
|Hints are stored in this tree. More...|
Iterator hints structure.
Hints are stored in this tree.
Sort order is specially chosen. first sorted on qclass. Then on dname in nsec-like order, so that a lookup on class, name will return an exact match or the closest match which gives the ancestor needed. contents of type iter_hints_stub. The class IN root is in here. uses name_tree_node from dnstree.h.