diff options
author | unknown <marko@hundin.mysql.fi> | 2004-12-08 14:34:58 +0200 |
---|---|---|
committer | unknown <marko@hundin.mysql.fi> | 2004-12-08 14:34:58 +0200 |
commit | 746799fb23aaef1705e9ee66de6a2cb77a8af2c8 (patch) | |
tree | 3e0b72bbe9244185a212519738dcdc9fedfad6fa /innobase/include/hash0hash.h | |
parent | ff2c115ba8f048a117f9b3d03bd16b5883087826 (diff) | |
download | mariadb-git-746799fb23aaef1705e9ee66de6a2cb77a8af2c8.tar.gz |
Cset exclude: heikki@hundin.mysql.fi|ChangeSet|20041027124510|04970
innobase/btr/btr0sea.c:
Exclude
innobase/buf/buf0buf.c:
Exclude
innobase/buf/buf0lru.c:
Exclude
innobase/ha/ha0ha.c:
Exclude
innobase/include/buf0buf.h:
Exclude
innobase/include/ha0ha.h:
Exclude
innobase/include/hash0hash.h:
Exclude
Diffstat (limited to 'innobase/include/hash0hash.h')
-rw-r--r-- | innobase/include/hash0hash.h | 18 |
1 files changed, 3 insertions, 15 deletions
diff --git a/innobase/include/hash0hash.h b/innobase/include/hash0hash.h index befe8a8d757..51315e40875 100644 --- a/innobase/include/hash0hash.h +++ b/innobase/include/hash0hash.h @@ -166,7 +166,7 @@ hash_get_n_cells( /*********************************************************************** Deletes a struct which is stored in the heap of the hash table, and compacts the heap. The fold value must be stored in the struct NODE in a field named -'fold'. This macro is only used for the adaptive hash index. */ +'fold'. */ #define HASH_DELETE_AND_COMPACT(TYPE, NAME, TABLE, NODE)\ do {\ @@ -192,23 +192,11 @@ do {\ \ *(NODE) = *top_node111;\ \ - /* Update the adaptive hash list of the buffer block that\ - corresponds to the top node */\ - if (top_node111->next_for_block != NULL) {\ - (top_node111->next_for_block)->prev_for_block = NODE;\ - }\ -\ - if (top_node111->prev_for_block != NULL) {\ - (top_node111->prev_for_block)->next_for_block = NODE;\ - } else {\ - buf_block_align(top_node111->data)->hash_nodes = NODE;\ - }\ -\ - /* Look for the hash pointer to the top node, to update it */\ -\ cell111 = hash_get_nth_cell(TABLE,\ hash_calc_hash(top_node111->fold, TABLE));\ \ + /* Look for the pointer to the top node, to update it */\ +\ if (cell111->node == top_node111) {\ /* The top node is the first in the chain */\ \ |