mirror of
https://github.com/MariaDB/server.git
synced 2025-01-19 05:22:25 +01:00
376fb08072
Added support for lower_case_table_names=2, which is to be used on case insensitive file systems. This tells MySQL to preserve the used case of filenames and database names to make it esier to move files between cases sensitive can case insensitive file systems (like Windows and Linux) client/mysqltest.c: Indentation cleanup include/myisam.h: Made some pointers 'const' mysql-test/mysql-test-run.sh: Portability fix for OSX sql/filesort.cc: Safety fix (not needed for current code but needed for 5.0) sql/ha_berkeley.cc: More debugging Changed 'create' to return error number sql/ha_berkeley.h: Added HA_FILE_BASED sql/ha_innodb.cc: Added missing DBUG_RETURN sql/ha_isam.cc: Changed create to return error number sql/ha_isam.h: Added HA_FILE_BASED sql/ha_isammrg.h: Added HA_FILE_BASED sql/ha_myisam.cc: Changed create to return error number sql/ha_myisam.h: Added HA_FILE_BASED sql/ha_myisammrg.cc: Changed create to return error number sql/ha_myisammrg.h: Added HA_FILE_BASED sql/handler.cc: Ensure that table engines gets table names in lower case even if we are using lower_case_table_names Removed test for DB_TYPE_INNODB by ensuring that create method returns error number. sql/handler.h: Added HA_FILE_BASED Made some struct entries 'const' Added 'alias' for create to be able to create tables in mixed case on case insensitive file systems sql/mysql_priv.h: Support for lower_case_table_names=2 sql/mysqld.cc: Support for lower_case_table_names=2 Moved test of case insenstive file system after all mutex are created sql/set_var.cc: Support for lower_case_table_names=2 sql/sql_class.h: Indentation change sql/sql_db.cc: Support for lower_case_table_names=2 sql/sql_insert.cc: Indentation change sql/sql_parse.cc: Support for lower_case_table_names=2 sql/sql_rename.cc: Support for lower_case_table_names=2 Added missing 'unpack_filename' to RENAME which may fix a bug in RENAME TABLE on windows sql/sql_show.cc: If lower_case_table_name=2 is given, show original case in SHOW CREATE TABLE sql/sql_table.cc: Support for lower_case_table_names=2 for DROP TABLE, RENAME TABLE, ALTER TABLE and CREATE TABLE
1321 lines
37 KiB
C++
1321 lines
37 KiB
C++
/* Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult 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; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
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 */
|
|
|
|
|
|
#ifdef __GNUC__
|
|
#pragma implementation // gcc: Class implementation
|
|
#endif
|
|
|
|
#include "mysql_priv.h"
|
|
#include <m_ctype.h>
|
|
#include <myisampack.h>
|
|
#include "ha_myisam.h"
|
|
#include <stdarg.h>
|
|
#ifndef MASTER
|
|
#include "../srclib/myisam/myisamdef.h"
|
|
#else
|
|
#include "../myisam/myisamdef.h"
|
|
#endif
|
|
|
|
ulong myisam_recover_options= HA_RECOVER_NONE;
|
|
|
|
/* bits in myisam_recover_options */
|
|
const char *myisam_recover_names[] =
|
|
{ "DEFAULT", "BACKUP", "FORCE", "QUICK", NullS};
|
|
TYPELIB myisam_recover_typelib= {array_elements(myisam_recover_names)-1,"",
|
|
myisam_recover_names};
|
|
|
|
|
|
/*****************************************************************************
|
|
** MyISAM tables
|
|
*****************************************************************************/
|
|
|
|
// collect errors printed by mi_check routines
|
|
|
|
static void mi_check_print_msg(MI_CHECK *param, const char* msg_type,
|
|
const char *fmt, va_list args)
|
|
{
|
|
THD* thd = (THD*)param->thd;
|
|
String* packet = &thd->packet;
|
|
uint length;
|
|
char msgbuf[MI_MAX_MSG_BUF];
|
|
char name[NAME_LEN*2+2];
|
|
packet->length(0);
|
|
|
|
msgbuf[0] = 0; // healthy paranoia ?
|
|
my_vsnprintf(msgbuf, sizeof(msgbuf), fmt, args);
|
|
msgbuf[sizeof(msgbuf) - 1] = 0; // healthy paranoia
|
|
|
|
DBUG_PRINT(msg_type,("message: %s",msgbuf));
|
|
|
|
if (thd->net.vio == 0)
|
|
{
|
|
sql_print_error(msgbuf);
|
|
return;
|
|
}
|
|
if (param->testflag & (T_CREATE_MISSING_KEYS | T_SAFE_REPAIR | T_AUTO_REPAIR))
|
|
{
|
|
my_message(ER_NOT_KEYFILE,msgbuf,MYF(MY_WME));
|
|
return;
|
|
}
|
|
length=(uint) (strxmov(name, param->db_name,".",param->table_name,NullS) -
|
|
name);
|
|
net_store_data(packet, name, length);
|
|
net_store_data(packet, param->op_name);
|
|
net_store_data(packet, msg_type);
|
|
|
|
net_store_data(packet, msgbuf);
|
|
if (my_net_write(&thd->net, (char*)thd->packet.ptr(), thd->packet.length()))
|
|
sql_print_error("Failed on my_net_write, writing to stderr instead: %s\n",
|
|
msgbuf);
|
|
return;
|
|
}
|
|
|
|
extern "C" {
|
|
|
|
void mi_check_print_error(MI_CHECK *param, const char *fmt,...)
|
|
{
|
|
param->error_printed|=1;
|
|
param->out_flag|= O_DATA_LOST;
|
|
va_list args;
|
|
va_start(args, fmt);
|
|
mi_check_print_msg(param, "error", fmt, args);
|
|
va_end(args);
|
|
}
|
|
|
|
void mi_check_print_info(MI_CHECK *param, const char *fmt,...)
|
|
{
|
|
va_list args;
|
|
va_start(args, fmt);
|
|
mi_check_print_msg(param, "info", fmt, args);
|
|
va_end(args);
|
|
}
|
|
|
|
void mi_check_print_warning(MI_CHECK *param, const char *fmt,...)
|
|
{
|
|
param->warning_printed=1;
|
|
param->out_flag|= O_DATA_LOST;
|
|
va_list args;
|
|
va_start(args, fmt);
|
|
mi_check_print_msg(param, "warning", fmt, args);
|
|
va_end(args);
|
|
}
|
|
|
|
}
|
|
|
|
const char **ha_myisam::bas_ext() const
|
|
{ static const char *ext[]= { ".MYI",".MYD", NullS }; return ext; }
|
|
|
|
|
|
const char *ha_myisam::index_type(uint key_number)
|
|
{
|
|
return ((table->key_info[key_number].flags & HA_FULLTEXT) ?
|
|
"FULLTEXT" :
|
|
"BTREE");
|
|
}
|
|
|
|
int ha_myisam::net_read_dump(NET* net)
|
|
{
|
|
int data_fd = file->dfile;
|
|
int error = 0;
|
|
|
|
my_seek(data_fd, 0L, MY_SEEK_SET, MYF(MY_WME));
|
|
for (;;)
|
|
{
|
|
ulong packet_len = my_net_read(net);
|
|
if (!packet_len)
|
|
break ; // end of file
|
|
if (packet_len == packet_error)
|
|
{
|
|
sql_print_error("ha_myisam::net_read_dump - read error ");
|
|
error= -1;
|
|
goto err;
|
|
}
|
|
if (my_write(data_fd, (byte*)net->read_pos, (uint) packet_len,
|
|
MYF(MY_WME|MY_FNABP)))
|
|
{
|
|
error = errno;
|
|
goto err;
|
|
}
|
|
}
|
|
|
|
err:
|
|
return error;
|
|
}
|
|
|
|
|
|
int ha_myisam::dump(THD* thd, int fd)
|
|
{
|
|
MYISAM_SHARE* share = file->s;
|
|
NET* net = &thd->net;
|
|
uint blocksize = share->blocksize;
|
|
my_off_t bytes_to_read = share->state.state.data_file_length;
|
|
int data_fd = file->dfile;
|
|
byte * buf = (byte*) my_malloc(blocksize, MYF(MY_WME));
|
|
if (!buf)
|
|
return ENOMEM;
|
|
|
|
int error = 0;
|
|
my_seek(data_fd, 0L, MY_SEEK_SET, MYF(MY_WME));
|
|
for (; bytes_to_read > 0;)
|
|
{
|
|
uint bytes = my_read(data_fd, buf, blocksize, MYF(MY_WME));
|
|
if (bytes == MY_FILE_ERROR)
|
|
{
|
|
error = errno;
|
|
goto err;
|
|
}
|
|
|
|
if (fd >= 0)
|
|
{
|
|
if (my_write(fd, buf, bytes, MYF(MY_WME | MY_FNABP)))
|
|
{
|
|
error = errno ? errno : EPIPE;
|
|
goto err;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (my_net_write(net, (char*) buf, bytes))
|
|
{
|
|
error = errno ? errno : EPIPE;
|
|
goto err;
|
|
}
|
|
}
|
|
bytes_to_read -= bytes;
|
|
}
|
|
|
|
if (fd < 0)
|
|
{
|
|
my_net_write(net, "", 0);
|
|
net_flush(net);
|
|
}
|
|
|
|
err:
|
|
my_free((gptr) buf, MYF(0));
|
|
return error;
|
|
}
|
|
|
|
/* Name is here without an extension */
|
|
|
|
int ha_myisam::open(const char *name, int mode, uint test_if_locked)
|
|
{
|
|
if (!(file=mi_open(name, mode, test_if_locked)))
|
|
return (my_errno ? my_errno : -1);
|
|
|
|
if (test_if_locked & (HA_OPEN_IGNORE_IF_LOCKED | HA_OPEN_TMP_TABLE))
|
|
VOID(mi_extra(file, HA_EXTRA_NO_WAIT_LOCK, 0));
|
|
info(HA_STATUS_NO_LOCK | HA_STATUS_VARIABLE | HA_STATUS_CONST);
|
|
if (!(test_if_locked & HA_OPEN_WAIT_IF_LOCKED))
|
|
VOID(mi_extra(file, HA_EXTRA_WAIT_LOCK, 0));
|
|
if (!table->db_record_offset)
|
|
int_table_flags|=HA_REC_NOT_IN_SEQ;
|
|
return (0);
|
|
}
|
|
|
|
int ha_myisam::close(void)
|
|
{
|
|
MI_INFO *tmp=file;
|
|
file=0;
|
|
return mi_close(tmp);
|
|
}
|
|
|
|
int ha_myisam::write_row(byte * buf)
|
|
{
|
|
statistic_increment(ha_write_count,&LOCK_status);
|
|
|
|
/* If we have a timestamp column, update it to the current time */
|
|
|
|
if (table->time_stamp)
|
|
update_timestamp(buf+table->time_stamp-1);
|
|
|
|
/*
|
|
If we have an auto_increment column and we are writing a changed row
|
|
or a new row, then update the auto_increment value in the record.
|
|
*/
|
|
if (table->next_number_field && buf == table->record[0])
|
|
update_auto_increment();
|
|
return mi_write(file,buf);
|
|
}
|
|
|
|
int ha_myisam::check(THD* thd, HA_CHECK_OPT* check_opt)
|
|
{
|
|
if (!file) return HA_ADMIN_INTERNAL_ERROR;
|
|
int error;
|
|
MI_CHECK param;
|
|
MYISAM_SHARE* share = file->s;
|
|
const char *old_proc_info=thd->proc_info;
|
|
|
|
thd->proc_info="Checking table";
|
|
myisamchk_init(¶m);
|
|
param.thd = thd;
|
|
param.op_name = (char*)"check";
|
|
param.db_name = table->table_cache_key;
|
|
param.table_name = table->table_name;
|
|
param.testflag = check_opt->flags | T_CHECK | T_SILENT;
|
|
|
|
if (!(table->db_stat & HA_READ_ONLY))
|
|
param.testflag|= T_STATISTICS;
|
|
param.using_global_keycache = 1;
|
|
|
|
if (!mi_is_crashed(file) &&
|
|
(((param.testflag & T_CHECK_ONLY_CHANGED) &&
|
|
!(share->state.changed & (STATE_CHANGED | STATE_CRASHED |
|
|
STATE_CRASHED_ON_REPAIR)) &&
|
|
share->state.open_count == 0) ||
|
|
((param.testflag & T_FAST) && (share->state.open_count ==
|
|
(uint) (share->global_changed ? 1 : 0)))))
|
|
return HA_ADMIN_ALREADY_DONE;
|
|
|
|
error = chk_status(¶m, file); // Not fatal
|
|
error = chk_size(¶m, file);
|
|
if (!error)
|
|
error |= chk_del(¶m, file, param.testflag);
|
|
if (!error)
|
|
error = chk_key(¶m, file);
|
|
if (!error)
|
|
{
|
|
if ((!(param.testflag & T_QUICK) &&
|
|
((share->options &
|
|
(HA_OPTION_PACK_RECORD | HA_OPTION_COMPRESS_RECORD)) ||
|
|
(param.testflag & (T_EXTEND | T_MEDIUM)))) ||
|
|
mi_is_crashed(file))
|
|
{
|
|
uint old_testflag=param.testflag;
|
|
param.testflag|=T_MEDIUM;
|
|
init_io_cache(¶m.read_cache, file->dfile,
|
|
my_default_record_cache_size, READ_CACHE,
|
|
share->pack.header_length, 1, MYF(MY_WME));
|
|
error |= chk_data_link(¶m, file, param.testflag & T_EXTEND);
|
|
end_io_cache(&(param.read_cache));
|
|
param.testflag=old_testflag;
|
|
}
|
|
}
|
|
if (!error)
|
|
{
|
|
if ((share->state.changed & (STATE_CHANGED |
|
|
STATE_CRASHED_ON_REPAIR |
|
|
STATE_CRASHED | STATE_NOT_ANALYZED)) ||
|
|
(param.testflag & T_STATISTICS) ||
|
|
mi_is_crashed(file))
|
|
{
|
|
file->update|=HA_STATE_CHANGED | HA_STATE_ROW_CHANGED;
|
|
pthread_mutex_lock(&share->intern_lock);
|
|
share->state.changed&= ~(STATE_CHANGED | STATE_CRASHED |
|
|
STATE_CRASHED_ON_REPAIR);
|
|
if (!(table->db_stat & HA_READ_ONLY))
|
|
error=update_state_info(¶m,file,UPDATE_TIME | UPDATE_OPEN_COUNT |
|
|
UPDATE_STAT);
|
|
pthread_mutex_unlock(&share->intern_lock);
|
|
info(HA_STATUS_NO_LOCK | HA_STATUS_TIME | HA_STATUS_VARIABLE |
|
|
HA_STATUS_CONST);
|
|
}
|
|
}
|
|
else if (!mi_is_crashed(file))
|
|
{
|
|
mi_mark_crashed(file);
|
|
file->update |= HA_STATE_CHANGED | HA_STATE_ROW_CHANGED;
|
|
}
|
|
|
|
thd->proc_info=old_proc_info;
|
|
return error ? HA_ADMIN_CORRUPT : HA_ADMIN_OK;
|
|
}
|
|
|
|
|
|
/*
|
|
analyze the key distribution in the table
|
|
As the table may be only locked for read, we have to take into account that
|
|
two threads may do an analyze at the same time!
|
|
*/
|
|
|
|
int ha_myisam::analyze(THD *thd, HA_CHECK_OPT* check_opt)
|
|
{
|
|
int error=0;
|
|
MI_CHECK param;
|
|
MYISAM_SHARE* share = file->s;
|
|
|
|
myisamchk_init(¶m);
|
|
param.thd = thd;
|
|
param.op_name = (char*) "analyze";
|
|
param.db_name = table->table_cache_key;
|
|
param.table_name = table->table_name;
|
|
param.testflag=(T_FAST | T_CHECK | T_SILENT | T_STATISTICS |
|
|
T_DONT_CHECK_CHECKSUM);
|
|
param.using_global_keycache = 1;
|
|
|
|
if (!(share->state.changed & STATE_NOT_ANALYZED))
|
|
return HA_ADMIN_ALREADY_DONE;
|
|
|
|
error = chk_key(¶m, file);
|
|
if (!error)
|
|
{
|
|
pthread_mutex_lock(&share->intern_lock);
|
|
error=update_state_info(¶m,file,UPDATE_STAT);
|
|
pthread_mutex_unlock(&share->intern_lock);
|
|
}
|
|
else if (!mi_is_crashed(file))
|
|
mi_mark_crashed(file);
|
|
return error ? HA_ADMIN_CORRUPT : HA_ADMIN_OK;
|
|
}
|
|
|
|
|
|
int ha_myisam::restore(THD* thd, HA_CHECK_OPT *check_opt)
|
|
{
|
|
HA_CHECK_OPT tmp_check_opt;
|
|
char* backup_dir = thd->lex.backup_dir;
|
|
char src_path[FN_REFLEN], dst_path[FN_REFLEN];
|
|
char* table_name = table->real_name;
|
|
int error;
|
|
const char* errmsg;
|
|
DBUG_ENTER("restore");
|
|
|
|
if (fn_format_relative_to_data_home(src_path, table_name, backup_dir,
|
|
MI_NAME_DEXT))
|
|
DBUG_RETURN(HA_ADMIN_INVALID);
|
|
|
|
if (my_copy(src_path, fn_format(dst_path, table->path, "",
|
|
MI_NAME_DEXT, 4), MYF(MY_WME)))
|
|
{
|
|
error = HA_ADMIN_FAILED;
|
|
errmsg = "Failed in my_copy (Error %d)";
|
|
goto err;
|
|
}
|
|
|
|
tmp_check_opt.init();
|
|
tmp_check_opt.flags |= T_VERY_SILENT | T_CALC_CHECKSUM | T_QUICK;
|
|
DBUG_RETURN(repair(thd, &tmp_check_opt));
|
|
|
|
err:
|
|
{
|
|
MI_CHECK param;
|
|
myisamchk_init(¶m);
|
|
param.thd = thd;
|
|
param.op_name = (char*)"restore";
|
|
param.db_name = table->table_cache_key;
|
|
param.table_name = table->table_name;
|
|
param.testflag = 0;
|
|
mi_check_print_error(¶m, errmsg, my_errno);
|
|
DBUG_RETURN(error);
|
|
}
|
|
}
|
|
|
|
|
|
int ha_myisam::backup(THD* thd, HA_CHECK_OPT *check_opt)
|
|
{
|
|
char* backup_dir = thd->lex.backup_dir;
|
|
char src_path[FN_REFLEN], dst_path[FN_REFLEN];
|
|
char* table_name = table->real_name;
|
|
int error;
|
|
const char *errmsg;
|
|
DBUG_ENTER("ha_myisam::backup");
|
|
|
|
if (fn_format_relative_to_data_home(dst_path, table_name, backup_dir,
|
|
reg_ext))
|
|
{
|
|
errmsg = "Failed in fn_format() for .frm file (errno: %d)";
|
|
error = HA_ADMIN_INVALID;
|
|
goto err;
|
|
}
|
|
|
|
if (my_copy(fn_format(src_path, table->path,"", reg_ext, MY_UNPACK_FILENAME),
|
|
dst_path,
|
|
MYF(MY_WME | MY_HOLD_ORIGINAL_MODES | MY_DONT_OVERWRITE_FILE)))
|
|
{
|
|
error = HA_ADMIN_FAILED;
|
|
errmsg = "Failed copying .frm file (errno: %d)";
|
|
goto err;
|
|
}
|
|
|
|
/* Change extension */
|
|
if (!fn_format(dst_path, dst_path, "", MI_NAME_DEXT,
|
|
MY_REPLACE_EXT | MY_UNPACK_FILENAME | MY_SAFE_PATH))
|
|
{
|
|
errmsg = "Failed in fn_format() for .MYD file (errno: %d)";
|
|
error = HA_ADMIN_INVALID;
|
|
goto err;
|
|
}
|
|
|
|
if (my_copy(fn_format(src_path, table->path,"", MI_NAME_DEXT,
|
|
MY_UNPACK_FILENAME),
|
|
dst_path,
|
|
MYF(MY_WME | MY_HOLD_ORIGINAL_MODES | MY_DONT_OVERWRITE_FILE)))
|
|
{
|
|
errmsg = "Failed copying .MYD file (errno: %d)";
|
|
error= HA_ADMIN_FAILED;
|
|
goto err;
|
|
}
|
|
DBUG_RETURN(HA_ADMIN_OK);
|
|
|
|
err:
|
|
{
|
|
MI_CHECK param;
|
|
myisamchk_init(¶m);
|
|
param.thd = thd;
|
|
param.op_name = (char*)"backup";
|
|
param.db_name = table->table_cache_key;
|
|
param.table_name = table->table_name;
|
|
param.testflag = 0;
|
|
mi_check_print_error(¶m,errmsg, my_errno);
|
|
DBUG_RETURN(error);
|
|
}
|
|
}
|
|
|
|
|
|
int ha_myisam::repair(THD* thd, HA_CHECK_OPT *check_opt)
|
|
{
|
|
int error;
|
|
MI_CHECK param;
|
|
ha_rows start_records;
|
|
|
|
if (!file) return HA_ADMIN_INTERNAL_ERROR;
|
|
|
|
myisamchk_init(¶m);
|
|
param.thd = thd;
|
|
param.op_name = (char*) "repair";
|
|
param.testflag = ((check_opt->flags & ~(T_EXTEND)) |
|
|
T_SILENT | T_FORCE_CREATE | T_CALC_CHECKSUM |
|
|
(check_opt->flags & T_EXTEND ? T_REP : T_REP_BY_SORT));
|
|
param.sort_buffer_length= check_opt->sort_buffer_size;
|
|
start_records=file->state->records;
|
|
while ((error=repair(thd,param,0)) && param.retry_repair)
|
|
{
|
|
param.retry_repair=0;
|
|
if (test_all_bits(param.testflag,
|
|
(uint) (T_RETRY_WITHOUT_QUICK | T_QUICK)))
|
|
{
|
|
param.testflag&= ~T_RETRY_WITHOUT_QUICK;
|
|
sql_print_error("Note: Retrying repair of: '%s' without quick",
|
|
table->path);
|
|
continue;
|
|
}
|
|
param.testflag&= ~T_QUICK;
|
|
if ((param.testflag & T_REP_BY_SORT))
|
|
{
|
|
param.testflag= (param.testflag & ~T_REP_BY_SORT) | T_REP;
|
|
sql_print_error("Note: Retrying repair of: '%s' with keycache",
|
|
table->path);
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
if (!error && start_records != file->state->records &&
|
|
!(check_opt->flags & T_VERY_SILENT))
|
|
{
|
|
char llbuff[22],llbuff2[22];
|
|
sql_print_error("Note: Found %s of %s rows when repairing '%s'",
|
|
llstr(file->state->records, llbuff),
|
|
llstr(start_records, llbuff2),
|
|
table->path);
|
|
}
|
|
return error;
|
|
}
|
|
|
|
int ha_myisam::optimize(THD* thd, HA_CHECK_OPT *check_opt)
|
|
{
|
|
if (!file) return HA_ADMIN_INTERNAL_ERROR;
|
|
MI_CHECK param;
|
|
|
|
myisamchk_init(¶m);
|
|
param.thd = thd;
|
|
param.op_name = (char*) "optimize";
|
|
param.testflag = (check_opt->flags | T_SILENT | T_FORCE_CREATE |
|
|
T_REP_BY_SORT | T_STATISTICS | T_SORT_INDEX);
|
|
param.sort_buffer_length= check_opt->sort_buffer_size;
|
|
return repair(thd,param,1);
|
|
}
|
|
|
|
|
|
int ha_myisam::repair(THD *thd, MI_CHECK ¶m, bool optimize)
|
|
{
|
|
int error=0;
|
|
uint local_testflag=param.testflag;
|
|
bool optimize_done= !optimize, statistics_done=0;
|
|
const char *old_proc_info=thd->proc_info;
|
|
char fixed_name[FN_REFLEN];
|
|
MYISAM_SHARE* share = file->s;
|
|
ha_rows rows= file->state->records;
|
|
DBUG_ENTER("ha_myisam::repair");
|
|
|
|
param.db_name = table->table_cache_key;
|
|
param.table_name = table->table_name;
|
|
param.tmpfile_createflag = O_RDWR | O_TRUNC;
|
|
param.using_global_keycache = 1;
|
|
param.thd=thd;
|
|
param.tmpdir=mysql_tmpdir;
|
|
param.out_flag=0;
|
|
strmov(fixed_name,file->filename);
|
|
|
|
// Don't lock tables if we have used LOCK TABLE
|
|
if (!thd->locked_tables &&
|
|
mi_lock_database(file, table->tmp_table ? F_EXTRA_LCK : F_WRLCK))
|
|
{
|
|
mi_check_print_error(¶m,ER(ER_CANT_LOCK),my_errno);
|
|
DBUG_RETURN(HA_ADMIN_FAILED);
|
|
}
|
|
|
|
if (!optimize ||
|
|
((file->state->del || share->state.split != file->state->records) &&
|
|
(!(param.testflag & T_QUICK) ||
|
|
!(share->state.changed & STATE_NOT_OPTIMIZED_KEYS))))
|
|
{
|
|
ulonglong key_map= ((local_testflag & T_CREATE_MISSING_KEYS) ?
|
|
((ulonglong) 1L << share->base.keys)-1 :
|
|
share->state.key_map);
|
|
uint testflag=param.testflag;
|
|
if (mi_test_if_sort_rep(file,file->state->records,key_map,0) &&
|
|
(local_testflag & T_REP_BY_SORT))
|
|
{
|
|
local_testflag|= T_STATISTICS;
|
|
param.testflag|= T_STATISTICS; // We get this for free
|
|
statistics_done=1;
|
|
if (current_thd->variables.myisam_repair_threads>1)
|
|
{
|
|
char buf[40];
|
|
/* TODO: respect myisam_repair_threads variable */
|
|
my_snprintf(buf, 40, "Repair with %d threads", my_count_bits(key_map));
|
|
thd->proc_info=buf;
|
|
error = mi_repair_parallel(¶m, file, fixed_name,
|
|
param.testflag & T_QUICK);
|
|
thd->proc_info="Repair done"; // to reset proc_info, as
|
|
// it was pointing to local buffer
|
|
}
|
|
else
|
|
{
|
|
thd->proc_info="Repair by sorting";
|
|
error = mi_repair_by_sort(¶m, file, fixed_name,
|
|
param.testflag & T_QUICK);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
thd->proc_info="Repair with keycache";
|
|
param.testflag &= ~T_REP_BY_SORT;
|
|
error= mi_repair(¶m, file, fixed_name,
|
|
param.testflag & T_QUICK);
|
|
}
|
|
param.testflag=testflag;
|
|
optimize_done=1;
|
|
}
|
|
if (!error)
|
|
{
|
|
if ((local_testflag & T_SORT_INDEX) &&
|
|
(share->state.changed & STATE_NOT_SORTED_PAGES))
|
|
{
|
|
optimize_done=1;
|
|
thd->proc_info="Sorting index";
|
|
error=mi_sort_index(¶m,file,fixed_name);
|
|
}
|
|
if (!statistics_done && (local_testflag & T_STATISTICS))
|
|
{
|
|
if (share->state.changed & STATE_NOT_ANALYZED)
|
|
{
|
|
optimize_done=1;
|
|
thd->proc_info="Analyzing";
|
|
error = chk_key(¶m, file);
|
|
}
|
|
else
|
|
local_testflag&= ~T_STATISTICS; // Don't update statistics
|
|
}
|
|
}
|
|
thd->proc_info="Saving state";
|
|
if (!error)
|
|
{
|
|
if ((share->state.changed & STATE_CHANGED) || mi_is_crashed(file))
|
|
{
|
|
share->state.changed&= ~(STATE_CHANGED | STATE_CRASHED |
|
|
STATE_CRASHED_ON_REPAIR);
|
|
file->update|=HA_STATE_CHANGED | HA_STATE_ROW_CHANGED;
|
|
}
|
|
/*
|
|
the following 'if', thought conceptually wrong,
|
|
is a useful optimization nevertheless.
|
|
*/
|
|
if (file->state != &file->s->state.state)
|
|
file->s->state.state = *file->state;
|
|
if (file->s->base.auto_key)
|
|
update_auto_increment_key(¶m, file, 1);
|
|
if (optimize_done)
|
|
error = update_state_info(¶m, file,
|
|
UPDATE_TIME | UPDATE_OPEN_COUNT |
|
|
(local_testflag &
|
|
T_STATISTICS ? UPDATE_STAT : 0));
|
|
info(HA_STATUS_NO_LOCK | HA_STATUS_TIME | HA_STATUS_VARIABLE |
|
|
HA_STATUS_CONST);
|
|
if (rows != file->state->records && ! (param.testflag & T_VERY_SILENT))
|
|
{
|
|
char llbuff[22],llbuff2[22];
|
|
mi_check_print_warning(¶m,"Number of rows changed from %s to %s",
|
|
llstr(rows,llbuff),
|
|
llstr(file->state->records,llbuff2));
|
|
}
|
|
}
|
|
else
|
|
{
|
|
mi_mark_crashed_on_repair(file);
|
|
file->update |= HA_STATE_CHANGED | HA_STATE_ROW_CHANGED;
|
|
update_state_info(¶m, file, 0);
|
|
}
|
|
thd->proc_info=old_proc_info;
|
|
if (!thd->locked_tables)
|
|
mi_lock_database(file,F_UNLCK);
|
|
DBUG_RETURN(error ? HA_ADMIN_FAILED :
|
|
!optimize_done ? HA_ADMIN_ALREADY_DONE : HA_ADMIN_OK);
|
|
}
|
|
|
|
|
|
/*
|
|
Deactive all not unique index that can be recreated fast
|
|
|
|
SYNOPSIS
|
|
deactivate_non_unique_index()
|
|
rows Rows to be inserted
|
|
0 if we don't know
|
|
HA_POS_ERROR if we want to disable all keys
|
|
*/
|
|
|
|
void ha_myisam::deactivate_non_unique_index(ha_rows rows)
|
|
{
|
|
MYISAM_SHARE* share = file->s;
|
|
if (share->state.key_map == ((ulonglong) 1L << share->base.keys)-1)
|
|
{
|
|
if (!(specialflag & SPECIAL_SAFE_MODE))
|
|
{
|
|
if (rows == HA_POS_ERROR)
|
|
mi_extra(file, HA_EXTRA_NO_KEYS, 0);
|
|
else
|
|
{
|
|
/*
|
|
Only disable old index if the table was empty and we are inserting
|
|
a lot of rows.
|
|
We should not do this for only a few rows as this is slower and
|
|
we don't want to update the key statistics based of only a few rows.
|
|
*/
|
|
if (file->state->records == 0 &&
|
|
(!rows || rows >= MI_MIN_ROWS_TO_USE_BULK_INSERT))
|
|
mi_disable_non_unique_index(file,rows);
|
|
else
|
|
{
|
|
mi_init_bulk_insert(file,
|
|
current_thd->variables.bulk_insert_buff_size,
|
|
rows);
|
|
table->bulk_insert= 1;
|
|
}
|
|
}
|
|
}
|
|
enable_activate_all_index=1;
|
|
info(HA_STATUS_CONST); // Read new key info
|
|
}
|
|
else
|
|
enable_activate_all_index=0;
|
|
}
|
|
|
|
|
|
bool ha_myisam::activate_all_index(THD *thd)
|
|
{
|
|
int error=0;
|
|
MI_CHECK param;
|
|
MYISAM_SHARE* share = file->s;
|
|
DBUG_ENTER("activate_all_index");
|
|
|
|
mi_end_bulk_insert(file);
|
|
table->bulk_insert= 0;
|
|
if (enable_activate_all_index &&
|
|
share->state.key_map != set_bits(ulonglong, share->base.keys))
|
|
{
|
|
const char *save_proc_info=thd->proc_info;
|
|
thd->proc_info="Creating index";
|
|
myisamchk_init(¶m);
|
|
param.op_name = (char*) "recreating_index";
|
|
param.testflag = (T_SILENT | T_REP_BY_SORT | T_QUICK |
|
|
T_CREATE_MISSING_KEYS);
|
|
param.myf_rw&= ~MY_WAIT_IF_FULL;
|
|
param.sort_buffer_length= thd->variables.myisam_sort_buff_size;
|
|
param.tmpdir=mysql_tmpdir;
|
|
error=repair(thd,param,0) != HA_ADMIN_OK;
|
|
info(HA_STATUS_CONST);
|
|
thd->proc_info=save_proc_info;
|
|
}
|
|
else
|
|
enable_activate_all_index=1;
|
|
DBUG_RETURN(error);
|
|
}
|
|
|
|
|
|
bool ha_myisam::check_and_repair(THD *thd)
|
|
{
|
|
int error=0;
|
|
int marked_crashed;
|
|
HA_CHECK_OPT check_opt;
|
|
DBUG_ENTER("ha_myisam::auto_check_and_repair");
|
|
|
|
check_opt.init();
|
|
check_opt.flags= T_MEDIUM | T_AUTO_REPAIR;
|
|
// Don't use quick if deleted rows
|
|
if (!file->state->del && (myisam_recover_options & HA_RECOVER_QUICK))
|
|
check_opt.flags|=T_QUICK;
|
|
sql_print_error("Warning: Checking table: '%s'",table->path);
|
|
if ((marked_crashed=mi_is_crashed(file)) || check(thd, &check_opt))
|
|
{
|
|
sql_print_error("Warning: Recovering table: '%s'",table->path);
|
|
check_opt.flags=
|
|
((myisam_recover_options & HA_RECOVER_BACKUP ? T_BACKUP_DATA : 0) |
|
|
(marked_crashed ? 0 : T_QUICK) |
|
|
(myisam_recover_options & HA_RECOVER_FORCE ? 0 : T_SAFE_REPAIR) |
|
|
T_AUTO_REPAIR);
|
|
if (repair(thd, &check_opt))
|
|
error=1;
|
|
}
|
|
DBUG_RETURN(error);
|
|
}
|
|
|
|
bool ha_myisam::is_crashed() const
|
|
{
|
|
return (file->s->state.changed & STATE_CRASHED ||
|
|
(my_disable_locking && file->s->state.open_count));
|
|
}
|
|
|
|
int ha_myisam::update_row(const byte * old_data, byte * new_data)
|
|
{
|
|
statistic_increment(ha_update_count,&LOCK_status);
|
|
if (table->time_stamp)
|
|
update_timestamp(new_data+table->time_stamp-1);
|
|
return mi_update(file,old_data,new_data);
|
|
}
|
|
|
|
int ha_myisam::delete_row(const byte * buf)
|
|
{
|
|
statistic_increment(ha_delete_count,&LOCK_status);
|
|
return mi_delete(file,buf);
|
|
}
|
|
|
|
int ha_myisam::index_read(byte * buf, const byte * key,
|
|
uint key_len, enum ha_rkey_function find_flag)
|
|
{
|
|
statistic_increment(ha_read_key_count,&LOCK_status);
|
|
int error=mi_rkey(file,buf,active_index, key, key_len, find_flag);
|
|
table->status=error ? STATUS_NOT_FOUND: 0;
|
|
return error;
|
|
}
|
|
|
|
int ha_myisam::index_read_idx(byte * buf, uint index, const byte * key,
|
|
uint key_len, enum ha_rkey_function find_flag)
|
|
{
|
|
statistic_increment(ha_read_key_count,&LOCK_status);
|
|
int error=mi_rkey(file,buf,index, key, key_len, find_flag);
|
|
table->status=error ? STATUS_NOT_FOUND: 0;
|
|
return error;
|
|
}
|
|
|
|
int ha_myisam::index_read_last(byte * buf, const byte * key, uint key_len)
|
|
{
|
|
statistic_increment(ha_read_key_count,&LOCK_status);
|
|
int error=mi_rkey(file,buf,active_index, key, key_len, HA_READ_PREFIX_LAST);
|
|
table->status=error ? STATUS_NOT_FOUND: 0;
|
|
return error;
|
|
}
|
|
|
|
int ha_myisam::index_next(byte * buf)
|
|
{
|
|
statistic_increment(ha_read_next_count,&LOCK_status);
|
|
int error=mi_rnext(file,buf,active_index);
|
|
table->status=error ? STATUS_NOT_FOUND: 0;
|
|
return error;
|
|
}
|
|
|
|
int ha_myisam::index_prev(byte * buf)
|
|
{
|
|
statistic_increment(ha_read_prev_count,&LOCK_status);
|
|
int error=mi_rprev(file,buf, active_index);
|
|
table->status=error ? STATUS_NOT_FOUND: 0;
|
|
return error;
|
|
}
|
|
|
|
int ha_myisam::index_first(byte * buf)
|
|
{
|
|
statistic_increment(ha_read_first_count,&LOCK_status);
|
|
int error=mi_rfirst(file, buf, active_index);
|
|
table->status=error ? STATUS_NOT_FOUND: 0;
|
|
return error;
|
|
}
|
|
|
|
int ha_myisam::index_last(byte * buf)
|
|
{
|
|
statistic_increment(ha_read_last_count,&LOCK_status);
|
|
int error=mi_rlast(file, buf, active_index);
|
|
table->status=error ? STATUS_NOT_FOUND: 0;
|
|
return error;
|
|
}
|
|
|
|
int ha_myisam::index_next_same(byte * buf,
|
|
const byte *key __attribute__((unused)),
|
|
uint length __attribute__((unused)))
|
|
{
|
|
statistic_increment(ha_read_next_count,&LOCK_status);
|
|
int error=mi_rnext_same(file,buf);
|
|
table->status=error ? STATUS_NOT_FOUND: 0;
|
|
return error;
|
|
}
|
|
|
|
|
|
int ha_myisam::rnd_init(bool scan)
|
|
{
|
|
if (scan)
|
|
return mi_scan_init(file);
|
|
return mi_extra(file, HA_EXTRA_RESET, 0);
|
|
}
|
|
|
|
int ha_myisam::rnd_next(byte *buf)
|
|
{
|
|
statistic_increment(ha_read_rnd_next_count,&LOCK_status);
|
|
int error=mi_scan(file, buf);
|
|
table->status=error ? STATUS_NOT_FOUND: 0;
|
|
return error;
|
|
}
|
|
|
|
int ha_myisam::restart_rnd_next(byte *buf, byte *pos)
|
|
{
|
|
return rnd_pos(buf,pos);
|
|
}
|
|
|
|
int ha_myisam::rnd_pos(byte * buf, byte *pos)
|
|
{
|
|
statistic_increment(ha_read_rnd_count,&LOCK_status);
|
|
int error=mi_rrnd(file, buf, ha_get_ptr(pos,ref_length));
|
|
table->status=error ? STATUS_NOT_FOUND: 0;
|
|
return error;
|
|
}
|
|
|
|
void ha_myisam::position(const byte* record)
|
|
{
|
|
my_off_t position=mi_position(file);
|
|
ha_store_ptr(ref, ref_length, position);
|
|
}
|
|
|
|
void ha_myisam::info(uint flag)
|
|
{
|
|
MI_ISAMINFO info;
|
|
char name_buff[FN_REFLEN];
|
|
|
|
(void) mi_status(file,&info,flag);
|
|
if (flag & HA_STATUS_VARIABLE)
|
|
{
|
|
records = info.records;
|
|
deleted = info.deleted;
|
|
data_file_length=info.data_file_length;
|
|
index_file_length=info.index_file_length;
|
|
delete_length = info.delete_length;
|
|
check_time = info.check_time;
|
|
mean_rec_length=info.mean_reclength;
|
|
}
|
|
if (flag & HA_STATUS_CONST)
|
|
{
|
|
max_data_file_length=info.max_data_file_length;
|
|
max_index_file_length=info.max_index_file_length;
|
|
create_time = info.create_time;
|
|
sortkey = info.sortkey;
|
|
ref_length=info.reflength;
|
|
table->db_options_in_use = info.options;
|
|
block_size=myisam_block_size;
|
|
table->keys_in_use= (set_bits(key_map, table->keys) &
|
|
(key_map) info.key_map);
|
|
table->keys_for_keyread= table->keys_in_use & ~table->read_only_keys;
|
|
table->db_record_offset=info.record_offset;
|
|
if (table->key_parts)
|
|
memcpy((char*) table->key_info[0].rec_per_key,
|
|
(char*) info.rec_per_key,
|
|
sizeof(table->key_info[0].rec_per_key)*table->key_parts);
|
|
raid_type=info.raid_type;
|
|
raid_chunks=info.raid_chunks;
|
|
raid_chunksize=info.raid_chunksize;
|
|
|
|
/*
|
|
Set data_file_name and index_file_name to point at the symlink value
|
|
if table is symlinked (Ie; Real name is not same as generated name)
|
|
*/
|
|
data_file_name=index_file_name=0;
|
|
fn_format(name_buff, file->filename, "", MI_NAME_DEXT, 2);
|
|
if (strcmp(name_buff, info.data_file_name))
|
|
data_file_name=info.data_file_name;
|
|
strmov(fn_ext(name_buff),MI_NAME_IEXT);
|
|
if (strcmp(name_buff, info.index_file_name))
|
|
index_file_name=info.index_file_name;
|
|
}
|
|
if (flag & HA_STATUS_ERRKEY)
|
|
{
|
|
errkey = info.errkey;
|
|
ha_store_ptr(dupp_ref, ref_length, info.dupp_key_pos);
|
|
}
|
|
if (flag & HA_STATUS_TIME)
|
|
update_time = info.update_time;
|
|
if (flag & HA_STATUS_AUTO)
|
|
auto_increment_value= info.auto_increment;
|
|
}
|
|
|
|
|
|
int ha_myisam::extra(enum ha_extra_function operation)
|
|
{
|
|
if ((specialflag & SPECIAL_SAFE_MODE) && operation == HA_EXTRA_KEYREAD)
|
|
return 0;
|
|
return mi_extra(file, operation, 0);
|
|
}
|
|
|
|
|
|
/* To be used with WRITE_CACHE and EXTRA_CACHE */
|
|
|
|
int ha_myisam::extra_opt(enum ha_extra_function operation, ulong cache_size)
|
|
{
|
|
if ((specialflag & SPECIAL_SAFE_MODE) && operation == HA_EXTRA_WRITE_CACHE)
|
|
return 0;
|
|
return mi_extra(file, operation, (void*) &cache_size);
|
|
}
|
|
|
|
|
|
int ha_myisam::reset(void)
|
|
{
|
|
return mi_extra(file, HA_EXTRA_RESET, 0);
|
|
}
|
|
|
|
int ha_myisam::delete_all_rows()
|
|
{
|
|
return mi_delete_all_rows(file);
|
|
}
|
|
|
|
int ha_myisam::delete_table(const char *name)
|
|
{
|
|
return mi_delete_table(name);
|
|
}
|
|
|
|
int ha_myisam::external_lock(THD *thd, int lock_type)
|
|
{
|
|
return mi_lock_database(file, !table->tmp_table ?
|
|
lock_type : ((lock_type == F_UNLCK) ?
|
|
F_UNLCK : F_EXTRA_LCK));
|
|
}
|
|
|
|
|
|
THR_LOCK_DATA **ha_myisam::store_lock(THD *thd,
|
|
THR_LOCK_DATA **to,
|
|
enum thr_lock_type lock_type)
|
|
{
|
|
if (lock_type != TL_IGNORE && file->lock.type == TL_UNLOCK)
|
|
file->lock.type=lock_type;
|
|
*to++= &file->lock;
|
|
return to;
|
|
}
|
|
|
|
void ha_myisam::update_create_info(HA_CREATE_INFO *create_info)
|
|
{
|
|
ha_myisam::info(HA_STATUS_AUTO | HA_STATUS_CONST);
|
|
if (!(create_info->used_fields & HA_CREATE_USED_AUTO))
|
|
{
|
|
create_info->auto_increment_value=auto_increment_value;
|
|
}
|
|
if (!(create_info->used_fields & HA_CREATE_USED_RAID))
|
|
{
|
|
create_info->raid_type= raid_type;
|
|
create_info->raid_chunks= raid_chunks;
|
|
create_info->raid_chunksize= raid_chunksize;
|
|
}
|
|
create_info->data_file_name=data_file_name;
|
|
create_info->index_file_name=index_file_name;
|
|
}
|
|
|
|
|
|
int ha_myisam::create(const char *name, register TABLE *table_arg,
|
|
HA_CREATE_INFO *info)
|
|
{
|
|
int error;
|
|
uint i,j,recpos,minpos,fieldpos,temp_length,length;
|
|
bool found_real_auto_increment=0;
|
|
enum ha_base_keytype type;
|
|
char buff[FN_REFLEN];
|
|
KEY *pos;
|
|
MI_KEYDEF *keydef;
|
|
MI_COLUMNDEF *recinfo,*recinfo_pos;
|
|
MI_KEYSEG *keyseg;
|
|
uint options=table_arg->db_options_in_use;
|
|
DBUG_ENTER("ha_myisam::create");
|
|
|
|
type=HA_KEYTYPE_BINARY; // Keep compiler happy
|
|
if (!(my_multi_malloc(MYF(MY_WME),
|
|
&recinfo,(table_arg->fields*2+2)*sizeof(MI_COLUMNDEF),
|
|
&keydef, table_arg->keys*sizeof(MI_KEYDEF),
|
|
&keyseg,
|
|
((table_arg->key_parts + table_arg->keys) *
|
|
sizeof(MI_KEYSEG)),
|
|
NullS)))
|
|
DBUG_RETURN(HA_ERR_OUT_OF_MEM);
|
|
|
|
pos=table_arg->key_info;
|
|
for (i=0; i < table_arg->keys ; i++, pos++)
|
|
{
|
|
keydef[i].flag= (pos->flags & (HA_NOSAME | HA_FULLTEXT));
|
|
keydef[i].seg=keyseg;
|
|
keydef[i].keysegs=pos->key_parts;
|
|
for (j=0 ; j < pos->key_parts ; j++)
|
|
{
|
|
keydef[i].seg[j].flag=pos->key_part[j].key_part_flag;
|
|
Field *field=pos->key_part[j].field;
|
|
type=field->key_type();
|
|
|
|
if (options & HA_OPTION_PACK_KEYS ||
|
|
(pos->flags & (HA_PACK_KEY | HA_BINARY_PACK_KEY |
|
|
HA_SPACE_PACK_USED)))
|
|
{
|
|
if (pos->key_part[j].length > 8 &&
|
|
(type == HA_KEYTYPE_TEXT ||
|
|
type == HA_KEYTYPE_NUM ||
|
|
(type == HA_KEYTYPE_BINARY && !field->zero_pack())))
|
|
{
|
|
/* No blobs here */
|
|
if (j == 0)
|
|
keydef[i].flag|=HA_PACK_KEY;
|
|
if (!(field->flags & ZEROFILL_FLAG) &&
|
|
(field->type() == FIELD_TYPE_STRING ||
|
|
field->type() == FIELD_TYPE_VAR_STRING ||
|
|
((int) (pos->key_part[j].length - field->decimals()))
|
|
>= 4))
|
|
keydef[i].seg[j].flag|=HA_SPACE_PACK;
|
|
}
|
|
else if (j == 0 && (!(pos->flags & HA_NOSAME) || pos->key_length > 16))
|
|
keydef[i].flag|= HA_BINARY_PACK_KEY;
|
|
}
|
|
keydef[i].seg[j].type= (int) type;
|
|
keydef[i].seg[j].start= pos->key_part[j].offset;
|
|
keydef[i].seg[j].length= pos->key_part[j].length;
|
|
keydef[i].seg[j].bit_start=keydef[i].seg[j].bit_end=0;
|
|
keydef[i].seg[j].language=MY_CHARSET_CURRENT;
|
|
|
|
if (field->null_ptr)
|
|
{
|
|
keydef[i].seg[j].null_bit=field->null_bit;
|
|
keydef[i].seg[j].null_pos= (uint) (field->null_ptr-
|
|
(uchar*) table_arg->record[0]);
|
|
}
|
|
else
|
|
{
|
|
keydef[i].seg[j].null_bit=0;
|
|
keydef[i].seg[j].null_pos=0;
|
|
}
|
|
if (field->type() == FIELD_TYPE_BLOB)
|
|
{
|
|
keydef[i].seg[j].flag|=HA_BLOB_PART;
|
|
/* save number of bytes used to pack length */
|
|
keydef[i].seg[j].bit_start= (uint) (field->pack_length() -
|
|
table_arg->blob_ptr_size);
|
|
}
|
|
}
|
|
keyseg+=pos->key_parts;
|
|
}
|
|
|
|
if (table_arg->found_next_number_field)
|
|
{
|
|
keydef[table_arg->next_number_index].flag|= HA_AUTO_KEY;
|
|
found_real_auto_increment= table_arg->next_number_key_offset == 0;
|
|
}
|
|
|
|
recpos=0; recinfo_pos=recinfo;
|
|
while (recpos < (uint) table_arg->reclength)
|
|
{
|
|
Field **field,*found=0;
|
|
minpos=table_arg->reclength; length=0;
|
|
|
|
for (field=table_arg->field ; *field ; field++)
|
|
{
|
|
if ((fieldpos=(*field)->offset()) >= recpos &&
|
|
fieldpos <= minpos)
|
|
{
|
|
/* skip null fields */
|
|
if (!(temp_length= (*field)->pack_length()))
|
|
continue; /* Skip null-fields */
|
|
if (! found || fieldpos < minpos ||
|
|
(fieldpos == minpos && temp_length < length))
|
|
{
|
|
minpos=fieldpos; found= *field; length=temp_length;
|
|
}
|
|
}
|
|
}
|
|
DBUG_PRINT("loop",("found: %lx recpos: %d minpos: %d length: %d",
|
|
found,recpos,minpos,length));
|
|
if (recpos != minpos)
|
|
{ // Reserved space (Null bits?)
|
|
bzero((char*) recinfo_pos,sizeof(*recinfo_pos));
|
|
recinfo_pos->type=(int) FIELD_NORMAL;
|
|
recinfo_pos++->length= (uint16) (minpos-recpos);
|
|
}
|
|
if (! found)
|
|
break;
|
|
|
|
if (found->flags & BLOB_FLAG)
|
|
{
|
|
recinfo_pos->type= (int) FIELD_BLOB;
|
|
}
|
|
else if (!(options & HA_OPTION_PACK_RECORD))
|
|
recinfo_pos->type= (int) FIELD_NORMAL;
|
|
else if (found->zero_pack())
|
|
recinfo_pos->type= (int) FIELD_SKIP_ZERO;
|
|
else
|
|
recinfo_pos->type= (int) ((length <= 3 ||
|
|
(found->flags & ZEROFILL_FLAG)) ?
|
|
FIELD_NORMAL :
|
|
found->type() == FIELD_TYPE_STRING ||
|
|
found->type() == FIELD_TYPE_VAR_STRING ?
|
|
FIELD_SKIP_ENDSPACE :
|
|
FIELD_SKIP_PRESPACE);
|
|
if (found->null_ptr)
|
|
{
|
|
recinfo_pos->null_bit=found->null_bit;
|
|
recinfo_pos->null_pos= (uint) (found->null_ptr-
|
|
(uchar*) table_arg->record[0]);
|
|
}
|
|
else
|
|
{
|
|
recinfo_pos->null_bit=0;
|
|
recinfo_pos->null_pos=0;
|
|
}
|
|
(recinfo_pos++) ->length=(uint16) length;
|
|
recpos=minpos+length;
|
|
DBUG_PRINT("loop",("length: %d type: %d",
|
|
recinfo_pos[-1].length,recinfo_pos[-1].type));
|
|
|
|
}
|
|
MI_CREATE_INFO create_info;
|
|
bzero((char*) &create_info,sizeof(create_info));
|
|
create_info.max_rows=table_arg->max_rows;
|
|
create_info.reloc_rows=table_arg->min_rows;
|
|
create_info.with_auto_increment=found_real_auto_increment;
|
|
create_info.auto_increment=(info->auto_increment_value ?
|
|
info->auto_increment_value -1 :
|
|
(ulonglong) 0);
|
|
create_info.data_file_length= ((ulonglong) table_arg->max_rows *
|
|
table_arg->avg_row_length);
|
|
create_info.raid_type=info->raid_type;
|
|
create_info.raid_chunks= (info->raid_chunks ? info->raid_chunks :
|
|
RAID_DEFAULT_CHUNKS);
|
|
create_info.raid_chunksize=(info->raid_chunksize ? info->raid_chunksize :
|
|
RAID_DEFAULT_CHUNKSIZE);
|
|
create_info.data_file_name= info->data_file_name;
|
|
create_info.index_file_name=info->index_file_name;
|
|
|
|
error=mi_create(fn_format(buff,name,"","",2+4),
|
|
table_arg->keys,keydef,
|
|
(uint) (recinfo_pos-recinfo), recinfo,
|
|
0, (MI_UNIQUEDEF*) 0,
|
|
&create_info,
|
|
(((options & HA_OPTION_PACK_RECORD) ? HA_PACK_RECORD : 0) |
|
|
((options & HA_OPTION_CHECKSUM) ? HA_CREATE_CHECKSUM : 0) |
|
|
((options & HA_OPTION_DELAY_KEY_WRITE) ?
|
|
HA_CREATE_DELAY_KEY_WRITE : 0)));
|
|
|
|
|
|
my_free((gptr) recinfo,MYF(0));
|
|
DBUG_RETURN(error);
|
|
}
|
|
|
|
|
|
int ha_myisam::rename_table(const char * from, const char * to)
|
|
{
|
|
return mi_rename(from,to);
|
|
}
|
|
|
|
|
|
longlong ha_myisam::get_auto_increment()
|
|
{
|
|
if (!table->next_number_key_offset)
|
|
{ // Autoincrement at key-start
|
|
ha_myisam::info(HA_STATUS_AUTO);
|
|
return auto_increment_value;
|
|
}
|
|
|
|
if (table->bulk_insert)
|
|
mi_flush_bulk_insert(file, table->next_number_index);
|
|
|
|
longlong nr;
|
|
int error;
|
|
byte key[MI_MAX_KEY_LENGTH];
|
|
(void) extra(HA_EXTRA_KEYREAD);
|
|
key_copy(key,table,table->next_number_index,
|
|
table->next_number_key_offset);
|
|
error=mi_rkey(file,table->record[1],(int) table->next_number_index,
|
|
key,table->next_number_key_offset,HA_READ_PREFIX_LAST);
|
|
if (error)
|
|
nr=1;
|
|
else
|
|
nr=(longlong)
|
|
table->next_number_field->val_int_offset(table->rec_buff_length)+1;
|
|
extra(HA_EXTRA_NO_KEYREAD);
|
|
return nr;
|
|
}
|
|
|
|
|
|
/*
|
|
Find out how many rows there is in the given range
|
|
|
|
SYNOPSIS
|
|
records_in_range()
|
|
inx Index to use
|
|
start_key Start of range. Null pointer if from first key
|
|
start_key_len Length of start key
|
|
start_search_flag Flag if start key should be included or not
|
|
end_key End of range. Null pointer if to last key
|
|
end_key_len Length of end key
|
|
end_search_flag Flag if start key should be included or not
|
|
|
|
NOTES
|
|
start_search_flag can have one of the following values:
|
|
HA_READ_KEY_EXACT Include the key in the range
|
|
HA_READ_AFTER_KEY Don't include key in range
|
|
|
|
end_search_flag can have one of the following values:
|
|
HA_READ_BEFORE_KEY Don't include key in range
|
|
HA_READ_AFTER_KEY Include all 'end_key' values in the range
|
|
|
|
RETURN
|
|
HA_POS_ERROR Something is wrong with the index tree.
|
|
0 There is no matching keys in the given range
|
|
number > 0 There is approximately 'number' matching rows in
|
|
the range.
|
|
*/
|
|
|
|
ha_rows ha_myisam::records_in_range(int inx,
|
|
const byte *start_key,uint start_key_len,
|
|
enum ha_rkey_function start_search_flag,
|
|
const byte *end_key,uint end_key_len,
|
|
enum ha_rkey_function end_search_flag)
|
|
{
|
|
return (ha_rows) mi_records_in_range(file,
|
|
inx,
|
|
start_key,start_key_len,
|
|
start_search_flag,
|
|
end_key,end_key_len,
|
|
end_search_flag);
|
|
}
|
|
|
|
|
|
int ha_myisam::ft_read(byte * buf)
|
|
{
|
|
int error;
|
|
|
|
if (!ft_handler)
|
|
return -1;
|
|
|
|
thread_safe_increment(ha_read_next_count,&LOCK_status); // why ?
|
|
|
|
error=ft_handler->please->read_next(ft_handler,(char*) buf);
|
|
|
|
table->status=error ? STATUS_NOT_FOUND: 0;
|
|
return error;
|
|
}
|