Home
last modified time | relevance | path

Searched refs:rbtree_next (Results 1 – 10 of 10) sorted by relevance

/freebsd/contrib/unbound/util/
H A Drbtree.h160 rbnode_type *rbtree_next(rbnode_type *rbtree);
176 node = (type)rbtree_next((rbnode_type*)node))
H A Drbtree.c571 rbtree_next (rbnode_type *node) in rbtree_next() function
/freebsd/contrib/unbound/util/storage/
H A Ddnstree.c125 node = (struct addr_tree_node*)rbtree_next((rbnode_type*)node)) { in addr_tree_init_parents_node()
303 n = rbtree_next(n); in name_tree_next_root()
/freebsd/contrib/unbound/validator/
H A Dval_neg.c709 walk = rbtree_next(&el->node); in wipeout()
717 walk = rbtree_next(walk); in wipeout()
730 next = rbtree_next(walk); in wipeout()
H A Dval_anchor.c995 next = (struct trust_anchor*)rbtree_next(&ta->node); in anchors_assemble_rrsets()
1333 next = (struct trust_anchor*)rbtree_next(&ta->node); in anchors_find_any_noninsecure()
H A Dval_sigcrypt.c1245 p1 = (struct canon_rr*)rbtree_next(&p1->node); in rrset_canonical_equal()
1246 p2 = (struct canon_rr*)rbtree_next(&p2->node); in rrset_canonical_equal()
/freebsd/contrib/unbound/iterator/
H A Diter_fwd.c465 n = rbtree_next(n); in next_root_locked()
/freebsd/contrib/unbound/services/
H A Dlocalzone.c2013 p = (struct local_zone*)rbtree_next(&p->node); in set_kiddo_parents()
2026 p = (struct local_zone*)rbtree_next(&p->node); in set_kiddo_parents()
2120 struct local_data* n = (struct local_data*)rbtree_next(&d->node); in is_terminal()
H A Doutside_network.c572 result = rbtree_next(result);
597 result = rbtree_next(result);
1217 node = rbtree_next(node);
2389 rbnode_type* next = rbtree_next(node);
H A Dauthzone.c2624 next = (struct auth_data*)rbtree_next(&node->node); in az_empty_nonterminal()
2629 next = (struct auth_data*)rbtree_next(&node->node); in az_empty_nonterminal()