Lines Matching defs:tree
407 /* Locks the tree structure (prevents nodes appearing/disappearing) */
409 /* Locks for individual tree nodes */
451 dns_rbt_t * tree;
607 * If 'paused' is ISC_TRUE, then the tree lock is not being held.
884 * pick the next tree to (start to) destroy
886 treep = &rbtdb->tree;
1523 result = dns_rbt_deletenode(rbtdb->tree, node, ISC_FALSE);
1531 * tree before deleting from the main tree.
1556 result = dns_rbt_deletenode(rbtdb->tree, node, ISC_FALSE);
1583 * to wait for the tree write lock.
1585 * The caller must hold a tree write lock and bucketnum'th node (write) lock.
1597 * Since we're holding a tree write lock, it should be
1632 * happens to hold a write lock on the tree, it's a good chance to purge dead
1751 * Attempt to switch to a write lock on the tree. If this fails,
1758 * the node lock before acquiring the tree write lock because
1885 * Prune the tree by recursively cleaning-up single leaves. In the worst
1886 * case, the number of iteration is the number of tree levels, which is at
2389 * We acquire a tree write lock here in order to make
2466 result = dns_rbt_addnode(rbtdb->tree, &foundname, &node);
2494 result = dns_rbt_addnode(rbtdb->tree, &foundname,
2507 findnodeintree(dns_rbtdb_t *rbtdb, dns_rbt_t *tree, dns_name_t *name,
2515 INSIST(tree == rbtdb->tree || tree == rbtdb->nsec3);
2519 result = dns_rbt_findnode(tree, name, NULL, &node, NULL,
2535 result = dns_rbt_addnode(tree, name, &node);
2538 if (tree == rbtdb->tree && rbtdb->rpz_cidr != NULL) {
2555 if (tree == rbtdb->tree) {
2566 if (tree == rbtdb->nsec3)
2574 if (tree == rbtdb->nsec3)
2593 return (findnodeintree(rbtdb, rbtdb->tree, name, create, nodep));
3124 * Caller must be holding the tree lock and MUST NOT be holding
3198 result = dns_rbt_findnode(rbtdb->tree, wname,
3340 * It is the first node sought in the NSEC tree.
3357 * name in the NSEC tree implies that the first
3358 * node checked in the main tree had an
3360 * Try the previous node in the NSEC tree.
3376 * tree for the name of a third or earlier NSEC node in
3377 * the main tree. Previous trips through the NSEC tree
3378 * must have found nodes in the main tree with NSEC
3389 * Construct the name to seek in the main tree.
3396 result = dns_rbt_findnode(search->rbtdb->tree, target, NULL,
3403 * There should always be a node in the main tree with the
3404 * same name as the node in the auxiliary NSEC tree, except for
3405 * nodes in the auxiliary tree that are awaiting deletion.
3425 dns_rdataset_t *sigrdataset, dns_rbt_t *tree,
3441 if (tree == search->rbtdb->nsec3) {
3452 * Use the auxiliary tree only starting with the second node in the
3589 result = dns_rbtnodechain_last(&search->chain, tree,
3629 dns_rbt_t *tree;
3670 * Search down from the root of the tree. If, while going down, we
3674 tree = (options & DNS_DBFIND_FORCENSEC3) != 0 ? search.rbtdb->nsec3 :
3675 search.rbtdb->tree;
3676 result = dns_rbt_findnode(tree, name, foundname, &node,
3720 rdataset, sigrdataset, tree,
3976 search.rbtdb->tree,
4271 * Caller must be holding the tree lock.
4564 * Search the CDIR block tree of a response policy tree of trees for all of
4651 * corresponding to CDIR tree entry.
4654 result = dns_rbt_findnode(rbtdb->tree, qname, NULL,
4807 * Search down from the root of the tree. If, while going down, we
4811 result = dns_rbt_findnode(search.rbtdb->tree, name, foundname, &node,
5147 * Search down from the root of the tree.
5149 result = dns_rbt_findnode(search.rbtdb->tree, name, foundname, &node,
5368 * Caller must hold a tree lock.
6507 * Add to the auxiliary NSEC tree if we're adding an NSEC record.
6516 * If we're adding a delegation type, adding to the auxiliary NSEC tree,
6518 * the tree. In the latter case the lock does not necessarily have to
6548 * If we've been holding a write lock on the tree just for
6842 * load a non-NSEC3 node in the main tree and optionally to the auxiliary NSEC
6851 noderesult = dns_rbt_addnode(rbtdb->tree, name, nodep);
6862 * Add a node to the auxiliary NSEC tree for an old node
6872 * Build the auxiliary tree for NSECs as we go.
6873 * This tree speeds searches for closest NSECs that would otherwise
6876 * Add nodes to the auxiliary tree after corresponding nodes have
6877 * been added to the main tree.
6899 nsecresult = dns_rbt_deletenode(rbtdb->tree, *nodep, ISC_FALSE);
7169 count = dns_rbt_nodecount(rbtdb->tree);
7657 result = dns_rbt_create(mctx, delete_callback, rbtdb, &rbtdb->tree);
7710 result = dns_rbt_addnode(rbtdb->tree, &rbtdb->common.origin,
7733 * Add an apex node to the NSEC3 tree so that NSEC3 searches
7735 * record in the tree.
8329 * Note that "%d node of %d in tree" can report things like
8330 * "flush_deletions: 59 nodes of 41 in tree". This means
8336 "flush_deletions: %d nodes of %d in tree",
8338 dns_rbt_nodecount(rbtdb->tree));
8439 rbtdb->tree, name, origin);
8456 result = ISC_R_NOMORE; /* The tree is empty. */
8493 result = dns_rbtnodechain_last(rbtdbiter->current, rbtdb->tree,
8505 result = ISC_R_NOMORE; /* The tree is empty. */
8543 result = dns_rbt_findnode(rbtdb->tree, name, NULL,
8552 result = dns_rbt_findnode(rbtdb->tree, name, NULL,
8629 result = dns_rbtnodechain_last(rbtdbiter->current, rbtdb->tree,