1 files changed, 0 insertions, 87 deletions
diff --git a/heap/hp_rnext.c b/heap/hp_rnext.c
deleted file mode 100644
index a1bc480333e..00000000000
--- a/heap/hp_rnext.c
+++ /dev/null
@@ -1,87 +0,0 @@
-/* Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult AB
-
-   This program is free software; you can redistribute it and/or modify
-   it under the terms of the GNU General Public License as published by
-   the Free Software Foundation; either version 2 of the License, or
-   (at your option) any later version.
-
-   This program is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-   GNU General Public License for more details.
-
-   You should have received a copy of the GNU General Public License
-   along with this program; if not, write to the Free Software
-   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */
-
-#include "heapdef.h"
-
-/* Read next record with the same key */
-
-int heap_rnext(HP_INFO *info, byte *record)
-{
-  byte *pos;
-  HP_SHARE *share=info->s;
-  HP_KEYDEF *keyinfo;
-  DBUG_ENTER("heap_rnext");
-  
-  if (info->lastinx < 0)
-    DBUG_RETURN(my_errno=HA_ERR_WRONG_INDEX);
-
-  keyinfo = share->keydef + info->lastinx;
-  if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
-  {
-    heap_rb_param custom_arg;
-
-    if (info->last_pos)
-      pos = tree_search_next(&keyinfo->rb_tree, &info->last_pos,
-                             offsetof(TREE_ELEMENT, left),
-                             offsetof(TREE_ELEMENT, right));
-    else
-    {
-      custom_arg.keyseg = keyinfo->seg;
-      custom_arg.key_length = info->lastkey_len;
-      custom_arg.search_flag = SEARCH_SAME | SEARCH_FIND;
-      pos = tree_search_key(&keyinfo->rb_tree, info->lastkey, info->parents, 
-                           &info->last_pos, info->last_find_flag, &custom_arg);
-    }
-    if (pos)
-    {
-      memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos), 
-	     sizeof(byte*));
-      info->current_ptr = pos;
-    }
-    else
-    {
-      my_errno = HA_ERR_KEY_NOT_FOUND;
-    }
-  }
-  else
-  {
-    if (info->current_hash_ptr)
-      pos= hp_search_next(info, keyinfo, info->lastkey,
-			   info->current_hash_ptr);
-    else
-    {
-      if (!info->current_ptr && (info->update & HA_STATE_NEXT_FOUND))
-      {
-	pos=0;					/* Read next after last */
-	my_errno=HA_ERR_KEY_NOT_FOUND;
-      }
-      else if (!info->current_ptr)		/* Deleted or first call */
-	pos= hp_search(info, keyinfo, info->lastkey, 0);
-      else
-	pos= hp_search(info, keyinfo, info->lastkey, 1);
-    }
-  }
-  if (!pos)
-  {
-    info->update=HA_STATE_NEXT_FOUND;		/* For heap_rprev */
-    if (my_errno == HA_ERR_KEY_NOT_FOUND)
-      my_errno=HA_ERR_END_OF_FILE;
-    DBUG_RETURN(my_errno);
-  }
-  memcpy(record,pos,(size_t) share->reclength);
-  info->update=HA_STATE_AKTIV | HA_STATE_NEXT_FOUND;
-  DBUG_RETURN(0);
-}