mirror of
https://github.com/MariaDB/server.git
synced 2025-01-17 20:42:30 +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
373 lines
11 KiB
C
373 lines
11 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 */
|
|
|
|
/* Written by Sergei A. Golubchik, who has a shared copyright to this code */
|
|
|
|
/* functions to work with full-text indices */
|
|
|
|
#include "ma_ftdefs.h"
|
|
#include <math.h>
|
|
|
|
void _ma_ft_segiterator_init(MARIA_HA *info, uint keynr, const uchar *record,
|
|
FT_SEG_ITERATOR *ftsi)
|
|
{
|
|
DBUG_ENTER("_ma_ft_segiterator_init");
|
|
|
|
ftsi->num=info->s->keyinfo[keynr].keysegs;
|
|
ftsi->seg=info->s->keyinfo[keynr].seg;
|
|
ftsi->rec=record;
|
|
DBUG_VOID_RETURN;
|
|
}
|
|
|
|
void _ma_ft_segiterator_dummy_init(const uchar *record, uint len,
|
|
FT_SEG_ITERATOR *ftsi)
|
|
{
|
|
DBUG_ENTER("_ma_ft_segiterator_dummy_init");
|
|
|
|
ftsi->num=1;
|
|
ftsi->seg=0;
|
|
ftsi->pos=record;
|
|
ftsi->len=len;
|
|
DBUG_VOID_RETURN;
|
|
}
|
|
|
|
/*
|
|
This function breaks convention "return 0 in success"
|
|
but it's easier to use like this
|
|
|
|
while(_ma_ft_segiterator())
|
|
|
|
so "1" means "OK", "0" means "EOF"
|
|
*/
|
|
|
|
uint _ma_ft_segiterator(register FT_SEG_ITERATOR *ftsi)
|
|
{
|
|
DBUG_ENTER("_ma_ft_segiterator");
|
|
|
|
if (!ftsi->num)
|
|
DBUG_RETURN(0);
|
|
|
|
ftsi->num--;
|
|
if (!ftsi->seg)
|
|
DBUG_RETURN(1);
|
|
|
|
ftsi->seg--;
|
|
|
|
if (ftsi->seg->null_bit &&
|
|
(ftsi->rec[ftsi->seg->null_pos] & ftsi->seg->null_bit))
|
|
{
|
|
ftsi->pos=0;
|
|
DBUG_RETURN(1);
|
|
}
|
|
ftsi->pos= ftsi->rec+ftsi->seg->start;
|
|
if (ftsi->seg->flag & HA_VAR_LENGTH_PART)
|
|
{
|
|
uint pack_length= (ftsi->seg->bit_start);
|
|
ftsi->len= (pack_length == 1 ? (uint) * ftsi->pos :
|
|
uint2korr(ftsi->pos));
|
|
ftsi->pos+= pack_length; /* Skip VARCHAR length */
|
|
DBUG_RETURN(1);
|
|
}
|
|
if (ftsi->seg->flag & HA_BLOB_PART)
|
|
{
|
|
ftsi->len= _ma_calc_blob_length(ftsi->seg->bit_start,ftsi->pos);
|
|
memcpy_fixed((char*) &ftsi->pos, ftsi->pos+ftsi->seg->bit_start,
|
|
sizeof(char*));
|
|
DBUG_RETURN(1);
|
|
}
|
|
ftsi->len=ftsi->seg->length;
|
|
DBUG_RETURN(1);
|
|
}
|
|
|
|
|
|
/* parses a document i.e. calls maria_ft_parse for every keyseg */
|
|
|
|
uint _ma_ft_parse(TREE *parsed, MARIA_HA *info, uint keynr, const uchar *record,
|
|
MYSQL_FTPARSER_PARAM *param, MEM_ROOT *mem_root)
|
|
{
|
|
FT_SEG_ITERATOR ftsi;
|
|
struct st_mysql_ftparser *parser;
|
|
DBUG_ENTER("_ma_ft_parse");
|
|
|
|
_ma_ft_segiterator_init(info, keynr, record, &ftsi);
|
|
|
|
maria_ft_parse_init(parsed, info->s->keyinfo[keynr].seg->charset);
|
|
parser= info->s->keyinfo[keynr].parser;
|
|
while (_ma_ft_segiterator(&ftsi))
|
|
{
|
|
/** @todo this casts ftsi.pos (const) to non-const */
|
|
if (ftsi.pos)
|
|
if (maria_ft_parse(parsed, (uchar *)ftsi.pos, ftsi.len, parser, param,
|
|
mem_root))
|
|
DBUG_RETURN(1);
|
|
}
|
|
DBUG_RETURN(0);
|
|
}
|
|
|
|
FT_WORD * _ma_ft_parserecord(MARIA_HA *info, uint keynr, const uchar *record,
|
|
MEM_ROOT *mem_root)
|
|
{
|
|
TREE ptree;
|
|
MYSQL_FTPARSER_PARAM *param;
|
|
DBUG_ENTER("_ma_ft_parserecord");
|
|
if (! (param= maria_ftparser_call_initializer(info, keynr, 0)))
|
|
DBUG_RETURN(NULL);
|
|
bzero((char*) &ptree, sizeof(ptree));
|
|
param->flags= 0;
|
|
if (_ma_ft_parse(&ptree, info, keynr, record, param, mem_root))
|
|
DBUG_RETURN(NULL);
|
|
|
|
DBUG_RETURN(maria_ft_linearize(&ptree, mem_root));
|
|
}
|
|
|
|
static int _ma_ft_store(MARIA_HA *info, uint keynr, uchar *keybuf,
|
|
FT_WORD *wlist, my_off_t filepos)
|
|
{
|
|
DBUG_ENTER("_ma_ft_store");
|
|
|
|
for (; wlist->pos; wlist++)
|
|
{
|
|
MARIA_KEY key;
|
|
_ma_ft_make_key(info, &key, keynr, keybuf, wlist, filepos);
|
|
if (_ma_ck_write(info, &key))
|
|
DBUG_RETURN(1);
|
|
}
|
|
DBUG_RETURN(0);
|
|
}
|
|
|
|
static int _ma_ft_erase(MARIA_HA *info, uint keynr, uchar *keybuf,
|
|
FT_WORD *wlist, my_off_t filepos)
|
|
{
|
|
uint err=0;
|
|
DBUG_ENTER("_ma_ft_erase");
|
|
|
|
for (; wlist->pos; wlist++)
|
|
{
|
|
MARIA_KEY key;
|
|
_ma_ft_make_key(info, &key, keynr, keybuf, wlist, filepos);
|
|
if (_ma_ck_delete(info, &key))
|
|
err=1;
|
|
}
|
|
DBUG_RETURN(err);
|
|
}
|
|
|
|
/*
|
|
Compares an appropriate parts of two WORD_KEY keys directly out of records
|
|
returns 1 if they are different
|
|
*/
|
|
|
|
#define THOSE_TWO_DAMN_KEYS_ARE_REALLY_DIFFERENT 1
|
|
#define GEE_THEY_ARE_ABSOLUTELY_IDENTICAL 0
|
|
|
|
int _ma_ft_cmp(MARIA_HA *info, uint keynr, const uchar *rec1, const uchar *rec2)
|
|
{
|
|
FT_SEG_ITERATOR ftsi1, ftsi2;
|
|
CHARSET_INFO *cs=info->s->keyinfo[keynr].seg->charset;
|
|
DBUG_ENTER("_ma_ft_cmp");
|
|
|
|
_ma_ft_segiterator_init(info, keynr, rec1, &ftsi1);
|
|
_ma_ft_segiterator_init(info, keynr, rec2, &ftsi2);
|
|
|
|
while (_ma_ft_segiterator(&ftsi1) && _ma_ft_segiterator(&ftsi2))
|
|
{
|
|
if ((ftsi1.pos != ftsi2.pos) &&
|
|
(!ftsi1.pos || !ftsi2.pos ||
|
|
ha_compare_text(cs, ftsi1.pos,ftsi1.len,
|
|
ftsi2.pos,ftsi2.len,0,0)))
|
|
DBUG_RETURN(THOSE_TWO_DAMN_KEYS_ARE_REALLY_DIFFERENT);
|
|
}
|
|
DBUG_RETURN(GEE_THEY_ARE_ABSOLUTELY_IDENTICAL);
|
|
}
|
|
|
|
|
|
/* update a document entry */
|
|
|
|
int _ma_ft_update(MARIA_HA *info, uint keynr, uchar *keybuf,
|
|
const uchar *oldrec, const uchar *newrec, my_off_t pos)
|
|
{
|
|
int error= -1;
|
|
FT_WORD *oldlist,*newlist, *old_word, *new_word;
|
|
CHARSET_INFO *cs=info->s->keyinfo[keynr].seg->charset;
|
|
int cmp, cmp2;
|
|
DBUG_ENTER("_ma_ft_update");
|
|
|
|
if (!(old_word=oldlist=_ma_ft_parserecord(info, keynr, oldrec,
|
|
&info->ft_memroot)) ||
|
|
!(new_word=newlist=_ma_ft_parserecord(info, keynr, newrec,
|
|
&info->ft_memroot)))
|
|
goto err;
|
|
|
|
error=0;
|
|
while(old_word->pos && new_word->pos)
|
|
{
|
|
cmp= ha_compare_text(cs, (uchar*) old_word->pos,old_word->len,
|
|
(uchar*) new_word->pos,new_word->len,0,0);
|
|
cmp2= cmp ? 0 : (fabs(old_word->weight - new_word->weight) > 1.e-5);
|
|
|
|
if (cmp < 0 || cmp2)
|
|
{
|
|
MARIA_KEY key;
|
|
_ma_ft_make_key(info, &key, keynr, keybuf, old_word, pos);
|
|
if ((error= _ma_ck_delete(info, &key)))
|
|
goto err;
|
|
}
|
|
if (cmp > 0 || cmp2)
|
|
{
|
|
MARIA_KEY key;
|
|
_ma_ft_make_key(info, &key, keynr, keybuf, new_word,pos);
|
|
if ((error= _ma_ck_write(info, &key)))
|
|
goto err;
|
|
}
|
|
if (cmp<=0) old_word++;
|
|
if (cmp>=0) new_word++;
|
|
}
|
|
if (old_word->pos)
|
|
error= _ma_ft_erase(info,keynr,keybuf,old_word,pos);
|
|
else if (new_word->pos)
|
|
error= _ma_ft_store(info,keynr,keybuf,new_word,pos);
|
|
|
|
err:
|
|
free_root(&info->ft_memroot, MYF(MY_MARK_BLOCKS_FREE));
|
|
DBUG_RETURN(error);
|
|
}
|
|
|
|
|
|
/* adds a document to the collection */
|
|
|
|
int _ma_ft_add(MARIA_HA *info, uint keynr, uchar *keybuf, const uchar *record,
|
|
my_off_t pos)
|
|
{
|
|
int error= -1;
|
|
FT_WORD *wlist;
|
|
DBUG_ENTER("_ma_ft_add");
|
|
DBUG_PRINT("enter",("keynr: %d",keynr));
|
|
|
|
if ((wlist= _ma_ft_parserecord(info, keynr, record, &info->ft_memroot)))
|
|
error= _ma_ft_store(info,keynr,keybuf,wlist,pos);
|
|
free_root(&info->ft_memroot, MYF(MY_MARK_BLOCKS_FREE));
|
|
DBUG_PRINT("exit",("Return: %d",error));
|
|
DBUG_RETURN(error);
|
|
}
|
|
|
|
|
|
/* removes a document from the collection */
|
|
|
|
int _ma_ft_del(MARIA_HA *info, uint keynr, uchar *keybuf, const uchar *record,
|
|
my_off_t pos)
|
|
{
|
|
int error= -1;
|
|
FT_WORD *wlist;
|
|
DBUG_ENTER("_ma_ft_del");
|
|
DBUG_PRINT("enter",("keynr: %d",keynr));
|
|
|
|
if ((wlist= _ma_ft_parserecord(info, keynr, record, &info->ft_memroot)))
|
|
error= _ma_ft_erase(info,keynr,keybuf,wlist,pos);
|
|
free_root(&info->ft_memroot, MYF(MY_MARK_BLOCKS_FREE));
|
|
DBUG_PRINT("exit",("Return: %d",error));
|
|
DBUG_RETURN(error);
|
|
}
|
|
|
|
|
|
MARIA_KEY *_ma_ft_make_key(MARIA_HA *info, MARIA_KEY *key, uint keynr,
|
|
uchar *keybuf,
|
|
FT_WORD *wptr, my_off_t filepos)
|
|
{
|
|
uchar buf[HA_FT_MAXBYTELEN+16];
|
|
DBUG_ENTER("_ma_ft_make_key");
|
|
|
|
#if HA_FT_WTYPE == HA_KEYTYPE_FLOAT
|
|
{
|
|
float weight=(float) ((filepos==HA_OFFSET_ERROR) ? 0 : wptr->weight);
|
|
mi_float4store(buf,weight);
|
|
}
|
|
#else
|
|
#error
|
|
#endif
|
|
|
|
int2store(buf+HA_FT_WLEN,wptr->len);
|
|
memcpy(buf+HA_FT_WLEN+2,wptr->pos,wptr->len);
|
|
/* Can't be spatial so it's ok to call _ma_make_key directly here */
|
|
DBUG_RETURN(_ma_make_key(info, key, keynr, keybuf, buf, filepos, 0));
|
|
}
|
|
|
|
|
|
/*
|
|
convert key value to ft2
|
|
*/
|
|
|
|
uint _ma_ft_convert_to_ft2(MARIA_HA *info, MARIA_KEY *key)
|
|
{
|
|
MARIA_SHARE *share= info->s;
|
|
my_off_t root;
|
|
DYNAMIC_ARRAY *da=info->ft1_to_ft2;
|
|
MARIA_KEYDEF *keyinfo=&share->ft2_keyinfo;
|
|
uchar *key_ptr= (uchar*) dynamic_array_ptr(da, 0), *end;
|
|
uint length, key_length;
|
|
MARIA_PINNED_PAGE tmp_page_link, *page_link= &tmp_page_link;
|
|
MARIA_KEY tmp_key;
|
|
DBUG_ENTER("_ma_ft_convert_to_ft2");
|
|
|
|
/* we'll generate one pageful at once, and insert the rest one-by-one */
|
|
/* calculating the length of this page ...*/
|
|
length=(keyinfo->block_length-2) / keyinfo->keylength;
|
|
set_if_smaller(length, da->elements);
|
|
length=length * keyinfo->keylength;
|
|
|
|
get_key_full_length_rdonly(key_length, key->data);
|
|
while (_ma_ck_delete(info, key) == 0)
|
|
{
|
|
/*
|
|
nothing to do here.
|
|
_ma_ck_delete() will populate info->ft1_to_ft2 with deleted keys
|
|
*/
|
|
}
|
|
|
|
/* creating pageful of keys */
|
|
bzero(info->buff, share->keypage_header);
|
|
_ma_store_keynr(share, info->buff, keyinfo->key_nr);
|
|
_ma_store_page_used(share, info->buff, length + share->keypage_header);
|
|
memcpy(info->buff + share->keypage_header, key_ptr, length);
|
|
info->keyread_buff_used= info->page_changed=1; /* info->buff is used */
|
|
/**
|
|
@todo RECOVERY BUG this is not logged yet. Ok as this code is never
|
|
called, but soon it will be.
|
|
*/
|
|
if ((root= _ma_new(info, DFLT_INIT_HITS, &page_link)) == HA_OFFSET_ERROR ||
|
|
_ma_write_keypage(info, keyinfo, root, page_link->write_lock,
|
|
DFLT_INIT_HITS, info->buff))
|
|
DBUG_RETURN(-1);
|
|
|
|
/* inserting the rest of key values */
|
|
end= (uchar*) dynamic_array_ptr(da, da->elements);
|
|
tmp_key.keyinfo= keyinfo;
|
|
tmp_key.data_length= keyinfo->keylength;
|
|
tmp_key.ref_length= 0;
|
|
tmp_key.flag= 0;
|
|
for (key_ptr+=length; key_ptr < end; key_ptr+=keyinfo->keylength)
|
|
{
|
|
tmp_key.data= key_ptr;
|
|
if (_ma_ck_real_write_btree(info, key, &root, SEARCH_SAME))
|
|
DBUG_RETURN(-1);
|
|
}
|
|
|
|
/* now, writing the word key entry */
|
|
ft_intXstore(key->data + key_length, - (int) da->elements);
|
|
_ma_dpointer(share, key->data + key_length + HA_FT_WLEN, root);
|
|
|
|
DBUG_RETURN(_ma_ck_real_write_btree(info, key,
|
|
&share->state.key_root[key->keyinfo->
|
|
key_nr],
|
|
SEARCH_SAME));
|
|
}
|