114 ulint has_search_latch,
184 #if defined UNIV_AHI_DEBUG || defined UNIV_DEBUG
190 btr_search_validate(
void);
193 # define btr_search_validate() TRUE
246 #ifdef UNIV_SEARCH_PERF_STAT
257 # define BTR_SEARCH_MAGIC_N 1112765
290 #define btr_search_latch (*btr_search_latch_temp)
292 #ifdef UNIV_SEARCH_PERF_STAT
294 extern ulint btr_search_n_succ;
296 extern 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
318 #include "btr0sea.ic"
UNIV_INTERN void btr_search_drop_page_hash_when_freed(ulint space, ulint zip_size, ulint page_no)
UNIV_INTERN void btr_search_move_or_delete_hash_entries(buf_block_t *new_block, buf_block_t *block, dict_index_t *index)
UNIV_INTERN void btr_search_update_hash_on_delete(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)
btr_search_sys_t * btr_search_sys
UNIV_INLINE btr_search_t * btr_search_get_info(dict_index_t *index)
UNIV_INTERN void btr_search_sys_create(ulint hash_size)
UNIV_INTERN void btr_search_disable(void)
ibool btr_search_fully_disabled
UNIV_INTERN btr_search_t * btr_search_info_create(mem_heap_t *heap)
rw_lock_t * btr_search_latch_temp
The latch protecting the adaptive search system.
UNIV_INTERN void btr_search_sys_free(void)
UNIV_INTERN void btr_search_update_hash_on_insert(btr_cur_t *cursor)
hash_table_t * hash_index
UNIV_INLINE void btr_search_info_update(dict_index_t *index, btr_cur_t *cursor)
UNIV_INTERN void btr_search_drop_page_hash_index(buf_block_t *block)
UNIV_INTERN void btr_search_update_hash_node_on_insert(btr_cur_t *cursor)
UNIV_INTERN ulint btr_search_info_get_ref_count(btr_search_t *info)
UNIV_INTERN void btr_search_enable(void)