rbtree_search
return (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);
res = (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);
while(rbtree_search(&ctx->queries, &ctx->next_querynum)) {
q = (struct ctx_query*)rbtree_search(&ctx->queries, &querynum);
q = (struct ctx_query*)rbtree_search(&ctx->queries, &id);
q = (struct ctx_query*)rbtree_search(&ctx->queries, &id);
q = (struct ctx_query*)rbtree_search(&ctx->queries, &async_id);
return (struct auth_zone*)rbtree_search(&az->ztree, &key);
return (struct auth_xfer*)rbtree_search(&az->xtree, &key);
return (struct auth_data*)rbtree_search(&z->data, &key);
z = (struct auth_zone*)rbtree_search(&az->ztree, &key);
node = rbtree_search(table->timer_tree, &key);
node = rbtree_search(&conn->stream_tree, &key);
node = rbtree_search(table->conid_tree, &key);
(result=(struct local_zone*)rbtree_search(
return (struct local_zone*)rbtree_search(&zones->ztree, &key);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
return (struct local_data*)rbtree_search(&z->data, &key.node);
if(rbtree_search(&zones->ztree, &z.node)) {
result = (struct mesh_state*)rbtree_search(&mesh->all, &key);
p = (struct pending*)rbtree_search(outnet->pending, &key);
return (struct serviced_query*)rbtree_search(outnet->serviced, &key);
n = rbtree_search(&reuse->tree_by_id, &key_w);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
if(!(v = (struct view*)rbtree_search(&vs->vtree, &key.node))) {
node = rbtree_search(table->conn_tree, &key);
node = rbtree_search(c->doq_socket->table->conn_tree, copy.node.key);
node = rbtree_search(c->doq_socket->table->conn_tree, copy.node.key);
if((to_delete = rbtree_search(rbtree, key)) == 0) return 0;
rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);
return (struct name_tree_node*)rbtree_search(tree, &key);
res = rbtree_search(tree, &key);
tp2 = (struct trust_anchor*)rbtree_search(env->anchors->tree, &key);
if(rbtree_search(anchors->tree, &key)) {
if(!(ta=(struct trust_anchor*)rbtree_search(anchors->tree, &key))) {
n = rbtree_search(anchors->tree, &key);
rbtree_search(&neg->tree, lookfor.node.key);
rbtree_search(&zone->tree, lookfor.node.key);
c = (struct nsec3_cached_hash*)rbtree_search(table, &looki);
found = (struct rrcompress_entry*)rbtree_search(&pcomp->tree, &key);
data = (struct ixfr_data*)rbtree_search(ixfr->data, &qserial);
n = (struct ixfr_data*)rbtree_search(ixfr->data, &ixfr->oldest_serial);
n = (struct ixfr_data*)rbtree_search(ixfr->data, &ixfr->newest_serial);
n = (struct ixfr_data*)rbtree_search(ixfr->data, &cur->newserial);
&& rbtree_search(*tree, domain) == node)
return (struct pattern_options*)rbtree_search(opt->patterns, name);
return (struct key_options*)rbtree_search(opt->keys, name);
return (struct tls_auth_options*)rbtree_search(opt->tls_auths, name);
return (struct zone_options*) rbtree_search(opt->zone_options, apex);
res = rbtree_search(opt->zonestatnames, statname);
if(!rbtree_search(opt->zonestatnames, "")) {
struct zonelist_bucket* b = (struct zonelist_bucket*)rbtree_search(
b = (struct zonelist_bucket*)rbtree_search(opt->zonefree,
if((to_delete = rbtree_search(rbtree, key)) == 0) return 0;
rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);
zone = (xfrd_zone_type*)rbtree_search(xfrd->zones, (const
xfrd_zone_type* xz = (xfrd_zone_type*)rbtree_search(xfrd->zones,
struct notify_zone* nz = (struct notify_zone*)rbtree_search(
rbtree_search( xfrd->catalog_consumer_zones
rbtree_search( xfrd->catalog_producer_zones
if(!rbtree_search(xfrd->nsd->options->patterns, arg2)) {
if(!rbtree_search(xfrd->nsd->options->patterns, arg2)) {
struct notify_zone* n = (struct notify_zone*)rbtree_search(
zone = (xfrd_zone_type*)rbtree_search(xfrd->zones, (const
entry = (tsig_key_table_type*)rbtree_search(tsig_key_table, name);
if (!rbtree_search(&producer_zone->member_ids, cmz)) {
if ((consumer_zone = (struct xfrd_catalog_consumer_zone*)rbtree_search(
xfrd_zone_type* zone = (xfrd_zone_type*)rbtree_search(
rbtree_search(xfrd->catalog_consumer_zones, name))) {
rbtree_search(xfrd->catalog_consumer_zones, zone->node.key)))
rbtree_search(xfrd->catalog_producer_zones, producer_name);
zone = (xfrd_zone_type*)rbtree_search(xfrd->zones, dname);
xz = (xfrd_zone_type*)rbtree_search(xfrd->zones, zone->apex);
rbtree_search(tree, apex);
rbtree_search(tree, apex);
n = rbtree_search(tp->zone_per_id, &key);
n = rbtree_search(tp->zone_per_id, &key);
return (xfrd_zone_type*)rbtree_search(xfrd->zones, dname);
zone = (xfrd_zone_type*)rbtree_search(xfrd->zones, dname);
zone = (xfrd_zone_type*)rbtree_search(xfrd->zones, task->zname);
rbtree_search(xfrd->catalog_producer_zones, task->zname))) {
&& (consumer_zone = (struct xfrd_catalog_consumer_zone*)rbtree_search(
return (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);
res = (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);
while(rbtree_search(&ctx->queries, &ctx->next_querynum)) {
q = (struct ctx_query*)rbtree_search(&ctx->queries, &querynum);
q = (struct ctx_query*)rbtree_search(&ctx->queries, &id);
q = (struct ctx_query*)rbtree_search(&ctx->queries, &id);
q = (struct ctx_query*)rbtree_search(&ctx->queries, &async_id);
return (struct auth_zone*)rbtree_search(&az->ztree, &key);
return (struct auth_xfer*)rbtree_search(&az->xtree, &key);
return (struct auth_data*)rbtree_search(&z->data, &key);
z = (struct auth_zone*)rbtree_search(&az->ztree, &key);
node = rbtree_search(table->timer_tree, &key);
node = rbtree_search(&conn->stream_tree, &key);
node = rbtree_search(table->conid_tree, &key);
(result=(struct local_zone*)rbtree_search(
return (struct local_zone*)rbtree_search(&zones->ztree, &key);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
return (struct local_data*)rbtree_search(&z->data, &key.node);
if(rbtree_search(&zones->ztree, &z.node)) {
result = (struct mesh_state*)rbtree_search(&mesh->all, &key);
p = (struct pending*)rbtree_search(outnet->pending, &key);
return (struct serviced_query*)rbtree_search(outnet->serviced, &key);
n = rbtree_search(&reuse->tree_by_id, &key_w);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
ld = (struct local_data*)rbtree_search(&z->data, &key.node);
if(!(v = (struct view*)rbtree_search(&vs->vtree, &key.node))) {
struct order_lock* a = (struct order_lock*)rbtree_search(all,
prev = (struct order_lock*)rbtree_search(all, &prev_id);
now = (struct order_lock*)rbtree_search(all, &now_id);
struct codeline* cl = (struct codeline*)rbtree_search(tree, key);
return (struct replay_var*)rbtree_search(store, &k);
node = rbtree_search(table->conn_tree, &key);
node = rbtree_search(c->doq_socket->table->conn_tree, copy.node.key);
node = rbtree_search(c->doq_socket->table->conn_tree, copy.node.key);
if((to_delete = rbtree_search(rbtree, key)) == 0) return 0;
rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);
return (struct name_tree_node*)rbtree_search(tree, &key);
res = rbtree_search(tree, &key);
tp2 = (struct trust_anchor*)rbtree_search(env->anchors->tree, &key);
if(rbtree_search(anchors->tree, &key)) {
if(!(ta=(struct trust_anchor*)rbtree_search(anchors->tree, &key))) {
n = rbtree_search(anchors->tree, &key);
rbtree_search(&neg->tree, lookfor.node.key);
rbtree_search(&zone->tree, lookfor.node.key);
c = (struct nsec3_cached_hash*)rbtree_search(table, &looki);