56#
if defined UNIV_AHI_DEBUG || defined UNIV_DEBUG
61#if defined UNIV_AHI_DEBUG || defined UNIV_DEBUG
69# define ha_search_and_update_if_found(table,fold,data,new_block,new_data) \
70 ha_search_and_update_if_found_func(table,fold,data,new_block,new_data)
79# define ha_search_and_update_if_found(table,fold,data,new_block,new_data) \
80 ha_search_and_update_if_found_func(table,fold,data,new_data)
105# define ha_create(n_c,n_m,level) ha_create_func(n_c,level,n_m)
114# define ha_create(n_c,n_m,level) ha_create_func(n_c,n_m)
123 hash_table_t* table);
139#
if defined UNIV_AHI_DEBUG || defined UNIV_DEBUG
144#if defined UNIV_AHI_DEBUG || defined UNIV_DEBUG
154# define ha_insert_for_fold(t,f,b,d) ha_insert_for_fold_func(t,f,b,d)
165# define ha_insert_for_fold(t,f,b,d) ha_insert_for_fold_func(t,f,d)
179#ifndef UNIV_HOTBACKUP
190#if defined UNIV_AHI_DEBUG || defined UNIV_DEBUG
209 hash_table_t* table);
218#if defined UNIV_AHI_DEBUG || defined UNIV_DEBUG
225#ifndef UNIV_HOTBACKUP
230# define ASSERT_HASH_MUTEX_OWN(table, fold) \
231 ut_ad(!(table)->mutexes || mutex_own(hash_get_mutex(table, fold)))
237# define ASSERT_HASH_MUTEX_OWN(table, fold) ((void) 0)
struct buf_block_struct buf_block_t
UNIV_INTERN ibool ha_insert_for_fold_func(hash_table_t *table, ulint fold, void *data)
struct ha_node_struct ha_node_t
UNIV_INTERN void ha_print_info(FILE *file, hash_table_t *table)
UNIV_INLINE ibool ha_search_and_delete_if_found(hash_table_t *table, ulint fold, void *data)
UNIV_INTERN hash_table_t * ha_create_func(ulint n, ulint n_mutexes)
UNIV_INTERN void ha_remove_all_nodes_to_page(hash_table_t *table, ulint fold, const page_t *page)
UNIV_INTERN void ha_clear(hash_table_t *table)
UNIV_INLINE void * ha_search_and_get_data(hash_table_t *table, ulint fold)
UNIV_INTERN void ha_search_and_update_if_found_func(hash_table_t *table, ulint fold, void *data, void *new_data)