thin-provisioning-tools/unit-tests/btree_damage_visitor_t.cc

479 lines
11 KiB
C++
Raw Normal View History

2013-05-08 16:30:24 +05:30
#include "gmock/gmock.h"
#include "test_utils.h"
#include "persistent-data/data-structures/btree_damage_visitor.h"
2013-05-08 21:08:38 +05:30
#include "persistent-data/endian_utils.h"
#include "persistent-data/space-maps/core.h"
#include "persistent-data/transaction_manager.h"
2013-05-08 16:30:24 +05:30
using namespace std;
using namespace persistent_data;
using namespace test;
using namespace testing;
//----------------------------------------------------------------
namespace {
block_address const BLOCK_SIZE = 4096;
block_address const NR_BLOCKS = 102400;
2013-05-09 18:01:04 +05:30
block_address const SUPERBLOCK = 0;
2013-05-08 16:30:24 +05:30
2013-05-08 21:08:38 +05:30
struct thing {
thing(uint32_t x_ = 0, uint64_t y_ = 0)
: x(x_),
2013-05-09 18:01:04 +05:30
y(y_) {
}
bool operator ==(thing const &rhs) const {
return (x == rhs.x) && (y == rhs.y);
2013-05-09 18:01:04 +05:30
}
uint32_t x;
2013-05-08 21:08:38 +05:30
uint64_t y;
};
struct thing_disk {
le32 x;
2013-05-08 21:08:38 +05:30
le64 y;
2013-05-14 15:02:28 +05:30
// To ensure we have fewer entries per leaf, and thus more internal nodes.
char padding[200];
2013-05-08 21:08:38 +05:30
};
struct thing_traits {
typedef thing_disk disk_type;
typedef thing value_type;
typedef persistent_data::no_op_ref_counter<value_type> ref_counter;
static void unpack(thing_disk const &disk, thing &value) {
value.x = to_cpu<uint32_t>(disk.x);
2013-05-08 21:08:38 +05:30
value.y = to_cpu<uint64_t>(disk.y);
}
static void pack(thing const &value, thing_disk &disk) {
disk.x = to_disk<le32>(value.x);
2013-05-08 21:08:38 +05:30
disk.y = to_disk<le64>(value.y);
}
};
template <uint32_t Levels, typename ValueTraits>
class btree_layout : public btree<Levels, ValueTraits>::visitor {
public:
struct node_info {
typedef boost::shared_ptr<node_info> ptr;
bool leaf;
unsigned depth;
unsigned level;
block_address b;
range<uint64_t> keys;
};
typedef btree_detail::node_location node_location;
typedef btree<Levels, ValueTraits> tree;
typedef boost::shared_ptr<btree_layout> ptr;
virtual bool visit_internal(node_location const &loc,
typename tree::internal_node const &n) {
record_node(false, loc, n);
return true;
}
virtual bool visit_internal_leaf(node_location const &loc,
typename tree::internal_node const &n) {
record_node(true, loc, n);
return true;
}
virtual bool visit_leaf(node_location const &loc,
typename tree::leaf_node const &n) {
record_node(true, loc, n);
return true;
}
virtual void visit_complete() {
}
vector<typename node_info::ptr> const &get_nodes() const {
return nodes_;
}
node_info const &random_node() const {
if (nodes_.empty())
throw runtime_error("no nodes in btree");
return *nodes_[::random() % nodes_.size()];
}
private:
// We rely on the visit order being depth first, lowest to highest.
template <typename N>
void record_node(bool leaf, node_location const &loc, N const &n) {
typename node_info::ptr ni(new node_info);
ni->leaf = leaf;
ni->depth = loc.depth;
ni->level = loc.level;
ni->b = n.get_location();
if (n.get_nr_entries())
ni->keys = range<uint64_t>(n.key_at(0));
else {
if (loc.key)
ni->keys = range<uint64_t>(*loc.key);
else
ni->keys = range<uint64_t>();
}
if (last_node_at_depth_.size() > loc.depth) {
typename node_info::ptr &last = last_node_at_depth_[loc.depth];
last->keys.end_ = ni->keys.begin_;
last_node_at_depth_[loc.depth] = ni;
} else
last_node_at_depth_.push_back(ni);
nodes_.push_back(ni);
}
vector<typename node_info::ptr> nodes_;
vector<typename node_info::ptr> last_node_at_depth_;
};
2013-05-08 21:08:38 +05:30
class value_visitor_mock {
public:
MOCK_METHOD1(visit, void(thing const &));
};
class damage_visitor_mock {
public:
MOCK_METHOD1(visit, void(btree_detail::damage const &));
};
2013-05-08 16:30:24 +05:30
class BTreeDamageVisitorTests : public Test {
public:
BTreeDamageVisitorTests()
2013-05-08 21:08:38 +05:30
: bm_(create_bm<BLOCK_SIZE>(NR_BLOCKS)),
2013-05-09 18:01:04 +05:30
sm_(setup_core_map()),
2013-05-08 21:08:38 +05:30
tm_(new transaction_manager(bm_, sm_)),
2013-05-09 18:01:04 +05:30
tree_(new btree<1, thing_traits>(tm_, rc_)) {
}
space_map::ptr setup_core_map() {
space_map::ptr sm(new core_map(NR_BLOCKS));
sm->inc(SUPERBLOCK);
return sm;
}
void commit() {
block_manager<>::write_ref superblock(bm_->superblock(SUPERBLOCK));
2013-05-08 21:08:38 +05:30
}
2013-05-09 18:01:04 +05:30
void trash_block(block_address b) {
2013-05-08 21:08:38 +05:30
::test::zero_block(bm_, b);
2013-05-08 16:30:24 +05:30
}
2013-05-09 18:01:04 +05:30
void insert_values(unsigned nr) {
for (unsigned i = 0; i < nr; i++) {
uint64_t key[1] = {i};
thing value(i, i + 1234);
2013-05-09 18:01:04 +05:30
tree_->insert(key, value);
}
}
void expect_no_values() {
EXPECT_CALL(value_visitor_, visit(_)).Times(0);
}
void expect_value_range(uint64_t begin, uint64_t end) {
while (begin < end) {
EXPECT_CALL(value_visitor_, visit(Eq(thing(begin, begin + 1234)))).Times(1);
begin++;
}
}
2013-05-09 18:01:04 +05:30
void expect_nr_values(unsigned nr) {
expect_value_range(0, nr);
2013-05-09 18:01:04 +05:30
}
void expect_value(unsigned n) {
EXPECT_CALL(value_visitor_, visit(Eq(thing(n, n + 1234)))).Times(1);
2013-05-09 18:01:04 +05:30
}
void expect_no_damage() {
EXPECT_CALL(damage_visitor_, visit(_)).Times(0);
}
void expect_damage(unsigned level, range<uint64_t> keys) {
EXPECT_CALL(damage_visitor_, visit(Eq(damage(level, keys, "foo")))).Times(1);
}
typedef typename btree_layout<1, thing_traits>::node_info node_info;
vector<typename node_info::ptr> const &get_nodes() {
if (!nodes_) {
btree_layout<1, thing_traits> layout;
tree_->visit_depth_first(layout);
nodes_ = layout.get_nodes(); // expensive copy, but it's only a test
}
return *nodes_;
}
unsigned node_index_of_nth_leaf(vector<typename node_info::ptr> const &nodes,
unsigned target) const {
unsigned i;
for (i = 0; i < nodes.size(); i++)
if (nodes[i]->leaf) {
if (!target)
break;
else
target--;
}
if (target)
throw runtime_error("not that many leaf nodes");
return i;
}
2013-05-14 15:02:28 +05:30
// FIXME: remove duplication with above
unsigned node_index_of_nth_internal(vector<typename node_info::ptr> const &nodes,
unsigned target) const {
unsigned i;
for (i = 0; i < nodes.size(); i++)
if (!nodes[i]->leaf) {
if (!target)
break;
else
target--;
}
if (target)
throw runtime_error("not that many internal nodes");
return i;
}
unsigned get_nr_leaf_nodes() {
vector<typename node_info::ptr> const &nodes = get_nodes();
unsigned nr_leaf = 0;
for (unsigned i = 0; i < nodes.size(); i++)
if (nodes[i]->leaf)
nr_leaf++;
return nr_leaf;
}
2013-05-14 15:02:28 +05:30
// FIXME: remove duplication
unsigned get_nr_internal_nodes() {
vector<typename node_info::ptr> const &nodes = get_nodes();
unsigned nr_internal = 0;
for (unsigned i = 0; i < nodes.size(); i++)
if (!nodes[i]->leaf)
nr_internal++;
cerr << "internal nodes: " << nr_internal << endl;
return nr_internal;
}
node_info::ptr get_leaf_node(unsigned index) {
vector<typename node_info::ptr> const &nodes = get_nodes();
unsigned ni = node_index_of_nth_leaf(nodes, index);
return nodes[ni];
}
node_info::ptr random_leaf_node() {
vector<typename node_info::ptr> const &nodes = get_nodes();
2013-05-14 15:02:28 +05:30
unsigned nr_leaf = get_nr_leaf_nodes();
unsigned target = random() % nr_leaf;
unsigned i = node_index_of_nth_leaf(nodes, target);
return nodes[i];
}
2013-05-14 15:02:28 +05:30
node_info::ptr random_internal_node() {
vector<typename node_info::ptr> const &nodes = get_nodes();
unsigned nr_internal = get_nr_internal_nodes();
unsigned target = random() % nr_internal;
unsigned i = node_index_of_nth_internal(nodes, target);
return nodes[i];
}
vector<node_info::ptr> get_random_leaf_nodes(unsigned count) {
vector<node_info::ptr> const &nodes = get_nodes();
2013-05-14 15:02:28 +05:30
unsigned nr_leaf = get_nr_leaf_nodes();
unsigned target = random() % (nr_leaf - count);
unsigned i = node_index_of_nth_leaf(nodes, target);
vector<node_info::ptr> v;
for (; i < nodes.size() && count; i++) {
if (nodes[i]->leaf) {
count--;
v.push_back(nodes[i]);
}
}
return v;
}
void trash_blocks(vector<node_info::ptr> const &blocks) {
for (unsigned i = 0; i < blocks.size(); i++)
trash_block(blocks[i]->b);
}
2013-05-09 18:01:04 +05:30
void run() {
// We must commit before we do the test to ensure
// all the block numbers and checksums are written
// to the btree nodes.
commit();
block_counter counter;
btree_damage_visitor<value_visitor_mock, damage_visitor_mock, 1, thing_traits>
visitor(counter, value_visitor_, damage_visitor_);
tree_->visit_depth_first(visitor);
}
2013-05-08 16:30:24 +05:30
with_temp_directory dir_;
block_manager<>::ptr bm_;
2013-05-08 21:08:38 +05:30
space_map::ptr sm_;
transaction_manager::ptr tm_;
thing_traits::ref_counter rc_;
2013-05-09 18:01:04 +05:30
btree<1, thing_traits>::ptr tree_;
2013-05-08 21:08:38 +05:30
optional<vector<typename node_info::ptr> > nodes_;
2013-05-08 21:08:38 +05:30
value_visitor_mock value_visitor_;
damage_visitor_mock damage_visitor_;
2013-05-08 16:30:24 +05:30
};
}
//----------------------------------------------------------------
TEST_F(BTreeDamageVisitorTests, an_empty_tree)
2013-05-08 16:30:24 +05:30
{
2013-05-09 18:01:04 +05:30
expect_no_values();
expect_no_damage();
2013-05-08 21:08:38 +05:30
2013-05-09 18:01:04 +05:30
run();
2013-05-08 21:08:38 +05:30
}
TEST_F(BTreeDamageVisitorTests, tree_with_a_trashed_root)
2013-05-08 21:08:38 +05:30
{
2013-05-09 18:01:04 +05:30
trash_block(tree_->get_root());
2013-05-08 21:08:38 +05:30
2013-05-09 18:01:04 +05:30
expect_no_values();
expect_damage(0, range<uint64_t>(0ull));
2013-05-08 21:08:38 +05:30
2013-05-09 18:01:04 +05:30
run();
2013-05-08 16:30:24 +05:30
}
TEST_F(BTreeDamageVisitorTests, populated_tree_with_no_damage)
2013-05-09 18:01:04 +05:30
{
insert_values(10000);
2013-05-09 18:01:04 +05:30
expect_nr_values(10000);
2013-05-09 18:01:04 +05:30
expect_no_damage();
run();
}
2013-05-08 21:08:38 +05:30
TEST_F(BTreeDamageVisitorTests, populated_tree_with_a_damaged_leaf_node)
{
insert_values(10000);
commit();
node_info::ptr n = random_leaf_node();
trash_block(n->b);
expect_value_range(0, *n->keys.begin_);
expect_value_range(*n->keys.end_, 10000);
expect_damage(0, n->keys);
run();
}
TEST_F(BTreeDamageVisitorTests, populated_tree_with_a_sequence_of_damaged_leaf_nodes)
{
insert_values(10000);
commit();
unsigned const COUNT = 5;
vector<node_info::ptr> nodes = get_random_leaf_nodes(COUNT);
trash_blocks(nodes);
2013-05-14 15:02:28 +05:30
block_address begin = *nodes[0]->keys.begin_;
block_address end = *nodes[COUNT - 1]->keys.end_;
expect_value_range(0, *nodes[0]->keys.begin_);
expect_value_range(*nodes[COUNT - 1]->keys.end_, 10000);
expect_damage(0, range<block_address>(begin, end));
run();
}
TEST_F(BTreeDamageVisitorTests, damaged_first_leaf)
{
insert_values(10000);
commit();
2013-05-14 15:02:28 +05:30
node_info::ptr n = get_leaf_node(0);
2013-05-14 15:02:28 +05:30
block_address end = *n->keys.end_;
trash_block(n->b);
expect_damage(0, range<block_address>(0ull, end));
expect_value_range(end, 10000);
run();
}
TEST_F(BTreeDamageVisitorTests, damaged_last_leaf)
{
insert_values(10000);
commit();
2013-05-14 15:02:28 +05:30
node_info::ptr n = get_leaf_node(get_nr_leaf_nodes() - 1);
block_address begin = *n->keys.begin_;
trash_block(n->b);
expect_value_range(0, begin);
expect_damage(0, range<block_address>(begin));
run();
}
TEST_F(BTreeDamageVisitorTests, damaged_internal)
{
insert_values(10000);
commit();
2013-05-14 15:02:28 +05:30
node_info::ptr n = random_internal_node();
2013-05-14 15:02:28 +05:30
block_address begin = *n->keys.begin_;
block_address end = *n->keys.end_;
trash_block(n->b);
expect_value_range(0, begin);
2013-05-14 15:02:28 +05:30
expect_damage(0, range<block_address>(begin, end));
expect_value_range(end, 10000);
run();
}
2013-05-08 16:30:24 +05:30
//----------------------------------------------------------------