addrlen_t
size_t, int, addrlen_t, int, time_t, void*), void* arg);
addrkey_t* addr, size_t addr_size, int is_ipv6, addrlen_t scope,
size_t, int, addrlen_t, int, time_t, void*), void* arg)
addrlen_t addrlen;
size_t, int, addrlen_t, int, time_t, void*), void* arg)
size_t, int, addrlen_t, int, time_t, void*), void* arg)
addrtree_create(addrlen_t max_depth, void (*delfunc)(void *, void *),
getbit(const addrkey_t *addr, addrlen_t addrlen, addrlen_t n)
cmpbit(const addrkey_t *key1, const addrkey_t *key2, addrlen_t n)
static addrlen_t
bits_common(const addrkey_t *s1, addrlen_t l1,
const addrkey_t *s2, addrlen_t l2, addrlen_t skip)
addrlen_t len, i;
issub(const addrkey_t *s1, addrlen_t l1,
const addrkey_t *s2, addrlen_t l2, addrlen_t skip)
addrlen_t sourcemask, addrlen_t scope, void *elem, time_t ttl,
addrlen_t common, depth;
addrlen_t sourcemask, time_t now)
addrlen_t depth = 0;
const addrkey_t *key2, addrlen_t n) {
addrlen_t unittest_wrapper_addrtree_bits_common(const addrkey_t *s1,
addrlen_t l1, const addrkey_t *s2, addrlen_t l2, addrlen_t skip) {
addrlen_t addrlen, addrlen_t n) {
int unittest_wrapper_addrtree_issub(const addrkey_t *s1, addrlen_t l1,
const addrkey_t *s2, addrlen_t l2, addrlen_t skip) {
addrlen_t addrlen, struct addrnode *parent_node, int parent_index)
node_create(struct addrtree *tree, void *elem, addrlen_t scope,
addrlen_t len;
addrtree_create(addrlen_t max_depth, void (*delfunc)(void *, void *),
addrlen_t sourcemask, addrlen_t scope, void *elem, time_t ttl,
const addrkey_t *addr, addrlen_t sourcemask, time_t now);
const addrkey_t *key2, addrlen_t n);
addrlen_t unittest_wrapper_addrtree_bits_common(const addrkey_t *s1,
addrlen_t l1, const addrkey_t *s2, addrlen_t l2, addrlen_t skip);
addrlen_t addrlen, addrlen_t n);
int unittest_wrapper_addrtree_issub(const addrkey_t *s1, addrlen_t l1,
const addrkey_t *s2, addrlen_t l2, addrlen_t skip);
addrlen_t max_depth;
addrlen_t scope;
static addrlen_t randomkey(addrkey_t **k, int maxlen)
return (addrlen_t)bits;
addrlen_t l;
unit_assert( unittest_wrapper_addrtree_getbit(k1, 20, (addrlen_t)i) == (i&1) );
addrlen_t i;
addrlen_t i;
struct addredge* parent_edge, addrlen_t depth)