Refactor WriteBufferManager::CacheRep into CacheReservationManager (#8506)
Summary: Context: To help cap various memory usage by a single limit of the block cache capacity, we charge the memory usage through inserting/releasing dummy entries in the block cache. CacheReservationManager is such a class (non thread-safe) responsible for inserting/removing dummy entries to reserve cache space for memory used by the class user. - Refactored the inner private class CacheRep of WriteBufferManager into public CacheReservationManager class for reusability such as for https://github.com/facebook/rocksdb/pull/8428 - Encapsulated implementation details of cache key generation and dummy entries insertion/release in cache reservation as discussed in https://github.com/facebook/rocksdb/pull/8506#discussion_r666550838 - Consolidated increase/decrease cache reservation into one API - UpdateCacheReservation. - Adjusted the previous dummy entry release algorithm in decreasing cache reservation to be loop-releasing dummy entries to stay symmetric to dummy entry insertion algorithm - Made the previous dummy entry release algorithm in delayed decrease mode more aggressive for better decreasing cache reservation when memory used is less likely to increase back. Previously, the algorithms only release 1 dummy entries when new_mem_used < 3/4 * cache_allocated_size_ and cache_allocated_size_ - kSizeDummyEntry > new_mem_used. Now, the algorithms loop-releases as many dummy entries as possible when new_mem_used < 3/4 * cache_allocated_size_. - Updated WriteBufferManager's test cases to adapt to changes on the release algorithm mentioned above and left comment for some test cases for clarity - Replaced the previous cache key prefix generation (utilizing object address related to the cache client) with one that utilizes Cache->NewID() to prevent cache-key collision among dummy entry clients sharing the same cache. The specific collision we are preventing happens when the object address is reused for a new cache-key prefix while the old cache-key using that same object address in its prefix still exists in the cache. This could happen due to that, under LRU cache policy, there is a possible delay in releasing a cache entry after the cache client object owning that cache entry get deallocated. In this case, the object address related to the cache client object can get reused for other client object to generate a new cache-key prefix. This prefix generation can be made obsolete after Peter's unification of all the code generating cache key, mentioned in https://github.com/facebook/rocksdb/pull/8506#discussion_r667265255 Pull Request resolved: https://github.com/facebook/rocksdb/pull/8506 Test Plan: - Passing the added unit tests cache_reservation_manager_test.cc - Passing existing and adjusted write_buffer_manager_test.cc Reviewed By: ajkr Differential Revision: D29644135 Pulled By: hx235 fbshipit-source-id: 0fc93fbfe4a40bb41be85c314f8f2bafa8b741f7main
Hui Xiao
3 years ago
committed by
Facebook GitHub Bot
parent
c521f22a1e
commit
74cfe7db60
@ -0,0 +1,128 @@ |
||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||
// This source code is licensed under both the GPLv2 (found in the
|
||||
// COPYING file in the root directory) and Apache 2.0 License
|
||||
// (found in the LICENSE.Apache file in the root directory).
|
||||
//
|
||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style license that can be
|
||||
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
||||
#include "cache/cache_reservation_manager.h" |
||||
|
||||
#include <cassert> |
||||
#include <cstddef> |
||||
#include <cstring> |
||||
#include <memory> |
||||
|
||||
#include "cache/cache_entry_roles.h" |
||||
#include "rocksdb/cache.h" |
||||
#include "rocksdb/slice.h" |
||||
#include "rocksdb/status.h" |
||||
#include "table/block_based/block_based_table_reader.h" |
||||
#include "util/coding.h" |
||||
|
||||
namespace ROCKSDB_NAMESPACE { |
||||
CacheReservationManager::CacheReservationManager(std::shared_ptr<Cache> cache, |
||||
bool delayed_decrease) |
||||
: delayed_decrease_(delayed_decrease), cache_allocated_size_(0) { |
||||
assert(cache != nullptr); |
||||
cache_ = cache; |
||||
std::memset(cache_key_, 0, kCacheKeyPrefixSize + kMaxVarint64Length); |
||||
EncodeVarint64(cache_key_, cache_->NewId()); |
||||
} |
||||
|
||||
CacheReservationManager::~CacheReservationManager() { |
||||
for (auto* handle : dummy_handles_) { |
||||
cache_->Release(handle, true); |
||||
} |
||||
} |
||||
|
||||
template <CacheEntryRole R> |
||||
Status CacheReservationManager::UpdateCacheReservation( |
||||
std::size_t new_mem_used) { |
||||
std::size_t cur_cache_allocated_size = |
||||
cache_allocated_size_.load(std::memory_order_relaxed); |
||||
if (new_mem_used == cur_cache_allocated_size) { |
||||
return Status::OK(); |
||||
} else if (new_mem_used > cur_cache_allocated_size) { |
||||
Status s = IncreaseCacheReservation<R>(new_mem_used); |
||||
return s; |
||||
} else { |
||||
// In delayed decrease mode, we don't decrease cache reservation
|
||||
// untill the memory usage is less than 3/4 of what we reserve
|
||||
// in the cache.
|
||||
// We do this because
|
||||
// (1) Dummy entry insertion is expensive in block cache
|
||||
// (2) Delayed releasing previously inserted dummy entries can save such
|
||||
// expensive dummy entry insertion on memory increase in the near future,
|
||||
// which is likely to happen when the memory usage is greater than or equal
|
||||
// to 3/4 of what we reserve
|
||||
if (delayed_decrease_ && new_mem_used >= cur_cache_allocated_size / 4 * 3) { |
||||
return Status::OK(); |
||||
} else { |
||||
Status s = DecreaseCacheReservation(new_mem_used); |
||||
return s; |
||||
} |
||||
} |
||||
} |
||||
|
||||
// Explicitly instantiate templates for "CacheEntryRole" values we use.
|
||||
// This makes it possible to keep the template definitions in the .cc file.
|
||||
template Status CacheReservationManager::UpdateCacheReservation< |
||||
CacheEntryRole::kWriteBuffer>(std::size_t new_mem_used); |
||||
// For cache reservation manager unit tests
|
||||
template Status CacheReservationManager::UpdateCacheReservation< |
||||
CacheEntryRole::kMisc>(std::size_t new_mem_used); |
||||
|
||||
template <CacheEntryRole R> |
||||
Status CacheReservationManager::IncreaseCacheReservation( |
||||
std::size_t new_mem_used) { |
||||
Status return_status = Status::OK(); |
||||
while (new_mem_used > cache_allocated_size_.load(std::memory_order_relaxed)) { |
||||
Cache::Handle* handle = nullptr; |
||||
return_status = cache_->Insert(GetNextCacheKey(), nullptr, kSizeDummyEntry, |
||||
GetNoopDeleterForRole<R>(), &handle); |
||||
|
||||
if (return_status != Status::OK()) { |
||||
return return_status; |
||||
} |
||||
|
||||
dummy_handles_.push_back(handle); |
||||
cache_allocated_size_ += kSizeDummyEntry; |
||||
} |
||||
return return_status; |
||||
} |
||||
|
||||
Status CacheReservationManager::DecreaseCacheReservation( |
||||
std::size_t new_mem_used) { |
||||
Status return_status = Status::OK(); |
||||
|
||||
// Decrease to the smallest multiple of kSizeDummyEntry that is greater than
|
||||
// or equal to new_mem_used We do addition instead of new_mem_used <=
|
||||
// cache_allocated_size_.load(std::memory_order_relaxed) - kSizeDummyEntry to
|
||||
// avoid underflow of size_t when cache_allocated_size_ = 0
|
||||
while (new_mem_used + kSizeDummyEntry <= |
||||
cache_allocated_size_.load(std::memory_order_relaxed)) { |
||||
assert(!dummy_handles_.empty()); |
||||
auto* handle = dummy_handles_.back(); |
||||
cache_->Release(handle, true); |
||||
dummy_handles_.pop_back(); |
||||
cache_allocated_size_ -= kSizeDummyEntry; |
||||
} |
||||
return return_status; |
||||
} |
||||
|
||||
std::size_t CacheReservationManager::GetTotalReservedCacheSize() { |
||||
return cache_allocated_size_.load(std::memory_order_relaxed); |
||||
} |
||||
|
||||
Slice CacheReservationManager::GetNextCacheKey() { |
||||
// Calling this function will have the side-effect of changing the
|
||||
// underlying cache_key_ that is shared among other keys generated from this
|
||||
// fucntion. Therefore please make sure the previous keys are saved/copied
|
||||
// before calling this function.
|
||||
std::memset(cache_key_ + kCacheKeyPrefixSize, 0, kMaxVarint64Length); |
||||
char* end = |
||||
EncodeVarint64(cache_key_ + kCacheKeyPrefixSize, next_cache_key_id_++); |
||||
return Slice(cache_key_, static_cast<std::size_t>(end - cache_key_)); |
||||
} |
||||
} // namespace ROCKSDB_NAMESPACE
|
||||
@ -0,0 +1,97 @@ |
||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||
// This source code is licensed under both the GPLv2 (found in the
|
||||
// COPYING file in the root directory) and Apache 2.0 License
|
||||
// (found in the LICENSE.Apache file in the root directory).
|
||||
//
|
||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style license that can be
|
||||
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
||||
|
||||
#pragma once |
||||
|
||||
#include <atomic> |
||||
#include <cstddef> |
||||
#include <cstdint> |
||||
#include <memory> |
||||
#include <vector> |
||||
|
||||
#include "cache/cache_entry_roles.h" |
||||
#include "rocksdb/cache.h" |
||||
#include "rocksdb/slice.h" |
||||
#include "rocksdb/status.h" |
||||
#include "table/block_based/block_based_table_reader.h" |
||||
#include "util/coding.h" |
||||
|
||||
namespace ROCKSDB_NAMESPACE { |
||||
|
||||
// CacheReservationManager is for reserving cache space for the memory used
|
||||
// through inserting/releasing dummy entries in the cache.
|
||||
// This class is not thread-safe.
|
||||
class CacheReservationManager { |
||||
public: |
||||
// Construct a CacheReservationManager
|
||||
// @param cache The cache where dummy entries are inserted and released for
|
||||
// reserving cache space
|
||||
// @param delayed_decrease If set true, then dummy entries won't be released
|
||||
// immediately when memory usage decreases.
|
||||
// Instead, it will be released when the memory usage
|
||||
// decreases to 3/4 of what we have reserved so far.
|
||||
// This is for saving some future dummy entry
|
||||
// insertion when memory usage increases are likely to
|
||||
// happen in the near future.
|
||||
explicit CacheReservationManager(std::shared_ptr<Cache> cache, |
||||
bool delayed_decrease = false); |
||||
|
||||
// no copy constructor, copy assignment, move constructor, move assignment
|
||||
CacheReservationManager(const CacheReservationManager &) = delete; |
||||
CacheReservationManager &operator=(const CacheReservationManager &) = delete; |
||||
CacheReservationManager(CacheReservationManager &&) = delete; |
||||
CacheReservationManager &operator=(CacheReservationManager &&) = delete; |
||||
|
||||
~CacheReservationManager(); |
||||
|
||||
template <CacheEntryRole R> |
||||
|
||||
// Insert and release dummy entries in the cache to
|
||||
// match the size of total dummy entries with the smallest multiple of
|
||||
// kSizeDummyEntry that is greater than or equal to new_mem_used
|
||||
//
|
||||
// Insert dummy entries if new_memory_used > cache_allocated_size_;
|
||||
//
|
||||
// Release dummy entries if new_memory_used < cache_allocated_size_
|
||||
// (and new_memory_used < cache_allocated_size_ * 3/4
|
||||
// when delayed_decrease is set true);
|
||||
//
|
||||
// Keey dummy entries the same if (1) new_memory_used == cache_allocated_size_
|
||||
// or (2) new_memory_used is in the interval of
|
||||
// [cache_allocated_size_ * 3/4, cache_allocated_size) when delayed_decrease
|
||||
// is set true.
|
||||
//
|
||||
// On inserting dummy entries, it returns Status::OK() if all dummy entry
|
||||
// insertions succeed. Otherwise, it returns the first non-ok status;
|
||||
// On releasing dummy entries, it always returns Status::OK().
|
||||
// On keeping dummy entries the same, it always returns Status::OK().
|
||||
Status UpdateCacheReservation(std::size_t new_memory_used); |
||||
std::size_t GetTotalReservedCacheSize(); |
||||
|
||||
private: |
||||
static constexpr std::size_t kSizeDummyEntry = 256 * 1024; |
||||
// The key will be longer than keys for blocks in SST files so they won't
|
||||
// conflict.
|
||||
static const std::size_t kCacheKeyPrefixSize = |
||||
BlockBasedTable::kMaxCacheKeyPrefixSize + kMaxVarint64Length; |
||||
|
||||
Slice GetNextCacheKey(); |
||||
template <CacheEntryRole R> |
||||
Status IncreaseCacheReservation(std::size_t new_mem_used); |
||||
Status DecreaseCacheReservation(std::size_t new_mem_used); |
||||
|
||||
std::shared_ptr<Cache> cache_; |
||||
bool delayed_decrease_; |
||||
std::atomic<std::size_t> cache_allocated_size_; |
||||
std::vector<Cache::Handle *> dummy_handles_; |
||||
std::uint64_t next_cache_key_id_ = 0; |
||||
// The non-prefix part will be updated according to the ID to use.
|
||||
char cache_key_[kCacheKeyPrefixSize + kMaxVarint64Length]; |
||||
}; |
||||
} // namespace ROCKSDB_NAMESPACE
|
||||
@ -0,0 +1,411 @@ |
||||
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||
// This source code is licensed under both the GPLv2 (found in the
|
||||
// COPYING file in the root directory) and Apache 2.0 License
|
||||
// (found in the LICENSE.Apache file in the root directory).
|
||||
//
|
||||
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style license that can be
|
||||
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
||||
#include "cache/cache_reservation_manager.h" |
||||
|
||||
#include <cstddef> |
||||
#include <cstring> |
||||
#include <memory> |
||||
|
||||
#include "cache/cache_entry_roles.h" |
||||
#include "rocksdb/cache.h" |
||||
#include "rocksdb/slice.h" |
||||
#include "table/block_based/block_based_table_reader.h" |
||||
#include "test_util/testharness.h" |
||||
#include "util/coding.h" |
||||
|
||||
namespace ROCKSDB_NAMESPACE { |
||||
class CacheReservationManagerTest : public ::testing::Test { |
||||
protected: |
||||
static constexpr std::size_t kOneGigabyte = 1024 * 1024 * 1024; |
||||
static constexpr int kNumShardBits = 0; // 2^0 shard
|
||||
|
||||
static constexpr std::size_t kSizeDummyEntry = 256 * 1024; |
||||
static const std::size_t kCacheKeyPrefixSize = |
||||
BlockBasedTable::kMaxCacheKeyPrefixSize + kMaxVarint64Length; |
||||
static constexpr std::size_t kMetaDataChargeOverhead = 10000; |
||||
|
||||
std::shared_ptr<Cache> cache = NewLRUCache(kOneGigabyte, kNumShardBits); |
||||
std::unique_ptr<CacheReservationManager> test_cache_rev_mng; |
||||
|
||||
CacheReservationManagerTest() { |
||||
test_cache_rev_mng.reset(new CacheReservationManager(cache)); |
||||
} |
||||
}; |
||||
|
||||
TEST_F(CacheReservationManagerTest, GenerateCacheKey) { |
||||
// The first cache reservation manager owning the cache will have
|
||||
// cache->NewId() = 1
|
||||
constexpr std::size_t kCacheNewId = 1; |
||||
// The first key generated inside of cache reservation manager will have
|
||||
// next_cache_key_id = 0
|
||||
constexpr std::size_t kCacheKeyId = 0; |
||||
|
||||
char expected_cache_key[kCacheKeyPrefixSize + kMaxVarint64Length]; |
||||
std::memset(expected_cache_key, 0, kCacheKeyPrefixSize + kMaxVarint64Length); |
||||
|
||||
EncodeVarint64(expected_cache_key, kCacheNewId); |
||||
char* end = |
||||
EncodeVarint64(expected_cache_key + kCacheKeyPrefixSize, kCacheKeyId); |
||||
Slice expected_cache_key_slice( |
||||
expected_cache_key, static_cast<std::size_t>(end - expected_cache_key)); |
||||
|
||||
std::size_t new_mem_used = 1 * kSizeDummyEntry; |
||||
Status s = |
||||
test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
ASSERT_EQ(s, Status::OK()); |
||||
ASSERT_GE(cache->GetPinnedUsage(), 1 * kSizeDummyEntry); |
||||
ASSERT_LT(cache->GetPinnedUsage(), |
||||
1 * kSizeDummyEntry + kMetaDataChargeOverhead); |
||||
|
||||
Cache::Handle* handle = cache->Lookup(expected_cache_key_slice); |
||||
EXPECT_NE(handle, nullptr) |
||||
<< "Failed to generate the cache key for the dummy entry correctly"; |
||||
// Clean up the returned handle from Lookup() to prevent memory leak
|
||||
cache->Release(handle); |
||||
} |
||||
|
||||
TEST_F(CacheReservationManagerTest, KeepCacheReservationTheSame) { |
||||
std::size_t new_mem_used = 1 * kSizeDummyEntry; |
||||
Status s = |
||||
test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
ASSERT_EQ(s, Status::OK()); |
||||
ASSERT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
1 * kSizeDummyEntry); |
||||
std::size_t initial_pinned_usage = cache->GetPinnedUsage(); |
||||
ASSERT_GE(initial_pinned_usage, 1 * kSizeDummyEntry); |
||||
ASSERT_LT(initial_pinned_usage, |
||||
1 * kSizeDummyEntry + kMetaDataChargeOverhead); |
||||
|
||||
s = test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::OK()) |
||||
<< "Failed to keep cache reservation the same when new_mem_used equals " |
||||
"to current cache reservation"; |
||||
EXPECT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
1 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep correctly when new_mem_used equals to current " |
||||
"cache reservation"; |
||||
EXPECT_EQ(cache->GetPinnedUsage(), initial_pinned_usage) |
||||
<< "Failed to keep underlying dummy entries the same when new_mem_used " |
||||
"equals to current cache reservation"; |
||||
} |
||||
|
||||
TEST_F(CacheReservationManagerTest, |
||||
IncreaseCacheReservationByMultiplesOfDummyEntrySize) { |
||||
std::size_t new_mem_used = 2 * kSizeDummyEntry; |
||||
Status s = |
||||
test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::OK()) |
||||
<< "Failed to increase cache reservation correctly"; |
||||
EXPECT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
2 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep cache reservation increase correctly"; |
||||
EXPECT_GE(cache->GetPinnedUsage(), 2 * kSizeDummyEntry) |
||||
<< "Failed to increase underlying dummy entries in cache correctly"; |
||||
EXPECT_LT(cache->GetPinnedUsage(), |
||||
2 * kSizeDummyEntry + kMetaDataChargeOverhead) |
||||
<< "Failed to increase underlying dummy entries in cache correctly"; |
||||
} |
||||
|
||||
TEST_F(CacheReservationManagerTest, |
||||
IncreaseCacheReservationNotByMultiplesOfDummyEntrySize) { |
||||
std::size_t new_mem_used = 2 * kSizeDummyEntry + kSizeDummyEntry / 2; |
||||
Status s = |
||||
test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::OK()) |
||||
<< "Failed to increase cache reservation correctly"; |
||||
EXPECT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
3 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep cache reservation increase correctly"; |
||||
EXPECT_GE(cache->GetPinnedUsage(), 3 * kSizeDummyEntry) |
||||
<< "Failed to increase underlying dummy entries in cache correctly"; |
||||
EXPECT_LT(cache->GetPinnedUsage(), |
||||
3 * kSizeDummyEntry + kMetaDataChargeOverhead) |
||||
<< "Failed to increase underlying dummy entries in cache correctly"; |
||||
} |
||||
|
||||
TEST(CacheReservationManagerIncreaseReservcationOnFullCacheTest, |
||||
IncreaseCacheReservationOnFullCache) { |
||||
constexpr std::size_t kOneMegabyte = 1024 * 1024; |
||||
constexpr std::size_t kOneGigabyte = 1024 * 1024 * 1024; |
||||
constexpr std::size_t kSizeDummyEntry = 256 * 1024; |
||||
constexpr std::size_t kMetaDataChargeOverhead = 10000; |
||||
|
||||
LRUCacheOptions lo; |
||||
lo.capacity = kOneMegabyte; |
||||
lo.num_shard_bits = 0; // 2^0 shard
|
||||
lo.strict_capacity_limit = true; |
||||
std::shared_ptr<Cache> cache = NewLRUCache(lo); |
||||
std::unique_ptr<CacheReservationManager> test_cache_rev_mng( |
||||
new CacheReservationManager(cache)); |
||||
|
||||
std::size_t new_mem_used = kOneMegabyte + 1; |
||||
Status s = |
||||
test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::Incomplete()) |
||||
<< "Failed to return status to indicate failure of dummy entry insertion " |
||||
"during cache reservation on full cache"; |
||||
EXPECT_GE(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
1 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep correctly before cache resevation failure happens " |
||||
"due to full cache"; |
||||
EXPECT_LE(test_cache_rev_mng->GetTotalReservedCacheSize(), kOneMegabyte) |
||||
<< "Failed to bookkeep correctly (i.e, bookkeep only successful dummy " |
||||
"entry insertions) when encountering cache resevation failure due to " |
||||
"full cache"; |
||||
EXPECT_GE(cache->GetPinnedUsage(), 1 * kSizeDummyEntry) |
||||
<< "Failed to insert underlying dummy entries correctly when " |
||||
"encountering cache resevation failure due to full cache"; |
||||
EXPECT_LE(cache->GetPinnedUsage(), kOneMegabyte) |
||||
<< "Failed to insert underlying dummy entries correctly when " |
||||
"encountering cache resevation failure due to full cache"; |
||||
|
||||
new_mem_used = kOneMegabyte / 2; // 2 dummy entries
|
||||
s = test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::OK()) |
||||
<< "Failed to decrease cache reservation after encountering cache " |
||||
"reservation failure due to full cache"; |
||||
EXPECT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
2 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep cache reservation decrease correctly after " |
||||
"encountering cache reservation due to full cache"; |
||||
EXPECT_GE(cache->GetPinnedUsage(), 2 * kSizeDummyEntry) |
||||
<< "Failed to release underlying dummy entries correctly on cache " |
||||
"reservation decrease after encountering cache resevation failure due " |
||||
"to full cache"; |
||||
EXPECT_LT(cache->GetPinnedUsage(), |
||||
2 * kSizeDummyEntry + kMetaDataChargeOverhead) |
||||
<< "Failed to release underlying dummy entries correctly on cache " |
||||
"reservation decrease after encountering cache resevation failure due " |
||||
"to full cache"; |
||||
|
||||
// Create cache full again for subsequent tests
|
||||
new_mem_used = kOneMegabyte + 1; |
||||
s = test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::Incomplete()) |
||||
<< "Failed to return status to indicate failure of dummy entry insertion " |
||||
"during cache reservation on full cache"; |
||||
EXPECT_GE(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
1 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep correctly before cache resevation failure happens " |
||||
"due to full cache"; |
||||
EXPECT_LE(test_cache_rev_mng->GetTotalReservedCacheSize(), kOneMegabyte) |
||||
<< "Failed to bookkeep correctly (i.e, bookkeep only successful dummy " |
||||
"entry insertions) when encountering cache resevation failure due to " |
||||
"full cache"; |
||||
EXPECT_GE(cache->GetPinnedUsage(), 1 * kSizeDummyEntry) |
||||
<< "Failed to insert underlying dummy entries correctly when " |
||||
"encountering cache resevation failure due to full cache"; |
||||
EXPECT_LE(cache->GetPinnedUsage(), kOneMegabyte) |
||||
<< "Failed to insert underlying dummy entries correctly when " |
||||
"encountering cache resevation failure due to full cache"; |
||||
|
||||
// Increase cache capacity so the previously failed insertion can fully
|
||||
// succeed
|
||||
cache->SetCapacity(kOneGigabyte); |
||||
new_mem_used = kOneMegabyte + 1; |
||||
s = test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::OK()) |
||||
<< "Failed to increase cache reservation after increasing cache capacity " |
||||
"and mitigating cache full error"; |
||||
EXPECT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
5 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep cache reservation increase correctly after " |
||||
"increasing cache capacity and mitigating cache full error"; |
||||
EXPECT_GE(cache->GetPinnedUsage(), 5 * kSizeDummyEntry) |
||||
<< "Failed to insert underlying dummy entries correctly after increasing " |
||||
"cache capacity and mitigating cache full error"; |
||||
EXPECT_LT(cache->GetPinnedUsage(), |
||||
5 * kSizeDummyEntry + kMetaDataChargeOverhead) |
||||
<< "Failed to insert underlying dummy entries correctly after increasing " |
||||
"cache capacity and mitigating cache full error"; |
||||
} |
||||
|
||||
TEST_F(CacheReservationManagerTest, |
||||
DecreaseCacheReservationByMultiplesOfDummyEntrySize) { |
||||
std::size_t new_mem_used = 2 * kSizeDummyEntry; |
||||
Status s = |
||||
test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
ASSERT_EQ(s, Status::OK()); |
||||
ASSERT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
2 * kSizeDummyEntry); |
||||
ASSERT_GE(cache->GetPinnedUsage(), 2 * kSizeDummyEntry); |
||||
ASSERT_LT(cache->GetPinnedUsage(), |
||||
2 * kSizeDummyEntry + kMetaDataChargeOverhead); |
||||
|
||||
new_mem_used = 1 * kSizeDummyEntry; |
||||
s = test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::OK()) |
||||
<< "Failed to decrease cache reservation correctly"; |
||||
EXPECT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
1 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep cache reservation decrease correctly"; |
||||
EXPECT_GE(cache->GetPinnedUsage(), 1 * kSizeDummyEntry) |
||||
<< "Failed to decrease underlying dummy entries in cache correctly"; |
||||
EXPECT_LT(cache->GetPinnedUsage(), |
||||
1 * kSizeDummyEntry + kMetaDataChargeOverhead) |
||||
<< "Failed to decrease underlying dummy entries in cache correctly"; |
||||
} |
||||
|
||||
TEST_F(CacheReservationManagerTest, |
||||
DecreaseCacheReservationNotByMultiplesOfDummyEntrySize) { |
||||
std::size_t new_mem_used = 2 * kSizeDummyEntry; |
||||
Status s = |
||||
test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
ASSERT_EQ(s, Status::OK()); |
||||
ASSERT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
2 * kSizeDummyEntry); |
||||
ASSERT_GE(cache->GetPinnedUsage(), 2 * kSizeDummyEntry); |
||||
ASSERT_LT(cache->GetPinnedUsage(), |
||||
2 * kSizeDummyEntry + kMetaDataChargeOverhead); |
||||
|
||||
new_mem_used = kSizeDummyEntry / 2; |
||||
s = test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::OK()) |
||||
<< "Failed to decrease cache reservation correctly"; |
||||
EXPECT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
1 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep cache reservation decrease correctly"; |
||||
EXPECT_GE(cache->GetPinnedUsage(), 1 * kSizeDummyEntry) |
||||
<< "Failed to decrease underlying dummy entries in cache correctly"; |
||||
EXPECT_LT(cache->GetPinnedUsage(), |
||||
1 * kSizeDummyEntry + kMetaDataChargeOverhead) |
||||
<< "Failed to decrease underlying dummy entries in cache correctly"; |
||||
} |
||||
|
||||
TEST(CacheReservationManagerWithDelayedDecreaseTest, |
||||
DecreaseCacheReservationWithDelayedDecrease) { |
||||
constexpr std::size_t kOneGigabyte = 1024 * 1024 * 1024; |
||||
constexpr std::size_t kSizeDummyEntry = 256 * 1024; |
||||
constexpr std::size_t kMetaDataChargeOverhead = 10000; |
||||
|
||||
LRUCacheOptions lo; |
||||
lo.capacity = kOneGigabyte; |
||||
lo.num_shard_bits = 0; |
||||
std::shared_ptr<Cache> cache = NewLRUCache(lo); |
||||
std::unique_ptr<CacheReservationManager> test_cache_rev_mng( |
||||
new CacheReservationManager(cache, true /* delayed_decrease */)); |
||||
|
||||
std::size_t new_mem_used = 8 * kSizeDummyEntry; |
||||
Status s = |
||||
test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
ASSERT_EQ(s, Status::OK()); |
||||
ASSERT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
8 * kSizeDummyEntry); |
||||
std::size_t initial_pinned_usage = cache->GetPinnedUsage(); |
||||
ASSERT_GE(initial_pinned_usage, 8 * kSizeDummyEntry); |
||||
ASSERT_LT(initial_pinned_usage, |
||||
8 * kSizeDummyEntry + kMetaDataChargeOverhead); |
||||
|
||||
new_mem_used = 6 * kSizeDummyEntry; |
||||
s = test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::OK()) << "Failed to delay decreasing cache reservation"; |
||||
EXPECT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
8 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep correctly when delaying cache reservation " |
||||
"decrease"; |
||||
EXPECT_EQ(cache->GetPinnedUsage(), initial_pinned_usage) |
||||
<< "Failed to delay decreasing underlying dummy entries in cache"; |
||||
|
||||
new_mem_used = 7 * kSizeDummyEntry; |
||||
s = test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::OK()) << "Failed to delay decreasing cache reservation"; |
||||
EXPECT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
8 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep correctly when delaying cache reservation " |
||||
"decrease"; |
||||
EXPECT_EQ(cache->GetPinnedUsage(), initial_pinned_usage) |
||||
<< "Failed to delay decreasing underlying dummy entries in cache"; |
||||
|
||||
new_mem_used = 6 * kSizeDummyEntry - 1; |
||||
s = test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
EXPECT_EQ(s, Status::OK()) |
||||
<< "Failed to decrease cache reservation correctly when new_mem_used < " |
||||
"GetTotalReservedCacheSize() * 3 / 4 on delayed decrease mode"; |
||||
EXPECT_EQ(test_cache_rev_mng->GetTotalReservedCacheSize(), |
||||
6 * kSizeDummyEntry) |
||||
<< "Failed to bookkeep correctly when new_mem_used < " |
||||
"GetTotalReservedCacheSize() * 3 / 4 on delayed decrease mode"; |
||||
EXPECT_GE(cache->GetPinnedUsage(), 6 * kSizeDummyEntry) |
||||
<< "Failed to decrease underlying dummy entries in cache when " |
||||
"new_mem_used < GetTotalReservedCacheSize() * 3 / 4 on delayed " |
||||
"decrease mode"; |
||||
EXPECT_LT(cache->GetPinnedUsage(), |
||||
6 * kSizeDummyEntry + kMetaDataChargeOverhead) |
||||
<< "Failed to decrease underlying dummy entries in cache when " |
||||
"new_mem_used < GetTotalReservedCacheSize() * 3 / 4 on delayed " |
||||
"decrease mode"; |
||||
} |
||||
|
||||
TEST(CacheReservationManagerDestructorTest, |
||||
ReleaseRemainingDummyEntriesOnDestruction) { |
||||
constexpr std::size_t kOneGigabyte = 1024 * 1024 * 1024; |
||||
constexpr std::size_t kSizeDummyEntry = 256 * 1024; |
||||
constexpr std::size_t kMetaDataChargeOverhead = 10000; |
||||
|
||||
LRUCacheOptions lo; |
||||
lo.capacity = kOneGigabyte; |
||||
lo.num_shard_bits = 0; |
||||
std::shared_ptr<Cache> cache = NewLRUCache(lo); |
||||
{ |
||||
std::unique_ptr<CacheReservationManager> test_cache_rev_mng( |
||||
new CacheReservationManager(cache)); |
||||
std::size_t new_mem_used = 1 * kSizeDummyEntry; |
||||
Status s = |
||||
test_cache_rev_mng |
||||
->UpdateCacheReservation<ROCKSDB_NAMESPACE::CacheEntryRole::kMisc>( |
||||
new_mem_used); |
||||
ASSERT_EQ(s, Status::OK()); |
||||
ASSERT_GE(cache->GetPinnedUsage(), 1 * kSizeDummyEntry); |
||||
ASSERT_LT(cache->GetPinnedUsage(), |
||||
1 * kSizeDummyEntry + kMetaDataChargeOverhead); |
||||
} |
||||
EXPECT_EQ(cache->GetPinnedUsage(), 0 * kSizeDummyEntry) |
||||
<< "Failed to release remaining underlying dummy entries in cache in " |
||||
"CacheReservationManager's destructor"; |
||||
} |
||||
} // namespace ROCKSDB_NAMESPACE
|
||||
|
||||
int main(int argc, char** argv) { |
||||
::testing::InitGoogleTest(&argc, argv); |
||||
return RUN_ALL_TESTS(); |
||||
} |
||||
Loading…
Reference in new issue