Symbol: RBTREE_NULL
sbin/unwind/libunbound/iterator/iter_fwd.c
493
if(n == RBTREE_NULL)
sbin/unwind/libunbound/iterator/iter_fwd.c
518
if(!n || n == RBTREE_NULL)
sbin/unwind/libunbound/iterator/iter_fwd.c
521
if(n == RBTREE_NULL)
sbin/unwind/libunbound/services/authzone.c
2619
while(next && (rbnode_type*)next != RBTREE_NULL && next->rrsets == NULL) {
sbin/unwind/libunbound/services/authzone.c
2624
if((rbnode_type*)next == RBTREE_NULL || !next) {
sbin/unwind/libunbound/services/authzone.c
2937
while(node && (rbnode_type*)node != RBTREE_NULL &&
sbin/unwind/libunbound/services/authzone.c
2941
if((rbnode_type*)node == RBTREE_NULL)
sbin/unwind/libunbound/services/authzone.c
2963
while(node && (rbnode_type*)node != RBTREE_NULL &&
sbin/unwind/libunbound/services/authzone.c
2967
if((rbnode_type*)node == RBTREE_NULL)
sbin/unwind/libunbound/services/localzone.c
2024
while(p!=(struct local_zone*)RBTREE_NULL &&
sbin/unwind/libunbound/services/localzone.c
2131
if(n == (struct local_data*)RBTREE_NULL)
sbin/unwind/libunbound/services/mesh.c
979
mstate->node = *RBTREE_NULL;
sbin/unwind/libunbound/services/mesh.c
980
mstate->run_node = *RBTREE_NULL;
sbin/unwind/libunbound/services/outside_network.c
1179
tree_by_id->root == RBTREE_NULL)
sbin/unwind/libunbound/services/outside_network.c
1226
tree_by_id->root == RBTREE_NULL)
sbin/unwind/libunbound/services/outside_network.c
1229
while(node && node != RBTREE_NULL) {
sbin/unwind/libunbound/services/outside_network.c
1267
if(store.root != NULL && store.root != RBTREE_NULL) {
sbin/unwind/libunbound/services/outside_network.c
2397
log_assert(node && node != RBTREE_NULL); /* tree not empty */
sbin/unwind/libunbound/services/outside_network.c
2403
while(node && node != RBTREE_NULL) {
sbin/unwind/libunbound/services/outside_network.c
2405
if(next && next != RBTREE_NULL) {
sbin/unwind/libunbound/services/outside_network.c
2427
log_assert(node && node != RBTREE_NULL); /* tree not empty */
sbin/unwind/libunbound/services/outside_network.c
558
outnet->tcp_reuse.root == RBTREE_NULL)
sbin/unwind/libunbound/services/outside_network.c
577
if(!result || result == RBTREE_NULL)
sbin/unwind/libunbound/services/outside_network.c
596
while(prev && prev != RBTREE_NULL &&
sbin/unwind/libunbound/services/outside_network.c
603
while(result && result != RBTREE_NULL &&
sbin/unwind/libunbound/util/mini_event.c
151
!=RBTREE_NULL) {
sbin/unwind/libunbound/util/netevent.c
2440
if(node && node != RBTREE_NULL) {
sbin/unwind/libunbound/util/rbtree.c
112
if (right->left != RBTREE_NULL)
sbin/unwind/libunbound/util/rbtree.c
117
if (node->parent != RBTREE_NULL) {
sbin/unwind/libunbound/util/rbtree.c
139
if (left->right != RBTREE_NULL)
sbin/unwind/libunbound/util/rbtree.c
144
if (node->parent != RBTREE_NULL) {
sbin/unwind/libunbound/util/rbtree.c
235
rbnode_type *parent = RBTREE_NULL;
sbin/unwind/libunbound/util/rbtree.c
239
while (node != RBTREE_NULL) {
sbin/unwind/libunbound/util/rbtree.c
255
data->left = data->right = RBTREE_NULL;
sbin/unwind/libunbound/util/rbtree.c
260
if (parent != RBTREE_NULL) {
sbin/unwind/libunbound/util/rbtree.c
308
if(parent == RBTREE_NULL)
sbin/unwind/libunbound/util/rbtree.c
323
if(child == RBTREE_NULL) return;
sbin/unwind/libunbound/util/rbtree.c
337
if(to_delete->left != RBTREE_NULL && to_delete->right != RBTREE_NULL)
sbin/unwind/libunbound/util/rbtree.c
341
while(smright->left != RBTREE_NULL)
sbin/unwind/libunbound/util/rbtree.c
378
log_assert(to_delete->left == RBTREE_NULL || to_delete->right == RBTREE_NULL);
sbin/unwind/libunbound/util/rbtree.c
380
if(to_delete->left != RBTREE_NULL) child = to_delete->left;
sbin/unwind/libunbound/util/rbtree.c
394
if(child!=RBTREE_NULL) child->color = BLACK;
sbin/unwind/libunbound/util/rbtree.c
399
to_delete->parent = RBTREE_NULL;
sbin/unwind/libunbound/util/rbtree.c
400
to_delete->left = RBTREE_NULL;
sbin/unwind/libunbound/util/rbtree.c
401
to_delete->right = RBTREE_NULL;
sbin/unwind/libunbound/util/rbtree.c
418
if(child_parent == RBTREE_NULL)
sbin/unwind/libunbound/util/rbtree.c
441
if(sibling != RBTREE_NULL)
sbin/unwind/libunbound/util/rbtree.c
459
if(sibling != RBTREE_NULL)
sbin/unwind/libunbound/util/rbtree.c
464
log_assert(sibling != RBTREE_NULL);
sbin/unwind/libunbound/util/rbtree.c
526
while (node != RBTREE_NULL) {
sbin/unwind/libunbound/util/rbtree.c
54
RBTREE_NULL, /* Parent. */
sbin/unwind/libunbound/util/rbtree.c
55
RBTREE_NULL, /* Left. */
sbin/unwind/libunbound/util/rbtree.c
553
for (node = rbtree->root; node->left != RBTREE_NULL; node = node->left);
sbin/unwind/libunbound/util/rbtree.c
56
RBTREE_NULL, /* Right. */
sbin/unwind/libunbound/util/rbtree.c
562
for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right);
sbin/unwind/libunbound/util/rbtree.c
575
if (node->right != RBTREE_NULL) {
sbin/unwind/libunbound/util/rbtree.c
577
for (node = node->right; node->left != RBTREE_NULL; node = node->left);
sbin/unwind/libunbound/util/rbtree.c
580
while (parent != RBTREE_NULL && node == parent->right) {
sbin/unwind/libunbound/util/rbtree.c
594
if (node->left != RBTREE_NULL) {
sbin/unwind/libunbound/util/rbtree.c
596
for (node = node->left; node->right != RBTREE_NULL; node = node->right);
sbin/unwind/libunbound/util/rbtree.c
599
while (parent != RBTREE_NULL && node == parent->left) {
sbin/unwind/libunbound/util/rbtree.c
612
if(!node || node == RBTREE_NULL)
sbin/unwind/libunbound/util/rbtree.c
98
rbtree->root = RBTREE_NULL;
sbin/unwind/libunbound/util/rbtree.h
175
(rbnode_type*)node != RBTREE_NULL; \
sbin/unwind/libunbound/util/storage/dnstree.c
124
for(; (rbnode_type*)node != RBTREE_NULL;
sbin/unwind/libunbound/util/storage/dnstree.c
276
if(n == RBTREE_NULL)
sbin/unwind/libunbound/util/storage/dnstree.c
301
if(!n || n == RBTREE_NULL)
sbin/unwind/libunbound/util/storage/dnstree.c
304
if(n == RBTREE_NULL)
sbin/unwind/libunbound/util/winsock_event.c
173
!=RBTREE_NULL) {
sbin/unwind/libunbound/validator/autotrust.c
2037
if(t != RBTREE_NULL)
sbin/unwind/libunbound/validator/autotrust.c
2436
if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) {
sbin/unwind/libunbound/validator/val_anchor.c
1371
while((rbnode_type*)ta != RBTREE_NULL) {
sbin/unwind/libunbound/validator/val_anchor.c
997
while((rbnode_type*)ta != RBTREE_NULL) {
sbin/unwind/libunbound/validator/val_neg.c
1147
if((rbnode_type*)data == RBTREE_NULL || !data->in_use) {
sbin/unwind/libunbound/validator/val_neg.c
710
while(walk && walk != RBTREE_NULL) {
sbin/unwind/libunbound/validator/val_sigcrypt.c
1237
while(p1 != (struct canon_rr*)RBTREE_NULL &&
sbin/unwind/libunbound/validator/val_sigcrypt.c
1238
p2 != (struct canon_rr*)RBTREE_NULL) {
usr.sbin/nsd/ixfr.c
102
pcomp->tree.root = RBTREE_NULL;
usr.sbin/nsd/ixfr.c
1482
if(node == NULL || node == RBTREE_NULL)
usr.sbin/nsd/ixfr.c
1496
ixfr->data->root = RBTREE_NULL;
usr.sbin/nsd/ixfr.c
521
if(!n || n == (struct ixfr_data*)RBTREE_NULL)
usr.sbin/nsd/ixfr.c
534
if(!n || n == (struct ixfr_data*)RBTREE_NULL)
usr.sbin/nsd/ixfr.c
544
if(!cur || cur == (struct ixfr_data*)RBTREE_NULL)
usr.sbin/nsd/ixfr.c
549
if(n && n != (struct ixfr_data*)RBTREE_NULL &&
usr.sbin/nsd/ixfr.c
560
if(!n || n == (struct ixfr_data*)RBTREE_NULL)
usr.sbin/nsd/ixfr.c
570
if(!cur || cur == (struct ixfr_data*)RBTREE_NULL)
usr.sbin/nsd/ixfr.c
575
if(!prev || prev == (struct ixfr_data*)RBTREE_NULL) {
usr.sbin/nsd/ixfr.c
580
while(prev && prev != (struct ixfr_data*)RBTREE_NULL) {
usr.sbin/nsd/ixfr.c
599
if(!prev || prev == (struct ixfr_data*)RBTREE_NULL) {
usr.sbin/nsd/ixfr.c
88
pcomp->tree.root = RBTREE_NULL;
usr.sbin/nsd/mini_event.c
170
!=RBTREE_NULL) {
usr.sbin/nsd/namedb.h
321
return prev == RBTREE_NULL ? NULL : (domain_type *) prev;
usr.sbin/nsd/namedb.h
333
return next == RBTREE_NULL ? NULL : (domain_type *) next;
usr.sbin/nsd/nsec3.c
354
if(r != RBTREE_NULL) {
usr.sbin/nsd/nsec3.c
387
tree->root = RBTREE_NULL;
usr.sbin/nsd/nsec3.c
706
*p = RBTREE_NULL;
usr.sbin/nsd/nsec3.c
740
*p = RBTREE_NULL;
usr.sbin/nsd/nsec3.c
773
rbnode_type *p = RBTREE_NULL, *pwc = RBTREE_NULL, *pds = RBTREE_NULL;
usr.sbin/nsd/nsec3.c
774
rbnode_type *p_end = RBTREE_NULL, *pwc_end = RBTREE_NULL, *pds_end = RBTREE_NULL;
usr.sbin/nsd/nsec3.c
813
while(p != RBTREE_NULL && p != p_end) {
usr.sbin/nsd/nsec3.c
818
while(pwc != RBTREE_NULL && pwc != pwc_end) {
usr.sbin/nsd/nsec3.c
823
while(pds != RBTREE_NULL && pds != pds_end) {
usr.sbin/nsd/nsec3.c
846
if(nx != RBTREE_NULL) {
usr.sbin/nsd/options.c
1018
zone->node = *RBTREE_NULL;
usr.sbin/nsd/options.c
1032
member_zone->options.node = *RBTREE_NULL;
usr.sbin/nsd/options.c
1038
member_zone->node = *RBTREE_NULL;
usr.sbin/nsd/options.c
1098
p->node = *RBTREE_NULL;
usr.sbin/nsd/options.c
451
b->node = *RBTREE_NULL;
usr.sbin/nsd/options.c
666
assert(!memcmp(&member_zone->node, RBTREE_NULL, sizeof(*RBTREE_NULL)));
usr.sbin/nsd/options.c
846
if(!b || (rbnode_type*)b==RBTREE_NULL)
usr.sbin/nsd/options.c
943
opt->zonefree->root = RBTREE_NULL;
usr.sbin/nsd/rbtree.c
107
if (left->right != RBTREE_NULL)
usr.sbin/nsd/rbtree.c
112
if (node->parent != RBTREE_NULL) {
usr.sbin/nsd/rbtree.c
21
RBTREE_NULL, /* Parent. */
usr.sbin/nsd/rbtree.c
215
parent = RBTREE_NULL;
usr.sbin/nsd/rbtree.c
218
while (node != RBTREE_NULL) {
usr.sbin/nsd/rbtree.c
22
RBTREE_NULL, /* Left. */
usr.sbin/nsd/rbtree.c
23
RBTREE_NULL, /* Right. */
usr.sbin/nsd/rbtree.c
234
data->left = data->right = RBTREE_NULL;
usr.sbin/nsd/rbtree.c
239
if (parent != RBTREE_NULL) {
usr.sbin/nsd/rbtree.c
294
if(parent == RBTREE_NULL)
usr.sbin/nsd/rbtree.c
307
if(child == RBTREE_NULL) return;
usr.sbin/nsd/rbtree.c
327
if(to_delete->left != RBTREE_NULL && to_delete->right != RBTREE_NULL)
usr.sbin/nsd/rbtree.c
331
while(smright->left != RBTREE_NULL)
usr.sbin/nsd/rbtree.c
368
assert(to_delete->left == RBTREE_NULL || to_delete->right == RBTREE_NULL);
usr.sbin/nsd/rbtree.c
370
if(to_delete->left != RBTREE_NULL) child = to_delete->left;
usr.sbin/nsd/rbtree.c
384
if(child!=RBTREE_NULL) child->color = BLACK;
usr.sbin/nsd/rbtree.c
389
to_delete->parent = RBTREE_NULL;
usr.sbin/nsd/rbtree.c
390
to_delete->left = RBTREE_NULL;
usr.sbin/nsd/rbtree.c
391
to_delete->right = RBTREE_NULL;
usr.sbin/nsd/rbtree.c
412
if(child_parent == RBTREE_NULL)
usr.sbin/nsd/rbtree.c
435
if(sibling != RBTREE_NULL)
usr.sbin/nsd/rbtree.c
453
if(sibling != RBTREE_NULL)
usr.sbin/nsd/rbtree.c
458
assert(sibling != RBTREE_NULL);
usr.sbin/nsd/rbtree.c
51
rbtree->root = RBTREE_NULL;
usr.sbin/nsd/rbtree.c
524
while (node != RBTREE_NULL) {
usr.sbin/nsd/rbtree.c
556
for (node = rbtree->root; node->left != RBTREE_NULL; node = node->left);
usr.sbin/nsd/rbtree.c
570
for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right);
usr.sbin/nsd/rbtree.c
583
if (node->right != RBTREE_NULL) {
usr.sbin/nsd/rbtree.c
585
for (node = node->right; node->left != RBTREE_NULL; node = node->left);
usr.sbin/nsd/rbtree.c
588
while (parent != RBTREE_NULL && node == parent->right) {
usr.sbin/nsd/rbtree.c
602
if (node->left != RBTREE_NULL) {
usr.sbin/nsd/rbtree.c
604
for (node = node->left; node->right != RBTREE_NULL; node = node->right);
usr.sbin/nsd/rbtree.c
607
while (parent != RBTREE_NULL && node == parent->left) {
usr.sbin/nsd/rbtree.c
74
if (right->left != RBTREE_NULL)
usr.sbin/nsd/rbtree.c
79
if (node->parent != RBTREE_NULL) {
usr.sbin/nsd/rbtree.h
66
(rbtree)->_node != RBTREE_NULL && ((k) = (rbtree)->_node->key) && \
usr.sbin/nsd/rbtree.h
73
(rbnode_type*)node != RBTREE_NULL; \
usr.sbin/nsd/remote.c
1636
while((rbnode_type*)k != RBTREE_NULL) {
usr.sbin/nsd/remote.c
1953
while((rbnode_type*)p != RBTREE_NULL) {
usr.sbin/nsd/xfrd-catalog-zones.c
1021
cmz->node = *RBTREE_NULL;
usr.sbin/nsd/xfrd-catalog-zones.c
202
consumer_zone->member_ids.root = RBTREE_NULL;
usr.sbin/nsd/xfrd-catalog-zones.c
369
consumer_member_zone->node = *RBTREE_NULL;
usr.sbin/nsd/xfrd-catalog-zones.c
465
{ return node != RBTREE_NULL ? (struct catalog_member_zone*)node->key : NULL; }
usr.sbin/nsd/xfrd-catalog-zones.c
477
; cursor != RBTREE_NULL; i++, cursor = rbtree_next(cursor)) {
usr.sbin/nsd/xfrd-catalog-zones.c
677
if (cursor == RBTREE_NULL)
usr.sbin/nsd/xfrd-catalog-zones.c
692
while (cursor != RBTREE_NULL &&
usr.sbin/nsd/xfrd-catalog-zones.c
715
if(cursor != RBTREE_NULL) {
usr.sbin/nsd/xfrd-catalog-zones.c
724
if (cursor != RBTREE_NULL && cmp == 0) {
usr.sbin/nsd/xfrd-catalog-zones.c
796
assert(cursor == RBTREE_NULL || cmp < 0);
usr.sbin/nsd/xfrd-catalog-zones.c
877
while (cursor != RBTREE_NULL) {
usr.sbin/nsd/xfrd-catalog-zones.c
948
producer_zone->member_ids.root = RBTREE_NULL;
usr.sbin/nsd/xfrd-disk.c
491
for(p = rbtree_first(xfrd->zones); p && p!=RBTREE_NULL; p=rbtree_next(p))
usr.sbin/nsd/xfrd-tcp.c
341
if(node == NULL || node == RBTREE_NULL)
usr.sbin/nsd/xfrd-tcp.c
360
tp->zone_per_id->root = RBTREE_NULL;
usr.sbin/nsd/xfrd-tcp.c
412
if(n && n != RBTREE_NULL) {
usr.sbin/nsd/xfrd-tcp.c
446
if(node && node != RBTREE_NULL) {
usr.sbin/nsd/xfrd-tcp.c
463
if(n && n != RBTREE_NULL) {
usr.sbin/unbound/iterator/iter_fwd.c
493
if(n == RBTREE_NULL)
usr.sbin/unbound/iterator/iter_fwd.c
518
if(!n || n == RBTREE_NULL)
usr.sbin/unbound/iterator/iter_fwd.c
521
if(n == RBTREE_NULL)
usr.sbin/unbound/services/authzone.c
2619
while(next && (rbnode_type*)next != RBTREE_NULL && next->rrsets == NULL) {
usr.sbin/unbound/services/authzone.c
2624
if((rbnode_type*)next == RBTREE_NULL || !next) {
usr.sbin/unbound/services/authzone.c
2937
while(node && (rbnode_type*)node != RBTREE_NULL &&
usr.sbin/unbound/services/authzone.c
2941
if((rbnode_type*)node == RBTREE_NULL)
usr.sbin/unbound/services/authzone.c
2963
while(node && (rbnode_type*)node != RBTREE_NULL &&
usr.sbin/unbound/services/authzone.c
2967
if((rbnode_type*)node == RBTREE_NULL)
usr.sbin/unbound/services/localzone.c
2024
while(p!=(struct local_zone*)RBTREE_NULL &&
usr.sbin/unbound/services/localzone.c
2131
if(n == (struct local_data*)RBTREE_NULL)
usr.sbin/unbound/services/mesh.c
979
mstate->node = *RBTREE_NULL;
usr.sbin/unbound/services/mesh.c
980
mstate->run_node = *RBTREE_NULL;
usr.sbin/unbound/services/outside_network.c
1179
tree_by_id->root == RBTREE_NULL)
usr.sbin/unbound/services/outside_network.c
1226
tree_by_id->root == RBTREE_NULL)
usr.sbin/unbound/services/outside_network.c
1229
while(node && node != RBTREE_NULL) {
usr.sbin/unbound/services/outside_network.c
1267
if(store.root != NULL && store.root != RBTREE_NULL) {
usr.sbin/unbound/services/outside_network.c
2397
log_assert(node && node != RBTREE_NULL); /* tree not empty */
usr.sbin/unbound/services/outside_network.c
2403
while(node && node != RBTREE_NULL) {
usr.sbin/unbound/services/outside_network.c
2405
if(next && next != RBTREE_NULL) {
usr.sbin/unbound/services/outside_network.c
2427
log_assert(node && node != RBTREE_NULL); /* tree not empty */
usr.sbin/unbound/services/outside_network.c
558
outnet->tcp_reuse.root == RBTREE_NULL)
usr.sbin/unbound/services/outside_network.c
577
if(!result || result == RBTREE_NULL)
usr.sbin/unbound/services/outside_network.c
596
while(prev && prev != RBTREE_NULL &&
usr.sbin/unbound/services/outside_network.c
603
while(result && result != RBTREE_NULL &&
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/unitneg.c
265
while(i!=n+1 && walk && walk != RBTREE_NULL && !z->in_use) {
usr.sbin/unbound/testcode/unitneg.c
271
if(!walk || walk == RBTREE_NULL) {
usr.sbin/unbound/testcode/unitneg.c
291
while(i!=n+1 && walk && walk != RBTREE_NULL && !d->in_use) {
usr.sbin/unbound/testcode/unitneg.c
297
if(!walk || walk == RBTREE_NULL) {
usr.sbin/unbound/testcode/unitneg.c
329
if(d && (rbnode_type*)d!=RBTREE_NULL)
usr.sbin/unbound/util/mini_event.c
151
!=RBTREE_NULL) {
usr.sbin/unbound/util/netevent.c
2440
if(node && node != RBTREE_NULL) {
usr.sbin/unbound/util/rbtree.c
112
if (right->left != RBTREE_NULL)
usr.sbin/unbound/util/rbtree.c
117
if (node->parent != RBTREE_NULL) {
usr.sbin/unbound/util/rbtree.c
139
if (left->right != RBTREE_NULL)
usr.sbin/unbound/util/rbtree.c
144
if (node->parent != RBTREE_NULL) {
usr.sbin/unbound/util/rbtree.c
235
rbnode_type *parent = RBTREE_NULL;
usr.sbin/unbound/util/rbtree.c
239
while (node != RBTREE_NULL) {
usr.sbin/unbound/util/rbtree.c
255
data->left = data->right = RBTREE_NULL;
usr.sbin/unbound/util/rbtree.c
260
if (parent != RBTREE_NULL) {
usr.sbin/unbound/util/rbtree.c
308
if(parent == RBTREE_NULL)
usr.sbin/unbound/util/rbtree.c
323
if(child == RBTREE_NULL) return;
usr.sbin/unbound/util/rbtree.c
337
if(to_delete->left != RBTREE_NULL && to_delete->right != RBTREE_NULL)
usr.sbin/unbound/util/rbtree.c
341
while(smright->left != RBTREE_NULL)
usr.sbin/unbound/util/rbtree.c
378
log_assert(to_delete->left == RBTREE_NULL || to_delete->right == RBTREE_NULL);
usr.sbin/unbound/util/rbtree.c
380
if(to_delete->left != RBTREE_NULL) child = to_delete->left;
usr.sbin/unbound/util/rbtree.c
394
if(child!=RBTREE_NULL) child->color = BLACK;
usr.sbin/unbound/util/rbtree.c
399
to_delete->parent = RBTREE_NULL;
usr.sbin/unbound/util/rbtree.c
400
to_delete->left = RBTREE_NULL;
usr.sbin/unbound/util/rbtree.c
401
to_delete->right = RBTREE_NULL;
usr.sbin/unbound/util/rbtree.c
418
if(child_parent == RBTREE_NULL)
usr.sbin/unbound/util/rbtree.c
441
if(sibling != RBTREE_NULL)
usr.sbin/unbound/util/rbtree.c
459
if(sibling != RBTREE_NULL)
usr.sbin/unbound/util/rbtree.c
464
log_assert(sibling != RBTREE_NULL);
usr.sbin/unbound/util/rbtree.c
526
while (node != RBTREE_NULL) {
usr.sbin/unbound/util/rbtree.c
54
RBTREE_NULL, /* Parent. */
usr.sbin/unbound/util/rbtree.c
55
RBTREE_NULL, /* Left. */
usr.sbin/unbound/util/rbtree.c
553
for (node = rbtree->root; node->left != RBTREE_NULL; node = node->left);
usr.sbin/unbound/util/rbtree.c
56
RBTREE_NULL, /* Right. */
usr.sbin/unbound/util/rbtree.c
562
for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right);
usr.sbin/unbound/util/rbtree.c
575
if (node->right != RBTREE_NULL) {
usr.sbin/unbound/util/rbtree.c
577
for (node = node->right; node->left != RBTREE_NULL; node = node->left);
usr.sbin/unbound/util/rbtree.c
580
while (parent != RBTREE_NULL && node == parent->right) {
usr.sbin/unbound/util/rbtree.c
594
if (node->left != RBTREE_NULL) {
usr.sbin/unbound/util/rbtree.c
596
for (node = node->left; node->right != RBTREE_NULL; node = node->right);
usr.sbin/unbound/util/rbtree.c
599
while (parent != RBTREE_NULL && node == parent->left) {
usr.sbin/unbound/util/rbtree.c
612
if(!node || node == RBTREE_NULL)
usr.sbin/unbound/util/rbtree.c
98
rbtree->root = RBTREE_NULL;
usr.sbin/unbound/util/rbtree.h
175
(rbnode_type*)node != RBTREE_NULL; \
usr.sbin/unbound/util/storage/dnstree.c
124
for(; (rbnode_type*)node != RBTREE_NULL;
usr.sbin/unbound/util/storage/dnstree.c
276
if(n == RBTREE_NULL)
usr.sbin/unbound/util/storage/dnstree.c
301
if(!n || n == RBTREE_NULL)
usr.sbin/unbound/util/storage/dnstree.c
304
if(n == RBTREE_NULL)
usr.sbin/unbound/util/winsock_event.c
173
!=RBTREE_NULL) {
usr.sbin/unbound/validator/autotrust.c
2033
if(t != RBTREE_NULL)
usr.sbin/unbound/validator/autotrust.c
2432
if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) {
usr.sbin/unbound/validator/val_anchor.c
1371
while((rbnode_type*)ta != RBTREE_NULL) {
usr.sbin/unbound/validator/val_anchor.c
997
while((rbnode_type*)ta != RBTREE_NULL) {
usr.sbin/unbound/validator/val_neg.c
1147
if((rbnode_type*)data == RBTREE_NULL || !data->in_use) {
usr.sbin/unbound/validator/val_neg.c
710
while(walk && walk != RBTREE_NULL) {
usr.sbin/unbound/validator/val_sigcrypt.c
1237
while(p1 != (struct canon_rr*)RBTREE_NULL &&
usr.sbin/unbound/validator/val_sigcrypt.c
1238
p2 != (struct canon_rr*)RBTREE_NULL) {