12
12
You should have received a copy of the GNU General Public License
13
13
along with this program; if not, write to the Free Software
14
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
14
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
16
16
/* Update current record in heap-database */
18
#include "heap_priv.h"
20
using namespace drizzled;
20
22
int heap_update(HP_INFO *info, const unsigned char *old_record, const unsigned char *new_record)
22
24
HP_KEYDEF *keydef, *end, *p_lastinx;
23
25
unsigned char *pos;
24
26
bool auto_key_changed= 0;
25
HP_SHARE *share= info->s;
26
uint32_t old_length, new_length;
27
uint32_t old_chunk_count, new_chunk_count;
27
HP_SHARE *share= info->getShare();
30
30
pos=info->current_ptr;
32
32
if (info->opt_flag & READ_CHECK_USED && hp_rectest(info,old_record))
33
return(my_errno); /* Record changed */
35
old_length = hp_get_encoded_data_length(share, old_record, &old_chunk_count);
36
new_length = hp_get_encoded_data_length(share, new_record, &new_chunk_count);
38
if (new_chunk_count > old_chunk_count) {
39
/* extend the old chunkset size as necessary, but do not shrink yet */
40
if (hp_reallocate_chunkset(&share->recordspace, new_chunk_count, pos)) {
41
return(my_errno); /* Out of memory or table space */
33
return(errno); /* Record changed */
45
35
if (--(share->records) < share->blength >> 1) share->blength>>= 1;
51
41
if (hp_rec_key_cmp(keydef, old_record, new_record, 0))
53
if ((*keydef->delete_key)(info, keydef, old_record, pos, keydef == p_lastinx) ||
54
(*keydef->write_key)(info, keydef, new_record, pos))
43
if (hp_delete_key(info, keydef, old_record, pos, keydef == p_lastinx) ||
44
hp_write_key(info, keydef, new_record, pos))
56
48
if (share->auto_key == (uint) (keydef - share->keydef + 1))
57
49
auto_key_changed= 1;
60
52
hp_copy_record_data_to_chunkset(share, new_record, pos);
61
53
if (++(share->records) == share->blength) share->blength+= share->blength;
63
if (new_chunk_count < old_chunk_count) {
64
/* Shrink the chunkset to its new size */
65
hp_reallocate_chunkset(&share->recordspace, new_chunk_count, pos);
68
55
if (auto_key_changed)
69
56
heap_update_auto_increment(info, new_record);
73
if (my_errno == HA_ERR_FOUND_DUPP_KEY)
60
if (errno == HA_ERR_FOUND_DUPP_KEY)
75
62
info->errkey = (int) (keydef - share->keydef);
76
if (keydef->algorithm == HA_KEY_ALG_BTREE)
78
/* we don't need to delete non-inserted key from rb-tree */
79
if ((*keydef->write_key)(info, keydef, old_record, pos))
81
if (++(share->records) == share->blength)
82
share->blength+= share->blength;
87
63
while (keydef >= share->keydef)
89
65
if (hp_rec_key_cmp(keydef, old_record, new_record, 0))
91
if ((*keydef->delete_key)(info, keydef, new_record, pos, 0) ||
92
(*keydef->write_key)(info, keydef, old_record, pos))
67
if (hp_delete_key(info, keydef, new_record, pos, 0) ||
68
hp_write_key(info, keydef, old_record, pos))
99
75
if (++(share->records) == share->blength)
100
76
share->blength+= share->blength;
102
if (new_chunk_count > old_chunk_count) {
103
/* Shrink the chunkset to its original size */
104
hp_reallocate_chunkset(&share->recordspace, old_chunk_count, pos);
108
79
} /* heap_update */