mirror of
https://github.com/facebook/rocksdb.git
synced 2024-11-29 18:33:58 +00:00
8bf555f487
Summary: Before this PR, Iterator/InternalIterator may simultaneously have non-ok status() and Valid() = true. That state means that the last operation failed, but the iterator is nevertheless positioned on some unspecified record. Likely intended uses of that are: * If some sst files are corrupted, a normal iterator can be used to read the data from files that are not corrupted. * When using read_tier = kBlockCacheTier, read the data that's in block cache, skipping over the data that is not. However, this behavior wasn't documented well (and until recently the wiki on github had misleading incorrect information). In the code there's a lot of confusion about the relationship between status() and Valid(), and about whether Seek()/SeekToLast()/etc reset the status or not. There were a number of bugs caused by this confusion, both inside rocksdb and in the code that uses rocksdb (including ours). This PR changes the convention to: * If status() is not ok, Valid() always returns false. * Any seek operation resets status. (Before the PR, it depended on iterator type and on particular error.) This does sacrifice the two use cases listed above, but siying said it's ok. Overview of the changes: * A commit that adds missing status checks in MergingIterator. This fixes a bug that actually affects us, and we need it fixed. `DBIteratorTest.NonBlockingIterationBugRepro` explains the scenario. * Changes to lots of iterator types to make all of them conform to the new convention. Some bug fixes along the way. By far the biggest changes are in DBIter, which is a big messy piece of code; I tried to make it less big and messy but mostly failed. * A stress-test for DBIter, to gain some confidence that I didn't break it. It does a few million random operations on the iterator, while occasionally modifying the underlying data (like ForwardIterator does) and occasionally returning non-ok status from internal iterator. To find the iterator types that needed changes I searched for "public .*Iterator" in the code. Here's an overview of all 27 iterator types: Iterators that didn't need changes: * status() is always ok(), or Valid() is always false: MemTableIterator, ModelIter, TestIterator, KVIter (2 classes with this name anonymous namespaces), LoggingForwardVectorIterator, VectorIterator, MockTableIterator, EmptyIterator, EmptyInternalIterator. * Thin wrappers that always pass through Valid() and status(): ArenaWrappedDBIter, TtlIterator, InternalIteratorFromIterator. Iterators with changes (see inline comments for details): * DBIter - an overhaul: - It used to silently skip corrupted keys (`FindParseableKey()`), which seems dangerous. This PR makes it just stop immediately after encountering a corrupted key, just like it would for other kinds of corruption. Let me know if there was actually some deeper meaning in this behavior and I should put it back. - It had a few code paths silently discarding subiterator's status. The stress test caught a few. - The backwards iteration code path was expecting the internal iterator's set of keys to be immutable. It's probably always true in practice at the moment, since ForwardIterator doesn't support backwards iteration, but this PR fixes it anyway. See added DBIteratorTest.ReverseToForwardBug for an example. - Some parts of backwards iteration code path even did things like `assert(iter_->Valid())` after a seek, which is never a safe assumption. - It used to not reset status on seek for some types of errors. - Some simplifications and better comments. - Some things got more complicated from the added error handling. I'm open to ideas for how to make it nicer. * MergingIterator - check status after every operation on every subiterator, and in some places assert that valid subiterators have ok status. * ForwardIterator - changed to the new convention, also slightly simplified. * ForwardLevelIterator - fixed some bugs and simplified. * LevelIterator - simplified. * TwoLevelIterator - changed to the new convention. Also fixed a bug that would make SeekForPrev() sometimes silently ignore errors from first_level_iter_. * BlockBasedTableIterator - minor changes. * BlockIter - replaced `SetStatus()` with `Invalidate()` to make sure non-ok BlockIter is always invalid. * PlainTableIterator - some seeks used to not reset status. * CuckooTableIterator - tiny code cleanup. * ManagedIterator - fixed some bugs. * BaseDeltaIterator - changed to the new convention and fixed a bug. * BlobDBIterator - seeks used to not reset status. * KeyConvertingIterator - some small change. Closes https://github.com/facebook/rocksdb/pull/3810 Differential Revision: D7888019 Pulled By: al13n321 fbshipit-source-id: 4aaf6d3421c545d16722a815b2fa2e7912bc851d
255 lines
6.3 KiB
C++
255 lines
6.3 KiB
C++
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
|
// This source code is licensed under both the GPLv2 (found in the
|
|
// COPYING file in the root directory) and Apache 2.0 License
|
|
// (found in the LICENSE.Apache file in the root directory).
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
|
|
#include "db/managed_iterator.h"
|
|
|
|
#include <limits>
|
|
#include <string>
|
|
#include <utility>
|
|
|
|
#include "db/column_family.h"
|
|
#include "db/db_impl.h"
|
|
#include "db/db_iter.h"
|
|
#include "db/dbformat.h"
|
|
#include "rocksdb/env.h"
|
|
#include "rocksdb/slice.h"
|
|
#include "rocksdb/slice_transform.h"
|
|
#include "table/merging_iterator.h"
|
|
|
|
namespace rocksdb {
|
|
|
|
namespace {
|
|
// Helper class that locks a mutex on construction and unlocks the mutex when
|
|
// the destructor of the MutexLock object is invoked.
|
|
//
|
|
// Typical usage:
|
|
//
|
|
// void MyClass::MyMethod() {
|
|
// MILock l(&mu_); // mu_ is an instance variable
|
|
// ... some complex code, possibly with multiple return paths ...
|
|
// }
|
|
|
|
class MILock {
|
|
public:
|
|
explicit MILock(std::mutex* mu, ManagedIterator* mi) : mu_(mu), mi_(mi) {
|
|
this->mu_->lock();
|
|
}
|
|
~MILock() {
|
|
this->mu_->unlock();
|
|
}
|
|
ManagedIterator* GetManagedIterator() { return mi_; }
|
|
|
|
private:
|
|
std::mutex* const mu_;
|
|
ManagedIterator* mi_;
|
|
// No copying allowed
|
|
MILock(const MILock&) = delete;
|
|
void operator=(const MILock&) = delete;
|
|
};
|
|
} // anonymous namespace
|
|
|
|
//
|
|
// Synchronization between modifiers, releasers, creators
|
|
// If iterator operation, wait till (!in_use), set in_use, do op, reset in_use
|
|
// if modifying mutable_iter, atomically exchange in_use:
|
|
// return if in_use set / otherwise set in use,
|
|
// atomically replace new iter with old , reset in use
|
|
// The releaser is the new operation and it holds a lock for a very short time
|
|
// The existing non-const iterator operations are supposed to be single
|
|
// threaded and hold the lock for the duration of the operation
|
|
// The existing const iterator operations use the cached key/values
|
|
// and don't do any locking.
|
|
ManagedIterator::ManagedIterator(DBImpl* db, const ReadOptions& read_options,
|
|
ColumnFamilyData* cfd)
|
|
: db_(db),
|
|
read_options_(read_options),
|
|
cfd_(cfd),
|
|
svnum_(cfd->GetSuperVersionNumber()),
|
|
mutable_iter_(nullptr),
|
|
valid_(false),
|
|
snapshot_created_(false),
|
|
release_supported_(true) {
|
|
read_options_.managed = false;
|
|
if ((!read_options_.tailing) && (read_options_.snapshot == nullptr)) {
|
|
assert(nullptr != (read_options_.snapshot = db_->GetSnapshot()));
|
|
snapshot_created_ = true;
|
|
}
|
|
cfh_.SetCFD(cfd);
|
|
mutable_iter_ = unique_ptr<Iterator>(db->NewIterator(read_options_, &cfh_));
|
|
}
|
|
|
|
ManagedIterator::~ManagedIterator() {
|
|
Lock();
|
|
if (snapshot_created_) {
|
|
db_->ReleaseSnapshot(read_options_.snapshot);
|
|
snapshot_created_ = false;
|
|
read_options_.snapshot = nullptr;
|
|
}
|
|
UnLock();
|
|
}
|
|
|
|
bool ManagedIterator::Valid() const { return valid_; }
|
|
|
|
void ManagedIterator::SeekToLast() {
|
|
MILock l(&in_use_, this);
|
|
if (NeedToRebuild()) {
|
|
RebuildIterator();
|
|
}
|
|
assert(mutable_iter_ != nullptr);
|
|
mutable_iter_->SeekToLast();
|
|
UpdateCurrent();
|
|
}
|
|
|
|
void ManagedIterator::SeekToFirst() {
|
|
MILock l(&in_use_, this);
|
|
SeekInternal(Slice(), true);
|
|
}
|
|
|
|
void ManagedIterator::Seek(const Slice& user_key) {
|
|
MILock l(&in_use_, this);
|
|
SeekInternal(user_key, false);
|
|
}
|
|
|
|
void ManagedIterator::SeekForPrev(const Slice& user_key) {
|
|
MILock l(&in_use_, this);
|
|
if (NeedToRebuild()) {
|
|
RebuildIterator();
|
|
}
|
|
assert(mutable_iter_ != nullptr);
|
|
mutable_iter_->SeekForPrev(user_key);
|
|
UpdateCurrent();
|
|
}
|
|
|
|
void ManagedIterator::SeekInternal(const Slice& user_key, bool seek_to_first) {
|
|
if (NeedToRebuild()) {
|
|
RebuildIterator();
|
|
}
|
|
assert(mutable_iter_ != nullptr);
|
|
if (seek_to_first) {
|
|
mutable_iter_->SeekToFirst();
|
|
} else {
|
|
mutable_iter_->Seek(user_key);
|
|
}
|
|
UpdateCurrent();
|
|
}
|
|
|
|
void ManagedIterator::Prev() {
|
|
if (!valid_) {
|
|
status_ = Status::InvalidArgument("Iterator value invalid");
|
|
return;
|
|
}
|
|
MILock l(&in_use_, this);
|
|
if (NeedToRebuild()) {
|
|
RebuildIterator(true);
|
|
if (!valid_) {
|
|
return;
|
|
}
|
|
}
|
|
mutable_iter_->Prev();
|
|
UpdateCurrent();
|
|
}
|
|
|
|
void ManagedIterator::Next() {
|
|
if (!valid_) {
|
|
status_ = Status::InvalidArgument("Iterator value invalid");
|
|
return;
|
|
}
|
|
MILock l(&in_use_, this);
|
|
if (NeedToRebuild()) {
|
|
RebuildIterator(true);
|
|
if (!valid_) {
|
|
return;
|
|
}
|
|
}
|
|
mutable_iter_->Next();
|
|
UpdateCurrent();
|
|
}
|
|
|
|
Slice ManagedIterator::key() const {
|
|
assert(valid_);
|
|
return cached_key_.GetUserKey();
|
|
}
|
|
|
|
Slice ManagedIterator::value() const {
|
|
assert(valid_);
|
|
return cached_value_.GetUserKey();
|
|
}
|
|
|
|
Status ManagedIterator::status() const { return status_; }
|
|
|
|
void ManagedIterator::RebuildIterator(bool reseek) {
|
|
std::string current_key;
|
|
if (reseek) {
|
|
current_key = key().ToString();
|
|
}
|
|
|
|
svnum_ = cfd_->GetSuperVersionNumber();
|
|
mutable_iter_ = unique_ptr<Iterator>(db_->NewIterator(read_options_, &cfh_));
|
|
|
|
if (reseek) {
|
|
Slice old_key(current_key.data(), current_key.size());
|
|
SeekInternal(old_key, false);
|
|
UpdateCurrent();
|
|
if (!valid_ || key().compare(old_key) != 0) {
|
|
valid_ = false;
|
|
status_ = Status::Incomplete(
|
|
"Next/Prev failed because current key has "
|
|
"been removed");
|
|
}
|
|
}
|
|
}
|
|
|
|
void ManagedIterator::UpdateCurrent() {
|
|
assert(mutable_iter_ != nullptr);
|
|
|
|
valid_ = mutable_iter_->Valid();
|
|
status_ = mutable_iter_->status();
|
|
|
|
if (!valid_) {
|
|
return;
|
|
}
|
|
|
|
cached_key_.SetUserKey(mutable_iter_->key());
|
|
cached_value_.SetUserKey(mutable_iter_->value());
|
|
}
|
|
|
|
void ManagedIterator::ReleaseIter(bool only_old) {
|
|
if ((mutable_iter_ == nullptr) || (!release_supported_)) {
|
|
return;
|
|
}
|
|
if (svnum_ != cfd_->GetSuperVersionNumber() || !only_old) {
|
|
if (!TryLock()) { // Don't release iter if in use
|
|
return;
|
|
}
|
|
mutable_iter_ = nullptr; // in_use for a very short time
|
|
UnLock();
|
|
}
|
|
}
|
|
|
|
bool ManagedIterator::NeedToRebuild() {
|
|
if ((mutable_iter_ == nullptr) || (status_.IsIncomplete()) ||
|
|
(!only_drop_old_ && (svnum_ != cfd_->GetSuperVersionNumber()))) {
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
void ManagedIterator::Lock() {
|
|
in_use_.lock();
|
|
return;
|
|
}
|
|
|
|
bool ManagedIterator::TryLock() { return in_use_.try_lock(); }
|
|
|
|
void ManagedIterator::UnLock() {
|
|
in_use_.unlock();
|
|
}
|
|
|
|
} // namespace rocksdb
|
|
|
|
#endif // ROCKSDB_LITE
|