2009-02-17 09:10:18 +00:00
|
|
|
/*****************************************************************************
|
|
|
|
|
|
|
|
Copyright (c) 1997, 2009, Innobase Oy. All Rights Reserved.
|
|
|
|
|
|
|
|
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., 59 Temple
|
|
|
|
Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
|
|
|
|
*****************************************************************************/
|
|
|
|
|
2009-05-25 09:52:29 +00:00
|
|
|
/**************************************************//**
|
|
|
|
@file include/ibuf0ibuf.ic
|
2005-10-27 07:29:40 +00:00
|
|
|
Insert buffer
|
|
|
|
|
|
|
|
Created 7/19/1997 Heikki Tuuri
|
|
|
|
*******************************************************/
|
|
|
|
|
|
|
|
#include "page0page.h"
|
branches/zip: Enable the insert buffer on compressed tablespaces.
page_zip_max_ins_size(): New function.
btr_cur_optimistic_insert(), btr_cur_optimistic_delete(),
btr_page_split_and_insert(), btr_compress(): Do not update the
ibuf free bits for non-leaf pages or pages belonging to a clustered index.
The insert buffer only covers operations on leaf pages of secondary indexes.
For pages covered by the insert buffer, limit the max_ins_size to
page_zip_max_ins_size().
buf_page_get_gen(): Merge the insert buffer after decompressing the page.
buf_page_io_complete(): Relax the assertion about ibuf_count. For
compressed-only pages, the insert buffer merge takes place
in buf_page_get_gen().
ibuf_index_page_calc_free_bits(), ibuf_index_page_calc_free_from_bits(),
ibuf_index_page_calc_free(), ibuf_update_free_bits_if_full(),
ibuf_update_free_bits_low(), ibuf_update_free_bits_for_two_pages_low(),
ibuf_set_free_bits_low(): Add the parameter zip_size. Limit the maximum
insert size to page_zip_max_ins_size().
2007-02-19 20:32:06 +00:00
|
|
|
#include "page0zip.h"
|
2009-03-23 14:21:34 +00:00
|
|
|
#ifndef UNIV_HOTBACKUP
|
|
|
|
#include "buf0lru.h"
|
2005-10-27 07:29:40 +00:00
|
|
|
|
2009-05-26 12:28:49 +00:00
|
|
|
/** Counter for ibuf_should_try() */
|
2005-10-27 07:29:40 +00:00
|
|
|
extern ulint ibuf_flush_count;
|
|
|
|
|
2009-05-26 12:28:49 +00:00
|
|
|
/** An index page must contain at least UNIV_PAGE_SIZE /
|
|
|
|
IBUF_PAGE_SIZE_PER_FREE_SPACE bytes of free space for ibuf to try to
|
|
|
|
buffer inserts to this page. If there is this much of free space, the
|
|
|
|
corresponding bits are set in the ibuf bitmap. */
|
2005-10-27 07:29:40 +00:00
|
|
|
#define IBUF_PAGE_SIZE_PER_FREE_SPACE 32
|
|
|
|
|
2009-05-26 12:28:49 +00:00
|
|
|
/** Insert buffer struct */
|
2005-10-27 07:29:40 +00:00
|
|
|
struct ibuf_struct{
|
2009-05-26 12:28:49 +00:00
|
|
|
ulint size; /*!< current size of the ibuf index
|
branches/zip: Clean up the insert buffer subsystem.
Originally, there were provisions in InnoDB for multiple insert buffer
B-trees, apparently one for each tablespace.
When Heikki implemented innodb_file_per_table (multiple InnoDB
tablespaces) in MySQL 4.1, he made the insert buffer live only in the
system tablespace (space 0) but left the provisions in the code.
When Osku Salerma implemented delete buffering, he also cleaned up the
insert buffer subsystem so that only one insert buffer B-tree exists.
This patch applies the clean-up to the InnoDB Plugin.
Having a separate patch of the insert buffer clean-up should help us
better compare the essential changes of the InnoDB Plugin and InnoDB+
and to track down bugs that are specific to InnoDB+.
IBUF_SPACE_ID: New constant, defined as 0.
ibuf_data_t: Remove.
ibuf_t: Add the applicable fields from ibuf_data_t. There is only one
insert buffer tree from now on.
ibuf_page_low(), ibuf_page(): Merge to a single function ibuf_page().
fil_space_t: Remove ibuf_data.
fil_space_get_ibuf_data(): Remove. There is only one ibuf_data, for
space IBUF_SPACE_ID.
fil_ibuf_init_at_db_start(): Remove.
ibuf_init_at_db_start(): Fuse with ibuf_data_init_for_space().
ibuf_validate_low(): Remove. There is only one ibuf tree.
ibuf_free_excess_pages(), ibuf_header_page_get(),
ibuf_free_excess_pages(): Remove the parameter space, which was always
0.
ibuf_tree_root_get(): Remove the parameters space and data. There is
only one ibuf tree, for space IBUF_SPACE_ID.
ibuf_data_sizes_update(): Rename to ibuf_size_update(), and remove the
parameter data. There is only one ibuf data struct.
ibuf_build_entry_pre_4_1_x(): New function, refactored from
ibuf_build_entry_from_ibuf_rec().
ibuf_data_enough_free_for_insert(), ibuf_data_too_much_free(): Remove
the parameter data. There is only one insert buffer tree.
ibuf_add_free_page(), ibuf_remove_free_page(): Remove the parameters
space and data. There is only one insert buffer tree.
ibuf_get_merge_page_nos(): Add parenthesis, to reduce diffs to
branches/innodb+.
ibuf_contract_ext(): Do not pick an insert buffer tree at random.
There is only one.
ibuf_print(): Print the single insert buffer tree.
rb://19 approved by Heikki on IM
2008-12-12 14:08:23 +00:00
|
|
|
tree, in pages */
|
2009-05-26 12:28:49 +00:00
|
|
|
ulint max_size; /*!< recommended maximum size of the
|
branches/zip: Clean up the insert buffer subsystem.
Originally, there were provisions in InnoDB for multiple insert buffer
B-trees, apparently one for each tablespace.
When Heikki implemented innodb_file_per_table (multiple InnoDB
tablespaces) in MySQL 4.1, he made the insert buffer live only in the
system tablespace (space 0) but left the provisions in the code.
When Osku Salerma implemented delete buffering, he also cleaned up the
insert buffer subsystem so that only one insert buffer B-tree exists.
This patch applies the clean-up to the InnoDB Plugin.
Having a separate patch of the insert buffer clean-up should help us
better compare the essential changes of the InnoDB Plugin and InnoDB+
and to track down bugs that are specific to InnoDB+.
IBUF_SPACE_ID: New constant, defined as 0.
ibuf_data_t: Remove.
ibuf_t: Add the applicable fields from ibuf_data_t. There is only one
insert buffer tree from now on.
ibuf_page_low(), ibuf_page(): Merge to a single function ibuf_page().
fil_space_t: Remove ibuf_data.
fil_space_get_ibuf_data(): Remove. There is only one ibuf_data, for
space IBUF_SPACE_ID.
fil_ibuf_init_at_db_start(): Remove.
ibuf_init_at_db_start(): Fuse with ibuf_data_init_for_space().
ibuf_validate_low(): Remove. There is only one ibuf tree.
ibuf_free_excess_pages(), ibuf_header_page_get(),
ibuf_free_excess_pages(): Remove the parameter space, which was always
0.
ibuf_tree_root_get(): Remove the parameters space and data. There is
only one ibuf tree, for space IBUF_SPACE_ID.
ibuf_data_sizes_update(): Rename to ibuf_size_update(), and remove the
parameter data. There is only one ibuf data struct.
ibuf_build_entry_pre_4_1_x(): New function, refactored from
ibuf_build_entry_from_ibuf_rec().
ibuf_data_enough_free_for_insert(), ibuf_data_too_much_free(): Remove
the parameter data. There is only one insert buffer tree.
ibuf_add_free_page(), ibuf_remove_free_page(): Remove the parameters
space and data. There is only one insert buffer tree.
ibuf_get_merge_page_nos(): Add parenthesis, to reduce diffs to
branches/innodb+.
ibuf_contract_ext(): Do not pick an insert buffer tree at random.
There is only one.
ibuf_print(): Print the single insert buffer tree.
rb://19 approved by Heikki on IM
2008-12-12 14:08:23 +00:00
|
|
|
ibuf index tree, in pages */
|
2009-05-26 12:28:49 +00:00
|
|
|
ulint seg_size; /*!< allocated pages of the file
|
branches/zip: Clean up the insert buffer subsystem.
Originally, there were provisions in InnoDB for multiple insert buffer
B-trees, apparently one for each tablespace.
When Heikki implemented innodb_file_per_table (multiple InnoDB
tablespaces) in MySQL 4.1, he made the insert buffer live only in the
system tablespace (space 0) but left the provisions in the code.
When Osku Salerma implemented delete buffering, he also cleaned up the
insert buffer subsystem so that only one insert buffer B-tree exists.
This patch applies the clean-up to the InnoDB Plugin.
Having a separate patch of the insert buffer clean-up should help us
better compare the essential changes of the InnoDB Plugin and InnoDB+
and to track down bugs that are specific to InnoDB+.
IBUF_SPACE_ID: New constant, defined as 0.
ibuf_data_t: Remove.
ibuf_t: Add the applicable fields from ibuf_data_t. There is only one
insert buffer tree from now on.
ibuf_page_low(), ibuf_page(): Merge to a single function ibuf_page().
fil_space_t: Remove ibuf_data.
fil_space_get_ibuf_data(): Remove. There is only one ibuf_data, for
space IBUF_SPACE_ID.
fil_ibuf_init_at_db_start(): Remove.
ibuf_init_at_db_start(): Fuse with ibuf_data_init_for_space().
ibuf_validate_low(): Remove. There is only one ibuf tree.
ibuf_free_excess_pages(), ibuf_header_page_get(),
ibuf_free_excess_pages(): Remove the parameter space, which was always
0.
ibuf_tree_root_get(): Remove the parameters space and data. There is
only one ibuf tree, for space IBUF_SPACE_ID.
ibuf_data_sizes_update(): Rename to ibuf_size_update(), and remove the
parameter data. There is only one ibuf data struct.
ibuf_build_entry_pre_4_1_x(): New function, refactored from
ibuf_build_entry_from_ibuf_rec().
ibuf_data_enough_free_for_insert(), ibuf_data_too_much_free(): Remove
the parameter data. There is only one insert buffer tree.
ibuf_add_free_page(), ibuf_remove_free_page(): Remove the parameters
space and data. There is only one insert buffer tree.
ibuf_get_merge_page_nos(): Add parenthesis, to reduce diffs to
branches/innodb+.
ibuf_contract_ext(): Do not pick an insert buffer tree at random.
There is only one.
ibuf_print(): Print the single insert buffer tree.
rb://19 approved by Heikki on IM
2008-12-12 14:08:23 +00:00
|
|
|
segment containing ibuf header and
|
|
|
|
tree */
|
2009-05-26 12:28:49 +00:00
|
|
|
ibool empty; /*!< after an insert to the ibuf tree
|
branches/zip: Clean up the insert buffer subsystem.
Originally, there were provisions in InnoDB for multiple insert buffer
B-trees, apparently one for each tablespace.
When Heikki implemented innodb_file_per_table (multiple InnoDB
tablespaces) in MySQL 4.1, he made the insert buffer live only in the
system tablespace (space 0) but left the provisions in the code.
When Osku Salerma implemented delete buffering, he also cleaned up the
insert buffer subsystem so that only one insert buffer B-tree exists.
This patch applies the clean-up to the InnoDB Plugin.
Having a separate patch of the insert buffer clean-up should help us
better compare the essential changes of the InnoDB Plugin and InnoDB+
and to track down bugs that are specific to InnoDB+.
IBUF_SPACE_ID: New constant, defined as 0.
ibuf_data_t: Remove.
ibuf_t: Add the applicable fields from ibuf_data_t. There is only one
insert buffer tree from now on.
ibuf_page_low(), ibuf_page(): Merge to a single function ibuf_page().
fil_space_t: Remove ibuf_data.
fil_space_get_ibuf_data(): Remove. There is only one ibuf_data, for
space IBUF_SPACE_ID.
fil_ibuf_init_at_db_start(): Remove.
ibuf_init_at_db_start(): Fuse with ibuf_data_init_for_space().
ibuf_validate_low(): Remove. There is only one ibuf tree.
ibuf_free_excess_pages(), ibuf_header_page_get(),
ibuf_free_excess_pages(): Remove the parameter space, which was always
0.
ibuf_tree_root_get(): Remove the parameters space and data. There is
only one ibuf tree, for space IBUF_SPACE_ID.
ibuf_data_sizes_update(): Rename to ibuf_size_update(), and remove the
parameter data. There is only one ibuf data struct.
ibuf_build_entry_pre_4_1_x(): New function, refactored from
ibuf_build_entry_from_ibuf_rec().
ibuf_data_enough_free_for_insert(), ibuf_data_too_much_free(): Remove
the parameter data. There is only one insert buffer tree.
ibuf_add_free_page(), ibuf_remove_free_page(): Remove the parameters
space and data. There is only one insert buffer tree.
ibuf_get_merge_page_nos(): Add parenthesis, to reduce diffs to
branches/innodb+.
ibuf_contract_ext(): Do not pick an insert buffer tree at random.
There is only one.
ibuf_print(): Print the single insert buffer tree.
rb://19 approved by Heikki on IM
2008-12-12 14:08:23 +00:00
|
|
|
is performed, this is set to FALSE,
|
|
|
|
and if a contract operation finds
|
|
|
|
the tree empty, this is set to
|
|
|
|
TRUE */
|
2009-05-26 12:28:49 +00:00
|
|
|
ulint free_list_len; /*!< length of the free list */
|
|
|
|
ulint height; /*!< tree height */
|
|
|
|
dict_index_t* index; /*!< insert buffer index */
|
branches/zip: Clean up the insert buffer subsystem.
Originally, there were provisions in InnoDB for multiple insert buffer
B-trees, apparently one for each tablespace.
When Heikki implemented innodb_file_per_table (multiple InnoDB
tablespaces) in MySQL 4.1, he made the insert buffer live only in the
system tablespace (space 0) but left the provisions in the code.
When Osku Salerma implemented delete buffering, he also cleaned up the
insert buffer subsystem so that only one insert buffer B-tree exists.
This patch applies the clean-up to the InnoDB Plugin.
Having a separate patch of the insert buffer clean-up should help us
better compare the essential changes of the InnoDB Plugin and InnoDB+
and to track down bugs that are specific to InnoDB+.
IBUF_SPACE_ID: New constant, defined as 0.
ibuf_data_t: Remove.
ibuf_t: Add the applicable fields from ibuf_data_t. There is only one
insert buffer tree from now on.
ibuf_page_low(), ibuf_page(): Merge to a single function ibuf_page().
fil_space_t: Remove ibuf_data.
fil_space_get_ibuf_data(): Remove. There is only one ibuf_data, for
space IBUF_SPACE_ID.
fil_ibuf_init_at_db_start(): Remove.
ibuf_init_at_db_start(): Fuse with ibuf_data_init_for_space().
ibuf_validate_low(): Remove. There is only one ibuf tree.
ibuf_free_excess_pages(), ibuf_header_page_get(),
ibuf_free_excess_pages(): Remove the parameter space, which was always
0.
ibuf_tree_root_get(): Remove the parameters space and data. There is
only one ibuf tree, for space IBUF_SPACE_ID.
ibuf_data_sizes_update(): Rename to ibuf_size_update(), and remove the
parameter data. There is only one ibuf data struct.
ibuf_build_entry_pre_4_1_x(): New function, refactored from
ibuf_build_entry_from_ibuf_rec().
ibuf_data_enough_free_for_insert(), ibuf_data_too_much_free(): Remove
the parameter data. There is only one insert buffer tree.
ibuf_add_free_page(), ibuf_remove_free_page(): Remove the parameters
space and data. There is only one insert buffer tree.
ibuf_get_merge_page_nos(): Add parenthesis, to reduce diffs to
branches/innodb+.
ibuf_contract_ext(): Do not pick an insert buffer tree at random.
There is only one.
ibuf_print(): Print the single insert buffer tree.
rb://19 approved by Heikki on IM
2008-12-12 14:08:23 +00:00
|
|
|
|
2009-05-26 12:28:49 +00:00
|
|
|
ulint n_inserts; /*!< number of inserts made to
|
branches/zip: Clean up the insert buffer subsystem.
Originally, there were provisions in InnoDB for multiple insert buffer
B-trees, apparently one for each tablespace.
When Heikki implemented innodb_file_per_table (multiple InnoDB
tablespaces) in MySQL 4.1, he made the insert buffer live only in the
system tablespace (space 0) but left the provisions in the code.
When Osku Salerma implemented delete buffering, he also cleaned up the
insert buffer subsystem so that only one insert buffer B-tree exists.
This patch applies the clean-up to the InnoDB Plugin.
Having a separate patch of the insert buffer clean-up should help us
better compare the essential changes of the InnoDB Plugin and InnoDB+
and to track down bugs that are specific to InnoDB+.
IBUF_SPACE_ID: New constant, defined as 0.
ibuf_data_t: Remove.
ibuf_t: Add the applicable fields from ibuf_data_t. There is only one
insert buffer tree from now on.
ibuf_page_low(), ibuf_page(): Merge to a single function ibuf_page().
fil_space_t: Remove ibuf_data.
fil_space_get_ibuf_data(): Remove. There is only one ibuf_data, for
space IBUF_SPACE_ID.
fil_ibuf_init_at_db_start(): Remove.
ibuf_init_at_db_start(): Fuse with ibuf_data_init_for_space().
ibuf_validate_low(): Remove. There is only one ibuf tree.
ibuf_free_excess_pages(), ibuf_header_page_get(),
ibuf_free_excess_pages(): Remove the parameter space, which was always
0.
ibuf_tree_root_get(): Remove the parameters space and data. There is
only one ibuf tree, for space IBUF_SPACE_ID.
ibuf_data_sizes_update(): Rename to ibuf_size_update(), and remove the
parameter data. There is only one ibuf data struct.
ibuf_build_entry_pre_4_1_x(): New function, refactored from
ibuf_build_entry_from_ibuf_rec().
ibuf_data_enough_free_for_insert(), ibuf_data_too_much_free(): Remove
the parameter data. There is only one insert buffer tree.
ibuf_add_free_page(), ibuf_remove_free_page(): Remove the parameters
space and data. There is only one insert buffer tree.
ibuf_get_merge_page_nos(): Add parenthesis, to reduce diffs to
branches/innodb+.
ibuf_contract_ext(): Do not pick an insert buffer tree at random.
There is only one.
ibuf_print(): Print the single insert buffer tree.
rb://19 approved by Heikki on IM
2008-12-12 14:08:23 +00:00
|
|
|
the insert buffer */
|
2009-05-26 12:28:49 +00:00
|
|
|
ulint n_merges; /*!< number of pages merged */
|
|
|
|
ulint n_merged_recs; /*!< number of records merged */
|
2005-10-27 07:29:40 +00:00
|
|
|
};
|
|
|
|
|
2009-05-25 09:52:29 +00:00
|
|
|
/************************************************************************//**
|
2005-10-27 07:29:40 +00:00
|
|
|
Sets the free bit of the page in the ibuf bitmap. This is done in a separate
|
|
|
|
mini-transaction, hence this operation does not restrict further work to only
|
|
|
|
ibuf bitmap operations, which would result if the latch to the bitmap page
|
|
|
|
were kept. */
|
2008-02-06 14:17:36 +00:00
|
|
|
UNIV_INTERN
|
2005-10-27 07:29:40 +00:00
|
|
|
void
|
2007-03-01 11:33:26 +00:00
|
|
|
ibuf_set_free_bits_func(
|
|
|
|
/*====================*/
|
2009-05-25 05:30:14 +00:00
|
|
|
buf_block_t* block, /*!< in: index page of a non-clustered index;
|
2007-05-06 12:39:46 +00:00
|
|
|
free bit is reset if page level is 0 */
|
2007-03-01 11:33:26 +00:00
|
|
|
#ifdef UNIV_IBUF_DEBUG
|
2009-05-25 05:30:14 +00:00
|
|
|
ulint max_val,/*!< in: ULINT_UNDEFINED or a maximum
|
2006-10-13 07:45:52 +00:00
|
|
|
value which the bits must have before
|
|
|
|
setting; this is for debugging */
|
2007-03-01 11:33:26 +00:00
|
|
|
#endif /* UNIV_IBUF_DEBUG */
|
2009-05-25 05:30:14 +00:00
|
|
|
ulint val); /*!< in: value to set: < 4 */
|
2007-03-01 11:33:26 +00:00
|
|
|
#ifdef UNIV_IBUF_DEBUG
|
2007-05-06 12:39:46 +00:00
|
|
|
# define ibuf_set_free_bits(b,v,max) ibuf_set_free_bits_func(b,max,v)
|
2007-03-01 11:33:26 +00:00
|
|
|
#else /* UNIV_IBUF_DEBUG */
|
2007-05-06 12:39:46 +00:00
|
|
|
# define ibuf_set_free_bits(b,v,max) ibuf_set_free_bits_func(b,v)
|
2007-03-01 11:33:26 +00:00
|
|
|
#endif /* UNIV_IBUF_DEBUG */
|
2005-10-27 07:29:40 +00:00
|
|
|
|
2009-05-25 09:52:29 +00:00
|
|
|
/**********************************************************************//**
|
2005-10-27 07:29:40 +00:00
|
|
|
A basic partial test if an insert to the insert buffer could be possible and
|
|
|
|
recommended. */
|
|
|
|
UNIV_INLINE
|
|
|
|
ibool
|
|
|
|
ibuf_should_try(
|
|
|
|
/*============*/
|
2009-05-25 05:30:14 +00:00
|
|
|
dict_index_t* index, /*!< in: index where to insert */
|
|
|
|
ulint ignore_sec_unique) /*!< in: if != 0, we should
|
2005-10-27 07:29:40 +00:00
|
|
|
ignore UNIQUE constraint on
|
|
|
|
a secondary index when we
|
|
|
|
decide */
|
|
|
|
{
|
2009-01-29 09:27:09 +00:00
|
|
|
if (ibuf_use != IBUF_USE_NONE
|
|
|
|
&& !dict_index_is_clust(index)
|
2007-04-16 09:21:39 +00:00
|
|
|
&& (ignore_sec_unique || !dict_index_is_unique(index))) {
|
2005-10-27 07:29:40 +00:00
|
|
|
|
|
|
|
ibuf_flush_count++;
|
|
|
|
|
2008-12-12 12:22:34 +00:00
|
|
|
if (ibuf_flush_count % 4 == 0) {
|
2006-02-23 19:25:29 +00:00
|
|
|
|
2005-10-27 07:29:40 +00:00
|
|
|
buf_LRU_try_free_flushed_blocks();
|
|
|
|
}
|
|
|
|
|
|
|
|
return(TRUE);
|
|
|
|
}
|
|
|
|
|
|
|
|
return(FALSE);
|
|
|
|
}
|
|
|
|
|
2009-05-25 09:52:29 +00:00
|
|
|
/***********************************************************************//**
|
2009-05-25 05:30:14 +00:00
|
|
|
Checks if a page address is an ibuf bitmap page address.
|
|
|
|
@return TRUE if a bitmap page */
|
2005-10-27 07:29:40 +00:00
|
|
|
UNIV_INLINE
|
|
|
|
ibool
|
|
|
|
ibuf_bitmap_page(
|
|
|
|
/*=============*/
|
2009-05-25 05:30:14 +00:00
|
|
|
ulint zip_size,/*!< in: compressed page size in bytes;
|
2006-06-05 09:04:19 +00:00
|
|
|
0 for uncompressed pages */
|
2009-05-25 05:30:14 +00:00
|
|
|
ulint page_no)/*!< in: page number */
|
2005-10-27 07:29:40 +00:00
|
|
|
{
|
2006-06-07 11:23:21 +00:00
|
|
|
ut_ad(ut_is_2pow(zip_size));
|
2005-10-27 07:29:40 +00:00
|
|
|
|
2006-06-05 09:04:19 +00:00
|
|
|
if (!zip_size) {
|
|
|
|
return(UNIV_UNLIKELY((page_no & (UNIV_PAGE_SIZE - 1))
|
2006-08-29 09:30:31 +00:00
|
|
|
== FSP_IBUF_BITMAP_OFFSET));
|
2005-10-27 07:29:40 +00:00
|
|
|
}
|
|
|
|
|
2006-06-05 09:04:19 +00:00
|
|
|
return(UNIV_UNLIKELY((page_no & (zip_size - 1))
|
2006-08-29 09:30:31 +00:00
|
|
|
== FSP_IBUF_BITMAP_OFFSET));
|
2005-10-27 07:29:40 +00:00
|
|
|
}
|
|
|
|
|
2009-05-25 09:52:29 +00:00
|
|
|
/*********************************************************************//**
|
2009-05-25 05:30:14 +00:00
|
|
|
Translates the free space on a page to a value in the ibuf bitmap.
|
|
|
|
@return value for ibuf bitmap bits */
|
2005-10-27 07:29:40 +00:00
|
|
|
UNIV_INLINE
|
|
|
|
ulint
|
|
|
|
ibuf_index_page_calc_free_bits(
|
|
|
|
/*===========================*/
|
2009-05-25 05:30:14 +00:00
|
|
|
ulint zip_size, /*!< in: compressed page size in bytes;
|
branches/zip: Enable the insert buffer on compressed tablespaces.
page_zip_max_ins_size(): New function.
btr_cur_optimistic_insert(), btr_cur_optimistic_delete(),
btr_page_split_and_insert(), btr_compress(): Do not update the
ibuf free bits for non-leaf pages or pages belonging to a clustered index.
The insert buffer only covers operations on leaf pages of secondary indexes.
For pages covered by the insert buffer, limit the max_ins_size to
page_zip_max_ins_size().
buf_page_get_gen(): Merge the insert buffer after decompressing the page.
buf_page_io_complete(): Relax the assertion about ibuf_count. For
compressed-only pages, the insert buffer merge takes place
in buf_page_get_gen().
ibuf_index_page_calc_free_bits(), ibuf_index_page_calc_free_from_bits(),
ibuf_index_page_calc_free(), ibuf_update_free_bits_if_full(),
ibuf_update_free_bits_low(), ibuf_update_free_bits_for_two_pages_low(),
ibuf_set_free_bits_low(): Add the parameter zip_size. Limit the maximum
insert size to page_zip_max_ins_size().
2007-02-19 20:32:06 +00:00
|
|
|
0 for uncompressed pages */
|
2009-05-25 05:30:14 +00:00
|
|
|
ulint max_ins_size) /*!< in: maximum insert size after reorganize
|
2005-10-27 07:29:40 +00:00
|
|
|
for the page */
|
|
|
|
{
|
|
|
|
ulint n;
|
branches/zip: Enable the insert buffer on compressed tablespaces.
page_zip_max_ins_size(): New function.
btr_cur_optimistic_insert(), btr_cur_optimistic_delete(),
btr_page_split_and_insert(), btr_compress(): Do not update the
ibuf free bits for non-leaf pages or pages belonging to a clustered index.
The insert buffer only covers operations on leaf pages of secondary indexes.
For pages covered by the insert buffer, limit the max_ins_size to
page_zip_max_ins_size().
buf_page_get_gen(): Merge the insert buffer after decompressing the page.
buf_page_io_complete(): Relax the assertion about ibuf_count. For
compressed-only pages, the insert buffer merge takes place
in buf_page_get_gen().
ibuf_index_page_calc_free_bits(), ibuf_index_page_calc_free_from_bits(),
ibuf_index_page_calc_free(), ibuf_update_free_bits_if_full(),
ibuf_update_free_bits_low(), ibuf_update_free_bits_for_two_pages_low(),
ibuf_set_free_bits_low(): Add the parameter zip_size. Limit the maximum
insert size to page_zip_max_ins_size().
2007-02-19 20:32:06 +00:00
|
|
|
ut_ad(ut_is_2pow(zip_size));
|
|
|
|
ut_ad(!zip_size || zip_size > IBUF_PAGE_SIZE_PER_FREE_SPACE);
|
|
|
|
ut_ad(zip_size <= UNIV_PAGE_SIZE);
|
2006-02-23 19:25:29 +00:00
|
|
|
|
branches/zip: Enable the insert buffer on compressed tablespaces.
page_zip_max_ins_size(): New function.
btr_cur_optimistic_insert(), btr_cur_optimistic_delete(),
btr_page_split_and_insert(), btr_compress(): Do not update the
ibuf free bits for non-leaf pages or pages belonging to a clustered index.
The insert buffer only covers operations on leaf pages of secondary indexes.
For pages covered by the insert buffer, limit the max_ins_size to
page_zip_max_ins_size().
buf_page_get_gen(): Merge the insert buffer after decompressing the page.
buf_page_io_complete(): Relax the assertion about ibuf_count. For
compressed-only pages, the insert buffer merge takes place
in buf_page_get_gen().
ibuf_index_page_calc_free_bits(), ibuf_index_page_calc_free_from_bits(),
ibuf_index_page_calc_free(), ibuf_update_free_bits_if_full(),
ibuf_update_free_bits_low(), ibuf_update_free_bits_for_two_pages_low(),
ibuf_set_free_bits_low(): Add the parameter zip_size. Limit the maximum
insert size to page_zip_max_ins_size().
2007-02-19 20:32:06 +00:00
|
|
|
if (zip_size) {
|
|
|
|
n = max_ins_size
|
|
|
|
/ (zip_size / IBUF_PAGE_SIZE_PER_FREE_SPACE);
|
|
|
|
} else {
|
|
|
|
n = max_ins_size
|
|
|
|
/ (UNIV_PAGE_SIZE / IBUF_PAGE_SIZE_PER_FREE_SPACE);
|
|
|
|
}
|
2005-10-27 07:29:40 +00:00
|
|
|
|
|
|
|
if (n == 3) {
|
|
|
|
n = 2;
|
|
|
|
}
|
2006-02-23 19:25:29 +00:00
|
|
|
|
2005-10-27 07:29:40 +00:00
|
|
|
if (n > 3) {
|
|
|
|
n = 3;
|
|
|
|
}
|
|
|
|
|
|
|
|
return(n);
|
|
|
|
}
|
|
|
|
|
2009-05-25 09:52:29 +00:00
|
|
|
/*********************************************************************//**
|
2009-05-25 05:30:14 +00:00
|
|
|
Translates the ibuf free bits to the free space on a page in bytes.
|
|
|
|
@return maximum insert size after reorganize for the page */
|
2005-10-27 07:29:40 +00:00
|
|
|
UNIV_INLINE
|
|
|
|
ulint
|
|
|
|
ibuf_index_page_calc_free_from_bits(
|
|
|
|
/*================================*/
|
2009-05-25 05:30:14 +00:00
|
|
|
ulint zip_size,/*!< in: compressed page size in bytes;
|
branches/zip: Enable the insert buffer on compressed tablespaces.
page_zip_max_ins_size(): New function.
btr_cur_optimistic_insert(), btr_cur_optimistic_delete(),
btr_page_split_and_insert(), btr_compress(): Do not update the
ibuf free bits for non-leaf pages or pages belonging to a clustered index.
The insert buffer only covers operations on leaf pages of secondary indexes.
For pages covered by the insert buffer, limit the max_ins_size to
page_zip_max_ins_size().
buf_page_get_gen(): Merge the insert buffer after decompressing the page.
buf_page_io_complete(): Relax the assertion about ibuf_count. For
compressed-only pages, the insert buffer merge takes place
in buf_page_get_gen().
ibuf_index_page_calc_free_bits(), ibuf_index_page_calc_free_from_bits(),
ibuf_index_page_calc_free(), ibuf_update_free_bits_if_full(),
ibuf_update_free_bits_low(), ibuf_update_free_bits_for_two_pages_low(),
ibuf_set_free_bits_low(): Add the parameter zip_size. Limit the maximum
insert size to page_zip_max_ins_size().
2007-02-19 20:32:06 +00:00
|
|
|
0 for uncompressed pages */
|
2009-05-25 05:30:14 +00:00
|
|
|
ulint bits) /*!< in: value for ibuf bitmap bits */
|
2005-10-27 07:29:40 +00:00
|
|
|
{
|
|
|
|
ut_ad(bits < 4);
|
branches/zip: Enable the insert buffer on compressed tablespaces.
page_zip_max_ins_size(): New function.
btr_cur_optimistic_insert(), btr_cur_optimistic_delete(),
btr_page_split_and_insert(), btr_compress(): Do not update the
ibuf free bits for non-leaf pages or pages belonging to a clustered index.
The insert buffer only covers operations on leaf pages of secondary indexes.
For pages covered by the insert buffer, limit the max_ins_size to
page_zip_max_ins_size().
buf_page_get_gen(): Merge the insert buffer after decompressing the page.
buf_page_io_complete(): Relax the assertion about ibuf_count. For
compressed-only pages, the insert buffer merge takes place
in buf_page_get_gen().
ibuf_index_page_calc_free_bits(), ibuf_index_page_calc_free_from_bits(),
ibuf_index_page_calc_free(), ibuf_update_free_bits_if_full(),
ibuf_update_free_bits_low(), ibuf_update_free_bits_for_two_pages_low(),
ibuf_set_free_bits_low(): Add the parameter zip_size. Limit the maximum
insert size to page_zip_max_ins_size().
2007-02-19 20:32:06 +00:00
|
|
|
ut_ad(ut_is_2pow(zip_size));
|
|
|
|
ut_ad(!zip_size || zip_size > IBUF_PAGE_SIZE_PER_FREE_SPACE);
|
|
|
|
ut_ad(zip_size <= UNIV_PAGE_SIZE);
|
|
|
|
|
|
|
|
if (zip_size) {
|
|
|
|
if (bits == 3) {
|
|
|
|
return(4 * zip_size / IBUF_PAGE_SIZE_PER_FREE_SPACE);
|
|
|
|
}
|
|
|
|
|
|
|
|
return(bits * zip_size / IBUF_PAGE_SIZE_PER_FREE_SPACE);
|
|
|
|
}
|
2005-10-27 07:29:40 +00:00
|
|
|
|
|
|
|
if (bits == 3) {
|
|
|
|
return(4 * UNIV_PAGE_SIZE / IBUF_PAGE_SIZE_PER_FREE_SPACE);
|
|
|
|
}
|
|
|
|
|
branches/zip: Enable the insert buffer on compressed tablespaces.
page_zip_max_ins_size(): New function.
btr_cur_optimistic_insert(), btr_cur_optimistic_delete(),
btr_page_split_and_insert(), btr_compress(): Do not update the
ibuf free bits for non-leaf pages or pages belonging to a clustered index.
The insert buffer only covers operations on leaf pages of secondary indexes.
For pages covered by the insert buffer, limit the max_ins_size to
page_zip_max_ins_size().
buf_page_get_gen(): Merge the insert buffer after decompressing the page.
buf_page_io_complete(): Relax the assertion about ibuf_count. For
compressed-only pages, the insert buffer merge takes place
in buf_page_get_gen().
ibuf_index_page_calc_free_bits(), ibuf_index_page_calc_free_from_bits(),
ibuf_index_page_calc_free(), ibuf_update_free_bits_if_full(),
ibuf_update_free_bits_low(), ibuf_update_free_bits_for_two_pages_low(),
ibuf_set_free_bits_low(): Add the parameter zip_size. Limit the maximum
insert size to page_zip_max_ins_size().
2007-02-19 20:32:06 +00:00
|
|
|
return(bits * (UNIV_PAGE_SIZE / IBUF_PAGE_SIZE_PER_FREE_SPACE));
|
2005-10-27 07:29:40 +00:00
|
|
|
}
|
|
|
|
|
2009-05-25 09:52:29 +00:00
|
|
|
/*********************************************************************//**
|
2009-05-25 05:30:14 +00:00
|
|
|
Translates the free space on a compressed page to a value in the ibuf bitmap.
|
|
|
|
@return value for ibuf bitmap bits */
|
2007-10-12 13:25:12 +00:00
|
|
|
UNIV_INLINE
|
|
|
|
ulint
|
|
|
|
ibuf_index_page_calc_free_zip(
|
|
|
|
/*==========================*/
|
|
|
|
ulint zip_size,
|
2009-05-25 05:30:14 +00:00
|
|
|
/*!< in: compressed page size in bytes */
|
|
|
|
const buf_block_t* block) /*!< in: buffer block */
|
2007-10-12 13:25:12 +00:00
|
|
|
{
|
|
|
|
ulint max_ins_size;
|
|
|
|
const page_zip_des_t* page_zip;
|
|
|
|
lint zip_max_ins;
|
|
|
|
|
|
|
|
ut_ad(zip_size == buf_block_get_zip_size(block));
|
|
|
|
ut_ad(zip_size);
|
|
|
|
|
|
|
|
max_ins_size = page_get_max_insert_size_after_reorganize(
|
|
|
|
buf_block_get_frame(block), 1);
|
|
|
|
|
|
|
|
page_zip = buf_block_get_page_zip(block);
|
|
|
|
zip_max_ins = page_zip_max_ins_size(page_zip,
|
|
|
|
FALSE/* not clustered */);
|
|
|
|
|
|
|
|
if (UNIV_UNLIKELY(zip_max_ins < 0)) {
|
|
|
|
return(0);
|
|
|
|
} else if (UNIV_LIKELY(max_ins_size > (ulint) zip_max_ins)) {
|
|
|
|
max_ins_size = (ulint) zip_max_ins;
|
|
|
|
}
|
|
|
|
|
|
|
|
return(ibuf_index_page_calc_free_bits(zip_size, max_ins_size));
|
|
|
|
}
|
|
|
|
|
2009-05-25 09:52:29 +00:00
|
|
|
/*********************************************************************//**
|
2009-05-25 05:30:14 +00:00
|
|
|
Translates the free space on a page to a value in the ibuf bitmap.
|
|
|
|
@return value for ibuf bitmap bits */
|
2005-10-27 07:29:40 +00:00
|
|
|
UNIV_INLINE
|
|
|
|
ulint
|
|
|
|
ibuf_index_page_calc_free(
|
|
|
|
/*======================*/
|
2009-05-25 05:30:14 +00:00
|
|
|
ulint zip_size,/*!< in: compressed page size in bytes;
|
2007-10-12 10:45:41 +00:00
|
|
|
0 for uncompressed pages */
|
2009-05-25 05:30:14 +00:00
|
|
|
const buf_block_t* block) /*!< in: buffer block */
|
2005-10-27 07:29:40 +00:00
|
|
|
{
|
branches/zip: Enable the insert buffer on compressed tablespaces.
page_zip_max_ins_size(): New function.
btr_cur_optimistic_insert(), btr_cur_optimistic_delete(),
btr_page_split_and_insert(), btr_compress(): Do not update the
ibuf free bits for non-leaf pages or pages belonging to a clustered index.
The insert buffer only covers operations on leaf pages of secondary indexes.
For pages covered by the insert buffer, limit the max_ins_size to
page_zip_max_ins_size().
buf_page_get_gen(): Merge the insert buffer after decompressing the page.
buf_page_io_complete(): Relax the assertion about ibuf_count. For
compressed-only pages, the insert buffer merge takes place
in buf_page_get_gen().
ibuf_index_page_calc_free_bits(), ibuf_index_page_calc_free_from_bits(),
ibuf_index_page_calc_free(), ibuf_update_free_bits_if_full(),
ibuf_update_free_bits_low(), ibuf_update_free_bits_for_two_pages_low(),
ibuf_set_free_bits_low(): Add the parameter zip_size. Limit the maximum
insert size to page_zip_max_ins_size().
2007-02-19 20:32:06 +00:00
|
|
|
ut_ad(zip_size == buf_block_get_zip_size(block));
|
|
|
|
|
|
|
|
if (!zip_size) {
|
2007-10-12 13:25:12 +00:00
|
|
|
ulint max_ins_size;
|
2007-10-12 10:45:41 +00:00
|
|
|
|
2007-10-12 13:25:12 +00:00
|
|
|
max_ins_size = page_get_max_insert_size_after_reorganize(
|
|
|
|
buf_block_get_frame(block), 1);
|
branches/zip: Enable the insert buffer on compressed tablespaces.
page_zip_max_ins_size(): New function.
btr_cur_optimistic_insert(), btr_cur_optimistic_delete(),
btr_page_split_and_insert(), btr_compress(): Do not update the
ibuf free bits for non-leaf pages or pages belonging to a clustered index.
The insert buffer only covers operations on leaf pages of secondary indexes.
For pages covered by the insert buffer, limit the max_ins_size to
page_zip_max_ins_size().
buf_page_get_gen(): Merge the insert buffer after decompressing the page.
buf_page_io_complete(): Relax the assertion about ibuf_count. For
compressed-only pages, the insert buffer merge takes place
in buf_page_get_gen().
ibuf_index_page_calc_free_bits(), ibuf_index_page_calc_free_from_bits(),
ibuf_index_page_calc_free(), ibuf_update_free_bits_if_full(),
ibuf_update_free_bits_low(), ibuf_update_free_bits_for_two_pages_low(),
ibuf_set_free_bits_low(): Add the parameter zip_size. Limit the maximum
insert size to page_zip_max_ins_size().
2007-02-19 20:32:06 +00:00
|
|
|
|
2007-10-12 13:25:12 +00:00
|
|
|
return(ibuf_index_page_calc_free_bits(0, max_ins_size));
|
|
|
|
} else {
|
|
|
|
return(ibuf_index_page_calc_free_zip(zip_size, block));
|
branches/zip: Enable the insert buffer on compressed tablespaces.
page_zip_max_ins_size(): New function.
btr_cur_optimistic_insert(), btr_cur_optimistic_delete(),
btr_page_split_and_insert(), btr_compress(): Do not update the
ibuf free bits for non-leaf pages or pages belonging to a clustered index.
The insert buffer only covers operations on leaf pages of secondary indexes.
For pages covered by the insert buffer, limit the max_ins_size to
page_zip_max_ins_size().
buf_page_get_gen(): Merge the insert buffer after decompressing the page.
buf_page_io_complete(): Relax the assertion about ibuf_count. For
compressed-only pages, the insert buffer merge takes place
in buf_page_get_gen().
ibuf_index_page_calc_free_bits(), ibuf_index_page_calc_free_from_bits(),
ibuf_index_page_calc_free(), ibuf_update_free_bits_if_full(),
ibuf_update_free_bits_low(), ibuf_update_free_bits_for_two_pages_low(),
ibuf_set_free_bits_low(): Add the parameter zip_size. Limit the maximum
insert size to page_zip_max_ins_size().
2007-02-19 20:32:06 +00:00
|
|
|
}
|
2005-10-27 07:29:40 +00:00
|
|
|
}
|
|
|
|
|
2009-05-25 09:52:29 +00:00
|
|
|
/************************************************************************//**
|
2007-10-12 13:25:12 +00:00
|
|
|
Updates the free bits of an uncompressed page in the ibuf bitmap if
|
2008-09-04 07:47:49 +00:00
|
|
|
there is not enough free on the page any more. This is done in a
|
2007-10-12 13:25:12 +00:00
|
|
|
separate mini-transaction, hence this operation does not restrict
|
|
|
|
further work to only ibuf bitmap operations, which would result if the
|
2008-09-04 07:47:49 +00:00
|
|
|
latch to the bitmap page were kept. NOTE: The free bits in the insert
|
|
|
|
buffer bitmap must never exceed the free space on a page. It is
|
|
|
|
unsafe to increment the bits in a separately committed
|
|
|
|
mini-transaction, because in crash recovery, the free bits could
|
|
|
|
momentarily be set too high. It is only safe to use this function for
|
|
|
|
decrementing the free bits. Should more free space become available,
|
|
|
|
we must not update the free bits here, because that would break crash
|
|
|
|
recovery. */
|
2005-10-27 07:29:40 +00:00
|
|
|
UNIV_INLINE
|
|
|
|
void
|
|
|
|
ibuf_update_free_bits_if_full(
|
|
|
|
/*==========================*/
|
2009-05-25 05:30:14 +00:00
|
|
|
buf_block_t* block, /*!< in: index page to which we have added new
|
2005-10-27 07:29:40 +00:00
|
|
|
records; the free bits are updated if the
|
|
|
|
index is non-clustered and non-unique and
|
|
|
|
the page level is 0, and the page becomes
|
|
|
|
fuller */
|
2009-05-25 05:30:14 +00:00
|
|
|
ulint max_ins_size,/*!< in: value of maximum insert size with
|
2005-10-27 07:29:40 +00:00
|
|
|
reorganize before the latest operation
|
|
|
|
performed to the page */
|
2009-05-25 05:30:14 +00:00
|
|
|
ulint increase)/*!< in: upper limit for the additional space
|
2005-10-27 07:29:40 +00:00
|
|
|
used in the latest operation, if known, or
|
|
|
|
ULINT_UNDEFINED */
|
|
|
|
{
|
|
|
|
ulint before;
|
|
|
|
ulint after;
|
|
|
|
|
2007-10-12 13:25:12 +00:00
|
|
|
ut_ad(!buf_block_get_page_zip(block));
|
|
|
|
|
2007-03-01 11:28:30 +00:00
|
|
|
before = ibuf_index_page_calc_free_bits(0, max_ins_size);
|
2005-10-27 07:29:40 +00:00
|
|
|
|
|
|
|
if (max_ins_size >= increase) {
|
2006-02-17 14:19:39 +00:00
|
|
|
#if ULINT32_UNDEFINED <= UNIV_PAGE_SIZE
|
|
|
|
# error "ULINT32_UNDEFINED <= UNIV_PAGE_SIZE"
|
|
|
|
#endif
|
2007-03-01 11:28:30 +00:00
|
|
|
after = ibuf_index_page_calc_free_bits(0, max_ins_size
|
2006-08-29 09:30:31 +00:00
|
|
|
- increase);
|
2005-10-27 07:29:40 +00:00
|
|
|
#ifdef UNIV_IBUF_DEBUG
|
2007-03-01 11:28:30 +00:00
|
|
|
ut_a(after <= ibuf_index_page_calc_free(0, block));
|
2005-10-27 07:29:40 +00:00
|
|
|
#endif
|
|
|
|
} else {
|
2007-03-01 11:28:30 +00:00
|
|
|
after = ibuf_index_page_calc_free(0, block);
|
2005-10-27 07:29:40 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (after == 0) {
|
|
|
|
/* We move the page to the front of the buffer pool LRU list:
|
|
|
|
the purpose of this is to prevent those pages to which we
|
|
|
|
cannot make inserts using the insert buffer from slipping
|
|
|
|
out of the buffer pool */
|
|
|
|
|
2006-11-30 12:27:49 +00:00
|
|
|
buf_page_make_young(&block->page);
|
2005-10-27 07:29:40 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (before > after) {
|
2007-05-06 12:39:46 +00:00
|
|
|
ibuf_set_free_bits(block, after, before);
|
2005-10-27 07:29:40 +00:00
|
|
|
}
|
|
|
|
}
|
2009-03-23 14:21:34 +00:00
|
|
|
#endif /* !UNIV_HOTBACKUP */
|