summaryrefslogtreecommitdiffstats
path: root/storage/heap/hp_rlast.c
diff options
context:
space:
mode:
Diffstat (limited to 'storage/heap/hp_rlast.c')
-rw-r--r--storage/heap/hp_rlast.c56
1 files changed, 56 insertions, 0 deletions
diff --git a/storage/heap/hp_rlast.c b/storage/heap/hp_rlast.c
new file mode 100644
index 00000000..ed9c3499
--- /dev/null
+++ b/storage/heap/hp_rlast.c
@@ -0,0 +1,56 @@
+/* Copyright (c) 2000-2002, 2005-2007 MySQL AB
+ Use is subject to license terms
+
+ 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; version 2 of the License.
+
+ 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1335 USA */
+
+#include "heapdef.h"
+
+ /* Read first record with the current key */
+
+
+int heap_rlast(HP_INFO *info, uchar *record, int inx)
+{
+ HP_SHARE *share= info->s;
+ HP_KEYDEF *keyinfo= share->keydef + inx;
+
+ DBUG_ENTER("heap_rlast");
+ info->lastinx= inx;
+ info->key_version= info->s->key_version;
+ if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
+ {
+ uchar *pos;
+
+ if ((pos = tree_search_edge(&keyinfo->rb_tree, info->parents,
+ &info->last_pos, offsetof(TREE_ELEMENT, right))))
+ {
+ memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos),
+ sizeof(uchar*));
+ info->current_ptr = pos;
+ memcpy(record, pos, (size_t)share->reclength);
+ info->update = HA_STATE_AKTIV;
+ }
+ else
+ {
+ my_errno = HA_ERR_END_OF_FILE;
+ DBUG_RETURN(my_errno);
+ }
+ DBUG_RETURN(0);
+ }
+ else
+ {
+ /* We can't scan a non existing key value with hash index */
+ my_errno= HA_ERR_WRONG_COMMAND;
+ DBUG_RETURN(my_errno);
+ }
+}