Symbol: rbnode_type
sbin/unwind/libunbound/dns64/dns64.c
422
free_ignore_aaaa_node(rbnode_type* node, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/iterator/iter_fwd.c
445
rbnode_type* res = NULL;
sbin/unwind/libunbound/iterator/iter_fwd.c
493
rbnode_type* n;
sbin/unwind/libunbound/iterator/iter_fwd.c
86
static void delfwdnode(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/iterator/iter_fwd.h
74
rbnode_type node;
sbin/unwind/libunbound/iterator/iter_hints.c
623
rbnode_type* oldroot = hints->tree.root;
sbin/unwind/libunbound/iterator/iter_hints.c
72
static void delhintnode(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/iterator/iter_utils.c
129
caps_free(struct rbnode_type* n, void* ATTR_UNUSED(d))
sbin/unwind/libunbound/libunbound/context.h
156
struct rbnode_type node;
sbin/unwind/libunbound/libunbound/libunbound.c
256
delq(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/respip/respip.c
133
prev = (struct resp_addr*)rbtree_previous((struct rbnode_type*)node);
sbin/unwind/libunbound/respip/respip.c
1378
rbnode_type* oldroot = respip_set->ip_tree.root;
sbin/unwind/libunbound/respip/respip.c
75
resp_addr_del(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/authzone.c
2376
auth_zone_del(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/authzone.c
2384
auth_xfer_del(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/authzone.c
2644
while(next && (rbnode_type*)next != RBTREE_NULL && next->rrsets == NULL) {
sbin/unwind/libunbound/services/authzone.c
2649
if((rbnode_type*)next == RBTREE_NULL || !next) {
sbin/unwind/libunbound/services/authzone.c
2962
while(node && (rbnode_type*)node != RBTREE_NULL &&
sbin/unwind/libunbound/services/authzone.c
2966
if((rbnode_type*)node == RBTREE_NULL)
sbin/unwind/libunbound/services/authzone.c
2988
while(node && (rbnode_type*)node != RBTREE_NULL &&
sbin/unwind/libunbound/services/authzone.c
2992
if((rbnode_type*)node == RBTREE_NULL)
sbin/unwind/libunbound/services/authzone.c
383
auth_data_del(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/authzone.c
434
lock_protect(&z->lock, &z->name, sizeof(*z)-sizeof(rbnode_type)-
sbin/unwind/libunbound/services/authzone.c
485
return rbtree_find_less_equal(&az->ztree, &key, (rbnode_type**)z);
sbin/unwind/libunbound/services/authzone.c
635
(rbnode_type**)node);
sbin/unwind/libunbound/services/authzone.h
163
rbnode_type node;
sbin/unwind/libunbound/services/authzone.h
205
rbnode_type node;
sbin/unwind/libunbound/services/authzone.h
95
rbnode_type node;
sbin/unwind/libunbound/services/cache/infra.c
396
static void domain_limit_free(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/cache/infra.c
413
static void wait_limit_netblock_del(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/listen_dnsport.c
3343
conn_tree_del(rbnode_type* node, void* arg)
sbin/unwind/libunbound/services/listen_dnsport.c
3364
conid_tree_del(rbnode_type* node, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/listen_dnsport.c
3405
struct rbnode_type* node;
sbin/unwind/libunbound/services/listen_dnsport.c
3610
stream_tree_del(rbnode_type* node, void* arg)
sbin/unwind/libunbound/services/listen_dnsport.c
3881
rbnode_type* node;
sbin/unwind/libunbound/services/listen_dnsport.c
4992
struct rbnode_type* node;
sbin/unwind/libunbound/services/listen_dnsport.h
542
struct rbnode_type node;
sbin/unwind/libunbound/services/listen_dnsport.h
587
struct rbnode_type node;
sbin/unwind/libunbound/services/listen_dnsport.h
656
struct rbnode_type node;
sbin/unwind/libunbound/services/listen_dnsport.h
672
rbnode_type node;
sbin/unwind/libunbound/services/localzone.c
1255
rbnode_type* res = NULL;
sbin/unwind/libunbound/services/localzone.c
131
lzdel(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/localzone.c
1327
rbnode_type *node;
sbin/unwind/libunbound/services/localzone.c
222
lock_protect(&z->lock, &z->parent, sizeof(*z)-sizeof(rbnode_type));
sbin/unwind/libunbound/services/localzone.h
130
rbnode_type node;
sbin/unwind/libunbound/services/localzone.h
179
rbnode_type node;
sbin/unwind/libunbound/services/mesh.c
1204
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
1235
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
1299
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
249
mesh_delete_helper(rbnode_type* n)
sbin/unwind/libunbound/services/mesh.c
495
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
643
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
732
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
809
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.h
186
rbnode_type node;
sbin/unwind/libunbound/services/mesh.h
188
rbnode_type run_node;
sbin/unwind/libunbound/services/mesh.h
231
rbnode_type node;
sbin/unwind/libunbound/services/outside_network.c
1083
rbnode_type* rem;
sbin/unwind/libunbound/services/outside_network.c
1213
static void reuse_del_readwait_elem(rbnode_type* node, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/outside_network.c
1272
rbnode_type* node;
sbin/unwind/libunbound/services/outside_network.c
1285
static void mark_for_cb_and_decommission(rbnode_type* node,
sbin/unwind/libunbound/services/outside_network.c
1876
pending_node_del(rbnode_type* node, void* arg)
sbin/unwind/libunbound/services/outside_network.c
1885
serviced_node_del(rbnode_type* node, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/outside_network.c
2425
rbnode_type* node;
sbin/unwind/libunbound/services/outside_network.c
2457
rbnode_type* next = rbtree_next(node);
sbin/unwind/libunbound/services/outside_network.c
2699
rbnode_type* ins;
sbin/unwind/libunbound/services/outside_network.c
3069
rbnode_type* rem =
sbin/unwind/libunbound/services/outside_network.c
467
rbnode_type* added;
sbin/unwind/libunbound/services/outside_network.c
485
rbnode_type* n;
sbin/unwind/libunbound/services/outside_network.c
496
tree_by_id_get_id(rbnode_type* node)
sbin/unwind/libunbound/services/outside_network.c
553
rbnode_type* result = NULL, *prev;
sbin/unwind/libunbound/services/outside_network.h
297
rbnode_type node;
sbin/unwind/libunbound/services/outside_network.h
359
rbnode_type node;
sbin/unwind/libunbound/services/outside_network.h
430
rbnode_type id_node;
sbin/unwind/libunbound/services/outside_network.h
497
rbnode_type node;
sbin/unwind/libunbound/services/rpz.c
362
rpz_clientip_synthesized_rr_delete(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/view.c
112
lock_protect(&v->lock, &v->name, sizeof(*v)-sizeof(rbnode_type));
sbin/unwind/libunbound/services/view.c
274
rbnode_type* oldroot = vs->vtree.root;
sbin/unwind/libunbound/services/view.c
83
delviewnode(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/view.h
69
rbnode_type node;
sbin/unwind/libunbound/util/mini_event.c
150
while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))
sbin/unwind/libunbound/util/mini_event.h
137
rbnode_type node;
sbin/unwind/libunbound/util/netevent.c
1645
struct rbnode_type* node;
sbin/unwind/libunbound/util/netevent.c
1955
rbnode_type* node;
sbin/unwind/libunbound/util/netevent.c
2205
rbnode_type* node;
sbin/unwind/libunbound/util/netevent.c
2272
rbnode_type* node;
sbin/unwind/libunbound/util/netevent.c
2429
struct rbnode_type* node;
sbin/unwind/libunbound/util/rbtree.c
108
rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node)
sbin/unwind/libunbound/util/rbtree.c
110
rbnode_type *right = node->right;
sbin/unwind/libunbound/util/rbtree.c
135
rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node)
sbin/unwind/libunbound/util/rbtree.c
137
rbnode_type *left = node->left;
sbin/unwind/libunbound/util/rbtree.c
158
rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node)
sbin/unwind/libunbound/util/rbtree.c
160
rbnode_type *uncle;
sbin/unwind/libunbound/util/rbtree.c
227
rbnode_type *
sbin/unwind/libunbound/util/rbtree.c
228
rbtree_insert (rbtree_type *rbtree, rbnode_type *data)
sbin/unwind/libunbound/util/rbtree.c
234
rbnode_type *node = rbtree->root;
sbin/unwind/libunbound/util/rbtree.c
235
rbnode_type *parent = RBTREE_NULL;
sbin/unwind/libunbound/util/rbtree.c
280
rbnode_type *
sbin/unwind/libunbound/util/rbtree.c
283
rbnode_type *node;
sbin/unwind/libunbound/util/rbtree.c
299
static void swap_np(rbnode_type** x, rbnode_type** y)
sbin/unwind/libunbound/util/rbtree.c
301
rbnode_type* t = *x; *x = *y; *y = t;
sbin/unwind/libunbound/util/rbtree.c
305
static void change_parent_ptr(rbtree_type* rbtree, rbnode_type* parent,
sbin/unwind/libunbound/util/rbtree.c
306
rbnode_type* old, rbnode_type* new)
sbin/unwind/libunbound/util/rbtree.c
320
static void change_child_ptr(rbnode_type* child, rbnode_type* old,
sbin/unwind/libunbound/util/rbtree.c
321
rbnode_type* new)
sbin/unwind/libunbound/util/rbtree.c
328
rbnode_type*
sbin/unwind/libunbound/util/rbtree.c
331
rbnode_type *to_delete;
sbin/unwind/libunbound/util/rbtree.c
332
rbnode_type *child;
sbin/unwind/libunbound/util/rbtree.c
340
rbnode_type *smright = to_delete->right;
sbin/unwind/libunbound/util/rbtree.c
406
static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,
sbin/unwind/libunbound/util/rbtree.c
407
rbnode_type* child_parent)
sbin/unwind/libunbound/util/rbtree.c
409
rbnode_type* sibling;
sbin/unwind/libunbound/util/rbtree.c
512
rbnode_type **result)
sbin/unwind/libunbound/util/rbtree.c
515
rbnode_type *node;
sbin/unwind/libunbound/util/rbtree.c
53
rbnode_type rbtree_null_node = {
sbin/unwind/libunbound/util/rbtree.c
548
rbnode_type *
sbin/unwind/libunbound/util/rbtree.c
551
rbnode_type *node;
sbin/unwind/libunbound/util/rbtree.c
557
rbnode_type *
sbin/unwind/libunbound/util/rbtree.c
560
rbnode_type *node;
sbin/unwind/libunbound/util/rbtree.c
570
rbnode_type *
sbin/unwind/libunbound/util/rbtree.c
571
rbtree_next (rbnode_type *node)
sbin/unwind/libunbound/util/rbtree.c
573
rbnode_type *parent;
sbin/unwind/libunbound/util/rbtree.c
589
rbnode_type *
sbin/unwind/libunbound/util/rbtree.c
590
rbtree_previous(rbnode_type *node)
sbin/unwind/libunbound/util/rbtree.c
592
rbnode_type *parent;
sbin/unwind/libunbound/util/rbtree.c
610
traverse_post(void (*func)(rbnode_type*, void*), void* arg, rbnode_type* node)
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
69
rbnode_type* child_parent);
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
139
rbnode_type **result);
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
160
rbnode_type *rbtree_next(rbnode_type *rbtree);
sbin/unwind/libunbound/util/rbtree.h
167
rbnode_type *rbtree_previous(rbnode_type *rbtree);
sbin/unwind/libunbound/util/rbtree.h
175
(rbnode_type*)node != RBTREE_NULL; \
sbin/unwind/libunbound/util/rbtree.h
176
node = (type)rbtree_next((rbnode_type*)node))
sbin/unwind/libunbound/util/rbtree.h
189
void traverse_postorder(rbtree_type* tree, void (*func)(rbnode_type*, void*),
sbin/unwind/libunbound/util/rbtree.h
51
typedef struct rbnode_type rbnode_type;
sbin/unwind/libunbound/util/rbtree.h
57
rbnode_type *parent;
sbin/unwind/libunbound/util/rbtree.h
59
rbnode_type *left;
sbin/unwind/libunbound/util/rbtree.h
61
rbnode_type *right;
sbin/unwind/libunbound/util/rbtree.h
71
extern rbnode_type rbtree_null_node;
sbin/unwind/libunbound/util/rbtree.h
78
rbnode_type *root;
sbin/unwind/libunbound/util/storage/dnstree.c
124
for(; (rbnode_type*)node != RBTREE_NULL;
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
194
rbnode_type* res = NULL;
sbin/unwind/libunbound/util/storage/dnstree.c
226
rbnode_type* res = NULL;
sbin/unwind/libunbound/util/storage/dnstree.c
257
rbnode_type* res = NULL;
sbin/unwind/libunbound/util/storage/dnstree.c
271
rbnode_type* n;
sbin/unwind/libunbound/util/storage/dnstree.h
57
rbnode_type node;
sbin/unwind/libunbound/util/storage/dnstree.h
79
rbnode_type node;
sbin/unwind/libunbound/util/tcp_conn_limit.c
66
tcl_list_free_node(rbnode_type* node, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/util/winsock_event.c
172
while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))
sbin/unwind/libunbound/util/winsock_event.h
172
rbnode_type node;
sbin/unwind/libunbound/validator/autotrust.c
2036
rbnode_type* t = rbtree_first(&anchors->autr->probe);
sbin/unwind/libunbound/validator/autotrust.c
2433
rbnode_type* el;
sbin/unwind/libunbound/validator/autotrust.h
94
rbnode_type pnode;
sbin/unwind/libunbound/validator/val_anchor.c
1142
rbnode_type* res = NULL;
sbin/unwind/libunbound/validator/val_anchor.c
116
anchors_delfunc(rbnode_type* elem, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/validator/val_anchor.c
1371
while((rbnode_type*)ta != RBTREE_NULL) {
sbin/unwind/libunbound/validator/val_anchor.c
201
rbnode_type* n;
sbin/unwind/libunbound/validator/val_anchor.c
225
rbnode_type* r;
sbin/unwind/libunbound/validator/val_anchor.c
997
while((rbnode_type*)ta != RBTREE_NULL) {
sbin/unwind/libunbound/validator/val_anchor.h
94
rbnode_type node;
sbin/unwind/libunbound/validator/val_neg.c
1153
data = (struct val_neg_data*)rbtree_previous((rbnode_type*)data);
sbin/unwind/libunbound/validator/val_neg.c
1154
if((rbnode_type*)data == RBTREE_NULL || !data->in_use) {
sbin/unwind/libunbound/validator/val_neg.c
121
neg_clear_datas(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/validator/val_neg.c
130
neg_clear_zones(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/validator/val_neg.c
382
rbnode_type* res = NULL;
sbin/unwind/libunbound/validator/val_neg.c
422
rbnode_type* res = NULL;
sbin/unwind/libunbound/validator/val_neg.c
688
rbnode_type* walk, *next;
sbin/unwind/libunbound/validator/val_neg.c
964
rbnode_type* r;
sbin/unwind/libunbound/validator/val_neg.h
144
rbnode_type node;
sbin/unwind/libunbound/validator/val_neg.h
96
rbnode_type node;
sbin/unwind/libunbound/validator/val_nsec3.c
719
rbnode_type* n;
sbin/unwind/libunbound/validator/val_nsec3.h
267
rbnode_type node;
sbin/unwind/libunbound/validator/val_sigcrypt.c
774
rbnode_type node;
usr.sbin/nsd/mini_event.c
169
while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))
usr.sbin/nsd/mini_event.h
124
rbnode_type node;
usr.sbin/nsd/namedb.c
161
zone_del_domain_in_hash_tree(rbtree_type* tree, rbnode_type* node)
usr.sbin/nsd/namedb.c
314
domain_type* domain, rbnode_type* node)
usr.sbin/nsd/namedb.c
321
memset(node, 0, sizeof(rbnode_type));
usr.sbin/nsd/namedb.c
367
rbtree_insert(result->names_to_domains, (rbnode_type *) root);
usr.sbin/nsd/namedb.c
398
exact = rbtree_find_less_equal(table->names_to_domains, dname, (rbnode_type **) closest_match);
usr.sbin/nsd/namedb.c
461
rbtree_insert(table->names_to_domains, (rbnode_type *) result);
usr.sbin/nsd/namedb.h
101
rbnode_type node;
usr.sbin/nsd/namedb.h
258
rbnode_type* node);
usr.sbin/nsd/namedb.h
259
void zone_del_domain_in_hash_tree(rbtree_type* tree, rbnode_type* node);
usr.sbin/nsd/namedb.h
320
rbnode_type *prev = rbtree_previous((rbnode_type *) domain);
usr.sbin/nsd/namedb.h
332
rbnode_type *next = rbtree_next((rbnode_type *) domain);
usr.sbin/nsd/namedb.h
61
rbnode_type node;
usr.sbin/nsd/namedb.h
80
rbnode_type nsec3_node;
usr.sbin/nsd/nsec3.c
375
rbnode_type* r = rbtree_previous(&domain->nsec3->nsec3_node);
usr.sbin/nsd/nsec3.c
599
rbnode_type* r = NULL;
usr.sbin/nsd/nsec3.c
825
process_first(rbtree_type* tree, uint8_t* hash, rbnode_type** p,
usr.sbin/nsd/nsec3.c
859
process_end(rbtree_type* tree, uint8_t* hash, rbnode_type** p,
usr.sbin/nsd/nsec3.c
901
rbnode_type *p = RBTREE_NULL, *pwc = RBTREE_NULL, *pds = RBTREE_NULL;
usr.sbin/nsd/nsec3.c
902
rbnode_type *p_end = RBTREE_NULL, *pwc_end = RBTREE_NULL, *pds_end = RBTREE_NULL;
usr.sbin/nsd/nsec3.c
968
rbnode_type* nx;
usr.sbin/nsd/options.c
201
if(!rbtree_insert(opt->zone_options, (rbnode_type*)zone))
usr.sbin/nsd/options.c
213
if(!rbtree_insert(opt->patterns, (rbnode_type*)pat))
usr.sbin/nsd/options.c
2978
rbnode_type* res;
usr.sbin/nsd/options.c
3010
rbtree_insert(opt->zonestatnames, (rbnode_type*)n);
usr.sbin/nsd/options.c
428
rbtree_insert(opt->zonestatnames, (rbnode_type*)n);
usr.sbin/nsd/options.c
850
if(!b || (rbnode_type*)b==RBTREE_NULL)
usr.sbin/nsd/options.h
303
rbnode_type node;
usr.sbin/nsd/options.h
366
rbnode_type node;
usr.sbin/nsd/options.h
393
rbnode_type node;
usr.sbin/nsd/options.h
447
rbnode_type node; /* key of tree is name */
usr.sbin/nsd/options.h
458
rbnode_type node; /* key of tree is name */
usr.sbin/nsd/options.h
479
rbnode_type node; /* key is ptr to linesize */
usr.sbin/nsd/options.h
488
rbnode_type node; /* key is malloced string with cooked zonestat name */
usr.sbin/nsd/query.c
1274
memcpy(&match->node, &wildcard_child->node, sizeof(rbnode_type));
usr.sbin/nsd/query.c
749
memcpy(&temp->node, &additional->node, sizeof(rbnode_type));
usr.sbin/nsd/rbtree.c
126
rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/nsd/rbtree.c
128
rbnode_type *uncle;
usr.sbin/nsd/rbtree.c
20
rbnode_type rbtree_null_node = {
usr.sbin/nsd/rbtree.c
200
rbnode_type *
usr.sbin/nsd/rbtree.c
201
rbtree_insert (rbtree_type *rbtree, rbnode_type *data)
usr.sbin/nsd/rbtree.c
205
rbnode_type *node;
usr.sbin/nsd/rbtree.c
206
rbnode_type *parent;
usr.sbin/nsd/rbtree.c
259
rbnode_type *
usr.sbin/nsd/rbtree.c
262
rbnode_type *node;
usr.sbin/nsd/rbtree.c
28
static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);
usr.sbin/nsd/rbtree.c
282
static void swap_np(rbnode_type** x, rbnode_type** y)
usr.sbin/nsd/rbtree.c
284
rbnode_type* t = *x; *x = *y; *y = t;
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
305
static void change_child_ptr(rbnode_type* child, rbnode_type* old, rbnode_type* new)
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
312
rbnode_type*
usr.sbin/nsd/rbtree.c
315
rbnode_type *to_delete;
usr.sbin/nsd/rbtree.c
316
rbnode_type *child;
usr.sbin/nsd/rbtree.c
330
rbnode_type *smright = to_delete->right;
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
398
rbnode_type* sibling;
usr.sbin/nsd/rbtree.c
505
rbtree_find_less_equal(rbtree_type *rbtree, const void *key, rbnode_type **result)
usr.sbin/nsd/rbtree.c
508
rbnode_type *node;
usr.sbin/nsd/rbtree.c
546
rbnode_type *
usr.sbin/nsd/rbtree.c
549
rbnode_type *node;
usr.sbin/nsd/rbtree.c
560
rbnode_type *
usr.sbin/nsd/rbtree.c
563
rbnode_type *node;
usr.sbin/nsd/rbtree.c
578
rbnode_type *
usr.sbin/nsd/rbtree.c
579
rbtree_next (rbnode_type *node)
usr.sbin/nsd/rbtree.c
581
rbnode_type *parent;
usr.sbin/nsd/rbtree.c
597
rbnode_type *
usr.sbin/nsd/rbtree.c
598
rbtree_previous(rbnode_type *node)
usr.sbin/nsd/rbtree.c
600
rbnode_type *parent;
usr.sbin/nsd/rbtree.c
64
rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/nsd/rbtree.c
66
rbnode_type *right;
usr.sbin/nsd/rbtree.c
97
rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/nsd/rbtree.c
99
rbnode_type *left;
usr.sbin/nsd/rbtree.h
22
rbnode_type *parent;
usr.sbin/nsd/rbtree.h
23
rbnode_type *left;
usr.sbin/nsd/rbtree.h
24
rbnode_type *right;
usr.sbin/nsd/rbtree.h
30
extern rbnode_type rbtree_null_node;
usr.sbin/nsd/rbtree.h
37
rbnode_type *root;
usr.sbin/nsd/rbtree.h
43
rbnode_type *_node;
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/rbtree.h
61
rbnode_type *rbtree_next(rbnode_type *rbtree);
usr.sbin/nsd/rbtree.h
62
rbnode_type *rbtree_previous(rbnode_type *rbtree);
usr.sbin/nsd/rbtree.h
73
(rbnode_type*)node != RBTREE_NULL; \
usr.sbin/nsd/rbtree.h
74
node = (type)rbtree_next((rbnode_type*)node))
usr.sbin/nsd/remote.c
1636
while((rbnode_type*)k != RBTREE_NULL) {
usr.sbin/nsd/remote.c
1638
(rbnode_type*)k);
usr.sbin/nsd/remote.c
1953
while((rbnode_type*)p != RBTREE_NULL) {
usr.sbin/nsd/remote.c
1955
rbtree_next((rbnode_type*)p);
usr.sbin/nsd/tsig.c
81
rbnode_type node; /* by dname */
usr.sbin/nsd/xfrd-catalog-zones.c
210
(rbnode_type*)consumer_zone);
usr.sbin/nsd/xfrd-catalog-zones.c
464
static inline struct catalog_member_zone* cursor_cmz(rbnode_type* node)
usr.sbin/nsd/xfrd-catalog-zones.c
466
static inline const dname_type* cursor_member_id(rbnode_type* node)
usr.sbin/nsd/xfrd-catalog-zones.c
473
rbnode_type* cursor;
usr.sbin/nsd/xfrd-catalog-zones.c
498
rbnode_type* cursor;
usr.sbin/nsd/xfrd-catalog-zones.c
962
(rbnode_type*)producer_zone);
usr.sbin/nsd/xfrd-catalog-zones.h
19
rbnode_type node;
usr.sbin/nsd/xfrd-catalog-zones.h
39
rbnode_type node;
usr.sbin/nsd/xfrd-disk.c
456
rbnode_type* p;
usr.sbin/nsd/xfrd-notify.c
117
rbtree_insert(tree, (rbnode_type*)not);
usr.sbin/nsd/xfrd-notify.h
51
rbnode_type node;
usr.sbin/nsd/xfrd-tcp.c
338
clear_pipeline_entry(struct xfrd_tcp_pipeline* tp, rbnode_type* node)
usr.sbin/nsd/xfrd-tcp.c
407
rbnode_type* n;
usr.sbin/nsd/xfrd-tcp.c
441
rbnode_type* node;
usr.sbin/nsd/xfrd-tcp.c
458
rbnode_type* n;
usr.sbin/nsd/xfrd-tcp.c
631
rbnode_type* sme = NULL;
usr.sbin/nsd/xfrd-tcp.h
103
rbnode_type node;
usr.sbin/nsd/xfrd-tcp.h
88
rbnode_type node;
usr.sbin/nsd/xfrd.c
577
rbtree_insert(xfrd->zones, (rbnode_type*)xzone);
usr.sbin/nsd/xfrd.h
157
rbnode_type node;
usr.sbin/unbound/dns64/dns64.c
422
free_ignore_aaaa_node(rbnode_type* node, void* ATTR_UNUSED(arg))
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
111
whitelist_free(struct rbnode_type* n, void* ATTR_UNUSED(d))
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
121
whitelist_get_mem(struct rbnode_type* n, void* arg)
usr.sbin/unbound/iterator/iter_fwd.c
445
rbnode_type* res = NULL;
usr.sbin/unbound/iterator/iter_fwd.c
493
rbnode_type* n;
usr.sbin/unbound/iterator/iter_fwd.c
86
static void delfwdnode(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/iterator/iter_fwd.h
74
rbnode_type node;
usr.sbin/unbound/iterator/iter_hints.c
623
rbnode_type* oldroot = hints->tree.root;
usr.sbin/unbound/iterator/iter_hints.c
72
static void delhintnode(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/iterator/iter_utils.c
129
caps_free(struct rbnode_type* n, void* ATTR_UNUSED(d))
usr.sbin/unbound/libunbound/context.h
156
struct rbnode_type node;
usr.sbin/unbound/libunbound/libunbound.c
256
delq(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/respip/respip.c
133
prev = (struct resp_addr*)rbtree_previous((struct rbnode_type*)node);
usr.sbin/unbound/respip/respip.c
1378
rbnode_type* oldroot = respip_set->ip_tree.root;
usr.sbin/unbound/respip/respip.c
75
resp_addr_del(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/authzone.c
2376
auth_zone_del(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/authzone.c
2384
auth_xfer_del(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/authzone.c
2644
while(next && (rbnode_type*)next != RBTREE_NULL && next->rrsets == NULL) {
usr.sbin/unbound/services/authzone.c
2649
if((rbnode_type*)next == RBTREE_NULL || !next) {
usr.sbin/unbound/services/authzone.c
2962
while(node && (rbnode_type*)node != RBTREE_NULL &&
usr.sbin/unbound/services/authzone.c
2966
if((rbnode_type*)node == RBTREE_NULL)
usr.sbin/unbound/services/authzone.c
2988
while(node && (rbnode_type*)node != RBTREE_NULL &&
usr.sbin/unbound/services/authzone.c
2992
if((rbnode_type*)node == RBTREE_NULL)
usr.sbin/unbound/services/authzone.c
383
auth_data_del(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/authzone.c
434
lock_protect(&z->lock, &z->name, sizeof(*z)-sizeof(rbnode_type)-
usr.sbin/unbound/services/authzone.c
485
return rbtree_find_less_equal(&az->ztree, &key, (rbnode_type**)z);
usr.sbin/unbound/services/authzone.c
635
(rbnode_type**)node);
usr.sbin/unbound/services/authzone.h
163
rbnode_type node;
usr.sbin/unbound/services/authzone.h
205
rbnode_type node;
usr.sbin/unbound/services/authzone.h
95
rbnode_type node;
usr.sbin/unbound/services/cache/infra.c
396
static void domain_limit_free(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/cache/infra.c
413
static void wait_limit_netblock_del(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/listen_dnsport.c
3343
conn_tree_del(rbnode_type* node, void* arg)
usr.sbin/unbound/services/listen_dnsport.c
3364
conid_tree_del(rbnode_type* node, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/listen_dnsport.c
3405
struct rbnode_type* node;
usr.sbin/unbound/services/listen_dnsport.c
3610
stream_tree_del(rbnode_type* node, void* arg)
usr.sbin/unbound/services/listen_dnsport.c
3881
rbnode_type* node;
usr.sbin/unbound/services/listen_dnsport.c
4992
struct rbnode_type* node;
usr.sbin/unbound/services/listen_dnsport.h
542
struct rbnode_type node;
usr.sbin/unbound/services/listen_dnsport.h
587
struct rbnode_type node;
usr.sbin/unbound/services/listen_dnsport.h
656
struct rbnode_type node;
usr.sbin/unbound/services/listen_dnsport.h
672
rbnode_type node;
usr.sbin/unbound/services/localzone.c
1255
rbnode_type* res = NULL;
usr.sbin/unbound/services/localzone.c
131
lzdel(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/localzone.c
1327
rbnode_type *node;
usr.sbin/unbound/services/localzone.c
222
lock_protect(&z->lock, &z->parent, sizeof(*z)-sizeof(rbnode_type));
usr.sbin/unbound/services/localzone.h
130
rbnode_type node;
usr.sbin/unbound/services/localzone.h
179
rbnode_type node;
usr.sbin/unbound/services/mesh.c
1204
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
1235
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
1299
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
249
mesh_delete_helper(rbnode_type* n)
usr.sbin/unbound/services/mesh.c
495
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
643
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
732
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
809
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.h
186
rbnode_type node;
usr.sbin/unbound/services/mesh.h
188
rbnode_type run_node;
usr.sbin/unbound/services/mesh.h
231
rbnode_type node;
usr.sbin/unbound/services/outside_network.c
1083
rbnode_type* rem;
usr.sbin/unbound/services/outside_network.c
1213
static void reuse_del_readwait_elem(rbnode_type* node, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/outside_network.c
1272
rbnode_type* node;
usr.sbin/unbound/services/outside_network.c
1285
static void mark_for_cb_and_decommission(rbnode_type* node,
usr.sbin/unbound/services/outside_network.c
1876
pending_node_del(rbnode_type* node, void* arg)
usr.sbin/unbound/services/outside_network.c
1885
serviced_node_del(rbnode_type* node, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/outside_network.c
2425
rbnode_type* node;
usr.sbin/unbound/services/outside_network.c
2457
rbnode_type* next = rbtree_next(node);
usr.sbin/unbound/services/outside_network.c
2699
rbnode_type* ins;
usr.sbin/unbound/services/outside_network.c
3069
rbnode_type* rem =
usr.sbin/unbound/services/outside_network.c
467
rbnode_type* added;
usr.sbin/unbound/services/outside_network.c
485
rbnode_type* n;
usr.sbin/unbound/services/outside_network.c
496
tree_by_id_get_id(rbnode_type* node)
usr.sbin/unbound/services/outside_network.c
553
rbnode_type* result = NULL, *prev;
usr.sbin/unbound/services/outside_network.h
297
rbnode_type node;
usr.sbin/unbound/services/outside_network.h
359
rbnode_type node;
usr.sbin/unbound/services/outside_network.h
430
rbnode_type id_node;
usr.sbin/unbound/services/outside_network.h
497
rbnode_type node;
usr.sbin/unbound/services/rpz.c
362
rpz_clientip_synthesized_rr_delete(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/view.c
112
lock_protect(&v->lock, &v->name, sizeof(*v)-sizeof(rbnode_type));
usr.sbin/unbound/services/view.c
274
rbnode_type* oldroot = vs->vtree.root;
usr.sbin/unbound/services/view.c
83
delviewnode(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/view.h
69
rbnode_type node;
usr.sbin/unbound/testcode/lock_verify.c
393
static void dellockref(rbnode_type* node, void* ATTR_UNUSED(arg))
usr.sbin/unbound/testcode/lock_verify.c
402
static void delnode(rbnode_type* node, void* ATTR_UNUSED(arg))
usr.sbin/unbound/testcode/lock_verify.c
71
rbnode_type node;
usr.sbin/unbound/testcode/lock_verify.c
92
rbnode_type node;
usr.sbin/unbound/testcode/memstats.c
54
rbnode_type node;
usr.sbin/unbound/testcode/replay.c
568
del_macro(rbnode_type* x, void* ATTR_UNUSED(arg))
usr.sbin/unbound/testcode/replay.h
412
rbnode_type node;
usr.sbin/unbound/testcode/unitmain.c
1194
(rbnode_type*)node1 != RBTREE_NULL &&
usr.sbin/unbound/testcode/unitmain.c
1195
(rbnode_type*)node2 != RBTREE_NULL;
usr.sbin/unbound/testcode/unitmain.c
1196
node1=(struct local_zone*)rbtree_next((rbnode_type*)node1),
usr.sbin/unbound/testcode/unitmain.c
1197
node2=(struct local_zone*)rbtree_next((rbnode_type*)node2)) {
usr.sbin/unbound/testcode/unitneg.c
247
rbnode_type* walk;
usr.sbin/unbound/testcode/unitneg.c
329
if(d && (rbnode_type*)d!=RBTREE_NULL)
usr.sbin/unbound/util/mini_event.c
150
while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))
usr.sbin/unbound/util/mini_event.h
137
rbnode_type node;
usr.sbin/unbound/util/netevent.c
1645
struct rbnode_type* node;
usr.sbin/unbound/util/netevent.c
1955
rbnode_type* node;
usr.sbin/unbound/util/netevent.c
2205
rbnode_type* node;
usr.sbin/unbound/util/netevent.c
2272
rbnode_type* node;
usr.sbin/unbound/util/netevent.c
2429
struct rbnode_type* node;
usr.sbin/unbound/util/rbtree.c
108
rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/unbound/util/rbtree.c
110
rbnode_type *right = node->right;
usr.sbin/unbound/util/rbtree.c
135
rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/unbound/util/rbtree.c
137
rbnode_type *left = node->left;
usr.sbin/unbound/util/rbtree.c
158
rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node)
usr.sbin/unbound/util/rbtree.c
160
rbnode_type *uncle;
usr.sbin/unbound/util/rbtree.c
227
rbnode_type *
usr.sbin/unbound/util/rbtree.c
228
rbtree_insert (rbtree_type *rbtree, rbnode_type *data)
usr.sbin/unbound/util/rbtree.c
234
rbnode_type *node = rbtree->root;
usr.sbin/unbound/util/rbtree.c
235
rbnode_type *parent = RBTREE_NULL;
usr.sbin/unbound/util/rbtree.c
280
rbnode_type *
usr.sbin/unbound/util/rbtree.c
283
rbnode_type *node;
usr.sbin/unbound/util/rbtree.c
299
static void swap_np(rbnode_type** x, rbnode_type** y)
usr.sbin/unbound/util/rbtree.c
301
rbnode_type* t = *x; *x = *y; *y = t;
usr.sbin/unbound/util/rbtree.c
305
static void change_parent_ptr(rbtree_type* rbtree, rbnode_type* parent,
usr.sbin/unbound/util/rbtree.c
306
rbnode_type* old, rbnode_type* new)
usr.sbin/unbound/util/rbtree.c
320
static void change_child_ptr(rbnode_type* child, rbnode_type* old,
usr.sbin/unbound/util/rbtree.c
321
rbnode_type* new)
usr.sbin/unbound/util/rbtree.c
328
rbnode_type*
usr.sbin/unbound/util/rbtree.c
331
rbnode_type *to_delete;
usr.sbin/unbound/util/rbtree.c
332
rbnode_type *child;
usr.sbin/unbound/util/rbtree.c
340
rbnode_type *smright = to_delete->right;
usr.sbin/unbound/util/rbtree.c
406
static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,
usr.sbin/unbound/util/rbtree.c
407
rbnode_type* child_parent)
usr.sbin/unbound/util/rbtree.c
409
rbnode_type* sibling;
usr.sbin/unbound/util/rbtree.c
512
rbnode_type **result)
usr.sbin/unbound/util/rbtree.c
515
rbnode_type *node;
usr.sbin/unbound/util/rbtree.c
53
rbnode_type rbtree_null_node = {
usr.sbin/unbound/util/rbtree.c
548
rbnode_type *
usr.sbin/unbound/util/rbtree.c
551
rbnode_type *node;
usr.sbin/unbound/util/rbtree.c
557
rbnode_type *
usr.sbin/unbound/util/rbtree.c
560
rbnode_type *node;
usr.sbin/unbound/util/rbtree.c
570
rbnode_type *
usr.sbin/unbound/util/rbtree.c
571
rbtree_next (rbnode_type *node)
usr.sbin/unbound/util/rbtree.c
573
rbnode_type *parent;
usr.sbin/unbound/util/rbtree.c
589
rbnode_type *
usr.sbin/unbound/util/rbtree.c
590
rbtree_previous(rbnode_type *node)
usr.sbin/unbound/util/rbtree.c
592
rbnode_type *parent;
usr.sbin/unbound/util/rbtree.c
610
traverse_post(void (*func)(rbnode_type*, void*), void* arg, rbnode_type* node)
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
69
rbnode_type* child_parent);
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
139
rbnode_type **result);
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
160
rbnode_type *rbtree_next(rbnode_type *rbtree);
usr.sbin/unbound/util/rbtree.h
167
rbnode_type *rbtree_previous(rbnode_type *rbtree);
usr.sbin/unbound/util/rbtree.h
175
(rbnode_type*)node != RBTREE_NULL; \
usr.sbin/unbound/util/rbtree.h
176
node = (type)rbtree_next((rbnode_type*)node))
usr.sbin/unbound/util/rbtree.h
189
void traverse_postorder(rbtree_type* tree, void (*func)(rbnode_type*, void*),
usr.sbin/unbound/util/rbtree.h
51
typedef struct rbnode_type rbnode_type;
usr.sbin/unbound/util/rbtree.h
57
rbnode_type *parent;
usr.sbin/unbound/util/rbtree.h
59
rbnode_type *left;
usr.sbin/unbound/util/rbtree.h
61
rbnode_type *right;
usr.sbin/unbound/util/rbtree.h
71
extern rbnode_type rbtree_null_node;
usr.sbin/unbound/util/rbtree.h
78
rbnode_type *root;
usr.sbin/unbound/util/storage/dnstree.c
124
for(; (rbnode_type*)node != RBTREE_NULL;
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
194
rbnode_type* res = NULL;
usr.sbin/unbound/util/storage/dnstree.c
226
rbnode_type* res = NULL;
usr.sbin/unbound/util/storage/dnstree.c
257
rbnode_type* res = NULL;
usr.sbin/unbound/util/storage/dnstree.c
271
rbnode_type* n;
usr.sbin/unbound/util/storage/dnstree.h
57
rbnode_type node;
usr.sbin/unbound/util/storage/dnstree.h
79
rbnode_type node;
usr.sbin/unbound/util/tcp_conn_limit.c
66
tcl_list_free_node(rbnode_type* node, void* ATTR_UNUSED(arg))
usr.sbin/unbound/util/winsock_event.c
172
while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))
usr.sbin/unbound/util/winsock_event.h
172
rbnode_type node;
usr.sbin/unbound/validator/autotrust.c
2032
rbnode_type* t = rbtree_first(&anchors->autr->probe);
usr.sbin/unbound/validator/autotrust.c
2429
rbnode_type* el;
usr.sbin/unbound/validator/autotrust.h
94
rbnode_type pnode;
usr.sbin/unbound/validator/val_anchor.c
1142
rbnode_type* res = NULL;
usr.sbin/unbound/validator/val_anchor.c
116
anchors_delfunc(rbnode_type* elem, void* ATTR_UNUSED(arg))
usr.sbin/unbound/validator/val_anchor.c
1371
while((rbnode_type*)ta != RBTREE_NULL) {
usr.sbin/unbound/validator/val_anchor.c
201
rbnode_type* n;
usr.sbin/unbound/validator/val_anchor.c
225
rbnode_type* r;
usr.sbin/unbound/validator/val_anchor.c
997
while((rbnode_type*)ta != RBTREE_NULL) {
usr.sbin/unbound/validator/val_anchor.h
94
rbnode_type node;
usr.sbin/unbound/validator/val_neg.c
1153
data = (struct val_neg_data*)rbtree_previous((rbnode_type*)data);
usr.sbin/unbound/validator/val_neg.c
1154
if((rbnode_type*)data == RBTREE_NULL || !data->in_use) {
usr.sbin/unbound/validator/val_neg.c
121
neg_clear_datas(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/validator/val_neg.c
130
neg_clear_zones(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/validator/val_neg.c
382
rbnode_type* res = NULL;
usr.sbin/unbound/validator/val_neg.c
422
rbnode_type* res = NULL;
usr.sbin/unbound/validator/val_neg.c
688
rbnode_type* walk, *next;
usr.sbin/unbound/validator/val_neg.c
964
rbnode_type* r;
usr.sbin/unbound/validator/val_neg.h
144
rbnode_type node;
usr.sbin/unbound/validator/val_neg.h
96
rbnode_type node;
usr.sbin/unbound/validator/val_nsec3.c
719
rbnode_type* n;
usr.sbin/unbound/validator/val_nsec3.h
267
rbnode_type node;
usr.sbin/unbound/validator/val_sigcrypt.c
774
rbnode_type node;