1
/* Copyright (C) 2000-2002 MySQL AB
3
This program is free software; you can redistribute it and/or modify
4
it under the terms of the GNU General Public License as published by
5
the Free Software Foundation; version 2 of the License.
7
This program is distributed in the hope that it will be useful,
8
but WITHOUT ANY WARRANTY; without even the implied warranty of
9
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10
GNU General Public License for more details.
12
You should have received a copy of the GNU General Public License
13
along with this program; if not, write to the Free Software
14
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
18
/* Read first record with the current key */
21
int heap_rlast(HP_INFO *info, uchar *record, int inx)
23
HP_SHARE *share= info->s;
24
HP_KEYDEF *keyinfo= share->keydef + inx;
26
DBUG_ENTER("heap_rlast");
28
if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
32
if ((pos = tree_search_edge(&keyinfo->rb_tree, info->parents,
33
&info->last_pos, offsetof(TREE_ELEMENT, right))))
35
memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos),
37
info->current_ptr = pos;
38
memcpy(record, pos, (size_t)share->reclength);
39
info->update = HA_STATE_AKTIV;
43
my_errno = HA_ERR_END_OF_FILE;
44
DBUG_RETURN(my_errno);
51
info->current_hash_ptr=0;
52
info->update=HA_STATE_NEXT_FOUND;
53
DBUG_RETURN(heap_rprev(info,record));