unbound  0.1
Data Fields
iter_hints Struct Reference

Iterator hints structure. More...

#include <iter_hints.h>

Data Fields

rbtree_t tree
 Hints are stored in this tree.

Detailed Description

Iterator hints structure.

Field Documentation

rbtree_t iter_hints::tree

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.

Referenced by do_list_stubs(), hints_add_stub(), hints_apply_cfg(), hints_delete_stub(), hints_get_mem(), hints_insert(), hints_lookup_root(), hints_lookup_stub(), and hints_next_root().


The documentation for this struct was generated from the following file: