mirror of
https://github.com/MariaDB/server.git
synced 2025-12-24 11:21:21 +03:00
See test maria-recovery.test for a model; all include scripts have an "API" section at start if they do take parameters from outside. * Fixing bug reported by Jani and Monty (when two REDOs about the same page in one group, see ma_blockrec.c). * Fixing small bugs in recovery mysql-test/include/wait_until_connected_again.inc: be sure to enter the loop (the previous query by the caller may not have failed: it could be query; mysqladmin shutdown; call this script). mysql-test/lib/mtr_process.pl: * Through the "expect" file a test can tell mtr that a server crash is expected. What the file contains is irrelevant. Now if its last line starts with "wait", mtr will wait before restarting (it will wait for the last line to not start with "wait"). This is for tests which need to mangle files under the feet of a dead mysqld. * Remove "expect" file before restarting; otherwise there could be a race condition: tests sees server restarted, does something, writes an "expect" file, and then mtr removes that file, then test kills mysqld, and then mtr will never restart it. storage/maria/ma_blockrec.c: - when applying a REDO in recovery, we don't anymore put UNDO's LSN on the page at once; indeed if in this REDO's group there comes another REDO for the same page it would be wrongly skipped. Instead, we keep pages pinned, don't change their LSN. When done with all REDOs of the group we unpin them and stamp them with UNDO's LSN. - fixing bug in applying of REDO_PURGE_BLOCKS in recovery: page_range sometimes has TAIL_BIT set, need to turn it down to know the real page range. - Both bugs are covered in maria-recovery.test storage/maria/ma_checkpoint.c: Capability to, in debug builds only, do some special operations (flush all bitmap and data pages, flush state, flush log) and crash mysqld, to later test recovery. Driven by some --debug=d, symbols. storage/maria/ma_open.c: debugging info storage/maria/ma_pagecache.c: Now that we can _ma_unpin_all_pages() during the REDO phase to set page's LSN, the assertion needs to be relaxed. storage/maria/ma_recovery.c: - open trace file in append mode (useful when a test triggers several recoveries, we see them all). - fixing wrong error detection, it's possible that during recovery we want to open an already open table. - when applying a REDO in recovery, we don't anymore put UNDO's LSN on the page at once; indeed if in this REDO's group there comes another REDO for the same page it would be wrongly skipped. Instead, we keep pages pinned, don't change their LSN. When done with all REDOs of the group we unpin them and stamp them with UNDO's LSN. - we verify that all log records of a group are about the same table, for debugging. mysql-test/r/maria-recovery.result: result mysql-test/t/maria-recovery-master.opt: crash is expected, core file would take room, stack trace would wake pushbuild up. mysql-test/t/maria-recovery.test: Test of recovery from mysql-test (it is already tested as unit tests in ma_test_recovery) (WL#4137) - test that, if recovery is made to start on an empty table it can replay the effects of committed and uncommitted statements (having only the committed ones in the end result). This should be the first test for someone writing code of new REDOs. - test that, if mysqld is crashed and recovery runs we have only committed statements in the end result. Crashes are done in different ways: flush nothing (so, uncommitted statement is often missing from the log => no rollback to do); flush pagecache (implicitely flushes log (WAL)) and flush log, both causes rollbacks; flush log can also flush state (state.records etc) to test recovery of the state (not tested well now as we repair the index anyway). - test of bug found by Jani and Monty in recovery (two REDO about the same page in one group). mysql-test/include/maria_empty_logs.inc: removes logs, to have a clean sheet for testing recovery. mysql-test/include/maria_make_snapshot.inc: copies a table to another directory, or back, or compares both (comparison is not implemented as physical comparison is impossible if an UNDO phase happened). mysql-test/include/maria_make_snapshot_for_comparison.inc: copies tables to another directory so that they can later serve as a comparison reference (they are the good tables, recovery should produce similar ones). mysql-test/include/maria_make_snapshot_for_feeding_recovery.inc: When we want to force recovery to start on old tables, we prepare old tables with this script: we put them in a spare directory. They are later copied back over mysqltest tables while mysqld is dead. We also need to copy back the control file, otherwise mysqld, in recovery, would start from the latest checkpoint: latest checkpoint plus old tables is not a recovery-possible scenario of course. mysql-test/include/maria_verify_recovery.inc: causes mysqld to crash, restores old tables if requested, lets recovery run, compares resulting tables with reference tables by using CHECKSUM TABLE. We don't do any sanity checks on page's LSN in resulting tables, yet.
1583 lines
52 KiB
C
1583 lines
52 KiB
C
/* Copyright (C) 2006 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; 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 */
|
|
|
|
/* open a isam-database */
|
|
|
|
#include "ma_fulltext.h"
|
|
#include "ma_sp_defs.h"
|
|
#include "ma_rt_index.h"
|
|
#include "ma_blockrec.h"
|
|
#include "trnman.h"
|
|
#include <m_ctype.h>
|
|
|
|
#if defined(MSDOS) || defined(__WIN__)
|
|
#ifdef __WIN__
|
|
#include <fcntl.h>
|
|
#else
|
|
#include <process.h> /* Prototype for getpid */
|
|
#endif
|
|
#endif
|
|
#ifdef VMS
|
|
#include "static.c"
|
|
#endif
|
|
|
|
static void setup_key_functions(MARIA_KEYDEF *keyinfo);
|
|
static my_bool maria_scan_init_dummy(MARIA_HA *info);
|
|
static void maria_scan_end_dummy(MARIA_HA *info);
|
|
static my_bool maria_once_init_dummy(MARIA_SHARE *, File);
|
|
static my_bool maria_once_end_dummy(MARIA_SHARE *);
|
|
static uchar *_ma_base_info_read(uchar *ptr, MARIA_BASE_INFO *base);
|
|
static uchar *_ma_state_info_read(uchar *ptr, MARIA_STATE_INFO *state);
|
|
|
|
#define get_next_element(to,pos,size) { memcpy((char*) to,pos,(size_t) size); \
|
|
pos+=size;}
|
|
|
|
|
|
#define disk_pos_assert(pos, end_pos) \
|
|
if (pos > end_pos) \
|
|
{ \
|
|
my_errno=HA_ERR_CRASHED; \
|
|
goto err; \
|
|
}
|
|
|
|
|
|
/******************************************************************************
|
|
** Return the shared struct if the table is already open.
|
|
** In MySQL the server will handle version issues.
|
|
******************************************************************************/
|
|
|
|
MARIA_HA *_ma_test_if_reopen(const char *filename)
|
|
{
|
|
LIST *pos;
|
|
|
|
for (pos=maria_open_list ; pos ; pos=pos->next)
|
|
{
|
|
MARIA_HA *info=(MARIA_HA*) pos->data;
|
|
MARIA_SHARE *share=info->s;
|
|
if (!strcmp(share->unique_file_name,filename) && share->last_version)
|
|
return info;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
/*
|
|
Open a new instance of an already opened Maria table
|
|
|
|
SYNOPSIS
|
|
maria_clone_internal()
|
|
share Share of already open table
|
|
mode Mode of table (O_RDONLY | O_RDWR)
|
|
data_file Filedescriptor of data file to use < 0 if one should open
|
|
open it.
|
|
|
|
RETURN
|
|
# Maria handler
|
|
0 Error
|
|
*/
|
|
|
|
|
|
static MARIA_HA *maria_clone_internal(MARIA_SHARE *share, int mode,
|
|
File data_file)
|
|
{
|
|
int save_errno;
|
|
uint errpos;
|
|
MARIA_HA info,*m_info;
|
|
my_bitmap_map *changed_fields_bitmap;
|
|
DBUG_ENTER("maria_clone_internal");
|
|
|
|
errpos= 0;
|
|
bzero((uchar*) &info,sizeof(info));
|
|
|
|
if (mode == O_RDWR && share->mode == O_RDONLY)
|
|
{
|
|
my_errno=EACCES; /* Can't open in write mode */
|
|
goto err;
|
|
}
|
|
if (data_file >= 0)
|
|
info.dfile.file= data_file;
|
|
else if (_ma_open_datafile(&info, share, -1))
|
|
goto err;
|
|
errpos= 5;
|
|
|
|
/* alloc and set up private structure parts */
|
|
if (!my_multi_malloc(MY_WME,
|
|
&m_info,sizeof(MARIA_HA),
|
|
&info.blobs,sizeof(MARIA_BLOB)*share->base.blobs,
|
|
&info.buff,(share->base.max_key_block_length*2+
|
|
share->base.max_key_length),
|
|
&info.lastkey,share->base.max_key_length*3+1,
|
|
&info.first_mbr_key, share->base.max_key_length,
|
|
&info.maria_rtree_recursion_state,
|
|
share->have_rtree ? 1024 : 0,
|
|
&changed_fields_bitmap,
|
|
bitmap_buffer_size(share->base.fields),
|
|
NullS))
|
|
goto err;
|
|
errpos= 6;
|
|
|
|
memcpy(info.blobs,share->blobs,sizeof(MARIA_BLOB)*share->base.blobs);
|
|
info.lastkey2=info.lastkey+share->base.max_key_length;
|
|
|
|
info.s=share;
|
|
info.cur_row.lastpos= HA_OFFSET_ERROR;
|
|
info.update= (short) (HA_STATE_NEXT_FOUND+HA_STATE_PREV_FOUND);
|
|
info.opt_flag=READ_CHECK_USED;
|
|
info.this_unique= (ulong) info.dfile.file; /* Uniq number in process */
|
|
if (share->data_file_type == COMPRESSED_RECORD)
|
|
info.this_unique= share->state.unique;
|
|
info.this_loop=0; /* Update counter */
|
|
info.last_unique= share->state.unique;
|
|
info.last_loop= share->state.update_count;
|
|
info.lock_type=F_UNLCK;
|
|
info.quick_mode=0;
|
|
info.bulk_insert=0;
|
|
info.ft1_to_ft2=0;
|
|
info.errkey= -1;
|
|
info.page_changed=1;
|
|
info.keyread_buff= info.buff + share->base.max_key_block_length;
|
|
bitmap_init(&info.changed_fields, changed_fields_bitmap,
|
|
share->base.fields, 0);
|
|
if ((*share->init)(&info))
|
|
goto err;
|
|
|
|
pthread_mutex_lock(&share->intern_lock);
|
|
info.read_record= share->read_record;
|
|
share->reopen++;
|
|
share->write_flag=MYF(MY_NABP | MY_WAIT_IF_FULL);
|
|
if (share->options & HA_OPTION_READ_ONLY_DATA)
|
|
{
|
|
info.lock_type=F_RDLCK;
|
|
share->r_locks++;
|
|
share->tot_locks++;
|
|
}
|
|
if (share->options & HA_OPTION_TMP_TABLE)
|
|
{
|
|
share->temporary= share->delay_key_write= 1;
|
|
|
|
share->write_flag=MYF(MY_NABP);
|
|
share->w_locks++; /* We don't have to update status */
|
|
share->tot_locks++;
|
|
info.lock_type=F_WRLCK;
|
|
}
|
|
if ((share->options & HA_OPTION_DELAY_KEY_WRITE) &&
|
|
maria_delay_key_write)
|
|
share->delay_key_write=1;
|
|
|
|
info.state= &share->state.state; /* Change global values by default */
|
|
if (!share->base.born_transactional) /* For transactional ones ... */
|
|
info.trn= &dummy_transaction_object; /* ... force crash if no trn given */
|
|
pthread_mutex_unlock(&share->intern_lock);
|
|
|
|
/* Allocate buffer for one record */
|
|
/* prerequisites: info->rec_buffer == 0 && info->rec_buff_size == 0 */
|
|
if (_ma_alloc_buffer(&info.rec_buff, &info.rec_buff_size,
|
|
share->base.default_rec_buff_size))
|
|
goto err;
|
|
|
|
bzero(info.rec_buff, share->base.default_rec_buff_size);
|
|
|
|
*m_info=info;
|
|
#ifdef THREAD
|
|
thr_lock_data_init(&share->lock,&m_info->lock,(void*) m_info);
|
|
#endif
|
|
m_info->open_list.data=(void*) m_info;
|
|
maria_open_list=list_add(maria_open_list,&m_info->open_list);
|
|
|
|
DBUG_RETURN(m_info);
|
|
|
|
err:
|
|
save_errno=my_errno ? my_errno : HA_ERR_END_OF_FILE;
|
|
if ((save_errno == HA_ERR_CRASHED) ||
|
|
(save_errno == HA_ERR_CRASHED_ON_USAGE) ||
|
|
(save_errno == HA_ERR_CRASHED_ON_REPAIR))
|
|
_ma_report_error(save_errno, share->open_file_name);
|
|
switch (errpos) {
|
|
case 6:
|
|
(*share->end)(&info);
|
|
my_free((uchar*) m_info,MYF(0));
|
|
/* fall through */
|
|
case 5:
|
|
if (data_file < 0)
|
|
VOID(my_close(info.dfile.file, MYF(0)));
|
|
break;
|
|
}
|
|
my_errno=save_errno;
|
|
DBUG_RETURN (NULL);
|
|
} /* maria_clone_internal */
|
|
|
|
|
|
/* Make a clone of a maria table */
|
|
|
|
MARIA_HA *maria_clone(MARIA_SHARE *share, int mode)
|
|
{
|
|
MARIA_HA *new_info;
|
|
pthread_mutex_lock(&THR_LOCK_maria);
|
|
new_info= maria_clone_internal(share, mode,
|
|
share->data_file_type == BLOCK_RECORD ?
|
|
share->bitmap.file.file : -1);
|
|
pthread_mutex_unlock(&THR_LOCK_maria);
|
|
return new_info;
|
|
}
|
|
|
|
|
|
/******************************************************************************
|
|
open a MARIA table
|
|
|
|
See my_base.h for the handle_locking argument
|
|
if handle_locking and HA_OPEN_ABORT_IF_CRASHED then abort if the table
|
|
is marked crashed or if we are not using locking and the table doesn't
|
|
have an open count of 0.
|
|
******************************************************************************/
|
|
|
|
MARIA_HA *maria_open(const char *name, int mode, uint open_flags)
|
|
{
|
|
int kfile,open_mode,save_errno;
|
|
uint i,j,len,errpos,head_length,base_pos,info_length,keys,
|
|
key_parts,unique_key_parts,fulltext_keys,uniques;
|
|
char name_buff[FN_REFLEN], org_name[FN_REFLEN], index_name[FN_REFLEN],
|
|
data_name[FN_REFLEN];
|
|
uchar *disk_cache, *disk_pos, *end_pos;
|
|
MARIA_HA info,*m_info,*old_info;
|
|
MARIA_SHARE share_buff,*share;
|
|
ulong rec_per_key_part[HA_MAX_POSSIBLE_KEY*HA_MAX_KEY_SEG];
|
|
my_off_t key_root[HA_MAX_POSSIBLE_KEY];
|
|
ulonglong max_key_file_length, max_data_file_length;
|
|
File data_file= -1;
|
|
DBUG_ENTER("maria_open");
|
|
|
|
LINT_INIT(m_info);
|
|
kfile= -1;
|
|
errpos= 0;
|
|
head_length=sizeof(share_buff.state.header);
|
|
bzero((uchar*) &info,sizeof(info));
|
|
|
|
my_realpath(name_buff, fn_format(org_name,name,"",MARIA_NAME_IEXT,
|
|
MY_UNPACK_FILENAME),MYF(0));
|
|
pthread_mutex_lock(&THR_LOCK_maria);
|
|
old_info= 0;
|
|
if ((open_flags & HA_OPEN_COPY) ||
|
|
!(old_info=_ma_test_if_reopen(name_buff)))
|
|
{
|
|
share= &share_buff;
|
|
bzero((uchar*) &share_buff,sizeof(share_buff));
|
|
share_buff.state.rec_per_key_part=rec_per_key_part;
|
|
share_buff.state.key_root=key_root;
|
|
share_buff.pagecache= multi_pagecache_search((uchar*) name_buff,
|
|
strlen(name_buff),
|
|
maria_pagecache);
|
|
|
|
DBUG_EXECUTE_IF("maria_pretend_crashed_table_on_open",
|
|
if (strstr(name, "/t1"))
|
|
{
|
|
my_errno= HA_ERR_CRASHED;
|
|
goto err;
|
|
});
|
|
if ((kfile=my_open(name_buff,(open_mode=O_RDWR) | O_SHARE,MYF(0))) < 0)
|
|
{
|
|
if ((errno != EROFS && errno != EACCES) ||
|
|
mode != O_RDONLY ||
|
|
(kfile=my_open(name_buff,(open_mode=O_RDONLY) | O_SHARE,MYF(0))) < 0)
|
|
goto err;
|
|
}
|
|
share->mode=open_mode;
|
|
errpos= 1;
|
|
if (my_read(kfile,share->state.header.file_version, head_length,
|
|
MYF(MY_NABP)))
|
|
{
|
|
my_errno= HA_ERR_NOT_A_TABLE;
|
|
goto err;
|
|
}
|
|
if (memcmp((uchar*) share->state.header.file_version,
|
|
(uchar*) maria_file_magic, 4))
|
|
{
|
|
DBUG_PRINT("error",("Wrong header in %s",name_buff));
|
|
DBUG_DUMP("error_dump",(char*) share->state.header.file_version,
|
|
head_length);
|
|
my_errno=HA_ERR_NOT_A_TABLE;
|
|
goto err;
|
|
}
|
|
share->options= mi_uint2korr(share->state.header.options);
|
|
if (share->options &
|
|
~(HA_OPTION_PACK_RECORD | HA_OPTION_PACK_KEYS |
|
|
HA_OPTION_COMPRESS_RECORD | HA_OPTION_READ_ONLY_DATA |
|
|
HA_OPTION_TEMP_COMPRESS_RECORD | HA_OPTION_CHECKSUM |
|
|
HA_OPTION_TMP_TABLE | HA_OPTION_DELAY_KEY_WRITE |
|
|
HA_OPTION_RELIES_ON_SQL_LAYER | HA_OPTION_NULL_FIELDS))
|
|
{
|
|
DBUG_PRINT("error",("wrong options: 0x%lx", share->options));
|
|
my_errno=HA_ERR_OLD_FILE;
|
|
goto err;
|
|
}
|
|
if ((share->options & HA_OPTION_RELIES_ON_SQL_LAYER) &&
|
|
! (open_flags & HA_OPEN_FROM_SQL_LAYER))
|
|
{
|
|
DBUG_PRINT("error", ("table cannot be openned from non-sql layer"));
|
|
my_errno= HA_ERR_UNSUPPORTED;
|
|
goto err;
|
|
}
|
|
/* Don't call realpath() if the name can't be a link */
|
|
if (!strcmp(name_buff, org_name) ||
|
|
my_readlink(index_name, org_name, MYF(0)) == -1)
|
|
(void) strmov(index_name, org_name);
|
|
*strrchr(org_name, '.')= '\0';
|
|
(void) fn_format(data_name,org_name,"",MARIA_NAME_DEXT,
|
|
MY_APPEND_EXT|MY_UNPACK_FILENAME|MY_RESOLVE_SYMLINKS);
|
|
|
|
info_length=mi_uint2korr(share->state.header.header_length);
|
|
base_pos= mi_uint2korr(share->state.header.base_pos);
|
|
if (!(disk_cache= (uchar*) my_alloca(info_length+128)))
|
|
{
|
|
my_errno=ENOMEM;
|
|
goto err;
|
|
}
|
|
end_pos=disk_cache+info_length;
|
|
errpos= 2;
|
|
|
|
VOID(my_seek(kfile,0L,MY_SEEK_SET,MYF(0)));
|
|
errpos= 3;
|
|
if (my_read(kfile,disk_cache,info_length,MYF(MY_NABP)))
|
|
{
|
|
my_errno=HA_ERR_CRASHED;
|
|
goto err;
|
|
}
|
|
len=mi_uint2korr(share->state.header.state_info_length);
|
|
keys= (uint) share->state.header.keys;
|
|
uniques= (uint) share->state.header.uniques;
|
|
fulltext_keys= (uint) share->state.header.fulltext_keys;
|
|
key_parts= mi_uint2korr(share->state.header.key_parts);
|
|
unique_key_parts= mi_uint2korr(share->state.header.unique_key_parts);
|
|
if (len != MARIA_STATE_INFO_SIZE)
|
|
{
|
|
DBUG_PRINT("warning",
|
|
("saved_state_info_length: %d state_info_length: %d",
|
|
len,MARIA_STATE_INFO_SIZE));
|
|
}
|
|
share->state_diff_length=len-MARIA_STATE_INFO_SIZE;
|
|
|
|
_ma_state_info_read(disk_cache, &share->state);
|
|
len= mi_uint2korr(share->state.header.base_info_length);
|
|
if (len != MARIA_BASE_INFO_SIZE)
|
|
{
|
|
DBUG_PRINT("warning",("saved_base_info_length: %d base_info_length: %d",
|
|
len,MARIA_BASE_INFO_SIZE));
|
|
}
|
|
disk_pos= _ma_base_info_read(disk_cache + base_pos, &share->base);
|
|
share->state.state_length=base_pos;
|
|
|
|
if (!(open_flags & HA_OPEN_FOR_REPAIR) &&
|
|
((share->state.changed & STATE_CRASHED) ||
|
|
((open_flags & HA_OPEN_ABORT_IF_CRASHED) &&
|
|
(my_disable_locking && share->state.open_count))))
|
|
{
|
|
DBUG_PRINT("error",("Table is marked as crashed. open_flags: %u "
|
|
"changed: %u open_count: %u !locking: %d",
|
|
open_flags, share->state.changed,
|
|
share->state.open_count, my_disable_locking));
|
|
my_errno=((share->state.changed & STATE_CRASHED_ON_REPAIR) ?
|
|
HA_ERR_CRASHED_ON_REPAIR : HA_ERR_CRASHED_ON_USAGE);
|
|
goto err;
|
|
}
|
|
|
|
/* sanity check */
|
|
if (share->base.keystart > 65535 || share->base.rec_reflength > 8)
|
|
{
|
|
my_errno=HA_ERR_CRASHED;
|
|
goto err;
|
|
}
|
|
|
|
key_parts+=fulltext_keys*FT_SEGS;
|
|
if (share->base.max_key_length > maria_max_key_length() ||
|
|
keys > MARIA_MAX_KEY || key_parts > MARIA_MAX_KEY * HA_MAX_KEY_SEG)
|
|
{
|
|
DBUG_PRINT("error",("Wrong key info: Max_key_length: %d keys: %d key_parts: %d", share->base.max_key_length, keys, key_parts));
|
|
my_errno=HA_ERR_UNSUPPORTED;
|
|
goto err;
|
|
}
|
|
/*
|
|
If page cache is not initialized, then assume we will create it
|
|
after the table is opened!
|
|
*/
|
|
if (share->base.block_size != maria_block_size &&
|
|
share_buff.pagecache->inited != 0)
|
|
{
|
|
DBUG_PRINT("error", ("Wrong block size %u; Expected %u",
|
|
(uint) share->base.block_size,
|
|
(uint) maria_block_size));
|
|
my_errno=HA_ERR_UNSUPPORTED;
|
|
goto err;
|
|
}
|
|
|
|
/* Correct max_file_length based on length of sizeof(off_t) */
|
|
max_data_file_length=
|
|
(share->options & (HA_OPTION_PACK_RECORD | HA_OPTION_COMPRESS_RECORD)) ?
|
|
(((ulonglong) 1 << (share->base.rec_reflength*8))-1) :
|
|
(_ma_safe_mul(share->base.pack_reclength,
|
|
(ulonglong) 1 << (share->base.rec_reflength*8))-1);
|
|
|
|
max_key_file_length=
|
|
_ma_safe_mul(MARIA_MIN_KEY_BLOCK_LENGTH,
|
|
((ulonglong) 1 << (share->base.key_reflength*8))-1);
|
|
#if SIZEOF_OFF_T == 4
|
|
set_if_smaller(max_data_file_length, INT_MAX32);
|
|
set_if_smaller(max_key_file_length, INT_MAX32);
|
|
#endif
|
|
share->base.max_data_file_length=(my_off_t) max_data_file_length;
|
|
share->base.max_key_file_length=(my_off_t) max_key_file_length;
|
|
|
|
if (share->options & HA_OPTION_COMPRESS_RECORD)
|
|
share->base.max_key_length+=2; /* For safety */
|
|
|
|
if (!my_multi_malloc(MY_WME,
|
|
&share,sizeof(*share),
|
|
&share->state.rec_per_key_part,sizeof(long)*key_parts,
|
|
&share->keyinfo,keys*sizeof(MARIA_KEYDEF),
|
|
&share->uniqueinfo,uniques*sizeof(MARIA_UNIQUEDEF),
|
|
&share->keyparts,
|
|
(key_parts+unique_key_parts+keys+uniques) *
|
|
sizeof(HA_KEYSEG),
|
|
&share->columndef,
|
|
(share->base.fields+1)*sizeof(MARIA_COLUMNDEF),
|
|
&share->blobs,sizeof(MARIA_BLOB)*share->base.blobs,
|
|
&share->unique_file_name,strlen(name_buff)+1,
|
|
&share->index_file_name,strlen(index_name)+1,
|
|
&share->data_file_name,strlen(data_name)+1,
|
|
&share->open_file_name,strlen(name)+1,
|
|
&share->state.key_root,keys*sizeof(my_off_t),
|
|
#ifdef THREAD
|
|
&share->key_root_lock,sizeof(rw_lock_t)*keys,
|
|
#endif
|
|
&share->mmap_lock,sizeof(rw_lock_t),
|
|
NullS))
|
|
goto err;
|
|
errpos= 4;
|
|
|
|
*share=share_buff;
|
|
memcpy((char*) share->state.rec_per_key_part,
|
|
(char*) rec_per_key_part, sizeof(long)*key_parts);
|
|
memcpy((char*) share->state.key_root,
|
|
(char*) key_root, sizeof(my_off_t)*keys);
|
|
strmov(share->unique_file_name, name_buff);
|
|
share->unique_name_length= strlen(name_buff);
|
|
strmov(share->index_file_name, index_name);
|
|
strmov(share->data_file_name, data_name);
|
|
strmov(share->open_file_name, name);
|
|
|
|
share->block_size= share->base.block_size;
|
|
{
|
|
HA_KEYSEG *pos=share->keyparts;
|
|
for (i=0 ; i < keys ; i++)
|
|
{
|
|
share->keyinfo[i].share= share;
|
|
disk_pos=_ma_keydef_read(disk_pos, &share->keyinfo[i]);
|
|
disk_pos_assert(disk_pos + share->keyinfo[i].keysegs * HA_KEYSEG_SIZE,
|
|
end_pos);
|
|
if (share->keyinfo[i].key_alg == HA_KEY_ALG_RTREE)
|
|
share->have_rtree= 1;
|
|
share->keyinfo[i].seg=pos;
|
|
for (j=0 ; j < share->keyinfo[i].keysegs; j++,pos++)
|
|
{
|
|
disk_pos=_ma_keyseg_read(disk_pos, pos);
|
|
if (pos->type == HA_KEYTYPE_TEXT ||
|
|
pos->type == HA_KEYTYPE_VARTEXT1 ||
|
|
pos->type == HA_KEYTYPE_VARTEXT2)
|
|
{
|
|
if (!pos->language)
|
|
pos->charset=default_charset_info;
|
|
else if (!(pos->charset= get_charset(pos->language, MYF(MY_WME))))
|
|
{
|
|
my_errno=HA_ERR_UNKNOWN_CHARSET;
|
|
goto err;
|
|
}
|
|
}
|
|
else if (pos->type == HA_KEYTYPE_BINARY)
|
|
pos->charset= &my_charset_bin;
|
|
}
|
|
if (share->keyinfo[i].flag & HA_SPATIAL)
|
|
{
|
|
#ifdef HAVE_SPATIAL
|
|
uint sp_segs=SPDIMS*2;
|
|
share->keyinfo[i].seg=pos-sp_segs;
|
|
share->keyinfo[i].keysegs--;
|
|
#else
|
|
my_errno=HA_ERR_UNSUPPORTED;
|
|
goto err;
|
|
#endif
|
|
}
|
|
else if (share->keyinfo[i].flag & HA_FULLTEXT)
|
|
{
|
|
if (!fulltext_keys)
|
|
{ /* 4.0 compatibility code, to be removed in 5.0 */
|
|
share->keyinfo[i].seg=pos-FT_SEGS;
|
|
share->keyinfo[i].keysegs-=FT_SEGS;
|
|
}
|
|
else
|
|
{
|
|
uint k;
|
|
share->keyinfo[i].seg=pos;
|
|
for (k=0; k < FT_SEGS; k++)
|
|
{
|
|
*pos= ft_keysegs[k];
|
|
pos[0].language= pos[-1].language;
|
|
if (!(pos[0].charset= pos[-1].charset))
|
|
{
|
|
my_errno=HA_ERR_CRASHED;
|
|
goto err;
|
|
}
|
|
pos++;
|
|
}
|
|
}
|
|
if (!share->ft2_keyinfo.seg)
|
|
{
|
|
memcpy(& share->ft2_keyinfo, & share->keyinfo[i], sizeof(MARIA_KEYDEF));
|
|
share->ft2_keyinfo.keysegs=1;
|
|
share->ft2_keyinfo.flag=0;
|
|
share->ft2_keyinfo.keylength=
|
|
share->ft2_keyinfo.minlength=
|
|
share->ft2_keyinfo.maxlength=HA_FT_WLEN+share->base.rec_reflength;
|
|
share->ft2_keyinfo.seg=pos-1;
|
|
share->ft2_keyinfo.end=pos;
|
|
setup_key_functions(& share->ft2_keyinfo);
|
|
}
|
|
}
|
|
setup_key_functions(share->keyinfo+i);
|
|
share->keyinfo[i].end=pos;
|
|
pos->type=HA_KEYTYPE_END; /* End */
|
|
pos->length=share->base.rec_reflength;
|
|
pos->null_bit=0;
|
|
pos->flag=0; /* For purify */
|
|
pos++;
|
|
}
|
|
for (i=0 ; i < uniques ; i++)
|
|
{
|
|
disk_pos=_ma_uniquedef_read(disk_pos, &share->uniqueinfo[i]);
|
|
disk_pos_assert(disk_pos + share->uniqueinfo[i].keysegs *
|
|
HA_KEYSEG_SIZE, end_pos);
|
|
share->uniqueinfo[i].seg=pos;
|
|
for (j=0 ; j < share->uniqueinfo[i].keysegs; j++,pos++)
|
|
{
|
|
disk_pos=_ma_keyseg_read(disk_pos, pos);
|
|
if (pos->type == HA_KEYTYPE_TEXT ||
|
|
pos->type == HA_KEYTYPE_VARTEXT1 ||
|
|
pos->type == HA_KEYTYPE_VARTEXT2)
|
|
{
|
|
if (!pos->language)
|
|
pos->charset=default_charset_info;
|
|
else if (!(pos->charset= get_charset(pos->language, MYF(MY_WME))))
|
|
{
|
|
my_errno=HA_ERR_UNKNOWN_CHARSET;
|
|
goto err;
|
|
}
|
|
}
|
|
}
|
|
share->uniqueinfo[i].end=pos;
|
|
pos->type=HA_KEYTYPE_END; /* End */
|
|
pos->null_bit=0;
|
|
pos->flag=0;
|
|
pos++;
|
|
}
|
|
share->ftparsers= 0;
|
|
}
|
|
share->data_file_type= share->state.header.data_file_type;
|
|
share->base_length= (BASE_ROW_HEADER_SIZE +
|
|
share->base.is_nulls_extended +
|
|
share->base.null_bytes +
|
|
share->base.pack_bytes +
|
|
test(share->options & HA_OPTION_CHECKSUM));
|
|
if (open_flags & HA_OPEN_COPY)
|
|
{
|
|
/*
|
|
this instance will be a temporary one used just to create a data
|
|
file for REPAIR. Don't do logging. This base information will not go
|
|
to disk.
|
|
*/
|
|
share->base.born_transactional= FALSE;
|
|
}
|
|
if (share->base.born_transactional)
|
|
{
|
|
share->page_type= PAGECACHE_LSN_PAGE;
|
|
#ifdef ENABLE_WHEN_WE_HAVE_TRANS_ROW_ID /* QQ */
|
|
share->base_length+= TRANS_ROW_EXTRA_HEADER_SIZE;
|
|
#endif
|
|
if (share->state.create_rename_lsn == LSN_REPAIRED_BY_MARIA_CHK)
|
|
{
|
|
/*
|
|
Was repaired with maria_chk, maybe later maria_pack-ed. Some sort of
|
|
import into the server. It starts its existence (from the point of
|
|
view of the server, including server's recovery) now.
|
|
*/
|
|
if ((open_flags & HA_OPEN_FROM_SQL_LAYER) || maria_in_recovery)
|
|
_ma_update_create_rename_lsn_sub(share, translog_get_horizon(),
|
|
TRUE);
|
|
}
|
|
else if ((!LSN_VALID(share->state.create_rename_lsn) ||
|
|
!LSN_VALID(share->state.is_of_horizon) ||
|
|
(cmp_translog_addr(share->state.create_rename_lsn,
|
|
share->state.is_of_horizon) > 0)) &&
|
|
!(open_flags & HA_OPEN_FOR_REPAIR))
|
|
{
|
|
/*
|
|
If in Recovery, it will not work. If LSN is invalid and not
|
|
LSN_REPAIRED_BY_MARIA_CHK, header must be corrupted.
|
|
In both cases, must repair.
|
|
*/
|
|
my_errno=((share->state.changed & STATE_CRASHED_ON_REPAIR) ?
|
|
HA_ERR_CRASHED_ON_REPAIR : HA_ERR_CRASHED_ON_USAGE);
|
|
goto err;
|
|
}
|
|
}
|
|
else
|
|
share->page_type= PAGECACHE_PLAIN_PAGE;
|
|
share->now_transactional= share->base.born_transactional;
|
|
|
|
share->base.default_rec_buff_size= max(share->base.pack_reclength,
|
|
share->base.max_key_length);
|
|
if (share->data_file_type == DYNAMIC_RECORD)
|
|
{
|
|
share->base.extra_rec_buff_size=
|
|
(ALIGN_SIZE(MARIA_MAX_DYN_BLOCK_HEADER) + MARIA_SPLIT_LENGTH +
|
|
MARIA_REC_BUFF_OFFSET);
|
|
share->base.default_rec_buff_size+= share->base.extra_rec_buff_size;
|
|
}
|
|
disk_pos_assert(disk_pos + share->base.fields *MARIA_COLUMNDEF_SIZE,
|
|
end_pos);
|
|
for (i= j= 0 ; i < share->base.fields ; i++)
|
|
{
|
|
disk_pos=_ma_columndef_read(disk_pos,&share->columndef[i]);
|
|
share->columndef[i].pack_type=0;
|
|
share->columndef[i].huff_tree=0;
|
|
if (share->columndef[i].type == (int) FIELD_BLOB)
|
|
{
|
|
share->blobs[j].pack_length=
|
|
share->columndef[i].length-portable_sizeof_char_ptr;;
|
|
share->blobs[j].offset= share->columndef[i].offset;
|
|
j++;
|
|
}
|
|
}
|
|
share->columndef[i].type=(int) FIELD_LAST; /* End marker */
|
|
|
|
if ((share->data_file_type == BLOCK_RECORD ||
|
|
share->data_file_type == COMPRESSED_RECORD))
|
|
{
|
|
if (_ma_open_datafile(&info, share, -1))
|
|
goto err;
|
|
data_file= info.dfile.file;
|
|
}
|
|
errpos= 5;
|
|
|
|
share->kfile.file= kfile;
|
|
share->this_process=(ulong) getpid();
|
|
share->last_process= share->state.process;
|
|
share->base.key_parts=key_parts;
|
|
share->base.all_key_parts=key_parts+unique_key_parts;
|
|
if (!(share->last_version=share->state.version))
|
|
share->last_version=1; /* Safety */
|
|
share->rec_reflength=share->base.rec_reflength; /* May be changed */
|
|
share->base.margin_key_file_length=(share->base.max_key_file_length -
|
|
(keys ? MARIA_INDEX_BLOCK_MARGIN *
|
|
share->block_size * keys : 0));
|
|
share->block_size= share->base.block_size;
|
|
my_afree(disk_cache);
|
|
_ma_setup_functions(share);
|
|
if ((*share->once_init)(share, info.dfile.file))
|
|
goto err;
|
|
share->is_log_table= FALSE;
|
|
if (open_flags & HA_OPEN_TMP_TABLE)
|
|
share->options|= HA_OPTION_TMP_TABLE;
|
|
if (open_flags & HA_OPEN_DELAY_KEY_WRITE)
|
|
share->options|= HA_OPTION_DELAY_KEY_WRITE;
|
|
if (mode == O_RDONLY)
|
|
share->options|= HA_OPTION_READ_ONLY_DATA;
|
|
|
|
#ifdef THREAD
|
|
thr_lock_init(&share->lock);
|
|
VOID(pthread_mutex_init(&share->intern_lock,MY_MUTEX_INIT_FAST));
|
|
for (i=0; i<keys; i++)
|
|
VOID(my_rwlock_init(&share->key_root_lock[i], NULL));
|
|
VOID(my_rwlock_init(&share->mmap_lock, NULL));
|
|
if (!thr_lock_inited)
|
|
{
|
|
/* Probably a single threaded program; Don't use concurrent inserts */
|
|
maria_concurrent_insert=0;
|
|
}
|
|
else if (maria_concurrent_insert)
|
|
{
|
|
share->concurrent_insert=
|
|
((share->options & (HA_OPTION_READ_ONLY_DATA | HA_OPTION_TMP_TABLE |
|
|
HA_OPTION_COMPRESS_RECORD |
|
|
HA_OPTION_TEMP_COMPRESS_RECORD)) ||
|
|
(open_flags & HA_OPEN_TMP_TABLE) ||
|
|
share->data_file_type == BLOCK_RECORD ||
|
|
share->have_rtree) ? 0 : 1;
|
|
if (share->concurrent_insert)
|
|
{
|
|
share->lock.get_status=_ma_get_status;
|
|
share->lock.copy_status=_ma_copy_status;
|
|
/**
|
|
@todo RECOVERY
|
|
INSERT DELAYED and concurrent inserts are currently disabled for
|
|
transactional tables; when enabled again, we should re-evaluate
|
|
what problems the call to _ma_update_status() by
|
|
thr_reschedule_write_lock() can do (it may hurt Checkpoint as it
|
|
would be without intern_lock, and it modifies the state).
|
|
*/
|
|
share->lock.update_status=_ma_update_status;
|
|
share->lock.restore_status=_ma_restore_status;
|
|
share->lock.check_status=_ma_check_status;
|
|
}
|
|
}
|
|
#endif
|
|
/*
|
|
Memory mapping can only be requested after initializing intern_lock.
|
|
*/
|
|
if (open_flags & HA_OPEN_MMAP)
|
|
{
|
|
info.s= share;
|
|
maria_extra(&info, HA_EXTRA_MMAP, 0);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
share= old_info->s;
|
|
if (share->data_file_type == BLOCK_RECORD)
|
|
data_file= share->bitmap.file.file; /* Only opened once */
|
|
}
|
|
|
|
if (!(m_info= maria_clone_internal(share, mode, data_file)))
|
|
goto err;
|
|
pthread_mutex_unlock(&THR_LOCK_maria);
|
|
DBUG_RETURN(m_info);
|
|
|
|
err:
|
|
save_errno=my_errno ? my_errno : HA_ERR_END_OF_FILE;
|
|
if ((save_errno == HA_ERR_CRASHED) ||
|
|
(save_errno == HA_ERR_CRASHED_ON_USAGE) ||
|
|
(save_errno == HA_ERR_CRASHED_ON_REPAIR))
|
|
_ma_report_error(save_errno, name);
|
|
switch (errpos) {
|
|
case 5:
|
|
if (data_file >= 0)
|
|
VOID(my_close(data_file, MYF(0)));
|
|
if (old_info)
|
|
break; /* Don't remove open table */
|
|
(*share->once_end)(share);
|
|
/* fall through */
|
|
case 4:
|
|
my_free((uchar*) share,MYF(0));
|
|
/* fall through */
|
|
case 3:
|
|
/* fall through */
|
|
case 2:
|
|
my_afree((uchar*) disk_cache);
|
|
/* fall through */
|
|
case 1:
|
|
VOID(my_close(kfile,MYF(0)));
|
|
/* fall through */
|
|
case 0:
|
|
default:
|
|
break;
|
|
}
|
|
pthread_mutex_unlock(&THR_LOCK_maria);
|
|
my_errno= save_errno;
|
|
DBUG_RETURN (NULL);
|
|
} /* maria_open */
|
|
|
|
|
|
/*
|
|
Reallocate a buffer, if the current buffer is not large enough
|
|
*/
|
|
|
|
my_bool _ma_alloc_buffer(uchar **old_addr, size_t *old_size,
|
|
size_t new_size)
|
|
{
|
|
if (*old_size < new_size)
|
|
{
|
|
uchar *addr;
|
|
if (!(addr= (uchar*) my_realloc((uchar*) *old_addr, new_size,
|
|
MYF(MY_ALLOW_ZERO_PTR))))
|
|
return 1;
|
|
*old_addr= addr;
|
|
*old_size= new_size;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
ulonglong _ma_safe_mul(ulonglong a, ulonglong b)
|
|
{
|
|
ulonglong max_val= ~ (ulonglong) 0; /* my_off_t is unsigned */
|
|
|
|
if (!a || max_val / a < b)
|
|
return max_val;
|
|
return a*b;
|
|
}
|
|
|
|
/* Set up functions in structs */
|
|
|
|
void _ma_setup_functions(register MARIA_SHARE *share)
|
|
{
|
|
share->once_init= maria_once_init_dummy;
|
|
share->once_end= maria_once_end_dummy;
|
|
share->init= maria_scan_init_dummy;
|
|
share->end= maria_scan_end_dummy;
|
|
share->scan_init= maria_scan_init_dummy;/* Compat. dummy function */
|
|
share->scan_end= maria_scan_end_dummy;/* Compat. dummy function */
|
|
share->write_record_init= _ma_write_init_default;
|
|
share->write_record_abort= _ma_write_abort_default;
|
|
|
|
switch (share->data_file_type) {
|
|
case COMPRESSED_RECORD:
|
|
share->read_record= _ma_read_pack_record;
|
|
share->scan= _ma_read_rnd_pack_record;
|
|
share->once_init= _ma_once_init_pack_row;
|
|
share->once_end= _ma_once_end_pack_row;
|
|
/*
|
|
Calculate checksum according to data in the original, not compressed,
|
|
row.
|
|
*/
|
|
if (share->state.header.org_data_file_type == STATIC_RECORD &&
|
|
! (share->options & HA_OPTION_NULL_FIELDS))
|
|
share->calc_checksum= _ma_static_checksum;
|
|
else
|
|
share->calc_checksum= _ma_checksum;
|
|
share->calc_write_checksum= share->calc_checksum;
|
|
break;
|
|
case DYNAMIC_RECORD:
|
|
share->read_record= _ma_read_dynamic_record;
|
|
share->scan= _ma_read_rnd_dynamic_record;
|
|
share->delete_record= _ma_delete_dynamic_record;
|
|
share->compare_record= _ma_cmp_dynamic_record;
|
|
share->compare_unique= _ma_cmp_dynamic_unique;
|
|
share->calc_checksum= share->calc_write_checksum= _ma_checksum;
|
|
/* add bits used to pack data to pack_reclength for faster allocation */
|
|
share->base.pack_reclength+= share->base.pack_bytes;
|
|
if (share->base.blobs)
|
|
{
|
|
share->update_record= _ma_update_blob_record;
|
|
share->write_record= _ma_write_blob_record;
|
|
}
|
|
else
|
|
{
|
|
share->write_record= _ma_write_dynamic_record;
|
|
share->update_record= _ma_update_dynamic_record;
|
|
}
|
|
break;
|
|
case STATIC_RECORD:
|
|
share->read_record= _ma_read_static_record;
|
|
share->scan= _ma_read_rnd_static_record;
|
|
share->delete_record= _ma_delete_static_record;
|
|
share->compare_record= _ma_cmp_static_record;
|
|
share->update_record= _ma_update_static_record;
|
|
share->write_record= _ma_write_static_record;
|
|
share->compare_unique= _ma_cmp_static_unique;
|
|
if (share->state.header.org_data_file_type == STATIC_RECORD &&
|
|
! (share->options & HA_OPTION_NULL_FIELDS))
|
|
share->calc_checksum= _ma_static_checksum;
|
|
else
|
|
share->calc_checksum= _ma_checksum;
|
|
break;
|
|
case BLOCK_RECORD:
|
|
share->once_init= _ma_once_init_block_record;
|
|
share->once_end= _ma_once_end_block_record;
|
|
share->init= _ma_init_block_record;
|
|
share->end= _ma_end_block_record;
|
|
share->write_record_init= _ma_write_init_block_record;
|
|
share->write_record_abort= _ma_write_abort_block_record;
|
|
share->scan_init= _ma_scan_init_block_record;
|
|
share->scan_end= _ma_scan_end_block_record;
|
|
share->read_record= _ma_read_block_record;
|
|
share->scan= _ma_scan_block_record;
|
|
share->delete_record= _ma_delete_block_record;
|
|
share->compare_record= _ma_compare_block_record;
|
|
share->update_record= _ma_update_block_record;
|
|
share->write_record= _ma_write_block_record;
|
|
share->compare_unique= _ma_cmp_block_unique;
|
|
share->calc_checksum= _ma_checksum;
|
|
/*
|
|
write_block_record() will calculate the checksum; Tell maria_write()
|
|
that it doesn't have to do this.
|
|
*/
|
|
share->calc_write_checksum= 0;
|
|
break;
|
|
}
|
|
share->file_read= _ma_nommap_pread;
|
|
share->file_write= _ma_nommap_pwrite;
|
|
share->calc_check_checksum= share->calc_checksum;
|
|
|
|
if (!(share->options & HA_OPTION_CHECKSUM) &&
|
|
share->data_file_type != COMPRESSED_RECORD)
|
|
share->calc_checksum= share->calc_write_checksum= 0;
|
|
return;
|
|
}
|
|
|
|
|
|
static void setup_key_functions(register MARIA_KEYDEF *keyinfo)
|
|
{
|
|
if (keyinfo->key_alg == HA_KEY_ALG_RTREE)
|
|
{
|
|
#ifdef HAVE_RTREE_KEYS
|
|
keyinfo->ck_insert = maria_rtree_insert;
|
|
keyinfo->ck_delete = maria_rtree_delete;
|
|
#else
|
|
DBUG_ASSERT(0); /* maria_open should check it never happens */
|
|
#endif
|
|
}
|
|
else
|
|
{
|
|
keyinfo->ck_insert = _ma_ck_write;
|
|
keyinfo->ck_delete = _ma_ck_delete;
|
|
}
|
|
if (keyinfo->flag & HA_BINARY_PACK_KEY)
|
|
{ /* Simple prefix compression */
|
|
keyinfo->bin_search= _ma_seq_search;
|
|
keyinfo->get_key= _ma_get_binary_pack_key;
|
|
keyinfo->pack_key= _ma_calc_bin_pack_key_length;
|
|
keyinfo->store_key= _ma_store_bin_pack_key;
|
|
}
|
|
else if (keyinfo->flag & HA_VAR_LENGTH_KEY)
|
|
{
|
|
keyinfo->get_key= _ma_get_pack_key;
|
|
if (keyinfo->seg[0].flag & HA_PACK_KEY)
|
|
{ /* Prefix compression */
|
|
if (!keyinfo->seg->charset || use_strnxfrm(keyinfo->seg->charset) ||
|
|
(keyinfo->seg->flag & HA_NULL_PART))
|
|
keyinfo->bin_search= _ma_seq_search;
|
|
else
|
|
keyinfo->bin_search= _ma_prefix_search;
|
|
keyinfo->pack_key= _ma_calc_var_pack_key_length;
|
|
keyinfo->store_key= _ma_store_var_pack_key;
|
|
}
|
|
else
|
|
{
|
|
keyinfo->bin_search= _ma_seq_search;
|
|
keyinfo->pack_key= _ma_calc_var_key_length; /* Variable length key */
|
|
keyinfo->store_key= _ma_store_static_key;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
keyinfo->bin_search= _ma_bin_search;
|
|
keyinfo->get_key= _ma_get_static_key;
|
|
keyinfo->pack_key= _ma_calc_static_key_length;
|
|
keyinfo->store_key= _ma_store_static_key;
|
|
}
|
|
return;
|
|
}
|
|
|
|
|
|
/**
|
|
@brief Function to save and store the header in the index file (.MYI)
|
|
|
|
Operates under MARIA_SHARE::intern_lock if requested.
|
|
Sets MARIA_SHARE::MARIA_STATE_INFO::is_of_horizon if transactional table.
|
|
Then calls _ma_state_info_write_sub().
|
|
|
|
@param share table
|
|
@param pWrite bitmap: if 1 is set my_pwrite() is used otherwise
|
|
my_write(); if 2 is set, info about keys is written
|
|
(should only be needed after ALTER TABLE
|
|
ENABLE/DISABLE KEYS, and REPAIR/OPTIMIZE); if 4 is
|
|
set, MARIA_SHARE::intern_lock is taken.
|
|
|
|
@return Operation status
|
|
@retval 0 OK
|
|
@retval 1 Error
|
|
*/
|
|
|
|
uint _ma_state_info_write(MARIA_SHARE *share, uint pWrite)
|
|
{
|
|
uint res;
|
|
if (pWrite & 4)
|
|
pthread_mutex_lock(&share->intern_lock);
|
|
else if (maria_multi_threaded)
|
|
{
|
|
safe_mutex_assert_owner(&share->intern_lock);
|
|
}
|
|
if (share->base.born_transactional && translog_inited &&
|
|
!maria_in_recovery)
|
|
{
|
|
/*
|
|
In a recovery, we want to set is_of_horizon to the LSN of the last
|
|
record executed by Recovery, not the current EOF of the log (which
|
|
is too new). Recovery does it by itself.
|
|
*/
|
|
share->state.is_of_horizon= translog_get_horizon();
|
|
DBUG_PRINT("info", ("is_of_horizon set to LSN (%lu,0x%lx)",
|
|
LSN_IN_PARTS(share->state.is_of_horizon)));
|
|
}
|
|
res= _ma_state_info_write_sub(share->kfile.file, &share->state, pWrite);
|
|
if (pWrite & 4)
|
|
pthread_mutex_unlock(&share->intern_lock);
|
|
return res;
|
|
}
|
|
|
|
|
|
/**
|
|
@brief Function to save and store the header in the index file (.MYI).
|
|
|
|
Shortcut to use instead of _ma_state_info_write() when appropriate.
|
|
|
|
@param file descriptor of the index file to write
|
|
@param state state information to write to the file
|
|
@param pWrite bitmap: if 1 is set my_pwrite() is used otherwise
|
|
my_write(); if 2 is set, info about keys is written
|
|
(should only be needed after ALTER TABLE
|
|
ENABLE/DISABLE KEYS, and REPAIR/OPTIMIZE).
|
|
|
|
@return Operation status
|
|
@retval 0 OK
|
|
@retval 1 Error
|
|
*/
|
|
|
|
uint _ma_state_info_write_sub(File file, MARIA_STATE_INFO *state, uint pWrite)
|
|
{
|
|
/** @todo RECOVERY write it only at checkpoint time */
|
|
uchar buff[MARIA_STATE_INFO_SIZE + MARIA_STATE_EXTRA_SIZE];
|
|
uchar *ptr=buff;
|
|
uint i, keys= (uint) state->header.keys;
|
|
size_t res;
|
|
DBUG_ENTER("_ma_state_info_write");
|
|
|
|
memcpy_fixed(ptr,&state->header,sizeof(state->header));
|
|
ptr+=sizeof(state->header);
|
|
|
|
/* open_count must be first because of _ma_mark_file_changed ! */
|
|
mi_int2store(ptr,state->open_count); ptr+= 2;
|
|
/*
|
|
if you change the offset of create_rename_lsn/is_of_horizon inside the
|
|
index file's header, fix ma_create + ma_rename + ma_delete_all +
|
|
backward-compatibility.
|
|
*/
|
|
lsn_store(ptr, state->create_rename_lsn); ptr+= LSN_STORE_SIZE;
|
|
lsn_store(ptr, state->is_of_horizon); ptr+= LSN_STORE_SIZE;
|
|
*ptr++= (uchar)state->changed;
|
|
*ptr++= state->sortkey;
|
|
mi_rowstore(ptr,state->state.records); ptr+= 8;
|
|
mi_rowstore(ptr,state->state.del); ptr+= 8;
|
|
mi_rowstore(ptr,state->split); ptr+= 8;
|
|
mi_sizestore(ptr,state->dellink); ptr+= 8;
|
|
mi_sizestore(ptr,state->first_bitmap_with_space); ptr+= 8;
|
|
mi_sizestore(ptr,state->state.key_file_length); ptr+= 8;
|
|
mi_sizestore(ptr,state->state.data_file_length); ptr+= 8;
|
|
mi_sizestore(ptr,state->state.empty); ptr+= 8;
|
|
mi_sizestore(ptr,state->state.key_empty); ptr+= 8;
|
|
mi_int8store(ptr,state->auto_increment); ptr+= 8;
|
|
mi_int8store(ptr,(ulonglong) state->state.checksum); ptr+= 8;
|
|
mi_int4store(ptr,state->process); ptr+= 4;
|
|
mi_int4store(ptr,state->unique); ptr+= 4;
|
|
mi_int4store(ptr,state->status); ptr+= 4;
|
|
mi_int4store(ptr,state->update_count); ptr+= 4;
|
|
|
|
ptr+= state->state_diff_length;
|
|
|
|
for (i=0; i < keys; i++)
|
|
{
|
|
mi_sizestore(ptr,state->key_root[i]); ptr+= 8;
|
|
}
|
|
/** @todo RECOVERY BUG key_del is a problem for recovery */
|
|
mi_sizestore(ptr,state->key_del); ptr+= 8;
|
|
if (pWrite & 2) /* From maria_chk */
|
|
{
|
|
uint key_parts= mi_uint2korr(state->header.key_parts);
|
|
mi_int4store(ptr,state->sec_index_changed); ptr+= 4;
|
|
mi_int4store(ptr,state->sec_index_used); ptr+= 4;
|
|
mi_int4store(ptr,state->version); ptr+= 4;
|
|
mi_int8store(ptr,state->key_map); ptr+= 8;
|
|
mi_int8store(ptr,(ulonglong) state->create_time); ptr+= 8;
|
|
mi_int8store(ptr,(ulonglong) state->recover_time); ptr+= 8;
|
|
mi_int8store(ptr,(ulonglong) state->check_time); ptr+= 8;
|
|
mi_sizestore(ptr,state->rec_per_key_rows); ptr+= 8;
|
|
for (i=0 ; i < key_parts ; i++)
|
|
{
|
|
mi_int4store(ptr,state->rec_per_key_part[i]); ptr+=4;
|
|
}
|
|
}
|
|
|
|
res= (pWrite & 1) ?
|
|
my_pwrite(file, buff, (size_t) (ptr-buff), 0L,
|
|
MYF(MY_NABP | MY_THREADSAFE)) :
|
|
my_write(file, buff, (size_t) (ptr-buff),
|
|
MYF(MY_NABP));
|
|
DBUG_RETURN(res != 0);
|
|
}
|
|
|
|
|
|
static uchar *_ma_state_info_read(uchar *ptr, MARIA_STATE_INFO *state)
|
|
{
|
|
uint i,keys,key_parts;
|
|
memcpy_fixed(&state->header,ptr, sizeof(state->header));
|
|
ptr+= sizeof(state->header);
|
|
keys= (uint) state->header.keys;
|
|
key_parts= mi_uint2korr(state->header.key_parts);
|
|
|
|
state->open_count = mi_uint2korr(ptr); ptr+= 2;
|
|
state->create_rename_lsn= lsn_korr(ptr); ptr+= LSN_STORE_SIZE;
|
|
state->is_of_horizon= lsn_korr(ptr); ptr+= LSN_STORE_SIZE;
|
|
state->changed= (my_bool) *ptr++;
|
|
state->sortkey= (uint) *ptr++;
|
|
state->state.records= mi_rowkorr(ptr); ptr+= 8;
|
|
state->state.del = mi_rowkorr(ptr); ptr+= 8;
|
|
state->split = mi_rowkorr(ptr); ptr+= 8;
|
|
state->dellink= mi_sizekorr(ptr); ptr+= 8;
|
|
state->first_bitmap_with_space= mi_sizekorr(ptr); ptr+= 8;
|
|
state->state.key_file_length = mi_sizekorr(ptr); ptr+= 8;
|
|
state->state.data_file_length= mi_sizekorr(ptr); ptr+= 8;
|
|
state->state.empty = mi_sizekorr(ptr); ptr+= 8;
|
|
state->state.key_empty= mi_sizekorr(ptr); ptr+= 8;
|
|
state->auto_increment=mi_uint8korr(ptr); ptr+= 8;
|
|
state->state.checksum=(ha_checksum) mi_uint8korr(ptr);ptr+= 8;
|
|
state->process= mi_uint4korr(ptr); ptr+= 4;
|
|
state->unique = mi_uint4korr(ptr); ptr+= 4;
|
|
state->status = mi_uint4korr(ptr); ptr+= 4;
|
|
state->update_count=mi_uint4korr(ptr); ptr+= 4;
|
|
|
|
ptr+= state->state_diff_length;
|
|
|
|
for (i=0; i < keys; i++)
|
|
{
|
|
state->key_root[i]= mi_sizekorr(ptr); ptr+= 8;
|
|
}
|
|
state->key_del= mi_sizekorr(ptr); ptr+= 8;
|
|
state->sec_index_changed = mi_uint4korr(ptr); ptr+= 4;
|
|
state->sec_index_used = mi_uint4korr(ptr); ptr+= 4;
|
|
state->version = mi_uint4korr(ptr); ptr+= 4;
|
|
state->key_map = mi_uint8korr(ptr); ptr+= 8;
|
|
state->create_time = (time_t) mi_sizekorr(ptr); ptr+= 8;
|
|
state->recover_time =(time_t) mi_sizekorr(ptr); ptr+= 8;
|
|
state->check_time = (time_t) mi_sizekorr(ptr); ptr+= 8;
|
|
state->rec_per_key_rows=mi_sizekorr(ptr); ptr+= 8;
|
|
for (i=0 ; i < key_parts ; i++)
|
|
{
|
|
state->rec_per_key_part[i]= mi_uint4korr(ptr); ptr+=4;
|
|
}
|
|
return ptr;
|
|
}
|
|
|
|
|
|
/**
|
|
@brief Fills the state by reading its copy on disk.
|
|
|
|
Should not be called for transactional tables, as their state on disk is
|
|
rarely current and so is often misleading for a reader.
|
|
Does nothing in single user mode.
|
|
|
|
@param file file to read from
|
|
@param state state which will be filled
|
|
@param pRead if true, use my_pread(), otherwise my_read()
|
|
*/
|
|
|
|
uint _ma_state_info_read_dsk(File file, MARIA_STATE_INFO *state)
|
|
{
|
|
uchar buff[MARIA_STATE_INFO_SIZE + MARIA_STATE_EXTRA_SIZE];
|
|
|
|
/* trick to detect transactional tables */
|
|
DBUG_ASSERT(state->create_rename_lsn == LSN_IMPOSSIBLE);
|
|
if (!maria_single_user)
|
|
{
|
|
if (my_pread(file, buff, state->state_length, 0L, MYF(MY_NABP)))
|
|
return 1;
|
|
_ma_state_info_read(buff, state);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
/****************************************************************************
|
|
** store and read of MARIA_BASE_INFO
|
|
****************************************************************************/
|
|
|
|
uint _ma_base_info_write(File file, MARIA_BASE_INFO *base)
|
|
{
|
|
uchar buff[MARIA_BASE_INFO_SIZE], *ptr=buff;
|
|
|
|
mi_sizestore(ptr,base->keystart); ptr+= 8;
|
|
mi_sizestore(ptr,base->max_data_file_length); ptr+= 8;
|
|
mi_sizestore(ptr,base->max_key_file_length); ptr+= 8;
|
|
mi_rowstore(ptr,base->records); ptr+= 8;
|
|
mi_rowstore(ptr,base->reloc); ptr+= 8;
|
|
mi_int4store(ptr,base->mean_row_length); ptr+= 4;
|
|
mi_int4store(ptr,base->reclength); ptr+= 4;
|
|
mi_int4store(ptr,base->pack_reclength); ptr+= 4;
|
|
mi_int4store(ptr,base->min_pack_length); ptr+= 4;
|
|
mi_int4store(ptr,base->max_pack_length); ptr+= 4;
|
|
mi_int4store(ptr,base->min_block_length); ptr+= 4;
|
|
mi_int2store(ptr,base->fields); ptr+= 2;
|
|
mi_int2store(ptr,base->fixed_not_null_fields); ptr+= 2;
|
|
mi_int2store(ptr,base->fixed_not_null_fields_length); ptr+= 2;
|
|
mi_int2store(ptr,base->max_field_lengths); ptr+= 2;
|
|
mi_int2store(ptr,base->pack_fields); ptr+= 2;
|
|
mi_int2store(ptr,0); ptr+= 2;
|
|
mi_int2store(ptr,base->null_bytes); ptr+= 2;
|
|
mi_int2store(ptr,base->original_null_bytes); ptr+= 2;
|
|
mi_int2store(ptr,base->field_offsets); ptr+= 2;
|
|
mi_int2store(ptr,base->min_row_length); ptr+= 2;
|
|
mi_int2store(ptr,base->block_size); ptr+= 2;
|
|
*ptr++= base->rec_reflength;
|
|
*ptr++= base->key_reflength;
|
|
*ptr++= base->keys;
|
|
*ptr++= base->auto_key;
|
|
*ptr++= base->born_transactional;
|
|
*ptr++= 0; /* Reserved */
|
|
mi_int2store(ptr,base->pack_bytes); ptr+= 2;
|
|
mi_int2store(ptr,base->blobs); ptr+= 2;
|
|
mi_int2store(ptr,base->max_key_block_length); ptr+= 2;
|
|
mi_int2store(ptr,base->max_key_length); ptr+= 2;
|
|
mi_int2store(ptr,base->extra_alloc_bytes); ptr+= 2;
|
|
*ptr++= base->extra_alloc_procent;
|
|
bzero(ptr,16); ptr+= 16; /* extra */
|
|
DBUG_ASSERT((ptr - buff) == MARIA_BASE_INFO_SIZE);
|
|
return my_write(file, buff, (size_t) (ptr-buff), MYF(MY_NABP)) != 0;
|
|
}
|
|
|
|
|
|
static uchar *_ma_base_info_read(uchar *ptr, MARIA_BASE_INFO *base)
|
|
{
|
|
base->keystart= mi_sizekorr(ptr); ptr+= 8;
|
|
base->max_data_file_length= mi_sizekorr(ptr); ptr+= 8;
|
|
base->max_key_file_length= mi_sizekorr(ptr); ptr+= 8;
|
|
base->records= (ha_rows) mi_sizekorr(ptr); ptr+= 8;
|
|
base->reloc= (ha_rows) mi_sizekorr(ptr); ptr+= 8;
|
|
base->mean_row_length= mi_uint4korr(ptr); ptr+= 4;
|
|
base->reclength= mi_uint4korr(ptr); ptr+= 4;
|
|
base->pack_reclength= mi_uint4korr(ptr); ptr+= 4;
|
|
base->min_pack_length= mi_uint4korr(ptr); ptr+= 4;
|
|
base->max_pack_length= mi_uint4korr(ptr); ptr+= 4;
|
|
base->min_block_length= mi_uint4korr(ptr); ptr+= 4;
|
|
base->fields= mi_uint2korr(ptr); ptr+= 2;
|
|
base->fixed_not_null_fields= mi_uint2korr(ptr); ptr+= 2;
|
|
base->fixed_not_null_fields_length= mi_uint2korr(ptr);ptr+= 2;
|
|
base->max_field_lengths= mi_uint2korr(ptr); ptr+= 2;
|
|
base->pack_fields= mi_uint2korr(ptr); ptr+= 2;
|
|
ptr+= 2;
|
|
base->null_bytes= mi_uint2korr(ptr); ptr+= 2;
|
|
base->original_null_bytes= mi_uint2korr(ptr); ptr+= 2;
|
|
base->field_offsets= mi_uint2korr(ptr); ptr+= 2;
|
|
base->min_row_length= mi_uint2korr(ptr); ptr+= 2;
|
|
base->block_size= mi_uint2korr(ptr); ptr+= 2;
|
|
|
|
base->rec_reflength= *ptr++;
|
|
base->key_reflength= *ptr++;
|
|
base->keys= *ptr++;
|
|
base->auto_key= *ptr++;
|
|
base->born_transactional= *ptr++;
|
|
ptr++;
|
|
base->pack_bytes= mi_uint2korr(ptr); ptr+= 2;
|
|
base->blobs= mi_uint2korr(ptr); ptr+= 2;
|
|
base->max_key_block_length= mi_uint2korr(ptr); ptr+= 2;
|
|
base->max_key_length= mi_uint2korr(ptr); ptr+= 2;
|
|
base->extra_alloc_bytes= mi_uint2korr(ptr); ptr+= 2;
|
|
base->extra_alloc_procent= *ptr++;
|
|
ptr+= 16;
|
|
return ptr;
|
|
}
|
|
|
|
/*--------------------------------------------------------------------------
|
|
maria_keydef
|
|
---------------------------------------------------------------------------*/
|
|
|
|
uint _ma_keydef_write(File file, MARIA_KEYDEF *keydef)
|
|
{
|
|
uchar buff[MARIA_KEYDEF_SIZE];
|
|
uchar *ptr=buff;
|
|
|
|
*ptr++= (uchar) keydef->keysegs;
|
|
*ptr++= keydef->key_alg; /* Rtree or Btree */
|
|
mi_int2store(ptr,keydef->flag); ptr+= 2;
|
|
mi_int2store(ptr,keydef->block_length); ptr+= 2;
|
|
mi_int2store(ptr,keydef->keylength); ptr+= 2;
|
|
mi_int2store(ptr,keydef->minlength); ptr+= 2;
|
|
mi_int2store(ptr,keydef->maxlength); ptr+= 2;
|
|
return my_write(file, buff, (size_t) (ptr-buff), MYF(MY_NABP)) != 0;
|
|
}
|
|
|
|
uchar *_ma_keydef_read(uchar *ptr, MARIA_KEYDEF *keydef)
|
|
{
|
|
keydef->keysegs = (uint) *ptr++;
|
|
keydef->key_alg = *ptr++; /* Rtree or Btree */
|
|
|
|
keydef->flag = mi_uint2korr(ptr); ptr+= 2;
|
|
keydef->block_length = mi_uint2korr(ptr); ptr+= 2;
|
|
keydef->keylength = mi_uint2korr(ptr); ptr+= 2;
|
|
keydef->minlength = mi_uint2korr(ptr); ptr+= 2;
|
|
keydef->maxlength = mi_uint2korr(ptr); ptr+= 2;
|
|
keydef->underflow_block_length=keydef->block_length/3;
|
|
keydef->version = 0; /* Not saved */
|
|
keydef->parser = &ft_default_parser;
|
|
keydef->ftparser_nr = 0;
|
|
return ptr;
|
|
}
|
|
|
|
/***************************************************************************
|
|
** maria_keyseg
|
|
***************************************************************************/
|
|
|
|
int _ma_keyseg_write(File file, const HA_KEYSEG *keyseg)
|
|
{
|
|
uchar buff[HA_KEYSEG_SIZE];
|
|
uchar *ptr=buff;
|
|
ulong pos;
|
|
|
|
*ptr++= keyseg->type;
|
|
*ptr++= keyseg->language;
|
|
*ptr++= keyseg->null_bit;
|
|
*ptr++= keyseg->bit_start;
|
|
*ptr++= keyseg->bit_end;
|
|
*ptr++= keyseg->bit_length;
|
|
mi_int2store(ptr,keyseg->flag); ptr+= 2;
|
|
mi_int2store(ptr,keyseg->length); ptr+= 2;
|
|
mi_int4store(ptr,keyseg->start); ptr+= 4;
|
|
pos= keyseg->null_bit ? keyseg->null_pos : keyseg->bit_pos;
|
|
mi_int4store(ptr, pos);
|
|
ptr+=4;
|
|
|
|
return my_write(file, buff, (size_t) (ptr-buff), MYF(MY_NABP)) != 0;
|
|
}
|
|
|
|
|
|
uchar *_ma_keyseg_read(uchar *ptr, HA_KEYSEG *keyseg)
|
|
{
|
|
keyseg->type = *ptr++;
|
|
keyseg->language = *ptr++;
|
|
keyseg->null_bit = *ptr++;
|
|
keyseg->bit_start = *ptr++;
|
|
keyseg->bit_end = *ptr++;
|
|
keyseg->bit_length = *ptr++;
|
|
keyseg->flag = mi_uint2korr(ptr); ptr+= 2;
|
|
keyseg->length = mi_uint2korr(ptr); ptr+= 2;
|
|
keyseg->start = mi_uint4korr(ptr); ptr+= 4;
|
|
keyseg->null_pos = mi_uint4korr(ptr); ptr+= 4;
|
|
keyseg->charset=0; /* Will be filled in later */
|
|
if (keyseg->null_bit)
|
|
keyseg->bit_pos= (uint16)(keyseg->null_pos + (keyseg->null_bit == 7));
|
|
else
|
|
{
|
|
keyseg->bit_pos= (uint16)keyseg->null_pos;
|
|
keyseg->null_pos= 0;
|
|
}
|
|
return ptr;
|
|
}
|
|
|
|
/*--------------------------------------------------------------------------
|
|
maria_uniquedef
|
|
---------------------------------------------------------------------------*/
|
|
|
|
uint _ma_uniquedef_write(File file, MARIA_UNIQUEDEF *def)
|
|
{
|
|
uchar buff[MARIA_UNIQUEDEF_SIZE];
|
|
uchar *ptr=buff;
|
|
|
|
mi_int2store(ptr,def->keysegs); ptr+=2;
|
|
*ptr++= (uchar) def->key;
|
|
*ptr++ = (uchar) def->null_are_equal;
|
|
|
|
return my_write(file, buff, (size_t) (ptr-buff), MYF(MY_NABP)) != 0;
|
|
}
|
|
|
|
uchar *_ma_uniquedef_read(uchar *ptr, MARIA_UNIQUEDEF *def)
|
|
{
|
|
def->keysegs = mi_uint2korr(ptr);
|
|
def->key = ptr[2];
|
|
def->null_are_equal=ptr[3];
|
|
return ptr+4; /* 1 extra uchar */
|
|
}
|
|
|
|
/***************************************************************************
|
|
** MARIA_COLUMNDEF
|
|
***************************************************************************/
|
|
|
|
uint _ma_columndef_write(File file, MARIA_COLUMNDEF *columndef)
|
|
{
|
|
uchar buff[MARIA_COLUMNDEF_SIZE];
|
|
uchar *ptr=buff;
|
|
|
|
mi_int6store(ptr,columndef->offset); ptr+= 6;
|
|
mi_int2store(ptr,columndef->type); ptr+= 2;
|
|
mi_int2store(ptr,columndef->length); ptr+= 2;
|
|
mi_int2store(ptr,columndef->fill_length); ptr+= 2;
|
|
mi_int2store(ptr,columndef->null_pos); ptr+= 2;
|
|
mi_int2store(ptr,columndef->empty_pos); ptr+= 2;
|
|
(*ptr++)= columndef->null_bit;
|
|
(*ptr++)= columndef->empty_bit;
|
|
return my_write(file, buff, (size_t) (ptr-buff), MYF(MY_NABP)) != 0;
|
|
}
|
|
|
|
uchar *_ma_columndef_read(uchar *ptr, MARIA_COLUMNDEF *columndef)
|
|
{
|
|
columndef->offset= mi_uint6korr(ptr); ptr+= 6;
|
|
columndef->type= mi_sint2korr(ptr); ptr+= 2;
|
|
columndef->length= mi_uint2korr(ptr); ptr+= 2;
|
|
columndef->fill_length= mi_uint2korr(ptr); ptr+= 2;
|
|
columndef->null_pos= mi_uint2korr(ptr); ptr+= 2;
|
|
columndef->empty_pos= mi_uint2korr(ptr); ptr+= 2;
|
|
columndef->null_bit= (uint8) *ptr++;
|
|
columndef->empty_bit= (uint8) *ptr++;
|
|
return ptr;
|
|
}
|
|
|
|
/**************************************************************************
|
|
Open data file
|
|
We can't use dup() here as the data file descriptors need to have different
|
|
active seek-positions.
|
|
|
|
The argument file_to_dup is here for the future if there would on some OS
|
|
exist a dup()-like call that would give us two different file descriptors.
|
|
*************************************************************************/
|
|
|
|
int _ma_open_datafile(MARIA_HA *info, MARIA_SHARE *share,
|
|
File file_to_dup __attribute__((unused)))
|
|
{
|
|
info->dfile.file= share->bitmap.file.file=
|
|
my_open(share->data_file_name, share->mode | O_SHARE,
|
|
MYF(MY_WME));
|
|
return info->dfile.file >= 0 ? 0 : 1;
|
|
}
|
|
|
|
|
|
int _ma_open_keyfile(MARIA_SHARE *share)
|
|
{
|
|
/*
|
|
Modifications to share->kfile should be under intern_lock to protect
|
|
against a concurrent checkpoint.
|
|
*/
|
|
pthread_mutex_lock(&share->intern_lock);
|
|
share->kfile.file= my_open(share->unique_file_name,
|
|
share->mode | O_SHARE,
|
|
MYF(MY_WME));
|
|
pthread_mutex_unlock(&share->intern_lock);
|
|
return (share->kfile.file < 0);
|
|
}
|
|
|
|
|
|
/*
|
|
Disable all indexes.
|
|
|
|
SYNOPSIS
|
|
maria_disable_indexes()
|
|
info A pointer to the MARIA storage engine MARIA_HA struct.
|
|
|
|
DESCRIPTION
|
|
Disable all indexes.
|
|
|
|
RETURN
|
|
0 ok
|
|
*/
|
|
|
|
int maria_disable_indexes(MARIA_HA *info)
|
|
{
|
|
MARIA_SHARE *share= info->s;
|
|
|
|
maria_clear_all_keys_active(share->state.key_map);
|
|
return 0;
|
|
}
|
|
|
|
|
|
/*
|
|
Enable all indexes
|
|
|
|
SYNOPSIS
|
|
maria_enable_indexes()
|
|
info A pointer to the MARIA storage engine MARIA_HA struct.
|
|
|
|
DESCRIPTION
|
|
Enable all indexes. The indexes might have been disabled
|
|
by maria_disable_index() before.
|
|
The function works only if both data and indexes are empty,
|
|
otherwise a repair is required.
|
|
To be sure, call handler::delete_all_rows() before.
|
|
|
|
RETURN
|
|
0 ok
|
|
HA_ERR_CRASHED data or index is non-empty.
|
|
*/
|
|
|
|
int maria_enable_indexes(MARIA_HA *info)
|
|
{
|
|
int error= 0;
|
|
MARIA_SHARE *share= info->s;
|
|
|
|
if (share->state.state.data_file_length ||
|
|
(share->state.state.key_file_length != share->base.keystart))
|
|
{
|
|
maria_print_error(info->s, HA_ERR_CRASHED);
|
|
error= HA_ERR_CRASHED;
|
|
}
|
|
else
|
|
maria_set_all_keys_active(share->state.key_map, share->base.keys);
|
|
return error;
|
|
}
|
|
|
|
|
|
/*
|
|
Test if indexes are disabled.
|
|
|
|
SYNOPSIS
|
|
maria_indexes_are_disabled()
|
|
info A pointer to the MARIA storage engine MARIA_HA struct.
|
|
|
|
DESCRIPTION
|
|
Test if indexes are disabled.
|
|
|
|
RETURN
|
|
0 indexes are not disabled
|
|
1 all indexes are disabled
|
|
2 non-unique indexes are disabled
|
|
*/
|
|
|
|
int maria_indexes_are_disabled(MARIA_HA *info)
|
|
{
|
|
MARIA_SHARE *share= info->s;
|
|
|
|
/*
|
|
No keys or all are enabled. keys is the number of keys. Left shifted
|
|
gives us only one bit set. When decreased by one, gives us all all bits
|
|
up to this one set and it gets unset.
|
|
*/
|
|
if (!share->base.keys ||
|
|
(maria_is_all_keys_active(share->state.key_map, share->base.keys)))
|
|
return 0;
|
|
|
|
/* All are disabled */
|
|
if (maria_is_any_key_active(share->state.key_map))
|
|
return 1;
|
|
|
|
/*
|
|
We have keys. Some enabled, some disabled.
|
|
Don't check for any non-unique disabled but return directly 2
|
|
*/
|
|
return 2;
|
|
}
|
|
|
|
|
|
static my_bool maria_scan_init_dummy(MARIA_HA *info __attribute__((unused)))
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
static void maria_scan_end_dummy(MARIA_HA *info __attribute__((unused)))
|
|
{
|
|
}
|
|
|
|
static my_bool maria_once_init_dummy(MARIA_SHARE *share
|
|
__attribute__((unused)),
|
|
File dfile __attribute__((unused)))
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
static my_bool maria_once_end_dummy(MARIA_SHARE *share __attribute__((unused)))
|
|
{
|
|
return 0;
|
|
}
|