hp_rfirst.c 2.27 KB
Newer Older
unknown's avatar
unknown committed
1
/* Copyright (C) 2000-2002, 2004 MySQL AB
unknown's avatar
unknown committed
2

unknown's avatar
unknown committed
3 4
   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
unknown's avatar
unknown committed
5
   the Free Software Foundation; version 2 of the License.
unknown's avatar
unknown committed
6

unknown's avatar
unknown committed
7 8 9 10
   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.
unknown's avatar
unknown committed
11

unknown's avatar
unknown committed
12 13 14 15 16 17 18 19
   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 first record with the current key */

20
int heap_rfirst(HP_INFO *info, uchar *record, int inx)
unknown's avatar
unknown committed
21
{
22
  HP_SHARE *share = info->s;
unknown's avatar
unknown committed
23
  HP_KEYDEF *keyinfo = share->keydef + inx;
24
  
unknown's avatar
unknown committed
25
  DBUG_ENTER("heap_rfirst");
unknown's avatar
unknown committed
26
  info->lastinx= inx;
27
  if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
28
  {
29
    uchar *pos;
30 31 32 33

    if ((pos = tree_search_edge(&keyinfo->rb_tree, info->parents,
                                &info->last_pos, offsetof(TREE_ELEMENT, left))))
    {
unknown's avatar
unknown committed
34
      memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos), 
35
	     sizeof(uchar*));
36 37
      info->current_ptr = pos;
      memcpy(record, pos, (size_t)share->reclength);
38 39 40 41 42 43 44 45 46 47 48
      /*
        If we're performing index_first on a table that was taken from
        table cache, info->lastkey_len is initialized to previous query.
        Thus we set info->lastkey_len to proper value for subsequent
        heap_rnext() calls.
        This is needed for DELETE queries only, otherwise this variable is
        not used.
        Note that the same workaround may be needed for heap_rlast(), but
        for now heap_rlast() is never used for DELETE queries.
      */
      info->lastkey_len= 0;
49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64
      info->update = HA_STATE_AKTIV;
    }
    else
    {
      my_errno = HA_ERR_END_OF_FILE;
      DBUG_RETURN(my_errno);
    }
    DBUG_RETURN(0);
  }
  else
  {
    if (!(info->s->records))
    {
      my_errno=HA_ERR_END_OF_FILE;
      DBUG_RETURN(my_errno);
    }
65
    DBUG_ASSERT(0); /* TODO fix it */
66 67 68 69
    info->current_record=0;
    info->current_hash_ptr=0;
    info->update=HA_STATE_PREV_FOUND;
    DBUG_RETURN(heap_rnext(info,record));
70
  }
unknown's avatar
unknown committed
71
}