← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to storage/heap/hp_rkey.c

  • Committer: brian
  • Date: 2008-06-25 05:29:13 UTC
  • Revision ID: brian@localhost.localdomain-20080625052913-6upwo0jsrl4lnapl
clean slate

Show diffs side-by-side

added added

removed removed

Lines of Context:
storage/heap/hp_rkey.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
 
 
20
 
int heap_rkey(HP_INFO *info, unsigned char *record, int inx, const unsigned char *key,
 
16
#include "heapdef.h"
 
17
 
 
18
int heap_rkey(HP_INFO *info, uchar *record, int inx, const uchar *key, 
21
19
              key_part_map keypart_map, enum ha_rkey_function find_flag)
22
20
{
23
 
  unsigned char *pos;
 
21
  uchar *pos;
24
22
  HP_SHARE *share= info->s;
25
23
  HP_KEYDEF *keyinfo= share->keydef + inx;
 
24
  DBUG_ENTER("heap_rkey");
 
25
  DBUG_PRINT("enter",("info: 0x%lx  inx: %d", (long) info, inx));
26
26
 
27
27
  if ((uint) inx >= share->keys)
28
28
  {
29
 
    return(errno= HA_ERR_WRONG_INDEX);
 
29
    DBUG_RETURN(my_errno= HA_ERR_WRONG_INDEX);
30
30
  }
31
31
  info->lastinx= inx;
32
 
  info->current_record= UINT32_MAX;             /* For heap_rrnd() */
 
32
  info->current_record= (ulong) ~0L;            /* For heap_rrnd() */
33
33
 
34
34
  if (keyinfo->algorithm == HA_KEY_ALG_BTREE)
35
35
  {
36
36
    heap_rb_param custom_arg;
37
37
 
38
38
    custom_arg.keyseg= info->s->keydef[inx].seg;
39
 
    custom_arg.key_length= info->lastkey_len=
40
 
      hp_rb_pack_key(keyinfo, (unsigned char*) info->lastkey,
41
 
                     (unsigned char*) key, keypart_map);
 
39
    custom_arg.key_length= info->lastkey_len= 
 
40
      hp_rb_pack_key(keyinfo, (uchar*) info->lastkey,
 
41
                     (uchar*) key, keypart_map);
42
42
    custom_arg.search_flag= SEARCH_FIND | SEARCH_SAME;
43
43
    /* for next rkey() after deletion */
44
44
    if (find_flag == HA_READ_AFTER_KEY)
47
47
      info->last_find_flag= HA_READ_KEY_OR_PREV;
48
48
    else
49
49
      info->last_find_flag= find_flag;
50
 
    if (!(pos= (unsigned char *)tree_search_key(&keyinfo->rb_tree,
51
 
                                                info->lastkey, info->parents,
52
 
                                                &info->last_pos,
53
 
                                                find_flag, &custom_arg)))
 
50
    if (!(pos= tree_search_key(&keyinfo->rb_tree, info->lastkey, info->parents,
 
51
                               &info->last_pos, find_flag, &custom_arg)))
54
52
    {
55
53
      info->update= 0;
56
 
      return(errno= HA_ERR_KEY_NOT_FOUND);
 
54
      DBUG_RETURN(my_errno= HA_ERR_KEY_NOT_FOUND);
57
55
    }
58
 
    memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos), sizeof(unsigned char*));
 
56
    memcpy(&pos, pos + (*keyinfo->get_key_length)(keyinfo, pos), sizeof(uchar*));
59
57
    info->current_ptr= pos;
60
58
  }
61
59
  else
63
61
    if (!(pos= hp_search(info, share->keydef + inx, key, 0)))
64
62
    {
65
63
      info->update= 0;
66
 
      return(errno);
 
64
      DBUG_RETURN(my_errno);
67
65
    }
68
 
    if (!(keyinfo->flag & HA_NOSAME))
 
66
    if (!(keyinfo->flag & HA_NOSAME) || (keyinfo->flag & HA_END_SPACE_KEY))
69
67
      memcpy(info->lastkey, key, (size_t) keyinfo->length);
70
68
  }
71
 
  hp_extract_record(share, record, pos);
 
69
  memcpy(record, pos, (size_t) share->reclength);
72
70
  info->update= HA_STATE_AKTIV;
73
 
  return(0);
 
71
  DBUG_RETURN(0);
74
72
}
75
73
 
76
74
 
77
75
        /* Quick find of record */
78
76
 
79
 
unsigned char* heap_find(HP_INFO *info, int inx, const unsigned char *key)
 
77
uchar* heap_find(HP_INFO *info, int inx, const uchar *key)
80
78
{
81
79
  return hp_search(info, info->s->keydef + inx, key, 0);
82
80
}