addrtree
addrtree_traverse(struct addrtree* tree, int is_ipv6, time_t now,
node_size(const struct addrtree *tree, const struct addrnode *n)
struct addrtree *
struct addrtree *tree;
tree = (struct addrtree *)calloc(1, sizeof(*tree));
clean_node(struct addrtree *tree, struct addrnode *node)
lru_pop(struct addrtree *tree, struct addrnode *node)
lru_push(struct addrtree *tree, struct addrnode *node)
lru_update(struct addrtree *tree, struct addrnode *node)
purge_node(struct addrtree *tree, struct addrnode *node)
lru_cleanup(struct addrtree *tree)
addrtree_size(const struct addrtree *tree)
void addrtree_delete(struct addrtree *tree)
addrtree_insert(struct addrtree *tree, const addrkey_t *addr,
addrtree_find(struct addrtree *tree, const addrkey_t *addr,
node_create(struct addrtree *tree, void *elem, addrlen_t scope,
size_t addrtree_size(const struct addrtree *tree);
struct addrtree *
void addrtree_delete(struct addrtree *tree);
void addrtree_insert(struct addrtree *tree, const addrkey_t *addr,
struct addrnode * addrtree_find(struct addrtree *tree,
static struct addrtree*
struct addrtree *tree;
struct addrtree *tree;
struct addrtree *tree;
struct addrtree* tree4;
struct addrtree* tree6;
static int addrtree_inconsistent(struct addrtree* tree)
struct addrtree* t;
static int addrtree_inconsistent_subtree(struct addrtree* tree,