fork of https://github.com/rust-rocksdb/rust-rocksdb for nextgraph
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
513 lines
18 KiB
513 lines
18 KiB
1 year ago
|
// 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 "db/table_properties_collector.h"
|
||
|
|
||
|
#include <map>
|
||
|
#include <memory>
|
||
|
#include <string>
|
||
|
#include <utility>
|
||
|
#include <vector>
|
||
|
|
||
|
#include "db/db_impl/db_impl.h"
|
||
|
#include "db/dbformat.h"
|
||
|
#include "file/sequence_file_reader.h"
|
||
|
#include "file/writable_file_writer.h"
|
||
|
#include "options/cf_options.h"
|
||
|
#include "rocksdb/flush_block_policy.h"
|
||
|
#include "rocksdb/table.h"
|
||
|
#include "table/block_based/block_based_table_factory.h"
|
||
|
#include "table/meta_blocks.h"
|
||
|
#include "table/plain/plain_table_factory.h"
|
||
|
#include "table/table_builder.h"
|
||
|
#include "test_util/testharness.h"
|
||
|
#include "test_util/testutil.h"
|
||
|
#include "util/coding.h"
|
||
|
|
||
|
namespace ROCKSDB_NAMESPACE {
|
||
|
|
||
|
class TablePropertiesTest : public testing::Test,
|
||
|
public testing::WithParamInterface<bool> {
|
||
|
public:
|
||
|
void SetUp() override { backward_mode_ = GetParam(); }
|
||
|
|
||
|
bool backward_mode_;
|
||
|
};
|
||
|
|
||
|
// Utilities test functions
|
||
|
namespace {
|
||
|
static const uint32_t kTestColumnFamilyId = 66;
|
||
|
static const std::string kTestColumnFamilyName = "test_column_fam";
|
||
|
static const int kTestLevel = 1;
|
||
|
|
||
|
void MakeBuilder(
|
||
|
const Options& options, const ImmutableOptions& ioptions,
|
||
|
const MutableCFOptions& moptions,
|
||
|
const InternalKeyComparator& internal_comparator,
|
||
|
const IntTblPropCollectorFactories* int_tbl_prop_collector_factories,
|
||
|
std::unique_ptr<WritableFileWriter>* writable,
|
||
|
std::unique_ptr<TableBuilder>* builder) {
|
||
|
std::unique_ptr<FSWritableFile> wf(new test::StringSink);
|
||
|
writable->reset(
|
||
|
new WritableFileWriter(std::move(wf), "" /* don't care */, EnvOptions()));
|
||
|
TableBuilderOptions tboptions(
|
||
|
ioptions, moptions, internal_comparator, int_tbl_prop_collector_factories,
|
||
|
options.compression, options.compression_opts, kTestColumnFamilyId,
|
||
|
kTestColumnFamilyName, kTestLevel);
|
||
|
builder->reset(NewTableBuilder(tboptions, writable->get()));
|
||
|
}
|
||
|
} // namespace
|
||
|
|
||
|
// Collects keys that starts with "A" in a table.
|
||
|
class RegularKeysStartWithA : public TablePropertiesCollector {
|
||
|
public:
|
||
|
const char* Name() const override { return "RegularKeysStartWithA"; }
|
||
|
|
||
|
Status Finish(UserCollectedProperties* properties) override {
|
||
|
std::string encoded;
|
||
|
std::string encoded_num_puts;
|
||
|
std::string encoded_num_deletes;
|
||
|
std::string encoded_num_single_deletes;
|
||
|
std::string encoded_num_size_changes;
|
||
|
PutVarint32(&encoded, count_);
|
||
|
PutVarint32(&encoded_num_puts, num_puts_);
|
||
|
PutVarint32(&encoded_num_deletes, num_deletes_);
|
||
|
PutVarint32(&encoded_num_single_deletes, num_single_deletes_);
|
||
|
PutVarint32(&encoded_num_size_changes, num_size_changes_);
|
||
|
*properties = UserCollectedProperties{
|
||
|
{"TablePropertiesTest", message_},
|
||
|
{"Count", encoded},
|
||
|
{"NumPuts", encoded_num_puts},
|
||
|
{"NumDeletes", encoded_num_deletes},
|
||
|
{"NumSingleDeletes", encoded_num_single_deletes},
|
||
|
{"NumSizeChanges", encoded_num_size_changes},
|
||
|
};
|
||
|
return Status::OK();
|
||
|
}
|
||
|
|
||
|
Status AddUserKey(const Slice& user_key, const Slice& /*value*/,
|
||
|
EntryType type, SequenceNumber /*seq*/,
|
||
|
uint64_t file_size) override {
|
||
|
// simply asssume all user keys are not empty.
|
||
|
if (user_key.data()[0] == 'A') {
|
||
|
++count_;
|
||
|
}
|
||
|
if (type == kEntryPut) {
|
||
|
num_puts_++;
|
||
|
} else if (type == kEntryDelete) {
|
||
|
num_deletes_++;
|
||
|
} else if (type == kEntrySingleDelete) {
|
||
|
num_single_deletes_++;
|
||
|
}
|
||
|
if (file_size < file_size_) {
|
||
|
message_ = "File size should not decrease.";
|
||
|
} else if (file_size != file_size_) {
|
||
|
num_size_changes_++;
|
||
|
}
|
||
|
|
||
|
return Status::OK();
|
||
|
}
|
||
|
|
||
|
UserCollectedProperties GetReadableProperties() const override {
|
||
|
return UserCollectedProperties{};
|
||
|
}
|
||
|
|
||
|
private:
|
||
|
std::string message_ = "Rocksdb";
|
||
|
uint32_t count_ = 0;
|
||
|
uint32_t num_puts_ = 0;
|
||
|
uint32_t num_deletes_ = 0;
|
||
|
uint32_t num_single_deletes_ = 0;
|
||
|
uint32_t num_size_changes_ = 0;
|
||
|
uint64_t file_size_ = 0;
|
||
|
};
|
||
|
|
||
|
// Collects keys that starts with "A" in a table. Backward compatible mode
|
||
|
// It is also used to test internal key table property collector
|
||
|
class RegularKeysStartWithABackwardCompatible
|
||
|
: public TablePropertiesCollector {
|
||
|
public:
|
||
|
const char* Name() const override { return "RegularKeysStartWithA"; }
|
||
|
|
||
|
Status Finish(UserCollectedProperties* properties) override {
|
||
|
std::string encoded;
|
||
|
PutVarint32(&encoded, count_);
|
||
|
*properties = UserCollectedProperties{{"TablePropertiesTest", "Rocksdb"},
|
||
|
{"Count", encoded}};
|
||
|
return Status::OK();
|
||
|
}
|
||
|
|
||
|
Status Add(const Slice& user_key, const Slice& /*value*/) override {
|
||
|
// simply asssume all user keys are not empty.
|
||
|
if (user_key.data()[0] == 'A') {
|
||
|
++count_;
|
||
|
}
|
||
|
return Status::OK();
|
||
|
}
|
||
|
|
||
|
UserCollectedProperties GetReadableProperties() const override {
|
||
|
return UserCollectedProperties{};
|
||
|
}
|
||
|
|
||
|
private:
|
||
|
uint32_t count_ = 0;
|
||
|
};
|
||
|
|
||
|
class RegularKeysStartWithAInternal : public IntTblPropCollector {
|
||
|
public:
|
||
|
const char* Name() const override { return "RegularKeysStartWithA"; }
|
||
|
|
||
|
Status Finish(UserCollectedProperties* properties) override {
|
||
|
std::string encoded;
|
||
|
PutVarint32(&encoded, count_);
|
||
|
*properties = UserCollectedProperties{{"TablePropertiesTest", "Rocksdb"},
|
||
|
{"Count", encoded}};
|
||
|
return Status::OK();
|
||
|
}
|
||
|
|
||
|
Status InternalAdd(const Slice& user_key, const Slice& /*value*/,
|
||
|
uint64_t /*file_size*/) override {
|
||
|
// simply asssume all user keys are not empty.
|
||
|
if (user_key.data()[0] == 'A') {
|
||
|
++count_;
|
||
|
}
|
||
|
return Status::OK();
|
||
|
}
|
||
|
|
||
|
void BlockAdd(uint64_t /* block_uncomp_bytes */,
|
||
|
uint64_t /* block_compressed_bytes_fast */,
|
||
|
uint64_t /* block_compressed_bytes_slow */) override {
|
||
|
// Nothing to do.
|
||
|
return;
|
||
|
}
|
||
|
|
||
|
UserCollectedProperties GetReadableProperties() const override {
|
||
|
return UserCollectedProperties{};
|
||
|
}
|
||
|
|
||
|
private:
|
||
|
uint32_t count_ = 0;
|
||
|
};
|
||
|
|
||
|
class RegularKeysStartWithAFactory : public IntTblPropCollectorFactory,
|
||
|
public TablePropertiesCollectorFactory {
|
||
|
public:
|
||
|
explicit RegularKeysStartWithAFactory(bool backward_mode)
|
||
|
: backward_mode_(backward_mode) {}
|
||
|
TablePropertiesCollector* CreateTablePropertiesCollector(
|
||
|
TablePropertiesCollectorFactory::Context context) override {
|
||
|
EXPECT_EQ(kTestColumnFamilyId, context.column_family_id);
|
||
|
EXPECT_EQ(kTestLevel, context.level_at_creation);
|
||
|
if (!backward_mode_) {
|
||
|
return new RegularKeysStartWithA();
|
||
|
} else {
|
||
|
return new RegularKeysStartWithABackwardCompatible();
|
||
|
}
|
||
|
}
|
||
|
IntTblPropCollector* CreateIntTblPropCollector(
|
||
|
uint32_t /*column_family_id*/, int /* level_at_creation */) override {
|
||
|
return new RegularKeysStartWithAInternal();
|
||
|
}
|
||
|
const char* Name() const override { return "RegularKeysStartWithA"; }
|
||
|
|
||
|
bool backward_mode_;
|
||
|
};
|
||
|
|
||
|
class FlushBlockEveryThreePolicy : public FlushBlockPolicy {
|
||
|
public:
|
||
|
bool Update(const Slice& /*key*/, const Slice& /*value*/) override {
|
||
|
return (++count_ % 3U == 0);
|
||
|
}
|
||
|
|
||
|
private:
|
||
|
uint64_t count_ = 0;
|
||
|
};
|
||
|
|
||
|
class FlushBlockEveryThreePolicyFactory : public FlushBlockPolicyFactory {
|
||
|
public:
|
||
|
explicit FlushBlockEveryThreePolicyFactory() {}
|
||
|
|
||
|
const char* Name() const override {
|
||
|
return "FlushBlockEveryThreePolicyFactory";
|
||
|
}
|
||
|
|
||
|
FlushBlockPolicy* NewFlushBlockPolicy(
|
||
|
const BlockBasedTableOptions& /*table_options*/,
|
||
|
const BlockBuilder& /*data_block_builder*/) const override {
|
||
|
return new FlushBlockEveryThreePolicy;
|
||
|
}
|
||
|
};
|
||
|
|
||
|
extern const uint64_t kBlockBasedTableMagicNumber;
|
||
|
extern const uint64_t kPlainTableMagicNumber;
|
||
|
namespace {
|
||
|
void TestCustomizedTablePropertiesCollector(
|
||
|
bool backward_mode, uint64_t magic_number, bool test_int_tbl_prop_collector,
|
||
|
const Options& options, const InternalKeyComparator& internal_comparator) {
|
||
|
// make sure the entries will be inserted with order.
|
||
|
std::map<std::pair<std::string, ValueType>, std::string> kvs = {
|
||
|
{{"About ", kTypeValue}, "val5"}, // starts with 'A'
|
||
|
{{"Abstract", kTypeValue}, "val2"}, // starts with 'A'
|
||
|
{{"Around ", kTypeValue}, "val7"}, // starts with 'A'
|
||
|
{{"Beyond ", kTypeValue}, "val3"},
|
||
|
{{"Builder ", kTypeValue}, "val1"},
|
||
|
{{"Love ", kTypeDeletion}, ""},
|
||
|
{{"Cancel ", kTypeValue}, "val4"},
|
||
|
{{"Find ", kTypeValue}, "val6"},
|
||
|
{{"Rocks ", kTypeDeletion}, ""},
|
||
|
{{"Foo ", kTypeSingleDeletion}, ""},
|
||
|
};
|
||
|
|
||
|
// -- Step 1: build table
|
||
|
std::unique_ptr<TableBuilder> builder;
|
||
|
std::unique_ptr<WritableFileWriter> writer;
|
||
|
const ImmutableOptions ioptions(options);
|
||
|
const MutableCFOptions moptions(options);
|
||
|
IntTblPropCollectorFactories int_tbl_prop_collector_factories;
|
||
|
if (test_int_tbl_prop_collector) {
|
||
|
int_tbl_prop_collector_factories.emplace_back(
|
||
|
new RegularKeysStartWithAFactory(backward_mode));
|
||
|
} else {
|
||
|
GetIntTblPropCollectorFactory(ioptions, &int_tbl_prop_collector_factories);
|
||
|
}
|
||
|
MakeBuilder(options, ioptions, moptions, internal_comparator,
|
||
|
&int_tbl_prop_collector_factories, &writer, &builder);
|
||
|
|
||
|
SequenceNumber seqNum = 0U;
|
||
|
for (const auto& kv : kvs) {
|
||
|
InternalKey ikey(kv.first.first, seqNum++, kv.first.second);
|
||
|
builder->Add(ikey.Encode(), kv.second);
|
||
|
}
|
||
|
ASSERT_OK(builder->Finish());
|
||
|
ASSERT_OK(writer->Flush());
|
||
|
|
||
|
// -- Step 2: Read properties
|
||
|
test::StringSink* fwf =
|
||
|
static_cast<test::StringSink*>(writer->writable_file());
|
||
|
std::unique_ptr<FSRandomAccessFile> source(
|
||
|
new test::StringSource(fwf->contents()));
|
||
|
std::unique_ptr<RandomAccessFileReader> fake_file_reader(
|
||
|
new RandomAccessFileReader(std::move(source), "test"));
|
||
|
|
||
|
std::unique_ptr<TableProperties> props;
|
||
|
const ReadOptions read_options;
|
||
|
Status s = ReadTableProperties(fake_file_reader.get(), fwf->contents().size(),
|
||
|
magic_number, ioptions, read_options, &props);
|
||
|
ASSERT_OK(s);
|
||
|
|
||
|
auto user_collected = props->user_collected_properties;
|
||
|
|
||
|
ASSERT_NE(user_collected.find("TablePropertiesTest"), user_collected.end());
|
||
|
ASSERT_EQ("Rocksdb", user_collected.at("TablePropertiesTest"));
|
||
|
|
||
|
uint32_t starts_with_A = 0;
|
||
|
ASSERT_NE(user_collected.find("Count"), user_collected.end());
|
||
|
Slice key(user_collected.at("Count"));
|
||
|
ASSERT_TRUE(GetVarint32(&key, &starts_with_A));
|
||
|
ASSERT_EQ(3u, starts_with_A);
|
||
|
|
||
|
if (!backward_mode && !test_int_tbl_prop_collector) {
|
||
|
uint32_t num_puts;
|
||
|
ASSERT_NE(user_collected.find("NumPuts"), user_collected.end());
|
||
|
Slice key_puts(user_collected.at("NumPuts"));
|
||
|
ASSERT_TRUE(GetVarint32(&key_puts, &num_puts));
|
||
|
ASSERT_EQ(7u, num_puts);
|
||
|
|
||
|
uint32_t num_deletes;
|
||
|
ASSERT_NE(user_collected.find("NumDeletes"), user_collected.end());
|
||
|
Slice key_deletes(user_collected.at("NumDeletes"));
|
||
|
ASSERT_TRUE(GetVarint32(&key_deletes, &num_deletes));
|
||
|
ASSERT_EQ(2u, num_deletes);
|
||
|
|
||
|
uint32_t num_single_deletes;
|
||
|
ASSERT_NE(user_collected.find("NumSingleDeletes"), user_collected.end());
|
||
|
Slice key_single_deletes(user_collected.at("NumSingleDeletes"));
|
||
|
ASSERT_TRUE(GetVarint32(&key_single_deletes, &num_single_deletes));
|
||
|
ASSERT_EQ(1u, num_single_deletes);
|
||
|
|
||
|
uint32_t num_size_changes;
|
||
|
ASSERT_NE(user_collected.find("NumSizeChanges"), user_collected.end());
|
||
|
Slice key_size_changes(user_collected.at("NumSizeChanges"));
|
||
|
ASSERT_TRUE(GetVarint32(&key_size_changes, &num_size_changes));
|
||
|
ASSERT_GE(num_size_changes, 2u);
|
||
|
}
|
||
|
}
|
||
|
} // namespace
|
||
|
|
||
|
TEST_P(TablePropertiesTest, CustomizedTablePropertiesCollector) {
|
||
|
// Test properties collectors with internal keys or regular keys
|
||
|
// for block based table
|
||
|
for (bool encode_as_internal : {true, false}) {
|
||
|
Options options;
|
||
|
BlockBasedTableOptions table_options;
|
||
|
table_options.flush_block_policy_factory =
|
||
|
std::make_shared<FlushBlockEveryThreePolicyFactory>();
|
||
|
options.table_factory.reset(NewBlockBasedTableFactory(table_options));
|
||
|
|
||
|
test::PlainInternalKeyComparator ikc(options.comparator);
|
||
|
std::shared_ptr<TablePropertiesCollectorFactory> collector_factory(
|
||
|
new RegularKeysStartWithAFactory(backward_mode_));
|
||
|
options.table_properties_collector_factories.resize(1);
|
||
|
options.table_properties_collector_factories[0] = collector_factory;
|
||
|
|
||
|
TestCustomizedTablePropertiesCollector(backward_mode_,
|
||
|
kBlockBasedTableMagicNumber,
|
||
|
encode_as_internal, options, ikc);
|
||
|
|
||
|
// test plain table
|
||
|
PlainTableOptions plain_table_options;
|
||
|
plain_table_options.user_key_len = 8;
|
||
|
plain_table_options.bloom_bits_per_key = 8;
|
||
|
plain_table_options.hash_table_ratio = 0;
|
||
|
|
||
|
options.table_factory =
|
||
|
std::make_shared<PlainTableFactory>(plain_table_options);
|
||
|
TestCustomizedTablePropertiesCollector(backward_mode_,
|
||
|
kPlainTableMagicNumber,
|
||
|
encode_as_internal, options, ikc);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
namespace {
|
||
|
void TestInternalKeyPropertiesCollector(
|
||
|
bool backward_mode, uint64_t magic_number, bool sanitized,
|
||
|
std::shared_ptr<TableFactory> table_factory) {
|
||
|
InternalKey keys[] = {
|
||
|
InternalKey("A ", 0, ValueType::kTypeValue),
|
||
|
InternalKey("B ", 1, ValueType::kTypeValue),
|
||
|
InternalKey("C ", 2, ValueType::kTypeValue),
|
||
|
InternalKey("W ", 3, ValueType::kTypeDeletion),
|
||
|
InternalKey("X ", 4, ValueType::kTypeDeletion),
|
||
|
InternalKey("Y ", 5, ValueType::kTypeDeletion),
|
||
|
InternalKey("Z ", 6, ValueType::kTypeDeletion),
|
||
|
InternalKey("a ", 7, ValueType::kTypeSingleDeletion),
|
||
|
InternalKey("b ", 8, ValueType::kTypeMerge),
|
||
|
InternalKey("c ", 9, ValueType::kTypeMerge),
|
||
|
};
|
||
|
|
||
|
std::unique_ptr<TableBuilder> builder;
|
||
|
std::unique_ptr<WritableFileWriter> writable;
|
||
|
Options options;
|
||
|
test::PlainInternalKeyComparator pikc(options.comparator);
|
||
|
|
||
|
IntTblPropCollectorFactories int_tbl_prop_collector_factories;
|
||
|
options.table_factory = table_factory;
|
||
|
if (sanitized) {
|
||
|
options.table_properties_collector_factories.emplace_back(
|
||
|
new RegularKeysStartWithAFactory(backward_mode));
|
||
|
// with sanitization, even regular properties collector will be able to
|
||
|
// handle internal keys.
|
||
|
auto comparator = options.comparator;
|
||
|
// HACK: Set options.info_log to avoid writing log in
|
||
|
// SanitizeOptions().
|
||
|
options.info_log = std::make_shared<test::NullLogger>();
|
||
|
options = SanitizeOptions("db", // just a place holder
|
||
|
options);
|
||
|
ImmutableOptions ioptions(options);
|
||
|
GetIntTblPropCollectorFactory(ioptions, &int_tbl_prop_collector_factories);
|
||
|
options.comparator = comparator;
|
||
|
}
|
||
|
const ImmutableOptions ioptions(options);
|
||
|
MutableCFOptions moptions(options);
|
||
|
|
||
|
for (int iter = 0; iter < 2; ++iter) {
|
||
|
MakeBuilder(options, ioptions, moptions, pikc,
|
||
|
&int_tbl_prop_collector_factories, &writable, &builder);
|
||
|
for (const auto& k : keys) {
|
||
|
builder->Add(k.Encode(), "val");
|
||
|
}
|
||
|
|
||
|
ASSERT_OK(builder->Finish());
|
||
|
ASSERT_OK(writable->Flush());
|
||
|
|
||
|
test::StringSink* fwf =
|
||
|
static_cast<test::StringSink*>(writable->writable_file());
|
||
|
std::unique_ptr<FSRandomAccessFile> source(
|
||
|
new test::StringSource(fwf->contents()));
|
||
|
std::unique_ptr<RandomAccessFileReader> reader(
|
||
|
new RandomAccessFileReader(std::move(source), "test"));
|
||
|
|
||
|
std::unique_ptr<TableProperties> props;
|
||
|
const ReadOptions read_options;
|
||
|
Status s =
|
||
|
ReadTableProperties(reader.get(), fwf->contents().size(), magic_number,
|
||
|
ioptions, read_options, &props);
|
||
|
ASSERT_OK(s);
|
||
|
|
||
|
auto user_collected = props->user_collected_properties;
|
||
|
uint64_t deleted = GetDeletedKeys(user_collected);
|
||
|
ASSERT_EQ(5u, deleted); // deletes + single-deletes
|
||
|
|
||
|
bool property_present;
|
||
|
uint64_t merges = GetMergeOperands(user_collected, &property_present);
|
||
|
ASSERT_TRUE(property_present);
|
||
|
ASSERT_EQ(2u, merges);
|
||
|
|
||
|
if (sanitized) {
|
||
|
uint32_t starts_with_A = 0;
|
||
|
ASSERT_NE(user_collected.find("Count"), user_collected.end());
|
||
|
Slice key(user_collected.at("Count"));
|
||
|
ASSERT_TRUE(GetVarint32(&key, &starts_with_A));
|
||
|
ASSERT_EQ(1u, starts_with_A);
|
||
|
|
||
|
if (!backward_mode) {
|
||
|
uint32_t num_puts;
|
||
|
ASSERT_NE(user_collected.find("NumPuts"), user_collected.end());
|
||
|
Slice key_puts(user_collected.at("NumPuts"));
|
||
|
ASSERT_TRUE(GetVarint32(&key_puts, &num_puts));
|
||
|
ASSERT_EQ(3u, num_puts);
|
||
|
|
||
|
uint32_t num_deletes;
|
||
|
ASSERT_NE(user_collected.find("NumDeletes"), user_collected.end());
|
||
|
Slice key_deletes(user_collected.at("NumDeletes"));
|
||
|
ASSERT_TRUE(GetVarint32(&key_deletes, &num_deletes));
|
||
|
ASSERT_EQ(4u, num_deletes);
|
||
|
|
||
|
uint32_t num_single_deletes;
|
||
|
ASSERT_NE(user_collected.find("NumSingleDeletes"),
|
||
|
user_collected.end());
|
||
|
Slice key_single_deletes(user_collected.at("NumSingleDeletes"));
|
||
|
ASSERT_TRUE(GetVarint32(&key_single_deletes, &num_single_deletes));
|
||
|
ASSERT_EQ(1u, num_single_deletes);
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
} // namespace
|
||
|
|
||
|
TEST_P(TablePropertiesTest, InternalKeyPropertiesCollector) {
|
||
|
TestInternalKeyPropertiesCollector(
|
||
|
backward_mode_, kBlockBasedTableMagicNumber, true /* sanitize */,
|
||
|
std::make_shared<BlockBasedTableFactory>());
|
||
|
if (backward_mode_) {
|
||
|
TestInternalKeyPropertiesCollector(
|
||
|
backward_mode_, kBlockBasedTableMagicNumber, false /* not sanitize */,
|
||
|
std::make_shared<BlockBasedTableFactory>());
|
||
|
}
|
||
|
|
||
|
PlainTableOptions plain_table_options;
|
||
|
plain_table_options.user_key_len = 8;
|
||
|
plain_table_options.bloom_bits_per_key = 8;
|
||
|
plain_table_options.hash_table_ratio = 0;
|
||
|
|
||
|
TestInternalKeyPropertiesCollector(
|
||
|
backward_mode_, kPlainTableMagicNumber, false /* not sanitize */,
|
||
|
std::make_shared<PlainTableFactory>(plain_table_options));
|
||
|
}
|
||
|
|
||
|
INSTANTIATE_TEST_CASE_P(InternalKeyPropertiesCollector, TablePropertiesTest,
|
||
|
::testing::Bool());
|
||
|
|
||
|
INSTANTIATE_TEST_CASE_P(CustomizedTablePropertiesCollector, TablePropertiesTest,
|
||
|
::testing::Bool());
|
||
|
|
||
|
} // namespace ROCKSDB_NAMESPACE
|
||
|
|
||
|
int main(int argc, char** argv) {
|
||
|
ROCKSDB_NAMESPACE::port::InstallStackTraceHandler();
|
||
|
::testing::InitGoogleTest(&argc, argv);
|
||
|
return RUN_ALL_TESTS();
|
||
|
}
|