Lines Matching defs:delete
665 * common code to delete (d) from the leaf position.
676 avl_node_t *delete;
689 delete = AVL_DATA2NODE(data, off);
701 if (delete->avl_child[0] != NULL && delete->avl_child[1] != NULL) {
706 old_balance = AVL_XBALANCE(delete);
714 for (node = delete->avl_child[left];
721 * move 'node' to delete's spot in the tree
725 *node = *delete;
741 delete = &tmp;
742 parent = AVL_XPARENT(delete);
743 parent->avl_child[AVL_XCHILD(delete)] = delete;
744 which_child = (delete->avl_child[1] != 0);
745 if (delete->avl_child[which_child] != NULL)
746 AVL_SETPARENT(delete->avl_child[which_child], delete);
751 * Here we know "delete" is at least partially a leaf node. It can
756 parent = AVL_XPARENT(delete);
757 which_child = AVL_XCHILD(delete);
758 if (delete->avl_child[0] != NULL)
759 node = delete->avl_child[0];
761 node = delete->avl_child[1];
764 * Connect parent directly to node (leaving out delete).