Summary: Before this PR, Iterator/InternalIterator may simultaneously have non-ok status() and Valid() = true. That state means that the last operation failed, but the iterator is nevertheless positioned on some unspecified record. Likely intended uses of that are: * If some sst files are corrupted, a normal iterator can be used to read the data from files that are not corrupted. * When using read_tier = kBlockCacheTier, read the data that's in block cache, skipping over the data that is not. However, this behavior wasn't documented well (and until recently the wiki on github had misleading incorrect information). In the code there's a lot of confusion about the relationship between status() and Valid(), and about whether Seek()/SeekToLast()/etc reset the status or not. There were a number of bugs caused by this confusion, both inside rocksdb and in the code that uses rocksdb (including ours). This PR changes the convention to: * If status() is not ok, Valid() always returns false. * Any seek operation resets status. (Before the PR, it depended on iterator type and on particular error.) This does sacrifice the two use cases listed above, but siying said it's ok. Overview of the changes: * A commit that adds missing status checks in MergingIterator. This fixes a bug that actually affects us, and we need it fixed. `DBIteratorTest.NonBlockingIterationBugRepro` explains the scenario. * Changes to lots of iterator types to make all of them conform to the new convention. Some bug fixes along the way. By far the biggest changes are in DBIter, which is a big messy piece of code; I tried to make it less big and messy but mostly failed. * A stress-test for DBIter, to gain some confidence that I didn't break it. It does a few million random operations on the iterator, while occasionally modifying the underlying data (like ForwardIterator does) and occasionally returning non-ok status from internal iterator. To find the iterator types that needed changes I searched for "public .*Iterator" in the code. Here's an overview of all 27 iterator types: Iterators that didn't need changes: * status() is always ok(), or Valid() is always false: MemTableIterator, ModelIter, TestIterator, KVIter (2 classes with this name anonymous namespaces), LoggingForwardVectorIterator, VectorIterator, MockTableIterator, EmptyIterator, EmptyInternalIterator. * Thin wrappers that always pass through Valid() and status(): ArenaWrappedDBIter, TtlIterator, InternalIteratorFromIterator. Iterators with changes (see inline comments for details): * DBIter - an overhaul: - It used to silently skip corrupted keys (`FindParseableKey()`), which seems dangerous. This PR makes it just stop immediately after encountering a corrupted key, just like it would for other kinds of corruption. Let me know if there was actually some deeper meaning in this behavior and I should put it back. - It had a few code paths silently discarding subiterator's status. The stress test caught a few. - The backwards iteration code path was expecting the internal iterator's set of keys to be immutable. It's probably always true in practice at the moment, since ForwardIterator doesn't support backwards iteration, but this PR fixes it anyway. See added DBIteratorTest.ReverseToForwardBug for an example. - Some parts of backwards iteration code path even did things like `assert(iter_->Valid())` after a seek, which is never a safe assumption. - It used to not reset status on seek for some types of errors. - Some simplifications and better comments. - Some things got more complicated from the added error handling. I'm open to ideas for how to make it nicer. * MergingIterator - check status after every operation on every subiterator, and in some places assert that valid subiterators have ok status. * ForwardIterator - changed to the new convention, also slightly simplified. * ForwardLevelIterator - fixed some bugs and simplified. * LevelIterator - simplified. * TwoLevelIterator - changed to the new convention. Also fixed a bug that would make SeekForPrev() sometimes silently ignore errors from first_level_iter_. * BlockBasedTableIterator - minor changes. * BlockIter - replaced `SetStatus()` with `Invalidate()` to make sure non-ok BlockIter is always invalid. * PlainTableIterator - some seeks used to not reset status. * CuckooTableIterator - tiny code cleanup. * ManagedIterator - fixed some bugs. * BaseDeltaIterator - changed to the new convention and fixed a bug. * BlobDBIterator - seeks used to not reset status. * KeyConvertingIterator - some small change. Closes https://github.com/facebook/rocksdb/pull/3810 Differential Revision: D7888019 Pulled By: al13n321 fbshipit-source-id: 4aaf6d3421c545d16722a815b2fa2e7912bc851d
3118 lines
105 KiB
C++
3118 lines
105 KiB
C++
// 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).
|
|
|
|
#include <string>
|
|
#include <vector>
|
|
#include <algorithm>
|
|
#include <utility>
|
|
|
|
#include "db/db_iter.h"
|
|
#include "db/dbformat.h"
|
|
#include "rocksdb/comparator.h"
|
|
#include "rocksdb/options.h"
|
|
#include "rocksdb/perf_context.h"
|
|
#include "rocksdb/slice.h"
|
|
#include "rocksdb/statistics.h"
|
|
#include "table/iterator_wrapper.h"
|
|
#include "table/merging_iterator.h"
|
|
#include "util/string_util.h"
|
|
#include "util/sync_point.h"
|
|
#include "util/testharness.h"
|
|
#include "utilities/merge_operators.h"
|
|
|
|
namespace rocksdb {
|
|
|
|
static uint64_t TestGetTickerCount(const Options& options,
|
|
Tickers ticker_type) {
|
|
return options.statistics->getTickerCount(ticker_type);
|
|
}
|
|
|
|
class TestIterator : public InternalIterator {
|
|
public:
|
|
explicit TestIterator(const Comparator* comparator)
|
|
: initialized_(false),
|
|
valid_(false),
|
|
sequence_number_(0),
|
|
iter_(0),
|
|
cmp(comparator) {}
|
|
|
|
void AddPut(std::string argkey, std::string argvalue) {
|
|
Add(argkey, kTypeValue, argvalue);
|
|
}
|
|
|
|
void AddDeletion(std::string argkey) {
|
|
Add(argkey, kTypeDeletion, std::string());
|
|
}
|
|
|
|
void AddSingleDeletion(std::string argkey) {
|
|
Add(argkey, kTypeSingleDeletion, std::string());
|
|
}
|
|
|
|
void AddMerge(std::string argkey, std::string argvalue) {
|
|
Add(argkey, kTypeMerge, argvalue);
|
|
}
|
|
|
|
void Add(std::string argkey, ValueType type, std::string argvalue) {
|
|
Add(argkey, type, argvalue, sequence_number_++);
|
|
}
|
|
|
|
void Add(std::string argkey, ValueType type, std::string argvalue,
|
|
size_t seq_num, bool update_iter = false) {
|
|
valid_ = true;
|
|
ParsedInternalKey internal_key(argkey, seq_num, type);
|
|
data_.push_back(
|
|
std::pair<std::string, std::string>(std::string(), argvalue));
|
|
AppendInternalKey(&data_.back().first, internal_key);
|
|
if (update_iter && valid_ && cmp.Compare(data_.back().first, key()) < 0) {
|
|
// insert a key smaller than current key
|
|
Finish();
|
|
// data_[iter_] is not anymore the current element of the iterator.
|
|
// Increment it to reposition it to the right position.
|
|
iter_++;
|
|
}
|
|
}
|
|
|
|
// should be called before operations with iterator
|
|
void Finish() {
|
|
initialized_ = true;
|
|
std::sort(data_.begin(), data_.end(),
|
|
[this](std::pair<std::string, std::string> a,
|
|
std::pair<std::string, std::string> b) {
|
|
return (cmp.Compare(a.first, b.first) < 0);
|
|
});
|
|
}
|
|
|
|
// Removes the key from the set of keys over which this iterator iterates.
|
|
// Not to be confused with AddDeletion().
|
|
// If the iterator is currently positioned on this key, the deletion will
|
|
// apply next time the iterator moves.
|
|
// Used for simulating ForwardIterator updating to a new version that doesn't
|
|
// have some of the keys (e.g. after compaction with a filter).
|
|
void Vanish(std::string _key) {
|
|
if (valid_ && data_[iter_].first == _key) {
|
|
delete_current_ = true;
|
|
return;
|
|
}
|
|
for (auto it = data_.begin(); it != data_.end(); ++it) {
|
|
ParsedInternalKey ikey;
|
|
bool ok __attribute__((__unused__)) = ParseInternalKey(it->first, &ikey);
|
|
assert(ok);
|
|
if (ikey.user_key != _key) {
|
|
continue;
|
|
}
|
|
if (valid_ && data_.begin() + iter_ > it) {
|
|
--iter_;
|
|
}
|
|
data_.erase(it);
|
|
return;
|
|
}
|
|
assert(false);
|
|
}
|
|
|
|
// Number of operations done on this iterator since construction.
|
|
size_t steps() const { return steps_; }
|
|
|
|
virtual bool Valid() const override {
|
|
assert(initialized_);
|
|
return valid_;
|
|
}
|
|
|
|
virtual void SeekToFirst() override {
|
|
assert(initialized_);
|
|
++steps_;
|
|
DeleteCurrentIfNeeded();
|
|
valid_ = (data_.size() > 0);
|
|
iter_ = 0;
|
|
}
|
|
|
|
virtual void SeekToLast() override {
|
|
assert(initialized_);
|
|
++steps_;
|
|
DeleteCurrentIfNeeded();
|
|
valid_ = (data_.size() > 0);
|
|
iter_ = data_.size() - 1;
|
|
}
|
|
|
|
virtual void Seek(const Slice& target) override {
|
|
assert(initialized_);
|
|
SeekToFirst();
|
|
++steps_;
|
|
if (!valid_) {
|
|
return;
|
|
}
|
|
while (iter_ < data_.size() &&
|
|
(cmp.Compare(data_[iter_].first, target) < 0)) {
|
|
++iter_;
|
|
}
|
|
|
|
if (iter_ == data_.size()) {
|
|
valid_ = false;
|
|
}
|
|
}
|
|
|
|
virtual void SeekForPrev(const Slice& target) override {
|
|
assert(initialized_);
|
|
DeleteCurrentIfNeeded();
|
|
SeekForPrevImpl(target, &cmp);
|
|
}
|
|
|
|
virtual void Next() override {
|
|
assert(initialized_);
|
|
assert(valid_);
|
|
assert(iter_ < data_.size());
|
|
|
|
++steps_;
|
|
if (delete_current_) {
|
|
DeleteCurrentIfNeeded();
|
|
} else {
|
|
++iter_;
|
|
}
|
|
valid_ = iter_ < data_.size();
|
|
}
|
|
|
|
virtual void Prev() override {
|
|
assert(initialized_);
|
|
assert(valid_);
|
|
assert(iter_ < data_.size());
|
|
|
|
++steps_;
|
|
DeleteCurrentIfNeeded();
|
|
if (iter_ == 0) {
|
|
valid_ = false;
|
|
} else {
|
|
--iter_;
|
|
}
|
|
}
|
|
|
|
virtual Slice key() const override {
|
|
assert(initialized_);
|
|
return data_[iter_].first;
|
|
}
|
|
|
|
virtual Slice value() const override {
|
|
assert(initialized_);
|
|
return data_[iter_].second;
|
|
}
|
|
|
|
virtual Status status() const override {
|
|
assert(initialized_);
|
|
return Status::OK();
|
|
}
|
|
|
|
virtual bool IsKeyPinned() const override { return true; }
|
|
virtual bool IsValuePinned() const override { return true; }
|
|
|
|
private:
|
|
bool initialized_;
|
|
bool valid_;
|
|
size_t sequence_number_;
|
|
size_t iter_;
|
|
size_t steps_ = 0;
|
|
|
|
InternalKeyComparator cmp;
|
|
std::vector<std::pair<std::string, std::string>> data_;
|
|
bool delete_current_ = false;
|
|
|
|
void DeleteCurrentIfNeeded() {
|
|
if (!delete_current_) {
|
|
return;
|
|
}
|
|
data_.erase(data_.begin() + iter_);
|
|
delete_current_ = false;
|
|
}
|
|
};
|
|
|
|
class DBIteratorTest : public testing::Test {
|
|
public:
|
|
Env* env_;
|
|
|
|
DBIteratorTest() : env_(Env::Default()) {}
|
|
};
|
|
|
|
TEST_F(DBIteratorTest, DBIteratorPrevNext) {
|
|
Options options;
|
|
ImmutableCFOptions cf_options = ImmutableCFOptions(options);
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddPut("a", "val_a");
|
|
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->Finish();
|
|
|
|
ReadOptions ro;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_b");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_b");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
// Test to check the SeekToLast() with iterate_upper_bound not set
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->Finish();
|
|
|
|
ReadOptions ro;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
}
|
|
|
|
// Test to check the SeekToLast() with iterate_upper_bound set
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddPut("d", "val_d");
|
|
internal_iter->AddPut("e", "val_e");
|
|
internal_iter->AddPut("f", "val_f");
|
|
internal_iter->Finish();
|
|
|
|
Slice prefix("d");
|
|
|
|
ReadOptions ro;
|
|
ro.iterate_upper_bound = &prefix;
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
}
|
|
// Test to check the SeekToLast() iterate_upper_bound set to a key that
|
|
// is not Put yet
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddPut("d", "val_d");
|
|
internal_iter->Finish();
|
|
|
|
Slice prefix("z");
|
|
|
|
ReadOptions ro;
|
|
ro.iterate_upper_bound = &prefix;
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "d");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "d");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
}
|
|
// Test to check the SeekToLast() with iterate_upper_bound set to the
|
|
// first key
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->Finish();
|
|
|
|
Slice prefix("a");
|
|
|
|
ReadOptions ro;
|
|
ro.iterate_upper_bound = &prefix;
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
// Test case to check SeekToLast with iterate_upper_bound set
|
|
// (same key put may times - SeekToLast should start with the
|
|
// maximum sequence id of the upper bound)
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->Finish();
|
|
|
|
Slice prefix("c");
|
|
|
|
ReadOptions ro;
|
|
ro.iterate_upper_bound = &prefix;
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 7,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
SetPerfLevel(kEnableCount);
|
|
ASSERT_TRUE(GetPerfLevel() == kEnableCount);
|
|
|
|
get_perf_context()->Reset();
|
|
db_iter->SeekToLast();
|
|
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(static_cast<int>(get_perf_context()->internal_key_skipped_count), 1);
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
|
|
SetPerfLevel(kDisable);
|
|
}
|
|
// Test to check the SeekToLast() with the iterate_upper_bound set
|
|
// (Checking the value of the key which has sequence ids greater than
|
|
// and less that the iterator's sequence id)
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
|
|
internal_iter->AddPut("a", "val_a1");
|
|
internal_iter->AddPut("a", "val_a2");
|
|
internal_iter->AddPut("b", "val_b1");
|
|
internal_iter->AddPut("c", "val_c1");
|
|
internal_iter->AddPut("c", "val_c2");
|
|
internal_iter->AddPut("c", "val_c3");
|
|
internal_iter->AddPut("b", "val_b2");
|
|
internal_iter->AddPut("d", "val_d1");
|
|
internal_iter->Finish();
|
|
|
|
Slice prefix("c");
|
|
|
|
ReadOptions ro;
|
|
ro.iterate_upper_bound = &prefix;
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 4,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_b1");
|
|
}
|
|
|
|
// Test to check the SeekToLast() with the iterate_upper_bound set to the
|
|
// key that is deleted
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->Finish();
|
|
|
|
Slice prefix("a");
|
|
|
|
ReadOptions ro;
|
|
ro.iterate_upper_bound = &prefix;
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
// Test to check the SeekToLast() with the iterate_upper_bound set
|
|
// (Deletion cases)
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->Finish();
|
|
|
|
Slice prefix("c");
|
|
|
|
ReadOptions ro;
|
|
ro.iterate_upper_bound = &prefix;
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
}
|
|
// Test to check the SeekToLast() with iterate_upper_bound set
|
|
// (Deletion cases - Lot of internal keys after the upper_bound
|
|
// is deleted)
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->AddDeletion("d");
|
|
internal_iter->AddDeletion("e");
|
|
internal_iter->AddDeletion("f");
|
|
internal_iter->AddDeletion("g");
|
|
internal_iter->AddDeletion("h");
|
|
internal_iter->Finish();
|
|
|
|
Slice prefix("c");
|
|
|
|
ReadOptions ro;
|
|
ro.iterate_upper_bound = &prefix;
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 7,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
SetPerfLevel(kEnableCount);
|
|
ASSERT_TRUE(GetPerfLevel() == kEnableCount);
|
|
|
|
get_perf_context()->Reset();
|
|
db_iter->SeekToLast();
|
|
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(static_cast<int>(get_perf_context()->internal_delete_skipped_count), 0);
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
|
|
SetPerfLevel(kDisable);
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddPut("a", "val_a");
|
|
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->Finish();
|
|
|
|
ReadOptions ro;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_b");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->Finish();
|
|
|
|
ReadOptions ro;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 2,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_b");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_b");
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("a", "val_a");
|
|
|
|
internal_iter->AddPut("b", "val_b");
|
|
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->Finish();
|
|
|
|
ReadOptions ro;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_c");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_b");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_c");
|
|
}
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIteratorEmpty) {
|
|
Options options;
|
|
ImmutableCFOptions cf_options = ImmutableCFOptions(options);
|
|
ReadOptions ro;
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 0,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 0,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIteratorUseSkipCountSkips) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.statistics = rocksdb::CreateDBStatistics();
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
for (size_t i = 0; i < 200; ++i) {
|
|
internal_iter->AddPut("a", "a");
|
|
internal_iter->AddPut("b", "b");
|
|
internal_iter->AddPut("c", "c");
|
|
}
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(
|
|
NewDBIterator(env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 2, options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "c");
|
|
ASSERT_EQ(TestGetTickerCount(options, NUMBER_OF_RESEEKS_IN_ITERATION), 1u);
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "b");
|
|
ASSERT_EQ(TestGetTickerCount(options, NUMBER_OF_RESEEKS_IN_ITERATION), 2u);
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "a");
|
|
ASSERT_EQ(TestGetTickerCount(options, NUMBER_OF_RESEEKS_IN_ITERATION), 3u);
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_EQ(TestGetTickerCount(options, NUMBER_OF_RESEEKS_IN_ITERATION), 3u);
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIteratorUseSkip) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
ImmutableCFOptions cf_options = ImmutableCFOptions(options);
|
|
|
|
{
|
|
for (size_t i = 0; i < 200; ++i) {
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("b", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
for (size_t k = 0; k < 200; ++k) {
|
|
internal_iter->AddPut("c", ToString(k));
|
|
}
|
|
internal_iter->Finish();
|
|
|
|
options.statistics = rocksdb::CreateDBStatistics();
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, i + 2,
|
|
options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), ToString(i));
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_2");
|
|
db_iter->Prev();
|
|
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
}
|
|
|
|
{
|
|
for (size_t i = 0; i < 200; ++i) {
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("b", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
for (size_t k = 0; k < 200; ++k) {
|
|
internal_iter->AddDeletion("c");
|
|
}
|
|
internal_iter->AddPut("c", "200");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, i + 2,
|
|
options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_2");
|
|
db_iter->Prev();
|
|
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("b", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
for (size_t i = 0; i < 200; ++i) {
|
|
internal_iter->AddDeletion("c");
|
|
}
|
|
internal_iter->AddPut("c", "200");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 202,
|
|
options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "200");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_2");
|
|
db_iter->Prev();
|
|
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
}
|
|
|
|
{
|
|
for (size_t i = 0; i < 200; ++i) {
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
for (size_t k = 0; k < 200; ++k) {
|
|
internal_iter->AddDeletion("c");
|
|
}
|
|
internal_iter->AddPut("c", "200");
|
|
internal_iter->Finish();
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, i,
|
|
options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
for (size_t i = 0; i < 200; ++i) {
|
|
internal_iter->AddDeletion("c");
|
|
}
|
|
internal_iter->AddPut("c", "200");
|
|
internal_iter->Finish();
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 200,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "200");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "200");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
for (size_t i = 0; i < 200; ++i) {
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("b", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
for (size_t k = 0; k < 200; ++k) {
|
|
internal_iter->AddPut("d", ToString(k));
|
|
}
|
|
|
|
for (size_t k = 0; k < 200; ++k) {
|
|
internal_iter->AddPut("c", ToString(k));
|
|
}
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, i + 2,
|
|
options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter->value().ToString(), ToString(i));
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_2");
|
|
db_iter->Prev();
|
|
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
}
|
|
|
|
{
|
|
for (size_t i = 0; i < 200; ++i) {
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("b", "b");
|
|
internal_iter->AddMerge("a", "a");
|
|
for (size_t k = 0; k < 200; ++k) {
|
|
internal_iter->AddMerge("c", ToString(k));
|
|
}
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, i + 2,
|
|
options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
std::string merge_result = "0";
|
|
for (size_t j = 1; j <= i; ++j) {
|
|
merge_result += "," + ToString(j);
|
|
}
|
|
ASSERT_EQ(db_iter->value().ToString(), merge_result);
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "b");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "a");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIteratorSkipInternalKeys) {
|
|
Options options;
|
|
ImmutableCFOptions cf_options = ImmutableCFOptions(options);
|
|
ReadOptions ro;
|
|
|
|
// Basic test case ... Make sure explicityly passing the default value works.
|
|
// Skipping internal keys is disabled by default, when the value is 0.
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->AddPut("d", "val_d");
|
|
internal_iter->Finish();
|
|
|
|
ro.max_skippable_internal_keys = 0;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_d");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().ok());
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_d");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().ok());
|
|
}
|
|
|
|
// Test to make sure that the request will *not* fail as incomplete if
|
|
// num_internal_keys_skipped is *equal* to max_skippable_internal_keys
|
|
// threshold. (It will fail as incomplete only when the threshold is
|
|
// exceeded.)
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->Finish();
|
|
|
|
ro.max_skippable_internal_keys = 2;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_c");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().ok());
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_c");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().ok());
|
|
}
|
|
|
|
// Fail the request as incomplete when num_internal_keys_skipped >
|
|
// max_skippable_internal_keys
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->Finish();
|
|
|
|
ro.max_skippable_internal_keys = 2;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_c");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
}
|
|
|
|
// Test that the num_internal_keys_skipped counter resets after a successful
|
|
// read.
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddDeletion("d");
|
|
internal_iter->AddDeletion("d");
|
|
internal_iter->AddDeletion("d");
|
|
internal_iter->AddPut("e", "val_e");
|
|
internal_iter->Finish();
|
|
|
|
ro.max_skippable_internal_keys = 2;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_c");
|
|
|
|
db_iter->Next(); // num_internal_keys_skipped counter resets here.
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
}
|
|
|
|
// Test that the num_internal_keys_skipped counter resets after a successful
|
|
// read.
|
|
// Reverse direction
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddDeletion("d");
|
|
internal_iter->AddDeletion("d");
|
|
internal_iter->AddPut("e", "val_e");
|
|
internal_iter->Finish();
|
|
|
|
ro.max_skippable_internal_keys = 2;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "e");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_e");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_c");
|
|
|
|
db_iter->Prev(); // num_internal_keys_skipped counter resets here.
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
}
|
|
|
|
// Test that skipping separate keys is handled
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->AddDeletion("d");
|
|
internal_iter->AddPut("e", "val_e");
|
|
internal_iter->Finish();
|
|
|
|
ro.max_skippable_internal_keys = 2;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "e");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_e");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
}
|
|
|
|
// Test if alternating puts and deletes of the same key are handled correctly.
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->AddPut("d", "val_d");
|
|
internal_iter->AddDeletion("d");
|
|
internal_iter->AddPut("e", "val_e");
|
|
internal_iter->Finish();
|
|
|
|
ro.max_skippable_internal_keys = 2;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "e");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_e");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
}
|
|
|
|
// Test for large number of skippable internal keys with *default*
|
|
// max_sequential_skip_in_iterations.
|
|
{
|
|
for (size_t i = 1; i <= 200; ++i) {
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
for (size_t j = 1; j <= i; ++j) {
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddDeletion("b");
|
|
}
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->Finish();
|
|
|
|
ro.max_skippable_internal_keys = i;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 2 * i + 1,
|
|
options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Next();
|
|
if ((options.max_sequential_skip_in_iterations + 1) >=
|
|
ro.max_skippable_internal_keys) {
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
} else {
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_c");
|
|
}
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_c");
|
|
|
|
db_iter->Prev();
|
|
if ((options.max_sequential_skip_in_iterations + 1) >=
|
|
ro.max_skippable_internal_keys) {
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
} else {
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
}
|
|
}
|
|
}
|
|
|
|
// Test for large number of skippable internal keys with a *non-default*
|
|
// max_sequential_skip_in_iterations.
|
|
{
|
|
for (size_t i = 1; i <= 200; ++i) {
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
for (size_t j = 1; j <= i; ++j) {
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->AddDeletion("b");
|
|
}
|
|
internal_iter->AddPut("c", "val_c");
|
|
internal_iter->Finish();
|
|
|
|
options.max_sequential_skip_in_iterations = 1000;
|
|
ro.max_skippable_internal_keys = i;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 2 * i + 1,
|
|
options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_a");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val_c");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
ASSERT_TRUE(db_iter->status().IsIncomplete());
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator1) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "0");
|
|
internal_iter->AddPut("b", "0");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("a", "1");
|
|
internal_iter->AddMerge("b", "2");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(
|
|
NewDBIterator(env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 1, options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "0");
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
db_iter->Next();
|
|
ASSERT_FALSE(db_iter->Valid());
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator2) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "0");
|
|
internal_iter->AddPut("b", "0");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("a", "1");
|
|
internal_iter->AddMerge("b", "2");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(
|
|
NewDBIterator(env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 0, options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "0");
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator3) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "0");
|
|
internal_iter->AddPut("b", "0");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("a", "1");
|
|
internal_iter->AddMerge("b", "2");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(
|
|
NewDBIterator(env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 2, options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "0");
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator4) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "0");
|
|
internal_iter->AddPut("b", "0");
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("a", "1");
|
|
internal_iter->AddMerge("b", "2");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(
|
|
NewDBIterator(env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 4, options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "0,1");
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "2");
|
|
db_iter->Next();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator5) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
ImmutableCFOptions cf_options = ImmutableCFOptions(options);
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddPut("a", "put_1");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 0,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddPut("a", "put_1");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 1,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1,merge_2");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddPut("a", "put_1");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 2,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1,merge_2,merge_3");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddPut("a", "put_1");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 3,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "put_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddPut("a", "put_1");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 4,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "put_1,merge_4");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddPut("a", "put_1");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 5,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "put_1,merge_4,merge_5");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddPut("a", "put_1");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 6,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "put_1,merge_4,merge_5,merge_6");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
// put, singledelete, merge
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "val_a");
|
|
internal_iter->AddSingleDeletion("a");
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddPut("b", "val_b");
|
|
internal_iter->Finish();
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 10,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->Seek("b");
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
}
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator6) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
ImmutableCFOptions cf_options = ImmutableCFOptions(options);
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 0,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 1,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1,merge_2");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 2,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1,merge_2,merge_3");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 3,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 4,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_4");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 5,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_4,merge_5");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("a", "merge_3");
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddMerge("a", "merge_4");
|
|
internal_iter->AddMerge("a", "merge_5");
|
|
internal_iter->AddMerge("a", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 6,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_4,merge_5,merge_6");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator7) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
ImmutableCFOptions cf_options = ImmutableCFOptions(options);
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddPut("b", "val");
|
|
internal_iter->AddMerge("b", "merge_2");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_3");
|
|
|
|
internal_iter->AddMerge("c", "merge_4");
|
|
internal_iter->AddMerge("c", "merge_5");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_6");
|
|
internal_iter->AddMerge("b", "merge_7");
|
|
internal_iter->AddMerge("b", "merge_8");
|
|
internal_iter->AddMerge("b", "merge_9");
|
|
internal_iter->AddMerge("b", "merge_10");
|
|
internal_iter->AddMerge("b", "merge_11");
|
|
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 0,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddPut("b", "val");
|
|
internal_iter->AddMerge("b", "merge_2");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_3");
|
|
|
|
internal_iter->AddMerge("c", "merge_4");
|
|
internal_iter->AddMerge("c", "merge_5");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_6");
|
|
internal_iter->AddMerge("b", "merge_7");
|
|
internal_iter->AddMerge("b", "merge_8");
|
|
internal_iter->AddMerge("b", "merge_9");
|
|
internal_iter->AddMerge("b", "merge_10");
|
|
internal_iter->AddMerge("b", "merge_11");
|
|
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 2,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "val,merge_2");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddPut("b", "val");
|
|
internal_iter->AddMerge("b", "merge_2");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_3");
|
|
|
|
internal_iter->AddMerge("c", "merge_4");
|
|
internal_iter->AddMerge("c", "merge_5");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_6");
|
|
internal_iter->AddMerge("b", "merge_7");
|
|
internal_iter->AddMerge("b", "merge_8");
|
|
internal_iter->AddMerge("b", "merge_9");
|
|
internal_iter->AddMerge("b", "merge_10");
|
|
internal_iter->AddMerge("b", "merge_11");
|
|
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 4,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_3");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddPut("b", "val");
|
|
internal_iter->AddMerge("b", "merge_2");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_3");
|
|
|
|
internal_iter->AddMerge("c", "merge_4");
|
|
internal_iter->AddMerge("c", "merge_5");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_6");
|
|
internal_iter->AddMerge("b", "merge_7");
|
|
internal_iter->AddMerge("b", "merge_8");
|
|
internal_iter->AddMerge("b", "merge_9");
|
|
internal_iter->AddMerge("b", "merge_10");
|
|
internal_iter->AddMerge("b", "merge_11");
|
|
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 5,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_4");
|
|
db_iter->Prev();
|
|
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_3");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddPut("b", "val");
|
|
internal_iter->AddMerge("b", "merge_2");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_3");
|
|
|
|
internal_iter->AddMerge("c", "merge_4");
|
|
internal_iter->AddMerge("c", "merge_5");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_6");
|
|
internal_iter->AddMerge("b", "merge_7");
|
|
internal_iter->AddMerge("b", "merge_8");
|
|
internal_iter->AddMerge("b", "merge_9");
|
|
internal_iter->AddMerge("b", "merge_10");
|
|
internal_iter->AddMerge("b", "merge_11");
|
|
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 6,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_4,merge_5");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_3");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddPut("b", "val");
|
|
internal_iter->AddMerge("b", "merge_2");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_3");
|
|
|
|
internal_iter->AddMerge("c", "merge_4");
|
|
internal_iter->AddMerge("c", "merge_5");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_6");
|
|
internal_iter->AddMerge("b", "merge_7");
|
|
internal_iter->AddMerge("b", "merge_8");
|
|
internal_iter->AddMerge("b", "merge_9");
|
|
internal_iter->AddMerge("b", "merge_10");
|
|
internal_iter->AddMerge("b", "merge_11");
|
|
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 7,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_4,merge_5");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddPut("b", "val");
|
|
internal_iter->AddMerge("b", "merge_2");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_3");
|
|
|
|
internal_iter->AddMerge("c", "merge_4");
|
|
internal_iter->AddMerge("c", "merge_5");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_6");
|
|
internal_iter->AddMerge("b", "merge_7");
|
|
internal_iter->AddMerge("b", "merge_8");
|
|
internal_iter->AddMerge("b", "merge_9");
|
|
internal_iter->AddMerge("b", "merge_10");
|
|
internal_iter->AddMerge("b", "merge_11");
|
|
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 9,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_4,merge_5");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_6,merge_7");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddPut("b", "val");
|
|
internal_iter->AddMerge("b", "merge_2");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_3");
|
|
|
|
internal_iter->AddMerge("c", "merge_4");
|
|
internal_iter->AddMerge("c", "merge_5");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_6");
|
|
internal_iter->AddMerge("b", "merge_7");
|
|
internal_iter->AddMerge("b", "merge_8");
|
|
internal_iter->AddMerge("b", "merge_9");
|
|
internal_iter->AddMerge("b", "merge_10");
|
|
internal_iter->AddMerge("b", "merge_11");
|
|
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 13,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_4,merge_5");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(),
|
|
"merge_6,merge_7,merge_8,merge_9,merge_10,merge_11");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddPut("b", "val");
|
|
internal_iter->AddMerge("b", "merge_2");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_3");
|
|
|
|
internal_iter->AddMerge("c", "merge_4");
|
|
internal_iter->AddMerge("c", "merge_5");
|
|
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddMerge("b", "merge_6");
|
|
internal_iter->AddMerge("b", "merge_7");
|
|
internal_iter->AddMerge("b", "merge_8");
|
|
internal_iter->AddMerge("b", "merge_9");
|
|
internal_iter->AddMerge("b", "merge_10");
|
|
internal_iter->AddMerge("b", "merge_11");
|
|
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, cf_options, BytewiseComparator(), internal_iter, 14,
|
|
options.max_sequential_skip_in_iterations, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(),
|
|
"merge_6,merge_7,merge_8,merge_9,merge_10,merge_11");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(!db_iter->Valid());
|
|
}
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator8) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddDeletion("a");
|
|
internal_iter->AddPut("a", "0");
|
|
internal_iter->AddPut("b", "0");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 10, options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "0");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "0");
|
|
}
|
|
|
|
// TODO(3.13): fix the issue of Seek() then Prev() which might not necessary
|
|
// return the biggest element smaller than the seek key.
|
|
TEST_F(DBIteratorTest, DBIterator9) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
{
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddMerge("a", "merge_1");
|
|
internal_iter->AddMerge("a", "merge_2");
|
|
internal_iter->AddMerge("b", "merge_3");
|
|
internal_iter->AddMerge("b", "merge_4");
|
|
internal_iter->AddMerge("d", "merge_5");
|
|
internal_iter->AddMerge("d", "merge_6");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 10, options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_3,merge_4");
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_5,merge_6");
|
|
|
|
db_iter->Seek("b");
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_3,merge_4");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_1,merge_2");
|
|
|
|
db_iter->SeekForPrev("b");
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_3,merge_4");
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_5,merge_6");
|
|
|
|
db_iter->Seek("c");
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_5,merge_6");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_3,merge_4");
|
|
|
|
db_iter->SeekForPrev("c");
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_3,merge_4");
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter->value().ToString(), "merge_5,merge_6");
|
|
}
|
|
}
|
|
|
|
// TODO(3.13): fix the issue of Seek() then Prev() which might not necessary
|
|
// return the biggest element smaller than the seek key.
|
|
TEST_F(DBIteratorTest, DBIterator10) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "1");
|
|
internal_iter->AddPut("b", "2");
|
|
internal_iter->AddPut("c", "3");
|
|
internal_iter->AddPut("d", "4");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 10, options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
|
|
db_iter->Seek("c");
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "2");
|
|
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "3");
|
|
|
|
db_iter->SeekForPrev("c");
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter->value().ToString(), "4");
|
|
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "3");
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, SeekToLastOccurrenceSeq0) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = nullptr;
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "1");
|
|
internal_iter->AddPut("b", "2");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 10, 0 /* force seek */, nullptr /*read_callback*/));
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "1");
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "2");
|
|
db_iter->Next();
|
|
ASSERT_FALSE(db_iter->Valid());
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator11) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = MergeOperators::CreateFromStringId("stringappend");
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "0");
|
|
internal_iter->AddPut("b", "0");
|
|
internal_iter->AddSingleDeletion("b");
|
|
internal_iter->AddMerge("a", "1");
|
|
internal_iter->AddMerge("b", "2");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(
|
|
NewDBIterator(env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 1, options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
db_iter->SeekToFirst();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "0");
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
db_iter->Next();
|
|
ASSERT_FALSE(db_iter->Valid());
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator12) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = nullptr;
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "1");
|
|
internal_iter->AddPut("b", "2");
|
|
internal_iter->AddPut("c", "3");
|
|
internal_iter->AddSingleDeletion("b");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(
|
|
NewDBIterator(env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 10, 0, nullptr /*read_callback*/));
|
|
db_iter->SeekToLast();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter->value().ToString(), "3");
|
|
db_iter->Prev();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "1");
|
|
db_iter->Prev();
|
|
ASSERT_FALSE(db_iter->Valid());
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator13) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = nullptr;
|
|
|
|
std::string key;
|
|
key.resize(9);
|
|
key.assign(9, static_cast<char>(0));
|
|
key[0] = 'b';
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut(key, "0");
|
|
internal_iter->AddPut(key, "1");
|
|
internal_iter->AddPut(key, "2");
|
|
internal_iter->AddPut(key, "3");
|
|
internal_iter->AddPut(key, "4");
|
|
internal_iter->AddPut(key, "5");
|
|
internal_iter->AddPut(key, "6");
|
|
internal_iter->AddPut(key, "7");
|
|
internal_iter->AddPut(key, "8");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(
|
|
NewDBIterator(env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 2, 3, nullptr /*read_callback*/));
|
|
db_iter->Seek("b");
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), key);
|
|
ASSERT_EQ(db_iter->value().ToString(), "2");
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIterator14) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.merge_operator = nullptr;
|
|
|
|
std::string key("b");
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("b", "0");
|
|
internal_iter->AddPut("b", "1");
|
|
internal_iter->AddPut("b", "2");
|
|
internal_iter->AddPut("b", "3");
|
|
internal_iter->AddPut("a", "4");
|
|
internal_iter->AddPut("a", "5");
|
|
internal_iter->AddPut("a", "6");
|
|
internal_iter->AddPut("c", "7");
|
|
internal_iter->AddPut("c", "8");
|
|
internal_iter->AddPut("c", "9");
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(
|
|
NewDBIterator(env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 4, 1, nullptr /*read_callback*/));
|
|
db_iter->Seek("b");
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(db_iter->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter->value().ToString(), "3");
|
|
db_iter->SeekToFirst();
|
|
ASSERT_EQ(db_iter->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter->value().ToString(), "4");
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, DBIteratorTestDifferentialSnapshots) {
|
|
{ // test that KVs earlier that iter_start_seqnum are filtered out
|
|
ReadOptions ro;
|
|
ro.iter_start_seqnum=5;
|
|
Options options;
|
|
options.statistics = rocksdb::CreateDBStatistics();
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
for (size_t i = 0; i < 10; ++i) {
|
|
internal_iter->AddPut(std::to_string(i), std::to_string(i) + "a");
|
|
internal_iter->AddPut(std::to_string(i), std::to_string(i) + "b");
|
|
internal_iter->AddPut(std::to_string(i), std::to_string(i) + "c");
|
|
}
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(
|
|
NewDBIterator(env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 13,
|
|
options.max_sequential_skip_in_iterations, nullptr));
|
|
// Expecting InternalKeys in [5,8] range with correct type
|
|
int seqnums[4] = {5,8,11,13};
|
|
std::string user_keys[4] = {"1","2","3","4"};
|
|
std::string values[4] = {"1c", "2c", "3c", "4b"};
|
|
int i = 0;
|
|
for (db_iter->SeekToFirst(); db_iter->Valid(); db_iter->Next()) {
|
|
FullKey fkey;
|
|
ParseFullKey(db_iter->key(), &fkey);
|
|
ASSERT_EQ(user_keys[i], fkey.user_key.ToString());
|
|
ASSERT_EQ(EntryType::kEntryPut, fkey.type);
|
|
ASSERT_EQ(seqnums[i], fkey.sequence);
|
|
ASSERT_EQ(values[i], db_iter->value().ToString());
|
|
i++;
|
|
}
|
|
ASSERT_EQ(i, 4);
|
|
}
|
|
|
|
{ // Test that deletes are returned correctly as internal KVs
|
|
ReadOptions ro;
|
|
ro.iter_start_seqnum=5;
|
|
Options options;
|
|
options.statistics = rocksdb::CreateDBStatistics();
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
for (size_t i = 0; i < 10; ++i) {
|
|
internal_iter->AddPut(std::to_string(i), std::to_string(i) + "a");
|
|
internal_iter->AddPut(std::to_string(i), std::to_string(i) + "b");
|
|
internal_iter->AddDeletion(std::to_string(i));
|
|
}
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(
|
|
NewDBIterator(env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 13,
|
|
options.max_sequential_skip_in_iterations, nullptr));
|
|
// Expecting InternalKeys in [5,8] range with correct type
|
|
int seqnums[4] = {5,8,11,13};
|
|
EntryType key_types[4] = {EntryType::kEntryDelete,EntryType::kEntryDelete,
|
|
EntryType::kEntryDelete,EntryType::kEntryPut};
|
|
std::string user_keys[4] = {"1","2","3","4"};
|
|
std::string values[4] = {"", "", "", "4b"};
|
|
int i = 0;
|
|
for (db_iter->SeekToFirst(); db_iter->Valid(); db_iter->Next()) {
|
|
FullKey fkey;
|
|
ParseFullKey(db_iter->key(), &fkey);
|
|
ASSERT_EQ(user_keys[i], fkey.user_key.ToString());
|
|
ASSERT_EQ(key_types[i], fkey.type);
|
|
ASSERT_EQ(seqnums[i], fkey.sequence);
|
|
ASSERT_EQ(values[i], db_iter->value().ToString());
|
|
i++;
|
|
}
|
|
ASSERT_EQ(i, 4);
|
|
}
|
|
}
|
|
|
|
class DBIterWithMergeIterTest : public testing::Test {
|
|
public:
|
|
DBIterWithMergeIterTest()
|
|
: env_(Env::Default()), icomp_(BytewiseComparator()) {
|
|
options_.merge_operator = nullptr;
|
|
|
|
internal_iter1_ = new TestIterator(BytewiseComparator());
|
|
internal_iter1_->Add("a", kTypeValue, "1", 3u);
|
|
internal_iter1_->Add("f", kTypeValue, "2", 5u);
|
|
internal_iter1_->Add("g", kTypeValue, "3", 7u);
|
|
internal_iter1_->Finish();
|
|
|
|
internal_iter2_ = new TestIterator(BytewiseComparator());
|
|
internal_iter2_->Add("a", kTypeValue, "4", 6u);
|
|
internal_iter2_->Add("b", kTypeValue, "5", 1u);
|
|
internal_iter2_->Add("c", kTypeValue, "6", 2u);
|
|
internal_iter2_->Add("d", kTypeValue, "7", 3u);
|
|
internal_iter2_->Finish();
|
|
|
|
std::vector<InternalIterator*> child_iters;
|
|
child_iters.push_back(internal_iter1_);
|
|
child_iters.push_back(internal_iter2_);
|
|
InternalKeyComparator icomp(BytewiseComparator());
|
|
InternalIterator* merge_iter =
|
|
NewMergingIterator(&icomp_, &child_iters[0], 2u);
|
|
|
|
db_iter_.reset(NewDBIterator(
|
|
env_, ro_, ImmutableCFOptions(options_), BytewiseComparator(),
|
|
merge_iter, 8 /* read data earlier than seqId 8 */,
|
|
3 /* max iterators before reseek */, nullptr /*read_callback*/));
|
|
}
|
|
|
|
Env* env_;
|
|
ReadOptions ro_;
|
|
Options options_;
|
|
TestIterator* internal_iter1_;
|
|
TestIterator* internal_iter2_;
|
|
InternalKeyComparator icomp_;
|
|
Iterator* merge_iter_;
|
|
std::unique_ptr<Iterator> db_iter_;
|
|
};
|
|
|
|
TEST_F(DBIterWithMergeIterTest, InnerMergeIterator1) {
|
|
db_iter_->SeekToFirst();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "4");
|
|
db_iter_->Next();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "5");
|
|
db_iter_->Next();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "6");
|
|
db_iter_->Next();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "7");
|
|
db_iter_->Next();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "f");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "2");
|
|
db_iter_->Next();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "g");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "3");
|
|
db_iter_->Next();
|
|
ASSERT_FALSE(db_iter_->Valid());
|
|
}
|
|
|
|
TEST_F(DBIterWithMergeIterTest, InnerMergeIterator2) {
|
|
// Test Prev() when one child iterator is at its end.
|
|
db_iter_->SeekForPrev("g");
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "g");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "3");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "f");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "2");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "7");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "6");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "5");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "4");
|
|
}
|
|
|
|
TEST_F(DBIterWithMergeIterTest, InnerMergeIteratorDataRace1) {
|
|
// Test Prev() when one child iterator is at its end but more rows
|
|
// are added.
|
|
db_iter_->Seek("f");
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "f");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "2");
|
|
|
|
// Test call back inserts a key in the end of the mem table after
|
|
// MergeIterator::Prev() realized the mem table iterator is at its end
|
|
// and before an SeekToLast() is called.
|
|
rocksdb::SyncPoint::GetInstance()->SetCallBack(
|
|
"MergeIterator::Prev:BeforeSeekToLast",
|
|
[&](void* /*arg*/) { internal_iter2_->Add("z", kTypeValue, "7", 12u); });
|
|
rocksdb::SyncPoint::GetInstance()->EnableProcessing();
|
|
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "7");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "6");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "5");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "4");
|
|
|
|
rocksdb::SyncPoint::GetInstance()->DisableProcessing();
|
|
}
|
|
|
|
TEST_F(DBIterWithMergeIterTest, InnerMergeIteratorDataRace2) {
|
|
// Test Prev() when one child iterator is at its end but more rows
|
|
// are added.
|
|
db_iter_->Seek("f");
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "f");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "2");
|
|
|
|
// Test call back inserts entries for update a key in the end of the
|
|
// mem table after MergeIterator::Prev() realized the mem tableiterator is at
|
|
// its end and before an SeekToLast() is called.
|
|
rocksdb::SyncPoint::GetInstance()->SetCallBack(
|
|
"MergeIterator::Prev:BeforeSeekToLast", [&](void* /*arg*/) {
|
|
internal_iter2_->Add("z", kTypeValue, "7", 12u);
|
|
internal_iter2_->Add("z", kTypeValue, "7", 11u);
|
|
});
|
|
rocksdb::SyncPoint::GetInstance()->EnableProcessing();
|
|
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "7");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "6");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "5");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "4");
|
|
|
|
rocksdb::SyncPoint::GetInstance()->DisableProcessing();
|
|
}
|
|
|
|
TEST_F(DBIterWithMergeIterTest, InnerMergeIteratorDataRace3) {
|
|
// Test Prev() when one child iterator is at its end but more rows
|
|
// are added and max_skipped is triggered.
|
|
db_iter_->Seek("f");
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "f");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "2");
|
|
|
|
// Test call back inserts entries for update a key in the end of the
|
|
// mem table after MergeIterator::Prev() realized the mem table iterator is at
|
|
// its end and before an SeekToLast() is called.
|
|
rocksdb::SyncPoint::GetInstance()->SetCallBack(
|
|
"MergeIterator::Prev:BeforeSeekToLast", [&](void* /*arg*/) {
|
|
internal_iter2_->Add("z", kTypeValue, "7", 16u, true);
|
|
internal_iter2_->Add("z", kTypeValue, "7", 15u, true);
|
|
internal_iter2_->Add("z", kTypeValue, "7", 14u, true);
|
|
internal_iter2_->Add("z", kTypeValue, "7", 13u, true);
|
|
internal_iter2_->Add("z", kTypeValue, "7", 12u, true);
|
|
internal_iter2_->Add("z", kTypeValue, "7", 11u, true);
|
|
});
|
|
rocksdb::SyncPoint::GetInstance()->EnableProcessing();
|
|
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "7");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "6");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "5");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "4");
|
|
|
|
rocksdb::SyncPoint::GetInstance()->DisableProcessing();
|
|
}
|
|
|
|
TEST_F(DBIterWithMergeIterTest, InnerMergeIteratorDataRace4) {
|
|
// Test Prev() when one child iterator has more rows inserted
|
|
// between Seek() and Prev() when changing directions.
|
|
internal_iter2_->Add("z", kTypeValue, "9", 4u);
|
|
|
|
db_iter_->Seek("g");
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "g");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "3");
|
|
|
|
// Test call back inserts entries for update a key before "z" in
|
|
// mem table after MergeIterator::Prev() calls mem table iterator's
|
|
// Seek() and before calling Prev()
|
|
rocksdb::SyncPoint::GetInstance()->SetCallBack(
|
|
"MergeIterator::Prev:BeforePrev", [&](void* arg) {
|
|
IteratorWrapper* it = reinterpret_cast<IteratorWrapper*>(arg);
|
|
if (it->key().starts_with("z")) {
|
|
internal_iter2_->Add("x", kTypeValue, "7", 16u, true);
|
|
internal_iter2_->Add("x", kTypeValue, "7", 15u, true);
|
|
internal_iter2_->Add("x", kTypeValue, "7", 14u, true);
|
|
internal_iter2_->Add("x", kTypeValue, "7", 13u, true);
|
|
internal_iter2_->Add("x", kTypeValue, "7", 12u, true);
|
|
internal_iter2_->Add("x", kTypeValue, "7", 11u, true);
|
|
}
|
|
});
|
|
rocksdb::SyncPoint::GetInstance()->EnableProcessing();
|
|
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "f");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "2");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "7");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "6");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "5");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "4");
|
|
|
|
rocksdb::SyncPoint::GetInstance()->DisableProcessing();
|
|
}
|
|
|
|
TEST_F(DBIterWithMergeIterTest, InnerMergeIteratorDataRace5) {
|
|
internal_iter2_->Add("z", kTypeValue, "9", 4u);
|
|
|
|
// Test Prev() when one child iterator has more rows inserted
|
|
// between Seek() and Prev() when changing directions.
|
|
db_iter_->Seek("g");
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "g");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "3");
|
|
|
|
// Test call back inserts entries for update a key before "z" in
|
|
// mem table after MergeIterator::Prev() calls mem table iterator's
|
|
// Seek() and before calling Prev()
|
|
rocksdb::SyncPoint::GetInstance()->SetCallBack(
|
|
"MergeIterator::Prev:BeforePrev", [&](void* arg) {
|
|
IteratorWrapper* it = reinterpret_cast<IteratorWrapper*>(arg);
|
|
if (it->key().starts_with("z")) {
|
|
internal_iter2_->Add("x", kTypeValue, "7", 16u, true);
|
|
internal_iter2_->Add("x", kTypeValue, "7", 15u, true);
|
|
}
|
|
});
|
|
rocksdb::SyncPoint::GetInstance()->EnableProcessing();
|
|
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "f");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "2");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "7");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "6");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "5");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "4");
|
|
|
|
rocksdb::SyncPoint::GetInstance()->DisableProcessing();
|
|
}
|
|
|
|
TEST_F(DBIterWithMergeIterTest, InnerMergeIteratorDataRace6) {
|
|
internal_iter2_->Add("z", kTypeValue, "9", 4u);
|
|
|
|
// Test Prev() when one child iterator has more rows inserted
|
|
// between Seek() and Prev() when changing directions.
|
|
db_iter_->Seek("g");
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "g");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "3");
|
|
|
|
// Test call back inserts an entry for update a key before "z" in
|
|
// mem table after MergeIterator::Prev() calls mem table iterator's
|
|
// Seek() and before calling Prev()
|
|
rocksdb::SyncPoint::GetInstance()->SetCallBack(
|
|
"MergeIterator::Prev:BeforePrev", [&](void* arg) {
|
|
IteratorWrapper* it = reinterpret_cast<IteratorWrapper*>(arg);
|
|
if (it->key().starts_with("z")) {
|
|
internal_iter2_->Add("x", kTypeValue, "7", 16u, true);
|
|
}
|
|
});
|
|
rocksdb::SyncPoint::GetInstance()->EnableProcessing();
|
|
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "f");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "2");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "7");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "6");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "5");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "4");
|
|
|
|
rocksdb::SyncPoint::GetInstance()->DisableProcessing();
|
|
}
|
|
|
|
TEST_F(DBIterWithMergeIterTest, InnerMergeIteratorDataRace7) {
|
|
internal_iter1_->Add("u", kTypeValue, "10", 4u);
|
|
internal_iter1_->Add("v", kTypeValue, "11", 4u);
|
|
internal_iter1_->Add("w", kTypeValue, "12", 4u);
|
|
internal_iter2_->Add("z", kTypeValue, "9", 4u);
|
|
|
|
// Test Prev() when one child iterator has more rows inserted
|
|
// between Seek() and Prev() when changing directions.
|
|
db_iter_->Seek("g");
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "g");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "3");
|
|
|
|
// Test call back inserts entries for update a key before "z" in
|
|
// mem table after MergeIterator::Prev() calls mem table iterator's
|
|
// Seek() and before calling Prev()
|
|
rocksdb::SyncPoint::GetInstance()->SetCallBack(
|
|
"MergeIterator::Prev:BeforePrev", [&](void* arg) {
|
|
IteratorWrapper* it = reinterpret_cast<IteratorWrapper*>(arg);
|
|
if (it->key().starts_with("z")) {
|
|
internal_iter2_->Add("x", kTypeValue, "7", 16u, true);
|
|
internal_iter2_->Add("x", kTypeValue, "7", 15u, true);
|
|
internal_iter2_->Add("x", kTypeValue, "7", 14u, true);
|
|
internal_iter2_->Add("x", kTypeValue, "7", 13u, true);
|
|
internal_iter2_->Add("x", kTypeValue, "7", 12u, true);
|
|
internal_iter2_->Add("x", kTypeValue, "7", 11u, true);
|
|
}
|
|
});
|
|
rocksdb::SyncPoint::GetInstance()->EnableProcessing();
|
|
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "f");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "2");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "7");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "c");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "6");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "b");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "5");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "a");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "4");
|
|
|
|
rocksdb::SyncPoint::GetInstance()->DisableProcessing();
|
|
}
|
|
|
|
TEST_F(DBIterWithMergeIterTest, InnerMergeIteratorDataRace8) {
|
|
// internal_iter1_: a, f, g
|
|
// internal_iter2_: a, b, c, d, adding (z)
|
|
internal_iter2_->Add("z", kTypeValue, "9", 4u);
|
|
|
|
// Test Prev() when one child iterator has more rows inserted
|
|
// between Seek() and Prev() when changing directions.
|
|
db_iter_->Seek("g");
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "g");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "3");
|
|
|
|
// Test call back inserts two keys before "z" in mem table after
|
|
// MergeIterator::Prev() calls mem table iterator's Seek() and
|
|
// before calling Prev()
|
|
rocksdb::SyncPoint::GetInstance()->SetCallBack(
|
|
"MergeIterator::Prev:BeforePrev", [&](void* arg) {
|
|
IteratorWrapper* it = reinterpret_cast<IteratorWrapper*>(arg);
|
|
if (it->key().starts_with("z")) {
|
|
internal_iter2_->Add("x", kTypeValue, "7", 16u, true);
|
|
internal_iter2_->Add("y", kTypeValue, "7", 17u, true);
|
|
}
|
|
});
|
|
rocksdb::SyncPoint::GetInstance()->EnableProcessing();
|
|
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "f");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "2");
|
|
db_iter_->Prev();
|
|
ASSERT_TRUE(db_iter_->Valid());
|
|
ASSERT_EQ(db_iter_->key().ToString(), "d");
|
|
ASSERT_EQ(db_iter_->value().ToString(), "7");
|
|
|
|
rocksdb::SyncPoint::GetInstance()->DisableProcessing();
|
|
}
|
|
|
|
|
|
TEST_F(DBIteratorTest, SeekPrefixTombstones) {
|
|
ReadOptions ro;
|
|
Options options;
|
|
options.prefix_extractor.reset(NewNoopTransform());
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddDeletion("b");
|
|
internal_iter->AddDeletion("c");
|
|
internal_iter->AddDeletion("d");
|
|
internal_iter->AddDeletion("e");
|
|
internal_iter->AddDeletion("f");
|
|
internal_iter->AddDeletion("g");
|
|
internal_iter->Finish();
|
|
|
|
ro.prefix_same_as_start = true;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 10, options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
|
|
int skipped_keys = 0;
|
|
|
|
get_perf_context()->Reset();
|
|
db_iter->SeekForPrev("z");
|
|
skipped_keys =
|
|
static_cast<int>(get_perf_context()->internal_key_skipped_count);
|
|
ASSERT_EQ(skipped_keys, 0);
|
|
|
|
get_perf_context()->Reset();
|
|
db_iter->Seek("a");
|
|
skipped_keys =
|
|
static_cast<int>(get_perf_context()->internal_key_skipped_count);
|
|
ASSERT_EQ(skipped_keys, 0);
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, SeekToFirstLowerBound) {
|
|
const int kNumKeys = 3;
|
|
for (int i = 0; i < kNumKeys + 2; ++i) {
|
|
// + 2 for two special cases: lower bound before and lower bound after the
|
|
// internal iterator's keys
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
for (int j = 1; j <= kNumKeys; ++j) {
|
|
internal_iter->AddPut(std::to_string(j), "val");
|
|
}
|
|
internal_iter->Finish();
|
|
|
|
ReadOptions ro;
|
|
auto lower_bound_str = std::to_string(i);
|
|
Slice lower_bound(lower_bound_str);
|
|
ro.iterate_lower_bound = &lower_bound;
|
|
Options options;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 10 /* sequence */,
|
|
options.max_sequential_skip_in_iterations, nullptr /* read_callback */));
|
|
|
|
db_iter->SeekToFirst();
|
|
if (i == kNumKeys + 1) {
|
|
// lower bound was beyond the last key
|
|
ASSERT_FALSE(db_iter->Valid());
|
|
} else {
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
int expected;
|
|
if (i == 0) {
|
|
// lower bound was before the first key
|
|
expected = 1;
|
|
} else {
|
|
// lower bound was at the ith key
|
|
expected = i;
|
|
}
|
|
ASSERT_EQ(std::to_string(expected), db_iter->key().ToString());
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, PrevLowerBound) {
|
|
const int kNumKeys = 3;
|
|
const int kLowerBound = 2;
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
for (int j = 1; j <= kNumKeys; ++j) {
|
|
internal_iter->AddPut(std::to_string(j), "val");
|
|
}
|
|
internal_iter->Finish();
|
|
|
|
ReadOptions ro;
|
|
auto lower_bound_str = std::to_string(kLowerBound);
|
|
Slice lower_bound(lower_bound_str);
|
|
ro.iterate_lower_bound = &lower_bound;
|
|
Options options;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 10 /* sequence */,
|
|
options.max_sequential_skip_in_iterations, nullptr /* read_callback */));
|
|
|
|
db_iter->SeekToLast();
|
|
for (int i = kNumKeys; i >= kLowerBound; --i) {
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(std::to_string(i), db_iter->key().ToString());
|
|
db_iter->Prev();
|
|
}
|
|
ASSERT_FALSE(db_iter->Valid());
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, SeekLessLowerBound) {
|
|
const int kNumKeys = 3;
|
|
const int kLowerBound = 2;
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
for (int j = 1; j <= kNumKeys; ++j) {
|
|
internal_iter->AddPut(std::to_string(j), "val");
|
|
}
|
|
internal_iter->Finish();
|
|
|
|
ReadOptions ro;
|
|
auto lower_bound_str = std::to_string(kLowerBound);
|
|
Slice lower_bound(lower_bound_str);
|
|
ro.iterate_lower_bound = &lower_bound;
|
|
Options options;
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ro, ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 10 /* sequence */,
|
|
options.max_sequential_skip_in_iterations, nullptr /* read_callback */));
|
|
|
|
auto before_lower_bound_str = std::to_string(kLowerBound - 1);
|
|
Slice before_lower_bound(lower_bound_str);
|
|
|
|
db_iter->Seek(before_lower_bound);
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_EQ(lower_bound_str, db_iter->key().ToString());
|
|
}
|
|
|
|
TEST_F(DBIteratorTest, ReverseToForwardWithDisappearingKeys) {
|
|
Options options;
|
|
options.prefix_extractor.reset(NewCappedPrefixTransform(0));
|
|
|
|
TestIterator* internal_iter = new TestIterator(BytewiseComparator());
|
|
internal_iter->AddPut("a", "A");
|
|
internal_iter->AddPut("b", "B");
|
|
for (int i = 0; i < 100; ++i) {
|
|
internal_iter->AddPut("c" + ToString(i), "");
|
|
}
|
|
internal_iter->Finish();
|
|
|
|
std::unique_ptr<Iterator> db_iter(NewDBIterator(
|
|
env_, ReadOptions(), ImmutableCFOptions(options), BytewiseComparator(),
|
|
internal_iter, 10, options.max_sequential_skip_in_iterations,
|
|
nullptr /*read_callback*/));
|
|
|
|
db_iter->SeekForPrev("a");
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_OK(db_iter->status());
|
|
ASSERT_EQ("a", db_iter->key().ToString());
|
|
|
|
internal_iter->Vanish("a");
|
|
db_iter->Next();
|
|
ASSERT_TRUE(db_iter->Valid());
|
|
ASSERT_OK(db_iter->status());
|
|
ASSERT_EQ("b", db_iter->key().ToString());
|
|
|
|
// A (sort of) bug used to cause DBIter to pointlessly drag the internal
|
|
// iterator all the way to the end. But this doesn't really matter at the time
|
|
// of writing because the only iterator that can see disappearing keys is
|
|
// ForwardIterator, which doesn't support SeekForPrev().
|
|
EXPECT_LT(internal_iter->steps(), 20);
|
|
}
|
|
|
|
} // namespace rocksdb
|
|
|
|
int main(int argc, char** argv) {
|
|
::testing::InitGoogleTest(&argc, argv);
|
|
return RUN_ALL_TESTS();
|
|
}
|