2013-10-16 23:59:46 +02:00
|
|
|
// Copyright (c) 2013, Facebook, Inc. All rights reserved.
|
|
|
|
// This source code is licensed under the BSD-style license found in the
|
|
|
|
// LICENSE file in the root directory of this source tree. An additional grant
|
|
|
|
// of patent rights can be found in the PATENTS file in the same directory.
|
|
|
|
//
|
2013-03-21 23:59:47 +01:00
|
|
|
#include <assert.h>
|
|
|
|
#include <memory>
|
|
|
|
#include <iostream>
|
|
|
|
|
2013-08-23 17:38:13 +02:00
|
|
|
#include "rocksdb/cache.h"
|
|
|
|
#include "rocksdb/comparator.h"
|
|
|
|
#include "rocksdb/db.h"
|
|
|
|
#include "rocksdb/env.h"
|
|
|
|
#include "rocksdb/merge_operator.h"
|
2013-03-21 23:59:47 +01:00
|
|
|
#include "db/dbformat.h"
|
2013-07-23 01:49:55 +02:00
|
|
|
#include "db/db_impl.h"
|
2014-01-11 02:33:56 +01:00
|
|
|
#include "db/write_batch_internal.h"
|
2013-03-21 23:59:47 +01:00
|
|
|
#include "utilities/merge_operators.h"
|
2013-07-29 22:26:38 +02:00
|
|
|
#include "util/testharness.h"
|
2013-07-23 01:49:55 +02:00
|
|
|
#include "utilities/utility_db.h"
|
2013-03-21 23:59:47 +01:00
|
|
|
|
|
|
|
using namespace std;
|
2013-10-04 06:49:15 +02:00
|
|
|
using namespace rocksdb;
|
2013-03-21 23:59:47 +01:00
|
|
|
|
2014-01-11 02:33:56 +01:00
|
|
|
namespace {
|
|
|
|
int numMergeOperatorCalls;
|
|
|
|
void resetNumMergeOperatorCalls() {
|
|
|
|
numMergeOperatorCalls = 0;
|
|
|
|
}
|
2014-03-25 01:57:13 +01:00
|
|
|
|
|
|
|
int num_partial_merge_calls;
|
|
|
|
void resetNumPartialMergeCalls() {
|
|
|
|
num_partial_merge_calls = 0;
|
|
|
|
}
|
2014-01-11 02:33:56 +01: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 {
|
|
|
|
++numMergeOperatorCalls;
|
2014-03-25 01:57:13 +01:00
|
|
|
if (existing_value == nullptr) {
|
|
|
|
new_value->assign(value.data(), value.size());
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2014-01-11 02:33:56 +01:00
|
|
|
return mergeOperator_->PartialMerge(
|
|
|
|
key,
|
|
|
|
*existing_value,
|
|
|
|
value,
|
|
|
|
new_value,
|
|
|
|
logger);
|
|
|
|
}
|
|
|
|
|
2014-03-25 01:57:13 +01:00
|
|
|
virtual bool PartialMergeMulti(const Slice& key,
|
|
|
|
const std::deque<Slice>& operand_list,
|
|
|
|
std::string* new_value, Logger* logger) const {
|
|
|
|
++num_partial_merge_calls;
|
|
|
|
return mergeOperator_->PartialMergeMulti(key, operand_list, new_value,
|
|
|
|
logger);
|
|
|
|
}
|
|
|
|
|
2014-01-11 02:33:56 +01:00
|
|
|
virtual const char* Name() const override {
|
|
|
|
return "UInt64AddOperator";
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
std::shared_ptr<MergeOperator> mergeOperator_;
|
|
|
|
};
|
|
|
|
|
2014-03-25 01:57:13 +01:00
|
|
|
std::shared_ptr<DB> OpenDb(const string& dbname, const bool ttl = false,
|
|
|
|
const size_t max_successive_merges = 0,
|
|
|
|
const uint32_t min_partial_merge_operands = 2) {
|
2013-03-21 23:59:47 +01:00
|
|
|
DB* db;
|
2013-08-06 02:55:44 +02:00
|
|
|
StackableDB* sdb;
|
2013-03-21 23:59:47 +01:00
|
|
|
Options options;
|
|
|
|
options.create_if_missing = true;
|
2014-01-11 02:33:56 +01:00
|
|
|
options.merge_operator = std::make_shared<CountMergeOperator>();
|
|
|
|
options.max_successive_merges = max_successive_merges;
|
2014-03-25 01:57:13 +01:00
|
|
|
options.min_partial_merge_operands = min_partial_merge_operands;
|
2013-07-23 01:49:55 +02:00
|
|
|
Status s;
|
|
|
|
DestroyDB(dbname, Options());
|
|
|
|
if (ttl) {
|
|
|
|
cout << "Opening database with TTL\n";
|
2013-08-06 20:42:21 +02:00
|
|
|
s = UtilityDB::OpenTtlDB(options, dbname, &sdb);
|
2013-08-06 02:55:44 +02:00
|
|
|
db = sdb;
|
2013-07-23 01:49:55 +02:00
|
|
|
} else {
|
2013-08-06 20:42:21 +02:00
|
|
|
s = DB::Open(options, dbname, &db);
|
2013-07-23 01:49:55 +02:00
|
|
|
}
|
2013-03-21 23:59:47 +01:00
|
|
|
if (!s.ok()) {
|
|
|
|
cerr << s.ToString() << endl;
|
|
|
|
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 22:26:38 +02:00
|
|
|
explicit Counters(std::shared_ptr<DB> db, uint64_t defaultCount = 0)
|
2013-03-21 23:59:47 +01: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
|
|
|
|
bool set(const string& key, uint64_t value) {
|
|
|
|
// just treat the internal rep of int64 as the string
|
|
|
|
Slice slice((char *)&value, sizeof(value));
|
|
|
|
auto s = db_->Put(put_option_, key, slice);
|
|
|
|
|
|
|
|
if (s.ok()) {
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
cerr << s.ToString() << endl;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-05 07:32:05 +02:00
|
|
|
// mapped to a rocksdb Delete
|
2013-03-21 23:59:47 +01:00
|
|
|
bool remove(const string& key) {
|
|
|
|
auto s = db_->Delete(delete_option_, key);
|
|
|
|
|
|
|
|
if (s.ok()) {
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
cerr << s.ToString() << std::endl;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-05 07:32:05 +02:00
|
|
|
// mapped to a rocksdb Get
|
2013-03-21 23:59:47 +01:00
|
|
|
bool get(const string& key, uint64_t *value) {
|
|
|
|
string str;
|
|
|
|
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)) {
|
|
|
|
cerr << "value corruption\n";
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
*value = DecodeFixed64(&str[0]);
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
cerr << s.ToString() << std::endl;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// 'add' is implemented as get -> modify -> set
|
|
|
|
// An alternative is a single merge operation, see MergeBasedCounters
|
|
|
|
virtual bool add(const string& key, uint64_t value) {
|
|
|
|
uint64_t base = default_;
|
|
|
|
return get(key, &base) && set(key, base + value);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// convenience functions for testing
|
|
|
|
void assert_set(const string& key, uint64_t value) {
|
|
|
|
assert(set(key, value));
|
|
|
|
}
|
|
|
|
|
|
|
|
void assert_remove(const string& key) {
|
|
|
|
assert(remove(key));
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t assert_get(const string& key) {
|
|
|
|
uint64_t value = default_;
|
|
|
|
assert(get(key, &value));
|
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
|
|
|
void assert_add(const string& key, uint64_t value) {
|
|
|
|
assert(add(key, value));
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// Implement 'add' directly with the new Merge operation
|
|
|
|
class MergeBasedCounters : public Counters {
|
|
|
|
private:
|
|
|
|
WriteOptions merge_option_; // for merge
|
|
|
|
|
|
|
|
public:
|
2013-07-29 22:26:38 +02:00
|
|
|
explicit MergeBasedCounters(std::shared_ptr<DB> db, uint64_t defaultCount = 0)
|
2013-03-21 23:59:47 +01:00
|
|
|
: Counters(db, defaultCount),
|
|
|
|
merge_option_() {
|
|
|
|
}
|
|
|
|
|
2013-10-05 07:32:05 +02:00
|
|
|
// mapped to a rocksdb Merge operation
|
2013-03-21 23:59:47 +01:00
|
|
|
virtual bool add(const string& key, uint64_t value) override {
|
|
|
|
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 {
|
|
|
|
cerr << s.ToString() << endl;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
void dumpDb(DB* db) {
|
|
|
|
auto it = unique_ptr<Iterator>(db->NewIterator(ReadOptions()));
|
|
|
|
for (it->SeekToFirst(); it->Valid(); it->Next()) {
|
|
|
|
uint64_t value = DecodeFixed64(it->value().data());
|
|
|
|
cout << it->key().ToString() << ": " << value << endl;
|
|
|
|
}
|
|
|
|
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);
|
|
|
|
|
|
|
|
std::cout << "1\n";
|
|
|
|
|
|
|
|
// 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);
|
|
|
|
|
|
|
|
std::cout << "2\n";
|
|
|
|
dumpDb(db);
|
|
|
|
|
|
|
|
std::cout << "3\n";
|
|
|
|
|
|
|
|
if (test_compaction) {
|
|
|
|
db->Flush(o);
|
|
|
|
|
|
|
|
cout << "Compaction started ...\n";
|
|
|
|
db->CompactRange(nullptr, nullptr);
|
|
|
|
cout << "Compaction ended\n";
|
|
|
|
|
|
|
|
dumpDb(db);
|
|
|
|
|
|
|
|
assert(counters.assert_get("a")== 3);
|
|
|
|
assert(counters.assert_get("b") == sum);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-01-11 02:33:56 +01:00
|
|
|
void testSuccessiveMerge(
|
|
|
|
Counters& counters, int max_num_merges, int num_merges) {
|
|
|
|
|
|
|
|
counters.assert_remove("z");
|
|
|
|
uint64_t sum = 0;
|
|
|
|
|
|
|
|
for (int i = 1; i <= num_merges; ++i) {
|
|
|
|
resetNumMergeOperatorCalls();
|
|
|
|
counters.assert_add("z", i);
|
|
|
|
sum += i;
|
|
|
|
|
|
|
|
if (i % (max_num_merges + 1) == 0) {
|
|
|
|
assert(numMergeOperatorCalls == max_num_merges + 1);
|
|
|
|
} else {
|
|
|
|
assert(numMergeOperatorCalls == 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
resetNumMergeOperatorCalls();
|
|
|
|
assert(counters.assert_get("z") == sum);
|
|
|
|
assert(numMergeOperatorCalls == i % (max_num_merges + 1));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-03-25 01:57:13 +01:00
|
|
|
void testPartialMerge(Counters* counters, DB* db, int max_merge, int min_merge,
|
|
|
|
int count) {
|
|
|
|
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();
|
|
|
|
for (int i = 1; i <= count; i++) {
|
|
|
|
counters->assert_add("b", i);
|
|
|
|
tmp_sum += i;
|
|
|
|
}
|
|
|
|
db->Flush(o);
|
|
|
|
db->CompactRange(nullptr, nullptr);
|
|
|
|
ASSERT_EQ(tmp_sum, counters->assert_get("b"));
|
|
|
|
if (count > max_merge) {
|
|
|
|
// in this case, FullMerge should be called instead.
|
|
|
|
ASSERT_EQ(num_partial_merge_calls, 0);
|
|
|
|
} 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");
|
|
|
|
for (int i = 1; i <= count; i++) {
|
|
|
|
counters->assert_add("c", i);
|
|
|
|
tmp_sum += i;
|
|
|
|
}
|
|
|
|
db->Flush(o);
|
|
|
|
db->CompactRange(nullptr, nullptr);
|
|
|
|
ASSERT_EQ(tmp_sum, counters->assert_get("c"));
|
|
|
|
ASSERT_EQ(num_partial_merge_calls, 0);
|
|
|
|
}
|
|
|
|
|
2014-01-11 02:33:56 +01:00
|
|
|
void testSingleBatchSuccessiveMerge(
|
|
|
|
DB* db,
|
|
|
|
int max_num_merges,
|
|
|
|
int num_merges) {
|
|
|
|
assert(num_merges > max_num_merges);
|
|
|
|
|
|
|
|
Slice key("BatchSuccessiveMerge");
|
|
|
|
uint64_t merge_value = 1;
|
|
|
|
Slice merge_value_slice((char *)&merge_value, sizeof(merge_value));
|
|
|
|
|
|
|
|
// Create the batch
|
|
|
|
WriteBatch batch;
|
|
|
|
for (int i = 0; i < num_merges; ++i) {
|
|
|
|
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());
|
|
|
|
}
|
|
|
|
assert(numMergeOperatorCalls ==
|
|
|
|
num_merges - (num_merges % (max_num_merges + 1)));
|
|
|
|
|
|
|
|
// Get the value
|
|
|
|
resetNumMergeOperatorCalls();
|
|
|
|
string get_value_str;
|
|
|
|
{
|
|
|
|
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 18:25:42 +01:00
|
|
|
ASSERT_EQ(get_value, num_merges * merge_value);
|
|
|
|
ASSERT_EQ(numMergeOperatorCalls, (num_merges % (max_num_merges + 1)));
|
2014-01-11 02:33:56 +01:00
|
|
|
}
|
|
|
|
|
2013-07-23 01:49:55 +02:00
|
|
|
void runTest(int argc, const string& dbname, const bool use_ttl = false) {
|
|
|
|
auto db = OpenDb(dbname, use_ttl);
|
2013-03-21 23:59:47 +01:00
|
|
|
|
|
|
|
{
|
|
|
|
cout << "Test read-modify-write counters... \n";
|
|
|
|
Counters counters(db, 0);
|
|
|
|
testCounters(counters, db.get(), true);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool compact = false;
|
|
|
|
if (argc > 1) {
|
|
|
|
compact = true;
|
|
|
|
cout << "Turn on Compaction\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
cout << "Test merge-based counters... \n";
|
|
|
|
MergeBasedCounters counters(db, 0);
|
|
|
|
testCounters(counters, db.get(), compact);
|
|
|
|
}
|
|
|
|
|
2013-07-23 01:49:55 +02:00
|
|
|
DestroyDB(dbname, Options());
|
2014-01-11 02:33:56 +01:00
|
|
|
db.reset();
|
|
|
|
|
|
|
|
{
|
|
|
|
cout << "Test merge in memtable... \n";
|
2014-03-25 01:57:13 +01:00
|
|
|
size_t max_merge = 5;
|
|
|
|
auto db = OpenDb(dbname, use_ttl, max_merge);
|
2014-01-11 02:33:56 +01:00
|
|
|
MergeBasedCounters counters(db, 0);
|
|
|
|
testCounters(counters, db.get(), compact);
|
2014-03-25 01:57:13 +01:00
|
|
|
testSuccessiveMerge(counters, max_merge, max_merge * 2);
|
2014-01-11 02:33:56 +01:00
|
|
|
testSingleBatchSuccessiveMerge(db.get(), 5, 7);
|
|
|
|
DestroyDB(dbname, Options());
|
|
|
|
}
|
|
|
|
|
2014-03-25 01:57:13 +01:00
|
|
|
{
|
|
|
|
cout << "Test Partial-Merge\n";
|
|
|
|
size_t max_merge = 100;
|
|
|
|
for (uint32_t min_merge = 5; min_merge < 25; min_merge += 5) {
|
|
|
|
for (uint32_t count = min_merge - 1; count <= min_merge + 1; count++) {
|
|
|
|
auto db = OpenDb(dbname, use_ttl, max_merge, min_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, min_merge);
|
|
|
|
MergeBasedCounters counters(db, 0);
|
|
|
|
testPartialMerge(&counters, db.get(), max_merge, min_merge,
|
|
|
|
min_merge * 10);
|
|
|
|
DestroyDB(dbname, Options());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-07-23 01:49:55 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
int main(int argc, char *argv[]) {
|
|
|
|
//TODO: Make this test like a general rocksdb unit-test
|
2013-08-06 20:42:21 +02:00
|
|
|
runTest(argc, test::TmpDir() + "/merge_testdb");
|
|
|
|
runTest(argc, test::TmpDir() + "/merge_testdbttl", true); // Run test on TTL database
|
2014-03-25 01:57:13 +01:00
|
|
|
printf("Passed all tests!\n");
|
2013-03-21 23:59:47 +01:00
|
|
|
return 0;
|
|
|
|
}
|