Iterator forward zones structure. More...
#include <iter_fwd.h>
Data Fields | |
| lock_rw_type | lock |
| lock on the forwards tree. | |
| rbtree_type * | tree |
| Zones are stored in this tree. | |
Iterator forward zones structure.
| lock_rw_type iter_forwards::lock |
lock on the forwards tree.
When grabbing both this lock and the anchors.lock, this lock is grabbed first. When grabbing both this lock and the hints.lock this lock is grabbed first.
Referenced by can_have_last_resort(), do_forward_add(), do_forward_remove(), do_list_forwards(), do_stub_add(), do_stub_remove(), forward_request(), forwards_add_stub_hole(), forwards_add_zone(), forwards_apply_cfg(), forwards_create(), forwards_delete(), forwards_delete_stub_hole(), forwards_delete_zone(), forwards_find(), forwards_get_mem(), forwards_lookup(), forwards_next_root(), iter_get_next_root(), iter_stub_fwd_no_cache(), print_root_fwds(), and processInitRequest().
| rbtree_type* iter_forwards::tree |
Zones 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_forward_zone.
Referenced by do_list_forwards(), forwards_add_zone(), forwards_apply_cfg(), forwards_delete_stub_hole(), forwards_delete_zone(), forwards_find(), forwards_get_mem(), forwards_insert_data(), forwards_lookup(), and fwd_init_parents().