mirror of
https://github.com/MariaDB/server.git
synced 2025-01-28 17:54:16 +01:00
c7f8cfc9e7
Reason: ======= Race condition between btr_search_drop_hash_index() and btr_search_lazy_free(). One thread does resizing of buffer pool and clears the ahi on all pages in the buffer pool, frees the index and table while removing the last reference. At the same time, other thread access index->heap in btr_search_drop_hash_index(). Solution: ========= Acquire the respective ahi latch before checking index->freed() btr_search_drop_page_hash_index(): Added new parameter to indicate that drop ahi entries only if the index is marked as freed btr_search_check_marked_free_index(): Acquire all ahi latches and return true if the index was freed
117 lines
3.3 KiB
C++
117 lines
3.3 KiB
C++
/*****************************************************************************
|
|
|
|
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 */
|