mirror of
https://github.com/MariaDB/server.git
synced 2025-11-18 03:36:16 +01:00
1bd681c8b3
This is a complete rewrite of DROP TABLE, also as part of other DDL, such as ALTER TABLE, CREATE TABLE...SELECT, TRUNCATE TABLE. The background DROP TABLE queue hack is removed. If a transaction needs to drop and create a table by the same name (like TRUNCATE TABLE does), it must first rename the table to an internal #sql-ib name. No committed version of the data dictionary will include any #sql-ib tables, because whenever a transaction renames a table to a #sql-ib name, it will also drop that table. Either the rename will be rolled back, or the drop will be committed. Data files will be unlinked after the transaction has been committed and a FILE_RENAME record has been durably written. The file will actually be deleted when the detached file handle returned by fil_delete_tablespace() will be closed, after the latches have been released. It is possible that a purge of the delete of the SYS_INDEXES record for the clustered index will execute fil_delete_tablespace() concurrently with the DDL transaction. In that case, the thread that arrives later will wait for the other thread to finish. HTON_TRUNCATE_REQUIRES_EXCLUSIVE_USE: A new handler flag. ha_innobase::truncate() now requires that all other references to the table be released in advance. This was implemented by Monty. ha_innobase::delete_table(): If CREATE TABLE..SELECT is detected, we will "hijack" the current transaction, drop the table in the current transaction and commit the current transaction. This essentially fixes MDEV-21602. There is a FIXME comment about making the check less failure-prone. ha_innobase::truncate(), ha_innobase::delete_table(): Implement a fast path for temporary tables. We will no longer allow temporary tables to use the adaptive hash index. dict_table_t::mdl_name: The original table name for the purpose of acquiring MDL in purge, to prevent a race condition between a DDL transaction that is dropping a table, and purge processing undo log records of DML that had executed before the DDL operation. For #sql-backup- tables during ALTER TABLE...ALGORITHM=COPY, the dict_table_t::mdl_name will differ from dict_table_t::name. dict_table_t::parse_name(): Use mdl_name instead of name. dict_table_rename_in_cache(): Update mdl_name. For the internal FTS_ tables of FULLTEXT INDEX, purge would acquire MDL on the FTS_ table name, but not on the main table, and therefore it would be able to run concurrently with a DDL transaction that is dropping the table. Previously, the DROP TABLE queue hack prevented a race between purge and DDL. For now, we introduce purge_sys.stop_FTS() to prevent purge from opening any table, while a DDL transaction that may drop FTS_ tables is in progress. The function fts_lock_table(), which will be invoked before the dictionary is locked, will wait for purge to release any table handles. trx_t::drop_table_statistics(): Drop statistics for the table. This replaces dict_stats_drop_index(). We will drop or rename persistent statistics atomically as part of DDL transactions. On lock conflict for dropping statistics, we will fail instantly with DB_LOCK_WAIT_TIMEOUT, because we will be holding the exclusive data dictionary latch. trx_t::commit_cleanup(): Separated from trx_t::commit_in_memory(). Relax an assertion around fts_commit() and allow DB_LOCK_WAIT_TIMEOUT in addition to DB_DUPLICATE_KEY. The call to fts_commit() is entirely misplaced here and may obviously break the consistency of transactions that affect FULLTEXT INDEX. It needs to be fixed separately. dict_table_t::n_foreign_key_checks_running: Remove (MDEV-21175). The counter was a work-around for missing meta-data locking (MDL) on the SQL layer, and not really needed in MariaDB. ER_TABLE_IN_FK_CHECK: Replaced with ER_UNUSED_28. HA_ERR_TABLE_IN_FK_CHECK: Remove. row_ins_check_foreign_constraints(): Do not acquire dict_sys.latch either. The SQL-layer MDL will protect us. This was reviewed by Thirunarayanan Balathandayuthapani and tested by Matthias Leich.
117 lines
3.3 KiB
Text
117 lines
3.3 KiB
Text
/*****************************************************************************
|
|
|
|
Copyright (c) 1996, 2015, Oracle and/or its affiliates. All Rights Reserved.
|
|
Copyright (c) 2018, 2021, MariaDB Corporation.
|
|
|
|
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.,
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1335 USA
|
|
|
|
*****************************************************************************/
|
|
|
|
/********************************************************************//**
|
|
@file include/btr0sea.ic
|
|
The index tree adaptive search
|
|
|
|
Created 2/17/1996 Heikki Tuuri
|
|
*************************************************************************/
|
|
|
|
#include "dict0mem.h"
|
|
#include "btr0cur.h"
|
|
#include "buf0buf.h"
|
|
|
|
/** Create and initialize search info.
|
|
@param[in,out] heap heap where created
|
|
@return own: search info struct */
|
|
static inline btr_search_t* btr_search_info_create(mem_heap_t* heap)
|
|
{
|
|
btr_search_t* info = static_cast<btr_search_t*>(
|
|
mem_heap_zalloc(heap, sizeof(btr_search_t)));
|
|
ut_d(info->magic_n = BTR_SEARCH_MAGIC_N);
|
|
#ifdef BTR_CUR_HASH_ADAPT
|
|
info->n_fields = 1;
|
|
info->left_side = TRUE;
|
|
#endif /* BTR_CUR_HASH_ADAPT */
|
|
return(info);
|
|
}
|
|
|
|
#ifdef BTR_CUR_HASH_ADAPT
|
|
/** Updates the search info.
|
|
@param[in,out] info search info
|
|
@param[in,out] cursor cursor which was just positioned */
|
|
void btr_search_info_update_slow(btr_search_t *info, btr_cur_t *cursor);
|
|
|
|
/*********************************************************************//**
|
|
Updates the search info. */
|
|
static inline
|
|
void
|
|
btr_search_info_update(
|
|
/*===================*/
|
|
dict_index_t* index, /*!< in: index of the cursor */
|
|
btr_cur_t* cursor) /*!< in: cursor which was just positioned */
|
|
{
|
|
ut_ad(!index->is_spatial());
|
|
ut_ad(!index->table->is_temporary());
|
|
|
|
if (!btr_search_enabled) {
|
|
return;
|
|
}
|
|
|
|
btr_search_t* info;
|
|
info = btr_search_get_info(index);
|
|
|
|
info->hash_analysis++;
|
|
|
|
if (info->hash_analysis < BTR_SEARCH_HASH_ANALYSIS) {
|
|
|
|
/* Do nothing */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
ut_ad(cursor->flag != BTR_CUR_HASH);
|
|
|
|
btr_search_info_update_slow(info, cursor);
|
|
}
|
|
|
|
/** Lock all search latches in exclusive mode. */
|
|
static inline void btr_search_x_lock_all()
|
|
{
|
|
for (ulint i = 0; i < btr_ahi_parts; ++i) {
|
|
btr_search_sys.parts[i].latch.wr_lock(SRW_LOCK_CALL);
|
|
}
|
|
}
|
|
|
|
/** Unlock all search latches from exclusive mode. */
|
|
static inline void btr_search_x_unlock_all()
|
|
{
|
|
for (ulint i = 0; i < btr_ahi_parts; ++i) {
|
|
btr_search_sys.parts[i].latch.wr_unlock();
|
|
}
|
|
}
|
|
|
|
/** Lock all search latches in shared mode. */
|
|
static inline void btr_search_s_lock_all()
|
|
{
|
|
for (ulint i = 0; i < btr_ahi_parts; ++i) {
|
|
btr_search_sys.parts[i].latch.rd_lock(SRW_LOCK_CALL);
|
|
}
|
|
}
|
|
|
|
/** Unlock all search latches from shared mode. */
|
|
static inline void btr_search_s_unlock_all()
|
|
{
|
|
for (ulint i = 0; i < btr_ahi_parts; ++i) {
|
|
btr_search_sys.parts[i].latch.rd_unlock();
|
|
}
|
|
}
|
|
#endif /* BTR_CUR_HASH_ADAPT */
|