Home
last modified time | relevance | path

Searched refs:rbtree_first (Results 1 – 12 of 12) sorted by relevance

/freebsd/contrib/unbound/util/
H A Drbtree.h146 rbnode_type *rbtree_first(rbtree_type *rbtree);
174 for(node=(type)rbtree_first(rbtree); \
H A Dmini_event.c150 while((rbnode_type*)(p = (struct event*)rbtree_first(base->times)) in handle_timeouts()
H A Drbtree.c549 rbtree_first (rbtree_type *rbtree) in rbtree_first() function
H A Dwinsock_event.c172 while((rbnode_type*)(p = (struct event*)rbtree_first(base->times)) in handle_timeouts()
H A Dnetevent.c2408 node = rbtree_first(doq_socket->table->timer_tree);
/freebsd/contrib/unbound/util/storage/
H A Ddnstree.c150 (struct addr_tree_node*)rbtree_first(tree)); in addr_tree_init_parents()
275 n = rbtree_first(tree); in name_tree_next_root()
/freebsd/contrib/unbound/validator/
H A Dval_anchor.c993 ta=(struct trust_anchor*)rbtree_first(anchors->tree); in anchors_assemble_rrsets()
1331 ta=(struct trust_anchor*)rbtree_first(anchors->tree); in anchors_find_any_noninsecure()
H A Dval_sigcrypt.c1234 p1 = (struct canon_rr*)rbtree_first(&sortree1); in rrset_canonical_equal()
1235 p2 = (struct canon_rr*)rbtree_first(&sortree2); in rrset_canonical_equal()
H A Dautotrust.c2032 rbnode_type* t = rbtree_first(&anchors->autr->probe); in wait_probe_time()
2415 if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) { in todo_probe()
/freebsd/contrib/unbound/iterator/
H A Diter_fwd.c437 n = rbtree_first(fwd->tree); in next_root_locked()
/freebsd/contrib/unbound/services/
H A Doutside_network.c559 result = rbtree_first(&outnet->tcp_reuse);
1213 node = rbtree_first(tree_by_id);
2381 node = rbtree_first(&reuse->tree_by_id);
H A Dauthzone.c2622 next = (struct auth_data*)rbtree_first(&z->data); in az_empty_nonterminal()