OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:rbtree_first
(Results
1 - 21
of
21
) sorted by relevancy
/src/external/bsd/nsd/dist/
rbtree.h
59
rbnode_type *
rbtree_first
(rbtree_type *rbtree);
65
for((rbtree)->_node =
rbtree_first
(rbtree);\
72
for(node=(type)
rbtree_first
(rbtree); \
nsec3.c
382
* for(n=
rbtree_first
(tree); n!=RBTREE_NULL; n=rbtree_next(n)) {
721
*p =
rbtree_first
(tree);
757
*p =
rbtree_first
(tree);
797
p =
rbtree_first
(zone->hashtree);
799
pwc =
rbtree_first
(zone->wchashtree);
801
pds =
rbtree_first
(zone->dshashtree);
852
domain_type* first = (domain_type*)(
rbtree_first
(
xfrd-catalog-zones.c
47
rbtree_first
(xfrd->catalog_consumer_zones) : NULL;
245
rbtree_first
(&consumer_zone->member_ids)->key;
476
for ( cursor =
rbtree_first
(&consumer_zone->member_ids), i = 0
569
cursor =
rbtree_first
(&consumer_zone->member_ids);
575
cursor =
rbtree_first
(&consumer_zone->member_ids);
mini_event.c
169
while((rbnode_type*)(p = (struct event*)
rbtree_first
(base->times))
rbtree.c
547
rbtree_first
(rbtree_type *rbtree)
function
xfrd-disk.c
491
for(p =
rbtree_first
(xfrd->zones); p && p!=RBTREE_NULL; p=rbtree_next(p))
remote.c
1632
k = (struct key_options*)
rbtree_first
(oldopt->keys);
1949
p = (struct pattern_options*)
rbtree_first
(oldopt->patterns);
/src/external/bsd/unbound/dist/util/
rbtree.h
146
rbnode_type *
rbtree_first
(rbtree_type *rbtree);
174
for(node=(type)
rbtree_first
(rbtree); \
mini_event.c
153
while((rbnode_type*)(p = (struct event*)
rbtree_first
(base->times))
rbtree.c
549
rbtree_first
(rbtree_type *rbtree)
function
winsock_event.c
172
while((rbnode_type*)(p = (struct event*)
rbtree_first
(base->times))
netevent.c
2439
node =
rbtree_first
(doq_socket->table->timer_tree);
/src/external/bsd/unbound/dist/testcode/
unitneg.c
257
walk =
rbtree_first
(&neg->tree); /* first highest parent, big count */
263
walk =
rbtree_first
(&neg->tree);
283
walk =
rbtree_first
(&z->tree); /* first is highest parent */
289
walk =
rbtree_first
(&z->tree);
328
d = (struct val_neg_data*)
rbtree_first
(&z->tree);
unitmain.c
1192
for(node1=(struct local_zone*)
rbtree_first
(&z1->ztree),
1193
node2=(struct local_zone*)
rbtree_first
(&z2->ztree);
/src/external/bsd/unbound/dist/util/storage/
dnstree.c
150
(struct addr_tree_node*)
rbtree_first
(tree));
275
n =
rbtree_first
(tree);
/src/external/bsd/unbound/dist/iterator/
iter_fwd.c
492
n =
rbtree_first
(fwd->tree);
/src/external/bsd/unbound/dist/validator/
val_anchor.c
996
ta=(struct trust_anchor*)
rbtree_first
(anchors->tree);
1370
ta=(struct trust_anchor*)
rbtree_first
(anchors->tree);
val_sigcrypt.c
1235
p1 = (struct canon_rr*)
rbtree_first
(&sortree1);
1236
p2 = (struct canon_rr*)
rbtree_first
(&sortree2);
autotrust.c
2032
rbnode_type* t =
rbtree_first
(&anchors->autr->probe);
2432
if( (el=
rbtree_first
(&env->anchors->autr->probe)) == RBTREE_NULL) {
/src/external/bsd/unbound/dist/services/
outside_network.c
573
result =
rbtree_first
(&outnet->tcp_reuse);
1228
node =
rbtree_first
(tree_by_id);
2396
node =
rbtree_first
(&reuse->tree_by_id);
authzone.c
2615
next = (struct auth_data*)
rbtree_first
(&z->data);
Completed in 59 milliseconds
Indexes created Sat Feb 28 05:31:39 UTC 2026