mirror of
https://github.com/MariaDB/server.git
synced 2025-01-16 12:02:42 +01:00
52cb0c24a6
Store max_trid in index file as state.create_trid. This is used to pack all transids in the index pages relative to max possible transid for file. Enable versioning for transactional tables with index. Tables with an auto-increment key, rtree or fulltext keys are not versioned. Changed info->lastkey to type MARIA_KEY. Removed info->lastkey_length as this is now part of info->lastkey Renamed old info->lastkey to info->lastkey_buff Use exact key lenghts for keys, not USE_WHOLE_KEY For partial key searches, use SEARCH_PART_KEY When searching to insert new key on page, use SEARCH_INSERT to mark that key has rowid Changes done in a lot of files: - Modified functions to use MARIA_KEY instead of key pointer and key length - Use keyinfo->root_lock instead of share->key_root_lock[keynr] - Simplify code by using local variable keyinfo instead if share->keyinfo[i] - Added #fdef EXTERNAL_LOCKING around removed state elements - HA_MAX_KEY_BUFF -> MARIA_MAX_KEY_BUFF (to reserve space for transid) - Changed type of 'nextflag' to uint32 to ensure all SEARCH_xxx flags fits into it .bzrignore: Added missing temporary directory extra/Makefile.am: comp_err is now deleted on make distclean include/maria.h: Added structure MARIA_KEY, which is used for intern key objects in Maria. Changed functions to take MARIA_KEY as an argument instead of pointer to packed key. Changed some functions that always return true or false to my_bool. Added virtual function make_key() to avoid if in _ma_make_key() Moved rw_lock_t for locking trees from share->key_root_lock to MARIA_KEYDEF. This makes usage of the locks simpler and faster include/my_base.h: Added HA_RTREE_INDEX flag to mark rtree index. Used for easier checks in ma_check() Added SEARCH_INSERT to be used when inserting new keys Added SEARCH_PART_KEY for partial searches Added SEARCH_USER_KEY_HAS_TRANSID to be used when key we use for searching in btree has a TRANSID Added SEARCH_PAGE_KEY_HAS_TRANSID to be used when key we found in btree has a transid include/my_handler.h: Make next_flag 32 bit to make sure we can handle all SEARCH_ bits mysql-test/include/maria_empty_logs.inc: Read and restore current database; Don't assume we are using mysqltest. Don't log use databasename to log. Using this include should not cause any result changes. mysql-test/r/maria-gis-rtree-dynamic.result: Updated results after adding some check table commands to help pinpoint errors mysql-test/r/maria-mvcc.result: New tests mysql-test/r/maria-purge.result: New result after adding removal of logs mysql-test/r/maria-recovery-big.result: maria_empty_logs doesn't log 'use mysqltest' anymore mysql-test/r/maria-recovery-bitmap.result: maria_empty_logs doesn't log 'use mysqltest' anymore mysql-test/r/maria-recovery-rtree-ft.result: maria_empty_logs doesn't log 'use mysqltest' anymore mysql-test/r/maria-recovery.result: maria_empty_logs doesn't log 'use mysqltest' anymore mysql-test/r/maria.result: New tests mysql-test/r/variables-big.result: Don't log id as it's not predictable mysql-test/suite/rpl_ndb/r/rpl_truncate_7ndb_2.result: Updated results to new binlog results. (Test has not been run in a long time as it requires --big) mysql-test/suite/rpl_ndb/t/rpl_truncate_7ndb_2-master.opt: Moved file to ndb replication test directory mysql-test/suite/rpl_ndb/t/rpl_truncate_7ndb_2.test: Fixed wrong path to included tests mysql-test/t/maria-gis-rtree-dynamic.test: Added some check table commands to help pinpoint errors mysql-test/t/maria-mvcc.test: New tests mysql-test/t/maria-purge.test: Remove logs to make test results predictable mysql-test/t/maria.test: New tests for some possible problems mysql-test/t/variables-big.test: Don't log id as it's not predictable mysys/my_handler.c: Updated function comment to reflect old code Changed nextflag to be uint32 to ensure we can have flags > 16 bit Changed checking if we are in insert with NULL keys as next_flag can now include additional bits that have to be ignored. Added SEARCH_INSERT flag to be used when inserting new keys in btree. This flag tells us the that the keys includes row position and it's thus safe to remove SEARCH_FIND Added comparision of transid. This is only done if the keys actually have a transid, which is indicated by nextflag mysys/my_lock.c: Fixed wrong test (Found by Guilhem) scripts/Makefile.am: Ensure that test programs are deleted by make clean sql/rpl_rli.cc: Moved assignment order to fix compiler warning storage/heap/hp_write.c: Add SEARCH_INSERT to signal ha_key_cmp that we we should also compare rowid for keys storage/maria/Makefile.am: Remove also maria log files when doing make distclean storage/maria/ha_maria.cc: Use 'file->start_state' as default state for transactional tables without versioning At table unlock, set file->state to point to live state. (Needed for information schema to pick up right number of rows) In ha_maria::implicit_commit() move all locked (ie open) tables to new transaction. This is needed to ensure ha_maria->info doesn't point to a deleted history event. Disable concurrent inserts for insert ... select and table changes with subqueries if statement based replication as this would cause wrong results on slave storage/maria/ma_blockrec.c: Updated comment storage/maria/ma_check.c: Compact key pages (removes transid) when doing --zerofill Check that 'page_flag' on key pages contains KEYPAGE_FLAG_HAS_TRANSID if there is a single key on the page with a transid Modified functions to use MARIA_KEY instead of key pointer and key length Use new interface to _ma_rec_pos(), _ma_dpointer(), _ma_ft_del(), ma_update_state_lsn() Removed not needed argument from get_record_for_key() Fixed that we check doesn't give errors for RTREE; We now treath these like SPATIAL Remove some SPATIAL specific code where the virtual functions can handle this in a general manner Use info->lastkey_buff instead of info->lastkey _ma_dpos() -> _ma_row_pos_from_key() _ma_make_key() -> keyinfo->make_key() _ma_print_key() -> _ma_print_keydata() _ma_move_key() -> ma_copy_copy() Add SEARCH_INSERT to signal ha_key_cmp that we we should also compare rowid for keys Ensure that data on page doesn't overwrite page checksum position Use DBUG_DUMP_KEY instead of DBUG_DUMP Use exact key lengths instead of USE_WHOLE_KEY to ha_key_cmp() Fixed check if rowid points outside of BLOCK_RECORD data file Use info->lastkey_buff instead of key on stack in some safe places Added #fdef EXTERNAL_LOCKING around removed state elements storage/maria/ma_close.c: Use keyinfo->root_lock instead of share->key_root_lock[keynr] storage/maria/ma_create.c: Removed assert that is already checked in maria_init() Force transactinal tables to be of type BLOCK_RECORD Fixed wrong usage of HA_PACK_RECORD (should be HA_OPTION_PACK_RECORD) Mark keys that uses HA_KEY_ALG_RTREE with HA_RTREE_INDEX for easier handling of these in ma_check Store max_trid in index file as state.create_trid. This is used to pack all transids in the index pages relative to max possible transid for file. storage/maria/ma_dbug.c: Changed _ma_print_key() to use MARIA_KEY storage/maria/ma_delete.c: Modified functions to use MARIA_KEY instead of key pointer and key length info->lastkey2-> info->lastkey_buff2 Added SEARCH_INSERT to signal ha_key_cmp that we we should also compare rowid for keys Use new interface for get_key(), _ma_get_last_key() and others _ma_dpos() -> ma_row_pos_from_key() Simplify setting of prev_key in del() Ensure that KEYPAGE_FLAG_HAS_TRANSID is set in page_flag if key page has transid Treath key pages that may have a transid as if keys would be of variable length storage/maria/ma_delete_all.c: Reset history state if maria_delete_all_rows() are called Update parameters to _ma_update_state_lsns() call storage/maria/ma_extra.c: Store and restore info->lastkey storage/maria/ma_ft_boolean_search.c: Modified functions to use MARIA_KEY instead of key pointer and key length storage/maria/ma_ft_nlq_search.c: Modified functions to use MARIA_KEY instead of key pointer and key length Use lastkey_buff2 instead of info->lastkey+info->s->base.max_key_length (same thing) storage/maria/ma_ft_update.c: Modified functions to use MARIA_KEY instead of key pointer and key length storage/maria/ma_ftdefs.h: Modified functions to use MARIA_KEY instead of key pointer and key length storage/maria/ma_fulltext.h: Modified functions to use MARIA_KEY instead of key pointer and key length storage/maria/ma_init.c: Check if blocksize is legal (Moved test here from ma_open()) storage/maria/ma_key.c: Added functions for storing/reading of transid Modified functions to use MARIA_KEY instead of key pointer and key length Moved _ma_sp_make_key() out of _ma_make_key() as we now use keyinfo->make_key to create keys Add transid to keys if table is versioned Added _ma_copy_key() storage/maria/ma_key_recover.c: Add logging of page_flag (holds information if there are keys with transid on page) Changed DBUG_PRINT("info" -> DBUG_PRINT("redo" as the redo logging can be quite extensive Added lots of DBUG_PRINT() Added support for index page operations: KEY_OP_SET_PAGEFLAG and KEY_OP_COMPACT_PAGE storage/maria/ma_key_recover.h: Modified functions to use MARIA_KEY instead of key pointer and key length storage/maria/ma_locking.c: Added new arguments to _ma_update_state_lsns_sub() storage/maria/ma_loghandler.c: Fixed all logging of LSN to look similar in DBUG log Changed if (left != 0) to if (left) as the later is used also later in the code storage/maria/ma_loghandler.h: Added new index page operations storage/maria/ma_open.c: Removed allocated "state_dummy" and instead use share->state.common for transactional tables that are not versioned This is needed to not get double increments of state.records (one in ma_write.c and on when log is written) Changed info->lastkey to MARIA_KEY type Removed resetting of MARIA_HA variables that have 0 as default value (as info is zerofilled) Enable versioning for transactional tables with index. Tables with an auto-increment key, rtree or fulltext keys are not versioned. Check on open that state.create_trid is correct Extend share->base.max_key_length in case of transactional table so that it can hold transid Removed 4.0 compatible fulltext key mode as this is not relevant for Maria Removed old and wrong #ifdef ENABLE_WHEN_WE_HAVE_TRANS_ROW_ID code block Initialize all new virtual function pointers Removed storing of state->unique, state->process and store state->create_trid instead storage/maria/ma_page.c: Added comment to describe key page structure Added functions to compact key page and log the compact operation storage/maria/ma_range.c: Modified functions to use MARIA_KEY instead of key pointer and key length Use SEARCH_PART_KEY indicator instead of USE_WHOLE_KEY to detect if we are doing a part key search Added handling of pages with transid storage/maria/ma_recovery.c: Don't assert if table we opened are not transactional. This may be a table which has been changed from transactional to not transactinal Added new arguments to _ma_update_state_lsns() storage/maria/ma_rename.c: Added new arguments to _ma_update_state_lsns() storage/maria/ma_rkey.c: Modified functions to use MARIA_KEY instead of key pointer and key length Don't use USE_WHOLE_KEY, use real length of key Use share->row_is_visible() to test if row is visible Moved search_flag == HA_READ_KEY_EXACT out of 'read-next-row' loop as this only need to be tested once Removed test if last_used_keyseg != 0 as this is always true storage/maria/ma_rnext.c: Modified functions to use MARIA_KEY instead of key pointer and key length Simplify code by using local variable keyinfo instead if share->keyinfo[i] Use share->row_is_visible() to test if row is visible storage/maria/ma_rnext_same.c: Modified functions to use MARIA_KEY instead of key pointer and key length lastkey2 -> lastkey_buff2 storage/maria/ma_rprev.c: Modified functions to use MARIA_KEY instead of key pointer and key length Simplify code by using local variable keyinfo instead if share->keyinfo[i] Use share->row_is_visible() to test if row is visible storage/maria/ma_rsame.c: Updated comment Simplify code by using local variable keyinfo instead if share->keyinfo[i] Modified functions to use MARIA_KEY instead of key pointer and key length storage/maria/ma_rsamepos.c: Modified functions to use MARIA_KEY instead of key pointer and key length storage/maria/ma_rt_index.c: Modified functions to use MARIA_KEY instead of key pointer and key length Use better variable names Removed not needed casts _ma_dpos() -> _ma_row_pos_from_key() Use info->last_rtree_keypos to save position to key instead of info->int_keypos Simplify err: condition Changed return type for maria_rtree_insert() to my_bool as we are only intressed in ok/fail from this function storage/maria/ma_rt_index.h: Modified functions to use MARIA_KEY instead of key pointer and key length storage/maria/ma_rt_key.c: Modified functions to use MARIA_KEY instead of key pointer and key length Simplify maria_rtree_add_key by combining idenitcal code and removing added_len storage/maria/ma_rt_key.h: Modified functions to use MARIA_KEY instead of key pointer and key length storage/maria/ma_rt_mbr.c: Changed type of 'nextflag' to uint32 Added 'to' argument to RT_PAGE_MBR_XXX functions to more clearly see which variables changes value storage/maria/ma_rt_mbr.h: Changed type of 'nextflag' to uint32 storage/maria/ma_rt_split.c: Modified functions to use MARIA_KEY instead of key pointer and key length key_length -> key_data_length to catch possible errors storage/maria/ma_rt_test.c: Fixed wrong comment Reset recinfo to avoid valgrind varnings Fixed wrong argument to create_record() that caused test to fail storage/maria/ma_search.c: Modified functions to use MARIA_KEY instead of key pointer and key length Added support of keys with optional trid Test for SEARCH_PART_KEY instead of USE_WHOLE_KEY to detect part key reads _ma_dpos() -> _ma_row_pos_from_key() If there may be keys with transid on the page, have _ma_bin_search() call _ma_seq_search() Add _ma_skip_xxx() functions to quickly step over keys (faster than calling get_key() in most cases as we don't have to copy key data) Combine similar code at end of _ma_get_binary_pack_key() Removed not used function _ma_move_key() In _ma_search_next() don't call _ma_search() if we aren't on a nod page. Update info->cur_row.trid with trid for found key Removed some not needed casts Added _ma_trid_from_key() Use MARIA_SHARE instead of MARIA_HA as arguments to _ma_rec_pos(), _ma_dpointer() and _ma_xxx_keypos_to_recpos() to make functions faster and smaller storage/maria/ma_sort.c: Modified functions to use MARIA_KEY instead of key pointer and key length storage/maria/ma_sp_defs.h: _ma_sp_make_key() now fills in and returns (MARIA_KEY *) value storage/maria/ma_sp_key.c: _ma_sp_make_key() now fills in and returns (MARIA_KEY *) value Don't test sizeof(double), test against 8 as we are using float8store() Use mi_float8store() instead of doing swap of value (same thing but faster) storage/maria/ma_state.c: maria_versioning() now only calls _ma_block_get_status() if table supports versioning Added _ma_row_visible_xxx() functions for different occasions When emptying history, set info->state to point to the first history event. storage/maria/ma_state.h: Added _ma_row_visible_xxx() prototypes storage/maria/ma_static.c: Indentation changes storage/maria/ma_statrec.c: Fixed arguments to _ma_dpointer() and _ma_rec_pos() storage/maria/ma_test1.c: Call init_thr_lock() if we have versioning storage/maria/ma_test2.c: Call init_thr_lock() if we have versioning storage/maria/ma_unique.c: Modified functions to use MARIA_KEY storage/maria/ma_update.c: Modified functions to use MARIA_KEY instead of key pointer and key length storage/maria/ma_write.c: Modified functions to use MARIA_KEY instead of key pointer and key length Simplify code by using local variable keyinfo instead if share->keyinfo[i] In _ma_enlarge_root(), mark in page_flag if new key has transid _ma_dpos() -> _ma_row_pos_from_key() Changed return type of _ma_ck_write_tree() to my_bool as we are only testing if result is true or not Moved 'reversed' to outside block as area was used later storage/maria/maria_chk.c: Added error if trying to sort with HA_BINARY_PACK_KEY Use new interface to get_key() and _ma_dpointer() _ma_dpos() -> _ma_row_pos_from_key() storage/maria/maria_def.h: Modified functions to use MARIA_KEY instead of key pointer and key length Added 'common' to MARIA_SHARE->state for storing state for transactional tables without versioning Added create_trid to MARIA_SHARE Removed not used state variables 'process' and 'unique' Added defines for handling TRID's in index pages Changed to use MARIA_SHARE instead of MARIA_HA for some functions Added 'have_versioning' flag if table supports versioning Moved key_root_lock from MARIA_SHARE to MARIA_KEYDEF Changed last_key to be of type MARIA_KEY. Removed lastkey_length lastkey -> lastkey_buff, lastkey2 -> lastkey_buff2 Added _ma_get_used_and_nod_with_flag() for faster access to page data when page_flag is read Added DBUG_DUMP_KEY for easier DBUG_DUMP of a key Changed 'nextflag' and assocaited variables to uint32 storage/maria/maria_ftdump.c: lastkey -> lastkey_buff storage/maria/trnman.c: Fixed wrong initialization of min_read_from and max_commit_trid Added trnman_get_min_safe_trid() storage/maria/unittest/ma_test_all-t: Added --start-from storage/myisam/mi_check.c: Added SEARCH_INSERT, as ha_key_cmp() needs it when doing key comparision for inserting key on page in rowid order storage/myisam/mi_delete.c: Added SEARCH_INSERT, as ha_key_cmp() needs it when doing key comparision for inserting key on page in rowid order storage/myisam/mi_range.c: Updated comment storage/myisam/mi_write.c: Added SEARCH_INSERT, as ha_key_cmp() needs it when doing key comparision for inserting key on page in rowid order storage/myisam/rt_index.c: Fixed wrong parameter to rtree_get_req() which could cause crash
895 lines
26 KiB
C
895 lines
26 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 */
|
|
|
|
/* Testing of the basic functions of a MARIA table */
|
|
|
|
#include "maria_def.h"
|
|
#include <my_getopt.h>
|
|
#include <m_string.h>
|
|
#include "ma_control_file.h"
|
|
#include "ma_loghandler.h"
|
|
#include "ma_checkpoint.h"
|
|
#include "trnman.h"
|
|
|
|
extern PAGECACHE *maria_log_pagecache;
|
|
extern char *maria_data_root;
|
|
|
|
#define MAX_REC_LENGTH 1024
|
|
|
|
static void usage();
|
|
|
|
static int rec_pointer_size=0, flags[50], testflag, checkpoint;
|
|
static int key_field=FIELD_SKIP_PRESPACE,extra_field=FIELD_SKIP_ENDSPACE;
|
|
static int key_type=HA_KEYTYPE_NUM;
|
|
static int create_flag=0;
|
|
static ulong blob_length;
|
|
static enum data_file_type record_type= DYNAMIC_RECORD;
|
|
|
|
static uint insert_count, update_count, remove_count;
|
|
static uint pack_keys=0, pack_seg=0, key_length;
|
|
static uint unique_key=HA_NOSAME;
|
|
static uint die_in_middle_of_transaction;
|
|
static my_bool pagecacheing, null_fields, silent, skip_update, opt_unique;
|
|
static my_bool verbose, skip_delete, transactional;
|
|
static my_bool opt_versioning= 0;
|
|
static MARIA_COLUMNDEF recinfo[4];
|
|
static MARIA_KEYDEF keyinfo[10];
|
|
static HA_KEYSEG keyseg[10];
|
|
static HA_KEYSEG uniqueseg[10];
|
|
|
|
static int run_test(const char *filename);
|
|
static void get_options(int argc, char *argv[]);
|
|
static void create_key(uchar *key,uint rownr);
|
|
static void create_record(uchar *record,uint rownr);
|
|
static void update_record(uchar *record);
|
|
|
|
|
|
/*
|
|
These are here only for testing of recovery with undo. We are not
|
|
including maria_def.h here as this test is also to be an example of
|
|
how to use maria outside of the maria directory
|
|
*/
|
|
|
|
extern int _ma_flush_table_files(MARIA_HA *info, uint flush_data_or_index,
|
|
enum flush_type flush_type_for_data,
|
|
enum flush_type flush_type_for_index);
|
|
#define MARIA_FLUSH_DATA 1
|
|
|
|
|
|
int main(int argc,char *argv[])
|
|
{
|
|
MY_INIT(argv[0]);
|
|
get_options(argc,argv);
|
|
maria_data_root= (char *)".";
|
|
/* Maria requires that we always have a page cache */
|
|
if (maria_init() ||
|
|
(init_pagecache(maria_pagecache, maria_block_size * 16, 0, 0,
|
|
maria_block_size, MY_WME) == 0) ||
|
|
ma_control_file_open(TRUE, TRUE) ||
|
|
(init_pagecache(maria_log_pagecache,
|
|
TRANSLOG_PAGECACHE_SIZE, 0, 0,
|
|
TRANSLOG_PAGE_SIZE, MY_WME) == 0) ||
|
|
translog_init(maria_data_root, TRANSLOG_FILE_SIZE,
|
|
0, 0, maria_log_pagecache,
|
|
TRANSLOG_DEFAULT_FLAGS, 0) ||
|
|
(transactional && (trnman_init(0) || ma_checkpoint_init(0))))
|
|
{
|
|
fprintf(stderr, "Error in initialization\n");
|
|
exit(1);
|
|
}
|
|
if (opt_versioning)
|
|
init_thr_lock();
|
|
|
|
exit(run_test("test1"));
|
|
}
|
|
|
|
|
|
static int run_test(const char *filename)
|
|
{
|
|
MARIA_HA *file;
|
|
int i,j= 0,error,deleted,rec_length,uniques=0;
|
|
uint offset_to_key;
|
|
ha_rows found,row_count;
|
|
uchar record[MAX_REC_LENGTH],key[MAX_REC_LENGTH],read_record[MAX_REC_LENGTH];
|
|
MARIA_UNIQUEDEF uniquedef;
|
|
MARIA_CREATE_INFO create_info;
|
|
|
|
if (die_in_middle_of_transaction)
|
|
null_fields= 1;
|
|
|
|
bzero((char*) recinfo,sizeof(recinfo));
|
|
bzero((char*) &create_info,sizeof(create_info));
|
|
|
|
/* First define 2 columns */
|
|
create_info.null_bytes= 1;
|
|
recinfo[0].type= key_field;
|
|
recinfo[0].length= (key_field == FIELD_BLOB ? 4+portable_sizeof_char_ptr :
|
|
key_length);
|
|
if (key_field == FIELD_VARCHAR)
|
|
recinfo[0].length+= HA_VARCHAR_PACKLENGTH(key_length);
|
|
recinfo[1].type=extra_field;
|
|
recinfo[1].length= (extra_field == FIELD_BLOB ? 4 + portable_sizeof_char_ptr : 24);
|
|
if (extra_field == FIELD_VARCHAR)
|
|
recinfo[1].length+= HA_VARCHAR_PACKLENGTH(recinfo[1].length);
|
|
recinfo[1].null_bit= null_fields ? 2 : 0;
|
|
|
|
if (opt_unique)
|
|
{
|
|
recinfo[2].type=FIELD_CHECK;
|
|
recinfo[2].length=MARIA_UNIQUE_HASH_LENGTH;
|
|
}
|
|
rec_length= recinfo[0].length+recinfo[1].length+recinfo[2].length;
|
|
|
|
if (key_type == HA_KEYTYPE_VARTEXT1 &&
|
|
key_length > 255)
|
|
key_type= HA_KEYTYPE_VARTEXT2;
|
|
|
|
/* Define a key over the first column */
|
|
keyinfo[0].seg=keyseg;
|
|
keyinfo[0].keysegs=1;
|
|
keyinfo[0].block_length= 0; /* Default block length */
|
|
keyinfo[0].key_alg=HA_KEY_ALG_BTREE;
|
|
keyinfo[0].seg[0].type= key_type;
|
|
keyinfo[0].seg[0].flag= pack_seg;
|
|
keyinfo[0].seg[0].start=1;
|
|
keyinfo[0].seg[0].length=key_length;
|
|
keyinfo[0].seg[0].null_bit= null_fields ? 2 : 0;
|
|
keyinfo[0].seg[0].null_pos=0;
|
|
keyinfo[0].seg[0].language= default_charset_info->number;
|
|
if (pack_seg & HA_BLOB_PART)
|
|
{
|
|
keyinfo[0].seg[0].bit_start=4; /* Length of blob length */
|
|
}
|
|
keyinfo[0].flag = (uint8) (pack_keys | unique_key);
|
|
|
|
bzero((uchar*) flags,sizeof(flags));
|
|
if (opt_unique)
|
|
{
|
|
uint start;
|
|
uniques=1;
|
|
bzero((char*) &uniquedef,sizeof(uniquedef));
|
|
bzero((char*) uniqueseg,sizeof(uniqueseg));
|
|
uniquedef.seg=uniqueseg;
|
|
uniquedef.keysegs=2;
|
|
|
|
/* Make a unique over all columns (except first NULL fields) */
|
|
for (i=0, start=1 ; i < 2 ; i++)
|
|
{
|
|
uniqueseg[i].start=start;
|
|
start+=recinfo[i].length;
|
|
uniqueseg[i].length=recinfo[i].length;
|
|
uniqueseg[i].language= default_charset_info->number;
|
|
}
|
|
uniqueseg[0].type= key_type;
|
|
uniqueseg[0].null_bit= null_fields ? 2 : 0;
|
|
uniqueseg[1].type= HA_KEYTYPE_TEXT;
|
|
if (extra_field == FIELD_BLOB)
|
|
{
|
|
uniqueseg[1].length=0; /* The whole blob */
|
|
uniqueseg[1].bit_start=4; /* long blob */
|
|
uniqueseg[1].flag|= HA_BLOB_PART;
|
|
}
|
|
else if (extra_field == FIELD_VARCHAR)
|
|
{
|
|
uniqueseg[1].flag|= HA_VAR_LENGTH_PART;
|
|
uniqueseg[1].type= (HA_VARCHAR_PACKLENGTH(recinfo[1].length-1) == 1 ?
|
|
HA_KEYTYPE_VARTEXT1 : HA_KEYTYPE_VARTEXT2);
|
|
}
|
|
}
|
|
else
|
|
uniques=0;
|
|
|
|
offset_to_key= test(null_fields);
|
|
if (key_field == FIELD_BLOB || key_field == FIELD_VARCHAR)
|
|
offset_to_key+= 2;
|
|
|
|
if (!silent)
|
|
printf("- Creating maria file\n");
|
|
create_info.max_rows=(ulong) (rec_pointer_size ?
|
|
(1L << (rec_pointer_size*8))/40 :
|
|
0);
|
|
create_info.transactional= transactional;
|
|
if (maria_create(filename, record_type, 1, keyinfo,2+opt_unique,recinfo,
|
|
uniques, &uniquedef, &create_info,
|
|
create_flag))
|
|
goto err;
|
|
if (!(file=maria_open(filename,2,HA_OPEN_ABORT_IF_LOCKED)))
|
|
goto err;
|
|
if (!silent)
|
|
printf("- Writing key:s\n");
|
|
|
|
if (maria_begin(file))
|
|
goto err;
|
|
if (opt_versioning)
|
|
maria_versioning(file, 1);
|
|
my_errno=0;
|
|
row_count=deleted=0;
|
|
for (i=49 ; i>=1 ; i-=2 )
|
|
{
|
|
if (insert_count-- == 0)
|
|
{
|
|
if (testflag)
|
|
break;
|
|
VOID(maria_close(file));
|
|
exit(0);
|
|
}
|
|
j=i%25 +1;
|
|
create_record(record,j);
|
|
error=maria_write(file,record);
|
|
if (!error)
|
|
row_count++;
|
|
flags[j]=1;
|
|
if (verbose || error)
|
|
printf("J= %2d maria_write: %d errno: %d\n", j,error,my_errno);
|
|
}
|
|
|
|
if (maria_commit(file) || maria_begin(file))
|
|
goto err;
|
|
|
|
if (checkpoint == 1 && ma_checkpoint_execute(CHECKPOINT_MEDIUM, FALSE))
|
|
goto err;
|
|
|
|
if (testflag == 1)
|
|
goto end;
|
|
|
|
/* Insert 2 rows with null values */
|
|
if (null_fields)
|
|
{
|
|
create_record(record,0);
|
|
error=maria_write(file,record);
|
|
if (!error)
|
|
row_count++;
|
|
if (verbose || error)
|
|
printf("J= NULL maria_write: %d errno: %d\n", error,my_errno);
|
|
error=maria_write(file,record);
|
|
if (!error)
|
|
row_count++;
|
|
if (verbose || error)
|
|
printf("J= NULL maria_write: %d errno: %d\n", error,my_errno);
|
|
flags[0]=2;
|
|
}
|
|
|
|
if (checkpoint == 2 && ma_checkpoint_execute(CHECKPOINT_MEDIUM, FALSE))
|
|
goto err;
|
|
|
|
if (testflag == 2)
|
|
{
|
|
printf("Terminating after inserts\n");
|
|
goto end;
|
|
}
|
|
|
|
if (maria_commit(file) || maria_begin(file))
|
|
goto err;
|
|
|
|
if (!skip_update)
|
|
{
|
|
if (opt_unique)
|
|
{
|
|
if (!silent)
|
|
printf("- Checking unique constraint\n");
|
|
create_record(record,j); /* Check last created row */
|
|
if (!maria_write(file,record) || my_errno != HA_ERR_FOUND_DUPP_UNIQUE)
|
|
{
|
|
printf("unique check failed\n");
|
|
}
|
|
}
|
|
if (!silent)
|
|
printf("- Updating rows\n");
|
|
|
|
/* Update first last row to force extend of file */
|
|
if (maria_rsame(file,read_record,-1))
|
|
{
|
|
printf("Can't find last row with maria_rsame\n");
|
|
}
|
|
else
|
|
{
|
|
memcpy(record,read_record,rec_length);
|
|
update_record(record);
|
|
if (maria_update(file,read_record,record))
|
|
{
|
|
printf("Can't update last row: %.*s\n",
|
|
keyinfo[0].seg[0].length,read_record+1);
|
|
}
|
|
}
|
|
|
|
/* Read through all rows and update them */
|
|
assert(maria_scan_init(file) == 0);
|
|
|
|
found=0;
|
|
while ((error= maria_scan(file,read_record)) == 0)
|
|
{
|
|
if (--update_count == 0) { VOID(maria_close(file)) ; exit(0) ; }
|
|
memcpy(record,read_record,rec_length);
|
|
update_record(record);
|
|
if (maria_update(file,read_record,record))
|
|
{
|
|
printf("Can't update row: %.*s, error: %d\n",
|
|
keyinfo[0].seg[0].length,record+1,my_errno);
|
|
}
|
|
found++;
|
|
}
|
|
if (found != row_count)
|
|
printf("Found %ld of %ld rows\n", (ulong) found, (ulong) row_count);
|
|
maria_scan_end(file);
|
|
}
|
|
|
|
if (checkpoint == 3 && ma_checkpoint_execute(CHECKPOINT_MEDIUM, FALSE))
|
|
goto err;
|
|
|
|
if (testflag == 3)
|
|
{
|
|
printf("Terminating after updates\n");
|
|
goto end;
|
|
}
|
|
if (!silent)
|
|
printf("- Reopening file\n");
|
|
if (maria_commit(file))
|
|
goto err;
|
|
if (maria_close(file))
|
|
goto err;
|
|
if (!(file=maria_open(filename,2,HA_OPEN_ABORT_IF_LOCKED)))
|
|
goto err;
|
|
if (maria_begin(file))
|
|
goto err;
|
|
if (opt_versioning)
|
|
maria_versioning(file, 1);
|
|
if (!skip_delete)
|
|
{
|
|
if (!silent)
|
|
printf("- Removing keys\n");
|
|
|
|
for (i=0 ; i <= 10 ; i++)
|
|
{
|
|
/*
|
|
If you want to debug the problem in ma_test_recovery with BLOBs
|
|
(see @todo there), you can break out of the loop after just one
|
|
delete, it is enough, like this:
|
|
if (i==1) break;
|
|
*/
|
|
/* testing */
|
|
if (remove_count-- == 0)
|
|
{
|
|
fprintf(stderr,
|
|
"delete-rows number of rows deleted; Going down hard!\n");
|
|
goto end;
|
|
}
|
|
j=i*2;
|
|
if (!flags[j])
|
|
continue;
|
|
create_key(key,j);
|
|
my_errno=0;
|
|
if ((error = maria_rkey(file, read_record, 0, key,
|
|
HA_WHOLE_KEY, HA_READ_KEY_EXACT)))
|
|
{
|
|
if (verbose || (flags[j] >= 1 ||
|
|
(error && my_errno != HA_ERR_KEY_NOT_FOUND)))
|
|
printf("key: '%.*s' maria_rkey: %3d errno: %3d\n",
|
|
(int) key_length,key+offset_to_key,error,my_errno);
|
|
}
|
|
else
|
|
{
|
|
error=maria_delete(file,read_record);
|
|
if (verbose || error)
|
|
printf("key: '%.*s' maria_delete: %3d errno: %3d\n",
|
|
(int) key_length, key+offset_to_key, error, my_errno);
|
|
if (! error)
|
|
{
|
|
deleted++;
|
|
flags[j]--;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if (checkpoint == 4 && ma_checkpoint_execute(CHECKPOINT_MEDIUM, FALSE))
|
|
goto err;
|
|
|
|
if (testflag == 4)
|
|
{
|
|
printf("Terminating after deletes\n");
|
|
goto end;
|
|
}
|
|
|
|
if (!silent)
|
|
printf("- Reading rows with key\n");
|
|
record[1]= 0; /* For nicer printf */
|
|
for (i=0 ; i <= 25 ; i++)
|
|
{
|
|
create_key(key,i);
|
|
my_errno=0;
|
|
error=maria_rkey(file,read_record,0,key,HA_WHOLE_KEY,HA_READ_KEY_EXACT);
|
|
if (verbose ||
|
|
(error == 0 && flags[i] == 0 && unique_key) ||
|
|
(error && (flags[i] != 0 || my_errno != HA_ERR_KEY_NOT_FOUND)))
|
|
{
|
|
printf("key: '%.*s' maria_rkey: %3d errno: %3d record: %s\n",
|
|
(int) key_length,key+offset_to_key,error,my_errno,record+1);
|
|
}
|
|
}
|
|
|
|
if (!silent)
|
|
printf("- Reading rows with position\n");
|
|
if (maria_scan_init(file))
|
|
{
|
|
fprintf(stderr, "maria_scan_init failed\n");
|
|
goto err;
|
|
}
|
|
|
|
for (i=1,found=0 ; i <= 30 ; i++)
|
|
{
|
|
my_errno=0;
|
|
if ((error= maria_scan(file, read_record)) == HA_ERR_END_OF_FILE)
|
|
{
|
|
if (found != row_count-deleted)
|
|
printf("Found only %ld of %ld rows\n", (ulong) found,
|
|
(ulong) (row_count - deleted));
|
|
break;
|
|
}
|
|
if (!error)
|
|
found++;
|
|
if (verbose || (error != 0 && error != HA_ERR_RECORD_DELETED &&
|
|
error != HA_ERR_END_OF_FILE))
|
|
{
|
|
printf("pos: %2d maria_rrnd: %3d errno: %3d record: %s\n",
|
|
i-1,error,my_errno,read_record+1);
|
|
}
|
|
}
|
|
maria_scan_end(file);
|
|
|
|
end:
|
|
if (die_in_middle_of_transaction)
|
|
{
|
|
/* As commit record is not done, UNDO entries needs to be rolled back */
|
|
switch (die_in_middle_of_transaction) {
|
|
case 1:
|
|
/*
|
|
Flush changed pages go to disk. That will also flush log. Recovery
|
|
will skip REDOs and apply UNDOs.
|
|
*/
|
|
_ma_flush_table_files(file, MARIA_FLUSH_DATA | MARIA_FLUSH_INDEX,
|
|
FLUSH_RELEASE, FLUSH_RELEASE);
|
|
break;
|
|
case 2:
|
|
/*
|
|
Just flush log. Pages are likely to not be on disk. Recovery will
|
|
then execute REDOs and UNDOs.
|
|
*/
|
|
if (translog_flush(file->trn->undo_lsn))
|
|
goto err;
|
|
break;
|
|
case 3:
|
|
/*
|
|
Flush nothing. Pages and log are likely to not be on disk. Recovery
|
|
will then do nothing.
|
|
*/
|
|
break;
|
|
case 4:
|
|
/*
|
|
Flush changed data pages go to disk. Changed index pages are not
|
|
flushed. Recovery will skip some REDOs and apply UNDOs.
|
|
*/
|
|
_ma_flush_table_files(file, MARIA_FLUSH_DATA, FLUSH_RELEASE,
|
|
FLUSH_RELEASE);
|
|
/*
|
|
We have to flush log separately as the redo for the last key page
|
|
may not be flushed
|
|
*/
|
|
if (translog_flush(file->trn->undo_lsn))
|
|
goto err;
|
|
break;
|
|
}
|
|
printf("Dying on request without maria_commit()/maria_close()\n");
|
|
exit(0);
|
|
}
|
|
|
|
if (maria_commit(file))
|
|
goto err;
|
|
if (maria_close(file))
|
|
goto err;
|
|
maria_end();
|
|
my_end(MY_CHECK_ERROR);
|
|
|
|
return (0);
|
|
err:
|
|
printf("got error: %3d when using maria-database\n",my_errno);
|
|
return 1; /* skip warning */
|
|
}
|
|
|
|
|
|
static void create_key_part(uchar *key,uint rownr)
|
|
{
|
|
if (!unique_key)
|
|
rownr&=7; /* Some identical keys */
|
|
if (keyinfo[0].seg[0].type == HA_KEYTYPE_NUM)
|
|
{
|
|
sprintf((char*) key,"%*d",keyinfo[0].seg[0].length,rownr);
|
|
}
|
|
else if (keyinfo[0].seg[0].type == HA_KEYTYPE_VARTEXT1 ||
|
|
keyinfo[0].seg[0].type == HA_KEYTYPE_VARTEXT2)
|
|
{ /* Alpha record */
|
|
/* Create a key that may be easily packed */
|
|
bfill(key,keyinfo[0].seg[0].length,rownr < 10 ? 'A' : 'B');
|
|
sprintf((char*) key+keyinfo[0].seg[0].length-2,"%-2d",rownr);
|
|
if ((rownr & 7) == 0)
|
|
{
|
|
/* Change the key to force a unpack of the next key */
|
|
bfill(key+3,keyinfo[0].seg[0].length-5,rownr < 10 ? 'a' : 'b');
|
|
}
|
|
}
|
|
else
|
|
{ /* Alpha record */
|
|
if (keyinfo[0].seg[0].flag & HA_SPACE_PACK)
|
|
sprintf((char*) key,"%-*d",keyinfo[0].seg[0].length,rownr);
|
|
else
|
|
{
|
|
/* Create a key that may be easily packed */
|
|
bfill(key,keyinfo[0].seg[0].length,rownr < 10 ? 'A' : 'B');
|
|
sprintf((char*) key+keyinfo[0].seg[0].length-2,"%-2d",rownr);
|
|
if ((rownr & 7) == 0)
|
|
{
|
|
/* Change the key to force a unpack of the next key */
|
|
key[1]= (rownr < 10 ? 'a' : 'b');
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
static void create_key(uchar *key,uint rownr)
|
|
{
|
|
if (keyinfo[0].seg[0].null_bit)
|
|
{
|
|
if (rownr == 0)
|
|
{
|
|
key[0]=1; /* null key */
|
|
key[1]=0; /* For easy print of key */
|
|
return;
|
|
}
|
|
*key++=0;
|
|
}
|
|
if (keyinfo[0].seg[0].flag & (HA_BLOB_PART | HA_VAR_LENGTH_PART))
|
|
{
|
|
uint tmp;
|
|
create_key_part(key+2,rownr);
|
|
tmp=strlen((char*) key+2);
|
|
int2store(key,tmp);
|
|
}
|
|
else
|
|
create_key_part(key,rownr);
|
|
}
|
|
|
|
|
|
static uchar blob_key[MAX_REC_LENGTH];
|
|
static uchar blob_record[MAX_REC_LENGTH+20*20];
|
|
|
|
|
|
static void create_record(uchar *record,uint rownr)
|
|
{
|
|
uchar *pos;
|
|
bzero((char*) record,MAX_REC_LENGTH);
|
|
record[0]=1; /* delete marker */
|
|
if (rownr == 0 && keyinfo[0].seg[0].null_bit)
|
|
record[0]|=keyinfo[0].seg[0].null_bit; /* Null key */
|
|
|
|
pos=record+1;
|
|
if (recinfo[0].type == FIELD_BLOB)
|
|
{
|
|
uint tmp;
|
|
uchar *ptr;
|
|
create_key_part(blob_key,rownr);
|
|
tmp=strlen((char*) blob_key);
|
|
int4store(pos,tmp);
|
|
ptr=blob_key;
|
|
memcpy_fixed(pos+4,&ptr,sizeof(char*));
|
|
pos+=recinfo[0].length;
|
|
}
|
|
else if (recinfo[0].type == FIELD_VARCHAR)
|
|
{
|
|
uint tmp, pack_length= HA_VARCHAR_PACKLENGTH(recinfo[0].length-1);
|
|
create_key_part(pos+pack_length,rownr);
|
|
tmp= strlen((char*) pos+pack_length);
|
|
if (pack_length == 1)
|
|
*(uchar*) pos= (uchar) tmp;
|
|
else
|
|
int2store(pos,tmp);
|
|
pos+= recinfo[0].length;
|
|
}
|
|
else
|
|
{
|
|
create_key_part(pos,rownr);
|
|
pos+=recinfo[0].length;
|
|
}
|
|
if (recinfo[1].type == FIELD_BLOB)
|
|
{
|
|
uint tmp;
|
|
uchar *ptr;;
|
|
sprintf((char*) blob_record,"... row: %d", rownr);
|
|
strappend((char*) blob_record,max(MAX_REC_LENGTH-rownr,10),' ');
|
|
tmp=strlen((char*) blob_record);
|
|
int4store(pos,tmp);
|
|
ptr=blob_record;
|
|
memcpy_fixed(pos+4,&ptr,sizeof(char*));
|
|
}
|
|
else if (recinfo[1].type == FIELD_VARCHAR)
|
|
{
|
|
uint tmp, pack_length= HA_VARCHAR_PACKLENGTH(recinfo[1].length-1);
|
|
sprintf((char*) pos+pack_length, "... row: %d", rownr);
|
|
tmp= strlen((char*) pos+pack_length);
|
|
if (pack_length == 1)
|
|
*pos= (uchar) tmp;
|
|
else
|
|
int2store(pos,tmp);
|
|
}
|
|
else
|
|
{
|
|
sprintf((char*) pos,"... row: %d", rownr);
|
|
strappend((char*) pos,recinfo[1].length,' ');
|
|
}
|
|
}
|
|
|
|
/* change row to test re-packing of rows and reallocation of keys */
|
|
|
|
static void update_record(uchar *record)
|
|
{
|
|
uchar *pos=record+1;
|
|
if (recinfo[0].type == FIELD_BLOB)
|
|
{
|
|
uchar *column,*ptr;
|
|
int length;
|
|
length=uint4korr(pos); /* Long blob */
|
|
memcpy_fixed(&column,pos+4,sizeof(char*));
|
|
memcpy(blob_key,column,length); /* Move old key */
|
|
ptr=blob_key;
|
|
memcpy_fixed(pos+4,&ptr,sizeof(char*)); /* Store pointer to new key */
|
|
if (keyinfo[0].seg[0].type != HA_KEYTYPE_NUM)
|
|
default_charset_info->cset->casedn(default_charset_info,
|
|
(char*) blob_key, length,
|
|
(char*) blob_key, length);
|
|
pos+=recinfo[0].length;
|
|
}
|
|
else if (recinfo[0].type == FIELD_VARCHAR)
|
|
{
|
|
uint pack_length= HA_VARCHAR_PACKLENGTH(recinfo[0].length-1);
|
|
uint length= pack_length == 1 ? (uint) *(uchar*) pos : uint2korr(pos);
|
|
default_charset_info->cset->casedn(default_charset_info,
|
|
(char*) pos + pack_length, length,
|
|
(char*) pos + pack_length, length);
|
|
pos+=recinfo[0].length;
|
|
}
|
|
else
|
|
{
|
|
if (keyinfo[0].seg[0].type != HA_KEYTYPE_NUM)
|
|
default_charset_info->cset->casedn(default_charset_info,
|
|
(char*) pos, keyinfo[0].seg[0].length,
|
|
(char*) pos, keyinfo[0].seg[0].length);
|
|
pos+=recinfo[0].length;
|
|
}
|
|
|
|
if (recinfo[1].type == FIELD_BLOB)
|
|
{
|
|
uchar *column;
|
|
int length;
|
|
length=uint4korr(pos);
|
|
memcpy_fixed(&column,pos+4,sizeof(char*));
|
|
memcpy(blob_record,column,length);
|
|
bfill(blob_record+length,20,'.'); /* Make it larger */
|
|
length+=20;
|
|
int4store(pos,length);
|
|
column=blob_record;
|
|
memcpy_fixed(pos+4,&column,sizeof(char*));
|
|
}
|
|
else if (recinfo[1].type == FIELD_VARCHAR)
|
|
{
|
|
/* Second field is longer than 10 characters */
|
|
uint pack_length= HA_VARCHAR_PACKLENGTH(recinfo[1].length-1);
|
|
uint length= pack_length == 1 ? (uint) *(uchar*) pos : uint2korr(pos);
|
|
pos= record+ recinfo[1].offset;
|
|
bfill(pos+pack_length+length,recinfo[1].length-length-pack_length,'.');
|
|
length=recinfo[1].length-pack_length;
|
|
if (pack_length == 1)
|
|
*(uchar*) pos= (uchar) length;
|
|
else
|
|
int2store(pos,length);
|
|
}
|
|
else
|
|
{
|
|
bfill(pos+recinfo[1].length-10,10,'.');
|
|
}
|
|
}
|
|
|
|
|
|
static struct my_option my_long_options[] =
|
|
{
|
|
{"checkpoint", 'H', "Checkpoint at specified stage", (uchar**) &checkpoint,
|
|
(uchar**) &checkpoint, 0, GET_INT, REQUIRED_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"checksum", 'c', "Undocumented",
|
|
0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
#ifndef DBUG_OFF
|
|
{"debug", '#', "Undocumented",
|
|
0, 0, 0, GET_STR, REQUIRED_ARG, 0, 0, 0, 0, 0, 0},
|
|
#endif
|
|
{"delete-rows", 'd', "Abort after this many rows has been deleted",
|
|
(uchar**) &remove_count, (uchar**) &remove_count, 0, GET_UINT, REQUIRED_ARG,
|
|
1000, 0, 0, 0, 0, 0},
|
|
{"help", '?', "Display help and exit",
|
|
0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"insert-rows", 'i', "Undocumented", (uchar**) &insert_count,
|
|
(uchar**) &insert_count, 0, GET_UINT, REQUIRED_ARG, 1000, 0, 0, 0, 0, 0},
|
|
{"key-alpha", 'a', "Use a key of type HA_KEYTYPE_TEXT",
|
|
0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"key-binary-pack", 'B', "Undocumented",
|
|
0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"key-blob", 'b', "Undocumented",
|
|
(uchar**) &blob_length, (uchar**) &blob_length,
|
|
0, GET_ULONG, OPT_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"key-cache", 'K', "Undocumented", (uchar**) &pagecacheing,
|
|
(uchar**) &pagecacheing, 0, GET_BOOL, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"key-length", 'k', "Undocumented", (uchar**) &key_length,
|
|
(uchar**) &key_length, 0, GET_UINT, REQUIRED_ARG, 6, 0, 0, 0, 0, 0},
|
|
{"key-multiple", 'm', "Don't use unique keys",
|
|
0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"key-prefix_pack", 'P', "Undocumented",
|
|
0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"key-space_pack", 'p', "Undocumented",
|
|
0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"key-varchar", 'w', "Test VARCHAR keys",
|
|
0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"null-fields", 'N', "Define fields with NULL",
|
|
(uchar**) &null_fields, (uchar**) &null_fields, 0, GET_BOOL, NO_ARG,
|
|
0, 0, 0, 0, 0, 0},
|
|
{"row-fixed-size", 'S', "Fixed size records",
|
|
0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"rows-in-block", 'M', "Store rows in block format",
|
|
0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"row-pointer-size", 'R', "Undocumented", (uchar**) &rec_pointer_size,
|
|
(uchar**) &rec_pointer_size, 0, GET_INT, REQUIRED_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"silent", 's', "Undocumented",
|
|
(uchar**) &silent, (uchar**) &silent, 0, GET_BOOL, NO_ARG, 0, 0, 0, 0,
|
|
0, 0},
|
|
{"skip-delete", 'D', "Don't test deletes", (uchar**) &skip_delete,
|
|
(uchar**) &skip_delete, 0, GET_BOOL, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"skip-update", 'U', "Don't test updates", (uchar**) &skip_update,
|
|
(uchar**) &skip_update, 0, GET_BOOL, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"testflag", 't', "Stop test at specified stage", (uchar**) &testflag,
|
|
(uchar**) &testflag, 0, GET_INT, REQUIRED_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"test-undo", 'A',
|
|
"Abort hard. Used for testing recovery with undo",
|
|
(uchar**) &die_in_middle_of_transaction,
|
|
(uchar**) &die_in_middle_of_transaction,
|
|
0, GET_INT, REQUIRED_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"transactional", 'T',
|
|
"Test in transactional mode. (Only works with block format)",
|
|
(uchar**) &transactional, (uchar**) &transactional, 0, GET_BOOL, NO_ARG,
|
|
0, 0, 0, 0, 0, 0},
|
|
{"unique", 'E', "Check unique handling", (uchar**) &opt_unique,
|
|
(uchar**) &opt_unique, 0, GET_BOOL, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"update-rows", 'u', "Max number of rows to update", (uchar**) &update_count,
|
|
(uchar**) &update_count, 0, GET_UINT, REQUIRED_ARG, 1000, 0, 0, 0, 0, 0},
|
|
{"verbose", 'v', "Be more verbose", (uchar**) &verbose,
|
|
(uchar**) &verbose, 0, GET_BOOL, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"version", 'V', "Print version number and exit",
|
|
0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{"versioning", 'C', "Use row versioning (only works with block format)",
|
|
(uchar**) &opt_versioning, (uchar**) &opt_versioning, 0, GET_BOOL,
|
|
NO_ARG, 0, 0, 0, 0, 0, 0},
|
|
{ 0, 0, 0, 0, 0, 0, GET_NO_ARG, NO_ARG, 0, 0, 0, 0, 0, 0}
|
|
};
|
|
|
|
|
|
static my_bool
|
|
get_one_option(int optid, const struct my_option *opt __attribute__((unused)),
|
|
char *argument __attribute__((unused)))
|
|
{
|
|
switch(optid) {
|
|
case 'a':
|
|
key_type= HA_KEYTYPE_TEXT;
|
|
break;
|
|
case 'c':
|
|
create_flag|= HA_CREATE_CHECKSUM | HA_CREATE_PAGE_CHECKSUM;
|
|
break;
|
|
case 'R': /* Length of record pointer */
|
|
if (rec_pointer_size > 3)
|
|
rec_pointer_size=0;
|
|
break;
|
|
case 'P':
|
|
pack_keys= HA_PACK_KEY; /* Use prefix compression */
|
|
break;
|
|
case 'B':
|
|
pack_keys= HA_BINARY_PACK_KEY; /* Use binary compression */
|
|
break;
|
|
case 'M':
|
|
record_type= BLOCK_RECORD;
|
|
break;
|
|
case 'S':
|
|
if (key_field == FIELD_VARCHAR)
|
|
{
|
|
create_flag=0; /* Static sized varchar */
|
|
record_type= STATIC_RECORD;
|
|
}
|
|
else if (key_field != FIELD_BLOB)
|
|
{
|
|
key_field=FIELD_NORMAL; /* static-size record */
|
|
extra_field=FIELD_NORMAL;
|
|
record_type= STATIC_RECORD;
|
|
}
|
|
break;
|
|
case 'p':
|
|
pack_keys=HA_PACK_KEY; /* Use prefix + space packing */
|
|
pack_seg=HA_SPACE_PACK;
|
|
key_type=HA_KEYTYPE_TEXT;
|
|
break;
|
|
case 'm':
|
|
unique_key=0;
|
|
break;
|
|
case 'b':
|
|
key_field=FIELD_BLOB; /* blob key */
|
|
extra_field= FIELD_BLOB;
|
|
pack_seg|= HA_BLOB_PART;
|
|
key_type= HA_KEYTYPE_VARTEXT1;
|
|
if (record_type == STATIC_RECORD)
|
|
record_type= DYNAMIC_RECORD;
|
|
break;
|
|
case 'k':
|
|
if (key_length < 4 || key_length > HA_MAX_KEY_LENGTH)
|
|
{
|
|
fprintf(stderr,"Wrong key length\n");
|
|
exit(1);
|
|
}
|
|
break;
|
|
case 'w':
|
|
key_field=FIELD_VARCHAR; /* varchar keys */
|
|
extra_field= FIELD_VARCHAR;
|
|
key_type= HA_KEYTYPE_VARTEXT1;
|
|
pack_seg|= HA_VAR_LENGTH_PART;
|
|
if (record_type == STATIC_RECORD)
|
|
record_type= DYNAMIC_RECORD;
|
|
break;
|
|
case 'K': /* Use key cacheing */
|
|
pagecacheing=1;
|
|
break;
|
|
case 'V':
|
|
printf("test1 Ver 1.2 \n");
|
|
exit(0);
|
|
case '#':
|
|
DBUG_PUSH(argument);
|
|
break;
|
|
case '?':
|
|
usage();
|
|
exit(1);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
/* Read options */
|
|
|
|
static void get_options(int argc, char *argv[])
|
|
{
|
|
int ho_error;
|
|
|
|
if ((ho_error=handle_options(&argc, &argv, my_long_options, get_one_option)))
|
|
exit(ho_error);
|
|
if (transactional)
|
|
record_type= BLOCK_RECORD;
|
|
return;
|
|
} /* get options */
|
|
|
|
|
|
static void usage()
|
|
{
|
|
printf("Usage: %s [options]\n\n", my_progname);
|
|
my_print_help(my_long_options);
|
|
my_print_variables(my_long_options);
|
|
}
|