1 | /* Copyright (c) 2000-2002, 2005-2007 MySQL AB |
2 | Use is subject to license terms |
3 | |
4 | This program is free software; you can redistribute it and/or modify |
5 | it under the terms of the GNU General Public License as published by |
6 | the Free Software Foundation; version 2 of the License. |
7 | |
8 | This program is distributed in the hope that it will be useful, |
9 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
11 | GNU General Public License for more details. |
12 | |
13 | You should have received a copy of the GNU General Public License |
14 | along with this program; if not, write to the Free Software |
15 | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA */ |
16 | |
17 | #include "heapdef.h" |
18 | |
19 | /* Read first record with the current key */ |
20 | |
21 | |
22 | int heap_rlast(HP_INFO *info, uchar *record, int inx) |
23 | { |
24 | HP_SHARE *share= info->s; |
25 | HP_KEYDEF *keyinfo= share->keydef + inx; |
26 | |
27 | DBUG_ENTER("heap_rlast" ); |
28 | info->lastinx= inx; |
29 | info->key_version= info->s->key_version; |
30 | if (keyinfo->algorithm == HA_KEY_ALG_BTREE) |
31 | { |
32 | uchar *pos; |
33 | |
34 | if ((pos = tree_search_edge(&keyinfo->rb_tree, info->parents, |
35 | &info->last_pos, offsetof(TREE_ELEMENT, right)))) |
36 | { |
37 | memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos), |
38 | sizeof(uchar*)); |
39 | info->current_ptr = pos; |
40 | memcpy(record, pos, (size_t)share->reclength); |
41 | info->update = HA_STATE_AKTIV; |
42 | } |
43 | else |
44 | { |
45 | my_errno = HA_ERR_END_OF_FILE; |
46 | DBUG_RETURN(my_errno); |
47 | } |
48 | DBUG_RETURN(0); |
49 | } |
50 | else |
51 | { |
52 | /* We can't scan a non existing key value with hash index */ |
53 | my_errno= HA_ERR_WRONG_COMMAND; |
54 | DBUG_RETURN(my_errno); |
55 | } |
56 | } |
57 | |