2022-05-20 01:39:41 +00:00
|
|
|
// 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 "db/db_with_timestamp_test_util.h"
|
|
|
|
#include "test_util/testutil.h"
|
|
|
|
|
|
|
|
namespace ROCKSDB_NAMESPACE {
|
|
|
|
class DBReadOnlyTestWithTimestamp : public DBBasicTestWithTimestampBase {
|
|
|
|
public:
|
|
|
|
DBReadOnlyTestWithTimestamp()
|
|
|
|
: DBBasicTestWithTimestampBase("db_readonly_test_with_timestamp") {}
|
2022-05-24 19:14:10 +00:00
|
|
|
|
|
|
|
protected:
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
void CheckDBOpenedAsCompactedDBWithOneLevel0File() {
|
|
|
|
VersionSet* const versions = dbfull()->GetVersionSet();
|
|
|
|
ASSERT_NE(versions, nullptr);
|
|
|
|
|
|
|
|
ColumnFamilyData* const cfd = versions->GetColumnFamilySet()->GetDefault();
|
|
|
|
ASSERT_NE(cfd, nullptr);
|
|
|
|
|
|
|
|
Version* const current = cfd->current();
|
|
|
|
ASSERT_NE(current, nullptr);
|
|
|
|
|
|
|
|
const VersionStorageInfo* const storage_info = current->storage_info();
|
|
|
|
ASSERT_NE(storage_info, nullptr);
|
|
|
|
|
|
|
|
// Only 1 L0 file.
|
|
|
|
ASSERT_EQ(1, NumTableFilesAtLevel(0));
|
|
|
|
// L0 is the max level.
|
|
|
|
ASSERT_EQ(storage_info->num_non_empty_levels(), 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void CheckDBOpenedAsCompactedDBWithOnlyHighestNonEmptyLevelFiles() {
|
|
|
|
VersionSet* const versions = dbfull()->GetVersionSet();
|
|
|
|
ASSERT_NE(versions, nullptr);
|
|
|
|
|
|
|
|
ColumnFamilyData* const cfd = versions->GetColumnFamilySet()->GetDefault();
|
|
|
|
ASSERT_NE(cfd, nullptr);
|
|
|
|
|
|
|
|
Version* const current = cfd->current();
|
|
|
|
ASSERT_NE(current, nullptr);
|
|
|
|
|
|
|
|
const VersionStorageInfo* const storage_info = current->storage_info();
|
|
|
|
ASSERT_NE(storage_info, nullptr);
|
|
|
|
|
|
|
|
// L0 has no files.
|
|
|
|
ASSERT_EQ(0, NumTableFilesAtLevel(0));
|
|
|
|
|
|
|
|
// All other levels have no files except the highest level with files.
|
|
|
|
for (int i = 1; i < storage_info->num_non_empty_levels() - 1; ++i) {
|
|
|
|
ASSERT_FALSE(storage_info->LevelFilesBrief(i).num_files > 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
// The highest level with files have some files.
|
|
|
|
int highest_non_empty_level = storage_info->num_non_empty_levels() - 1;
|
|
|
|
ASSERT_TRUE(
|
|
|
|
storage_info->LevelFilesBrief(highest_non_empty_level).num_files > 0);
|
|
|
|
}
|
|
|
|
#endif // !ROCKSDB_LITE
|
2022-05-20 01:39:41 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp, IteratorAndGetReadTimestampSizeMismatch) {
|
|
|
|
const int kNumKeysPerFile = 128;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
const std::string write_timestamp = Timestamp(1, 0);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamp,
|
|
|
|
"value" + std::to_string(key));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Reopen the database in read only mode to test its timestamp support.
|
|
|
|
Close();
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
ReadOptions read_opts;
|
|
|
|
std::string different_size_read_timestamp;
|
|
|
|
PutFixed32(&different_size_read_timestamp, 2);
|
|
|
|
Slice different_size_read_ts = different_size_read_timestamp;
|
|
|
|
read_opts.timestamp = &different_size_read_ts;
|
|
|
|
{
|
|
|
|
std::unique_ptr<Iterator> iter(db_->NewIterator(read_opts));
|
|
|
|
ASSERT_FALSE(iter->Valid());
|
|
|
|
ASSERT_TRUE(iter->status().IsInvalidArgument());
|
|
|
|
}
|
|
|
|
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
std::string value_from_get;
|
|
|
|
std::string timestamp;
|
|
|
|
ASSERT_TRUE(db_->Get(read_opts, Key1(key), &value_from_get, ×tamp)
|
|
|
|
.IsInvalidArgument());
|
|
|
|
}
|
|
|
|
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp,
|
|
|
|
IteratorAndGetReadTimestampSpecifiedWithoutWriteTimestamp) {
|
|
|
|
const int kNumKeysPerFile = 128;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), "value" + std::to_string(key));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Reopen the database in read only mode to test its timestamp support.
|
|
|
|
Close();
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
ReadOptions read_opts;
|
|
|
|
const std::string read_timestamp = Timestamp(2, 0);
|
|
|
|
Slice read_ts = read_timestamp;
|
|
|
|
read_opts.timestamp = &read_ts;
|
|
|
|
{
|
|
|
|
std::unique_ptr<Iterator> iter(db_->NewIterator(read_opts));
|
|
|
|
ASSERT_FALSE(iter->Valid());
|
|
|
|
ASSERT_TRUE(iter->status().IsInvalidArgument());
|
|
|
|
}
|
|
|
|
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
std::string value_from_get;
|
|
|
|
std::string timestamp;
|
|
|
|
ASSERT_TRUE(db_->Get(read_opts, Key1(key), &value_from_get, ×tamp)
|
|
|
|
.IsInvalidArgument());
|
|
|
|
}
|
|
|
|
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
2022-05-24 19:14:10 +00:00
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp,
|
|
|
|
IteratorAndGetWriteWithTimestampReadWithoutTimestamp) {
|
|
|
|
const int kNumKeysPerFile = 128;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
const std::string write_timestamp = Timestamp(1, 0);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamp,
|
|
|
|
"value" + std::to_string(key));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Reopen the database in read only mode to test its timestamp support.
|
|
|
|
Close();
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
ReadOptions read_opts;
|
|
|
|
{
|
|
|
|
std::unique_ptr<Iterator> iter(db_->NewIterator(read_opts));
|
|
|
|
ASSERT_FALSE(iter->Valid());
|
|
|
|
ASSERT_TRUE(iter->status().IsInvalidArgument());
|
|
|
|
}
|
|
|
|
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
std::string value_from_get;
|
|
|
|
ASSERT_TRUE(
|
|
|
|
db_->Get(read_opts, Key1(key), &value_from_get).IsInvalidArgument());
|
|
|
|
}
|
|
|
|
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
2022-05-20 01:39:41 +00:00
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp, IteratorAndGet) {
|
|
|
|
const int kNumKeysPerFile = 128;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
const std::vector<uint64_t> start_keys = {1, 0};
|
|
|
|
const std::vector<std::string> write_timestamps = {Timestamp(1, 0),
|
|
|
|
Timestamp(3, 0)};
|
|
|
|
const std::vector<std::string> read_timestamps = {Timestamp(2, 0),
|
|
|
|
Timestamp(4, 0)};
|
|
|
|
for (size_t i = 0; i < write_timestamps.size(); ++i) {
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = start_keys[i]; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamps[i],
|
|
|
|
"value" + std::to_string(i));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Reopen the database in read only mode to test its timestamp support.
|
|
|
|
Close();
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
|
|
|
|
auto get_value_and_check = [](DB* db, ReadOptions read_opts, Slice key,
|
|
|
|
Slice expected_value, std::string expected_ts) {
|
|
|
|
std::string value_from_get;
|
|
|
|
std::string timestamp;
|
|
|
|
ASSERT_OK(db->Get(read_opts, key.ToString(), &value_from_get, ×tamp));
|
|
|
|
ASSERT_EQ(expected_value, value_from_get);
|
|
|
|
ASSERT_EQ(expected_ts, timestamp);
|
|
|
|
};
|
|
|
|
for (size_t i = 0; i < read_timestamps.size(); ++i) {
|
|
|
|
ReadOptions read_opts;
|
|
|
|
Slice read_ts = read_timestamps[i];
|
|
|
|
read_opts.timestamp = &read_ts;
|
|
|
|
std::unique_ptr<Iterator> it(db_->NewIterator(read_opts));
|
|
|
|
int count = 0;
|
|
|
|
uint64_t key = 0;
|
|
|
|
// Forward iterate.
|
|
|
|
for (it->Seek(Key1(0)), key = start_keys[i]; it->Valid();
|
|
|
|
it->Next(), ++count, ++key) {
|
|
|
|
CheckIterUserEntry(it.get(), Key1(key), kTypeValue,
|
|
|
|
"value" + std::to_string(i), write_timestamps[i]);
|
|
|
|
get_value_and_check(db_, read_opts, it->key(), it->value(),
|
|
|
|
write_timestamps[i]);
|
|
|
|
}
|
|
|
|
size_t expected_count = kMaxKey - start_keys[i] + 1;
|
|
|
|
ASSERT_EQ(expected_count, count);
|
|
|
|
|
|
|
|
// Backward iterate.
|
|
|
|
count = 0;
|
|
|
|
for (it->SeekForPrev(Key1(kMaxKey)), key = kMaxKey; it->Valid();
|
|
|
|
it->Prev(), ++count, --key) {
|
|
|
|
CheckIterUserEntry(it.get(), Key1(key), kTypeValue,
|
|
|
|
"value" + std::to_string(i), write_timestamps[i]);
|
|
|
|
get_value_and_check(db_, read_opts, it->key(), it->value(),
|
|
|
|
write_timestamps[i]);
|
|
|
|
}
|
|
|
|
ASSERT_EQ(static_cast<size_t>(kMaxKey) - start_keys[i] + 1, count);
|
|
|
|
|
|
|
|
// SeekToFirst()/SeekToLast() with lower/upper bounds.
|
|
|
|
// Then iter with lower and upper bounds.
|
|
|
|
uint64_t l = 0;
|
|
|
|
uint64_t r = kMaxKey + 1;
|
|
|
|
while (l < r) {
|
|
|
|
std::string lb_str = Key1(l);
|
|
|
|
Slice lb = lb_str;
|
|
|
|
std::string ub_str = Key1(r);
|
|
|
|
Slice ub = ub_str;
|
|
|
|
read_opts.iterate_lower_bound = &lb;
|
|
|
|
read_opts.iterate_upper_bound = &ub;
|
|
|
|
it.reset(db_->NewIterator(read_opts));
|
|
|
|
for (it->SeekToFirst(), key = std::max(l, start_keys[i]), count = 0;
|
|
|
|
it->Valid(); it->Next(), ++key, ++count) {
|
|
|
|
CheckIterUserEntry(it.get(), Key1(key), kTypeValue,
|
|
|
|
"value" + std::to_string(i), write_timestamps[i]);
|
|
|
|
get_value_and_check(db_, read_opts, it->key(), it->value(),
|
|
|
|
write_timestamps[i]);
|
|
|
|
}
|
|
|
|
ASSERT_EQ(r - std::max(l, start_keys[i]), count);
|
|
|
|
|
|
|
|
for (it->SeekToLast(), key = std::min(r, kMaxKey + 1), count = 0;
|
|
|
|
it->Valid(); it->Prev(), --key, ++count) {
|
|
|
|
CheckIterUserEntry(it.get(), Key1(key - 1), kTypeValue,
|
|
|
|
"value" + std::to_string(i), write_timestamps[i]);
|
|
|
|
get_value_and_check(db_, read_opts, it->key(), it->value(),
|
|
|
|
write_timestamps[i]);
|
|
|
|
}
|
|
|
|
l += (kMaxKey / 100);
|
|
|
|
r -= (kMaxKey / 100);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp, Iterators) {
|
|
|
|
const int kNumKeysPerFile = 128;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
const std::string write_timestamp = Timestamp(1, 0);
|
|
|
|
const std::string read_timestamp = Timestamp(2, 0);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamp,
|
|
|
|
"value" + std::to_string(key));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Reopen the database in read only mode to test its timestamp support.
|
|
|
|
Close();
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
ReadOptions read_opts;
|
|
|
|
Slice read_ts = read_timestamp;
|
|
|
|
read_opts.timestamp = &read_ts;
|
|
|
|
std::vector<Iterator*> iters;
|
|
|
|
ASSERT_OK(db_->NewIterators(read_opts, {db_->DefaultColumnFamily()}, &iters));
|
|
|
|
ASSERT_EQ(static_cast<uint64_t>(1), iters.size());
|
|
|
|
|
|
|
|
int count = 0;
|
|
|
|
uint64_t key = 0;
|
|
|
|
// Forward iterate.
|
|
|
|
for (iters[0]->Seek(Key1(0)), key = 0; iters[0]->Valid();
|
|
|
|
iters[0]->Next(), ++count, ++key) {
|
|
|
|
CheckIterUserEntry(iters[0], Key1(key), kTypeValue,
|
|
|
|
"value" + std::to_string(key), write_timestamp);
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t expected_count = kMaxKey - 0 + 1;
|
|
|
|
ASSERT_EQ(expected_count, count);
|
|
|
|
delete iters[0];
|
|
|
|
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp, IteratorsReadTimestampSizeMismatch) {
|
|
|
|
const int kNumKeysPerFile = 128;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
const std::string write_timestamp = Timestamp(1, 0);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamp,
|
|
|
|
"value" + std::to_string(key));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Reopen the database in read only mode to test its timestamp support.
|
|
|
|
Close();
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
ReadOptions read_opts;
|
|
|
|
std::string different_size_read_timestamp;
|
|
|
|
PutFixed32(&different_size_read_timestamp, 2);
|
|
|
|
Slice different_size_read_ts = different_size_read_timestamp;
|
|
|
|
read_opts.timestamp = &different_size_read_ts;
|
|
|
|
{
|
|
|
|
std::vector<Iterator*> iters;
|
|
|
|
ASSERT_TRUE(
|
|
|
|
db_->NewIterators(read_opts, {db_->DefaultColumnFamily()}, &iters)
|
|
|
|
.IsInvalidArgument());
|
|
|
|
}
|
|
|
|
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp,
|
|
|
|
IteratorsReadTimestampSpecifiedWithoutWriteTimestamp) {
|
|
|
|
const int kNumKeysPerFile = 128;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), "value" + std::to_string(key));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Reopen the database in read only mode to test its timestamp support.
|
|
|
|
Close();
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
ReadOptions read_opts;
|
|
|
|
const std::string read_timestamp = Timestamp(2, 0);
|
|
|
|
Slice read_ts = read_timestamp;
|
|
|
|
read_opts.timestamp = &read_ts;
|
|
|
|
{
|
|
|
|
std::vector<Iterator*> iters;
|
|
|
|
ASSERT_TRUE(
|
|
|
|
db_->NewIterators(read_opts, {db_->DefaultColumnFamily()}, &iters)
|
|
|
|
.IsInvalidArgument());
|
|
|
|
}
|
|
|
|
|
|
|
|
Close();
|
|
|
|
}
|
2022-05-24 19:14:10 +00:00
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp,
|
|
|
|
IteratorsWriteWithTimestampReadWithoutTimestamp) {
|
|
|
|
const int kNumKeysPerFile = 128;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
const std::string write_timestamp = Timestamp(1, 0);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamp,
|
|
|
|
"value" + std::to_string(key));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Reopen the database in read only mode to test its timestamp support.
|
|
|
|
Close();
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
ReadOptions read_opts;
|
|
|
|
{
|
|
|
|
std::vector<Iterator*> iters;
|
|
|
|
ASSERT_TRUE(
|
|
|
|
db_->NewIterators(read_opts, {db_->DefaultColumnFamily()}, &iters)
|
|
|
|
.IsInvalidArgument());
|
|
|
|
}
|
|
|
|
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp, CompactedDBGetReadTimestampSizeMismatch) {
|
|
|
|
const int kNumKeysPerFile = 1026;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.disable_auto_compactions = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
std::string write_timestamp = Timestamp(1, 0);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamp,
|
|
|
|
"value" + std::to_string(0));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
ASSERT_OK(db_->Flush(FlushOptions()));
|
|
|
|
Close();
|
|
|
|
|
|
|
|
// Reopen the database in read only mode as a Compacted DB to test its
|
|
|
|
// timestamp support.
|
|
|
|
options.max_open_files = -1;
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
CheckDBOpenedAsCompactedDBWithOneLevel0File();
|
|
|
|
|
|
|
|
ReadOptions read_opts;
|
|
|
|
std::string different_size_read_timestamp;
|
|
|
|
PutFixed32(&different_size_read_timestamp, 2);
|
|
|
|
Slice different_size_read_ts = different_size_read_timestamp;
|
|
|
|
read_opts.timestamp = &different_size_read_ts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
std::string value_from_get;
|
|
|
|
std::string timestamp;
|
|
|
|
ASSERT_TRUE(db_->Get(read_opts, Key1(key), &value_from_get, ×tamp)
|
|
|
|
.IsInvalidArgument());
|
|
|
|
}
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp,
|
|
|
|
CompactedDBGetReadTimestampSpecifiedWithoutWriteTimestamp) {
|
|
|
|
const int kNumKeysPerFile = 1026;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.disable_auto_compactions = true;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), "value" + std::to_string(0));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
ASSERT_OK(db_->Flush(FlushOptions()));
|
|
|
|
Close();
|
|
|
|
|
|
|
|
// Reopen the database in read only mode as a Compacted DB to test its
|
|
|
|
// timestamp support.
|
|
|
|
options.max_open_files = -1;
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
CheckDBOpenedAsCompactedDBWithOneLevel0File();
|
|
|
|
|
|
|
|
ReadOptions read_opts;
|
|
|
|
const std::string read_timestamp = Timestamp(2, 0);
|
|
|
|
Slice read_ts = read_timestamp;
|
|
|
|
read_opts.timestamp = &read_ts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
std::string value_from_get;
|
|
|
|
std::string timestamp;
|
|
|
|
ASSERT_TRUE(db_->Get(read_opts, Key1(key), &value_from_get, ×tamp)
|
|
|
|
.IsInvalidArgument());
|
|
|
|
}
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp,
|
|
|
|
CompactedDBGetWriteWithTimestampReadWithoutTimestamp) {
|
|
|
|
const int kNumKeysPerFile = 1026;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.disable_auto_compactions = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
std::string write_timestamp = Timestamp(1, 0);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamp,
|
|
|
|
"value" + std::to_string(0));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
ASSERT_OK(db_->Flush(FlushOptions()));
|
|
|
|
Close();
|
|
|
|
|
|
|
|
// Reopen the database in read only mode as a Compacted DB to test its
|
|
|
|
// timestamp support.
|
|
|
|
options.max_open_files = -1;
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
CheckDBOpenedAsCompactedDBWithOneLevel0File();
|
|
|
|
|
|
|
|
ReadOptions read_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
std::string value_from_get;
|
|
|
|
ASSERT_TRUE(
|
|
|
|
db_->Get(read_opts, Key1(key), &value_from_get).IsInvalidArgument());
|
|
|
|
}
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp, CompactedDBGetWithOnlyOneL0File) {
|
|
|
|
const int kNumKeysPerFile = 1026 * 2;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.disable_auto_compactions = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
const std::vector<uint64_t> start_keys = {1, 0};
|
|
|
|
const std::vector<std::string> write_timestamps = {Timestamp(1, 0),
|
|
|
|
Timestamp(3, 0)};
|
|
|
|
const std::vector<std::string> read_timestamps = {Timestamp(2, 0),
|
|
|
|
Timestamp(4, 0)};
|
|
|
|
for (size_t i = 0; i < write_timestamps.size(); ++i) {
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = start_keys[i]; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamps[i],
|
|
|
|
"value" + std::to_string(i));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ASSERT_OK(db_->Flush(FlushOptions()));
|
|
|
|
Close();
|
|
|
|
|
|
|
|
// Reopen the database in read only mode as a Compacted DB to test its
|
|
|
|
// timestamp support.
|
|
|
|
options.max_open_files = -1;
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
CheckDBOpenedAsCompactedDBWithOneLevel0File();
|
|
|
|
|
|
|
|
for (size_t i = 0; i < read_timestamps.size(); ++i) {
|
|
|
|
ReadOptions read_opts;
|
|
|
|
Slice read_ts = read_timestamps[i];
|
|
|
|
read_opts.timestamp = &read_ts;
|
|
|
|
int count = 0;
|
|
|
|
for (uint64_t key = start_keys[i]; key <= kMaxKey; ++key, ++count) {
|
|
|
|
std::string value_from_get;
|
|
|
|
std::string timestamp;
|
|
|
|
ASSERT_OK(db_->Get(read_opts, Key1(key), &value_from_get, ×tamp));
|
|
|
|
ASSERT_EQ("value" + std::to_string(i), value_from_get);
|
|
|
|
ASSERT_EQ(write_timestamps[i], timestamp);
|
|
|
|
}
|
|
|
|
size_t expected_count = kMaxKey - start_keys[i] + 1;
|
|
|
|
ASSERT_EQ(expected_count, count);
|
|
|
|
}
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp,
|
|
|
|
CompactedDBGetWithOnlyHighestNonEmptyLevelFiles) {
|
|
|
|
const int kNumKeysPerFile = 128;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.disable_auto_compactions = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
const std::vector<uint64_t> start_keys = {1, 0};
|
|
|
|
const std::vector<std::string> write_timestamps = {Timestamp(1, 0),
|
|
|
|
Timestamp(3, 0)};
|
|
|
|
const std::vector<std::string> read_timestamps = {Timestamp(2, 0),
|
|
|
|
Timestamp(4, 0)};
|
|
|
|
for (size_t i = 0; i < write_timestamps.size(); ++i) {
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = start_keys[i]; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamps[i],
|
|
|
|
"value" + std::to_string(i));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ASSERT_OK(db_->Flush(FlushOptions()));
|
|
|
|
ASSERT_OK(db_->CompactRange(CompactRangeOptions(), nullptr, nullptr));
|
|
|
|
Close();
|
|
|
|
|
|
|
|
// Reopen the database in read only mode as a Compacted DB to test its
|
|
|
|
// timestamp support.
|
|
|
|
options.max_open_files = -1;
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
CheckDBOpenedAsCompactedDBWithOnlyHighestNonEmptyLevelFiles();
|
|
|
|
|
|
|
|
for (size_t i = 0; i < read_timestamps.size(); ++i) {
|
|
|
|
ReadOptions read_opts;
|
|
|
|
Slice read_ts = read_timestamps[i];
|
|
|
|
read_opts.timestamp = &read_ts;
|
|
|
|
int count = 0;
|
|
|
|
for (uint64_t key = start_keys[i]; key <= kMaxKey; ++key, ++count) {
|
|
|
|
std::string value_from_get;
|
|
|
|
std::string timestamp;
|
|
|
|
ASSERT_OK(db_->Get(read_opts, Key1(key), &value_from_get, ×tamp));
|
|
|
|
ASSERT_EQ("value" + std::to_string(i), value_from_get);
|
|
|
|
ASSERT_EQ(write_timestamps[i], timestamp);
|
|
|
|
}
|
|
|
|
size_t expected_count = kMaxKey - start_keys[i] + 1;
|
|
|
|
ASSERT_EQ(expected_count, count);
|
|
|
|
}
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp,
|
|
|
|
CompactedDBMultiGetReadTimestampSizeMismatch) {
|
|
|
|
const int kNumKeysPerFile = 1026;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.disable_auto_compactions = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
std::string write_timestamp = Timestamp(1, 0);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamp,
|
|
|
|
"value" + std::to_string(0));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
ASSERT_OK(db_->Flush(FlushOptions()));
|
|
|
|
Close();
|
|
|
|
|
|
|
|
// Reopen the database in read only mode as a Compacted DB to test its
|
|
|
|
// timestamp support.
|
|
|
|
options.max_open_files = -1;
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
CheckDBOpenedAsCompactedDBWithOneLevel0File();
|
|
|
|
|
|
|
|
ReadOptions read_opts;
|
|
|
|
std::string different_size_read_timestamp;
|
|
|
|
PutFixed32(&different_size_read_timestamp, 2);
|
|
|
|
Slice different_size_read_ts = different_size_read_timestamp;
|
|
|
|
read_opts.timestamp = &different_size_read_ts;
|
|
|
|
std::vector<std::string> key_strs;
|
|
|
|
std::vector<Slice> keys;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
key_strs.push_back(Key1(key));
|
|
|
|
}
|
|
|
|
for (const auto& key_str : key_strs) {
|
|
|
|
keys.emplace_back(key_str);
|
|
|
|
}
|
|
|
|
std::vector<std::string> values;
|
|
|
|
std::vector<std::string> timestamps;
|
|
|
|
std::vector<Status> status_list =
|
|
|
|
db_->MultiGet(read_opts, keys, &values, ×tamps);
|
|
|
|
for (const auto& status : status_list) {
|
|
|
|
ASSERT_TRUE(status.IsInvalidArgument());
|
|
|
|
}
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp,
|
|
|
|
CompactedDBMultiGetReadTimestampSpecifiedWithoutWriteTimestamp) {
|
|
|
|
const int kNumKeysPerFile = 1026;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.disable_auto_compactions = true;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), "value" + std::to_string(0));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
ASSERT_OK(db_->Flush(FlushOptions()));
|
|
|
|
Close();
|
|
|
|
|
|
|
|
// Reopen the database in read only mode as a Compacted DB to test its
|
|
|
|
// timestamp support.
|
|
|
|
options.max_open_files = -1;
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
CheckDBOpenedAsCompactedDBWithOneLevel0File();
|
|
|
|
|
|
|
|
ReadOptions read_opts;
|
|
|
|
std::string read_timestamp = Timestamp(2, 0);
|
|
|
|
Slice read_ts = read_timestamp;
|
|
|
|
read_opts.timestamp = &read_ts;
|
|
|
|
std::vector<std::string> key_strs;
|
|
|
|
std::vector<Slice> keys;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
key_strs.push_back(Key1(key));
|
|
|
|
}
|
|
|
|
for (const auto& key_str : key_strs) {
|
|
|
|
keys.emplace_back(key_str);
|
|
|
|
}
|
|
|
|
std::vector<std::string> values;
|
|
|
|
std::vector<std::string> timestamps;
|
|
|
|
std::vector<Status> status_list =
|
|
|
|
db_->MultiGet(read_opts, keys, &values, ×tamps);
|
|
|
|
for (const auto& status : status_list) {
|
|
|
|
ASSERT_TRUE(status.IsInvalidArgument());
|
|
|
|
}
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp,
|
|
|
|
CompactedDBMultiGetWriteWithTimestampReadWithoutTimestamp) {
|
|
|
|
const int kNumKeysPerFile = 1026;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.disable_auto_compactions = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
std::string write_timestamp = Timestamp(1, 0);
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamp,
|
|
|
|
"value" + std::to_string(0));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
ASSERT_OK(db_->Flush(FlushOptions()));
|
|
|
|
Close();
|
|
|
|
|
|
|
|
// Reopen the database in read only mode as a Compacted DB to test its
|
|
|
|
// timestamp support.
|
|
|
|
options.max_open_files = -1;
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
CheckDBOpenedAsCompactedDBWithOneLevel0File();
|
|
|
|
|
|
|
|
ReadOptions read_opts;
|
|
|
|
std::vector<std::string> key_strs;
|
|
|
|
std::vector<Slice> keys;
|
|
|
|
for (uint64_t key = 0; key <= kMaxKey; ++key) {
|
|
|
|
key_strs.push_back(Key1(key));
|
|
|
|
}
|
|
|
|
for (const auto& key_str : key_strs) {
|
|
|
|
keys.emplace_back(key_str);
|
|
|
|
}
|
|
|
|
std::vector<std::string> values;
|
|
|
|
std::vector<Status> status_list = db_->MultiGet(read_opts, keys, &values);
|
|
|
|
for (const auto& status : status_list) {
|
|
|
|
ASSERT_TRUE(status.IsInvalidArgument());
|
|
|
|
}
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp, CompactedDBMultiGetWithOnlyOneL0File) {
|
|
|
|
const int kNumKeysPerFile = 1026 * 2;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.disable_auto_compactions = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
const std::vector<uint64_t> start_keys = {1, 0};
|
|
|
|
const std::vector<std::string> write_timestamps = {Timestamp(1, 0),
|
|
|
|
Timestamp(3, 0)};
|
|
|
|
const std::vector<std::string> read_timestamps = {Timestamp(2, 0),
|
|
|
|
Timestamp(4, 0)};
|
|
|
|
for (size_t i = 0; i < write_timestamps.size(); ++i) {
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = start_keys[i]; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamps[i],
|
|
|
|
"value" + std::to_string(i));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ASSERT_OK(db_->Flush(FlushOptions()));
|
|
|
|
Close();
|
|
|
|
|
|
|
|
// Reopen the database in read only mode as a Compacted DB to test its
|
|
|
|
// timestamp support.
|
|
|
|
options.max_open_files = -1;
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
CheckDBOpenedAsCompactedDBWithOneLevel0File();
|
|
|
|
|
|
|
|
for (size_t i = 0; i < write_timestamps.size(); ++i) {
|
|
|
|
ReadOptions read_opts;
|
|
|
|
Slice read_ts = read_timestamps[i];
|
|
|
|
read_opts.timestamp = &read_ts;
|
|
|
|
std::vector<std::string> key_strs;
|
|
|
|
std::vector<Slice> keys;
|
|
|
|
for (uint64_t key = start_keys[i]; key <= kMaxKey; ++key) {
|
|
|
|
key_strs.push_back(Key1(key));
|
|
|
|
}
|
|
|
|
for (const auto& key_str : key_strs) {
|
|
|
|
keys.emplace_back(key_str);
|
|
|
|
}
|
|
|
|
size_t batch_size = kMaxKey - start_keys[i] + 1;
|
|
|
|
std::vector<std::string> values;
|
|
|
|
std::vector<std::string> timestamps;
|
|
|
|
std::vector<Status> status_list =
|
|
|
|
db_->MultiGet(read_opts, keys, &values, ×tamps);
|
|
|
|
ASSERT_EQ(batch_size, values.size());
|
|
|
|
ASSERT_EQ(batch_size, timestamps.size());
|
|
|
|
for (uint64_t idx = 0; idx < values.size(); ++idx) {
|
|
|
|
ASSERT_EQ("value" + std::to_string(i), values[idx]);
|
|
|
|
ASSERT_EQ(write_timestamps[i], timestamps[idx]);
|
|
|
|
ASSERT_OK(status_list[idx]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Close();
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(DBReadOnlyTestWithTimestamp,
|
|
|
|
CompactedDBMultiGetWithOnlyHighestNonEmptyLevelFiles) {
|
|
|
|
const int kNumKeysPerFile = 128;
|
|
|
|
const uint64_t kMaxKey = 1024;
|
|
|
|
Options options = CurrentOptions();
|
|
|
|
options.env = env_;
|
|
|
|
options.create_if_missing = true;
|
|
|
|
options.disable_auto_compactions = true;
|
|
|
|
const size_t kTimestampSize = Timestamp(0, 0).size();
|
|
|
|
TestComparator test_cmp(kTimestampSize);
|
|
|
|
options.comparator = &test_cmp;
|
|
|
|
options.memtable_factory.reset(
|
|
|
|
test::NewSpecialSkipListFactory(kNumKeysPerFile));
|
|
|
|
DestroyAndReopen(options);
|
|
|
|
const std::vector<uint64_t> start_keys = {1, 0};
|
|
|
|
const std::vector<std::string> write_timestamps = {Timestamp(1, 0),
|
|
|
|
Timestamp(3, 0)};
|
|
|
|
const std::vector<std::string> read_timestamps = {Timestamp(2, 0),
|
|
|
|
Timestamp(4, 0)};
|
|
|
|
for (size_t i = 0; i < write_timestamps.size(); ++i) {
|
|
|
|
WriteOptions write_opts;
|
|
|
|
for (uint64_t key = start_keys[i]; key <= kMaxKey; ++key) {
|
|
|
|
Status s = db_->Put(write_opts, Key1(key), write_timestamps[i],
|
|
|
|
"value" + std::to_string(i));
|
|
|
|
ASSERT_OK(s);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ASSERT_OK(db_->Flush(FlushOptions()));
|
|
|
|
ASSERT_OK(db_->CompactRange(CompactRangeOptions(), nullptr, nullptr));
|
|
|
|
Close();
|
|
|
|
|
|
|
|
// Reopen the database in read only mode as a Compacted DB to test its
|
|
|
|
// timestamp support.
|
|
|
|
options.max_open_files = -1;
|
|
|
|
ASSERT_OK(ReadOnlyReopen(options));
|
|
|
|
CheckDBOpenedAsCompactedDBWithOnlyHighestNonEmptyLevelFiles();
|
|
|
|
|
|
|
|
for (size_t i = 0; i < write_timestamps.size(); ++i) {
|
|
|
|
ReadOptions read_opts;
|
|
|
|
Slice read_ts = read_timestamps[i];
|
|
|
|
read_opts.timestamp = &read_ts;
|
|
|
|
std::vector<std::string> key_strs;
|
|
|
|
std::vector<Slice> keys;
|
|
|
|
for (uint64_t key = start_keys[i]; key <= kMaxKey; ++key) {
|
|
|
|
key_strs.push_back(Key1(key));
|
|
|
|
}
|
|
|
|
for (const auto& key_str : key_strs) {
|
|
|
|
keys.emplace_back(key_str);
|
|
|
|
}
|
|
|
|
size_t batch_size = kMaxKey - start_keys[i] + 1;
|
|
|
|
std::vector<std::string> values;
|
|
|
|
std::vector<std::string> timestamps;
|
|
|
|
std::vector<Status> status_list =
|
|
|
|
db_->MultiGet(read_opts, keys, &values, ×tamps);
|
|
|
|
ASSERT_EQ(batch_size, values.size());
|
|
|
|
ASSERT_EQ(batch_size, timestamps.size());
|
|
|
|
for (uint64_t idx = 0; idx < values.size(); ++idx) {
|
|
|
|
ASSERT_EQ("value" + std::to_string(i), values[idx]);
|
|
|
|
ASSERT_EQ(write_timestamps[i], timestamps[idx]);
|
|
|
|
ASSERT_OK(status_list[idx]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Close();
|
|
|
|
}
|
2022-05-20 01:39:41 +00:00
|
|
|
#endif // !ROCKSDB_LITE
|
|
|
|
} // namespace ROCKSDB_NAMESPACE
|
|
|
|
|
|
|
|
int main(int argc, char** argv) {
|
|
|
|
ROCKSDB_NAMESPACE::port::InstallStackTraceHandler();
|
|
|
|
::testing::InitGoogleTest(&argc, argv);
|
|
|
|
RegisterCustomObjects(argc, argv);
|
|
|
|
return RUN_ALL_TESTS();
|
|
|
|
}
|