Lines Matching refs:tree
408 /* Locks the tree structure (prevents nodes appearing/disappearing) */
410 /* Locks for individual tree nodes */
452 dns_rbt_t * tree;
606 * If 'paused' is ISC_TRUE, then the tree lock is not being held.
879 if (rbtdb->tree != NULL) {
881 result = dns_rbt_destroy2(&rbtdb->tree, rbtdb->quantum);
899 INSIST(result == ISC_R_SUCCESS && rbtdb->tree == NULL);
1506 * to wait for the tree write lock.
1508 * The caller must hold a tree write lock and bucketnum'th node (write) lock.
1521 * Since we're holding a tree write lock, it should be
1532 result = dns_rbt_deletenode(rbtdb->tree, node,
1567 * happens to hold a write lock on the tree, it's a good chance to purge dead
1689 * Attempt to switch to a write lock on the tree. If this fails,
1696 * the node lock before acquiring the tree write lock because
1799 result = dns_rbt_deletenode(rbtdb->tree, node,
1837 * Prune the tree by recursively cleaning-up single leaves. In the worst
1838 * case, the number of iteration is the number of tree levels, which is at
2356 * We acquire a tree write lock here in order to make
2433 result = dns_rbt_addnode(rbtdb->tree, &foundname, &node);
2460 result = dns_rbt_addnode(rbtdb->tree, &foundname,
2472 findnodeintree(dns_rbtdb_t *rbtdb, dns_rbt_t *tree, dns_name_t *name,
2480 INSIST(tree == rbtdb->tree || tree == rbtdb->nsec3);
2484 result = dns_rbt_findnode(tree, name, NULL, &node, NULL,
2500 result = dns_rbt_addnode(tree, name, &node);
2509 if (tree == rbtdb->tree) {
2523 if (tree == rbtdb->nsec3)
2531 if (tree == rbtdb->nsec3)
2550 return (findnodeintree(rbtdb, rbtdb->tree, name, create, nodep));
3081 * Caller must be holding the tree lock and MUST NOT be holding
3155 result = dns_rbt_findnode(rbtdb->tree, wname,
3271 dns_rdataset_t *sigrdataset, dns_rbt_t *tree,
3285 if (tree == search->rbtdb->nsec3) {
3419 result = dns_rbtnodechain_last(&search->chain, tree,
3459 dns_rbt_t *tree;
3500 * Search down from the root of the tree. If, while going down, we
3504 tree = (options & DNS_DBFIND_FORCENSEC3) != 0 ? search.rbtdb->nsec3 :
3505 search.rbtdb->tree;
3506 result = dns_rbt_findnode(tree, name, foundname, &node,
3550 rdataset, sigrdataset, tree,
3806 search.rbtdb->tree,
4100 * Caller must be holding the tree lock.
4421 * Search down from the root of the tree. If, while going down, we
4425 result = dns_rbt_findnode(search.rbtdb->tree, name, foundname, &node,
4761 * Search down from the root of the tree.
4763 result = dns_rbt_findnode(search.rbtdb->tree, name, foundname, &node,
4982 * Caller must hold a tree lock.
6130 * state, hold an exclusive lock on the tree. In the latter case
6161 * If we've been holding a write lock on the tree just for
6483 result = dns_rbt_addnode(rbtdb->tree, name, &node);
6679 count = dns_rbt_nodecount(rbtdb->tree);
7159 result = dns_rbt_create(mctx, delete_callback, rbtdb, &rbtdb->tree);
7188 result = dns_rbt_addnode(rbtdb->tree, &rbtdb->common.origin,
7211 * Add an apex node to the NSEC3 tree so that NSEC3 searches
7213 * record in the tree.
7809 * Note that "%d node of %d in tree" can report things like
7810 * "flush_deletions: 59 nodes of 41 in tree". This means
7816 "flush_deletions: %d nodes of %d in tree",
7818 dns_rbt_nodecount(rbtdb->tree));
7919 rbtdb->tree, name, origin);
7936 result = ISC_R_NOMORE; /* The tree is empty. */
7973 result = dns_rbtnodechain_last(rbtdbiter->current, rbtdb->tree,
7985 result = ISC_R_NOMORE; /* The tree is empty. */
8023 result = dns_rbt_findnode(rbtdb->tree, name, NULL,
8032 result = dns_rbt_findnode(rbtdb->tree, name, NULL,
8109 result = dns_rbtnodechain_last(rbtdbiter->current, rbtdb->tree,