I/O errors cannot be fixed by Scylla the only solution is to shutdown the database communications. Signed-off-by: Benoît Canet <benoit@scylladb.com> Message-Id: <1458154098-9977-1-git-send-email-benoit@scylladb.com>
212 lines
9.7 KiB
C++
212 lines
9.7 KiB
C++
/*
|
|
* Copyright 2015 Cloudius Systems
|
|
*/
|
|
|
|
/*
|
|
* 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/>.
|
|
*/
|
|
|
|
#define BOOST_TEST_DYN_LINK
|
|
|
|
#include <seastar/core/thread.hh>
|
|
#include <seastar/tests/test-utils.hh>
|
|
#include "query-result-writer.hh"
|
|
|
|
#include "tests/cql_test_env.hh"
|
|
#include "tests/mutation_source_test.hh"
|
|
#include "tests/result_set_assertions.hh"
|
|
#include "service/storage_proxy.hh"
|
|
#include "partition_slice_builder.hh"
|
|
#include "schema_builder.hh"
|
|
|
|
#include "disk-error-handler.hh"
|
|
|
|
thread_local disk_error_signal_type commit_error;
|
|
thread_local disk_error_signal_type general_disk_error;
|
|
|
|
static query::result to_data_query_result(mutation_reader& reader, const query::partition_slice& slice) {
|
|
query::result::builder builder(slice, query::result_request::only_result);
|
|
auto now = gc_clock::now();
|
|
while (true) {
|
|
mutation_opt mo = reader().get0();
|
|
if (!mo) {
|
|
break;
|
|
}
|
|
auto pb = builder.add_partition(*mo->schema(), mo->key());
|
|
mo->partition().query(pb, *mo->schema(), now);
|
|
}
|
|
return builder.build();
|
|
}
|
|
|
|
static query::result_set to_result_set(schema_ptr s, mutation_reader& reader) {
|
|
auto slice = partition_slice_builder(*s).build();
|
|
return query::result_set::from_raw_result(s, slice, to_data_query_result(reader, slice));
|
|
}
|
|
|
|
SEASTAR_TEST_CASE(test_make_local_reader) {
|
|
return do_with_cql_env([](cql_test_env& e) {
|
|
return seastar::async([&] {
|
|
e.execute_cql("create keyspace ks2 with replication = { 'class' : 'SimpleStrategy', 'replication_factor' : 1 };").get();
|
|
e.execute_cql("create table ks2.cf (k blob, v int, primary key (k));").get();
|
|
e.execute_cql(
|
|
"begin unlogged batch \n"
|
|
" insert into ks2.cf (k, v) values (0x01, 0); \n"
|
|
" insert into ks2.cf (k, v) values (0x02, 0); \n"
|
|
" insert into ks2.cf (k, v) values (0x03, 0); \n"
|
|
" insert into ks2.cf (k, v) values (0x04, 0); \n"
|
|
" insert into ks2.cf (k, v) values (0x05, 0); \n"
|
|
"apply batch;").get();
|
|
|
|
auto s = e.local_db().find_schema("ks2", "cf");
|
|
|
|
{
|
|
auto reader = service::get_storage_proxy().local().make_local_reader(s->id(), query::full_partition_range);
|
|
assert_that(to_result_set(s, reader))
|
|
.has_size(5)
|
|
.has(a_row().with_column(bytes("k"), data_value(bytes("\01"))))
|
|
.has(a_row().with_column(bytes("k"), data_value(bytes("\02"))))
|
|
.has(a_row().with_column(bytes("k"), data_value(bytes("\03"))))
|
|
.has(a_row().with_column(bytes("k"), data_value(bytes("\04"))))
|
|
.has(a_row().with_column(bytes("k"), data_value(bytes("\05"))));
|
|
}
|
|
|
|
{
|
|
auto reader = service::get_storage_proxy().local().make_local_reader(s->id(),
|
|
query::partition_range(
|
|
{dht::ring_position(dht::minimum_token(), dht::ring_position::token_bound::start)},
|
|
{dht::ring_position(dht::maximum_token(), dht::ring_position::token_bound::end)}));
|
|
assert_that(to_result_set(s, reader))
|
|
.has_size(5)
|
|
.has(a_row().with_column(bytes("k"), data_value(bytes("\01"))))
|
|
.has(a_row().with_column(bytes("k"), data_value(bytes("\02"))))
|
|
.has(a_row().with_column(bytes("k"), data_value(bytes("\03"))))
|
|
.has(a_row().with_column(bytes("k"), data_value(bytes("\04"))))
|
|
.has(a_row().with_column(bytes("k"), data_value(bytes("\05"))));
|
|
}
|
|
|
|
{
|
|
auto reader = service::get_storage_proxy().local().make_local_reader(s->id(),
|
|
query::partition_range(
|
|
{dht::ring_position(dht::minimum_token(), dht::ring_position::token_bound::start)},
|
|
{dht::ring_position(dht::minimum_token(), dht::ring_position::token_bound::start)}));
|
|
assert_that(to_result_set(s, reader)).is_empty();
|
|
}
|
|
|
|
{
|
|
auto reader = service::get_storage_proxy().local().make_local_reader(s->id(),
|
|
query::partition_range(
|
|
{dht::ring_position(dht::maximum_token(), dht::ring_position::token_bound::start)},
|
|
{dht::ring_position(dht::maximum_token(), dht::ring_position::token_bound::start)}));
|
|
assert_that(to_result_set(s, reader)).is_empty();
|
|
}
|
|
});
|
|
});
|
|
}
|
|
|
|
// Returns random keys sorted in ring order.
|
|
// The schema must have a single bytes_type partition key column.
|
|
static std::vector<dht::ring_position> make_ring(schema_ptr s, int n_keys) {
|
|
std::vector<dht::ring_position> ring;
|
|
for (int i = 0; i < 10; ++i) {
|
|
auto pk = partition_key::from_single_value(*s, to_bytes(sprint("key%d", i)));
|
|
ring.emplace_back(dht::global_partitioner().decorate_key(*s, pk));
|
|
}
|
|
std::sort(ring.begin(), ring.end(), dht::ring_position_less_comparator(*s));
|
|
return ring;
|
|
}
|
|
|
|
SEASTAR_TEST_CASE(test_get_restricted_ranges) {
|
|
return do_with_cql_env([](cql_test_env& e) {
|
|
return seastar::async([] {
|
|
auto s = schema_builder("ks", "cf")
|
|
.with_column("pk", bytes_type, column_kind::partition_key)
|
|
.with_column("v", bytes_type, column_kind::regular_column)
|
|
.build();
|
|
|
|
std::vector<dht::ring_position> ring = make_ring(s, 10);
|
|
|
|
auto check = [&s](locator::token_metadata& tm, query::partition_range input,
|
|
std::vector<query::partition_range> expected) {
|
|
auto actual = service::get_restricted_ranges(tm, *s, input);
|
|
if (!std::equal(actual.begin(), actual.end(), expected.begin(), [&s](auto&& r1, auto&& r2) {
|
|
return r1.equal(r2, dht::ring_position_comparator(*s));
|
|
})) {
|
|
BOOST_FAIL(sprint("Ranges differ, expected %s but got %s", expected, actual));
|
|
}
|
|
};
|
|
|
|
{
|
|
// Ring with minimum token
|
|
locator::token_metadata tm;
|
|
tm.update_normal_token(dht::minimum_token(), {"10.0.0.1"});
|
|
|
|
check(tm, query::partition_range::make_singular(ring[0]), {
|
|
query::partition_range::make_singular(ring[0])
|
|
});
|
|
|
|
check(tm, query::partition_range({ring[2]}, {ring[3]}), {
|
|
query::partition_range({ring[2]}, {ring[3]})
|
|
});
|
|
|
|
check(tm, query::partition_range({ring[4]}, {ring[2]}), {
|
|
query::partition_range({ring[4]}, {}),
|
|
query::partition_range({}, {dht::ring_position::ending_at(dht::minimum_token())}),
|
|
query::partition_range({{dht::ring_position::ending_at(dht::minimum_token()), false}}, {ring[2]})
|
|
});
|
|
}
|
|
|
|
{
|
|
locator::token_metadata tm;
|
|
tm.update_normal_token(ring[2].token(), {"10.0.0.1"});
|
|
tm.update_normal_token(ring[5].token(), {"10.0.0.2"});
|
|
|
|
check(tm, query::partition_range::make_singular(ring[0]), {
|
|
query::partition_range::make_singular(ring[0])
|
|
});
|
|
|
|
check(tm, query::partition_range::make_singular(ring[2]), {
|
|
query::partition_range::make_singular(ring[2])
|
|
});
|
|
|
|
check(tm, query::partition_range({{dht::ring_position::ending_at(ring[2].token()), false}}, {ring[3]}), {
|
|
query::partition_range({{dht::ring_position::ending_at(ring[2].token()), false}}, {ring[3]})
|
|
});
|
|
|
|
check(tm, query::partition_range({ring[3]}, {ring[4]}), {
|
|
query::partition_range({ring[3]}, {ring[4]})
|
|
});
|
|
|
|
check(tm, query::partition_range({ring[2]}, {ring[3]}), {
|
|
query::partition_range({ring[2]}, {dht::ring_position::ending_at(ring[2].token())}),
|
|
query::partition_range({{dht::ring_position::ending_at(ring[2].token()), false}}, {ring[3]})
|
|
});
|
|
|
|
check(tm, query::partition_range({{ring[2], false}}, {ring[3]}), {
|
|
query::partition_range({{ring[2], false}}, {dht::ring_position::ending_at(ring[2].token())}),
|
|
query::partition_range({{dht::ring_position::ending_at(ring[2].token()), false}}, {ring[3]})
|
|
});
|
|
|
|
check(tm, query::partition_range({ring[4]}, {ring[3]}), {
|
|
query::partition_range({ring[4]}, {dht::ring_position::ending_at(ring[5].token())}),
|
|
query::partition_range({{dht::ring_position::ending_at(ring[5].token()), false}}, {}),
|
|
query::partition_range({}, {dht::ring_position::ending_at(ring[2].token())}),
|
|
query::partition_range({{dht::ring_position::ending_at(ring[2].token()), false}}, {ring[3]}),
|
|
});
|
|
}
|
|
});
|
|
});
|
|
}
|