12
12
You should have received a copy of the GNU General Public License
13
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 */
14
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
16
#include "heap_priv.h"
18
18
#include <string.h>
21
using namespace drizzled;
20
23
/* Read first record with the current key */
22
25
int heap_rfirst(HP_INFO *info, unsigned char *record, int inx)
24
HP_SHARE *share = info->s;
25
HP_KEYDEF *keyinfo = share->keydef + inx;
27
27
info->lastinx= inx;
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, left))))
35
memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos),
36
sizeof(unsigned char*));
37
info->current_ptr = pos;
38
hp_extract_record(share, record, pos);
40
If we're performing index_first on a table that was taken from
41
table cache, info->lastkey_len is initialized to previous query.
42
Thus we set info->lastkey_len to proper value for subsequent
44
This is needed for DELETE queries only, otherwise this variable is
46
Note that the same workaround may be needed for heap_rlast(), but
47
for now heap_rlast() is never used for DELETE queries.
50
info->update = HA_STATE_AKTIV;
54
my_errno = HA_ERR_END_OF_FILE;
61
if (!(info->s->records))
63
my_errno=HA_ERR_END_OF_FILE;
29
if (!(info->getShare()->records))
31
errno=HA_ERR_END_OF_FILE;
66
34
assert(0); /* TODO fix it */
67
35
info->current_record=0;