Lines Matching defs:tree

177  * entirely unknown.  bounds are stored in an avl tree sorted by start member
183 	struct vmu_bound *vmb_next; /* NULL in tree else on free or temp list */
308  * Comparison routine for AVL tree. We base our comparison on vmb_start.
346 	avl_tree_t *tree = &(obj->vmo_bounds);
350 	while ((bound = avl_destroy_nodes(tree, &cookie)) != NULL)
352 	avl_destroy(tree);
667 	avl_tree_t	*tree = &(ro->vmo_bounds);
681 	if (walker = avl_find(tree, tmp, &where)) {
689 		walker = avl_nearest(tree, where, AVL_BEFORE);
709 		walker = avl_nearest(tree, where, AVL_AFTER);
720 		avl_insert(tree, tmp, where);
740 		walker = AVL_NEXT(tree, *last);
742 			/* Bottom or mid tree with gap. */
748 			avl_insert_here(tree, tmp, *last, AVL_AFTER);
759 				avl_insert_here(tree, tmp, *last, AVL_AFTER);
773  * tree: avl_tree in which first and last hang.
799 vmu_update_bounds(avl_tree_t *tree, vmu_bound_t **first, vmu_bound_t **last,
821 			next = AVL_NEXT(tree, next);
834 			avl_insert_here(tree, tmp, next, AVL_AFTER);
846 			next = AVL_NEXT(tree, next);
858 vmu_merge_bounds(avl_tree_t *tree, vmu_bound_t **first, vmu_bound_t **last)
863 	ASSERT(tree != NULL);
869 		next = AVL_NEXT(tree, current);
873 			avl_remove(tree, next);
879 			current = AVL_NEXT(tree, current);
896 vmu_amp_update_incore_bounds(avl_tree_t *tree, struct anon_map *amp,
918 			next = AVL_NEXT(tree, next);
961 				avl_insert_here(tree, tmp, next, AVL_AFTER);
981 			next = AVL_NEXT(tree, next);
991 vmu_vnode_update_incore_bounds(avl_tree_t *tree, vnode_t *vnode,
1008 			next = AVL_NEXT(tree, next);
1048 				avl_insert_here(tree, tmp, next, AVL_AFTER);
1068 			next = AVL_NEXT(tree, next);
1349 		avl_tree_t *tree = &(shared_object->vmo_bounds);
1376 					    tree,
1382 					    tree,
1387 				vmu_merge_bounds(tree, &first, &last);
1413 				    &e_last, tree, first, last);