2016-02-09 23:12:00 +00:00
|
|
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
2017-07-15 23:03:42 +00:00
|
|
|
// 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).
|
2013-10-16 21:59:46 +00:00
|
|
|
//
|
2013-03-21 22:59:47 +00:00
|
|
|
#include <assert.h>
|
|
|
|
#include <memory>
|
|
|
|
#include <iostream>
|
|
|
|
|
2015-06-26 18:35:46 +00:00
|
|
|
#include "port/stack_trace.h"
|
2013-08-23 15:38:13 +00:00
|
|
|
#include "rocksdb/cache.h"
|
|
|
|
#include "rocksdb/comparator.h"
|
|
|
|
#include "rocksdb/db.h"
|
|
|
|
#include "rocksdb/env.h"
|
|
|
|
#include "rocksdb/merge_operator.h"
|
2014-07-23 14:21:38 +00:00
|
|
|
#include "rocksdb/utilities/db_ttl.h"
|
2013-03-21 22:59:47 +00:00
|
|
|
#include "db/dbformat.h"
|
2013-07-22 23:49:55 +00:00
|
|
|
#include "db/db_impl.h"
|
2014-01-11 01:33:56 +00:00
|
|
|
#include "db/write_batch_internal.h"
|
2013-03-21 22:59:47 +00:00
|
|
|
#include "utilities/merge_operators.h"
|
2013-07-29 20:26:38 +00:00
|
|
|
#include "util/testharness.h"
|
2013-03-21 22:59:47 +00:00
|
|
|
|
2018-07-13 21:07:53 +00:00
|
|
|
namespace rocksdb {
|
|
|
|
|
|
|
|
bool use_compression;
|
|
|
|
|
|
|
|
class MergeTest : public testing::Test {};
|
2013-03-21 22:59:47 +00:00
|
|
|
|
2014-11-11 21:47:22 +00:00
|
|
|
size_t num_merge_operator_calls;
|
|
|
|
void resetNumMergeOperatorCalls() { num_merge_operator_calls = 0; }
|
2014-03-25 00:57:13 +00:00
|
|
|
|
2014-11-11 21:47:22 +00:00
|
|
|
size_t num_partial_merge_calls;
|
|
|
|
void resetNumPartialMergeCalls() { num_partial_merge_calls = 0; }
|
2014-01-11 01:33:56 +00:00
|
|
|
|
|
|
|
class CountMergeOperator : public AssociativeMergeOperator {
|
|
|
|
public:
|
|
|
|
CountMergeOperator() {
|
|
|
|
mergeOperator_ = MergeOperators::CreateUInt64AddOperator();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual bool Merge(const Slice& key,
|
|
|
|
const Slice* existing_value,
|
|
|
|
const Slice& value,
|
|
|
|
std::string* new_value,
|
|
|
|
Logger* logger) const override {
|
2015-06-26 18:35:46 +00:00
|
|
|
assert(new_value->empty());
|
2014-11-11 21:47:22 +00:00
|
|
|
++num_merge_operator_calls;
|
2014-03-25 00:57:13 +00:00
|
|
|
if (existing_value == nullptr) {
|
|
|
|
new_value->assign(value.data(), value.size());
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2014-01-11 01:33:56 +00:00
|
|
|
return mergeOperator_->PartialMerge(
|
|
|
|
key,
|
|
|
|
*existing_value,
|
|
|
|
value,
|
|
|
|
new_value,
|
|
|
|
logger);
|
|
|
|
}
|
|
|
|
|
2014-03-25 00:57:13 +00:00
|
|
|
virtual bool PartialMergeMulti(const Slice& key,
|
|
|
|
const std::deque<Slice>& operand_list,
|
2015-02-26 19:28:41 +00:00
|
|
|
std::string* new_value,
|
|
|
|
Logger* logger) const override {
|
2015-06-26 18:35:46 +00:00
|
|
|
assert(new_value->empty());
|
2014-03-25 00:57:13 +00:00
|
|
|
++num_partial_merge_calls;
|
|
|
|
return mergeOperator_->PartialMergeMulti(key, operand_list, new_value,
|
|
|
|
logger);
|
|
|
|
}
|
|
|
|
|
2014-01-11 01:33:56 +00:00
|
|
|
virtual const char* Name() const override {
|
|
|
|
return "UInt64AddOperator";
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
std::shared_ptr<MergeOperator> mergeOperator_;
|
|
|
|
};
|
|
|
|
|
2015-12-15 23:26:20 +00:00
|
|
|
std::shared_ptr<DB> OpenDb(const std::string& dbname, const bool ttl = false,
|
2017-02-23 22:53:03 +00:00
|
|
|
const size_t max_successive_merges = 0) {
|
2013-03-21 22:59:47 +00:00
|
|
|
DB* db;
|
|
|
|
Options options;
|
|
|
|
options.create_if_missing = true;
|
2014-01-11 01:33:56 +00:00
|
|
|
options.merge_operator = std::make_shared<CountMergeOperator>();
|
|
|
|
options.max_successive_merges = max_successive_merges;
|
2013-07-22 23:49:55 +00:00
|
|
|
Status s;
|
|
|
|
DestroyDB(dbname, Options());
|
2015-07-20 18:17:52 +00:00
|
|
|
// DBWithTTL is not supported in ROCKSDB_LITE
|
|
|
|
#ifndef ROCKSDB_LITE
|
2013-07-22 23:49:55 +00:00
|
|
|
if (ttl) {
|
2014-04-29 03:44:33 +00:00
|
|
|
DBWithTTL* db_with_ttl;
|
|
|
|
s = DBWithTTL::Open(options, dbname, &db_with_ttl);
|
|
|
|
db = db_with_ttl;
|
2013-07-22 23:49:55 +00:00
|
|
|
} else {
|
2013-08-06 18:42:21 +00:00
|
|
|
s = DB::Open(options, dbname, &db);
|
2013-07-22 23:49:55 +00:00
|
|
|
}
|
2015-07-20 18:17:52 +00:00
|
|
|
#else
|
|
|
|
assert(!ttl);
|
|
|
|
s = DB::Open(options, dbname, &db);
|
|
|
|
#endif // !ROCKSDB_LITE
|
2013-03-21 22:59:47 +00:00
|
|
|
if (!s.ok()) {
|
2015-12-15 23:26:20 +00:00
|
|
|
std::cerr << s.ToString() << std::endl;
|
2013-03-21 22:59:47 +00:00
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
return std::shared_ptr<DB>(db);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Imagine we are maintaining a set of uint64 counters.
|
|
|
|
// Each counter has a distinct name. And we would like
|
|
|
|
// to support four high level operations:
|
|
|
|
// set, add, get and remove
|
|
|
|
// This is a quick implementation without a Merge operation.
|
|
|
|
class Counters {
|
|
|
|
|
|
|
|
protected:
|
|
|
|
std::shared_ptr<DB> db_;
|
|
|
|
|
|
|
|
WriteOptions put_option_;
|
|
|
|
ReadOptions get_option_;
|
|
|
|
WriteOptions delete_option_;
|
|
|
|
|
|
|
|
uint64_t default_;
|
|
|
|
|
|
|
|
public:
|
2013-07-29 20:26:38 +00:00
|
|
|
explicit Counters(std::shared_ptr<DB> db, uint64_t defaultCount = 0)
|
2013-03-21 22:59:47 +00:00
|
|
|
: db_(db),
|
|
|
|
put_option_(),
|
|
|
|
get_option_(),
|
|
|
|
delete_option_(),
|
|
|
|
default_(defaultCount) {
|
|
|
|
assert(db_);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual ~Counters() {}
|
|
|
|
|
|
|
|
// public interface of Counters.
|
|
|
|
// All four functions return false
|
|
|
|
// if the underlying level db operation failed.
|
|
|
|
|
|
|
|
// mapped to a levedb Put
|
2015-12-15 23:26:20 +00:00
|
|
|
bool set(const std::string& key, uint64_t value) {
|
2013-03-21 22:59:47 +00:00
|
|
|
// just treat the internal rep of int64 as the string
|
2017-04-22 03:41:37 +00:00
|
|
|
char buf[sizeof(value)];
|
|
|
|
EncodeFixed64(buf, value);
|
|
|
|
Slice slice(buf, sizeof(value));
|
2013-03-21 22:59:47 +00:00
|
|
|
auto s = db_->Put(put_option_, key, slice);
|
|
|
|
|
|
|
|
if (s.ok()) {
|
|
|
|
return true;
|
|
|
|
} else {
|
2015-12-15 23:26:20 +00:00
|
|
|
std::cerr << s.ToString() << std::endl;
|
2013-03-21 22:59:47 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-05 05:32:05 +00:00
|
|
|
// mapped to a rocksdb Delete
|
2015-12-15 23:26:20 +00:00
|
|
|
bool remove(const std::string& key) {
|
2013-03-21 22:59:47 +00:00
|
|
|
auto s = db_->Delete(delete_option_, key);
|
|
|
|
|
|
|
|
if (s.ok()) {
|
|
|
|
return true;
|
|
|
|
} else {
|
2015-12-15 23:26:20 +00:00
|
|
|
std::cerr << s.ToString() << std::endl;
|
2013-03-21 22:59:47 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-05 05:32:05 +00:00
|
|
|
// mapped to a rocksdb Get
|
2015-12-15 23:26:20 +00:00
|
|
|
bool get(const std::string& key, uint64_t* value) {
|
|
|
|
std::string str;
|
2013-03-21 22:59:47 +00:00
|
|
|
auto s = db_->Get(get_option_, key, &str);
|
|
|
|
|
|
|
|
if (s.IsNotFound()) {
|
|
|
|
// return default value if not found;
|
|
|
|
*value = default_;
|
|
|
|
return true;
|
|
|
|
} else if (s.ok()) {
|
|
|
|
// deserialization
|
|
|
|
if (str.size() != sizeof(uint64_t)) {
|
2015-12-15 23:26:20 +00:00
|
|
|
std::cerr << "value corruption\n";
|
2013-03-21 22:59:47 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
*value = DecodeFixed64(&str[0]);
|
|
|
|
return true;
|
|
|
|
} else {
|
2015-12-15 23:26:20 +00:00
|
|
|
std::cerr << s.ToString() << std::endl;
|
2013-03-21 22:59:47 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// 'add' is implemented as get -> modify -> set
|
|
|
|
// An alternative is a single merge operation, see MergeBasedCounters
|
2015-12-15 23:26:20 +00:00
|
|
|
virtual bool add(const std::string& key, uint64_t value) {
|
2013-03-21 22:59:47 +00:00
|
|
|
uint64_t base = default_;
|
|
|
|
return get(key, &base) && set(key, base + value);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// convenience functions for testing
|
2015-12-15 23:26:20 +00:00
|
|
|
void assert_set(const std::string& key, uint64_t value) {
|
2013-03-21 22:59:47 +00:00
|
|
|
assert(set(key, value));
|
|
|
|
}
|
|
|
|
|
2015-12-15 23:26:20 +00:00
|
|
|
void assert_remove(const std::string& key) { assert(remove(key)); }
|
2013-03-21 22:59:47 +00:00
|
|
|
|
2015-12-15 23:26:20 +00:00
|
|
|
uint64_t assert_get(const std::string& key) {
|
2013-03-21 22:59:47 +00:00
|
|
|
uint64_t value = default_;
|
2014-04-14 19:06:30 +00:00
|
|
|
int result = get(key, &value);
|
|
|
|
assert(result);
|
|
|
|
if (result == 0) exit(1); // Disable unused variable warning.
|
2013-03-21 22:59:47 +00:00
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
2015-12-15 23:26:20 +00:00
|
|
|
void assert_add(const std::string& key, uint64_t value) {
|
2014-04-14 19:06:30 +00:00
|
|
|
int result = add(key, value);
|
|
|
|
assert(result);
|
2014-07-31 18:20:49 +00:00
|
|
|
if (result == 0) exit(1); // Disable unused variable warning.
|
2013-03-21 22:59:47 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// Implement 'add' directly with the new Merge operation
|
|
|
|
class MergeBasedCounters : public Counters {
|
|
|
|
private:
|
|
|
|
WriteOptions merge_option_; // for merge
|
|
|
|
|
|
|
|
public:
|
2013-07-29 20:26:38 +00:00
|
|
|
explicit MergeBasedCounters(std::shared_ptr<DB> db, uint64_t defaultCount = 0)
|
2013-03-21 22:59:47 +00:00
|
|
|
: Counters(db, defaultCount),
|
|
|
|
merge_option_() {
|
|
|
|
}
|
|
|
|
|
2013-10-05 05:32:05 +00:00
|
|
|
// mapped to a rocksdb Merge operation
|
2015-12-15 23:26:20 +00:00
|
|
|
virtual bool add(const std::string& key, uint64_t value) override {
|
2013-03-21 22:59:47 +00:00
|
|
|
char encoded[sizeof(uint64_t)];
|
|
|
|
EncodeFixed64(encoded, value);
|
|
|
|
Slice slice(encoded, sizeof(uint64_t));
|
|
|
|
auto s = db_->Merge(merge_option_, key, slice);
|
|
|
|
|
|
|
|
if (s.ok()) {
|
|
|
|
return true;
|
|
|
|
} else {
|
2015-12-15 23:26:20 +00:00
|
|
|
std::cerr << s.ToString() << std::endl;
|
2013-03-21 22:59:47 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
void dumpDb(DB* db) {
|
2018-11-09 19:17:34 +00:00
|
|
|
auto it = std::unique_ptr<Iterator>(db->NewIterator(ReadOptions()));
|
2013-03-21 22:59:47 +00:00
|
|
|
for (it->SeekToFirst(); it->Valid(); it->Next()) {
|
2018-07-13 21:07:53 +00:00
|
|
|
//uint64_t value = DecodeFixed64(it->value().data());
|
|
|
|
//std::cout << it->key().ToString() << ": " << value << std::endl;
|
2013-03-21 22:59:47 +00:00
|
|
|
}
|
|
|
|
assert(it->status().ok()); // Check for any errors found during the scan
|
|
|
|
}
|
|
|
|
|
|
|
|
void testCounters(Counters& counters, DB* db, bool test_compaction) {
|
|
|
|
|
|
|
|
FlushOptions o;
|
|
|
|
o.wait = true;
|
|
|
|
|
|
|
|
counters.assert_set("a", 1);
|
|
|
|
|
|
|
|
if (test_compaction) db->Flush(o);
|
|
|
|
|
|
|
|
assert(counters.assert_get("a") == 1);
|
|
|
|
|
|
|
|
counters.assert_remove("b");
|
|
|
|
|
|
|
|
// defaut value is 0 if non-existent
|
|
|
|
assert(counters.assert_get("b") == 0);
|
|
|
|
|
|
|
|
counters.assert_add("a", 2);
|
|
|
|
|
|
|
|
if (test_compaction) db->Flush(o);
|
|
|
|
|
|
|
|
// 1+2 = 3
|
|
|
|
assert(counters.assert_get("a")== 3);
|
|
|
|
|
|
|
|
dumpDb(db);
|
|
|
|
|
|
|
|
// 1+...+49 = ?
|
|
|
|
uint64_t sum = 0;
|
|
|
|
for (int i = 1; i < 50; i++) {
|
|
|
|
counters.assert_add("b", i);
|
|
|
|
sum += i;
|
|
|
|
}
|
|
|
|
assert(counters.assert_get("b") == sum);
|
|
|
|
|
|
|
|
dumpDb(db);
|
|
|
|
|
|
|
|
if (test_compaction) {
|
|
|
|
db->Flush(o);
|
|
|
|
|
2015-06-17 21:36:14 +00:00
|
|
|
db->CompactRange(CompactRangeOptions(), nullptr, nullptr);
|
2013-03-21 22:59:47 +00:00
|
|
|
|
|
|
|
dumpDb(db);
|
|
|
|
|
|
|
|
assert(counters.assert_get("a")== 3);
|
|
|
|
assert(counters.assert_get("b") == sum);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-11-11 21:47:22 +00:00
|
|
|
void testSuccessiveMerge(Counters& counters, size_t max_num_merges,
|
|
|
|
size_t num_merges) {
|
2014-01-11 01:33:56 +00:00
|
|
|
|
|
|
|
counters.assert_remove("z");
|
|
|
|
uint64_t sum = 0;
|
|
|
|
|
2014-11-11 21:47:22 +00:00
|
|
|
for (size_t i = 1; i <= num_merges; ++i) {
|
2014-01-11 01:33:56 +00:00
|
|
|
resetNumMergeOperatorCalls();
|
|
|
|
counters.assert_add("z", i);
|
|
|
|
sum += i;
|
|
|
|
|
|
|
|
if (i % (max_num_merges + 1) == 0) {
|
2014-11-11 21:47:22 +00:00
|
|
|
assert(num_merge_operator_calls == max_num_merges + 1);
|
2014-01-11 01:33:56 +00:00
|
|
|
} else {
|
2014-11-11 21:47:22 +00:00
|
|
|
assert(num_merge_operator_calls == 0);
|
2014-01-11 01:33:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
resetNumMergeOperatorCalls();
|
|
|
|
assert(counters.assert_get("z") == sum);
|
2014-11-11 21:47:22 +00:00
|
|
|
assert(num_merge_operator_calls == i % (max_num_merges + 1));
|
2014-01-11 01:33:56 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-11-11 21:47:22 +00:00
|
|
|
void testPartialMerge(Counters* counters, DB* db, size_t max_merge,
|
|
|
|
size_t min_merge, size_t count) {
|
2014-03-25 00:57:13 +00:00
|
|
|
FlushOptions o;
|
|
|
|
o.wait = true;
|
|
|
|
|
|
|
|
// Test case 1: partial merge should be called when the number of merge
|
|
|
|
// operands exceeds the threshold.
|
|
|
|
uint64_t tmp_sum = 0;
|
|
|
|
resetNumPartialMergeCalls();
|
2014-11-11 21:47:22 +00:00
|
|
|
for (size_t i = 1; i <= count; i++) {
|
2014-03-25 00:57:13 +00:00
|
|
|
counters->assert_add("b", i);
|
|
|
|
tmp_sum += i;
|
|
|
|
}
|
|
|
|
db->Flush(o);
|
2015-06-17 21:36:14 +00:00
|
|
|
db->CompactRange(CompactRangeOptions(), nullptr, nullptr);
|
2014-03-25 00:57:13 +00:00
|
|
|
ASSERT_EQ(tmp_sum, counters->assert_get("b"));
|
|
|
|
if (count > max_merge) {
|
|
|
|
// in this case, FullMerge should be called instead.
|
2014-11-11 21:47:22 +00:00
|
|
|
ASSERT_EQ(num_partial_merge_calls, 0U);
|
2014-03-25 00:57:13 +00:00
|
|
|
} else {
|
|
|
|
// if count >= min_merge, then partial merge should be called once.
|
|
|
|
ASSERT_EQ((count >= min_merge), (num_partial_merge_calls == 1));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Test case 2: partial merge should not be called when a put is found.
|
|
|
|
resetNumPartialMergeCalls();
|
|
|
|
tmp_sum = 0;
|
|
|
|
db->Put(rocksdb::WriteOptions(), "c", "10");
|
2014-11-11 21:47:22 +00:00
|
|
|
for (size_t i = 1; i <= count; i++) {
|
2014-03-25 00:57:13 +00:00
|
|
|
counters->assert_add("c", i);
|
|
|
|
tmp_sum += i;
|
|
|
|
}
|
|
|
|
db->Flush(o);
|
2015-06-17 21:36:14 +00:00
|
|
|
db->CompactRange(CompactRangeOptions(), nullptr, nullptr);
|
2014-03-25 00:57:13 +00:00
|
|
|
ASSERT_EQ(tmp_sum, counters->assert_get("c"));
|
2014-11-11 21:47:22 +00:00
|
|
|
ASSERT_EQ(num_partial_merge_calls, 0U);
|
2014-03-25 00:57:13 +00:00
|
|
|
}
|
|
|
|
|
2014-11-11 21:47:22 +00:00
|
|
|
void testSingleBatchSuccessiveMerge(DB* db, size_t max_num_merges,
|
|
|
|
size_t num_merges) {
|
2014-01-11 01:33:56 +00:00
|
|
|
assert(num_merges > max_num_merges);
|
|
|
|
|
|
|
|
Slice key("BatchSuccessiveMerge");
|
|
|
|
uint64_t merge_value = 1;
|
2017-04-22 03:41:37 +00:00
|
|
|
char buf[sizeof(merge_value)];
|
|
|
|
EncodeFixed64(buf, merge_value);
|
|
|
|
Slice merge_value_slice(buf, sizeof(merge_value));
|
2014-01-11 01:33:56 +00:00
|
|
|
|
|
|
|
// Create the batch
|
|
|
|
WriteBatch batch;
|
2014-11-11 21:47:22 +00:00
|
|
|
for (size_t i = 0; i < num_merges; ++i) {
|
2014-01-11 01:33:56 +00:00
|
|
|
batch.Merge(key, merge_value_slice);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Apply to memtable and count the number of merges
|
|
|
|
resetNumMergeOperatorCalls();
|
|
|
|
{
|
|
|
|
Status s = db->Write(WriteOptions(), &batch);
|
|
|
|
assert(s.ok());
|
|
|
|
}
|
2014-11-11 21:47:22 +00:00
|
|
|
ASSERT_EQ(
|
|
|
|
num_merge_operator_calls,
|
|
|
|
static_cast<size_t>(num_merges - (num_merges % (max_num_merges + 1))));
|
2014-01-11 01:33:56 +00:00
|
|
|
|
|
|
|
// Get the value
|
|
|
|
resetNumMergeOperatorCalls();
|
2015-12-15 23:26:20 +00:00
|
|
|
std::string get_value_str;
|
2014-01-11 01:33:56 +00:00
|
|
|
{
|
|
|
|
Status s = db->Get(ReadOptions(), key, &get_value_str);
|
|
|
|
assert(s.ok());
|
|
|
|
}
|
|
|
|
assert(get_value_str.size() == sizeof(uint64_t));
|
|
|
|
uint64_t get_value = DecodeFixed64(&get_value_str[0]);
|
2014-01-11 17:25:42 +00:00
|
|
|
ASSERT_EQ(get_value, num_merges * merge_value);
|
2014-11-11 21:47:22 +00:00
|
|
|
ASSERT_EQ(num_merge_operator_calls,
|
|
|
|
static_cast<size_t>((num_merges % (max_num_merges + 1))));
|
2014-01-11 01:33:56 +00:00
|
|
|
}
|
|
|
|
|
2018-07-13 21:07:53 +00:00
|
|
|
void runTest(const std::string& dbname, const bool use_ttl = false) {
|
2013-03-21 22:59:47 +00:00
|
|
|
|
|
|
|
{
|
2014-10-31 18:59:54 +00:00
|
|
|
auto db = OpenDb(dbname, use_ttl);
|
|
|
|
|
|
|
|
{
|
|
|
|
Counters counters(db, 0);
|
|
|
|
testCounters(counters, db.get(), true);
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
MergeBasedCounters counters(db, 0);
|
2018-07-13 21:07:53 +00:00
|
|
|
testCounters(counters, db.get(), use_compression);
|
2014-10-31 18:59:54 +00:00
|
|
|
}
|
2013-03-21 22:59:47 +00:00
|
|
|
}
|
|
|
|
|
2013-07-22 23:49:55 +00:00
|
|
|
DestroyDB(dbname, Options());
|
2014-01-11 01:33:56 +00:00
|
|
|
|
|
|
|
{
|
2014-03-25 00:57:13 +00:00
|
|
|
size_t max_merge = 5;
|
|
|
|
auto db = OpenDb(dbname, use_ttl, max_merge);
|
2014-01-11 01:33:56 +00:00
|
|
|
MergeBasedCounters counters(db, 0);
|
2018-07-13 21:07:53 +00:00
|
|
|
testCounters(counters, db.get(), use_compression);
|
2014-03-25 00:57:13 +00:00
|
|
|
testSuccessiveMerge(counters, max_merge, max_merge * 2);
|
2014-01-11 01:33:56 +00:00
|
|
|
testSingleBatchSuccessiveMerge(db.get(), 5, 7);
|
|
|
|
DestroyDB(dbname, Options());
|
|
|
|
}
|
|
|
|
|
2014-03-25 00:57:13 +00:00
|
|
|
{
|
|
|
|
size_t max_merge = 100;
|
2017-02-23 22:53:03 +00:00
|
|
|
// Min merge is hard-coded to 2.
|
|
|
|
uint32_t min_merge = 2;
|
|
|
|
for (uint32_t count = min_merge - 1; count <= min_merge + 1; count++) {
|
|
|
|
auto db = OpenDb(dbname, use_ttl, max_merge);
|
|
|
|
MergeBasedCounters counters(db, 0);
|
|
|
|
testPartialMerge(&counters, db.get(), max_merge, min_merge, count);
|
|
|
|
DestroyDB(dbname, Options());
|
|
|
|
}
|
|
|
|
{
|
|
|
|
auto db = OpenDb(dbname, use_ttl, max_merge);
|
|
|
|
MergeBasedCounters counters(db, 0);
|
|
|
|
testPartialMerge(&counters, db.get(), max_merge, min_merge,
|
|
|
|
min_merge * 10);
|
|
|
|
DestroyDB(dbname, Options());
|
2014-03-25 00:57:13 +00:00
|
|
|
}
|
|
|
|
}
|
2014-07-31 00:24:36 +00:00
|
|
|
|
|
|
|
{
|
|
|
|
{
|
|
|
|
auto db = OpenDb(dbname);
|
|
|
|
MergeBasedCounters counters(db, 0);
|
|
|
|
counters.add("test-key", 1);
|
|
|
|
counters.add("test-key", 1);
|
|
|
|
counters.add("test-key", 1);
|
2015-06-17 21:36:14 +00:00
|
|
|
db->CompactRange(CompactRangeOptions(), nullptr, nullptr);
|
2014-07-31 00:24:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
DB* reopen_db;
|
|
|
|
ASSERT_OK(DB::Open(Options(), dbname, &reopen_db));
|
|
|
|
std::string value;
|
|
|
|
ASSERT_TRUE(!(reopen_db->Get(ReadOptions(), "test-key", &value).ok()));
|
|
|
|
delete reopen_db;
|
|
|
|
DestroyDB(dbname, Options());
|
|
|
|
}
|
|
|
|
|
2014-07-31 18:20:49 +00:00
|
|
|
/* Temporary remove this test
|
2014-07-31 00:24:36 +00:00
|
|
|
{
|
2015-12-15 23:26:20 +00:00
|
|
|
std::cout << "Test merge-operator not set after reopen (recovery case)\n";
|
2014-07-31 00:24:36 +00:00
|
|
|
{
|
|
|
|
auto db = OpenDb(dbname);
|
|
|
|
MergeBasedCounters counters(db, 0);
|
|
|
|
counters.add("test-key", 1);
|
|
|
|
counters.add("test-key", 1);
|
|
|
|
counters.add("test-key", 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
DB* reopen_db;
|
|
|
|
ASSERT_TRUE(DB::Open(Options(), dbname, &reopen_db).IsInvalidArgument());
|
|
|
|
}
|
2014-07-31 18:20:49 +00:00
|
|
|
*/
|
2013-07-22 23:49:55 +00:00
|
|
|
}
|
|
|
|
|
2018-07-13 21:07:53 +00:00
|
|
|
TEST_F(MergeTest, MergeDbTest) {
|
2018-07-14 00:18:39 +00:00
|
|
|
runTest(test::PerThreadDBPath("merge_testdb"));
|
2018-07-13 21:07:53 +00:00
|
|
|
}
|
|
|
|
|
2015-07-20 18:17:52 +00:00
|
|
|
#ifndef ROCKSDB_LITE
|
2018-07-13 21:07:53 +00:00
|
|
|
TEST_F(MergeTest, MergeDbTtlTest) {
|
2018-07-14 00:18:39 +00:00
|
|
|
runTest(test::PerThreadDBPath("merge_testdbttl"),
|
|
|
|
true); // Run test on TTL database
|
2018-07-13 21:07:53 +00:00
|
|
|
}
|
2015-07-20 18:17:52 +00:00
|
|
|
#endif // !ROCKSDB_LITE
|
2018-07-13 21:07:53 +00:00
|
|
|
|
|
|
|
} // namespace rocksdb
|
|
|
|
|
|
|
|
int main(int argc, char** argv) {
|
|
|
|
rocksdb::use_compression = false;
|
|
|
|
if (argc > 1) {
|
|
|
|
rocksdb::use_compression = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
rocksdb::port::InstallStackTraceHandler();
|
|
|
|
::testing::InitGoogleTest(&argc, argv);
|
|
|
|
return RUN_ALL_TESTS();
|
2013-03-21 22:59:47 +00:00
|
|
|
}
|