← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to storage/heap/hp_rfirst.c

  • Committer: Monty Taylor
  • Date: 2008-09-15 00:46:33 UTC
  • mfrom: (383.1.55 client-split)
  • Revision ID: monty@inaugust.com-20080915004633-fmjw27fi41cxs35w
Merged from client-split.

Show diffs side-by-side

added added

removed removed

Lines of Context:
storage/heap/hp_rfirst.c
13
13
   along with this program; if not, write to the Free Software
14
14
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */
15
15
 
16
 
#include "heap_priv.h"
17
 
 
18
 
#include <string.h>
19
 
#include <cassert>
20
 
 
21
 
using namespace drizzled;
 
16
#include "heapdef.h"
22
17
 
23
18
/* Read first record with the current key */
24
19
 
25
 
int heap_rfirst(HP_INFO *info, unsigned char *record, int inx)
 
20
int heap_rfirst(HP_INFO *info, uchar *record, int inx)
26
21
{
 
22
  HP_SHARE *share = info->s;
 
23
  HP_KEYDEF *keyinfo = share->keydef + inx;
 
24
  
27
25
  info->lastinx= inx;
28
 
  {
29
 
    if (!(info->getShare()->records))
30
 
    {
31
 
      errno=HA_ERR_END_OF_FILE;
32
 
      return(errno);
 
26
  if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
 
27
  {
 
28
    uchar *pos;
 
29
 
 
30
    if ((pos = tree_search_edge(&keyinfo->rb_tree, info->parents,
 
31
                                &info->last_pos, offsetof(TREE_ELEMENT, left))))
 
32
    {
 
33
      memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos), 
 
34
             sizeof(uchar*));
 
35
      info->current_ptr = pos;
 
36
      hp_extract_record(share, record, pos);
 
37
      /*
 
38
        If we're performing index_first on a table that was taken from
 
39
        table cache, info->lastkey_len is initialized to previous query.
 
40
        Thus we set info->lastkey_len to proper value for subsequent
 
41
        heap_rnext() calls.
 
42
        This is needed for DELETE queries only, otherwise this variable is
 
43
        not used.
 
44
        Note that the same workaround may be needed for heap_rlast(), but
 
45
        for now heap_rlast() is never used for DELETE queries.
 
46
      */
 
47
      info->lastkey_len= 0;
 
48
      info->update = HA_STATE_AKTIV;
 
49
    }
 
50
    else
 
51
    {
 
52
      my_errno = HA_ERR_END_OF_FILE;
 
53
      return(my_errno);
 
54
    }
 
55
    return(0);
 
56
  }
 
57
  else
 
58
  {
 
59
    if (!(info->s->records))
 
60
    {
 
61
      my_errno=HA_ERR_END_OF_FILE;
 
62
      return(my_errno);
33
63
    }
34
64
    assert(0); /* TODO fix it */
35
65
    info->current_record=0;