addrnode
log_rpz_apply(char* trigger, uint8_t* dname, struct addr_tree_node* addrnode,
} else if(addrnode) {
addr_to_str(&addrnode->addr, addrnode->addrlen, addrbuf, sizeof(addrbuf));
snprintf(dnamestr, sizeof(dnamestr), "%s/%d", addrbuf, addrnode->net);
static void addrtree_traverse_visit_node(struct addrnode* n, addrkey_t* addr,
addrtree_traverse_visit_node(struct addrnode* n, addrkey_t* addr,
node_size(const struct addrtree *tree, const struct addrnode *n)
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)
struct addrnode *n, *p;
struct addrnode *n;
tree->size_bytes -= sizeof(struct addrnode);
struct addrnode *newnode, *node;
struct addrnode *
struct addrnode *node = tree->root;
edge_create(struct addrnode *node, const addrkey_t *addr,
addrlen_t addrlen, struct addrnode *parent_node, int parent_index)
static struct addrnode *
struct addrnode* node = (struct addrnode *)malloc( sizeof (*node) );
struct addrnode *prev;
struct addrnode *next;
struct addrnode *node;
struct addrnode *parent_node;
struct addrnode * addrtree_find(struct addrtree *tree,
struct addrnode *root;
struct addrnode* first;
struct addrnode *last;
struct addrnode *node;
log_rpz_apply(char* trigger, uint8_t* dname, struct addr_tree_node* addrnode,
} else if(addrnode) {
addr_to_str(&addrnode->addr, addrnode->addrlen, addrbuf, sizeof(addrbuf));
snprintf(dnamestr, sizeof(dnamestr), "%s/%d", addrbuf, addrnode->net);
struct addrnode* node = parent_edge->node;