sbin/unwind/libunbound/daemon/acl_list.h

94

struct addr_tree_node node;

sbin/unwind/libunbound/iterator/iter_donotq.c

80

struct addr_tree_node* node = (struct addr_tree_node*)regional_alloc(

sbin/unwind/libunbound/iterator/iter_priv.c

82

struct addr_tree_node* n;

sbin/unwind/libunbound/iterator/iter_priv.c

94

n = (struct addr_tree_node*)regional_alloc(priv->region,

sbin/unwind/libunbound/respip/respip.h

36

struct addr_tree_node node;

sbin/unwind/libunbound/services/cache/infra.h

215

struct addr_tree_node node;

sbin/unwind/libunbound/services/localzone.c

771

(struct addr_tree_node*)n, &addr, addrlen, net)) {

sbin/unwind/libunbound/services/localzone.h

203

struct addr_tree_node node;

sbin/unwind/libunbound/services/rpz.c

1631

log_rpz_apply(char* trigger, uint8_t* dname, struct addr_tree_node* addrnode,

sbin/unwind/libunbound/services/rpz.h

96

struct addr_tree_node node;

sbin/unwind/libunbound/util/edns.h

72

struct addr_tree_node node;

sbin/unwind/libunbound/util/storage/dnstree.c

109

int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node,

sbin/unwind/libunbound/util/storage/dnstree.c

120

void addr_tree_init_parents_node(struct addr_tree_node* node)

sbin/unwind/libunbound/util/storage/dnstree.c

122

struct addr_tree_node* prev = NULL, *p;

sbin/unwind/libunbound/util/storage/dnstree.c

125

node = (struct addr_tree_node*)rbtree_next((rbnode_type*)node)) {

sbin/unwind/libunbound/util/storage/dnstree.c

150

(struct addr_tree_node*)rbtree_first(tree));

sbin/unwind/libunbound/util/storage/dnstree.c

223

struct addr_tree_node* addr_tree_lookup(rbtree_type* tree,

sbin/unwind/libunbound/util/storage/dnstree.c

227

struct addr_tree_node* result;

sbin/unwind/libunbound/util/storage/dnstree.c

228

struct addr_tree_node key;

sbin/unwind/libunbound/util/storage/dnstree.c

235

return (struct addr_tree_node*)res;

sbin/unwind/libunbound/util/storage/dnstree.c

239

result = (struct addr_tree_node*)res;

sbin/unwind/libunbound/util/storage/dnstree.c

254

struct addr_tree_node* addr_tree_find(rbtree_type* tree,

sbin/unwind/libunbound/util/storage/dnstree.c

258

struct addr_tree_node key;

sbin/unwind/libunbound/util/storage/dnstree.c

264

return (struct addr_tree_node*)res;

sbin/unwind/libunbound/util/storage/dnstree.c

62

struct addr_tree_node* n1 = (struct addr_tree_node*)k1;

sbin/unwind/libunbound/util/storage/dnstree.c

63

struct addr_tree_node* n2 = (struct addr_tree_node*)k2;

sbin/unwind/libunbound/util/storage/dnstree.c

76

struct addr_tree_node* n1 = (struct addr_tree_node*)k1;

sbin/unwind/libunbound/util/storage/dnstree.c

77

struct addr_tree_node* n2 = (struct addr_tree_node*)k2;

sbin/unwind/libunbound/util/storage/dnstree.h

173

int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node,

sbin/unwind/libunbound/util/storage/dnstree.h

188

void addr_tree_init_parents_node(struct addr_tree_node* node);

sbin/unwind/libunbound/util/storage/dnstree.h

197

struct addr_tree_node* addr_tree_lookup(rbtree_type* tree,

sbin/unwind/libunbound/util/storage/dnstree.h

208

struct addr_tree_node* addr_tree_find(rbtree_type* tree,

sbin/unwind/libunbound/util/storage/dnstree.h

81

struct addr_tree_node* parent;

sbin/unwind/libunbound/util/tcp_conn_limit.h

69

struct addr_tree_node node;

usr.sbin/unbound/daemon/acl_list.h

94

struct addr_tree_node node;

usr.sbin/unbound/edns-subnet/subnet-whitelist.c

86

struct addr_tree_node* node = (struct addr_tree_node*)regional_alloc(

usr.sbin/unbound/iterator/iter_donotq.c

80

struct addr_tree_node* node = (struct addr_tree_node*)regional_alloc(

usr.sbin/unbound/iterator/iter_priv.c

82

struct addr_tree_node* n;

usr.sbin/unbound/iterator/iter_priv.c

94

n = (struct addr_tree_node*)regional_alloc(priv->region,

usr.sbin/unbound/respip/respip.h

36

struct addr_tree_node node;

usr.sbin/unbound/services/cache/infra.h

215

struct addr_tree_node node;

usr.sbin/unbound/services/localzone.c

771

(struct addr_tree_node*)n, &addr, addrlen, net)) {

usr.sbin/unbound/services/localzone.h

203

struct addr_tree_node node;

usr.sbin/unbound/services/rpz.c

1631

log_rpz_apply(char* trigger, uint8_t* dname, struct addr_tree_node* addrnode,

usr.sbin/unbound/services/rpz.h

96

struct addr_tree_node node;

usr.sbin/unbound/util/edns.h

72

struct addr_tree_node node;

usr.sbin/unbound/util/storage/dnstree.c

109

int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node,

usr.sbin/unbound/util/storage/dnstree.c

120

void addr_tree_init_parents_node(struct addr_tree_node* node)

usr.sbin/unbound/util/storage/dnstree.c

122

struct addr_tree_node* prev = NULL, *p;

usr.sbin/unbound/util/storage/dnstree.c

125

node = (struct addr_tree_node*)rbtree_next((rbnode_type*)node)) {

usr.sbin/unbound/util/storage/dnstree.c

150

(struct addr_tree_node*)rbtree_first(tree));

usr.sbin/unbound/util/storage/dnstree.c

223

struct addr_tree_node* addr_tree_lookup(rbtree_type* tree,

usr.sbin/unbound/util/storage/dnstree.c

227

struct addr_tree_node* result;

usr.sbin/unbound/util/storage/dnstree.c

228

struct addr_tree_node key;

usr.sbin/unbound/util/storage/dnstree.c

235

return (struct addr_tree_node*)res;

usr.sbin/unbound/util/storage/dnstree.c

239

result = (struct addr_tree_node*)res;

usr.sbin/unbound/util/storage/dnstree.c

254

struct addr_tree_node* addr_tree_find(rbtree_type* tree,

usr.sbin/unbound/util/storage/dnstree.c

258

struct addr_tree_node key;

usr.sbin/unbound/util/storage/dnstree.c

264

return (struct addr_tree_node*)res;

usr.sbin/unbound/util/storage/dnstree.c

62

struct addr_tree_node* n1 = (struct addr_tree_node*)k1;

usr.sbin/unbound/util/storage/dnstree.c

63

struct addr_tree_node* n2 = (struct addr_tree_node*)k2;

usr.sbin/unbound/util/storage/dnstree.c

76

struct addr_tree_node* n1 = (struct addr_tree_node*)k1;

usr.sbin/unbound/util/storage/dnstree.c

77

struct addr_tree_node* n2 = (struct addr_tree_node*)k2;

usr.sbin/unbound/util/storage/dnstree.h

173

int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node,

usr.sbin/unbound/util/storage/dnstree.h

188

void addr_tree_init_parents_node(struct addr_tree_node* node);

usr.sbin/unbound/util/storage/dnstree.h

197

struct addr_tree_node* addr_tree_lookup(rbtree_type* tree,

usr.sbin/unbound/util/storage/dnstree.h

208

struct addr_tree_node* addr_tree_find(rbtree_type* tree,

usr.sbin/unbound/util/storage/dnstree.h

81

struct addr_tree_node* parent;

usr.sbin/unbound/util/tcp_conn_limit.h

69

struct addr_tree_node node;