rbtree_next
n = rbtree_next(n);
next = (struct auth_data*)rbtree_next(&node->node);
next = (struct auth_data*)rbtree_next(&node->node);
p = (struct local_zone*)rbtree_next(&p->node);
p = (struct local_zone*)rbtree_next(&p->node);
struct local_data* n = (struct local_data*)rbtree_next(&d->node);
node = rbtree_next(node);
rbnode_type* next = rbtree_next(node);
result = rbtree_next(result);
result = rbtree_next(result);
rbnode_type *rbtree_next(rbnode_type *rbtree);
node = (type)rbtree_next((rbnode_type*)node))
node = (struct addr_tree_node*)rbtree_next((rbnode_type*)node)) {
n = rbtree_next(n);
next = (struct trust_anchor*)rbtree_next(&ta->node);
next = (struct trust_anchor*)rbtree_next(&ta->node);
walk = rbtree_next(&el->node);
walk = rbtree_next(walk);
next = rbtree_next(walk);
p1 = (struct canon_rr*)rbtree_next(&p1->node);
p2 = (struct canon_rr*)rbtree_next(&p2->node);
n = (struct ixfr_data*)rbtree_next(&cur->node);
rbnode_type *next = rbtree_next((rbnode_type *) domain);
*p = rbtree_next(*p); /* if this becomes NULL, nothing to do */
*p = rbtree_next(*p);
p = rbtree_next(p);
pds = rbtree_next(pds);
p = rbtree_next(p);
pwc = rbtree_next(pwc);
pds = rbtree_next(pds);
nx = rbtree_next(&domain->nsec3->nsec3_node);
rbnode_type *rbtree_next(rbnode_type *rbtree);
((d) = (void *) (rbtree)->_node); (rbtree)->_node = rbtree_next((rbtree)->_node))
node = (type)rbtree_next((rbnode_type*)node))
struct key_options* next = (struct key_options*)rbtree_next(
rbtree_next((rbnode_type*)p);
; cursor != RBTREE_NULL; i++, cursor = rbtree_next(cursor)) {
cursor = rbtree_next(cursor);
cursor = rbtree_next(cursor);
cursor = rbtree_next(&to_add->node);
cursor = rbtree_next(cursor);
for(p = rbtree_first(xfrd->zones); p && p!=RBTREE_NULL; p=rbtree_next(p))
n = rbtree_next(n);
next = (struct auth_data*)rbtree_next(&node->node);
next = (struct auth_data*)rbtree_next(&node->node);
p = (struct local_zone*)rbtree_next(&p->node);
p = (struct local_zone*)rbtree_next(&p->node);
struct local_data* n = (struct local_data*)rbtree_next(&d->node);
node = rbtree_next(node);
rbnode_type* next = rbtree_next(node);
result = rbtree_next(result);
result = rbtree_next(result);
node1=(struct local_zone*)rbtree_next((rbnode_type*)node1),
node2=(struct local_zone*)rbtree_next((rbnode_type*)node2)) {
walk = rbtree_next(walk);
walk = rbtree_next(walk);
rbnode_type *rbtree_next(rbnode_type *rbtree);
node = (type)rbtree_next((rbnode_type*)node))
node = (struct addr_tree_node*)rbtree_next((rbnode_type*)node)) {
n = rbtree_next(n);
next = (struct trust_anchor*)rbtree_next(&ta->node);
next = (struct trust_anchor*)rbtree_next(&ta->node);
walk = rbtree_next(&el->node);
walk = rbtree_next(walk);
next = rbtree_next(walk);
p1 = (struct canon_rr*)rbtree_next(&p1->node);
p2 = (struct canon_rr*)rbtree_next(&p2->node);