Searched refs:RBTREE_NULL (Results 1 - 25 of 25) sorted by relevance
/netbsd-current/external/bsd/unbound/dist/util/ |
H A D | rbtree.c | 54 RBTREE_NULL, /* Parent. */ 55 RBTREE_NULL, /* Left. */ 56 RBTREE_NULL, /* Right. */ 98 rbtree->root = RBTREE_NULL; 112 if (right->left != RBTREE_NULL) 117 if (node->parent != RBTREE_NULL) { 139 if (left->right != RBTREE_NULL) 144 if (node->parent != RBTREE_NULL) { 235 rbnode_type *parent = RBTREE_NULL; 239 while (node != RBTREE_NULL) { [all...] |
H A D | rbtree.h | 56 /** parent in rbtree, RBTREE_NULL for root */ 69 #define RBTREE_NULL &rbtree_null_node macro 175 (rbnode_type*)node != RBTREE_NULL; \
|
H A D | mini_event.c | 154 !=RBTREE_NULL) {
|
H A D | winsock_event.c | 173 !=RBTREE_NULL) {
|
/netbsd-current/external/bsd/nsd/dist/ |
H A D | rbtree.c | 21 RBTREE_NULL, /* Parent. */ 22 RBTREE_NULL, /* Left. */ 23 RBTREE_NULL, /* Right. */ 51 rbtree->root = RBTREE_NULL; 68 if (right->left != RBTREE_NULL) 73 if (node->parent != RBTREE_NULL) { 95 if (left->right != RBTREE_NULL) 100 if (node->parent != RBTREE_NULL) { 191 rbnode_type *parent = RBTREE_NULL; 194 while (node != RBTREE_NULL) { [all...] |
H A D | rbtree.h | 29 #define RBTREE_NULL &rbtree_null_node macro 66 (rbtree)->_node != RBTREE_NULL && ((k) = (rbtree)->_node->key) && \ 73 (rbnode_type*)node != RBTREE_NULL; \
|
H A D | nsec3.c | 339 if(r != RBTREE_NULL) { 367 * for(n=rbtree_first(tree); n!=RBTREE_NULL; n=rbtree_next(n)) { 372 tree->root = RBTREE_NULL; 677 *p = RBTREE_NULL; 711 *p = RBTREE_NULL; 744 rbnode_type *p = RBTREE_NULL, *pwc = RBTREE_NULL, *pds = RBTREE_NULL; 745 rbnode_type *p_end = RBTREE_NULL, *pwc_end = RBTREE_NULL, *pds_en [all...] |
H A D | namedb.h | 299 return prev == RBTREE_NULL ? NULL : (domain_type *) prev; 311 return next == RBTREE_NULL ? NULL : (domain_type *) next;
|
H A D | ixfr.c | 87 pcomp->tree.root = RBTREE_NULL; 101 pcomp->tree.root = RBTREE_NULL; 520 if(!n || n == (struct ixfr_data*)RBTREE_NULL) 533 if(!n || n == (struct ixfr_data*)RBTREE_NULL) 543 if(!cur || cur == (struct ixfr_data*)RBTREE_NULL) 548 if(n && n != (struct ixfr_data*)RBTREE_NULL && 559 if(!n || n == (struct ixfr_data*)RBTREE_NULL) 569 if(!cur || cur == (struct ixfr_data*)RBTREE_NULL) 574 if(!prev || prev == (struct ixfr_data*)RBTREE_NULL) { 579 while(prev && prev != (struct ixfr_data*)RBTREE_NULL) { [all...] |
H A D | xfrd-tcp.c | 250 if(node == NULL || node == RBTREE_NULL) 269 tp->zone_per_id->root = RBTREE_NULL; 321 if(n && n != RBTREE_NULL) { 355 if(node && node != RBTREE_NULL) { 372 if(n && n != RBTREE_NULL) {
|
H A D | mini_event.c | 170 !=RBTREE_NULL) {
|
H A D | xfrd-disk.c | 487 for(p = rbtree_first(xfrd->zones); p && p!=RBTREE_NULL; p=rbtree_next(p))
|
H A D | options.c | 364 b->node = *RBTREE_NULL; 645 if(!b || (rbnode_type*)b==RBTREE_NULL) 731 opt->zonefree->root = RBTREE_NULL; 806 zone->node = *RBTREE_NULL; 869 p->node = *RBTREE_NULL;
|
H A D | remote.c | 1525 while((rbnode_type*)k != RBTREE_NULL) { 1734 while((rbnode_type*)p != RBTREE_NULL) {
|
/netbsd-current/external/bsd/unbound/dist/util/storage/ |
H A D | dnstree.c | 124 for(; (rbnode_type*)node != RBTREE_NULL; 276 if(n == RBTREE_NULL) 301 if(!n || n == RBTREE_NULL) 304 if(n == RBTREE_NULL)
|
/netbsd-current/external/bsd/unbound/dist/testcode/ |
H A D | unitneg.c | 265 while(i!=n+1 && walk && walk != RBTREE_NULL && !z->in_use) { 271 if(!walk || walk == RBTREE_NULL) { 291 while(i!=n+1 && walk && walk != RBTREE_NULL && !d->in_use) { 297 if(!walk || walk == RBTREE_NULL) { 329 if(d && (rbnode_type*)d!=RBTREE_NULL)
|
/netbsd-current/external/bsd/unbound/dist/iterator/ |
H A D | iter_fwd.c | 413 if(n == RBTREE_NULL) 438 if(!n || n == RBTREE_NULL) 441 if(n == RBTREE_NULL)
|
/netbsd-current/external/bsd/unbound/dist/services/ |
H A D | outside_network.c | 544 outnet->tcp_reuse.root == RBTREE_NULL) 563 if(!result || result == RBTREE_NULL) 582 while(prev && prev != RBTREE_NULL && 589 while(result && result != RBTREE_NULL && 1164 tree_by_id->root == RBTREE_NULL) 1211 tree_by_id->root == RBTREE_NULL) 1214 while(node && node != RBTREE_NULL) { 1252 if(store.root != NULL && store.root != RBTREE_NULL) { 2371 log_assert(node && node != RBTREE_NULL); /* tree not empty */ 2377 while(node && node != RBTREE_NULL) { [all...] |
H A D | mesh.c | 836 mstate->node = *RBTREE_NULL; 837 mstate->run_node = *RBTREE_NULL;
|
H A D | localzone.c | 2007 while(p!=(struct local_zone*)RBTREE_NULL && 2110 if(n == (struct local_data*)RBTREE_NULL)
|
H A D | authzone.c | 2616 while(next && (rbnode_type*)next != RBTREE_NULL && next->rrsets == NULL) { 2621 if((rbnode_type*)next == RBTREE_NULL || !next) { 2937 while(node && (rbnode_type*)node != RBTREE_NULL && 2941 if((rbnode_type*)node == RBTREE_NULL) 2963 while(node && (rbnode_type*)node != RBTREE_NULL && 2967 if((rbnode_type*)node == RBTREE_NULL)
|
/netbsd-current/external/bsd/unbound/dist/validator/ |
H A D | val_sigcrypt.c | 1235 while(p1 != (struct canon_rr*)RBTREE_NULL && 1236 p2 != (struct canon_rr*)RBTREE_NULL) {
|
H A D | val_anchor.c | 994 while((rbnode_type*)ta != RBTREE_NULL) { 1332 while((rbnode_type*)ta != RBTREE_NULL) {
|
H A D | val_neg.c | 710 while(walk && walk != RBTREE_NULL) { 1146 if((rbnode_type*)data == RBTREE_NULL || !data->in_use) {
|
H A D | autotrust.c | 2028 if(t != RBTREE_NULL) 2410 if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) {
|
Completed in 345 milliseconds