Symbol: rbtree_find_less_equal
sbin/unwind/libunbound/iterator/iter_fwd.c
450
if(rbtree_find_less_equal(fwd->tree, &key, &res)) {
sbin/unwind/libunbound/iterator/iter_fwd.c
513
if(rbtree_find_less_equal(fwd->tree, &key, &n)) {
sbin/unwind/libunbound/services/authzone.c
485
return rbtree_find_less_equal(&az->ztree, &key, (rbnode_type**)z);
sbin/unwind/libunbound/services/authzone.c
634
*node_exact = rbtree_find_less_equal(&z->data, &key,
sbin/unwind/libunbound/services/localzone.c
1259
rbtree_find_less_equal(&zones->ztree, &key, &res);
sbin/unwind/libunbound/services/localzone.c
1304
*exact = rbtree_find_less_equal(&zones->ztree, &key, &node);
sbin/unwind/libunbound/services/outside_network.c
560
if(rbtree_find_less_equal(&outnet->tcp_reuse, &key_p.reuse,
sbin/unwind/libunbound/util/rbtree.c
285
if (rbtree_find_less_equal(rbtree, key, &node)) {
sbin/unwind/libunbound/util/rbtree.h
138
int rbtree_find_less_equal(rbtree_type *rbtree, const void *key,
sbin/unwind/libunbound/util/storage/dnstree.c
202
if(rbtree_find_less_equal(tree, &key, &res)) {
sbin/unwind/libunbound/util/storage/dnstree.c
233
if(rbtree_find_less_equal(tree, &key, &res)) {
sbin/unwind/libunbound/util/storage/dnstree.c
296
if(rbtree_find_less_equal(tree, &key, &n)) {
sbin/unwind/libunbound/validator/val_anchor.c
1149
if(rbtree_find_less_equal(anchors->tree, &key, &res)) {
sbin/unwind/libunbound/validator/val_neg.c
381
if(rbtree_find_less_equal(&neg->tree, &key, &res)) {
sbin/unwind/libunbound/validator/val_neg.c
420
if(rbtree_find_less_equal(&zone->tree, &key, &res)) {
sbin/unwind/libunbound/validator/val_neg.c
958
if(rbtree_find_less_equal(&zone->tree, &key, &r)) {
usr.sbin/nsd/namedb.c
382
exact = rbtree_find_less_equal(table->names_to_domains, dname, (rbnode_type **) closest_match);
usr.sbin/nsd/nsec3.c
538
exact = rbtree_find_less_equal(zone->nsec3tree, &d, &r);
usr.sbin/nsd/nsec3.c
716
if(rbtree_find_less_equal(tree, &d, p)) {
usr.sbin/nsd/nsec3.c
750
if(rbtree_find_less_equal(tree, &d, p)) {
usr.sbin/nsd/rbtree.c
269
if (rbtree_find_less_equal(rbtree, key, &node)) {
usr.sbin/nsd/rbtree.h
58
int rbtree_find_less_equal(rbtree_type *rbtree, const void *key, rbnode_type **result);
usr.sbin/nsd/xfrd-tcp.c
641
if(rbtree_find_less_equal(set->pipetree, key, &sme)) {
usr.sbin/unbound/iterator/iter_fwd.c
450
if(rbtree_find_less_equal(fwd->tree, &key, &res)) {
usr.sbin/unbound/iterator/iter_fwd.c
513
if(rbtree_find_less_equal(fwd->tree, &key, &n)) {
usr.sbin/unbound/services/authzone.c
485
return rbtree_find_less_equal(&az->ztree, &key, (rbnode_type**)z);
usr.sbin/unbound/services/authzone.c
634
*node_exact = rbtree_find_less_equal(&z->data, &key,
usr.sbin/unbound/services/localzone.c
1259
rbtree_find_less_equal(&zones->ztree, &key, &res);
usr.sbin/unbound/services/localzone.c
1304
*exact = rbtree_find_less_equal(&zones->ztree, &key, &node);
usr.sbin/unbound/services/outside_network.c
560
if(rbtree_find_less_equal(&outnet->tcp_reuse, &key_p.reuse,
usr.sbin/unbound/util/rbtree.c
285
if (rbtree_find_less_equal(rbtree, key, &node)) {
usr.sbin/unbound/util/rbtree.h
138
int rbtree_find_less_equal(rbtree_type *rbtree, const void *key,
usr.sbin/unbound/util/storage/dnstree.c
202
if(rbtree_find_less_equal(tree, &key, &res)) {
usr.sbin/unbound/util/storage/dnstree.c
233
if(rbtree_find_less_equal(tree, &key, &res)) {
usr.sbin/unbound/util/storage/dnstree.c
296
if(rbtree_find_less_equal(tree, &key, &n)) {
usr.sbin/unbound/validator/val_anchor.c
1149
if(rbtree_find_less_equal(anchors->tree, &key, &res)) {
usr.sbin/unbound/validator/val_neg.c
381
if(rbtree_find_less_equal(&neg->tree, &key, &res)) {
usr.sbin/unbound/validator/val_neg.c
420
if(rbtree_find_less_equal(&zone->tree, &key, &res)) {
usr.sbin/unbound/validator/val_neg.c
958
if(rbtree_find_less_equal(&zone->tree, &key, &r)) {