|
|
@ -330,6 +330,7 @@ class CfConsistencyStressTest : public StressTest { |
|
|
|
// This `ReadOptions` is for validation purposes. Ignore
|
|
|
|
// This `ReadOptions` is for validation purposes. Ignore
|
|
|
|
// `FLAGS_rate_limit_user_ops` to avoid slowing any validation.
|
|
|
|
// `FLAGS_rate_limit_user_ops` to avoid slowing any validation.
|
|
|
|
ReadOptions options(FLAGS_verify_checksum, true); |
|
|
|
ReadOptions options(FLAGS_verify_checksum, true); |
|
|
|
|
|
|
|
|
|
|
|
// We must set total_order_seek to true because we are doing a SeekToFirst
|
|
|
|
// We must set total_order_seek to true because we are doing a SeekToFirst
|
|
|
|
// on a column family whose memtables may support (by default) prefix-based
|
|
|
|
// on a column family whose memtables may support (by default) prefix-based
|
|
|
|
// iterator. In this case, NewIterator with options.total_order_seek being
|
|
|
|
// iterator. In this case, NewIterator with options.total_order_seek being
|
|
|
@ -338,54 +339,73 @@ class CfConsistencyStressTest : public StressTest { |
|
|
|
// iterate the memtable using this iterator any more, although the memtable
|
|
|
|
// iterate the memtable using this iterator any more, although the memtable
|
|
|
|
// contains the most up-to-date key-values.
|
|
|
|
// contains the most up-to-date key-values.
|
|
|
|
options.total_order_seek = true; |
|
|
|
options.total_order_seek = true; |
|
|
|
const auto ss_deleter = [this](const Snapshot* ss) { |
|
|
|
|
|
|
|
db_->ReleaseSnapshot(ss); |
|
|
|
ManagedSnapshot snapshot_guard(db_); |
|
|
|
}; |
|
|
|
options.snapshot = snapshot_guard.snapshot(); |
|
|
|
std::unique_ptr<const Snapshot, decltype(ss_deleter)> snapshot_guard( |
|
|
|
|
|
|
|
db_->GetSnapshot(), ss_deleter); |
|
|
|
const size_t num = column_families_.size(); |
|
|
|
options.snapshot = snapshot_guard.get(); |
|
|
|
|
|
|
|
assert(thread != nullptr); |
|
|
|
std::vector<std::unique_ptr<Iterator>> iters; |
|
|
|
auto shared = thread->shared; |
|
|
|
iters.reserve(num); |
|
|
|
std::vector<std::unique_ptr<Iterator>> iters(column_families_.size()); |
|
|
|
|
|
|
|
for (size_t i = 0; i != column_families_.size(); ++i) { |
|
|
|
for (size_t i = 0; i < num; ++i) { |
|
|
|
iters[i].reset(db_->NewIterator(options, column_families_[i])); |
|
|
|
iters.emplace_back(db_->NewIterator(options, column_families_[i])); |
|
|
|
} |
|
|
|
iters.back()->SeekToFirst(); |
|
|
|
for (auto& iter : iters) { |
|
|
|
|
|
|
|
iter->SeekToFirst(); |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
size_t num = column_families_.size(); |
|
|
|
|
|
|
|
assert(num == iters.size()); |
|
|
|
|
|
|
|
std::vector<Status> statuses(num, Status::OK()); |
|
|
|
std::vector<Status> statuses(num, Status::OK()); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
assert(thread); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
auto shared = thread->shared; |
|
|
|
|
|
|
|
assert(shared); |
|
|
|
|
|
|
|
|
|
|
|
do { |
|
|
|
do { |
|
|
|
if (shared->HasVerificationFailedYet()) { |
|
|
|
if (shared->HasVerificationFailedYet()) { |
|
|
|
break; |
|
|
|
break; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
size_t valid_cnt = 0; |
|
|
|
size_t valid_cnt = 0; |
|
|
|
size_t idx = 0; |
|
|
|
|
|
|
|
for (auto& iter : iters) { |
|
|
|
for (size_t i = 0; i < num; ++i) { |
|
|
|
|
|
|
|
const auto& iter = iters[i]; |
|
|
|
|
|
|
|
assert(iter); |
|
|
|
|
|
|
|
|
|
|
|
if (iter->Valid()) { |
|
|
|
if (iter->Valid()) { |
|
|
|
|
|
|
|
const WideColumns expected_columns = GenerateExpectedWideColumns( |
|
|
|
|
|
|
|
GetValueBase(iter->value()), iter->value()); |
|
|
|
|
|
|
|
if (iter->columns() != expected_columns) { |
|
|
|
|
|
|
|
statuses[i] = Status::Corruption( |
|
|
|
|
|
|
|
"Value and columns inconsistent", |
|
|
|
|
|
|
|
DebugString(iter->value(), iter->columns(), expected_columns)); |
|
|
|
|
|
|
|
} else { |
|
|
|
++valid_cnt; |
|
|
|
++valid_cnt; |
|
|
|
|
|
|
|
} |
|
|
|
} else { |
|
|
|
} else { |
|
|
|
statuses[idx] = iter->status(); |
|
|
|
statuses[i] = iter->status(); |
|
|
|
} |
|
|
|
} |
|
|
|
++idx; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
if (valid_cnt == 0) { |
|
|
|
if (valid_cnt == 0) { |
|
|
|
Status status; |
|
|
|
for (size_t i = 0; i < num; ++i) { |
|
|
|
for (size_t i = 0; i != num; ++i) { |
|
|
|
|
|
|
|
const auto& s = statuses[i]; |
|
|
|
const auto& s = statuses[i]; |
|
|
|
if (!s.ok()) { |
|
|
|
if (!s.ok()) { |
|
|
|
status = s; |
|
|
|
|
|
|
|
fprintf(stderr, "Iterator on cf %s has error: %s\n", |
|
|
|
fprintf(stderr, "Iterator on cf %s has error: %s\n", |
|
|
|
column_families_[i]->GetName().c_str(), |
|
|
|
column_families_[i]->GetName().c_str(), |
|
|
|
s.ToString().c_str()); |
|
|
|
s.ToString().c_str()); |
|
|
|
shared->SetVerificationFailure(); |
|
|
|
shared->SetVerificationFailure(); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
break; |
|
|
|
break; |
|
|
|
} else if (valid_cnt != iters.size()) { |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if (valid_cnt < num) { |
|
|
|
shared->SetVerificationFailure(); |
|
|
|
shared->SetVerificationFailure(); |
|
|
|
for (size_t i = 0; i != num; ++i) { |
|
|
|
|
|
|
|
|
|
|
|
for (size_t i = 0; i < num; ++i) { |
|
|
|
|
|
|
|
assert(iters[i]); |
|
|
|
|
|
|
|
|
|
|
|
if (!iters[i]->Valid()) { |
|
|
|
if (!iters[i]->Valid()) { |
|
|
|
if (statuses[i].ok()) { |
|
|
|
if (statuses[i].ok()) { |
|
|
|
fprintf(stderr, "Finished scanning cf %s\n", |
|
|
|
fprintf(stderr, "Finished scanning cf %s\n", |
|
|
@ -400,27 +420,37 @@ class CfConsistencyStressTest : public StressTest { |
|
|
|
column_families_[i]->GetName().c_str()); |
|
|
|
column_families_[i]->GetName().c_str()); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
break; |
|
|
|
break; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
if (shared->HasVerificationFailedYet()) { |
|
|
|
if (shared->HasVerificationFailedYet()) { |
|
|
|
break; |
|
|
|
break; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// If the program reaches here, then all column families' iterators are
|
|
|
|
// If the program reaches here, then all column families' iterators are
|
|
|
|
// still valid.
|
|
|
|
// still valid.
|
|
|
|
|
|
|
|
assert(valid_cnt == num); |
|
|
|
|
|
|
|
|
|
|
|
if (shared->PrintingVerificationResults()) { |
|
|
|
if (shared->PrintingVerificationResults()) { |
|
|
|
continue; |
|
|
|
continue; |
|
|
|
} |
|
|
|
} |
|
|
|
Slice key; |
|
|
|
|
|
|
|
Slice value; |
|
|
|
assert(iters[0]); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
const Slice key = iters[0]->key(); |
|
|
|
|
|
|
|
const Slice value = iters[0]->value(); |
|
|
|
|
|
|
|
|
|
|
|
int num_mismatched_cfs = 0; |
|
|
|
int num_mismatched_cfs = 0; |
|
|
|
for (size_t i = 0; i != num; ++i) { |
|
|
|
|
|
|
|
if (i == 0) { |
|
|
|
for (size_t i = 1; i < num; ++i) { |
|
|
|
key = iters[i]->key(); |
|
|
|
assert(iters[i]); |
|
|
|
value = iters[i]->value(); |
|
|
|
|
|
|
|
} else { |
|
|
|
const int cmp = key.compare(iters[i]->key()); |
|
|
|
int cmp = key.compare(iters[i]->key()); |
|
|
|
|
|
|
|
if (cmp != 0) { |
|
|
|
if (cmp != 0) { |
|
|
|
++num_mismatched_cfs; |
|
|
|
++num_mismatched_cfs; |
|
|
|
|
|
|
|
|
|
|
|
if (1 == num_mismatched_cfs) { |
|
|
|
if (1 == num_mismatched_cfs) { |
|
|
|
fprintf(stderr, "Verification failed\n"); |
|
|
|
fprintf(stderr, "Verification failed\n"); |
|
|
|
fprintf(stderr, "Latest Sequence Number: %" PRIu64 "\n", |
|
|
|
fprintf(stderr, "Latest Sequence Number: %" PRIu64 "\n", |
|
|
@ -430,10 +460,12 @@ class CfConsistencyStressTest : public StressTest { |
|
|
|
key.ToString(true /* hex */).c_str(), |
|
|
|
key.ToString(true /* hex */).c_str(), |
|
|
|
value.ToString(true /* hex */).c_str()); |
|
|
|
value.ToString(true /* hex */).c_str()); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
fprintf(stderr, "[%s] %s => %s\n", |
|
|
|
fprintf(stderr, "[%s] %s => %s\n", |
|
|
|
column_families_[i]->GetName().c_str(), |
|
|
|
column_families_[i]->GetName().c_str(), |
|
|
|
iters[i]->key().ToString(true /* hex */).c_str(), |
|
|
|
iters[i]->key().ToString(true /* hex */).c_str(), |
|
|
|
iters[i]->value().ToString(true /* hex */).c_str()); |
|
|
|
iters[i]->value().ToString(true /* hex */).c_str()); |
|
|
|
|
|
|
|
|
|
|
|
#ifndef ROCKSDB_LITE |
|
|
|
#ifndef ROCKSDB_LITE |
|
|
|
Slice begin_key; |
|
|
|
Slice begin_key; |
|
|
|
Slice end_key; |
|
|
|
Slice end_key; |
|
|
@ -444,39 +476,49 @@ class CfConsistencyStressTest : public StressTest { |
|
|
|
begin_key = iters[i]->key(); |
|
|
|
begin_key = iters[i]->key(); |
|
|
|
end_key = key; |
|
|
|
end_key = key; |
|
|
|
} |
|
|
|
} |
|
|
|
std::vector<KeyVersion> versions; |
|
|
|
|
|
|
|
const size_t kMaxNumIKeys = 8; |
|
|
|
|
|
|
|
const auto print_key_versions = [&](ColumnFamilyHandle* cfh) { |
|
|
|
const auto print_key_versions = [&](ColumnFamilyHandle* cfh) { |
|
|
|
Status s = GetAllKeyVersions(db_, cfh, begin_key, end_key, |
|
|
|
constexpr size_t kMaxNumIKeys = 8; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
std::vector<KeyVersion> versions; |
|
|
|
|
|
|
|
const Status s = GetAllKeyVersions(db_, cfh, begin_key, end_key, |
|
|
|
kMaxNumIKeys, &versions); |
|
|
|
kMaxNumIKeys, &versions); |
|
|
|
if (!s.ok()) { |
|
|
|
if (!s.ok()) { |
|
|
|
fprintf(stderr, "%s\n", s.ToString().c_str()); |
|
|
|
fprintf(stderr, "%s\n", s.ToString().c_str()); |
|
|
|
return; |
|
|
|
return; |
|
|
|
} |
|
|
|
} |
|
|
|
assert(nullptr != cfh); |
|
|
|
|
|
|
|
|
|
|
|
assert(cfh); |
|
|
|
|
|
|
|
|
|
|
|
fprintf(stderr, |
|
|
|
fprintf(stderr, |
|
|
|
"Internal keys in CF '%s', [%s, %s] (max %" ROCKSDB_PRIszt |
|
|
|
"Internal keys in CF '%s', [%s, %s] (max %" ROCKSDB_PRIszt |
|
|
|
")\n", |
|
|
|
")\n", |
|
|
|
cfh->GetName().c_str(), |
|
|
|
cfh->GetName().c_str(), |
|
|
|
begin_key.ToString(true /* hex */).c_str(), |
|
|
|
begin_key.ToString(true /* hex */).c_str(), |
|
|
|
end_key.ToString(true /* hex */).c_str(), kMaxNumIKeys); |
|
|
|
end_key.ToString(true /* hex */).c_str(), kMaxNumIKeys); |
|
|
|
|
|
|
|
|
|
|
|
for (const KeyVersion& kv : versions) { |
|
|
|
for (const KeyVersion& kv : versions) { |
|
|
|
fprintf(stderr, " key %s seq %" PRIu64 " type %d\n", |
|
|
|
fprintf(stderr, " key %s seq %" PRIu64 " type %d\n", |
|
|
|
Slice(kv.user_key).ToString(true).c_str(), kv.sequence, |
|
|
|
Slice(kv.user_key).ToString(true).c_str(), kv.sequence, |
|
|
|
kv.type); |
|
|
|
kv.type); |
|
|
|
} |
|
|
|
} |
|
|
|
}; |
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
|
if (1 == num_mismatched_cfs) { |
|
|
|
if (1 == num_mismatched_cfs) { |
|
|
|
print_key_versions(column_families_[0]); |
|
|
|
print_key_versions(column_families_[0]); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
print_key_versions(column_families_[i]); |
|
|
|
print_key_versions(column_families_[i]); |
|
|
|
#endif // ROCKSDB_LITE
|
|
|
|
#endif // ROCKSDB_LITE
|
|
|
|
|
|
|
|
|
|
|
|
shared->SetVerificationFailure(); |
|
|
|
shared->SetVerificationFailure(); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
shared->FinishPrintingVerificationResults(); |
|
|
|
shared->FinishPrintingVerificationResults(); |
|
|
|
|
|
|
|
|
|
|
|
for (auto& iter : iters) { |
|
|
|
for (auto& iter : iters) { |
|
|
|
|
|
|
|
assert(iter); |
|
|
|
iter->Next(); |
|
|
|
iter->Next(); |
|
|
|
} |
|
|
|
} |
|
|
|
} while (true); |
|
|
|
} while (true); |
|
|
|