summaryrefslogtreecommitdiff
path: root/innobase/include
diff options
context:
space:
mode:
authorunknown <marko@hundin.mysql.fi>2004-03-31 10:58:50 +0300
committerunknown <marko@hundin.mysql.fi>2004-03-31 10:58:50 +0300
commit19b727adac9eb98dc10b09437965352b33cb42dc (patch)
tree19db31d7dd0efe88397a0cab75851aaf30a60584 /innobase/include
parent4050e916c99293b0e0c6ada33054d2cbbcb0efba (diff)
downloadmariadb-git-19b727adac9eb98dc10b09437965352b33cb42dc.tar.gz
InnoDB: Remove unused hash table code and parameters
innobase/ha/ha0ha.c: Remove unused first parameter of ha_chain_get_next() innobase/include/ha0ha.ic: Remove unused first parameter of ha_chain_get_next() Remove unused function ha_next()
Diffstat (limited to 'innobase/include')
-rw-r--r--innobase/include/ha0ha.ic43
1 files changed, 3 insertions, 40 deletions
diff --git a/innobase/include/ha0ha.ic b/innobase/include/ha0ha.ic
index f6faf84b9f5..2f02f6bdb4e 100644
--- a/innobase/include/ha0ha.ic
+++ b/innobase/include/ha0ha.ic
@@ -49,11 +49,8 @@ ha_node_t*
ha_chain_get_next(
/*==============*/
/* out: next node, NULL if none */
- hash_table_t* table __attribute__((unused)), /* in: hash table */
ha_node_t* node) /* in: hash chain node */
{
- ut_ad(table);
-
return(node->next);
}
@@ -96,7 +93,7 @@ ha_search(
return(node);
}
- node = ha_chain_get_next(table, node);
+ node = ha_chain_get_next(node);
}
return(NULL);
@@ -128,41 +125,7 @@ ha_search_and_get_data(
return(node->data);
}
- node = ha_chain_get_next(table, node);
- }
-
- return(NULL);
-}
-
-/*****************************************************************
-Returns the next matching hash table node in chain. */
-UNIV_INLINE
-ha_node_t*
-ha_next(
-/*====*/
- /* out: pointer to the next hash table node
- in chain with the fold value, NULL if not
- found */
- hash_table_t* table, /* in: hash table */
- ha_node_t* node) /* in: hash table node */
-{
- ulint fold;
-
- fold = node->fold;
-
-#ifdef UNIV_SYNC_DEBUG
- ut_ad(!table->mutexes || mutex_own(hash_get_mutex(table, fold)));
-#endif /* UNIV_SYNC_DEBUG */
-
- node = ha_chain_get_next(table, node);
-
- while (node) {
- if (node->fold == fold) {
-
- return(node);
- }
-
- node = ha_chain_get_next(table, node);
+ node = ha_chain_get_next(node);
}
return(NULL);
@@ -194,7 +157,7 @@ ha_search_with_data(
return(node);
}
- node = ha_chain_get_next(table, node);
+ node = ha_chain_get_next(node);
}
return(NULL);