1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
// Copyright (c) 2013, 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).
//
#include "utilities/persistent_cache/persistent_cache_tier.h"
#include <cinttypes>
#include <sstream>
#include <string>
namespace ROCKSDB_NAMESPACE {
std::string PersistentCacheConfig::ToString() const {
std::string ret;
ret.reserve(20000);
const int kBufferSize = 200;
char buffer[kBufferSize];
snprintf(buffer, kBufferSize, " path: %s\n", path.c_str());
ret.append(buffer);
snprintf(buffer, kBufferSize, " enable_direct_reads: %d\n",
enable_direct_reads);
ret.append(buffer);
snprintf(buffer, kBufferSize, " enable_direct_writes: %d\n",
enable_direct_writes);
ret.append(buffer);
snprintf(buffer, kBufferSize, " cache_size: %" PRIu64 "\n", cache_size);
ret.append(buffer);
snprintf(buffer, kBufferSize, " cache_file_size: %" PRIu32 "\n",
cache_file_size);
ret.append(buffer);
snprintf(buffer, kBufferSize, " writer_qdepth: %" PRIu32 "\n",
writer_qdepth);
ret.append(buffer);
snprintf(buffer, kBufferSize, " pipeline_writes: %d\n", pipeline_writes);
ret.append(buffer);
snprintf(buffer, kBufferSize,
" max_write_pipeline_backlog_size: %" PRIu64 "\n",
max_write_pipeline_backlog_size);
ret.append(buffer);
snprintf(buffer, kBufferSize, " write_buffer_size: %" PRIu32 "\n",
write_buffer_size);
ret.append(buffer);
snprintf(buffer, kBufferSize, " writer_dispatch_size: %" PRIu64 "\n",
writer_dispatch_size);
ret.append(buffer);
snprintf(buffer, kBufferSize, " is_compressed: %d\n", is_compressed);
ret.append(buffer);
return ret;
}
//
// PersistentCacheTier implementation
//
Status PersistentCacheTier::Open() {
if (next_tier_) {
return next_tier_->Open();
}
return Status::OK();
}
Status PersistentCacheTier::Close() {
if (next_tier_) {
return next_tier_->Close();
}
return Status::OK();
}
bool PersistentCacheTier::Reserve(const size_t /*size*/) {
// default implementation is a pass through
return true;
}
bool PersistentCacheTier::Erase(const Slice& /*key*/) {
// default implementation is a pass through since not all cache tiers might
// support erase
return true;
}
std::string PersistentCacheTier::PrintStats() {
std::ostringstream os;
for (const auto& tier_stats : Stats()) {
os << "---- next tier -----" << std::endl;
for (const auto& stat : tier_stats) {
os << stat.first << ": " << stat.second << std::endl;
}
}
return os.str();
}
PersistentCache::StatsType PersistentCacheTier::Stats() {
if (next_tier_) {
return next_tier_->Stats();
}
return PersistentCache::StatsType{};
}
uint64_t PersistentCacheTier::NewId() {
return last_id_.fetch_add(1, std::memory_order_relaxed);
}
//
// PersistentTieredCache implementation
//
PersistentTieredCache::~PersistentTieredCache() { assert(tiers_.empty()); }
Status PersistentTieredCache::Open() {
assert(!tiers_.empty());
return tiers_.front()->Open();
}
Status PersistentTieredCache::Close() {
assert(!tiers_.empty());
Status status = tiers_.front()->Close();
if (status.ok()) {
tiers_.clear();
}
return status;
}
bool PersistentTieredCache::Erase(const Slice& key) {
assert(!tiers_.empty());
return tiers_.front()->Erase(key);
}
PersistentCache::StatsType PersistentTieredCache::Stats() {
assert(!tiers_.empty());
return tiers_.front()->Stats();
}
std::string PersistentTieredCache::PrintStats() {
assert(!tiers_.empty());
return tiers_.front()->PrintStats();
}
Status PersistentTieredCache::Insert(const Slice& page_key, const char* data,
const size_t size) {
assert(!tiers_.empty());
return tiers_.front()->Insert(page_key, data, size);
}
Status PersistentTieredCache::Lookup(const Slice& page_key,
std::unique_ptr<char[]>* data,
size_t* size) {
assert(!tiers_.empty());
return tiers_.front()->Lookup(page_key, data, size);
}
void PersistentTieredCache::AddTier(const Tier& tier) {
if (!tiers_.empty()) {
tiers_.back()->set_next_tier(tier);
}
tiers_.push_back(tier);
}
bool PersistentTieredCache::IsCompressed() {
assert(tiers_.size());
return tiers_.front()->IsCompressed();
}
} // namespace ROCKSDB_NAMESPACE
|
