| /dports/dns/nsd/nsd-4.3.9/ |
| H A D | rbtree.h | 61 rbnode_type *rbtree_next(rbnode_type *rbtree);
67 ((d) = (void *) (rbtree)->_node); (rbtree)->_node = rbtree_next((rbtree)->_node))
74 node = (type)rbtree_next((rbnode_type*)node))
|
| H A D | nsec3.c | 758 *p = rbtree_next(*p); /* if this becomes NULL, nothing to do */ in process_first()
795 *p = rbtree_next(*p); in process_end()
818 p = rbtree_next(p); in process_range()
826 pds = rbtree_next(pds); in process_range()
849 p = rbtree_next(p); in process_range()
854 pwc = rbtree_next(pwc); in process_range()
861 pds = rbtree_next(pds); in process_range()
878 nx = rbtree_next(&domain->nsec3->nsec3_node); in process_prehash_domain()
|
| H A D | namedb.h | 304 rbnode_type *next = rbtree_next((rbnode_type *) domain); in domain_next()
|
| H A D | rbtree.c | 518 rbtree_next (rbnode_type *node) in rbtree_next() 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 | 1531 struct key_options* next = (struct key_options*)rbtree_next( in repat_keys()
1741 rbtree_next((rbnode_type*)p); in repat_patterns()
|
| /dports/dns/getdns/getdns-1.5.2/src/util/orig-headers/ |
| H A D | rbtree.h | 160 rbnode_type *rbtree_next(rbnode_type *rbtree);
176 node = (type)rbtree_next((rbnode_type*)node))
|
| /dports/dns/unbound/unbound-1.14.0/util/ |
| H A D | rbtree.h | 160 rbnode_type *rbtree_next(rbnode_type *rbtree);
176 node = (type)rbtree_next((rbnode_type*)node))
|
| H A D | rbtree.c | 571 rbtree_next (rbnode_type *node) in rbtree_next() function
|
| /dports/dns/getdns/getdns-1.5.2/src/util/ |
| H A D | rbtree.h | 46 #define rbtree_next _getdns_rbtree_next macro
|
| H A D | rbtree.c | 571 rbtree_next (rbnode_type *node) in rbtree_next() function
|
| /dports/databases/grass7/grass-7.8.6/lib/btree2/ |
| H A D | rbtree.c | 41 static void *rbtree_next(struct RB_TRAV *);
295 return rbtree_next(trav); in rbtree_traverse()
351 return rbtree_next(trav); in rbtree_traverse_start()
418 void *rbtree_next(struct RB_TRAV *trav) in rbtree_next() function
|
| /dports/dns/unbound/unbound-1.14.0/util/storage/ |
| H A D | dnstree.c | 112 node = (struct addr_tree_node*)rbtree_next((rbnode_type*)node)) { in addr_tree_init_parents_node()
290 n = rbtree_next(n); in name_tree_next_root()
|
| /dports/dns/unbound/unbound-1.14.0/testcode/ |
| H A D | unitneg.c | 266 walk = rbtree_next(walk); in remove_item()
292 walk = rbtree_next(walk); in remove_item()
|
| /dports/dns/unbound/unbound-1.14.0/validator/ |
| H A D | val_neg.c | 709 walk = rbtree_next(&el->node); in wipeout()
717 walk = rbtree_next(walk); in wipeout()
730 next = rbtree_next(walk); in wipeout()
|
| H A D | val_sigcrypt.c | 1155 p1 = (struct canon_rr*)rbtree_next(&p1->node); in rrset_canonical_equal()
1156 p2 = (struct canon_rr*)rbtree_next(&p2->node); in rrset_canonical_equal()
|
| H A D | val_anchor.c | 995 next = (struct trust_anchor*)rbtree_next(&ta->node); in anchors_assemble_rrsets()
|
| /dports/dns/unbound/unbound-1.14.0/iterator/ |
| H A D | iter_fwd.c | 434 n = rbtree_next(n); in forwards_next_root()
|
| /dports/dns/unbound/unbound-1.14.0/services/ |
| H A D | localzone.c | 1938 p = (struct local_zone*)rbtree_next(&p->node); in set_kiddo_parents()
1951 p = (struct local_zone*)rbtree_next(&p->node); in set_kiddo_parents()
2041 struct local_data* n = (struct local_data*)rbtree_next(&d->node); in is_terminal()
|
| H A D | outside_network.c | 563 result = rbtree_next(result);
1135 node = rbtree_next(node);
2265 rbnode_type* next = rbtree_next(node);
|
| H A D | authzone.c | 2581 next = (struct auth_data*)rbtree_next(&node->node); in az_empty_nonterminal()
2586 next = (struct auth_data*)rbtree_next(&node->node); in az_empty_nonterminal()
|