1
/* Copyright (C) 2000-2002, 2004-2005 MySQL AB
3
This program is free software; you can redistribute it and/or modify
4
it under the terms of the GNU General Public License as published by
5
the Free Software Foundation; version 2 of the License.
7
This program is distributed in the hope that it will be useful,
8
but WITHOUT ANY WARRANTY; without even the implied warranty of
9
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10
GNU General Public License for more details.
12
You should have received a copy of the GNU General Public License
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 */
16
/* Update current record in heap-database */
18
#include "heap_priv.h"
20
using namespace drizzled;
22
int heap_update(HP_INFO *info, const unsigned char *old_record, const unsigned char *new_record)
24
HP_KEYDEF *keydef, *end, *p_lastinx;
26
bool auto_key_changed= 0;
27
HP_SHARE *share= info->s;
28
uint32_t old_length, new_length;
29
uint32_t old_chunk_count, new_chunk_count;
32
pos=info->current_ptr;
34
if (info->opt_flag & READ_CHECK_USED && hp_rectest(info,old_record))
35
return(errno); /* Record changed */
37
old_length = hp_get_encoded_data_length(share, old_record, &old_chunk_count);
38
new_length = hp_get_encoded_data_length(share, new_record, &new_chunk_count);
40
if (new_chunk_count > old_chunk_count) {
41
/* extend the old chunkset size as necessary, but do not shrink yet */
42
if (hp_reallocate_chunkset(&share->recordspace, new_chunk_count, pos)) {
43
return(errno); /* Out of memory or table space */
47
if (--(share->records) < share->blength >> 1) share->blength>>= 1;
50
p_lastinx= share->keydef + info->lastinx;
51
for (keydef= share->keydef, end= keydef + share->keys; keydef < end; keydef++)
53
if (hp_rec_key_cmp(keydef, old_record, new_record, 0))
55
if ((*keydef->delete_key)(info, keydef, old_record, pos, keydef == p_lastinx) ||
56
(*keydef->write_key)(info, keydef, new_record, pos))
58
if (share->auto_key == (uint) (keydef - share->keydef + 1))
62
hp_copy_record_data_to_chunkset(share, new_record, pos);
63
if (++(share->records) == share->blength) share->blength+= share->blength;
65
if (new_chunk_count < old_chunk_count) {
66
/* Shrink the chunkset to its new size */
67
hp_reallocate_chunkset(&share->recordspace, new_chunk_count, pos);
71
heap_update_auto_increment(info, new_record);
75
if (errno == HA_ERR_FOUND_DUPP_KEY)
77
info->errkey = (int) (keydef - share->keydef);
78
if (keydef->algorithm == HA_KEY_ALG_BTREE)
80
/* we don't need to delete non-inserted key from rb-tree */
81
if ((*keydef->write_key)(info, keydef, old_record, pos))
83
if (++(share->records) == share->blength)
84
share->blength+= share->blength;
89
while (keydef >= share->keydef)
91
if (hp_rec_key_cmp(keydef, old_record, new_record, 0))
93
if ((*keydef->delete_key)(info, keydef, new_record, pos, 0) ||
94
(*keydef->write_key)(info, keydef, old_record, pos))
101
if (++(share->records) == share->blength)
102
share->blength+= share->blength;
104
if (new_chunk_count > old_chunk_count) {
105
/* Shrink the chunkset to its original size */
106
hp_reallocate_chunkset(&share->recordspace, old_chunk_count, pos);