Lines Matching defs:delete
669 * common code to delete (d) from the leaf position.
680 avl_node_t *delete;
693 delete = AVL_DATA2NODE(data, off);
705 if (delete->avl_child[0] != NULL && delete->avl_child[1] != NULL) {
710 old_balance = AVL_XBALANCE(delete);
718 for (node = delete->avl_child[left];
725 * move 'node' to delete's spot in the tree
729 *node = *delete;
745 delete = &tmp;
746 parent = AVL_XPARENT(delete);
747 parent->avl_child[AVL_XCHILD(delete)] = delete;
748 which_child = (delete->avl_child[1] != 0);
749 if (delete->avl_child[which_child] != NULL)
750 AVL_SETPARENT(delete->avl_child[which_child], delete);
755 * Here we know "delete" is at least partially a leaf node. It can
760 parent = AVL_XPARENT(delete);
761 which_child = AVL_XCHILD(delete);
762 if (delete->avl_child[0] != NULL)
763 node = delete->avl_child[0];
765 node = delete->avl_child[1];
768 * Connect parent directly to node (leaving out delete).