627 lines
20 KiB
C++
627 lines
20 KiB
C++
|
|
/*
|
|
* Copyright (C) 2015 ScyllaDB
|
|
*/
|
|
|
|
/*
|
|
* This file is part of Scylla.
|
|
*
|
|
* Scylla is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Affero General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* Scylla is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with Scylla. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include "sstables/sstables.hh"
|
|
#include "database.hh"
|
|
#include "schema.hh"
|
|
#include "schema_builder.hh"
|
|
#include "core/thread.hh"
|
|
|
|
static auto la = sstables::sstable::version_types::la;
|
|
static auto big = sstables::sstable::format_types::big;
|
|
|
|
class column_family_test {
|
|
lw_shared_ptr<column_family> _cf;
|
|
public:
|
|
column_family_test(lw_shared_ptr<column_family> cf) : _cf(cf) {}
|
|
|
|
void add_sstable(lw_shared_ptr<sstables::sstable> sstable) {
|
|
_cf->_sstables->insert(std::move(sstable));
|
|
}
|
|
};
|
|
|
|
namespace sstables {
|
|
|
|
using sstable_ptr = lw_shared_ptr<sstable>;
|
|
|
|
class test {
|
|
sstable_ptr _sst;
|
|
public:
|
|
|
|
test(sstable_ptr s) : _sst(s) {}
|
|
|
|
summary& _summary() {
|
|
return _sst->_components->summary;
|
|
}
|
|
|
|
future<temporary_buffer<char>> data_read(uint64_t pos, size_t len) {
|
|
return _sst->data_read(pos, len, default_priority_class());
|
|
}
|
|
future<index_list> read_indexes(uint64_t summary_idx) {
|
|
return _sst->read_indexes(summary_idx, default_priority_class());
|
|
}
|
|
|
|
future<> read_statistics() {
|
|
return _sst->read_statistics(default_priority_class());
|
|
}
|
|
|
|
statistics& get_statistics() {
|
|
return _sst->_components->statistics;
|
|
}
|
|
|
|
future<> read_summary() {
|
|
return _sst->read_summary(default_priority_class());
|
|
}
|
|
|
|
future<summary_entry&> read_summary_entry(size_t i) {
|
|
return _sst->read_summary_entry(i);
|
|
}
|
|
|
|
summary& get_summary() {
|
|
return _sst->_components->summary;
|
|
}
|
|
|
|
future<> read_toc() {
|
|
return _sst->read_toc();
|
|
}
|
|
|
|
auto& get_components() {
|
|
return _sst->_recognized_components;
|
|
}
|
|
|
|
template <typename T>
|
|
int binary_search(const T& entries, const key& sk) {
|
|
return _sst->binary_search(entries, sk);
|
|
}
|
|
|
|
void change_generation_number(int64_t generation) {
|
|
_sst->_generation = generation;
|
|
}
|
|
|
|
void change_dir(sstring dir) {
|
|
_sst->_dir = dir;
|
|
}
|
|
|
|
void set_data_file_size(uint64_t size) {
|
|
_sst->_data_file_size = size;
|
|
}
|
|
|
|
future<> store() {
|
|
_sst->_recognized_components.erase(sstable::component_type::Index);
|
|
_sst->_recognized_components.erase(sstable::component_type::Data);
|
|
return seastar::async([sst = _sst] {
|
|
sst->write_toc(default_priority_class());
|
|
sst->write_statistics(default_priority_class());
|
|
sst->write_compression(default_priority_class());
|
|
sst->write_filter(default_priority_class());
|
|
sst->write_summary(default_priority_class());
|
|
sst->seal_sstable().get();
|
|
});
|
|
}
|
|
|
|
static sstable_ptr make_test_sstable(size_t buffer_size, schema_ptr schema, sstring dir, unsigned long generation, sstable::version_types v,
|
|
sstable::format_types f, gc_clock::time_point now = gc_clock::now()) {
|
|
return make_lw_shared<sstable>(std::move(schema), dir, generation, v, f, now, default_io_error_handler_gen(), buffer_size);
|
|
}
|
|
|
|
// Used to create synthetic sstables for testing leveled compaction strategy.
|
|
void set_values_for_leveled_strategy(uint64_t fake_data_size, uint32_t sstable_level, int64_t max_timestamp, sstring first_key, sstring last_key) {
|
|
_sst->_data_file_size = fake_data_size;
|
|
// Create a synthetic stats metadata
|
|
stats_metadata stats = {};
|
|
// leveled strategy sorts sstables by age using max_timestamp, let's set it to 0.
|
|
stats.max_timestamp = max_timestamp;
|
|
stats.sstable_level = sstable_level;
|
|
_sst->_components->statistics.contents[metadata_type::Stats] = std::make_unique<stats_metadata>(std::move(stats));
|
|
_sst->_components->summary.first_key.value = bytes(reinterpret_cast<const signed char*>(first_key.c_str()), first_key.size());
|
|
_sst->_components->summary.last_key.value = bytes(reinterpret_cast<const signed char*>(last_key.c_str()), last_key.size());
|
|
_sst->set_first_and_last_keys();
|
|
}
|
|
|
|
void set_values(sstring first_key, sstring last_key, stats_metadata stats) {
|
|
_sst->_components->statistics.contents[metadata_type::Stats] = std::make_unique<stats_metadata>(std::move(stats));
|
|
_sst->_components->summary.first_key.value = bytes(reinterpret_cast<const signed char*>(first_key.c_str()), first_key.size());
|
|
_sst->_components->summary.last_key.value = bytes(reinterpret_cast<const signed char*>(last_key.c_str()), last_key.size());
|
|
_sst->set_first_and_last_keys();
|
|
}
|
|
};
|
|
|
|
inline future<sstable_ptr> reusable_sst(schema_ptr schema, sstring dir, unsigned long generation) {
|
|
auto sst = make_lw_shared<sstable>(std::move(schema), dir, generation, la, big);
|
|
auto fut = sst->load();
|
|
return std::move(fut).then([sst = std::move(sst)] {
|
|
return make_ready_future<sstable_ptr>(std::move(sst));
|
|
});
|
|
}
|
|
|
|
inline future<> working_sst(schema_ptr schema, sstring dir, unsigned long generation) {
|
|
return reusable_sst(std::move(schema), dir, generation).then([] (auto ptr) { return make_ready_future<>(); });
|
|
}
|
|
|
|
inline schema_ptr composite_schema() {
|
|
static thread_local auto s = [] {
|
|
schema_builder builder(make_lw_shared(schema({}, "tests", "composite",
|
|
// partition key
|
|
{{"name", bytes_type}, {"col1", bytes_type}},
|
|
// clustering key
|
|
{},
|
|
// regular columns
|
|
{},
|
|
// static columns
|
|
{},
|
|
// regular column name type
|
|
utf8_type,
|
|
// comment
|
|
"Table with a composite key as pkey"
|
|
)));
|
|
return builder.build(schema_builder::compact_storage::no);
|
|
}();
|
|
return s;
|
|
}
|
|
|
|
inline schema_ptr set_schema() {
|
|
static thread_local auto s = [] {
|
|
auto my_set_type = set_type_impl::get_instance(bytes_type, false);
|
|
schema_builder builder(make_lw_shared(schema({}, "tests", "set_pk",
|
|
// partition key
|
|
{{"ss", my_set_type}},
|
|
// clustering key
|
|
{},
|
|
// regular columns
|
|
{
|
|
{"ns", utf8_type},
|
|
},
|
|
// static columns
|
|
{},
|
|
// regular column name type
|
|
utf8_type,
|
|
// comment
|
|
"Table with a set as pkeys"
|
|
)));
|
|
return builder.build(schema_builder::compact_storage::no);
|
|
}();
|
|
return s;
|
|
}
|
|
|
|
inline schema_ptr map_schema() {
|
|
static thread_local auto s = [] {
|
|
auto my_map_type = map_type_impl::get_instance(bytes_type, bytes_type, false);
|
|
schema_builder builder(make_lw_shared(schema({}, "tests", "map_pk",
|
|
// partition key
|
|
{{"ss", my_map_type}},
|
|
// clustering key
|
|
{},
|
|
// regular columns
|
|
{
|
|
{"ns", utf8_type},
|
|
},
|
|
// static columns
|
|
{},
|
|
// regular column name type
|
|
utf8_type,
|
|
// comment
|
|
"Table with a map as pkeys"
|
|
)));
|
|
return builder.build(schema_builder::compact_storage::no);
|
|
}();
|
|
return s;
|
|
}
|
|
|
|
inline schema_ptr list_schema() {
|
|
static thread_local auto s = [] {
|
|
auto my_list_type = list_type_impl::get_instance(bytes_type, false);
|
|
schema_builder builder(make_lw_shared(schema({}, "tests", "list_pk",
|
|
// partition key
|
|
{{"ss", my_list_type}},
|
|
// clustering key
|
|
{},
|
|
// regular columns
|
|
{
|
|
{"ns", utf8_type},
|
|
},
|
|
// static columns
|
|
{},
|
|
// regular column name type
|
|
utf8_type,
|
|
// comment
|
|
"Table with a list as pkeys"
|
|
)));
|
|
return builder.build(schema_builder::compact_storage::no);
|
|
}();
|
|
return s;
|
|
}
|
|
|
|
inline schema_ptr uncompressed_schema(int32_t min_index_interval = 0) {
|
|
auto uncompressed = [=] {
|
|
schema_builder builder(make_lw_shared(schema(generate_legacy_id("ks", "uncompressed"), "ks", "uncompressed",
|
|
// partition key
|
|
{{"name", utf8_type}},
|
|
// clustering key
|
|
{},
|
|
// regular columns
|
|
{{"col1", utf8_type}, {"col2", int32_type}},
|
|
// static columns
|
|
{},
|
|
// regular column name type
|
|
utf8_type,
|
|
// comment
|
|
"Uncompressed data"
|
|
)));
|
|
builder.set_compressor_params(compression_parameters({ }));
|
|
if (min_index_interval) {
|
|
builder.set_min_index_interval(min_index_interval);
|
|
}
|
|
return builder.build(schema_builder::compact_storage::no);
|
|
}();
|
|
return uncompressed;
|
|
}
|
|
|
|
inline schema_ptr complex_schema() {
|
|
static thread_local auto s = [] {
|
|
auto my_list_type = list_type_impl::get_instance(bytes_type, true);
|
|
auto my_map_type = map_type_impl::get_instance(bytes_type, bytes_type, true);
|
|
auto my_set_type = set_type_impl::get_instance(bytes_type, true);
|
|
auto my_fset_type = set_type_impl::get_instance(bytes_type, false);
|
|
auto my_set_static_type = set_type_impl::get_instance(bytes_type, true);
|
|
|
|
schema_builder builder(make_lw_shared(schema({}, "tests", "complex_schema",
|
|
// partition key
|
|
{{"key", bytes_type}},
|
|
// clustering key
|
|
{{"clust1", bytes_type}, {"clust2", bytes_type}},
|
|
// regular columns
|
|
{
|
|
{"reg_set", my_set_type},
|
|
{"reg_list", my_list_type},
|
|
{"reg_map", my_map_type},
|
|
{"reg_fset", my_fset_type},
|
|
{"reg", bytes_type},
|
|
},
|
|
// static columns
|
|
{{"static_obj", bytes_type}, {"static_collection", my_set_static_type}},
|
|
// regular column name type
|
|
bytes_type,
|
|
// comment
|
|
"Table with a complex schema, including collections and static keys"
|
|
)));
|
|
return builder.build(schema_builder::compact_storage::no);
|
|
}();
|
|
return s;
|
|
}
|
|
|
|
inline schema_ptr columns_schema() {
|
|
static thread_local auto columns = [] {
|
|
schema_builder builder(make_lw_shared(schema(generate_legacy_id("name", "columns"), "name", "columns",
|
|
// partition key
|
|
{{"keyspace_name", utf8_type}},
|
|
// clustering key
|
|
{{"columnfamily_name", utf8_type}, {"column_name", utf8_type}},
|
|
// regular columns
|
|
{
|
|
{"component_index", int32_type},
|
|
{"index_name", utf8_type},
|
|
{"index_options", utf8_type},
|
|
{"index_type", utf8_type},
|
|
{"type", utf8_type},
|
|
{"validator", utf8_type},
|
|
},
|
|
// static columns
|
|
{},
|
|
// regular column name type
|
|
utf8_type,
|
|
// comment
|
|
"column definitions"
|
|
)));
|
|
return builder.build(schema_builder::compact_storage::no);
|
|
}();
|
|
return columns;
|
|
}
|
|
|
|
inline schema_ptr compact_simple_dense_schema() {
|
|
static thread_local auto s = [] {
|
|
schema_builder builder(make_lw_shared(schema({}, "tests", "compact_simple_dense",
|
|
// partition key
|
|
{{"ks", bytes_type}},
|
|
// clustering key
|
|
{{"cl1", bytes_type}},
|
|
// regular columns
|
|
{{"cl2", bytes_type}},
|
|
// static columns
|
|
{},
|
|
// regular column name type
|
|
utf8_type,
|
|
// comment
|
|
"Table with a compact storage, and a single clustering key"
|
|
)));
|
|
return builder.build(schema_builder::compact_storage::yes);
|
|
}();
|
|
return s;
|
|
}
|
|
|
|
inline schema_ptr compact_dense_schema() {
|
|
static thread_local auto s = [] {
|
|
schema_builder builder(make_lw_shared(schema({}, "tests", "compact_simple_dense",
|
|
// partition key
|
|
{{"ks", bytes_type}},
|
|
// clustering key
|
|
{{"cl1", bytes_type}, {"cl2", bytes_type}},
|
|
// regular columns
|
|
{{"cl3", bytes_type}},
|
|
// static columns
|
|
{},
|
|
// regular column name type
|
|
utf8_type,
|
|
// comment
|
|
"Table with a compact storage, and a compound clustering key"
|
|
)));
|
|
return builder.build(schema_builder::compact_storage::yes);
|
|
}();
|
|
return s;
|
|
}
|
|
|
|
inline schema_ptr compact_sparse_schema() {
|
|
static thread_local auto s = [] {
|
|
schema_builder builder(make_lw_shared(schema({}, "tests", "compact_sparse",
|
|
// partition key
|
|
{{"ks", bytes_type}},
|
|
// clustering key
|
|
{},
|
|
// regular columns
|
|
{
|
|
{"cl1", bytes_type},
|
|
{"cl2", bytes_type},
|
|
},
|
|
// static columns
|
|
{},
|
|
// regular column name type
|
|
utf8_type,
|
|
// comment
|
|
"Table with a compact storage, but no clustering keys"
|
|
)));
|
|
return builder.build(schema_builder::compact_storage::yes);
|
|
}();
|
|
return s;
|
|
}
|
|
|
|
// This is "imported" from system_keyspace.cc. But we will copy it for two reasons:
|
|
// 1) This is private there, and for good reason.
|
|
// 2) If the schema for the peers table ever change (it does from ka to la), we want to make
|
|
// sure we are testing the exact some one we have in our test dir.
|
|
inline schema_ptr peers_schema() {
|
|
static thread_local auto peers = [] {
|
|
schema_builder builder(make_lw_shared(schema(generate_legacy_id("system", "peers"), "system", "peers",
|
|
// partition key
|
|
{{"peer", inet_addr_type}},
|
|
// clustering key
|
|
{},
|
|
// regular columns
|
|
{
|
|
{"data_center", utf8_type},
|
|
{"host_id", uuid_type},
|
|
{"preferred_ip", inet_addr_type},
|
|
{"rack", utf8_type},
|
|
{"release_version", utf8_type},
|
|
{"rpc_address", inet_addr_type},
|
|
{"schema_version", uuid_type},
|
|
{"tokens", set_type_impl::get_instance(utf8_type, true)},
|
|
},
|
|
// static columns
|
|
{},
|
|
// regular column name type
|
|
utf8_type,
|
|
// comment
|
|
"information about known peers in the cluster"
|
|
)));
|
|
return builder.build(schema_builder::compact_storage::no);
|
|
}();
|
|
return peers;
|
|
}
|
|
|
|
enum class status {
|
|
dead,
|
|
live,
|
|
ttl,
|
|
};
|
|
|
|
inline bool check_status_and_done(const atomic_cell &c, status expected) {
|
|
if (expected == status::dead) {
|
|
BOOST_REQUIRE(c.is_live() == false);
|
|
return true;
|
|
}
|
|
BOOST_REQUIRE(c.is_live() == true);
|
|
BOOST_REQUIRE(c.is_live_and_has_ttl() == (expected == status::ttl));
|
|
return false;
|
|
}
|
|
|
|
template <status Status>
|
|
inline void match(const row& row, const schema& s, bytes col, const data_value& value, int64_t timestamp = 0, int32_t expiration = 0) {
|
|
auto cdef = s.get_column_definition(col);
|
|
|
|
BOOST_CHECK_NO_THROW(row.cell_at(cdef->id));
|
|
auto c = row.cell_at(cdef->id).as_atomic_cell();
|
|
if (check_status_and_done(c, Status)) {
|
|
return;
|
|
}
|
|
|
|
auto expected = cdef->type->decompose(value);
|
|
BOOST_REQUIRE(c.value() == expected);
|
|
if (timestamp) {
|
|
BOOST_REQUIRE(c.timestamp() == timestamp);
|
|
}
|
|
if (expiration) {
|
|
BOOST_REQUIRE(c.expiry() == gc_clock::time_point(gc_clock::duration(expiration)));
|
|
}
|
|
}
|
|
|
|
inline void match_live_cell(const row& row, const schema& s, bytes col, const data_value& value) {
|
|
match<status::live>(row, s, col, value);
|
|
}
|
|
|
|
inline void match_expiring_cell(const row& row, const schema& s, bytes col, const data_value& value, int64_t timestamp, int32_t expiration) {
|
|
match<status::ttl>(row, s, col, value);
|
|
}
|
|
|
|
inline void match_dead_cell(const row& row, const schema& s, bytes col) {
|
|
match<status::dead>(row, s, col, 0); // value will be ignored
|
|
}
|
|
|
|
inline void match_absent(const row& row, const schema& s, bytes col) {
|
|
auto cdef = s.get_column_definition(col);
|
|
BOOST_REQUIRE(row.find_cell(cdef->id) == nullptr);
|
|
}
|
|
|
|
inline collection_type_impl::mutation
|
|
match_collection(const row& row, const schema& s, bytes col, const tombstone& t) {
|
|
auto cdef = s.get_column_definition(col);
|
|
|
|
BOOST_CHECK_NO_THROW(row.cell_at(cdef->id));
|
|
auto c = row.cell_at(cdef->id).as_collection_mutation();
|
|
auto ctype = static_pointer_cast<const collection_type_impl>(cdef->type);
|
|
auto&& mut = ctype->deserialize_mutation_form(c);
|
|
BOOST_REQUIRE(mut.tomb == t);
|
|
return mut.materialize();
|
|
}
|
|
|
|
template <status Status>
|
|
inline void match_collection_element(const std::pair<bytes, atomic_cell>& element, const bytes_opt& col, const bytes_opt& expected_serialized_value) {
|
|
if (col) {
|
|
BOOST_REQUIRE(element.first == *col);
|
|
}
|
|
|
|
if (check_status_and_done(element.second, Status)) {
|
|
return;
|
|
}
|
|
|
|
// For simplicity, we will have all set elements in our schema presented as
|
|
// bytes - which serializes to itself. Then we don't need to meddle with
|
|
// the schema for the set type, and is enough for the purposes of this
|
|
// test.
|
|
if (expected_serialized_value) {
|
|
BOOST_REQUIRE(element.second.value() == *expected_serialized_value);
|
|
}
|
|
}
|
|
|
|
class test_setup {
|
|
file _f;
|
|
std::function<future<> (directory_entry de)> _walker;
|
|
sstring _path;
|
|
subscription<directory_entry> _listing;
|
|
|
|
static sstring& path() {
|
|
static sstring _p = "tests/sstables/tests-temporary";
|
|
return _p;
|
|
};
|
|
|
|
public:
|
|
test_setup(file f, sstring path)
|
|
: _f(std::move(f))
|
|
, _path(path)
|
|
, _listing(_f.list_directory([this] (directory_entry de) { return _remove(de); })) {
|
|
}
|
|
~test_setup() {
|
|
_f.close().finally([save = _f] {});
|
|
}
|
|
protected:
|
|
future<> _create_directory(sstring name) {
|
|
return engine().make_directory(name);
|
|
}
|
|
|
|
future<> _remove(directory_entry de) {
|
|
sstring t = _path + "/" + de.name;
|
|
return engine().file_type(t).then([t] (std::experimental::optional<directory_entry_type> det) {
|
|
auto f = make_ready_future<>();
|
|
|
|
if (!det) {
|
|
throw std::runtime_error("Can't determine file type\n");
|
|
} else if (det == directory_entry_type::directory) {
|
|
f = empty_test_dir(t);
|
|
}
|
|
return f.then([t] {
|
|
return engine().remove_file(t);
|
|
});
|
|
});
|
|
}
|
|
future<> done() { return _listing.done(); }
|
|
|
|
static future<> empty_test_dir(sstring p = path()) {
|
|
return engine().open_directory(p).then([p] (file f) {
|
|
auto l = make_lw_shared<test_setup>(std::move(f), p);
|
|
return l->done().then([l] { });
|
|
});
|
|
}
|
|
public:
|
|
static future<> create_empty_test_dir(sstring p = path()) {
|
|
return engine().make_directory(p).then_wrapped([p] (future<> f) {
|
|
try {
|
|
f.get();
|
|
// it's fine if the directory exists, just shut down the exceptional future message
|
|
} catch (std::exception& e) {}
|
|
return empty_test_dir(p);
|
|
});
|
|
}
|
|
|
|
static future<> do_with_test_directory(std::function<future<> ()>&& fut, sstring p = path()) {
|
|
return test_setup::create_empty_test_dir(p).then([fut = std::move(fut), p] () mutable {
|
|
return fut();
|
|
}).finally([p] {
|
|
return test_setup::empty_test_dir(p).then([p] {
|
|
return engine().remove_file(p);
|
|
});
|
|
});
|
|
}
|
|
};
|
|
}
|
|
|
|
|
|
struct test_mutation_reader final : public ::mutation_reader::impl {
|
|
sstables::shared_sstable _sst;
|
|
sstables::mutation_reader _rd;
|
|
public:
|
|
test_mutation_reader(sstables::shared_sstable sst, sstables::mutation_reader rd)
|
|
: _sst(std::move(sst)), _rd(std::move(rd)) {}
|
|
virtual future<streamed_mutation_opt> operator()() override {
|
|
return _rd.read();
|
|
}
|
|
virtual future<> fast_forward_to(const dht::partition_range& pr) override {
|
|
return _rd.fast_forward_to(pr);
|
|
}
|
|
};
|
|
|
|
inline
|
|
::mutation_reader as_mutation_reader(sstables::shared_sstable sst, sstables::mutation_reader rd) {
|
|
return make_mutation_reader<test_mutation_reader>(std::move(sst), std::move(rd));
|
|
}
|
|
|
|
inline
|
|
::mutation_source as_mutation_source(lw_shared_ptr<sstables::sstable> sst) {
|
|
return mutation_source([sst] (schema_ptr s,
|
|
const dht::partition_range& range,
|
|
const query::partition_slice& slice,
|
|
const io_priority_class& pc,
|
|
tracing::trace_state_ptr trace_ptr,
|
|
streamed_mutation::forwarding fwd) mutable {
|
|
return as_mutation_reader(sst, sst->read_range_rows(s, range, slice, pc, fwd));
|
|
});
|
|
}
|