Searched refs:RBTREE_NULL (Results 1 - 12 of 12) sorted by relevance

/freebsd-10-stable/contrib/unbound/util/
H A Drbtree.c54 RBTREE_NULL, /* Parent. */
55 RBTREE_NULL, /* Left. */
56 RBTREE_NULL, /* Right. */
97 rbtree->root = RBTREE_NULL;
111 if (right->left != RBTREE_NULL)
116 if (node->parent != RBTREE_NULL) {
138 if (left->right != RBTREE_NULL)
143 if (node->parent != RBTREE_NULL) {
234 rbnode_t *parent = RBTREE_NULL;
238 while (node != RBTREE_NULL) {
[all...]
H A Drbtree.h56 /** parent in rbtree, RBTREE_NULL for root */
69 #define RBTREE_NULL &rbtree_null_node macro
175 (rbnode_t*)node != RBTREE_NULL; \
H A Dmini_event.c151 !=RBTREE_NULL) {
H A Dwinsock_event.c173 !=RBTREE_NULL) {
/freebsd-10-stable/contrib/unbound/util/storage/
H A Ddnstree.c243 if(n == RBTREE_NULL)
268 if(!n || n == RBTREE_NULL)
271 if(n == RBTREE_NULL)
/freebsd-10-stable/contrib/unbound/iterator/
H A Diter_fwd.c393 if(n == RBTREE_NULL)
418 if(!n || n == RBTREE_NULL)
421 if(n == RBTREE_NULL)
/freebsd-10-stable/contrib/unbound/services/
H A Dmesh.c514 mstate->node = *RBTREE_NULL;
515 mstate->run_node = *RBTREE_NULL;
H A Dlocalzone.c1185 while(p!=(struct local_zone*)RBTREE_NULL &&
1285 if(n == (struct local_data*)RBTREE_NULL)
/freebsd-10-stable/contrib/unbound/validator/
H A Dval_sigcrypt.c1093 while(p1 != (struct canon_rr*)RBTREE_NULL &&
1094 p2 != (struct canon_rr*)RBTREE_NULL) {
H A Dval_anchor.c993 while((rbnode_t*)ta != RBTREE_NULL) {
H A Dautotrust.c1991 if(t != RBTREE_NULL)
2365 if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) {
H A Dval_neg.c709 while(walk && walk != RBTREE_NULL) {

Completed in 195 milliseconds