mirror of
https://github.com/MariaDB/server.git
synced 2025-01-31 11:01:52 +01:00
6b2d27750e
git-svn-id: file:///svn/mysql/tokudb-engine/tokudb-engine@44264 c7de825b-a66e-492c-adef-691d508d4ae1
1339 lines
43 KiB
C++
1339 lines
43 KiB
C++
#if MYSQL_VERSION_ID < 50500
|
|
|
|
volatile int ha_tokudb_add_index_wait = 0;
|
|
|
|
int
|
|
ha_tokudb::add_index(TABLE *table_arg, KEY *key_info, uint num_of_keys) {
|
|
TOKUDB_DBUG_ENTER("ha_tokudb::add_index");
|
|
DB_TXN* txn = NULL;
|
|
int error;
|
|
bool incremented_numDBs = false;
|
|
bool modified_DBs = false;
|
|
|
|
error = db_env->txn_begin(db_env, 0, &txn, 0);
|
|
if (error) { goto cleanup; }
|
|
|
|
error = tokudb_add_index(
|
|
table_arg,
|
|
key_info,
|
|
num_of_keys,
|
|
txn,
|
|
&incremented_numDBs,
|
|
&modified_DBs
|
|
);
|
|
if (error) { goto cleanup; }
|
|
|
|
cleanup:
|
|
if (error) {
|
|
if (txn) {
|
|
restore_add_index(table_arg, num_of_keys, incremented_numDBs, modified_DBs);
|
|
abort_txn(txn);
|
|
}
|
|
}
|
|
else {
|
|
commit_txn(txn, 0);
|
|
}
|
|
TOKUDB_DBUG_RETURN(error);
|
|
}
|
|
|
|
volatile int ha_tokudb_prepare_drop_index_wait = 0; //debug
|
|
|
|
//
|
|
// Prepares to drop indexes to the table. For each value, i, in the array key_num,
|
|
// table->key_info[i] is a key that is to be dropped.
|
|
// ***********NOTE*******************
|
|
// Although prepare_drop_index is supposed to just get the DB's ready for removal,
|
|
// and not actually do the removal, we are doing it here and not in final_drop_index
|
|
// For the flags we expose in alter_table_flags, namely xxx_NO_WRITES, this is allowed
|
|
// Changes for "future-proofing" this so that it works when we have the equivalent flags
|
|
// that are not NO_WRITES are not worth it at the moments
|
|
// Parameters:
|
|
// [in] table_arg - table that is being modified, seems to be identical to this->table
|
|
// [in] key_num - array of indexes that specify which keys of the array table->key_info
|
|
// are to be dropped
|
|
// num_of_keys - size of array, key_num
|
|
// Returns:
|
|
// 0 on success, error otherwise
|
|
//
|
|
int
|
|
ha_tokudb::prepare_drop_index(TABLE *table_arg, uint *key_num, uint num_of_keys) {
|
|
TOKUDB_DBUG_ENTER("ha_tokudb::prepare_drop_index");
|
|
while (ha_tokudb_prepare_drop_index_wait) sleep(1); // debug
|
|
|
|
int error;
|
|
DB_TXN* txn = NULL;
|
|
|
|
error = db_env->txn_begin(db_env, 0, &txn, 0);
|
|
if (error) { goto cleanup; }
|
|
|
|
error = drop_indexes(table_arg, key_num, num_of_keys, txn);
|
|
if (error) { goto cleanup; }
|
|
|
|
cleanup:
|
|
if (txn) {
|
|
if (error) {
|
|
abort_txn(txn);
|
|
restore_drop_indexes(table_arg, key_num, num_of_keys);
|
|
}
|
|
else {
|
|
commit_txn(txn,0);
|
|
}
|
|
}
|
|
|
|
TOKUDB_DBUG_RETURN(error);
|
|
}
|
|
|
|
volatile int ha_tokudb_final_drop_index_wait = 0; // debug
|
|
|
|
// ***********NOTE*******************
|
|
// Although prepare_drop_index is supposed to just get the DB's ready for removal,
|
|
// and not actually do the removal, we are doing it here and not in final_drop_index
|
|
// For the flags we expose in alter_table_flags, namely xxx_NO_WRITES, this is allowed
|
|
// Changes for "future-proofing" this so that it works when we have the equivalent flags
|
|
// that are not NO_WRITES are not worth it at the moments, therefore, we can make
|
|
// this function just return
|
|
int
|
|
ha_tokudb::final_drop_index(TABLE *table_arg) {
|
|
TOKUDB_DBUG_ENTER("ha_tokudb::final_drop_index");
|
|
while (ha_tokudb_final_drop_index_wait) sleep(1); // debug
|
|
|
|
int error = 0;
|
|
DBUG_EXECUTE_IF("final_drop_index_fail", {
|
|
error = 1;
|
|
});
|
|
TOKUDB_DBUG_RETURN(error);
|
|
}
|
|
|
|
#if defined(HA_GENERAL_ONLINE)
|
|
|
|
//
|
|
// MySQL sets the null_bit as a number that you can bit-wise AND a byte to
|
|
// to evaluate whether a field is NULL or not. This value is a power of 2, from
|
|
// 2^0 to 2^7. We return the position of the bit within the byte, which is
|
|
// lg null_bit
|
|
//
|
|
static inline u_int32_t
|
|
get_null_bit_position(u_int32_t null_bit) {
|
|
u_int32_t retval = 0;
|
|
switch(null_bit) {
|
|
case (1):
|
|
retval = 0;
|
|
break;
|
|
case (2):
|
|
retval = 1;
|
|
break;
|
|
case (4):
|
|
retval = 2;
|
|
break;
|
|
case (8):
|
|
retval = 3;
|
|
break;
|
|
case (16):
|
|
retval = 4;
|
|
break;
|
|
case (32):
|
|
retval = 5;
|
|
break;
|
|
case (64):
|
|
retval = 6;
|
|
break;
|
|
case (128):
|
|
retval = 7;
|
|
break;
|
|
default:
|
|
assert(false);
|
|
}
|
|
return retval;
|
|
}
|
|
|
|
//
|
|
// returns the index of the null bit of field.
|
|
//
|
|
static inline u_int32_t
|
|
get_overall_null_bit_position(TABLE* table, Field* field) {
|
|
u_int32_t offset = get_null_offset(table, field);
|
|
u_int32_t null_bit = field->null_bit;
|
|
return offset*8 + get_null_bit_position(null_bit);
|
|
}
|
|
|
|
static bool
|
|
are_null_bits_in_order(TABLE* table) {
|
|
u_int32_t curr_null_pos = 0;
|
|
bool first = true;
|
|
bool retval = true;
|
|
for (uint i = 0; i < table->s->fields; i++) {
|
|
Field* curr_field = table->field[i];
|
|
bool nullable = (curr_field->null_bit != 0);
|
|
if (nullable) {
|
|
u_int32_t pos = get_overall_null_bit_position(
|
|
table,
|
|
curr_field
|
|
);
|
|
if (!first && pos != curr_null_pos+1){
|
|
retval = false;
|
|
break;
|
|
}
|
|
first = false;
|
|
curr_null_pos = pos;
|
|
}
|
|
}
|
|
return retval;
|
|
}
|
|
|
|
static u_int32_t
|
|
get_first_null_bit_pos(TABLE* table) {
|
|
u_int32_t table_pos = 0;
|
|
for (uint i = 0; i < table->s->fields; i++) {
|
|
Field* curr_field = table->field[i];
|
|
bool nullable = (curr_field->null_bit != 0);
|
|
if (nullable) {
|
|
table_pos = get_overall_null_bit_position(
|
|
table,
|
|
curr_field
|
|
);
|
|
break;
|
|
}
|
|
}
|
|
return table_pos;
|
|
}
|
|
|
|
#if 0
|
|
static bool
|
|
is_column_default_null(TABLE* src_table, u_int32_t field_index) {
|
|
Field* curr_field = src_table->field[field_index];
|
|
bool is_null_default = false;
|
|
bool nullable = curr_field->null_bit != 0;
|
|
if (nullable) {
|
|
u_int32_t null_bit_position = get_overall_null_bit_position(src_table, curr_field);
|
|
is_null_default = is_overall_null_position_set(
|
|
src_table->s->default_values,
|
|
null_bit_position
|
|
);
|
|
}
|
|
return is_null_default;
|
|
}
|
|
#endif
|
|
|
|
static bool
|
|
tables_have_same_keys(TABLE* table, TABLE* altered_table, bool print_error, bool check_field_index) {
|
|
bool retval;
|
|
if (table->s->keys != altered_table->s->keys) {
|
|
if (print_error) {
|
|
sql_print_error("tables have different number of keys");
|
|
}
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
if (table->s->primary_key != altered_table->s->primary_key) {
|
|
if (print_error) {
|
|
sql_print_error(
|
|
"Tables have different primary keys, %d %d",
|
|
table->s->primary_key,
|
|
altered_table->s->primary_key
|
|
);
|
|
}
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
for (u_int32_t i=0; i < table->s->keys; i++) {
|
|
KEY* curr_orig_key = &table->key_info[i];
|
|
KEY* curr_altered_key = &altered_table->key_info[i];
|
|
if (strcmp(curr_orig_key->name, curr_altered_key->name)) {
|
|
if (print_error) {
|
|
sql_print_error(
|
|
"key %d has different name, %s %s",
|
|
i,
|
|
curr_orig_key->name,
|
|
curr_altered_key->name
|
|
);
|
|
}
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
if (((curr_orig_key->flags & HA_CLUSTERING) == 0) != ((curr_altered_key->flags & HA_CLUSTERING) == 0)) {
|
|
if (print_error) {
|
|
sql_print_error(
|
|
"keys disagree on if they are clustering, %d, %d",
|
|
curr_orig_key->key_parts,
|
|
curr_altered_key->key_parts
|
|
);
|
|
}
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
if (((curr_orig_key->flags & HA_NOSAME) == 0) != ((curr_altered_key->flags & HA_NOSAME) == 0)) {
|
|
if (print_error) {
|
|
sql_print_error(
|
|
"keys disagree on if they are unique, %d, %d",
|
|
curr_orig_key->key_parts,
|
|
curr_altered_key->key_parts
|
|
);
|
|
}
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
if (curr_orig_key->key_parts != curr_altered_key->key_parts) {
|
|
if (print_error) {
|
|
sql_print_error(
|
|
"keys have different number of parts, %d, %d",
|
|
curr_orig_key->key_parts,
|
|
curr_altered_key->key_parts
|
|
);
|
|
}
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
//
|
|
// now verify that each field in the key is the same
|
|
//
|
|
for (u_int32_t j = 0; j < curr_orig_key->key_parts; j++) {
|
|
KEY_PART_INFO* curr_orig_part = &curr_orig_key->key_part[j];
|
|
KEY_PART_INFO* curr_altered_part = &curr_altered_key->key_part[j];
|
|
Field* curr_orig_field = curr_orig_part->field;
|
|
Field* curr_altered_field = curr_altered_part->field;
|
|
if (curr_orig_part->length != curr_altered_part->length) {
|
|
if (print_error) {
|
|
sql_print_error(
|
|
"Key %s has different length at index %d",
|
|
curr_orig_key->name,
|
|
j
|
|
);
|
|
}
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
bool are_fields_same;
|
|
are_fields_same = (check_field_index) ?
|
|
(curr_orig_part->fieldnr == curr_altered_part->fieldnr &&
|
|
fields_are_same_type(curr_orig_field, curr_altered_field)) :
|
|
(are_two_fields_same(curr_orig_field,curr_altered_field));
|
|
|
|
if (!are_fields_same) {
|
|
if (print_error) {
|
|
sql_print_error(
|
|
"Key %s has different field at index %d",
|
|
curr_orig_key->name,
|
|
j
|
|
);
|
|
}
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
}
|
|
}
|
|
|
|
retval = true;
|
|
cleanup:
|
|
return retval;
|
|
}
|
|
|
|
void
|
|
ha_tokudb::print_alter_info(
|
|
TABLE *altered_table,
|
|
HA_CREATE_INFO *create_info,
|
|
HA_ALTER_FLAGS *alter_flags,
|
|
uint table_changes
|
|
)
|
|
{
|
|
printf("***are keys of two tables same? %d\n", tables_have_same_keys(table,altered_table,false, false));
|
|
printf("***alter flags set ***\n");
|
|
for (uint i = 0; i < HA_MAX_ALTER_FLAGS; i++) {
|
|
if (alter_flags->is_set(i)) {
|
|
printf("flag: %d\n", i);
|
|
}
|
|
}
|
|
//
|
|
// everyone calculates data by doing some default_values - record[0], but I do not see why
|
|
// that is necessary
|
|
//
|
|
printf("******\n");
|
|
printf("***orig table***\n");
|
|
for (uint i = 0; i < table->s->fields; i++) {
|
|
//
|
|
// make sure to use table->field, and NOT table->s->field
|
|
//
|
|
Field* curr_field = table->field[i];
|
|
uint null_offset = get_null_offset(table, curr_field);
|
|
printf(
|
|
"name: %s, nullable: %d, null_offset: %d, is_null_field: %d, is_null %d, \n",
|
|
curr_field->field_name,
|
|
curr_field->null_bit,
|
|
null_offset,
|
|
(curr_field->null_ptr != NULL),
|
|
(curr_field->null_ptr != NULL) ? table->s->default_values[null_offset] & curr_field->null_bit : 0xffffffff
|
|
);
|
|
}
|
|
printf("******\n");
|
|
printf("***altered table***\n");
|
|
for (uint i = 0; i < altered_table->s->fields; i++) {
|
|
Field* curr_field = altered_table->field[i];
|
|
uint null_offset = get_null_offset(altered_table, curr_field);
|
|
printf(
|
|
"name: %s, nullable: %d, null_offset: %d, is_null_field: %d, is_null %d, \n",
|
|
curr_field->field_name,
|
|
curr_field->null_bit,
|
|
null_offset,
|
|
(curr_field->null_ptr != NULL),
|
|
(curr_field->null_ptr != NULL) ? altered_table->s->default_values[null_offset] & curr_field->null_bit : 0xffffffff
|
|
);
|
|
}
|
|
printf("******\n");
|
|
}
|
|
|
|
|
|
static int
|
|
find_changed_columns(
|
|
u_int32_t* changed_columns,
|
|
u_int32_t* num_changed_columns,
|
|
TABLE* smaller_table,
|
|
TABLE* bigger_table
|
|
)
|
|
{
|
|
uint curr_new_col_index = 0;
|
|
uint i = 0;
|
|
int retval;
|
|
u_int32_t curr_num_changed_columns=0;
|
|
assert(bigger_table->s->fields > smaller_table->s->fields);
|
|
for (i = 0; i < smaller_table->s->fields; i++, curr_new_col_index++) {
|
|
if (curr_new_col_index >= bigger_table->s->fields) {
|
|
sql_print_error("error in determining changed columns");
|
|
retval = 1;
|
|
goto cleanup;
|
|
}
|
|
Field* curr_field_in_new = bigger_table->field[curr_new_col_index];
|
|
Field* curr_field_in_orig = smaller_table->field[i];
|
|
while (!fields_have_same_name(curr_field_in_orig, curr_field_in_new)) {
|
|
changed_columns[curr_num_changed_columns] = curr_new_col_index;
|
|
curr_num_changed_columns++;
|
|
curr_new_col_index++;
|
|
curr_field_in_new = bigger_table->field[curr_new_col_index];
|
|
if (curr_new_col_index >= bigger_table->s->fields) {
|
|
sql_print_error("error in determining changed columns");
|
|
retval = 1;
|
|
goto cleanup;
|
|
}
|
|
}
|
|
// at this point, curr_field_in_orig and curr_field_in_new should be the same, let's verify
|
|
// make sure the two fields that have the same name are ok
|
|
if (!are_two_fields_same(curr_field_in_orig, curr_field_in_new)) {
|
|
sql_print_error(
|
|
"Two fields that were supposedly the same are not: \
|
|
%s in original, %s in new",
|
|
curr_field_in_orig->field_name,
|
|
curr_field_in_new->field_name
|
|
);
|
|
retval = 1;
|
|
goto cleanup;
|
|
}
|
|
}
|
|
for (i = curr_new_col_index; i < bigger_table->s->fields; i++) {
|
|
changed_columns[curr_num_changed_columns] = i;
|
|
curr_num_changed_columns++;
|
|
}
|
|
*num_changed_columns = curr_num_changed_columns;
|
|
retval = 0;
|
|
cleanup:
|
|
return retval;
|
|
}
|
|
|
|
static bool
|
|
column_rename_supported(
|
|
HA_ALTER_INFO* alter_info,
|
|
TABLE* orig_table,
|
|
TABLE* new_table
|
|
)
|
|
{
|
|
bool retval = false;
|
|
bool keys_same_for_cr;
|
|
uint num_fields_with_different_names = 0;
|
|
uint field_with_different_name = orig_table->s->fields;
|
|
if (orig_table->s->fields != new_table->s->fields) {
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
if (alter_info->contains_first_or_after) {
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
|
|
for (uint i = 0; i < orig_table->s->fields; i++) {
|
|
Field* orig_field = orig_table->field[i];
|
|
Field* new_field = new_table->field[i];
|
|
if (!fields_are_same_type(orig_field, new_field)) {
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
if (!fields_have_same_name(orig_field, new_field)) {
|
|
num_fields_with_different_names++;
|
|
field_with_different_name = i;
|
|
}
|
|
}
|
|
// only allow one renamed field
|
|
if (num_fields_with_different_names != 1) {
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
assert(field_with_different_name < orig_table->s->fields);
|
|
//
|
|
// at this point, we have verified that the two tables have
|
|
// the same field types and with ONLY one field with a different name.
|
|
// We have also identified the field with the different name
|
|
//
|
|
// Now we need to check the indexes
|
|
//
|
|
keys_same_for_cr = tables_have_same_keys(
|
|
orig_table,
|
|
new_table,
|
|
false,
|
|
true
|
|
);
|
|
if (!keys_same_for_cr) {
|
|
retval = false;
|
|
goto cleanup;
|
|
}
|
|
retval = true;
|
|
cleanup:
|
|
return retval;
|
|
}
|
|
|
|
int
|
|
ha_tokudb::check_if_supported_alter(TABLE *altered_table,
|
|
HA_CREATE_INFO *create_info,
|
|
HA_ALTER_FLAGS *alter_flags,
|
|
HA_ALTER_INFO *alter_info,
|
|
uint table_changes)
|
|
{
|
|
TOKUDB_DBUG_ENTER("check_if_supported_alter");
|
|
int retval;
|
|
THD* thd = ha_thd();
|
|
bool keys_same = tables_have_same_keys(table,altered_table, false, false);
|
|
|
|
|
|
if (tokudb_debug & TOKUDB_DEBUG_ALTER_TABLE_INFO) {
|
|
printf("has after or first %d\n", alter_info->contains_first_or_after);
|
|
print_alter_info(altered_table, create_info, alter_flags, table_changes);
|
|
}
|
|
bool has_added_columns = alter_flags->is_set(HA_ADD_COLUMN);
|
|
bool has_dropped_columns = alter_flags->is_set(HA_DROP_COLUMN);
|
|
bool has_column_rename = alter_flags->is_set(HA_CHANGE_COLUMN) &&
|
|
alter_flags->is_set(HA_ALTER_COLUMN_NAME);
|
|
//
|
|
// We do not check for changes to foreign keys or primary keys. They are not supported
|
|
// Changing the primary key implies changing keys in all dictionaries. that is why we don't
|
|
// try to make it fast
|
|
//
|
|
bool has_indexing_changes = alter_flags->is_set(HA_DROP_INDEX) ||
|
|
alter_flags->is_set(HA_DROP_UNIQUE_INDEX) ||
|
|
alter_flags->is_set(HA_ADD_INDEX) ||
|
|
alter_flags->is_set(HA_ADD_UNIQUE_INDEX);
|
|
bool has_non_indexing_changes = false;
|
|
bool has_non_dropped_changes = false;
|
|
bool has_non_added_changes = false;
|
|
bool has_non_column_rename_changes = false;
|
|
for (uint i = 0; i < HA_MAX_ALTER_FLAGS; i++) {
|
|
if (i == HA_DROP_INDEX ||
|
|
i == HA_DROP_UNIQUE_INDEX ||
|
|
i == HA_ADD_INDEX ||
|
|
i == HA_ADD_UNIQUE_INDEX)
|
|
{
|
|
continue;
|
|
}
|
|
if (alter_flags->is_set(i)) {
|
|
has_non_indexing_changes = true;
|
|
break;
|
|
}
|
|
}
|
|
for (uint i = 0; i < HA_MAX_ALTER_FLAGS; i++) {
|
|
if (i == HA_ALTER_COLUMN_NAME||
|
|
i == HA_CHANGE_COLUMN)
|
|
{
|
|
continue;
|
|
}
|
|
if (alter_flags->is_set(i)) {
|
|
has_non_column_rename_changes = true;
|
|
break;
|
|
}
|
|
}
|
|
for (uint i = 0; i < HA_MAX_ALTER_FLAGS; i++) {
|
|
if (i == HA_DROP_COLUMN) {
|
|
continue;
|
|
}
|
|
if (keys_same &&
|
|
(i == HA_ALTER_INDEX || i == HA_ALTER_UNIQUE_INDEX || i == HA_ALTER_PK_INDEX)) {
|
|
continue;
|
|
}
|
|
if (alter_flags->is_set(i)) {
|
|
has_non_dropped_changes = true;
|
|
break;
|
|
}
|
|
}
|
|
for (uint i = 0; i < HA_MAX_ALTER_FLAGS; i++) {
|
|
if (i == HA_ADD_COLUMN) {
|
|
continue;
|
|
}
|
|
if (keys_same &&
|
|
(i == HA_ALTER_INDEX || i == HA_ALTER_UNIQUE_INDEX || i == HA_ALTER_PK_INDEX)) {
|
|
continue;
|
|
}
|
|
if (alter_flags->is_set(i)) {
|
|
has_non_added_changes = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (tokudb_debug & TOKUDB_DEBUG_ALTER_TABLE_INFO) {
|
|
printf("has indexing changes %d, has non indexing changes %d\n", has_indexing_changes, has_non_indexing_changes);
|
|
}
|
|
#ifdef MARIADB_BASE_VERSION
|
|
#if MYSQL_VERSION_ID >= 50203
|
|
if (table->s->vfields || altered_table->s->vfields) {
|
|
retval = HA_ALTER_ERROR;
|
|
goto cleanup;
|
|
}
|
|
#endif
|
|
#endif
|
|
if (table->s->tmp_table != NO_TMP_TABLE) {
|
|
retval = (get_disable_slow_alter(thd)) ? HA_ALTER_ERROR : HA_ALTER_NOT_SUPPORTED;
|
|
goto cleanup;
|
|
}
|
|
if (!(are_null_bits_in_order(table) &&
|
|
are_null_bits_in_order(altered_table)
|
|
)
|
|
)
|
|
{
|
|
sql_print_error("Problems parsing null bits of the original and altered table");
|
|
retval = (get_disable_slow_alter(thd)) ? HA_ALTER_ERROR : HA_ALTER_NOT_SUPPORTED;
|
|
goto cleanup;
|
|
}
|
|
if (has_added_columns && !has_non_added_changes) {
|
|
u_int32_t added_columns[altered_table->s->fields];
|
|
u_int32_t num_added_columns = 0;
|
|
int r = find_changed_columns(
|
|
added_columns,
|
|
&num_added_columns,
|
|
table,
|
|
altered_table
|
|
);
|
|
if (r) {
|
|
retval = (get_disable_slow_alter(thd)) ? HA_ALTER_ERROR : HA_ALTER_NOT_SUPPORTED;
|
|
goto cleanup;
|
|
}
|
|
if (tokudb_debug & TOKUDB_DEBUG_ALTER_TABLE_INFO) {
|
|
for (u_int32_t i = 0; i < num_added_columns; i++) {
|
|
u_int32_t curr_added_index = added_columns[i];
|
|
Field* curr_added_field = altered_table->field[curr_added_index];
|
|
printf(
|
|
"Added column: index %d, name %s\n",
|
|
curr_added_index,
|
|
curr_added_field->field_name
|
|
);
|
|
}
|
|
}
|
|
}
|
|
if (has_dropped_columns && !has_non_dropped_changes) {
|
|
u_int32_t dropped_columns[table->s->fields];
|
|
u_int32_t num_dropped_columns = 0;
|
|
int r = find_changed_columns(
|
|
dropped_columns,
|
|
&num_dropped_columns,
|
|
altered_table,
|
|
table
|
|
);
|
|
if (r) {
|
|
retval = (get_disable_slow_alter(thd)) ? HA_ALTER_ERROR : HA_ALTER_NOT_SUPPORTED;
|
|
goto cleanup;
|
|
}
|
|
if (tokudb_debug & TOKUDB_DEBUG_ALTER_TABLE_INFO) {
|
|
for (u_int32_t i = 0; i < num_dropped_columns; i++) {
|
|
u_int32_t curr_dropped_index = dropped_columns[i];
|
|
Field* curr_dropped_field = table->field[curr_dropped_index];
|
|
printf(
|
|
"Dropped column: index %d, name %s\n",
|
|
curr_dropped_index,
|
|
curr_dropped_field->field_name
|
|
);
|
|
}
|
|
}
|
|
}
|
|
|
|
if (has_indexing_changes && !has_non_indexing_changes) {
|
|
retval = HA_ALTER_SUPPORTED_WAIT_LOCK;
|
|
}
|
|
else if (has_dropped_columns && !has_non_dropped_changes) {
|
|
retval = HA_ALTER_SUPPORTED_WAIT_LOCK;
|
|
}
|
|
else if (has_added_columns && !has_non_added_changes) {
|
|
retval = HA_ALTER_SUPPORTED_WAIT_LOCK;
|
|
}
|
|
else if (has_column_rename && !has_non_column_rename_changes) {
|
|
// we have identified a possible column rename,
|
|
// but let's do some more checks
|
|
|
|
// we will only allow an hcr if there are no changes
|
|
// in column positions
|
|
if (alter_info->contains_first_or_after) {
|
|
retval = (get_disable_slow_alter(thd)) ? HA_ALTER_ERROR : HA_ALTER_NOT_SUPPORTED;
|
|
goto cleanup;
|
|
}
|
|
|
|
// now need to verify that one and only one column
|
|
// has changed only its name. If we find anything to
|
|
// the contrary, we don't allow it, also check indexes
|
|
|
|
bool cr_supported = column_rename_supported(alter_info, table, altered_table);
|
|
if (cr_supported) {
|
|
retval = HA_ALTER_SUPPORTED_WAIT_LOCK;
|
|
}
|
|
else {
|
|
retval = (get_disable_slow_alter(thd)) ? HA_ALTER_ERROR : HA_ALTER_NOT_SUPPORTED;
|
|
}
|
|
}
|
|
else {
|
|
retval = (get_disable_slow_alter(thd)) ? HA_ALTER_ERROR : HA_ALTER_NOT_SUPPORTED;
|
|
}
|
|
cleanup:
|
|
DBUG_RETURN(retval);
|
|
}
|
|
|
|
#define UP_COL_ADD_OR_DROP 0
|
|
|
|
#define COL_DROP 0xaa
|
|
#define COL_ADD 0xbb
|
|
|
|
#define COL_FIXED 0xcc
|
|
#define COL_VAR 0xdd
|
|
#define COL_BLOB 0xee
|
|
|
|
|
|
|
|
#define STATIC_ROW_MUTATOR_SIZE 1+8+2+8+8+8
|
|
|
|
/*
|
|
how much space do I need for the mutators?
|
|
static stuff first:
|
|
1 - UP_COL_ADD_OR_DROP
|
|
8 - old null, new null
|
|
2 - old num_offset, new num_offset
|
|
8 - old fixed_field size, new fixed_field_size
|
|
8 - old and new length of offsets
|
|
8 - old and new starting null bit position
|
|
TOTAL: 27
|
|
|
|
dynamic stuff:
|
|
4 - number of columns
|
|
for each column:
|
|
1 - add or drop
|
|
1 - is nullable
|
|
4 - if nullable, position
|
|
1 - if add, whether default is null or not
|
|
1 - if fixed, var, or not
|
|
for fixed, entire default
|
|
for var, 4 bytes length, then entire default
|
|
for blob, nothing
|
|
So, an upperbound is 4 + num_fields(12) + all default stuff
|
|
|
|
static blob stuff:
|
|
4 - num blobs
|
|
1 byte for each num blobs in old table
|
|
So, an upperbound is 4 + kc_info->num_blobs
|
|
|
|
dynamic blob stuff:
|
|
for each blob added:
|
|
1 - state if we are adding or dropping
|
|
4 - blob index
|
|
if add, 1 len bytes
|
|
at most, 4 0's
|
|
So, upperbound is num_blobs(1+4+1+4) = num_columns*10
|
|
*/
|
|
static u_int32_t
|
|
fill_static_row_mutator(
|
|
uchar* buf,
|
|
TABLE* orig_table,
|
|
TABLE* altered_table,
|
|
KEY_AND_COL_INFO* orig_kc_info,
|
|
KEY_AND_COL_INFO* altered_kc_info,
|
|
u_int32_t keynr
|
|
)
|
|
{
|
|
//
|
|
// start packing extra
|
|
//
|
|
uchar* pos = buf;
|
|
// says what the operation is
|
|
pos[0] = UP_COL_ADD_OR_DROP;
|
|
pos++;
|
|
|
|
//
|
|
// null byte information
|
|
//
|
|
memcpy(pos, &orig_table->s->null_bytes, sizeof(orig_table->s->null_bytes));
|
|
pos += sizeof(orig_table->s->null_bytes);
|
|
memcpy(pos, &altered_table->s->null_bytes, sizeof(orig_table->s->null_bytes));
|
|
pos += sizeof(altered_table->s->null_bytes);
|
|
|
|
//
|
|
// num_offset_bytes
|
|
//
|
|
assert(orig_kc_info->num_offset_bytes <= 2);
|
|
pos[0] = orig_kc_info->num_offset_bytes;
|
|
pos++;
|
|
assert(altered_kc_info->num_offset_bytes <= 2);
|
|
pos[0] = altered_kc_info->num_offset_bytes;
|
|
pos++;
|
|
|
|
//
|
|
// size of fixed fields
|
|
//
|
|
u_int32_t fixed_field_size = orig_kc_info->mcp_info[keynr].fixed_field_size;
|
|
memcpy(pos, &fixed_field_size, sizeof(fixed_field_size));
|
|
pos += sizeof(fixed_field_size);
|
|
fixed_field_size = altered_kc_info->mcp_info[keynr].fixed_field_size;
|
|
memcpy(pos, &fixed_field_size, sizeof(fixed_field_size));
|
|
pos += sizeof(fixed_field_size);
|
|
|
|
//
|
|
// length of offsets
|
|
//
|
|
u_int32_t len_of_offsets = orig_kc_info->mcp_info[keynr].len_of_offsets;
|
|
memcpy(pos, &len_of_offsets, sizeof(len_of_offsets));
|
|
pos += sizeof(len_of_offsets);
|
|
len_of_offsets = altered_kc_info->mcp_info[keynr].len_of_offsets;
|
|
memcpy(pos, &len_of_offsets, sizeof(len_of_offsets));
|
|
pos += sizeof(len_of_offsets);
|
|
|
|
u_int32_t orig_start_null_pos = get_first_null_bit_pos(orig_table);
|
|
memcpy(pos, &orig_start_null_pos, sizeof(orig_start_null_pos));
|
|
pos += sizeof(orig_start_null_pos);
|
|
u_int32_t altered_start_null_pos = get_first_null_bit_pos(altered_table);
|
|
memcpy(pos, &altered_start_null_pos, sizeof(altered_start_null_pos));
|
|
pos += sizeof(altered_start_null_pos);
|
|
|
|
assert((pos-buf) == STATIC_ROW_MUTATOR_SIZE);
|
|
return pos - buf;
|
|
}
|
|
|
|
static u_int32_t
|
|
fill_dynamic_row_mutator(
|
|
uchar* buf,
|
|
u_int32_t* columns,
|
|
u_int32_t num_columns,
|
|
TABLE* src_table,
|
|
KEY_AND_COL_INFO* src_kc_info,
|
|
u_int32_t keynr,
|
|
bool is_add,
|
|
bool* out_has_blobs
|
|
)
|
|
{
|
|
uchar* pos = buf;
|
|
bool has_blobs = false;
|
|
u_int32_t cols = num_columns;
|
|
memcpy(pos, &cols, sizeof(cols));
|
|
pos += sizeof(cols);
|
|
for (u_int32_t i = 0; i < num_columns; i++) {
|
|
u_int32_t curr_index = columns[i];
|
|
Field* curr_field = src_table->field[curr_index];
|
|
|
|
pos[0] = is_add ? COL_ADD : COL_DROP;
|
|
pos++;
|
|
//
|
|
// NULL bit information
|
|
//
|
|
bool is_null_default = false;
|
|
bool nullable = curr_field->null_bit != 0;
|
|
if (!nullable) {
|
|
pos[0] = 0;
|
|
pos++;
|
|
}
|
|
else {
|
|
pos[0] = 1;
|
|
pos++;
|
|
// write position of null byte that is to be removed
|
|
u_int32_t null_bit_position = get_overall_null_bit_position(src_table, curr_field);
|
|
memcpy(pos, &null_bit_position, sizeof(null_bit_position));
|
|
pos += sizeof(null_bit_position);
|
|
//
|
|
// if adding a column, write the value of the default null_bit
|
|
//
|
|
if (is_add) {
|
|
is_null_default = is_overall_null_position_set(
|
|
src_table->s->default_values,
|
|
null_bit_position
|
|
);
|
|
pos[0] = is_null_default ? 1 : 0;
|
|
pos++;
|
|
}
|
|
}
|
|
if (src_kc_info->field_lengths[curr_index] != 0) {
|
|
// we have a fixed field being dropped
|
|
// store the offset and the number of bytes
|
|
pos[0] = COL_FIXED;
|
|
pos++;
|
|
//store the offset
|
|
u_int32_t fixed_field_offset = src_kc_info->cp_info[keynr][curr_index].col_pack_val;
|
|
memcpy(pos, &fixed_field_offset, sizeof(fixed_field_offset));
|
|
pos += sizeof(fixed_field_offset);
|
|
//store the number of bytes
|
|
u_int32_t num_bytes = src_kc_info->field_lengths[curr_index];
|
|
memcpy(pos, &num_bytes, sizeof(num_bytes));
|
|
pos += sizeof(num_bytes);
|
|
if (is_add && !is_null_default) {
|
|
uint curr_field_offset = field_offset(curr_field, src_table);
|
|
memcpy(
|
|
pos,
|
|
src_table->s->default_values + curr_field_offset,
|
|
num_bytes
|
|
);
|
|
pos += num_bytes;
|
|
}
|
|
}
|
|
else if (src_kc_info->length_bytes[curr_index] != 0) {
|
|
pos[0] = COL_VAR;
|
|
pos++;
|
|
//store the index of the variable column
|
|
u_int32_t var_field_index = src_kc_info->cp_info[keynr][curr_index].col_pack_val;
|
|
memcpy(pos, &var_field_index, sizeof(var_field_index));
|
|
pos += sizeof(var_field_index);
|
|
if (is_add && !is_null_default) {
|
|
uint curr_field_offset = field_offset(curr_field, src_table);
|
|
u_int32_t len_bytes = src_kc_info->length_bytes[curr_index];
|
|
u_int32_t data_length = get_var_data_length(
|
|
src_table->s->default_values + curr_field_offset,
|
|
len_bytes
|
|
);
|
|
memcpy(pos, &data_length, sizeof(data_length));
|
|
pos += sizeof(data_length);
|
|
memcpy(
|
|
pos,
|
|
src_table->s->default_values + curr_field_offset + len_bytes,
|
|
data_length
|
|
);
|
|
pos += data_length;
|
|
}
|
|
}
|
|
else {
|
|
pos[0] = COL_BLOB;
|
|
pos++;
|
|
has_blobs = true;
|
|
}
|
|
}
|
|
*out_has_blobs = has_blobs;
|
|
return pos-buf;
|
|
}
|
|
|
|
static u_int32_t
|
|
fill_static_blob_row_mutator(
|
|
uchar* buf,
|
|
TABLE* src_table,
|
|
KEY_AND_COL_INFO* src_kc_info
|
|
)
|
|
{
|
|
uchar* pos = buf;
|
|
// copy number of blobs
|
|
memcpy(pos, &src_kc_info->num_blobs, sizeof(src_kc_info->num_blobs));
|
|
pos += sizeof(src_kc_info->num_blobs);
|
|
// copy length bytes for each blob
|
|
for (u_int32_t i = 0; i < src_kc_info->num_blobs; i++) {
|
|
u_int32_t curr_field_index = src_kc_info->blob_fields[i];
|
|
Field* field = src_table->field[curr_field_index];
|
|
u_int32_t len_bytes = field->row_pack_length();
|
|
assert(len_bytes <= 4);
|
|
pos[0] = len_bytes;
|
|
pos++;
|
|
}
|
|
|
|
return pos-buf;
|
|
}
|
|
|
|
static u_int32_t
|
|
fill_dynamic_blob_row_mutator(
|
|
uchar* buf,
|
|
u_int32_t* columns,
|
|
u_int32_t num_columns,
|
|
TABLE* src_table,
|
|
KEY_AND_COL_INFO* src_kc_info,
|
|
bool is_add
|
|
)
|
|
{
|
|
uchar* pos = buf;
|
|
for (u_int32_t i = 0; i < num_columns; i++) {
|
|
u_int32_t curr_field_index = columns[i];
|
|
Field* curr_field = src_table->field[curr_field_index];
|
|
if (src_kc_info->field_lengths[curr_field_index] == 0 &&
|
|
src_kc_info->length_bytes[curr_field_index]== 0
|
|
)
|
|
{
|
|
// find out which blob it is
|
|
u_int32_t blob_index = src_kc_info->num_blobs;
|
|
for (u_int32_t j = 0; j < src_kc_info->num_blobs; j++) {
|
|
if (curr_field_index == src_kc_info->blob_fields[j]) {
|
|
blob_index = j;
|
|
break;
|
|
}
|
|
}
|
|
// assert we found blob in list
|
|
assert(blob_index < src_kc_info->num_blobs);
|
|
pos[0] = is_add ? COL_ADD : COL_DROP;
|
|
pos++;
|
|
memcpy(pos, &blob_index, sizeof(blob_index));
|
|
pos += sizeof(blob_index);
|
|
if (is_add) {
|
|
u_int32_t len_bytes = curr_field->row_pack_length();
|
|
assert(len_bytes <= 4);
|
|
pos[0] = len_bytes;
|
|
pos++;
|
|
|
|
// create a zero length blob field that can be directly copied in
|
|
// for now, in MySQL, we can only have blob fields
|
|
// that have no default value
|
|
memset(pos, 0, len_bytes);
|
|
pos += len_bytes;
|
|
}
|
|
}
|
|
else {
|
|
// not a blob, continue
|
|
continue;
|
|
}
|
|
}
|
|
return pos-buf;
|
|
}
|
|
|
|
// TODO: carefully review to make sure that the right information is used
|
|
// TODO: namely, when do we get stuff from share->kc_info and when we get
|
|
// TODO: it from altered_kc_info, and when is keynr associated with the right thing
|
|
u_int32_t
|
|
ha_tokudb::fill_row_mutator(
|
|
uchar* buf,
|
|
u_int32_t* columns,
|
|
u_int32_t num_columns,
|
|
TABLE* altered_table,
|
|
KEY_AND_COL_INFO* altered_kc_info,
|
|
u_int32_t keynr,
|
|
bool is_add
|
|
)
|
|
{
|
|
if (tokudb_debug & TOKUDB_DEBUG_ALTER_TABLE_INFO) {
|
|
printf("*****some info:*************\n");
|
|
printf(
|
|
"old things: num_null_bytes %d, num_offset_bytes %d, fixed_field_size %d, fixed_field_size %d\n",
|
|
table->s->null_bytes,
|
|
share->kc_info.num_offset_bytes,
|
|
share->kc_info.mcp_info[keynr].fixed_field_size,
|
|
share->kc_info.mcp_info[keynr].len_of_offsets
|
|
);
|
|
printf(
|
|
"new things: num_null_bytes %d, num_offset_bytes %d, fixed_field_size %d, fixed_field_size %d\n",
|
|
altered_table->s->null_bytes,
|
|
altered_kc_info->num_offset_bytes,
|
|
altered_kc_info->mcp_info[keynr].fixed_field_size,
|
|
altered_kc_info->mcp_info[keynr].len_of_offsets
|
|
);
|
|
printf("****************************\n");
|
|
}
|
|
uchar* pos = buf;
|
|
bool has_blobs = false;
|
|
pos += fill_static_row_mutator(
|
|
pos,
|
|
table,
|
|
altered_table,
|
|
&share->kc_info,
|
|
altered_kc_info,
|
|
keynr
|
|
);
|
|
|
|
if (is_add) {
|
|
pos += fill_dynamic_row_mutator(
|
|
pos,
|
|
columns,
|
|
num_columns,
|
|
altered_table,
|
|
altered_kc_info,
|
|
keynr,
|
|
is_add,
|
|
&has_blobs
|
|
);
|
|
}
|
|
else {
|
|
pos += fill_dynamic_row_mutator(
|
|
pos,
|
|
columns,
|
|
num_columns,
|
|
table,
|
|
&share->kc_info,
|
|
keynr,
|
|
is_add,
|
|
&has_blobs
|
|
);
|
|
}
|
|
if (has_blobs) {
|
|
pos += fill_static_blob_row_mutator(
|
|
pos,
|
|
table,
|
|
&share->kc_info
|
|
);
|
|
if (is_add) {
|
|
pos += fill_dynamic_blob_row_mutator(
|
|
pos,
|
|
columns,
|
|
num_columns,
|
|
altered_table,
|
|
altered_kc_info,
|
|
is_add
|
|
);
|
|
}
|
|
else {
|
|
pos += fill_dynamic_blob_row_mutator(
|
|
pos,
|
|
columns,
|
|
num_columns,
|
|
table,
|
|
&share->kc_info,
|
|
is_add
|
|
);
|
|
}
|
|
}
|
|
return pos-buf;
|
|
}
|
|
|
|
int
|
|
ha_tokudb::alter_table_phase2(
|
|
THD *thd,
|
|
TABLE *altered_table,
|
|
HA_CREATE_INFO *create_info,
|
|
HA_ALTER_INFO *alter_info,
|
|
HA_ALTER_FLAGS *alter_flags
|
|
)
|
|
{
|
|
TOKUDB_DBUG_ENTER("ha_tokudb::alter_table_phase2");
|
|
int error;
|
|
DB_TXN* txn = NULL;
|
|
bool incremented_numDBs = false;
|
|
bool modified_DBs = false;
|
|
bool has_dropped_columns = alter_flags->is_set(HA_DROP_COLUMN);
|
|
bool has_added_columns = alter_flags->is_set(HA_ADD_COLUMN);
|
|
KEY_AND_COL_INFO altered_kc_info;
|
|
memset(&altered_kc_info, 0, sizeof(altered_kc_info));
|
|
u_int32_t max_new_desc_size = 0;
|
|
uchar* row_desc_buff = NULL;
|
|
uchar* column_extra = NULL;
|
|
bool dropping_indexes = alter_info->index_drop_count > 0 && !tables_have_same_keys(table,altered_table,false, false);
|
|
bool adding_indexes = alter_info->index_add_count > 0 && !tables_have_same_keys(table,altered_table,false, false);
|
|
tokudb_trx_data* trx = (tokudb_trx_data *) thd_data_get(thd, tokudb_hton->slot);
|
|
|
|
is_fast_alter_running = true;
|
|
|
|
if (!trx ||
|
|
(trx->all != NULL) ||
|
|
(trx->sp_level != NULL) ||
|
|
(trx->stmt == NULL) ||
|
|
(trx->sub_sp_level != trx->stmt)
|
|
)
|
|
{
|
|
error = HA_ERR_UNSUPPORTED;
|
|
goto cleanup;
|
|
}
|
|
txn = trx->stmt;
|
|
|
|
error = allocate_key_and_col_info(altered_table->s, &altered_kc_info);
|
|
if (error) { goto cleanup; }
|
|
|
|
max_new_desc_size = get_max_desc_size(&altered_kc_info, altered_table);
|
|
row_desc_buff = (uchar *)my_malloc(max_new_desc_size, MYF(MY_WME));
|
|
if (row_desc_buff == NULL){ error = ENOMEM; goto cleanup;}
|
|
|
|
// drop indexes
|
|
if (dropping_indexes) {
|
|
error = drop_indexes(table, alter_info->index_drop_buffer, alter_info->index_drop_count, txn);
|
|
if (error) { goto cleanup; }
|
|
}
|
|
|
|
// add indexes
|
|
if (adding_indexes) {
|
|
KEY *key_info;
|
|
KEY *key;
|
|
uint *idx_p;
|
|
uint *idx_end_p;
|
|
KEY_PART_INFO *key_part;
|
|
KEY_PART_INFO *part_end;
|
|
/* The add_index() method takes an array of KEY structs. */
|
|
key_info= (KEY*) thd->alloc(sizeof(KEY) * alter_info->index_add_count);
|
|
key= key_info;
|
|
for (idx_p= alter_info->index_add_buffer, idx_end_p= idx_p + alter_info->index_add_count;
|
|
idx_p < idx_end_p;
|
|
idx_p++, key++)
|
|
{
|
|
/* Copy the KEY struct. */
|
|
*key= alter_info->key_info_buffer[*idx_p];
|
|
/* Fix the key parts. */
|
|
part_end= key->key_part + key->key_parts;
|
|
for (key_part= key->key_part; key_part < part_end; key_part++)
|
|
key_part->field = table->field[key_part->fieldnr];
|
|
}
|
|
error = tokudb_add_index(
|
|
table,
|
|
key_info,
|
|
alter_info->index_add_count,
|
|
txn,
|
|
&incremented_numDBs,
|
|
&modified_DBs
|
|
);
|
|
if (error) {
|
|
// hack for now, in case of duplicate key error,
|
|
// because at the moment we cannot display the right key
|
|
// information to the user, so that he knows potentially what went
|
|
// wrong.
|
|
last_dup_key = MAX_KEY;
|
|
goto cleanup;
|
|
}
|
|
}
|
|
|
|
if (has_dropped_columns || has_added_columns) {
|
|
DBT column_dbt;
|
|
memset(&column_dbt, 0, sizeof(DBT));
|
|
u_int32_t max_column_extra_size;
|
|
u_int32_t num_column_extra;
|
|
u_int32_t columns[table->s->fields + altered_table->s->fields]; // set size such that we know it is big enough for both cases
|
|
u_int32_t num_columns = 0;
|
|
u_int32_t curr_num_DBs = table->s->keys + test(hidden_primary_key);
|
|
memset(columns, 0, sizeof(columns));
|
|
|
|
if (has_added_columns && has_dropped_columns) {
|
|
error = HA_ERR_UNSUPPORTED;
|
|
goto cleanup;
|
|
}
|
|
if (!tables_have_same_keys(table, altered_table, true, false)) {
|
|
error = HA_ERR_UNSUPPORTED;
|
|
goto cleanup;
|
|
}
|
|
|
|
error = initialize_key_and_col_info(
|
|
altered_table->s,
|
|
altered_table,
|
|
&altered_kc_info,
|
|
hidden_primary_key,
|
|
primary_key
|
|
);
|
|
if (error) { goto cleanup; }
|
|
|
|
// generate the array of columns
|
|
if (has_dropped_columns) {
|
|
find_changed_columns(
|
|
columns,
|
|
&num_columns,
|
|
altered_table,
|
|
table
|
|
);
|
|
}
|
|
if (has_added_columns) {
|
|
find_changed_columns(
|
|
columns,
|
|
&num_columns,
|
|
table,
|
|
altered_table
|
|
);
|
|
}
|
|
max_column_extra_size =
|
|
STATIC_ROW_MUTATOR_SIZE + //max static row_mutator
|
|
4 + num_columns*(1+1+4+1+1+4) + altered_table->s->reclength + // max dynamic row_mutator
|
|
(4 + share->kc_info.num_blobs) + // max static blob size
|
|
(num_columns*(1+4+1+4)); // max dynamic blob size
|
|
column_extra = (uchar *)my_malloc(max_column_extra_size, MYF(MY_WME));
|
|
if (column_extra == NULL) { error = ENOMEM; goto cleanup; }
|
|
|
|
for (u_int32_t i = 0; i < curr_num_DBs; i++) {
|
|
DBT row_descriptor;
|
|
memset(&row_descriptor, 0, sizeof(row_descriptor));
|
|
KEY* prim_key = (hidden_primary_key) ? NULL : &altered_table->s->key_info[primary_key];
|
|
KEY* key_info = &altered_table->key_info[i];
|
|
if (i == primary_key) {
|
|
row_descriptor.size = create_main_key_descriptor(
|
|
row_desc_buff,
|
|
prim_key,
|
|
hidden_primary_key,
|
|
primary_key,
|
|
altered_table,
|
|
&altered_kc_info
|
|
);
|
|
row_descriptor.data = row_desc_buff;
|
|
}
|
|
else {
|
|
row_descriptor.size = create_secondary_key_descriptor(
|
|
row_desc_buff,
|
|
key_info,
|
|
prim_key,
|
|
hidden_primary_key,
|
|
altered_table,
|
|
primary_key,
|
|
i,
|
|
&altered_kc_info
|
|
);
|
|
row_descriptor.data = row_desc_buff;
|
|
}
|
|
error = share->key_file[i]->change_descriptor(
|
|
share->key_file[i],
|
|
txn,
|
|
&row_descriptor,
|
|
0
|
|
);
|
|
if (error) { goto cleanup; }
|
|
|
|
if (i == primary_key || table_share->key_info[i].flags & HA_CLUSTERING) {
|
|
num_column_extra = fill_row_mutator(
|
|
column_extra,
|
|
columns,
|
|
num_columns,
|
|
altered_table,
|
|
&altered_kc_info,
|
|
i,
|
|
has_added_columns // true if adding columns, otherwise is a drop
|
|
);
|
|
|
|
column_dbt.data = column_extra;
|
|
column_dbt.size = num_column_extra;
|
|
DBUG_ASSERT(num_column_extra <= max_column_extra_size);
|
|
|
|
error = share->key_file[i]->update_broadcast(
|
|
share->key_file[i],
|
|
txn,
|
|
&column_dbt,
|
|
DB_IS_RESETTING_OP
|
|
);
|
|
if (error) { goto cleanup; }
|
|
}
|
|
}
|
|
}
|
|
|
|
// update frm file
|
|
// only for tables that are not partitioned
|
|
if (altered_table->part_info == NULL) {
|
|
error = write_frm_data(share->status_block, txn, altered_table->s->path.str);
|
|
if (error) { goto cleanup; }
|
|
}
|
|
if (thd->killed) {
|
|
error = ER_ABORTING_CONNECTION;
|
|
goto cleanup;
|
|
}
|
|
|
|
error = 0;
|
|
cleanup:
|
|
free_key_and_col_info(&altered_kc_info);
|
|
my_free(row_desc_buff, MYF(MY_ALLOW_ZERO_PTR));
|
|
my_free(column_extra, MYF(MY_ALLOW_ZERO_PTR));
|
|
if (txn) {
|
|
if (error) {
|
|
if (adding_indexes) {
|
|
restore_add_index(table, alter_info->index_add_count, incremented_numDBs, modified_DBs);
|
|
}
|
|
abort_txn(txn);
|
|
trx->stmt = NULL;
|
|
trx->sub_sp_level = NULL;
|
|
if (dropping_indexes) {
|
|
restore_drop_indexes(table, alter_info->index_drop_buffer, alter_info->index_drop_count);
|
|
}
|
|
}
|
|
}
|
|
TOKUDB_DBUG_RETURN(error);
|
|
}
|
|
|
|
#endif
|
|
|
|
#endif
|