mirror of
https://github.com/MariaDB/server.git
synced 2025-10-31 02:46:29 +01:00
154 lines
4.4 KiB
C++
154 lines
4.4 KiB
C++
/*****************************************************************************
|
|
|
|
Copyright (c) 1994, 2015, Oracle and/or its affiliates. All Rights Reserved.
|
|
Copyright (c) 2018, 2020, 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/ha0ha.ic
|
|
The hash table interface for the adaptive hash index
|
|
|
|
Created 8/18/1994 Heikki Tuuri
|
|
*************************************************************************/
|
|
|
|
#ifdef BTR_CUR_HASH_ADAPT
|
|
#include "btr0types.h"
|
|
|
|
/******************************************************************//**
|
|
Gets a hash node data.
|
|
@return pointer to the data */
|
|
UNIV_INLINE
|
|
const rec_t*
|
|
ha_node_get_data(
|
|
/*=============*/
|
|
const ha_node_t* node) /*!< in: hash chain node */
|
|
{
|
|
return(node->data);
|
|
}
|
|
|
|
/******************************************************************//**
|
|
Sets hash node data. */
|
|
UNIV_INLINE
|
|
void
|
|
ha_node_set_data_func(
|
|
/*==================*/
|
|
ha_node_t* node, /*!< in: hash chain node */
|
|
#if defined UNIV_AHI_DEBUG || defined UNIV_DEBUG
|
|
buf_block_t* block, /*!< in: buffer block containing the data */
|
|
#endif /* UNIV_AHI_DEBUG || UNIV_DEBUG */
|
|
const rec_t* data) /*!< in: pointer to the data */
|
|
{
|
|
#if defined UNIV_AHI_DEBUG || defined UNIV_DEBUG
|
|
node->block = block;
|
|
#endif /* UNIV_AHI_DEBUG || UNIV_DEBUG */
|
|
node->data = data;
|
|
}
|
|
|
|
#if defined UNIV_AHI_DEBUG || defined UNIV_DEBUG
|
|
/** Sets hash node data.
|
|
@param n in: hash chain node
|
|
@param b in: buffer block containing the data
|
|
@param d in: pointer to the data */
|
|
# define ha_node_set_data(n,b,d) ha_node_set_data_func(n,b,d)
|
|
#else /* UNIV_AHI_DEBUG || UNIV_DEBUG */
|
|
/** Sets hash node data.
|
|
@param n in: hash chain node
|
|
@param b in: buffer block containing the data
|
|
@param d in: pointer to the data */
|
|
# define ha_node_set_data(n,b,d) ha_node_set_data_func(n,d)
|
|
#endif /* UNIV_AHI_DEBUG || UNIV_DEBUG */
|
|
|
|
/******************************************************************//**
|
|
Gets the next node in a hash chain.
|
|
@return next node, NULL if none */
|
|
UNIV_INLINE
|
|
ha_node_t*
|
|
ha_chain_get_next(
|
|
/*==============*/
|
|
const ha_node_t* node) /*!< in: hash chain node */
|
|
{
|
|
return(node->next);
|
|
}
|
|
|
|
/******************************************************************//**
|
|
Gets the first node in a hash chain.
|
|
@return first node, NULL if none */
|
|
UNIV_INLINE
|
|
ha_node_t*
|
|
ha_chain_get_first(
|
|
/*===============*/
|
|
hash_table_t* table, /*!< in: hash table */
|
|
ulint fold) /*!< in: fold value determining the chain */
|
|
{
|
|
return static_cast<ha_node_t*>(table->array[table->calc_hash(fold)].node);
|
|
}
|
|
|
|
/*************************************************************//**
|
|
Looks for an element in a hash table.
|
|
@return pointer to the data of the first hash table node in chain
|
|
having the fold number, NULL if not found */
|
|
UNIV_INLINE
|
|
const rec_t*
|
|
ha_search_and_get_data(
|
|
/*===================*/
|
|
hash_table_t* table, /*!< in: hash table */
|
|
ulint fold) /*!< in: folded value of the searched data */
|
|
{
|
|
ut_ad(btr_search_enabled);
|
|
|
|
for (const ha_node_t* node = ha_chain_get_first(table, fold);
|
|
node != NULL;
|
|
node = ha_chain_get_next(node)) {
|
|
|
|
if (node->fold == fold) {
|
|
|
|
return(node->data);
|
|
}
|
|
}
|
|
|
|
return(NULL);
|
|
}
|
|
|
|
/*********************************************************//**
|
|
Looks for an element when we know the pointer to the data.
|
|
@return pointer to the hash table node, NULL if not found in the table */
|
|
UNIV_INLINE
|
|
ha_node_t*
|
|
ha_search_with_data(
|
|
/*================*/
|
|
hash_table_t* table, /*!< in: hash table */
|
|
ulint fold, /*!< in: folded value of the searched data */
|
|
const rec_t* data) /*!< in: pointer to the data */
|
|
{
|
|
ha_node_t* node;
|
|
|
|
ut_ad(btr_search_enabled);
|
|
|
|
node = ha_chain_get_first(table, fold);
|
|
|
|
while (node) {
|
|
if (node->data == data) {
|
|
|
|
return(node);
|
|
}
|
|
|
|
node = ha_chain_get_next(node);
|
|
}
|
|
|
|
return(NULL);
|
|
}
|
|
|
|
#endif /* BTR_CUR_HASH_ADAPT */
|