Home
last modified time | relevance | path

Searched refs:addrkey_t (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/unbound/edns-subnet/
H A Daddrtree.h62 typedef uint8_t addrkey_t; typedef
114 addrkey_t *str;
167 void addrtree_insert(struct addrtree *tree, const addrkey_t *addr,
181 const addrkey_t *addr, addrlen_t sourcemask, time_t now);
184 int unittest_wrapper_addrtree_cmpbit(const addrkey_t *key1,
185 const addrkey_t *key2, addrlen_t n);
186 addrlen_t unittest_wrapper_addrtree_bits_common(const addrkey_t *s1,
187 addrlen_t l1, const addrkey_t *s2, addrlen_t l2, addrlen_t skip);
188 int unittest_wrapper_addrtree_getbit(const addrkey_t *addr,
190 int unittest_wrapper_addrtree_issub(const addrkey_t *s1, addrlen_t l1,
[all …]
H A Daddrtree.c55 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()
[all …]
H A Dsubnetmod.c496 addrtree_insert(tree, (addrkey_t*)edns->subnet_addr, in update_cache()
561 node = addrtree_find(tree, (addrkey_t*)ecs->subnet_addr, in lookup_and_reply()
/freebsd/contrib/unbound/daemon/
H A Dremote.c1879 static void addrtree_traverse_visit_node(struct addrnode* n, addrkey_t* addr,
1881 void (*func)(struct query_info*, struct reply_info*, addrkey_t*,
1887 addrkey_t* addr, size_t addr_size, int is_ipv6, addrlen_t scope, in cache_lookup_subnet_addrnode()
1957 addrtree_traverse_visit_edge(struct addredge* edge, addrkey_t* addr, in addrtree_traverse_visit_edge() argument
1959 void (*func)(struct query_info*, struct reply_info*, addrkey_t*, in addrtree_traverse_visit_edge()
1979 addrtree_traverse_visit_node(struct addrnode* n, addrkey_t* addr, in addrtree_traverse_visit_node() argument
1981 void (*func)(struct query_info*, struct reply_info*, addrkey_t*, in addrtree_traverse_visit_node()
2000 void (*func)(struct query_info*, struct reply_info*, addrkey_t*, in addrtree_traverse() argument
2005 addrtree_traverse_visit_node(tree->root, (addrkey_t*)addr, in addrtree_traverse()