55 edge_create(struct addrnode *node, const addrkey_t *addr,   in edge_create()
68 	edge->str = (addrkey_t *)calloc(n, sizeof (addrkey_t));  in edge_create()
73 	memcpy(edge->str, addr, n * sizeof (addrkey_t));  in edge_create()
304 getbit(const addrkey_t *addr, addrlen_t addrlen, addrlen_t n)  in getbit()
316 cmpbit(const addrkey_t *key1, const addrkey_t *key2, addrlen_t n)  in cmpbit()
318 	addrkey_t c = key1[n/KEYWIDTH] ^ key2[n/KEYWIDTH];  in cmpbit()
332 bits_common(const addrkey_t *s1, addrlen_t l1,   in bits_common()
333 	const addrkey_t *s2, addrlen_t l2, addrlen_t skip)  in bits_common()
354 issub(const addrkey_t *s1, addrlen_t l1,   in issub()
355 	const addrkey_t *s2, addrlen_t l2,  addrlen_t skip)  in issub()
361 addrtree_insert(struct addrtree *tree, const addrkey_t *addr,   in addrtree_insert()
478 addrtree_find(struct addrtree *tree, const addrkey_t *addr,   in addrtree_find()
522 int unittest_wrapper_addrtree_cmpbit(const addrkey_t *key1,   in unittest_wrapper_addrtree_cmpbit()
523 	const addrkey_t *key2, addrlen_t n) {  in unittest_wrapper_addrtree_cmpbit()
526 addrlen_t unittest_wrapper_addrtree_bits_common(const addrkey_t *s1,   in unittest_wrapper_addrtree_bits_common()
527 	addrlen_t l1, const addrkey_t *s2, addrlen_t l2, addrlen_t skip) {  in unittest_wrapper_addrtree_bits_common()
530 int unittest_wrapper_addrtree_getbit(const addrkey_t *addr,   in unittest_wrapper_addrtree_getbit()
534 int unittest_wrapper_addrtree_issub(const addrkey_t *s1, addrlen_t l1,   in unittest_wrapper_addrtree_issub()
535 	const addrkey_t *s2, addrlen_t l2,  addrlen_t skip) {  in unittest_wrapper_addrtree_issub()