43 #ifndef UTIL_STORAGE_DNSTREE_H 44 #define UTIL_STORAGE_DNSTREE_H int name_tree_next_root(rbtree_type *tree, uint16_t *dclass)
struct sockaddr_storage addr
int name_tree_compare(const void *k1, const void *k2)
int addr_tree_insert(rbtree_type *tree, struct addr_tree_node *node, struct sockaddr_storage *addr, socklen_t addrlen, int net)
struct name_tree_node * parent
struct name_tree_node * name_tree_find(rbtree_type *tree, uint8_t *name, size_t len, int labs, uint16_t dclass)
int name_tree_insert(rbtree_type *tree, struct name_tree_node *node, uint8_t *name, size_t len, int labs, uint16_t dclass)
void name_tree_init(rbtree_type *tree)
struct name_tree_node * name_tree_lookup(rbtree_type *tree, uint8_t *name, size_t len, int labs, uint16_t dclass)
void name_tree_init_parents(rbtree_type *tree)
struct addr_tree_node * parent
struct addr_tree_node * addr_tree_find(rbtree_type *tree, struct sockaddr_storage *addr, socklen_t addrlen, int net)
void addr_tree_init_parents(rbtree_type *tree)
void addr_tree_init(rbtree_type *tree)
struct addr_tree_node * addr_tree_lookup(rbtree_type *tree, struct sockaddr_storage *addr, socklen_t addrlen)
int addr_tree_compare(const void *k1, const void *k2)