90 node_create(struct addrtree *tree, void *elem, addrlen_t scope,   in node_create()  argument
96 	node->elem = elem;  in node_create()
118 		(n->elem?tree->sizefunc(n->elem):0);  in node_size()
156 	if (!node->elem) return;  in clean_node()
157 	tree->size_bytes -= tree->sizefunc(node->elem);  in clean_node()
158 	tree->delfunc(tree->env, node->elem);  in clean_node()
160 	node->elem = NULL;  in clean_node()
265 		if (!p->elem && children == 1 && p->parent_edge) {  in lru_cleanup()
362 	addrlen_t sourcemask, addrlen_t scope, void *elem, time_t ttl,   in addrtree_insert()  argument
387 			node->elem = elem;  in addrtree_insert()
389 			tree->size_bytes += tree->sizefunc(elem);  in addrtree_insert()
397 			if (!edge->node->elem || edge->node->ttl >= now)  in addrtree_insert()
404 			newnode = node_create(tree, elem, scope, ttl);  in addrtree_insert()
450 			newnode->elem = elem;  in addrtree_insert()
461 			newnode = node_create(tree, elem, scope, ttl);  in addrtree_insert()
490 		if (node->elem && node->ttl >= now &&  in addrtree_find()