Commit 9df4c143 authored by Inaam Rana's avatar Inaam Rana

merge from mysql-5.1

Bug 12635227 - 61188: DROP TABLE EXTREMELY SLOW
parent ce7b4f6d
...@@ -4155,7 +4155,7 @@ btr_blob_free( ...@@ -4155,7 +4155,7 @@ btr_blob_free(
&& buf_block_get_space(block) == space && buf_block_get_space(block) == space
&& buf_block_get_page_no(block) == page_no) { && buf_block_get_page_no(block) == page_no) {
if (buf_LRU_free_block(&block->page, all) != BUF_LRU_FREED if (!buf_LRU_free_block(&block->page, all)
&& all && block->page.zip.data) { && all && block->page.zip.data) {
/* Attempt to deallocate the uncompressed page /* Attempt to deallocate the uncompressed page
if the whole block cannot be deallocted. */ if the whole block cannot be deallocted. */
......
This diff is collapsed.
...@@ -1907,7 +1907,7 @@ err_exit: ...@@ -1907,7 +1907,7 @@ err_exit:
mutex_enter(block_mutex); mutex_enter(block_mutex);
/* Discard the uncompressed page frame if possible. */ /* Discard the uncompressed page frame if possible. */
if (buf_LRU_free_block(bpage, FALSE) == BUF_LRU_FREED) { if (buf_LRU_free_block(bpage, FALSE)) {
mutex_exit(block_mutex); mutex_exit(block_mutex);
goto lookup; goto lookup;
...@@ -2310,12 +2310,8 @@ loop: ...@@ -2310,12 +2310,8 @@ loop:
if (block) { if (block) {
/* If the guess is a compressed page descriptor that /* If the guess is a compressed page descriptor that
has been allocated by buf_buddy_alloc(), it may have has been allocated by buf_page_alloc_descriptor(),
been invalidated by buf_buddy_relocate(). In that it may have been freed by buf_relocate(). */
case, block could point to something that happens to
contain the expected bits in block->page. Similarly,
the guess may be pointing to a buffer pool chunk that
has been released when resizing the buffer pool. */
if (!buf_block_is_uncompressed(buf_pool, block) if (!buf_block_is_uncompressed(buf_pool, block)
|| offset != block->page.offset || offset != block->page.offset
...@@ -2522,11 +2518,10 @@ wait_until_unfixed: ...@@ -2522,11 +2518,10 @@ wait_until_unfixed:
mutex_exit(&buf_pool->zip_mutex); mutex_exit(&buf_pool->zip_mutex);
buf_pool->n_pend_unzip++; buf_pool->n_pend_unzip++;
bpage->state = BUF_BLOCK_ZIP_FREE;
buf_buddy_free(buf_pool, bpage, sizeof *bpage);
buf_pool_mutex_exit(buf_pool); buf_pool_mutex_exit(buf_pool);
buf_page_free_descriptor(bpage);
/* Decompress the page and apply buffered operations /* Decompress the page and apply buffered operations
while not holding buf_pool->mutex or block->mutex. */ while not holding buf_pool->mutex or block->mutex. */
success = buf_zip_decompress(block, srv_use_checksums); success = buf_zip_decompress(block, srv_use_checksums);
...@@ -2572,7 +2567,7 @@ wait_until_unfixed: ...@@ -2572,7 +2567,7 @@ wait_until_unfixed:
/* Try to evict the block from the buffer pool, to use the /* Try to evict the block from the buffer pool, to use the
insert buffer (change buffer) as much as possible. */ insert buffer (change buffer) as much as possible. */
if (buf_LRU_free_block(&block->page, TRUE) == BUF_LRU_FREED) { if (buf_LRU_free_block(&block->page, TRUE)) {
mutex_exit(&block->mutex); mutex_exit(&block->mutex);
if (mode == BUF_GET_IF_IN_POOL_OR_WATCH) { if (mode == BUF_GET_IF_IN_POOL_OR_WATCH) {
/* Set the watch, as it would have /* Set the watch, as it would have
...@@ -3231,17 +3226,11 @@ err_exit: ...@@ -3231,17 +3226,11 @@ err_exit:
mutex_exit(&block->mutex); mutex_exit(&block->mutex);
} else { } else {
/* Defer buf_buddy_alloc() until after the block has
been found not to exist. The buf_buddy_alloc() and
buf_buddy_free() calls may be expensive because of
buf_buddy_relocate(). */
/* The compressed page must be allocated before the /* The compressed page must be allocated before the
control block (bpage), in order to avoid the control block (bpage), in order to avoid the
invocation of buf_buddy_relocate_block() on invocation of buf_buddy_relocate_block() on
uninitialized data. */ uninitialized data. */
data = buf_buddy_alloc(buf_pool, zip_size, &lru); data = buf_buddy_alloc(buf_pool, zip_size, &lru);
bpage = buf_buddy_alloc(buf_pool, sizeof *bpage, &lru);
/* Initialize the buf_pool pointer. */ /* Initialize the buf_pool pointer. */
bpage->buf_pool_index = buf_pool_index(buf_pool); bpage->buf_pool_index = buf_pool_index(buf_pool);
...@@ -3260,8 +3249,6 @@ err_exit: ...@@ -3260,8 +3249,6 @@ err_exit:
/* The block was added by some other thread. */ /* The block was added by some other thread. */
watch_page = NULL; watch_page = NULL;
bpage->state = BUF_BLOCK_ZIP_FREE;
buf_buddy_free(buf_pool, bpage, sizeof *bpage);
buf_buddy_free(buf_pool, data, zip_size); buf_buddy_free(buf_pool, data, zip_size);
bpage = NULL; bpage = NULL;
...@@ -3269,6 +3256,8 @@ err_exit: ...@@ -3269,6 +3256,8 @@ err_exit:
} }
} }
bpage = buf_page_alloc_descriptor();
page_zip_des_init(&bpage->zip); page_zip_des_init(&bpage->zip);
page_zip_set_size(&bpage->zip, zip_size); page_zip_set_size(&bpage->zip, zip_size);
bpage->zip.data = data; bpage->zip.data = data;
......
...@@ -353,31 +353,34 @@ scan_again: ...@@ -353,31 +353,34 @@ scan_again:
while (bpage != NULL) { while (bpage != NULL) {
buf_page_t* prev_bpage; buf_page_t* prev_bpage;
ibool prev_bpage_buf_fix = FALSE; mutex_t* block_mutex = NULL;
ut_a(buf_page_in_file(bpage)); ut_a(buf_page_in_file(bpage));
prev_bpage = UT_LIST_GET_PREV(LRU, bpage); prev_bpage = UT_LIST_GET_PREV(LRU, bpage);
/* bpage->space and bpage->io_fix are protected by /* bpage->space and bpage->io_fix are protected by
buf_pool->mutex and block_mutex. It is safe to check buf_pool_mutex and block_mutex. It is safe to check
them while holding buf_pool->mutex only. */ them while holding buf_pool_mutex only. */
if (buf_page_get_space(bpage) != id) { if (buf_page_get_space(bpage) != id) {
/* Skip this block, as it does not belong to /* Skip this block, as it does not belong to
the space that is being invalidated. */ the space that is being invalidated. */
goto next_page;
} else if (buf_page_get_io_fix(bpage) != BUF_IO_NONE) { } else if (buf_page_get_io_fix(bpage) != BUF_IO_NONE) {
/* We cannot remove this page during this scan /* We cannot remove this page during this scan
yet; maybe the system is currently reading it yet; maybe the system is currently reading it
in, or flushing the modifications to the file */ in, or flushing the modifications to the file */
all_freed = FALSE; all_freed = FALSE;
goto next_page;
} else { } else {
mutex_t* block_mutex = buf_page_get_mutex(bpage); block_mutex = buf_page_get_mutex(bpage);
mutex_enter(block_mutex); mutex_enter(block_mutex);
if (bpage->buf_fix_count > 0) { if (bpage->buf_fix_count > 0) {
mutex_exit(block_mutex);
/* We cannot remove this page during /* We cannot remove this page during
this scan yet; maybe the system is this scan yet; maybe the system is
currently reading it in, or flushing currently reading it in, or flushing
...@@ -387,106 +390,59 @@ scan_again: ...@@ -387,106 +390,59 @@ scan_again:
goto next_page; goto next_page;
} }
}
ut_ad(mutex_own(block_mutex));
#ifdef UNIV_DEBUG #ifdef UNIV_DEBUG
if (buf_debug_prints) { if (buf_debug_prints) {
fprintf(stderr, fprintf(stderr,
"Dropping space %lu page %lu\n", "Dropping space %lu page %lu\n",
(ulong) buf_page_get_space(bpage), (ulong) buf_page_get_space(bpage),
(ulong) buf_page_get_page_no(bpage)); (ulong) buf_page_get_page_no(bpage));
} }
#endif #endif
if (buf_page_get_state(bpage) != BUF_BLOCK_FILE_PAGE) { if (buf_page_get_state(bpage) != BUF_BLOCK_FILE_PAGE) {
/* This is a compressed-only block /* This is a compressed-only block
descriptor. Ensure that prev_bpage descriptor. Do nothing. */
cannot be relocated when bpage is freed. */ } else if (((buf_block_t*) bpage)->is_hashed) {
if (UNIV_LIKELY(prev_bpage != NULL)) { ulint page_no;
switch (buf_page_get_state( ulint zip_size;
prev_bpage)) {
case BUF_BLOCK_FILE_PAGE:
/* Descriptors of uncompressed
blocks will not be relocated,
because we are holding the
buf_pool->mutex. */
break;
case BUF_BLOCK_ZIP_PAGE:
case BUF_BLOCK_ZIP_DIRTY:
/* Descriptors of compressed-
only blocks can be relocated,
unless they are buffer-fixed.
Because both bpage and
prev_bpage are protected by
buf_pool_zip_mutex, it is
not necessary to acquire
further mutexes. */
ut_ad(&buf_pool->zip_mutex
== block_mutex);
ut_ad(mutex_own(block_mutex));
prev_bpage_buf_fix = TRUE;
prev_bpage->buf_fix_count++;
break;
default:
ut_error;
}
}
} else if (((buf_block_t*) bpage)->is_hashed) {
ulint page_no;
ulint zip_size;
buf_pool_mutex_exit(buf_pool); buf_pool_mutex_exit(buf_pool);
zip_size = buf_page_get_zip_size(bpage); zip_size = buf_page_get_zip_size(bpage);
page_no = buf_page_get_page_no(bpage); page_no = buf_page_get_page_no(bpage);
mutex_exit(block_mutex); mutex_exit(block_mutex);
/* Note that the following call will acquire
an S-latch on the page */
btr_search_drop_page_hash_when_freed( /* Note that the following call will acquire
id, zip_size, page_no); an S-latch on the page */
goto scan_again;
}
if (bpage->oldest_modification != 0) { btr_search_drop_page_hash_when_freed(
id, zip_size, page_no);
goto scan_again;
}
buf_flush_remove(bpage); if (bpage->oldest_modification != 0) {
}
/* Remove from the LRU list. */ buf_flush_remove(bpage);
}
if (buf_LRU_block_remove_hashed_page(bpage, TRUE) /* Remove from the LRU list. */
!= BUF_BLOCK_ZIP_FREE) {
buf_LRU_block_free_hashed_page((buf_block_t*)
bpage);
} else {
/* The block_mutex should have been
released by buf_LRU_block_remove_hashed_page()
when it returns BUF_BLOCK_ZIP_FREE. */
ut_ad(block_mutex == &buf_pool->zip_mutex);
ut_ad(!mutex_own(block_mutex));
if (prev_bpage_buf_fix) {
/* We temporarily buffer-fixed
prev_bpage, so that
buf_buddy_free() could not
relocate it, in case it was a
compressed-only block
descriptor. */
mutex_enter(block_mutex);
ut_ad(prev_bpage->buf_fix_count > 0);
prev_bpage->buf_fix_count--;
mutex_exit(block_mutex);
}
goto next_page_no_mutex; if (buf_LRU_block_remove_hashed_page(bpage, TRUE)
} != BUF_BLOCK_ZIP_FREE) {
next_page: buf_LRU_block_free_hashed_page((buf_block_t*) bpage);
mutex_exit(block_mutex); mutex_exit(block_mutex);
} else {
/* The block_mutex should have been released
by buf_LRU_block_remove_hashed_page() when it
returns BUF_BLOCK_ZIP_FREE. */
ut_ad(block_mutex == &buf_pool->zip_mutex);
ut_ad(!mutex_own(block_mutex));
} }
next_page:
next_page_no_mutex:
bpage = prev_bpage; bpage = prev_bpage;
} }
...@@ -602,7 +558,7 @@ buf_LRU_free_from_unzip_LRU_list( ...@@ -602,7 +558,7 @@ buf_LRU_free_from_unzip_LRU_list(
UNIV_LIKELY(block != NULL) && UNIV_LIKELY(distance > 0); UNIV_LIKELY(block != NULL) && UNIV_LIKELY(distance > 0);
block = UT_LIST_GET_PREV(unzip_LRU, block), distance--) { block = UT_LIST_GET_PREV(unzip_LRU, block), distance--) {
enum buf_lru_free_block_status freed; ibool freed;
ut_ad(buf_block_get_state(block) == BUF_BLOCK_FILE_PAGE); ut_ad(buf_block_get_state(block) == BUF_BLOCK_FILE_PAGE);
ut_ad(block->in_unzip_LRU_list); ut_ad(block->in_unzip_LRU_list);
...@@ -612,24 +568,9 @@ buf_LRU_free_from_unzip_LRU_list( ...@@ -612,24 +568,9 @@ buf_LRU_free_from_unzip_LRU_list(
freed = buf_LRU_free_block(&block->page, FALSE); freed = buf_LRU_free_block(&block->page, FALSE);
mutex_exit(&block->mutex); mutex_exit(&block->mutex);
switch (freed) { if (freed) {
case BUF_LRU_FREED:
return(TRUE); return(TRUE);
case BUF_LRU_CANNOT_RELOCATE:
/* If we failed to relocate, try
regular LRU eviction. */
return(FALSE);
case BUF_LRU_NOT_FREED:
/* The block was buffer-fixed or I/O-fixed.
Keep looking. */
continue;
} }
/* inappropriate return value from
buf_LRU_free_block() */
ut_error;
} }
return(FALSE); return(FALSE);
...@@ -662,10 +603,9 @@ buf_LRU_free_from_common_LRU_list( ...@@ -662,10 +603,9 @@ buf_LRU_free_from_common_LRU_list(
UNIV_LIKELY(bpage != NULL) && UNIV_LIKELY(distance > 0); UNIV_LIKELY(bpage != NULL) && UNIV_LIKELY(distance > 0);
bpage = UT_LIST_GET_PREV(LRU, bpage), distance--) { bpage = UT_LIST_GET_PREV(LRU, bpage), distance--) {
enum buf_lru_free_block_status freed; ibool freed;
unsigned accessed; unsigned accessed;
mutex_t* block_mutex mutex_t* block_mutex = buf_page_get_mutex(bpage);
= buf_page_get_mutex(bpage);
ut_ad(buf_page_in_file(bpage)); ut_ad(buf_page_in_file(bpage));
ut_ad(bpage->in_LRU_list); ut_ad(bpage->in_LRU_list);
...@@ -675,8 +615,7 @@ buf_LRU_free_from_common_LRU_list( ...@@ -675,8 +615,7 @@ buf_LRU_free_from_common_LRU_list(
freed = buf_LRU_free_block(bpage, TRUE); freed = buf_LRU_free_block(bpage, TRUE);
mutex_exit(block_mutex); mutex_exit(block_mutex);
switch (freed) { if (freed) {
case BUF_LRU_FREED:
/* Keep track of pages that are evicted without /* Keep track of pages that are evicted without
ever being accessed. This gives us a measure of ever being accessed. This gives us a measure of
the effectiveness of readahead */ the effectiveness of readahead */
...@@ -684,21 +623,7 @@ buf_LRU_free_from_common_LRU_list( ...@@ -684,21 +623,7 @@ buf_LRU_free_from_common_LRU_list(
++buf_pool->stat.n_ra_pages_evicted; ++buf_pool->stat.n_ra_pages_evicted;
} }
return(TRUE); return(TRUE);
case BUF_LRU_NOT_FREED:
/* The block was dirty, buffer-fixed, or I/O-fixed.
Keep looking. */
continue;
case BUF_LRU_CANNOT_RELOCATE:
/* This should never occur, because we
want to discard the compressed page too. */
break;
} }
/* inappropriate return value from
buf_LRU_free_block() */
ut_error;
} }
return(FALSE); return(FALSE);
...@@ -1424,17 +1349,16 @@ buf_LRU_make_block_old( ...@@ -1424,17 +1349,16 @@ buf_LRU_make_block_old(
Try to free a block. If bpage is a descriptor of a compressed-only Try to free a block. If bpage is a descriptor of a compressed-only
page, the descriptor object will be freed as well. page, the descriptor object will be freed as well.
NOTE: If this function returns BUF_LRU_FREED, it will temporarily NOTE: If this function returns TRUE, it will temporarily
release buf_pool->mutex. Furthermore, the page frame will no longer be release buf_pool->mutex. Furthermore, the page frame will no longer be
accessible via bpage. accessible via bpage.
The caller must hold buf_pool->mutex and buf_page_get_mutex(bpage) and The caller must hold buf_pool->mutex and buf_page_get_mutex(bpage) and
release these two mutexes after the call. No other release these two mutexes after the call. No other
buf_page_get_mutex() may be held when calling this function. buf_page_get_mutex() may be held when calling this function.
@return BUF_LRU_FREED if freed, BUF_LRU_CANNOT_RELOCATE or @return TRUE if freed, FALSE otherwise. */
BUF_LRU_NOT_FREED otherwise. */
UNIV_INTERN UNIV_INTERN
enum buf_lru_free_block_status ibool
buf_LRU_free_block( buf_LRU_free_block(
/*===============*/ /*===============*/
buf_page_t* bpage, /*!< in: block to be freed */ buf_page_t* bpage, /*!< in: block to be freed */
...@@ -1460,7 +1384,7 @@ buf_LRU_free_block( ...@@ -1460,7 +1384,7 @@ buf_LRU_free_block(
if (!buf_page_can_relocate(bpage)) { if (!buf_page_can_relocate(bpage)) {
/* Do not free buffer-fixed or I/O-fixed blocks. */ /* Do not free buffer-fixed or I/O-fixed blocks. */
return(BUF_LRU_NOT_FREED); return(FALSE);
} }
#ifdef UNIV_IBUF_COUNT_DEBUG #ifdef UNIV_IBUF_COUNT_DEBUG
...@@ -1472,7 +1396,7 @@ buf_LRU_free_block( ...@@ -1472,7 +1396,7 @@ buf_LRU_free_block(
/* Do not completely free dirty blocks. */ /* Do not completely free dirty blocks. */
if (bpage->oldest_modification) { if (bpage->oldest_modification) {
return(BUF_LRU_NOT_FREED); return(FALSE);
} }
} else if (bpage->oldest_modification) { } else if (bpage->oldest_modification) {
/* Do not completely free dirty blocks. */ /* Do not completely free dirty blocks. */
...@@ -1480,7 +1404,7 @@ buf_LRU_free_block( ...@@ -1480,7 +1404,7 @@ buf_LRU_free_block(
if (buf_page_get_state(bpage) != BUF_BLOCK_FILE_PAGE) { if (buf_page_get_state(bpage) != BUF_BLOCK_FILE_PAGE) {
ut_ad(buf_page_get_state(bpage) ut_ad(buf_page_get_state(bpage)
== BUF_BLOCK_ZIP_DIRTY); == BUF_BLOCK_ZIP_DIRTY);
return(BUF_LRU_NOT_FREED); return(FALSE);
} }
goto alloc; goto alloc;
...@@ -1489,14 +1413,8 @@ buf_LRU_free_block( ...@@ -1489,14 +1413,8 @@ buf_LRU_free_block(
If it cannot be allocated (without freeing a block If it cannot be allocated (without freeing a block
from the LRU list), refuse to free bpage. */ from the LRU list), refuse to free bpage. */
alloc: alloc:
buf_pool_mutex_exit_forbid(buf_pool); b = buf_page_alloc_descriptor();
b = buf_buddy_alloc(buf_pool, sizeof *b, NULL); ut_a(b);
buf_pool_mutex_exit_allow(buf_pool);
if (UNIV_UNLIKELY(!b)) {
return(BUF_LRU_CANNOT_RELOCATE);
}
memcpy(b, bpage, sizeof *b); memcpy(b, bpage, sizeof *b);
} }
...@@ -1669,7 +1587,7 @@ alloc: ...@@ -1669,7 +1587,7 @@ alloc:
mutex_enter(block_mutex); mutex_enter(block_mutex);
} }
return(BUF_LRU_FREED); return(TRUE);
} }
/******************************************************************//** /******************************************************************//**
...@@ -1899,11 +1817,9 @@ buf_LRU_block_remove_hashed_page( ...@@ -1899,11 +1817,9 @@ buf_LRU_block_remove_hashed_page(
buf_pool, bpage->zip.data, buf_pool, bpage->zip.data,
page_zip_get_size(&bpage->zip)); page_zip_get_size(&bpage->zip));
bpage->state = BUF_BLOCK_ZIP_FREE;
buf_buddy_free(buf_pool, bpage, sizeof(*bpage));
buf_pool_mutex_exit_allow(buf_pool); buf_pool_mutex_exit_allow(buf_pool);
buf_page_free_descriptor(bpage);
UNIV_MEM_UNDESC(bpage);
return(BUF_BLOCK_ZIP_FREE); return(BUF_BLOCK_ZIP_FREE);
case BUF_BLOCK_FILE_PAGE: case BUF_BLOCK_FILE_PAGE:
......
/***************************************************************************** /*****************************************************************************
Copyright (c) 2006, 2009, Innobase Oy. All Rights Reserved. Copyright (c) 2006, 2011, Oracle and/or its affiliates. All Rights Reserved.
This program is free software; you can redistribute it and/or modify it under 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 the terms of the GNU General Public License as published by the Free Software
...@@ -37,25 +37,24 @@ Created December 2006 by Marko Makela ...@@ -37,25 +37,24 @@ Created December 2006 by Marko Makela
/**********************************************************************//** /**********************************************************************//**
Allocate a block. The thread calling this function must hold Allocate a block. The thread calling this function must hold
buf_pool->mutex and must not hold buf_pool->zip_mutex or any buf_pool->mutex and must not hold buf_pool->zip_mutex or any
block->mutex. The buf_pool->mutex may only be released and reacquired block->mutex. The buf_pool_mutex may be released and reacquired.
if lru != NULL. This function should only be used for allocating This function should only be used for allocating compressed page frames.
compressed page frames or control blocks (buf_page_t). Allocated @return allocated block, never NULL */
control blocks must be properly initialized immediately after
buf_buddy_alloc() has returned the memory, before releasing
buf_pool->mutex.
@return allocated block, possibly NULL if lru == NULL */
UNIV_INLINE UNIV_INLINE
void* void*
buf_buddy_alloc( buf_buddy_alloc(
/*============*/ /*============*/
buf_pool_t* buf_pool, buf_pool_t* buf_pool, /*!< in: buffer pool in which
/*!< buffer pool in which the block resides */ the page resides */
ulint size, /*!< in: block size, up to UNIV_PAGE_SIZE */ ulint size, /*!< in: compressed page size
ibool* lru) /*!< in: pointer to a variable that will be assigned (between PAGE_ZIP_MIN_SIZE and
TRUE if storage was allocated from the LRU list UNIV_PAGE_SIZE) */
and buf_pool->mutex was temporarily released, ibool* lru) /*!< in: pointer to a variable
or NULL if the LRU list should not be used */ that will be assigned TRUE if
__attribute__((malloc)); storage was allocated from the
LRU list and buf_pool->mutex was
temporarily released */
__attribute__((malloc, nonnull));
/**********************************************************************//** /**********************************************************************//**
Release a block. */ Release a block. */
......
/***************************************************************************** /*****************************************************************************
Copyright (c) 2006, 2009, Innobase Oy. All Rights Reserved. Copyright (c) 2006, 2011, Oracle and/or its affiliates. All Rights Reserved.
This program is free software; you can redistribute it and/or modify it under 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 the terms of the GNU General Public License as published by the Free Software
...@@ -36,8 +36,8 @@ Created December 2006 by Marko Makela ...@@ -36,8 +36,8 @@ Created December 2006 by Marko Makela
/**********************************************************************//** /**********************************************************************//**
Allocate a block. The thread calling this function must hold Allocate a block. The thread calling this function must hold
buf_pool->mutex and must not hold buf_pool->zip_mutex or any block->mutex. buf_pool->mutex and must not hold buf_pool->zip_mutex or any block->mutex.
The buf_pool->mutex may only be released and reacquired if lru != NULL. The buf_pool_mutex may be released and reacquired.
@return allocated block, possibly NULL if lru==NULL */ @return allocated block, never NULL */
UNIV_INTERN UNIV_INTERN
void* void*
buf_buddy_alloc_low( buf_buddy_alloc_low(
...@@ -48,9 +48,8 @@ buf_buddy_alloc_low( ...@@ -48,9 +48,8 @@ buf_buddy_alloc_low(
or BUF_BUDDY_SIZES */ or BUF_BUDDY_SIZES */
ibool* lru) /*!< in: pointer to a variable that will be assigned ibool* lru) /*!< in: pointer to a variable that will be assigned
TRUE if storage was allocated from the LRU list TRUE if storage was allocated from the LRU list
and buf_pool->mutex was temporarily released, and buf_pool_mutex was temporarily released */
or NULL if the LRU list should not be used */ __attribute__((malloc, nonnull));
__attribute__((malloc));
/**********************************************************************//** /**********************************************************************//**
Deallocate a block. */ Deallocate a block. */
...@@ -77,6 +76,8 @@ buf_buddy_get_slot( ...@@ -77,6 +76,8 @@ buf_buddy_get_slot(
ulint i; ulint i;
ulint s; ulint s;
ut_ad(size >= PAGE_ZIP_MIN_SIZE);
for (i = 0, s = BUF_BUDDY_LOW; s < size; i++, s <<= 1) { for (i = 0, s = BUF_BUDDY_LOW; s < size; i++, s <<= 1) {
} }
...@@ -87,29 +88,28 @@ buf_buddy_get_slot( ...@@ -87,29 +88,28 @@ buf_buddy_get_slot(
/**********************************************************************//** /**********************************************************************//**
Allocate a block. The thread calling this function must hold Allocate a block. The thread calling this function must hold
buf_pool->mutex and must not hold buf_pool->zip_mutex or any buf_pool->mutex and must not hold buf_pool->zip_mutex or any
block->mutex. The buf_pool->mutex may only be released and reacquired block->mutex. The buf_pool_mutex may be released and reacquired.
if lru != NULL. This function should only be used for allocating This function should only be used for allocating compressed page frames.
compressed page frames or control blocks (buf_page_t). Allocated @return allocated block, never NULL */
control blocks must be properly initialized immediately after
buf_buddy_alloc() has returned the memory, before releasing
buf_pool->mutex.
@return allocated block, possibly NULL if lru == NULL */
UNIV_INLINE UNIV_INLINE
void* void*
buf_buddy_alloc( buf_buddy_alloc(
/*============*/ /*============*/
buf_pool_t* buf_pool, /*!< in: buffer pool in which buf_pool_t* buf_pool, /*!< in: buffer pool in which
the page resides */ the page resides */
ulint size, /*!< in: block size, up to ulint size, /*!< in: compressed page size
UNIV_PAGE_SIZE */ (between PAGE_ZIP_MIN_SIZE and
UNIV_PAGE_SIZE) */
ibool* lru) /*!< in: pointer to a variable ibool* lru) /*!< in: pointer to a variable
that will be assigned TRUE if that will be assigned TRUE if
storage was allocated from the storage was allocated from the
LRU list and buf_pool->mutex was LRU list and buf_pool->mutex was
temporarily released, or NULL if temporarily released */
the LRU list should not be used */
{ {
ut_ad(buf_pool_mutex_own(buf_pool)); ut_ad(buf_pool_mutex_own(buf_pool));
ut_ad(ut_is_2pow(size));
ut_ad(size >= PAGE_ZIP_MIN_SIZE);
ut_ad(size <= UNIV_PAGE_SIZE);
return(buf_buddy_alloc_low(buf_pool, buf_buddy_get_slot(size), lru)); return(buf_buddy_alloc_low(buf_pool, buf_buddy_get_slot(size), lru));
} }
...@@ -127,6 +127,9 @@ buf_buddy_free( ...@@ -127,6 +127,9 @@ buf_buddy_free(
UNIV_PAGE_SIZE */ UNIV_PAGE_SIZE */
{ {
ut_ad(buf_pool_mutex_own(buf_pool)); ut_ad(buf_pool_mutex_own(buf_pool));
ut_ad(ut_is_2pow(size));
ut_ad(size >= PAGE_ZIP_MIN_SIZE);
ut_ad(size <= UNIV_PAGE_SIZE);
buf_buddy_free_low(buf_pool, buf, buf_buddy_get_slot(size)); buf_buddy_free_low(buf_pool, buf, buf_buddy_get_slot(size));
} }
......
...@@ -269,6 +269,22 @@ ib_uint64_t ...@@ -269,6 +269,22 @@ ib_uint64_t
buf_pool_get_oldest_modification(void); buf_pool_get_oldest_modification(void);
/*==================================*/ /*==================================*/
/********************************************************************//** /********************************************************************//**
Allocates a buf_page_t descriptor. This function must succeed. In case
of failure we assert in this function. */
UNIV_INLINE
buf_page_t*
buf_page_alloc_descriptor(void)
/*===========================*/
__attribute__((malloc));
/********************************************************************//**
Free a buf_page_t descriptor. */
UNIV_INLINE
void
buf_page_free_descriptor(
/*=====================*/
buf_page_t* bpage) /*!< in: bpage descriptor to free. */
__attribute__((nonnull));
/********************************************************************//**
Allocates a buffer block. Allocates a buffer block.
@return own: the allocated block, in state BUF_BLOCK_MEMORY */ @return own: the allocated block, in state BUF_BLOCK_MEMORY */
UNIV_INTERN UNIV_INTERN
......
...@@ -753,6 +753,35 @@ buf_block_get_lock_hash_val( ...@@ -753,6 +753,35 @@ buf_block_get_lock_hash_val(
return(block->lock_hash_val); return(block->lock_hash_val);
} }
/********************************************************************//**
Allocates a buf_page_t descriptor. This function must succeed. In case
of failure we assert in this function.
@return: the allocated descriptor. */
UNIV_INLINE
buf_page_t*
buf_page_alloc_descriptor(void)
/*===========================*/
{
buf_page_t* bpage;
bpage = (buf_page_t*) ut_malloc(sizeof *bpage);
ut_d(memset(bpage, 0, sizeof *bpage));
UNIV_MEM_ALLOC(bpage, sizeof *bpage);
return(bpage);
}
/********************************************************************//**
Free a buf_page_t descriptor. */
UNIV_INLINE
void
buf_page_free_descriptor(
/*=====================*/
buf_page_t* bpage) /*!< in: bpage descriptor to free. */
{
ut_free(bpage);
}
/********************************************************************//** /********************************************************************//**
Frees a buffer block which does not contain a file page. */ Frees a buffer block which does not contain a file page. */
UNIV_INLINE UNIV_INLINE
......
...@@ -30,18 +30,6 @@ Created 11/5/1995 Heikki Tuuri ...@@ -30,18 +30,6 @@ Created 11/5/1995 Heikki Tuuri
#include "ut0byte.h" #include "ut0byte.h"
#include "buf0types.h" #include "buf0types.h"
/** The return type of buf_LRU_free_block() */
enum buf_lru_free_block_status {
/** freed */
BUF_LRU_FREED = 0,
/** not freed because the caller asked to remove the
uncompressed frame but the control block cannot be
relocated */
BUF_LRU_CANNOT_RELOCATE,
/** not freed because of some other reason */
BUF_LRU_NOT_FREED
};
/******************************************************************//** /******************************************************************//**
Tries to remove LRU flushed blocks from the end of the LRU list and put them Tries to remove LRU flushed blocks from the end of the LRU list and put them
to the free list. This is beneficial for the efficiency of the insert buffer to the free list. This is beneficial for the efficiency of the insert buffer
...@@ -99,17 +87,16 @@ buf_LRU_insert_zip_clean( ...@@ -99,17 +87,16 @@ buf_LRU_insert_zip_clean(
Try to free a block. If bpage is a descriptor of a compressed-only Try to free a block. If bpage is a descriptor of a compressed-only
page, the descriptor object will be freed as well. page, the descriptor object will be freed as well.
NOTE: If this function returns BUF_LRU_FREED, it will temporarily NOTE: If this function returns TRUE, it will temporarily
release buf_pool->mutex. Furthermore, the page frame will no longer be release buf_pool->mutex. Furthermore, the page frame will no longer be
accessible via bpage. accessible via bpage.
The caller must hold buf_pool->mutex and buf_page_get_mutex(bpage) and The caller must hold buf_pool->mutex and buf_page_get_mutex(bpage) and
release these two mutexes after the call. No other release these two mutexes after the call. No other
buf_page_get_mutex() may be held when calling this function. buf_page_get_mutex() may be held when calling this function.
@return BUF_LRU_FREED if freed, BUF_LRU_CANNOT_RELOCATE or @return TRUE if freed, FALSE otherwise. */
BUF_LRU_NOT_FREED otherwise. */
UNIV_INTERN UNIV_INTERN
enum buf_lru_free_block_status ibool
buf_LRU_free_block( buf_LRU_free_block(
/*===============*/ /*===============*/
buf_page_t* bpage, /*!< in: block to be freed */ buf_page_t* bpage, /*!< in: block to be freed */
......
/***************************************************************************** /*****************************************************************************
Copyright (c) 1995, 2009, Innobase Oy. All Rights Reserved. Copyright (c) 1995, 2011, Oracle and/or its affiliates. All Rights Reserved
This program is free software; you can redistribute it and/or modify it under 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 the terms of the GNU General Public License as published by the Free Software
...@@ -26,6 +26,8 @@ Created 11/17/1995 Heikki Tuuri ...@@ -26,6 +26,8 @@ Created 11/17/1995 Heikki Tuuri
#ifndef buf0types_h #ifndef buf0types_h
#define buf0types_h #define buf0types_h
#include "page0types.h"
/** Buffer page (uncompressed or compressed) */ /** Buffer page (uncompressed or compressed) */
typedef struct buf_page_struct buf_page_t; typedef struct buf_page_struct buf_page_t;
/** Buffer block for which an uncompressed page exists */ /** Buffer block for which an uncompressed page exists */
...@@ -60,17 +62,10 @@ enum buf_io_fix { ...@@ -60,17 +62,10 @@ enum buf_io_fix {
/** Parameters of binary buddy system for compressed pages (buf0buddy.h) */ /** Parameters of binary buddy system for compressed pages (buf0buddy.h) */
/* @{ */ /* @{ */
#if UNIV_WORD_SIZE <= 4 /* 32-bit system */ #define BUF_BUDDY_LOW_SHIFT PAGE_ZIP_MIN_SIZE_SHIFT
/** Base-2 logarithm of the smallest buddy block size */
# define BUF_BUDDY_LOW_SHIFT 6
#else /* 64-bit system */
/** Base-2 logarithm of the smallest buddy block size */
# define BUF_BUDDY_LOW_SHIFT 7
#endif
#define BUF_BUDDY_LOW (1 << BUF_BUDDY_LOW_SHIFT) #define BUF_BUDDY_LOW (1 << BUF_BUDDY_LOW_SHIFT)
/*!< minimum block size in the binary
buddy system; must be at least
sizeof(buf_page_t) */
#define BUF_BUDDY_SIZES (UNIV_PAGE_SIZE_SHIFT - BUF_BUDDY_LOW_SHIFT) #define BUF_BUDDY_SIZES (UNIV_PAGE_SIZE_SHIFT - BUF_BUDDY_LOW_SHIFT)
/*!< number of buddy sizes */ /*!< number of buddy sizes */
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment