/freebsd/contrib/unbound/libunbound/ |
H A D | context.c | 147 while(rbtree_search(&ctx->queries, &ctx->next_querynum)) { in find_id() 305 q = (struct ctx_query*)rbtree_search(&ctx->queries, &querynum); in context_lookup_new_query() 360 q = (struct ctx_query*)rbtree_search(&ctx->queries, &id); in context_deserialize_answer() 414 q = (struct ctx_query*)rbtree_search(&ctx->queries, &id); in context_deserialize_cancel()
|
H A D | libunbound.c | 903 q = (struct ctx_query*)rbtree_search(&ctx->queries, &async_id); in ub_cancel()
|
/freebsd/contrib/unbound/util/ |
H A D | rbtree.h | 127 rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);
|
H A D | rbtree.c | 281 rbtree_search (rbtree_type *rbtree, const void *key) in rbtree_search() function 333 if((to_delete = rbtree_search(rbtree, key)) == 0) return 0; in rbtree_delete()
|
H A D | netevent.c | 1625 node = rbtree_search(table->conn_tree, &key); 2214 node = rbtree_search(c->doq_socket->table->conn_tree, copy.node.key); 2273 node = rbtree_search(c->doq_socket->table->conn_tree, copy.node.key);
|
/freebsd/contrib/unbound/util/storage/ |
H A D | dnstree.c | 188 return (struct name_tree_node*)rbtree_search(tree, &key); in name_tree_find() 263 res = rbtree_search(tree, &key); in addr_tree_find()
|
/freebsd/contrib/unbound/services/ |
H A D | view.c | 232 if(!(v = (struct view*)rbtree_search(&vs->vtree, &key.node))) { in views_find_view()
|
H A D | localzone.c | 467 return (struct local_data*)rbtree_search(&z->data, &key.node); in local_zone_find_data() 816 if(rbtree_search(&zones->ztree, &z.node)) { in lz_exists() 1279 return (struct local_zone*)rbtree_search(&zones->ztree, &key); in local_zones_find() 1508 ld = (struct local_data*)rbtree_search(&z->data, &key.node); in local_data_answer() 1624 ld = (struct local_data*)rbtree_search(&z->data, &key.node); in local_zone_does_not_cover()
|
H A D | rpz.c | 2123 ld = (struct local_data*)rbtree_search(&z->data, &key.node); in rpz_synthesize_nsdname_localdata() 2150 ld = (struct local_data*)rbtree_search(&z->data, &key.node); in rpz_synthesize_qname_localdata_msg()
|
H A D | outside_network.c | 461 n = rbtree_search(&reuse->tree_by_id, &key_w); 1493 p = (struct pending*)rbtree_search(outnet->pending, &key); 2581 return (struct serviced_query*)rbtree_search(outnet->serviced, &key);
|
H A D | listen_dnsport.c | 3389 node = rbtree_search(table->timer_tree, &key); in doq_timer_find_time() 3844 node = rbtree_search(&conn->stream_tree, &key); in doq_stream_find() 4863 node = rbtree_search(table->conid_tree, &key); in doq_conid_find()
|
H A D | authzone.c | 458 return (struct auth_zone*)rbtree_search(&az->ztree, &key); in auth_zone_find() 471 return (struct auth_xfer*)rbtree_search(&az->xtree, &key); in auth_xfer_find() 621 return (struct auth_data*)rbtree_search(&z->data, &key); in az_find_name() 8581 z = (struct auth_zone*)rbtree_search(&az->ztree, &key); in auth_zones_pickup_zonemd_verify()
|
H A D | mesh.c | 1681 result = (struct mesh_state*)rbtree_search(&mesh->all, &key); in mesh_area_find()
|
/freebsd/contrib/unbound/iterator/ |
H A D | iter_fwd.c | 374 res = (struct iter_forward_zone*)rbtree_search(fwd->tree, &key); in forwards_find() 514 return (struct iter_forward_zone*)rbtree_search(fwd->tree, &key); in fwd_zone_find()
|
/freebsd/contrib/unbound/validator/ |
H A D | val_anchor.c | 209 n = rbtree_search(anchors->tree, &key); in anchor_find() 1196 if(rbtree_search(anchors->tree, &key)) { in anchors_add_insecure() 1223 if(!(ta=(struct trust_anchor*)rbtree_search(anchors->tree, &key))) { in anchors_delete_insecure()
|
H A D | val_neg.c | 292 rbtree_search(&neg->tree, lookfor.node.key); in neg_find_zone() 315 rbtree_search(&zone->tree, lookfor.node.key); in neg_find_data()
|
H A D | val_nsec3.c | 672 c = (struct nsec3_cached_hash*)rbtree_search(table, &looki); in nsec3_hash_name()
|
H A D | autotrust.c | 2074 tp2 = (struct trust_anchor*)rbtree_search(env->anchors->tree, &key); in set_next_probe()
|