Lines Matching refs:root
5 * that can be found in the LICENSE file in the root of the source
8 * be found in the AUTHORS file in the root of the source tree.
185 l_tree->root = AVL_NULL;
193 return(l_tree->root == AVL_NULL);
202 /* Balances subtree, returns handle of root node of subtree after balancing.
315 if (l_tree->root == AVL_NULL)
316 l_tree->root = h;
330 ** take the less branch. bit 0 gives branch from root, and
334 AVL_HANDLE hh = l_tree->root;
374 hh = l_tree->root;
416 l_tree->root = unbal;
440 AVL_HANDLE h = l_tree->root;
476 AVL_HANDLE h = l_tree->root;
493 AVL_HANDLE h = l_tree->root;
520 ** take the less branch. bit 0 gives branch from root, and
524 AVL_HANDLE h = l_tree->root;
616 l_tree->root = child;
635 l_tree->root = h;
648 ** to the root node. */
649 h = l_tree->root;
668 /* Climb from the path node to the root node using the linked
711 l_tree->root = h;
722 AVL_HANDLE h = l_tree->root;
750 /* New node is also new root. */
751 l_tree->root = new_node;
779 /* Depth of root node of current subtree. */
793 /* h is root of current subtree, child is one of its children. */
798 l_tree->root = AVL_NULL;
804 /* Subtract one for root of subtree. */
897 l_tree->root = h;
933 AVL_HANDLE h = l_tree->root;
992 AVL_HANDLE h = l_tree->root;
1015 AVL_HANDLE h = l_tree->root;
1042 iter->tree_->root : iter->path_h[iter->depth - 1]);
1055 iter->tree_->root : iter->path_h[iter->depth - 1]), 1);
1097 iter->tree_->root : iter->path_h[iter->depth - 1]), 1);