110 const dtuple_t* tuple,
114 ulint has_search_latch,
133 dict_index_t* index);
184#if defined UNIV_AHI_DEBUG || defined UNIV_DEBUG
190btr_search_validate(
void);
193# define btr_search_validate() TRUE
198extern bool btr_search_enabled;
204extern ibool btr_search_fully_disabled;
246#ifdef UNIV_SEARCH_PERF_STAT
257# define BTR_SEARCH_MAGIC_N 1112765
287extern rw_lock_t* btr_search_latch_temp;
290#define btr_search_latch (*btr_search_latch_temp)
292#ifdef UNIV_SEARCH_PERF_STAT
294extern ulint btr_search_n_succ;
296extern ulint btr_search_n_hash_fail;
302#define BTR_SEARCH_HASH_ANALYSIS 17
306#define BTR_SEARCH_ON_PATTERN_LIMIT 3
310#define BTR_SEARCH_ON_HASH_LIMIT 3
315#define BTR_SEA_TIMEOUT 10000
UNIV_INTERN btr_search_t * btr_search_info_create(mem_heap_t *heap)
UNIV_INTERN void btr_search_enable(void)
UNIV_INLINE btr_search_t * btr_search_get_info(dict_index_t *index)
UNIV_INTERN void btr_search_update_hash_on_delete(btr_cur_t *cursor)
UNIV_INLINE void btr_search_info_update(dict_index_t *index, btr_cur_t *cursor)
UNIV_INTERN ibool btr_search_guess_on_hash(dict_index_t *index, btr_search_t *info, const dtuple_t *tuple, ulint mode, ulint latch_mode, btr_cur_t *cursor, ulint has_search_latch, mtr_t *mtr)
UNIV_INTERN void btr_search_move_or_delete_hash_entries(buf_block_t *new_block, buf_block_t *block, dict_index_t *index)
struct btr_search_sys_struct btr_search_sys_t
UNIV_INTERN void btr_search_disable(void)
UNIV_INTERN void btr_search_update_hash_on_insert(btr_cur_t *cursor)
UNIV_INTERN void btr_search_drop_page_hash_index(buf_block_t *block)
UNIV_INTERN ulint btr_search_info_get_ref_count(btr_search_t *info)
UNIV_INTERN void btr_search_sys_free(void)
UNIV_INTERN void btr_search_update_hash_node_on_insert(btr_cur_t *cursor)
UNIV_INTERN void btr_search_drop_page_hash_when_freed(ulint space, ulint zip_size, ulint page_no)
UNIV_INTERN void btr_search_sys_create(ulint hash_size)
struct btr_search_struct btr_search_t
struct btr_cur_struct btr_cur_t
struct buf_block_struct buf_block_t
hash_table_t * hash_index