/dports/dns/nsd/nsd-4.3.9/ |
H A D | rbtree.h | 59 rbnode_type *rbtree_first(rbtree_type *rbtree); 65 for((rbtree)->_node = rbtree_first(rbtree);\ 72 for(node=(type)rbtree_first(rbtree); \
|
H A D | nsec3.c | 754 *p = rbtree_first(tree); in process_first() 790 *p = rbtree_first(tree); in process_end() 830 p = rbtree_first(zone->hashtree); in process_range() 832 pwc = rbtree_first(zone->wchashtree); in process_range() 834 pds = rbtree_first(zone->dshashtree); in process_range() 885 domain_type* first = (domain_type*)(rbtree_first( in process_prehash_domain()
|
H A D | mini_event.c | 169 while((rbnode_type*)(p = (struct event*)rbtree_first(base->times)) in handle_timeouts()
|
H A D | rbtree.c | 496 rbtree_first (rbtree_type *rbtree) in rbtree_first() function
|
H A D | xfrd-disk.c | 487 for(p = rbtree_first(xfrd->zones); p && p!=RBTREE_NULL; p=rbtree_next(p)) in xfrd_write_state()
|
H A D | remote.c | 1529 k = (struct key_options*)rbtree_first(oldopt->keys); in repat_keys() 1738 p = (struct pattern_options*)rbtree_first(oldopt->patterns); in repat_patterns()
|
/dports/dns/getdns/getdns-1.5.2/src/util/orig-headers/ |
H A D | rbtree.h | 146 rbnode_type *rbtree_first(const rbtree_type *rbtree); 174 for(node=(type)rbtree_first(rbtree); \
|
/dports/dns/unbound/unbound-1.14.0/util/ |
H A D | rbtree.h | 146 rbnode_type *rbtree_first(rbtree_type *rbtree); 174 for(node=(type)rbtree_first(rbtree); \
|
H A D | mini_event.c | 150 while((rbnode_type*)(p = (struct event*)rbtree_first(base->times)) in handle_timeouts()
|
H A D | rbtree.c | 549 rbtree_first (rbtree_type *rbtree) in rbtree_first() function
|
H A D | winsock_event.c | 172 while((rbnode_type*)(p = (struct event*)rbtree_first(base->times)) in handle_timeouts()
|
/dports/dns/unbound/unbound-1.14.0/testcode/ |
H A D | unitneg.c | 257 walk = rbtree_first(&neg->tree); /* first highest parent, big count */ in remove_item() 263 walk = rbtree_first(&neg->tree); in remove_item() 283 walk = rbtree_first(&z->tree); /* first is highest parent */ in remove_item() 289 walk = rbtree_first(&z->tree); in remove_item() 328 d = (struct val_neg_data*)rbtree_first(&z->tree); in sumtrees_inuse()
|
/dports/dns/getdns/getdns-1.5.2/src/util/ |
H A D | rbtree.h | 44 #define rbtree_first _getdns_rbtree_first macro
|
H A D | rbtree.c | 549 rbtree_first (const rbtree_type *rbtree) in rbtree_first() function
|
/dports/databases/grass7/grass-7.8.6/lib/btree2/ |
H A D | rbtree.c | 39 static void *rbtree_first(struct RB_TRAV *); 298 return rbtree_first(trav); in rbtree_traverse() 390 static void *rbtree_first(struct RB_TRAV *trav) in rbtree_first() function
|
/dports/dns/unbound/unbound-1.14.0/util/storage/ |
H A D | dnstree.c | 137 (struct addr_tree_node*)rbtree_first(tree)); in addr_tree_init_parents() 262 n = rbtree_first(tree); in name_tree_next_root()
|
/dports/dns/unbound/unbound-1.14.0/iterator/ |
H A D | iter_fwd.c | 406 n = rbtree_first(fwd->tree); in forwards_next_root()
|
/dports/dns/unbound/unbound-1.14.0/validator/ |
H A D | val_sigcrypt.c | 1144 p1 = (struct canon_rr*)rbtree_first(&sortree1); in rrset_canonical_equal() 1145 p2 = (struct canon_rr*)rbtree_first(&sortree2); in rrset_canonical_equal()
|
H A D | autotrust.c | 2032 rbnode_type* t = rbtree_first(&anchors->autr->probe); in wait_probe_time() 2413 if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) { in todo_probe()
|
H A D | val_anchor.c | 993 ta=(struct trust_anchor*)rbtree_first(anchors->tree); in anchors_assemble_rrsets()
|
/dports/net/freeswitch/freeswitch-1.10.3.-release/libs/sofia-sip/libsofia-sip-ua/su/sofia-sip/ |
H A D | rbtree.h | 523 Type *rbtree_first(Type const *node);
|
/dports/net/sofia-sip/sofia-sip-1.13.4/libsofia-sip-ua/su/sofia-sip/ |
H A D | rbtree.h | 523 Type *rbtree_first(Type const *node);
|
/dports/dns/unbound/unbound-1.14.0/services/ |
H A D | outside_network.c | 1131 node = rbtree_first(tree_by_id); 2257 node = rbtree_first(&reuse->tree_by_id);
|
H A D | authzone.c | 2579 next = (struct auth_data*)rbtree_first(&z->data); in az_empty_nonterminal()
|