return tree;
}
-size_t tree_size(const struct addrnode* node)
+/**
+ * Recursively calculate size of tree from this node on downwards.
+ * */
+static size_t tree_size(const struct addrnode* node)
{
int i;
size_t s = 0;
struct addrnode* node;
};
+/**
+ * Size of tree in bytes
+ */
+size_t addrtree_size(const struct addrtree* tree);
+
/**
* Create a new tree
* @param max_depth: Tree will cap keys to this length.
sn_env->subnet_msg_cache = slabhash_create(env->cfg->msg_cache_slabs,
HASH_DEFAULT_STARTARRAY, env->cfg->msg_cache_size,
msg_cache_sizefunc, query_info_compare,
- //~ msgreply_sizefunc, query_info_compare,
query_entry_delete, subnet_data_delete, NULL);
if(!sn_env->subnet_msg_cache) {
log_err("subnet: could not create cache");
/*
- * testcode/unitvandergaast.c - unit test for msg parse routines.
+ * testcode/unitvandergaast.c - unit test for vandergaast routines.
*
* Copyright (c) 2013, NLnet Labs. All rights reserved.
*
#include "util/storage/lruhash.h"
#include "util/data/msgreply.h"
#include "util/data/msgparse.h"
-#include <sys/socket.h>
struct alloc_cache;
struct rrset_cache;
struct key_cache;