sbin/unwind/libunbound/iterator/iter_fwd.c

492

n = rbtree_first(fwd->tree);

sbin/unwind/libunbound/services/authzone.c

2615

next = (struct auth_data*)rbtree_first(&z->data);

sbin/unwind/libunbound/services/outside_network.c

1228

node = rbtree_first(tree_by_id);

sbin/unwind/libunbound/services/outside_network.c

2396

node = rbtree_first(&reuse->tree_by_id);

sbin/unwind/libunbound/services/outside_network.c

573

result = rbtree_first(&outnet->tcp_reuse);

sbin/unwind/libunbound/util/mini_event.c

150

while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))

sbin/unwind/libunbound/util/netevent.c

2439

node = rbtree_first(doq_socket->table->timer_tree);

sbin/unwind/libunbound/util/rbtree.h

146

rbnode_type *rbtree_first(rbtree_type *rbtree);

sbin/unwind/libunbound/util/rbtree.h

174

for(node=(type)rbtree_first(rbtree); \

sbin/unwind/libunbound/util/storage/dnstree.c

150

(struct addr_tree_node*)rbtree_first(tree));

sbin/unwind/libunbound/util/storage/dnstree.c

275

n = rbtree_first(tree);

sbin/unwind/libunbound/util/winsock_event.c

172

while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))

sbin/unwind/libunbound/validator/autotrust.c

2036

rbnode_type* t = rbtree_first(&anchors->autr->probe);

sbin/unwind/libunbound/validator/autotrust.c

2436

if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) {

sbin/unwind/libunbound/validator/val_anchor.c

1370

ta=(struct trust_anchor*)rbtree_first(anchors->tree);

sbin/unwind/libunbound/validator/val_anchor.c

996

ta=(struct trust_anchor*)rbtree_first(anchors->tree);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1235

p1 = (struct canon_rr*)rbtree_first(&sortree1);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1236

p2 = (struct canon_rr*)rbtree_first(&sortree2);

usr.sbin/nsd/mini_event.c

169

while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))

usr.sbin/nsd/nsec3.c

721

*p = rbtree_first(tree);

usr.sbin/nsd/nsec3.c

757

*p = rbtree_first(tree);

usr.sbin/nsd/nsec3.c

797

p = rbtree_first(zone->hashtree);

usr.sbin/nsd/nsec3.c

799

pwc = rbtree_first(zone->wchashtree);

usr.sbin/nsd/nsec3.c

801

pds = rbtree_first(zone->dshashtree);

usr.sbin/nsd/nsec3.c

852

domain_type* first = (domain_type*)(rbtree_first(

usr.sbin/nsd/rbtree.h

59

rbnode_type *rbtree_first(rbtree_type *rbtree);

usr.sbin/nsd/rbtree.h

65

for((rbtree)->_node = rbtree_first(rbtree);\

usr.sbin/nsd/rbtree.h

72

for(node=(type)rbtree_first(rbtree); \

usr.sbin/nsd/remote.c

1635

k = (struct key_options*)rbtree_first(oldopt->keys);

usr.sbin/nsd/remote.c

1952

p = (struct pattern_options*)rbtree_first(oldopt->patterns);

usr.sbin/nsd/xfrd-catalog-zones.c

245

rbtree_first(&consumer_zone->member_ids)->key;

usr.sbin/nsd/xfrd-catalog-zones.c

47

rbtree_first(xfrd->catalog_consumer_zones) : NULL;

usr.sbin/nsd/xfrd-catalog-zones.c

476

for ( cursor = rbtree_first(&consumer_zone->member_ids), i = 0

usr.sbin/nsd/xfrd-catalog-zones.c

569

cursor = rbtree_first(&consumer_zone->member_ids);

usr.sbin/nsd/xfrd-catalog-zones.c

575

cursor = rbtree_first(&consumer_zone->member_ids);

usr.sbin/nsd/xfrd-disk.c

491

for(p = rbtree_first(xfrd->zones); p && p!=RBTREE_NULL; p=rbtree_next(p))

usr.sbin/unbound/iterator/iter_fwd.c

492

n = rbtree_first(fwd->tree);

usr.sbin/unbound/services/authzone.c

2615

next = (struct auth_data*)rbtree_first(&z->data);

usr.sbin/unbound/services/outside_network.c

1228

node = rbtree_first(tree_by_id);

usr.sbin/unbound/services/outside_network.c

2396

node = rbtree_first(&reuse->tree_by_id);

usr.sbin/unbound/services/outside_network.c

573

result = rbtree_first(&outnet->tcp_reuse);

usr.sbin/unbound/testcode/unitmain.c

1192

for(node1=(struct local_zone*)rbtree_first(&z1->ztree),

usr.sbin/unbound/testcode/unitmain.c

1193

node2=(struct local_zone*)rbtree_first(&z2->ztree);

usr.sbin/unbound/testcode/unitneg.c

257

walk = rbtree_first(&neg->tree); /* first highest parent, big count */

usr.sbin/unbound/testcode/unitneg.c

263

walk = rbtree_first(&neg->tree);

usr.sbin/unbound/testcode/unitneg.c

283

walk = rbtree_first(&z->tree); /* first is highest parent */

usr.sbin/unbound/testcode/unitneg.c

289

walk = rbtree_first(&z->tree);

usr.sbin/unbound/testcode/unitneg.c

328

d = (struct val_neg_data*)rbtree_first(&z->tree);

usr.sbin/unbound/util/mini_event.c

150

while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))

usr.sbin/unbound/util/netevent.c

2439

node = rbtree_first(doq_socket->table->timer_tree);

usr.sbin/unbound/util/rbtree.h

146

rbnode_type *rbtree_first(rbtree_type *rbtree);

usr.sbin/unbound/util/rbtree.h

174

for(node=(type)rbtree_first(rbtree); \

usr.sbin/unbound/util/storage/dnstree.c

150

(struct addr_tree_node*)rbtree_first(tree));

usr.sbin/unbound/util/storage/dnstree.c

275

n = rbtree_first(tree);

usr.sbin/unbound/util/winsock_event.c

172

while((rbnode_type*)(p = (struct event*)rbtree_first(base->times))

usr.sbin/unbound/validator/autotrust.c

2032

rbnode_type* t = rbtree_first(&anchors->autr->probe);

usr.sbin/unbound/validator/autotrust.c

2432

if( (el=rbtree_first(&env->anchors->autr->probe)) == RBTREE_NULL) {

usr.sbin/unbound/validator/val_anchor.c

1370

ta=(struct trust_anchor*)rbtree_first(anchors->tree);

usr.sbin/unbound/validator/val_anchor.c

996

ta=(struct trust_anchor*)rbtree_first(anchors->tree);

usr.sbin/unbound/validator/val_sigcrypt.c

1235

p1 = (struct canon_rr*)rbtree_first(&sortree1);

usr.sbin/unbound/validator/val_sigcrypt.c

1236

p2 = (struct canon_rr*)rbtree_first(&sortree2);