1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
/* Copyright (C) 2000-2002, 2004-2005 MySQL AB
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
the Free Software Foundation; version 2 of the License.
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.
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 */
/* Update current record in heap-database */
#include "heap_priv.h"
int heap_update(HP_INFO *info, const unsigned char *old_record, const unsigned char *new_record)
{
HP_KEYDEF *keydef, *end, *p_lastinx;
unsigned char *pos;
bool auto_key_changed= 0;
HP_SHARE *share= info->s;
uint32_t old_length, new_length;
uint32_t old_chunk_count, new_chunk_count;
test_active(info);
pos=info->current_ptr;
if (info->opt_flag & READ_CHECK_USED && hp_rectest(info,old_record))
return(my_errno); /* Record changed */
old_length = hp_get_encoded_data_length(share, old_record, &old_chunk_count);
new_length = hp_get_encoded_data_length(share, new_record, &new_chunk_count);
if (new_chunk_count > old_chunk_count) {
/* extend the old chunkset size as necessary, but do not shrink yet */
if (hp_reallocate_chunkset(&share->recordspace, new_chunk_count, pos)) {
return(my_errno); /* Out of memory or table space */
}
}
if (--(share->records) < share->blength >> 1) share->blength>>= 1;
share->changed=1;
p_lastinx= share->keydef + info->lastinx;
for (keydef= share->keydef, end= keydef + share->keys; keydef < end; keydef++)
{
if (hp_rec_key_cmp(keydef, old_record, new_record, 0))
{
if ((*keydef->delete_key)(info, keydef, old_record, pos, keydef == p_lastinx) ||
(*keydef->write_key)(info, keydef, new_record, pos))
goto err;
if (share->auto_key == (uint) (keydef - share->keydef + 1))
auto_key_changed= 1;
}
}
hp_copy_record_data_to_chunkset(share, new_record, pos);
if (++(share->records) == share->blength) share->blength+= share->blength;
if (new_chunk_count < old_chunk_count) {
/* Shrink the chunkset to its new size */
hp_reallocate_chunkset(&share->recordspace, new_chunk_count, pos);
}
if (auto_key_changed)
heap_update_auto_increment(info, new_record);
return(0);
err:
if (my_errno == HA_ERR_FOUND_DUPP_KEY)
{
info->errkey = (int) (keydef - share->keydef);
if (keydef->algorithm == HA_KEY_ALG_BTREE)
{
/* we don't need to delete non-inserted key from rb-tree */
if ((*keydef->write_key)(info, keydef, old_record, pos))
{
if (++(share->records) == share->blength)
share->blength+= share->blength;
return(my_errno);
}
keydef--;
}
while (keydef >= share->keydef)
{
if (hp_rec_key_cmp(keydef, old_record, new_record, 0))
{
if ((*keydef->delete_key)(info, keydef, new_record, pos, 0) ||
(*keydef->write_key)(info, keydef, old_record, pos))
break;
}
keydef--;
}
}
if (++(share->records) == share->blength)
share->blength+= share->blength;
if (new_chunk_count > old_chunk_count) {
/* Shrink the chunkset to its original size */
hp_reallocate_chunkset(&share->recordspace, old_chunk_count, pos);
}
return(my_errno);
} /* heap_update */
|