sbin/unwind/libunbound/daemon/acl_list.h
85
rbtree_type tree;
sbin/unwind/libunbound/dns64/dns64.c
131
rbtree_type ignore_aaaa;
sbin/unwind/libunbound/iterator/iter_donotq.h
61
rbtree_type tree;
sbin/unwind/libunbound/iterator/iter_fwd.c
641
rbtree_type* oldtree = fwd->tree;
sbin/unwind/libunbound/iterator/iter_fwd.h
66
rbtree_type* tree;
sbin/unwind/libunbound/iterator/iter_hints.h
67
rbtree_type tree;
sbin/unwind/libunbound/iterator/iter_priv.h
63
rbtree_type a;
sbin/unwind/libunbound/iterator/iter_priv.h
70
rbtree_type n;
sbin/unwind/libunbound/iterator/iter_utils.c
118
struct rbtree_type*
sbin/unwind/libunbound/iterator/iter_utils.c
121
struct rbtree_type* caps_white = rbtree_create(name_tree_compare);
sbin/unwind/libunbound/iterator/iter_utils.c
138
caps_white_delete(struct rbtree_type* caps_white)
sbin/unwind/libunbound/iterator/iter_utils.c
147
caps_white_apply_cfg(rbtree_type* ntree, struct config_file* cfg)
sbin/unwind/libunbound/iterator/iter_utils.h
448
struct rbtree_type* caps_white_create(void);
sbin/unwind/libunbound/iterator/iter_utils.h
454
void caps_white_delete(struct rbtree_type* caps_white);
sbin/unwind/libunbound/iterator/iter_utils.h
461
int caps_white_apply_cfg(struct rbtree_type* ntree, struct config_file* cfg);
sbin/unwind/libunbound/iterator/iterator.h
145
struct rbtree_type* caps_white;
sbin/unwind/libunbound/iterator/iterator.h
52
struct rbtree_type;
sbin/unwind/libunbound/libunbound/context.h
145
rbtree_type queries;
sbin/unwind/libunbound/respip/respip.c
138
addr_tree_init_parents((rbtree_type*)set);
sbin/unwind/libunbound/respip/respip.c
95
struct rbtree_type*
sbin/unwind/libunbound/respip/respip.h
227
struct rbtree_type* respip_set_get_tree(struct respip_set* set);
sbin/unwind/libunbound/respip/respip.h
25
struct rbtree_type ip_tree;
sbin/unwind/libunbound/services/authzone.h
115
rbtree_type data;
sbin/unwind/libunbound/services/authzone.h
77
rbtree_type ztree;
sbin/unwind/libunbound/services/authzone.h
79
rbtree_type xtree;
sbin/unwind/libunbound/services/cache/infra.c
1278
rbtree_type* tree;
sbin/unwind/libunbound/services/cache/infra.c
164
struct rbtree_type* domain_limits, char* name)
sbin/unwind/libunbound/services/cache/infra.c
211
static int infra_ratelimit_cfg_insert(struct rbtree_type* domain_limits,
sbin/unwind/libunbound/services/cache/infra.c
232
setup_domain_limits(struct rbtree_type* domain_limits, struct config_file* cfg)
sbin/unwind/libunbound/services/cache/infra.c
244
wait_limit_netblock_findcreate(struct rbtree_type* tree, char* str)
sbin/unwind/libunbound/services/cache/infra.c
278
infra_wait_limit_netblock_insert(rbtree_type* wait_limits_netblock,
sbin/unwind/libunbound/services/cache/infra.c
279
rbtree_type* wait_limits_cookie_netblock, struct config_file* cfg)
sbin/unwind/libunbound/services/cache/infra.c
302
wait_limit_netblock_default(struct rbtree_type* tree, char* str, int limit)
sbin/unwind/libunbound/services/cache/infra.c
313
setup_wait_limits(rbtree_type* wait_limits_netblock,
sbin/unwind/libunbound/services/cache/infra.c
314
rbtree_type* wait_limits_cookie_netblock, struct config_file* cfg)
sbin/unwind/libunbound/services/cache/infra.c
405
domain_limits_free(struct rbtree_type* domain_limits)
sbin/unwind/libunbound/services/cache/infra.c
419
wait_limits_free(struct rbtree_type* wait_limits_tree)
sbin/unwind/libunbound/services/cache/infra.h
135
rbtree_type domain_limits;
sbin/unwind/libunbound/services/cache/infra.h
139
rbtree_type wait_limits_netblock;
sbin/unwind/libunbound/services/cache/infra.h
141
rbtree_type wait_limits_cookie_netblock;
sbin/unwind/libunbound/services/cache/infra.h
519
int setup_wait_limits(struct rbtree_type* wait_limits_netblock,
sbin/unwind/libunbound/services/cache/infra.h
520
struct rbtree_type* wait_limits_cookie_netblock,
sbin/unwind/libunbound/services/cache/infra.h
524
void wait_limits_free(struct rbtree_type* wait_limits_tree);
sbin/unwind/libunbound/services/cache/infra.h
527
int setup_domain_limits(struct rbtree_type* domain_limits,
sbin/unwind/libunbound/services/cache/infra.h
531
void domain_limits_free(struct rbtree_type* domain_limits);
sbin/unwind/libunbound/services/listen_dnsport.h
491
struct rbtree_type* conn_tree;
sbin/unwind/libunbound/services/listen_dnsport.h
497
struct rbtree_type* conid_tree;
sbin/unwind/libunbound/services/listen_dnsport.h
510
struct rbtree_type* timer_tree;
sbin/unwind/libunbound/services/listen_dnsport.h
627
struct rbtree_type stream_tree;
sbin/unwind/libunbound/services/localzone.c
1790
struct comm_reply* repinfo, struct rbtree_type* override_tree,
sbin/unwind/libunbound/services/localzone.c
2251
rbtree_type oldtree = zones->ztree;
sbin/unwind/libunbound/services/localzone.c
750
z->override_tree = (struct rbtree_type*)regional_alloc_zero(
sbin/unwind/libunbound/services/localzone.h
119
rbtree_type ztree;
sbin/unwind/libunbound/services/localzone.h
155
struct rbtree_type* override_tree;
sbin/unwind/libunbound/services/localzone.h
162
rbtree_type data;
sbin/unwind/libunbound/services/mesh.h
196
rbtree_type super_set;
sbin/unwind/libunbound/services/mesh.h
199
rbtree_type sub_set;
sbin/unwind/libunbound/services/mesh.h
89
rbtree_type run;
sbin/unwind/libunbound/services/mesh.h
91
rbtree_type all;
sbin/unwind/libunbound/services/outside_network.c
1176
void reuse_del_readwait(rbtree_type* tree_by_id)
sbin/unwind/libunbound/services/outside_network.c
1222
static void reuse_cb_readwait_for_failure(rbtree_type* tree_by_id, int err)
sbin/unwind/libunbound/services/outside_network.c
1260
rbtree_type store;
sbin/unwind/libunbound/services/outside_network.h
135
rbtree_type* pending;
sbin/unwind/libunbound/services/outside_network.h
137
rbtree_type* serviced;
sbin/unwind/libunbound/services/outside_network.h
179
rbtree_type tcp_reuse;
sbin/unwind/libunbound/services/outside_network.h
298
rbtree_type tree_by_id;
sbin/unwind/libunbound/services/outside_network.h
719
void reuse_del_readwait(rbtree_type* tree_by_id);
sbin/unwind/libunbound/services/rpz.h
89
struct rbtree_type entries;
sbin/unwind/libunbound/services/view.h
61
rbtree_type vtree;
sbin/unwind/libunbound/util/edns.c
128
edns_string_addr_lookup(rbtree_type* tree, struct sockaddr_storage* addr,
sbin/unwind/libunbound/util/edns.c
145
rbtree_type tree = edns_strings->client_strings;
sbin/unwind/libunbound/util/edns.h
141
edns_string_addr_lookup(rbtree_type* tree, struct sockaddr_storage* addr,
sbin/unwind/libunbound/util/edns.h
59
rbtree_type client_strings;
sbin/unwind/libunbound/util/mini_event.h
105
rbtree_type* times;
sbin/unwind/libunbound/util/rbtree.c
108
rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node)
sbin/unwind/libunbound/util/rbtree.c
135
rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node)
sbin/unwind/libunbound/util/rbtree.c
158
rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node)
sbin/unwind/libunbound/util/rbtree.c
228
rbtree_insert (rbtree_type *rbtree, rbnode_type *data)
sbin/unwind/libunbound/util/rbtree.c
281
rbtree_search (rbtree_type *rbtree, const void *key)
sbin/unwind/libunbound/util/rbtree.c
305
static void change_parent_ptr(rbtree_type* rbtree, rbnode_type* parent,
sbin/unwind/libunbound/util/rbtree.c
329
rbtree_delete(rbtree_type *rbtree, const void *key)
sbin/unwind/libunbound/util/rbtree.c
406
static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,
sbin/unwind/libunbound/util/rbtree.c
511
rbtree_find_less_equal(rbtree_type *rbtree, const void *key,
sbin/unwind/libunbound/util/rbtree.c
549
rbtree_first (rbtree_type *rbtree)
sbin/unwind/libunbound/util/rbtree.c
558
rbtree_last (rbtree_type *rbtree)
sbin/unwind/libunbound/util/rbtree.c
62
static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);
sbin/unwind/libunbound/util/rbtree.c
622
traverse_postorder(rbtree_type* tree, void (*func)(rbnode_type*, void*),
sbin/unwind/libunbound/util/rbtree.c
64
static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);
sbin/unwind/libunbound/util/rbtree.c
66
static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);
sbin/unwind/libunbound/util/rbtree.c
68
static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,
sbin/unwind/libunbound/util/rbtree.c
77
rbtree_type *
sbin/unwind/libunbound/util/rbtree.c
80
rbtree_type *rbtree;
sbin/unwind/libunbound/util/rbtree.c
83
rbtree = (rbtree_type *) malloc(sizeof(rbtree_type));
sbin/unwind/libunbound/util/rbtree.c
95
rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *))
sbin/unwind/libunbound/util/rbtree.h
102
void rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *));
sbin/unwind/libunbound/util/rbtree.h
110
rbnode_type *rbtree_insert(rbtree_type *rbtree, rbnode_type *data);
sbin/unwind/libunbound/util/rbtree.h
119
rbnode_type *rbtree_delete(rbtree_type *rbtree, const void *key);
sbin/unwind/libunbound/util/rbtree.h
127
rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);
sbin/unwind/libunbound/util/rbtree.h
138
int rbtree_find_less_equal(rbtree_type *rbtree, const void *key,
sbin/unwind/libunbound/util/rbtree.h
146
rbnode_type *rbtree_first(rbtree_type *rbtree);
sbin/unwind/libunbound/util/rbtree.h
153
rbnode_type *rbtree_last(rbtree_type *rbtree);
sbin/unwind/libunbound/util/rbtree.h
189
void traverse_postorder(rbtree_type* tree, void (*func)(rbnode_type*, void*),
sbin/unwind/libunbound/util/rbtree.h
74
typedef struct rbtree_type rbtree_type;
sbin/unwind/libunbound/util/rbtree.h
95
rbtree_type *rbtree_create(int (*cmpf)(const void *, const void *));
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
147
void addr_tree_init_parents(rbtree_type* tree)
sbin/unwind/libunbound/util/storage/dnstree.c
153
void name_tree_init_parents(rbtree_type* tree)
sbin/unwind/libunbound/util/storage/dnstree.c
179
struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,
sbin/unwind/libunbound/util/storage/dnstree.c
191
struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,
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
254
struct addr_tree_node* addr_tree_find(rbtree_type* tree,
sbin/unwind/libunbound/util/storage/dnstree.c
268
name_tree_next_root(rbtree_type* tree, uint16_t* dclass)
sbin/unwind/libunbound/util/storage/dnstree.c
82
void name_tree_init(rbtree_type* tree)
sbin/unwind/libunbound/util/storage/dnstree.c
87
void addr_tree_init(rbtree_type* tree)
sbin/unwind/libunbound/util/storage/dnstree.c
92
void addr_tree_addrport_init(rbtree_type* tree)
sbin/unwind/libunbound/util/storage/dnstree.c
97
int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,
sbin/unwind/libunbound/util/storage/dnstree.h
108
int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,
sbin/unwind/libunbound/util/storage/dnstree.h
116
void name_tree_init_parents(rbtree_type* tree);
sbin/unwind/libunbound/util/storage/dnstree.h
127
struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,
sbin/unwind/libunbound/util/storage/dnstree.h
139
struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,
sbin/unwind/libunbound/util/storage/dnstree.h
148
int name_tree_next_root(rbtree_type* tree, uint16_t* dclass);
sbin/unwind/libunbound/util/storage/dnstree.h
154
void addr_tree_init(rbtree_type* tree);
sbin/unwind/libunbound/util/storage/dnstree.h
161
void addr_tree_addrport_init(rbtree_type* tree);
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
181
void addr_tree_init_parents(rbtree_type* tree);
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
94
void name_tree_init(rbtree_type* tree);
sbin/unwind/libunbound/util/tcp_conn_limit.c
199
rbtree_type oldtree = tcl->tree;
sbin/unwind/libunbound/util/tcp_conn_limit.h
60
rbtree_type tree;
sbin/unwind/libunbound/util/winsock_event.h
135
rbtree_type* times;
sbin/unwind/libunbound/validator/autotrust.h
130
rbtree_type probe;
sbin/unwind/libunbound/validator/val_anchor.c
1389
rbtree_type* oldtree;
sbin/unwind/libunbound/validator/val_anchor.c
1390
rbtree_type oldprobe;
sbin/unwind/libunbound/validator/val_anchor.h
69
rbtree_type* tree;
sbin/unwind/libunbound/validator/val_neg.h
123
rbtree_type tree;
sbin/unwind/libunbound/validator/val_neg.h
72
rbtree_type tree;
sbin/unwind/libunbound/validator/val_nsec3.c
552
ct->ct = (rbtree_type*)regional_alloc(region, sizeof(*ct->ct));
sbin/unwind/libunbound/validator/val_nsec3.c
656
nsec3_hash_name(rbtree_type* table, struct regional* region, sldns_buffer* buf,
sbin/unwind/libunbound/validator/val_nsec3.h
106
rbtree_type* ct;
sbin/unwind/libunbound/validator/val_nsec3.h
317
int nsec3_hash_name(rbtree_type* table, struct regional* region,
sbin/unwind/libunbound/validator/val_sigcrypt.c
1032
rbtree_type* sortree, struct canon_rr* rrs)
sbin/unwind/libunbound/validator/val_sigcrypt.c
1190
struct rbtree_type sortree1, sortree2;
sbin/unwind/libunbound/validator/val_sigcrypt.c
1269
struct rbtree_type** sortree, sldns_pkt_section section,
sbin/unwind/libunbound/validator/val_sigcrypt.c
1279
*sortree = (struct rbtree_type*)regional_alloc(region,
sbin/unwind/libunbound/validator/val_sigcrypt.c
1280
sizeof(rbtree_type));
sbin/unwind/libunbound/validator/val_sigcrypt.c
1340
struct rbtree_type* sortree = NULL;
sbin/unwind/libunbound/validator/val_sigcrypt.c
1347
sortree = (struct rbtree_type*)regional_alloc(region,
sbin/unwind/libunbound/validator/val_sigcrypt.c
1348
sizeof(rbtree_type));
sbin/unwind/libunbound/validator/val_sigcrypt.c
1541
struct rbtree_type** sortree, int* buf_canon,
sbin/unwind/libunbound/validator/val_sigcrypt.c
559
struct rbtree_type** sortree,
sbin/unwind/libunbound/validator/val_sigcrypt.c
632
rbtree_type* sortree = NULL;
sbin/unwind/libunbound/validator/val_sigcrypt.c
714
rbtree_type* sortree = NULL;
sbin/unwind/libunbound/validator/val_sigcrypt.h
324
struct rbtree_type** sortree, int* buf_canon,
sbin/unwind/libunbound/validator/val_sigcrypt.h
53
struct rbtree_type;
usr.sbin/nsd/mini_event.h
90
rbtree_type* times;
usr.sbin/nsd/namedb.c
161
zone_del_domain_in_hash_tree(rbtree_type* tree, rbnode_type* node)
usr.sbin/nsd/namedb.c
290
void hash_tree_delete(region_type* region, rbtree_type* tree)
usr.sbin/nsd/namedb.c
292
region_recycle(region, tree, sizeof(rbtree_type));
usr.sbin/nsd/namedb.c
296
void zone_add_domain_in_hash_tree(region_type* region, rbtree_type** tree,
usr.sbin/nsd/namedb.h
134
rbtree_type* nsec3tree; /* tree with relevant NSEC3 domains */
usr.sbin/nsd/namedb.h
135
rbtree_type* hashtree; /* tree, hashed NSEC3precompiled domains */
usr.sbin/nsd/namedb.h
136
rbtree_type* wchashtree; /* tree, wildcard hashed domains */
usr.sbin/nsd/namedb.h
137
rbtree_type* dshashtree; /* tree, ds-parent-hash domains */
usr.sbin/nsd/namedb.h
256
void zone_add_domain_in_hash_tree(region_type* region, rbtree_type** tree,
usr.sbin/nsd/namedb.h
259
void zone_del_domain_in_hash_tree(rbtree_type* tree, rbnode_type* node);
usr.sbin/nsd/namedb.h
260
void hash_tree_delete(region_type* region, rbtree_type* tree);
usr.sbin/nsd/namedb.h
43
rbtree_type *names_to_domains;
usr.sbin/nsd/nsec3.c
368
hash_tree_clear(rbtree_type* tree)
usr.sbin/nsd/nsec3.c
697
process_first(rbtree_type* tree, uint8_t* hash, rbnode_type** p,
usr.sbin/nsd/nsec3.c
731
process_end(rbtree_type* tree, uint8_t* hash, rbnode_type** p,
usr.sbin/nsd/options.h
53
rbtree_type* zone_options;
usr.sbin/nsd/options.h
55
rbtree_type* patterns;
usr.sbin/nsd/options.h
58
rbtree_type* zonefree;
usr.sbin/nsd/options.h
70
rbtree_type* zonestatnames;
usr.sbin/nsd/options.h
73
rbtree_type* keys;
usr.sbin/nsd/options.h
76
rbtree_type* tls_auths;
usr.sbin/nsd/rbtree.c
126
rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/nsd/rbtree.c
201
rbtree_insert (rbtree_type *rbtree, rbnode_type *data)
usr.sbin/nsd/rbtree.c
260
rbtree_search (rbtree_type *rbtree, const void *key)
usr.sbin/nsd/rbtree.c
28
static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);
usr.sbin/nsd/rbtree.c
287
static void change_parent_ptr(rbtree_type* rbtree, rbnode_type* parent, rbnode_type* old, rbnode_type* new)
usr.sbin/nsd/rbtree.c
29
static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);
usr.sbin/nsd/rbtree.c
30
static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);
usr.sbin/nsd/rbtree.c
31
static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child, rbnode_type* child_parent);
usr.sbin/nsd/rbtree.c
313
rbtree_delete(rbtree_type *rbtree, const void *key)
usr.sbin/nsd/rbtree.c
39
rbtree_type *
usr.sbin/nsd/rbtree.c
396
static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child, rbnode_type* child_parent)
usr.sbin/nsd/rbtree.c
42
rbtree_type *rbtree;
usr.sbin/nsd/rbtree.c
45
rbtree = (rbtree_type *) region_alloc(region, sizeof(rbtree_type));
usr.sbin/nsd/rbtree.c
505
rbtree_find_less_equal(rbtree_type *rbtree, const void *key, rbnode_type **result)
usr.sbin/nsd/rbtree.c
547
rbtree_first (rbtree_type *rbtree)
usr.sbin/nsd/rbtree.c
561
rbtree_last (rbtree_type *rbtree)
usr.sbin/nsd/rbtree.c
64
rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/nsd/rbtree.c
97
rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/nsd/rbtree.h
50
rbtree_type *rbtree_create(region_type *region, int (*cmpf)(const void *, const void *));
usr.sbin/nsd/rbtree.h
51
rbnode_type *rbtree_insert(rbtree_type *rbtree, rbnode_type *data);
usr.sbin/nsd/rbtree.h
54
rbnode_type *rbtree_delete(rbtree_type *rbtree, const void *key);
usr.sbin/nsd/rbtree.h
55
rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);
usr.sbin/nsd/rbtree.h
58
int rbtree_find_less_equal(rbtree_type *rbtree, const void *key, rbnode_type **result);
usr.sbin/nsd/rbtree.h
59
rbnode_type *rbtree_first(rbtree_type *rbtree);
usr.sbin/nsd/rbtree.h
60
rbnode_type *rbtree_last(rbtree_type *rbtree);
usr.sbin/nsd/tsig.c
85
static rbtree_type *tsig_key_table;
usr.sbin/nsd/xfrd-catalog-zones.h
25
rbtree_type member_ids;
usr.sbin/nsd/xfrd-catalog-zones.h
45
rbtree_type member_ids;
usr.sbin/nsd/xfrd-notify.c
541
xfrd_send_notify(rbtree_type* tree, const dname_type* apex, struct xfrd_soa* new_soa)
usr.sbin/nsd/xfrd-notify.c
554
notify_handle_master_zone_soainfo(rbtree_type* tree,
usr.sbin/nsd/xfrd-notify.c
572
close_notify_fds(rbtree_type* tree)
usr.sbin/nsd/xfrd-notify.c
93
init_notify_send(rbtree_type* tree, region_type* region,
usr.sbin/nsd/xfrd-notify.h
80
void init_notify_send(rbtree_type* tree, region_type* region,
usr.sbin/nsd/xfrd-notify.h
86
void xfrd_send_notify(rbtree_type* tree, const struct dname* apex,
usr.sbin/nsd/xfrd-notify.h
93
void notify_handle_master_zone_soainfo(rbtree_type* tree,
usr.sbin/nsd/xfrd-notify.h
97
void close_notify_fds(rbtree_type* tree);
usr.sbin/nsd/xfrd-tcp.h
175
rbtree_type* zone_per_id;
usr.sbin/nsd/xfrd-tcp.h
45
rbtree_type* pipetree;
usr.sbin/nsd/xfrd.h
115
rbtree_type *zones;
usr.sbin/nsd/xfrd.h
118
rbtree_type *notify_zones;
usr.sbin/nsd/xfrd.h
125
rbtree_type *catalog_consumer_zones;
usr.sbin/nsd/xfrd.h
128
rbtree_type *catalog_producer_zones;
usr.sbin/unbound/daemon/acl_list.c
823
rbtree_type oldtree = acl->tree;
usr.sbin/unbound/daemon/acl_list.h
85
rbtree_type tree;
usr.sbin/unbound/daemon/remote.c
4673
struct rbtree_type* caps_white;
usr.sbin/unbound/daemon/remote.c
4677
struct rbtree_type wait_limits_netblock;
usr.sbin/unbound/daemon/remote.c
4679
struct rbtree_type wait_limits_cookie_netblock;
usr.sbin/unbound/daemon/remote.c
4681
struct rbtree_type domain_limits;
usr.sbin/unbound/daemon/remote.c
5789
rbtree_type oldztree = az->ztree;
usr.sbin/unbound/daemon/remote.c
6236
struct rbtree_type* oldcapswhite = iter_env->caps_white;
usr.sbin/unbound/daemon/remote.c
6304
struct rbtree_type oldwaitlim = infra->wait_limits_netblock;
usr.sbin/unbound/daemon/remote.c
6305
struct rbtree_type oldwaitlimcookie =
usr.sbin/unbound/daemon/remote.c
6307
struct rbtree_type olddomainlim = infra->domain_limits;
usr.sbin/unbound/dns64/dns64.c
131
rbtree_type ignore_aaaa;
usr.sbin/unbound/edns-subnet/subnet-whitelist.h
61
rbtree_type upstream;
usr.sbin/unbound/edns-subnet/subnet-whitelist.h
66
rbtree_type dname;
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
131
ipsecmod_whitelist_delete(rbtree_type* whitelist)
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
149
ipsecmod_whitelist_get_mem(rbtree_type* whitelist)
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
57
whitelist_str_cfg(rbtree_type* whitelist, const char* name)
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
87
read_whitelist(rbtree_type* whitelist, struct config_file* cfg)
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.h
62
void ipsecmod_whitelist_delete(rbtree_type* whitelist);
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.h
80
size_t ipsecmod_whitelist_get_mem(rbtree_type* whitelist);
usr.sbin/unbound/ipsecmod/ipsecmod.h
55
rbtree_type* whitelist;
usr.sbin/unbound/iterator/iter_donotq.h
61
rbtree_type tree;
usr.sbin/unbound/iterator/iter_fwd.c
641
rbtree_type* oldtree = fwd->tree;
usr.sbin/unbound/iterator/iter_fwd.h
66
rbtree_type* tree;
usr.sbin/unbound/iterator/iter_hints.h
67
rbtree_type tree;
usr.sbin/unbound/iterator/iter_priv.h
63
rbtree_type a;
usr.sbin/unbound/iterator/iter_priv.h
70
rbtree_type n;
usr.sbin/unbound/iterator/iter_utils.c
118
struct rbtree_type*
usr.sbin/unbound/iterator/iter_utils.c
121
struct rbtree_type* caps_white = rbtree_create(name_tree_compare);
usr.sbin/unbound/iterator/iter_utils.c
138
caps_white_delete(struct rbtree_type* caps_white)
usr.sbin/unbound/iterator/iter_utils.c
147
caps_white_apply_cfg(rbtree_type* ntree, struct config_file* cfg)
usr.sbin/unbound/iterator/iter_utils.h
448
struct rbtree_type* caps_white_create(void);
usr.sbin/unbound/iterator/iter_utils.h
454
void caps_white_delete(struct rbtree_type* caps_white);
usr.sbin/unbound/iterator/iter_utils.h
461
int caps_white_apply_cfg(struct rbtree_type* ntree, struct config_file* cfg);
usr.sbin/unbound/iterator/iterator.h
145
struct rbtree_type* caps_white;
usr.sbin/unbound/iterator/iterator.h
52
struct rbtree_type;
usr.sbin/unbound/libunbound/context.h
145
rbtree_type queries;
usr.sbin/unbound/respip/respip.c
138
addr_tree_init_parents((rbtree_type*)set);
usr.sbin/unbound/respip/respip.c
95
struct rbtree_type*
usr.sbin/unbound/respip/respip.h
227
struct rbtree_type* respip_set_get_tree(struct respip_set* set);
usr.sbin/unbound/respip/respip.h
25
struct rbtree_type ip_tree;
usr.sbin/unbound/services/authzone.h
115
rbtree_type data;
usr.sbin/unbound/services/authzone.h
77
rbtree_type ztree;
usr.sbin/unbound/services/authzone.h
79
rbtree_type xtree;
usr.sbin/unbound/services/cache/infra.c
1278
rbtree_type* tree;
usr.sbin/unbound/services/cache/infra.c
164
struct rbtree_type* domain_limits, char* name)
usr.sbin/unbound/services/cache/infra.c
211
static int infra_ratelimit_cfg_insert(struct rbtree_type* domain_limits,
usr.sbin/unbound/services/cache/infra.c
232
setup_domain_limits(struct rbtree_type* domain_limits, struct config_file* cfg)
usr.sbin/unbound/services/cache/infra.c
244
wait_limit_netblock_findcreate(struct rbtree_type* tree, char* str)
usr.sbin/unbound/services/cache/infra.c
278
infra_wait_limit_netblock_insert(rbtree_type* wait_limits_netblock,
usr.sbin/unbound/services/cache/infra.c
279
rbtree_type* wait_limits_cookie_netblock, struct config_file* cfg)
usr.sbin/unbound/services/cache/infra.c
302
wait_limit_netblock_default(struct rbtree_type* tree, char* str, int limit)
usr.sbin/unbound/services/cache/infra.c
313
setup_wait_limits(rbtree_type* wait_limits_netblock,
usr.sbin/unbound/services/cache/infra.c
314
rbtree_type* wait_limits_cookie_netblock, struct config_file* cfg)
usr.sbin/unbound/services/cache/infra.c
405
domain_limits_free(struct rbtree_type* domain_limits)
usr.sbin/unbound/services/cache/infra.c
419
wait_limits_free(struct rbtree_type* wait_limits_tree)
usr.sbin/unbound/services/cache/infra.h
135
rbtree_type domain_limits;
usr.sbin/unbound/services/cache/infra.h
139
rbtree_type wait_limits_netblock;
usr.sbin/unbound/services/cache/infra.h
141
rbtree_type wait_limits_cookie_netblock;
usr.sbin/unbound/services/cache/infra.h
519
int setup_wait_limits(struct rbtree_type* wait_limits_netblock,
usr.sbin/unbound/services/cache/infra.h
520
struct rbtree_type* wait_limits_cookie_netblock,
usr.sbin/unbound/services/cache/infra.h
524
void wait_limits_free(struct rbtree_type* wait_limits_tree);
usr.sbin/unbound/services/cache/infra.h
527
int setup_domain_limits(struct rbtree_type* domain_limits,
usr.sbin/unbound/services/cache/infra.h
531
void domain_limits_free(struct rbtree_type* domain_limits);
usr.sbin/unbound/services/listen_dnsport.h
491
struct rbtree_type* conn_tree;
usr.sbin/unbound/services/listen_dnsport.h
497
struct rbtree_type* conid_tree;
usr.sbin/unbound/services/listen_dnsport.h
510
struct rbtree_type* timer_tree;
usr.sbin/unbound/services/listen_dnsport.h
627
struct rbtree_type stream_tree;
usr.sbin/unbound/services/localzone.c
1790
struct comm_reply* repinfo, struct rbtree_type* override_tree,
usr.sbin/unbound/services/localzone.c
2251
rbtree_type oldtree = zones->ztree;
usr.sbin/unbound/services/localzone.c
750
z->override_tree = (struct rbtree_type*)regional_alloc_zero(
usr.sbin/unbound/services/localzone.h
119
rbtree_type ztree;
usr.sbin/unbound/services/localzone.h
155
struct rbtree_type* override_tree;
usr.sbin/unbound/services/localzone.h
162
rbtree_type data;
usr.sbin/unbound/services/mesh.h
196
rbtree_type super_set;
usr.sbin/unbound/services/mesh.h
199
rbtree_type sub_set;
usr.sbin/unbound/services/mesh.h
89
rbtree_type run;
usr.sbin/unbound/services/mesh.h
91
rbtree_type all;
usr.sbin/unbound/services/outside_network.c
1176
void reuse_del_readwait(rbtree_type* tree_by_id)
usr.sbin/unbound/services/outside_network.c
1222
static void reuse_cb_readwait_for_failure(rbtree_type* tree_by_id, int err)
usr.sbin/unbound/services/outside_network.c
1260
rbtree_type store;
usr.sbin/unbound/services/outside_network.h
135
rbtree_type* pending;
usr.sbin/unbound/services/outside_network.h
137
rbtree_type* serviced;
usr.sbin/unbound/services/outside_network.h
179
rbtree_type tcp_reuse;
usr.sbin/unbound/services/outside_network.h
298
rbtree_type tree_by_id;
usr.sbin/unbound/services/outside_network.h
719
void reuse_del_readwait(rbtree_type* tree_by_id);
usr.sbin/unbound/services/rpz.h
89
struct rbtree_type entries;
usr.sbin/unbound/services/view.h
61
rbtree_type vtree;
usr.sbin/unbound/testcode/lock_verify.c
186
static void read_create(rbtree_type* all, FILE* in)
usr.sbin/unbound/testcode/lock_verify.c
215
insert_lock(rbtree_type* all, struct order_id* id)
usr.sbin/unbound/testcode/lock_verify.c
228
static void read_lock(rbtree_type* all, FILE* in, int val)
usr.sbin/unbound/testcode/lock_verify.c
261
static void readinput(rbtree_type* all, char* file)
usr.sbin/unbound/testcode/lock_verify.c
372
static void check_order(rbtree_type* all_locks)
usr.sbin/unbound/testcode/lock_verify.c
415
static void locks_free(rbtree_type* all_locks)
usr.sbin/unbound/testcode/lock_verify.c
427
rbtree_type* all_locks;
usr.sbin/unbound/testcode/lock_verify.c
79
rbtree_type* smaller;
usr.sbin/unbound/testcode/memstats.c
102
get_codeline(rbtree_type* tree, char* key, char* func)
usr.sbin/unbound/testcode/memstats.c
128
read_malloc_stat(char* line, rbtree_type* tree)
usr.sbin/unbound/testcode/memstats.c
153
read_calloc_stat(char* line, rbtree_type* tree)
usr.sbin/unbound/testcode/memstats.c
190
readfile(rbtree_type* tree, const char* fname)
usr.sbin/unbound/testcode/memstats.c
226
printstats(rbtree_type* tree)
usr.sbin/unbound/testcode/memstats.c
245
rbtree_type* tree = 0;
usr.sbin/unbound/testcode/replay.c
560
rbtree_type*
usr.sbin/unbound/testcode/replay.c
577
macro_store_delete(rbtree_type* store)
usr.sbin/unbound/testcode/replay.c
627
do_macro_recursion(rbtree_type* store, struct replay_runtime* runtime,
usr.sbin/unbound/testcode/replay.c
644
macro_getvar(rbtree_type* store, char* name)
usr.sbin/unbound/testcode/replay.c
654
do_macro_variable(rbtree_type* store, char* buf, size_t remain)
usr.sbin/unbound/testcode/replay.c
67
static char* macro_expand(rbtree_type* store,
usr.sbin/unbound/testcode/replay.c
793
macro_expand(rbtree_type* store, struct replay_runtime* runtime, char** text)
usr.sbin/unbound/testcode/replay.c
868
macro_process(rbtree_type* store, struct replay_runtime* runtime, char* text)
usr.sbin/unbound/testcode/replay.c
896
macro_lookup(rbtree_type* store, char* name)
usr.sbin/unbound/testcode/replay.c
903
void macro_print_debug(rbtree_type* store)
usr.sbin/unbound/testcode/replay.c
912
macro_assign(rbtree_type* store, char* name, char* value)
usr.sbin/unbound/testcode/replay.c
942
rbtree_type* store = macro_store_create();
usr.sbin/unbound/testcode/replay.h
331
rbtree_type* vars;
usr.sbin/unbound/testcode/replay.h
444
rbtree_type* macro_store_create(void);
usr.sbin/unbound/testcode/replay.h
450
void macro_store_delete(rbtree_type* store);
usr.sbin/unbound/testcode/replay.h
459
char* macro_process(rbtree_type* store, struct replay_runtime* runtime,
usr.sbin/unbound/testcode/replay.h
469
char* macro_lookup(rbtree_type* store, char* name);
usr.sbin/unbound/testcode/replay.h
478
int macro_assign(rbtree_type* store, char* name, char* value);
usr.sbin/unbound/testcode/replay.h
481
void macro_print_debug(rbtree_type* store);
usr.sbin/unbound/testcode/unitmain.c
703
struct rbtree_type* tree = respip_set_get_tree(set);
usr.sbin/unbound/testcode/unitmain.c
847
struct rbtree_type* tree;
usr.sbin/unbound/testcode/unitverify.c
428
nsec3_hash_test_entry(struct entry* e, rbtree_type* ct,
usr.sbin/unbound/testcode/unitverify.c
488
rbtree_type ct;
usr.sbin/unbound/util/edns.c
128
edns_string_addr_lookup(rbtree_type* tree, struct sockaddr_storage* addr,
usr.sbin/unbound/util/edns.c
145
rbtree_type tree = edns_strings->client_strings;
usr.sbin/unbound/util/edns.h
141
edns_string_addr_lookup(rbtree_type* tree, struct sockaddr_storage* addr,
usr.sbin/unbound/util/edns.h
59
rbtree_type client_strings;
usr.sbin/unbound/util/mini_event.h
105
rbtree_type* times;
usr.sbin/unbound/util/rbtree.c
108
rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/unbound/util/rbtree.c
135
rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/unbound/util/rbtree.c
158
rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/unbound/util/rbtree.c
228
rbtree_insert (rbtree_type *rbtree, rbnode_type *data)
usr.sbin/unbound/util/rbtree.c
281
rbtree_search (rbtree_type *rbtree, const void *key)
usr.sbin/unbound/util/rbtree.c
305
static void change_parent_ptr(rbtree_type* rbtree, rbnode_type* parent,
usr.sbin/unbound/util/rbtree.c
329
rbtree_delete(rbtree_type *rbtree, const void *key)
usr.sbin/unbound/util/rbtree.c
406
static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,
usr.sbin/unbound/util/rbtree.c
511
rbtree_find_less_equal(rbtree_type *rbtree, const void *key,
usr.sbin/unbound/util/rbtree.c
549
rbtree_first (rbtree_type *rbtree)
usr.sbin/unbound/util/rbtree.c
558
rbtree_last (rbtree_type *rbtree)
usr.sbin/unbound/util/rbtree.c
62
static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);
usr.sbin/unbound/util/rbtree.c
622
traverse_postorder(rbtree_type* tree, void (*func)(rbnode_type*, void*),
usr.sbin/unbound/util/rbtree.c
64
static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);
usr.sbin/unbound/util/rbtree.c
66
static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);
usr.sbin/unbound/util/rbtree.c
68
static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,
usr.sbin/unbound/util/rbtree.c
77
rbtree_type *
usr.sbin/unbound/util/rbtree.c
80
rbtree_type *rbtree;
usr.sbin/unbound/util/rbtree.c
83
rbtree = (rbtree_type *) malloc(sizeof(rbtree_type));
usr.sbin/unbound/util/rbtree.c
95
rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *))
usr.sbin/unbound/util/rbtree.h
102
void rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *));
usr.sbin/unbound/util/rbtree.h
110
rbnode_type *rbtree_insert(rbtree_type *rbtree, rbnode_type *data);
usr.sbin/unbound/util/rbtree.h
119
rbnode_type *rbtree_delete(rbtree_type *rbtree, const void *key);
usr.sbin/unbound/util/rbtree.h
127
rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);
usr.sbin/unbound/util/rbtree.h
138
int rbtree_find_less_equal(rbtree_type *rbtree, const void *key,
usr.sbin/unbound/util/rbtree.h
146
rbnode_type *rbtree_first(rbtree_type *rbtree);
usr.sbin/unbound/util/rbtree.h
153
rbnode_type *rbtree_last(rbtree_type *rbtree);
usr.sbin/unbound/util/rbtree.h
189
void traverse_postorder(rbtree_type* tree, void (*func)(rbnode_type*, void*),
usr.sbin/unbound/util/rbtree.h
74
typedef struct rbtree_type rbtree_type;
usr.sbin/unbound/util/rbtree.h
95
rbtree_type *rbtree_create(int (*cmpf)(const void *, const void *));
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
147
void addr_tree_init_parents(rbtree_type* tree)
usr.sbin/unbound/util/storage/dnstree.c
153
void name_tree_init_parents(rbtree_type* tree)
usr.sbin/unbound/util/storage/dnstree.c
179
struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,
usr.sbin/unbound/util/storage/dnstree.c
191
struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,
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
254
struct addr_tree_node* addr_tree_find(rbtree_type* tree,
usr.sbin/unbound/util/storage/dnstree.c
268
name_tree_next_root(rbtree_type* tree, uint16_t* dclass)
usr.sbin/unbound/util/storage/dnstree.c
82
void name_tree_init(rbtree_type* tree)
usr.sbin/unbound/util/storage/dnstree.c
87
void addr_tree_init(rbtree_type* tree)
usr.sbin/unbound/util/storage/dnstree.c
92
void addr_tree_addrport_init(rbtree_type* tree)
usr.sbin/unbound/util/storage/dnstree.c
97
int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,
usr.sbin/unbound/util/storage/dnstree.h
108
int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,
usr.sbin/unbound/util/storage/dnstree.h
116
void name_tree_init_parents(rbtree_type* tree);
usr.sbin/unbound/util/storage/dnstree.h
127
struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,
usr.sbin/unbound/util/storage/dnstree.h
139
struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,
usr.sbin/unbound/util/storage/dnstree.h
148
int name_tree_next_root(rbtree_type* tree, uint16_t* dclass);
usr.sbin/unbound/util/storage/dnstree.h
154
void addr_tree_init(rbtree_type* tree);
usr.sbin/unbound/util/storage/dnstree.h
161
void addr_tree_addrport_init(rbtree_type* tree);
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
181
void addr_tree_init_parents(rbtree_type* tree);
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
94
void name_tree_init(rbtree_type* tree);
usr.sbin/unbound/util/tcp_conn_limit.c
199
rbtree_type oldtree = tcl->tree;
usr.sbin/unbound/util/tcp_conn_limit.h
60
rbtree_type tree;
usr.sbin/unbound/util/winsock_event.h
135
rbtree_type* times;
usr.sbin/unbound/validator/autotrust.h
130
rbtree_type probe;
usr.sbin/unbound/validator/val_anchor.c
1389
rbtree_type* oldtree;
usr.sbin/unbound/validator/val_anchor.c
1390
rbtree_type oldprobe;
usr.sbin/unbound/validator/val_anchor.h
69
rbtree_type* tree;
usr.sbin/unbound/validator/val_neg.h
123
rbtree_type tree;
usr.sbin/unbound/validator/val_neg.h
72
rbtree_type tree;
usr.sbin/unbound/validator/val_nsec3.c
552
ct->ct = (rbtree_type*)regional_alloc(region, sizeof(*ct->ct));
usr.sbin/unbound/validator/val_nsec3.c
656
nsec3_hash_name(rbtree_type* table, struct regional* region, sldns_buffer* buf,
usr.sbin/unbound/validator/val_nsec3.h
106
rbtree_type* ct;
usr.sbin/unbound/validator/val_nsec3.h
317
int nsec3_hash_name(rbtree_type* table, struct regional* region,
usr.sbin/unbound/validator/val_sigcrypt.c
1032
rbtree_type* sortree, struct canon_rr* rrs)
usr.sbin/unbound/validator/val_sigcrypt.c
1190
struct rbtree_type sortree1, sortree2;
usr.sbin/unbound/validator/val_sigcrypt.c
1269
struct rbtree_type** sortree, sldns_pkt_section section,
usr.sbin/unbound/validator/val_sigcrypt.c
1279
*sortree = (struct rbtree_type*)regional_alloc(region,
usr.sbin/unbound/validator/val_sigcrypt.c
1280
sizeof(rbtree_type));
usr.sbin/unbound/validator/val_sigcrypt.c
1340
struct rbtree_type* sortree = NULL;
usr.sbin/unbound/validator/val_sigcrypt.c
1347
sortree = (struct rbtree_type*)regional_alloc(region,
usr.sbin/unbound/validator/val_sigcrypt.c
1348
sizeof(rbtree_type));
usr.sbin/unbound/validator/val_sigcrypt.c
1541
struct rbtree_type** sortree, int* buf_canon,
usr.sbin/unbound/validator/val_sigcrypt.c
559
struct rbtree_type** sortree,
usr.sbin/unbound/validator/val_sigcrypt.c
632
rbtree_type* sortree = NULL;
usr.sbin/unbound/validator/val_sigcrypt.c
714
rbtree_type* sortree = NULL;
usr.sbin/unbound/validator/val_sigcrypt.h
324
struct rbtree_type** sortree, int* buf_canon,
usr.sbin/unbound/validator/val_sigcrypt.h
53
struct rbtree_type;
