twisterp2pnetworkbittorrentblockchainipv6microbloggingsocial-networkdhtdecentralizedtwister-ipv6twister-coretwisterarmyp2p-networktwister-server
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
242 lines
6.7 KiB
242 lines
6.7 KiB
/* |
|
|
|
Copyright (c) 2007-2012, Arvid Norberg |
|
All rights reserved. |
|
|
|
Redistribution and use in source and binary forms, with or without |
|
modification, are permitted provided that the following conditions |
|
are met: |
|
|
|
* Redistributions of source code must retain the above copyright |
|
notice, this list of conditions and the following disclaimer. |
|
* Redistributions in binary form must reproduce the above copyright |
|
notice, this list of conditions and the following disclaimer in |
|
the documentation and/or other materials provided with the distribution. |
|
* Neither the name of the author nor the names of its |
|
contributors may be used to endorse or promote products derived |
|
from this software without specific prior written permission. |
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
POSSIBILITY OF SUCH DAMAGE. |
|
|
|
*/ |
|
|
|
#include "libtorrent/disk_buffer_pool.hpp" |
|
#include "libtorrent/assert.hpp" |
|
#include <algorithm> |
|
|
|
#if TORRENT_USE_MLOCK && !defined TORRENT_WINDOWS |
|
#include <sys/mman.h> |
|
#endif |
|
|
|
#ifdef TORRENT_DISK_STATS |
|
#include "libtorrent/time.hpp" |
|
#endif |
|
|
|
namespace libtorrent |
|
{ |
|
disk_buffer_pool::disk_buffer_pool(int block_size) |
|
: m_block_size(block_size) |
|
, m_in_use(0) |
|
#ifndef TORRENT_DISABLE_POOL_ALLOCATOR |
|
, m_using_pool_allocator(false) |
|
, m_pool(block_size, m_settings.cache_buffer_chunk_size) |
|
#endif |
|
{ |
|
#if defined TORRENT_DISK_STATS || defined TORRENT_STATS |
|
m_allocations = 0; |
|
#endif |
|
#ifdef TORRENT_DISK_STATS |
|
m_log.open("disk_buffers.log", std::ios::trunc); |
|
m_categories["read cache"] = 0; |
|
m_categories["write cache"] = 0; |
|
|
|
m_disk_access_log.open("disk_access.log", std::ios::trunc); |
|
#endif |
|
#if defined TORRENT_DEBUG || TORRENT_RELEASE_ASSERTS |
|
m_magic = 0x1337; |
|
#endif |
|
} |
|
|
|
#if defined TORRENT_DEBUG || TORRENT_RELEASE_ASSERTS |
|
disk_buffer_pool::~disk_buffer_pool() |
|
{ |
|
TORRENT_ASSERT(m_magic == 0x1337); |
|
m_magic = 0; |
|
} |
|
#endif |
|
|
|
#if defined TORRENT_DEBUG || TORRENT_RELEASE_ASSERTS || defined TORRENT_DISK_STATS |
|
bool disk_buffer_pool::is_disk_buffer(char* buffer |
|
, mutex::scoped_lock& l) const |
|
{ |
|
TORRENT_ASSERT(m_magic == 0x1337); |
|
#ifdef TORRENT_DISK_STATS |
|
if (m_buf_to_category.find(buffer) |
|
== m_buf_to_category.end()) return false; |
|
#endif |
|
#ifdef TORRENT_DISABLE_POOL_ALLOCATOR |
|
return true; |
|
#else |
|
if (m_using_pool_allocator) |
|
return m_pool.is_from(buffer); |
|
else |
|
return true; |
|
#endif |
|
} |
|
|
|
bool disk_buffer_pool::is_disk_buffer(char* buffer) const |
|
{ |
|
mutex::scoped_lock l(m_pool_mutex); |
|
return is_disk_buffer(buffer, l); |
|
} |
|
#endif |
|
|
|
char* disk_buffer_pool::allocate_buffer(char const* category) |
|
{ |
|
mutex::scoped_lock l(m_pool_mutex); |
|
TORRENT_ASSERT(m_magic == 0x1337); |
|
char* ret; |
|
#ifdef TORRENT_DISABLE_POOL_ALLOCATOR |
|
ret = page_aligned_allocator::malloc(m_block_size); |
|
#else |
|
if (m_using_pool_allocator) |
|
{ |
|
ret = (char*)m_pool.malloc(); |
|
m_pool.set_next_size(m_settings.cache_buffer_chunk_size); |
|
} |
|
else |
|
{ |
|
ret = page_aligned_allocator::malloc(m_block_size); |
|
} |
|
#endif |
|
++m_in_use; |
|
#if TORRENT_USE_MLOCK |
|
if (m_settings.lock_disk_cache) |
|
{ |
|
#ifdef TORRENT_WINDOWS |
|
VirtualLock(ret, m_block_size); |
|
#else |
|
mlock(ret, m_block_size); |
|
#endif |
|
} |
|
#endif |
|
|
|
#if defined TORRENT_DISK_STATS || defined TORRENT_STATS |
|
++m_allocations; |
|
#endif |
|
#ifdef TORRENT_DISK_STATS |
|
++m_categories[category]; |
|
m_buf_to_category[ret] = category; |
|
m_log << log_time() << " " << category << ": " << m_categories[category] << "\n"; |
|
#endif |
|
TORRENT_ASSERT(ret == 0 || is_disk_buffer(ret, l)); |
|
return ret; |
|
} |
|
|
|
#ifdef TORRENT_DISK_STATS |
|
void disk_buffer_pool::rename_buffer(char* buf, char const* category) |
|
{ |
|
mutex::scoped_lock l(m_pool_mutex); |
|
TORRENT_ASSERT(is_disk_buffer(buf, l)); |
|
TORRENT_ASSERT(m_categories.find(m_buf_to_category[buf]) |
|
!= m_categories.end()); |
|
std::string const& prev_category = m_buf_to_category[buf]; |
|
--m_categories[prev_category]; |
|
m_log << log_time() << " " << prev_category << ": " << m_categories[prev_category] << "\n"; |
|
|
|
++m_categories[category]; |
|
m_buf_to_category[buf] = category; |
|
m_log << log_time() << " " << category << ": " << m_categories[category] << "\n"; |
|
TORRENT_ASSERT(m_categories.find(m_buf_to_category[buf]) |
|
!= m_categories.end()); |
|
} |
|
#endif |
|
|
|
void disk_buffer_pool::free_multiple_buffers(char** bufvec, int numbufs) |
|
{ |
|
char** end = bufvec + numbufs; |
|
// sort the pointers in order to maximize cache hits |
|
std::sort(bufvec, end); |
|
|
|
mutex::scoped_lock l(m_pool_mutex); |
|
for (; bufvec != end; ++bufvec) |
|
{ |
|
char* buf = *bufvec; |
|
TORRENT_ASSERT(buf); |
|
free_buffer_impl(buf, l);; |
|
} |
|
} |
|
|
|
void disk_buffer_pool::free_buffer(char* buf) |
|
{ |
|
mutex::scoped_lock l(m_pool_mutex); |
|
free_buffer_impl(buf, l); |
|
} |
|
|
|
void disk_buffer_pool::free_buffer_impl(char* buf, mutex::scoped_lock& l) |
|
{ |
|
TORRENT_ASSERT(buf); |
|
TORRENT_ASSERT(m_magic == 0x1337); |
|
TORRENT_ASSERT(is_disk_buffer(buf, l)); |
|
#if defined TORRENT_DISK_STATS || defined TORRENT_STATS |
|
--m_allocations; |
|
#endif |
|
#ifdef TORRENT_DISK_STATS |
|
TORRENT_ASSERT(m_categories.find(m_buf_to_category[buf]) |
|
!= m_categories.end()); |
|
std::string const& category = m_buf_to_category[buf]; |
|
--m_categories[category]; |
|
m_log << log_time() << " " << category << ": " << m_categories[category] << "\n"; |
|
m_buf_to_category.erase(buf); |
|
#endif |
|
#if TORRENT_USE_MLOCK |
|
if (m_settings.lock_disk_cache) |
|
{ |
|
#ifdef TORRENT_WINDOWS |
|
VirtualUnlock(buf, m_block_size); |
|
#else |
|
munlock(buf, m_block_size); |
|
#endif |
|
} |
|
#endif |
|
#ifdef TORRENT_DISABLE_POOL_ALLOCATOR |
|
page_aligned_allocator::free(buf); |
|
#else |
|
if (m_using_pool_allocator) |
|
m_pool.free(buf); |
|
else |
|
page_aligned_allocator::free(buf); |
|
#endif |
|
--m_in_use; |
|
|
|
#ifndef TORRENT_DISABLE_POOL_ALLOCATOR |
|
// should we switch which allocator to use? |
|
if (m_in_use == 0 && m_settings.use_disk_cache_pool != m_using_pool_allocator) |
|
{ |
|
m_pool.release_memory(); |
|
m_using_pool_allocator = m_settings.use_disk_cache_pool; |
|
} |
|
#endif |
|
} |
|
|
|
void disk_buffer_pool::release_memory() |
|
{ |
|
TORRENT_ASSERT(m_magic == 0x1337); |
|
#ifndef TORRENT_DISABLE_POOL_ALLOCATOR |
|
mutex::scoped_lock l(m_pool_mutex); |
|
if (m_using_pool_allocator) |
|
m_pool.release_memory(); |
|
#endif |
|
} |
|
} |
|
|
|
|