16
16
/* key handling functions */
18
#include "myisam_priv.h"
19
#include "drizzled/charset_info.h"
20
#include "drizzled/internal/m_string.h"
21
#include <drizzled/util/test.h>
18
#include "myisamdef.h"
19
#include <mystrings/m_ctype.h>
23
static bool _mi_get_prev_key(MI_INFO *info, MI_KEYDEF *keyinfo, unsigned char *page,
24
unsigned char *key, unsigned char *keypos,
25
uint32_t *return_key_length);
21
static my_bool _mi_get_prev_key(MI_INFO *info, MI_KEYDEF *keyinfo, uchar *page,
22
uchar *key, uchar *keypos,
23
uint *return_key_length);
33
31
if (inx < 0 || ! mi_is_key_active(info->s->state.key_map, inx))
35
errno=HA_ERR_WRONG_INDEX;
33
my_errno=HA_ERR_WRONG_INDEX;
38
36
if (info->lastinx != inx) /* Index changed */
58
56
int _mi_search(register MI_INFO *info, register MI_KEYDEF *keyinfo,
59
unsigned char *key, uint32_t key_len, uint32_t nextflag, register my_off_t pos)
57
uchar *key, uint key_len, uint nextflag, register my_off_t pos)
64
unsigned char *keypos,*maxpos;
65
unsigned char lastkey[MI_MAX_KEY_BUFF],*buff;
62
uchar *keypos,*maxpos;
63
uchar lastkey[MI_MAX_KEY_BUFF],*buff;
67
65
if (pos == HA_OFFSET_ERROR)
69
errno=HA_ERR_KEY_NOT_FOUND; /* Didn't find key */
67
my_errno=HA_ERR_KEY_NOT_FOUND; /* Didn't find key */
70
68
info->lastpos= HA_OFFSET_ERROR;
71
69
if (!(nextflag & (SEARCH_SMALLER | SEARCH_BIGGER | SEARCH_LAST)))
72
70
return(-1); /* Not found ; return error */
108
106
if ((error=_mi_search(info,keyinfo,key,key_len,SEARCH_FIND,
109
107
_mi_kpos(nod_flag,keypos))) >= 0 ||
110
errno != HA_ERR_KEY_NOT_FOUND)
108
my_errno != HA_ERR_KEY_NOT_FOUND)
112
110
info->last_keypage= HA_OFFSET_ERROR; /* Buffer not in mem */
115
113
if (pos != info->last_keypage)
117
unsigned char *old_buff=buff;
115
uchar *old_buff=buff;
118
116
if (!(buff=_mi_fetch_keypage(info,keyinfo,pos,DFLT_INIT_HITS,info->buff,
119
117
test(!(nextflag & SEARCH_SAVE_BUFF)))))
125
123
if ((nextflag & (SEARCH_SMALLER | SEARCH_LAST)) && flag != 0)
127
uint32_t not_used[2];
128
126
if (_mi_get_prev_key(info,keyinfo, buff, info->lastkey, keypos,
129
127
&info->lastkey_length))
132
130
ha_key_cmp(keyinfo->seg, info->lastkey, key, key_len, SEARCH_FIND,
135
errno=HA_ERR_KEY_NOT_FOUND; /* Didn't find key */
133
my_errno=HA_ERR_KEY_NOT_FOUND; /* Didn't find key */
167
165
/* ret_pos point to where find or bigger key starts */
170
int _mi_bin_search(MI_INFO *info, register MI_KEYDEF *keyinfo, unsigned char *page,
171
unsigned char *key, uint32_t key_len, uint32_t comp_flag, unsigned char **ret_pos,
172
unsigned char *buff, bool *last_key)
168
int _mi_bin_search(MI_INFO *info, register MI_KEYDEF *keyinfo, uchar *page,
169
uchar *key, uint key_len, uint comp_flag, uchar **ret_pos,
170
uchar *buff __attribute__((unused)), my_bool *last_key)
175
172
register int start,mid,end,save_end;
177
uint32_t totlength,nod_flag,not_used[2];
174
uint totlength,nod_flag,not_used[2];
179
176
totlength=keyinfo->keylength+(nod_flag=mi_test_if_nod(page));
231
int _mi_seq_search(MI_INFO *info, register MI_KEYDEF *keyinfo, unsigned char *page,
232
unsigned char *key, uint32_t key_len, uint32_t comp_flag, unsigned char **ret_pos,
233
unsigned char *buff, bool *last_key)
228
int _mi_seq_search(MI_INFO *info, register MI_KEYDEF *keyinfo, uchar *page,
229
uchar *key, uint key_len, uint comp_flag, uchar **ret_pos,
230
uchar *buff, my_bool *last_key)
236
uint32_t nod_flag,length=0,not_used[2];
237
unsigned char t_buff[MI_MAX_KEY_BUFF],*end;
233
uint nod_flag,length=0,not_used[2];
234
uchar t_buff[MI_MAX_KEY_BUFF],*end;
239
236
end= page+mi_getint(page);
240
237
nod_flag=mi_test_if_nod(page);
247
244
if (length == 0 || page > end)
249
246
mi_print_error(info->s, HA_ERR_CRASHED);
250
errno=HA_ERR_CRASHED;
247
my_errno=HA_ERR_CRASHED;
251
248
return(MI_FOUND_WRONG_KEY);
253
250
if ((flag=ha_key_cmp(keyinfo->seg,t_buff,key,key_len,comp_flag,
263
260
} /* _mi_seq_search */
266
int _mi_prefix_search(MI_INFO *info, register MI_KEYDEF *keyinfo, unsigned char *page,
267
unsigned char *key, uint32_t key_len, uint32_t nextflag, unsigned char **ret_pos,
268
unsigned char *buff, bool *last_key)
263
int _mi_prefix_search(MI_INFO *info, register MI_KEYDEF *keyinfo, uchar *page,
264
uchar *key, uint key_len, uint nextflag, uchar **ret_pos,
265
uchar *buff, my_bool *last_key)
271
268
my_flag is raw comparison result to be changed according to
273
270
flag is the value returned by ha_key_cmp and as treated as final
275
272
int flag=0, my_flag=-1;
276
uint32_t nod_flag, length=0, len, matched, cmplen, kseg_len;
277
uint32_t prefix_len=0,suffix_len;
273
uint nod_flag, length=0, len, matched, cmplen, kseg_len;
274
uint prefix_len=0,suffix_len;
278
275
int key_len_skip, seg_len_pack=0, key_len_left;
279
unsigned char *end, *kseg, *vseg;
280
unsigned char *sort_order=keyinfo->seg->charset->sort_order;
281
unsigned char tt_buff[MI_MAX_KEY_BUFF+2], *t_buff=tt_buff+2;
282
unsigned char *saved_from=NULL, *saved_to=NULL, *saved_vseg=NULL;
283
uint32_t saved_length=0, saved_prefix_len=0;
284
uint32_t length_pack;
276
uchar *end, *kseg, *vseg;
277
uchar *sort_order=keyinfo->seg->charset->sort_order;
278
uchar tt_buff[MI_MAX_KEY_BUFF+2], *t_buff=tt_buff+2;
279
uchar *saved_from=NULL, *saved_to=NULL, *saved_vseg=NULL;
280
uint saved_length=0, saved_prefix_len=0;
287
284
t_buff[0]=0; /* Avoid bugs */
389
386
mi_print_error(info->s, HA_ERR_CRASHED);
390
errno=HA_ERR_CRASHED;
387
my_errno=HA_ERR_CRASHED;
391
388
return(MI_FOUND_WRONG_KEY);
394
391
if (matched >= prefix_len)
396
393
/* We have to compare. But we can still skip part of the key */
398
unsigned char *k=kseg+prefix_len;
395
uchar *k=kseg+prefix_len;
401
398
If prefix_len > cmplen then we are in the end-space comparison
443
440
/* We have to compare k and vseg as if they were space extended */
444
unsigned char *k_end= k+ (cmplen - len);
441
uchar *k_end= k+ (cmplen - len);
445
442
for ( ; k < k_end && *k == ' '; k++) ;
447
444
goto cmp_rest; /* should never happen */
448
if (*k < (unsigned char) ' ')
445
if (*k < (uchar) ' ')
450
447
my_flag= 1; /* Compared string is smaller */
456
453
else if (len > cmplen)
458
unsigned char *vseg_end;
459
456
if ((nextflag & SEARCH_PREFIX) && key_len_left == 0)
462
459
/* We have to compare k and vseg as if they were space extended */
463
460
for (vseg_end= vseg + (len-cmplen) ;
464
vseg < vseg_end && *vseg == (unsigned char) ' ';
461
vseg < vseg_end && *vseg == (uchar) ' ';
465
462
vseg++, matched++) ;
466
463
assert(vseg < vseg_end);
468
if (*vseg > (unsigned char) ' ')
465
if (*vseg > (uchar) ' ')
470
467
my_flag= 1; /* Compared string is smaller */
564
561
/* Save pos to a key_block */
566
void _mi_kpointer(register MI_INFO *info, register unsigned char *buff, my_off_t pos)
563
void _mi_kpointer(register MI_INFO *info, register uchar *buff, my_off_t pos)
568
565
pos/=MI_MIN_KEY_BLOCK_LENGTH;
569
566
switch (info->s->base.key_reflength) {
582
579
case 4: mi_int4store(buff,pos); break;
583
580
case 3: mi_int3store(buff,pos); break;
584
581
case 2: mi_int2store(buff,(uint) pos); break;
585
case 1: buff[0]= (unsigned char) pos; break;
582
case 1: buff[0]= (uchar) pos; break;
586
583
default: abort(); /* impossible */
588
585
} /* _mi_kpointer */
591
588
/* Calc pos to a data-record from a key */
594
my_off_t _mi_dpos(MI_INFO *info, uint32_t nod_flag, unsigned char *after_key)
591
my_off_t _mi_dpos(MI_INFO *info, uint nod_flag, uchar *after_key)
597
594
after_key-=(nod_flag + info->s->rec_reflength);
622
619
/* Calc position from a record pointer ( in delete link chain ) */
624
my_off_t _mi_rec_pos(MYISAM_SHARE *s, unsigned char *ptr)
621
my_off_t _mi_rec_pos(MYISAM_SHARE *s, uchar *ptr)
627
624
switch (s->rec_reflength) {
680
677
/* save position to record */
682
void _mi_dpointer(MI_INFO *info, unsigned char *buff, my_off_t pos)
679
void _mi_dpointer(MI_INFO *info, uchar *buff, my_off_t pos)
684
681
if (!(info->s->options &
685
682
(HA_OPTION_PACK_RECORD | HA_OPTION_COMPRESS_RECORD)) &&
719
716
/* same as _mi_get_key but used with fixed length keys */
721
uint32_t _mi_get_static_key(register MI_KEYDEF *keyinfo, uint32_t nod_flag,
722
register unsigned char **page, register unsigned char *key)
718
uint _mi_get_static_key(register MI_KEYDEF *keyinfo, uint nod_flag,
719
register uchar **page, register uchar *key)
724
memcpy(key, *page, keyinfo->keylength+nod_flag);
721
memcpy((uchar*) key,(uchar*) *page,
722
(size_t) (keyinfo->keylength+nod_flag));
725
723
*page+=keyinfo->keylength+nod_flag;
726
724
return(keyinfo->keylength);
727
725
} /* _mi_get_static_key */
741
739
key_length + length of data pointer
744
uint32_t _mi_get_pack_key(register MI_KEYDEF *keyinfo, uint32_t nod_flag,
745
register unsigned char **page_pos, register unsigned char *key)
742
uint _mi_get_pack_key(register MI_KEYDEF *keyinfo, uint nod_flag,
743
register uchar **page_pos, register uchar *key)
747
745
register HA_KEYSEG *keyseg;
748
unsigned char *start_key,*page=*page_pos;
746
uchar *start_key,*page=*page_pos;
752
750
for (keyseg=keyinfo->seg ; keyseg->type ;keyseg++)
754
752
if (keyseg->flag & HA_PACK_KEY)
756
754
/* key with length, packed to previous key */
757
unsigned char *start=key;
758
uint32_t packed= *page & 128,tot_length,rest_length;
756
uint packed= *page & 128,tot_length,rest_length;
759
757
if (keyseg->length >= 127)
761
759
length=mi_uint2korr(page) & 32767;
807
805
else if (tot_length < 255 && *start == 255)
809
memmove(key+1,key+3,length);
807
memcpy(key+1,key+3,length);
850
848
if (keyseg->flag &
851
849
(HA_VAR_LENGTH_PART | HA_BLOB_PART | HA_SPACE_PACK))
853
unsigned char *tmp=page;
854
852
get_key_length(length,tmp);
855
853
length+=(uint) (tmp-page);
858
856
length=keyseg->length;
860
memcpy(key, page, length);
858
memcpy((uchar*) key,(uchar*) page,(size_t) length);
864
862
length=keyseg->length+nod_flag;
865
memmove(key,page,length);
863
memcpy((uchar*) key,(uchar*) page,length);
866
864
*page_pos= page+length;
867
865
return ((uint) (key-start_key)+keyseg->length);
868
866
} /* _mi_get_pack_key */
872
870
/* key that is packed relatively to previous */
874
uint32_t _mi_get_binary_pack_key(register MI_KEYDEF *keyinfo, uint32_t nod_flag,
875
register unsigned char **page_pos, register unsigned char *key)
872
uint _mi_get_binary_pack_key(register MI_KEYDEF *keyinfo, uint nod_flag,
873
register uchar **page_pos, register uchar *key)
877
875
register HA_KEYSEG *keyseg;
878
unsigned char *start_key,*page,*page_end,*from,*from_end;
876
uchar *start_key,*page,*page_end,*from,*from_end;
882
880
page_end=page+MI_MAX_KEY_BUFF+1;
902
900
if (length > keyinfo->maxlength)
904
902
mi_print_error(keyinfo->share, HA_ERR_CRASHED);
905
errno=HA_ERR_CRASHED;
903
my_errno=HA_ERR_CRASHED;
906
904
return(0); /* Wrong key */
908
906
/* Key is packed against prev key, take prefix from prev key. */
957
955
from=page; from_end=page_end;
959
memmove(key, from, length);
957
memmove((uchar*) key, (uchar*) from, (size_t) length);
983
981
if (from_end != page_end)
985
983
mi_print_error(keyinfo->share, HA_ERR_CRASHED);
986
errno=HA_ERR_CRASHED;
984
my_errno=HA_ERR_CRASHED;
987
985
return(0); /* Error */
989
987
/* Copy data pointer and, if appropriate, key block pointer. */
990
memcpy(key, from, length);
988
memcpy((uchar*) key,(uchar*) from,(size_t) length);
991
989
*page_pos= from+length;
993
991
return((uint) (key-start_key)+keyseg->length);
997
995
/* Get key at position without knowledge of previous key */
998
996
/* Returns pointer to next key */
1000
unsigned char *_mi_get_key(MI_INFO *info, MI_KEYDEF *keyinfo, unsigned char *page,
1001
unsigned char *key, unsigned char *keypos, uint32_t *return_key_length)
998
uchar *_mi_get_key(MI_INFO *info, MI_KEYDEF *keyinfo, uchar *page,
999
uchar *key, uchar *keypos, uint *return_key_length)
1005
1003
nod_flag=mi_test_if_nod(page);
1006
1004
if (! (keyinfo->flag & (HA_VAR_LENGTH_KEY | HA_BINARY_PACK_KEY)))
1008
memmove(key,keypos,keyinfo->keylength+nod_flag);
1006
memcpy((uchar*) key,(uchar*) keypos,keyinfo->keylength+nod_flag);
1009
1007
return(keypos+keyinfo->keylength+nod_flag);
1030
1028
/* Get key at position without knowledge of previous key */
1031
1029
/* Returns 0 if ok */
1033
static bool _mi_get_prev_key(MI_INFO *info, MI_KEYDEF *keyinfo, unsigned char *page,
1034
unsigned char *key, unsigned char *keypos,
1035
uint32_t *return_key_length)
1031
static my_bool _mi_get_prev_key(MI_INFO *info, MI_KEYDEF *keyinfo, uchar *page,
1032
uchar *key, uchar *keypos,
1033
uint *return_key_length)
1039
1037
nod_flag=mi_test_if_nod(page);
1040
1038
if (! (keyinfo->flag & (HA_VAR_LENGTH_KEY | HA_BINARY_PACK_KEY)))
1042
1040
*return_key_length=keyinfo->keylength;
1043
memmove(key, keypos - *return_key_length-nod_flag, *return_key_length);
1041
memcpy((uchar*) key,(uchar*) keypos- *return_key_length-nod_flag,
1042
*return_key_length);
1066
1065
/* Get last key from key-page */
1067
1066
/* Return pointer to where key starts */
1069
unsigned char *_mi_get_last_key(MI_INFO *info, MI_KEYDEF *keyinfo, unsigned char *page,
1070
unsigned char *lastkey, unsigned char *endpos, uint32_t *return_key_length)
1068
uchar *_mi_get_last_key(MI_INFO *info, MI_KEYDEF *keyinfo, uchar *page,
1069
uchar *lastkey, uchar *endpos, uint *return_key_length)
1073
unsigned char *lastpos;
1075
1074
nod_flag=mi_test_if_nod(page);
1076
1075
if (! (keyinfo->flag & (HA_VAR_LENGTH_KEY | HA_BINARY_PACK_KEY)))
1078
1077
lastpos=endpos-keyinfo->keylength-nod_flag;
1079
1078
*return_key_length=keyinfo->keylength;
1080
1079
if (lastpos > page)
1081
memmove(lastkey,lastpos,keyinfo->keylength+nod_flag);
1080
memcpy((uchar*) lastkey,(uchar*) lastpos,keyinfo->keylength+nod_flag);
1103
1102
/* Calculate length of key */
1105
uint32_t _mi_keylength(MI_KEYDEF *keyinfo, register unsigned char *key)
1104
uint _mi_keylength(MI_KEYDEF *keyinfo, register uchar *key)
1107
1106
register HA_KEYSEG *keyseg;
1108
unsigned char *start;
1110
1109
if (! (keyinfo->flag & (HA_VAR_LENGTH_KEY | HA_BINARY_PACK_KEY)))
1111
1110
return (keyinfo->keylength);
1137
1136
after '0xDF' but find 'ss'
1140
uint32_t _mi_keylength_part(MI_KEYDEF *keyinfo, register unsigned char *key,
1139
uint _mi_keylength_part(MI_KEYDEF *keyinfo, register uchar *key,
1141
1140
HA_KEYSEG *end)
1143
1142
register HA_KEYSEG *keyseg;
1144
unsigned char *start= key;
1146
1145
for (keyseg=keyinfo->seg ; keyseg != end ; keyseg++)
1163
1162
/* Move a key */
1165
unsigned char *_mi_move_key(MI_KEYDEF *keyinfo, unsigned char *to, unsigned char *from)
1164
uchar *_mi_move_key(MI_KEYDEF *keyinfo, uchar *to, uchar *from)
1167
register uint32_t length;
1168
length= _mi_keylength(keyinfo, from);
1169
memcpy(to, from, length);
1166
register uint length;
1167
memcpy((uchar*) to, (uchar*) from,
1168
(size_t) (length=_mi_keylength(keyinfo,from)));
1170
1169
return to+length;
1174
1173
/* This can't be used when database is touched after last read */
1176
1175
int _mi_search_next(register MI_INFO *info, register MI_KEYDEF *keyinfo,
1177
unsigned char *key, uint32_t key_length, uint32_t nextflag, my_off_t pos)
1176
uchar *key, uint key_length, uint nextflag, my_off_t pos)
1181
unsigned char lastkey[MI_MAX_KEY_BUFF];
1180
uchar lastkey[MI_MAX_KEY_BUFF];
1183
1182
/* Force full read if we are at last key or if we are not on a leaf
1184
1183
and the key tree has changed since we used it last time
1222
1221
else /* Previous key */
1225
1224
/* Find start of previous key */
1226
1225
info->int_keypos=_mi_get_last_key(info,keyinfo,info->buff,lastkey,
1227
1226
info->int_keypos, &length);
1252
1251
int _mi_search_first(register MI_INFO *info, register MI_KEYDEF *keyinfo,
1253
1252
register my_off_t pos)
1256
unsigned char *page;
1258
1257
if (pos == HA_OFFSET_ERROR)
1260
errno=HA_ERR_KEY_NOT_FOUND;
1259
my_errno=HA_ERR_KEY_NOT_FOUND;
1261
1260
info->lastpos= HA_OFFSET_ERROR;
1294
1293
int _mi_search_last(register MI_INFO *info, register MI_KEYDEF *keyinfo,
1295
1294
register my_off_t pos)
1298
unsigned char *buff,*page;
1300
1299
if (pos == HA_OFFSET_ERROR)
1302
errno=HA_ERR_KEY_NOT_FOUND; /* Didn't find key */
1301
my_errno=HA_ERR_KEY_NOT_FOUND; /* Didn't find key */
1303
1302
info->lastpos= HA_OFFSET_ERROR;
1347
1346
/* Static length key */
1350
_mi_calc_static_key_length(MI_KEYDEF *keyinfo,uint32_t nod_flag,
1351
unsigned char *next_pos,
1352
unsigned char *org_key,
1353
unsigned char *prev_key,
1354
unsigned char *key, MI_KEY_PARAM *s_temp)
1349
_mi_calc_static_key_length(MI_KEYDEF *keyinfo,uint nod_flag,
1350
uchar *next_pos __attribute__((unused)),
1351
uchar *org_key __attribute__((unused)),
1352
uchar *prev_key __attribute__((unused)),
1353
uchar *key, MI_KEY_PARAM *s_temp)
1359
1355
s_temp->key=key;
1360
1356
return (int) (s_temp->totlength=keyinfo->keylength+nod_flag);
1363
1359
/* Variable length key */
1366
_mi_calc_var_key_length(MI_KEYDEF *keyinfo,uint32_t nod_flag,
1367
unsigned char *next_pos,
1368
unsigned char *org_key,
1369
unsigned char *prev_key,
1370
unsigned char *key, MI_KEY_PARAM *s_temp)
1362
_mi_calc_var_key_length(MI_KEYDEF *keyinfo,uint nod_flag,
1363
uchar *next_pos __attribute__((unused)),
1364
uchar *org_key __attribute__((unused)),
1365
uchar *prev_key __attribute__((unused)),
1366
uchar *key, MI_KEY_PARAM *s_temp)
1375
1368
s_temp->key=key;
1376
1369
return (int) (s_temp->totlength=_mi_keylength(keyinfo,key)+nod_flag);
1399
_mi_calc_var_pack_key_length(MI_KEYDEF *keyinfo,uint32_t nod_flag,
1400
unsigned char *next_key,
1401
unsigned char *org_key,
1402
unsigned char *prev_key,
1392
_mi_calc_var_pack_key_length(MI_KEYDEF *keyinfo,uint nod_flag,uchar *next_key,
1393
uchar *org_key, uchar *prev_key, uchar *key,
1404
1394
MI_KEY_PARAM *s_temp)
1406
1396
register HA_KEYSEG *keyseg;
1408
uint32_t key_length,ref_length,org_key_length=0,
1398
uint key_length,ref_length,org_key_length=0,
1409
1399
length_pack,new_key_length,diff_flag,pack_marker;
1410
unsigned char *start,*end,*key_end,*sort_order;
1400
uchar *start,*end,*key_end,*sort_order;
1401
my_bool same_length;
1413
1403
length_pack=s_temp->ref_length=s_temp->n_ref_length=s_temp->n_length=0;
1414
1404
same_length=0; keyseg=keyinfo->seg;
1523
1513
/* If something after that hasn't length=0, test if we can combine */
1524
1514
if ((s_temp->next_key_pos=next_key))
1526
uint32_t packed,n_length;
1516
uint packed,n_length;
1528
1518
packed = *next_key & 128;
1529
1519
if (diff_flag == 2)
1607
1597
if (ref_length+pack_marker > new_ref_length)
1609
uint32_t new_pack_length=new_ref_length-pack_marker;
1599
uint new_pack_length=new_ref_length-pack_marker;
1610
1600
/* We must copy characters from the original key to the next key */
1611
1601
s_temp->part_of_prev_key= new_ref_length;
1612
1602
s_temp->prev_length= ref_length - new_pack_length;
1671
1661
/* Length of key which is prefix compressed */
1674
_mi_calc_bin_pack_key_length(MI_KEYDEF *keyinfo,uint32_t nod_flag,unsigned char *next_key,
1675
unsigned char *org_key, unsigned char *prev_key, unsigned char *key,
1664
_mi_calc_bin_pack_key_length(MI_KEYDEF *keyinfo,uint nod_flag,uchar *next_key,
1665
uchar *org_key, uchar *prev_key, uchar *key,
1676
1666
MI_KEY_PARAM *s_temp)
1678
uint32_t length,key_length,ref_length;
1668
uint length,key_length,ref_length;
1680
1670
s_temp->totlength=key_length=_mi_keylength(keyinfo,key)+nod_flag;
1681
1671
#ifdef HAVE_purify
1690
1680
As keys may be identical when running a sort in myisamchk, we
1691
1681
have to guard against the case where keys may be identical
1694
1684
end=key+key_length;
1695
1685
for ( ; *key == *prev_key && key < end; key++,prev_key++) ;
1696
1686
s_temp->ref_length= ref_length=(uint) (key-s_temp->key);
1705
1695
if ((s_temp->next_key_pos=next_key)) /* If another key after */
1707
1697
/* pack key against next key */
1708
uint32_t next_length,next_length_pack;
1698
uint next_length,next_length_pack;
1709
1699
get_key_pack_length(next_length,next_length_pack,next_key);
1711
1701
/* If first key and next key is packed (only on delete) */
1712
1702
if (!prev_key && org_key && next_length)
1715
1705
for (key= s_temp->key, end=key+next_length ;
1716
1706
*key == *org_key && key < end;
1717
1707
key++,org_key++) ;
1753
1743
/* store key without compression */
1755
void _mi_store_static_key(MI_KEYDEF *keyinfo,
1756
register unsigned char *key_pos,
1745
void _mi_store_static_key(MI_KEYDEF *keyinfo __attribute__((unused)),
1746
register uchar *key_pos,
1757
1747
register MI_KEY_PARAM *s_temp)
1760
memcpy(key_pos, s_temp->key, s_temp->totlength);
1749
memcpy((uchar*) key_pos,(uchar*) s_temp->key,(size_t) s_temp->totlength);
1764
1753
/* store variable length key with prefix compression */
1766
1755
#define store_pack_length(test,pos,length) { \
1767
if (test) { *((pos)++) = (unsigned char) (length); } else \
1768
{ *((pos)++) = (unsigned char) ((length) >> 8); *((pos)++) = (unsigned char) (length); } }
1771
void _mi_store_var_pack_key(MI_KEYDEF *keyinfo,
1772
register unsigned char *key_pos,
1756
if (test) { *((pos)++) = (uchar) (length); } else \
1757
{ *((pos)++) = (uchar) ((length) >> 8); *((pos)++) = (uchar) (length); } }
1760
void _mi_store_var_pack_key(MI_KEYDEF *keyinfo __attribute__((unused)),
1761
register uchar *key_pos,
1773
1762
register MI_KEY_PARAM *s_temp)
1777
unsigned char *start;
1791
1779
/* Not packed against previous key */
1792
1780
store_pack_length(s_temp->pack_marker == 128,key_pos,s_temp->key_length);
1794
assert(key_pos >= start);
1795
length= s_temp->totlength - (key_pos - start);
1796
memmove(key_pos, s_temp->key, length);
1782
memcpy((uchar*) key_pos,(uchar*) s_temp->key,
1783
(length=s_temp->totlength-(uint) (key_pos-start)));
1798
1785
if (!s_temp->next_key_pos) /* No following key */
1834
1821
/* variable length key with prefix compression */
1836
void _mi_store_bin_pack_key(MI_KEYDEF *keyinfo,
1837
register unsigned char *key_pos,
1823
void _mi_store_bin_pack_key(MI_KEYDEF *keyinfo __attribute__((unused)),
1824
register uchar *key_pos,
1838
1825
register MI_KEY_PARAM *s_temp)
1841
assert(s_temp->totlength >= s_temp->ref_length);
1842
1827
store_key_length_inc(key_pos,s_temp->ref_length);
1843
memcpy(key_pos,s_temp->key+s_temp->ref_length,
1844
s_temp->totlength - s_temp->ref_length);
1828
memcpy((char*) key_pos,(char*) s_temp->key+s_temp->ref_length,
1829
(size_t) s_temp->totlength-s_temp->ref_length);
1846
1831
if (s_temp->next_key_pos)