Searched refs:rbtree_insert (Results 1 - 17 of 17) sorted by relevance

/freebsd-13-stable/contrib/unbound/util/
H A Drbtree.h110 rbnode_type *rbtree_insert(rbtree_type *rbtree, rbnode_type *data);
H A Dmini_event.c321 (void)rbtree_insert(ev->ev_base->times, &ev->node);
H A Drbtree.c228 rbtree_insert (rbtree_type *rbtree, rbnode_type *data) function
H A Dwinsock_event.c566 (void)rbtree_insert(ev->ev_base->times, &ev->node);
/freebsd-13-stable/contrib/unbound/services/
H A Dview.c132 if(!rbtree_insert(&vs->vtree, &v->node)) {
H A Dmesh.c531 rbtree_insert(&mesh->all, &s->node);
641 rbtree_insert(&mesh->all, &s->node);
717 rbtree_insert(&mesh->all, &s->node);
745 rbtree_insert(&mesh->run, &s->run_node);
1032 rbtree_insert(&mesh->all, &(*sub)->node);
1042 rbtree_insert(&mesh->run, &(*sub)->run_node);
1090 if(!rbtree_insert(&sub->super_set, &superref->node)) {
1103 rbtree_insert(&super->sub_set, &subref->node);
1439 (void)rbtree_insert(&mesh->run, &ref->s->run_node);
H A Dlocalzone.c186 if(!rbtree_insert(&zones->ztree, &z->node)) {
452 if(!rbtree_insert(&z->data, &ld->node)) {
1938 if(!rbtree_insert(&zones->ztree, &z->node)) {
H A Doutside_network.c401 rbtree_insert(&reuse->tree_by_id, &w->id_node);
438 if(!rbtree_insert(&outnet->tcp_reuse, &pend_tcp->reuse.node)) {
1750 while(!rbtree_insert(outnet->pending, &pend->node)) {
2327 rbtree_insert(outnet->serviced, &sq->node);
H A Dauthzone.c434 if(!rbtree_insert(&az->ztree, &z->node)) {
598 if(!rbtree_insert(&z->data, &n->node)) {
6789 (void)rbtree_insert(&az->xtree, &xfr->node);
/freebsd-13-stable/contrib/unbound/util/storage/
H A Ddnstree.c93 return rbtree_insert(tree, &node->node) != NULL;
104 return rbtree_insert(tree, &node->node) != NULL;
/freebsd-13-stable/contrib/unbound/libunbound/
H A Dcontext.c177 (void)rbtree_insert(&ctx->queries, &q->node);
276 (void)rbtree_insert(&ctx->queries, &q->node);
/freebsd-13-stable/contrib/unbound/iterator/
H A Diter_fwd.c129 if(!rbtree_insert(fwd->tree, &node->node)) {
/freebsd-13-stable/contrib/unbound/validator/
H A Dautotrust.c355 if(!rbtree_insert(anchors->tree, &tp->node)) {
363 if(!rbtree_insert(&anchors->autr->probe, &tp->autr->pnode)) {
880 (void)rbtree_insert(&anchors->autr->probe, &tp->autr->pnode);
2075 (void)rbtree_insert(&env->anchors->autr->probe, &tp->autr->pnode);
2420 (void)rbtree_insert(&env->anchors->autr->probe, &tp->autr->pnode);
H A Dval_neg.c556 (void)rbtree_insert(&neg->tree, &p->node);
794 (void)rbtree_insert(&zone->tree, &p->node);
H A Dval_anchor.c250 rbtree_insert(anchors->tree, &ta->node);
H A Dval_nsec3.c670 rbtree_insert(table, &c->node);
H A Dval_sigcrypt.c906 if(!rbtree_insert(sortree, &rrs[i].node)) {

Completed in 225 milliseconds