HomeSort by: relevance | last modified time | path
    Searched refs:rbtree_next (Results 1 - 20 of 20) sorted by relevancy

  /src/external/bsd/nsd/dist/
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))
nsec3.c 382 * for(n=rbtree_first(tree); n!=RBTREE_NULL; n=rbtree_next(n)) {
725 *p = rbtree_next(*p); /* if this becomes NULL, nothing to do */
762 *p = rbtree_next(*p);
785 p = rbtree_next(p);
793 pds = rbtree_next(pds);
816 p = rbtree_next(p);
821 pwc = rbtree_next(pwc);
828 pds = rbtree_next(pds);
845 nx = rbtree_next(&domain->nsec3->nsec3_node);
xfrd-catalog-zones.c 477 ; cursor != RBTREE_NULL; i++, cursor = rbtree_next(cursor)) {
706 cursor = rbtree_next(cursor);
790 cursor = rbtree_next(cursor);
851 cursor = rbtree_next(&to_add->node);
883 cursor = rbtree_next(cursor);
namedb.h 332 rbnode_type *next = rbtree_next((rbnode_type *) domain);
rbtree.c 579 rbtree_next (rbnode_type *node) function
xfrd-disk.c 491 for(p = rbtree_first(xfrd->zones); p && p!=RBTREE_NULL; p=rbtree_next(p))
remote.c 1634 struct key_options* next = (struct key_options*)rbtree_next(
1952 rbtree_next((rbnode_type*)p);
ixfr.c 548 n = (struct ixfr_data*)rbtree_next(&cur->node);
  /src/external/bsd/unbound/dist/util/
rbtree.h 160 rbnode_type *rbtree_next(rbnode_type *rbtree);
176 node = (type)rbtree_next((rbnode_type*)node))
rbtree.c 571 rbtree_next (rbnode_type *node) function
  /src/external/bsd/unbound/dist/util/storage/
dnstree.c 125 node = (struct addr_tree_node*)rbtree_next((rbnode_type*)node)) {
288 * this is the last item of the previous class so rbtree_next() takes
303 n = rbtree_next(n);
  /src/external/bsd/unbound/dist/testcode/
unitneg.c 266 walk = rbtree_next(walk);
292 walk = rbtree_next(walk);
unitmain.c 1196 node1=(struct local_zone*)rbtree_next((rbnode_type*)node1),
1197 node2=(struct local_zone*)rbtree_next((rbnode_type*)node2)) {
  /src/external/bsd/unbound/dist/validator/
val_neg.c 709 walk = rbtree_next(&el->node);
717 walk = rbtree_next(walk);
730 next = rbtree_next(walk);
val_anchor.c 998 next = (struct trust_anchor*)rbtree_next(&ta->node);
1372 next = (struct trust_anchor*)rbtree_next(&ta->node);
val_sigcrypt.c 1246 p1 = (struct canon_rr*)rbtree_next(&p1->node);
1247 p2 = (struct canon_rr*)rbtree_next(&p2->node);
  /src/external/bsd/unbound/dist/iterator/
iter_fwd.c 505 * this is the last item of the previous class so rbtree_next() takes
520 n = rbtree_next(n);
  /src/external/bsd/unbound/dist/services/
localzone.c 2023 p = (struct local_zone*)rbtree_next(&p->node);
2036 p = (struct local_zone*)rbtree_next(&p->node);
2130 struct local_data* n = (struct local_data*)rbtree_next(&d->node);
outside_network.c 586 result = rbtree_next(result);
611 result = rbtree_next(result);
1232 node = rbtree_next(node);
2404 rbnode_type* next = rbtree_next(node);
authzone.c 2617 next = (struct auth_data*)rbtree_next(&node->node);
2622 next = (struct auth_data*)rbtree_next(&node->node);

Completed in 65 milliseconds