Update HISTORY.md and version.h for 9.5.2

Summary:
Add a couple of ticker stats for corruption retry count and successful retries. This PR also eliminates an extra read attempt when there's a checksum mismatch in a block read from the prefetch buffer.

Pull Request resolved: https://github.com/facebook/rocksdb/pull/12923

Test Plan: Update existing tests

Reviewed By: jowlyzhang

Differential Revision: D61024687

Pulled By: anand1976

fbshipit-source-id: 3a08403580ab244000e0d480b7ee0f5a03d76b06

.github/workflows/nightly.yml

@@ -59,15 +59,12 @@ jobs:
     container:
       image: zjay437/rocksdb:0.6
       options: --shm-size=16gb
-    env:
-      CC: clang-13
-      CXX: clang++-13
     steps:
     - uses: actions/checkout@v4.1.0
     - uses: "./.github/actions/pre-steps"
     - uses: "./.github/actions/setup-folly"
     - uses: "./.github/actions/build-folly"
-    - run: LIB_MODE=static USE_CLANG=1 USE_FOLLY=1 COMPILE_WITH_UBSAN=1 COMPILE_WITH_ASAN=1 make -j32 check
+    - run: CC=clang-13 CXX=clang++-13 LIB_MODE=static USE_CLANG=1 USE_FOLLY=1 COMPILE_WITH_UBSAN=1 COMPILE_WITH_ASAN=1 make -j32 check
     - uses: "./.github/actions/post-steps"
   build-linux-valgrind:
     if: ${{ github.repository_owner == 'facebook' }}

HISTORY.md

@@ -1,35 +1,16 @@
 # Rocksdb Change Log
 > NOTE: Entries for next release do not go here. Follow instructions in `unreleased_history/README.txt`
 
-## 9.6.2 (10/31/2024)
+## 9.5.2 (08/13/2024)
 ### Bug Fixes
-* Fix a leak of obsolete blob files left open until DB::Close(). This bug was introduced in version 9.4.0.
-
-## 9.6.1 (08/24/2024)
-### Bug Fixes
-* Fix correctness of MultiGet across column families with user timestamp.
-
-## 9.6.0 (08/19/2024)
-### New Features
-* *Best efforts recovery supports recovering to incomplete Version with a clean seqno cut that presents a valid point in time view from the user's perspective, if versioning history doesn't include atomic flush.
-* New option `BlockBasedTableOptions::decouple_partitioned_filters` should improve efficiency in serving read queries because filter and index partitions can consistently target the configured `metadata_block_size`. This option is currently opt-in.
-* Introduce a new mutable CF option `paranoid_memory_checks`. It enables additional validation on data integrity during reads/scanning. Currently, skip list based memtable will validate key ordering during look up and scans.
+* Fix a race condition in pessimistic transactions that could allow multiple transactions with the same name to be registered simultaneously, resulting in a crash or other unpredictable behavior.
 
 ### Public API Changes
 * Add ticker stats to count file read retries due to checksum mismatch
-* Adds optional installation callback function for remote compaction
-
-### Behavior Changes
-* There may be less intra-L0 compaction triggered by total L0 size being too small. We now use compensated file size (tombstones are assigned some value size) when calculating L0 size and reduce the threshold for L0 size limit. This is to avoid accumulating too much data/tombstones in L0.
 
+## 9.5.1 (08/02/2024)
 ### Bug Fixes
 * *Make DestroyDB supports slow deletion when it's configured in `SstFileManager`. The slow deletion is subject to the configured `rate_bytes_per_sec`, but not subject to the `max_trash_db_ratio`.
-* Fixed a bug where we set unprep_seqs_ even when WriteImpl() fails. This was caught by stress test write fault injection in WriteImpl(). This may have incorrectly caused iteration creation failure for unvalidated writes or returned wrong result for WriteUnpreparedTxn::GetUnpreparedSequenceNumbers().
-* Fixed a bug where successful write right after error recovery for last failed write finishes causes duplicate WAL entries
-* Fixed a data race involving the background error status in `unordered_write` mode.
-* *Fix a bug where file snapshot functions like backup, checkpoint may attempt to copy a non-existing manifest file. #12882
-* Fix a bug where per kv checksum corruption may be ignored in MultiGet().
-* Fix a race condition in pessimistic transactions that could allow multiple transactions with the same name to be registered simultaneously, resulting in a crash or other unpredictable behavior.
 
 ## 9.5.0 (07/19/2024)
 ### Public API Changes

db/blob/blob_file_cache.cc

@@ -42,7 +42,6 @@ Status BlobFileCache::GetBlobFileReader(
   assert(blob_file_reader);
   assert(blob_file_reader->IsEmpty());
 
-  // NOTE: sharing same Cache with table_cache
   const Slice key = GetSliceForKey(&blob_file_number);
 
   assert(cache_);
@@ -99,13 +98,4 @@ Status BlobFileCache::GetBlobFileReader(
   return Status::OK();
 }
 
-void BlobFileCache::Evict(uint64_t blob_file_number) {
-  // NOTE: sharing same Cache with table_cache
-  const Slice key = GetSliceForKey(&blob_file_number);
-
-  assert(cache_);
-
-  cache_.get()->Erase(key);
-}
-
 }  // namespace ROCKSDB_NAMESPACE

db/blob/blob_file_cache.h

@@ -36,15 +36,6 @@ class BlobFileCache {
                            uint64_t blob_file_number,
                            CacheHandleGuard<BlobFileReader>* blob_file_reader);
 
-  // Called when a blob file is obsolete to ensure it is removed from the cache
-  // to avoid effectively leaking the open file and assicated memory
-  void Evict(uint64_t blob_file_number);
-
-  // Used to identify cache entries for blob files (not normally useful)
-  static const Cache::CacheItemHelper* GetHelper() {
-    return CacheInterface::GetBasicHelper();
-  }
-
  private:
   using CacheInterface =
       BasicTypedCacheInterface<BlobFileReader, CacheEntryRole::kMisc>;

db/column_family.h

@@ -401,7 +401,6 @@ class ColumnFamilyData {
                          SequenceNumber earliest_seq);
 
   TableCache* table_cache() const { return table_cache_.get(); }
-  BlobFileCache* blob_file_cache() const { return blob_file_cache_.get(); }
   BlobSource* blob_source() const { return blob_source_.get(); }
 
   // See documentation in compaction_picker.h

db/column_family_test.cc

@@ -3067,20 +3067,12 @@ TEST_P(ColumnFamilyTest, CompactionSpeedupForMarkedFiles) {
   WaitForCompaction();
   AssertFilesPerLevel("0,1", 0 /* cf */);
 
-  // We should calculate the limit by obtaining the number of env background
-  // threads, because the current test case will share the same env
-  // with another case that may have already increased the number of
-  // background threads which is larger than kParallelismLimit
-  const auto limit = env_->GetBackgroundThreads(Env::Priority::LOW);
-
   // Block the compaction thread pool so marked files accumulate in L0.
-  std::vector<std::shared_ptr<test::SleepingBackgroundTask>> sleeping_tasks;
-  for (int i = 0; i < limit; i++) {
-    sleeping_tasks.emplace_back(
-        std::make_shared<test::SleepingBackgroundTask>());
+  test::SleepingBackgroundTask sleeping_tasks[kParallelismLimit];
+  for (int i = 0; i < kParallelismLimit; i++) {
     env_->Schedule(&test::SleepingBackgroundTask::DoSleepTask,
-                   sleeping_tasks[i].get(), Env::Priority::LOW);
-    sleeping_tasks[i]->WaitUntilSleeping();
+                   &sleeping_tasks[i], Env::Priority::LOW);
+    sleeping_tasks[i].WaitUntilSleeping();
   }
 
   // Zero marked upper-level files. No speedup.
@@ -3099,9 +3091,9 @@ TEST_P(ColumnFamilyTest, CompactionSpeedupForMarkedFiles) {
   ASSERT_EQ(kParallelismLimit, dbfull()->TEST_BGCompactionsAllowed());
   AssertFilesPerLevel("2,1", 0 /* cf */);
 
-  for (int i = 0; i < limit; i++) {
-    sleeping_tasks[i]->WakeUp();
-    sleeping_tasks[i]->WaitUntilDone();
+  for (int i = 0; i < kParallelismLimit; i++) {
+    sleeping_tasks[i].WakeUp();
+    sleeping_tasks[i].WaitUntilDone();
   }
 }
 

db/compaction/compaction_job_test.cc

@@ -552,8 +552,7 @@ class CompactionJobTestBase : public testing::Test {
         /*db_id=*/"", /*db_session_id=*/"", /*daily_offpeak_time_utc=*/"",
         /*error_handler=*/nullptr, /*read_only=*/false));
     compaction_job_stats_.Reset();
-    ASSERT_OK(
-        SetIdentityFile(WriteOptions(), env_, dbname_, Temperature::kUnknown));
+    ASSERT_OK(SetIdentityFile(WriteOptions(), env_, dbname_));
 
     VersionEdit new_db;
     new_db.SetLogNumber(0);
@@ -576,8 +575,7 @@ class CompactionJobTestBase : public testing::Test {
     }
     ASSERT_OK(s);
     // Make "CURRENT" file that points to the new manifest file.
-    s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1,
-                       Temperature::kUnknown, nullptr);
+    s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1, nullptr);
 
     ASSERT_OK(s);
 

db/compaction/compaction_picker_level.cc

@@ -925,15 +925,11 @@ bool LevelCompactionBuilder::PickSizeBasedIntraL0Compaction() {
   }
   uint64_t l0_size = 0;
   for (const auto& file : l0_files) {
-    assert(file->compensated_file_size >= file->fd.GetFileSize());
-    // Compact down L0s with more deletions.
-    l0_size += file->compensated_file_size;
+    l0_size += file->fd.GetFileSize();
   }
-
-  // Avoid L0->Lbase compactions that are inefficient for write-amp.
-  const double kMultiplier =
-      std::max(10.0, mutable_cf_options_.max_bytes_for_level_multiplier) * 2;
-  const uint64_t min_lbase_size = MultiplyCheckOverflow(l0_size, kMultiplier);
+  const uint64_t min_lbase_size =
+      l0_size * static_cast<uint64_t>(std::max(
+                    10.0, mutable_cf_options_.max_bytes_for_level_multiplier));
   assert(min_lbase_size >= l0_size);
   const std::vector<FileMetaData*>& lbase_files =
       vstorage_->LevelFiles(/*level=*/base_level);

db/compaction/compaction_picker_test.cc

@@ -214,10 +214,7 @@ class CompactionPickerTest : public CompactionPickerTestBase {
   explicit CompactionPickerTest()
       : CompactionPickerTestBase(BytewiseComparator()) {}
 
-  ~CompactionPickerTest() override {
-    SyncPoint::GetInstance()->ClearAllCallBacks();
-    SyncPoint::GetInstance()->DisableProcessing();
-  }
+  ~CompactionPickerTest() override = default;
 };
 
 class CompactionPickerU64TsTest : public CompactionPickerTestBase {
@@ -4287,28 +4284,27 @@ TEST_F(CompactionPickerTest, IntraL0WhenL0IsSmall) {
     SCOPED_TRACE("lbase_size_multiplier=" +
                  std::to_string(lbase_size_multiplier));
     NewVersionStorage(6, kCompactionStyleLevel);
-    // When L0 size is <= Lbase size / max_bytes_for_level_multiplier / 2,
+    // When L0 size is <= Lbase size / max_bytes_for_level_multiplier,
     // intra-L0 compaction is picked. Otherwise, L0->L1
     // compaction is picked.
-    // compensated_file_size will be used to compute total l0 size.
     Add(/*level=*/0, /*file_number=*/1U, /*smallest=*/"100",
-        /*largest=*/"200", /*file_size=*/10, /*path_id=*/0,
+        /*largest=*/"200", /*file_size=*/1000, /*path_id=*/0,
         /*smallest_seq=*/10, /*largest_seq=*/11,
         /*compensated_file_size=*/1000);
     Add(/*level=*/0, /*file_number=*/2U, /*smallest=*/"100",
-        /*largest=*/"100", /*file_size=*/10, /*path_id=*/0,
+        /*largest=*/"100", /*file_size=*/1000, /*path_id=*/0,
         /*smallest_seq=*/20, /*largest_seq=*/21,
         /*compensated_file_size=*/1000);
     Add(/*level=*/0, /*file_number=*/3U, /*smallest=*/"100",
-        /*largest=*/"200", /*file_size=*/10, /*path_id=*/0,
+        /*largest=*/"200", /*file_size=*/1000, /*path_id=*/0,
         /*smallest_seq=*/30, /*largest_seq=*/31,
         /*compensated_file_size=*/1000);
     Add(/*level=*/0, /*file_number=*/4U, /*smallest=*/"100",
-        /*largest=*/"200", /*file_size=*/10, /*path_id=*/0,
+        /*largest=*/"200", /*file_size=*/1000, /*path_id=*/0,
         /*smallest_seq=*/40, /*largest_seq=*/41,
         /*compensated_file_size=*/1000);
     const uint64_t l0_size = 4000;
-    const uint64_t lbase_size = l0_size * lbase_size_multiplier * 2;
+    const uint64_t lbase_size = l0_size * lbase_size_multiplier;
     Add(/*level=*/1, /*file_number=*/5U, /*smallest=*/"100",
         /*largest=*/"200", /*file_size=*/lbase_size, /*path_id=*/0,
         /*smallest_seq=*/0, /*largest_seq=*/0,

db/compaction/compaction_service_job.cc

@@ -140,13 +140,9 @@ CompactionJob::ProcessKeyValueCompactionWithCompactionService(
     return compaction_status;
   }
 
-  // CompactionServiceJobStatus::kSuccess was returned, but somehow we failed to
-  // read the result. Consider this as an installation failure
   if (!s.ok()) {
     sub_compact->status = s;
     compaction_result.status.PermitUncheckedError();
-    db_options_.compaction_service->OnInstallation(
-        response.scheduled_job_id, CompactionServiceJobStatus::kFailure);
     return CompactionServiceJobStatus::kFailure;
   }
   sub_compact->status = compaction_result.status;
@@ -158,14 +154,18 @@ CompactionJob::ProcessKeyValueCompactionWithCompactionService(
     is_first_one = false;
   }
 
-  ROCKS_LOG_INFO(
-      db_options_.info_log,
-      "[%s] [JOB %d] Received remote compaction result, output path: "
-      "%s, files: %s",
-      compaction_input.column_family.name.c_str(), job_id_,
-      compaction_result.output_path.c_str(), output_files_oss.str().c_str());
+  ROCKS_LOG_INFO(db_options_.info_log,
+                 "[%s] [JOB %d] Receive remote compaction result, output path: "
+                 "%s, files: %s",
+                 compaction_input.column_family.name.c_str(), job_id_,
+                 compaction_result.output_path.c_str(),
+                 output_files_oss.str().c_str());
+
+  if (!s.ok()) {
+    sub_compact->status = s;
+    return CompactionServiceJobStatus::kFailure;
+  }
 
-  // Installation Starts
   for (const auto& file : compaction_result.output_files) {
     uint64_t file_num = versions_->NewFileNumber();
     auto src_file = compaction_result.output_path + "/" + file.file_name;
@@ -174,8 +174,6 @@ CompactionJob::ProcessKeyValueCompactionWithCompactionService(
     s = fs_->RenameFile(src_file, tgt_file, IOOptions(), nullptr);
     if (!s.ok()) {
       sub_compact->status = s;
-      db_options_.compaction_service->OnInstallation(
-          response.scheduled_job_id, CompactionServiceJobStatus::kFailure);
       return CompactionServiceJobStatus::kFailure;
     }
 
@@ -184,8 +182,6 @@ CompactionJob::ProcessKeyValueCompactionWithCompactionService(
     s = fs_->GetFileSize(tgt_file, IOOptions(), &file_size, nullptr);
     if (!s.ok()) {
       sub_compact->status = s;
-      db_options_.compaction_service->OnInstallation(
-          response.scheduled_job_id, CompactionServiceJobStatus::kFailure);
       return CompactionServiceJobStatus::kFailure;
     }
     meta.fd = FileDescriptor(file_num, compaction->output_path_id(), file_size,
@@ -210,8 +206,6 @@ CompactionJob::ProcessKeyValueCompactionWithCompactionService(
   RecordTick(stats_, REMOTE_COMPACT_READ_BYTES, compaction_result.bytes_read);
   RecordTick(stats_, REMOTE_COMPACT_WRITE_BYTES,
              compaction_result.bytes_written);
-  db_options_.compaction_service->OnInstallation(
-      response.scheduled_job_id, CompactionServiceJobStatus::kSuccess);
   return CompactionServiceJobStatus::kSuccess;
 }
 

db/compaction/compaction_service_test.cc

@@ -108,11 +108,6 @@ class MyTestCompactionService : public CompactionService {
     }
   }
 
-  void OnInstallation(const std::string& /*scheduled_job_id*/,
-                      CompactionServiceJobStatus status) override {
-    final_updated_status_ = status;
-  }
-
   int GetCompactionNum() { return compaction_num_.load(); }
 
   CompactionServiceJobInfo GetCompactionInfoForStart() { return start_info_; }
@@ -141,10 +136,6 @@ class MyTestCompactionService : public CompactionService {
 
   void SetCanceled(bool canceled) { canceled_ = canceled; }
 
-  CompactionServiceJobStatus GetFinalCompactionServiceJobStatus() {
-    return final_updated_status_.load();
-  }
-
  private:
   InstrumentedMutex mutex_;
   std::atomic_int compaction_num_{0};
@@ -167,8 +158,6 @@ class MyTestCompactionService : public CompactionService {
   std::vector<std::shared_ptr<TablePropertiesCollectorFactory>>
       table_properties_collector_factories_;
   std::atomic_bool canceled_{false};
-  std::atomic<CompactionServiceJobStatus> final_updated_status_{
-      CompactionServiceJobStatus::kUseLocal};
 };
 
 class CompactionServiceTest : public DBTestBase {
@@ -266,8 +255,6 @@ TEST_F(CompactionServiceTest, BasicCompactions) {
 
   auto my_cs = GetCompactionService();
   ASSERT_GE(my_cs->GetCompactionNum(), 1);
-  ASSERT_EQ(CompactionServiceJobStatus::kSuccess,
-            my_cs->GetFinalCompactionServiceJobStatus());
 
   // make sure the compaction statistics is only recorded on the remote side
   ASSERT_GE(compactor_statistics->getTickerCount(COMPACT_WRITE_BYTES), 1);
@@ -450,8 +437,6 @@ TEST_F(CompactionServiceTest, InvalidResult) {
   Slice end(end_str);
   Status s = db_->CompactRange(CompactRangeOptions(), &start, &end);
   ASSERT_FALSE(s.ok());
-  ASSERT_EQ(CompactionServiceJobStatus::kFailure,
-            my_cs->GetFinalCompactionServiceJobStatus());
 }
 
 TEST_F(CompactionServiceTest, SubCompaction) {

db/db_basic_test.cc

@@ -3407,46 +3407,6 @@ class TableFileListener : public EventListener {
   InstrumentedMutex mutex_;
   std::unordered_map<std::string, std::vector<std::string>> cf_to_paths_;
 };
-
-class FlushTableFileListener : public EventListener {
- public:
-  void OnTableFileCreated(const TableFileCreationInfo& info) override {
-    InstrumentedMutexLock lock(&mutex_);
-    if (info.reason != TableFileCreationReason::kFlush) {
-      return;
-    }
-    cf_to_flushed_files_[info.cf_name].push_back(info.file_path);
-  }
-  std::vector<std::string>& GetFlushedFiles(const std::string& cf_name) {
-    InstrumentedMutexLock lock(&mutex_);
-    return cf_to_flushed_files_[cf_name];
-  }
-
- private:
-  InstrumentedMutex mutex_;
-  std::unordered_map<std::string, std::vector<std::string>>
-      cf_to_flushed_files_;
-};
-
-class FlushBlobFileListener : public EventListener {
- public:
-  void OnBlobFileCreated(const BlobFileCreationInfo& info) override {
-    InstrumentedMutexLock lock(&mutex_);
-    if (info.reason != BlobFileCreationReason::kFlush) {
-      return;
-    }
-    cf_to_flushed_blobs_files_[info.cf_name].push_back(info.file_path);
-  }
-  std::vector<std::string>& GetFlushedBlobFiles(const std::string& cf_name) {
-    InstrumentedMutexLock lock(&mutex_);
-    return cf_to_flushed_blobs_files_[cf_name];
-  }
-
- private:
-  InstrumentedMutex mutex_;
-  std::unordered_map<std::string, std::vector<std::string>>
-      cf_to_flushed_blobs_files_;
-};
 }  // anonymous namespace
 
 TEST_F(DBBasicTest, LastSstFileNotInManifest) {
@@ -3552,121 +3512,6 @@ TEST_F(DBBasicTest, RecoverWithMissingFiles) {
   }
 }
 
-// Param 0: whether to enable blob DB.
-// Param 1: when blob DB is enabled, whether to also delete the missing L0
-// file's associated blob file.
-class BestEffortsRecoverIncompleteVersionTest
-    : public DBTestBase,
-      public testing::WithParamInterface<std::tuple<bool, bool>> {
- public:
-  BestEffortsRecoverIncompleteVersionTest()
-      : DBTestBase("best_efforts_recover_incomplete_version_test",
-                   /*env_do_fsync=*/false) {}
-};
-
-TEST_P(BestEffortsRecoverIncompleteVersionTest, Basic) {
-  Options options = CurrentOptions();
-  options.enable_blob_files = std::get<0>(GetParam());
-  bool delete_blob_file_too = std::get<1>(GetParam());
-  DestroyAndReopen(options);
-  FlushTableFileListener* flush_table_listener = new FlushTableFileListener();
-  FlushBlobFileListener* flush_blob_listener = new FlushBlobFileListener();
-  // Disable auto compaction to simplify SST file name tracking.
-  options.disable_auto_compactions = true;
-  options.listeners.emplace_back(flush_table_listener);
-  options.listeners.emplace_back(flush_blob_listener);
-  CreateAndReopenWithCF({"pikachu", "eevee"}, options);
-  std::vector<std::string> all_cf_names = {kDefaultColumnFamilyName, "pikachu",
-                                           "eevee"};
-  int num_cfs = static_cast<int>(handles_.size());
-  ASSERT_EQ(3, num_cfs);
-  std::string start = "a";
-  Slice start_slice = start;
-  std::string end = "d";
-  Slice end_slice = end;
-  for (int cf = 0; cf != num_cfs; ++cf) {
-    ASSERT_OK(Put(cf, "a", "a_value"));
-    ASSERT_OK(Flush(cf));
-    // Compact file to L1 to avoid trivial file move in the next compaction
-    ASSERT_OK(db_->CompactRange(CompactRangeOptions(), handles_[cf],
-                                &start_slice, &end_slice));
-    ASSERT_OK(Put(cf, "a", "a_value_new"));
-    ASSERT_OK(Flush(cf));
-    ASSERT_OK(Put(cf, "b", "b_value"));
-    ASSERT_OK(Flush(cf));
-    ASSERT_OK(Put(cf, "f", "f_value"));
-    ASSERT_OK(Flush(cf));
-    ASSERT_OK(db_->CompactRange(CompactRangeOptions(), handles_[cf],
-                                &start_slice, &end_slice));
-  }
-
-  dbfull()->TEST_DeleteObsoleteFiles();
-
-  // Delete the most recent L0 file which is before a compaction.
-  for (int i = 0; i < num_cfs; ++i) {
-    std::vector<std::string>& files =
-        flush_table_listener->GetFlushedFiles(all_cf_names[i]);
-    ASSERT_EQ(4, files.size());
-    ASSERT_OK(env_->DeleteFile(files[files.size() - 1]));
-    if (options.enable_blob_files) {
-      std::vector<std::string>& blob_files =
-          flush_blob_listener->GetFlushedBlobFiles(all_cf_names[i]);
-      ASSERT_EQ(4, blob_files.size());
-      if (delete_blob_file_too) {
-        ASSERT_OK(env_->DeleteFile(blob_files[files.size() - 1]));
-      }
-    }
-  }
-  options.best_efforts_recovery = true;
-  ReopenWithColumnFamilies(all_cf_names, options);
-
-  for (int i = 0; i < num_cfs; ++i) {
-    auto cfh = static_cast<ColumnFamilyHandleImpl*>(handles_[i]);
-    ColumnFamilyData* cfd = cfh->cfd();
-    VersionStorageInfo* vstorage = cfd->current()->storage_info();
-    // The L0 file flushed right before the last compaction is missing.
-    ASSERT_EQ(0, vstorage->LevelFiles(0).size());
-    // Only the output of the last compaction is available.
-    ASSERT_EQ(1, vstorage->LevelFiles(1).size());
-  }
-  // Verify data
-  ReadOptions read_opts;
-  read_opts.total_order_seek = true;
-  for (int i = 0; i < num_cfs; ++i) {
-    std::unique_ptr<Iterator> iter(db_->NewIterator(read_opts, handles_[i]));
-    iter->SeekToFirst();
-    ASSERT_TRUE(iter->Valid());
-    ASSERT_OK(iter->status());
-    ASSERT_EQ("a", iter->key());
-    ASSERT_EQ("a_value_new", iter->value());
-    iter->Next();
-    ASSERT_TRUE(iter->Valid());
-    ASSERT_OK(iter->status());
-    ASSERT_EQ("b", iter->key());
-    ASSERT_EQ("b_value", iter->value());
-    iter->Next();
-    ASSERT_FALSE(iter->Valid());
-    ASSERT_OK(iter->status());
-  }
-
-  // Write more data.
-  for (int cf = 0; cf < num_cfs; ++cf) {
-    ASSERT_OK(Put(cf, "g", "g_value"));
-    ASSERT_OK(Flush(cf));
-    ASSERT_OK(db_->CompactRange(CompactRangeOptions(), handles_[cf], nullptr,
-                                nullptr));
-    std::string value;
-    ASSERT_OK(db_->Get(ReadOptions(), handles_[cf], "g", &value));
-    ASSERT_EQ("g_value", value);
-  }
-}
-
-INSTANTIATE_TEST_CASE_P(BestEffortsRecoverIncompleteVersionTest,
-                        BestEffortsRecoverIncompleteVersionTest,
-                        testing::Values(std::make_tuple(false, false),
-                                        std::make_tuple(true, false),
-                                        std::make_tuple(true, true)));
-
 TEST_F(DBBasicTest, BestEffortsRecoveryTryMultipleManifests) {
   Options options = CurrentOptions();
   options.env = env_;

db/db_follower_test.cc

@@ -289,12 +289,10 @@ TEST_F(DBFollowerTest, RetryCatchup) {
       {"DBImplFollower::TryCatchupWithLeader:Begin1", "Leader::Start"},
       {"DBImpl::BackgroundCompaction:Start",
        "DBImplFollower::TryCatchupWithLeader:Begin2"},
-      {"VersionEditHandlerPointInTime::MaybeCreateVersionBeforeApplyEdit:"
-       "Begin1",
+      {"VersionEditHandlerPointInTime::MaybeCreateVersion:Begin1",
        "DBImpl::BackgroundCompaction:BeforeCompaction"},
       {"DBImpl::BackgroundCallCompaction:PurgedObsoleteFiles",
-       "VersionEditHandlerPointInTime::MaybeCreateVersionBeforeApplyEdit:"
-       "Begin2"},
+       "VersionEditHandlerPointInTime::MaybeCreateVersion:Begin2"},
       {"DBImplFollower::TryCatchupWithLeader:End", "Follower::WaitForCatchup"},
   });
   SyncPoint::GetInstance()->EnableProcessing();
@@ -337,12 +335,10 @@ TEST_F(DBFollowerTest, RetryCatchupManifestRollover) {
   SyncPoint::GetInstance()->LoadDependency({
       {"DBImplFollower::TryCatchupWithLeader:Begin1", "Leader::Start"},
       {"Leader::Flushed", "DBImplFollower::TryCatchupWithLeader:Begin2"},
-      {"VersionEditHandlerPointInTime::MaybeCreateVersionBeforeApplyEdit:"
-       "Begin1",
+      {"VersionEditHandlerPointInTime::MaybeCreateVersion:Begin1",
        "Leader::Done"},
       {"DBImpl::BackgroundCallCompaction:PurgedObsoleteFiles",
-       "VersionEditHandlerPointInTime::MaybeCreateVersionBeforeApplyEdit:"
-       "Begin2"},
+       "VersionEditHandlerPointInTime::MaybeCreateVersion:Begin2"},
       {"DBImplFollower::TryCatchupWithLeader:End",
        "Follower::WaitForCatchup:1"},
   });

db/db_impl/db_impl.cc

@@ -654,9 +654,8 @@ Status DBImpl::CloseHelper() {
   // We need to release them before the block cache is destroyed. The block
   // cache may be destroyed inside versions_.reset(), when column family data
   // list is destroyed, so leaving handles in table cache after
-  // versions_.reset() may cause issues. Here we clean all unreferenced handles
-  // in table cache, and (for certain builds/conditions) assert that no obsolete
-  // files are hanging around unreferenced (leak) in the table/blob file cache.
+  // versions_.reset() may cause issues.
+  // Here we clean all unreferenced handles in table cache.
   // Now we assume all user queries have finished, so only version set itself
   // can possibly hold the blocks from block cache. After releasing unreferenced
   // handles here, only handles held by version set left and inside
@@ -664,9 +663,6 @@ Status DBImpl::CloseHelper() {
   // time a handle is released, we erase it from the cache too. By doing that,
   // we can guarantee that after versions_.reset(), table cache is empty
   // so the cache can be safely destroyed.
-#ifndef NDEBUG
-  TEST_VerifyNoObsoleteFilesCached(/*db_mutex_already_held=*/true);
-#endif  // !NDEBUG
   table_cache_->EraseUnRefEntries();
 
   for (auto& txn_entry : recovered_transactions_) {
@@ -2480,8 +2476,7 @@ Status DBImpl::GetImpl(const ReadOptions& read_options, const Slice& key,
         RecordTick(stats_, MEMTABLE_HIT);
       }
     }
-    if (!s.ok() && !s.IsMergeInProgress() && !s.IsNotFound()) {
-      assert(done);
+    if (!done && !s.ok() && !s.IsMergeInProgress()) {
       ReturnAndCleanupSuperVersion(cfd, sv);
       return s;
     }
@@ -3147,11 +3142,10 @@ Status DBImpl::MultiGetImpl(
   StopWatch sw(immutable_db_options_.clock, stats_, DB_MULTIGET);
 
   assert(sorted_keys);
-  assert(start_key + num_keys <= sorted_keys->size());
   // Clear the timestamps for returning results so that we can distinguish
   // between tombstone or key that has never been written
-  for (size_t i = start_key; i < start_key + num_keys; ++i) {
-    KeyContext* kctx = (*sorted_keys)[i];
+  for (auto* kctx : *sorted_keys) {
+    assert(kctx);
     if (kctx->timestamp) {
       kctx->timestamp->clear();
     }
@@ -3214,8 +3208,6 @@ Status DBImpl::MultiGetImpl(
       s = Status::Aborted();
       break;
     }
-    // This could be a long-running operation
-    ROCKSDB_THREAD_YIELD_HOOK();
   }
 
   // Post processing (decrement reference counts and record statistics)

db/db_impl/db_impl.h

@@ -1237,13 +1237,8 @@ class DBImpl : public DB {
   static Status TEST_ValidateOptions(const DBOptions& db_options) {
     return ValidateOptions(db_options);
   }
-#endif  // NDEBUG
 
-  // In certain configurations, verify that the table/blob file cache only
-  // contains entries for live files, to check for effective leaks of open
-  // files. This can only be called when purging of obsolete files has
-  // "settled," such as during parts of DB Close().
-  void TEST_VerifyNoObsoleteFilesCached(bool db_mutex_already_held) const;
+#endif  // NDEBUG
 
   // persist stats to column family "_persistent_stats"
   void PersistStats();
@@ -1895,10 +1890,6 @@ class DBImpl : public DB {
     Env::Priority compaction_pri_;
   };
 
-  static bool IsRecoveryFlush(FlushReason flush_reason) {
-    return flush_reason == FlushReason::kErrorRecoveryRetryFlush ||
-           flush_reason == FlushReason::kErrorRecovery;
-  }
   // Initialize the built-in column family for persistent stats. Depending on
   // whether on-disk persistent stats have been enabled before, it may either
   // create a new column family and column family handle or just a column family
@@ -2043,8 +2034,7 @@ class DBImpl : public DB {
   // REQUIRES: mutex held
   void SelectColumnFamiliesForAtomicFlush(
       autovector<ColumnFamilyData*>* selected_cfds,
-      const autovector<ColumnFamilyData*>& provided_candidate_cfds = {},
-      FlushReason flush_reason = FlushReason::kOthers);
+      const autovector<ColumnFamilyData*>& provided_candidate_cfds = {});
 
   // Force current memtable contents to be flushed.
   Status FlushMemTable(ColumnFamilyData* cfd, const FlushOptions& options,

db/db_impl/db_impl_compaction_flush.cc

@@ -2306,15 +2306,13 @@ Status DBImpl::FlushMemTable(ColumnFamilyData* cfd,
     }
     WaitForPendingWrites();
 
-    if (!cfd->mem()->IsEmpty() || !cached_recoverable_state_empty_.load() ||
-        IsRecoveryFlush(flush_reason)) {
+    if (!cfd->mem()->IsEmpty() || !cached_recoverable_state_empty_.load()) {
       s = SwitchMemtable(cfd, &context);
     }
     const uint64_t flush_memtable_id = std::numeric_limits<uint64_t>::max();
     if (s.ok()) {
       if (cfd->imm()->NumNotFlushed() != 0 || !cfd->mem()->IsEmpty() ||
-          !cached_recoverable_state_empty_.load() ||
-          IsRecoveryFlush(flush_reason)) {
+          !cached_recoverable_state_empty_.load()) {
         FlushRequest req{flush_reason, {{cfd, flush_memtable_id}}};
         flush_reqs.emplace_back(std::move(req));
         memtable_ids_to_wait.emplace_back(
@@ -2491,7 +2489,7 @@ Status DBImpl::AtomicFlushMemTables(
     }
     WaitForPendingWrites();
 
-    SelectColumnFamiliesForAtomicFlush(&cfds, candidate_cfds, flush_reason);
+    SelectColumnFamiliesForAtomicFlush(&cfds, candidate_cfds);
 
     // Unref the newly generated candidate cfds (when not provided) in
     // `candidate_cfds`
@@ -2502,8 +2500,7 @@ Status DBImpl::AtomicFlushMemTables(
     }
 
     for (auto cfd : cfds) {
-      if (cfd->mem()->IsEmpty() && cached_recoverable_state_empty_.load() &&
-          !IsRecoveryFlush(flush_reason)) {
+      if (cfd->mem()->IsEmpty() && cached_recoverable_state_empty_.load()) {
         continue;
       }
       cfd->Ref();

db/db_impl/db_impl_debug.cc

@@ -9,7 +9,6 @@
 
 #ifndef NDEBUG
 
-#include "db/blob/blob_file_cache.h"
 #include "db/column_family.h"
 #include "db/db_impl/db_impl.h"
 #include "db/error_handler.h"
@@ -324,49 +323,5 @@ size_t DBImpl::TEST_EstimateInMemoryStatsHistorySize() const {
   InstrumentedMutexLock l(&const_cast<DBImpl*>(this)->stats_history_mutex_);
   return EstimateInMemoryStatsHistorySize();
 }
-
-void DBImpl::TEST_VerifyNoObsoleteFilesCached(
-    bool db_mutex_already_held) const {
-  // This check is somewhat expensive and obscure to make a part of every
-  // unit test in every build variety. Thus, we only enable it for ASAN builds.
-  if (!kMustFreeHeapAllocations) {
-    return;
-  }
-
-  std::optional<InstrumentedMutexLock> l;
-  if (db_mutex_already_held) {
-    mutex_.AssertHeld();
-  } else {
-    l.emplace(&mutex_);
-  }
-
-  std::vector<uint64_t> live_files;
-  for (auto cfd : *versions_->GetColumnFamilySet()) {
-    if (cfd->IsDropped()) {
-      continue;
-    }
-    // Sneakily add both SST and blob files to the same list
-    cfd->current()->AddLiveFiles(&live_files, &live_files);
-  }
-  std::sort(live_files.begin(), live_files.end());
-
-  auto fn = [&live_files](const Slice& key, Cache::ObjectPtr, size_t,
-                          const Cache::CacheItemHelper* helper) {
-    if (helper != BlobFileCache::GetHelper()) {
-      // Skip non-blob files for now
-      // FIXME: diagnose and fix the leaks of obsolete SST files revealed in
-      // unit tests.
-      return;
-    }
-    // See TableCache and BlobFileCache
-    assert(key.size() == sizeof(uint64_t));
-    uint64_t file_number;
-    GetUnaligned(reinterpret_cast<const uint64_t*>(key.data()), &file_number);
-    // Assert file is in sorted live_files
-    assert(
-        std::binary_search(live_files.begin(), live_files.end(), file_number));
-  };
-  table_cache_->ApplyToAllEntries(fn, {});
-}
 }  // namespace ROCKSDB_NAMESPACE
 #endif  // NDEBUG

db/db_impl/db_impl_files.cc

@@ -970,9 +970,7 @@ Status DBImpl::SetupDBId(const WriteOptions& write_options, bool read_only,
   }
   // Persist it to IDENTITY file if allowed
   if (!read_only) {
-    s = SetIdentityFile(write_options, env_, dbname_,
-                        immutable_db_options_.metadata_write_temperature,
-                        db_id_);
+    s = SetIdentityFile(write_options, env_, dbname_, db_id_);
   }
   return s;
 }

db/db_impl/db_impl_open.cc

@@ -295,8 +295,7 @@ Status DBImpl::ValidateOptions(const DBOptions& db_options) {
 Status DBImpl::NewDB(std::vector<std::string>* new_filenames) {
   VersionEdit new_db;
   const WriteOptions write_options(Env::IOActivity::kDBOpen);
-  Status s = SetIdentityFile(write_options, env_, dbname_,
-                             immutable_db_options_.metadata_write_temperature);
+  Status s = SetIdentityFile(write_options, env_, dbname_);
   if (!s.ok()) {
     return s;
   }
@@ -320,12 +319,6 @@ Status DBImpl::NewDB(std::vector<std::string>* new_filenames) {
     }
     std::unique_ptr<FSWritableFile> file;
     FileOptions file_options = fs_->OptimizeForManifestWrite(file_options_);
-    // DB option takes precedence when not kUnknown
-    if (immutable_db_options_.metadata_write_temperature !=
-        Temperature::kUnknown) {
-      file_options.temperature =
-          immutable_db_options_.metadata_write_temperature;
-    }
     s = NewWritableFile(fs_.get(), manifest, &file, file_options);
     if (!s.ok()) {
       return s;
@@ -351,7 +344,6 @@ Status DBImpl::NewDB(std::vector<std::string>* new_filenames) {
   if (s.ok()) {
     // Make "CURRENT" file that points to the new manifest file.
     s = SetCurrentFile(write_options, fs_.get(), dbname_, 1,
-                       immutable_db_options_.metadata_write_temperature,
                        directories_.GetDbDir());
     if (new_filenames) {
       new_filenames->emplace_back(
@@ -1944,10 +1936,6 @@ IOStatus DBImpl::CreateWAL(const WriteOptions& write_options,
       BuildDBOptions(immutable_db_options_, mutable_db_options_);
   FileOptions opt_file_options =
       fs_->OptimizeForLogWrite(file_options_, db_options);
-  // DB option takes precedence when not kUnknown
-  if (immutable_db_options_.wal_write_temperature != Temperature::kUnknown) {
-    opt_file_options.temperature = immutable_db_options_.wal_write_temperature;
-  }
   std::string wal_dir = immutable_db_options_.GetWalDir();
   std::string log_fname = LogFileName(wal_dir, log_file_num);
 

db/db_impl/db_impl_write.cc

@@ -969,17 +969,21 @@ Status DBImpl::WriteImplWALOnly(
   assert(w.state == WriteThread::STATE_GROUP_LEADER);
 
   if (publish_last_seq == kDoPublishLastSeq) {
+    Status status;
+
     // Currently we only use kDoPublishLastSeq in unordered_write
     assert(immutable_db_options_.unordered_write);
-
+    WriteContext write_context;
+    if (error_handler_.IsDBStopped()) {
+      status = error_handler_.GetBGError();
+    }
     // TODO(myabandeh): Make preliminary checks thread-safe so we could do them
     // without paying the cost of obtaining the mutex.
-    LogContext log_context;
-    WriteContext write_context;
-    Status status =
-        PreprocessWrite(write_options, &log_context, &write_context);
-    WriteStatusCheckOnLocked(status);
-
+    if (status.ok()) {
+      LogContext log_context;
+      status = PreprocessWrite(write_options, &log_context, &write_context);
+      WriteStatusCheckOnLocked(status);
+    }
     if (!status.ok()) {
       WriteThread::WriteGroup write_group;
       write_thread->EnterAsBatchGroupLeader(&w, &write_group);
@@ -1407,7 +1411,6 @@ IOStatus DBImpl::WriteToWAL(const WriteBatch& merged_batch,
   total_log_size_ += log_entry.size();
   log_file_number_size.AddSize(*log_size);
   log_empty_ = false;
-
   return io_s;
 }
 
@@ -1480,14 +1483,9 @@ IOStatus DBImpl::WriteToWAL(const WriteThread::WriteGroup& write_group,
         if (!io_s.ok()) {
           break;
         }
-        // If last sync failed on a later WAL, this could be a fully synced
-        // and closed WAL that just needs to be recorded as synced in the
-        // manifest.
-        if (auto* f = log.writer->file()) {
-          io_s = f->Sync(opts, immutable_db_options_.use_fsync);
-          if (!io_s.ok()) {
-            break;
-          }
+        io_s = log.writer->file()->Sync(opts, immutable_db_options_.use_fsync);
+        if (!io_s.ok()) {
+          break;
         }
       }
     }
@@ -1652,8 +1650,7 @@ Status DBImpl::WriteRecoverableState() {
 
 void DBImpl::SelectColumnFamiliesForAtomicFlush(
     autovector<ColumnFamilyData*>* selected_cfds,
-    const autovector<ColumnFamilyData*>& provided_candidate_cfds,
-    FlushReason flush_reason) {
+    const autovector<ColumnFamilyData*>& provided_candidate_cfds) {
   mutex_.AssertHeld();
   assert(selected_cfds);
 
@@ -1676,8 +1673,7 @@ void DBImpl::SelectColumnFamiliesForAtomicFlush(
       continue;
     }
     if (cfd->imm()->NumNotFlushed() != 0 || !cfd->mem()->IsEmpty() ||
-        !cached_recoverable_state_empty_.load() ||
-        IsRecoveryFlush(flush_reason)) {
+        !cached_recoverable_state_empty_.load()) {
       selected_cfds->push_back(cfd);
     }
   }

db/db_io_failure_test.cc

@@ -895,81 +895,6 @@ TEST_P(DBIOCorruptionTest, ManifestCorruptionRetry) {
   SyncPoint::GetInstance()->DisableProcessing();
 }
 
-TEST_P(DBIOCorruptionTest, FooterReadCorruptionRetry) {
-  Random rnd(300);
-  bool retry = false;
-
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->SetCallBack(
-      "ReadFooterFromFileInternal:0", [&](void* arg) {
-        Slice* data = static_cast<Slice*>(arg);
-        if (!retry) {
-          std::memcpy(const_cast<char*>(data->data()),
-                      rnd.RandomString(static_cast<int>(data->size())).c_str(),
-                      data->size());
-          retry = true;
-        }
-      });
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->EnableProcessing();
-
-  ASSERT_OK(Put("key1", "val1"));
-  Status s = Flush();
-  if (std::get<2>(GetParam())) {
-    ASSERT_OK(s);
-    ASSERT_EQ(stats()->getTickerCount(FILE_READ_CORRUPTION_RETRY_COUNT), 1);
-    ASSERT_EQ(stats()->getTickerCount(FILE_READ_CORRUPTION_RETRY_SUCCESS_COUNT),
-              1);
-
-    std::string val;
-    ReadOptions ro;
-    ro.async_io = std::get<1>(GetParam());
-    ASSERT_OK(dbfull()->Get(ro, "key1", &val));
-    ASSERT_EQ(val, "val1");
-  } else {
-    ASSERT_NOK(s);
-    ASSERT_EQ(stats()->getTickerCount(FILE_READ_CORRUPTION_RETRY_COUNT), 0);
-    ASSERT_GT(stats()->getTickerCount(SST_FOOTER_CORRUPTION_COUNT), 0);
-  }
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->DisableProcessing();
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->ClearAllCallBacks();
-}
-
-TEST_P(DBIOCorruptionTest, TablePropertiesCorruptionRetry) {
-  Random rnd(300);
-  bool retry = false;
-
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->SetCallBack(
-      "ReadTablePropertiesHelper:0", [&](void* arg) {
-        Slice* data = static_cast<Slice*>(arg);
-        if (!retry) {
-          std::memcpy(const_cast<char*>(data->data()),
-                      rnd.RandomString(static_cast<int>(data->size())).c_str(),
-                      data->size());
-          retry = true;
-        }
-      });
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->EnableProcessing();
-
-  ASSERT_OK(Put("key1", "val1"));
-  Status s = Flush();
-  if (std::get<2>(GetParam())) {
-    ASSERT_OK(s);
-    ASSERT_EQ(stats()->getTickerCount(FILE_READ_CORRUPTION_RETRY_COUNT), 1);
-    ASSERT_EQ(stats()->getTickerCount(FILE_READ_CORRUPTION_RETRY_SUCCESS_COUNT),
-              1);
-
-    std::string val;
-    ReadOptions ro;
-    ro.async_io = std::get<1>(GetParam());
-    ASSERT_OK(dbfull()->Get(ro, "key1", &val));
-    ASSERT_EQ(val, "val1");
-  } else {
-    ASSERT_NOK(s);
-    ASSERT_EQ(stats()->getTickerCount(FILE_READ_CORRUPTION_RETRY_COUNT), 0);
-  }
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->DisableProcessing();
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->ClearAllCallBacks();
-}
-
 // The parameters are - 1. Use FS provided buffer, 2. Use async IO ReadOption,
 // 3. Retry with verify_and_reconstruct_read IOOption
 INSTANTIATE_TEST_CASE_P(DBIOCorruptionTest, DBIOCorruptionTest,

db/db_iter.cc

@@ -538,8 +538,6 @@ bool DBIter::FindNextUserEntryInternal(bool skipping_saved_key,
     } else {
       iter_.Next();
     }
-    // This could be a long-running operation due to tombstones, etc.
-    ROCKSDB_THREAD_YIELD_HOOK();
   } while (iter_.Valid());
 
   valid_ = false;

db/db_kv_checksum_test.cc

@@ -684,14 +684,13 @@ class DbMemtableKVChecksumTest : public DbKvChecksumTest {
   DbMemtableKVChecksumTest() : DbKvChecksumTest() {}
 
  protected:
-  const size_t kValueLenOffset = 12;
   // Indices in the memtable entry that we will not corrupt.
   // For memtable entry format, see comments in MemTable::Add().
   // We do not corrupt key length and value length fields in this test
   // case since it causes segfault and ASAN will complain.
   // For this test case, key and value are all of length 3, so
   // key length field is at index 0 and value length field is at index 12.
-  const std::set<size_t> index_not_to_corrupt{0, kValueLenOffset};
+  const std::set<size_t> index_not_to_corrupt{0, 12};
 
   void SkipNotToCorruptEntry() {
     if (index_not_to_corrupt.find(corrupt_byte_offset_) !=
@@ -738,8 +737,6 @@ TEST_P(DbMemtableKVChecksumTest, GetWithCorruptAfterMemtableInsert) {
         buf[corrupt_byte_offset_] += corrupt_byte_addend_;
         ++corrupt_byte_offset_;
       });
-  // Corrupt value only so that MultiGet below can find the key.
-  corrupt_byte_offset_ = kValueLenOffset + 1;
   SyncPoint::GetInstance()->EnableProcessing();
   Options options = CurrentOptions();
   options.memtable_protection_bytes_per_key =
@@ -748,17 +745,12 @@ TEST_P(DbMemtableKVChecksumTest, GetWithCorruptAfterMemtableInsert) {
     options.merge_operator = MergeOperators::CreateStringAppendOperator();
   }
 
-  std::string key = "key";
   SkipNotToCorruptEntry();
   while (MoreBytesToCorrupt()) {
     Reopen(options);
     ASSERT_OK(ExecuteWrite(nullptr));
     std::string val;
-    ASSERT_TRUE(db_->Get(ReadOptions(), key, &val).IsCorruption());
-    std::vector<std::string> vals = {val};
-    std::vector<Status> statuses = db_->MultiGet(
-        ReadOptions(), {db_->DefaultColumnFamily()}, {key}, &vals, nullptr);
-    ASSERT_TRUE(statuses[0].IsCorruption());
+    ASSERT_TRUE(db_->Get(ReadOptions(), "key", &val).IsCorruption());
     Destroy(options);
     SkipNotToCorruptEntry();
   }

db/db_memtable_test.cc

@@ -339,91 +339,6 @@ TEST_F(DBMemTableTest, ColumnFamilyId) {
   }
 }
 
-TEST_F(DBMemTableTest, IntegrityChecks) {
-  // We insert keys key000000, key000001 and key000002 into skiplist at fixed
-  // height 1 (smallest height). Then we corrupt the second key to aey000001 to
-  // make it smaller. With `paranoid_memory_checks` set to true, if the
-  // skip list sees key000000 and then aey000001, then it will report out of
-  // order keys with corruption status. With `paranoid_memory_checks` set
-  // to false, read/scan may return wrong results.
-  for (bool allow_data_in_error : {false, true}) {
-    Options options = CurrentOptions();
-    options.allow_data_in_errors = allow_data_in_error;
-    options.paranoid_memory_checks = true;
-    DestroyAndReopen(options);
-    SyncPoint::GetInstance()->SetCallBack(
-        "InlineSkipList::RandomHeight::height", [](void* h) {
-          auto height_ptr = static_cast<int*>(h);
-          *height_ptr = 1;
-        });
-    SyncPoint::GetInstance()->EnableProcessing();
-    ASSERT_OK(Put(Key(0), "val0"));
-    ASSERT_OK(Put(Key(2), "val2"));
-    // p will point to the buffer for encoded key000001
-    char* p = nullptr;
-    SyncPoint::GetInstance()->SetCallBack(
-        "MemTable::Add:BeforeReturn:Encoded", [&](void* encoded) {
-          p = const_cast<char*>(static_cast<Slice*>(encoded)->data());
-        });
-    ASSERT_OK(Put(Key(1), "val1"));
-    SyncPoint::GetInstance()->DisableProcessing();
-    SyncPoint::GetInstance()->ClearAllCallBacks();
-    ASSERT_TRUE(p);
-    // Offset 0 is key size, key bytes start at offset 1.
-    // "key000001 -> aey000001"
-    p[1] = 'a';
-
-    ReadOptions rops;
-    std::string val;
-    Status s = db_->Get(rops, Key(1), &val);
-    ASSERT_TRUE(s.IsCorruption());
-    std::string key0 = Slice(Key(0)).ToString(true);
-    ASSERT_EQ(s.ToString().find(key0) != std::string::npos,
-              allow_data_in_error);
-    // Without `paranoid_memory_checks`, NotFound will be returned.
-    // This would fail an assertion in InlineSkipList::FindGreaterOrEqual().
-    // If we remove the assertion, this passes.
-    // ASSERT_TRUE(db_->Get(ReadOptions(), Key(1), &val).IsNotFound());
-
-    std::vector<std::string> vals;
-    std::vector<Status> statuses = db_->MultiGet(
-        rops, {db_->DefaultColumnFamily()}, {Key(1)}, &vals, nullptr);
-    ASSERT_TRUE(statuses[0].IsCorruption());
-    ASSERT_EQ(statuses[0].ToString().find(key0) != std::string::npos,
-              allow_data_in_error);
-
-    std::unique_ptr<Iterator> iter{db_->NewIterator(rops)};
-    ASSERT_OK(iter->status());
-    iter->Seek(Key(1));
-    ASSERT_TRUE(iter->status().IsCorruption());
-    ASSERT_EQ(iter->status().ToString().find(key0) != std::string::npos,
-              allow_data_in_error);
-
-    iter->Seek(Key(0));
-    ASSERT_TRUE(iter->Valid());
-    ASSERT_OK(iter->status());
-    // iterating through skip list at height at 1 should catch out-of-order keys
-    iter->Next();
-    ASSERT_TRUE(iter->status().IsCorruption());
-    ASSERT_EQ(iter->status().ToString().find(key0) != std::string::npos,
-              allow_data_in_error);
-    ASSERT_FALSE(iter->Valid());
-
-    iter->SeekForPrev(Key(2));
-    ASSERT_TRUE(iter->status().IsCorruption());
-    ASSERT_EQ(iter->status().ToString().find(key0) != std::string::npos,
-              allow_data_in_error);
-
-    // Internally DB Iter will iterate backwards (call Prev()) after
-    // SeekToLast() to find the correct internal key with the last user key.
-    // Prev() will do integrity checks and catch corruption.
-    iter->SeekToLast();
-    ASSERT_TRUE(iter->status().IsCorruption());
-    ASSERT_EQ(iter->status().ToString().find(key0) != std::string::npos,
-              allow_data_in_error);
-    ASSERT_FALSE(iter->Valid());
-  }
-}
 }  // namespace ROCKSDB_NAMESPACE
 
 int main(int argc, char** argv) {

db/db_sst_test.cc

@@ -917,9 +917,8 @@ TEST_P(DBWALTestWithParam, WALTrashCleanupOnOpen) {
   // Create 4 files in L0
   for (char v = 'a'; v <= 'd'; v++) {
     if (v == 'c') {
-      // Maximize the chance that the last log file will be preserved in trash
-      // before restarting the DB. (Enable slow deletion but at a very slow
-      // deletion rate)
+      // Maximize the change that the last log file will be preserved in trash
+      // before restarting the DB.
       // We have to set this on the 2nd to last file for it to delay deletion
       // on the last file. (Quirk of DeleteScheduler::BackgroundEmptyTrash())
       options.sst_file_manager->SetDeleteRateBytesPerSecond(1);

db/db_test2.cc

@@ -10,7 +10,6 @@
 #include <atomic>
 #include <cstdlib>
 #include <functional>
-#include <iostream>
 #include <memory>
 
 #include "db/db_test_util.h"
@@ -27,7 +26,6 @@
 #include "rocksdb/utilities/replayer.h"
 #include "rocksdb/wal_filter.h"
 #include "test_util/testutil.h"
-#include "util/defer.h"
 #include "util/random.h"
 #include "utilities/fault_injection_env.h"
 
@@ -6546,235 +6544,6 @@ TEST_P(RenameCurrentTest, Compaction) {
   ASSERT_EQ("d_value", Get("d"));
 }
 
-TEST_F(DBTest2, VariousFileTemperatures) {
-  constexpr size_t kNumberFileTypes = static_cast<size_t>(kBlobFile) + 1U;
-
-  struct MyTestFS : public FileTemperatureTestFS {
-    explicit MyTestFS(const std::shared_ptr<FileSystem>& fs)
-        : FileTemperatureTestFS(fs) {
-      Reset();
-    }
-
-    IOStatus NewWritableFile(const std::string& fname, const FileOptions& opts,
-                             std::unique_ptr<FSWritableFile>* result,
-                             IODebugContext* dbg) override {
-      IOStatus ios =
-          FileTemperatureTestFS::NewWritableFile(fname, opts, result, dbg);
-      if (ios.ok()) {
-        uint64_t number;
-        FileType type;
-        if (ParseFileName(GetFileName(fname), &number, "LOG", &type)) {
-          if (type == kTableFile) {
-            // Not checked here
-          } else if (type == kWalFile) {
-            if (opts.temperature != expected_wal_temperature) {
-              std::cerr << "Attempt to open " << fname << " with temperature "
-                        << temperature_to_string[opts.temperature]
-                        << " rather than "
-                        << temperature_to_string[expected_wal_temperature]
-                        << std::endl;
-              assert(false);
-            }
-          } else if (type == kDescriptorFile) {
-            if (opts.temperature != expected_manifest_temperature) {
-              std::cerr << "Attempt to open " << fname << " with temperature "
-                        << temperature_to_string[opts.temperature]
-                        << " rather than "
-                        << temperature_to_string[expected_wal_temperature]
-                        << std::endl;
-              assert(false);
-            }
-          } else if (opts.temperature != expected_other_metadata_temperature) {
-            std::cerr << "Attempt to open " << fname << " with temperature "
-                      << temperature_to_string[opts.temperature]
-                      << " rather than "
-                      << temperature_to_string[expected_wal_temperature]
-                      << std::endl;
-            assert(false);
-          }
-          UpdateCount(type, 1);
-        }
-      }
-      return ios;
-    }
-
-    IOStatus RenameFile(const std::string& src, const std::string& dst,
-                        const IOOptions& options,
-                        IODebugContext* dbg) override {
-      IOStatus ios = FileTemperatureTestFS::RenameFile(src, dst, options, dbg);
-      if (ios.ok()) {
-        uint64_t number;
-        FileType src_type;
-        FileType dst_type;
-        assert(ParseFileName(GetFileName(src), &number, "LOG", &src_type));
-        assert(ParseFileName(GetFileName(dst), &number, "LOG", &dst_type));
-
-        UpdateCount(src_type, -1);
-        UpdateCount(dst_type, 1);
-      }
-      return ios;
-    }
-
-    void UpdateCount(FileType type, int delta) {
-      size_t i = static_cast<size_t>(type);
-      assert(i < kNumberFileTypes);
-      counts[i].FetchAddRelaxed(delta);
-    }
-
-    std::map<FileType, size_t> PopCounts() {
-      std::map<FileType, size_t> ret;
-      for (size_t i = 0; i < kNumberFileTypes; ++i) {
-        int c = counts[i].ExchangeRelaxed(0);
-        if (c > 0) {
-          ret[static_cast<FileType>(i)] = c;
-        }
-      }
-      return ret;
-    }
-
-    FileOptions OptimizeForLogWrite(
-        const FileOptions& file_options,
-        const DBOptions& /*db_options*/) const override {
-      FileOptions opts = file_options;
-      if (optimize_wal_temperature != Temperature::kUnknown) {
-        opts.temperature = optimize_wal_temperature;
-      }
-      return opts;
-    }
-
-    FileOptions OptimizeForManifestWrite(
-        const FileOptions& file_options) const override {
-      FileOptions opts = file_options;
-      if (optimize_manifest_temperature != Temperature::kUnknown) {
-        opts.temperature = optimize_manifest_temperature;
-      }
-      return opts;
-    }
-
-    void Reset() {
-      optimize_manifest_temperature = Temperature::kUnknown;
-      optimize_wal_temperature = Temperature::kUnknown;
-      expected_manifest_temperature = Temperature::kUnknown;
-      expected_other_metadata_temperature = Temperature::kUnknown;
-      expected_wal_temperature = Temperature::kUnknown;
-      for (auto& c : counts) {
-        c.StoreRelaxed(0);
-      }
-    }
-
-    Temperature optimize_manifest_temperature;
-    Temperature optimize_wal_temperature;
-    Temperature expected_manifest_temperature;
-    Temperature expected_other_metadata_temperature;
-    Temperature expected_wal_temperature;
-    std::array<RelaxedAtomic<int>, kNumberFileTypes> counts;
-  };
-
-  // We don't have enough non-unknown temps to confidently distinguish that
-  // a specific setting caused a specific outcome, in a single run. This is a
-  // reasonable work-around without blowing up test time. Only returns
-  // non-unknown temperatures.
-  auto RandomTemp = [] {
-    static std::vector<Temperature> temps = {
-        Temperature::kHot, Temperature::kWarm, Temperature::kCold};
-    return temps[Random::GetTLSInstance()->Uniform(
-        static_cast<int>(temps.size()))];
-  };
-
-  auto test_fs = std::make_shared<MyTestFS>(env_->GetFileSystem());
-  std::unique_ptr<Env> env(new CompositeEnvWrapper(env_, test_fs));
-  for (bool use_optimize : {false, true}) {
-    std::cerr << "use_optimize: " << std::to_string(use_optimize) << std::endl;
-    for (bool use_temp_options : {false, true}) {
-      std::cerr << "use_temp_options: " << std::to_string(use_temp_options)
-                << std::endl;
-
-      Options options = CurrentOptions();
-      // Currently require for last level temperature
-      options.compaction_style = kCompactionStyleUniversal;
-      options.env = env.get();
-      test_fs->Reset();
-      if (use_optimize) {
-        test_fs->optimize_manifest_temperature = RandomTemp();
-        test_fs->expected_manifest_temperature =
-            test_fs->optimize_manifest_temperature;
-        test_fs->optimize_wal_temperature = RandomTemp();
-        test_fs->expected_wal_temperature = test_fs->optimize_wal_temperature;
-      }
-      if (use_temp_options) {
-        options.metadata_write_temperature = RandomTemp();
-        test_fs->expected_manifest_temperature =
-            options.metadata_write_temperature;
-        test_fs->expected_other_metadata_temperature =
-            options.metadata_write_temperature;
-        options.wal_write_temperature = RandomTemp();
-        test_fs->expected_wal_temperature = options.wal_write_temperature;
-        options.last_level_temperature = RandomTemp();
-        options.default_write_temperature = RandomTemp();
-      }
-
-      DestroyAndReopen(options);
-      Defer closer([&] { Close(); });
-
-      using FTC = std::map<FileType, size_t>;
-      // Files on DB startup
-      ASSERT_EQ(test_fs->PopCounts(), FTC({{kWalFile, 1},
-                                           {kDescriptorFile, 2},
-                                           {kCurrentFile, 2},
-                                           {kIdentityFile, 1},
-                                           {kOptionsFile, 1}}));
-
-      // Temperature count map
-      using TCM = std::map<Temperature, size_t>;
-      ASSERT_EQ(test_fs->CountCurrentSstFilesByTemp(), TCM({}));
-
-      ASSERT_OK(Put("foo", "1"));
-      ASSERT_OK(Put("bar", "1"));
-      ASSERT_OK(Flush());
-      ASSERT_OK(Put("foo", "2"));
-      ASSERT_OK(Put("bar", "2"));
-      ASSERT_OK(Flush());
-
-      ASSERT_EQ(test_fs->CountCurrentSstFilesByTemp(),
-                TCM({{options.default_write_temperature, 2}}));
-
-      ASSERT_OK(db_->CompactRange({}, nullptr, nullptr));
-      ASSERT_OK(dbfull()->TEST_WaitForBackgroundWork());
-
-      ASSERT_EQ(test_fs->CountCurrentSstFilesByTemp(),
-                TCM({{options.last_level_temperature, 1}}));
-
-      ASSERT_OK(Put("foo", "3"));
-      ASSERT_OK(Put("bar", "3"));
-      ASSERT_OK(Flush());
-
-      // Just in memtable/WAL
-      ASSERT_OK(Put("dog", "3"));
-
-      {
-        TCM expected;
-        expected[options.default_write_temperature] += 1;
-        expected[options.last_level_temperature] += 1;
-        ASSERT_EQ(test_fs->CountCurrentSstFilesByTemp(), expected);
-      }
-
-      // New files during operation
-      ASSERT_EQ(test_fs->PopCounts(), FTC({{kWalFile, 3}, {kTableFile, 4}}));
-
-      Reopen(options);
-
-      // New files during re-open/recovery
-      ASSERT_EQ(test_fs->PopCounts(), FTC({{kWalFile, 1},
-                                           {kTableFile, 1},
-                                           {kDescriptorFile, 1},
-                                           {kCurrentFile, 1},
-                                           {kOptionsFile, 1}}));
-
-      Destroy(options);
-    }
-  }
-}
-
 TEST_F(DBTest2, LastLevelTemperature) {
   class TestListener : public EventListener {
    public:

db/db_test_util.cc

@@ -366,11 +366,6 @@ Options DBTestBase::GetOptions(
     table_options.block_cache = NewLRUCache(/* too small */ 1);
   }
 
-  // Test anticipated new default as much as reasonably possible (and remove
-  // this code when obsolete)
-  assert(!table_options.decouple_partitioned_filters);
-  table_options.decouple_partitioned_filters = true;
-
   bool can_allow_mmap = IsMemoryMappedAccessSupported();
   switch (option_config) {
     case kHashSkipList:

db/db_test_util.h

@@ -831,15 +831,6 @@ class FileTemperatureTestFS : public FileSystemWrapper {
     return count;
   }
 
-  std::map<Temperature, size_t> CountCurrentSstFilesByTemp() {
-    MutexLock lock(&mu_);
-    std::map<Temperature, size_t> ret;
-    for (const auto& e : current_sst_file_temperatures_) {
-      ret[e.second]++;
-    }
-    return ret;
-  }
-
   void OverrideSstFileTemperature(uint64_t number, Temperature temp) {
     MutexLock lock(&mu_);
     current_sst_file_temperatures_[number] = temp;
@@ -851,7 +842,7 @@ class FileTemperatureTestFS : public FileSystemWrapper {
       requested_sst_file_temperatures_;
   std::map<uint64_t, Temperature> current_sst_file_temperatures_;
 
-  static std::string GetFileName(const std::string& fname) {
+  std::string GetFileName(const std::string& fname) {
     auto filename = fname.substr(fname.find_last_of(kFilePathSeparator) + 1);
     // workaround only for Windows that the file path could contain both Windows
     // FilePathSeparator and '/'

db/db_universal_compaction_test.cc

@@ -213,6 +213,7 @@ TEST_P(DBTestUniversalCompaction, UniversalCompactionTrigger) {
   options.num_levels = num_levels_;
   options.write_buffer_size = 105 << 10;  // 105KB
   options.arena_block_size = 4 << 10;
+  options.target_file_size_base = 32 << 10;  // 32KB
   // trigger compaction if there are >= 4 files
   options.level0_file_num_compaction_trigger = 4;
   KeepFilterFactory* filter = new KeepFilterFactory(true);

db/db_wal_test.cc

@@ -1472,126 +1472,6 @@ TEST_F(DBWALTest, SyncMultipleLogs) {
   ASSERT_OK(dbfull()->SyncWAL());
 }
 
-TEST_F(DBWALTest, DISABLED_RecycleMultipleWalsCrash) {
-  Options options = CurrentOptions();
-  options.max_write_buffer_number = 5;
-  options.track_and_verify_wals_in_manifest = true;
-  options.max_bgerror_resume_count = 0;  // manual resume
-  options.recycle_log_file_num = 3;
-  options.wal_recovery_mode = WALRecoveryMode::kPointInTimeRecovery;
-
-  // Disable truncating recycled WALs to new size in posix env
-  // (approximating a crash)
-  SyncPoint::GetInstance()->SetCallBack(
-      "PosixWritableFile::Close",
-      [](void* arg) { *(static_cast<size_t*>(arg)) = 0; });
-  SyncPoint::GetInstance()->EnableProcessing();
-
-  // Re-open with desired options
-  DestroyAndReopen(options);
-  Defer closer([this]() { Close(); });
-
-  // Ensure WAL recycling wasn't sanitized away
-  ASSERT_EQ(db_->GetOptions().recycle_log_file_num,
-            options.recycle_log_file_num);
-
-  // Prepare external files for later ingestion
-  std::string sst_files_dir = dbname_ + "/sst_files/";
-  ASSERT_OK(DestroyDir(env_, sst_files_dir));
-  ASSERT_OK(env_->CreateDir(sst_files_dir));
-  std::string external_file1 = sst_files_dir + "file1.sst";
-  {
-    SstFileWriter sst_file_writer(EnvOptions(), options);
-    ASSERT_OK(sst_file_writer.Open(external_file1));
-    ASSERT_OK(sst_file_writer.Put("external1", "ex1"));
-    ExternalSstFileInfo file_info;
-    ASSERT_OK(sst_file_writer.Finish(&file_info));
-  }
-  std::string external_file2 = sst_files_dir + "file2.sst";
-  {
-    SstFileWriter sst_file_writer(EnvOptions(), options);
-    ASSERT_OK(sst_file_writer.Open(external_file2));
-    ASSERT_OK(sst_file_writer.Put("external2", "ex2"));
-    ExternalSstFileInfo file_info;
-    ASSERT_OK(sst_file_writer.Finish(&file_info));
-  }
-
-  // Populate some WALs to be recycled such that there will be extra data
-  // from an old incarnation of the WAL on recovery
-  ASSERT_OK(db_->PauseBackgroundWork());
-  ASSERT_OK(Put("ignore1", Random::GetTLSInstance()->RandomString(500)));
-  ASSERT_OK(static_cast_with_check<DBImpl>(db_)->TEST_SwitchMemtable());
-  ASSERT_OK(Put("ignore2", Random::GetTLSInstance()->RandomString(500)));
-  ASSERT_OK(static_cast_with_check<DBImpl>(db_)->TEST_SwitchMemtable());
-  ASSERT_OK(db_->ContinueBackgroundWork());
-  ASSERT_OK(Flush());
-  ASSERT_OK(Put("ignore3", Random::GetTLSInstance()->RandomString(500)));
-  ASSERT_OK(Flush());
-
-  // Verify expected log files (still there for recycling)
-  std::vector<FileAttributes> files;
-  int log_count = 0;
-  ASSERT_OK(options.env->GetChildrenFileAttributes(dbname_, &files));
-  for (const auto& f : files) {
-    if (EndsWith(f.name, ".log")) {
-      EXPECT_GT(f.size_bytes, 500);
-      ++log_count;
-    }
-  }
-  EXPECT_EQ(log_count, 3);
-
-  // (Re-used recipe) Generate two inactive WALs and one active WAL, with a
-  // gap in sequence numbers to interfere with recovery
-  ASSERT_OK(db_->PauseBackgroundWork());
-  ASSERT_OK(Put("key1", "val1"));
-  ASSERT_OK(static_cast_with_check<DBImpl>(db_)->TEST_SwitchMemtable());
-  ASSERT_OK(Put("key2", "val2"));
-  ASSERT_OK(static_cast_with_check<DBImpl>(db_)->TEST_SwitchMemtable());
-  // Need a gap in sequence numbers, so e.g. ingest external file
-  // with an open snapshot
-  {
-    ManagedSnapshot snapshot(db_);
-    ASSERT_OK(
-        db_->IngestExternalFile({external_file1}, IngestExternalFileOptions()));
-  }
-  ASSERT_OK(Put("key3", "val3"));
-  ASSERT_OK(db_->SyncWAL());
-  // Need an SST file that is logically after that WAL, so that dropping WAL
-  // data is not a valid point in time.
-  {
-    ManagedSnapshot snapshot(db_);
-    ASSERT_OK(
-        db_->IngestExternalFile({external_file2}, IngestExternalFileOptions()));
-  }
-
-  // Approximate a crash, with respect to recycled WAL data extending past
-  // the end of the current WAL data (see SyncPoint callback above)
-  Close();
-
-  // Verify recycled log files haven't been truncated
-  files.clear();
-  log_count = 0;
-  ASSERT_OK(options.env->GetChildrenFileAttributes(dbname_, &files));
-  for (const auto& f : files) {
-    if (EndsWith(f.name, ".log")) {
-      EXPECT_GT(f.size_bytes, 500);
-      ++log_count;
-    }
-  }
-  EXPECT_EQ(log_count, 3);
-
-  // Verify no data loss after reopen.
-  Reopen(options);
-  EXPECT_EQ("val1", Get("key1"));
-  EXPECT_EQ("val2", Get("key2"));  // Passes because of adjacent seqnos
-  EXPECT_EQ("ex1", Get("external1"));
-  EXPECT_EQ("val3", Get("key3"));  // <- ONLY FAILURE! (Not a point in time)
-  EXPECT_EQ("ex2", Get("external2"));
-
-  SyncPoint::GetInstance()->DisableProcessing();
-  SyncPoint::GetInstance()->ClearAllCallBacks();
-}
-
 TEST_F(DBWALTest, SyncWalPartialFailure) {
   class MyTestFileSystem : public FileSystemWrapper {
    public:
@@ -1652,7 +1532,7 @@ TEST_F(DBWALTest, SyncWalPartialFailure) {
   // * one inactive WAL, not synced, and
   // * one active WAL, not synced
   // with a single thread, to exercise as much logic as we reasonably can.
-  ASSERT_OK(db_->PauseBackgroundWork());
+  ASSERT_OK(static_cast_with_check<DBImpl>(db_)->PauseBackgroundWork());
   ASSERT_OK(Put("key1", "val1"));
   ASSERT_OK(static_cast_with_check<DBImpl>(db_)->TEST_SwitchMemtable());
   ASSERT_OK(db_->SyncWAL());
@@ -2877,60 +2757,6 @@ TEST_F(DBWALTest, EmptyWalReopenTest) {
   }
 }
 
-TEST_F(DBWALTest, RecoveryFlushSwitchWALOnEmptyMemtable) {
-  Options options = CurrentOptions();
-  auto fault_fs = std::make_shared<FaultInjectionTestFS>(FileSystem::Default());
-  std::unique_ptr<Env> fault_fs_env(NewCompositeEnv(fault_fs));
-  options.env = fault_fs_env.get();
-  options.avoid_flush_during_shutdown = true;
-  DestroyAndReopen(options);
-
-  // Make sure the memtable switch in recovery flush happened after test checks
-  // the memtable is empty.
-  SyncPoint::GetInstance()->LoadDependency(
-      {{"DBWALTest.RecoveryFlushSwitchWALOnEmptyMemtable:"
-        "AfterCheckMemtableEmpty",
-        "RecoverFromRetryableBGIOError:BeforeStart"}});
-  SyncPoint::GetInstance()->EnableProcessing();
-  fault_fs->SetThreadLocalErrorContext(
-      FaultInjectionIOType::kMetadataWrite, 7 /* seed*/, 1 /* one_in */,
-      true /* retryable */, false /* has_data_loss*/);
-  fault_fs->EnableThreadLocalErrorInjection(
-      FaultInjectionIOType::kMetadataWrite);
-
-  WriteOptions wo;
-  wo.sync = true;
-  Status s = Put("k", "old_v", wo);
-  ASSERT_TRUE(s.IsIOError());
-  // To verify the key is not in memtable nor SST
-  ASSERT_TRUE(static_cast<ColumnFamilyHandleImpl*>(db_->DefaultColumnFamily())
-                  ->cfd()
-                  ->mem()
-                  ->IsEmpty());
-  ASSERT_EQ("NOT_FOUND", Get("k"));
-  TEST_SYNC_POINT(
-      "DBWALTest.RecoveryFlushSwitchWALOnEmptyMemtable:"
-      "AfterCheckMemtableEmpty");
-  SyncPoint::GetInstance()->DisableProcessing();
-
-  fault_fs->DisableThreadLocalErrorInjection(
-      FaultInjectionIOType::kMetadataWrite);
-
-  // Keep trying write until recovery of the previous IO error finishes
-  while (!s.ok()) {
-    options.env->SleepForMicroseconds(1000);
-    s = Put("k", "new_v");
-  }
-
-  // If recovery flush didn't switch WAL, we will end up having two duplicate
-  // WAL entries with same seqno and same key that violate assertion during WAL
-  // recovery and fail DB reopen
-  options.avoid_flush_during_recovery = false;
-  Reopen(options);
-
-  ASSERT_EQ("new_v", Get("k"));
-  Destroy(options);
-}
 }  // namespace ROCKSDB_NAMESPACE
 
 int main(int argc, char** argv) {

db/db_with_timestamp_basic_test.cc

@@ -172,70 +172,6 @@ TEST_F(DBBasicTestWithTimestamp, MixedCfs) {
   Close();
 }
 
-TEST_F(DBBasicTestWithTimestamp, MultiGetMultipleCfs) {
-  const size_t kTimestampSize = Timestamp(0, 0).size();
-  TestComparator test_cmp(kTimestampSize);
-  Options options = CurrentOptions();
-  options.env = env_;
-  options.create_if_missing = true;
-  options.avoid_flush_during_shutdown = true;
-  options.comparator = &test_cmp;
-  DestroyAndReopen(options);
-
-  Options options1 = CurrentOptions();
-  options1.env = env_;
-  options1.comparator = &test_cmp;
-  ColumnFamilyHandle* handle = nullptr;
-  Status s = db_->CreateColumnFamily(options1, "data", &handle);
-  ASSERT_OK(s);
-
-  std::string ts = Timestamp(1, 0);
-  WriteBatch wb(0, 0, 0, kTimestampSize);
-  ASSERT_OK(wb.Put("a", "value"));
-  ASSERT_OK(wb.Put(handle, "a", "value"));
-  const auto ts_sz_func = [kTimestampSize](uint32_t /*cf_id*/) {
-    return kTimestampSize;
-  };
-  ASSERT_OK(wb.UpdateTimestamps(ts, ts_sz_func));
-  ASSERT_OK(db_->Write(WriteOptions(), &wb));
-
-  int num_keys = 2;
-  std::vector<Slice> keys;
-  std::vector<std::string> expected_values;
-  for (int i = 0; i < num_keys; i++) {
-    keys.push_back("a");
-    expected_values.push_back("value");
-  }
-  std::vector<ColumnFamilyHandle*> handles;
-  handles.push_back(db_->DefaultColumnFamily());
-  handles.push_back(handle);
-
-  {
-    Slice read_ts_slice(ts);
-    ReadOptions read_opts;
-    read_opts.timestamp = &read_ts_slice;
-
-    std::vector<PinnableSlice> values;
-    values.resize(num_keys);
-    std::vector<Status> statuses;
-    statuses.resize(num_keys);
-    std::vector<std::string> timestamps;
-    timestamps.resize(num_keys);
-
-    db_->MultiGet(read_opts, num_keys, handles.data(), keys.data(),
-                  values.data(), timestamps.data(), statuses.data());
-
-    for (int i = 0; i < num_keys; i++) {
-      ASSERT_OK(statuses[i]);
-      ASSERT_EQ(expected_values[i], values[i].ToString());
-      ASSERT_EQ(ts, timestamps[i]);
-    }
-  }
-
-  delete handle;
-  Close();
-}
-
 TEST_F(DBBasicTestWithTimestamp, CompactRangeWithSpecifiedRange) {
   Options options = CurrentOptions();
   options.env = env_;

db/dbformat.h

@@ -330,16 +330,17 @@ inline Slice ExtractUserKey(const Slice& internal_key) {
 // output              : <user_provided_key>
 inline Slice ExtractUserKeyAndStripTimestamp(const Slice& internal_key,
                                              size_t ts_sz) {
-  assert(internal_key.size() >= kNumInternalBytes + ts_sz);
-  return Slice(internal_key.data(),
-               internal_key.size() - (kNumInternalBytes + ts_sz));
+  Slice ret = internal_key;
+  ret.remove_suffix(kNumInternalBytes + ts_sz);
+  return ret;
 }
 
 // input [user key]: <user_provided_key | ts>
 // output:           <user_provided_key>
 inline Slice StripTimestampFromUserKey(const Slice& user_key, size_t ts_sz) {
-  assert(user_key.size() >= ts_sz);
-  return Slice(user_key.data(), user_key.size() - ts_sz);
+  Slice ret = user_key;
+  ret.remove_suffix(ts_sz);
+  return ret;
 }
 
 // input [user key]: <user_provided_key | ts>

db/dbformat_test.cc

@@ -23,17 +23,17 @@ static std::string IKey(const std::string& user_key, uint64_t seq,
 }
 
 static std::string Shorten(const std::string& s, const std::string& l) {
-  std::string scratch;
-  return ShortenedIndexBuilder::FindShortestInternalKeySeparator(
-             *BytewiseComparator(), s, l, &scratch)
-      .ToString();
+  std::string result = s;
+  ShortenedIndexBuilder::FindShortestInternalKeySeparator(*BytewiseComparator(),
+                                                          &result, l);
+  return result;
 }
 
 static std::string ShortSuccessor(const std::string& s) {
-  std::string scratch;
-  return ShortenedIndexBuilder::FindShortInternalKeySuccessor(
-             *BytewiseComparator(), s, &scratch)
-      .ToString();
+  std::string result = s;
+  ShortenedIndexBuilder::FindShortInternalKeySuccessor(*BytewiseComparator(),
+                                                       &result);
+  return result;
 }
 
 static void TestKey(const std::string& key, uint64_t seq, ValueType vt) {

db/experimental.cc

@@ -711,7 +711,7 @@ class SstQueryFilterConfigsManagerImpl : public SstQueryFilterConfigsManager {
                       uint64_t /*file_size*/) override {
       // FIXME later: `key` might contain user timestamp. That should be
       // exposed properly in a future update to TablePropertiesCollector
-      extracted.Reset();
+      KeySegmentsExtractor::Result extracted;
       if (extractor) {
         extractor->Extract(key, KeySegmentsExtractor::kFullUserKey, &extracted);
         if (UNLIKELY(extracted.category >=
@@ -750,7 +750,7 @@ class SstQueryFilterConfigsManagerImpl : public SstQueryFilterConfigsManager {
         }
       }
       prev_key.assign(key.data(), key.size());
-      std::swap(prev_extracted, extracted);
+      prev_extracted = std::move(extracted);
       first_key = false;
       return Status::OK();
     }
@@ -859,7 +859,6 @@ class SstQueryFilterConfigsManagerImpl : public SstQueryFilterConfigsManager {
     std::vector<std::shared_ptr<SstQueryFilterBuilder>> builders;
     bool first_key = true;
     std::string prev_key;
-    KeySegmentsExtractor::Result extracted;
     KeySegmentsExtractor::Result prev_extracted;
     KeySegmentsExtractor::KeyCategorySet categories_seen;
   };

db/external_sst_file_test.cc

@@ -674,8 +674,10 @@ class SstFileWriterCollector : public TablePropertiesCollector {
 
   Status Finish(UserCollectedProperties* properties) override {
     std::string count = std::to_string(count_);
-    properties->insert({prefix_ + "_SstFileWriterCollector", "YES"});
-    properties->insert({prefix_ + "_Count", count});
+    *properties = UserCollectedProperties{
+        {prefix_ + "_SstFileWriterCollector", "YES"},
+        {prefix_ + "_Count", count},
+    };
     return Status::OK();
   }
 

db/flush_job.cc

@@ -235,7 +235,7 @@ Status FlushJob::Run(LogsWithPrepTracker* prep_tracker, FileMetaData* file_meta,
 
   AutoThreadOperationStageUpdater stage_run(ThreadStatus::STAGE_FLUSH_RUN);
   if (mems_.empty()) {
-    ROCKS_LOG_BUFFER(log_buffer_, "[%s] No memtable to flush",
+    ROCKS_LOG_BUFFER(log_buffer_, "[%s] Nothing in memtable to flush",
                      cfd_->GetName().c_str());
     return Status::OK();
   }
@@ -1017,15 +1017,10 @@ Status FlushJob::WriteLevel0Table() {
     ROCKS_LOG_BUFFER(log_buffer_,
                      "[%s] [JOB %d] Level-0 flush table #%" PRIu64 ": %" PRIu64
                      " bytes %s"
-                     " %s"
-                     " %s",
+                     "%s",
                      cfd_->GetName().c_str(), job_context_->job_id,
                      meta_.fd.GetNumber(), meta_.fd.GetFileSize(),
                      s.ToString().c_str(),
-                     s.ok() && meta_.fd.GetFileSize() == 0
-                         ? "It's an empty SST file from a successful flush so "
-                           "won't be kept in the DB"
-                         : "",
                      meta_.marked_for_compaction ? " (needs compaction)" : "");
 
     if (s.ok() && output_file_directory_ != nullptr && sync_output_directory_) {

db/flush_job_test.cc

@@ -68,8 +68,7 @@ class FlushJobTestBase : public testing::Test {
   }
 
   void NewDB() {
-    ASSERT_OK(
-        SetIdentityFile(WriteOptions(), env_, dbname_, Temperature::kUnknown));
+    ASSERT_OK(SetIdentityFile(WriteOptions(), env_, dbname_));
     VersionEdit new_db;
 
     new_db.SetLogNumber(0);
@@ -115,8 +114,7 @@ class FlushJobTestBase : public testing::Test {
     }
     ASSERT_OK(s);
     // Make "CURRENT" file that points to the new manifest file.
-    s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1,
-                       Temperature::kUnknown, nullptr);
+    s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1, nullptr);
     ASSERT_OK(s);
   }
 

db/listener_test.cc

@@ -354,13 +354,13 @@ TEST_F(EventListenerTest, OnSingleDBFlushTest) {
 }
 
 TEST_F(EventListenerTest, MultiCF) {
-  for (auto atomic_flush : {false, true}) {
-    Options options;
-    options.env = CurrentOptions().env;
-    options.write_buffer_size = k110KB;
+  Options options;
+  options.env = CurrentOptions().env;
+  options.write_buffer_size = k110KB;
 #ifdef ROCKSDB_USING_THREAD_STATUS
-    options.enable_thread_tracking = true;
+  options.enable_thread_tracking = true;
 #endif  // ROCKSDB_USING_THREAD_STATUS
+  for (auto atomic_flush : {false, true}) {
     options.atomic_flush = atomic_flush;
     options.create_if_missing = true;
     DestroyAndReopen(options);

db/log_writer.cc

@@ -55,10 +55,7 @@ IOStatus Writer::WriteBuffer(const WriteOptions& write_options) {
   if (dest_->seen_error()) {
 #ifndef NDEBUG
     if (dest_->seen_injected_error()) {
-      std::stringstream msg;
-      msg << "Seen " << FaultInjectionTestFS::kInjected
-          << " error. Skip writing buffer.";
-      return IOStatus::IOError(msg.str());
+      return IOStatus::IOError("Seen injected error. Skip writing buffer.");
     }
 #endif  // NDEBUG
     return IOStatus::IOError("Seen error. Skip writing buffer.");
@@ -96,10 +93,7 @@ IOStatus Writer::AddRecord(const WriteOptions& write_options,
   if (dest_->seen_error()) {
 #ifndef NDEBUG
     if (dest_->seen_injected_error()) {
-      std::stringstream msg;
-      msg << "Seen " << FaultInjectionTestFS::kInjected
-          << " error. Skip writing buffer.";
-      return IOStatus::IOError(msg.str());
+      return IOStatus::IOError("Seen injected error. Skip writing buffer.");
     }
 #endif  // NDEBUG
     return IOStatus::IOError("Seen error. Skip writing buffer.");
@@ -211,10 +205,7 @@ IOStatus Writer::AddCompressionTypeRecord(const WriteOptions& write_options) {
   if (dest_->seen_error()) {
 #ifndef NDEBUG
     if (dest_->seen_injected_error()) {
-      std::stringstream msg;
-      msg << "Seen " << FaultInjectionTestFS::kInjected
-          << " error. Skip writing buffer.";
-      return IOStatus::IOError(msg.str());
+      return IOStatus::IOError("Seen injected error. Skip writing buffer.");
     }
 #endif  // NDEBUG
     return IOStatus::IOError("Seen error. Skip writing buffer.");

db/memtable.cc

@@ -67,10 +67,9 @@ ImmutableMemTableOptions::ImmutableMemTableOptions(
       statistics(ioptions.stats),
       merge_operator(ioptions.merge_operator.get()),
       info_log(ioptions.logger),
-      protection_bytes_per_key(
-          mutable_cf_options.memtable_protection_bytes_per_key),
       allow_data_in_errors(ioptions.allow_data_in_errors),
-      paranoid_memory_checks(mutable_cf_options.paranoid_memory_checks) {}
+      protection_bytes_per_key(
+          mutable_cf_options.memtable_protection_bytes_per_key) {}
 
 MemTable::MemTable(const InternalKeyComparator& cmp,
                    const ImmutableOptions& ioptions,
@@ -371,17 +370,15 @@ class MemTableIterator : public InternalIterator {
       : bloom_(nullptr),
         prefix_extractor_(mem.prefix_extractor_),
         comparator_(mem.comparator_),
-        seqno_to_time_mapping_(seqno_to_time_mapping),
-        status_(Status::OK()),
-        logger_(mem.moptions_.info_log),
-        ts_sz_(mem.ts_sz_),
-        protection_bytes_per_key_(mem.moptions_.protection_bytes_per_key),
         valid_(false),
+        seqno_to_time_mapping_(seqno_to_time_mapping),
+        arena_mode_(arena != nullptr),
         value_pinned_(
             !mem.GetImmutableMemTableOptions()->inplace_update_support),
-        arena_mode_(arena != nullptr),
-        paranoid_memory_checks_(mem.moptions_.paranoid_memory_checks),
-        allow_data_in_error(mem.moptions_.allow_data_in_errors) {
+        protection_bytes_per_key_(mem.moptions_.protection_bytes_per_key),
+        status_(Status::OK()),
+        logger_(mem.moptions_.info_log),
+        ts_sz_(mem.ts_sz_) {
     if (use_range_del_table) {
       iter_ = mem.range_del_table_->GetIterator(arena);
     } else if (prefix_extractor_ != nullptr && !read_options.total_order_seek &&
@@ -409,7 +406,6 @@ class MemTableIterator : public InternalIterator {
     } else {
       delete iter_;
     }
-    status_.PermitUncheckedError();
   }
 
 #ifndef NDEBUG
@@ -419,16 +415,10 @@ class MemTableIterator : public InternalIterator {
   PinnedIteratorsManager* pinned_iters_mgr_ = nullptr;
 #endif
 
-  bool Valid() const override {
-    // If inner iter_ is not valid, then this iter should also not be valid.
-    assert(iter_->Valid() || !(valid_ && status_.ok()));
-    return valid_ && status_.ok();
-  }
-
+  bool Valid() const override { return valid_ && status_.ok(); }
   void Seek(const Slice& k) override {
     PERF_TIMER_GUARD(seek_on_memtable_time);
     PERF_COUNTER_ADD(seek_on_memtable_count, 1);
-    status_ = Status::OK();
     if (bloom_) {
       // iterator should only use prefix bloom filter
       Slice user_k_without_ts(ExtractUserKeyAndStripTimestamp(k, ts_sz_));
@@ -443,18 +433,13 @@ class MemTableIterator : public InternalIterator {
         }
       }
     }
-    if (paranoid_memory_checks_) {
-      status_ = iter_->SeekAndValidate(k, nullptr, allow_data_in_error);
-    } else {
-      iter_->Seek(k, nullptr);
-    }
+    iter_->Seek(k, nullptr);
     valid_ = iter_->Valid();
     VerifyEntryChecksum();
   }
   void SeekForPrev(const Slice& k) override {
     PERF_TIMER_GUARD(seek_on_memtable_time);
     PERF_COUNTER_ADD(seek_on_memtable_count, 1);
-    status_ = Status::OK();
     if (bloom_) {
       Slice user_k_without_ts(ExtractUserKeyAndStripTimestamp(k, ts_sz_));
       if (prefix_extractor_->InDomain(user_k_without_ts)) {
@@ -468,11 +453,7 @@ class MemTableIterator : public InternalIterator {
         }
       }
     }
-    if (paranoid_memory_checks_) {
-      status_ = iter_->SeekAndValidate(k, nullptr, allow_data_in_error);
-    } else {
-      iter_->Seek(k, nullptr);
-    }
+    iter_->Seek(k, nullptr);
     valid_ = iter_->Valid();
     VerifyEntryChecksum();
     if (!Valid() && status().ok()) {
@@ -483,13 +464,11 @@ class MemTableIterator : public InternalIterator {
     }
   }
   void SeekToFirst() override {
-    status_ = Status::OK();
     iter_->SeekToFirst();
     valid_ = iter_->Valid();
     VerifyEntryChecksum();
   }
   void SeekToLast() override {
-    status_ = Status::OK();
     iter_->SeekToLast();
     valid_ = iter_->Valid();
     VerifyEntryChecksum();
@@ -497,12 +476,8 @@ class MemTableIterator : public InternalIterator {
   void Next() override {
     PERF_COUNTER_ADD(next_on_memtable_count, 1);
     assert(Valid());
-    if (paranoid_memory_checks_) {
-      status_ = iter_->NextAndValidate(allow_data_in_error);
-    } else {
-      iter_->Next();
-      TEST_SYNC_POINT_CALLBACK("MemTableIterator::Next:0", iter_);
-    }
+    iter_->Next();
+    TEST_SYNC_POINT_CALLBACK("MemTableIterator::Next:0", iter_);
     valid_ = iter_->Valid();
     VerifyEntryChecksum();
   }
@@ -519,11 +494,7 @@ class MemTableIterator : public InternalIterator {
   void Prev() override {
     PERF_COUNTER_ADD(prev_on_memtable_count, 1);
     assert(Valid());
-    if (paranoid_memory_checks_) {
-      status_ = iter_->PrevAndValidate(allow_data_in_error);
-    } else {
-      iter_->Prev();
-    }
+    iter_->Prev();
     valid_ = iter_->Valid();
     VerifyEntryChecksum();
   }
@@ -569,17 +540,15 @@ class MemTableIterator : public InternalIterator {
   const SliceTransform* const prefix_extractor_;
   const MemTable::KeyComparator comparator_;
   MemTableRep::Iterator* iter_;
+  bool valid_;
   // The seqno to time mapping is owned by the SuperVersion.
   UnownedPtr<const SeqnoToTimeMapping> seqno_to_time_mapping_;
+  bool arena_mode_;
+  bool value_pinned_;
+  uint32_t protection_bytes_per_key_;
   Status status_;
   Logger* logger_;
   size_t ts_sz_;
-  uint32_t protection_bytes_per_key_;
-  bool valid_;
-  bool value_pinned_;
-  bool arena_mode_;
-  const bool paranoid_memory_checks_;
-  const bool allow_data_in_error;
 
   void VerifyEntryChecksum() {
     if (protection_bytes_per_key_ > 0 && Valid()) {
@@ -964,8 +933,6 @@ static bool SaveValue(void* arg, const char* entry) {
   Saver* s = static_cast<Saver*>(arg);
   assert(s != nullptr);
   assert(!s->value || !s->columns);
-  assert(!*(s->found_final_value));
-  assert(s->status->ok() || s->status->IsMergeInProgress());
 
   MergeContext* merge_context = s->merge_context;
   SequenceNumber max_covering_tombstone_seq = s->max_covering_tombstone_seq;
@@ -999,7 +966,6 @@ static bool SaveValue(void* arg, const char* entry) {
       *(s->status) = MemTable::VerifyEntryChecksum(
           entry, s->protection_bytes_per_key, s->allow_data_in_errors);
       if (!s->status->ok()) {
-        *(s->found_final_value) = true;
         ROCKS_LOG_ERROR(s->logger, "In SaveValue: %s", s->status->getState());
         // Memtable entry corrupted
         return false;
@@ -1265,7 +1231,6 @@ static bool SaveValue(void* arg, const char* entry) {
                      ". ");
           msg.append("seq: " + std::to_string(seq) + ".");
         }
-        *(s->found_final_value) = true;
         *(s->status) = Status::Corruption(msg.c_str());
         return false;
       }
@@ -1345,12 +1310,8 @@ bool MemTable::Get(const LookupKey& key, std::string* value,
 
   // No change to value, since we have not yet found a Put/Delete
   // Propagate corruption error
-  if (!found_final_value && merge_in_progress) {
-    if (s->ok()) {
-      *s = Status::MergeInProgress();
-    } else {
-      assert(s->IsMergeInProgress());
-    }
+  if (!found_final_value && merge_in_progress && !s->IsCorruption()) {
+    *s = Status::MergeInProgress();
   }
   PERF_COUNTER_ADD(get_from_memtable_count, 1);
   return found_final_value;
@@ -1386,19 +1347,7 @@ void MemTable::GetFromTable(const LookupKey& key,
   saver.do_merge = do_merge;
   saver.allow_data_in_errors = moptions_.allow_data_in_errors;
   saver.protection_bytes_per_key = moptions_.protection_bytes_per_key;
-
-  if (!moptions_.paranoid_memory_checks) {
-    table_->Get(key, &saver, SaveValue);
-  } else {
-    Status check_s = table_->GetAndValidate(key, &saver, SaveValue,
-                                            moptions_.allow_data_in_errors);
-    if (check_s.IsCorruption()) {
-      *(saver.status) = check_s;
-      // Should stop searching the LSM.
-      *(saver.found_final_value) = true;
-    }
-  }
-  assert(s->ok() || s->IsMergeInProgress() || *found_final_value);
+  table_->Get(key, &saver, SaveValue);
   *seq = saver.seq;
 }
 
@@ -1472,19 +1421,10 @@ void MemTable::MultiGet(const ReadOptions& read_options, MultiGetRange* range,
                  &found_final_value, &merge_in_progress);
 
     if (!found_final_value && merge_in_progress) {
-      if (iter->s->ok()) {
-        *(iter->s) = Status::MergeInProgress();
-      } else {
-        assert(iter->s->IsMergeInProgress());
-      }
+      *(iter->s) = Status::MergeInProgress();
     }
 
-    if (found_final_value ||
-        (!iter->s->ok() && !iter->s->IsMergeInProgress())) {
-      // `found_final_value` should be set if an error/corruption occurs.
-      // The check on iter->s is just there in case GetFromTable() did not
-      // set `found_final_value` properly.
-      assert(found_final_value);
+    if (found_final_value) {
       if (iter->value) {
         iter->value->PinSelf();
         range->AddValueSize(iter->value->size());

db/memtable.h

@@ -60,9 +60,8 @@ struct ImmutableMemTableOptions {
   Statistics* statistics;
   MergeOperator* merge_operator;
   Logger* info_log;
-  uint32_t protection_bytes_per_key;
   bool allow_data_in_errors;
-  bool paranoid_memory_checks;
+  uint32_t protection_bytes_per_key;
 };
 
 // Batched counters to updated when inserting keys in one write batch.
@@ -250,14 +249,12 @@ class MemTable {
   // If do_merge = true the default behavior which is Get value for key is
   // executed. Expected behavior is described right below.
   // If memtable contains a value for key, store it in *value and return true.
-  // If memtable contains a deletion for key, store NotFound() in *status and
-  // return true.
+  // If memtable contains a deletion for key, store a NotFound() error
+  // in *status and return true.
   // If memtable contains Merge operation as the most recent entry for a key,
   //   and the merge process does not stop (not reaching a value or delete),
   //   prepend the current merge operand to *operands.
   //   store MergeInProgress in s, and return false.
-  // If an unexpected error or corruption occurs, store Corruption() or other
-  // error in *status and return true.
   // Else, return false.
   // If any operation was found, its most recent sequence number
   // will be stored in *seq on success (regardless of whether true/false is
@@ -267,11 +264,6 @@ class MemTable {
   // If do_merge = false then any Merge Operands encountered for key are simply
   // stored in merge_context.operands_list and never actually merged to get a
   // final value. The raw Merge Operands are eventually returned to the user.
-  // @param value If not null and memtable contains a value for key, `value`
-  // will be set to the result value.
-  // @param column If not null and memtable contains a value/WideColumn for key,
-  // `column` will be set to the result value/WideColumn.
-  // Note: only one of `value` and `column` can be non-nullptr.
   // @param immutable_memtable Whether this memtable is immutable. Used
   // internally by NewRangeTombstoneIterator(). See comment above
   // NewRangeTombstoneIterator() for more detail.

db/memtable_list.cc

@@ -181,8 +181,7 @@ bool MemTableListVersion::GetFromList(
     }
 
     if (done) {
-      assert(*seq != kMaxSequenceNumber ||
-             (!s->ok() && !s->IsMergeInProgress()));
+      assert(*seq != kMaxSequenceNumber || s->IsNotFound());
       return true;
     }
     if (!s->ok() && !s->IsMergeInProgress() && !s->IsNotFound()) {
@@ -559,12 +558,11 @@ Status MemTableList::TryInstallMemtableFlushResults(
         batch_file_number = m->file_number_;
         if (m->edit_.GetBlobFileAdditions().empty()) {
           ROCKS_LOG_BUFFER(log_buffer,
-                           "[%s] Level-0 commit flush result of table #%" PRIu64
-                           " started",
+                           "[%s] Level-0 commit table #%" PRIu64 " started",
                            cfd->GetName().c_str(), m->file_number_);
         } else {
           ROCKS_LOG_BUFFER(log_buffer,
-                           "[%s] Level-0 commit flush result of table #%" PRIu64
+                           "[%s] Level-0 commit table #%" PRIu64
                            " (+%zu blob files) started",
                            cfd->GetName().c_str(), m->file_number_,
                            m->edit_.GetBlobFileAdditions().size());
@@ -759,12 +757,12 @@ void MemTableList::RemoveMemTablesOrRestoreFlags(
       MemTable* m = current_->memlist_.back();
       if (m->edit_.GetBlobFileAdditions().empty()) {
         ROCKS_LOG_BUFFER(log_buffer,
-                         "[%s] Level-0 commit flush result of table #%" PRIu64
+                         "[%s] Level-0 commit table #%" PRIu64
                          ": memtable #%" PRIu64 " done",
                          cfd->GetName().c_str(), m->file_number_, mem_id);
       } else {
         ROCKS_LOG_BUFFER(log_buffer,
-                         "[%s] Level-0 commit flush result of table #%" PRIu64
+                         "[%s] Level-0 commit table #%" PRIu64
                          " (+%zu blob files)"
                          ": memtable #%" PRIu64 " done",
                          cfd->GetName().c_str(), m->file_number_,

db/memtable_list_test.cc

@@ -287,7 +287,6 @@ TEST_F(MemTableListTest, GetTest) {
 
   // Fetch the newly written keys
   merge_context.Clear();
-  s = Status::OK();
   found = mem->Get(LookupKey("key1", seq), &value, /*columns*/ nullptr,
                    /*timestamp*/ nullptr, &s, &merge_context,
                    &max_covering_tombstone_seq, ReadOptions(),
@@ -296,7 +295,6 @@ TEST_F(MemTableListTest, GetTest) {
   ASSERT_EQ(value, "value1");
 
   merge_context.Clear();
-  s = Status::OK();
   found = mem->Get(LookupKey("key1", 2), &value, /*columns*/ nullptr,
                    /*timestamp*/ nullptr, &s, &merge_context,
                    &max_covering_tombstone_seq, ReadOptions(),
@@ -305,7 +303,6 @@ TEST_F(MemTableListTest, GetTest) {
   ASSERT_TRUE(found && s.IsNotFound());
 
   merge_context.Clear();
-  s = Status::OK();
   found = mem->Get(LookupKey("key2", seq), &value, /*columns*/ nullptr,
                    /*timestamp*/ nullptr, &s, &merge_context,
                    &max_covering_tombstone_seq, ReadOptions(),
@@ -314,7 +311,6 @@ TEST_F(MemTableListTest, GetTest) {
   ASSERT_EQ(value, "value2.2");
 
   merge_context.Clear();
-  s = Status::OK();
   found = mem->Get(LookupKey("key3", seq), &value, /*columns*/ nullptr,
                    /*timestamp*/ nullptr, &s, &merge_context,
                    &max_covering_tombstone_seq, ReadOptions(),
@@ -354,7 +350,6 @@ TEST_F(MemTableListTest, GetTest) {
 
   // Fetch keys via MemTableList
   merge_context.Clear();
-  s = Status::OK();
   found =
       list.current()->Get(LookupKey("key1", seq), &value, /*columns=*/nullptr,
                           /*timestamp=*/nullptr, &s, &merge_context,
@@ -362,7 +357,6 @@ TEST_F(MemTableListTest, GetTest) {
   ASSERT_TRUE(found && s.IsNotFound());
 
   merge_context.Clear();
-  s = Status::OK();
   found = list.current()->Get(LookupKey("key1", saved_seq), &value,
                               /*columns=*/nullptr, /*timestamp=*/nullptr, &s,
                               &merge_context, &max_covering_tombstone_seq,
@@ -371,7 +365,6 @@ TEST_F(MemTableListTest, GetTest) {
   ASSERT_EQ("value1", value);
 
   merge_context.Clear();
-  s = Status::OK();
   found =
       list.current()->Get(LookupKey("key2", seq), &value, /*columns=*/nullptr,
                           /*timestamp=*/nullptr, &s, &merge_context,
@@ -380,14 +373,12 @@ TEST_F(MemTableListTest, GetTest) {
   ASSERT_EQ(value, "value2.3");
 
   merge_context.Clear();
-  s = Status::OK();
   found = list.current()->Get(LookupKey("key2", 1), &value, /*columns=*/nullptr,
                               /*timestamp=*/nullptr, &s, &merge_context,
                               &max_covering_tombstone_seq, ReadOptions());
   ASSERT_FALSE(found);
 
   merge_context.Clear();
-  s = Status::OK();
   found =
       list.current()->Get(LookupKey("key3", seq), &value, /*columns=*/nullptr,
                           /*timestamp=*/nullptr, &s, &merge_context,
@@ -447,7 +438,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
 
   // Fetch the newly written keys
   merge_context.Clear();
-  s = Status::OK();
   found = mem->Get(LookupKey("key1", seq), &value, /*columns*/ nullptr,
                    /*timestamp*/ nullptr, &s, &merge_context,
                    &max_covering_tombstone_seq, ReadOptions(),
@@ -456,7 +446,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
   ASSERT_TRUE(found && s.IsNotFound());
 
   merge_context.Clear();
-  s = Status::OK();
   found = mem->Get(LookupKey("key2", seq), &value, /*columns*/ nullptr,
                    /*timestamp*/ nullptr, &s, &merge_context,
                    &max_covering_tombstone_seq, ReadOptions(),
@@ -473,7 +462,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
 
   // Fetch keys via MemTableList
   merge_context.Clear();
-  s = Status::OK();
   found =
       list.current()->Get(LookupKey("key1", seq), &value, /*columns=*/nullptr,
                           /*timestamp=*/nullptr, &s, &merge_context,
@@ -481,7 +469,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
   ASSERT_TRUE(found && s.IsNotFound());
 
   merge_context.Clear();
-  s = Status::OK();
   found =
       list.current()->Get(LookupKey("key2", seq), &value, /*columns=*/nullptr,
                           /*timestamp=*/nullptr, &s, &merge_context,
@@ -521,7 +508,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
 
   // Verify keys are present in history
   merge_context.Clear();
-  s = Status::OK();
   found = list.current()->GetFromHistory(
       LookupKey("key1", seq), &value, /*columns=*/nullptr,
       /*timestamp=*/nullptr, &s, &merge_context, &max_covering_tombstone_seq,
@@ -529,7 +515,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
   ASSERT_TRUE(found && s.IsNotFound());
 
   merge_context.Clear();
-  s = Status::OK();
   found = list.current()->GetFromHistory(
       LookupKey("key2", seq), &value, /*columns=*/nullptr,
       /*timestamp=*/nullptr, &s, &merge_context, &max_covering_tombstone_seq,
@@ -583,7 +568,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
 
   // Verify keys are no longer in MemTableList
   merge_context.Clear();
-  s = Status::OK();
   found =
       list.current()->Get(LookupKey("key1", seq), &value, /*columns=*/nullptr,
                           /*timestamp=*/nullptr, &s, &merge_context,
@@ -591,7 +575,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
   ASSERT_FALSE(found);
 
   merge_context.Clear();
-  s = Status::OK();
   found =
       list.current()->Get(LookupKey("key2", seq), &value, /*columns=*/nullptr,
                           /*timestamp=*/nullptr, &s, &merge_context,
@@ -599,7 +582,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
   ASSERT_FALSE(found);
 
   merge_context.Clear();
-  s = Status::OK();
   found =
       list.current()->Get(LookupKey("key3", seq), &value, /*columns=*/nullptr,
                           /*timestamp=*/nullptr, &s, &merge_context,
@@ -608,7 +590,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
 
   // Verify that the second memtable's keys are in the history
   merge_context.Clear();
-  s = Status::OK();
   found = list.current()->GetFromHistory(
       LookupKey("key1", seq), &value, /*columns=*/nullptr,
       /*timestamp=*/nullptr, &s, &merge_context, &max_covering_tombstone_seq,
@@ -616,7 +597,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
   ASSERT_TRUE(found && s.IsNotFound());
 
   merge_context.Clear();
-  s = Status::OK();
   found = list.current()->GetFromHistory(
       LookupKey("key3", seq), &value, /*columns=*/nullptr,
       /*timestamp=*/nullptr, &s, &merge_context, &max_covering_tombstone_seq,
@@ -626,7 +606,6 @@ TEST_F(MemTableListTest, GetFromHistoryTest) {
 
   // Verify that key2 from the first memtable is no longer in the history
   merge_context.Clear();
-  s = Status::OK();
   found =
       list.current()->Get(LookupKey("key2", seq), &value, /*columns=*/nullptr,
                           /*timestamp=*/nullptr, &s, &merge_context,

db/table_cache.cc

@@ -164,7 +164,6 @@ Status TableCache::GetTableReader(
 }
 
 Cache::Handle* TableCache::Lookup(Cache* cache, uint64_t file_number) {
-  // NOTE: sharing same Cache with BlobFileCache
   Slice key = GetSliceForFileNumber(&file_number);
   return cache->Lookup(key);
 }
@@ -180,7 +179,6 @@ Status TableCache::FindTable(
     size_t max_file_size_for_l0_meta_pin, Temperature file_temperature) {
   PERF_TIMER_GUARD_WITH_CLOCK(find_table_nanos, ioptions_.clock);
   uint64_t number = file_meta.fd.GetNumber();
-  // NOTE: sharing same Cache with BlobFileCache
   Slice key = GetSliceForFileNumber(&number);
   *handle = cache_.Lookup(key);
   TEST_SYNC_POINT_CALLBACK("TableCache::FindTable:0",

db/version_builder.cc

@@ -24,13 +24,11 @@
 #include <vector>
 
 #include "cache/cache_reservation_manager.h"
-#include "db/blob/blob_file_cache.h"
 #include "db/blob/blob_file_meta.h"
 #include "db/dbformat.h"
 #include "db/internal_stats.h"
 #include "db/table_cache.h"
 #include "db/version_edit.h"
-#include "db/version_edit_handler.h"
 #include "db/version_set.h"
 #include "port/port.h"
 #include "table/table_reader.h"
@@ -39,25 +37,6 @@
 namespace ROCKSDB_NAMESPACE {
 
 class VersionBuilder::Rep {
-  class NewestFirstBySeqNo {
-   public:
-    bool operator()(const FileMetaData* lhs, const FileMetaData* rhs) const {
-      assert(lhs);
-      assert(rhs);
-
-      if (lhs->fd.largest_seqno != rhs->fd.largest_seqno) {
-        return lhs->fd.largest_seqno > rhs->fd.largest_seqno;
-      }
-
-      if (lhs->fd.smallest_seqno != rhs->fd.smallest_seqno) {
-        return lhs->fd.smallest_seqno > rhs->fd.smallest_seqno;
-      }
-
-      // Break ties by file number
-      return lhs->fd.GetNumber() > rhs->fd.GetNumber();
-    }
-  };
-
   class NewestFirstByEpochNumber {
    private:
     inline static const NewestFirstBySeqNo seqno_cmp;
@@ -270,9 +249,9 @@ class VersionBuilder::Rep {
   std::unordered_map<uint64_t, int> table_file_levels_;
   // Current compact cursors that should be changed after the last compaction
   std::unordered_map<int, InternalKey> updated_compact_cursors_;
-  std::shared_ptr<NewestFirstByEpochNumber> level_zero_cmp_by_epochno_;
-  std::shared_ptr<NewestFirstBySeqNo> level_zero_cmp_by_seqno_;
-  std::shared_ptr<BySmallestKey> level_nonzero_cmp_;
+  NewestFirstByEpochNumber level_zero_cmp_by_epochno_;
+  NewestFirstBySeqNo level_zero_cmp_by_seqno_;
+  BySmallestKey level_nonzero_cmp_;
 
   // Mutable metadata objects for all blob files affected by the series of
   // version edits.
@@ -280,56 +259,11 @@ class VersionBuilder::Rep {
 
   std::shared_ptr<CacheReservationManager> file_metadata_cache_res_mgr_;
 
-  ColumnFamilyData* cfd_;
-  VersionEditHandler* version_edit_handler_;
-  bool track_found_and_missing_files_;
-  // If false, only a complete Version with all files consisting it found is
-  // considered valid. If true, besides complete Version, if the Version is
-  // never edited in an atomic group, an incomplete Version with only a suffix
-  // of L0 files missing is also considered valid.
-  bool allow_incomplete_valid_version_;
-
-  // These are only tracked if `track_found_and_missing_files_` is enabled.
-
-  // The SST files that are found (blob files not included yet).
-  std::unordered_set<uint64_t> found_files_;
-  // Missing SST files for L0
-  std::unordered_set<uint64_t> l0_missing_files_;
-  // Missing SST files for non L0 levels
-  std::unordered_set<uint64_t> non_l0_missing_files_;
-  // Intermediate SST files (blob files not included yet)
-  std::vector<std::string> intermediate_files_;
-  // The highest file number for all the missing blob files, useful to check
-  // if a complete Version is available.
-  uint64_t missing_blob_files_high_ = kInvalidBlobFileNumber;
-  // Missing blob files, useful to check if only the missing L0 files'
-  // associated blob files are missing.
-  std::unordered_set<uint64_t> missing_blob_files_;
-  // True if all files consisting the Version can be found. Or if
-  // `allow_incomplete_valid_version_` is true and the version history is not
-  // ever edited in an atomic group, this will be true if only a
-  // suffix of L0 SST files and their associated blob files are missing.
-  bool valid_version_available_;
-  // True if version is ever edited in an atomic group.
-  bool edited_in_atomic_group_;
-
-  // Flag to indicate if the Version is updated since last validity check. If no
-  // `Apply` call is made between a `Rep`'s construction and a
-  // `ValidVersionAvailable` check or between two `ValidVersionAvailable` calls.
-  // This flag will be true to indicate the cached validity value can be
-  // directly used without a recheck.
-  bool version_updated_since_last_check_;
-
-  // End of fields that are only tracked when `track_found_and_missing_files_`
-  // is enabled.
-
  public:
   Rep(const FileOptions& file_options, const ImmutableCFOptions* ioptions,
       TableCache* table_cache, VersionStorageInfo* base_vstorage,
       VersionSet* version_set,
-      std::shared_ptr<CacheReservationManager> file_metadata_cache_res_mgr,
-      ColumnFamilyData* cfd, VersionEditHandler* version_edit_handler,
-      bool track_found_and_missing_files, bool allow_incomplete_valid_version)
+      std::shared_ptr<CacheReservationManager> file_metadata_cache_res_mgr)
       : file_options_(file_options),
         ioptions_(ioptions),
         table_cache_(table_cache),
@@ -337,76 +271,11 @@ class VersionBuilder::Rep {
         version_set_(version_set),
         num_levels_(base_vstorage->num_levels()),
         has_invalid_levels_(false),
-        level_zero_cmp_by_epochno_(
-            std::make_shared<NewestFirstByEpochNumber>()),
-        level_zero_cmp_by_seqno_(std::make_shared<NewestFirstBySeqNo>()),
-        level_nonzero_cmp_(std::make_shared<BySmallestKey>(
-            base_vstorage_->InternalComparator())),
-        file_metadata_cache_res_mgr_(file_metadata_cache_res_mgr),
-        cfd_(cfd),
-        version_edit_handler_(version_edit_handler),
-        track_found_and_missing_files_(track_found_and_missing_files),
-        allow_incomplete_valid_version_(allow_incomplete_valid_version) {
+        level_nonzero_cmp_(base_vstorage_->InternalComparator()),
+        file_metadata_cache_res_mgr_(file_metadata_cache_res_mgr) {
     assert(ioptions_);
 
     levels_ = new LevelState[num_levels_];
-    if (track_found_and_missing_files_) {
-      assert(cfd_);
-      assert(version_edit_handler_);
-      // `track_found_and_missing_files_` mode used by VersionEditHandlerPIT
-      // assumes the initial base version is valid. For best efforts recovery,
-      // base will be empty. For manifest tailing usage like secondary instance,
-      // they do not allow incomplete version, so the base version in subsequent
-      // catch up attempts should be valid too.
-      valid_version_available_ = true;
-      edited_in_atomic_group_ = false;
-      version_updated_since_last_check_ = false;
-    }
-  }
-
-  Rep(const Rep& other)
-      : file_options_(other.file_options_),
-        ioptions_(other.ioptions_),
-        table_cache_(other.table_cache_),
-        base_vstorage_(other.base_vstorage_),
-        version_set_(other.version_set_),
-        num_levels_(other.num_levels_),
-        invalid_level_sizes_(other.invalid_level_sizes_),
-        has_invalid_levels_(other.has_invalid_levels_),
-        table_file_levels_(other.table_file_levels_),
-        updated_compact_cursors_(other.updated_compact_cursors_),
-        level_zero_cmp_by_epochno_(other.level_zero_cmp_by_epochno_),
-        level_zero_cmp_by_seqno_(other.level_zero_cmp_by_seqno_),
-        level_nonzero_cmp_(other.level_nonzero_cmp_),
-        mutable_blob_file_metas_(other.mutable_blob_file_metas_),
-        file_metadata_cache_res_mgr_(other.file_metadata_cache_res_mgr_),
-        cfd_(other.cfd_),
-        version_edit_handler_(other.version_edit_handler_),
-        track_found_and_missing_files_(other.track_found_and_missing_files_),
-        allow_incomplete_valid_version_(other.allow_incomplete_valid_version_),
-        found_files_(other.found_files_),
-        l0_missing_files_(other.l0_missing_files_),
-        non_l0_missing_files_(other.non_l0_missing_files_),
-        intermediate_files_(other.intermediate_files_),
-        missing_blob_files_high_(other.missing_blob_files_high_),
-        missing_blob_files_(other.missing_blob_files_),
-        valid_version_available_(other.valid_version_available_),
-        edited_in_atomic_group_(other.edited_in_atomic_group_),
-        version_updated_since_last_check_(
-            other.version_updated_since_last_check_) {
-    assert(ioptions_);
-    levels_ = new LevelState[num_levels_];
-    for (int level = 0; level < num_levels_; level++) {
-      levels_[level] = other.levels_[level];
-      const auto& added = levels_[level].added_files;
-      for (auto& pair : added) {
-        RefFile(pair.second);
-      }
-    }
-    if (track_found_and_missing_files_) {
-      assert(cfd_);
-      assert(version_edit_handler_);
-    }
   }
 
   ~Rep() {
@@ -420,12 +289,6 @@ class VersionBuilder::Rep {
     delete[] levels_;
   }
 
-  void RefFile(FileMetaData* f) {
-    assert(f);
-    assert(f->refs > 0);
-    f->refs++;
-  }
-
   void UnrefFile(FileMetaData* f) {
     f->refs--;
     if (f->refs <= 0) {
@@ -534,7 +397,7 @@ class VersionBuilder::Rep {
 
           if (epoch_number_requirement ==
               EpochNumberRequirement::kMightMissing) {
-            if (!level_zero_cmp_by_seqno_->operator()(lhs, rhs)) {
+            if (!level_zero_cmp_by_seqno_(lhs, rhs)) {
               std::ostringstream oss;
               oss << "L0 files are not sorted properly: files #"
                   << lhs->fd.GetNumber() << " with seqnos (largest, smallest) "
@@ -566,7 +429,7 @@ class VersionBuilder::Rep {
               }
             }
 
-            if (!level_zero_cmp_by_epochno_->operator()(lhs, rhs)) {
+            if (!level_zero_cmp_by_epochno_(lhs, rhs)) {
               std::ostringstream oss;
               oss << "L0 files are not sorted properly: files #"
                   << lhs->fd.GetNumber() << " with epoch number "
@@ -595,7 +458,7 @@ class VersionBuilder::Rep {
           assert(lhs);
           assert(rhs);
 
-          if (!level_nonzero_cmp_->operator()(lhs, rhs)) {
+          if (!level_nonzero_cmp_(lhs, rhs)) {
             std::ostringstream oss;
             oss << 'L' << level << " files are not sorted properly: files #"
                 << lhs->fd.GetNumber() << ", #" << rhs->fd.GetNumber();
@@ -744,9 +607,12 @@ class VersionBuilder::Rep {
       return Status::Corruption("VersionBuilder", oss.str());
     }
 
-    auto deleter = [vs = version_set_, ioptions = ioptions_,
-                    bc = cfd_ ? cfd_->blob_file_cache()
-                              : nullptr](SharedBlobFileMetaData* shared_meta) {
+    // Note: we use C++11 for now but in C++14, this could be done in a more
+    // elegant way using generalized lambda capture.
+    VersionSet* const vs = version_set_;
+    const ImmutableCFOptions* const ioptions = ioptions_;
+
+    auto deleter = [vs, ioptions](SharedBlobFileMetaData* shared_meta) {
       if (vs) {
         assert(ioptions);
         assert(!ioptions->cf_paths.empty());
@@ -755,9 +621,6 @@ class VersionBuilder::Rep {
         vs->AddObsoleteBlobFile(shared_meta->GetBlobFileNumber(),
                                 ioptions->cf_paths.front().path);
       }
-      if (bc) {
-        bc->Evict(shared_meta->GetBlobFileNumber());
-      }
 
       delete shared_meta;
     };
@@ -766,27 +629,12 @@ class VersionBuilder::Rep {
         blob_file_number, blob_file_addition.GetTotalBlobCount(),
         blob_file_addition.GetTotalBlobBytes(),
         blob_file_addition.GetChecksumMethod(),
-        blob_file_addition.GetChecksumValue(), std::move(deleter));
+        blob_file_addition.GetChecksumValue(), deleter);
 
     mutable_blob_file_metas_.emplace(
         blob_file_number, MutableBlobFileMetaData(std::move(shared_meta)));
 
-    Status s;
-    if (track_found_and_missing_files_) {
-      assert(version_edit_handler_);
-      s = version_edit_handler_->VerifyBlobFile(cfd_, blob_file_number,
-                                                blob_file_addition);
-      if (s.IsPathNotFound() || s.IsNotFound() || s.IsCorruption()) {
-        missing_blob_files_high_ =
-            std::max(missing_blob_files_high_, blob_file_number);
-        missing_blob_files_.insert(blob_file_number);
-        s = Status::OK();
-      } else if (!s.ok()) {
-        return s;
-      }
-    }
-
-    return s;
+    return Status::OK();
   }
 
   Status ApplyBlobFileGarbage(const BlobFileGarbage& blob_file_garbage) {
@@ -904,29 +752,6 @@ class VersionBuilder::Rep {
     table_file_levels_[file_number] =
         VersionStorageInfo::FileLocation::Invalid().GetLevel();
 
-    if (track_found_and_missing_files_) {
-      assert(version_edit_handler_);
-      if (l0_missing_files_.find(file_number) != l0_missing_files_.end()) {
-        l0_missing_files_.erase(file_number);
-      } else if (non_l0_missing_files_.find(file_number) !=
-                 non_l0_missing_files_.end()) {
-        non_l0_missing_files_.erase(file_number);
-      } else {
-        auto fiter = found_files_.find(file_number);
-        // Only mark new files added during this catchup attempt for deletion.
-        // These files were never installed in VersionStorageInfo.
-        // Already referenced files that are deleted by a VersionEdit will
-        // be added to the VersionStorageInfo's obsolete files when the old
-        // version is dereferenced.
-        if (fiter != found_files_.end()) {
-          assert(!ioptions_->cf_paths.empty());
-          intermediate_files_.emplace_back(
-              MakeTableFileName(ioptions_->cf_paths[0].path, file_number));
-          found_files_.erase(fiter);
-        }
-      }
-    }
-
     return Status::OK();
   }
 
@@ -999,31 +824,7 @@ class VersionBuilder::Rep {
 
     table_file_levels_[file_number] = level;
 
-    Status s;
-    if (track_found_and_missing_files_) {
-      assert(version_edit_handler_);
-      assert(!ioptions_->cf_paths.empty());
-      const std::string fpath =
-          MakeTableFileName(ioptions_->cf_paths[0].path, file_number);
-      s = version_edit_handler_->VerifyFile(cfd_, fpath, level, meta);
-      if (s.IsPathNotFound() || s.IsNotFound() || s.IsCorruption()) {
-        if (0 == level) {
-          l0_missing_files_.insert(file_number);
-        } else {
-          non_l0_missing_files_.insert(file_number);
-        }
-        if (s.IsCorruption()) {
-          found_files_.insert(file_number);
-        }
-        s = Status::OK();
-      } else if (!s.ok()) {
-        return s;
-      } else {
-        found_files_.insert(file_number);
-      }
-    }
-
-    return s;
+    return Status::OK();
   }
 
   Status ApplyCompactCursors(int level,
@@ -1044,7 +845,6 @@ class VersionBuilder::Rep {
 
   // Apply all of the edits in *edit to the current state.
   Status Apply(const VersionEdit* edit) {
-    bool version_updated = false;
     {
       const Status s = CheckConsistency(base_vstorage_);
       if (!s.ok()) {
@@ -1062,7 +862,6 @@ class VersionBuilder::Rep {
       if (!s.ok()) {
         return s;
       }
-      version_updated = true;
     }
 
     // Increase the amount of garbage for blob files affected by GC
@@ -1071,7 +870,6 @@ class VersionBuilder::Rep {
       if (!s.ok()) {
         return s;
       }
-      version_updated = true;
     }
 
     // Delete table files
@@ -1083,7 +881,6 @@ class VersionBuilder::Rep {
       if (!s.ok()) {
         return s;
       }
-      version_updated = true;
     }
 
     // Add new table files
@@ -1095,7 +892,6 @@ class VersionBuilder::Rep {
       if (!s.ok()) {
         return s;
       }
-      version_updated = true;
     }
 
     // Populate compact cursors for round-robin compaction, leave
@@ -1108,13 +904,6 @@ class VersionBuilder::Rep {
         return s;
       }
     }
-
-    if (track_found_and_missing_files_ && version_updated) {
-      version_updated_since_last_check_ = true;
-      if (!edited_in_atomic_group_ && edit->IsInAtomicGroup()) {
-        edited_in_atomic_group_ = true;
-      }
-    }
     return Status::OK();
   }
 
@@ -1257,35 +1046,14 @@ class VersionBuilder::Rep {
         mutable_meta.GetGarbageBlobCount(), mutable_meta.GetGarbageBlobBytes());
   }
 
-  bool OnlyLinkedToMissingL0Files(
-      const std::unordered_set<uint64_t>& linked_ssts) const {
-    return std::all_of(
-        linked_ssts.begin(), linked_ssts.end(), [&](const uint64_t& element) {
-          return l0_missing_files_.find(element) != l0_missing_files_.end();
-        });
-  }
-
   // Add the blob file specified by meta to *vstorage if it is determined to
   // contain valid data (blobs).
   template <typename Meta>
-  void AddBlobFileIfNeeded(VersionStorageInfo* vstorage, Meta&& meta,
-                           uint64_t blob_file_number) const {
+  static void AddBlobFileIfNeeded(VersionStorageInfo* vstorage, Meta&& meta) {
     assert(vstorage);
     assert(meta);
 
-    const auto& linked_ssts = meta->GetLinkedSsts();
-    if (track_found_and_missing_files_) {
-      if (missing_blob_files_.find(blob_file_number) !=
-          missing_blob_files_.end()) {
-        return;
-      }
-      // Leave the empty case for the below blob garbage collection logic.
-      if (!linked_ssts.empty() && OnlyLinkedToMissingL0Files(linked_ssts)) {
-        return;
-      }
-    }
-
-    if (linked_ssts.empty() &&
+    if (meta->GetLinkedSsts().empty() &&
         meta->GetGarbageBlobCount() >= meta->GetTotalBlobCount()) {
       return;
     }
@@ -1297,7 +1065,6 @@ class VersionBuilder::Rep {
   // applied, and save the result into *vstorage.
   void SaveBlobFilesTo(VersionStorageInfo* vstorage) const {
     assert(vstorage);
-    assert(!track_found_and_missing_files_ || valid_version_available_);
 
     assert(base_vstorage_);
     vstorage->ReserveBlob(base_vstorage_->GetBlobFiles().size() +
@@ -1313,24 +1080,22 @@ class VersionBuilder::Rep {
     }
 
     auto process_base =
-        [this, vstorage](const std::shared_ptr<BlobFileMetaData>& base_meta) {
+        [vstorage](const std::shared_ptr<BlobFileMetaData>& base_meta) {
           assert(base_meta);
 
-          AddBlobFileIfNeeded(vstorage, base_meta,
-                              base_meta->GetBlobFileNumber());
+          AddBlobFileIfNeeded(vstorage, base_meta);
 
           return true;
         };
 
     auto process_mutable =
-        [this, vstorage](const MutableBlobFileMetaData& mutable_meta) {
-          AddBlobFileIfNeeded(vstorage, CreateBlobFileMetaData(mutable_meta),
-                              mutable_meta.GetBlobFileNumber());
+        [vstorage](const MutableBlobFileMetaData& mutable_meta) {
+          AddBlobFileIfNeeded(vstorage, CreateBlobFileMetaData(mutable_meta));
 
           return true;
         };
 
-    auto process_both = [this, vstorage](
+    auto process_both = [vstorage](
                             const std::shared_ptr<BlobFileMetaData>& base_meta,
                             const MutableBlobFileMetaData& mutable_meta) {
       assert(base_meta);
@@ -1343,14 +1108,12 @@ class VersionBuilder::Rep {
                mutable_meta.GetGarbageBlobBytes());
         assert(base_meta->GetLinkedSsts() == mutable_meta.GetLinkedSsts());
 
-        AddBlobFileIfNeeded(vstorage, base_meta,
-                            base_meta->GetBlobFileNumber());
+        AddBlobFileIfNeeded(vstorage, base_meta);
 
         return true;
       }
 
-      AddBlobFileIfNeeded(vstorage, CreateBlobFileMetaData(mutable_meta),
-                          mutable_meta.GetBlobFileNumber());
+      AddBlobFileIfNeeded(vstorage, CreateBlobFileMetaData(mutable_meta));
 
       return true;
     };
@@ -1362,10 +1125,6 @@ class VersionBuilder::Rep {
   void MaybeAddFile(VersionStorageInfo* vstorage, int level,
                     FileMetaData* f) const {
     const uint64_t file_number = f->fd.GetNumber();
-    if (track_found_and_missing_files_ && level == 0 &&
-        l0_missing_files_.find(file_number) != l0_missing_files_.end()) {
-      return;
-    }
 
     const auto& level_state = levels_[level];
 
@@ -1389,29 +1148,6 @@ class VersionBuilder::Rep {
     }
   }
 
-  bool ContainsCompleteVersion() const {
-    assert(track_found_and_missing_files_);
-    return l0_missing_files_.empty() && non_l0_missing_files_.empty() &&
-           (missing_blob_files_high_ == kInvalidBlobFileNumber ||
-            missing_blob_files_high_ < GetMinOldestBlobFileNumber());
-  }
-
-  bool HasMissingFiles() const {
-    assert(track_found_and_missing_files_);
-    return !l0_missing_files_.empty() || !non_l0_missing_files_.empty() ||
-           missing_blob_files_high_ != kInvalidBlobFileNumber;
-  }
-
-  std::vector<std::string>& GetAndClearIntermediateFiles() {
-    assert(track_found_and_missing_files_);
-    return intermediate_files_;
-  }
-
-  void ClearFoundFiles() {
-    assert(track_found_and_missing_files_);
-    found_files_.clear();
-  }
-
   template <typename Cmp>
   void SaveSSTFilesTo(VersionStorageInfo* vstorage, int level, Cmp cmp) const {
     // Merge the set of added files with the set of pre-existing files.
@@ -1420,16 +1156,6 @@ class VersionBuilder::Rep {
     const auto& unordered_added_files = levels_[level].added_files;
     vstorage->Reserve(level, base_files.size() + unordered_added_files.size());
 
-    MergeUnorderdAddedFilesWithBase(
-        base_files, unordered_added_files, cmp,
-        [&](FileMetaData* file) { MaybeAddFile(vstorage, level, file); });
-  }
-
-  template <typename Cmp, typename AddFileFunc>
-  void MergeUnorderdAddedFilesWithBase(
-      const std::vector<FileMetaData*>& base_files,
-      const std::unordered_map<uint64_t, FileMetaData*>& unordered_added_files,
-      Cmp cmp, AddFileFunc add_file_func) const {
     // Sort added files for the level.
     std::vector<FileMetaData*> added_files;
     added_files.reserve(unordered_added_files.size());
@@ -1445,9 +1171,9 @@ class VersionBuilder::Rep {
     while (added_iter != added_end || base_iter != base_end) {
       if (base_iter == base_end ||
           (added_iter != added_end && cmp(*added_iter, *base_iter))) {
-        add_file_func(*added_iter++);
+        MaybeAddFile(vstorage, level, *added_iter++);
       } else {
-        add_file_func(*base_iter++);
+        MaybeAddFile(vstorage, level, *base_iter++);
       }
     }
   }
@@ -1489,13 +1215,13 @@ class VersionBuilder::Rep {
     }
 
     if (epoch_number_requirement == EpochNumberRequirement::kMightMissing) {
-      SaveSSTFilesTo(vstorage, /* level */ 0, *level_zero_cmp_by_seqno_);
+      SaveSSTFilesTo(vstorage, /* level */ 0, level_zero_cmp_by_seqno_);
     } else {
-      SaveSSTFilesTo(vstorage, /* level */ 0, *level_zero_cmp_by_epochno_);
+      SaveSSTFilesTo(vstorage, /* level */ 0, level_zero_cmp_by_epochno_);
     }
 
     for (int level = 1; level < num_levels_; ++level) {
-      SaveSSTFilesTo(vstorage, level, *level_nonzero_cmp_);
+      SaveSSTFilesTo(vstorage, level, level_nonzero_cmp_);
     }
   }
 
@@ -1506,110 +1232,8 @@ class VersionBuilder::Rep {
     }
   }
 
-  bool ValidVersionAvailable() {
-    assert(track_found_and_missing_files_);
-    if (version_updated_since_last_check_) {
-      valid_version_available_ = ContainsCompleteVersion();
-      if (!valid_version_available_ && !edited_in_atomic_group_ &&
-          allow_incomplete_valid_version_) {
-        valid_version_available_ = OnlyMissingL0Suffix();
-      }
-      version_updated_since_last_check_ = false;
-    }
-    return valid_version_available_;
-  }
-
-  bool OnlyMissingL0Suffix() const {
-    if (!non_l0_missing_files_.empty()) {
-      return false;
-    }
-    assert(!(l0_missing_files_.empty() && missing_blob_files_.empty()));
-
-    if (!l0_missing_files_.empty() && !MissingL0FilesAreL0Suffix()) {
-      return false;
-    }
-    if (!missing_blob_files_.empty() &&
-        !RemainingSstFilesNotMissingBlobFiles()) {
-      return false;
-    }
-    return true;
-  }
-
-  // Check missing L0 files are a suffix of expected sorted L0 files.
-  bool MissingL0FilesAreL0Suffix() const {
-    assert(non_l0_missing_files_.empty());
-    assert(!l0_missing_files_.empty());
-    std::vector<FileMetaData*> expected_sorted_l0_files;
-    const auto& base_files = base_vstorage_->LevelFiles(0);
-    const auto& unordered_added_files = levels_[0].added_files;
-    expected_sorted_l0_files.reserve(base_files.size() +
-                                     unordered_added_files.size());
-    EpochNumberRequirement epoch_number_requirement =
-        base_vstorage_->GetEpochNumberRequirement();
-
-    if (epoch_number_requirement == EpochNumberRequirement::kMightMissing) {
-      MergeUnorderdAddedFilesWithBase(
-          base_files, unordered_added_files, *level_zero_cmp_by_seqno_,
-          [&](FileMetaData* file) {
-            expected_sorted_l0_files.push_back(file);
-          });
-    } else {
-      MergeUnorderdAddedFilesWithBase(
-          base_files, unordered_added_files, *level_zero_cmp_by_epochno_,
-          [&](FileMetaData* file) {
-            expected_sorted_l0_files.push_back(file);
-          });
-    }
-    assert(expected_sorted_l0_files.size() >= l0_missing_files_.size());
-    std::unordered_set<uint64_t> unaddressed_missing_files = l0_missing_files_;
-    for (auto iter = expected_sorted_l0_files.begin();
-         iter != expected_sorted_l0_files.end(); iter++) {
-      uint64_t file_number = (*iter)->fd.GetNumber();
-      if (l0_missing_files_.find(file_number) != l0_missing_files_.end()) {
-        assert(unaddressed_missing_files.find(file_number) !=
-               unaddressed_missing_files.end());
-        unaddressed_missing_files.erase(file_number);
-      } else if (!unaddressed_missing_files.empty()) {
-        return false;
-      } else {
-        break;
-      }
-    }
-    return true;
-  }
-
-  // Check for each of the missing blob file missing, it either is older than
-  // the minimum oldest blob file required by this Version or only linked to
-  // the missing L0 files.
-  bool RemainingSstFilesNotMissingBlobFiles() const {
-    assert(non_l0_missing_files_.empty());
-    assert(!missing_blob_files_.empty());
-    bool no_l0_files_missing = l0_missing_files_.empty();
-    uint64_t min_oldest_blob_file_num = GetMinOldestBlobFileNumber();
-    for (const auto& missing_blob_file : missing_blob_files_) {
-      if (missing_blob_file < min_oldest_blob_file_num) {
-        continue;
-      }
-      auto iter = mutable_blob_file_metas_.find(missing_blob_file);
-      assert(iter != mutable_blob_file_metas_.end());
-      auto linked_ssts = iter->second.GetLinkedSsts();
-      // TODO(yuzhangyu): In theory, if no L0 SST files ara missing, and only
-      // blob files exclusively linked to a L0 suffix are missing, we can
-      // recover to a valid point in time too. We don't recover that type of
-      // incomplete Version yet.
-      if (!linked_ssts.empty() && no_l0_files_missing) {
-        return false;
-      }
-      if (!OnlyLinkedToMissingL0Files(linked_ssts)) {
-        return false;
-      }
-    }
-    return true;
-  }
-
   // Save the current state in *vstorage.
   Status SaveTo(VersionStorageInfo* vstorage) const {
-    assert(!track_found_and_missing_files_ || valid_version_available_);
     Status s;
 
 #ifndef NDEBUG
@@ -1642,7 +1266,6 @@ class VersionBuilder::Rep {
       size_t max_file_size_for_l0_meta_pin, const ReadOptions& read_options,
       uint8_t block_protection_bytes_per_key) {
     assert(table_cache_ != nullptr);
-    assert(!track_found_and_missing_files_ || valid_version_available_);
 
     size_t table_cache_capacity =
         table_cache_->get_cache().get()->GetCapacity();
@@ -1682,11 +1305,6 @@ class VersionBuilder::Rep {
     for (int level = 0; level < num_levels_; level++) {
       for (auto& file_meta_pair : levels_[level].added_files) {
         auto* file_meta = file_meta_pair.second;
-        uint64_t file_number = file_meta->fd.GetNumber();
-        if (track_found_and_missing_files_ && level == 0 &&
-            l0_missing_files_.find(file_number) != l0_missing_files_.end()) {
-          continue;
-        }
         // If the file has been opened before, just skip it.
         if (!file_meta->table_reader_handle) {
           files_meta.emplace_back(file_meta, level);
@@ -1751,13 +1369,9 @@ VersionBuilder::VersionBuilder(
     const FileOptions& file_options, const ImmutableCFOptions* ioptions,
     TableCache* table_cache, VersionStorageInfo* base_vstorage,
     VersionSet* version_set,
-    std::shared_ptr<CacheReservationManager> file_metadata_cache_res_mgr,
-    ColumnFamilyData* cfd, VersionEditHandler* version_edit_handler,
-    bool track_found_and_missing_files, bool allow_incomplete_valid_version)
+    std::shared_ptr<CacheReservationManager> file_metadata_cache_res_mgr)
     : rep_(new Rep(file_options, ioptions, table_cache, base_vstorage,
-                   version_set, file_metadata_cache_res_mgr, cfd,
-                   version_edit_handler, track_found_and_missing_files,
-                   allow_incomplete_valid_version)) {}
+                   version_set, file_metadata_cache_res_mgr)) {}
 
 VersionBuilder::~VersionBuilder() = default;
 
@@ -1785,71 +1399,27 @@ Status VersionBuilder::LoadTableHandlers(
       read_options, block_protection_bytes_per_key);
 }
 
-void VersionBuilder::CreateOrReplaceSavePoint() {
-  assert(rep_);
-  savepoint_ = std::move(rep_);
-  rep_ = std::make_unique<Rep>(*savepoint_);
+uint64_t VersionBuilder::GetMinOldestBlobFileNumber() const {
+  return rep_->GetMinOldestBlobFileNumber();
 }
 
-bool VersionBuilder::ValidVersionAvailable() {
-  return rep_->ValidVersionAvailable();
-}
-
-bool VersionBuilder::HasMissingFiles() const { return rep_->HasMissingFiles(); }
-
-std::vector<std::string>& VersionBuilder::GetAndClearIntermediateFiles() {
-  return rep_->GetAndClearIntermediateFiles();
-}
-
-void VersionBuilder::ClearFoundFiles() { return rep_->ClearFoundFiles(); }
-
-Status VersionBuilder::SaveSavePointTo(VersionStorageInfo* vstorage) const {
-  if (!savepoint_ || !savepoint_->ValidVersionAvailable()) {
-    return Status::InvalidArgument();
-  }
-  return savepoint_->SaveTo(vstorage);
-}
-
-Status VersionBuilder::LoadSavePointTableHandlers(
-    InternalStats* internal_stats, int max_threads,
-    bool prefetch_index_and_filter_in_cache, bool is_initial_load,
-    const std::shared_ptr<const SliceTransform>& prefix_extractor,
-    size_t max_file_size_for_l0_meta_pin, const ReadOptions& read_options,
-    uint8_t block_protection_bytes_per_key) {
-  if (!savepoint_ || !savepoint_->ValidVersionAvailable()) {
-    return Status::InvalidArgument();
-  }
-  return savepoint_->LoadTableHandlers(
-      internal_stats, max_threads, prefetch_index_and_filter_in_cache,
-      is_initial_load, prefix_extractor, max_file_size_for_l0_meta_pin,
-      read_options, block_protection_bytes_per_key);
-}
-
-void VersionBuilder::ClearSavePoint() { savepoint_.reset(nullptr); }
-
 BaseReferencedVersionBuilder::BaseReferencedVersionBuilder(
-    ColumnFamilyData* cfd, VersionEditHandler* version_edit_handler,
-    bool track_found_and_missing_files, bool allow_incomplete_valid_version)
+    ColumnFamilyData* cfd)
     : version_builder_(new VersionBuilder(
           cfd->current()->version_set()->file_options(), cfd->ioptions(),
           cfd->table_cache(), cfd->current()->storage_info(),
           cfd->current()->version_set(),
-          cfd->GetFileMetadataCacheReservationManager(), cfd,
-          version_edit_handler, track_found_and_missing_files,
-          allow_incomplete_valid_version)),
+          cfd->GetFileMetadataCacheReservationManager())),
       version_(cfd->current()) {
   version_->Ref();
 }
 
 BaseReferencedVersionBuilder::BaseReferencedVersionBuilder(
-    ColumnFamilyData* cfd, Version* v, VersionEditHandler* version_edit_handler,
-    bool track_found_and_missing_files, bool allow_incomplete_valid_version)
+    ColumnFamilyData* cfd, Version* v)
     : version_builder_(new VersionBuilder(
           cfd->current()->version_set()->file_options(), cfd->ioptions(),
           cfd->table_cache(), v->storage_info(), v->version_set(),
-          cfd->GetFileMetadataCacheReservationManager(), cfd,
-          version_edit_handler, track_found_and_missing_files,
-          allow_incomplete_valid_version)),
+          cfd->GetFileMetadataCacheReservationManager())),
       version_(v) {
   assert(version_ != cfd->current());
 }

db/version_builder.h

@@ -26,7 +26,6 @@ struct FileMetaData;
 class InternalStats;
 class Version;
 class VersionSet;
-class VersionEditHandler;
 class ColumnFamilyData;
 class CacheReservationManager;
 
@@ -39,80 +38,22 @@ class VersionBuilder {
                  const ImmutableCFOptions* ioptions, TableCache* table_cache,
                  VersionStorageInfo* base_vstorage, VersionSet* version_set,
                  std::shared_ptr<CacheReservationManager>
-                     file_metadata_cache_res_mgr = nullptr,
-                 ColumnFamilyData* cfd = nullptr,
-                 VersionEditHandler* version_edit_handler = nullptr,
-                 bool track_found_and_missing_files = false,
-                 bool allow_incomplete_valid_version = false);
+                     file_metadata_cache_res_mgr = nullptr);
   ~VersionBuilder();
 
   bool CheckConsistencyForNumLevels();
-
   Status Apply(const VersionEdit* edit);
-
-  // Save the current Version to the provided `vstorage`.
   Status SaveTo(VersionStorageInfo* vstorage) const;
-
-  // Load all the table handlers for the current Version in the builder.
   Status LoadTableHandlers(
       InternalStats* internal_stats, int max_threads,
       bool prefetch_index_and_filter_in_cache, bool is_initial_load,
       const std::shared_ptr<const SliceTransform>& prefix_extractor,
       size_t max_file_size_for_l0_meta_pin, const ReadOptions& read_options,
       uint8_t block_protection_bytes_per_key);
-
-  //============APIs only used by VersionEditHandlerPointInTime ============//
-
-  // Creates a save point for the Version that has been built so far. Subsequent
-  // VersionEdits applied to the builder will not affect the Version in this
-  // save point. VersionBuilder currently only supports creating one save point,
-  // so when `CreateOrReplaceSavePoint` is called again, the previous save point
-  // is cleared. `ClearSavePoint` can be called explicitly to clear
-  // the save point too.
-  void CreateOrReplaceSavePoint();
-
-  // The builder can find all the files to build a `Version`. Or if
-  // `allow_incomplete_valid_version_` is true and the version history is never
-  // edited in an atomic group, and only a suffix of L0 SST files and their
-  // associated blob files are missing.
-  // From the users' perspective, missing a suffix of L0 files means missing the
-  // user's most recently written data. So the remaining available files still
-  // presents a valid point in time view, although for some previous time.
-  // This validity check result will be cached and reused if the Version is not
-  // updated between two validity checks.
-  bool ValidVersionAvailable();
-
-  bool HasMissingFiles() const;
-
-  // When applying a sequence of VersionEdit, intermediate files are the ones
-  // that are added and then deleted. The caller should clear this intermediate
-  // files tracking after calling this API. So that the tracking for subsequent
-  // VersionEdits can start over with a clean state.
-  std::vector<std::string>& GetAndClearIntermediateFiles();
-
-  // Clearing all the found files in this Version.
-  void ClearFoundFiles();
-
-  // Save the Version in the save point to the provided `vstorage`.
-  // Non-OK status will be returned if there is not a valid save point.
-  Status SaveSavePointTo(VersionStorageInfo* vstorage) const;
-
-  // Load all the table handlers for the Version in the save point.
-  // Non-OK status will be returned if there is not a valid save point.
-  Status LoadSavePointTableHandlers(
-      InternalStats* internal_stats, int max_threads,
-      bool prefetch_index_and_filter_in_cache, bool is_initial_load,
-      const std::shared_ptr<const SliceTransform>& prefix_extractor,
-      size_t max_file_size_for_l0_meta_pin, const ReadOptions& read_options,
-      uint8_t block_protection_bytes_per_key);
-
-  void ClearSavePoint();
-
-  //======= End of APIs only used by VersionEditPointInTime==========//
+  uint64_t GetMinOldestBlobFileNumber() const;
 
  private:
   class Rep;
-  std::unique_ptr<Rep> savepoint_;
   std::unique_ptr<Rep> rep_;
 };
 
@@ -121,15 +62,8 @@ class VersionBuilder {
 // Both of the constructor and destructor need to be called inside DB Mutex.
 class BaseReferencedVersionBuilder {
  public:
-  explicit BaseReferencedVersionBuilder(
-      ColumnFamilyData* cfd, VersionEditHandler* version_edit_handler = nullptr,
-      bool track_found_and_missing_files = false,
-      bool allow_incomplete_valid_version = false);
-  BaseReferencedVersionBuilder(
-      ColumnFamilyData* cfd, Version* v,
-      VersionEditHandler* version_edit_handler = nullptr,
-      bool track_found_and_missing_files = false,
-      bool allow_incomplete_valid_version = false);
+  explicit BaseReferencedVersionBuilder(ColumnFamilyData* cfd);
+  BaseReferencedVersionBuilder(ColumnFamilyData* cfd, Version* v);
   ~BaseReferencedVersionBuilder();
   VersionBuilder* version_builder() const { return version_builder_.get(); }
 
@@ -137,4 +71,23 @@ class BaseReferencedVersionBuilder {
   std::unique_ptr<VersionBuilder> version_builder_;
   Version* version_;
 };
+
+class NewestFirstBySeqNo {
+ public:
+  bool operator()(const FileMetaData* lhs, const FileMetaData* rhs) const {
+    assert(lhs);
+    assert(rhs);
+
+    if (lhs->fd.largest_seqno != rhs->fd.largest_seqno) {
+      return lhs->fd.largest_seqno > rhs->fd.largest_seqno;
+    }
+
+    if (lhs->fd.smallest_seqno != rhs->fd.smallest_seqno) {
+      return lhs->fd.smallest_seqno > rhs->fd.smallest_seqno;
+    }
+
+    // Break ties by file number
+    return lhs->fd.GetNumber() > rhs->fd.GetNumber();
+  }
+};
 }  // namespace ROCKSDB_NAMESPACE

db/version_edit_handler.cc

@@ -155,7 +155,6 @@ VersionEditHandler::VersionEditHandler(
     VersionSet* version_set, bool track_found_and_missing_files,
     bool no_error_if_files_missing, const std::shared_ptr<IOTracer>& io_tracer,
     const ReadOptions& read_options, bool skip_load_table_files,
-    bool allow_incomplete_valid_version,
     EpochNumberRequirement epoch_number_requirement)
     : VersionEditHandlerBase(read_options),
       read_only_(read_only),
@@ -166,7 +165,6 @@ VersionEditHandler::VersionEditHandler(
       io_tracer_(io_tracer),
       skip_load_table_files_(skip_load_table_files),
       initialized_(false),
-      allow_incomplete_valid_version_(allow_incomplete_valid_version),
       epoch_number_requirement_(epoch_number_requirement) {
   assert(version_set_ != nullptr);
 }
@@ -220,15 +218,15 @@ Status VersionEditHandler::ApplyVersionEdit(VersionEdit& edit,
 
 Status VersionEditHandler::OnColumnFamilyAdd(VersionEdit& edit,
                                              ColumnFamilyData** cfd) {
-  bool do_not_open_cf = false;
+  bool cf_in_not_found = false;
   bool cf_in_builders = false;
-  CheckColumnFamilyId(edit, &do_not_open_cf, &cf_in_builders);
+  CheckColumnFamilyId(edit, &cf_in_not_found, &cf_in_builders);
 
   assert(cfd != nullptr);
   *cfd = nullptr;
   const std::string& cf_name = edit.GetColumnFamilyName();
   Status s;
-  if (cf_in_builders || do_not_open_cf) {
+  if (cf_in_builders || cf_in_not_found) {
     s = Status::Corruption("MANIFEST adding the same column family twice: " +
                            cf_name);
   }
@@ -241,7 +239,7 @@ Status VersionEditHandler::OnColumnFamilyAdd(VersionEdit& edit,
         cf_name.compare(kPersistentStatsColumnFamilyName) == 0;
     if (cf_options == name_to_options_.end() &&
         !is_persistent_stats_column_family) {
-      do_not_open_column_families_.emplace(edit.GetColumnFamily(), cf_name);
+      column_families_not_found_.emplace(edit.GetColumnFamily(), cf_name);
     } else {
       if (is_persistent_stats_column_family) {
         ColumnFamilyOptions cfo;
@@ -258,9 +256,9 @@ Status VersionEditHandler::OnColumnFamilyAdd(VersionEdit& edit,
 
 Status VersionEditHandler::OnColumnFamilyDrop(VersionEdit& edit,
                                               ColumnFamilyData** cfd) {
-  bool do_not_open_cf = false;
+  bool cf_in_not_found = false;
   bool cf_in_builders = false;
-  CheckColumnFamilyId(edit, &do_not_open_cf, &cf_in_builders);
+  CheckColumnFamilyId(edit, &cf_in_not_found, &cf_in_builders);
 
   assert(cfd != nullptr);
   *cfd = nullptr;
@@ -268,8 +266,8 @@ Status VersionEditHandler::OnColumnFamilyDrop(VersionEdit& edit,
   Status s;
   if (cf_in_builders) {
     tmp_cfd = DestroyCfAndCleanup(edit);
-  } else if (do_not_open_cf) {
-    do_not_open_column_families_.erase(edit.GetColumnFamily());
+  } else if (cf_in_not_found) {
+    column_families_not_found_.erase(edit.GetColumnFamily());
   } else {
     s = Status::Corruption("MANIFEST - dropping non-existing column family");
   }
@@ -290,20 +288,22 @@ Status VersionEditHandler::OnWalDeletion(VersionEdit& edit) {
 
 Status VersionEditHandler::OnNonCfOperation(VersionEdit& edit,
                                             ColumnFamilyData** cfd) {
-  bool do_not_open_cf = false;
+  bool cf_in_not_found = false;
   bool cf_in_builders = false;
-  CheckColumnFamilyId(edit, &do_not_open_cf, &cf_in_builders);
+  CheckColumnFamilyId(edit, &cf_in_not_found, &cf_in_builders);
 
   assert(cfd != nullptr);
   *cfd = nullptr;
   Status s;
-  if (!do_not_open_cf) {
+  if (!cf_in_not_found) {
     if (!cf_in_builders) {
       s = Status::Corruption(
           "MANIFEST record referencing unknown column family");
     }
     ColumnFamilyData* tmp_cfd = nullptr;
     if (s.ok()) {
+      auto builder_iter = builders_.find(edit.GetColumnFamily());
+      assert(builder_iter != builders_.end());
       tmp_cfd = version_set_->GetColumnFamilySet()->GetColumnFamily(
           edit.GetColumnFamily());
       assert(tmp_cfd != nullptr);
@@ -318,33 +318,56 @@ Status VersionEditHandler::OnNonCfOperation(VersionEdit& edit,
       if (!s.ok()) {
         return s;
       }
-      s = MaybeCreateVersionBeforeApplyEdit(edit, tmp_cfd,
-                                            /*force_create_version=*/false);
+      s = MaybeCreateVersion(edit, tmp_cfd, /*force_create_version=*/false);
+      if (s.ok()) {
+        s = builder_iter->second->version_builder()->Apply(&edit);
+      }
     }
     *cfd = tmp_cfd;
   }
   return s;
 }
 
+// TODO maybe cache the computation result
+bool VersionEditHandler::HasMissingFiles() const {
+  bool ret = false;
+  for (const auto& elem : cf_to_missing_files_) {
+    const auto& missing_files = elem.second;
+    if (!missing_files.empty()) {
+      ret = true;
+      break;
+    }
+  }
+  if (!ret) {
+    for (const auto& elem : cf_to_missing_blob_files_high_) {
+      if (elem.second != kInvalidBlobFileNumber) {
+        ret = true;
+        break;
+      }
+    }
+  }
+  return ret;
+}
+
 void VersionEditHandler::CheckColumnFamilyId(const VersionEdit& edit,
-                                             bool* do_not_open_cf,
+                                             bool* cf_in_not_found,
                                              bool* cf_in_builders) const {
-  assert(do_not_open_cf != nullptr);
+  assert(cf_in_not_found != nullptr);
   assert(cf_in_builders != nullptr);
   // Not found means that user didn't supply that column
   // family option AND we encountered column family add
   // record. Once we encounter column family drop record,
   // we will delete the column family from
-  // do_not_open_column_families_.
+  // column_families_not_found.
   uint32_t cf_id = edit.GetColumnFamily();
-  bool in_do_not_open = do_not_open_column_families_.find(cf_id) !=
-                        do_not_open_column_families_.end();
+  bool in_not_found = column_families_not_found_.find(cf_id) !=
+                      column_families_not_found_.end();
   // in builders means that user supplied that column family
   // option AND that we encountered column family add record
   bool in_builders = builders_.find(cf_id) != builders_.end();
   // They cannot both be true
-  assert(!(in_do_not_open && in_builders));
-  *do_not_open_cf = in_do_not_open;
+  assert(!(in_not_found && in_builders));
+  *cf_in_not_found = in_not_found;
   *cf_in_builders = in_builders;
 }
 
@@ -373,9 +396,9 @@ void VersionEditHandler::CheckIterationResult(const log::Reader& reader,
   // There were some column families in the MANIFEST that weren't specified
   // in the argument. This is OK in read_only mode
   if (s->ok() && MustOpenAllColumnFamilies() &&
-      !do_not_open_column_families_.empty()) {
+      !column_families_not_found_.empty()) {
     std::string msg;
-    for (const auto& cf : do_not_open_column_families_) {
+    for (const auto& cf : column_families_not_found_) {
       msg.append(", ");
       msg.append(cf.second);
     }
@@ -430,8 +453,7 @@ void VersionEditHandler::CheckIterationResult(const log::Reader& reader,
       }
       assert(cfd->initialized());
       VersionEdit edit;
-      *s = MaybeCreateVersionBeforeApplyEdit(edit, cfd,
-                                             /*force_create_version=*/true);
+      *s = MaybeCreateVersion(edit, cfd, /*force_create_version=*/true);
       if (!s->ok()) {
         break;
       }
@@ -476,9 +498,13 @@ ColumnFamilyData* VersionEditHandler::CreateCfAndInit(
   assert(cfd != nullptr);
   cfd->set_initialized();
   assert(builders_.find(cf_id) == builders_.end());
-  builders_.emplace(cf_id, VersionBuilderUPtr(new BaseReferencedVersionBuilder(
-                               cfd, this, track_found_and_missing_files_,
-                               allow_incomplete_valid_version_)));
+  builders_.emplace(cf_id,
+                    VersionBuilderUPtr(new BaseReferencedVersionBuilder(cfd)));
+  if (track_found_and_missing_files_) {
+    cf_to_found_files_.emplace(cf_id, std::unordered_set<uint64_t>());
+    cf_to_missing_files_.emplace(cf_id, std::unordered_set<uint64_t>());
+    cf_to_missing_blob_files_high_.emplace(cf_id, kInvalidBlobFileNumber);
+  }
   return cfd;
 }
 
@@ -488,6 +514,21 @@ ColumnFamilyData* VersionEditHandler::DestroyCfAndCleanup(
   auto builder_iter = builders_.find(cf_id);
   assert(builder_iter != builders_.end());
   builders_.erase(builder_iter);
+  if (track_found_and_missing_files_) {
+    auto found_files_iter = cf_to_found_files_.find(cf_id);
+    assert(found_files_iter != cf_to_found_files_.end());
+    cf_to_found_files_.erase(found_files_iter);
+
+    auto missing_files_iter = cf_to_missing_files_.find(cf_id);
+    assert(missing_files_iter != cf_to_missing_files_.end());
+    cf_to_missing_files_.erase(missing_files_iter);
+
+    auto missing_blob_files_high_iter =
+        cf_to_missing_blob_files_high_.find(cf_id);
+    assert(missing_blob_files_high_iter !=
+           cf_to_missing_blob_files_high_.end());
+    cf_to_missing_blob_files_high_.erase(missing_blob_files_high_iter);
+  }
   ColumnFamilyData* ret =
       version_set_->GetColumnFamilySet()->GetColumnFamily(cf_id);
   assert(ret != nullptr);
@@ -497,14 +538,15 @@ ColumnFamilyData* VersionEditHandler::DestroyCfAndCleanup(
   return ret;
 }
 
-Status VersionEditHandler::MaybeCreateVersionBeforeApplyEdit(
-    const VersionEdit& edit, ColumnFamilyData* cfd, bool force_create_version) {
+Status VersionEditHandler::MaybeCreateVersion(const VersionEdit& /*edit*/,
+                                              ColumnFamilyData* cfd,
+                                              bool force_create_version) {
   assert(cfd->initialized());
   Status s;
-  auto builder_iter = builders_.find(cfd->GetID());
-  assert(builder_iter != builders_.end());
-  auto* builder = builder_iter->second->version_builder();
   if (force_create_version) {
+    auto builder_iter = builders_.find(cfd->GetID());
+    assert(builder_iter != builders_.end());
+    auto* builder = builder_iter->second->version_builder();
     auto* v = new Version(cfd, version_set_, version_set_->file_options_,
                           *cfd->GetLatestMutableCFOptions(), io_tracer_,
                           version_set_->current_version_number_++,
@@ -520,7 +562,6 @@ Status VersionEditHandler::MaybeCreateVersionBeforeApplyEdit(
       delete v;
     }
   }
-  s = builder->Apply(&edit);
   return s;
 }
 
@@ -690,13 +731,12 @@ Status VersionEditHandler::MaybeHandleFileBoundariesForNewFiles(
 VersionEditHandlerPointInTime::VersionEditHandlerPointInTime(
     bool read_only, std::vector<ColumnFamilyDescriptor> column_families,
     VersionSet* version_set, const std::shared_ptr<IOTracer>& io_tracer,
-    const ReadOptions& read_options, bool allow_incomplete_valid_version,
+    const ReadOptions& read_options,
     EpochNumberRequirement epoch_number_requirement)
     : VersionEditHandler(read_only, column_families, version_set,
                          /*track_found_and_missing_files=*/true,
                          /*no_error_if_files_missing=*/true, io_tracer,
-                         read_options, allow_incomplete_valid_version,
-                         epoch_number_requirement) {}
+                         read_options, epoch_number_requirement) {}
 
 VersionEditHandlerPointInTime::~VersionEditHandlerPointInTime() {
   for (const auto& cfid_and_version : atomic_update_versions_) {
@@ -722,8 +762,7 @@ Status VersionEditHandlerPointInTime::OnAtomicGroupReplayBegin() {
     assert(!cfd->IsDropped());
     assert(cfd->initialized());
     VersionEdit edit;
-    Status s = MaybeCreateVersionBeforeApplyEdit(
-        edit, cfd, true /* force_create_version */);
+    Status s = MaybeCreateVersion(edit, cfd, true /* force_create_version */);
     if (!s.ok()) {
       return s;
     }
@@ -785,17 +824,17 @@ void VersionEditHandlerPointInTime::CheckIterationResult(
       }
       assert(cfd->initialized());
       auto v_iter = versions_.find(cfd->GetID());
-      auto builder_iter = builders_.find(cfd->GetID());
       if (v_iter != versions_.end()) {
         assert(v_iter->second != nullptr);
-        assert(builder_iter != builders_.end());
 
         version_set_->AppendVersion(cfd, v_iter->second);
         versions_.erase(v_iter);
         // Let's clear found_files, since any files in that are part of the
         // installed Version. Any files that got obsoleted would have already
         // been moved to intermediate_files_
-        builder_iter->second->version_builder()->ClearFoundFiles();
+        auto found_files_iter = cf_to_found_files_.find(cfd->GetID());
+        assert(found_files_iter != cf_to_found_files_.end());
+        found_files_iter->second.clear();
       }
     }
   } else {
@@ -824,50 +863,147 @@ ColumnFamilyData* VersionEditHandlerPointInTime::DestroyCfAndCleanup(
   return cfd;
 }
 
-Status VersionEditHandlerPointInTime::MaybeCreateVersionBeforeApplyEdit(
+Status VersionEditHandlerPointInTime::MaybeCreateVersion(
     const VersionEdit& edit, ColumnFamilyData* cfd, bool force_create_version) {
-  TEST_SYNC_POINT(
-      "VersionEditHandlerPointInTime::MaybeCreateVersionBeforeApplyEdit:"
-      "Begin1");
-  TEST_SYNC_POINT(
-      "VersionEditHandlerPointInTime::MaybeCreateVersionBeforeApplyEdit:"
-      "Begin2");
+  TEST_SYNC_POINT("VersionEditHandlerPointInTime::MaybeCreateVersion:Begin1");
+  TEST_SYNC_POINT("VersionEditHandlerPointInTime::MaybeCreateVersion:Begin2");
   assert(cfd != nullptr);
   if (!force_create_version) {
     assert(edit.GetColumnFamily() == cfd->GetID());
   }
+  auto found_files_iter = cf_to_found_files_.find(cfd->GetID());
+  assert(found_files_iter != cf_to_found_files_.end());
+  std::unordered_set<uint64_t>& found_files = found_files_iter->second;
+
+  auto missing_files_iter = cf_to_missing_files_.find(cfd->GetID());
+  assert(missing_files_iter != cf_to_missing_files_.end());
+  std::unordered_set<uint64_t>& missing_files = missing_files_iter->second;
+
+  auto missing_blob_files_high_iter =
+      cf_to_missing_blob_files_high_.find(cfd->GetID());
+  assert(missing_blob_files_high_iter != cf_to_missing_blob_files_high_.end());
+  const uint64_t prev_missing_blob_file_high =
+      missing_blob_files_high_iter->second;
+
+  VersionBuilder* builder = nullptr;
+
+  if (prev_missing_blob_file_high != kInvalidBlobFileNumber) {
+    auto builder_iter = builders_.find(cfd->GetID());
+    assert(builder_iter != builders_.end());
+    builder = builder_iter->second->version_builder();
+    assert(builder != nullptr);
+  }
+
+  // At this point, we have not yet applied the new version edits read from the
+  // MANIFEST. We check whether we have any missing table and blob files.
+  const bool prev_has_missing_files =
+      !missing_files.empty() ||
+      (prev_missing_blob_file_high != kInvalidBlobFileNumber &&
+       prev_missing_blob_file_high >= builder->GetMinOldestBlobFileNumber());
+
+  for (const auto& file : edit.GetDeletedFiles()) {
+    uint64_t file_num = file.second;
+    auto fiter = missing_files.find(file_num);
+    if (fiter != missing_files.end()) {
+      missing_files.erase(fiter);
+    } else {
+      fiter = found_files.find(file_num);
+      // Only mark new files added during this catchup attempt for deletion.
+      // These files were never installed in VersionStorageInfo.
+      // Already referenced files that are deleted by a VersionEdit will
+      // be added to the VersionStorageInfo's obsolete files when the old
+      // version is dereferenced.
+      if (fiter != found_files.end()) {
+        intermediate_files_.emplace_back(
+            MakeTableFileName(cfd->ioptions()->cf_paths[0].path, file_num));
+        found_files.erase(fiter);
+      }
+    }
+  }
+
+  assert(!cfd->ioptions()->cf_paths.empty());
+  Status s;
+  for (const auto& elem : edit.GetNewFiles()) {
+    int level = elem.first;
+    const FileMetaData& meta = elem.second;
+    const FileDescriptor& fd = meta.fd;
+    uint64_t file_num = fd.GetNumber();
+    const std::string fpath =
+        MakeTableFileName(cfd->ioptions()->cf_paths[0].path, file_num);
+    s = VerifyFile(cfd, fpath, level, meta);
+    if (s.IsPathNotFound() || s.IsNotFound() || s.IsCorruption()) {
+      missing_files.insert(file_num);
+      if (s.IsCorruption()) {
+        found_files.insert(file_num);
+      }
+      s = Status::OK();
+    } else if (!s.ok()) {
+      break;
+    } else {
+      found_files.insert(file_num);
+    }
+  }
+
+  uint64_t missing_blob_file_num = prev_missing_blob_file_high;
+  for (const auto& elem : edit.GetBlobFileAdditions()) {
+    uint64_t file_num = elem.GetBlobFileNumber();
+    s = VerifyBlobFile(cfd, file_num, elem);
+    if (s.IsPathNotFound() || s.IsNotFound() || s.IsCorruption()) {
+      missing_blob_file_num = std::max(missing_blob_file_num, file_num);
+      s = Status::OK();
+    } else if (!s.ok()) {
+      break;
+    }
+  }
+
+  bool has_missing_blob_files = false;
+  if (missing_blob_file_num != kInvalidBlobFileNumber &&
+      missing_blob_file_num >= prev_missing_blob_file_high) {
+    missing_blob_files_high_iter->second = missing_blob_file_num;
+    has_missing_blob_files = true;
+  } else if (missing_blob_file_num < prev_missing_blob_file_high) {
+    assert(false);
+  }
+
+  // We still have not applied the new version edit, but have tried to add new
+  // table and blob files after verifying their presence and consistency.
+  // Therefore, we know whether we will see new missing table and blob files
+  // later after actually applying the version edit. We perform the check here
+  // and record the result.
+  const bool has_missing_files =
+      !missing_files.empty() || has_missing_blob_files;
 
   bool missing_info = !version_edit_params_.HasLogNumber() ||
                       !version_edit_params_.HasNextFile() ||
                       !version_edit_params_.HasLastSequence();
 
-  Status s;
-  auto builder_iter = builders_.find(cfd->GetID());
-  assert(builder_iter != builders_.end());
-  VersionBuilder* builder = builder_iter->second->version_builder();
-  const bool valid_pit_before_edit = builder->ValidVersionAvailable();
-  builder->CreateOrReplaceSavePoint();
-  s = builder->Apply(&edit);
-  const bool valid_pit_after_edit = builder->ValidVersionAvailable();
-
+  // Create version before apply edit. The version will represent the state
+  // before applying the version edit.
   // A new version will be created if:
   // 1) no error has occurred so far, and
   // 2) log_number_, next_file_number_ and last_sequence_ are known, and
   // 3) not in an AtomicGroup
   // 4) any of the following:
-  //   a) a valid Version is available before applying the edit
-  //      and a valid Version is not available after the edit.
-  //   b) a valid Version is available after the edit and the
-  //      caller explicitly request that a new version be created.
+  //   a) no missing file before, but will have missing file(s) after applying
+  //      this version edit.
+  //   b) no missing file after applying the version edit, and the caller
+  //      explicitly request that a new version be created.
   if (s.ok() && !missing_info && !in_atomic_group_ &&
-      ((!valid_pit_after_edit && valid_pit_before_edit) ||
-       (valid_pit_after_edit && force_create_version))) {
+      ((has_missing_files && !prev_has_missing_files) ||
+       (!has_missing_files && force_create_version))) {
+    if (!builder) {
+      auto builder_iter = builders_.find(cfd->GetID());
+      assert(builder_iter != builders_.end());
+      builder = builder_iter->second->version_builder();
+      assert(builder);
+    }
+
     const MutableCFOptions* cf_opts_ptr = cfd->GetLatestMutableCFOptions();
     auto* version = new Version(cfd, version_set_, version_set_->file_options_,
                                 *cf_opts_ptr, io_tracer_,
                                 version_set_->current_version_number_++,
                                 epoch_number_requirement_);
-    s = builder->LoadSavePointTableHandlers(
+    s = builder->LoadTableHandlers(
         cfd->internal_stats(),
         version_set_->db_options_->max_file_opening_threads, false, true,
         cf_opts_ptr->prefix_extractor, MaxFileSizeForL0MetaPin(*cf_opts_ptr),
@@ -879,7 +1015,7 @@ Status VersionEditHandlerPointInTime::MaybeCreateVersionBeforeApplyEdit(
       }
       return s;
     }
-    s = builder->SaveSavePointTo(version->storage_info());
+    s = builder->SaveTo(version->storage_info());
     if (s.ok()) {
       if (AtomicUpdateVersionsContains(cfd->GetID())) {
         AtomicUpdateVersionsPut(version);
@@ -902,8 +1038,6 @@ Status VersionEditHandlerPointInTime::MaybeCreateVersionBeforeApplyEdit(
       delete version;
     }
   }
-
-  builder->ClearSavePoint();
   return s;
 }
 
@@ -938,15 +1072,6 @@ Status VersionEditHandlerPointInTime::LoadTables(
   return Status::OK();
 }
 
-bool VersionEditHandlerPointInTime::HasMissingFiles() const {
-  for (const auto& builder : builders_) {
-    if (builder.second->version_builder()->HasMissingFiles()) {
-      return true;
-    }
-  }
-  return false;
-}
-
 bool VersionEditHandlerPointInTime::AtomicUpdateVersionsCompleted() {
   return atomic_update_versions_missing_ == 0;
 }
@@ -1020,9 +1145,8 @@ Status ManifestTailer::Initialize() {
     Version* base_version = dummy_version->Next();
     assert(base_version);
     base_version->Ref();
-    VersionBuilderUPtr new_builder(new BaseReferencedVersionBuilder(
-        default_cfd, base_version, this, track_found_and_missing_files_,
-        allow_incomplete_valid_version_));
+    VersionBuilderUPtr new_builder(
+        new BaseReferencedVersionBuilder(default_cfd, base_version));
     builder_iter->second = std::move(new_builder);
 
     initialized_ = true;
@@ -1065,8 +1189,8 @@ Status ManifestTailer::OnColumnFamilyAdd(VersionEdit& edit,
   Version* base_version = dummy_version->Next();
   assert(base_version);
   base_version->Ref();
-  VersionBuilderUPtr new_builder(new BaseReferencedVersionBuilder(
-      tmp_cfd, base_version, this, track_found_and_missing_files_));
+  VersionBuilderUPtr new_builder(
+      new BaseReferencedVersionBuilder(tmp_cfd, base_version));
   builder_iter->second = std::move(new_builder);
 
 #ifndef NDEBUG
@@ -1089,18 +1213,6 @@ void ManifestTailer::CheckIterationResult(const log::Reader& reader,
   }
 }
 
-std::vector<std::string> ManifestTailer::GetAndClearIntermediateFiles() {
-  std::vector<std::string> res;
-  for (const auto& builder : builders_) {
-    auto files =
-        builder.second->version_builder()->GetAndClearIntermediateFiles();
-    res.insert(res.end(), std::make_move_iterator(files.begin()),
-               std::make_move_iterator(files.end()));
-    files.erase(files.begin(), files.end());
-  }
-  return res;
-}
-
 Status ManifestTailer::VerifyFile(ColumnFamilyData* cfd,
                                   const std::string& fpath, int level,
                                   const FileMetaData& fmeta) {

db/version_edit_handler.h

@@ -119,14 +119,13 @@ class VersionEditHandler : public VersionEditHandlerBase {
       VersionSet* version_set, bool track_found_and_missing_files,
       bool no_error_if_files_missing,
       const std::shared_ptr<IOTracer>& io_tracer,
-      const ReadOptions& read_options, bool allow_incomplete_valid_version,
+      const ReadOptions& read_options,
       EpochNumberRequirement epoch_number_requirement =
           EpochNumberRequirement::kMustPresent)
       : VersionEditHandler(read_only, column_families, version_set,
                            track_found_and_missing_files,
                            no_error_if_files_missing, io_tracer, read_options,
                            /*skip_load_table_files=*/false,
-                           allow_incomplete_valid_version,
                            epoch_number_requirement) {}
 
   ~VersionEditHandler() override {}
@@ -135,24 +134,14 @@ class VersionEditHandler : public VersionEditHandlerBase {
     return version_edit_params_;
   }
 
+  bool HasMissingFiles() const;
+
   void GetDbId(std::string* db_id) const {
     if (db_id && version_edit_params_.HasDbId()) {
       *db_id = version_edit_params_.GetDbId();
     }
   }
 
-  virtual Status VerifyFile(ColumnFamilyData* /*cfd*/,
-                            const std::string& /*fpath*/, int /*level*/,
-                            const FileMetaData& /*fmeta*/) {
-    return Status::OK();
-  }
-
-  virtual Status VerifyBlobFile(ColumnFamilyData* /*cfd*/,
-                                uint64_t /*blob_file_num*/,
-                                const BlobFileAddition& /*blob_addition*/) {
-    return Status::OK();
-  }
-
  protected:
   explicit VersionEditHandler(
       bool read_only, std::vector<ColumnFamilyDescriptor> column_families,
@@ -160,7 +149,6 @@ class VersionEditHandler : public VersionEditHandlerBase {
       bool no_error_if_files_missing,
       const std::shared_ptr<IOTracer>& io_tracer,
       const ReadOptions& read_options, bool skip_load_table_files,
-      bool allow_incomplete_valid_version,
       EpochNumberRequirement epoch_number_requirement =
           EpochNumberRequirement::kMustPresent);
 
@@ -178,7 +166,7 @@ class VersionEditHandler : public VersionEditHandlerBase {
 
   Status Initialize() override;
 
-  void CheckColumnFamilyId(const VersionEdit& edit, bool* do_not_open_cf,
+  void CheckColumnFamilyId(const VersionEdit& edit, bool* cf_in_not_found,
                            bool* cf_in_builders) const;
 
   void CheckIterationResult(const log::Reader& reader, Status* s) override;
@@ -188,9 +176,9 @@ class VersionEditHandler : public VersionEditHandlerBase {
 
   virtual ColumnFamilyData* DestroyCfAndCleanup(const VersionEdit& edit);
 
-  virtual Status MaybeCreateVersionBeforeApplyEdit(const VersionEdit& edit,
-                                                   ColumnFamilyData* cfd,
-                                                   bool force_create_version);
+  virtual Status MaybeCreateVersion(const VersionEdit& edit,
+                                    ColumnFamilyData* cfd,
+                                    bool force_create_version);
 
   virtual Status LoadTables(ColumnFamilyData* cfd,
                             bool prefetch_index_and_filter_in_cache,
@@ -203,23 +191,21 @@ class VersionEditHandler : public VersionEditHandlerBase {
   VersionSet* version_set_;
   std::unordered_map<uint32_t, VersionBuilderUPtr> builders_;
   std::unordered_map<std::string, ColumnFamilyOptions> name_to_options_;
-  const bool track_found_and_missing_files_;
   // Keeps track of column families in manifest that were not found in
-  // column families parameters. Namely, the user asks to not open these column
-  // families. In non read only mode, if those column families are not dropped
+  // column families parameters. if those column families are not dropped
   // by subsequent manifest records, Recover() will return failure status.
-  std::unordered_map<uint32_t, std::string> do_not_open_column_families_;
+  std::unordered_map<uint32_t, std::string> column_families_not_found_;
   VersionEditParams version_edit_params_;
+  const bool track_found_and_missing_files_;
+  std::unordered_map<uint32_t, std::unordered_set<uint64_t>> cf_to_found_files_;
+  std::unordered_map<uint32_t, std::unordered_set<uint64_t>>
+      cf_to_missing_files_;
+  std::unordered_map<uint32_t, uint64_t> cf_to_missing_blob_files_high_;
   bool no_error_if_files_missing_;
   std::shared_ptr<IOTracer> io_tracer_;
   bool skip_load_table_files_;
   bool initialized_;
   std::unique_ptr<std::unordered_map<uint32_t, std::string>> cf_to_cmp_names_;
-  // If false, only a complete Version for which all files consisting it can be
-  // found is considered a valid Version. If true, besides complete Version, an
-  // incomplete Version with only a suffix of L0 files missing is also
-  // considered valid if the Version is never edited in an atomic group.
-  const bool allow_incomplete_valid_version_;
   EpochNumberRequirement epoch_number_requirement_;
   std::unordered_set<uint32_t> cfds_to_mark_no_udt_;
 
@@ -241,9 +227,7 @@ class VersionEditHandler : public VersionEditHandlerBase {
 
 // A class similar to its base class, i.e. VersionEditHandler.
 // VersionEditHandlerPointInTime restores the versions to the most recent point
-// in time such that at this point, the version does not have missing files. Or
-// if `allow_incomplete_valid_version` is true, only a suffix of L0 files (and
-// their associated blob files) are missing.
+// in time such that at this point, the version does not have missing files.
 //
 // Not thread-safe, external synchronization is necessary if an object of
 // VersionEditHandlerPointInTime is shared by multiple threads.
@@ -252,32 +236,28 @@ class VersionEditHandlerPointInTime : public VersionEditHandler {
   VersionEditHandlerPointInTime(
       bool read_only, std::vector<ColumnFamilyDescriptor> column_families,
       VersionSet* version_set, const std::shared_ptr<IOTracer>& io_tracer,
-      const ReadOptions& read_options, bool allow_incomplete_valid_version,
+      const ReadOptions& read_options,
       EpochNumberRequirement epoch_number_requirement =
           EpochNumberRequirement::kMustPresent);
   ~VersionEditHandlerPointInTime() override;
 
-  bool HasMissingFiles() const;
-
-  virtual Status VerifyFile(ColumnFamilyData* cfd, const std::string& fpath,
-                            int level, const FileMetaData& fmeta) override;
-  virtual Status VerifyBlobFile(ColumnFamilyData* cfd, uint64_t blob_file_num,
-                                const BlobFileAddition& blob_addition) override;
-
  protected:
   Status OnAtomicGroupReplayBegin() override;
   Status OnAtomicGroupReplayEnd() override;
   void CheckIterationResult(const log::Reader& reader, Status* s) override;
 
   ColumnFamilyData* DestroyCfAndCleanup(const VersionEdit& edit) override;
-  // `MaybeCreateVersionBeforeApplyEdit(..., false)` creates a version upon a
-  // negative edge trigger (transition from valid to invalid).
+  // `MaybeCreateVersion(..., false)` creates a version upon a negative edge
+  // trigger (transition from valid to invalid).
   //
-  // `MaybeCreateVersionBeforeApplyEdit(..., true)` creates a version on a
-  // positive level trigger (state is valid).
-  Status MaybeCreateVersionBeforeApplyEdit(const VersionEdit& edit,
-                                           ColumnFamilyData* cfd,
-                                           bool force_create_version) override;
+  // `MaybeCreateVersion(..., true)` creates a version on a positive level
+  // trigger (state is valid).
+  Status MaybeCreateVersion(const VersionEdit& edit, ColumnFamilyData* cfd,
+                            bool force_create_version) override;
+  virtual Status VerifyFile(ColumnFamilyData* cfd, const std::string& fpath,
+                            int level, const FileMetaData& fmeta);
+  virtual Status VerifyBlobFile(ColumnFamilyData* cfd, uint64_t blob_file_num,
+                                const BlobFileAddition& blob_addition);
 
   Status LoadTables(ColumnFamilyData* cfd,
                     bool prefetch_index_and_filter_in_cache,
@@ -295,6 +275,8 @@ class VersionEditHandlerPointInTime : public VersionEditHandler {
 
   bool in_atomic_group_ = false;
 
+  std::vector<std::string> intermediate_files_;
+
  private:
   bool AtomicUpdateVersionsCompleted();
   bool AtomicUpdateVersionsContains(uint32_t cfid);
@@ -320,13 +302,9 @@ class ManifestTailer : public VersionEditHandlerPointInTime {
                               EpochNumberRequirement::kMustPresent)
       : VersionEditHandlerPointInTime(/*read_only=*/false, column_families,
                                       version_set, io_tracer, read_options,
-                                      /*allow_incomplete_valid_version=*/false,
                                       epoch_number_requirement),
         mode_(Mode::kRecovery) {}
 
-  Status VerifyFile(ColumnFamilyData* cfd, const std::string& fpath, int level,
-                    const FileMetaData& fmeta) override;
-
   void PrepareToReadNewManifest() {
     initialized_ = false;
     ClearReadBuffer();
@@ -336,7 +314,9 @@ class ManifestTailer : public VersionEditHandlerPointInTime {
     return cfds_changed_;
   }
 
-  std::vector<std::string> GetAndClearIntermediateFiles();
+  std::vector<std::string>& GetIntermediateFiles() {
+    return intermediate_files_;
+  }
 
  protected:
   Status Initialize() override;
@@ -349,6 +329,9 @@ class ManifestTailer : public VersionEditHandlerPointInTime {
 
   void CheckIterationResult(const log::Reader& reader, Status* s) override;
 
+  Status VerifyFile(ColumnFamilyData* cfd, const std::string& fpath, int level,
+                    const FileMetaData& fmeta) override;
+
   enum Mode : uint8_t {
     kRecovery = 0,
     kCatchUp = 1,
@@ -369,9 +352,7 @@ class DumpManifestHandler : public VersionEditHandler {
             /*read_only=*/true, column_families, version_set,
             /*track_found_and_missing_files=*/false,
             /*no_error_if_files_missing=*/false, io_tracer, read_options,
-            /*skip_load_table_files=*/true,
-            /*allow_incomplete_valid_version=*/false,
-            /*epoch_number_requirement=*/EpochNumberRequirement::kMustPresent),
+            /*skip_load_table_files=*/true),
         verbose_(verbose),
         hex_(hex),
         json_(json),

db/version_set.cc

@@ -5511,10 +5511,6 @@ Status VersionSet::ProcessManifestWrites(
   std::unique_ptr<log::Writer> new_desc_log_ptr;
   {
     FileOptions opt_file_opts = fs_->OptimizeForManifestWrite(file_options_);
-    // DB option (in file_options_) takes precedence when not kUnknown
-    if (file_options_.temperature != Temperature::kUnknown) {
-      opt_file_opts.temperature = file_options_.temperature;
-    }
     mu->Unlock();
     TEST_SYNC_POINT("VersionSet::LogAndApply:WriteManifestStart");
     TEST_SYNC_POINT_CALLBACK("VersionSet::LogAndApply:WriteManifest", nullptr);
@@ -5641,9 +5637,9 @@ Status VersionSet::ProcessManifestWrites(
       assert(manifest_io_status.ok());
     }
     if (s.ok() && new_descriptor_log) {
-      io_s = SetCurrentFile(
-          write_options, fs_.get(), dbname_, pending_manifest_file_number_,
-          file_options_.temperature, dir_contains_current_file);
+      io_s = SetCurrentFile(write_options, fs_.get(), dbname_,
+                            pending_manifest_file_number_,
+                            dir_contains_current_file);
       if (!io_s.ok()) {
         s = io_s;
         // Quarantine old manifest file in case new manifest file's CURRENT file
@@ -5772,6 +5768,10 @@ Status VersionSet::ProcessManifestWrites(
     for (auto v : versions) {
       delete v;
     }
+    if (manifest_io_status.ok()) {
+      manifest_file_number_ = pending_manifest_file_number_;
+      manifest_file_size_ = new_manifest_file_size;
+    }
     // If manifest append failed for whatever reason, the file could be
     // corrupted. So we need to force the next version update to start a
     // new manifest file.
@@ -5803,7 +5803,7 @@ Status VersionSet::ProcessManifestWrites(
     // a) CURRENT points to the new MANIFEST, and the new MANIFEST is present.
     // b) CURRENT points to the original MANIFEST, and the original MANIFEST
     //    also exists.
-    if (!manifest_io_status.ok() && new_descriptor_log) {
+    if (new_descriptor_log && !manifest_io_status.ok()) {
       ROCKS_LOG_INFO(db_options_->info_log,
                      "Deleting manifest %" PRIu64 " current manifest %" PRIu64
                      "\n",
@@ -6084,8 +6084,7 @@ Status VersionSet::Recover(
     VersionEditHandler handler(
         read_only, column_families, const_cast<VersionSet*>(this),
         /*track_found_and_missing_files=*/false, no_error_if_files_missing,
-        io_tracer_, read_options, /*allow_incomplete_valid_version=*/false,
-        EpochNumberRequirement::kMightMissing);
+        io_tracer_, read_options, EpochNumberRequirement::kMightMissing);
     handler.Iterate(reader, &log_read_status);
     s = handler.status();
     if (s.ok()) {
@@ -6261,8 +6260,7 @@ Status VersionSet::TryRecoverFromOneManifest(
                      /*checksum=*/true, /*log_num=*/0);
   VersionEditHandlerPointInTime handler_pit(
       read_only, column_families, const_cast<VersionSet*>(this), io_tracer_,
-      read_options, /*allow_incomplete_valid_version=*/true,
-      EpochNumberRequirement::kMightMissing);
+      read_options, EpochNumberRequirement::kMightMissing);
 
   handler_pit.Iterate(reader, &s);
 
@@ -7483,7 +7481,7 @@ Status ReactiveVersionSet::ReadAndApply(
     *cfds_changed = std::move(manifest_tailer_->GetUpdatedColumnFamilies());
   }
   if (files_to_delete) {
-    *files_to_delete = manifest_tailer_->GetAndClearIntermediateFiles();
+    *files_to_delete = std::move(manifest_tailer_->GetIntermediateFiles());
   }
 
   return s;

db/version_set.h

@@ -1503,6 +1503,7 @@ class VersionSet {
   void GetLiveFilesMetaData(std::vector<LiveFileMetaData>* metadata);
 
   void AddObsoleteBlobFile(uint64_t blob_file_number, std::string path) {
+    // TODO: Erase file from BlobFileCache?
     obsolete_blob_files_.emplace_back(blob_file_number, std::move(path));
   }
 

db/version_set_test.cc

@@ -11,7 +11,6 @@
 
 #include <algorithm>
 
-#include "db/blob/blob_log_writer.h"
 #include "db/db_impl/db_impl.h"
 #include "db/db_test_util.h"
 #include "db/log_writer.h"
@@ -1346,27 +1345,18 @@ class VersionSetTestBase {
     std::string key;  // the only key
     int level = 0;
     uint64_t epoch_number;
-    bool file_missing = false;
-    uint64_t oldest_blob_file_number = kInvalidBlobFileNumber;
     SstInfo(uint64_t file_num, const std::string& cf_name,
             const std::string& _key,
-            uint64_t _epoch_number = kUnknownEpochNumber,
-            bool _file_missing = false,
-            uint64_t _oldest_blob_file_number = kInvalidBlobFileNumber)
-        : SstInfo(file_num, cf_name, _key, 0, _epoch_number, _file_missing,
-                  _oldest_blob_file_number) {}
+            uint64_t _epoch_number = kUnknownEpochNumber)
+        : SstInfo(file_num, cf_name, _key, 0, _epoch_number) {}
     SstInfo(uint64_t file_num, const std::string& cf_name,
             const std::string& _key, int lvl,
-            uint64_t _epoch_number = kUnknownEpochNumber,
-            bool _file_missing = false,
-            uint64_t _oldest_blob_file_number = kInvalidBlobFileNumber)
+            uint64_t _epoch_number = kUnknownEpochNumber)
         : file_number(file_num),
           column_family(cf_name),
           key(_key),
           level(lvl),
-          epoch_number(_epoch_number),
-          file_missing(_file_missing),
-          oldest_blob_file_number(_oldest_blob_file_number) {}
+          epoch_number(_epoch_number) {}
   };
 
   // Create dummy sst, return their metadata. Note that only file name and size
@@ -1405,32 +1395,22 @@ class VersionSetTestBase {
       ASSERT_NE(0, file_size);
       file_metas->emplace_back(
           file_num, /*file_path_id=*/0, file_size, ikey, ikey, 0, 0, false,
-          Temperature::kUnknown, info.oldest_blob_file_number, 0, 0,
-          info.epoch_number, kUnknownFileChecksum, kUnknownFileChecksumFuncName,
-          kNullUniqueId64x2, 0, 0,
-          /* user_defined_timestamps_persisted */ true);
-      if (info.file_missing) {
-        ASSERT_OK(fs_->DeleteFile(fname, IOOptions(), nullptr));
-      }
+          Temperature::kUnknown, 0, 0, 0, info.epoch_number,
+          kUnknownFileChecksum, kUnknownFileChecksumFuncName, kNullUniqueId64x2,
+          0, 0, /* user_defined_timestamps_persisted */ true);
     }
   }
 
-  void CreateCurrentFile() {
-    // Make "CURRENT" file point to the new manifest file.
-    ASSERT_OK(SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1,
-                             Temperature::kUnknown,
-                             /* dir_contains_current_file */ nullptr));
-  }
-
   // Create DB with 3 column families.
   void NewDB() {
     SequenceNumber last_seqno;
     std::unique_ptr<log::Writer> log_writer;
-    ASSERT_OK(
-        SetIdentityFile(WriteOptions(), env_, dbname_, Temperature::kUnknown));
+    ASSERT_OK(SetIdentityFile(WriteOptions(), env_, dbname_));
     PrepareManifest(&column_families_, &last_seqno, &log_writer);
     log_writer.reset();
-    CreateCurrentFile();
+    // Make "CURRENT" file point to the new manifest file.
+    Status s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1, nullptr);
+    ASSERT_OK(s);
 
     EXPECT_OK(versions_->Recover(column_families_, false));
     EXPECT_EQ(column_families_.size(),
@@ -2606,7 +2586,7 @@ class VersionSetAtomicGroupTest : public VersionSetTestBase,
       edits_[i].MarkAtomicGroup(--remaining);
       edits_[i].SetLastSequence(last_seqno_++);
     }
-    CreateCurrentFile();
+    ASSERT_OK(SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1, nullptr));
   }
 
   void SetupIncompleteTrailingAtomicGroup(int atomic_group_size) {
@@ -2618,7 +2598,7 @@ class VersionSetAtomicGroupTest : public VersionSetTestBase,
       edits_[i].MarkAtomicGroup(--remaining);
       edits_[i].SetLastSequence(last_seqno_++);
     }
-    CreateCurrentFile();
+    ASSERT_OK(SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1, nullptr));
   }
 
   void SetupCorruptedAtomicGroup(int atomic_group_size) {
@@ -2632,7 +2612,7 @@ class VersionSetAtomicGroupTest : public VersionSetTestBase,
       }
       edits_[i].SetLastSequence(last_seqno_++);
     }
-    CreateCurrentFile();
+    ASSERT_OK(SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1, nullptr));
   }
 
   void SetupIncorrectAtomicGroup(int atomic_group_size) {
@@ -2648,7 +2628,7 @@ class VersionSetAtomicGroupTest : public VersionSetTestBase,
       }
       edits_[i].SetLastSequence(last_seqno_++);
     }
-    CreateCurrentFile();
+    ASSERT_OK(SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1, nullptr));
   }
 
   void SetupTestSyncPoints() {
@@ -3414,7 +3394,8 @@ TEST_P(VersionSetTestDropOneCF, HandleDroppedColumnFamilyInAtomicGroup) {
   SequenceNumber last_seqno;
   std::unique_ptr<log::Writer> log_writer;
   PrepareManifest(&column_families, &last_seqno, &log_writer);
-  CreateCurrentFile();
+  Status s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1, nullptr);
+  ASSERT_OK(s);
 
   EXPECT_OK(versions_->Recover(column_families, false /* read_only */));
   EXPECT_EQ(column_families.size(),
@@ -3436,7 +3417,7 @@ TEST_P(VersionSetTestDropOneCF, HandleDroppedColumnFamilyInAtomicGroup) {
   cfd_to_drop->Ref();
   drop_cf_edit.SetColumnFamily(cfd_to_drop->GetID());
   mutex_.Lock();
-  Status s = versions_->LogAndApply(
+  s = versions_->LogAndApply(
       cfd_to_drop, *cfd_to_drop->GetLatestMutableCFOptions(), read_options,
       write_options, &drop_cf_edit, &mutex_, nullptr);
   mutex_.Unlock();
@@ -3546,7 +3527,9 @@ class EmptyDefaultCfNewManifest : public VersionSetTestBase,
 TEST_F(EmptyDefaultCfNewManifest, Recover) {
   PrepareManifest(nullptr, nullptr, &log_writer_);
   log_writer_.reset();
-  CreateCurrentFile();
+  Status s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1,
+                            /* dir_contains_current_file */ nullptr);
+  ASSERT_OK(s);
   std::string manifest_path;
   VerifyManifest(&manifest_path);
   std::vector<ColumnFamilyDescriptor> column_families;
@@ -3555,7 +3538,7 @@ TEST_F(EmptyDefaultCfNewManifest, Recover) {
                                cf_options_);
   std::string db_id;
   bool has_missing_table_file = false;
-  Status s = versions_->TryRecoverFromOneManifest(
+  s = versions_->TryRecoverFromOneManifest(
       manifest_path, column_families, false, &db_id, &has_missing_table_file);
   ASSERT_OK(s);
   ASSERT_FALSE(has_missing_table_file);
@@ -3576,8 +3559,7 @@ class VersionSetTestEmptyDb
     assert(nullptr != log_writer);
     VersionEdit new_db;
     if (db_options_.write_dbid_to_manifest) {
-      ASSERT_OK(SetIdentityFile(WriteOptions(), env_, dbname_,
-                                Temperature::kUnknown));
+      ASSERT_OK(SetIdentityFile(WriteOptions(), env_, dbname_));
       DBOptions tmp_db_options;
       tmp_db_options.env = env_;
       std::unique_ptr<DBImpl> impl(new DBImpl(tmp_db_options, dbname_));
@@ -3610,7 +3592,9 @@ TEST_P(VersionSetTestEmptyDb, OpenFromIncompleteManifest0) {
   db_options_.write_dbid_to_manifest = std::get<0>(GetParam());
   PrepareManifest(nullptr, nullptr, &log_writer_);
   log_writer_.reset();
-  CreateCurrentFile();
+  Status s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1,
+                            /* dir_contains_current_file */ nullptr);
+  ASSERT_OK(s);
 
   std::string manifest_path;
   VerifyManifest(&manifest_path);
@@ -3625,9 +3609,9 @@ TEST_P(VersionSetTestEmptyDb, OpenFromIncompleteManifest0) {
 
   std::string db_id;
   bool has_missing_table_file = false;
-  Status s = versions_->TryRecoverFromOneManifest(
-      manifest_path, column_families, read_only, &db_id,
-      &has_missing_table_file);
+  s = versions_->TryRecoverFromOneManifest(manifest_path, column_families,
+                                           read_only, &db_id,
+                                           &has_missing_table_file);
   auto iter =
       std::find(cf_names.begin(), cf_names.end(), kDefaultColumnFamilyName);
   if (iter == cf_names.end()) {
@@ -3653,7 +3637,9 @@ TEST_P(VersionSetTestEmptyDb, OpenFromIncompleteManifest1) {
     ASSERT_OK(s);
   }
   log_writer_.reset();
-  CreateCurrentFile();
+  s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1,
+                     /* dir_contains_current_file */ nullptr);
+  ASSERT_OK(s);
 
   std::string manifest_path;
   VerifyManifest(&manifest_path);
@@ -3699,7 +3685,9 @@ TEST_P(VersionSetTestEmptyDb, OpenFromInCompleteManifest2) {
     ASSERT_OK(s);
   }
   log_writer_.reset();
-  CreateCurrentFile();
+  s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1,
+                     /* dir_contains_current_file */ nullptr);
+  ASSERT_OK(s);
 
   std::string manifest_path;
   VerifyManifest(&manifest_path);
@@ -3756,7 +3744,9 @@ TEST_P(VersionSetTestEmptyDb, OpenManifestWithUnknownCF) {
     ASSERT_OK(s);
   }
   log_writer_.reset();
-  CreateCurrentFile();
+  s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1,
+                     /* dir_contains_current_file */ nullptr);
+  ASSERT_OK(s);
 
   std::string manifest_path;
   VerifyManifest(&manifest_path);
@@ -3812,7 +3802,9 @@ TEST_P(VersionSetTestEmptyDb, OpenCompleteManifest) {
     ASSERT_OK(s);
   }
   log_writer_.reset();
-  CreateCurrentFile();
+  s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1,
+                     /* dir_contains_current_file */ nullptr);
+  ASSERT_OK(s);
 
   std::string manifest_path;
   VerifyManifest(&manifest_path);
@@ -3877,9 +3869,8 @@ INSTANTIATE_TEST_CASE_P(
 class VersionSetTestMissingFiles : public VersionSetTestBase,
                                    public testing::Test {
  public:
-  explicit VersionSetTestMissingFiles(
-      const std::string& test_name = "version_set_test_missing_files")
-      : VersionSetTestBase(test_name),
+  VersionSetTestMissingFiles()
+      : VersionSetTestBase("version_set_test_missing_files"),
         internal_comparator_(
             std::make_shared<InternalKeyComparator>(options_.comparator)) {}
 
@@ -3956,8 +3947,7 @@ class VersionSetTestMissingFiles : public VersionSetTestBase,
   // This method updates last_sequence_.
   void WriteFileAdditionAndDeletionToManifest(
       uint32_t cf, const std::vector<std::pair<int, FileMetaData>>& added_files,
-      const std::vector<std::pair<int, uint64_t>>& deleted_files,
-      const std::vector<BlobFileAddition>& blob_files = {}) {
+      const std::vector<std::pair<int, uint64_t>>& deleted_files) {
     VersionEdit edit;
     edit.SetColumnFamily(cf);
     for (const auto& elem : added_files) {
@@ -3968,9 +3958,6 @@ class VersionSetTestMissingFiles : public VersionSetTestBase,
       int level = elem.first;
       edit.DeleteFile(level, elem.second);
     }
-    for (const auto& elem : blob_files) {
-      edit.AddBlobFile(elem);
-    }
     edit.SetLastSequence(last_seqno_);
     ++last_seqno_;
     assert(log_writer_.get() != nullptr);
@@ -4019,14 +4006,15 @@ TEST_F(VersionSetTestMissingFiles, ManifestFarBehindSst) {
   WriteFileAdditionAndDeletionToManifest(
       /*cf=*/0, std::vector<std::pair<int, FileMetaData>>(), deleted_files);
   log_writer_.reset();
-  CreateCurrentFile();
+  Status s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1, nullptr);
+  ASSERT_OK(s);
   std::string manifest_path;
   VerifyManifest(&manifest_path);
   std::string db_id;
   bool has_missing_table_file = false;
-  Status s = versions_->TryRecoverFromOneManifest(
-      manifest_path, column_families_,
-      /*read_only=*/false, &db_id, &has_missing_table_file);
+  s = versions_->TryRecoverFromOneManifest(manifest_path, column_families_,
+                                           /*read_only=*/false, &db_id,
+                                           &has_missing_table_file);
   ASSERT_OK(s);
   ASSERT_TRUE(has_missing_table_file);
   for (ColumnFamilyData* cfd : *(versions_->GetColumnFamilySet())) {
@@ -4076,14 +4064,15 @@ TEST_F(VersionSetTestMissingFiles, ManifestAheadofSst) {
   WriteFileAdditionAndDeletionToManifest(
       /*cf=*/0, added_files, std::vector<std::pair<int, uint64_t>>());
   log_writer_.reset();
-  CreateCurrentFile();
+  Status s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1, nullptr);
+  ASSERT_OK(s);
   std::string manifest_path;
   VerifyManifest(&manifest_path);
   std::string db_id;
   bool has_missing_table_file = false;
-  Status s = versions_->TryRecoverFromOneManifest(
-      manifest_path, column_families_,
-      /*read_only=*/false, &db_id, &has_missing_table_file);
+  s = versions_->TryRecoverFromOneManifest(manifest_path, column_families_,
+                                           /*read_only=*/false, &db_id,
+                                           &has_missing_table_file);
   ASSERT_OK(s);
   ASSERT_TRUE(has_missing_table_file);
   for (ColumnFamilyData* cfd : *(versions_->GetColumnFamilySet())) {
@@ -4129,14 +4118,15 @@ TEST_F(VersionSetTestMissingFiles, NoFileMissing) {
   WriteFileAdditionAndDeletionToManifest(
       /*cf=*/0, std::vector<std::pair<int, FileMetaData>>(), deleted_files);
   log_writer_.reset();
-  CreateCurrentFile();
+  Status s = SetCurrentFile(WriteOptions(), fs_.get(), dbname_, 1, nullptr);
+  ASSERT_OK(s);
   std::string manifest_path;
   VerifyManifest(&manifest_path);
   std::string db_id;
   bool has_missing_table_file = false;
-  Status s = versions_->TryRecoverFromOneManifest(
-      manifest_path, column_families_,
-      /*read_only=*/false, &db_id, &has_missing_table_file);
+  s = versions_->TryRecoverFromOneManifest(manifest_path, column_families_,
+                                           /*read_only=*/false, &db_id,
+                                           &has_missing_table_file);
   ASSERT_OK(s);
   ASSERT_FALSE(has_missing_table_file);
   for (ColumnFamilyData* cfd : *(versions_->GetColumnFamilySet())) {
@@ -4181,250 +4171,6 @@ TEST_F(VersionSetTestMissingFiles, MinLogNumberToKeep2PC) {
   }
 }
 
-class BestEffortsRecoverIncompleteVersionTest
-    : public VersionSetTestMissingFiles {
- public:
-  BestEffortsRecoverIncompleteVersionTest()
-      : VersionSetTestMissingFiles("best_efforts_recover_incomplete_version") {}
-
-  struct BlobInfo {
-    uint64_t file_number;
-    bool file_missing;
-    std::string key;
-    std::string blob;
-    BlobInfo(uint64_t _file_number, bool _file_missing, std::string _key,
-             std::string _blob)
-        : file_number(_file_number),
-          file_missing(_file_missing),
-          key(_key),
-          blob(_blob) {}
-  };
-
-  void CreateDummyBlobFiles(const std::vector<BlobInfo>& infos,
-                            std::vector<BlobFileAddition>* blob_metas) {
-    for (const auto& info : infos) {
-      if (!info.file_missing) {
-        WriteDummyBlobFile(info.file_number, info.key, info.blob);
-      }
-      blob_metas->emplace_back(
-          info.file_number, 1 /*total_blob_count*/,
-          info.key.size() + info.blob.size() /*total_blob_bytes*/,
-          "" /*checksum_method*/, "" /*check_sum_value*/);
-    }
-  }
-  // Creates a test blob file that is valid so it can pass the
-  // `VersionEditHandlerPointInTime::VerifyBlobFile` check.
-  void WriteDummyBlobFile(uint64_t blob_file_number, const Slice& key,
-                          const Slice& blob) {
-    ImmutableOptions options;
-    std::string blob_file_path = BlobFileName(dbname_, blob_file_number);
-
-    std::unique_ptr<FSWritableFile> file;
-    ASSERT_OK(
-        fs_->NewWritableFile(blob_file_path, FileOptions(), &file, nullptr));
-
-    std::unique_ptr<WritableFileWriter> file_writer(new WritableFileWriter(
-        std::move(file), blob_file_path, FileOptions(), options.clock));
-
-    BlobLogWriter blob_log_writer(std::move(file_writer), options.clock,
-                                  /*statistics*/ nullptr, blob_file_number,
-                                  /*use_fsync*/ true,
-                                  /*do_flush*/ false);
-
-    constexpr ExpirationRange expiration_range;
-    BlobLogHeader header(/*column_family_id*/ 0, kNoCompression,
-                         /*has_ttl*/ false, expiration_range);
-    ASSERT_OK(blob_log_writer.WriteHeader(WriteOptions(), header));
-    std::string compressed_blob;
-    uint64_t key_offset = 0;
-    uint64_t blob_offset = 0;
-    ASSERT_OK(blob_log_writer.AddRecord(WriteOptions(), key, blob, &key_offset,
-                                        &blob_offset));
-    BlobLogFooter footer;
-    footer.blob_count = 1;
-    footer.expiration_range = expiration_range;
-    std::string checksum_method;
-    std::string checksum_value;
-    ASSERT_OK(blob_log_writer.AppendFooter(WriteOptions(), footer,
-                                           &checksum_method, &checksum_value));
-  }
-
-  void RecoverFromManifestWithMissingFiles(
-      const std::vector<std::pair<int, FileMetaData>>& added_files,
-      const std::vector<BlobFileAddition>& blob_files) {
-    PrepareManifest(&column_families_, &last_seqno_, &log_writer_);
-    WriteFileAdditionAndDeletionToManifest(
-        /*cf=*/0, added_files, std::vector<std::pair<int, uint64_t>>(),
-        blob_files);
-    log_writer_.reset();
-    CreateCurrentFile();
-    std::string manifest_path;
-    VerifyManifest(&manifest_path);
-    std::string db_id;
-    bool has_missing_table_file = false;
-    Status s = versions_->TryRecoverFromOneManifest(
-        manifest_path, column_families_,
-        /*read_only=*/false, &db_id, &has_missing_table_file);
-    ASSERT_OK(s);
-    ASSERT_TRUE(has_missing_table_file);
-  }
-};
-
-TEST_F(BestEffortsRecoverIncompleteVersionTest, NonL0MissingFiles) {
-  std::vector<SstInfo> sst_files = {
-      SstInfo(100, kDefaultColumnFamilyName, "a", 1 /* level */,
-              100 /* epoch_number */, true /* file_missing */),
-      SstInfo(101, kDefaultColumnFamilyName, "a", 0 /* level */,
-              101 /* epoch_number */, false /* file_missing */),
-      SstInfo(102, kDefaultColumnFamilyName, "a", 0 /* level */,
-              102 /* epoch_number */, false /* file_missing */),
-  };
-  std::vector<FileMetaData> file_metas;
-  CreateDummyTableFiles(sst_files, &file_metas);
-
-  std::vector<std::pair<int, FileMetaData>> added_files;
-  for (size_t i = 0; i < sst_files.size(); i++) {
-    const auto& info = sst_files[i];
-    const auto& meta = file_metas[i];
-    added_files.emplace_back(info.level, meta);
-  }
-  RecoverFromManifestWithMissingFiles(added_files,
-                                      std::vector<BlobFileAddition>());
-  std::vector<uint64_t> all_table_files;
-  std::vector<uint64_t> all_blob_files;
-  versions_->AddLiveFiles(&all_table_files, &all_blob_files);
-  ASSERT_TRUE(all_table_files.empty());
-}
-
-TEST_F(BestEffortsRecoverIncompleteVersionTest, MissingNonSuffixL0Files) {
-  std::vector<SstInfo> sst_files = {
-      SstInfo(100, kDefaultColumnFamilyName, "a", 1 /* level */,
-              100 /* epoch_number */, false /* file_missing */),
-      SstInfo(101, kDefaultColumnFamilyName, "a", 0 /* level */,
-              101 /* epoch_number */, true /* file_missing */),
-      SstInfo(102, kDefaultColumnFamilyName, "a", 0 /* level */,
-              102 /* epoch_number */, false /* file_missing */),
-  };
-  std::vector<FileMetaData> file_metas;
-  CreateDummyTableFiles(sst_files, &file_metas);
-
-  std::vector<std::pair<int, FileMetaData>> added_files;
-  for (size_t i = 0; i < sst_files.size(); i++) {
-    const auto& info = sst_files[i];
-    const auto& meta = file_metas[i];
-    added_files.emplace_back(info.level, meta);
-  }
-  RecoverFromManifestWithMissingFiles(added_files,
-                                      std::vector<BlobFileAddition>());
-  std::vector<uint64_t> all_table_files;
-  std::vector<uint64_t> all_blob_files;
-  versions_->AddLiveFiles(&all_table_files, &all_blob_files);
-  ASSERT_TRUE(all_table_files.empty());
-}
-
-TEST_F(BestEffortsRecoverIncompleteVersionTest, MissingBlobFiles) {
-  std::vector<SstInfo> sst_files = {
-      SstInfo(100, kDefaultColumnFamilyName, "a", 0 /* level */,
-              100 /* epoch_number */, false /* file_missing */,
-              102 /*oldest_blob_file_number*/),
-      SstInfo(101, kDefaultColumnFamilyName, "a", 0 /* level */,
-              101 /* epoch_number */, false /* file_missing */,
-              103 /*oldest_blob_file_number*/),
-  };
-  std::vector<FileMetaData> file_metas;
-  CreateDummyTableFiles(sst_files, &file_metas);
-
-  std::vector<BlobInfo> blob_files = {
-      BlobInfo(102, true /*file_missing*/, "a", "blob1"),
-      BlobInfo(103, true /*file_missing*/, "a", "blob2"),
-  };
-  std::vector<BlobFileAddition> blob_meta;
-  CreateDummyBlobFiles(blob_files, &blob_meta);
-
-  std::vector<std::pair<int, FileMetaData>> added_files;
-  for (size_t i = 0; i < sst_files.size(); i++) {
-    const auto& info = sst_files[i];
-    const auto& meta = file_metas[i];
-    added_files.emplace_back(info.level, meta);
-  }
-  RecoverFromManifestWithMissingFiles(added_files, blob_meta);
-  std::vector<uint64_t> all_table_files;
-  std::vector<uint64_t> all_blob_files;
-  versions_->AddLiveFiles(&all_table_files, &all_blob_files);
-  ASSERT_TRUE(all_table_files.empty());
-}
-
-TEST_F(BestEffortsRecoverIncompleteVersionTest, MissingL0SuffixOnly) {
-  std::vector<SstInfo> sst_files = {
-      SstInfo(100, kDefaultColumnFamilyName, "a", 1 /* level */,
-              100 /* epoch_number */, false /* file_missing */),
-      SstInfo(101, kDefaultColumnFamilyName, "a", 0 /* level */,
-              101 /* epoch_number */, false /* file_missing */),
-      SstInfo(102, kDefaultColumnFamilyName, "a", 0 /* level */,
-              102 /* epoch_number */, true /* file_missing */),
-  };
-  std::vector<FileMetaData> file_metas;
-  CreateDummyTableFiles(sst_files, &file_metas);
-
-  std::vector<std::pair<int, FileMetaData>> added_files;
-  for (size_t i = 0; i < sst_files.size(); i++) {
-    const auto& info = sst_files[i];
-    const auto& meta = file_metas[i];
-    added_files.emplace_back(info.level, meta);
-  }
-  RecoverFromManifestWithMissingFiles(added_files,
-                                      std::vector<BlobFileAddition>());
-  std::vector<uint64_t> all_table_files;
-  std::vector<uint64_t> all_blob_files;
-  versions_->AddLiveFiles(&all_table_files, &all_blob_files);
-  ASSERT_EQ(2, all_table_files.size());
-  ColumnFamilyData* cfd = versions_->GetColumnFamilySet()->GetDefault();
-  VersionStorageInfo* vstorage = cfd->current()->storage_info();
-  ASSERT_EQ(1, vstorage->LevelFiles(0).size());
-  ASSERT_EQ(1, vstorage->LevelFiles(1).size());
-}
-
-TEST_F(BestEffortsRecoverIncompleteVersionTest,
-       MissingL0SuffixAndTheirBlobFiles) {
-  std::vector<SstInfo> sst_files = {
-      SstInfo(100, kDefaultColumnFamilyName, "a", 1 /* level */,
-              100 /* epoch_number */, false /* file_missing */),
-      SstInfo(101, kDefaultColumnFamilyName, "a", 0 /* level */,
-              101 /* epoch_number */, false /* file_missing */,
-              103 /*oldest_blob_file_number*/),
-      SstInfo(102, kDefaultColumnFamilyName, "a", 0 /* level */,
-              102 /* epoch_number */, true /* file_missing */,
-              104 /*oldest_blob_file_number*/),
-  };
-  std::vector<FileMetaData> file_metas;
-  CreateDummyTableFiles(sst_files, &file_metas);
-
-  std::vector<BlobInfo> blob_files = {
-      BlobInfo(103, false /*file_missing*/, "a", "blob1"),
-      BlobInfo(104, true /*file_missing*/, "a", "blob2"),
-  };
-  std::vector<BlobFileAddition> blob_meta;
-  CreateDummyBlobFiles(blob_files, &blob_meta);
-
-  std::vector<std::pair<int, FileMetaData>> added_files;
-  for (size_t i = 0; i < sst_files.size(); i++) {
-    const auto& info = sst_files[i];
-    const auto& meta = file_metas[i];
-    added_files.emplace_back(info.level, meta);
-  }
-  RecoverFromManifestWithMissingFiles(added_files, blob_meta);
-  std::vector<uint64_t> all_table_files;
-  std::vector<uint64_t> all_blob_files;
-  versions_->AddLiveFiles(&all_table_files, &all_blob_files);
-  ASSERT_EQ(2, all_table_files.size());
-  ASSERT_EQ(1, all_blob_files.size());
-  ColumnFamilyData* cfd = versions_->GetColumnFamilySet()->GetDefault();
-  VersionStorageInfo* vstorage = cfd->current()->storage_info();
-  ASSERT_EQ(1, vstorage->LevelFiles(0).size());
-  ASSERT_EQ(1, vstorage->LevelFiles(1).size());
-  ASSERT_EQ(1, vstorage->GetBlobFiles().size());
-}
-
 class ChargeFileMetadataTest : public DBTestBase {
  public:
   ChargeFileMetadataTest()

db/write_batch.cc

@@ -929,19 +929,15 @@ Status WriteBatch::Put(ColumnFamilyHandle* column_family, const Slice& key,
   }
 
   if (0 == ts_sz) {
-    s = WriteBatchInternal::Put(this, cf_id, key, value);
-  } else {
-    needs_in_place_update_ts_ = true;
-    has_key_with_ts_ = true;
-    std::string dummy_ts(ts_sz, '\0');
-    std::array<Slice, 2> key_with_ts{{key, dummy_ts}};
-    s = WriteBatchInternal::Put(this, cf_id, SliceParts(key_with_ts.data(), 2),
-                                SliceParts(&value, 1));
+    return WriteBatchInternal::Put(this, cf_id, key, value);
   }
-  if (s.ok()) {
-    MaybeTrackTimestampSize(cf_id, ts_sz);
-  }
-  return s;
+
+  needs_in_place_update_ts_ = true;
+  has_key_with_ts_ = true;
+  std::string dummy_ts(ts_sz, '\0');
+  std::array<Slice, 2> key_with_ts{{key, dummy_ts}};
+  return WriteBatchInternal::Put(this, cf_id, SliceParts(key_with_ts.data(), 2),
+                                 SliceParts(&value, 1));
 }
 
 Status WriteBatch::TimedPut(ColumnFamilyHandle* column_family, const Slice& key,
@@ -966,7 +962,7 @@ Status WriteBatch::TimedPut(ColumnFamilyHandle* column_family, const Slice& key,
 
 Status WriteBatch::Put(ColumnFamilyHandle* column_family, const Slice& key,
                        const Slice& ts, const Slice& value) {
-  Status s = CheckColumnFamilyTimestampSize(column_family, ts);
+  const Status s = CheckColumnFamilyTimestampSize(column_family, ts);
   if (!s.ok()) {
     return s;
   }
@@ -974,12 +970,8 @@ Status WriteBatch::Put(ColumnFamilyHandle* column_family, const Slice& key,
   assert(column_family);
   uint32_t cf_id = column_family->GetID();
   std::array<Slice, 2> key_with_ts{{key, ts}};
-  s = WriteBatchInternal::Put(this, cf_id, SliceParts(key_with_ts.data(), 2),
-                              SliceParts(&value, 1));
-  if (s.ok()) {
-    MaybeTrackTimestampSize(cf_id, ts.size());
-  }
-  return s;
+  return WriteBatchInternal::Put(this, cf_id, SliceParts(key_with_ts.data(), 2),
+                                 SliceParts(&value, 1));
 }
 
 Status WriteBatchInternal::CheckSlicePartsLength(const SliceParts& key,
@@ -1047,11 +1039,7 @@ Status WriteBatch::Put(ColumnFamilyHandle* column_family, const SliceParts& key,
   }
 
   if (ts_sz == 0) {
-    s = WriteBatchInternal::Put(this, cf_id, key, value);
-    if (s.ok()) {
-      MaybeTrackTimestampSize(cf_id, ts_sz);
-    }
-    return s;
+    return WriteBatchInternal::Put(this, cf_id, key, value);
   }
 
   return Status::InvalidArgument(
@@ -1258,24 +1246,20 @@ Status WriteBatch::Delete(ColumnFamilyHandle* column_family, const Slice& key) {
   }
 
   if (0 == ts_sz) {
-    s = WriteBatchInternal::Delete(this, cf_id, key);
-  } else {
-    needs_in_place_update_ts_ = true;
-    has_key_with_ts_ = true;
-    std::string dummy_ts(ts_sz, '\0');
-    std::array<Slice, 2> key_with_ts{{key, dummy_ts}};
-    s = WriteBatchInternal::Delete(this, cf_id,
-                                   SliceParts(key_with_ts.data(), 2));
+    return WriteBatchInternal::Delete(this, cf_id, key);
   }
-  if (s.ok()) {
-    MaybeTrackTimestampSize(cf_id, ts_sz);
-  }
-  return s;
+
+  needs_in_place_update_ts_ = true;
+  has_key_with_ts_ = true;
+  std::string dummy_ts(ts_sz, '\0');
+  std::array<Slice, 2> key_with_ts{{key, dummy_ts}};
+  return WriteBatchInternal::Delete(this, cf_id,
+                                    SliceParts(key_with_ts.data(), 2));
 }
 
 Status WriteBatch::Delete(ColumnFamilyHandle* column_family, const Slice& key,
                           const Slice& ts) {
-  Status s = CheckColumnFamilyTimestampSize(column_family, ts);
+  const Status s = CheckColumnFamilyTimestampSize(column_family, ts);
   if (!s.ok()) {
     return s;
   }
@@ -1283,12 +1267,8 @@ Status WriteBatch::Delete(ColumnFamilyHandle* column_family, const Slice& key,
   has_key_with_ts_ = true;
   uint32_t cf_id = column_family->GetID();
   std::array<Slice, 2> key_with_ts{{key, ts}};
-  s = WriteBatchInternal::Delete(this, cf_id,
-                                 SliceParts(key_with_ts.data(), 2));
-  if (s.ok()) {
-    MaybeTrackTimestampSize(cf_id, ts.size());
-  }
-  return s;
+  return WriteBatchInternal::Delete(this, cf_id,
+                                    SliceParts(key_with_ts.data(), 2));
 }
 
 Status WriteBatchInternal::Delete(WriteBatch* b, uint32_t column_family_id,
@@ -1333,11 +1313,7 @@ Status WriteBatch::Delete(ColumnFamilyHandle* column_family,
   }
 
   if (0 == ts_sz) {
-    s = WriteBatchInternal::Delete(this, cf_id, key);
-    if (s.ok()) {
-      MaybeTrackTimestampSize(cf_id, ts_sz);
-    }
-    return s;
+    return WriteBatchInternal::Delete(this, cf_id, key);
   }
 
   return Status::InvalidArgument(
@@ -1385,24 +1361,20 @@ Status WriteBatch::SingleDelete(ColumnFamilyHandle* column_family,
   }
 
   if (0 == ts_sz) {
-    s = WriteBatchInternal::SingleDelete(this, cf_id, key);
-  } else {
-    needs_in_place_update_ts_ = true;
-    has_key_with_ts_ = true;
-    std::string dummy_ts(ts_sz, '\0');
-    std::array<Slice, 2> key_with_ts{{key, dummy_ts}};
-    s = WriteBatchInternal::SingleDelete(this, cf_id,
-                                         SliceParts(key_with_ts.data(), 2));
+    return WriteBatchInternal::SingleDelete(this, cf_id, key);
   }
-  if (s.ok()) {
-    MaybeTrackTimestampSize(cf_id, ts_sz);
-  }
-  return s;
+
+  needs_in_place_update_ts_ = true;
+  has_key_with_ts_ = true;
+  std::string dummy_ts(ts_sz, '\0');
+  std::array<Slice, 2> key_with_ts{{key, dummy_ts}};
+  return WriteBatchInternal::SingleDelete(this, cf_id,
+                                          SliceParts(key_with_ts.data(), 2));
 }
 
 Status WriteBatch::SingleDelete(ColumnFamilyHandle* column_family,
                                 const Slice& key, const Slice& ts) {
-  Status s = CheckColumnFamilyTimestampSize(column_family, ts);
+  const Status s = CheckColumnFamilyTimestampSize(column_family, ts);
   if (!s.ok()) {
     return s;
   }
@@ -1410,12 +1382,8 @@ Status WriteBatch::SingleDelete(ColumnFamilyHandle* column_family,
   assert(column_family);
   uint32_t cf_id = column_family->GetID();
   std::array<Slice, 2> key_with_ts{{key, ts}};
-  s = WriteBatchInternal::SingleDelete(this, cf_id,
-                                       SliceParts(key_with_ts.data(), 2));
-  if (s.ok()) {
-    MaybeTrackTimestampSize(cf_id, ts.size());
-  }
-  return s;
+  return WriteBatchInternal::SingleDelete(this, cf_id,
+                                          SliceParts(key_with_ts.data(), 2));
 }
 
 Status WriteBatchInternal::SingleDelete(WriteBatch* b,
@@ -1462,11 +1430,7 @@ Status WriteBatch::SingleDelete(ColumnFamilyHandle* column_family,
   }
 
   if (0 == ts_sz) {
-    s = WriteBatchInternal::SingleDelete(this, cf_id, key);
-    if (s.ok()) {
-      MaybeTrackTimestampSize(cf_id, ts_sz);
-    }
-    return s;
+    return WriteBatchInternal::SingleDelete(this, cf_id, key);
   }
 
   return Status::InvalidArgument(
@@ -1516,27 +1480,23 @@ Status WriteBatch::DeleteRange(ColumnFamilyHandle* column_family,
   }
 
   if (0 == ts_sz) {
-    s = WriteBatchInternal::DeleteRange(this, cf_id, begin_key, end_key);
-  } else {
-    needs_in_place_update_ts_ = true;
-    has_key_with_ts_ = true;
-    std::string dummy_ts(ts_sz, '\0');
-    std::array<Slice, 2> begin_key_with_ts{{begin_key, dummy_ts}};
-    std::array<Slice, 2> end_key_with_ts{{end_key, dummy_ts}};
-    s = WriteBatchInternal::DeleteRange(this, cf_id,
-                                        SliceParts(begin_key_with_ts.data(), 2),
-                                        SliceParts(end_key_with_ts.data(), 2));
+    return WriteBatchInternal::DeleteRange(this, cf_id, begin_key, end_key);
   }
-  if (s.ok()) {
-    MaybeTrackTimestampSize(cf_id, ts_sz);
-  }
-  return s;
+
+  needs_in_place_update_ts_ = true;
+  has_key_with_ts_ = true;
+  std::string dummy_ts(ts_sz, '\0');
+  std::array<Slice, 2> begin_key_with_ts{{begin_key, dummy_ts}};
+  std::array<Slice, 2> end_key_with_ts{{end_key, dummy_ts}};
+  return WriteBatchInternal::DeleteRange(
+      this, cf_id, SliceParts(begin_key_with_ts.data(), 2),
+      SliceParts(end_key_with_ts.data(), 2));
 }
 
 Status WriteBatch::DeleteRange(ColumnFamilyHandle* column_family,
                                const Slice& begin_key, const Slice& end_key,
                                const Slice& ts) {
-  Status s = CheckColumnFamilyTimestampSize(column_family, ts);
+  const Status s = CheckColumnFamilyTimestampSize(column_family, ts);
   if (!s.ok()) {
     return s;
   }
@@ -1545,13 +1505,9 @@ Status WriteBatch::DeleteRange(ColumnFamilyHandle* column_family,
   uint32_t cf_id = column_family->GetID();
   std::array<Slice, 2> key_with_ts{{begin_key, ts}};
   std::array<Slice, 2> end_key_with_ts{{end_key, ts}};
-  s = WriteBatchInternal::DeleteRange(this, cf_id,
-                                      SliceParts(key_with_ts.data(), 2),
-                                      SliceParts(end_key_with_ts.data(), 2));
-  if (s.ok()) {
-    MaybeTrackTimestampSize(cf_id, ts.size());
-  }
-  return s;
+  return WriteBatchInternal::DeleteRange(this, cf_id,
+                                         SliceParts(key_with_ts.data(), 2),
+                                         SliceParts(end_key_with_ts.data(), 2));
 }
 
 Status WriteBatchInternal::DeleteRange(WriteBatch* b, uint32_t column_family_id,
@@ -1598,11 +1554,7 @@ Status WriteBatch::DeleteRange(ColumnFamilyHandle* column_family,
   }
 
   if (0 == ts_sz) {
-    s = WriteBatchInternal::DeleteRange(this, cf_id, begin_key, end_key);
-    if (s.ok()) {
-      MaybeTrackTimestampSize(cf_id, ts_sz);
-    }
-    return s;
+    return WriteBatchInternal::DeleteRange(this, cf_id, begin_key, end_key);
   }
 
   return Status::InvalidArgument(
@@ -1656,25 +1608,21 @@ Status WriteBatch::Merge(ColumnFamilyHandle* column_family, const Slice& key,
   }
 
   if (0 == ts_sz) {
-    s = WriteBatchInternal::Merge(this, cf_id, key, value);
-  } else {
-    needs_in_place_update_ts_ = true;
-    has_key_with_ts_ = true;
-    std::string dummy_ts(ts_sz, '\0');
-    std::array<Slice, 2> key_with_ts{{key, dummy_ts}};
+    return WriteBatchInternal::Merge(this, cf_id, key, value);
+  }
 
-    s = WriteBatchInternal::Merge(
-        this, cf_id, SliceParts(key_with_ts.data(), 2), SliceParts(&value, 1));
-  }
-  if (s.ok()) {
-    MaybeTrackTimestampSize(cf_id, ts_sz);
-  }
-  return s;
+  needs_in_place_update_ts_ = true;
+  has_key_with_ts_ = true;
+  std::string dummy_ts(ts_sz, '\0');
+  std::array<Slice, 2> key_with_ts{{key, dummy_ts}};
+
+  return WriteBatchInternal::Merge(
+      this, cf_id, SliceParts(key_with_ts.data(), 2), SliceParts(&value, 1));
 }
 
 Status WriteBatch::Merge(ColumnFamilyHandle* column_family, const Slice& key,
                          const Slice& ts, const Slice& value) {
-  Status s = CheckColumnFamilyTimestampSize(column_family, ts);
+  const Status s = CheckColumnFamilyTimestampSize(column_family, ts);
   if (!s.ok()) {
     return s;
   }
@@ -1682,12 +1630,8 @@ Status WriteBatch::Merge(ColumnFamilyHandle* column_family, const Slice& key,
   assert(column_family);
   uint32_t cf_id = column_family->GetID();
   std::array<Slice, 2> key_with_ts{{key, ts}};
-  s = WriteBatchInternal::Merge(this, cf_id, SliceParts(key_with_ts.data(), 2),
-                                SliceParts(&value, 1));
-  if (s.ok()) {
-    MaybeTrackTimestampSize(cf_id, ts.size());
-  }
-  return s;
+  return WriteBatchInternal::Merge(
+      this, cf_id, SliceParts(key_with_ts.data(), 2), SliceParts(&value, 1));
 }
 
 Status WriteBatchInternal::Merge(WriteBatch* b, uint32_t column_family_id,
@@ -1736,11 +1680,7 @@ Status WriteBatch::Merge(ColumnFamilyHandle* column_family,
   }
 
   if (0 == ts_sz) {
-    s = WriteBatchInternal::Merge(this, cf_id, key, value);
-    if (s.ok()) {
-      MaybeTrackTimestampSize(cf_id, ts_sz);
-    }
-    return s;
+    return WriteBatchInternal::Merge(this, cf_id, key, value);
   }
 
   return Status::InvalidArgument(

db_stress_tool/db_stress_common.h

@@ -125,6 +125,7 @@ DECLARE_int32(level0_stop_writes_trigger);
 DECLARE_int32(block_size);
 DECLARE_int32(format_version);
 DECLARE_int32(index_block_restart_interval);
+DECLARE_bool(disable_auto_compactions);
 DECLARE_int32(max_background_compactions);
 DECLARE_int32(num_bottom_pri_threads);
 DECLARE_int32(compaction_thread_pool_adjust_interval);
@@ -150,7 +151,6 @@ DECLARE_bool(charge_filter_construction);
 DECLARE_bool(charge_table_reader);
 DECLARE_bool(charge_file_metadata);
 DECLARE_bool(charge_blob_cache);
-DECLARE_bool(decouple_partitioned_filters);
 DECLARE_int32(top_level_index_pinning);
 DECLARE_int32(partition_pinning);
 DECLARE_int32(unpartitioned_pinning);
@@ -197,6 +197,7 @@ DECLARE_int64(target_file_size_base);
 DECLARE_int32(target_file_size_multiplier);
 DECLARE_uint64(max_bytes_for_level_base);
 DECLARE_double(max_bytes_for_level_multiplier);
+DECLARE_int32(range_deletion_width);
 DECLARE_uint64(rate_limiter_bytes_per_sec);
 DECLARE_bool(rate_limit_bg_reads);
 DECLARE_bool(rate_limit_user_ops);
@@ -274,7 +275,6 @@ DECLARE_bool(verification_only);
 DECLARE_string(last_level_temperature);
 DECLARE_string(default_write_temperature);
 DECLARE_string(default_temperature);
-DECLARE_bool(paranoid_memory_checks);
 
 // Options for transaction dbs.
 // Use TransactionDB (a.k.a. Pessimistic Transaction DB)
@@ -319,6 +319,7 @@ DECLARE_int32(prepopulate_blob_cache);
 DECLARE_int32(approximate_size_one_in);
 DECLARE_bool(best_efforts_recovery);
 DECLARE_bool(skip_verifydb);
+DECLARE_bool(enable_compaction_filter);
 DECLARE_bool(paranoid_file_checks);
 DECLARE_bool(fail_if_options_file_error);
 DECLARE_uint64(batch_protection_bytes_per_key);

db_stress_tool/db_stress_compaction_filter.h

@@ -49,7 +49,7 @@ class DbStressCompactionFilter : public CompactionFilter {
       return Decision::kKeep;
     }
     // Reaching here means we acquired the lock.
-    key_mutex->AssertHeld();
+
     bool key_exists = state_->Exists(cf_id_, key_num);
     const bool allow_overwrite = state_->AllowsOverwrite(key_num);
 

db_stress_tool/db_stress_driver.cc

@@ -167,10 +167,7 @@ bool RunStressTestImpl(SharedState* shared) {
               {FileType::kWalFile});
         }
       }
-      if (ShouldDisableAutoCompactionsBeforeVerifyDb()) {
-        Status s = stress->EnableAutoCompaction();
-        assert(s.ok());
-      }
+      now = clock->NowMicros();
       fprintf(stdout, "%s Starting database operations\n",
               clock->TimeToString(now / 1000000).c_str());
 

db_stress_tool/db_stress_gflags.cc

@@ -380,11 +380,6 @@ DEFINE_bool(charge_blob_cache, false,
             "CacheEntryRoleOptions::charged of "
             "kBlobCache");
 
-DEFINE_bool(
-    decouple_partitioned_filters,
-    ROCKSDB_NAMESPACE::BlockBasedTableOptions().decouple_partitioned_filters,
-    "Decouple filter partitioning from index partitioning.");
-
 DEFINE_int32(
     top_level_index_pinning,
     static_cast<int32_t>(ROCKSDB_NAMESPACE::PinningTier::kFallback),
@@ -1448,8 +1443,4 @@ DEFINE_uint32(uncache_aggressiveness,
               "obsolete. 0 = disabled, 1 = minimum, 100 = moderate, 10000 = "
               "normal max");
 
-DEFINE_bool(paranoid_memory_checks,
-            ROCKSDB_NAMESPACE::Options().paranoid_memory_checks,
-            "Sets CF option paranoid_memory_checks.");
-
 #endif  // GFLAGS

db_stress_tool/db_stress_listener.h

@@ -72,7 +72,14 @@ class DbStressListener : public EventListener {
     // pretending doing some work here
     RandomSleep();
     if (fault_fs_guard) {
-      fault_fs_guard->DisableAllThreadLocalErrorInjection();
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kWrite);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataWrite);
     }
   }
 
@@ -173,7 +180,14 @@ class DbStressListener : public EventListener {
 
   void OnSubcompactionCompleted(const SubcompactionJobInfo& /* si */) override {
     if (fault_fs_guard) {
-      fault_fs_guard->DisableAllThreadLocalErrorInjection();
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kWrite);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataWrite);
     }
   }
 
@@ -260,7 +274,14 @@ class DbStressListener : public EventListener {
                             bool* /* auto_recovery */) override {
     RandomSleep();
     if (FLAGS_error_recovery_with_no_fault_injection && fault_fs_guard) {
-      fault_fs_guard->DisableAllThreadLocalErrorInjection();
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kWrite);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataWrite);
       // TODO(hx235): only exempt the flush thread during error recovery instead
       // of all the flush threads from error injection
       fault_fs_guard->SetIOActivtiesExcludedFromFaultInjection(
@@ -272,7 +293,14 @@ class DbStressListener : public EventListener {
       const BackgroundErrorRecoveryInfo& /*info*/) override {
     RandomSleep();
     if (FLAGS_error_recovery_with_no_fault_injection && fault_fs_guard) {
-      fault_fs_guard->EnableAllThreadLocalErrorInjection();
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kRead);
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kWrite);
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataRead);
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataWrite);
       fault_fs_guard->SetIOActivtiesExcludedFromFaultInjection({});
     }
   }

db_stress_tool/db_stress_shared_state.h

@@ -31,7 +31,6 @@ DECLARE_int32(compaction_thread_pool_adjust_interval);
 DECLARE_int32(continuous_verification_interval);
 DECLARE_bool(error_recovery_with_no_fault_injection);
 DECLARE_bool(sync_fault_injection);
-DECLARE_int32(range_deletion_width);
 DECLARE_bool(disable_wal);
 DECLARE_int32(manual_wal_flush_one_in);
 DECLARE_int32(metadata_read_fault_one_in);
@@ -45,8 +44,6 @@ DECLARE_int32(open_write_fault_one_in);
 DECLARE_int32(open_read_fault_one_in);
 
 DECLARE_int32(inject_error_severity);
-DECLARE_bool(disable_auto_compactions);
-DECLARE_bool(enable_compaction_filter);
 
 namespace ROCKSDB_NAMESPACE {
 class StressTest;
@@ -150,8 +147,7 @@ class SharedState {
 
   ~SharedState() {
 #ifndef NDEBUG
-    if (FLAGS_read_fault_one_in || FLAGS_write_fault_one_in ||
-        FLAGS_metadata_write_fault_one_in) {
+    if (FLAGS_read_fault_one_in) {
       SyncPoint::GetInstance()->ClearAllCallBacks();
       SyncPoint::GetInstance()->DisableProcessing();
     }
@@ -264,8 +260,8 @@ class SharedState {
   // This is useful for crash-recovery testing when the process may crash
   // before updating the corresponding expected value
   //
-  // Requires external locking covering `key` in `cf` to prevent
-  // concurrent write or delete to the same `key`.
+  // Requires external locking covering `key` in `cf` to prevent concurrent
+  // write or delete to the same `key`.
   PendingExpectedValue PreparePut(int cf, int64_t key) {
     return expected_state_manager_->PreparePut(cf, key);
   }

db_stress_tool/db_stress_test_base.cc

@@ -632,6 +632,7 @@ void StressTest::PreloadDbAndReopenAsReadOnly(int64_t number_of_keys,
   for (auto cfh : column_families_) {
     for (int64_t k = 0; k != number_of_keys; ++k) {
       const std::string key = Key(k);
+
       PendingExpectedValue pending_expected_value =
           shared->PreparePut(cf_idx, k);
       const uint32_t value_base = pending_expected_value.GetFinalValueBase();
@@ -1010,12 +1011,26 @@ void StressTest::OperateDb(ThreadState* thread) {
           thread->rand.OneIn(FLAGS_verify_db_one_in)) {
         //  Temporarily disable error injection for verification
         if (fault_fs_guard) {
-          fault_fs_guard->DisableAllThreadLocalErrorInjection();
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kRead);
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kWrite);
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kMetadataRead);
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kMetadataWrite);
         }
         ContinuouslyVerifyDb(thread);
         //  Enable back error injection disabled for verification
         if (fault_fs_guard) {
-          fault_fs_guard->EnableAllThreadLocalErrorInjection();
+          fault_fs_guard->EnableThreadLocalErrorInjection(
+              FaultInjectionIOType::kRead);
+          fault_fs_guard->EnableThreadLocalErrorInjection(
+              FaultInjectionIOType::kWrite);
+          fault_fs_guard->EnableThreadLocalErrorInjection(
+              FaultInjectionIOType::kMetadataRead);
+          fault_fs_guard->EnableThreadLocalErrorInjection(
+              FaultInjectionIOType::kMetadataWrite);
         }
         if (thread->shared->ShouldStopTest()) {
           break;
@@ -1041,7 +1056,14 @@ void StressTest::OperateDb(ThreadState* thread) {
         } else if (s.ok()) {
           //  Temporarily disable error injection for verification
           if (fault_fs_guard) {
-            fault_fs_guard->DisableAllThreadLocalErrorInjection();
+            fault_fs_guard->DisableThreadLocalErrorInjection(
+                FaultInjectionIOType::kRead);
+            fault_fs_guard->DisableThreadLocalErrorInjection(
+                FaultInjectionIOType::kMetadataRead);
+            fault_fs_guard->DisableThreadLocalErrorInjection(
+                FaultInjectionIOType::kWrite);
+            fault_fs_guard->DisableThreadLocalErrorInjection(
+                FaultInjectionIOType::kMetadataWrite);
           }
 
           // Verify no writes during LockWAL
@@ -1096,7 +1118,14 @@ void StressTest::OperateDb(ThreadState* thread) {
 
           //  Enable back error injection disabled for verification
           if (fault_fs_guard) {
-            fault_fs_guard->EnableAllThreadLocalErrorInjection();
+            fault_fs_guard->EnableThreadLocalErrorInjection(
+                FaultInjectionIOType::kRead);
+            fault_fs_guard->EnableThreadLocalErrorInjection(
+                FaultInjectionIOType::kMetadataRead);
+            fault_fs_guard->EnableThreadLocalErrorInjection(
+                FaultInjectionIOType::kWrite);
+            fault_fs_guard->EnableThreadLocalErrorInjection(
+                FaultInjectionIOType::kMetadataWrite);
           }
         }
       }
@@ -1209,13 +1238,27 @@ void StressTest::OperateDb(ThreadState* thread) {
         // failed due to injected error. So we disable fault injection to avoid
         // false positive
         if (fault_fs_guard) {
-          fault_fs_guard->DisableAllThreadLocalErrorInjection();
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kMetadataRead);
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kMetadataWrite);
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kRead);
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kWrite);
         }
 
         TestGetProperty(thread);
 
         if (fault_fs_guard) {
-          fault_fs_guard->EnableAllThreadLocalErrorInjection();
+          fault_fs_guard->EnableThreadLocalErrorInjection(
+              FaultInjectionIOType::kMetadataWrite);
+          fault_fs_guard->EnableThreadLocalErrorInjection(
+              FaultInjectionIOType::kMetadataRead);
+          fault_fs_guard->EnableThreadLocalErrorInjection(
+              FaultInjectionIOType::kRead);
+          fault_fs_guard->EnableThreadLocalErrorInjection(
+              FaultInjectionIOType::kWrite);
         }
       }
 
@@ -1246,11 +1289,25 @@ void StressTest::OperateDb(ThreadState* thread) {
           // TODO(hx235): enable error injection with
           // backup/restore after fixing the various issues it surfaces
           if (fault_fs_guard) {
-            fault_fs_guard->DisableAllThreadLocalErrorInjection();
+            fault_fs_guard->DisableThreadLocalErrorInjection(
+                FaultInjectionIOType::kMetadataRead);
+            fault_fs_guard->DisableThreadLocalErrorInjection(
+                FaultInjectionIOType::kMetadataWrite);
+            fault_fs_guard->DisableThreadLocalErrorInjection(
+                FaultInjectionIOType::kRead);
+            fault_fs_guard->DisableThreadLocalErrorInjection(
+                FaultInjectionIOType::kWrite);
           }
           Status s = TestBackupRestore(thread, rand_column_families, rand_keys);
           if (fault_fs_guard) {
-            fault_fs_guard->EnableAllThreadLocalErrorInjection();
+            fault_fs_guard->EnableThreadLocalErrorInjection(
+                FaultInjectionIOType::kMetadataWrite);
+            fault_fs_guard->EnableThreadLocalErrorInjection(
+                FaultInjectionIOType::kMetadataRead);
+            fault_fs_guard->EnableThreadLocalErrorInjection(
+                FaultInjectionIOType::kRead);
+            fault_fs_guard->EnableThreadLocalErrorInjection(
+                FaultInjectionIOType::kWrite);
           }
           ProcessStatus(shared, "Backup/restore", s);
         }
@@ -1287,13 +1344,7 @@ void StressTest::OperateDb(ThreadState* thread) {
       if (thread->rand.OneInOpt(FLAGS_key_may_exist_one_in)) {
         TestKeyMayExist(thread, read_opts, rand_column_families, rand_keys);
       }
-      // Prefix-recoverability relies on tracing successful user writes.
-      // Currently we trace all user writes regardless of whether it later
-      // succeeds or not. To simplify, we disable any fault injection during
-      // user write.
-      // TODO(hx235): support tracing user writes with fault injection.
-      bool disable_fault_injection_during_user_write =
-          fault_fs_guard && MightHaveUnsyncedDataLoss();
+
       int prob_op = thread->rand.Uniform(100);
       // Reset this in case we pick something other than a read op. We don't
       // want to use a stale value when deciding at the beginning of the loop
@@ -1352,34 +1403,16 @@ void StressTest::OperateDb(ThreadState* thread) {
       } else if (prob_op < write_bound) {
         assert(prefix_bound <= prob_op);
         // OPERATION write
-        if (disable_fault_injection_during_user_write) {
-          fault_fs_guard->DisableAllThreadLocalErrorInjection();
-        }
         TestPut(thread, write_opts, read_opts, rand_column_families, rand_keys,
                 value);
-        if (disable_fault_injection_during_user_write) {
-          fault_fs_guard->EnableAllThreadLocalErrorInjection();
-        }
       } else if (prob_op < del_bound) {
         assert(write_bound <= prob_op);
         // OPERATION delete
-        if (disable_fault_injection_during_user_write) {
-          fault_fs_guard->DisableAllThreadLocalErrorInjection();
-        }
         TestDelete(thread, write_opts, rand_column_families, rand_keys);
-        if (disable_fault_injection_during_user_write) {
-          fault_fs_guard->EnableAllThreadLocalErrorInjection();
-        }
       } else if (prob_op < delrange_bound) {
         assert(del_bound <= prob_op);
         // OPERATION delete range
-        if (disable_fault_injection_during_user_write) {
-          fault_fs_guard->DisableAllThreadLocalErrorInjection();
-        }
         TestDeleteRange(thread, write_opts, rand_column_families, rand_keys);
-        if (disable_fault_injection_during_user_write) {
-          fault_fs_guard->EnableAllThreadLocalErrorInjection();
-        }
       } else if (prob_op < iterate_bound) {
         assert(delrange_bound <= prob_op);
         // OPERATION iterate
@@ -1423,7 +1456,14 @@ void StressTest::OperateDb(ThreadState* thread) {
 
 #ifndef NDEBUG
     if (fault_fs_guard) {
-      fault_fs_guard->DisableAllThreadLocalErrorInjection();
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kWrite);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataWrite);
     }
 #endif  // NDEBUG
   }
@@ -2304,7 +2344,14 @@ Status StressTest::TestBackupRestore(
 
   // Temporarily disable error injection for clean up
   if (fault_fs_guard) {
-    fault_fs_guard->DisableAllThreadLocalErrorInjection();
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kRead);
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kWrite);
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataRead);
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataWrite);
   }
 
   if (s.ok() || IsErrorInjectedAndRetryable(s)) {
@@ -2326,7 +2373,14 @@ Status StressTest::TestBackupRestore(
 
   // Enable back error injection disabled for clean up
   if (fault_fs_guard) {
-    fault_fs_guard->EnableAllThreadLocalErrorInjection();
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kRead);
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kWrite);
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataRead);
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataWrite);
   }
 
   if (!s.ok() && !IsErrorInjectedAndRetryable(s)) {
@@ -2466,12 +2520,26 @@ Status StressTest::TestCheckpoint(ThreadState* thread,
   tmp_opts.sst_file_manager.reset();
   //  Temporarily disable error injection for clean-up
   if (fault_fs_guard) {
-    fault_fs_guard->DisableAllThreadLocalErrorInjection();
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kRead);
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kWrite);
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataRead);
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataWrite);
   }
   DestroyDB(checkpoint_dir, tmp_opts);
   // Enable back error injection disabled for clean-up
   if (fault_fs_guard) {
-    fault_fs_guard->EnableAllThreadLocalErrorInjection();
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kRead);
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kWrite);
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataRead);
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataWrite);
   }
   Checkpoint* checkpoint = nullptr;
   Status s = Checkpoint::Create(db_, &checkpoint);
@@ -2579,7 +2647,14 @@ Status StressTest::TestCheckpoint(ThreadState* thread,
 
   //  Temporarily disable error injection for clean-up
   if (fault_fs_guard) {
-    fault_fs_guard->DisableAllThreadLocalErrorInjection();
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kRead);
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kWrite);
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataRead);
+    fault_fs_guard->DisableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataWrite);
   }
 
   if (!s.ok() && !IsErrorInjectedAndRetryable(s)) {
@@ -2591,7 +2666,14 @@ Status StressTest::TestCheckpoint(ThreadState* thread,
 
   // Enable back error injection disabled for clean-up
   if (fault_fs_guard) {
-    fault_fs_guard->EnableAllThreadLocalErrorInjection();
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kRead);
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kWrite);
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataRead);
+    fault_fs_guard->EnableThreadLocalErrorInjection(
+        FaultInjectionIOType::kMetadataWrite);
   }
   return s;
 }
@@ -2966,7 +3048,14 @@ void StressTest::TestCompactRange(ThreadState* thread, int64_t rand_key,
   if (thread->rand.OneIn(2)) {
     // Temporarily disable error injection to for validation
     if (fault_fs_guard) {
-      fault_fs_guard->DisableAllThreadLocalErrorInjection();
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataWrite);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kWrite);
     }
 
     // Declare a snapshot and compare the data before and after the compaction
@@ -2976,7 +3065,14 @@ void StressTest::TestCompactRange(ThreadState* thread, int64_t rand_key,
 
     // Enable back error injection disabled for validation
     if (fault_fs_guard) {
-      fault_fs_guard->EnableAllThreadLocalErrorInjection();
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataRead);
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kRead);
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataWrite);
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kWrite);
     }
   }
   std::ostringstream compact_range_opt_oss;
@@ -3014,7 +3110,14 @@ void StressTest::TestCompactRange(ThreadState* thread, int64_t rand_key,
   if (pre_snapshot != nullptr) {
     // Temporarily disable error injection for validation
     if (fault_fs_guard) {
-      fault_fs_guard->DisableAllThreadLocalErrorInjection();
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataWrite);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kWrite);
     }
     uint32_t post_hash =
         GetRangeHash(thread, pre_snapshot, column_family, start_key, end_key);
@@ -3033,7 +3136,14 @@ void StressTest::TestCompactRange(ThreadState* thread, int64_t rand_key,
     db_->ReleaseSnapshot(pre_snapshot);
     if (fault_fs_guard) {
       // Enable back error injection disabled for validation
-      fault_fs_guard->EnableAllThreadLocalErrorInjection();
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataRead);
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kRead);
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataWrite);
+      fault_fs_guard->EnableThreadLocalErrorInjection(
+          FaultInjectionIOType::kWrite);
     }
   }
 }
@@ -3413,7 +3523,14 @@ void StressTest::Open(SharedState* shared, bool reopen) {
     // If this is for DB reopen,  error injection may have been enabled.
     // Disable it here in case there is no open fault injection.
     if (fault_fs_guard) {
-      fault_fs_guard->DisableAllThreadLocalErrorInjection();
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kWrite);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataRead);
+      fault_fs_guard->DisableThreadLocalErrorInjection(
+          FaultInjectionIOType::kMetadataWrite);
     }
     // TODO; test transaction DB Open with fault injection
     if (!FLAGS_use_txn) {
@@ -3494,7 +3611,14 @@ void StressTest::Open(SharedState* shared, bool reopen) {
         if (inject_sync_fault || inject_open_meta_read_error ||
             inject_open_meta_write_error || inject_open_read_error ||
             inject_open_write_error) {
-          fault_fs_guard->DisableAllThreadLocalErrorInjection();
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kRead);
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kWrite);
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kMetadataRead);
+          fault_fs_guard->DisableThreadLocalErrorInjection(
+              FaultInjectionIOType::kMetadataWrite);
 
           if (s.ok()) {
             // Injected errors might happen in background compactions. We
@@ -3674,7 +3798,7 @@ void StressTest::Reopen(ThreadState* thread) {
   // crash-recovery verification does. Therefore it always expects no data loss
   // and we should ensure no data loss in testing.
   // TODO(hx235): eliminate the FlushWAL(true /* sync */)/SyncWAL() below
-  if (!FLAGS_disable_wal && FLAGS_avoid_flush_during_shutdown) {
+  if (!FLAGS_disable_wal && !FLAGS_avoid_flush_during_shutdown) {
     Status s;
     if (FLAGS_manual_wal_flush_one_in > 0) {
       s = db_->FlushWAL(/*sync=*/true);
@@ -3832,10 +3956,6 @@ void CheckAndSetOptionsForUserTimestamp(Options& options) {
       FLAGS_persist_user_defined_timestamps;
 }
 
-bool ShouldDisableAutoCompactionsBeforeVerifyDb() {
-  return !FLAGS_disable_auto_compactions && FLAGS_enable_compaction_filter;
-}
-
 bool InitializeOptionsFromFile(Options& options) {
   DBOptions db_options;
   ConfigOptions config_options;
@@ -3863,8 +3983,6 @@ void InitializeOptionsFromFlags(
     const std::shared_ptr<const FilterPolicy>& filter_policy,
     Options& options) {
   BlockBasedTableOptions block_based_options;
-  block_based_options.decouple_partitioned_filters =
-      FLAGS_decouple_partitioned_filters;
   block_based_options.block_cache = cache;
   block_based_options.cache_index_and_filter_blocks =
       FLAGS_cache_index_and_filter_blocks;
@@ -3951,11 +4069,7 @@ void InitializeOptionsFromFlags(
         new WriteBufferManager(FLAGS_db_write_buffer_size, block_cache));
   }
   options.memtable_whole_key_filtering = FLAGS_memtable_whole_key_filtering;
-  if (ShouldDisableAutoCompactionsBeforeVerifyDb()) {
-    options.disable_auto_compactions = true;
-  } else {
-    options.disable_auto_compactions = FLAGS_disable_auto_compactions;
-  }
+  options.disable_auto_compactions = FLAGS_disable_auto_compactions;
   options.max_background_compactions = FLAGS_max_background_compactions;
   options.max_background_flushes = FLAGS_max_background_flushes;
   options.compaction_style =
@@ -4055,7 +4169,6 @@ void InitializeOptionsFromFlags(
   options.memtable_protection_bytes_per_key =
       FLAGS_memtable_protection_bytes_per_key;
   options.block_protection_bytes_per_key = FLAGS_block_protection_bytes_per_key;
-  options.paranoid_memory_checks = FLAGS_paranoid_memory_checks;
 
   // Integrated BlobDB
   options.enable_blob_files = FLAGS_enable_blob_files;
@@ -4271,7 +4384,6 @@ void InitializeOptionsGeneral(
     options.disable_auto_compactions = true;
   }
 
-  options.table_properties_collector_factories.clear();
   options.table_properties_collector_factories.emplace_back(
       std::make_shared<DbStressTablePropertiesCollectorFactory>());
 

db_stress_tool/db_stress_test_base.h

@@ -48,11 +48,7 @@ class StressTest {
     return FLAGS_sync_fault_injection || FLAGS_disable_wal ||
            FLAGS_manual_wal_flush_one_in > 0;
   }
-  Status EnableAutoCompaction() {
-    assert(options_.disable_auto_compactions);
-    Status s = db_->EnableAutoCompaction(column_families_);
-    return s;
-  }
+
   void CleanUp();
 
  protected:
@@ -67,55 +63,6 @@ class StressTest {
       return 0;
     }
   }
-
-  void UpdateIfInitialWriteFails(Env* db_stress_env, const Status& write_s,
-                                 Status* initial_write_s,
-                                 bool* initial_wal_write_may_succeed,
-                                 uint64_t* wait_for_recover_start_time) {
-    assert(db_stress_env && initial_write_s && initial_wal_write_may_succeed &&
-           wait_for_recover_start_time);
-    // Only update `initial_write_s`, `initial_wal_write_may_succeed` when the
-    // first write fails
-    if (!write_s.ok() && (*initial_write_s).ok()) {
-      *initial_write_s = write_s;
-      *initial_wal_write_may_succeed =
-          !FaultInjectionTestFS::IsFailedToWriteToWALError(*initial_write_s);
-      *wait_for_recover_start_time = db_stress_env->NowMicros();
-    }
-  }
-
-  void PrintWriteRecoveryWaitTimeIfNeeded(Env* db_stress_env,
-                                          const Status& initial_write_s,
-                                          bool initial_wal_write_may_succeed,
-                                          uint64_t wait_for_recover_start_time,
-                                          const std::string& thread_name) {
-    assert(db_stress_env);
-    bool waited_for_recovery = !initial_write_s.ok() &&
-                               IsErrorInjectedAndRetryable(initial_write_s) &&
-                               initial_wal_write_may_succeed;
-    if (waited_for_recovery) {
-      uint64_t elapsed_sec =
-          (db_stress_env->NowMicros() - wait_for_recover_start_time) / 1000000;
-      if (elapsed_sec > 10) {
-        fprintf(stdout,
-                "%s thread slept to wait for write recovery for "
-                "%" PRIu64 " seconds\n",
-                thread_name.c_str(), elapsed_sec);
-      }
-    }
-  }
-  void GetDeleteRangeKeyLocks(
-      ThreadState* thread, int rand_column_family, int64_t rand_key,
-      std::vector<std::unique_ptr<MutexLock>>* range_locks) {
-    for (int j = 0; j < FLAGS_range_deletion_width; ++j) {
-      if (j == 0 ||
-          ((rand_key + j) & ((1 << FLAGS_log2_keys_per_lock) - 1)) == 0) {
-        range_locks->emplace_back(new MutexLock(
-            thread->shared->GetMutexForKey(rand_column_family, rand_key + j)));
-      }
-    }
-  }
-
   Status AssertSame(DB* db, ColumnFamilyHandle* cf,
                     ThreadState::SnapshotState& snap_state);
 
@@ -336,8 +283,7 @@ class StressTest {
 
   bool IsErrorInjectedAndRetryable(const Status& error_s) const {
     assert(!error_s.ok());
-    return error_s.getState() &&
-           FaultInjectionTestFS::IsInjectedError(error_s) &&
+    return error_s.getState() && std::strstr(error_s.getState(), "inject") &&
            !status_to_io_status(Status(error_s)).GetDataLoss();
   }
 
@@ -451,6 +397,5 @@ void InitializeOptionsGeneral(
 // user-defined timestamp.
 void CheckAndSetOptionsForUserTimestamp(Options& options);
 
-bool ShouldDisableAutoCompactionsBeforeVerifyDb();
 }  // namespace ROCKSDB_NAMESPACE
 #endif  // GFLAGS

db_stress_tool/expected_state.cc

@@ -34,19 +34,11 @@ void ExpectedState::Precommit(int cf, int64_t key, const ExpectedValue& value) {
 
 PendingExpectedValue ExpectedState::PreparePut(int cf, int64_t key) {
   ExpectedValue expected_value = Load(cf, key);
-
-  // Calculate the original expected value
   const ExpectedValue orig_expected_value = expected_value;
-
-  // Calculate the pending expected value
   expected_value.Put(true /* pending */);
   const ExpectedValue pending_expected_value = expected_value;
-
-  // Calculate the final expected value
   expected_value.Put(false /* pending */);
   const ExpectedValue final_expected_value = expected_value;
-
-  // Precommit
   Precommit(cf, key, pending_expected_value);
   return PendingExpectedValue(&Value(cf, key), orig_expected_value,
                               final_expected_value);
@@ -54,26 +46,21 @@ PendingExpectedValue ExpectedState::PreparePut(int cf, int64_t key) {
 
 ExpectedValue ExpectedState::Get(int cf, int64_t key) { return Load(cf, key); }
 
-PendingExpectedValue ExpectedState::PrepareDelete(int cf, int64_t key) {
+PendingExpectedValue ExpectedState::PrepareDelete(int cf, int64_t key,
+                                                  bool* prepared) {
   ExpectedValue expected_value = Load(cf, key);
-
-  // Calculate the original expected value
   const ExpectedValue orig_expected_value = expected_value;
-
-  // Calculate the pending expected value
   bool res = expected_value.Delete(true /* pending */);
+  if (prepared) {
+    *prepared = res;
+  }
   if (!res) {
-    PendingExpectedValue ret = PendingExpectedValue(
-        &Value(cf, key), orig_expected_value, orig_expected_value);
-    return ret;
+    return PendingExpectedValue(&Value(cf, key), orig_expected_value,
+                                orig_expected_value);
   }
   const ExpectedValue pending_expected_value = expected_value;
-
-  // Calculate the final expected value
   expected_value.Delete(false /* pending */);
   const ExpectedValue final_expected_value = expected_value;
-
-  // Precommit
   Precommit(cf, key, pending_expected_value);
   return PendingExpectedValue(&Value(cf, key), orig_expected_value,
                               final_expected_value);
@@ -86,11 +73,16 @@ PendingExpectedValue ExpectedState::PrepareSingleDelete(int cf, int64_t key) {
 std::vector<PendingExpectedValue> ExpectedState::PrepareDeleteRange(
     int cf, int64_t begin_key, int64_t end_key) {
   std::vector<PendingExpectedValue> pending_expected_values;
-
   for (int64_t key = begin_key; key < end_key; ++key) {
-    pending_expected_values.push_back(PrepareDelete(cf, key));
+    bool prepared = false;
+    PendingExpectedValue pending_expected_value =
+        PrepareDelete(cf, key, &prepared);
+    if (prepared) {
+      pending_expected_values.push_back(pending_expected_value);
+    } else {
+      pending_expected_value.PermitUnclosedPendingState();
+    }
   }
-
   return pending_expected_values;
 }
 

db_stress_tool/expected_state.h

@@ -49,13 +49,14 @@ class ExpectedState {
   // Does not requires external locking.
   ExpectedValue Get(int cf, int64_t key);
 
-  // Prepare a Delete that will be started but not finished yet.
+  // Prepare a Delete that will be started but not finished yet
   // This is useful for crash-recovery testing when the process may crash
   // before updating the corresponding expected value
   //
   // Requires external locking covering `key` in `cf` to prevent concurrent
   // write or delete to the same `key`.
-  PendingExpectedValue PrepareDelete(int cf, int64_t key);
+  PendingExpectedValue PrepareDelete(int cf, int64_t key,
+                                     bool* prepared = nullptr);
 
   // Requires external locking covering `key` in `cf` to prevent concurrent
   // write or delete to the same `key`.

db_stress_tool/expected_value.cc

@@ -21,7 +21,7 @@ void ExpectedValue::Put(bool pending) {
 }
 
 bool ExpectedValue::Delete(bool pending) {
-  if (pending && !Exists()) {
+  if (!Exists()) {
     return false;
   }
   if (pending) {

db_stress_tool/expected_value.h

@@ -37,10 +37,7 @@ class ExpectedValue {
   explicit ExpectedValue(uint32_t expected_value)
       : expected_value_(expected_value) {}
 
-  bool Exists() const {
-    assert(!PendingWrite() && !PendingDelete());
-    return !IsDeleted();
-  }
+  bool Exists() const { return PendingWrite() || !IsDeleted(); }
 
   uint32_t Read() const { return expected_value_; }
 

db_stress_tool/no_batched_ops_stress.cc

@@ -1611,90 +1611,67 @@ class NonBatchedOpsStressTest : public StressTest {
       }
     }
 
-    // To track the final write status
-    Status s;
-    // To track the initial write status
-    Status initial_write_s;
-    // To track whether WAL write may have succeeded during the initial failed
-    // write
-    bool initial_wal_write_may_succeed = true;
-
     PendingExpectedValue pending_expected_value =
         shared->PreparePut(rand_column_family, rand_key);
-
     const uint32_t value_base = pending_expected_value.GetFinalValueBase();
     const size_t sz = GenerateValue(value_base, value, sizeof(value));
     const Slice v(value, sz);
 
-    uint64_t wait_for_recover_start_time = 0;
-    do {
-      // In order to commit the expected state for the initial write failed with
-      // injected retryable error and successful WAL write, retry the write
-      // until it succeeds after the recovery finishes
-      if (!s.ok() && IsErrorInjectedAndRetryable(s) &&
-          initial_wal_write_may_succeed) {
-        std::this_thread::sleep_for(std::chrono::microseconds(1 * 1000 * 1000));
-      }
-      if (FLAGS_use_put_entity_one_in > 0 &&
-          (value_base % FLAGS_use_put_entity_one_in) == 0) {
-        if (!FLAGS_use_txn) {
-          if (FLAGS_use_attribute_group) {
-            s = db_->PutEntity(write_opts, k,
-                               GenerateAttributeGroups({cfh}, value_base, v));
-          } else {
-            s = db_->PutEntity(write_opts, cfh, k,
-                               GenerateWideColumns(value_base, v));
-          }
+    Status s;
+
+    if (FLAGS_use_put_entity_one_in > 0 &&
+        (value_base % FLAGS_use_put_entity_one_in) == 0) {
+      if (!FLAGS_use_txn) {
+        if (FLAGS_use_attribute_group) {
+          s = db_->PutEntity(write_opts, k,
+                             GenerateAttributeGroups({cfh}, value_base, v));
         } else {
-          s = ExecuteTransaction(write_opts, thread, [&](Transaction& txn) {
-            return txn.PutEntity(cfh, k, GenerateWideColumns(value_base, v));
-          });
-        }
-      } else if (FLAGS_use_timed_put_one_in > 0 &&
-                 ((value_base + kLargePrimeForCommonFactorSkew) %
-                  FLAGS_use_timed_put_one_in) == 0) {
-        WriteBatch wb;
-        uint64_t write_unix_time = GetWriteUnixTime(thread);
-        s = wb.TimedPut(cfh, k, v, write_unix_time);
-        if (s.ok()) {
-          s = db_->Write(write_opts, &wb);
-        }
-      } else if (FLAGS_use_merge) {
-        if (!FLAGS_use_txn) {
-          if (FLAGS_user_timestamp_size == 0) {
-            s = db_->Merge(write_opts, cfh, k, v);
-          } else {
-            s = db_->Merge(write_opts, cfh, k, write_ts, v);
-          }
-        } else {
-          s = ExecuteTransaction(write_opts, thread, [&](Transaction& txn) {
-            return txn.Merge(cfh, k, v);
-          });
+          s = db_->PutEntity(write_opts, cfh, k,
+                             GenerateWideColumns(value_base, v));
         }
       } else {
-        if (!FLAGS_use_txn) {
-          if (FLAGS_user_timestamp_size == 0) {
-            s = db_->Put(write_opts, cfh, k, v);
-          } else {
-            s = db_->Put(write_opts, cfh, k, write_ts, v);
-          }
-        } else {
-          s = ExecuteTransaction(write_opts, thread, [&](Transaction& txn) {
-            return txn.Put(cfh, k, v);
-          });
-        }
+        s = ExecuteTransaction(write_opts, thread, [&](Transaction& txn) {
+          return txn.PutEntity(cfh, k, GenerateWideColumns(value_base, v));
+        });
       }
-      UpdateIfInitialWriteFails(db_stress_env, s, &initial_write_s,
-                                &initial_wal_write_may_succeed,
-                                &wait_for_recover_start_time);
-
-    } while (!s.ok() && IsErrorInjectedAndRetryable(s) &&
-             initial_wal_write_may_succeed);
+    } else if (FLAGS_use_timed_put_one_in > 0 &&
+               ((value_base + kLargePrimeForCommonFactorSkew) %
+                FLAGS_use_timed_put_one_in) == 0) {
+      WriteBatch wb;
+      uint64_t write_unix_time = GetWriteUnixTime(thread);
+      s = wb.TimedPut(cfh, k, v, write_unix_time);
+      if (s.ok()) {
+        s = db_->Write(write_opts, &wb);
+      }
+    } else if (FLAGS_use_merge) {
+      if (!FLAGS_use_txn) {
+        if (FLAGS_user_timestamp_size == 0) {
+          s = db_->Merge(write_opts, cfh, k, v);
+        } else {
+          s = db_->Merge(write_opts, cfh, k, write_ts, v);
+        }
+      } else {
+        s = ExecuteTransaction(write_opts, thread, [&](Transaction& txn) {
+          return txn.Merge(cfh, k, v);
+        });
+      }
+    } else {
+      if (!FLAGS_use_txn) {
+        if (FLAGS_user_timestamp_size == 0) {
+          s = db_->Put(write_opts, cfh, k, v);
+        } else {
+          s = db_->Put(write_opts, cfh, k, write_ts, v);
+        }
+      } else {
+        s = ExecuteTransaction(write_opts, thread, [&](Transaction& txn) {
+          return txn.Put(cfh, k, v);
+        });
+      }
+    }
 
     if (!s.ok()) {
       pending_expected_value.Rollback();
       if (IsErrorInjectedAndRetryable(s)) {
-        assert(!initial_wal_write_may_succeed);
         return s;
       } else if (FLAGS_inject_error_severity == 2) {
         if (!is_db_stopped_ && s.severity() >= Status::Severity::kFatalError) {
@@ -1708,15 +1685,11 @@ class NonBatchedOpsStressTest : public StressTest {
         fprintf(stderr, "put or merge error: %s\n", s.ToString().c_str());
         thread->shared->SafeTerminate();
       }
-    } else {
-      PrintWriteRecoveryWaitTimeIfNeeded(
-          db_stress_env, initial_write_s, initial_wal_write_may_succeed,
-          wait_for_recover_start_time, "TestPut");
-      pending_expected_value.Commit();
-      thread->stats.AddBytesForWrites(1, sz);
-      PrintKeyValue(rand_column_family, static_cast<uint32_t>(rand_key), value,
-                    sz);
     }
+    pending_expected_value.Commit();
+    thread->stats.AddBytesForWrites(1, sz);
+    PrintKeyValue(rand_column_family, static_cast<uint32_t>(rand_key), value,
+                  sz);
     return s;
   }
 
@@ -1738,51 +1711,27 @@ class NonBatchedOpsStressTest : public StressTest {
     Slice key = key_str;
     auto cfh = column_families_[rand_column_family];
 
-    // To track the final write status
-    Status s;
-    // To track the initial write status
-    Status initial_write_s;
-    // To track whether WAL write may have succeeded during the initial failed
-    // write
-    bool initial_wal_write_may_succeed = true;
-
     // Use delete if the key may be overwritten and a single deletion
     // otherwise.
+    Status s;
     if (shared->AllowsOverwrite(rand_key)) {
       PendingExpectedValue pending_expected_value =
           shared->PrepareDelete(rand_column_family, rand_key);
-
-      uint64_t wait_for_recover_start_time = 0;
-      do {
-        // In order to commit the expected state for the initial write failed
-        // with injected retryable error and successful WAL write, retry the
-        // write until it succeeds after the recovery finishes
-        if (!s.ok() && IsErrorInjectedAndRetryable(s) &&
-            initial_wal_write_may_succeed) {
-          std::this_thread::sleep_for(
-              std::chrono::microseconds(1 * 1000 * 1000));
-        }
-        if (!FLAGS_use_txn) {
-          if (FLAGS_user_timestamp_size == 0) {
-            s = db_->Delete(write_opts, cfh, key);
-          } else {
-            s = db_->Delete(write_opts, cfh, key, write_ts);
-          }
+      if (!FLAGS_use_txn) {
+        if (FLAGS_user_timestamp_size == 0) {
+          s = db_->Delete(write_opts, cfh, key);
         } else {
-          s = ExecuteTransaction(write_opts, thread, [&](Transaction& txn) {
-            return txn.Delete(cfh, key);
-          });
+          s = db_->Delete(write_opts, cfh, key, write_ts);
         }
-        UpdateIfInitialWriteFails(db_stress_env, s, &initial_write_s,
-                                  &initial_wal_write_may_succeed,
-                                  &wait_for_recover_start_time);
-      } while (!s.ok() && IsErrorInjectedAndRetryable(s) &&
-               initial_wal_write_may_succeed);
+      } else {
+        s = ExecuteTransaction(write_opts, thread, [&](Transaction& txn) {
+          return txn.Delete(cfh, key);
+        });
+      }
 
       if (!s.ok()) {
         pending_expected_value.Rollback();
         if (IsErrorInjectedAndRetryable(s)) {
-          assert(!initial_wal_write_may_succeed);
           return s;
         } else if (FLAGS_inject_error_severity == 2) {
           if (!is_db_stopped_ &&
@@ -1797,48 +1746,27 @@ class NonBatchedOpsStressTest : public StressTest {
           fprintf(stderr, "delete error: %s\n", s.ToString().c_str());
           thread->shared->SafeTerminate();
         }
-      } else {
-        PrintWriteRecoveryWaitTimeIfNeeded(
-            db_stress_env, initial_write_s, initial_wal_write_may_succeed,
-            wait_for_recover_start_time, "TestDelete");
-        pending_expected_value.Commit();
-        thread->stats.AddDeletes(1);
       }
+      pending_expected_value.Commit();
+      thread->stats.AddDeletes(1);
     } else {
       PendingExpectedValue pending_expected_value =
           shared->PrepareSingleDelete(rand_column_family, rand_key);
-
-      uint64_t wait_for_recover_start_time = 0;
-      do {
-        // In order to commit the expected state for the initial write failed
-        // with injected retryable error and successful WAL write, retry the
-        // write until it succeeds after the recovery finishes
-        if (!s.ok() && IsErrorInjectedAndRetryable(s) &&
-            initial_wal_write_may_succeed) {
-          std::this_thread::sleep_for(
-              std::chrono::microseconds(1 * 1000 * 1000));
-        }
-        if (!FLAGS_use_txn) {
-          if (FLAGS_user_timestamp_size == 0) {
-            s = db_->SingleDelete(write_opts, cfh, key);
-          } else {
-            s = db_->SingleDelete(write_opts, cfh, key, write_ts);
-          }
+      if (!FLAGS_use_txn) {
+        if (FLAGS_user_timestamp_size == 0) {
+          s = db_->SingleDelete(write_opts, cfh, key);
         } else {
-          s = ExecuteTransaction(write_opts, thread, [&](Transaction& txn) {
-            return txn.SingleDelete(cfh, key);
-          });
+          s = db_->SingleDelete(write_opts, cfh, key, write_ts);
         }
-        UpdateIfInitialWriteFails(db_stress_env, s, &initial_write_s,
-                                  &initial_wal_write_may_succeed,
-                                  &wait_for_recover_start_time);
-      } while (!s.ok() && IsErrorInjectedAndRetryable(s) &&
-               initial_wal_write_may_succeed);
+      } else {
+        s = ExecuteTransaction(write_opts, thread, [&](Transaction& txn) {
+          return txn.SingleDelete(cfh, key);
+        });
+      }
 
       if (!s.ok()) {
         pending_expected_value.Rollback();
         if (IsErrorInjectedAndRetryable(s)) {
-          assert(!initial_wal_write_may_succeed);
           return s;
         } else if (FLAGS_inject_error_severity == 2) {
           if (!is_db_stopped_ &&
@@ -1853,13 +1781,9 @@ class NonBatchedOpsStressTest : public StressTest {
           fprintf(stderr, "single delete error: %s\n", s.ToString().c_str());
           thread->shared->SafeTerminate();
         }
-      } else {
-        PrintWriteRecoveryWaitTimeIfNeeded(
-            db_stress_env, initial_write_s, initial_wal_write_may_succeed,
-            wait_for_recover_start_time, "TestDelete");
-        pending_expected_value.Commit();
-        thread->stats.AddSingleDeletes(1);
       }
+      pending_expected_value.Commit();
+      thread->stats.AddSingleDeletes(1);
     }
     return s;
   }
@@ -1881,20 +1805,16 @@ class NonBatchedOpsStressTest : public StressTest {
       rand_key =
           thread->rand.Next() % (max_key - FLAGS_range_deletion_width + 1);
     }
-    GetDeleteRangeKeyLocks(thread, rand_column_family, rand_key, &range_locks);
-
-    // To track the final write status
-    Status s;
-    // To track the initial write status
-    Status initial_write_s;
-    // To track whether WAL write may have succeeded during the initial failed
-    // write
-    bool initial_wal_write_may_succeed = true;
-
+    for (int j = 0; j < FLAGS_range_deletion_width; ++j) {
+      if (j == 0 ||
+          ((rand_key + j) & ((1 << FLAGS_log2_keys_per_lock) - 1)) == 0) {
+        range_locks.emplace_back(new MutexLock(
+            shared->GetMutexForKey(rand_column_family, rand_key + j)));
+      }
+    }
     std::vector<PendingExpectedValue> pending_expected_values =
         shared->PrepareDeleteRange(rand_column_family, rand_key,
                                    rand_key + FLAGS_range_deletion_width);
-
     const int covered = static_cast<int>(pending_expected_values.size());
     std::string keystr = Key(rand_key);
     Slice key = keystr;
@@ -1903,36 +1823,20 @@ class NonBatchedOpsStressTest : public StressTest {
     Slice end_key = end_keystr;
     std::string write_ts_str;
     Slice write_ts;
-    uint64_t wait_for_recover_start_time = 0;
-
-    do {
-      // In order to commit the expected state for the initial write failed with
-      // injected retryable error and successful WAL write, retry the write
-      // until it succeeds after the recovery finishes
-      if (!s.ok() && IsErrorInjectedAndRetryable(s) &&
-          initial_wal_write_may_succeed) {
-        std::this_thread::sleep_for(std::chrono::microseconds(1 * 1000 * 1000));
-      }
-      if (FLAGS_user_timestamp_size) {
-        write_ts_str = GetNowNanos();
-        write_ts = write_ts_str;
-        s = db_->DeleteRange(write_opts, cfh, key, end_key, write_ts);
-      } else {
-        s = db_->DeleteRange(write_opts, cfh, key, end_key);
-      }
-      UpdateIfInitialWriteFails(db_stress_env, s, &initial_write_s,
-                                &initial_wal_write_may_succeed,
-                                &wait_for_recover_start_time);
-    } while (!s.ok() && IsErrorInjectedAndRetryable(s) &&
-             initial_wal_write_may_succeed);
-
+    Status s;
+    if (FLAGS_user_timestamp_size) {
+      write_ts_str = GetNowNanos();
+      write_ts = write_ts_str;
+      s = db_->DeleteRange(write_opts, cfh, key, end_key, write_ts);
+    } else {
+      s = db_->DeleteRange(write_opts, cfh, key, end_key);
+    }
     if (!s.ok()) {
       for (PendingExpectedValue& pending_expected_value :
            pending_expected_values) {
         pending_expected_value.Rollback();
       }
       if (IsErrorInjectedAndRetryable(s)) {
-        assert(!initial_wal_write_may_succeed);
         return s;
       } else if (FLAGS_inject_error_severity == 2) {
         if (!is_db_stopped_ && s.severity() >= Status::Severity::kFatalError) {
@@ -1946,17 +1850,13 @@ class NonBatchedOpsStressTest : public StressTest {
         fprintf(stderr, "delete range error: %s\n", s.ToString().c_str());
         thread->shared->SafeTerminate();
       }
-    } else {
-      PrintWriteRecoveryWaitTimeIfNeeded(
-          db_stress_env, initial_write_s, initial_wal_write_may_succeed,
-          wait_for_recover_start_time, "TestDeleteRange");
-      for (PendingExpectedValue& pending_expected_value :
-           pending_expected_values) {
-        pending_expected_value.Commit();
-      }
-      thread->stats.AddRangeDeletions(1);
-      thread->stats.AddCoveredByRangeDeletions(covered);
     }
+    for (PendingExpectedValue& pending_expected_value :
+         pending_expected_values) {
+      pending_expected_value.Commit();
+    }
+    thread->stats.AddRangeDeletions(1);
+    thread->stats.AddCoveredByRangeDeletions(covered);
     return s;
   }
 
@@ -1981,7 +1881,6 @@ class NonBatchedOpsStressTest : public StressTest {
       // ingestion a clean slate
       s = db_stress_env->DeleteFile(sst_filename);
     }
-
     if (fault_fs_guard) {
       fault_fs_guard->EnableThreadLocalErrorInjection(
           FaultInjectionIOType::kMetadataRead);
@@ -2024,7 +1923,6 @@ class NonBatchedOpsStressTest : public StressTest {
 
       PendingExpectedValue pending_expected_value =
           shared->PreparePut(column_family, key);
-
       const uint32_t value_base = pending_expected_value.GetFinalValueBase();
       values.push_back(value_base);
       pending_expected_values.push_back(pending_expected_value);
@@ -2587,8 +2485,6 @@ class NonBatchedOpsStressTest : public StressTest {
         // Value doesn't exist in db, update state to reflect that
         shared->SyncDelete(cf, key);
         return true;
-      } else {
-        assert(false);
       }
     }
     char expected_value_data[kValueMaxLen];
@@ -2687,11 +2583,7 @@ class NonBatchedOpsStressTest : public StressTest {
     SharedState* const shared = thread->shared;
     assert(shared);
 
-    const ExpectedValue expected_value =
-        thread->shared->Get(column_family, key);
-    bool may_exist = !ExpectedValueHelper::MustHaveNotExisted(expected_value,
-                                                              expected_value);
-    if (!shared->AllowsOverwrite(key) && may_exist) {
+    if (!shared->AllowsOverwrite(key) && shared->Exists(column_family, key)) {
       // Just do read your write checks for keys that allow overwrites.
       return;
     }

env/file_system.cc

@@ -181,10 +181,10 @@ FileOptions FileSystem::OptimizeForBlobFileRead(
 
 IOStatus WriteStringToFile(FileSystem* fs, const Slice& data,
                            const std::string& fname, bool should_sync,
-                           const IOOptions& io_options,
-                           const FileOptions& file_options) {
+                           const IOOptions& io_options) {
   std::unique_ptr<FSWritableFile> file;
-  IOStatus s = fs->NewWritableFile(fname, file_options, &file, nullptr);
+  EnvOptions soptions;
+  IOStatus s = fs->NewWritableFile(fname, soptions, &file, nullptr);
   if (!s.ok()) {
     return s;
   }

file/filename.cc

@@ -388,7 +388,6 @@ bool ParseFileName(const std::string& fname, uint64_t* number,
 
 IOStatus SetCurrentFile(const WriteOptions& write_options, FileSystem* fs,
                         const std::string& dbname, uint64_t descriptor_number,
-                        Temperature temp,
                         FSDirectory* dir_contains_current_file) {
   // Remove leading "dbname/" and add newline to manifest file name
   std::string manifest = DescriptorFileName(dbname, descriptor_number);
@@ -398,11 +397,8 @@ IOStatus SetCurrentFile(const WriteOptions& write_options, FileSystem* fs,
   std::string tmp = TempFileName(dbname, descriptor_number);
   IOOptions opts;
   IOStatus s = PrepareIOFromWriteOptions(write_options, opts);
-  FileOptions file_opts;
-  file_opts.temperature = temp;
   if (s.ok()) {
-    s = WriteStringToFile(fs, contents.ToString() + "\n", tmp, true, opts,
-                          file_opts);
+    s = WriteStringToFile(fs, contents.ToString() + "\n", tmp, true, opts);
   }
   TEST_SYNC_POINT_CALLBACK("SetCurrentFile:BeforeRename", &s);
   if (s.ok()) {
@@ -427,8 +423,7 @@ IOStatus SetCurrentFile(const WriteOptions& write_options, FileSystem* fs,
 }
 
 Status SetIdentityFile(const WriteOptions& write_options, Env* env,
-                       const std::string& dbname, Temperature temp,
-                       const std::string& db_id) {
+                       const std::string& dbname, const std::string& db_id) {
   std::string id;
   if (db_id.empty()) {
     id = env->GenerateUniqueId();
@@ -442,11 +437,8 @@ Status SetIdentityFile(const WriteOptions& write_options, Env* env,
   Status s;
   IOOptions opts;
   s = PrepareIOFromWriteOptions(write_options, opts);
-  FileOptions file_opts;
-  file_opts.temperature = temp;
   if (s.ok()) {
-    s = WriteStringToFile(env->GetFileSystem().get(), id, tmp,
-                          /*should_sync=*/true, opts, file_opts);
+    s = WriteStringToFile(env, id, tmp, true, &opts);
   }
   if (s.ok()) {
     s = env->RenameFile(tmp, identify_file_name);

file/filename.h

@@ -161,12 +161,11 @@ bool ParseFileName(const std::string& filename, uint64_t* number,
 // when
 IOStatus SetCurrentFile(const WriteOptions& write_options, FileSystem* fs,
                         const std::string& dbname, uint64_t descriptor_number,
-                        Temperature temp,
                         FSDirectory* dir_contains_current_file);
 
 // Make the IDENTITY file for the db
 Status SetIdentityFile(const WriteOptions& write_options, Env* env,
-                       const std::string& dbname, Temperature temp,
+                       const std::string& dbname,
                        const std::string& db_id = {});
 
 // Sync manifest file `file`.

file/writable_file_writer.h

@@ -22,9 +22,6 @@
 #include "rocksdb/rate_limiter.h"
 #include "test_util/sync_point.h"
 #include "util/aligned_buffer.h"
-#ifndef NDEBUG
-#include "utilities/fault_injection_fs.h"
-#endif  // NDEBUG
 
 namespace ROCKSDB_NAMESPACE {
 class Statistics;
@@ -330,14 +327,10 @@ class WritableFileWriter {
   }
 #endif  // NDEBUG
 
-  // TODO(hx235): store the actual previous error status and return it here
   IOStatus GetWriterHasPreviousErrorStatus() {
 #ifndef NDEBUG
     if (seen_injected_error_.load(std::memory_order_relaxed)) {
-      std::stringstream msg;
-      msg << "Writer has previous " << FaultInjectionTestFS::kInjected
-          << " error.";
-      return IOStatus::IOError(msg.str());
+      return IOStatus::IOError("Writer has previous injected error.");
     }
 #endif  // NDEBUG
     return IOStatus::IOError("Writer has previous error.");

include/rocksdb/advanced_options.h

@@ -61,6 +61,18 @@ enum CompactionPri : char {
   kRoundRobin = 0x4,
 };
 
+// Temperature of a file. Used to pass to FileSystem for a different
+// placement and/or coding.
+// Reserve some numbers in the middle, in case we need to insert new tier
+// there.
+enum class Temperature : uint8_t {
+  kUnknown = 0,
+  kHot = 0x04,
+  kWarm = 0x08,
+  kCold = 0x0C,
+  kLastTemperature,
+};
+
 struct FileTemperatureAge {
   Temperature temperature = Temperature::kUnknown;
   uint64_t age = 0;
@@ -801,7 +813,7 @@ struct AdvancedColumnFamilyOptions {
   // If this option is set, when creating the last level files, pass this
   // temperature to FileSystem used. Should be no-op for default FileSystem
   // and users need to plug in their own FileSystem to take advantage of it.
-  // Currently only compatible with universal compaction.
+  // When using FIFO compaction, this option is ignored.
   //
   // Dynamically changeable through the SetOptions() API
   Temperature last_level_temperature = Temperature::kUnknown;
@@ -1078,13 +1090,6 @@ struct AdvancedColumnFamilyOptions {
   // Dynamically changeable through the SetOptions() API.
   uint32_t bottommost_file_compaction_delay = 0;
 
-  // Enables additional integrity checks during reads/scans.
-  // Specifically, for skiplist-based memtables, we verify that keys visited
-  // are in order. This is helpful to detect corrupted memtable keys during
-  // reads. Enabling this feature incurs a performance overhead due to an
-  // additional key comparison during memtable lookup.
-  bool paranoid_memory_checks = false;
-
   // Create ColumnFamilyOptions with default values for all fields
   AdvancedColumnFamilyOptions();
   // Create ColumnFamilyOptions from Options

include/rocksdb/env.h

@@ -30,7 +30,6 @@
 #include "rocksdb/port_defs.h"
 #include "rocksdb/status.h"
 #include "rocksdb/thread_status.h"
-#include "rocksdb/types.h"
 
 #ifdef _WIN32
 // Windows API macro interference
@@ -160,9 +159,6 @@ class Env : public Customizable {
 
     // Size of file in bytes
     uint64_t size_bytes;
-
-    // EXPERIMENTAL - only provided by some implementations
-    Temperature temperature = Temperature::kUnknown;
   };
 
   Env();

include/rocksdb/experimental.h

@@ -238,11 +238,6 @@ class KeySegmentsExtractor {
     // determined by segment 0 in some way, often the first byte.) The enum
     // scalar values do not need to be related to key order.
     KeyCategory category = kDefaultCategory;
-
-    void Reset() {
-      segment_ends.clear();
-      category = kDefaultCategory;
-    }
   };
 
   virtual ~KeySegmentsExtractor() {}

include/rocksdb/file_system.h

@@ -195,9 +195,7 @@ struct FileOptions : EnvOptions {
   FileOptions() : EnvOptions(), handoff_checksum_type(ChecksumType::kCRC32c) {}
 
   FileOptions(const DBOptions& opts)
-      : EnvOptions(opts),
-        temperature(opts.metadata_write_temperature),
-        handoff_checksum_type(ChecksumType::kCRC32c) {}
+      : EnvOptions(opts), handoff_checksum_type(ChecksumType::kCRC32c) {}
 
   FileOptions(const EnvOptions& opts)
       : EnvOptions(opts), handoff_checksum_type(ChecksumType::kCRC32c) {}
@@ -1954,8 +1952,7 @@ class FSDirectoryWrapper : public FSDirectory {
 // A utility routine: write "data" to the named file.
 IOStatus WriteStringToFile(FileSystem* fs, const Slice& data,
                            const std::string& fname, bool should_sync = false,
-                           const IOOptions& io_options = IOOptions(),
-                           const FileOptions& file_options = FileOptions());
+                           const IOOptions& io_options = IOOptions());
 
 // A utility routine: read contents of named file into *data
 IOStatus ReadFileToString(FileSystem* fs, const std::string& fname,

include/rocksdb/filter_policy.h

@@ -47,8 +47,7 @@ class FilterBitsReader;
 // structs because this is expected to be a temporary, stack-allocated object.
 struct FilterBuildingContext {
   // This constructor is for internal use only and subject to change.
-  // Keeps a reference to table_options.
-  explicit FilterBuildingContext(const BlockBasedTableOptions& table_options);
+  FilterBuildingContext(const BlockBasedTableOptions& table_options);
 
   // Options for the table being built
   const BlockBasedTableOptions& table_options;

include/rocksdb/memtablerep.h

@@ -194,15 +194,6 @@ class MemTableRep {
   virtual void Get(const LookupKey& k, void* callback_args,
                    bool (*callback_func)(void* arg, const char* entry));
 
-  // Same as Get() but performs data integrity validation.
-  virtual Status GetAndValidate(const LookupKey& /* k */,
-                                void* /* callback_args */,
-                                bool (* /* callback_func */)(void* arg,
-                                                             const char* entry),
-                                bool /*allow_data_in_error*/) {
-    return Status::NotSupported("GetAndValidate() not implemented.");
-  }
-
   virtual uint64_t ApproximateNumEntries(const Slice& /*start_ikey*/,
                                          const Slice& /*end_key*/) {
     return 0;
@@ -244,38 +235,13 @@ class MemTableRep {
     // REQUIRES: Valid()
     virtual void Next() = 0;
 
-    // Advances to the next position and performs integrity validations on the
-    // skip list. Iterator becomes invalid and Corruption is returned if a
-    // corruption is found.
-    // REQUIRES: Valid()
-    virtual Status NextAndValidate(bool /* allow_data_in_errors */) {
-      return Status::NotSupported("NextAndValidate() not implemented.");
-    }
-
     // Advances to the previous position.
     // REQUIRES: Valid()
     virtual void Prev() = 0;
 
-    // Advances to the previous position and performs integrity validations on
-    // the skip list. Iterator becomes invalid and Corruption is returned if a
-    // corruption is found.
-    // REQUIRES: Valid()
-    virtual Status PrevAndValidate(bool /* allow_data_in_errors */) {
-      return Status::NotSupported("PrevAndValidate() not implemented.");
-    }
-
     // Advance to the first entry with a key >= target
     virtual void Seek(const Slice& internal_key, const char* memtable_key) = 0;
 
-    // Seek and perform integrity validations on the skip list.
-    // Iterator becomes invalid and Corruption is returned if a
-    // corruption is found.
-    virtual Status SeekAndValidate(const Slice& /* internal_key */,
-                                   const char* /* memtable_key */,
-                                   bool /* allow_data_in_errors */) {
-      return Status::NotSupported("SeekAndValidate() not implemented.");
-    }
-
     // retreat to the first entry with a key <= target
     virtual void SeekForPrev(const Slice& internal_key,
                              const char* memtable_key) = 0;

include/rocksdb/options.h

@@ -512,10 +512,6 @@ class CompactionService : public Customizable {
     return CompactionServiceJobStatus::kUseLocal;
   }
 
-  // Optional callback function upon Installation.
-  virtual void OnInstallation(const std::string& /*scheduled_job_id*/,
-                              CompactionServiceJobStatus /*status*/) {}
-
   // Deprecated. Please implement Schedule() and Wait() API to handle remote
   // compaction
 
@@ -1438,17 +1434,7 @@ struct DBOptions {
   // For example, if an SST or blob file referenced by the MANIFEST is missing,
   // BER might be able to find a set of files corresponding to an old "point in
   // time" version of the column family, possibly from an older MANIFEST
-  // file.
-  // Besides complete "point in time" version, an incomplete version with
-  // only a suffix of L0 files missing can also be recovered to if the
-  // versioning history doesn't include an atomic flush.  From the users'
-  // perspective, missing a suffix of L0 files means missing the
-  // user's most recently written data. So the remaining available files still
-  // presents a valid point in time view, although for some previous time. It's
-  // not done for atomic flush because that guarantees a consistent view across
-  // column families. We cannot guarantee that if recovering an incomplete
-  // version.
-  // Some other kinds of DB files (e.g. CURRENT, LOCK, IDENTITY) are
+  // file. Some other kinds of DB files (e.g. CURRENT, LOCK, IDENTITY) are
   // either ignored or replaced with BER, or quietly fixed regardless of BER
   // setting. BER does require at least one valid MANIFEST to recover to a
   // non-trivial DB state, unlike `ldb repair`.
@@ -1580,16 +1566,6 @@ struct DBOptions {
   // Default 100ms
   uint64_t follower_catchup_retry_wait_ms = 100;
 
-  // When DB files other than SST, blob and WAL files are created, use this
-  // filesystem temperature. (See also `wal_write_temperature` and various
-  // `*_temperature` CF options.) When not `kUnknown`, this overrides any
-  // temperature set by OptimizeForManifestWrite functions.
-  Temperature metadata_write_temperature = Temperature::kUnknown;
-
-  // Use this filesystem temperature when creating WAL files. When not
-  // `kUnknown`, this overrides any temperature set by OptimizeForLogWrite
-  // functions.
-  Temperature wal_write_temperature = Temperature::kUnknown;
   // End EXPERIMENTAL
 };
 

include/rocksdb/table.h

@@ -291,11 +291,15 @@ struct BlockBasedTableOptions {
   // Same as block_restart_interval but used for the index block.
   int index_block_restart_interval = 1;
 
-  // Target block size for partitioned metadata. Currently applied to indexes
-  // when kTwoLevelIndexSearch is used and to filters when partition_filters is
-  // used. When decouple_partitioned_filters=false (original behavior), there is
-  // much more deviation from this target size. See the comment on
-  // decouple_partitioned_filters.
+  // Block size for partitioned metadata. Currently applied to indexes when
+  // kTwoLevelIndexSearch is used and to filters when partition_filters is used.
+  // Note: Since in the current implementation the filters and index partitions
+  // are aligned, an index/filter block is created when either index or filter
+  // block size reaches the specified limit.
+  // Note: this limit is currently applied to only index blocks; a filter
+  // partition is cut right after an index block is cut
+  // TODO(myabandeh): remove the note above when filter partitions are cut
+  // separately
   uint64_t metadata_block_size = 4096;
 
   // `cache_usage_options` allows users to specify the default
@@ -394,23 +398,6 @@ struct BlockBasedTableOptions {
   // block cache even when cache_index_and_filter_blocks=false.
   bool partition_filters = false;
 
-  // When both partitioned indexes and partitioned filters are enabled,
-  // this enables independent partitioning boundaries between the two. Most
-  // notably, this enables these metadata blocks to hit their target size much
-  // more accurately, as there is often a disparity between index sizes and
-  // filter sizes. This should reduce fragmentation and metadata overheads in
-  // the block cache, as well as treat blocks more fairly for cache eviction
-  // purposes.
-  //
-  // There are no SST format compatibility issues with this option. (All
-  // versions of RocksDB able to read partitioned filters are able to read
-  // decoupled partitioned filters.)
-  //
-  // decouple_partitioned_filters = false is the original behavior, because of
-  // limitations in the initial implementation, and the new behavior
-  // decouple_partitioned_filters = true is expected to become the new default.
-  bool decouple_partitioned_filters = false;
-
   // Option to generate Bloom/Ribbon filters that minimize memory
   // internal fragmentation.
   //
@@ -692,11 +679,6 @@ struct BlockBasedTablePropertyNames {
   static const std::string kWholeKeyFiltering;
   // value is "1" for true and "0" for false.
   static const std::string kPrefixFiltering;
-  // Set to "1" when partitioned filters are decoupled from partitioned indexes.
-  // This metadata is recorded in case a read-time optimization for coupled
-  // filter+index partitioning is ever developed; that optimization/assumption
-  // would be disabled when this is set.
-  static const std::string kDecoupledPartitionedFilters;
 };
 
 // Create default block based table factory.

include/rocksdb/table_properties.h

@@ -125,8 +125,6 @@ class TablePropertiesCollector {
   // Finish() will be called when a table has already been built and is ready
   // for writing the properties block.
   // It will be called only once by RocksDB internal.
-  // When the returned Status is not OK, the collected properties will not be
-  // written to the file's property block.
   //
   // @params properties  User will add their collected statistics to
   // `properties`.

include/rocksdb/types.h

@@ -110,16 +110,4 @@ enum class WriteStallCondition {
   kNormal,
 };
 
-// Temperature of a file. Used to pass to FileSystem for a different
-// placement and/or coding.
-// Reserve some numbers in the middle, in case we need to insert new tier
-// there.
-enum class Temperature : uint8_t {
-  kUnknown = 0,
-  kHot = 0x04,
-  kWarm = 0x08,
-  kCold = 0x0C,
-  kLastTemperature,
-};
-
 }  // namespace ROCKSDB_NAMESPACE

include/rocksdb/utilities/transaction_db.h

@@ -235,11 +235,6 @@ struct TransactionDBOptions {
                      const Slice& /*key*/)>
       rollback_deletion_type_callback;
 
-  // A flag to control for the whole DB whether user-defined timestamp based
-  // validation are enabled when applicable. Only WriteCommittedTxn support
-  // user-defined timestamps so this option only applies in this case.
-  bool enable_udt_validation = true;
-
  private:
   // 128 entries
   // Should the default value change, please also update wp_snapshot_cache_bits
@@ -323,22 +318,6 @@ struct TransactionOptions {
   // description. If a negative value is specified, then the default value from
   // TransactionDBOptions is used.
   int64_t write_batch_flush_threshold = -1;
-
-  // DO NOT USE.
-  // This is only a temporary option dedicated for MyRocks that will soon be
-  // removed.
-  // In normal use cases, meta info like column family's timestamp size is
-  // tracked at the transaction layer, so it's not necessary and even
-  // detrimental to track such info inside the internal WriteBatch because it
-  // may let anti-patterns like bypassing Transaction write APIs and directly
-  // write to its internal `WriteBatch` retrieved like this:
-  // https://github.com/facebook/mysql-5.6/blob/fb-mysql-8.0.32/storage/rocksdb/ha_rocksdb.cc#L4949-L4950
-  // Setting this option to true will keep aforementioned use case continue to
-  // work before it's refactored out.
-  // When this flag is enabled, we also intentionally only track the timestamp
-  // size in APIs that MyRocks currently are using, including Put, Merge, Delete
-  // DeleteRange, SingleDelete.
-  bool write_batch_track_timestamp_size = false;
 };
 
 // The per-write optimizations that do not involve transactions. TransactionDB

include/rocksdb/version.h

@@ -12,7 +12,7 @@
 // NOTE: in 'main' development branch, this should be the *next*
 // minor or major version number planned for release.
 #define ROCKSDB_MAJOR 9
-#define ROCKSDB_MINOR 6
+#define ROCKSDB_MINOR 5
 #define ROCKSDB_PATCH 2
 
 // Do not use these. We made the mistake of declaring macros starting with

include/rocksdb/write_batch.h

@@ -30,7 +30,7 @@
 #include <functional>
 #include <memory>
 #include <string>
-#include <unordered_map>
+#include <vector>
 
 #include "rocksdb/status.h"
 #include "rocksdb/write_batch_base.h"
@@ -437,30 +437,6 @@ class WriteBatch : public WriteBatchBase {
   Status UpdateTimestamps(const Slice& ts,
                           std::function<size_t(uint32_t /*cf*/)> ts_sz_func);
 
-  // TODO: remove these internal APIs after MyRocks refactor to not directly
-  // write to a `WriteBatch` retrieved from `Transaction` via
-  // `Transaction::GetWriteBatch`.
-
-  void SetTrackTimestampSize(bool track_timestamp_size) {
-    track_timestamp_size_ = track_timestamp_size;
-  }
-
-  inline void MaybeTrackTimestampSize(uint32_t column_family_id, size_t ts_sz) {
-    if (!track_timestamp_size_) {
-      return;
-    }
-    auto iter = cf_id_to_ts_sz_.find(column_family_id);
-    if (iter == cf_id_to_ts_sz_.end()) {
-      cf_id_to_ts_sz_.emplace(column_family_id, ts_sz);
-    }
-  }
-
-  // Return a mapping from column family id to timestamp size of all the column
-  // families involved in this WriteBatch.
-  const std::unordered_map<uint32_t, size_t>& GetColumnFamilyToTimestampSize() {
-    return cf_id_to_ts_sz_;
-  }
-
   // Verify the per-key-value checksums of this write batch.
   // Corruption status will be returned if the verification fails.
   // If this write batch does not have per-key-value checksum,
@@ -535,10 +511,6 @@ class WriteBatch : public WriteBatchBase {
 
   size_t default_cf_ts_sz_ = 0;
 
-  bool track_timestamp_size_ = false;
-
-  std::unordered_map<uint32_t, size_t> cf_id_to_ts_sz_;
-
  protected:
   std::string rep_;  // See comment in write_batch.cc for the format of rep_
 };

memtable/inlineskiplist.h

@@ -52,7 +52,6 @@
 #include "port/likely.h"
 #include "port/port.h"
 #include "rocksdb/slice.h"
-#include "test_util/sync_point.h"
 #include "util/coding.h"
 #include "util/random.h"
 
@@ -170,20 +169,13 @@ class InlineSkipList {
     // REQUIRES: Valid()
     void Next();
 
-    [[nodiscard]] Status NextAndValidate(bool allow_data_in_errors);
-
     // Advances to the previous position.
     // REQUIRES: Valid()
     void Prev();
 
-    [[nodiscard]] Status PrevAndValidate(bool allow_data_in_errors);
-
     // Advance to the first entry with a key >= target
     void Seek(const char* target);
 
-    [[nodiscard]] Status SeekAndValidate(const char* target,
-                                         bool allow_data_in_errors);
-
     // Retreat to the last entry with a key <= target
     void SeekForPrev(const char* target);
 
@@ -245,20 +237,21 @@ class InlineSkipList {
   bool KeyIsAfterNode(const DecodedKey& key, Node* n) const;
 
   // Returns the earliest node with a key >= key.
-  // Returns nullptr if there is no such node.
-  // @param out_of_order_node If not null, will validate the order of visited
-  // nodes. If a pair of out-of-order nodes n1 and n2 are found, n1 will be
-  // returned and *out_of_order_node will be set to n2.
-  Node* FindGreaterOrEqual(const char* key, Node** out_of_order_node) const;
+  // Return nullptr if there is no such node.
+  Node* FindGreaterOrEqual(const char* key) const;
 
-  // Returns the latest node with a key < key.
-  // Returns head_ if there is no such node.
+  // Return the latest node with a key < key.
+  // Return head_ if there is no such node.
   // Fills prev[level] with pointer to previous node at "level" for every
   // level in [0..max_height_-1], if prev is non-null.
-  // @param out_of_order_node If not null, will validate the order of visited
-  // nodes. If a pair of out-of-order nodes n1 and n2 are found, n1 will be
-  // returned and *out_of_order_node will be set to n2.
-  Node* FindLessThan(const char* key, Node** out_of_order_node) const;
+  Node* FindLessThan(const char* key, Node** prev = nullptr) const;
+
+  // Return the latest node with a key < key on bottom_level. Start searching
+  // from root node on the level below top_level.
+  // Fills prev[level] with pointer to previous node at "level" for every
+  // level in [bottom_level..top_level-1], if prev is non-null.
+  Node* FindLessThan(const char* key, Node** prev, Node* root, int top_level,
+                     int bottom_level) const;
 
   // Return the last node in the list.
   // Return head_ if list is empty.
@@ -281,8 +274,6 @@ class InlineSkipList {
   // lowest_level (inclusive).
   void RecomputeSpliceLevels(const DecodedKey& key, Splice* splice,
                              int recompute_level);
-
-  static Status Corruption(Node* prev, Node* next, bool allow_data_in_errors);
 };
 
 // Implementation details follow
@@ -401,68 +392,20 @@ inline void InlineSkipList<Comparator>::Iterator::Next() {
   node_ = node_->Next(0);
 }
 
-template <class Comparator>
-inline Status InlineSkipList<Comparator>::Iterator::NextAndValidate(
-    bool allow_data_in_errors) {
-  assert(Valid());
-  Node* prev_node = node_;
-  node_ = node_->Next(0);
-  // Verify that keys are increasing.
-  if (prev_node != list_->head_ && node_ != nullptr &&
-      list_->compare_(prev_node->Key(), node_->Key()) >= 0) {
-    Node* node = node_;
-    // invalidates the iterator
-    node_ = nullptr;
-    return Corruption(prev_node, node, allow_data_in_errors);
-  }
-  return Status::OK();
-}
-
 template <class Comparator>
 inline void InlineSkipList<Comparator>::Iterator::Prev() {
   // Instead of using explicit "prev" links, we just search for the
   // last node that falls before key.
   assert(Valid());
-  node_ = list_->FindLessThan(node_->Key(), nullptr);
+  node_ = list_->FindLessThan(node_->Key());
   if (node_ == list_->head_) {
     node_ = nullptr;
   }
 }
 
-template <class Comparator>
-inline Status InlineSkipList<Comparator>::Iterator::PrevAndValidate(
-    const bool allow_data_in_errors) {
-  assert(Valid());
-  // Skip list validation is done in FindLessThan().
-  Node* out_of_order_node = nullptr;
-  node_ = list_->FindLessThan(node_->Key(), &out_of_order_node);
-  if (out_of_order_node) {
-    Node* node = node_;
-    node_ = nullptr;
-    return Corruption(node, out_of_order_node, allow_data_in_errors);
-  }
-  if (node_ == list_->head_) {
-    node_ = nullptr;
-  }
-  return Status::OK();
-}
-
 template <class Comparator>
 inline void InlineSkipList<Comparator>::Iterator::Seek(const char* target) {
-  node_ = list_->FindGreaterOrEqual(target, nullptr);
-}
-
-template <class Comparator>
-inline Status InlineSkipList<Comparator>::Iterator::SeekAndValidate(
-    const char* target, const bool allow_data_in_errors) {
-  Node* out_of_order_node = nullptr;
-  node_ = list_->FindGreaterOrEqual(target, &out_of_order_node);
-  if (out_of_order_node) {
-    Node* node = node_;
-    node_ = nullptr;
-    return Corruption(node, out_of_order_node, allow_data_in_errors);
-  }
-  return Status::OK();
+  node_ = list_->FindGreaterOrEqual(target);
 }
 
 template <class Comparator>
@@ -505,7 +448,6 @@ int InlineSkipList<Comparator>::RandomHeight() {
          rnd->Next() < kScaledInverseBranching_) {
     height++;
   }
-  TEST_SYNC_POINT_CALLBACK("InlineSkipList::RandomHeight::height", &height);
   assert(height > 0);
   assert(height <= kMaxHeight_);
   assert(height <= kMaxPossibleHeight);
@@ -530,8 +472,7 @@ bool InlineSkipList<Comparator>::KeyIsAfterNode(const DecodedKey& key,
 
 template <class Comparator>
 typename InlineSkipList<Comparator>::Node*
-InlineSkipList<Comparator>::FindGreaterOrEqual(
-    const char* key, Node** const out_of_order_node) const {
+InlineSkipList<Comparator>::FindGreaterOrEqual(const char* key) const {
   // Note: It looks like we could reduce duplication by implementing
   // this function as FindLessThan(key)->Next(0), but we wouldn't be able
   // to exit early on equality and the result wouldn't even be correct.
@@ -545,11 +486,6 @@ InlineSkipList<Comparator>::FindGreaterOrEqual(
     Node* next = x->Next(level);
     if (next != nullptr) {
       PREFETCH(next->Next(level), 0, 1);
-      if (out_of_order_node && x != head_ &&
-          compare_(x->Key(), next->Key()) >= 0) {
-        *out_of_order_node = next;
-        return x;
-      }
     }
     // Make sure the lists are sorted
     assert(x == head_ || next == nullptr || KeyIsAfterNode(next->Key(), x));
@@ -573,11 +509,18 @@ InlineSkipList<Comparator>::FindGreaterOrEqual(
 
 template <class Comparator>
 typename InlineSkipList<Comparator>::Node*
-InlineSkipList<Comparator>::FindLessThan(const char* key,
-                                         Node** const out_of_order_node) const {
-  int level = GetMaxHeight() - 1;
-  assert(level >= 0);
-  Node* x = head_;
+InlineSkipList<Comparator>::FindLessThan(const char* key, Node** prev) const {
+  return FindLessThan(key, prev, head_, GetMaxHeight(), 0);
+}
+
+template <class Comparator>
+typename InlineSkipList<Comparator>::Node*
+InlineSkipList<Comparator>::FindLessThan(const char* key, Node** prev,
+                                         Node* root, int top_level,
+                                         int bottom_level) const {
+  assert(top_level > bottom_level);
+  int level = top_level - 1;
+  Node* x = root;
   // KeyIsAfter(key, last_not_after) is definitely false
   Node* last_not_after = nullptr;
   const DecodedKey key_decoded = compare_.decode_key(key);
@@ -586,11 +529,6 @@ InlineSkipList<Comparator>::FindLessThan(const char* key,
     Node* next = x->Next(level);
     if (next != nullptr) {
       PREFETCH(next->Next(level), 0, 1);
-      if (out_of_order_node && x != head_ &&
-          compare_(x->Key(), next->Key()) >= 0) {
-        *out_of_order_node = next;
-        return x;
-      }
     }
     assert(x == head_ || next == nullptr || KeyIsAfterNode(next->Key(), x));
     assert(x == head_ || KeyIsAfterNode(key_decoded, x));
@@ -599,7 +537,10 @@ InlineSkipList<Comparator>::FindLessThan(const char* key,
       assert(next != nullptr);
       x = next;
     } else {
-      if (level == 0) {
+      if (prev != nullptr) {
+        prev[level] = x;
+      }
+      if (level == bottom_level) {
         return x;
       } else {
         // Switch to next list, reuse KeyIsAfterNode() result
@@ -1058,7 +999,7 @@ bool InlineSkipList<Comparator>::Insert(const char* key, Splice* splice,
 
 template <class Comparator>
 bool InlineSkipList<Comparator>::Contains(const char* key) const {
-  Node* x = FindGreaterOrEqual(key, nullptr);
+  Node* x = FindGreaterOrEqual(key);
   if (x != nullptr && Equal(key, x->Key())) {
     return true;
   } else {
@@ -1107,14 +1048,4 @@ void InlineSkipList<Comparator>::TEST_Validate() const {
   }
 }
 
-template <class Comparator>
-Status InlineSkipList<Comparator>::Corruption(Node* prev, Node* next,
-                                              bool allow_data_in_errors) {
-  std::string msg = "Out-of-order keys found in skiplist.";
-  if (allow_data_in_errors) {
-    msg.append(" prev key: " + Slice(prev->Key()).ToString(true));
-    msg.append(" next key: " + Slice(next->Key()).ToString(true));
-  }
-  return Status::Corruption(msg);
-}
 }  // namespace ROCKSDB_NAMESPACE

memtable/skiplistrep.cc

@@ -92,20 +92,6 @@ class SkipListRep : public MemTableRep {
     }
   }
 
-  Status GetAndValidate(const LookupKey& k, void* callback_args,
-                        bool (*callback_func)(void* arg, const char* entry),
-                        bool allow_data_in_errors) override {
-    SkipListRep::Iterator iter(&skip_list_);
-    Slice dummy_slice;
-    Status status = iter.SeekAndValidate(dummy_slice, k.memtable_key().data(),
-                                         allow_data_in_errors);
-    for (; iter.Valid() && status.ok() &&
-           callback_func(callback_args, iter.key());
-         status = iter.NextAndValidate(allow_data_in_errors)) {
-    }
-    return status;
-  }
-
   uint64_t ApproximateNumEntries(const Slice& start_ikey,
                                  const Slice& end_ikey) override {
     std::string tmp;
@@ -195,24 +181,15 @@ class SkipListRep : public MemTableRep {
 
     // Returns the key at the current position.
     // REQUIRES: Valid()
-    const char* key() const override {
-      assert(Valid());
-      return iter_.key();
-    }
+    const char* key() const override { return iter_.key(); }
 
     // Advances to the next position.
     // REQUIRES: Valid()
-    void Next() override {
-      assert(Valid());
-      iter_.Next();
-    }
+    void Next() override { iter_.Next(); }
 
     // Advances to the previous position.
     // REQUIRES: Valid()
-    void Prev() override {
-      assert(Valid());
-      iter_.Prev();
-    }
+    void Prev() override { iter_.Prev(); }
 
     // Advance to the first entry with a key >= target
     void Seek(const Slice& user_key, const char* memtable_key) override {
@@ -242,26 +219,6 @@ class SkipListRep : public MemTableRep {
     // Final state of iterator is Valid() iff list is not empty.
     void SeekToLast() override { iter_.SeekToLast(); }
 
-    Status NextAndValidate(bool allow_data_in_errors) override {
-      assert(Valid());
-      return iter_.NextAndValidate(allow_data_in_errors);
-    }
-
-    Status SeekAndValidate(const Slice& user_key, const char* memtable_key,
-                           bool allow_data_in_errors) override {
-      if (memtable_key != nullptr) {
-        return iter_.SeekAndValidate(memtable_key, allow_data_in_errors);
-      } else {
-        return iter_.SeekAndValidate(EncodeKey(&tmp_, user_key),
-                                     allow_data_in_errors);
-      }
-    }
-
-    Status PrevAndValidate(bool allow_data_in_error) override {
-      assert(Valid());
-      return iter_.PrevAndValidate(allow_data_in_error);
-    }
-
    protected:
     std::string tmp_;  // For passing to EncodeKey
   };

options/cf_options.cc

@@ -531,10 +531,6 @@ static std::unordered_map<std::string, OptionTypeInfo>
          {offsetof(struct MutableCFOptions, block_protection_bytes_per_key),
           OptionType::kUInt8T, OptionVerificationType::kNormal,
           OptionTypeFlags::kMutable}},
-        {"paranoid_memory_checks",
-         {offsetof(struct MutableCFOptions, paranoid_memory_checks),
-          OptionType::kBoolean, OptionVerificationType::kNormal,
-          OptionTypeFlags::kMutable}},
         {kOptNameCompOpts,
          OptionTypeInfo::Struct(
              kOptNameCompOpts, &compression_options_type_info,
@@ -1108,8 +1104,6 @@ void MutableCFOptions::Dump(Logger* log) const {
                  ttl);
   ROCKS_LOG_INFO(log, "              periodic_compaction_seconds: %" PRIu64,
                  periodic_compaction_seconds);
-  ROCKS_LOG_INFO(log, "                   paranoid_memory_checks: %d",
-                 paranoid_memory_checks);
   std::string result;
   char buf[10];
   for (const auto m : max_bytes_for_level_multiplier_additional) {

options/cf_options.h

@@ -168,7 +168,6 @@ struct MutableCFOptions {
         memtable_protection_bytes_per_key(
             options.memtable_protection_bytes_per_key),
         block_protection_bytes_per_key(options.block_protection_bytes_per_key),
-        paranoid_memory_checks(options.paranoid_memory_checks),
         sample_for_compression(
             options.sample_for_compression),  // TODO: is 0 fine here?
         compression_per_level(options.compression_per_level),
@@ -318,7 +317,6 @@ struct MutableCFOptions {
   Temperature default_write_temperature;
   uint32_t memtable_protection_bytes_per_key;
   uint8_t block_protection_bytes_per_key;
-  bool paranoid_memory_checks;
 
   uint64_t sample_for_compression;
   std::vector<CompressionType> compression_per_level;

options/db_options.cc

@@ -576,14 +576,6 @@ static std::unordered_map<std::string, OptionTypeInfo>
          {offsetof(struct ImmutableDBOptions, follower_catchup_retry_wait_ms),
           OptionType::kUInt64T, OptionVerificationType::kNormal,
           OptionTypeFlags::kNone}},
-        {"metadata_write_temperature",
-         {offsetof(struct ImmutableDBOptions, metadata_write_temperature),
-          OptionType::kTemperature, OptionVerificationType::kNormal,
-          OptionTypeFlags::kNone}},
-        {"wal_write_temperature",
-         {offsetof(struct ImmutableDBOptions, wal_write_temperature),
-          OptionType::kTemperature, OptionVerificationType::kNormal,
-          OptionTypeFlags::kNone}},
 };
 
 const std::string OptionsHelper::kDBOptionsName = "DBOptions";
@@ -786,9 +778,7 @@ ImmutableDBOptions::ImmutableDBOptions(const DBOptions& options)
       follower_refresh_catchup_period_ms(
           options.follower_refresh_catchup_period_ms),
       follower_catchup_retry_count(options.follower_catchup_retry_count),
-      follower_catchup_retry_wait_ms(options.follower_catchup_retry_wait_ms),
-      metadata_write_temperature(options.metadata_write_temperature),
-      wal_write_temperature(options.wal_write_temperature) {
+      follower_catchup_retry_wait_ms(options.follower_catchup_retry_wait_ms) {
   fs = env->GetFileSystem();
   clock = env->GetSystemClock().get();
   logger = info_log.get();
@@ -966,10 +956,6 @@ void ImmutableDBOptions::Dump(Logger* log) const {
                    db_host_id.c_str());
   ROCKS_LOG_HEADER(log, "            Options.enforce_single_del_contracts: %s",
                    enforce_single_del_contracts ? "true" : "false");
-  ROCKS_LOG_HEADER(log, "            Options.metadata_write_temperature: %s",
-                   temperature_to_string[metadata_write_temperature].c_str());
-  ROCKS_LOG_HEADER(log, "            Options.wal_write_temperature: %s",
-                   temperature_to_string[wal_write_temperature].c_str());
 }
 
 bool ImmutableDBOptions::IsWalDirSameAsDBPath() const {

options/db_options.h

@@ -103,8 +103,6 @@ struct ImmutableDBOptions {
   uint64_t follower_refresh_catchup_period_ms;
   uint64_t follower_catchup_retry_count;
   uint64_t follower_catchup_retry_wait_ms;
-  Temperature metadata_write_temperature;
-  Temperature wal_write_temperature;
 
   // Beginning convenience/helper objects that are not part of the base
   // DBOptions

options/options_helper.cc

@@ -180,15 +180,6 @@ DBOptions BuildDBOptions(const ImmutableDBOptions& immutable_db_options,
   options.enforce_single_del_contracts =
       immutable_db_options.enforce_single_del_contracts;
   options.daily_offpeak_time_utc = mutable_db_options.daily_offpeak_time_utc;
-  options.follower_refresh_catchup_period_ms =
-      immutable_db_options.follower_refresh_catchup_period_ms;
-  options.follower_catchup_retry_count =
-      immutable_db_options.follower_catchup_retry_count;
-  options.follower_catchup_retry_wait_ms =
-      immutable_db_options.follower_catchup_retry_wait_ms;
-  options.metadata_write_temperature =
-      immutable_db_options.metadata_write_temperature;
-  options.wal_write_temperature = immutable_db_options.wal_write_temperature;
   return options;
 }
 
@@ -222,7 +213,6 @@ void UpdateColumnFamilyOptions(const MutableCFOptions& moptions,
       moptions.memtable_protection_bytes_per_key;
   cf_opts->block_protection_bytes_per_key =
       moptions.block_protection_bytes_per_key;
-  cf_opts->paranoid_memory_checks = moptions.paranoid_memory_checks;
   cf_opts->bottommost_file_compaction_delay =
       moptions.bottommost_file_compaction_delay;
 

options/options_parser.cc

@@ -69,9 +69,8 @@ Status PersistRocksDBOptions(const WriteOptions& write_options,
   }
   std::unique_ptr<FSWritableFile> wf;
 
-  FileOptions file_options;
-  file_options.temperature = db_opt.metadata_write_temperature;
-  Status s = fs->NewWritableFile(file_name, file_options, &wf, nullptr);
+  Status s =
+      fs->NewWritableFile(file_name, FileOptions(), &wf, nullptr);
   if (!s.ok()) {
     return s;
   }

options/options_settable_test.cc

@@ -188,7 +188,6 @@ TEST_F(OptionsSettableTest, BlockBasedTableOptionsAllFieldsSettable) {
       "block_size_deviation=8;block_restart_interval=4; "
       "metadata_block_size=1024;"
       "partition_filters=false;"
-      "decouple_partitioned_filters=true;"
       "optimize_filters_for_memory=true;"
       "use_delta_encoding=true;"
       "index_block_restart_interval=4;"
@@ -367,12 +366,7 @@ TEST_F(OptionsSettableTest, DBOptionsAllFieldsSettable) {
                              "lowest_used_cache_tier=kNonVolatileBlockTier;"
                              "allow_data_in_errors=false;"
                              "enforce_single_del_contracts=false;"
-                             "daily_offpeak_time_utc=08:30-19:00;"
-                             "follower_refresh_catchup_period_ms=123;"
-                             "follower_catchup_retry_count=456;"
-                             "follower_catchup_retry_wait_ms=789;"
-                             "metadata_write_temperature=kCold;"
-                             "wal_write_temperature=kHot;",
+                             "daily_offpeak_time_utc=08:30-19:00;",
                              new_options));
 
   ASSERT_EQ(unset_bytes_base, NumUnsetBytes(new_options_ptr, sizeof(DBOptions),
@@ -573,8 +567,7 @@ TEST_F(OptionsSettableTest, ColumnFamilyOptionsAllFieldsSettable) {
       "block_protection_bytes_per_key=1;"
       "memtable_max_range_deletions=999999;"
       "bottommost_file_compaction_delay=7200;"
-      "uncache_aggressiveness=1234;"
-      "paranoid_memory_checks=1;",
+      "uncache_aggressiveness=1234;",
       new_options));
 
   ASSERT_NE(new_options->blob_cache.get(), nullptr);

port/port.h

@@ -19,19 +19,3 @@
 #elif defined(OS_WIN)
 #include "port/win/port_win.h"
 #endif
-
-#ifdef OS_LINUX
-// A temporary hook into long-running RocksDB threads to support modifying their
-// priority etc. This should become a public API hook once the requirements
-// are better understood.
-extern "C" void RocksDbThreadYield() __attribute__((__weak__));
-#define ROCKSDB_THREAD_YIELD_HOOK() \
-  {                                 \
-    if (RocksDbThreadYield) {       \
-      RocksDbThreadYield();         \
-    }                               \
-  }
-#else
-#define ROCKSDB_THREAD_YIELD_HOOK() \
-  {}
-#endif

table/block_based/block_based_table_builder.cc

@@ -96,8 +96,7 @@ FilterBlockBuilder* CreateFilterBlockBuilder(
           mopt.prefix_extractor.get(), table_opt.whole_key_filtering,
           filter_bits_builder, table_opt.index_block_restart_interval,
           use_delta_encoding_for_index_values, p_index_builder, partition_size,
-          ts_sz, persist_user_defined_timestamps,
-          table_opt.decouple_partitioned_filters);
+          ts_sz, persist_user_defined_timestamps);
     } else {
       return new FullFilterBlockBuilder(mopt.prefix_extractor.get(),
                                         table_opt.whole_key_filtering,
@@ -214,11 +213,10 @@ class BlockBasedTableBuilder::BlockBasedTablePropertiesCollector
  public:
   explicit BlockBasedTablePropertiesCollector(
       BlockBasedTableOptions::IndexType index_type, bool whole_key_filtering,
-      bool prefix_filtering, bool decoupled_partitioned_filters)
+      bool prefix_filtering)
       : index_type_(index_type),
         whole_key_filtering_(whole_key_filtering),
-        prefix_filtering_(prefix_filtering),
-        decoupled_partitioned_filters_(decoupled_partitioned_filters) {}
+        prefix_filtering_(prefix_filtering) {}
 
   Status InternalAdd(const Slice& /*key*/, const Slice& /*value*/,
                      uint64_t /*file_size*/) override {
@@ -242,11 +240,6 @@ class BlockBasedTableBuilder::BlockBasedTablePropertiesCollector
                         whole_key_filtering_ ? kPropTrue : kPropFalse});
     properties->insert({BlockBasedTablePropertyNames::kPrefixFiltering,
                         prefix_filtering_ ? kPropTrue : kPropFalse});
-    if (decoupled_partitioned_filters_) {
-      properties->insert(
-          {BlockBasedTablePropertyNames::kDecoupledPartitionedFilters,
-           kPropTrue});
-    }
     return Status::OK();
   }
 
@@ -264,7 +257,6 @@ class BlockBasedTableBuilder::BlockBasedTablePropertiesCollector
   BlockBasedTableOptions::IndexType index_type_;
   bool whole_key_filtering_;
   bool prefix_filtering_;
-  bool decoupled_partitioned_filters_;
 };
 
 struct BlockBasedTableBuilder::Rep {
@@ -301,10 +293,9 @@ struct BlockBasedTableBuilder::Rep {
 
   InternalKeySliceTransform internal_prefix_transform;
   std::unique_ptr<IndexBuilder> index_builder;
-  std::string index_separator_scratch;
   PartitionedIndexBuilder* p_index_builder_ = nullptr;
 
-  std::string last_ikey;  // Internal key or empty (unset)
+  std::string last_key;
   const Slice* first_key_in_next_block = nullptr;
   CompressionType compression_type;
   uint64_t sample_for_compression;
@@ -602,8 +593,7 @@ struct BlockBasedTableBuilder::Rep {
     table_properties_collectors.emplace_back(
         new BlockBasedTablePropertiesCollector(
             table_options.index_type, table_options.whole_key_filtering,
-            prefix_extractor != nullptr,
-            table_options.decouple_partitioned_filters));
+            prefix_extractor != nullptr));
     if (ts_sz > 0 && persist_user_defined_timestamps) {
       table_properties_collectors.emplace_back(
           new TimestampTablePropertiesCollector(
@@ -663,7 +653,6 @@ struct BlockBasedTableBuilder::Rep {
 };
 
 struct BlockBasedTableBuilder::ParallelCompressionRep {
-  // TODO: consider replacing with autovector or similar
   // Keys is a wrapper of vector of strings avoiding
   // releasing string memories during vector clear()
   // in order to save memory allocation overhead
@@ -1008,24 +997,24 @@ BlockBasedTableBuilder::~BlockBasedTableBuilder() {
   delete rep_;
 }
 
-void BlockBasedTableBuilder::Add(const Slice& ikey, const Slice& value) {
+void BlockBasedTableBuilder::Add(const Slice& key, const Slice& value) {
   Rep* r = rep_;
   assert(rep_->state != Rep::State::kClosed);
   if (!ok()) {
     return;
   }
-  ValueType value_type = ExtractValueType(ikey);
+  ValueType value_type = ExtractValueType(key);
   if (IsValueType(value_type)) {
 #ifndef NDEBUG
     if (r->props.num_entries > r->props.num_range_deletions) {
-      assert(r->internal_comparator.Compare(ikey, Slice(r->last_ikey)) > 0);
+      assert(r->internal_comparator.Compare(key, Slice(r->last_key)) > 0);
     }
 #endif  // !NDEBUG
 
-    auto should_flush = r->flush_block_policy->Update(ikey, value);
+    auto should_flush = r->flush_block_policy->Update(key, value);
     if (should_flush) {
       assert(!r->data_block.empty());
-      r->first_key_in_next_block = &ikey;
+      r->first_key_in_next_block = &key;
       Flush();
       if (r->state == Rep::State::kBuffered) {
         bool exceeds_buffer_limit =
@@ -1060,9 +1049,8 @@ void BlockBasedTableBuilder::Add(const Slice& ikey, const Slice& value) {
         if (r->IsParallelCompressionEnabled()) {
           r->pc_rep->curr_block_keys->Clear();
         } else {
-          r->index_builder->AddIndexEntry(r->last_ikey, &ikey,
-                                          r->pending_handle,
-                                          &r->index_separator_scratch);
+          r->index_builder->AddIndexEntry(&r->last_key, &key,
+                                          r->pending_handle);
         }
       }
     }
@@ -1071,31 +1059,27 @@ void BlockBasedTableBuilder::Add(const Slice& ikey, const Slice& value) {
     // builder after being added to index builder.
     if (r->state == Rep::State::kUnbuffered) {
       if (r->IsParallelCompressionEnabled()) {
-        r->pc_rep->curr_block_keys->PushBack(ikey);
+        r->pc_rep->curr_block_keys->PushBack(key);
       } else {
         if (r->filter_builder != nullptr) {
-          r->filter_builder->AddWithPrevKey(
-              ExtractUserKeyAndStripTimestamp(ikey, r->ts_sz),
-              r->last_ikey.empty()
-                  ? Slice{}
-                  : ExtractUserKeyAndStripTimestamp(r->last_ikey, r->ts_sz));
+          r->filter_builder->Add(
+              ExtractUserKeyAndStripTimestamp(key, r->ts_sz));
         }
       }
     }
 
-    r->data_block.AddWithLastKey(ikey, value, r->last_ikey);
-    r->last_ikey.assign(ikey.data(), ikey.size());
-    assert(!r->last_ikey.empty());
+    r->data_block.AddWithLastKey(key, value, r->last_key);
+    r->last_key.assign(key.data(), key.size());
     if (r->state == Rep::State::kBuffered) {
       // Buffered keys will be replayed from data_block_buffers during
       // `Finish()` once compression dictionary has been finalized.
     } else {
       if (!r->IsParallelCompressionEnabled()) {
-        r->index_builder->OnKeyAdded(ikey);
+        r->index_builder->OnKeyAdded(key);
       }
     }
     // TODO offset passed in is not accurate for parallel compression case
-    NotifyCollectTableCollectorsOnAdd(ikey, value, r->get_offset(),
+    NotifyCollectTableCollectorsOnAdd(key, value, r->get_offset(),
                                       r->table_properties_collectors,
                                       r->ioptions.logger);
 
@@ -1109,9 +1093,9 @@ void BlockBasedTableBuilder::Add(const Slice& ikey, const Slice& value) {
     if (r->ts_sz > 0 && !r->persist_user_defined_timestamps) {
       persisted_end = StripTimestampFromUserKey(value, r->ts_sz);
     }
-    r->range_del_block.Add(ikey, persisted_end);
+    r->range_del_block.Add(key, persisted_end);
     // TODO offset passed in is not accurate for parallel compression case
-    NotifyCollectTableCollectorsOnAdd(ikey, value, r->get_offset(),
+    NotifyCollectTableCollectorsOnAdd(key, value, r->get_offset(),
                                       r->table_properties_collectors,
                                       r->ioptions.logger);
   } else {
@@ -1123,7 +1107,7 @@ void BlockBasedTableBuilder::Add(const Slice& ikey, const Slice& value) {
   }
 
   r->props.num_entries++;
-  r->props.raw_key_size += ikey.size();
+  r->props.raw_key_size += key.size();
   if (!r->persist_user_defined_timestamps) {
     r->props.raw_key_size -= r->ts_sz;
   }
@@ -1467,8 +1451,6 @@ void BlockBasedTableBuilder::BGWorkWriteMaybeCompressedBlock() {
   Rep* r = rep_;
   ParallelCompressionRep::BlockRepSlot* slot = nullptr;
   ParallelCompressionRep::BlockRep* block_rep = nullptr;
-  // Starts empty; see FilterBlockBuilder::AddWithPrevKey
-  std::string prev_block_last_key_no_ts;
   while (r->pc_rep->write_queue.pop(slot)) {
     assert(slot != nullptr);
     slot->Take(block_rep);
@@ -1482,20 +1464,13 @@ void BlockBasedTableBuilder::BGWorkWriteMaybeCompressedBlock() {
       continue;
     }
 
-    Slice prev_key_no_ts = prev_block_last_key_no_ts;
     for (size_t i = 0; i < block_rep->keys->Size(); i++) {
       auto& key = (*block_rep->keys)[i];
       if (r->filter_builder != nullptr) {
-        Slice key_no_ts = ExtractUserKeyAndStripTimestamp(key, r->ts_sz);
-        r->filter_builder->AddWithPrevKey(key_no_ts, prev_key_no_ts);
-        prev_key_no_ts = key_no_ts;
+        r->filter_builder->Add(ExtractUserKeyAndStripTimestamp(key, r->ts_sz));
       }
       r->index_builder->OnKeyAdded(key);
     }
-    if (r->filter_builder != nullptr) {
-      prev_block_last_key_no_ts.assign(prev_key_no_ts.data(),
-                                       prev_key_no_ts.size());
-    }
 
     r->pc_rep->file_size_estimator.SetCurrBlockUncompSize(
         block_rep->data->size());
@@ -1510,15 +1485,14 @@ void BlockBasedTableBuilder::BGWorkWriteMaybeCompressedBlock() {
     ++r->props.num_data_blocks;
 
     if (block_rep->first_key_in_next_block == nullptr) {
-      r->index_builder->AddIndexEntry(block_rep->keys->Back(), nullptr,
-                                      r->pending_handle,
-                                      &r->index_separator_scratch);
+      r->index_builder->AddIndexEntry(&(block_rep->keys->Back()), nullptr,
+                                      r->pending_handle);
     } else {
       Slice first_key_in_next_block =
           Slice(*block_rep->first_key_in_next_block);
-      r->index_builder->AddIndexEntry(
-          block_rep->keys->Back(), &first_key_in_next_block, r->pending_handle,
-          &r->index_separator_scratch);
+      r->index_builder->AddIndexEntry(&(block_rep->keys->Back()),
+                                      &first_key_in_next_block,
+                                      r->pending_handle);
     }
 
     r->pc_rep->ReapBlock(block_rep);
@@ -1587,13 +1561,6 @@ void BlockBasedTableBuilder::WriteFilterBlock(
     // No filter block needed
     return;
   }
-  if (!rep_->last_ikey.empty()) {
-    // We might have been using AddWithPrevKey, so need PrevKeyBeforeFinish
-    // to be safe. And because we are re-synchronized after buffered/parallel
-    // operation, rep_->last_ikey is accurate.
-    rep_->filter_builder->PrevKeyBeforeFinish(
-        ExtractUserKeyAndStripTimestamp(rep_->last_ikey, rep_->ts_sz));
-  }
   BlockHandle filter_block_handle;
   bool is_partitioned_filter = rep_->table_options.partition_filters;
   if (ok()) {
@@ -1609,10 +1576,9 @@ void BlockBasedTableBuilder::WriteFilterBlock(
       // See FilterBlockBuilder::Finish() for more on the difference in
       // transferred filter data payload among different FilterBlockBuilder
       // subtypes.
-      std::unique_ptr<const char[]> filter_owner;
-      Slice filter_content;
-      s = rep_->filter_builder->Finish(filter_block_handle, &filter_content,
-                                       &filter_owner);
+      std::unique_ptr<const char[]> filter_data;
+      Slice filter_content =
+          rep_->filter_builder->Finish(filter_block_handle, &s, &filter_data);
 
       assert(s.ok() || s.IsIncomplete() || s.IsCorruption());
       if (s.IsCorruption()) {
@@ -2008,10 +1974,6 @@ void BlockBasedTableBuilder::EnterUnbuffered() {
       for (; iter->Valid(); iter->Next()) {
         Slice key = iter->key();
         if (r->filter_builder != nullptr) {
-          // NOTE: AddWithPrevKey here would only save key copying if prev is
-          // pinned (iter->IsKeyPinned()), which is probably rare with delta
-          // encoding. OK to go from Add() here to AddWithPrevKey() in
-          // unbuffered operation.
           r->filter_builder->Add(
               ExtractUserKeyAndStripTimestamp(key, r->ts_sz));
         }
@@ -2025,10 +1987,9 @@ void BlockBasedTableBuilder::EnterUnbuffered() {
         Slice* first_key_in_next_block_ptr = &first_key_in_next_block;
 
         iter->SeekToLast();
-        assert(iter->Valid());
-        r->index_builder->AddIndexEntry(
-            iter->key(), first_key_in_next_block_ptr, r->pending_handle,
-            &r->index_separator_scratch);
+        std::string last_key = iter->key().ToString();
+        r->index_builder->AddIndexEntry(&last_key, first_key_in_next_block_ptr,
+                                        r->pending_handle);
       }
     }
     std::swap(iter, next_block_iter);
@@ -2064,8 +2025,7 @@ Status BlockBasedTableBuilder::Finish() {
     // block, we will finish writing all index entries first.
     if (ok() && !empty_data_block) {
       r->index_builder->AddIndexEntry(
-          r->last_ikey, nullptr /* no next data block */, r->pending_handle,
-          &r->index_separator_scratch);
+          &r->last_key, nullptr /* no next data block */, r->pending_handle);
     }
   }
 

table/block_based/block_based_table_factory.cc

@@ -304,10 +304,6 @@ static std::unordered_map<std::string, OptionTypeInfo>
          {offsetof(struct BlockBasedTableOptions, partition_filters),
           OptionType::kBoolean, OptionVerificationType::kNormal,
           OptionTypeFlags::kNone}},
-        {"decouple_partitioned_filters",
-         {offsetof(struct BlockBasedTableOptions, decouple_partitioned_filters),
-          OptionType::kBoolean, OptionVerificationType::kNormal,
-          OptionTypeFlags::kNone}},
         {"optimize_filters_for_memory",
          {offsetof(struct BlockBasedTableOptions, optimize_filters_for_memory),
           OptionType::kBoolean, OptionVerificationType::kNormal,
@@ -975,8 +971,6 @@ const std::string BlockBasedTablePropertyNames::kWholeKeyFiltering =
     "rocksdb.block.based.table.whole.key.filtering";
 const std::string BlockBasedTablePropertyNames::kPrefixFiltering =
     "rocksdb.block.based.table.prefix.filtering";
-const std::string BlockBasedTablePropertyNames::kDecoupledPartitionedFilters =
-    "rocksdb.block.based.table.decoupled.partitioned.filters";
 const std::string kHashIndexPrefixesBlock = "rocksdb.hashindex.prefixes";
 const std::string kHashIndexPrefixesMetadataBlock =
     "rocksdb.hashindex.metadata";

table/block_based/block_based_table_reader.cc

@@ -680,12 +680,26 @@ Status BlockBasedTable::Open(
   if (s.ok()) {
     s = ReadFooterFromFile(opts, file.get(), *ioptions.fs,
                            prefetch_buffer.get(), file_size, &footer,
-                           kBlockBasedTableMagicNumber, ioptions.stats);
+                           kBlockBasedTableMagicNumber);
+  }
+  // If the footer is corrupted and the FS supports checksum verification and
+  // correction, try reading the footer again
+  if (s.IsCorruption()) {
+    RecordTick(ioptions.statistics.get(), SST_FOOTER_CORRUPTION_COUNT);
+    if (CheckFSFeatureSupport(ioptions.fs.get(),
+                              FSSupportedOps::kVerifyAndReconstructRead)) {
+      IOOptions retry_opts = opts;
+      retry_opts.verify_and_reconstruct_read = true;
+      s = ReadFooterFromFile(retry_opts, file.get(), *ioptions.fs,
+                             prefetch_buffer.get(), file_size, &footer,
+                             kBlockBasedTableMagicNumber);
+      RecordTick(ioptions.stats, FILE_READ_CORRUPTION_RETRY_COUNT);
+      if (s.ok()) {
+        RecordTick(ioptions.stats, FILE_READ_CORRUPTION_RETRY_SUCCESS_COUNT);
+      }
+    }
   }
   if (!s.ok()) {
-    if (s.IsCorruption()) {
-      RecordTick(ioptions.statistics.get(), SST_FOOTER_CORRUPTION_COUNT);
-    }
     return s;
   }
   if (!IsSupportedFormatVersion(footer.format_version())) {

table/block_based/filter_block.h

@@ -52,42 +52,27 @@ class FilterBlockBuilder {
 
   virtual ~FilterBlockBuilder() {}
 
-  // Add a key to current filter.
-  virtual void Add(const Slice& key_without_ts) = 0;
-  // A potentially more efficient version of Add(), though you cannot go back
-  // to Add() after using AddWithPrevKey() on a FilterBlockBuilder.
-  // prev_key_without_ts should be the empty Slice for the first key added
-  // (regardless of comparator; e.g. for bootstrapping delta encoding).
-  // More detail: The previous key is used when filters are key-range
-  // partitioned, and the PartitionedFilterBlockBuilder doesn't need to buffer
-  // the previous key when it is provided by calling this function.
-  virtual void AddWithPrevKey(const Slice& key_without_ts,
-                              const Slice& /*prev_key_without_ts*/) = 0;
-
+  virtual void Add(
+      const Slice& key_without_ts) = 0;  // Add a key to current filter
   virtual bool IsEmpty() const = 0;      // Empty == none added
   // For reporting stats on how many entries the builder considered unique
   virtual size_t EstimateEntriesAdded() = 0;
-
-  // When using AddWithPrevKey, this must be called before Finish(). (May also
-  // be called without AddWithPrevKey, but prev_key_without_ts must be
-  // accurate regardless.)
-  virtual void PrevKeyBeforeFinish(const Slice& /*prev_key_without_ts*/) {}
-
-  // Generate a filter block. Returns OK if finished, or Incomplete if more
-  // filters are needed (partitioned filter). In the latter case, subsequent
-  // calls require the BlockHandle of the most recently generated and written
-  // filter, in last_partition_block_handle.
-  //
-  // If filter_owner is not nullptr, Finish() may transfer ownership of
+  Slice Finish() {  // Generate Filter
+    const BlockHandle empty_handle;
+    Status dont_care_status;
+    auto ret = Finish(empty_handle, &dont_care_status);
+    assert(dont_care_status.ok());
+    return ret;
+  }
+  // If filter_data is not nullptr, Finish() may transfer ownership of
   // underlying filter data to the caller,  so that it can be freed as soon as
   // possible. BlockBasedFilterBlock will ignore this parameter.
   //
-  // For either OK or Incomplete, *filter is set to point to the next filter
-  // bytes, which survive until either this is destroyed, *filter_owner is
-  // destroyed, or next call to Finish.
-  virtual Status Finish(
-      const BlockHandle& last_partition_block_handle, Slice* filter,
-      std::unique_ptr<const char[]>* filter_owner = nullptr) = 0;
+  virtual Slice Finish(
+      const BlockHandle& tmp /* only used in PartitionedFilterBlock as
+                                last_partition_block_handle */
+      ,
+      Status* status, std::unique_ptr<const char[]>* filter_data = nullptr) = 0;
 
   // This is called when finishes using the FilterBitsBuilder
   // in order to release memory usage and cache charge
@@ -100,16 +85,6 @@ class FilterBlockBuilder {
   virtual Status MaybePostVerifyFilter(const Slice& /* filter_content */) {
     return Status::OK();
   }
-
-#ifndef NDEBUG
-  Slice TEST_Finish() {  // Generate Filter
-    const BlockHandle empty_handle;
-    Slice filter;
-    Status status = Finish(empty_handle, &filter);
-    assert(status.ok());
-    return filter;
-  }
-#endif  // NDEBUG
 };
 
 // A FilterBlockReader is used to parse filter from SST table.

table/block_based/filter_policy.cc

@@ -82,32 +82,21 @@ class XXPH3FilterBitsBuilder : public BuiltinFilterBitsBuilder {
     // requirements.
     if (hash_entries_info_.entries.empty() ||
         hash != hash_entries_info_.entries.back()) {
-      AddHash(hash);
-    }
-  }
-
-  void AddKeyAndAlt(const Slice& key, const Slice& alt) override {
-    uint64_t key_hash = GetSliceHash64(key);
-    uint64_t alt_hash = GetSliceHash64(alt);
-    std::optional<uint64_t> prev_key_hash;
-    std::optional<uint64_t> prev_alt_hash = hash_entries_info_.prev_alt_hash;
-    if (!hash_entries_info_.entries.empty()) {
-      prev_key_hash = hash_entries_info_.entries.back();
-    }
-    // Add alt first, so that entries.back() always contains previous key
-    // ASSUMING a change from one alt to the next implies a change to
-    // corresponding key
-    if (alt_hash != prev_alt_hash && alt_hash != key_hash &&
-        alt_hash != prev_key_hash) {
-      AddHash(alt_hash);
-    }
-    // Overwrite prev_alt_hash for cases like alt_hash == key_hash
-    hash_entries_info_.prev_alt_hash = alt_hash;
-    // NOTE: checking key_hash != prev_alt_hash for cases like
-    // key == prefix(key) at the end of a prefix grouping as in reverse
-    // byte-wise comparator
-    if (key_hash != prev_key_hash && key_hash != prev_alt_hash) {
-      AddHash(key_hash);
+      if (detect_filter_construct_corruption_) {
+        hash_entries_info_.xor_checksum ^= hash;
+      }
+      hash_entries_info_.entries.push_back(hash);
+      if (cache_res_mgr_ &&
+          // Traditional rounding to whole bucket size
+          ((hash_entries_info_.entries.size() %
+            kUint64tHashEntryCacheResBucketSize) ==
+           kUint64tHashEntryCacheResBucketSize / 2)) {
+        hash_entries_info_.cache_res_bucket_handles.emplace_back(nullptr);
+        Status s = cache_res_mgr_->MakeCacheReservation(
+            kUint64tHashEntryCacheResBucketSize * sizeof(hash),
+            &hash_entries_info_.cache_res_bucket_handles.back());
+        s.PermitUncheckedError();
+      }
     }
   }
 
@@ -127,24 +116,6 @@ class XXPH3FilterBitsBuilder : public BuiltinFilterBitsBuilder {
           CacheEntryRole::kFilterConstruction>::GetDummyEntrySize() /
       sizeof(uint64_t);
 
-  void AddHash(uint64_t hash) {
-    if (detect_filter_construct_corruption_) {
-      hash_entries_info_.xor_checksum ^= hash;
-    }
-    hash_entries_info_.entries.push_back(hash);
-    if (cache_res_mgr_ &&
-        // Traditional rounding to whole bucket size
-        ((hash_entries_info_.entries.size() %
-          kUint64tHashEntryCacheResBucketSize) ==
-         kUint64tHashEntryCacheResBucketSize / 2)) {
-      hash_entries_info_.cache_res_bucket_handles.emplace_back(nullptr);
-      Status s = cache_res_mgr_->MakeCacheReservation(
-          kUint64tHashEntryCacheResBucketSize * sizeof(hash),
-          &hash_entries_info_.cache_res_bucket_handles.back());
-      s.PermitUncheckedError();
-    }
-  }
-
   // For delegating between XXPH3FilterBitsBuilders
   void SwapEntriesWith(XXPH3FilterBitsBuilder* other) {
     assert(other != nullptr);
@@ -295,15 +266,6 @@ class XXPH3FilterBitsBuilder : public BuiltinFilterBitsBuilder {
   bool detect_filter_construct_corruption_;
 
   struct HashEntriesInfo {
-#ifdef ROCKSDB_VALGRIND_RUN
-    HashEntriesInfo() {
-      // Valgrind can report uninitialized FPs on std::optional usage. See e.g.
-      // https://stackoverflow.com/q/51616179
-      std::memset((void*)&prev_alt_hash, 0, sizeof(prev_alt_hash));
-      prev_alt_hash = {};
-    }
-#endif
-
     // A deque avoids unnecessary copying of already-saved values
     // and has near-minimal peak memory use.
     std::deque<uint64_t> entries;
@@ -320,22 +282,17 @@ class XXPH3FilterBitsBuilder : public BuiltinFilterBitsBuilder {
     // Otherwise, it is 0.
     uint64_t xor_checksum = 0;
 
-    // A single-element cache to help AddKeyAndAlt
-    std::optional<uint64_t> prev_alt_hash;
-
     void Swap(HashEntriesInfo* other) {
       assert(other != nullptr);
       std::swap(entries, other->entries);
       std::swap(cache_res_bucket_handles, other->cache_res_bucket_handles);
       std::swap(xor_checksum, other->xor_checksum);
-      std::swap(prev_alt_hash, other->prev_alt_hash);
     }
 
     void Reset() {
       entries.clear();
       cache_res_bucket_handles.clear();
       xor_checksum = 0;
-      prev_alt_hash = {};
     }
   };
 
@@ -374,14 +331,6 @@ class FastLocalBloomBitsBuilder : public XXPH3FilterBitsBuilder {
 
   Slice Finish(std::unique_ptr<const char[]>* buf, Status* status) override {
     size_t num_entries = hash_entries_info_.entries.size();
-    if (num_entries == 0) {
-      // This case migrated from FullFilterBlockBuilder::Finish
-      if (status) {
-        *status = Status::OK();
-      }
-      return FinishAlwaysFalse(buf);
-    }
-
     size_t len_with_metadata = CalculateSpace(num_entries);
 
     std::unique_ptr<char[]> mutable_buf;
@@ -1074,7 +1023,6 @@ class LegacyBloomBitsBuilder : public BuiltinFilterBitsBuilder {
   ~LegacyBloomBitsBuilder() override;
 
   void AddKey(const Slice& key) override;
-  void AddKeyAndAlt(const Slice& key, const Slice& alt) override;
 
   size_t EstimateEntriesAdded() override { return hash_entries_.size(); }
 
@@ -1102,9 +1050,6 @@ class LegacyBloomBitsBuilder : public BuiltinFilterBitsBuilder {
   int bits_per_key_;
   int num_probes_;
   std::vector<uint32_t> hash_entries_;
-  // A single-element cache to help AddKeyAndAlt. (-1 == empty)
-  int64_t prev_alt_hash_ = -1;
-
   Logger* info_log_;
 
   // Get totalbits that optimized for cpu cache line
@@ -1134,39 +1079,14 @@ LegacyBloomBitsBuilder::~LegacyBloomBitsBuilder() = default;
 
 void LegacyBloomBitsBuilder::AddKey(const Slice& key) {
   uint32_t hash = BloomHash(key);
-  if (hash_entries_.empty() || hash_entries_.back() != hash) {
+  if (hash_entries_.size() == 0 || hash != hash_entries_.back()) {
     hash_entries_.push_back(hash);
   }
 }
 
-void LegacyBloomBitsBuilder::AddKeyAndAlt(const Slice& key, const Slice& alt) {
-  // Modified from XXPH3FilterBitsBuilder::AddKeyAndAlt
-  uint32_t key_hash = BloomHash(key);
-  uint32_t alt_hash = BloomHash(alt);
-
-  int64_t prev_key_hash = -1;
-  int64_t prev_alt_hash = prev_alt_hash_;
-  if (!hash_entries_.empty()) {
-    prev_key_hash = hash_entries_.back();
-  }
-  if (alt_hash != prev_alt_hash && alt_hash != key_hash &&
-      alt_hash != prev_key_hash) {
-    hash_entries_.push_back(alt_hash);
-  }
-  prev_alt_hash_ = alt_hash;
-  if (key_hash != prev_key_hash && key_hash != prev_alt_hash) {
-    hash_entries_.push_back(key_hash);
-  }
-}
-
 Slice LegacyBloomBitsBuilder::Finish(std::unique_ptr<const char[]>* buf) {
-  size_t num_entries = hash_entries_.size();
-  if (num_entries == 0) {
-    // This case migrated from FullFilterBlockBuilder::Finish
-    return FinishAlwaysFalse(buf);
-  }
-
   uint32_t total_bits, num_lines;
+  size_t num_entries = hash_entries_.size();
   char* data =
       ReserveSpace(static_cast<int>(num_entries), &total_bits, &num_lines);
   assert(data);
@@ -1207,7 +1127,6 @@ Slice LegacyBloomBitsBuilder::Finish(std::unique_ptr<const char[]>* buf) {
   const char* const_data = data;
   buf->reset(const_data);
   hash_entries_.clear();
-  prev_alt_hash_ = -1;
 
   return Slice(data, total_bits / 8 + kMetadataLen);
 }

table/block_based/filter_policy_internal.h

@@ -31,22 +31,10 @@ class FilterBitsBuilder {
   // added.
   virtual void AddKey(const Slice& key) = 0;
 
-  // Add two entries to the filter, typically a key and, as the alternate,
-  // its prefix. This differs from AddKey(key); AddKey(alt); in that there
-  // is extra state for de-duplicating successive `alt` entries, as well
-  // as successive `key` entries. And there is de-duplication between `key`
-  // and `alt` entries, even in adjacent calls, because a whole key might
-  // be its own prefix. More specifically,
-  //  AddKey(k1);
-  //  AddKeyAndAlt(k2, a2);  // de-dup k2<>k1, k2<>a2, a2<>k1
-  //  AddKeyAndAlt(k3, a3);  // de-dup k3<>k2, a3<>a2, k3<>a2, a3<>k2
-  //  AddKey(k4);            // de-dup k4<>k3 BUT NOT k4<>a3
-  virtual void AddKeyAndAlt(const Slice& key, const Slice& alt) = 0;
-
   // Called by RocksDB before Finish to populate
   // TableProperties::num_filter_entries, so should represent the
-  // number of unique keys (and/or prefixes) added. MUST return 0
-  // if and only if none have been added, but otherwise can be estimated.
+  // number of unique keys (and/or prefixes) added, but does not have
+  // to be exact. `return 0;` may be used to conspicuously indicate "unknown".
   virtual size_t EstimateEntriesAdded() = 0;
 
   // Generate the filter using the keys that are added

table/block_based/full_filter_block.cc

@@ -20,8 +20,13 @@ namespace ROCKSDB_NAMESPACE {
 FullFilterBlockBuilder::FullFilterBlockBuilder(
     const SliceTransform* _prefix_extractor, bool whole_key_filtering,
     FilterBitsBuilder* filter_bits_builder)
-    : prefix_extractor_(_prefix_extractor),
-      whole_key_filtering_(whole_key_filtering) {
+    : need_last_prefix_(whole_key_filtering && _prefix_extractor != nullptr),
+      prefix_extractor_(_prefix_extractor),
+      whole_key_filtering_(whole_key_filtering),
+      last_whole_key_recorded_(false),
+      last_prefix_recorded_(false),
+      last_key_in_domain_(false),
+      any_added_(false) {
   assert(filter_bits_builder != nullptr);
   filter_bits_builder_.reset(filter_bits_builder);
 }
@@ -30,31 +35,96 @@ size_t FullFilterBlockBuilder::EstimateEntriesAdded() {
   return filter_bits_builder_->EstimateEntriesAdded();
 }
 
-void FullFilterBlockBuilder::AddWithPrevKey(
-    const Slice& key_without_ts, const Slice& /*prev_key_without_ts*/) {
-  FullFilterBlockBuilder::Add(key_without_ts);
-}
-
 void FullFilterBlockBuilder::Add(const Slice& key_without_ts) {
-  if (prefix_extractor_ && prefix_extractor_->InDomain(key_without_ts)) {
-    Slice prefix = prefix_extractor_->Transform(key_without_ts);
-    if (whole_key_filtering_) {
-      filter_bits_builder_->AddKeyAndAlt(key_without_ts, prefix);
+  const bool add_prefix =
+      prefix_extractor_ && prefix_extractor_->InDomain(key_without_ts);
+
+  if (need_last_prefix_ && !last_prefix_recorded_ && last_key_in_domain_) {
+    // We can reach here when a new filter partition starts in partitioned
+    // filter. The last prefix in the previous partition should be added if
+    // necessary regardless of key_without_ts, to support prefix SeekForPrev.
+    AddKey(last_prefix_str_);
+    last_prefix_recorded_ = true;
+  }
+
+  if (whole_key_filtering_) {
+    if (!add_prefix) {
+      AddKey(key_without_ts);
     } else {
-      filter_bits_builder_->AddKey(prefix);
+      // if both whole_key and prefix are added to bloom then we will have whole
+      // key_without_ts and prefix addition being interleaved and thus cannot
+      // rely on the bits builder to properly detect the duplicates by comparing
+      // with the last item.
+      Slice last_whole_key = Slice(last_whole_key_str_);
+      if (!last_whole_key_recorded_ ||
+          last_whole_key.compare(key_without_ts) != 0) {
+        AddKey(key_without_ts);
+        last_whole_key_recorded_ = true;
+        last_whole_key_str_.assign(key_without_ts.data(),
+                                   key_without_ts.size());
+      }
     }
-  } else if (whole_key_filtering_) {
-    filter_bits_builder_->AddKey(key_without_ts);
+  }
+  if (add_prefix) {
+    last_key_in_domain_ = true;
+    AddPrefix(key_without_ts);
+  } else {
+    last_key_in_domain_ = false;
   }
 }
 
-Status FullFilterBlockBuilder::Finish(
-    const BlockHandle& /*last_partition_block_handle*/, Slice* filter,
-    std::unique_ptr<const char[]>* filter_owner) {
-  Status s = Status::OK();
-  *filter = filter_bits_builder_->Finish(
-      filter_owner ? filter_owner : &filter_data_, &s);
-  return s;
+// Add key to filter if needed
+inline void FullFilterBlockBuilder::AddKey(const Slice& key) {
+  filter_bits_builder_->AddKey(key);
+  any_added_ = true;
+}
+
+// Add prefix to filter if needed
+void FullFilterBlockBuilder::AddPrefix(const Slice& key) {
+  assert(prefix_extractor_ && prefix_extractor_->InDomain(key));
+  Slice prefix = prefix_extractor_->Transform(key);
+  if (need_last_prefix_) {
+    // WART/FIXME: Because last_prefix_str_ is needed above to make
+    // SeekForPrev work with partitioned + prefix filters, we are currently
+    // use this inefficient code in that case (in addition to prefix+whole
+    // key). Hopefully this can be optimized with some refactoring up the call
+    // chain to BlockBasedTableBuilder. Even in PartitionedFilterBlockBuilder,
+    // we don't currently have access to the previous key/prefix by the time we
+    // know we are starting a new partition.
+
+    // if both whole_key and prefix are added to bloom then we will have whole
+    // key and prefix addition being interleaved and thus cannot rely on the
+    // bits builder to properly detect the duplicates by comparing with the last
+    // item.
+    Slice last_prefix = Slice(last_prefix_str_);
+    if (!last_prefix_recorded_ || last_prefix.compare(prefix) != 0) {
+      AddKey(prefix);
+      last_prefix_recorded_ = true;
+      last_prefix_str_.assign(prefix.data(), prefix.size());
+    }
+  } else {
+    AddKey(prefix);
+  }
+}
+
+void FullFilterBlockBuilder::Reset() {
+  last_whole_key_recorded_ = false;
+  last_prefix_recorded_ = false;
+}
+
+Slice FullFilterBlockBuilder::Finish(
+    const BlockHandle& /*tmp*/, Status* status,
+    std::unique_ptr<const char[]>* filter_data) {
+  Reset();
+  // In this impl we ignore BlockHandle
+  *status = Status::OK();
+  if (any_added_) {
+    any_added_ = false;
+    Slice filter_content = filter_bits_builder_->Finish(
+        filter_data ? filter_data : &filter_data_, status);
+    return filter_content;
+  }
+  return Slice();
 }
 
 FullFilterBlockReader::FullFilterBlockReader(