Lines Matching defs:tree
77 * structures are stored in two places: a per-process AVL tree sorted
89 * is immediately added to both the process's tree and the semaphore's
101 * from both the AVL tree and the semaphore's list, and releases the
107 * up all undo structures found in the tree -- a coexecuting sem_rmid
109 * the AVL tree (using avl_destroy_nodes) and for each undo structure
609 avl_tree_t *tree;
614 tree = pp->p_semacct;
618 while (undo = avl_destroy_nodes(tree, &cookie)) {
646 avl_destroy(tree);
647 kmem_free(tree, sizeof (avl_tree_t));
803 * the process's avl tree and the semaphore's list.
811 avl_tree_t *tree = NULL;
822 tree = kmem_alloc(sizeof (avl_tree_t), KM_SLEEP);
827 if (tree)
828 kmem_free(tree, sizeof (avl_tree_t));
833 if (tree) {
835 avl_create(tree, sem_undo_compar,
838 pp->p_semacct = tree;
840 kmem_free(tree, sizeof (avl_tree_t));