emo/thin-provisioning-tools
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Show the block address of error nodes

Browse Source
This commit is contained in:
Ming-Hung Tsai 2016-02-27 01:28:41 +08:00
parent 11cd796652
commit b1d4b9f7c8
1 changed files with 14 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
persistent-data/data-structures/btree_damage_visitor.h
View File

@ -300,14 +300,16 @@ namespace persistent_data {
size_t elt_size = sizeof(uint64_t) + n.get_value_size(); size_t elt_size = sizeof(uint64_t) + n.get_value_size();
if (elt_size * n.get_max_entries() + sizeof(node_header) > MD_BLOCK_SIZE) { if (elt_size * n.get_max_entries() + sizeof(node_header) > MD_BLOCK_SIZE) {
std::ostringstream out; std::ostringstream out;
out << "max entries too large: " << n.get_max_entries(); out << "max entries too large: " << n.get_max_entries()
<< " (block " << n.get_location() << ")";
report_damage(out.str()); report_damage(out.str());
return false; return false;
} }
if (n.get_max_entries() % 3) { if (n.get_max_entries() % 3) {
std::ostringstream out; std::ostringstream out;
out << "max entries is not divisible by 3: " << n.get_max_entries(); out << "max entries is not divisible by 3: " << n.get_max_entries()
<< " (block " << n.get_location() << ")";
report_damage(out.str()); report_damage(out.str());
return false; return false;
} }
@ -321,7 +323,8 @@ namespace persistent_data {
std::ostringstream out; std::ostringstream out;
out << "bad nr_entries: " out << "bad nr_entries: "
<< n.get_nr_entries() << " < " << n.get_nr_entries() << " < "
<< n.get_max_entries(); << n.get_max_entries()
<< " (block " << n.get_location() << ")";
report_damage(out.str()); report_damage(out.str());
return false; return false;
} }
@ -333,7 +336,8 @@ namespace persistent_data {
<< n.get_nr_entries() << n.get_nr_entries()
<< ", expected at least " << ", expected at least "
<< min << min
<< "(max_entries = " << n.get_max_entries() << ")"; << " (block " << n.get_location()
<< ", max_entries = " << n.get_max_entries() << ")";
report_damage(out.str()); report_damage(out.str());
return false; return false;
} }
@ -354,7 +358,8 @@ namespace persistent_data {
uint64_t k = n.key_at(i); uint64_t k = n.key_at(i);
if (k <= last_key) { if (k <= last_key) {
ostringstream out; ostringstream out;
out << "keys are out of order, " << k << " <= " << last_key; out << "keys are out of order, " << k << " <= " << last_key
<< " (block " << n.get_location() << ")";
report_damage(out.str()); report_damage(out.str());
return false; return false;
} }
@ -372,7 +377,8 @@ namespace persistent_data {
if (*key > n.key_at(0)) { if (*key > n.key_at(0)) {
ostringstream out; ostringstream out;
out << "parent key mismatch: parent was " << *key out << "parent key mismatch: parent was " << *key
<< ", but lowest in node was " << n.key_at(0); << ", but lowest in node was " << n.key_at(0)
<< " (block " << n.get_location() << ")";
report_damage(out.str()); report_damage(out.str());
return false; return false;
} }
@ -388,7 +394,8 @@ namespace persistent_data {
if (last_leaf_key_[level] && *last_leaf_key_[level] >= n.key_at(0)) { if (last_leaf_key_[level] && *last_leaf_key_[level] >= n.key_at(0)) {
ostringstream out; ostringstream out;
out << "the last key of the previous leaf was " << *last_leaf_key_[level] out << "the last key of the previous leaf was " << *last_leaf_key_[level]
<< " and the first key of this leaf is " << n.key_at(0); << " and the first key of this leaf is " << n.key_at(0)
<< " (block " << n.get_location() << ")";
report_damage(out.str()); report_damage(out.str());
return false; return false;
} }