Fix the ZStd checksum (#12005 )

Summary: Somehow we had the wrong checksum when validating the ZStd 1.5.5 download for RocksJava in the previous Pull Request - https://github.com/facebook/rocksdb/pull/9304. This PR fixes that. Pull Request resolved: https://github.com/facebook/rocksdb/pull/12005 Reviewed By: jaykorean Differential Revision: D50840338 Pulled By: cbi42 fbshipit-source-id: 8a92779d3bef013d812eecb89aaaf33fc73991ec
Update HISTORY.md and version for 8.7.3
2026-11-07 03:22:34 -05:00 · 2023-10-31 13:22:47 -07:00 · 2023-10-30 14:07:10 -07:00 · 2023-10-30 11:43:56 -07:00 · 2023-10-25 21:20:16 -07:00 · 2023-10-25 20:48:44 -07:00
459 changed files with 5093 additions and 19581 deletions
@@ -54,7 +54,6 @@ commands:
          command: |
            echo "Installing CMake..."
            choco install cmake --installargs 'ADD_CMAKE_TO_PATH=System' -y
-            choco install liberica8jdk -y
            mkdir $Env:THIRDPARTY_HOME
            cd $Env:THIRDPARTY_HOME
            echo "Building Snappy dependency..."
@@ -68,10 +67,9 @@ commands:
      - run:
          name: "Build RocksDB"
          command: |
-            $env:Path = $env:JAVA_HOME + ";" + $env:Path
            mkdir build
            cd build
-            & $Env:CMAKE_BIN -G "$Env:CMAKE_GENERATOR" -DCMAKE_BUILD_TYPE=Debug -DOPTDBG=1 -DPORTABLE="$Env:CMAKE_PORTABLE" -DSNAPPY=1 -DJNI=1 ..
+            & $Env:CMAKE_BIN -G "$Env:CMAKE_GENERATOR" -DCMAKE_BUILD_TYPE=Debug -DOPTDBG=1 -DPORTABLE=1 -DSNAPPY=1 -DJNI=1 ..
            cd ..
            echo "Building with VS version: $Env:CMAKE_GENERATOR"
            msbuild.exe build/rocksdb.sln -maxCpuCount -property:Configuration=Debug -property:Platform=x64
@@ -80,11 +78,6 @@ commands:
          shell: powershell.exe
          command: |
            build_tools\run_ci_db_test.ps1 -SuiteRun arena_test,db_basic_test,db_test,db_test2,db_merge_operand_test,bloom_test,c_test,coding_test,crc32c_test,dynamic_bloom_test,env_basic_test,env_test,hash_test,random_test -Concurrency 16
-      - run:
-          name: "Test RocksJava"
-          command: |
-            cd build\java
-            & $Env:CTEST_BIN -C Debug -j 16
  pre-steps-macos:
      steps:
        - pre-steps
@@ -112,15 +105,6 @@ commands:
          path: /tmp/core_dumps
          when: on_fail

-  post-pmd-steps:
-    steps:
-      - store_artifacts:
-          path: /home/circleci/project/java/target/pmd.xml
-          when: on_fail
-      - store_artifacts:
-          path: /home/circleci/project/java/target/site
-          when: on_fail
-
  upgrade-cmake:
    steps:
      - run:
@@ -143,13 +127,6 @@ commands:
          command: |
            HOMEBREW_NO_AUTO_UPDATE=1 brew install gflags

-  install-maven:
-    steps:
-      - run:
-          name: Install maven
-          command: |
-            sudo apt-get update -y && sudo apt-get install -y maven
-
  setup-folly:
    steps:
      - run:
@@ -568,24 +545,6 @@ jobs:
          no_output_timeout: 100m
      - post-steps

-  build-windows-vs2022-avx2:
-    executor:
-      name: win/server-2022
-      size: 2xlarge
-    environment:
-      THIRDPARTY_HOME: C:/Users/circleci/thirdparty
-      CMAKE_HOME: C:/Program Files/CMake
-      CMAKE_BIN: C:/Program Files/CMake/bin/cmake.exe
-      CTEST_BIN: C:/Program Files/CMake/bin/ctest.exe
-      JAVA_HOME: C:/Program Files/BellSoft/LibericaJDK-8
-      SNAPPY_HOME: C:/Users/circleci/thirdparty/snappy-1.1.8
-      SNAPPY_INCLUDE: C:/Users/circleci/thirdparty/snappy-1.1.8;C:/Users/circleci/thirdparty/snappy-1.1.8/build
-      SNAPPY_LIB_DEBUG: C:/Users/circleci/thirdparty/snappy-1.1.8/build/Debug/snappy.lib
-      CMAKE_GENERATOR: Visual Studio 17 2022
-      CMAKE_PORTABLE: AVX2
-    steps:
-      - windows-build-steps
-
  build-windows-vs2022:
    executor:
      name: win/server-2022
@@ -594,13 +553,10 @@ jobs:
      THIRDPARTY_HOME: C:/Users/circleci/thirdparty
      CMAKE_HOME: C:/Program Files/CMake
      CMAKE_BIN: C:/Program Files/CMake/bin/cmake.exe
-      CTEST_BIN: C:/Program Files/CMake/bin/ctest.exe
-      JAVA_HOME: C:/Program Files/BellSoft/LibericaJDK-8
      SNAPPY_HOME: C:/Users/circleci/thirdparty/snappy-1.1.8
      SNAPPY_INCLUDE: C:/Users/circleci/thirdparty/snappy-1.1.8;C:/Users/circleci/thirdparty/snappy-1.1.8/build
      SNAPPY_LIB_DEBUG: C:/Users/circleci/thirdparty/snappy-1.1.8/build/Debug/snappy.lib
      CMAKE_GENERATOR: Visual Studio 17 2022
-      CMAKE_PORTABLE: 1
    steps:
      - windows-build-steps

@@ -612,13 +568,10 @@ jobs:
      THIRDPARTY_HOME: C:/Users/circleci/thirdparty
      CMAKE_HOME: C:/Program Files/CMake
      CMAKE_BIN: C:/Program Files/CMake/bin/cmake.exe
-      CTEST_BIN: C:/Program Files/CMake/bin/ctest.exe
-      JAVA_HOME: C:/Program Files/BellSoft/LibericaJDK-8
      SNAPPY_HOME: C:/Users/circleci/thirdparty/snappy-1.1.8
      SNAPPY_INCLUDE: C:/Users/circleci/thirdparty/snappy-1.1.8;C:/Users/circleci/thirdparty/snappy-1.1.8/build
      SNAPPY_LIB_DEBUG: C:/Users/circleci/thirdparty/snappy-1.1.8/build/Debug/snappy.lib
      CMAKE_GENERATOR: Visual Studio 16 2019
-      CMAKE_PORTABLE: 1
    steps:
      - windows-build-steps

@@ -639,27 +592,6 @@ jobs:
          command: make V=1 J=8 -j8 jtest
      - post-steps

-  build-linux-java-pmd:
-    machine:
-      image: ubuntu-2004:202111-02
-    resource_class: large
-    environment:
-      JAVA_HOME: /usr/lib/jvm/java-8-openjdk-amd64
-    steps:
-      - install-maven
-      - pre-steps
-      - run:
-          name: "Set Java Environment"
-          command: |
-            echo "JAVA_HOME=${JAVA_HOME}"
-            echo 'export PATH=$JAVA_HOME/bin:$PATH' >> $BASH_ENV
-            which java && java -version
-            which javac && javac -version
-      - run:
-          name: "PMD RocksDBJava"
-          command: make V=1 J=8 -j8 jpmd
-      - post-pmd-steps
-
  build-linux-java-static:
    executor: linux-java-docker
    resource_class: large
@@ -914,6 +846,7 @@ workflows:
      - build-linux-mini-crashtest
  jobs-windows:
    jobs:
+      - build-windows-vs2022
      - build-windows-vs2019
      - build-cmake-mingw
  jobs-java:
@@ -923,7 +856,6 @@ workflows:
      - build-macos-java
      - build-macos-java-static
      - build-macos-java-static-universal
-      - build-linux-java-pmd
  jobs-macos:
    jobs:
      - build-macos
@@ -962,5 +894,3 @@ workflows:
      - build-linux-non-shm
      - build-linux-clang-13-asan-ubsan-with-folly
      - build-linux-valgrind
-      - build-windows-vs2022-avx2
-      - build-windows-vs2022
@@ -772,7 +772,6 @@ set(SOURCES
        options/configurable.cc
        options/customizable.cc
        options/db_options.cc
-        options/offpeak_time_info.cc
        options/options.cc
        options/options_helper.cc
        options/options_parser.cc
@@ -1106,15 +1105,11 @@ set(BUILD_VERSION_CC ${CMAKE_BINARY_DIR}/build_version.cc)
 configure_file(util/build_version.cc.in ${BUILD_VERSION_CC} @ONLY)

 add_library(${ROCKSDB_STATIC_LIB} STATIC ${SOURCES} ${BUILD_VERSION_CC})
-target_include_directories(${ROCKSDB_STATIC_LIB} PUBLIC
-  $<BUILD_INTERFACE:${PROJECT_SOURCE_DIR}/include>)
 target_link_libraries(${ROCKSDB_STATIC_LIB} PRIVATE
  ${THIRDPARTY_LIBS} ${SYSTEM_LIBS})

 if(ROCKSDB_BUILD_SHARED)
  add_library(${ROCKSDB_SHARED_LIB} SHARED ${SOURCES} ${BUILD_VERSION_CC})
-  target_include_directories(${ROCKSDB_SHARED_LIB} PUBLIC
-    $<BUILD_INTERFACE:${PROJECT_SOURCE_DIR}/include>)
  target_link_libraries(${ROCKSDB_SHARED_LIB} PRIVATE
    ${THIRDPARTY_LIBS} ${SYSTEM_LIBS})

@@ -1601,3 +1596,6 @@ option(WITH_BENCHMARK "build benchmark tests" OFF)
 if(WITH_BENCHMARK)
  add_subdirectory(${PROJECT_SOURCE_DIR}/microbench/)
 endif()
+
+target_include_directories(${PROJECT_NAME} PUBLIC
+  $<BUILD_INTERFACE:${PROJECT_SOURCE_DIR}/include>)
@@ -1,98 +1,22 @@
 # Rocksdb Change Log
 > NOTE: Entries for next release do not go here. Follow instructions in `unreleased_history/README.txt`

-## 8.10.2 (02/16/2024)
-* Update zlib to 1.3.1 for Java builds
-
-## 8.10.1 (01/16/2024)
-### Bug Fixes
-* Fix bug in auto_readahead_size that combined with IndexType::kBinarySearchWithFirstKey + fails or iterator lands at a wrong key
-
-## 8.10.0 (12/15/2023)
-### New Features
-* Provide support for async_io to trim readahead_size by doing block cache lookup
-* Added initial wide-column support in `WriteBatchWithIndex`. This includes the `PutEntity` API and support for wide columns in the existing read APIs (`GetFromBatch`, `GetFromBatchAndDB`, `MultiGetFromBatchAndDB`, and `BaseDeltaIterator`).
-
-### Public API Changes
-* Custom implementations of `TablePropertiesCollectorFactory` may now return a `nullptr` collector to decline processing a file, reducing callback overheads in such cases.
-
+## 8.7.3 (10/30/2023)
 ### Behavior Changes
-* Make ReadOptions.auto_readahead_size default true which does prefetching optimizations for forward scans if iterate_upper_bound and block_cache is also specified.
-* Compactions can be scheduled in parallel in an additional scenario: high compaction debt relative to the data size
-* HyperClockCache now has built-in protection against excessive CPU consumption under the extreme stress condition of no (or very few) evictable cache entries, which can slightly increase memory usage such conditions. New option `HyperClockCacheOptions::eviction_effort_cap` controls the space-time trade-off of the response. The default should be generally well-balanced, with no measurable affect on normal operation.
-
-### Bug Fixes
-* Fix a corner case with auto_readahead_size where Prev Operation returns NOT SUPPORTED error when scans direction is changed from forward to backward.
-* Avoid destroying the periodic task scheduler's default timer in order to prevent static destruction order issues.
-* Fix double counting of BYTES_WRITTEN ticker when doing writes with transactions.
-* Fix a WRITE_STALL counter that was reporting wrong value in few cases.
-* A lookup by MultiGet in a TieredCache that goes to the local flash cache and finishes with very low latency, i.e before the subsequent call to WaitAll, is ignored, resulting in a false negative and a memory leak.
-
-### Performance Improvements
-* Java API extensions to improve consistency and completeness of APIs
-1 Extended `RocksDB.get([ColumnFamilyHandle columnFamilyHandle,] ReadOptions opt, ByteBuffer key, ByteBuffer value)` which now accepts indirect buffer parameters as well as direct buffer parameters
-2 Extended `RocksDB.put( [ColumnFamilyHandle columnFamilyHandle,] WriteOptions writeOpts, final ByteBuffer key, final ByteBuffer value)` which now accepts indirect buffer parameters as well as direct buffer parameters
-3 Added `RocksDB.merge([ColumnFamilyHandle columnFamilyHandle,] WriteOptions writeOptions, ByteBuffer key, ByteBuffer value)` methods with the same parameter options as `put(...)` - direct and indirect buffers are supported
-4 Added `RocksIterator.key( byte[] key [, int offset, int len])` methods which retrieve the iterator key into the supplied buffer
-5 Added `RocksIterator.value( byte[] value [, int offset, int len])` methods which retrieve the iterator value into the supplied buffer
-6 Deprecated `get(final ColumnFamilyHandle columnFamilyHandle, final ReadOptions readOptions, byte[])` in favour of `get(final ReadOptions readOptions, final ColumnFamilyHandle columnFamilyHandle, byte[])` which has consistent parameter ordering with other methods in the same class
-7 Added `Transaction.get( ReadOptions opt, [ColumnFamilyHandle columnFamilyHandle, ] byte[] key, byte[] value)` methods which retrieve the requested value into the supplied buffer
-8 Added `Transaction.get( ReadOptions opt, [ColumnFamilyHandle columnFamilyHandle, ] ByteBuffer key, ByteBuffer value)` methods which retrieve the requested value into the supplied buffer
-9 Added `Transaction.getForUpdate( ReadOptions readOptions, [ColumnFamilyHandle columnFamilyHandle, ] byte[] key, byte[] value, boolean exclusive [, boolean doValidate])` methods which retrieve the requested value into the supplied buffer
-10 Added `Transaction.getForUpdate( ReadOptions readOptions, [ColumnFamilyHandle columnFamilyHandle, ] ByteBuffer key, ByteBuffer value, boolean exclusive [, boolean doValidate])` methods which retrieve the requested value into the supplied buffer
-11 Added `Transaction.getIterator()` method as a convenience which defaults the `ReadOptions` value supplied to existing `Transaction.iterator()` methods. This mirrors the existing `RocksDB.iterator()` method.
-12 Added `Transaction.put([ColumnFamilyHandle columnFamilyHandle, ]  ByteBuffer key, ByteBuffer value [, boolean assumeTracked])` methods which supply the key, and the value to be written in a `ByteBuffer` parameter
-13 Added `Transaction.merge([ColumnFamilyHandle columnFamilyHandle, ] ByteBuffer key, ByteBuffer value [,  boolean assumeTracked])` methods which supply the key, and the value to be written/merged in a `ByteBuffer` parameter
-14 Added `Transaction.mergeUntracked([ColumnFamilyHandle columnFamilyHandle, ] ByteBuffer key, ByteBuffer value)` methods which supply the key, and the value to be written/merged in a `ByteBuffer` parameter
-
-
-## 8.9.0 (11/17/2023)
-### New Features
-* Add GetEntity() and PutEntity() API implementation for Attribute Group support. Through the use of Column Families, AttributeGroup enables users to logically group wide-column entities.
+* Deleting stale files upon recovery are delegated to SstFileManger if available so they can be rate limited.

+## 8.7.2 (10/25/2023)
 ### Public API Changes
-* Added rocksdb_ratelimiter_create_auto_tuned API to create an auto-tuned GenericRateLimiter.
-* Added clipColumnFamily() to the Java API to clip the entries in the CF according to the range [begin_key, end_key).
-* Make the `EnableFileDeletion` API not default to force enabling. For users that rely on this default behavior and still
-want to continue to use force enabling, they need to explicitly pass a `true` to `EnableFileDeletion`.
 * Add new Cache APIs GetSecondaryCacheCapacity() and GetSecondaryCachePinnedUsage() to return the configured capacity, and cache reservation charged to the secondary cache.

-### Behavior Changes
-* During off-peak hours defined by `daily_offpeak_time_utc`, the compaction picker will select a larger number of files for periodic compaction. This selection will include files that are projected to expire by the next off-peak start time, ensuring that these files are not chosen for periodic compaction outside of off-peak hours.
-* If an error occurs when writing to a trace file after `DB::StartTrace()`, the subsequent trace writes are skipped to avoid writing to a file that has previously seen error. In this case, `DB::EndTrace()` will also return a non-ok status with info about the error occured previously in its status message.
-* Deleting stale files upon recovery are delegated to SstFileManger if available so they can be rate limited.
-* Make RocksDB only call `TablePropertiesCollector::Finish()` once.
-* When `WAL_ttl_seconds > 0`, we now process archived WALs for deletion at least every `WAL_ttl_seconds / 2` seconds. Previously it could be less frequent in case of small `WAL_ttl_seconds` values when size-based expiration (`WAL_size_limit_MB > 0 `) was simultaneously enabled.
-
 ### Bug Fixes
-* Fixed a crash or assertion failure bug in experimental new HyperClockCache variant, especially when running with a SecondaryCache.
-* Fix a race between flush error recovery and db destruction that can lead to db crashing.
-* Fixed some bugs in the index builder/reader path for user-defined timestamps in Memtable only feature.
-
-## 8.8.0 (10/23/2023)
-### New Features
-* Introduce AttributeGroup by adding the first AttributeGroup support API, MultiGetEntity(). Through the use of Column Families, AttributeGroup enables users to logically group wide-column entities. More APIs to support AttributeGroup will come soon, including GetEntity, PutEntity, and others.
-* Added new tickers `rocksdb.fifo.{max.size|ttl}.compactions` to count FIFO compactions that drop files for different reasons
-* Add an experimental offpeak duration awareness by setting `DBOptions::daily_offpeak_time_utc` in "HH:mm-HH:mm" format. This information will be used for resource optimization in the future
-* Users can now change the max bytes granted in a single refill period (i.e, burst) during runtime by `SetSingleBurstBytes()` for RocksDB rate limiter
-
-### Public API Changes
-* The default value of `DBOptions::fail_if_options_file_error` changed from `false` to `true`. Operations that set in-memory options (e.g., `DB::Open*()`, `DB::SetOptions()`, `DB::CreateColumnFamily*()`, and `DB::DropColumnFamily()`) but fail to persist the change will now return a non-OK `Status` by default.
-
-### Behavior Changes
-* For non direct IO, eliminate the file system prefetching attempt for compaction read when `Options::compaction_readahead_size` is 0
-* During a write stop, writes now block on in-progress recovery attempts
+* Fixed a possible underflow when computing the compressed secondary cache share of memory reservations while updating the compressed secondary to total block cache ratio.
+* Fix an assertion failure when UpdeteTieredCache() is called in an idempotent manner.

+## 8.7.1 (10/20/2023)
 ### Bug Fixes
 * Fix a bug in auto_readahead_size where first_internal_key of index blocks wasn't copied properly resulting in corruption error when first_internal_key was used for comparison.
-* Fixed a bug where compaction read under non direct IO still falls back to RocksDB internal prefetching after file system's prefetching returns non-OK status other than `Status::NotSupported()`
 * Add bounds check in WBWIIteratorImpl and make BaseDeltaIterator, WriteUnpreparedTxn and WritePreparedTxn respect the upper bound and lower bound in ReadOption. See 11680.
-* Fixed the handling of wide-column base values in the `max_successive_merges` logic.
-* Fixed a rare race bug involving a concurrent combination of Create/DropColumnFamily and/or Set(DB)Options that could lead to inconsistency between (a) the DB's reported options state, (b) the DB options in effect, and (c) the latest persisted OPTIONS file.
-* Fixed a possible underflow when computing the compressed secondary cache share of memory reservations while updating the compressed secondary to total block cache ratio.
-
-### Performance Improvements
-* Improved the I/O efficiency of DB::Open a new DB with `create_missing_column_families=true` and many column families.

 ## 8.7.0 (09/22/2023)
 ### New Features
@@ -117,6 +41,7 @@ want to continue to use force enabling, they need to explicitly pass a `true` to
 * Compaction read performance will regress when `Options::compaction_readahead_size` is explicitly set to 0
 * Universal size amp compaction will conditionally exclude some of the newest L0 files when selecting input with a small negative impact to size amp. This is to prevent a large number of L0 files from being locked by a size amp compaction, potentially leading to write stop with a few more flushes.
 * Change ldb scan command delimiter from ':' to '==>'.
+* For non direct IO, eliminate the file system prefetching attempt for compaction read when `Options::compaction_readahead_size` is 0

 ### Bug Fixes
 * Fix a bug where if there is an error reading from offset 0 of a file from L1+ and that the file is not the first file in the sorted run, data can be lost in compaction and read/scan can return incorrect results.
@@ -134,9 +59,10 @@ want to continue to use force enabling, they need to explicitly pass a `true` to
 * Fix an issue in sst dump tool to handle bounds specified for data with user-defined timestamps.
 * When auto_readahead_size is enabled, update readahead upper bound during readahead trimming when reseek changes iterate_upper_bound dynamically.
 * Fixed a bug where `rocksdb.file.read.verify.file.checksums.micros` is not populated
+* Fixed a bug where compaction read under non direct IO still falls back to RocksDB internal prefetching after file system's prefetching returns non-OK status other than `Status::NotSupported()`

 ### Performance Improvements
-* Added additional improvements in tuning readahead_size during Scans when auto_readahead_size is enabled. However it's not supported with Iterator::Prev operation and will return NotSupported error.
+* Added additional improvements in tuning readahead_size during Scans when auto_readahead_size is enabled. However it's not recommended for backward scans and might impact the performance. More details in options.h.
 * During async_io, the Seek happens in 2 phases. Phase 1 starts an asynchronous read on a block cache miss, and phase 2 waits for it to complete and finishes the seek. In both phases, it tries to lookup the block cache for the data block first before looking in the prefetch buffer. It's optimized by doing the block cache lookup only in the first phase that would save some CPU.

 ## 8.6.0 (08/18/2023)
@@ -17,7 +17,7 @@ There are few options when compiling RocksDB:
 * `make check` will compile and run all the unit tests. `make check` will compile RocksDB in debug mode.

 * `make all` will compile our static library, and all our tools and unit tests. Our tools
-depend on gflags 2.2.0 or newer. You will need to have gflags installed to run `make all`. This will compile RocksDB in debug mode. Don't
+depend on gflags. You will need to have gflags installed to run `make all`. This will compile RocksDB in debug mode. Don't
 use binaries compiled by `make all` in production.

 * By default the binary we produce is optimized for the CPU you're compiling on
@@ -77,7 +77,7 @@ most processors made since roughly 2013.

              git clone https://github.com/gflags/gflags.git
              cd gflags
-              git checkout v2.2.0
+              git checkout v2.0
              ./configure && make && sudo make install

      **Notice**: Once installed, please add the include path for gflags to your `CPATH` environment variable and the
@@ -539,7 +539,7 @@ endif

 ifdef USE_CLANG
 	# Used by some teams in Facebook
-	WARNING_FLAGS += -Wshift-sign-overflow -Wambiguous-reversed-operator -Wimplicit-fallthrough
+	WARNING_FLAGS += -Wshift-sign-overflow -Wambiguous-reversed-operator
 endif

 ifeq ($(PLATFORM), OS_OPENBSD)
@@ -994,7 +994,7 @@ endif

 .PHONY: check_0
 check_0:
-	@printf '%s\n' ''						\
+	printf '%s\n' ''						\
 	  'To monitor subtest <duration,pass/fail,name>,'		\
 	  '  run "make watch-log" in a separate window' '';		\
 	{ \
@@ -1016,7 +1016,7 @@ valgrind-exclude-regexp = InlineSkipTest.ConcurrentInsert|TransactionStressTest.
 .PHONY: valgrind_check_0
 valgrind_check_0: test_log_prefix := valgrind_
 valgrind_check_0:
-	@printf '%s\n' ''						\
+	printf '%s\n' ''						\
 	  'To monitor subtest <duration,pass/fail,name>,'		\
 	  '  run "make watch-log" in a separate window' '';		\
 	{								\
@@ -2060,7 +2060,7 @@ JAVA_INCLUDE = -I$(JAVA_HOME)/include/ -I$(JAVA_HOME)/include/linux
 ifeq ($(PLATFORM), OS_SOLARIS)
 	ARCH := $(shell isainfo -b)
 else ifeq ($(PLATFORM), OS_OPENBSD)
-	ifneq (,$(filter amd64 ppc64 ppc64le s390x arm64 aarch64 riscv64 sparc64 loongarch64, $(MACHINE)))
+	ifneq (,$(filter amd64 ppc64 ppc64le s390x arm64 aarch64 sparc64 loongarch64, $(MACHINE)))
 		ARCH := 64
 	else
 		ARCH := 32
@@ -2081,7 +2081,7 @@ ifneq ($(origin JNI_LIBC), undefined)
 endif

 ifeq (,$(ROCKSDBJNILIB))
-ifneq (,$(filter ppc% s390x arm64 aarch64 riscv64 sparc64 loongarch64, $(MACHINE)))
+ifneq (,$(filter ppc% s390x arm64 aarch64 sparc64 loongarch64, $(MACHINE)))
 	ROCKSDBJNILIB = librocksdbjni-linux-$(MACHINE)$(JNI_LIBC_POSTFIX).so
 else
 	ROCKSDBJNILIB = librocksdbjni-linux$(ARCH)$(JNI_LIBC_POSTFIX).so
@@ -2094,8 +2094,8 @@ ROCKSDB_JAVADOCS_JAR = rocksdbjni-$(ROCKSDB_JAVA_VERSION)-javadoc.jar
 ROCKSDB_SOURCES_JAR = rocksdbjni-$(ROCKSDB_JAVA_VERSION)-sources.jar
 SHA256_CMD = sha256sum

-ZLIB_VER ?= 1.3.1
-ZLIB_SHA256 ?= 9a93b2b7dfdac77ceba5a558a580e74667dd6fede4585b91eefb60f03b72df23
+ZLIB_VER ?= 1.3
+ZLIB_SHA256 ?= ff0ba4c292013dbc27530b3a81e1f9a813cd39de01ca5e0f8bf355702efa593e
 ZLIB_DOWNLOAD_BASE ?= http://zlib.net
 BZIP2_VER ?= 1.0.8
 BZIP2_SHA256 ?= ab5a03176ee106d3f0fa90e381da478ddae405918153cca248e682cd0c4a2269
@@ -2346,10 +2346,6 @@ rocksdbjavastaticdockers390x:
 	mkdir -p java/target
 	docker run --rm --name rocksdb_linux_s390x-be --attach stdin --attach stdout --attach stderr --volume $(HOME)/.m2:/root/.m2:ro --volume `pwd`:/rocksdb-host:ro --volume /rocksdb-local-build --volume `pwd`/java/target:/rocksdb-java-target --env DEBUG_LEVEL=$(DEBUG_LEVEL) evolvedbinary/rocksjava:ubuntu18_s390x-be /rocksdb-host/java/crossbuild/docker-build-linux-centos.sh

-rocksdbjavastaticdockerriscv64:
-	mkdir -p java/target
-	docker run --rm --name rocksdb_linux_riscv64-be --attach stdin --attach stdout --attach stderr --volume $(HOME)/.m2:/root/.m2:ro --volume `pwd`:/rocksdb-host:ro --volume /rocksdb-local-build --volume `pwd`/java/target:/rocksdb-java-target --env DEBUG_LEVEL=$(DEBUG_LEVEL) evolvedbinary/rocksjava:ubuntu20_riscv64-be /rocksdb-host/java/crossbuild/docker-build-linux-centos.sh
-
 rocksdbjavastaticdockerx86musl:
 	mkdir -p java/target
 	docker run --rm --name rocksdb_linux_x86-musl-be --platform linux/386 --attach stdin --attach stdout --attach stderr --volume $(HOME)/.m2:/root/.m2:ro --volume `pwd`:/rocksdb-host:ro --volume /rocksdb-local-build --volume `pwd`/java/target:/rocksdb-java-target --env DEBUG_LEVEL=$(DEBUG_LEVEL) evolvedbinary/rocksjava:alpine3_x86-be /rocksdb-host/java/crossbuild/docker-build-linux-alpine.sh
@@ -2423,9 +2419,6 @@ jtest_run:
 jtest: rocksdbjava
 	cd java;$(MAKE) sample test

-jpmd: rocksdbjava rocksdbjavageneratepom
-	cd java;$(MAKE) pmd
-
 jdb_bench:
 	cd java;$(MAKE) db_bench;

@@ -5,5 +5,4 @@ This is the list of all known third-party plugins for RocksDB. If something is m
 * [ZenFS](https://github.com/westerndigitalcorporation/zenfs): a file system for zoned block devices
 * [RADOS](https://github.com/riversand963/rocksdb-rados-env): an Env used for interacting with RADOS. Migrated from RocksDB main repo.
 * [PMEM](https://github.com/pmem/pmem-rocksdb-plugin): a collection of plugins to enable Persistent Memory on RocksDB.
-* [IPPCP](https://github.com/intel/ippcp-plugin-rocksdb): a plugin to enable encryption on RocksDB based on Intel optimized open source IPP-Crypto library.
-* [encfs](https://github.com/pegasus-kv/encfs): a plugin to enable encryption on RocksDB based on OpenSSL library.
+* [IPPCP](https://github.com/intel/ippcp-plugin-rocksdb): a plugin to enable encryption on RocksDB based on Intel optimized open source IPP-Crypto library.
@@ -3,6 +3,8 @@
 # --> DO NOT EDIT MANUALLY <--
 # This file is a Facebook-specific integration for buck builds, so can
 # only be validated by Facebook employees.
+#
+# @noautodeps @nocodemods
 load("//rocks/buckifier:defs.bzl", "cpp_library_wrapper","rocks_cpp_library_wrapper","cpp_binary_wrapper","cpp_unittest_wrapper","fancy_bench_wrapper","add_c_test_wrapper")


@@ -163,7 +165,6 @@ cpp_library_wrapper(name="rocksdb_lib", srcs=[
        "options/configurable.cc",
        "options/customizable.cc",
        "options/db_options.cc",
-        "options/offpeak_time_info.cc",
        "options/options.cc",
        "options/options_helper.cc",
        "options/options_parser.cc",
@@ -394,7 +395,6 @@ rocks_cpp_library_wrapper(name="rocksdb_stress_lib", srcs=[
        "db_stress_tool/db_stress_stat.cc",
        "db_stress_tool/db_stress_test_base.cc",
        "db_stress_tool/db_stress_tool.cc",
-        "db_stress_tool/db_stress_wide_merge_operator.cc",
        "db_stress_tool/expected_state.cc",
        "db_stress_tool/expected_value.cc",
        "db_stress_tool/multi_ops_txns_stress.cc",
@@ -407,8 +407,6 @@ rocks_cpp_library_wrapper(name="rocksdb_stress_lib", srcs=[

 cpp_binary_wrapper(name="db_stress", srcs=["db_stress_tool/db_stress.cc"], deps=[":rocksdb_stress_lib"], extra_preprocessor_flags=[], extra_bench_libs=False)

-cpp_binary_wrapper(name="cache_bench", srcs=["cache/cache_bench.cc"], deps=[":rocksdb_cache_bench_tools_lib"], extra_preprocessor_flags=[], extra_bench_libs=False)
-
 cpp_binary_wrapper(name="ribbon_bench", srcs=["microbench/ribbon_bench.cc"], deps=[], extra_preprocessor_flags=[], extra_bench_libs=True)

 cpp_binary_wrapper(name="db_basic_bench", srcs=["microbench/db_basic_bench.cc"], deps=[], extra_preprocessor_flags=[], extra_bench_libs=True)
@@ -5621,5 +5619,3 @@ cpp_unittest_wrapper(name="write_unprepared_transaction_test",
            deps=[":rocksdb_test_lib"],
            extra_compiler_flags=[])

-
-export_file(name = "tools/db_crashtest.py")
@@ -152,9 +152,6 @@ LzLabs is using RocksDB as a storage engine in their multi-database distributed
 ## ArangoDB
 [ArangoDB](https://www.arangodb.com/) is a native multi-model database with flexible data models for documents, graphs, and key-values, for building high performance applications using a convenient SQL-like query language or JavaScript extensions. It uses RocksDB as its storage engine.

-## Qdrant
-[Qdrant](https://qdrant.tech/) is an open source vector database, it [uses](https://qdrant.tech/documentation/concepts/storage/) RocksDB as its persistent storage.
-
 ## Milvus
 [Milvus](https://milvus.io/) is an open source vector database for unstructured data. It uses RocksDB not only as one of the supported kv storage engines, but also as a message queue.

@@ -197,10 +197,6 @@ def generate_targets(repo_path, deps_map):
    TARGETS.add_binary(
        "db_stress", ["db_stress_tool/db_stress.cc"], [":rocksdb_stress_lib"]
    )
-    # cache_bench binary
-    TARGETS.add_binary(
-        "cache_bench", ["cache/cache_bench.cc"], [":rocksdb_cache_bench_tools_lib"]
-    )
    # bench binaries
    for src in src_mk.get("MICROBENCH_SOURCES", []):
        name = src.rsplit("/", 1)[1].split(".")[0] if "/" in src else src.split(".")[0]
@@ -303,7 +299,6 @@ def generate_targets(repo_path, deps_map):
                    deps=json.dumps(deps["extra_deps"] + [":rocksdb_test_lib"]),
                    extra_compiler_flags=json.dumps(deps["extra_compiler_flags"]),
                )
-    TARGETS.export_file("tools/db_crashtest.py")

    print(ColorString.info("Generated TARGETS Summary:"))
    print(ColorString.info("- %d libs" % TARGETS.total_lib))
@@ -148,9 +148,3 @@ add_c_test_wrapper()
                ).encode("utf-8")
            )
        self.total_test = self.total_test + 1
-
-    def export_file(self, name):
-        with open(self.path, "a") as targets_file:
-            targets_file.write(
-                targets_cfg.export_file_template.format(name=name)
-            )
@@ -6,6 +6,8 @@ rocksdb_target_header_template = """# This file \100generated by:
 # --> DO NOT EDIT MANUALLY <--
 # This file is a Facebook-specific integration for buck builds, so can
 # only be validated by Facebook employees.
+#
+# @noautodeps @nocodemods
 load("//rocks/buckifier:defs.bzl", "cpp_library_wrapper","rocks_cpp_library_wrapper","cpp_binary_wrapper","cpp_unittest_wrapper","fancy_bench_wrapper","add_c_test_wrapper")

 """
@@ -37,7 +39,3 @@ fancy_bench_template = """
 fancy_bench_wrapper(suite_name="{name}", binary_to_bench_to_metric_list_map={bench_config}, slow={slow}, expected_runtime={expected_runtime}, sl_iterations={sl_iterations}, regression_threshold={regression_threshold})

 """
-
-export_file_template = """
-export_file(name = "{name}")
-"""
@@ -647,10 +647,8 @@ if [ "$PORTABLE" == "" ] || [ "$PORTABLE" == 0 ]; then
    fi
    COMMON_FLAGS="$COMMON_FLAGS"
  elif test -n "`echo $TARGET_ARCHITECTURE | grep ^riscv64`"; then
-    RISC_ISA=$(cat /proc/cpuinfo | grep -E '^isa\s*:' | head -1 | cut --delimiter=: -f 2 | cut -b 2-)
-    if [ -n "${RISCV_ISA}" ]; then
-      COMMON_FLAGS="$COMMON_FLAGS -march=${RISC_ISA}"
-    fi
+    RISC_ISA=$(cat /proc/cpuinfo | grep isa | head -1 | cut --delimiter=: -f 2 | cut -b 2-)
+    COMMON_FLAGS="$COMMON_FLAGS -march=${RISC_ISA}"
  elif [ "$TARGET_OS" == "IOS" ]; then
    COMMON_FLAGS="$COMMON_FLAGS"
  else
@@ -662,7 +660,8 @@ else
    if test -n "`echo $TARGET_ARCHITECTURE | grep ^s390x`"; then
      COMMON_FLAGS="$COMMON_FLAGS -march=z196 "
    elif test -n "`echo $TARGET_ARCHITECTURE | grep ^riscv64`"; then
-      COMMON_FLAGS="$COMMON_FLAGS -march=rv64gc"
+      RISC_ISA=$(cat /proc/cpuinfo | grep isa | head -1 | cut --delimiter=: -f 2 | cut -b 2-)
+      COMMON_FLAGS="$COMMON_FLAGS -march=${RISC_ISA}"
    elif test "$USE_SSE"; then
      # USE_SSE is DEPRECATED
      # This is a rough approximation of the old USE_SSE behavior
@@ -48,10 +48,6 @@ DEFINE_uint64(cache_size, 1 * GiB,
              "Number of bytes to use as a cache of uncompressed data.");
 DEFINE_int32(num_shard_bits, -1,
             "ShardedCacheOptions::shard_bits. Default = auto");
-DEFINE_int32(
-    eviction_effort_cap,
-    ROCKSDB_NAMESPACE::HyperClockCacheOptions(1, 1).eviction_effort_cap,
-    "HyperClockCacheOptions::eviction_effort_cap");

 DEFINE_double(resident_ratio, 0.25,
              "Ratio of keys fitting in cache to keyspace.");
@@ -67,22 +63,11 @@ DEFINE_int32(
 DEFINE_uint32(skew, 5, "Degree of skew in key selection. 0 = no skew");
 DEFINE_bool(populate_cache, true, "Populate cache before operations");

-DEFINE_double(pinned_ratio, 0.25,
-              "Keep roughly this portion of entries pinned in cache.");
-DEFINE_double(
-    vary_capacity_ratio, 0.0,
-    "If greater than 0.0, will periodically vary the capacity between this "
-    "ratio less than full size and full size. If vary_capacity_ratio + "
-    "pinned_ratio is close to or exceeds 1.0, the cache might thrash.");
-
-DEFINE_uint32(lookup_insert_percent, 82,
+DEFINE_uint32(lookup_insert_percent, 87,
              "Ratio of lookup (+ insert on not found) to total workload "
              "(expressed as a percentage)");
 DEFINE_uint32(insert_percent, 2,
              "Ratio of insert to total workload (expressed as a percentage)");
-DEFINE_uint32(blind_insert_percent, 5,
-              "Ratio of insert without keeping handle to total workload "
-              "(expressed as a percentage)");
 DEFINE_uint32(lookup_percent, 10,
              "Ratio of lookup to total workload (expressed as a percentage)");
 DEFINE_uint32(erase_percent, 1,
@@ -116,6 +101,7 @@ DEFINE_uint32(seed, 0, "Hashing/random seed to use. 0 = choose at random");

 DEFINE_string(secondary_cache_uri, "",
              "Full URI for creating a custom secondary cache object");
+static class std::shared_ptr<ROCKSDB_NAMESPACE::SecondaryCache> secondary_cache;

 DEFINE_string(cache_type, "lru_cache", "Type of block cache.");

@@ -214,19 +200,16 @@ class SharedState {

  bool Started() const { return start_; }

-  void AddLookupStats(uint64_t hits, uint64_t misses, size_t pinned_count) {
+  void AddLookupStats(uint64_t hits, uint64_t misses) {
    MutexLock l(&mu_);
    lookup_count_ += hits + misses;
    lookup_hits_ += hits;
-    pinned_count_ += pinned_count;
  }

  double GetLookupHitRatio() const {
    return 1.0 * lookup_hits_ / lookup_count_;
  }

-  size_t GetPinnedCount() const { return pinned_count_; }
-
 private:
  port::Mutex mu_;
  port::CondVar cv_;
@@ -238,7 +221,6 @@ class SharedState {
  uint64_t num_done_ = 0;
  uint64_t lookup_count_ = 0;
  uint64_t lookup_hits_ = 0;
-  size_t pinned_count_ = 0;
 };

 // Per-thread state for concurrent executions of the same benchmark.
@@ -331,28 +313,6 @@ Cache::CacheItemHelper helper2(CacheEntryRole::kIndexBlock, DeleteFn, SizeFn,
 Cache::CacheItemHelper helper3_wos(CacheEntryRole::kFilterBlock, DeleteFn);
 Cache::CacheItemHelper helper3(CacheEntryRole::kFilterBlock, DeleteFn, SizeFn,
                               SaveToFn, CreateFn, &helper3_wos);
-
-void ConfigureSecondaryCache(ShardedCacheOptions& opts) {
-  if (!FLAGS_secondary_cache_uri.empty()) {
-    std::shared_ptr<SecondaryCache> secondary_cache;
-    Status s = SecondaryCache::CreateFromString(
-        ConfigOptions(), FLAGS_secondary_cache_uri, &secondary_cache);
-    if (secondary_cache == nullptr) {
-      fprintf(stderr,
-              "No secondary cache registered matching string: %s status=%s\n",
-              FLAGS_secondary_cache_uri.c_str(), s.ToString().c_str());
-      exit(1);
-    }
-    opts.secondary_cache = secondary_cache;
-  }
-}
-
-ShardedCacheBase* AsShardedCache(Cache* c) {
-  if (!FLAGS_secondary_cache_uri.empty()) {
-    c = static_cast_with_check<CacheWrapper>(c)->GetTarget().get();
-  }
-  return static_cast_with_check<ShardedCacheBase>(c);
-}
 }  // namespace

 class CacheBench {
@@ -367,9 +327,7 @@ class CacheBench {
                                 FLAGS_lookup_insert_percent),
        insert_threshold_(lookup_insert_threshold_ +
                          kHundredthUint64 * FLAGS_insert_percent),
-        blind_insert_threshold_(insert_threshold_ +
-                                kHundredthUint64 * FLAGS_blind_insert_percent),
-        lookup_threshold_(blind_insert_threshold_ +
+        lookup_threshold_(insert_threshold_ +
                          kHundredthUint64 * FLAGS_lookup_percent),
        erase_threshold_(lookup_threshold_ +
                         kHundredthUint64 * FLAGS_erase_percent) {
@@ -395,7 +353,6 @@ class CacheBench {
          FLAGS_cache_size, /*estimated_entry_charge=*/0, FLAGS_num_shard_bits);
      opts.hash_seed = BitwiseAnd(FLAGS_seed, INT32_MAX);
      opts.memory_allocator = allocator;
-      opts.eviction_effort_cap = FLAGS_eviction_effort_cap;
      if (FLAGS_cache_type == "fixed_hyper_clock_cache" ||
          FLAGS_cache_type == "hyper_clock_cache") {
        opts.estimated_entry_charge = FLAGS_value_bytes_estimate > 0
@@ -409,7 +366,6 @@ class CacheBench {
        fprintf(stderr, "Cache type not supported.\n");
        exit(1);
      }
-      ConfigureSecondaryCache(opts);
      cache_ = opts.MakeSharedCache();
    } else if (FLAGS_cache_type == "lru_cache") {
      LRUCacheOptions opts(FLAGS_cache_size, FLAGS_num_shard_bits,
@@ -417,7 +373,19 @@ class CacheBench {
                           0.5 /* high_pri_pool_ratio */);
      opts.hash_seed = BitwiseAnd(FLAGS_seed, INT32_MAX);
      opts.memory_allocator = allocator;
-      ConfigureSecondaryCache(opts);
+      if (!FLAGS_secondary_cache_uri.empty()) {
+        Status s = SecondaryCache::CreateFromString(
+            ConfigOptions(), FLAGS_secondary_cache_uri, &secondary_cache);
+        if (secondary_cache == nullptr) {
+          fprintf(
+              stderr,
+              "No secondary cache registered matching string: %s status=%s\n",
+              FLAGS_secondary_cache_uri.c_str(), s.ToString().c_str());
+          exit(1);
+        }
+        opts.secondary_cache = secondary_cache;
+      }
+
      cache_ = NewLRUCache(opts);
    } else {
      fprintf(stderr, "Cache type not supported.\n");
@@ -537,8 +505,6 @@ class CacheBench {
    size_t slot = cache_->GetTableAddressCount();
    printf("Final load factor: %g (%zu / %zu)\n", 1.0 * occ / slot, occ, slot);

-    printf("Final pinned count: %zu\n", shared.GetPinnedCount());
-
    if (FLAGS_histograms) {
      printf("\nOperation latency (ns):\n");
      HistogramImpl combined;
@@ -570,7 +536,6 @@ class CacheBench {
  // Cumulative thresholds in the space of a random uint64_t
  const uint64_t lookup_insert_threshold_;
  const uint64_t insert_threshold_;
-  const uint64_t blind_insert_threshold_;
  const uint64_t lookup_threshold_;
  const uint64_t erase_threshold_;

@@ -686,44 +651,29 @@ class CacheBench {
    uint64_t lookup_misses = 0;
    uint64_t lookup_hits = 0;
    // To hold handles for a non-trivial amount of time
-    std::deque<Cache::Handle*> pinned;
-    size_t total_pin_count = static_cast<size_t>(
-        (FLAGS_cache_size * FLAGS_pinned_ratio) / FLAGS_value_bytes + 0.999999);
-    // For this thread. Some round up, some round down, as appropriate
-    size_t pin_count = (total_pin_count + thread->tid) / FLAGS_threads;
-
+    Cache::Handle* handle = nullptr;
    KeyGen gen;
    const auto clock = SystemClock::Default().get();
    uint64_t start_time = clock->NowMicros();
    StopWatchNano timer(clock);
    auto system_clock = SystemClock::Default();
-    size_t steps_to_next_capacity_change = 0;

    for (uint64_t i = 0; i < FLAGS_ops_per_thread; i++) {
      Slice key = gen.GetRand(thread->rnd, max_key_, FLAGS_skew);
      uint64_t random_op = thread->rnd.Next();

-      if (FLAGS_vary_capacity_ratio > 0.0 && thread->tid == 0) {
-        if (steps_to_next_capacity_change == 0) {
-          double cut_ratio = static_cast<double>(thread->rnd.Next()) /
-                             static_cast<double>(UINT64_MAX) *
-                             FLAGS_vary_capacity_ratio;
-          cache_->SetCapacity(FLAGS_cache_size * (1.0 - cut_ratio));
-          steps_to_next_capacity_change =
-              static_cast<size_t>(FLAGS_ops_per_thread / 100);
-        } else {
-          --steps_to_next_capacity_change;
-        }
-      }
-
      if (FLAGS_histograms) {
        timer.Start();
      }

      if (random_op < lookup_insert_threshold_) {
+        if (handle) {
+          cache_->Release(handle);
+          handle = nullptr;
+        }
        // do lookup
-        auto handle = cache_->Lookup(key, &helper2, /*context*/ nullptr,
-                                     Cache::Priority::LOW);
+        handle = cache_->Lookup(key, &helper2, /*context*/ nullptr,
+                                Cache::Priority::LOW);
        if (handle) {
          ++lookup_hits;
          if (!FLAGS_lean) {
@@ -731,31 +681,32 @@ class CacheBench {
            result += NPHash64(static_cast<char*>(cache_->Value(handle)),
                               FLAGS_value_bytes);
          }
-          pinned.push_back(handle);
        } else {
          ++lookup_misses;
          // do insert
          Status s = cache_->Insert(
              key, createValue(thread->rnd, cache_->memory_allocator()),
-              &helper2, FLAGS_value_bytes, &pinned.emplace_back());
+              &helper2, FLAGS_value_bytes, &handle);
          assert(s.ok());
        }
      } else if (random_op < insert_threshold_) {
+        if (handle) {
+          cache_->Release(handle);
+          handle = nullptr;
+        }
        // do insert
        Status s = cache_->Insert(
            key, createValue(thread->rnd, cache_->memory_allocator()), &helper3,
-            FLAGS_value_bytes, &pinned.emplace_back());
-        assert(s.ok());
-      } else if (random_op < blind_insert_threshold_) {
-        // insert without keeping a handle
-        Status s = cache_->Insert(
-            key, createValue(thread->rnd, cache_->memory_allocator()), &helper3,
-            FLAGS_value_bytes);
+            FLAGS_value_bytes, &handle);
        assert(s.ok());
      } else if (random_op < lookup_threshold_) {
+        if (handle) {
+          cache_->Release(handle);
+          handle = nullptr;
+        }
        // do lookup
-        auto handle = cache_->Lookup(key, &helper2, /*context*/ nullptr,
-                                     Cache::Priority::LOW);
+        handle = cache_->Lookup(key, &helper2, /*context*/ nullptr,
+                                Cache::Priority::LOW);
        if (handle) {
          ++lookup_hits;
          if (!FLAGS_lean) {
@@ -763,7 +714,6 @@ class CacheBench {
            result += NPHash64(static_cast<char*>(cache_->Value(handle)),
                               FLAGS_value_bytes);
          }
-          pinned.push_back(handle);
        } else {
          ++lookup_misses;
        }
@@ -777,6 +727,7 @@ class CacheBench {
      if (FLAGS_histograms) {
        thread->latency_ns_hist.Add(timer.ElapsedNanos());
      }
+      thread->shared->AddLookupStats(lookup_hits, lookup_misses);
      if (FLAGS_usleep > 0) {
        unsigned us =
            static_cast<unsigned>(thread->rnd.Uniform(FLAGS_usleep + 1));
@@ -784,17 +735,12 @@ class CacheBench {
          system_clock->SleepForMicroseconds(us);
        }
      }
-      while (pinned.size() > pin_count) {
-        cache_->Release(pinned.front());
-        pinned.pop_front();
-      }
    }
    if (FLAGS_early_exit) {
      MutexLock l(thread->shared->GetMutex());
      exit(0);
    }
-    thread->shared->AddLookupStats(lookup_hits, lookup_misses, pinned.size());
-    for (auto handle : pinned) {
+    if (handle) {
      cache_->Release(handle);
      handle = nullptr;
    }
@@ -823,7 +769,8 @@ class CacheBench {
    printf("Cache size          : %s\n",
           BytesToHumanString(FLAGS_cache_size).c_str());
    printf("Num shard bits      : %d\n",
-           AsShardedCache(cache_.get())->GetNumShardBits());
+           static_cast_with_check<ShardedCacheBase>(cache_.get())
+               ->GetNumShardBits());
    printf("Max key             : %" PRIu64 "\n", max_key_);
    printf("Resident ratio      : %g\n", FLAGS_resident_ratio);
    printf("Skew degree         : %u\n", FLAGS_skew);
@@ -11,7 +11,6 @@

 #include <array>
 #include <atomic>
-#include <climits>
 #include <cstddef>
 #include <cstdint>
 #include <memory>
@@ -25,7 +24,6 @@
 #include "port/port.h"
 #include "rocksdb/cache.h"
 #include "rocksdb/secondary_cache.h"
-#include "util/atomic.h"
 #include "util/autovector.h"
 #include "util/math.h"

@@ -370,19 +368,11 @@ struct ClockHandle : public ClockHandleBasicData {
  // TODO: make these coundown values tuning parameters for eviction?

  // See above. Mutable for read reference counting.
-  mutable AcqRelAtomic<uint64_t> meta{};
+  mutable std::atomic<uint64_t> meta{};
 };  // struct ClockHandle

 class BaseClockTable {
 public:
-  struct BaseOpts {
-    explicit BaseOpts(int _eviction_effort_cap)
-        : eviction_effort_cap(_eviction_effort_cap) {}
-    explicit BaseOpts(const HyperClockCacheOptions& opts)
-        : BaseOpts(opts.eviction_effort_cap) {}
-    int eviction_effort_cap;
-  };
-
  BaseClockTable(CacheMetadataChargePolicy metadata_charge_policy,
                 MemoryAllocator* allocator,
                 const Cache::EvictionCallback* eviction_callback,
@@ -395,37 +385,36 @@ class BaseClockTable {
  template <class Table>
  typename Table::HandleImpl* CreateStandalone(ClockHandleBasicData& proto,
                                               size_t capacity,
-                                               uint32_t eec_and_scl,
+                                               bool strict_capacity_limit,
                                               bool allow_uncharged);

  template <class Table>
  Status Insert(const ClockHandleBasicData& proto,
                typename Table::HandleImpl** handle, Cache::Priority priority,
-                size_t capacity, uint32_t eec_and_scl);
+                size_t capacity, bool strict_capacity_limit);

  void Ref(ClockHandle& handle);

-  size_t GetOccupancy() const { return occupancy_.LoadRelaxed(); }
+  size_t GetOccupancy() const {
+    return occupancy_.load(std::memory_order_relaxed);
+  }

-  size_t GetUsage() const { return usage_.LoadRelaxed(); }
+  size_t GetUsage() const { return usage_.load(std::memory_order_relaxed); }

-  size_t GetStandaloneUsage() const { return standalone_usage_.LoadRelaxed(); }
+  size_t GetStandaloneUsage() const {
+    return standalone_usage_.load(std::memory_order_relaxed);
+  }

  uint32_t GetHashSeed() const { return hash_seed_; }

-  uint64_t GetYieldCount() const { return yield_count_.LoadRelaxed(); }
-
-  uint64_t GetEvictionEffortExceededCount() const {
-    return eviction_effort_exceeded_count_.LoadRelaxed();
-  }
+  uint64_t GetYieldCount() const { return yield_count_.load(); }

  struct EvictionData {
    size_t freed_charge = 0;
    size_t freed_count = 0;
-    size_t seen_pinned_count = 0;
  };

-  void TrackAndReleaseEvictedEntry(ClockHandle* h);
+  void TrackAndReleaseEvictedEntry(ClockHandle* h, EvictionData* data);

 #ifndef NDEBUG
  // Acquire N references
@@ -450,7 +439,6 @@ class BaseClockTable {
  template <class Table>
  Status ChargeUsageMaybeEvictStrict(size_t total_charge, size_t capacity,
                                     bool need_evict_for_occupancy,
-                                     uint32_t eviction_effort_cap,
                                     typename Table::InsertState& state);

  // Helper for updating `usage_` for new entry with given `total_charge`
@@ -464,7 +452,6 @@ class BaseClockTable {
  template <class Table>
  bool ChargeUsageMaybeEvictNonStrict(size_t total_charge, size_t capacity,
                                      bool need_evict_for_occupancy,
-                                      uint32_t eviction_effort_cap,
                                      typename Table::InsertState& state);

 protected:  // data
@@ -473,29 +460,21 @@ class BaseClockTable {
  // operations in ClockCacheShard.

  // Clock algorithm sweep pointer.
-  // (Relaxed: only needs to be consistent with itself.)
-  RelaxedAtomic<uint64_t> clock_pointer_{};
+  std::atomic<uint64_t> clock_pointer_{};

  // Counter for number of times we yield to wait on another thread.
-  // It is normal for this to occur rarely in normal operation.
-  // (Relaxed: a simple stat counter.)
-  RelaxedAtomic<uint64_t> yield_count_{};
-
-  // Counter for number of times eviction effort cap is exceeded.
-  // It is normal for this to occur rarely in normal operation.
-  // (Relaxed: a simple stat counter.)
-  RelaxedAtomic<uint64_t> eviction_effort_exceeded_count_{};
+  std::atomic<uint64_t> yield_count_{};

  // TODO: is this separation needed if we don't do background evictions?
  ALIGN_AS(CACHE_LINE_SIZE)
  // Number of elements in the table.
-  AcqRelAtomic<size_t> occupancy_{};
+  std::atomic<size_t> occupancy_{};

  // Memory usage by entries tracked by the cache (including standalone)
-  AcqRelAtomic<size_t> usage_{};
+  std::atomic<size_t> usage_{};

  // Part of usage by standalone entries (not in table)
-  AcqRelAtomic<size_t> standalone_usage_{};
+  std::atomic<size_t> standalone_usage_{};

  ALIGN_AS(CACHE_LINE_SIZE)
  const CacheMetadataChargePolicy metadata_charge_policy_;
@@ -521,11 +500,7 @@ class FixedHyperClockTable : public BaseClockTable {
  struct ALIGN_AS(64U) HandleImpl : public ClockHandle {
    // The number of elements that hash to this slot or a lower one, but wind
    // up in this slot or a higher one.
-    // (Relaxed: within a Cache op, does not need consistency with entries
-    // inserted/removed during that op. For example, a Lookup() that
-    // happens-after an Insert() will see an appropriate displacements value
-    // for the entry to be in a published state.)
-    RelaxedAtomic<uint32_t> displacements{};
+    std::atomic<uint32_t> displacements{};

    // Whether this is a "deteched" handle that is independently allocated
    // with `new` (so must be deleted with `delete`).
@@ -539,19 +514,17 @@ class FixedHyperClockTable : public BaseClockTable {
    inline void SetStandalone() { standalone = true; }
  };  // struct HandleImpl

-  struct Opts : public BaseOpts {
-    explicit Opts(size_t _estimated_value_size, int _eviction_effort_cap)
-        : BaseOpts(_eviction_effort_cap),
-          estimated_value_size(_estimated_value_size) {}
-    explicit Opts(const HyperClockCacheOptions& opts)
-        : BaseOpts(opts.eviction_effort_cap) {
+  struct Opts {
+    explicit Opts(size_t _estimated_value_size)
+        : estimated_value_size(_estimated_value_size) {}
+    explicit Opts(const HyperClockCacheOptions& opts) {
      assert(opts.estimated_entry_charge > 0);
      estimated_value_size = opts.estimated_entry_charge;
    }
    size_t estimated_value_size;
  };

-  FixedHyperClockTable(size_t capacity,
+  FixedHyperClockTable(size_t capacity, bool strict_capacity_limit,
                       CacheMetadataChargePolicy metadata_charge_policy,
                       MemoryAllocator* allocator,
                       const Cache::EvictionCallback* eviction_callback,
@@ -573,8 +546,7 @@ class FixedHyperClockTable : public BaseClockTable {
  // Runs the clock eviction algorithm trying to reclaim at least
  // requested_charge. Returns how much is evicted, which could be less
  // if it appears impossible to evict the requested amount without blocking.
-  void Evict(size_t requested_charge, InsertState& state, EvictionData* data,
-             uint32_t eviction_effort_cap);
+  void Evict(size_t requested_charge, InsertState& state, EvictionData* data);

  HandleImpl* Lookup(const UniqueId64x2& hashed_key);

@@ -815,33 +787,32 @@ class AutoHyperClockTable : public BaseClockTable {

    // See above. The head pointer is logically independent of the rest of
    // the entry, including the chain next pointer.
-    AcqRelAtomic<uint64_t> head_next_with_shift{kUnusedMarker};
-    AcqRelAtomic<uint64_t> chain_next_with_shift{kUnusedMarker};
+    std::atomic<uint64_t> head_next_with_shift{kUnusedMarker};
+    std::atomic<uint64_t> chain_next_with_shift{kUnusedMarker};

    // For supporting CreateStandalone and some fallback cases.
    inline bool IsStandalone() const {
-      return head_next_with_shift.Load() == kStandaloneMarker;
+      return head_next_with_shift.load(std::memory_order_acquire) ==
+             kStandaloneMarker;
    }

    inline void SetStandalone() {
-      head_next_with_shift.Store(kStandaloneMarker);
+      head_next_with_shift.store(kStandaloneMarker, std::memory_order_release);
    }
  };  // struct HandleImpl

-  struct Opts : public BaseOpts {
-    explicit Opts(size_t _min_avg_value_size, int _eviction_effort_cap)
-        : BaseOpts(_eviction_effort_cap),
-          min_avg_value_size(_min_avg_value_size) {}
+  struct Opts {
+    explicit Opts(size_t _min_avg_value_size)
+        : min_avg_value_size(_min_avg_value_size) {}

-    explicit Opts(const HyperClockCacheOptions& opts)
-        : BaseOpts(opts.eviction_effort_cap) {
+    explicit Opts(const HyperClockCacheOptions& opts) {
      assert(opts.estimated_entry_charge == 0);
      min_avg_value_size = opts.min_avg_entry_charge;
    }
    size_t min_avg_value_size;
  };

-  AutoHyperClockTable(size_t capacity,
+  AutoHyperClockTable(size_t capacity, bool strict_capacity_limit,
                      CacheMetadataChargePolicy metadata_charge_policy,
                      MemoryAllocator* allocator,
                      const Cache::EvictionCallback* eviction_callback,
@@ -868,8 +839,7 @@ class AutoHyperClockTable : public BaseClockTable {
  // Runs the clock eviction algorithm trying to reclaim at least
  // requested_charge. Returns how much is evicted, which could be less
  // if it appears impossible to evict the requested amount without blocking.
-  void Evict(size_t requested_charge, InsertState& state, EvictionData* data,
-             uint32_t eviction_effort_cap);
+  void Evict(size_t requested_charge, InsertState& state, EvictionData* data);

  HandleImpl* Lookup(const UniqueId64x2& hashed_key);

@@ -934,8 +904,7 @@ class AutoHyperClockTable : public BaseClockTable {
  // with proper handling to ensure all existing data is seen even in the
  // presence of concurrent insertions, etc. (See implementation.)
  template <class OpData>
-  void PurgeImpl(OpData* op_data, size_t home = SIZE_MAX,
-                 EvictionData* data = nullptr);
+  void PurgeImpl(OpData* op_data, size_t home = SIZE_MAX);

  // An RAII wrapper for locking a chain of entries for removals. See
  // implementation.
@@ -945,7 +914,7 @@ class AutoHyperClockTable : public BaseClockTable {
  // implementation.
  template <class OpData>
  void PurgeImplLocked(OpData* op_data, ChainRewriteLock& rewrite_lock,
-                       size_t home, EvictionData* data);
+                       size_t home);

  // Update length_info_ as much as possible without waiting, given a known
  // usable (ready for inserts and lookups) grow_home. (Previous grow_homes
@@ -970,25 +939,22 @@ class AutoHyperClockTable : public BaseClockTable {
  // log time to find the correct chain, but normally this value enables
  // readers to find the correct chain on the first try.
  //
-  // To maximize parallelization of Grow() operations, this field is only
-  // updated opportunistically after Grow() operations and in DoInsert() where
-  // it is found to be out-of-date. See CatchUpLengthInfoNoWait().
-  AcqRelAtomic<uint64_t> length_info_;
+  // NOTES: length_info_ is only updated at the end of a Grow operation,
+  // so that waiting in Grow operations isn't done while entries are pinned
+  // for internal operation purposes. Thus, Lookup and Insert have to
+  // detect and support cases where length_info hasn't caught up to updated
+  // chains. Winning grow thread is the one that transitions
+  // head_next_with_shift from zeros. Grow threads can spin/yield wait for
+  // preconditions and postconditions to be met.
+  std::atomic<uint64_t> length_info_;

  // An already-computed version of the usable length times the max load
  // factor. Could be slightly out of date but GrowIfNeeded()/Grow() handle
  // that internally.
-  // (Relaxed: allowed to lag behind length_info_ by a little)
-  RelaxedAtomic<size_t> occupancy_limit_;
-
-  // The next index to use from array_ upon the next Grow(). Might be ahead of
-  // length_info_.
-  // (Relaxed: self-contained source of truth for next grow home)
-  RelaxedAtomic<size_t> grow_frontier_;
+  std::atomic<size_t> occupancy_limit_;

  // See explanation in AutoHyperClockTable::Evict
-  // (Relaxed: allowed to lag behind clock_pointer_ and length_info_ state)
-  RelaxedAtomic<size_t> clock_pointer_mask_;
+  std::atomic<size_t> clock_pointer_mask_;
 };  // class AutoHyperClockTable

 // A single shard of sharded cache.
@@ -1104,13 +1070,10 @@ class ALIGN_AS(CACHE_LINE_SIZE) ClockCacheShard final : public CacheShardBase {
  Table table_;

  // Maximum total charge of all elements stored in the table.
-  // (Relaxed: eventual consistency/update is OK)
-  RelaxedAtomic<size_t> capacity_;
+  std::atomic<size_t> capacity_;

-  // Encodes eviction_effort_cap (bottom 31 bits) and strict_capacity_limit
-  // (top bit). See HyperClockCacheOptions::eviction_effort_cap etc.
-  // (Relaxed: eventual consistency/update is OK)
-  RelaxedAtomic<uint32_t> eec_and_scl_;
+  // Whether to reject insertion if cache reaches its full capacity.
+  std::atomic<bool> strict_capacity_limit_;
 };  // class ClockCacheShard

 template <class Table>
@@ -31,15 +31,11 @@ CompressedSecondaryCache::~CompressedSecondaryCache() {}
 std::unique_ptr<SecondaryCacheResultHandle> CompressedSecondaryCache::Lookup(
    const Slice& key, const Cache::CacheItemHelper* helper,
    Cache::CreateContext* create_context, bool /*wait*/, bool advise_erase,
-    Statistics* stats, bool& kept_in_sec_cache) {
+    bool& kept_in_sec_cache) {
  assert(helper);
-  // This is a minor optimization. Its ok to skip it in TSAN in order to
-  // avoid a false positive.
-#ifndef __SANITIZE_THREAD__
  if (disable_cache_) {
    return nullptr;
  }
-#endif

  std::unique_ptr<SecondaryCacheResultHandle> handle;
  kept_in_sec_cache = false;
@@ -51,7 +47,6 @@ std::unique_ptr<SecondaryCacheResultHandle> CompressedSecondaryCache::Lookup(
  void* handle_value = cache_->Value(lru_handle);
  if (handle_value == nullptr) {
    cache_->Release(lru_handle, /*erase_if_last_ref=*/false);
-    RecordTick(stats, COMPRESSED_SECONDARY_CACHE_DUMMY_HITS);
    return nullptr;
  }

@@ -138,7 +133,6 @@ std::unique_ptr<SecondaryCacheResultHandle> CompressedSecondaryCache::Lookup(
    cache_->Release(lru_handle, /*erase_if_last_ref=*/false);
  }
  handle.reset(new CompressedSecondaryCacheResultHandle(value, charge));
-  RecordTick(stats, COMPRESSED_SECONDARY_CACHE_HITS);
  return handle;
 }

@@ -86,7 +86,7 @@ class CompressedSecondaryCache : public SecondaryCache {
  std::unique_ptr<SecondaryCacheResultHandle> Lookup(
      const Slice& key, const Cache::CacheItemHelper* helper,
      Cache::CreateContext* create_context, bool /*wait*/, bool advise_erase,
-      Statistics* stats, bool& kept_in_sec_cache) override;
+      bool& kept_in_sec_cache) override;

  bool SupportForceErase() const override { return true; }

@@ -44,7 +44,7 @@ class CompressedSecondaryCacheTestBase : public testing::Test,
    // Lookup an non-existent key.
    std::unique_ptr<SecondaryCacheResultHandle> handle0 =
        sec_cache->Lookup(key0, GetHelper(), this, true, /*advise_erase=*/true,
-                          /*stats=*/nullptr, kept_in_sec_cache);
+                          kept_in_sec_cache);
    ASSERT_EQ(handle0, nullptr);

    Random rnd(301);
@@ -59,7 +59,7 @@ class CompressedSecondaryCacheTestBase : public testing::Test,

    std::unique_ptr<SecondaryCacheResultHandle> handle1_1 =
        sec_cache->Lookup(key1, GetHelper(), this, true, /*advise_erase=*/false,
-                          /*stats=*/nullptr, kept_in_sec_cache);
+                          kept_in_sec_cache);
    ASSERT_EQ(handle1_1, nullptr);

    // Insert and Lookup the item k1 for the second time and advise erasing it.
@@ -68,7 +68,7 @@ class CompressedSecondaryCacheTestBase : public testing::Test,

    std::unique_ptr<SecondaryCacheResultHandle> handle1_2 =
        sec_cache->Lookup(key1, GetHelper(), this, true, /*advise_erase=*/true,
-                          /*stats=*/nullptr, kept_in_sec_cache);
+                          kept_in_sec_cache);
    ASSERT_NE(handle1_2, nullptr);
    ASSERT_FALSE(kept_in_sec_cache);
    if (sec_cache_is_compressed) {
@@ -89,7 +89,7 @@ class CompressedSecondaryCacheTestBase : public testing::Test,
    // Lookup the item k1 again.
    std::unique_ptr<SecondaryCacheResultHandle> handle1_3 =
        sec_cache->Lookup(key1, GetHelper(), this, true, /*advise_erase=*/true,
-                          /*stats=*/nullptr, kept_in_sec_cache);
+                          kept_in_sec_cache);
    ASSERT_EQ(handle1_3, nullptr);

    // Insert and Lookup the item k2.
@@ -99,7 +99,7 @@ class CompressedSecondaryCacheTestBase : public testing::Test,
    ASSERT_EQ(get_perf_context()->compressed_sec_cache_insert_dummy_count, 2);
    std::unique_ptr<SecondaryCacheResultHandle> handle2_1 =
        sec_cache->Lookup(key2, GetHelper(), this, true, /*advise_erase=*/false,
-                          /*stats=*/nullptr, kept_in_sec_cache);
+                          kept_in_sec_cache);
    ASSERT_EQ(handle2_1, nullptr);

    ASSERT_OK(sec_cache->Insert(key2, &item2, GetHelper(), false));
@@ -115,7 +115,7 @@ class CompressedSecondaryCacheTestBase : public testing::Test,
    }
    std::unique_ptr<SecondaryCacheResultHandle> handle2_2 =
        sec_cache->Lookup(key2, GetHelper(), this, true, /*advise_erase=*/false,
-                          /*stats=*/nullptr, kept_in_sec_cache);
+                          kept_in_sec_cache);
    ASSERT_NE(handle2_2, nullptr);
    std::unique_ptr<TestItem> val2 =
        std::unique_ptr<TestItem>(static_cast<TestItem*>(handle2_2->Value()));
@@ -196,14 +196,14 @@ class CompressedSecondaryCacheTestBase : public testing::Test,
    bool kept_in_sec_cache{false};
    std::unique_ptr<SecondaryCacheResultHandle> handle1 =
        sec_cache->Lookup(key1, GetHelper(), this, true, /*advise_erase=*/false,
-                          /*stats=*/nullptr, kept_in_sec_cache);
+                          kept_in_sec_cache);
    ASSERT_EQ(handle1, nullptr);

    // Insert k2 and k1 is evicted.
    ASSERT_OK(sec_cache->Insert(key2, &item2, GetHelper(), false));
    std::unique_ptr<SecondaryCacheResultHandle> handle2 =
        sec_cache->Lookup(key2, GetHelper(), this, true, /*advise_erase=*/false,
-                          /*stats=*/nullptr, kept_in_sec_cache);
+                          kept_in_sec_cache);
    ASSERT_NE(handle2, nullptr);
    std::unique_ptr<TestItem> val2 =
        std::unique_ptr<TestItem>(static_cast<TestItem*>(handle2->Value()));
@@ -215,14 +215,14 @@ class CompressedSecondaryCacheTestBase : public testing::Test,

    std::unique_ptr<SecondaryCacheResultHandle> handle1_1 =
        sec_cache->Lookup(key1, GetHelper(), this, true, /*advise_erase=*/false,
-                          /*stats=*/nullptr, kept_in_sec_cache);
+                          kept_in_sec_cache);
    ASSERT_EQ(handle1_1, nullptr);

    // Create Fails.
    SetFailCreate(true);
    std::unique_ptr<SecondaryCacheResultHandle> handle2_1 =
        sec_cache->Lookup(key2, GetHelper(), this, true, /*advise_erase=*/true,
-                          /*stats=*/nullptr, kept_in_sec_cache);
+                          kept_in_sec_cache);
    ASSERT_EQ(handle2_1, nullptr);

    // Save Fails.
@@ -912,9 +912,9 @@ TEST_P(CompressedSecondaryCacheTestWithCompressionParam, EntryRoles) {
    ASSERT_EQ(get_perf_context()->compressed_sec_cache_insert_real_count, 1U);

    bool kept_in_sec_cache{true};
-    std::unique_ptr<SecondaryCacheResultHandle> handle = sec_cache->Lookup(
-        ith_key, GetHelper(role), this, true,
-        /*advise_erase=*/true, /*stats=*/nullptr, kept_in_sec_cache);
+    std::unique_ptr<SecondaryCacheResultHandle> handle =
+        sec_cache->Lookup(ith_key, GetHelper(role), this, true,
+                          /*advise_erase=*/true, kept_in_sec_cache);
    ASSERT_NE(handle, nullptr);

    // Lookup returns the right data
@@ -992,8 +992,6 @@ class CompressedSecCacheTestWithTiered
        /*_capacity=*/0,
        /*_estimated_entry_charge=*/256 << 10,
        /*_num_shard_bits=*/0);
-    // eviction_effort_cap setting simply to avoid churn in existing test
-    hcc_opts.eviction_effort_cap = 100;
    TieredCacheOptions opts;
    lru_opts.capacity = 0;
    lru_opts.num_shard_bits = 0;
@@ -1226,11 +1224,13 @@ TEST_P(CompressedSecCacheTestWithTiered, DynamicUpdate) {
  ASSERT_OK(sec_cache->GetCapacity(sec_capacity));
  ASSERT_EQ(sec_capacity, 0);

-  ASSERT_OK(UpdateTieredCache(tiered_cache, -1, 0.3));
-  EXPECT_PRED3(CacheUsageWithinBounds, GetCache()->GetUsage(), (30 << 20),
-               GetPercent(30 << 20, 1));
+  ASSERT_NOK(UpdateTieredCache(tiered_cache, -1, 0.3));
+  // Only check usage for LRU cache. HCC shows a 64KB usage for some reason
+  if (std::get<0>(GetParam()) == PrimaryCacheType::kCacheTypeLRU) {
+    ASSERT_EQ(GetCache()->GetUsage(), 0);
+  }
  ASSERT_OK(sec_cache->GetCapacity(sec_capacity));
-  ASSERT_EQ(sec_capacity, (30 << 20));
+  ASSERT_EQ(sec_capacity, 0);
 }

 TEST_P(CompressedSecCacheTestWithTiered, DynamicUpdateWithReservation) {
@@ -1316,50 +1316,28 @@ TEST_P(CompressedSecCacheTestWithTiered, DynamicUpdateWithReservation) {
  ASSERT_OK(sec_cache->GetCapacity(sec_capacity));
  ASSERT_EQ(sec_capacity, 0);

-  ASSERT_OK(UpdateTieredCache(tiered_cache, -1, 0.3));
-  EXPECT_PRED3(CacheUsageWithinBounds, GetCache()->GetUsage(), (37 << 20),
-               GetPercent(37 << 20, 1));
-  EXPECT_PRED3(CacheUsageWithinBounds, sec_cache->TEST_GetUsage(), (3 << 20),
-               GetPercent(3 << 20, 1));
-  ASSERT_OK(sec_cache->GetCapacity(sec_capacity));
-  ASSERT_EQ(sec_capacity, 30 << 20);
-
  ASSERT_OK(cache_res_mgr()->UpdateCacheReservation(0));
 }

-TEST_P(CompressedSecCacheTestWithTiered, ReservationOverCapacity) {
-  CompressedSecondaryCache* sec_cache =
-      reinterpret_cast<CompressedSecondaryCache*>(GetSecondaryCache());
+TEST_P(CompressedSecCacheTestWithTiered,
+       DynamicUpdateWithReservationUnderflow) {
  std::shared_ptr<Cache> tiered_cache = GetTieredCache();
+  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->LoadDependency(
+      {{"CacheWithSecondaryAdapter::Release:ChargeSecCache1",
+        "CacheWithSecondaryAdapter::UpdateCacheReservationRatio:Begin"},
+       {"CacheWithSecondaryAdapter::UpdateCacheReservationRatio:End",
+        "CacheWithSecondaryAdapter::Release:ChargeSecCache2"}});
+  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->EnableProcessing();

-  ASSERT_OK(cache_res_mgr()->UpdateCacheReservation(110 << 20));
-  // Use EXPECT_PRED3 instead of EXPECT_NEAR to void too many size_t to
-  // double explicit casts
-  EXPECT_PRED3(CacheUsageWithinBounds, GetCache()->GetUsage(), (110 << 20),
-               GetPercent(110 << 20, 1));
-  EXPECT_PRED3(CacheUsageWithinBounds, sec_cache->TEST_GetUsage(), (30 << 20),
-               GetPercent(30 << 20, 1));
-  size_t sec_capacity;
-  ASSERT_OK(sec_cache->GetCapacity(sec_capacity));
-  ASSERT_EQ(sec_capacity, (30 << 20));
+  port::Thread reserve_release_thread([&]() {
+    EXPECT_EQ(cache_res_mgr()->UpdateCacheReservation(50), Status::OK());
+    EXPECT_EQ(cache_res_mgr()->UpdateCacheReservation(0), Status::OK());
+  });
+  ASSERT_OK(UpdateTieredCache(tiered_cache, 100 << 20, 0.01));
+  reserve_release_thread.join();
+  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->DisableProcessing();

-  ASSERT_OK(UpdateTieredCache(tiered_cache, -1, 0.39));
-  EXPECT_PRED3(CacheUsageWithinBounds, GetCache()->GetUsage(), (110 << 20),
-               GetPercent(110 << 20, 1));
-  EXPECT_PRED3(CacheUsageWithinBounds, sec_cache->TEST_GetUsage(), (39 << 20),
-               GetPercent(39 << 20, 1));
-  ASSERT_OK(sec_cache->GetCapacity(sec_capacity));
-  ASSERT_EQ(sec_capacity, (39 << 20));
-
-  ASSERT_OK(cache_res_mgr()->UpdateCacheReservation(90 << 20));
-  EXPECT_PRED3(CacheUsageWithinBounds, GetCache()->GetUsage(), (94 << 20),
-               GetPercent(94 << 20, 1));
-  EXPECT_PRED3(CacheUsageWithinBounds, sec_cache->TEST_GetUsage(), (35 << 20),
-               GetPercent(35 << 20, 1));
-  ASSERT_OK(sec_cache->GetCapacity(sec_capacity));
-  ASSERT_EQ(sec_capacity, (39 << 20));
-
-  ASSERT_OK(cache_res_mgr()->UpdateCacheReservation(0));
+  ASSERT_OK(UpdateTieredCache(tiered_cache, 100 << 20, 0.3));
 }

 INSTANTIATE_TEST_CASE_P(
@@ -389,13 +389,12 @@ class ClockCacheTest : public testing::Test {
    }
  }

-  void NewShard(size_t capacity, bool strict_capacity_limit = true,
-                int eviction_effort_cap = 30) {
+  void NewShard(size_t capacity, bool strict_capacity_limit = true) {
    DeleteShard();
    shard_ =
        reinterpret_cast<Shard*>(port::cacheline_aligned_alloc(sizeof(Shard)));

-    TableOpts opts{1 /*value_size*/, eviction_effort_cap};
+    TableOpts opts{1 /*value_size*/};
    new (shard_)
        Shard(capacity, strict_capacity_limit, kDontChargeCacheMetadata,
              /*allocator*/ nullptr, &eviction_callback_, &hash_seed_, opts);
@@ -446,20 +445,12 @@ class ClockCacheTest : public testing::Test {
    return Slice(reinterpret_cast<const char*>(&hashed_key), 16U);
  }

-  // A bad hash function for testing / stressing collision handling
  static inline UniqueId64x2 TestHashedKey(char key) {
    // For testing hash near-collision behavior, put the variance in
    // hashed_key in bits that are unlikely to be used as hash bits.
    return {(static_cast<uint64_t>(key) << 56) + 1234U, 5678U};
  }

-  // A reasonable hash function, for testing "typical behavior" etc.
-  template <typename T>
-  static inline UniqueId64x2 CheapHash(T i) {
-    return {static_cast<uint64_t>(i) * uint64_t{0x85EBCA77C2B2AE63},
-            static_cast<uint64_t>(i) * uint64_t{0xC2B2AE3D27D4EB4F}};
-  }
-
  Shard* shard_ = nullptr;

 private:
@@ -692,53 +683,6 @@ TYPED_TEST(ClockCacheTest, ClockEvictionTest) {
  }
 }

-TYPED_TEST(ClockCacheTest, ClockEvictionEffortCapTest) {
-  using HandleImpl = typename ClockCacheTest<TypeParam>::Shard::HandleImpl;
-  for (bool strict_capacity_limit : {true, false}) {
-    SCOPED_TRACE("strict_capacity_limit = " +
-                 std::to_string(strict_capacity_limit));
-    for (int eec : {-42, 0, 1, 10, 100, 1000}) {
-      SCOPED_TRACE("eviction_effort_cap = " + std::to_string(eec));
-      constexpr size_t kCapacity = 1000;
-      // Start with much larger capacity to ensure that we can go way over
-      // capacity without reaching table occupancy limit.
-      this->NewShard(3 * kCapacity, strict_capacity_limit, eec);
-      auto& shard = *this->shard_;
-      shard.SetCapacity(kCapacity);
-
-      // Nearly fill the cache with pinned entries, then add a bunch of
-      // non-pinned entries. eviction_effort_cap should affect how many
-      // evictable entries are present beyond the cache capacity, despite
-      // being evictable.
-      constexpr size_t kCount = kCapacity - 1;
-      std::unique_ptr<HandleImpl* []> ha { new HandleImpl* [kCount] {} };
-      for (size_t i = 0; i < 2 * kCount; ++i) {
-        UniqueId64x2 hkey = this->CheapHash(i);
-        ASSERT_OK(shard.Insert(
-            this->TestKey(hkey), hkey, nullptr /*value*/, &kNoopCacheItemHelper,
-            1 /*charge*/, i < kCount ? &ha[i] : nullptr, Cache::Priority::LOW));
-      }
-
-      if (strict_capacity_limit) {
-        // If strict_capacity_limit is enabled, the cache will never exceed its
-        // capacity
-        EXPECT_EQ(shard.GetOccupancyCount(), kCapacity);
-      } else {
-        // Rough inverse relationship between cap and possible memory
-        // explosion, which shows up as increased table occupancy count.
-        int effective_eec = std::max(int{1}, eec) + 1;
-        EXPECT_NEAR(shard.GetOccupancyCount() * 1.0,
-                    kCount * (1 + 1.4 / effective_eec),
-                    kCount * (0.6 / effective_eec) + 1.0);
-      }
-
-      for (size_t i = 0; i < kCount; ++i) {
-        shard.Release(ha[i]);
-      }
-    }
-  }
-}
-
 namespace {
 struct DeleteCounter {
  int deleted = 0;
@@ -1091,8 +1035,7 @@ class TestSecondaryCache : public SecondaryCache {
  std::unique_ptr<SecondaryCacheResultHandle> Lookup(
      const Slice& key, const Cache::CacheItemHelper* helper,
      Cache::CreateContext* create_context, bool /*wait*/,
-      bool /*advise_erase*/, Statistics* /*stats*/,
-      bool& kept_in_sec_cache) override {
+      bool /*advise_erase*/, bool& kept_in_sec_cache) override {
    std::string key_str = key.ToString();
    TEST_SYNC_POINT_CALLBACK("TestSecondaryCache::Lookup", &key_str);

@@ -83,10 +83,7 @@ CacheWithSecondaryAdapter::CacheWithSecondaryAdapter(
    : CacheWrapper(std::move(target)),
      secondary_cache_(std::move(secondary_cache)),
      adm_policy_(adm_policy),
-      distribute_cache_res_(distribute_cache_res),
-      placeholder_usage_(0),
-      reserved_usage_(0),
-      sec_reserved_(0) {
+      distribute_cache_res_(distribute_cache_res) {
  target_->SetEvictionCallback(
      [this](const Slice& key, Handle* handle, bool was_hit) {
        return EvictionHandler(key, handle, was_hit);
@@ -106,7 +103,8 @@ CacheWithSecondaryAdapter::CacheWithSecondaryAdapter(
    // secondary cache is freed from the reservation.
    s = pri_cache_res_->UpdateCacheReservation(sec_capacity);
    assert(s.ok());
-    sec_cache_res_ratio_ = (double)sec_capacity / target_->GetCapacity();
+    sec_cache_res_ratio_.store((double)sec_capacity / target_->GetCapacity(),
+                               std::memory_order_relaxed);
  }
 }

@@ -115,12 +113,10 @@ CacheWithSecondaryAdapter::~CacheWithSecondaryAdapter() {
  // use after free
  target_->SetEvictionCallback({});
 #ifndef NDEBUG
-  if (distribute_cache_res_) {
+  if (distribute_cache_res_ && !ratio_changed_) {
    size_t sec_capacity = 0;
    Status s = secondary_cache_->GetCapacity(sec_capacity);
    assert(s.ok());
-    assert(placeholder_usage_ == 0);
-    assert(reserved_usage_ == 0);
    assert(pri_cache_res_->GetTotalMemoryUsed() == sec_capacity);
  }
 #endif  // NDEBUG
@@ -240,31 +236,13 @@ Status CacheWithSecondaryAdapter::Insert(const Slice& key, ObjectPtr value,
                                         const Slice& compressed_value,
                                         CompressionType type) {
  Status s = target_->Insert(key, value, helper, charge, handle, priority);
-  if (s.ok() && value == nullptr && distribute_cache_res_ && handle) {
-    charge = target_->GetCharge(*handle);
-
-    MutexLock l(&cache_res_mutex_);
-    placeholder_usage_ += charge;
-    // Check if total placeholder reservation is more than the overall
-    // cache capacity. If it is, then we don't try to charge the
-    // secondary cache because we don't want to overcharge it (beyond
-    // its capacity).
-    // In order to make this a bit more lightweight, we also check if
-    // the difference between placeholder_usage_ and reserved_usage_ is
-    // atleast kReservationChunkSize and avoid any adjustments if not.
-    if ((placeholder_usage_ <= target_->GetCapacity()) &&
-        ((placeholder_usage_ - reserved_usage_) >= kReservationChunkSize)) {
-      reserved_usage_ = placeholder_usage_ & ~(kReservationChunkSize - 1);
-      size_t new_sec_reserved =
-          static_cast<size_t>(reserved_usage_ * sec_cache_res_ratio_);
-      size_t sec_charge = new_sec_reserved - sec_reserved_;
-      s = secondary_cache_->Deflate(sec_charge);
-      assert(s.ok());
-      s = pri_cache_res_->UpdateCacheReservation(sec_charge,
-                                                 /*increase=*/false);
-      assert(s.ok());
-      sec_reserved_ += sec_charge;
-    }
+  if (s.ok() && value == nullptr && distribute_cache_res_) {
+    size_t sec_charge = static_cast<size_t>(
+        charge * (sec_cache_res_ratio_.load(std::memory_order_relaxed)));
+    s = secondary_cache_->Deflate(sec_charge);
+    assert(s.ok());
+    s = pri_cache_res_->UpdateCacheReservation(sec_charge, /*increase=*/false);
+    assert(s.ok());
  }
  // Warm up the secondary cache with the compressed block. The secondary
  // cache may choose to ignore it based on the admission policy.
@@ -294,8 +272,7 @@ Cache::Handle* CacheWithSecondaryAdapter::Lookup(const Slice& key,
    bool kept_in_sec_cache = false;
    std::unique_ptr<SecondaryCacheResultHandle> secondary_handle =
        secondary_cache_->Lookup(key, helper, create_context, /*wait*/ true,
-                                 found_dummy_entry, stats,
-                                 /*out*/ kept_in_sec_cache);
+                                 found_dummy_entry, /*out*/ kept_in_sec_cache);
    if (secondary_handle) {
      result = Promote(std::move(secondary_handle), key, helper, priority,
                       stats, found_dummy_entry, kept_in_sec_cache);
@@ -310,27 +287,14 @@ bool CacheWithSecondaryAdapter::Release(Handle* handle,
    ObjectPtr v = target_->Value(handle);
    if (v == nullptr && distribute_cache_res_) {
      size_t charge = target_->GetCharge(handle);
-
-      MutexLock l(&cache_res_mutex_);
-      placeholder_usage_ -= charge;
-      // Check if total placeholder reservation is more than the overall
-      // cache capacity. If it is, then we do nothing as reserved_usage_ must
-      // be already maxed out
-      if ((placeholder_usage_ <= target_->GetCapacity()) &&
-          (placeholder_usage_ < reserved_usage_)) {
-        // Adjust reserved_usage_ in chunks of kReservationChunkSize, so
-        // we don't hit this slow path too often.
-        reserved_usage_ = placeholder_usage_ & ~(kReservationChunkSize - 1);
-        size_t new_sec_reserved =
-            static_cast<size_t>(reserved_usage_ * sec_cache_res_ratio_);
-        size_t sec_charge = sec_reserved_ - new_sec_reserved;
-        Status s = secondary_cache_->Inflate(sec_charge);
-        assert(s.ok());
-        s = pri_cache_res_->UpdateCacheReservation(sec_charge,
-                                                   /*increase=*/true);
-        assert(s.ok());
-        sec_reserved_ -= sec_charge;
-      }
+      size_t sec_charge = static_cast<size_t>(
+          charge * (sec_cache_res_ratio_.load(std::memory_order_relaxed)));
+      TEST_SYNC_POINT("CacheWithSecondaryAdapter::Release:ChargeSecCache1");
+      TEST_SYNC_POINT("CacheWithSecondaryAdapter::Release:ChargeSecCache2");
+      Status s = secondary_cache_->Inflate(sec_charge);
+      assert(s.ok());
+      s = pri_cache_res_->UpdateCacheReservation(sec_charge, /*increase=*/true);
+      assert(s.ok());
    }
  }
  return target_->Release(handle, erase_if_last_ref);
@@ -349,10 +313,10 @@ void CacheWithSecondaryAdapter::StartAsyncLookupOnMySecondary(
  assert(async_handle.result_handle == nullptr);

  std::unique_ptr<SecondaryCacheResultHandle> secondary_handle =
-      secondary_cache_->Lookup(
-          async_handle.key, async_handle.helper, async_handle.create_context,
-          /*wait*/ false, async_handle.found_dummy_entry, async_handle.stats,
-          /*out*/ async_handle.kept_in_sec_cache);
+      secondary_cache_->Lookup(async_handle.key, async_handle.helper,
+                               async_handle.create_context, /*wait*/ false,
+                               async_handle.found_dummy_entry,
+                               /*out*/ async_handle.kept_in_sec_cache);
  if (secondary_handle) {
    // TODO with stacked secondaries: Check & process if already ready?
    async_handle.pending_handle = secondary_handle.release();
@@ -477,11 +441,13 @@ const char* CacheWithSecondaryAdapter::Name() const {
 // where the new capacity < total cache reservations.
 void CacheWithSecondaryAdapter::SetCapacity(size_t capacity) {
  size_t sec_capacity = static_cast<size_t>(
-      capacity * (distribute_cache_res_ ? sec_cache_res_ratio_ : 0.0));
+      capacity * (distribute_cache_res_
+                      ? sec_cache_res_ratio_.load(std::memory_order_relaxed)
+                      : 0.0));
  size_t old_sec_capacity = 0;

  if (distribute_cache_res_) {
-    MutexLock m(&cache_res_mutex_);
+    MutexLock m(&mutex_);

    Status s = secondary_cache_->GetCapacity(old_sec_capacity);
    if (!s.ok()) {
@@ -496,17 +462,9 @@ void CacheWithSecondaryAdapter::SetCapacity(size_t capacity) {
      // 3. Decrease the primary cache capacity to the total budget
      s = secondary_cache_->SetCapacity(sec_capacity);
      if (s.ok()) {
-        if (placeholder_usage_ > capacity) {
-          // Adjust reserved_usage_ down
-          reserved_usage_ = capacity & ~(kReservationChunkSize - 1);
-        }
-        size_t new_sec_reserved =
-            static_cast<size_t>(reserved_usage_ * sec_cache_res_ratio_);
        s = pri_cache_res_->UpdateCacheReservation(
-            (old_sec_capacity - sec_capacity) -
-                (sec_reserved_ - new_sec_reserved),
+            old_sec_capacity - sec_capacity,
            /*increase=*/false);
-        sec_reserved_ = new_sec_reserved;
        assert(s.ok());
        target_->SetCapacity(capacity);
      }
@@ -540,7 +498,7 @@ Status CacheWithSecondaryAdapter::GetSecondaryCachePinnedUsage(
    size_t& size) const {
  Status s;
  if (distribute_cache_res_) {
-    MutexLock m(&cache_res_mutex_);
+    MutexLock m(&mutex_);
    size_t capacity = 0;
    s = secondary_cache_->GetCapacity(capacity);
    if (s.ok()) {
@@ -568,11 +526,12 @@ Status CacheWithSecondaryAdapter::GetSecondaryCachePinnedUsage(
 // in the future.
 Status CacheWithSecondaryAdapter::UpdateCacheReservationRatio(
    double compressed_secondary_ratio) {
-  if (!distribute_cache_res_) {
+  if (!distribute_cache_res_ ||
+      sec_cache_res_ratio_.load(std::memory_order_relaxed) == 0.0) {
    return Status::NotSupported();
  }

-  MutexLock m(&cache_res_mutex_);
+  MutexLock m(&mutex_);
  size_t pri_capacity = target_->GetCapacity();
  size_t sec_capacity =
      static_cast<size_t>(pri_capacity * compressed_secondary_ratio);
@@ -582,17 +541,38 @@ Status CacheWithSecondaryAdapter::UpdateCacheReservationRatio(
    return s;
  }

+  TEST_SYNC_POINT(
+      "CacheWithSecondaryAdapter::UpdateCacheReservationRatio:Begin");
+
+  // There's a possible race condition here. Since the read of pri_cache_res_
+  // memory used (secondary cache usage charged to primary cache), and the
+  // change to sec_cache_res_ratio_ are not guarded by a mutex, its possible
+  // that an Insert/Release in another thread might decrease/increase the
+  // pri_cache_res_ reservation by the wrong amount. This should not be a
+  // problem because updating the sec/pri ratio is a rare operation, and
+  // the worst that can happen is we may over/under charge the secondary
+  // cache usage by a little bit. But we do need to protect against
+  // underflow of old_sec_reserved.
+  // TODO: Make the accounting more accurate by tracking the total memory
+  // reservation on the primary cache. This will also allow us to remove
+  // the restriction of not being able to change the sec/pri ratio from
+  // 0.0 to higher.
+  size_t sec_charge_to_pri = pri_cache_res_->GetTotalMemoryUsed();
+  size_t old_sec_reserved = (old_sec_capacity > sec_charge_to_pri)
+                                ? (old_sec_capacity - sec_charge_to_pri)
+                                : 0;
  // Calculate the new secondary cache reservation
-  // reserved_usage_ will never be > the cache capacity, so we don't
-  // have to worry about adjusting it here.
-  sec_cache_res_ratio_ = compressed_secondary_ratio;
-  size_t new_sec_reserved =
-      static_cast<size_t>(reserved_usage_ * sec_cache_res_ratio_);
+  size_t sec_reserved = static_cast<size_t>(
+      old_sec_reserved *
+      (double)(compressed_secondary_ratio /
+               sec_cache_res_ratio_.load(std::memory_order_relaxed)));
+  sec_cache_res_ratio_.store(compressed_secondary_ratio,
+                             std::memory_order_relaxed);
  if (sec_capacity > old_sec_capacity) {
    // We're increasing the ratio, thus ending up with a larger secondary
    // cache and a smaller usable primary cache capacity. Similar to
    // SetCapacity(), we try to avoid a temporary increase in total usage
-    // beyond the configured capacity -
+    // beyond teh configured capacity -
    // 1. A higher secondary cache ratio means it gets a higher share of
    //    cache reservations. So first account for that by deflating the
    //    secondary cache
@@ -600,13 +580,12 @@ Status CacheWithSecondaryAdapter::UpdateCacheReservationRatio(
    //    cache utilization (increase in capacity - increase in share of cache
    //    reservation)
    // 3. Increase secondary cache capacity
-    s = secondary_cache_->Deflate(new_sec_reserved - sec_reserved_);
+    s = secondary_cache_->Deflate(sec_reserved - old_sec_reserved);
    assert(s.ok());
    s = pri_cache_res_->UpdateCacheReservation(
-        (sec_capacity - old_sec_capacity) - (new_sec_reserved - sec_reserved_),
+        (sec_capacity - old_sec_capacity) - (sec_reserved - old_sec_reserved),
        /*increase=*/true);
    assert(s.ok());
-    sec_reserved_ = new_sec_reserved;
    s = secondary_cache_->SetCapacity(sec_capacity);
    assert(s.ok());
  } else {
@@ -620,16 +599,21 @@ Status CacheWithSecondaryAdapter::UpdateCacheReservationRatio(
    s = secondary_cache_->SetCapacity(sec_capacity);
    if (s.ok()) {
      s = pri_cache_res_->UpdateCacheReservation(
-          (old_sec_capacity - sec_capacity) -
-              (sec_reserved_ - new_sec_reserved),
+          (old_sec_capacity - sec_capacity) - (old_sec_reserved - sec_reserved),
          /*increase=*/false);
      assert(s.ok());
-      s = secondary_cache_->Inflate(sec_reserved_ - new_sec_reserved);
+      s = secondary_cache_->Inflate(old_sec_reserved - sec_reserved);
      assert(s.ok());
-      sec_reserved_ = new_sec_reserved;
    }
  }

+  TEST_SYNC_POINT("CacheWithSecondaryAdapter::UpdateCacheReservationRatio:End");
+#ifndef NDEBUG
+  // As mentioned in the function comments, we may accumulate some erros when
+  // the ratio is changed. We set a flag here which disables some assertions
+  // in the destructor
+  ratio_changed_ = true;
+#endif
  return s;
 }

@@ -684,14 +668,12 @@ std::shared_ptr<Cache> NewTieredCache(const TieredCacheOptions& _opts) {
        *(static_cast_with_check<LRUCacheOptions, ShardedCacheOptions>(
            opts.cache_opts));
    cache_opts.capacity = opts.total_capacity;
-    cache_opts.secondary_cache = nullptr;
    cache = cache_opts.MakeSharedCache();
  } else if (opts.cache_type == PrimaryCacheType::kCacheTypeHCC) {
    HyperClockCacheOptions cache_opts =
        *(static_cast_with_check<HyperClockCacheOptions, ShardedCacheOptions>(
            opts.cache_opts));
    cache_opts.capacity = opts.total_capacity;
-    cache_opts.secondary_cache = nullptr;
    cache = cache_opts.MakeSharedCache();
  } else {
    return nullptr;
@@ -60,8 +60,6 @@ class CacheWithSecondaryAdapter : public CacheWrapper {
  SecondaryCache* TEST_GetSecondaryCache() { return secondary_cache_.get(); }

 private:
-  static constexpr size_t kReservationChunkSize = 1 << 20;
-
  bool EvictionHandler(const Slice& key, Handle* handle, bool was_hit);

  void StartAsyncLookupOnMySecondary(AsyncLookupHandle& async_handle);
@@ -86,18 +84,11 @@ class CacheWithSecondaryAdapter : public CacheWrapper {
  std::shared_ptr<ConcurrentCacheReservationManager> pri_cache_res_;
  // Fraction of a cache memory reservation to be assigned to the secondary
  // cache
-  double sec_cache_res_ratio_;
-  // Mutex for use when managing cache memory reservations. Should not be used
-  // for other purposes, as it may risk causing deadlocks.
-  mutable port::Mutex cache_res_mutex_;
-  // Total memory reserved by placeholder entriesin the cache
-  size_t placeholder_usage_;
-  // Total placeholoder memory charged to both the primary and secondary
-  // caches. Will be <= placeholder_usage_.
-  size_t reserved_usage_;
-  // Amount of memory reserved in the secondary cache. This should be
-  // reserved_usage_ * sec_cache_res_ratio_ in steady state.
-  size_t sec_reserved_;
+  std::atomic<double> sec_cache_res_ratio_;
+  mutable port::Mutex mutex_;
+#ifndef NDEBUG
+  bool ratio_changed_ = false;
+#endif
 };

 }  // namespace ROCKSDB_NAMESPACE
@@ -5,8 +5,6 @@

 #include "cache/tiered_secondary_cache.h"

-#include "monitoring/statistics_impl.h"
-
 namespace ROCKSDB_NAMESPACE {

 // Creation callback for use in the lookup path. It calls the upper layer
@@ -31,9 +29,6 @@ Status TieredSecondaryCache::MaybeInsertAndCreate(
    // TODO: Don't hardcode the source
    context->comp_sec_cache->InsertSaved(*context->key, data, type, source)
        .PermitUncheckedError();
-    RecordTick(context->stats, COMPRESSED_SECONDARY_CACHE_PROMOTIONS);
-  } else {
-    RecordTick(context->stats, COMPRESSED_SECONDARY_CACHE_PROMOTION_SKIPS);
  }
  // Primary cache will accept the object, so call its helper to create
  // the object
@@ -48,10 +43,10 @@ Status TieredSecondaryCache::MaybeInsertAndCreate(
 std::unique_ptr<SecondaryCacheResultHandle> TieredSecondaryCache::Lookup(
    const Slice& key, const Cache::CacheItemHelper* helper,
    Cache::CreateContext* create_context, bool wait, bool advise_erase,
-    Statistics* stats, bool& kept_in_sec_cache) {
+    bool& kept_in_sec_cache) {
  bool dummy = false;
  std::unique_ptr<SecondaryCacheResultHandle> result =
-      target()->Lookup(key, helper, create_context, wait, advise_erase, stats,
+      target()->Lookup(key, helper, create_context, wait, advise_erase,
                       /*kept_in_sec_cache=*/dummy);
  // We never want the item to spill back into the secondary cache
  kept_in_sec_cache = true;
@@ -71,10 +66,9 @@ std::unique_ptr<SecondaryCacheResultHandle> TieredSecondaryCache::Lookup(
    ctx.helper = helper;
    ctx.inner_ctx = create_context;
    ctx.comp_sec_cache = target();
-    ctx.stats = stats;

    return nvm_sec_cache_->Lookup(key, outer_helper, &ctx, wait, advise_erase,
-                                  stats, kept_in_sec_cache);
+                                  kept_in_sec_cache);
  }

  // If wait is false, i.e its an async lookup, we have to allocate a result
@@ -86,10 +80,8 @@ std::unique_ptr<SecondaryCacheResultHandle> TieredSecondaryCache::Lookup(
  handle->ctx()->helper = helper;
  handle->ctx()->inner_ctx = create_context;
  handle->ctx()->comp_sec_cache = target();
-  handle->ctx()->stats = stats;
-  handle->SetInnerHandle(
-      nvm_sec_cache_->Lookup(key, outer_helper, handle->ctx(), wait,
-                             advise_erase, stats, kept_in_sec_cache));
+  handle->SetInnerHandle(nvm_sec_cache_->Lookup(
+      key, outer_helper, handle->ctx(), wait, advise_erase, kept_in_sec_cache));
  if (!handle->inner_handle()) {
    handle.reset();
  } else {
@@ -117,8 +109,10 @@ void TieredSecondaryCache::WaitAll(
  }
  nvm_sec_cache_->WaitAll(nvm_handles);
  for (auto handle : my_handles) {
-    assert(handle->inner_handle()->IsReady());
-    handle->Complete();
+    assert(handle->IsReady());
+    auto nvm_handle = handle->inner_handle();
+    handle->SetSize(nvm_handle->Size());
+    handle->SetValue(nvm_handle->Value());
  }
 }

@@ -59,7 +59,7 @@ class TieredSecondaryCache : public SecondaryCacheWrapper {
  virtual std::unique_ptr<SecondaryCacheResultHandle> Lookup(
      const Slice& key, const Cache::CacheItemHelper* helper,
      Cache::CreateContext* create_context, bool wait, bool advise_erase,
-      Statistics* stats, bool& kept_in_sec_cache) override;
+      bool& kept_in_sec_cache) override;

  virtual void WaitAll(
      std::vector<SecondaryCacheResultHandle*> handles) override;
@@ -72,7 +72,6 @@ class TieredSecondaryCache : public SecondaryCacheWrapper {
    Cache::CreateContext* inner_ctx;
    std::shared_ptr<SecondaryCacheResultHandle> inner_handle;
    SecondaryCache* comp_sec_cache;
-    Statistics* stats;
  };

  class ResultHandle : public SecondaryCacheResultHandle {
@@ -80,10 +79,7 @@ class TieredSecondaryCache : public SecondaryCacheWrapper {
    ~ResultHandle() override {}

    bool IsReady() override {
-      if (inner_handle_ && inner_handle_->IsReady()) {
-        Complete();
-      }
-      return ready_;
+      return !inner_handle_ || inner_handle_->IsReady();
    }

    void Wait() override {
@@ -96,10 +92,10 @@ class TieredSecondaryCache : public SecondaryCacheWrapper {
    Cache::ObjectPtr Value() override { return value_; }

    void Complete() {
+      assert(IsReady());
      size_ = inner_handle_->Size();
      value_ = inner_handle_->Value();
      inner_handle_.reset();
-      ready_ = true;
    }

    void SetInnerHandle(std::unique_ptr<SecondaryCacheResultHandle>&& handle) {
@@ -119,7 +115,6 @@ class TieredSecondaryCache : public SecondaryCacheWrapper {
    CreateContext ctx_;
    size_t size_;
    Cache::ObjectPtr value_;
-    bool ready_ = false;
  };

  static void NoopDelete(Cache::ObjectPtr /*obj*/,
@@ -15,11 +15,10 @@ namespace ROCKSDB_NAMESPACE {

 class TestSecondaryCache : public SecondaryCache {
 public:
-  explicit TestSecondaryCache(size_t capacity, bool ready_before_wait)
+  explicit TestSecondaryCache(size_t capacity)
      : cache_(NewLRUCache(capacity, 0, false, 0.5 /* high_pri_pool_ratio */,
                           nullptr, kDefaultToAdaptiveMutex,
                           kDontChargeCacheMetadata)),
-        ready_before_wait_(ready_before_wait),
        num_insert_saved_(0),
        num_hits_(0),
        num_misses_(0) {}
@@ -62,7 +61,7 @@ class TestSecondaryCache : public SecondaryCache {
  std::unique_ptr<SecondaryCacheResultHandle> Lookup(
      const Slice& key, const Cache::CacheItemHelper* helper,
      Cache::CreateContext* create_context, bool wait, bool /*advise_erase*/,
-      Statistics* /*stats*/, bool& kept_in_sec_cache) override {
+      bool& kept_in_sec_cache) override {
    std::string key_str = key.ToString();
    TEST_SYNC_POINT_CALLBACK("TestSecondaryCache::Lookup", &key_str);

@@ -89,8 +88,7 @@ class TestSecondaryCache : public SecondaryCache {
                            /*alloc*/ nullptr, &value, &charge);
      if (s.ok()) {
        secondary_handle.reset(new TestSecondaryCacheResultHandle(
-            cache_.get(), handle, value, charge,
-            /*ready=*/wait || ready_before_wait_));
+            cache_.get(), handle, value, charge, /*ready=*/wait));
        kept_in_sec_cache = true;
      } else {
        cache_.Release(handle);
@@ -170,7 +168,6 @@ class TestSecondaryCache : public SecondaryCache {
      BasicTypedSharedCacheInterface<char[], CacheEntryRole::kMisc>;
  using TypedHandle = SharedCache::TypedHandle;
  SharedCache cache_;
-  bool ready_before_wait_;
  uint32_t num_insert_saved_;
  uint32_t num_hits_;
  uint32_t num_misses_;
@@ -182,10 +179,11 @@ class DBTieredSecondaryCacheTest : public DBTestBase {
  DBTieredSecondaryCacheTest()
      : DBTestBase("db_tiered_secondary_cache_test", /*env_do_fsync=*/true) {}

-  std::shared_ptr<Cache> NewCache(
-      size_t pri_capacity, size_t compressed_capacity, size_t nvm_capacity,
-      TieredAdmissionPolicy adm_policy = TieredAdmissionPolicy::kAdmPolicyAuto,
-      bool ready_before_wait = false) {
+  std::shared_ptr<Cache> NewCache(size_t pri_capacity,
+                                  size_t compressed_capacity,
+                                  size_t nvm_capacity,
+                                  TieredAdmissionPolicy adm_policy =
+                                      TieredAdmissionPolicy::kAdmPolicyAuto) {
    LRUCacheOptions lru_opts;
    TieredCacheOptions opts;
    lru_opts.capacity = 0;
@@ -196,11 +194,10 @@ class DBTieredSecondaryCacheTest : public DBTestBase {
    opts.comp_cache_opts.capacity = 0;
    opts.comp_cache_opts.num_shard_bits = 0;
    opts.total_capacity = pri_capacity + compressed_capacity;
-    opts.compressed_secondary_ratio = compressed_secondary_ratio_ =
+    opts.compressed_secondary_ratio =
        (double)compressed_capacity / opts.total_capacity;
    if (nvm_capacity > 0) {
-      nvm_sec_cache_.reset(
-          new TestSecondaryCache(nvm_capacity, ready_before_wait));
+      nvm_sec_cache_.reset(new TestSecondaryCache(nvm_capacity));
      opts.nvm_sec_cache = nvm_sec_cache_;
    }
    opts.adm_policy = adm_policy;
@@ -210,12 +207,6 @@ class DBTieredSecondaryCacheTest : public DBTestBase {
    return cache_;
  }

-  void ClearPrimaryCache() {
-    ASSERT_EQ(UpdateTieredCache(cache_, -1, 1.0), Status::OK());
-    ASSERT_EQ(UpdateTieredCache(cache_, -1, compressed_secondary_ratio_),
-              Status::OK());
-  }
-
  TestSecondaryCache* nvm_sec_cache() { return nvm_sec_cache_.get(); }

  CompressedSecondaryCache* compressed_secondary_cache() {
@@ -227,7 +218,6 @@ class DBTieredSecondaryCacheTest : public DBTestBase {
 private:
  std::shared_ptr<Cache> cache_;
  std::shared_ptr<TestSecondaryCache> nvm_sec_cache_;
-  double compressed_secondary_ratio_;
 };

 // In this test, the block size is set to 4096. Each value is 1007 bytes, so
@@ -592,116 +582,6 @@ TEST_F(DBTieredSecondaryCacheTest, WaitAllTest) {
  Destroy(options);
 }

-TEST_F(DBTieredSecondaryCacheTest, ReadyBeforeWaitAllTest) {
-  if (!LZ4_Supported()) {
-    ROCKSDB_GTEST_SKIP("This test requires LZ4 support.");
-    return;
-  }
-
-  BlockBasedTableOptions table_options;
-  table_options.block_cache = NewCache(250 * 1024, 20 * 1024, 256 * 1024,
-                                       TieredAdmissionPolicy::kAdmPolicyAuto,
-                                       /*ready_before_wait=*/true);
-  table_options.block_size = 4 * 1024;
-  table_options.cache_index_and_filter_blocks = false;
-  Options options = GetDefaultOptions();
-  options.create_if_missing = true;
-  options.table_factory.reset(NewBlockBasedTableFactory(table_options));
-  options.statistics = CreateDBStatistics();
-
-  options.paranoid_file_checks = false;
-  DestroyAndReopen(options);
-  Random rnd(301);
-  const int N = 256;
-  for (int i = 0; i < N; i++) {
-    std::string p_v;
-    test::CompressibleString(&rnd, 0.5, 1007, &p_v);
-    ASSERT_OK(Put(Key(i), p_v));
-  }
-
-  ASSERT_OK(Flush());
-
-  std::vector<std::string> keys;
-  std::vector<std::string> values;
-
-  keys.push_back(Key(0));
-  keys.push_back(Key(4));
-  keys.push_back(Key(8));
-  values = MultiGet(keys, /*snapshot=*/nullptr, /*async=*/true);
-  ASSERT_EQ(values.size(), keys.size());
-  for (auto value : values) {
-    ASSERT_EQ(1007, value.size());
-  }
-  ASSERT_EQ(nvm_sec_cache()->num_insert_saved(), 3u);
-  ASSERT_EQ(nvm_sec_cache()->num_misses(), 3u);
-  ASSERT_EQ(nvm_sec_cache()->num_hits(), 0u);
-  ASSERT_EQ(options.statistics->getTickerCount(BLOCK_CACHE_MISS), 3u);
-
-  keys.clear();
-  values.clear();
-  keys.push_back(Key(12));
-  keys.push_back(Key(16));
-  keys.push_back(Key(20));
-  values = MultiGet(keys, /*snapshot=*/nullptr, /*async=*/true);
-  ASSERT_EQ(values.size(), keys.size());
-  for (auto value : values) {
-    ASSERT_EQ(1007, value.size());
-  }
-  ASSERT_EQ(nvm_sec_cache()->num_insert_saved(), 6u);
-  ASSERT_EQ(nvm_sec_cache()->num_misses(), 6u);
-  ASSERT_EQ(nvm_sec_cache()->num_hits(), 0u);
-  ASSERT_EQ(options.statistics->getTickerCount(BLOCK_CACHE_MISS), 6u);
-
-  keys.clear();
-  values.clear();
-  keys.push_back(Key(0));
-  keys.push_back(Key(4));
-  keys.push_back(Key(8));
-  values = MultiGet(keys, /*snapshot=*/nullptr, /*async=*/true);
-  ASSERT_EQ(values.size(), keys.size());
-  for (auto value : values) {
-    ASSERT_EQ(1007, value.size());
-  }
-  ASSERT_EQ(nvm_sec_cache()->num_insert_saved(), 6u);
-  ASSERT_EQ(nvm_sec_cache()->num_misses(), 6u);
-  ASSERT_EQ(nvm_sec_cache()->num_hits(), 3u);
-  ASSERT_EQ(options.statistics->getTickerCount(BLOCK_CACHE_MISS), 6u);
-
-  ClearPrimaryCache();
-
-  keys.clear();
-  values.clear();
-  keys.push_back(Key(0));
-  keys.push_back(Key(32));
-  keys.push_back(Key(36));
-  values = MultiGet(keys, /*snapshot=*/nullptr, /*async=*/true);
-  ASSERT_EQ(values.size(), keys.size());
-  for (auto value : values) {
-    ASSERT_EQ(1007, value.size());
-  }
-  ASSERT_EQ(nvm_sec_cache()->num_insert_saved(), 8u);
-  ASSERT_EQ(nvm_sec_cache()->num_misses(), 8u);
-  ASSERT_EQ(nvm_sec_cache()->num_hits(), 4u);
-  ASSERT_EQ(options.statistics->getTickerCount(BLOCK_CACHE_MISS), 8u);
-
-  keys.clear();
-  values.clear();
-  keys.push_back(Key(0));
-  keys.push_back(Key(32));
-  keys.push_back(Key(36));
-  values = MultiGet(keys, /*snapshot=*/nullptr, /*async=*/true);
-  ASSERT_EQ(values.size(), keys.size());
-  for (auto value : values) {
-    ASSERT_EQ(1007, value.size());
-  }
-  ASSERT_EQ(nvm_sec_cache()->num_insert_saved(), 8u);
-  ASSERT_EQ(nvm_sec_cache()->num_misses(), 8u);
-  ASSERT_EQ(nvm_sec_cache()->num_hits(), 4u);
-  ASSERT_EQ(options.statistics->getTickerCount(BLOCK_CACHE_MISS), 8u);
-
-  Destroy(options);
-}
-
 // This test is for iteration. It iterates through a set of keys in two
 // passes. First pass loads the compressed blocks into the nvm tier, and
 // the second pass should hit all of those blocks.
@@ -1220,7 +1220,7 @@ TEST_F(BlobSecondaryCacheTest, GetBlobsFromSecondaryCache) {
      auto sec_handle0 = secondary_cache->Lookup(
          key0, BlobSource::SharedCacheInterface::GetFullHelper(),
          /*context*/ nullptr, true,
-          /*advise_erase=*/true, /*stats=*/nullptr, kept_in_sec_cache);
+          /*advise_erase=*/true, kept_in_sec_cache);
      ASSERT_FALSE(kept_in_sec_cache);
      ASSERT_NE(sec_handle0, nullptr);
      ASSERT_TRUE(sec_handle0->IsReady());
@@ -1248,7 +1248,7 @@ TEST_F(BlobSecondaryCacheTest, GetBlobsFromSecondaryCache) {
      auto sec_handle1 = secondary_cache->Lookup(
          key1, BlobSource::SharedCacheInterface::GetFullHelper(),
          /*context*/ nullptr, true,
-          /*advise_erase=*/true, /*stats=*/nullptr, kept_in_sec_cache);
+          /*advise_erase=*/true, kept_in_sec_cache);
      ASSERT_FALSE(kept_in_sec_cache);
      ASSERT_EQ(sec_handle1, nullptr);

@@ -168,7 +168,6 @@ TEST_F(DBBlobBasicTest, IterateBlobsFromCache) {
      ASSERT_EQ(iter->value().ToString(), blobs[i]);
      ++i;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(i, num_blobs);
    ASSERT_EQ(options.statistics->getAndResetTickerCount(BLOB_DB_CACHE_ADD), 0);
  }
@@ -204,7 +203,6 @@ TEST_F(DBBlobBasicTest, IterateBlobsFromCache) {
      ASSERT_EQ(iter->value().ToString(), blobs[i]);
      ++i;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(i, num_blobs);
    ASSERT_EQ(options.statistics->getAndResetTickerCount(BLOB_DB_CACHE_ADD),
              num_blobs);
@@ -226,7 +224,6 @@ TEST_F(DBBlobBasicTest, IterateBlobsFromCache) {
      ASSERT_EQ(iter->value().ToString(), blobs[i]);
      ++i;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(i, num_blobs);
    ASSERT_EQ(options.statistics->getAndResetTickerCount(BLOB_DB_CACHE_ADD), 0);
  }
@@ -2126,7 +2123,6 @@ TEST_F(DBBlobWithTimestampTest, IterateBlobs) {
                       /*key_is_internal*/ false);
      iter->Prev();
    }
-    ASSERT_OK(iter->status());
  }

  // Backward iteration, then reverse to forward.
@@ -2173,7 +2169,6 @@ TEST_F(DBBlobWithTimestampTest, IterateBlobs) {
        iter->Next();
      }
    }
-    ASSERT_OK(iter->status());
  }

  // Backward iterating multiple versions of the same key, get in this order:
@@ -2192,7 +2187,6 @@ TEST_F(DBBlobWithTimestampTest, IterateBlobs) {
        iter->Prev();
      }
    }
-    ASSERT_OK(iter->status());
  }

  int upper_bound_idx = num_blobs - 2;
@@ -2215,7 +2209,6 @@ TEST_F(DBBlobWithTimestampTest, IterateBlobs) {
        iter->Next();
      }
    }
-    ASSERT_OK(iter->status());
  }

  // Backward iteration with upper and lower bound.
@@ -2231,7 +2224,6 @@ TEST_F(DBBlobWithTimestampTest, IterateBlobs) {
        iter->Prev();
      }
    }
-    ASSERT_OK(iter->status());
  }
 }

@@ -294,12 +294,12 @@ Status BuildTable(
    if (!s.ok() || empty) {
      builder->Abandon();
    } else {
-      std::string seqno_to_time_mapping_str;
+      std::string seqno_time_mapping_str;
      seqno_to_time_mapping.Encode(
-          seqno_to_time_mapping_str, meta->fd.smallest_seqno,
+          seqno_time_mapping_str, meta->fd.smallest_seqno,
          meta->fd.largest_seqno, meta->file_creation_time);
      builder->SetSeqnoTimeTableProperties(
-          seqno_to_time_mapping_str,
+          seqno_time_mapping_str,
          ioptions.compaction_style == CompactionStyle::kCompactionStyleFIFO
              ? meta->file_creation_time
              : meta->oldest_ancester_time);
@@ -45,7 +45,6 @@
 #include "rocksdb/utilities/transaction_db.h"
 #include "rocksdb/utilities/write_batch_with_index.h"
 #include "rocksdb/write_batch.h"
-#include "rocksdb/write_buffer_manager.h"
 #include "utilities/merge_operators.h"

 using ROCKSDB_NAMESPACE::BackupEngine;
@@ -126,7 +125,6 @@ using ROCKSDB_NAMESPACE::WALRecoveryMode;
 using ROCKSDB_NAMESPACE::WritableFile;
 using ROCKSDB_NAMESPACE::WriteBatch;
 using ROCKSDB_NAMESPACE::WriteBatchWithIndex;
-using ROCKSDB_NAMESPACE::WriteBufferManager;
 using ROCKSDB_NAMESPACE::WriteOptions;

 using std::unordered_set;
@@ -221,9 +219,6 @@ struct rocksdb_memory_allocator_t {
 struct rocksdb_cache_t {
  std::shared_ptr<Cache> rep;
 };
-struct rocksdb_write_buffer_manager_t {
-  std::shared_ptr<WriteBufferManager> rep;
-};
 struct rocksdb_livefiles_t {
  std::vector<LiveFileMetaData> rep;
 };
@@ -2909,16 +2904,6 @@ void rocksdb_options_set_db_paths(rocksdb_options_t* opt,
  opt->rep.db_paths = db_paths;
 }

-void rocksdb_options_set_cf_paths(rocksdb_options_t* opt,
-                                  const rocksdb_dbpath_t** dbpath_values,
-                                  size_t num_paths) {
-  std::vector<DbPath> cf_paths(num_paths);
-  for (size_t i = 0; i < num_paths; ++i) {
-    cf_paths[i] = dbpath_values[i]->rep;
-  }
-  opt->rep.cf_paths = cf_paths;
-}
-
 void rocksdb_options_set_env(rocksdb_options_t* opt, rocksdb_env_t* env) {
  opt->rep.env = (env ? env->rep : nullptr);
 }
@@ -2950,11 +2935,6 @@ void rocksdb_options_set_write_buffer_size(rocksdb_options_t* opt, size_t s) {
  opt->rep.write_buffer_size = s;
 }

-void rocksdb_options_set_write_buffer_manager(
-    rocksdb_options_t* opt, rocksdb_write_buffer_manager_t* wbm) {
-  opt->rep.write_buffer_manager = wbm->rep;
-}
-
 size_t rocksdb_options_get_write_buffer_size(rocksdb_options_t* opt) {
  return opt->rep.write_buffer_size;
 }
@@ -3049,16 +3029,6 @@ void rocksdb_options_set_max_bytes_for_level_multiplier_additional(
  }
 }

-void rocksdb_options_set_periodic_compaction_seconds(rocksdb_options_t* opt,
-                                                     uint64_t seconds) {
-  opt->rep.periodic_compaction_seconds = seconds;
-}
-
-uint64_t rocksdb_options_get_periodic_compaction_seconds(
-    rocksdb_options_t* opt) {
-  return opt->rep.periodic_compaction_seconds;
-}
-
 void rocksdb_options_enable_statistics(rocksdb_options_t* opt) {
  opt->rep.statistics = ROCKSDB_NAMESPACE::CreateDBStatistics();
 }
@@ -3987,16 +3957,6 @@ rocksdb_ratelimiter_t* rocksdb_ratelimiter_create(int64_t rate_bytes_per_sec,
  return rate_limiter;
 }

-rocksdb_ratelimiter_t* rocksdb_ratelimiter_create_auto_tuned(
-    int64_t rate_bytes_per_sec, int64_t refill_period_us, int32_t fairness) {
-  rocksdb_ratelimiter_t* rate_limiter = new rocksdb_ratelimiter_t;
-  rate_limiter->rep.reset(NewGenericRateLimiter(rate_bytes_per_sec,
-                                                refill_period_us, fairness,
-                                                RateLimiter::Mode::kWritesOnly,
-                                                true));  // auto_tuned
-  return rate_limiter;
-}
-
 void rocksdb_ratelimiter_destroy(rocksdb_ratelimiter_t* limiter) {
  delete limiter;
 }
@@ -4906,60 +4866,6 @@ size_t rocksdb_cache_get_occupancy_count(const rocksdb_cache_t* cache) {
  return cache->rep->GetOccupancyCount();
 }

-rocksdb_write_buffer_manager_t* rocksdb_write_buffer_manager_create(
-    size_t buffer_size, bool allow_stall) {
-  rocksdb_write_buffer_manager_t* wbm = new rocksdb_write_buffer_manager_t;
-  wbm->rep.reset(new WriteBufferManager(buffer_size, {}, allow_stall));
-  return wbm;
-}
-
-rocksdb_write_buffer_manager_t* rocksdb_write_buffer_manager_create_with_cache(
-    size_t buffer_size, const rocksdb_cache_t* cache, bool allow_stall) {
-  rocksdb_write_buffer_manager_t* wbm = new rocksdb_write_buffer_manager_t;
-  wbm->rep.reset(new WriteBufferManager(buffer_size, cache->rep, allow_stall));
-  return wbm;
-}
-
-void rocksdb_write_buffer_manager_destroy(rocksdb_write_buffer_manager_t* wbm) {
-  delete wbm;
-}
-
-bool rocksdb_write_buffer_manager_enabled(rocksdb_write_buffer_manager_t* wbm) {
-  return wbm->rep->enabled();
-}
-
-bool rocksdb_write_buffer_manager_cost_to_cache(
-    rocksdb_write_buffer_manager_t* wbm) {
-  return wbm->rep->cost_to_cache();
-}
-
-size_t rocksdb_write_buffer_manager_memory_usage(
-    rocksdb_write_buffer_manager_t* wbm) {
-  return wbm->rep->memory_usage();
-}
-
-size_t rocksdb_write_buffer_manager_mutable_memtable_memory_usage(
-    rocksdb_write_buffer_manager_t* wbm) {
-  return wbm->rep->mutable_memtable_memory_usage();
-}
-
-size_t rocksdb_write_buffer_manager_dummy_entries_in_cache_usage(
-    rocksdb_write_buffer_manager_t* wbm) {
-  return wbm->rep->dummy_entries_in_cache_usage();
-}
-size_t rocksdb_write_buffer_manager_buffer_size(
-    rocksdb_write_buffer_manager_t* wbm) {
-  return wbm->rep->buffer_size();
-}
-void rocksdb_write_buffer_manager_set_buffer_size(
-    rocksdb_write_buffer_manager_t* wbm, size_t new_size) {
-  wbm->rep->SetBufferSize(new_size);
-}
-ROCKSDB_LIBRARY_API void rocksdb_write_buffer_manager_set_allow_stall(
-    rocksdb_write_buffer_manager_t* wbm, bool new_allow_stall) {
-  wbm->rep->SetAllowStall(new_allow_stall);
-}
-
 rocksdb_dbpath_t* rocksdb_dbpath_create(const char* path,
                                        uint64_t target_size) {
  rocksdb_dbpath_t* result = new rocksdb_dbpath_t;
@@ -5558,11 +5464,6 @@ char* rocksdb_sst_file_metadata_get_relative_filename(
  return strdup(file_meta->rep->relative_filename.c_str());
 }

-char* rocksdb_sst_file_metadata_get_directory(
-    rocksdb_sst_file_metadata_t* file_meta) {
-  return strdup(file_meta->rep->directory.c_str());
-}
-
 uint64_t rocksdb_sst_file_metadata_get_size(
    rocksdb_sst_file_metadata_t* file_meta) {
  return file_meta->rep->size;
@@ -713,11 +713,6 @@ int main(int argc, char** argv) {
  rocksdb_options_set_ratelimiter(options, rate_limiter);
  rocksdb_ratelimiter_destroy(rate_limiter);

-  rate_limiter =
-      rocksdb_ratelimiter_create_auto_tuned(1000 * 1024 * 1024, 100 * 1000, 10);
-  rocksdb_options_set_ratelimiter(options, rate_limiter);
-  rocksdb_ratelimiter_destroy(rate_limiter);
-
  roptions = rocksdb_readoptions_create();
  rocksdb_readoptions_set_verify_checksums(roptions, 1);
  rocksdb_readoptions_set_fill_cache(roptions, 1);
@@ -1479,20 +1474,10 @@ int main(int argc, char** argv) {
    CheckCondition(cflen == 2);
    rocksdb_list_column_families_destroy(column_fams, cflen);

-    rocksdb_options_t* cf_options_1 = rocksdb_options_create();
-    rocksdb_options_t* cf_options_2 = rocksdb_options_create();
-
-    // use dbpathname2 as the cf_path for "cf1"
-    rocksdb_dbpath_t* dbpath2;
-    char dbpathname2[200];
-    snprintf(dbpathname2, sizeof(dbpathname2), "%s/rocksdb_c_test-%d-dbpath2",
-             GetTempDir(), ((int)geteuid()));
-    dbpath2 = rocksdb_dbpath_create(dbpathname2, 1024 * 1024);
-    const rocksdb_dbpath_t* cf_paths[1] = {dbpath2};
-    rocksdb_options_set_cf_paths(cf_options_2, cf_paths, 1);
+    rocksdb_options_t* cf_options = rocksdb_options_create();

    const char* cf_names[2] = {"default", "cf1"};
-    const rocksdb_options_t* cf_opts[2] = {cf_options_1, cf_options_2};
+    const rocksdb_options_t* cf_opts[2] = {cf_options, cf_options};
    rocksdb_column_family_handle_t* handles[2];

    LoadAndCheckLatestOptions(dbname, env, false, cache, NULL, 2, cf_names,
@@ -1520,37 +1505,6 @@ int main(int argc, char** argv) {
    rocksdb_flushoptions_t* flush_options = rocksdb_flushoptions_create();
    rocksdb_flushoptions_set_wait(flush_options, 1);
    rocksdb_flush_cf(db, flush_options, handles[1], &err);
-
-    // make sure all files in "cf1" are under the specified cf path
-    {
-      rocksdb_column_family_metadata_t* cf_meta =
-          rocksdb_get_column_family_metadata_cf(db, handles[1]);
-      size_t cf_file_count = rocksdb_column_family_metadata_get_size(cf_meta);
-      assert(cf_file_count > 0);
-      size_t level_count =
-          rocksdb_column_family_metadata_get_level_count(cf_meta);
-      assert(level_count > 0);
-      for (size_t l = 0; l < level_count; ++l) {
-        rocksdb_level_metadata_t* level_meta =
-            rocksdb_column_family_metadata_get_level_metadata(cf_meta, l);
-        assert(level_meta);
-
-        size_t file_count = rocksdb_level_metadata_get_file_count(level_meta);
-        for (size_t f = 0; f < file_count; ++f) {
-          rocksdb_sst_file_metadata_t* file_meta =
-              rocksdb_level_metadata_get_sst_file_metadata(level_meta, f);
-          assert(file_meta);
-          char* file_path = rocksdb_sst_file_metadata_get_directory(file_meta);
-          assert(strcmp(file_path, dbpathname2) == 0);
-          Free(&file_path);
-          rocksdb_sst_file_metadata_destroy(file_meta);
-        }
-        rocksdb_level_metadata_destroy(level_meta);
-      }
-
-      rocksdb_column_family_metadata_destroy(cf_meta);
-    }
-
    CheckNoError(err) rocksdb_flushoptions_destroy(flush_options);

    CheckGetCF(db, roptions, handles[1], "foo", "hello");
@@ -1714,9 +1668,7 @@ int main(int argc, char** argv) {
    }
    rocksdb_destroy_db(options, dbname, &err);
    rocksdb_options_destroy(db_options);
-    rocksdb_options_destroy(cf_options_1);
-    rocksdb_options_destroy(cf_options_2);
-    rocksdb_dbpath_destroy(dbpath2);
+    rocksdb_options_destroy(cf_options);
  }

  StartPhase("prefix");
@@ -1921,10 +1873,6 @@ int main(int argc, char** argv) {
    CheckCondition(2.0 ==
                   rocksdb_options_get_max_bytes_for_level_multiplier(o));

-    rocksdb_options_set_periodic_compaction_seconds(o, 100000);
-    CheckCondition(100000 ==
-                   rocksdb_options_get_periodic_compaction_seconds(o));
-
    rocksdb_options_set_skip_stats_update_on_db_open(o, 1);
    CheckCondition(1 == rocksdb_options_get_skip_stats_update_on_db_open(o));

@@ -2355,12 +2303,6 @@ int main(int argc, char** argv) {
    CheckCondition(2.0 ==
                   rocksdb_options_get_max_bytes_for_level_multiplier(o));

-    rocksdb_options_set_periodic_compaction_seconds(copy, 8000);
-    CheckCondition(8000 ==
-                   rocksdb_options_get_periodic_compaction_seconds(copy));
-    CheckCondition(100000 ==
-                   rocksdb_options_get_periodic_compaction_seconds(o));
-
    rocksdb_options_set_skip_stats_update_on_db_open(copy, 0);
    CheckCondition(0 == rocksdb_options_get_skip_stats_update_on_db_open(copy));
    CheckCondition(1 == rocksdb_options_get_skip_stats_update_on_db_open(o));
@@ -3781,30 +3723,6 @@ int main(int argc, char** argv) {
    rocksdb_wait_for_compact_options_destroy(wco);
  }

-  StartPhase("write_buffer_manager");
-  {
-    rocksdb_cache_t* lru;
-    lru = rocksdb_cache_create_lru(100);
-
-    rocksdb_write_buffer_manager_t* write_buffer_manager;
-    write_buffer_manager =
-        rocksdb_write_buffer_manager_create_with_cache(200, lru, false);
-
-    CheckCondition(true ==
-                   rocksdb_write_buffer_manager_enabled(write_buffer_manager));
-    CheckCondition(true == rocksdb_write_buffer_manager_cost_to_cache(
-                               write_buffer_manager));
-    CheckCondition(
-        200 == rocksdb_write_buffer_manager_buffer_size(write_buffer_manager));
-
-    rocksdb_write_buffer_manager_set_buffer_size(write_buffer_manager, 300);
-    CheckCondition(
-        300 == rocksdb_write_buffer_manager_buffer_size(write_buffer_manager));
-
-    rocksdb_write_buffer_manager_destroy(write_buffer_manager);
-    rocksdb_cache_destroy(lru);
-  }
-
  StartPhase("cancel_all_background_work");
  rocksdb_cancel_all_background_work(db, 1);

@@ -833,8 +833,8 @@ std::unique_ptr<WriteControllerToken> SetupDelay(
  return write_controller->GetDelayToken(write_rate);
 }

-int GetL0FileCountForCompactionSpeedup(int level0_file_num_compaction_trigger,
-                                       int level0_slowdown_writes_trigger) {
+int GetL0ThresholdSpeedupCompaction(int level0_file_num_compaction_trigger,
+                                    int level0_slowdown_writes_trigger) {
  // SanitizeOptions() ensures it.
  assert(level0_file_num_compaction_trigger <= level0_slowdown_writes_trigger);

@@ -864,36 +864,6 @@ int GetL0FileCountForCompactionSpeedup(int level0_file_num_compaction_trigger,
    return static_cast<int>(res);
  }
 }
-
-uint64_t GetPendingCompactionBytesForCompactionSpeedup(
-    const MutableCFOptions& mutable_cf_options,
-    const VersionStorageInfo* vstorage) {
-  // Compaction debt relatively large compared to the stable (bottommost) data
-  // size indicates compaction fell behind.
-  const uint64_t kBottommostSizeMultiplier = 8;
-  // Meaningful progress toward the slowdown trigger is another good indication.
-  const uint64_t kSlowdownTriggerDivisor = 4;
-
-  uint64_t bottommost_files_size = 0;
-  for (const auto& level_and_file : vstorage->BottommostFiles()) {
-    bottommost_files_size += level_and_file.second->fd.GetFileSize();
-  }
-
-  // Slowdown trigger might be zero but that means compaction speedup should
-  // always happen (undocumented/historical), so no special treatment is needed.
-  uint64_t slowdown_threshold =
-      mutable_cf_options.soft_pending_compaction_bytes_limit /
-      kSlowdownTriggerDivisor;
-
-  // Size of zero, however, should not be used to decide to speedup compaction.
-  if (bottommost_files_size == 0) {
-    return slowdown_threshold;
-  }
-
-  uint64_t size_threshold =
-      MultiplyCheckOverflow(bottommost_files_size, kBottommostSizeMultiplier);
-  return std::min(size_threshold, slowdown_threshold);
-}
 }  // anonymous namespace

 std::pair<WriteStallCondition, WriteStallCause>
@@ -1049,7 +1019,7 @@ WriteStallCondition ColumnFamilyData::RecalculateWriteStallConditions(
    } else {
      assert(write_stall_condition == WriteStallCondition::kNormal);
      if (vstorage->l0_delay_trigger_count() >=
-          GetL0FileCountForCompactionSpeedup(
+          GetL0ThresholdSpeedupCompaction(
              mutable_cf_options.level0_file_num_compaction_trigger,
              mutable_cf_options.level0_slowdown_writes_trigger)) {
        write_controller_token_ =
@@ -1059,22 +1029,22 @@ WriteStallCondition ColumnFamilyData::RecalculateWriteStallConditions(
            "[%s] Increasing compaction threads because we have %d level-0 "
            "files ",
            name_.c_str(), vstorage->l0_delay_trigger_count());
-      } else if (mutable_cf_options.soft_pending_compaction_bytes_limit == 0) {
+      } else if (vstorage->estimated_compaction_needed_bytes() >=
+                 mutable_cf_options.soft_pending_compaction_bytes_limit / 4) {
+        // Increase compaction threads if bytes needed for compaction exceeds
+        // 1/4 of threshold for slowing down.
        // If soft pending compaction byte limit is not set, always speed up
        // compaction.
        write_controller_token_ =
            write_controller->GetCompactionPressureToken();
-      } else if (vstorage->estimated_compaction_needed_bytes() >=
-                 GetPendingCompactionBytesForCompactionSpeedup(
-                     mutable_cf_options, vstorage)) {
-        write_controller_token_ =
-            write_controller->GetCompactionPressureToken();
-        ROCKS_LOG_INFO(
-            ioptions_.logger,
-            "[%s] Increasing compaction threads because of estimated pending "
-            "compaction "
-            "bytes %" PRIu64,
-            name_.c_str(), vstorage->estimated_compaction_needed_bytes());
+        if (mutable_cf_options.soft_pending_compaction_bytes_limit > 0) {
+          ROCKS_LOG_INFO(
+              ioptions_.logger,
+              "[%s] Increasing compaction threads because of estimated pending "
+              "compaction "
+              "bytes %" PRIu64,
+              name_.c_str(), vstorage->estimated_compaction_needed_bytes());
+        }
      } else {
        write_controller_token_.reset();
      }
@@ -1778,20 +1748,4 @@ const Comparator* GetColumnFamilyUserComparator(
  return nullptr;
 }

-const ImmutableOptions& GetImmutableOptions(ColumnFamilyHandle* column_family) {
-  assert(column_family);
-
-  ColumnFamilyHandleImpl* const handle =
-      static_cast_with_check<ColumnFamilyHandleImpl>(column_family);
-  assert(handle);
-
-  const ColumnFamilyData* const cfd = handle->cfd();
-  assert(cfd);
-
-  const ImmutableOptions* ioptions = cfd->ioptions();
-  assert(ioptions);
-
-  return *ioptions;
-}
-
 }  // namespace ROCKSDB_NAMESPACE
@@ -877,7 +877,4 @@ extern uint32_t GetColumnFamilyID(ColumnFamilyHandle* column_family);
 extern const Comparator* GetColumnFamilyUserComparator(
    ColumnFamilyHandle* column_family);

-extern const ImmutableOptions& GetImmutableOptions(
-    ColumnFamilyHandle* column_family);
-
 }  // namespace ROCKSDB_NAMESPACE
@@ -8,7 +8,6 @@
 // found in the LICENSE file. See the AUTHORS file for names of contributors.

 #include <algorithm>
-#include <atomic>
 #include <string>
 #include <thread>
 #include <vector>
@@ -28,7 +27,6 @@
 #include "test_util/testharness.h"
 #include "test_util/testutil.h"
 #include "util/coding.h"
-#include "util/defer.h"
 #include "util/string_util.h"
 #include "utilities/fault_injection_env.h"
 #include "utilities/merge_operators.h"
@@ -2171,57 +2169,13 @@ TEST_P(ColumnFamilyTest, FlushStaleColumnFamilies) {
  Close();
 }

-namespace {
-struct CountOptionsFilesFs : public FileSystemWrapper {
-  explicit CountOptionsFilesFs(const std::shared_ptr<FileSystem>& t)
-      : FileSystemWrapper(t) {}
-  const char* Name() const override { return "CountOptionsFilesFs"; }
-
-  IOStatus NewWritableFile(const std::string& f, const FileOptions& file_opts,
-                           std::unique_ptr<FSWritableFile>* r,
-                           IODebugContext* dbg) override {
-    if (f.find("OPTIONS-") != std::string::npos) {
-      options_files_created.fetch_add(1, std::memory_order_relaxed);
-    }
-    return FileSystemWrapper::NewWritableFile(f, file_opts, r, dbg);
-  }
-
-  std::atomic<int> options_files_created{};
-};
-}  // namespace
-
 TEST_P(ColumnFamilyTest, CreateMissingColumnFamilies) {
-  // Can't accidentally add CFs to an existing DB
-  Open();
-  Close();
-  ASSERT_FALSE(db_options_.create_missing_column_families);
-  ASSERT_NOK(TryOpen({"one", "two"}));
-
-  // Nor accidentally create in a new DB
-  Destroy();
-  db_options_.create_if_missing = true;
-  ASSERT_NOK(TryOpen({"one", "two"}));
-
-  // Only with the option (new DB case)
+  Status s = TryOpen({"one", "two"});
+  ASSERT_TRUE(!s.ok());
  db_options_.create_missing_column_families = true;
-  // Also setup to count number of options files created (see check below)
-  auto my_fs =
-      std::make_shared<CountOptionsFilesFs>(db_options_.env->GetFileSystem());
-  auto my_env = std::make_unique<CompositeEnvWrapper>(db_options_.env, my_fs);
-  SaveAndRestore<Env*> save_restore_env(&db_options_.env, my_env.get());
-
-  ASSERT_OK(TryOpen({"default", "one", "two"}));
+  s = TryOpen({"default", "one", "two"});
+  ASSERT_TRUE(s.ok());
  Close();
-
-  // An older version would write an updated options file for each column
-  // family created under create_missing_column_families, which would be
-  // quadratic I/O in the number of column families.
-  ASSERT_EQ(my_fs->options_files_created.load(), 1);
-
-  // Add to existing DB case
-  ASSERT_OK(TryOpen({"default", "one", "two", "three", "four"}));
-  Close();
-  ASSERT_EQ(my_fs->options_files_created.load(), 2);
 }

 TEST_P(ColumnFamilyTest, SanitizeOptions) {
@@ -2473,10 +2427,7 @@ void DropSingleColumnFamily(ColumnFamilyTest* cf_test, int cf_id,
 }
 }  // anonymous namespace

-// This test attempts to set up a race condition in a way that is no longer
-// possible, causing the test to hang. If DBImpl::options_mutex_ is removed
-// in the future, this test might become relevant again.
-TEST_P(ColumnFamilyTest, DISABLED_CreateAndDropRace) {
+TEST_P(ColumnFamilyTest, CreateAndDropRace) {
  const int kCfCount = 5;
  std::vector<ColumnFamilyOptions> cf_opts;
  std::vector<Comparator*> comparators;
@@ -2538,53 +2489,6 @@ TEST_P(ColumnFamilyTest, DISABLED_CreateAndDropRace) {
  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->ClearAllCallBacks();
 }

-TEST_P(ColumnFamilyTest, CreateAndDropPeriodicRace) {
-  // This is a mini-stress test looking for inconsistency between the set of
-  // CFs in the DB, particularly whether any use preserve_internal_time_seconds,
-  // and whether that is accurately reflected in the periodic task setup.
-  constexpr size_t kNumThreads = 12;
-  std::vector<std::thread> threads;
-  bool last_cf_on = Random::GetTLSInstance()->OneIn(2);
-
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->SetCallBack(
-      "DBImpl::RegisterRecordSeqnoTimeWorker:BeforePeriodicTaskType",
-      [&](void* /*arg*/) { std::this_thread::yield(); });
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->EnableProcessing();
-
-  ASSERT_EQ(column_family_options_.preserve_internal_time_seconds, 0U);
-  ColumnFamilyOptions other_opts = column_family_options_;
-  ColumnFamilyOptions last_opts = column_family_options_;
-  (last_cf_on ? last_opts : other_opts).preserve_internal_time_seconds =
-      1000000;
-  Open();
-
-  for (size_t i = 0; i < kNumThreads; i++) {
-    threads.emplace_back([this, &other_opts, i]() {
-      ColumnFamilyHandle* cfh;
-      ASSERT_OK(db_->CreateColumnFamily(other_opts, std::to_string(i), &cfh));
-      ASSERT_OK(db_->DropColumnFamily(cfh));
-      ASSERT_OK(db_->DestroyColumnFamilyHandle(cfh));
-    });
-  }
-
-  ColumnFamilyHandle* last_cfh;
-  ASSERT_OK(db_->CreateColumnFamily(last_opts, "last", &last_cfh));
-
-  for (auto& t : threads) {
-    t.join();
-  }
-
-  bool task_enabled = dbfull()->TEST_GetPeriodicTaskScheduler().TEST_HasTask(
-      PeriodicTaskType::kRecordSeqnoTime);
-  ASSERT_EQ(last_cf_on, task_enabled);
-
-  ASSERT_OK(db_->DropColumnFamily(last_cfh));
-  ASSERT_OK(db_->DestroyColumnFamilyHandle(last_cfh));
-
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->DisableProcessing();
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->ClearAllCallBacks();
-}
-
 TEST_P(ColumnFamilyTest, WriteStallSingleColumnFamily) {
  const uint64_t kBaseRate = 800000u;
  db_options_.delayed_write_rate = kBaseRate;
@@ -2971,43 +2875,6 @@ TEST_P(ColumnFamilyTest, CompactionSpeedupTwoColumnFamilies) {
  ASSERT_EQ(1, dbfull()->TEST_BGCompactionsAllowed());
 }

-TEST_P(ColumnFamilyTest, CompactionSpeedupForCompactionDebt) {
-  db_options_.max_background_compactions = 6;
-  Open();
-  ColumnFamilyData* cfd =
-      static_cast<ColumnFamilyHandleImpl*>(db_->DefaultColumnFamily())->cfd();
-  MutableCFOptions mutable_cf_options(column_family_options_);
-  mutable_cf_options.soft_pending_compaction_bytes_limit =
-      std::numeric_limits<uint64_t>::max();
-
-  {
-    // No bottommost data, so debt ratio cannot trigger speedup.
-    VersionStorageInfo* vstorage = cfd->current()->storage_info();
-    vstorage->TEST_set_estimated_compaction_needed_bytes(1048576 /* 1MB */);
-    RecalculateWriteStallConditions(cfd, mutable_cf_options);
-    ASSERT_EQ(1, dbfull()->TEST_BGCompactionsAllowed());
-  }
-
-  // Add a tiny amount of bottommost data.
-  ASSERT_OK(db_->Put(WriteOptions(), "foo", "bar"));
-  ASSERT_OK(db_->Flush(FlushOptions()));
-
-  {
-    // 1MB debt is way bigger than bottommost data so definitely triggers
-    // speedup.
-    VersionStorageInfo* vstorage = cfd->current()->storage_info();
-    vstorage->TEST_set_estimated_compaction_needed_bytes(1048576 /* 1MB */);
-    RecalculateWriteStallConditions(cfd, mutable_cf_options);
-    ASSERT_EQ(6, dbfull()->TEST_BGCompactionsAllowed());
-
-    // Eight bytes is way smaller than bottommost data so definitely does not
-    // trigger speedup.
-    vstorage->TEST_set_estimated_compaction_needed_bytes(8);
-    RecalculateWriteStallConditions(cfd, mutable_cf_options);
-    ASSERT_EQ(1, dbfull()->TEST_BGCompactionsAllowed());
-  }
-}
-
 TEST_P(ColumnFamilyTest, CreateAndDestroyOptions) {
  std::unique_ptr<ColumnFamilyOptions> cfo(new ColumnFamilyOptions());
  ColumnFamilyHandle* cfh;
@@ -115,42 +115,6 @@ void Compaction::GetBoundaryKeys(
  }
 }

-void Compaction::GetBoundaryInternalKeys(
-    VersionStorageInfo* vstorage,
-    const std::vector<CompactionInputFiles>& inputs, InternalKey* smallest_key,
-    InternalKey* largest_key, int exclude_level) {
-  bool initialized = false;
-  const InternalKeyComparator* icmp = vstorage->InternalComparator();
-  for (size_t i = 0; i < inputs.size(); ++i) {
-    if (inputs[i].files.empty() || inputs[i].level == exclude_level) {
-      continue;
-    }
-    if (inputs[i].level == 0) {
-      // we need to consider all files on level 0
-      for (const auto* f : inputs[i].files) {
-        if (!initialized || icmp->Compare(f->smallest, *smallest_key) < 0) {
-          *smallest_key = f->smallest;
-        }
-        if (!initialized || icmp->Compare(f->largest, *largest_key) > 0) {
-          *largest_key = f->largest;
-        }
-        initialized = true;
-      }
-    } else {
-      // we only need to consider the first and last file
-      if (!initialized ||
-          icmp->Compare(inputs[i].files[0]->smallest, *smallest_key) < 0) {
-        *smallest_key = inputs[i].files[0]->smallest;
-      }
-      if (!initialized ||
-          icmp->Compare(inputs[i].files.back()->largest, *largest_key) > 0) {
-        *largest_key = inputs[i].files.back()->largest;
-      }
-      initialized = true;
-    }
-  }
-}
-
 std::vector<CompactionInputFiles> Compaction::PopulateWithAtomicBoundaries(
    VersionStorageInfo* vstorage, std::vector<CompactionInputFiles> inputs) {
  const Comparator* ucmp = vstorage->InternalComparator()->user_comparator();
@@ -435,14 +399,9 @@ void Compaction::PopulatePenultimateLevelOutputRange() {
    }
  }

-  // FIXME: should make use of `penultimate_output_range_type_`.
-  // FIXME: when last level's input range does not overlap with
-  //  penultimate level, and penultimate level input is empty,
-  //  this call will not set penultimate_level_smallest_ or
-  //  penultimate_level_largest_. No keys will be compacted up.
-  GetBoundaryInternalKeys(input_vstorage_, inputs_,
-                          &penultimate_level_smallest_,
-                          &penultimate_level_largest_, exclude_level);
+  GetBoundaryKeys(input_vstorage_, inputs_,
+                  &penultimate_level_smallest_user_key_,
+                  &penultimate_level_largest_user_key_, exclude_level);
 }

 Compaction::~Compaction() {
@@ -467,11 +426,23 @@ bool Compaction::OverlapPenultimateLevelOutputRange(
  if (!SupportsPerKeyPlacement()) {
    return false;
  }
+  const Comparator* ucmp =
+      input_vstorage_->InternalComparator()->user_comparator();

-  // See FIXME in Compaction::PopulatePenultimateLevelOutputRange().
-  // We do not compact any key up in this case.
-  if (penultimate_level_smallest_.size() == 0 ||
-      penultimate_level_largest_.size() == 0) {
+  return ucmp->CompareWithoutTimestamp(
+             smallest_key, penultimate_level_largest_user_key_) <= 0 &&
+         ucmp->CompareWithoutTimestamp(
+             largest_key, penultimate_level_smallest_user_key_) >= 0;
+}
+
+// key includes timestamp if user-defined timestamp is enabled.
+bool Compaction::WithinPenultimateLevelOutputRange(const Slice& key) const {
+  if (!SupportsPerKeyPlacement()) {
+    return false;
+  }
+
+  if (penultimate_level_smallest_user_key_.empty() ||
+      penultimate_level_largest_user_key_.empty()) {
    return false;
  }

@@ -479,28 +450,9 @@ bool Compaction::OverlapPenultimateLevelOutputRange(
      input_vstorage_->InternalComparator()->user_comparator();

  return ucmp->CompareWithoutTimestamp(
-             smallest_key, penultimate_level_largest_.user_key()) <= 0 &&
+             key, penultimate_level_smallest_user_key_) >= 0 &&
         ucmp->CompareWithoutTimestamp(
-             largest_key, penultimate_level_smallest_.user_key()) >= 0;
-}
-
-// key includes timestamp if user-defined timestamp is enabled.
-bool Compaction::WithinPenultimateLevelOutputRange(
-    const ParsedInternalKey& ikey) const {
-  if (!SupportsPerKeyPlacement()) {
-    return false;
-  }
-
-  if (penultimate_level_smallest_.size() == 0 ||
-      penultimate_level_largest_.size() == 0) {
-    return false;
-  }
-
-  const InternalKeyComparator* icmp = input_vstorage_->InternalComparator();
-
-  // op_type of a key can change during compaction, e.g. Merge -> Put.
-  return icmp->CompareKeySeq(ikey, penultimate_level_smallest_.Encode()) >= 0 &&
-         icmp->CompareKeySeq(ikey, penultimate_level_largest_.Encode()) <= 0;
+             key, penultimate_level_largest_user_key_) <= 0;
 }

 bool Compaction::InputCompressionMatchesOutput() const {
@@ -353,6 +353,14 @@ class Compaction {

  Slice GetLargestUserKey() const { return largest_user_key_; }

+  Slice GetPenultimateLevelSmallestUserKey() const {
+    return penultimate_level_smallest_user_key_;
+  }
+
+  Slice GetPenultimateLevelLargestUserKey() const {
+    return penultimate_level_largest_user_key_;
+  }
+
  PenultimateOutputRangeType GetPenultimateOutputRangeType() const {
    return penultimate_output_range_type_;
  }
@@ -375,8 +383,10 @@ class Compaction {
  // per_key_placement feature, which is safe to place the key to the
  // penultimate level. different compaction strategy has different rules.
  // If per_key_placement is not supported, always return false.
+  // TODO: currently it doesn't support moving data from the last level to the
+  //  penultimate level
  //  key includes timestamp if user-defined timestamp is enabled.
-  bool WithinPenultimateLevelOutputRange(const ParsedInternalKey& ikey) const;
+  bool WithinPenultimateLevelOutputRange(const Slice& key) const;

  CompactionReason compaction_reason() const { return compaction_reason_; }

@@ -446,13 +456,6 @@ class Compaction {
                              Slice* smallest_key, Slice* largest_key,
                              int exclude_level = -1);

-  // get the smallest and largest internal key present in files to be compacted
-  static void GetBoundaryInternalKeys(
-      VersionStorageInfo* vstorage,
-      const std::vector<CompactionInputFiles>& inputs,
-      InternalKey* smallest_key, InternalKey* largest_key,
-      int exclude_level = -1);
-
  // populate penultimate level output range, which will be used to determine if
  // a key is safe to output to the penultimate level (details see
  // `Compaction::WithinPenultimateLevelOutputRange()`.
@@ -565,8 +568,8 @@ class Compaction {
  // Key range for penultimate level output
  // includes timestamp if user-defined timestamp is enabled.
  // penultimate_output_range_type_ shows the range type
-  InternalKey penultimate_level_smallest_;
-  InternalKey penultimate_level_largest_;
+  Slice penultimate_level_smallest_user_key_;
+  Slice penultimate_level_largest_user_key_;
  PenultimateOutputRangeType penultimate_output_range_type_ =
      PenultimateOutputRangeType::kNotSupported;
 };
@@ -1227,7 +1227,7 @@ void CompactionIterator::DecideOutputLevel() {
    // not from this compaction.
    // TODO: add statistic for declined output_to_penultimate_level
    bool safe_to_penultimate_level =
-        compaction_->WithinPenultimateLevelOutputRange(ikey_);
+        compaction_->WithinPenultimateLevelOutputRange(ikey_.user_key);
    if (!safe_to_penultimate_level) {
      output_to_penultimate_level_ = false;
      // It could happen when disable/enable `last_level_temperature` while
@@ -1256,13 +1256,10 @@ void CompactionIterator::PrepareOutput() {
      } else if (ikey_.type == kTypeBlobIndex) {
        GarbageCollectBlobIfNeeded();
      }
+    }

-      // For range del sentinel, we don't use it to cut files for bottommost
-      // compaction. So it should not make a difference which output level we
-      // decide.
-      if (compaction_ != nullptr && compaction_->SupportsPerKeyPlacement()) {
-        DecideOutputLevel();
-      }
+    if (compaction_ != nullptr && compaction_->SupportsPerKeyPlacement()) {
+      DecideOutputLevel();
    }

    // Zeroing out the sequence number leads to better compression.
@@ -119,8 +119,7 @@ class CompactionIterator {
    virtual bool SupportsPerKeyPlacement() const = 0;

    // `key` includes timestamp if user-defined timestamp is enabled.
-    virtual bool WithinPenultimateLevelOutputRange(
-        const ParsedInternalKey&) const = 0;
+    virtual bool WithinPenultimateLevelOutputRange(const Slice& key) const = 0;
  };

  class RealCompaction : public CompactionProxy {
@@ -187,9 +186,8 @@ class CompactionIterator {
    // Check if key is within penultimate level output range, to see if it's
    // safe to output to the penultimate level for per_key_placement feature.
    // `key` includes timestamp if user-defined timestamp is enabled.
-    bool WithinPenultimateLevelOutputRange(
-        const ParsedInternalKey& ikey) const override {
-      return compaction_->WithinPenultimateLevelOutputRange(ikey);
+    bool WithinPenultimateLevelOutputRange(const Slice& key) const override {
+      return compaction_->WithinPenultimateLevelOutputRange(key);
    }

   private:
@@ -184,9 +184,8 @@ class FakeCompaction : public CompactionIterator::CompactionProxy {
    return supports_per_key_placement;
  }

-  bool WithinPenultimateLevelOutputRange(
-      const ParsedInternalKey& key) const override {
-    return (!key.user_key.starts_with("unsafe_pb"));
+  bool WithinPenultimateLevelOutputRange(const Slice& key) const override {
+    return (!key.starts_with("unsafe_pb"));
  }

  bool key_not_exists_beyond_output_level = false;
@@ -288,23 +288,23 @@ void CompactionJob::Prepare() {

  if (preserve_time_duration > 0) {
    const ReadOptions read_options(Env::IOActivity::kCompaction);
-    // setup seqno_to_time_mapping_
-    seqno_to_time_mapping_.SetMaxTimeDuration(preserve_time_duration);
+    // setup seqno_time_mapping_
+    seqno_time_mapping_.SetMaxTimeDuration(preserve_time_duration);
    for (const auto& each_level : *c->inputs()) {
      for (const auto& fmd : each_level.files) {
        std::shared_ptr<const TableProperties> tp;
        Status s =
            cfd->current()->GetTableProperties(read_options, &tp, fmd, nullptr);
        if (s.ok()) {
-          seqno_to_time_mapping_.Add(tp->seqno_to_time_mapping)
+          seqno_time_mapping_.Add(tp->seqno_to_time_mapping)
              .PermitUncheckedError();
-          seqno_to_time_mapping_.Add(fmd->fd.smallest_seqno,
-                                     fmd->oldest_ancester_time);
+          seqno_time_mapping_.Add(fmd->fd.smallest_seqno,
+                                  fmd->oldest_ancester_time);
        }
      }
    }

-    auto status = seqno_to_time_mapping_.Sort();
+    auto status = seqno_time_mapping_.Sort();
    if (!status.ok()) {
      ROCKS_LOG_WARN(db_options_.info_log,
                     "Invalid sequence number to time mapping: Status: %s",
@@ -320,17 +320,13 @@ void CompactionJob::Prepare() {
      preserve_time_min_seqno_ = 0;
      preclude_last_level_min_seqno_ = 0;
    } else {
-      seqno_to_time_mapping_.TruncateOldEntries(_current_time);
+      seqno_time_mapping_.TruncateOldEntries(_current_time);
      uint64_t preserve_time =
          static_cast<uint64_t>(_current_time) > preserve_time_duration
              ? _current_time - preserve_time_duration
              : 0;
-      // GetProximalSeqnoBeforeTime tells us the last seqno known to have been
-      // written at or before the given time. + 1 to get the minimum we should
-      // preserve without excluding anything that might have been written on or
-      // after the given time.
      preserve_time_min_seqno_ =
-          seqno_to_time_mapping_.GetProximalSeqnoBeforeTime(preserve_time) + 1;
+          seqno_time_mapping_.GetOldestSequenceNum(preserve_time);
      if (c->immutable_options()->preclude_last_level_data_seconds > 0) {
        uint64_t preclude_last_level_time =
            static_cast<uint64_t>(_current_time) >
@@ -339,9 +335,7 @@ void CompactionJob::Prepare() {
                      c->immutable_options()->preclude_last_level_data_seconds
                : 0;
        preclude_last_level_min_seqno_ =
-            seqno_to_time_mapping_.GetProximalSeqnoBeforeTime(
-                preclude_last_level_time) +
-            1;
+            seqno_time_mapping_.GetOldestSequenceNum(preclude_last_level_time);
      }
    }
  }
@@ -1576,7 +1570,7 @@ Status CompactionJob::FinishCompactionOutputFile(

  const uint64_t current_entries = outputs.NumEntries();

-  s = outputs.Finish(s, seqno_to_time_mapping_);
+  s = outputs.Finish(s, seqno_time_mapping_);

  if (s.ok()) {
    // With accurate smallest and largest key, we can get a slightly more
@@ -1900,8 +1894,6 @@ Status CompactionJob::OpenCompactionOutputFile(SubcompactionState* sub_compact,
          sub_compact->start.has_value() ? &tmp_start : nullptr,
          sub_compact->end.has_value() ? &tmp_end : nullptr);
  if (oldest_ancester_time == std::numeric_limits<uint64_t>::max()) {
-    // TODO: fix DBSSTTest.GetTotalSstFilesSize and use
-    //  kUnknownOldestAncesterTime
    oldest_ancester_time = current_time;
  }

@@ -350,7 +350,7 @@ class CompactionJob {

  // Stores the sequence number to time mapping gathered from all input files
  // it also collects the smallest_seqno -> oldest_ancester_time from the SST.
-  SeqnoToTimeMapping seqno_to_time_mapping_;
+  SeqnoToTimeMapping seqno_time_mapping_;

  // Minimal sequence number for preserving the time information. The time info
  // older than this sequence number won't be preserved after the compaction and
@@ -215,9 +215,7 @@ class CompactionJobTestBase : public testing::Test {
            dbname_, &db_options_, env_options_, table_cache_.get(),
            &write_buffer_manager_, &write_controller_,
            /*block_cache_tracer=*/nullptr,
-            /*io_tracer=*/nullptr, /*db_id=*/"", /*db_session_id=*/"",
-            /*daily_offpeak_time_utc=*/"",
-            /*error_handler=*/nullptr)),
+            /*io_tracer=*/nullptr, /*db_id*/ "", /*db_session_id*/ "")),
        shutting_down_(false),
        mock_table_factory_(new mock::MockTableFactory()),
        error_handler_(nullptr, db_options_, &mutex_),
@@ -542,12 +540,11 @@ class CompactionJobTestBase : public testing::Test {
    ASSERT_OK(s);
    db_options_.info_log = info_log;

-    versions_.reset(new VersionSet(
-        dbname_, &db_options_, env_options_, table_cache_.get(),
-        &write_buffer_manager_, &write_controller_,
-        /*block_cache_tracer=*/nullptr, /*io_tracer=*/nullptr,
-        /*db_id=*/"", /*db_session_id=*/"", /*daily_offpeak_time_utc=*/"",
-        /*error_handler=*/nullptr));
+    versions_.reset(
+        new VersionSet(dbname_, &db_options_, env_options_, table_cache_.get(),
+                       &write_buffer_manager_, &write_controller_,
+                       /*block_cache_tracer=*/nullptr, /*io_tracer=*/nullptr,
+                       /*db_id*/ "", /*db_session_id*/ ""));
    compaction_job_stats_.Reset();
    ASSERT_OK(SetIdentityFile(env_, dbname_));

@@ -1527,15 +1524,13 @@ TEST_F(CompactionJobTest, VerifyPenultimateLevelOutput) {
      {files0, files1, files2, files3}, input_levels,
      /*verify_func=*/[&](Compaction& comp) {
        for (char c = 'a'; c <= 'z'; c++) {
+          std::string c_str;
+          c_str = c;
+          const Slice key(c_str);
          if (c == 'a') {
-            ParsedInternalKey pik("a", 0U, kTypeValue);
-            ASSERT_FALSE(comp.WithinPenultimateLevelOutputRange(pik));
+            ASSERT_FALSE(comp.WithinPenultimateLevelOutputRange(key));
          } else {
-            std::string c_str{c};
-            // WithinPenultimateLevelOutputRange checks internal key range.
-            // 'z' is the last key, so set seqno properly.
-            ParsedInternalKey pik(c_str, c == 'z' ? 12U : 0U, kTypeValue);
-            ASSERT_TRUE(comp.WithinPenultimateLevelOutputRange(pik));
+            ASSERT_TRUE(comp.WithinPenultimateLevelOutputRange(key));
          }
        }
      });
@@ -18,18 +18,16 @@ void CompactionOutputs::NewBuilder(const TableBuilderOptions& tboptions) {
  builder_.reset(NewTableBuilder(tboptions, file_writer_.get()));
 }

-Status CompactionOutputs::Finish(
-    const Status& intput_status,
-    const SeqnoToTimeMapping& seqno_to_time_mapping) {
+Status CompactionOutputs::Finish(const Status& intput_status,
+                                 const SeqnoToTimeMapping& seqno_time_mapping) {
  FileMetaData* meta = GetMetaData();
  assert(meta != nullptr);
  Status s = intput_status;
  if (s.ok()) {
-    std::string seqno_to_time_mapping_str;
-    seqno_to_time_mapping.Encode(
-        seqno_to_time_mapping_str, meta->fd.smallest_seqno,
-        meta->fd.largest_seqno, meta->file_creation_time);
-    builder_->SetSeqnoTimeTableProperties(seqno_to_time_mapping_str,
+    std::string seqno_time_mapping_str;
+    seqno_time_mapping.Encode(seqno_time_mapping_str, meta->fd.smallest_seqno,
+                              meta->fd.largest_seqno, meta->file_creation_time);
+    builder_->SetSeqnoTimeTableProperties(seqno_time_mapping_str,
                                          meta->oldest_ancester_time);
    s = builder_->Finish();

@@ -107,7 +107,7 @@ class CompactionOutputs {

  // Finish the current output file
  Status Finish(const Status& intput_status,
-                const SeqnoToTimeMapping& seqno_to_time_mapping);
+                const SeqnoToTimeMapping& seqno_time_mapping);

  // Update output table properties from table builder
  void UpdateTableProperties() {
@@ -17,9 +17,6 @@
 #include "logging/log_buffer.h"
 #include "logging/logging.h"
 #include "options/options_helper.h"
-#include "rocksdb/listener.h"
-#include "rocksdb/statistics.h"
-#include "rocksdb/status.h"
 #include "util/string_util.h"

 namespace ROCKSDB_NAMESPACE {
@@ -85,8 +85,7 @@ class CompactionPickerTestBase : public testing::Test {
    vstorage_.reset(new VersionStorageInfo(
        &icmp_, ucmp_, options_.num_levels, style, nullptr, false,
        EpochNumberRequirement::kMustPresent, ioptions_.clock,
-        options_.bottommost_file_compaction_delay,
-        OffpeakTimeOption(mutable_db_options_.daily_offpeak_time_utc)));
+        options_.bottommost_file_compaction_delay));
    vstorage_->PrepareForVersionAppend(ioptions_, mutable_cf_options_);
  }

@@ -96,8 +95,7 @@ class CompactionPickerTestBase : public testing::Test {
    temp_vstorage_.reset(new VersionStorageInfo(
        &icmp_, ucmp_, options_.num_levels, ioptions_.compaction_style,
        vstorage_.get(), false, EpochNumberRequirement::kMustPresent,
-        ioptions_.clock, options_.bottommost_file_compaction_delay,
-        OffpeakTimeOption(mutable_db_options_.daily_offpeak_time_utc)));
+        ioptions_.clock, options_.bottommost_file_compaction_delay));
  }

  void DeleteVersionStorage() {
@@ -1202,126 +1202,20 @@ TEST_P(TieredCompactionTest, RangeBasedTieredStorageLevel) {
  ASSERT_EQ("0,0,0,0,0,0,1", FilesPerLevel());
  ASSERT_EQ(GetSstSizeHelper(Temperature::kUnknown), 0);
  ASSERT_GT(GetSstSizeHelper(Temperature::kCold), 0);
+
  ASSERT_EQ(
      options.statistics->getTickerCount(COMPACTION_RANGE_DEL_DROP_OBSOLETE),
      1);
-
-  // Tests that we only compact keys up to penultimate level
-  // that are within penultimate level input's internal key range.
-  {
-    MutexLock l(&mutex);
-    hot_start = Key(0);
-    hot_end = Key(100);
-  }
-  const Snapshot* temp_snap = db_->GetSnapshot();
-  // Key(0) and Key(1) here are inserted with higher sequence number
-  // than Key(0) and Key(1) inserted above.
-  // Only Key(0) in last level will be compacted up, not Key(1).
-  ASSERT_OK(Put(Key(0), "value" + std::to_string(0)));
-  ASSERT_OK(Put(Key(1), "value" + std::to_string(100)));
-  ASSERT_OK(db_->CompactRange(cro, nullptr, nullptr));
-  ASSERT_EQ("0,0,0,0,0,1,1", FilesPerLevel());
-  {
-    std::vector<LiveFileMetaData> metas;
-    db_->GetLiveFilesMetaData(&metas);
-    for (const auto& f : metas) {
-      if (f.temperature == Temperature::kUnknown) {
-        // Expect Key(0), Key(0), Key(1)
-        ASSERT_EQ(f.num_entries, 3);
-        ASSERT_EQ(f.smallestkey, Key(0));
-        ASSERT_EQ(f.largestkey, Key(1));
-      } else {
-        ASSERT_EQ(f.temperature, Temperature::kCold);
-        // Key(2)-Key(49) and Key(100).
-        ASSERT_EQ(f.num_entries, 50);
-      }
-    }
-  }
-  db_->ReleaseSnapshot(temp_snap);
 }

 INSTANTIATE_TEST_CASE_P(TieredCompactionTest, TieredCompactionTest,
                        testing::Bool());

-TEST_P(TieredCompactionTest, CheckInternalKeyRange) {
-  // When compacting keys from the last level to penultimate level,
-  // output to penultimate level should be within internal key range
-  // of input files from penultimate level.
-  // Set up:
-  // L5:
-  //  File 1: DeleteRange[1, 3)@4, File 2: [3@5, 100@6]
-  // L6:
-  // File 3: [2@1, 3@2], File 4: [50@3]
-  //
-  // When File 1 and File 3 are being compacted,
-  // Key(3) cannot be compacted up, otherwise it causes
-  // inconsistency where File 3's Key(3) has a lower sequence number
-  // than File 2's Key(3).
-  const int kNumLevels = 7;
-  auto options = CurrentOptions();
-  SetColdTemperature(options);
-  options.level_compaction_dynamic_level_bytes = true;
-  options.num_levels = kNumLevels;
-  options.statistics = CreateDBStatistics();
-  options.max_subcompactions = 10;
-  options.preclude_last_level_data_seconds = 10000;
-  DestroyAndReopen(options);
-  auto cmp = options.comparator;
-
-  std::string hot_start = Key(0);
-  std::string hot_end = Key(0);
-  SyncPoint::GetInstance()->SetCallBack(
-      "CompactionIterator::PrepareOutput.context", [&](void* arg) {
-        auto context = static_cast<PerKeyPlacementContext*>(arg);
-        context->output_to_penultimate_level =
-            cmp->Compare(context->key, hot_start) >= 0 &&
-            cmp->Compare(context->key, hot_end) < 0;
-      });
-  SyncPoint::GetInstance()->EnableProcessing();
-  // File 1
-  ASSERT_OK(Put(Key(2), "val2"));
-  ASSERT_OK(Put(Key(3), "val3"));
-  ASSERT_OK(Flush());
-  MoveFilesToLevel(6);
-  // File 2
-  ASSERT_OK(Put(Key(50), "val50"));
-  ASSERT_OK(Flush());
-  MoveFilesToLevel(6);
-
-  const Snapshot* snapshot = db_->GetSnapshot();
-  hot_end = Key(100);
-  std::string start = Key(1);
-  std::string end = Key(3);
-  ASSERT_OK(
-      db_->DeleteRange(WriteOptions(), db_->DefaultColumnFamily(), start, end));
-  ASSERT_OK(Flush());
-  MoveFilesToLevel(5);
-  // File 3
-  ASSERT_OK(Put(Key(3), "vall"));
-  ASSERT_OK(Put(Key(100), "val100"));
-  ASSERT_OK(Flush());
-  MoveFilesToLevel(5);
-  // Try to compact keys up
-  CompactRangeOptions cro;
-  cro.bottommost_level_compaction = BottommostLevelCompaction::kForce;
-  start = Key(1);
-  end = Key(2);
-  Slice begin_slice(start);
-  Slice end_slice(end);
-  ASSERT_OK(db_->CompactRange(cro, &begin_slice, &end_slice));
-  // Without internal key range checking, we get the following error:
-  // Corruption: force_consistency_checks(DEBUG): VersionBuilder: L5 has
-  // overlapping ranges: file #18 largest key: '6B6579303030303033' seq:102,
-  // type:1 vs. file #15 smallest key: '6B6579303030303033' seq:104, type:1
-  db_->ReleaseSnapshot(snapshot);
-}
-
 class PrecludeLastLevelTest : public DBTestBase {
 public:
  PrecludeLastLevelTest()
      : DBTestBase("preclude_last_level_test", /*env_do_fsync=*/false) {
    mock_clock_ = std::make_shared<MockSystemClock>(env_->GetSystemClock());
-    mock_clock_->SetCurrentTime(kMockStartTime);
    mock_env_ = std::make_unique<CompositeEnvWrapper>(env_, mock_clock_);
  }

@@ -1329,10 +1223,6 @@ class PrecludeLastLevelTest : public DBTestBase {
  std::unique_ptr<Env> mock_env_;
  std::shared_ptr<MockSystemClock> mock_clock_;

-  // Sufficient starting time that preserve time doesn't under-flow into
-  // pre-history
-  static constexpr uint32_t kMockStartTime = 10000000;
-
  void SetUp() override {
    mock_clock_->InstallTimedWaitFixCallback();
    SyncPoint::GetInstance()->SetCallBack(
@@ -1341,7 +1231,7 @@ class PrecludeLastLevelTest : public DBTestBase {
              reinterpret_cast<PeriodicTaskScheduler*>(arg);
          periodic_task_scheduler_ptr->TEST_OverrideTimer(mock_clock_.get());
        });
-    mock_clock_->SetCurrentTime(kMockStartTime);
+    mock_clock_->SetCurrentTime(0);
  }
 };

@@ -1359,6 +1249,11 @@ TEST_F(PrecludeLastLevelTest, MigrationFromPreserveTimeManualCompaction) {
  options.num_levels = kNumLevels;
  DestroyAndReopen(options);

+  // pass some time first, otherwise the first a few keys write time are going
+  // to be zero, and internally zero has special meaning: kUnknownSeqnoTime
+  dbfull()->TEST_WaitForPeriodicTaskRun(
+      [&] { mock_clock_->MockSleepForSeconds(static_cast<int>(kKeyPerSec)); });
+
  int sst_num = 0;
  // Write files that are overlap and enough to trigger compaction
  for (; sst_num < kNumTrigger; sst_num++) {
@@ -1416,6 +1311,11 @@ TEST_F(PrecludeLastLevelTest, MigrationFromPreserveTimeAutoCompaction) {
  options.num_levels = kNumLevels;
  DestroyAndReopen(options);

+  // pass some time first, otherwise the first a few keys write time are going
+  // to be zero, and internally zero has special meaning: kUnknownSeqnoTime
+  dbfull()->TEST_WaitForPeriodicTaskRun(
+      [&] { mock_clock_->MockSleepForSeconds(static_cast<int>(kKeyPerSec)); });
+
  int sst_num = 0;
  // Write files that are overlap and enough to trigger compaction
  for (; sst_num < kNumTrigger; sst_num++) {
@@ -1487,6 +1387,11 @@ TEST_F(PrecludeLastLevelTest, MigrationFromPreserveTimePartial) {
  options.num_levels = kNumLevels;
  DestroyAndReopen(options);

+  // pass some time first, otherwise the first a few keys write time are going
+  // to be zero, and internally zero has special meaning: kUnknownSeqnoTime
+  dbfull()->TEST_WaitForPeriodicTaskRun(
+      [&] { mock_clock_->MockSleepForSeconds(static_cast<int>(kKeyPerSec)); });
+
  int sst_num = 0;
  // Write files that are overlap and enough to trigger compaction
  for (; sst_num < kNumTrigger; sst_num++) {
@@ -1609,6 +1514,11 @@ TEST_F(PrecludeLastLevelTest, LastLevelOnlyCompactionPartial) {
  options.num_levels = kNumLevels;
  DestroyAndReopen(options);

+  // pass some time first, otherwise the first a few keys write time are going
+  // to be zero, and internally zero has special meaning: kUnknownSeqnoTime
+  dbfull()->TEST_WaitForPeriodicTaskRun(
+      [&] { mock_clock_->MockSleepForSeconds(static_cast<int>(kKeyPerSec)); });
+
  int sst_num = 0;
  // Write files that are overlap and enough to trigger compaction
  for (; sst_num < kNumTrigger; sst_num++) {
@@ -1682,6 +1592,11 @@ TEST_P(PrecludeLastLevelTestWithParms, LastLevelOnlyCompactionNoPreclude) {
  options.num_levels = kNumLevels;
  DestroyAndReopen(options);

+  // pass some time first, otherwise the first a few keys write time are going
+  // to be zero, and internally zero has special meaning: kUnknownSeqnoTime
+  dbfull()->TEST_WaitForPeriodicTaskRun(
+      [&] { mock_clock_->MockSleepForSeconds(static_cast<int>(kKeyPerSec)); });
+
  Random rnd(301);
  int sst_num = 0;
  // Write files that are overlap and enough to trigger compaction
@@ -1991,6 +1906,11 @@ TEST_F(PrecludeLastLevelTest, PartialPenultimateLevelCompaction) {
  options.num_levels = kNumLevels;
  DestroyAndReopen(options);

+  // pass some time first, otherwise the first a few keys write time are going
+  // to be zero, and internally zero has special meaning: kUnknownSeqnoTime
+  dbfull()->TEST_WaitForPeriodicTaskRun(
+      [&] { mock_clock_->MockSleepForSeconds(static_cast<int>(10)); });
+
  Random rnd(301);

  for (int i = 0; i < 300; i++) {
@@ -2097,6 +2017,12 @@ TEST_F(PrecludeLastLevelTest, RangeDelsCauseFileEndpointsToOverlap) {
  options.target_file_size_base = kFileBytes;
  DestroyAndReopen(options);

+  // pass some time first, otherwise the first a few keys write time are going
+  // to be zero, and internally zero has special meaning: kUnknownSeqnoTime
+  dbfull()->TEST_WaitForPeriodicTaskRun([&] {
+    mock_clock_->MockSleepForSeconds(static_cast<int>(kSecondsPerKey));
+  });
+
  // Flush an L0 file with the following contents (new to old):
  //
  // Range deletions [4, 6) [7, 8) [9, 11)
@@ -2213,6 +2139,7 @@ TEST_F(PrecludeLastLevelTest, RangeDelsCauseFileEndpointsToOverlap) {
  Close();
 }

+
 }  // namespace ROCKSDB_NAMESPACE

 int main(int argc, char** argv) {
@@ -165,7 +165,6 @@ void DoRandomIteraratorTest(DB* db, std::vector<std::string> source_strings,
    AssertItersEqual(iter.get(), result_iter.get());
    is_valid = iter->Valid();
  }
-  ASSERT_OK(iter->status());
 }

 class DoubleComparator : public Comparator {
@@ -138,7 +138,6 @@ TEST_F(DBBasicTest, ReadOnlyDB) {
      ASSERT_OK(iter->status());
      ++count;
    }
-    ASSERT_OK(iter->status());
    // Always expect two keys: "foo" and "bar"
    ASSERT_EQ(count, 2);
  };
@@ -4415,8 +4414,6 @@ TEST_F(DBBasicTest, ManifestWriteFailure) {
  options.create_if_missing = true;
  options.disable_auto_compactions = true;
  options.env = env_;
-  options.enable_blob_files = true;
-  options.blob_file_size = 0;
  DestroyAndReopen(options);
  ASSERT_OK(Put("foo", "bar"));
  ASSERT_OK(Flush());
@@ -4437,11 +4434,6 @@ TEST_F(DBBasicTest, ManifestWriteFailure) {
  SyncPoint::GetInstance()->ClearAllCallBacks();
  SyncPoint::GetInstance()->EnableProcessing();
  Reopen(options);
-  // The IO error was a mocked one from the `AfterSyncManifest` callback. The
-  // Flush's VersionEdit actually made it into the Manifest. So these keys can
-  // be read back. Read them to check all live sst files and blob files.
-  ASSERT_EQ("bar", Get("foo"));
-  ASSERT_EQ("value", Get("key"));
 }

 TEST_F(DBBasicTest, DestroyDefaultCfHandle) {
@@ -389,7 +389,6 @@ TEST_F(DBBlockCacheTest, FillCacheAndIterateDB) {
  while (iter->Valid()) {
    iter->Next();
  }
-  ASSERT_OK(iter->status());
  delete iter;
  iter = nullptr;
 }
@@ -1905,7 +1905,6 @@ TEST_F(DBBloomFilterTest, PrefixExtractorWithFilter2) {
  for (iter->Seek("zzzzz_AAAA"); iter->Valid(); iter->Next()) {
    iter_res.emplace_back(iter->value().ToString());
  }
-  ASSERT_OK(iter->status());

  std::vector<std::string> expected_res = {"val1", "val2", "val3", "val4"};
  ASSERT_EQ(iter_res, expected_res);
@@ -805,7 +805,6 @@ TEST_F(DBTestCompactionFilter, CompactionFilterIgnoreSnapshot) {
      count++;
      iter->Next();
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(count, 6);
    read_options.snapshot = nullptr;
    std::unique_ptr<Iterator> iter1(db_->NewIterator(read_options));
@@ -816,7 +815,6 @@ TEST_F(DBTestCompactionFilter, CompactionFilterIgnoreSnapshot) {
      count++;
      iter1->Next();
    }
-    ASSERT_OK(iter1->status());
    // We have deleted 10 keys from 40 using the compaction filter
    //  Keys 6-9 before the snapshot and 100-105 after the snapshot
    ASSERT_EQ(count, 30);
@@ -19,7 +19,7 @@
 #include "rocksdb/concurrent_task_limiter.h"
 #include "rocksdb/experimental.h"
 #include "rocksdb/sst_file_writer.h"
-#include "test_util/mock_time_env.h"
+#include "rocksdb/utilities/convenience.h"
 #include "test_util/sync_point.h"
 #include "test_util/testutil.h"
 #include "util/concurrent_task_limiter_impl.h"
@@ -2673,7 +2673,6 @@ TEST_P(DBCompactionTestWithParam, ConvertCompactionStyle) {
    keys_in_db.append(iter->key().ToString());
    keys_in_db.push_back(',');
  }
-  ASSERT_OK(iter->status());
  delete iter;

  std::string expected_keys;
@@ -4794,9 +4793,9 @@ TEST_F(DBCompactionTest, LevelTtlCascadingCompactions) {
      ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->SetCallBack(
          "VersionEdit::EncodeTo:VarintOldestAncesterTime", [&](void* arg) {
            if (if_restart && if_open_all_files) {
-              std::string* encoded_field = static_cast<std::string*>(arg);
-              *encoded_field = "";
-              PutVarint64(encoded_field, 0);
+              std::string* encoded_fieled = static_cast<std::string*>(arg);
+              *encoded_fieled = "";
+              PutVarint64(encoded_fieled, 0);
            }
          });
      ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->EnableProcessing();
@@ -4942,9 +4941,9 @@ TEST_F(DBCompactionTest, LevelPeriodicCompaction) {
      ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->SetCallBack(
          "VersionEdit::EncodeTo:VarintFileCreationTime", [&](void* arg) {
            if (if_restart && if_open_all_files) {
-              std::string* encoded_field = static_cast<std::string*>(arg);
-              *encoded_field = "";
-              PutVarint64(encoded_field, 0);
+              std::string* encoded_fieled = static_cast<std::string*>(arg);
+              *encoded_fieled = "";
+              PutVarint64(encoded_fieled, 0);
            }
          });
      ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->EnableProcessing();
@@ -5020,106 +5019,6 @@ TEST_F(DBCompactionTest, LevelPeriodicCompaction) {
  }
 }

-TEST_F(DBCompactionTest, LevelPeriodicCompactionOffpeak) {
-  // This test simply checks if offpeak adjustment works in Leveled
-  // Compactions. For testing offpeak periodic compactions in various
-  // scenarios, please refer to
-  // DBTestUniversalCompaction2::PeriodicCompactionOffpeak
-  constexpr int kNumKeysPerFile = 32;
-  constexpr int kNumLevelFiles = 2;
-  constexpr int kValueSize = 100;
-  constexpr int kSecondsPerDay = 86400;
-  constexpr int kSecondsPerHour = 3600;
-  constexpr int kSecondsPerMinute = 60;
-
-  for (bool if_restart : {false, true}) {
-    SCOPED_TRACE("if_restart=" + std::to_string(if_restart));
-    Options options = CurrentOptions();
-    options.ttl = 0;
-    options.periodic_compaction_seconds = 5 * kSecondsPerDay;  // 5 days
-    // In the case where all files are opened and doing DB restart
-    // forcing the file creation time in manifest file to be 0 to
-    // simulate the case of reading from an old version.
-    ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->SetCallBack(
-        "VersionEdit::EncodeTo:VarintFileCreationTime", [&](void* arg) {
-          if (if_restart) {
-            std::string* encoded_field = static_cast<std::string*>(arg);
-            *encoded_field = "";
-            PutVarint64(encoded_field, 0);
-          }
-        });
-    ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->EnableProcessing();
-
-    // Just to add some extra random days to current time
-    Random rnd(test::RandomSeed());
-    int days = rnd.Uniform(100);
-
-    int periodic_compactions = 0;
-    ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->SetCallBack(
-        "LevelCompactionPicker::PickCompaction:Return", [&](void* arg) {
-          Compaction* compaction = static_cast<Compaction*>(arg);
-          auto compaction_reason = compaction->compaction_reason();
-          if (compaction_reason == CompactionReason::kPeriodicCompaction) {
-            periodic_compactions++;
-          }
-        });
-
-    // Starting at 12:15AM
-    int now_hour = 0;
-    int now_minute = 15;
-    auto mock_clock = std::make_shared<MockSystemClock>(env_->GetSystemClock());
-    auto mock_env = std::make_unique<CompositeEnvWrapper>(env_, mock_clock);
-    options.env = mock_env.get();
-    mock_clock->SetCurrentTime(days * kSecondsPerDay +
-                               now_hour * kSecondsPerHour +
-                               now_minute * kSecondsPerMinute);
-    // Offpeak is set from 12:30AM to 4:30AM
-    options.daily_offpeak_time_utc = "00:30-04:30";
-    Reopen(options);
-
-    for (int i = 0; i < kNumLevelFiles; ++i) {
-      for (int j = 0; j < kNumKeysPerFile; ++j) {
-        ASSERT_OK(
-            Put(Key(i * kNumKeysPerFile + j), rnd.RandomString(kValueSize)));
-      }
-      ASSERT_OK(Flush());
-    }
-    ASSERT_OK(dbfull()->TEST_WaitForCompact());
-    ASSERT_EQ("2", FilesPerLevel());
-    ASSERT_EQ(0, periodic_compactions);
-
-    // Move clock forward by 1 hour. Now at 1:15AM Day 0. No compaction.
-    mock_clock->MockSleepForSeconds(1 * kSecondsPerHour);
-    ASSERT_OK(Put("a", "1"));
-    ASSERT_OK(Flush());
-    ASSERT_OK(dbfull()->TEST_WaitForCompact());
-    // Assert that the files stay in the same level
-    ASSERT_EQ("3", FilesPerLevel());
-    ASSERT_EQ(0, periodic_compactions);
-    MoveFilesToLevel(1);
-    ASSERT_EQ("0,3", FilesPerLevel());
-
-    // Move clock forward by 4 days and check if it triggers periodic
-    // comapaction at 1:15AM Day 4. Files created on Day 0 at 12:15AM is
-    // expected to expire before the offpeak starts next day at 12:30AM
-    mock_clock->MockSleepForSeconds(4 * kSecondsPerDay);
-    ASSERT_OK(Put("b", "2"));
-    if (if_restart) {
-      Reopen(options);
-    } else {
-      ASSERT_OK(Flush());
-    }
-    ASSERT_OK(dbfull()->TEST_WaitForCompact());
-    ASSERT_EQ("1,3", FilesPerLevel());
-    // The two old files go through the periodic compaction process
-    ASSERT_EQ(2, periodic_compactions);
-
-    Destroy(options);
-
-    ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->DisableProcessing();
-  }
-}
-
 TEST_F(DBCompactionTest, LevelPeriodicCompactionWithOldDB) {
  // This test makes sure that periodic compactions are working with a DB
  // where file_creation_time of some files is 0.
@@ -121,7 +121,7 @@ Status DBImpl::GetSortedWalFiles(VectorLogPtr& files) {

  // DisableFileDeletions / EnableFileDeletions not supported in read-only DB
  if (deletions_disabled.ok()) {
-    Status s2 = EnableFileDeletions(/*force=*/false);
+    Status s2 = EnableFileDeletions(/*force*/ false);
    assert(s2.ok());
    s2.PermitUncheckedError();
  } else {
@@ -1377,7 +1377,6 @@ TEST_F(DBFlushTest, MemPurgeDeleteAndDeleteRange) {
        ASSERT_EQ(value, NOT_FOUND);
      count++;
    }
-    ASSERT_OK(iter->status());

    // Expected count here is 3: KEY3, KEY4, KEY5.
    ASSERT_EQ(count, EXPECTED_COUNT_FORLOOP);
@@ -13,6 +13,7 @@
 #include <alloca.h>
 #endif

+#include <algorithm>
 #include <cinttypes>
 #include <cstdio>
 #include <map>
@@ -272,15 +273,13 @@ DBImpl::DBImpl(const DBOptions& options, const std::string& dbname,
  periodic_task_functions_.emplace(PeriodicTaskType::kFlushInfoLog,
                                   [this]() { this->FlushInfoLog(); });
  periodic_task_functions_.emplace(
-      PeriodicTaskType::kRecordSeqnoTime, [this]() {
-        this->RecordSeqnoToTimeMapping(/*populate_historical_seconds=*/0);
-      });
+      PeriodicTaskType::kRecordSeqnoTime,
+      [this]() { this->RecordSeqnoToTimeMapping(); });

-  versions_.reset(new VersionSet(
-      dbname_, &immutable_db_options_, file_options_, table_cache_.get(),
-      write_buffer_manager_, &write_controller_, &block_cache_tracer_,
-      io_tracer_, db_id_, db_session_id_, options.daily_offpeak_time_utc,
-      &error_handler_));
+  versions_.reset(new VersionSet(dbname_, &immutable_db_options_, file_options_,
+                                 table_cache_.get(), write_buffer_manager_,
+                                 &write_controller_, &block_cache_tracer_,
+                                 io_tracer_, db_id_, db_session_id_));
  column_family_memtables_.reset(
      new ColumnFamilyMemTablesImpl(versions_->GetColumnFamilySet()));

@@ -360,8 +359,10 @@ Status DBImpl::ResumeImpl(DBRecoverContext context) {
    if (io_s.IsIOError()) {
      // If resuming from IOError resulted from MANIFEST write, then assert
      // that we must have already set the MANIFEST writer to nullptr during
-      // clean-up phase MANIFEST writing.
+      // clean-up phase MANIFEST writing. We must have also disabled file
+      // deletions.
      assert(!versions_->descriptor_log_);
+      assert(!IsFileDeletionsEnabled());
      // Since we are trying to recover from MANIFEST write error, we need to
      // switch to a new MANIFEST anyway. The old MANIFEST can be corrupted.
      // Therefore, force writing a dummy version edit because we do not know
@@ -385,18 +386,13 @@ Status DBImpl::ResumeImpl(DBRecoverContext context) {
    }
  }

+  // We cannot guarantee consistency of the WAL. So force flush Memtables of
+  // all the column families
  if (s.ok()) {
-    if (context.flush_reason == FlushReason::kErrorRecoveryRetryFlush) {
-      s = RetryFlushesForErrorRecovery(FlushReason::kErrorRecoveryRetryFlush,
-                                       true /* wait */);
-    } else {
-      // We cannot guarantee consistency of the WAL. So force flush Memtables of
-      // all the column families
-      FlushOptions flush_opts;
-      // We allow flush to stall write since we are trying to resume from error.
-      flush_opts.allow_write_stall = true;
-      s = FlushAllColumnFamilies(flush_opts, context.flush_reason);
-    }
+    FlushOptions flush_opts;
+    // We allow flush to stall write since we are trying to resume from error.
+    flush_opts.allow_write_stall = true;
+    s = FlushAllColumnFamilies(flush_opts, context.flush_reason);
    if (!s.ok()) {
      ROCKS_LOG_INFO(immutable_db_options_.info_log,
                     "DB resume requested but failed due to Flush failure [%s]",
@@ -442,8 +438,11 @@ Status DBImpl::ResumeImpl(DBRecoverContext context) {
    // Since we drop all non-recovery flush requests during recovery,
    // and new memtable may fill up during recovery,
    // schedule one more round of flush.
-    Status status = RetryFlushesForErrorRecovery(
-        FlushReason::kCatchUpAfterErrorRecovery, false /* wait */);
+    FlushOptions flush_opts;
+    flush_opts.allow_write_stall = false;
+    flush_opts.wait = false;
+    Status status = FlushAllColumnFamilies(
+        flush_opts, FlushReason::kCatchUpAfterErrorRecovery);
    if (!status.ok()) {
      // FlushAllColumnFamilies internally should take care of setting
      // background error if needed.
@@ -795,107 +794,42 @@ Status DBImpl::StartPeriodicTaskScheduler() {
  return s;
 }

-Status DBImpl::RegisterRecordSeqnoTimeWorker(bool is_new_db) {
-  options_mutex_.AssertHeld();
-
-  uint64_t min_preserve_seconds = std::numeric_limits<uint64_t>::max();
-  uint64_t max_preserve_seconds = std::numeric_limits<uint64_t>::min();
-  bool mapping_was_empty = false;
+Status DBImpl::RegisterRecordSeqnoTimeWorker() {
+  uint64_t min_time_duration = std::numeric_limits<uint64_t>::max();
+  uint64_t max_time_duration = std::numeric_limits<uint64_t>::min();
  {
    InstrumentedMutexLock l(&mutex_);

    for (auto cfd : *versions_->GetColumnFamilySet()) {
      // preserve time is the max of 2 options.
-      uint64_t preserve_seconds =
+      uint64_t preserve_time_duration =
          std::max(cfd->ioptions()->preserve_internal_time_seconds,
                   cfd->ioptions()->preclude_last_level_data_seconds);
-      if (!cfd->IsDropped() && preserve_seconds > 0) {
-        min_preserve_seconds = std::min(preserve_seconds, min_preserve_seconds);
-        max_preserve_seconds = std::max(preserve_seconds, max_preserve_seconds);
+      if (!cfd->IsDropped() && preserve_time_duration > 0) {
+        min_time_duration = std::min(preserve_time_duration, min_time_duration);
+        max_time_duration = std::max(preserve_time_duration, max_time_duration);
      }
    }
-    if (min_preserve_seconds == std::numeric_limits<uint64_t>::max()) {
-      seqno_to_time_mapping_.Resize(0, 0);
+    if (min_time_duration == std::numeric_limits<uint64_t>::max()) {
+      seqno_time_mapping_.Resize(0, 0);
    } else {
-      seqno_to_time_mapping_.Resize(min_preserve_seconds, max_preserve_seconds);
+      seqno_time_mapping_.Resize(min_time_duration, max_time_duration);
    }
-    mapping_was_empty = seqno_to_time_mapping_.Empty();
  }

  uint64_t seqno_time_cadence = 0;
-  if (min_preserve_seconds != std::numeric_limits<uint64_t>::max()) {
+  if (min_time_duration != std::numeric_limits<uint64_t>::max()) {
    // round up to 1 when the time_duration is smaller than
    // kMaxSeqnoTimePairsPerCF
-    seqno_time_cadence = (min_preserve_seconds +
-                          SeqnoToTimeMapping::kMaxSeqnoTimePairsPerCF - 1) /
-                         SeqnoToTimeMapping::kMaxSeqnoTimePairsPerCF;
+    seqno_time_cadence =
+        (min_time_duration + SeqnoToTimeMapping::kMaxSeqnoTimePairsPerCF - 1) /
+        SeqnoToTimeMapping::kMaxSeqnoTimePairsPerCF;
  }

-  TEST_SYNC_POINT_CALLBACK(
-      "DBImpl::RegisterRecordSeqnoTimeWorker:BeforePeriodicTaskType", nullptr);
-
  Status s;
  if (seqno_time_cadence == 0) {
    s = periodic_task_scheduler_.Unregister(PeriodicTaskType::kRecordSeqnoTime);
  } else {
-    // Before registering the periodic task, we need to be sure to fulfill two
-    // promises:
-    // 1) Any DB created with preserve/preclude options set from the beginning
-    // will get pre-allocated seqnos with pre-populated time mappings back to
-    // the times we are interested in. (This will enable future import of data
-    // while preserving rough write time. We can only do this reliably from
-    // DB::Open, as otherwise there could be a race between CreateColumnFamily
-    // and the first Write to the DB, and seqno-to-time mappings need to be
-    // monotonic.
-    // 2) In any DB, any data written after setting preserve/preclude options
-    // must have a reasonable time estimate (so that we can accurately place
-    // the data), which means at least one entry in seqno_to_time_mapping_.
-    //
-    // FIXME: We don't currently guarantee that if the first column family with
-    // that setting is added or configured after initial DB::Open but before
-    // the first user Write. Fixing this causes complications with the crash
-    // test because if DB starts without preserve/preclude option, does some
-    // user writes but all those writes are lost in crash, then re-opens with
-    // preserve/preclude option, it sees seqno==1 which looks like one of the
-    // user writes was recovered, when actually it was not.
-    bool last_seqno_zero = GetLatestSequenceNumber() == 0;
-    assert(!is_new_db || last_seqno_zero);
-    if (is_new_db && last_seqno_zero) {
-      // Pre-allocate seqnos and pre-populate historical mapping
-      assert(mapping_was_empty);
-
-      // We can simply modify these, before writes are allowed
-      constexpr uint64_t kMax = SeqnoToTimeMapping::kMaxSeqnoTimePairsPerSST;
-      versions_->SetLastAllocatedSequence(kMax);
-      versions_->SetLastPublishedSequence(kMax);
-      versions_->SetLastSequence(kMax);
-
-      // And record in manifest, to avoid going backwards in seqno on re-open
-      // (potentially with different options). Concurrency is simple because we
-      // are in DB::Open
-      {
-        InstrumentedMutexLock l(&mutex_);
-        VersionEdit edit;
-        edit.SetLastSequence(kMax);
-        s = versions_->LogAndApplyToDefaultColumnFamily(
-            {}, &edit, &mutex_, directories_.GetDbDir());
-        if (!s.ok() && versions_->io_status().IsIOError()) {
-          s = error_handler_.SetBGError(versions_->io_status(),
-                                        BackgroundErrorReason::kManifestWrite);
-        }
-      }
-
-      // Pre-populate mappings for reserved sequence numbers.
-      RecordSeqnoToTimeMapping(max_preserve_seconds);
-    } else if (mapping_was_empty) {
-      if (!last_seqno_zero) {
-        // Ensure at least one mapping (or log a warning)
-        RecordSeqnoToTimeMapping(/*populate_historical_seconds=*/0);
-      } else {
-        // FIXME (see limitation described above)
-      }
-    }
-
    s = periodic_task_scheduler_.Register(
        PeriodicTaskType::kRecordSeqnoTime,
        periodic_task_functions_.at(PeriodicTaskType::kRecordSeqnoTime),
@@ -922,7 +856,6 @@ Status DBImpl::CancelPeriodicTaskScheduler() {

 // esitmate the total size of stats_history_
 size_t DBImpl::EstimateInMemoryStatsHistorySize() const {
-  stats_history_mutex_.AssertHeld();
  size_t size_total =
      sizeof(std::map<uint64_t, std::map<std::string, uint64_t>>);
  if (stats_history_.size() == 0) return size_total;
@@ -1213,7 +1146,6 @@ Status DBImpl::SetOptions(
    return Status::InvalidArgument("empty input");
  }

-  InstrumentedMutexLock ol(&options_mutex_);
  MutableCFOptions new_options;
  Status s;
  Status persist_options_status;
@@ -1233,7 +1165,8 @@ Status DBImpl::SetOptions(
      // thread.
      InstallSuperVersionAndScheduleWork(cfd, &sv_context, new_options);

-      persist_options_status = WriteOptionsFile(true /*db_mutex_already_held*/);
+      persist_options_status = WriteOptionsFile(
+          false /*need_mutex_lock*/, true /*need_enter_write_thread*/);
      bg_cv_.SignalAll();
    }
  }
@@ -1271,12 +1204,10 @@ Status DBImpl::SetDBOptions(
    return Status::InvalidArgument("empty input");
  }

-  InstrumentedMutexLock ol(&options_mutex_);
  MutableDBOptions new_options;
  Status s;
  Status persist_options_status = Status::OK();
-  bool wal_size_option_changed = false;
-  bool wal_other_option_changed = false;
+  bool wal_changed = false;
  WriteContext write_context;
  {
    InstrumentedMutexLock l(&mutex_);
@@ -1327,24 +1258,17 @@ Status DBImpl::SetDBOptions(
      const bool max_compactions_increased =
          new_bg_job_limits.max_compactions >
          current_bg_job_limits.max_compactions;
-      const bool offpeak_time_changed =
-          versions_->offpeak_time_option().daily_offpeak_time_utc !=
-          new_db_options.daily_offpeak_time_utc;

-      if (max_flushes_increased || max_compactions_increased ||
-          offpeak_time_changed) {
+      if (max_flushes_increased || max_compactions_increased) {
        if (max_flushes_increased) {
          env_->IncBackgroundThreadsIfNeeded(new_bg_job_limits.max_flushes,
                                             Env::Priority::HIGH);
        }
+
        if (max_compactions_increased) {
          env_->IncBackgroundThreadsIfNeeded(new_bg_job_limits.max_compactions,
                                             Env::Priority::LOW);
        }
-        if (offpeak_time_changed) {
-          versions_->ChangeOffpeakTimeOption(
-              new_db_options.daily_offpeak_time_utc);
-        }

        MaybeScheduleFlushOrCompaction();
      }
@@ -1384,10 +1308,8 @@ Status DBImpl::SetDBOptions(
      table_cache_.get()->SetCapacity(new_options.max_open_files == -1
                                          ? TableCache::kInfiniteCapacity
                                          : new_options.max_open_files - 10);
-      wal_other_option_changed = mutable_db_options_.wal_bytes_per_sync !=
-                                 new_options.wal_bytes_per_sync;
-      wal_size_option_changed = mutable_db_options_.max_total_wal_size !=
-                                new_options.max_total_wal_size;
+      wal_changed = mutable_db_options_.wal_bytes_per_sync !=
+                    new_options.wal_bytes_per_sync;
      mutable_db_options_ = new_options;
      file_options_for_compaction_ = FileOptions(new_db_options);
      file_options_for_compaction_ = fs_->OptimizeForCompactionTableWrite(
@@ -1398,21 +1320,19 @@ Status DBImpl::SetDBOptions(
          file_options_for_compaction_, immutable_db_options_);
      file_options_for_compaction_.compaction_readahead_size =
          mutable_db_options_.compaction_readahead_size;
-      if (wal_other_option_changed || wal_size_option_changed) {
-        WriteThread::Writer w;
-        write_thread_.EnterUnbatched(&w, &mutex_);
-        if (wal_other_option_changed ||
-            total_log_size_ > GetMaxTotalWalSize()) {
-          Status purge_wal_status = SwitchWAL(&write_context);
-          if (!purge_wal_status.ok()) {
-            ROCKS_LOG_WARN(immutable_db_options_.info_log,
-                           "Unable to purge WAL files in SetDBOptions() -- %s",
-                           purge_wal_status.ToString().c_str());
-          }
+      WriteThread::Writer w;
+      write_thread_.EnterUnbatched(&w, &mutex_);
+      if (total_log_size_ > GetMaxTotalWalSize() || wal_changed) {
+        Status purge_wal_status = SwitchWAL(&write_context);
+        if (!purge_wal_status.ok()) {
+          ROCKS_LOG_WARN(immutable_db_options_.info_log,
+                         "Unable to purge WAL files in SetDBOptions() -- %s",
+                         purge_wal_status.ToString().c_str());
        }
-        write_thread_.ExitUnbatched(&w);
      }
-      persist_options_status = WriteOptionsFile(true /*db_mutex_already_held*/);
+      persist_options_status = WriteOptionsFile(
+          false /*need_mutex_lock*/, false /*need_enter_write_thread*/);
+      write_thread_.ExitUnbatched(&w);
    } else {
      // To get here, we must have had invalid options and will not attempt to
      // persist the options, which means the status is "OK/Uninitialized.
@@ -2056,73 +1976,6 @@ Status DBImpl::GetEntity(const ReadOptions& _read_options,
  return GetImpl(read_options, key, get_impl_options);
 }

-Status DBImpl::GetEntity(const ReadOptions& _read_options, const Slice& key,
-                         PinnableAttributeGroups* result) {
-  if (!result) {
-    return Status::InvalidArgument(
-        "Cannot call GetEntity without PinnableAttributeGroups object");
-  }
-  Status s;
-  const size_t num_column_families = result->size();
-  if (_read_options.io_activity != Env::IOActivity::kUnknown &&
-      _read_options.io_activity != Env::IOActivity::kGetEntity) {
-    s = Status::InvalidArgument(
-        "Cannot call GetEntity with `ReadOptions::io_activity` != "
-        "`Env::IOActivity::kUnknown` or `Env::IOActivity::kGetEntity`");
-    for (size_t i = 0; i < num_column_families; ++i) {
-      (*result)[i].SetStatus(s);
-    }
-    return s;
-  }
-  // return early if no CF was passed in
-  if (num_column_families == 0) {
-    return s;
-  }
-  ReadOptions read_options(_read_options);
-  if (read_options.io_activity == Env::IOActivity::kUnknown) {
-    read_options.io_activity = Env::IOActivity::kGetEntity;
-  }
-  std::vector<Slice> keys;
-  std::vector<ColumnFamilyHandle*> column_families;
-  for (size_t i = 0; i < num_column_families; ++i) {
-    // If any of the CFH is null, break early since the entire query will fail
-    if (!(*result)[i].column_family()) {
-      s = Status::InvalidArgument(
-          "DB failed to query because one or more group(s) have null column "
-          "family handle");
-      (*result)[i].SetStatus(
-          Status::InvalidArgument("Column family handle cannot be null"));
-      break;
-    }
-    // Adding the same key slice for different CFs
-    keys.emplace_back(key);
-    column_families.emplace_back((*result)[i].column_family());
-  }
-  if (!s.ok()) {
-    for (size_t i = 0; i < num_column_families; ++i) {
-      if ((*result)[i].status().ok()) {
-        (*result)[i].SetStatus(
-            Status::Incomplete("DB not queried due to invalid argument(s) in "
-                               "one or more of the attribute groups"));
-      }
-    }
-    return s;
-  }
-  std::vector<PinnableWideColumns> columns(num_column_families);
-  std::vector<Status> statuses(num_column_families);
-  MultiGetCommon(
-      read_options, num_column_families, column_families.data(), keys.data(),
-      /* values */ nullptr, columns.data(),
-      /* timestamps */ nullptr, statuses.data(), /* sorted_input */ false);
-  // Set results
-  for (size_t i = 0; i < num_column_families; ++i) {
-    (*result)[i].Reset();
-    (*result)[i].SetStatus(statuses[i]);
-    (*result)[i].SetColumns(std::move(columns[i]));
-  }
-  return s;
-}
-
 bool DBImpl::ShouldReferenceSuperVersion(const MergeContext& merge_context) {
  // If both thresholds are reached, a function returning merge operands as
  // `PinnableSlice`s should reference the `SuperVersion` to avoid large and/or
@@ -2902,6 +2755,7 @@ void DBImpl::MultiGetCommon(const ReadOptions& read_options,
  bool should_fail = false;
  for (size_t i = 0; i < num_keys; ++i) {
    ColumnFamilyHandle* cfh = column_families[i];
+    assert(cfh);
    if (read_options.timestamp) {
      statuses[i] = FailIfTsMismatchCf(cfh, *(read_options.timestamp));
      if (!statuses[i].ok()) {
@@ -3421,86 +3275,14 @@ void DBImpl::MultiGetEntity(const ReadOptions& _read_options,
                 statuses, sorted_input);
 }

-void DBImpl::MultiGetEntity(const ReadOptions& _read_options, size_t num_keys,
-                            const Slice* keys,
-                            PinnableAttributeGroups* results) {
-  if (_read_options.io_activity != Env::IOActivity::kUnknown &&
-      _read_options.io_activity != Env::IOActivity::kMultiGetEntity) {
-    Status s = Status::InvalidArgument(
-        "Can only call MultiGetEntity with ReadOptions::io_activity` is "
-        "`Env::IOActivity::kUnknown` or `Env::IOActivity::kMultiGetEntity`");
-    for (size_t i = 0; i < num_keys; ++i) {
-      for (size_t j = 0; j < results[i].size(); ++j) {
-        results[i][j].SetStatus(s);
-      }
-    }
-    return;
-  }
-  ReadOptions read_options(_read_options);
-  if (read_options.io_activity == Env::IOActivity::kUnknown) {
-    read_options.io_activity = Env::IOActivity::kMultiGetEntity;
-  }
-
-  std::vector<ColumnFamilyHandle*> column_families;
-  std::vector<Slice> all_keys;
-  size_t total_count = 0;
-
-  for (size_t i = 0; i < num_keys; ++i) {
-    for (size_t j = 0; j < results[i].size(); ++j) {
-      // Adding the same key slice for different CFs
-      all_keys.emplace_back(keys[i]);
-      column_families.emplace_back(results[i][j].column_family());
-      ++total_count;
-    }
-  }
-  std::vector<Status> statuses(total_count);
-  std::vector<PinnableWideColumns> columns(total_count);
-  MultiGetCommon(read_options, total_count, column_families.data(),
-                 all_keys.data(),
-                 /* values */ nullptr, columns.data(),
-                 /* timestamps */ nullptr, statuses.data(),
-                 /* sorted_input */ false);
-
-  // Set results
-  size_t index = 0;
-  for (size_t i = 0; i < num_keys; ++i) {
-    for (size_t j = 0; j < results[i].size(); ++j) {
-      results[i][j].Reset();
-      results[i][j].SetStatus(std::move(statuses[index]));
-      results[i][j].SetColumns(std::move(columns[index]));
-      ++index;
-    }
-  }
-}
-
-Status DBImpl::WrapUpCreateColumnFamilies(
-    const std::vector<const ColumnFamilyOptions*>& cf_options) {
-  // NOTE: this function is skipped for create_missing_column_families and
-  // DB::Open, so new functionality here might need to go into Open also.
-  bool register_worker = false;
-  for (auto* opts_ptr : cf_options) {
-    if (opts_ptr->preserve_internal_time_seconds > 0 ||
-        opts_ptr->preclude_last_level_data_seconds > 0) {
-      register_worker = true;
-      break;
-    }
-  }
-  // Attempt both follow-up actions even if one fails
-  Status s = WriteOptionsFile(false /*db_mutex_already_held*/);
-  if (register_worker) {
-    s.UpdateIfOk(RegisterRecordSeqnoTimeWorker(/*from_db_open=*/false));
-  }
-  return s;
-}
-
 Status DBImpl::CreateColumnFamily(const ColumnFamilyOptions& cf_options,
                                  const std::string& column_family,
                                  ColumnFamilyHandle** handle) {
  assert(handle != nullptr);
-  InstrumentedMutexLock ol(&options_mutex_);
  Status s = CreateColumnFamilyImpl(cf_options, column_family, handle);
  if (s.ok()) {
-    s.UpdateIfOk(WrapUpCreateColumnFamilies({&cf_options}));
+    s = WriteOptionsFile(true /*need_mutex_lock*/,
+                         true /*need_enter_write_thread*/);
  }
  return s;
 }
@@ -3510,7 +3292,6 @@ Status DBImpl::CreateColumnFamilies(
    const std::vector<std::string>& column_family_names,
    std::vector<ColumnFamilyHandle*>* handles) {
  assert(handles != nullptr);
-  InstrumentedMutexLock ol(&options_mutex_);
  handles->clear();
  size_t num_cf = column_family_names.size();
  Status s;
@@ -3525,7 +3306,11 @@ Status DBImpl::CreateColumnFamilies(
    success_once = true;
  }
  if (success_once) {
-    s.UpdateIfOk(WrapUpCreateColumnFamilies({&cf_options}));
+    Status persist_options_status = WriteOptionsFile(
+        true /*need_mutex_lock*/, true /*need_enter_write_thread*/);
+    if (s.ok() && !persist_options_status.ok()) {
+      s = persist_options_status;
+    }
  }
  return s;
 }
@@ -3534,13 +3319,10 @@ Status DBImpl::CreateColumnFamilies(
    const std::vector<ColumnFamilyDescriptor>& column_families,
    std::vector<ColumnFamilyHandle*>* handles) {
  assert(handles != nullptr);
-  InstrumentedMutexLock ol(&options_mutex_);
  handles->clear();
  size_t num_cf = column_families.size();
  Status s;
  bool success_once = false;
-  std::vector<const ColumnFamilyOptions*> cf_opts;
-  cf_opts.reserve(num_cf);
  for (size_t i = 0; i < num_cf; i++) {
    ColumnFamilyHandle* handle;
    s = CreateColumnFamilyImpl(column_families[i].options,
@@ -3550,10 +3332,13 @@ Status DBImpl::CreateColumnFamilies(
    }
    handles->push_back(handle);
    success_once = true;
-    cf_opts.push_back(&column_families[i].options);
  }
  if (success_once) {
-    s.UpdateIfOk(WrapUpCreateColumnFamilies(cf_opts));
+    Status persist_options_status = WriteOptionsFile(
+        true /*need_mutex_lock*/, true /*need_enter_write_thread*/);
+    if (s.ok() && !persist_options_status.ok()) {
+      s = persist_options_status;
+    }
  }
  return s;
 }
@@ -3561,7 +3346,6 @@ Status DBImpl::CreateColumnFamilies(
 Status DBImpl::CreateColumnFamilyImpl(const ColumnFamilyOptions& cf_options,
                                      const std::string& column_family_name,
                                      ColumnFamilyHandle** handle) {
-  options_mutex_.AssertHeld();
  // TODO: plumb Env::IOActivity
  const ReadOptions read_options;
  Status s;
@@ -3642,6 +3426,10 @@ Status DBImpl::CreateColumnFamilyImpl(const ColumnFamilyOptions& cf_options,
    }
  }  // InstrumentedMutexLock l(&mutex_)

+  if (cf_options.preserve_internal_time_seconds > 0 ||
+      cf_options.preclude_last_level_data_seconds > 0) {
+    s = RegisterRecordSeqnoTimeWorker();
+  }
  sv_context.Clean();
  // this is outside the mutex
  if (s.ok()) {
@@ -3653,17 +3441,16 @@ Status DBImpl::CreateColumnFamilyImpl(const ColumnFamilyOptions& cf_options,

 Status DBImpl::DropColumnFamily(ColumnFamilyHandle* column_family) {
  assert(column_family != nullptr);
-  InstrumentedMutexLock ol(&options_mutex_);
  Status s = DropColumnFamilyImpl(column_family);
  if (s.ok()) {
-    s = WriteOptionsFile(false /*db_mutex_already_held*/);
+    s = WriteOptionsFile(true /*need_mutex_lock*/,
+                         true /*need_enter_write_thread*/);
  }
  return s;
 }

 Status DBImpl::DropColumnFamilies(
    const std::vector<ColumnFamilyHandle*>& column_families) {
-  InstrumentedMutexLock ol(&options_mutex_);
  Status s;
  bool success_once = false;
  for (auto* handle : column_families) {
@@ -3674,8 +3461,8 @@ Status DBImpl::DropColumnFamilies(
    success_once = true;
  }
  if (success_once) {
-    Status persist_options_status =
-        WriteOptionsFile(false /*db_mutex_already_held*/);
+    Status persist_options_status = WriteOptionsFile(
+        true /*need_mutex_lock*/, true /*need_enter_write_thread*/);
    if (s.ok() && !persist_options_status.ok()) {
      s = persist_options_status;
    }
@@ -3736,7 +3523,7 @@ Status DBImpl::DropColumnFamilyImpl(ColumnFamilyHandle* column_family) {

  if (cfd->ioptions()->preserve_internal_time_seconds > 0 ||
      cfd->ioptions()->preclude_last_level_data_seconds > 0) {
-    s = RegisterRecordSeqnoTimeWorker(/*from_db_open=*/false);
+    s = RegisterRecordSeqnoTimeWorker();
  }

  if (s.ok()) {
@@ -5303,13 +5090,16 @@ Status DestroyDB(const std::string& dbname, const Options& options,
  return result;
 }

-Status DBImpl::WriteOptionsFile(bool db_mutex_already_held) {
-  options_mutex_.AssertHeld();
-
-  if (db_mutex_already_held) {
-    mutex_.AssertHeld();
-  } else {
+Status DBImpl::WriteOptionsFile(bool need_mutex_lock,
+                                bool need_enter_write_thread) {
+  WriteThread::Writer w;
+  if (need_mutex_lock) {
    mutex_.Lock();
+  } else {
+    mutex_.AssertHeld();
+  }
+  if (need_enter_write_thread) {
+    write_thread_.EnterUnbatched(&w, &mutex_);
  }

  std::vector<std::string> cf_names;
@@ -5324,10 +5114,10 @@ Status DBImpl::WriteOptionsFile(bool db_mutex_already_held) {
    cf_opts.push_back(cfd->GetLatestCFOptions());
  }

+  // Unlock during expensive operations.  New writes cannot get here
+  // because the single write thread ensures all new writes get queued.
  DBOptions db_options =
      BuildDBOptions(immutable_db_options_, mutable_db_options_);
-
-  // Unlock during expensive operations.
  mutex_.Unlock();

  TEST_SYNC_POINT("DBImpl::WriteOptionsFile:1");
@@ -5352,22 +5142,22 @@ Status DBImpl::WriteOptionsFile(bool db_mutex_already_held) {
    }
  }

+  // restore lock
+  if (!need_mutex_lock) {
+    mutex_.Lock();
+  }
+  if (need_enter_write_thread) {
+    write_thread_.ExitUnbatched(&w);
+  }
  if (!s.ok()) {
    ROCKS_LOG_WARN(immutable_db_options_.info_log,
                   "Unnable to persist options -- %s", s.ToString().c_str());
    if (immutable_db_options_.fail_if_options_file_error) {
-      s = Status::IOError("Unable to persist options.", s.ToString().c_str());
-    } else {
-      // Ignore error
-      s = Status::OK();
+      return Status::IOError("Unable to persist options.",
+                             s.ToString().c_str());
    }
  }
-
-  // Restore lock if appropriate
-  if (db_mutex_already_held) {
-    mutex_.Lock();
-  }
-  return s;
+  return Status::OK();
 }

 namespace {
@@ -6562,51 +6352,19 @@ Status DBImpl::GetCreationTimeOfOldestFile(uint64_t* creation_time) {
  }
 }

-void DBImpl::RecordSeqnoToTimeMapping(uint64_t populate_historical_seconds) {
-  // TECHNICALITY: Sample last sequence number *before* time, as prescribed
-  // for SeqnoToTimeMapping. We don't know how long it has been since the last
-  // sequence number was written, so we at least have a one-sided bound by
-  // sampling in this order.
-  SequenceNumber seqno = GetLatestSequenceNumber();
-  int64_t unix_time_signed = 0;
-  immutable_db_options_.clock->GetCurrentTime(&unix_time_signed)
+void DBImpl::RecordSeqnoToTimeMapping() {
+  // Get time first then sequence number, so the actual time of seqno is <=
+  // unix_time recorded
+  int64_t unix_time = 0;
+  immutable_db_options_.clock->GetCurrentTime(&unix_time)
      .PermitUncheckedError();  // Ignore error
-  uint64_t unix_time = static_cast<uint64_t>(unix_time_signed);
+  SequenceNumber seqno = GetLatestSequenceNumber();
  bool appended = false;
  {
    InstrumentedMutexLock l(&mutex_);
-    if (populate_historical_seconds > 0) {
-      if (seqno > 1 && unix_time > populate_historical_seconds) {
-        // seqno=0 is reserved
-        SequenceNumber from_seqno = 1;
-        appended = seqno_to_time_mapping_.PrePopulate(
-            from_seqno, seqno, unix_time - populate_historical_seconds,
-            unix_time);
-      } else {
-        // One of these will fail
-        assert(seqno > 1);
-        assert(unix_time > populate_historical_seconds);
-      }
-    } else {
-      // FIXME: assert(seqno > 0);
-      appended = seqno_to_time_mapping_.Append(seqno, unix_time);
-    }
+    appended = seqno_time_mapping_.Append(seqno, unix_time);
  }
-  if (populate_historical_seconds > 0) {
-    if (appended) {
-      ROCKS_LOG_INFO(
-          immutable_db_options_.info_log,
-          "Pre-populated sequence number to time entries: [1,%" PRIu64
-          "] -> [%" PRIu64 ",%" PRIu64 "]",
-          seqno, unix_time - populate_historical_seconds, unix_time);
-    } else {
-      ROCKS_LOG_WARN(
-          immutable_db_options_.info_log,
-          "Failed to pre-populate sequence number to time entries: [1,%" PRIu64
-          "] -> [%" PRIu64 ",%" PRIu64 "]",
-          seqno, unix_time - populate_historical_seconds, unix_time);
-    }
-  } else if (!appended) {
+  if (!appended) {
    ROCKS_LOG_WARN(immutable_db_options_.info_log,
                   "Failed to insert sequence number to time entry: %" PRIu64
                   " -> %" PRIu64,
@@ -197,8 +197,6 @@ class DBImpl : public DB {
  Status PutEntity(const WriteOptions& options,
                   ColumnFamilyHandle* column_family, const Slice& key,
                   const WideColumns& columns) override;
-  Status PutEntity(const WriteOptions& options, const Slice& key,
-                   const AttributeGroups& attribute_groups) override;

  using DB::Merge;
  Status Merge(const WriteOptions& options, ColumnFamilyHandle* column_family,
@@ -244,8 +242,6 @@ class DBImpl : public DB {
  Status GetEntity(const ReadOptions& options,
                   ColumnFamilyHandle* column_family, const Slice& key,
                   PinnableWideColumns* columns) override;
-  Status GetEntity(const ReadOptions& options, const Slice& key,
-                   PinnableAttributeGroups* result) override;

  using DB::GetMergeOperands;
  Status GetMergeOperands(const ReadOptions& options,
@@ -315,9 +311,6 @@ class DBImpl : public DB {
                      ColumnFamilyHandle** column_families, const Slice* keys,
                      PinnableWideColumns* results, Status* statuses,
                      bool sorted_input) override;
-  void MultiGetEntity(const ReadOptions& options, size_t num_keys,
-                      const Slice* keys,
-                      PinnableAttributeGroups* results) override;

  virtual Status CreateColumnFamily(const ColumnFamilyOptions& cf_options,
                                    const std::string& column_family,
@@ -1190,7 +1183,6 @@ class DBImpl : public DB {
  size_t TEST_GetWalPreallocateBlockSize(uint64_t write_buffer_size) const;
  void TEST_WaitForPeriodicTaskRun(std::function<void()> callback) const;
  SeqnoToTimeMapping TEST_GetSeqnoToTimeMapping() const;
-  const autovector<uint64_t>& TEST_GetFilesToQuarantine() const;
  size_t TEST_EstimateInMemoryStatsHistorySize() const;

  uint64_t TEST_GetCurrentLogNumber() const {
@@ -1205,10 +1197,6 @@ class DBImpl : public DB {

  const PeriodicTaskScheduler& TEST_GetPeriodicTaskScheduler() const;

-  static Status TEST_ValidateOptions(const DBOptions& db_options) {
-    return ValidateOptions(db_options);
-  }
-
 #endif  // NDEBUG

  // persist stats to column family "_persistent_stats"
@@ -1220,11 +1208,8 @@ class DBImpl : public DB {
  // flush LOG out of application buffer
  void FlushInfoLog();

-  // record current sequence number to time mapping. If
-  // populate_historical_seconds > 0 then pre-populate all the
-  // sequence numbers from [1, last] to map to [now minus
-  // populate_historical_seconds, now].
-  void RecordSeqnoToTimeMapping(uint64_t populate_historical_seconds);
+  // record current sequence number to time mapping
+  void RecordSeqnoToTimeMapping();

  // Interface to block and signal the DB in case of stalling writes by
  // WriteBufferManager. Each DBImpl object contains ptr to WBMStallInterface.
@@ -1404,9 +1389,11 @@ class DBImpl : public DB {
    bool is_new_db_ = false;
  };

-  // Persist options to options file. Must be holding options_mutex_.
-  // Will lock DB mutex if !db_mutex_already_held.
-  Status WriteOptionsFile(bool db_mutex_already_held);
+  // Except in DB::Open(), WriteOptionsFile can only be called when:
+  // Persist options to options file.
+  // If need_mutex_lock = false, the method will lock DB mutex.
+  // If need_enter_write_thread = false, the method will enter write thread.
+  Status WriteOptionsFile(bool need_mutex_lock, bool need_enter_write_thread);

  Status CompactRangeInternal(const CompactRangeOptions& options,
                              ColumnFamilyHandle* column_family,
@@ -1834,15 +1821,10 @@ class DBImpl : public DB {

  const Status CreateArchivalDirectory();

-  // Create a column family, without some of the follow-up work yet
  Status CreateColumnFamilyImpl(const ColumnFamilyOptions& cf_options,
                                const std::string& cf_name,
                                ColumnFamilyHandle** handle);

-  // Follow-up work to user creating a column family or (families)
-  Status WrapUpCreateColumnFamilies(
-      const std::vector<const ColumnFamilyOptions*>& cf_options);
-
  Status DropColumnFamilyImpl(ColumnFamilyHandle* column_family);

  // Delete any unneeded files and stale in-memory entries.
@@ -1968,8 +1950,6 @@ class DBImpl : public DB {
      const autovector<ColumnFamilyData*>& provided_candidate_cfds = {},
      bool entered_write_thread = false);

-  Status RetryFlushesForErrorRecovery(FlushReason flush_reason, bool wait);
-
  // Wait until flushing this column family won't stall writes
  Status WaitUntilFlushWouldNotStallWrites(ColumnFamilyData* cfd,
                                           bool* flush_needed);
@@ -2118,12 +2098,6 @@ class DBImpl : public DB {
 #endif /* !NDEBUG */
  };

-  // In case of atomic flush, generates a `FlushRequest` for the latest atomic
-  // cuts for these `cfds`. Atomic cuts are recorded in
-  // `AssignAtomicFlushSeq()`. For each entry in `cfds`, all CFDs sharing the
-  // same latest atomic cut must also be present.
-  //
-  // REQUIRES: mutex held
  void GenerateFlushRequest(const autovector<ColumnFamilyData*>& cfds,
                            FlushReason flush_reason, FlushRequest* req);

@@ -2175,7 +2149,7 @@ class DBImpl : public DB {
  // Cancel scheduled periodic tasks
  Status CancelPeriodicTaskScheduler();

-  Status RegisterRecordSeqnoTimeWorker(bool is_new_db);
+  Status RegisterRecordSeqnoTimeWorker();

  void PrintStatistics();

@@ -2255,7 +2229,6 @@ class DBImpl : public DB {
  bool ShouldntRunManualCompaction(ManualCompactionState* m);
  bool HaveManualCompaction(ColumnFamilyData* cfd);
  bool MCOverlap(ManualCompactionState* m, ManualCompactionState* m1);
-  void UpdateDeletionCompactionStats(const std::unique_ptr<Compaction>& c);
  void BuildCompactionJobInfo(const ColumnFamilyData* cfd, Compaction* c,
                              const Status& st,
                              const CompactionJobStats& compaction_job_stats,
@@ -2381,6 +2354,10 @@ class DBImpl : public DB {

  Status DisableFileDeletionsWithLock();

+  // Safely decrease `disable_delete_obsolete_files_` by one while holding lock
+  // and return its remaning value.
+  int EnableFileDeletionsWithLock();
+
  Status IncreaseFullHistoryTsLowImpl(ColumnFamilyData* cfd,
                                      std::string ts_low);

@@ -2389,19 +2366,9 @@ class DBImpl : public DB {
  // Lock over the persistent DB state.  Non-nullptr iff successfully acquired.
  FileLock* db_lock_;

-  // Guards changes to DB and CF options to ensure consistency between
-  // * In-memory options objects
-  // * Settings in effect
-  // * Options file contents
-  // while allowing the DB mutex to be released during slow operations like
-  // persisting options file or modifying global periodic task timer.
-  // Always acquired *before* DB mutex when this one is applicable.
-  InstrumentedMutex options_mutex_;
-
-  // Guards reads and writes to in-memory stats_history_.
+  // In addition to mutex_, log_write_mutex_ protected writes to stats_history_
  InstrumentedMutex stats_history_mutex_;
-
-  // In addition to mutex_, log_write_mutex_ protects writes to logs_ and
+  // In addition to mutex_, log_write_mutex_ protected writes to logs_ and
  // logfile_number_. With two_write_queues it also protects alive_log_files_,
  // and log_empty_. Refer to the definition of each variable below for more
  // details.
@@ -2788,9 +2755,9 @@ class DBImpl : public DB {
  // Pointer to WriteBufferManager stalling interface.
  std::unique_ptr<StallInterface> wbm_stall_;

-  // seqno_to_time_mapping_ stores the sequence number to time mapping, it's not
+  // seqno_time_mapping_ stores the sequence number to time mapping, it's not
  // thread safe, both read and write need db mutex hold.
-  SeqnoToTimeMapping seqno_to_time_mapping_;
+  SeqnoToTimeMapping seqno_time_mapping_;

  // Stop write token that is acquired when first LockWAL() is called.
  // Destroyed when last UnlockWAL() is called. Controlled by DB mutex.
@@ -2870,9 +2837,7 @@ static void ClipToRange(T* ptr, V minvalue, V maxvalue) {

 inline Status DBImpl::FailIfCfHasTs(
    const ColumnFamilyHandle* column_family) const {
-  if (!column_family) {
-    return Status::InvalidArgument("column family handle cannot be null");
-  }
+  column_family = column_family ? column_family : DefaultColumnFamily();
  assert(column_family);
  const Comparator* const ucmp = column_family->GetComparator();
  assert(ucmp);
@@ -223,10 +223,9 @@ Status DBImpl::FlushMemTableToOutputFile(
  // `snapshot_seqs` has already been computed before this function starts.
  // Recording the max memtable ID ensures that the flush job does not flush
  // a memtable without knowing such snapshot(s).
-  uint64_t max_memtable_id =
-      needs_to_sync_closed_wals
-          ? cfd->imm()->GetLatestMemTableID(false /* for_atomic_flush */)
-          : std::numeric_limits<uint64_t>::max();
+  uint64_t max_memtable_id = needs_to_sync_closed_wals
+                                 ? cfd->imm()->GetLatestMemTableID()
+                                 : std::numeric_limits<uint64_t>::max();

  // If needs_to_sync_closed_wals is false, then the flush job will pick ALL
  // existing memtables of the column family when PickMemTable() is called
@@ -235,7 +234,7 @@ Status DBImpl::FlushMemTableToOutputFile(
  // releases and re-acquires the db mutex. In the meantime, the application
  // can still insert into the memtables and increase the db's sequence number.
  // The application can take a snapshot, hoping that the latest visible state
-  // to this snapshot is preserved. This is hard to guarantee since db mutex
+  // to this snapshto is preserved. This is hard to guarantee since db mutex
  // not held. This newly-created snapshot is not included in `snapshot_seqs`
  // and the flush job is unaware of its presence. Consequently, the flush job
  // may drop certain keys when generating the L0, causing incorrect data to be
@@ -252,7 +251,7 @@ Status DBImpl::FlushMemTableToOutputFile(
      GetCompressionFlush(*cfd->ioptions(), mutable_cf_options), stats_,
      &event_logger_, mutable_cf_options.report_bg_io_stats,
      true /* sync_output_directory */, true /* write_manifest */, thread_pri,
-      io_tracer_, seqno_to_time_mapping_, db_id_, db_session_id_,
+      io_tracer_, seqno_time_mapping_, db_id_, db_session_id_,
      cfd->GetFullHistoryTsLow(), &blob_callback_);
  FileMetaData file_meta;

@@ -526,7 +525,7 @@ Status DBImpl::AtomicFlushMemTablesToOutputFiles(
        GetCompressionFlush(*cfd->ioptions(), mutable_cf_options), stats_,
        &event_logger_, mutable_cf_options.report_bg_io_stats,
        false /* sync_output_directory */, false /* write_manifest */,
-        thread_pri, io_tracer_, seqno_to_time_mapping_, db_id_, db_session_id_,
+        thread_pri, io_tracer_, seqno_time_mapping_, db_id_, db_session_id_,
        cfd->GetFullHistoryTsLow(), &blob_callback_));
  }

@@ -2236,8 +2235,7 @@ void DBImpl::GenerateFlushRequest(const autovector<ColumnFamilyData*>& cfds,
      // cfd may be null, see DBImpl::ScheduleFlushes
      continue;
    }
-    uint64_t max_memtable_id = cfd->imm()->GetLatestMemTableID(
-        immutable_db_options_.atomic_flush /* for_atomic_flush */);
+    uint64_t max_memtable_id = cfd->imm()->GetLatestMemTableID();
    req->cfd_to_max_mem_id_to_persist.emplace(cfd, max_memtable_id);
  }
 }
@@ -2281,7 +2279,19 @@ Status DBImpl::FlushMemTable(ColumnFamilyData* cfd,
    }
    WaitForPendingWrites();

-    if (!cfd->mem()->IsEmpty() || !cached_recoverable_state_empty_.load()) {
+    if (flush_reason != FlushReason::kErrorRecoveryRetryFlush &&
+        flush_reason != FlushReason::kCatchUpAfterErrorRecovery &&
+        (!cfd->mem()->IsEmpty() || !cached_recoverable_state_empty_.load())) {
+      // Note that, when flush reason is kErrorRecoveryRetryFlush, during the
+      // auto retry resume, we want to avoid creating new small memtables.
+      // If flush reason is kCatchUpAfterErrorRecovery, we try to flush any new
+      // memtable that filled up during recovery, and we also want to avoid
+      // switching memtable to create small memtables.
+      // Therefore, SwitchMemtable will not be called. Also, since ResumeImpl
+      // will iterate through all the CFs and call FlushMemtable during auto
+      // retry resume, it is possible that in some CFs,
+      // cfd->imm()->NumNotFlushed() = 0. In this case, so no flush request will
+      // be created and scheduled, status::OK() will be returned.
      s = SwitchMemtable(cfd, &context);
    }
    const uint64_t flush_memtable_id = std::numeric_limits<uint64_t>::max();
@@ -2290,10 +2300,10 @@ Status DBImpl::FlushMemTable(ColumnFamilyData* cfd,
          !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(
-            cfd->imm()->GetLatestMemTableID(false /* for_atomic_flush */));
+        memtable_ids_to_wait.emplace_back(cfd->imm()->GetLatestMemTableID());
      }
-      if (immutable_db_options_.persist_stats_to_disk) {
+      if (immutable_db_options_.persist_stats_to_disk &&
+          flush_reason != FlushReason::kErrorRecoveryRetryFlush) {
        ColumnFamilyData* cfd_stats =
            versions_->GetColumnFamilySet()->GetColumnFamily(
                kPersistentStatsColumnFamilyName);
@@ -2319,8 +2329,7 @@ Status DBImpl::FlushMemTable(ColumnFamilyData* cfd,
            FlushRequest req{flush_reason, {{cfd_stats, flush_memtable_id}}};
            flush_reqs.emplace_back(std::move(req));
            memtable_ids_to_wait.emplace_back(
-                cfd_stats->imm()->GetLatestMemTableID(
-                    false /* for_atomic_flush */));
+                cfd_stats->imm()->GetLatestMemTableID());
          }
        }
      }
@@ -2371,7 +2380,8 @@ Status DBImpl::FlushMemTable(ColumnFamilyData* cfd,
    }
    s = WaitForFlushMemTables(
        cfds, flush_memtable_ids,
-        flush_reason == FlushReason::kErrorRecovery /* resuming_from_bg_err */);
+        (flush_reason == FlushReason::kErrorRecovery ||
+         flush_reason == FlushReason::kErrorRecoveryRetryFlush));
    InstrumentedMutexLock lock_guard(&mutex_);
    for (auto* tmp_cfd : cfds) {
      tmp_cfd->UnrefAndTryDelete();
@@ -2466,7 +2476,9 @@ Status DBImpl::AtomicFlushMemTables(
    }

    for (auto cfd : cfds) {
-      if (cfd->mem()->IsEmpty() && cached_recoverable_state_empty_.load()) {
+      if ((cfd->mem()->IsEmpty() && cached_recoverable_state_empty_.load()) ||
+          flush_reason == FlushReason::kErrorRecoveryRetryFlush ||
+          flush_reason == FlushReason::kCatchUpAfterErrorRecovery) {
        continue;
      }
      cfd->Ref();
@@ -2511,7 +2523,8 @@ Status DBImpl::AtomicFlushMemTables(
    }
    s = WaitForFlushMemTables(
        cfds, flush_memtable_ids,
-        flush_reason == FlushReason::kErrorRecovery /* resuming_from_bg_err */);
+        (flush_reason == FlushReason::kErrorRecovery ||
+         flush_reason == FlushReason::kErrorRecoveryRetryFlush));
    InstrumentedMutexLock lock_guard(&mutex_);
    for (auto* cfd : cfds) {
      cfd->UnrefAndTryDelete();
@@ -2520,68 +2533,6 @@ Status DBImpl::AtomicFlushMemTables(
  return s;
 }

-Status DBImpl::RetryFlushesForErrorRecovery(FlushReason flush_reason,
-                                            bool wait) {
-  mutex_.AssertHeld();
-  assert(flush_reason == FlushReason::kErrorRecoveryRetryFlush ||
-         flush_reason == FlushReason::kCatchUpAfterErrorRecovery);
-
-  // Collect referenced CFDs.
-  autovector<ColumnFamilyData*> cfds;
-  for (ColumnFamilyData* cfd : *versions_->GetColumnFamilySet()) {
-    if (!cfd->IsDropped() && cfd->initialized() &&
-        cfd->imm()->NumNotFlushed() != 0) {
-      cfd->Ref();
-      cfd->imm()->FlushRequested();
-      cfds.push_back(cfd);
-    }
-  }
-
-  // Submit flush requests for all immutable memtables needing flush.
-  // `flush_memtable_ids` will be populated such that all immutable
-  // memtables eligible for flush are waited on before this function
-  // returns.
-  autovector<uint64_t> flush_memtable_ids;
-  if (immutable_db_options_.atomic_flush) {
-    FlushRequest flush_req;
-    GenerateFlushRequest(cfds, flush_reason, &flush_req);
-    SchedulePendingFlush(flush_req);
-    for (auto& iter : flush_req.cfd_to_max_mem_id_to_persist) {
-      flush_memtable_ids.push_back(iter.second);
-    }
-  } else {
-    for (auto cfd : cfds) {
-      flush_memtable_ids.push_back(
-          cfd->imm()->GetLatestMemTableID(false /* for_atomic_flush */));
-      // Impose no bound on the highest memtable ID flushed. There is no
-      // reason to do so outside of atomic flush.
-      FlushRequest flush_req{
-          flush_reason,
-          {{cfd,
-            std::numeric_limits<uint64_t>::max() /* max_mem_id_to_persist */}}};
-      SchedulePendingFlush(flush_req);
-    }
-  }
-  MaybeScheduleFlushOrCompaction();
-
-  Status s;
-  if (wait) {
-    mutex_.Unlock();
-    autovector<const uint64_t*> flush_memtable_id_ptrs;
-    for (auto& flush_memtable_id : flush_memtable_ids) {
-      flush_memtable_id_ptrs.push_back(&flush_memtable_id);
-    }
-    s = WaitForFlushMemTables(cfds, flush_memtable_id_ptrs,
-                              true /* resuming_from_bg_err */);
-    mutex_.Lock();
-  }
-
-  for (auto* cfd : cfds) {
-    cfd->UnrefAndTryDelete();
-  }
-  return s;
-}
-
 // Calling FlushMemTable(), whether from DB::Flush() or from Backup Engine, can
 // cause write stall, for example if one memtable is being flushed already.
 // This method tries to avoid write stall (similar to CompactRange() behavior)
@@ -2783,7 +2734,6 @@ void DBImpl::EnableManualCompaction() {

 void DBImpl::MaybeScheduleFlushOrCompaction() {
  mutex_.AssertHeld();
-  TEST_SYNC_POINT("DBImpl::MaybeScheduleFlushOrCompaction:Start");
  if (!opened_successfully_) {
    // Compaction may introduce data race to DB open
    return;
@@ -3301,7 +3251,7 @@ void DBImpl::BackgroundCallFlush(Env::Priority thread_pri) {

    TEST_SYNC_POINT("DBImpl::BackgroundCallFlush:FlushFinish:0");
    ReleaseFileNumberFromPendingOutputs(pending_outputs_inserted_elem);
-    // There is no need to find obsolete files if the flush job is rescheduled
+    // There is no need to do these clean up if the flush job is rescheduled
    // to retain user-defined timestamps because the job doesn't get to the
    // stage of actually flushing the MemTables.
    if (!flush_rescheduled_to_retain_udt) {
@@ -3309,25 +3259,25 @@ void DBImpl::BackgroundCallFlush(Env::Priority thread_pri) {
      // have created. Thus, we force full scan in FindObsoleteFiles()
      FindObsoleteFiles(&job_context, !s.ok() && !s.IsShutdownInProgress() &&
                                          !s.IsColumnFamilyDropped());
-    }
-    // delete unnecessary files if any, this is done outside the mutex
-    if (job_context.HaveSomethingToClean() ||
-        job_context.HaveSomethingToDelete() || !log_buffer.IsEmpty()) {
-      mutex_.Unlock();
-      TEST_SYNC_POINT("DBImpl::BackgroundCallFlush:FilesFound");
-      // Have to flush the info logs before bg_flush_scheduled_--
-      // because if bg_flush_scheduled_ becomes 0 and the lock is
-      // released, the deconstructor of DB can kick in and destroy all the
-      // states of DB so info_log might not be available after that point.
-      // It also applies to access other states that DB owns.
-      log_buffer.FlushBufferToLog();
-      if (job_context.HaveSomethingToDelete()) {
-        PurgeObsoleteFiles(job_context);
+      // delete unnecessary files if any, this is done outside the mutex
+      if (job_context.HaveSomethingToClean() ||
+          job_context.HaveSomethingToDelete() || !log_buffer.IsEmpty()) {
+        mutex_.Unlock();
+        TEST_SYNC_POINT("DBImpl::BackgroundCallFlush:FilesFound");
+        // Have to flush the info logs before bg_flush_scheduled_--
+        // because if bg_flush_scheduled_ becomes 0 and the lock is
+        // released, the deconstructor of DB can kick in and destroy all the
+        // states of DB so info_log might not be available after that point.
+        // It also applies to access other states that DB owns.
+        log_buffer.FlushBufferToLog();
+        if (job_context.HaveSomethingToDelete()) {
+          PurgeObsoleteFiles(job_context);
+        }
+        job_context.Clean();
+        mutex_.Lock();
      }
-      job_context.Clean();
-      mutex_.Lock();
+      TEST_SYNC_POINT("DBImpl::BackgroundCallFlush:ContextCleanedUp");
    }
-    TEST_SYNC_POINT("DBImpl::BackgroundCallFlush:ContextCleanedUp");

    assert(num_running_flushes_ > 0);
    num_running_flushes_--;
@@ -3705,9 +3655,6 @@ Status DBImpl::BackgroundCompaction(bool* made_progress,
    ROCKS_LOG_BUFFER(log_buffer, "[%s] Deleted %d files\n",
                     c->column_family_data()->GetName().c_str(),
                     c->num_input_files(0));
-    if (status.ok() && io_s.ok()) {
-      UpdateDeletionCompactionStats(c);
-    }
    *made_progress = true;
    TEST_SYNC_POINT_CALLBACK("DBImpl::BackgroundCompaction:AfterCompaction",
                             c->column_family_data());
@@ -4086,27 +4033,6 @@ bool DBImpl::MCOverlap(ManualCompactionState* m, ManualCompactionState* m1) {
  return false;
 }

-void DBImpl::UpdateDeletionCompactionStats(
-    const std::unique_ptr<Compaction>& c) {
-  if (c == nullptr) {
-    return;
-  }
-
-  CompactionReason reason = c->compaction_reason();
-
-  switch (reason) {
-    case CompactionReason::kFIFOMaxSize:
-      RecordTick(stats_, FIFO_MAX_SIZE_COMPACTIONS);
-      break;
-    case CompactionReason::kFIFOTtl:
-      RecordTick(stats_, FIFO_TTL_COMPACTIONS);
-      break;
-    default:
-      assert(false);
-      break;
-  }
-}
-
 void DBImpl::BuildCompactionJobInfo(
    const ColumnFamilyData* cfd, Compaction* c, const Status& st,
    const CompactionJobStats& compaction_job_stats, const int job_id,
@@ -306,16 +306,11 @@ const PeriodicTaskScheduler& DBImpl::TEST_GetPeriodicTaskScheduler() const {

 SeqnoToTimeMapping DBImpl::TEST_GetSeqnoToTimeMapping() const {
  InstrumentedMutexLock l(&mutex_);
-  return seqno_to_time_mapping_;
+  return seqno_time_mapping_;
 }

-const autovector<uint64_t>& DBImpl::TEST_GetFilesToQuarantine() const {
-  InstrumentedMutexLock l(&mutex_);
-  return error_handler_.GetFilesToQuarantine();
-}

 size_t DBImpl::TEST_EstimateInMemoryStatsHistorySize() const {
-  InstrumentedMutexLock l(&const_cast<DBImpl*>(this)->stats_history_mutex_);
  return EstimateInMemoryStatsHistorySize();
 }
 }  // namespace ROCKSDB_NAMESPACE
@@ -100,6 +100,14 @@ Status DBImpl::EnableFileDeletions(bool force) {
  return Status::OK();
 }

+int DBImpl::EnableFileDeletionsWithLock() {
+  mutex_.AssertHeld();
+  // In case others have called EnableFileDeletions(true /* force */) in between
+  disable_delete_obsolete_files_ =
+      std::max(0, disable_delete_obsolete_files_ - 1);
+  return disable_delete_obsolete_files_;
+}
+
 bool DBImpl::IsFileDeletionsEnabled() const {
  return 0 == disable_delete_obsolete_files_;
 }
@@ -146,7 +154,6 @@ void DBImpl::FindObsoleteFiles(JobContext* job_context, bool force,
  // mutex_ cannot be released. Otherwise, we might see no min_pending_output
  // here but later find newer generated unfinalized files while scanning.
  job_context->min_pending_output = MinObsoleteSstNumberToKeep();
-  job_context->files_to_quarantine = error_handler_.GetFilesToQuarantine();

  // Get obsolete files.  This function will also update the list of
  // pending files in VersionSet().
@@ -420,8 +427,6 @@ void DBImpl::PurgeObsoleteFiles(JobContext& state, bool schedule_only) {
                                             state.blob_live.end());
  std::unordered_set<uint64_t> log_recycle_files_set(
      state.log_recycle_files.begin(), state.log_recycle_files.end());
-  std::unordered_set<uint64_t> quarantine_files_set(
-      state.files_to_quarantine.begin(), state.files_to_quarantine.end());

  auto candidate_files = state.full_scan_candidate_files;
  candidate_files.reserve(
@@ -525,10 +530,6 @@ void DBImpl::PurgeObsoleteFiles(JobContext& state, bool schedule_only) {
      continue;
    }

-    if (quarantine_files_set.find(number) != quarantine_files_set.end()) {
-      continue;
-    }
-
    bool keep = true;
    switch (type) {
      case kWalFile:
@@ -25,7 +25,6 @@
 #include "rocksdb/wal_filter.h"
 #include "test_util/sync_point.h"
 #include "util/rate_limiter_impl.h"
-#include "util/string_util.h"
 #include "util/udt_util.h"

 namespace ROCKSDB_NAMESPACE {
@@ -292,18 +291,6 @@ Status DBImpl::ValidateOptions(const DBOptions& db_options) {
        "writes in direct IO require writable_file_max_buffer_size > 0");
  }

-  if (db_options.daily_offpeak_time_utc != "") {
-    int start_time, end_time;
-    if (!TryParseTimeRangeString(db_options.daily_offpeak_time_utc, start_time,
-                                 end_time)) {
-      return Status::InvalidArgument(
-          "daily_offpeak_time_utc should be set in the format HH:mm-HH:mm "
-          "(e.g. 04:30-07:30)");
-    } else if (start_time == end_time) {
-      return Status::InvalidArgument(
-          "start_time and end_time cannot be the same");
-    }
-  }
  return Status::OK();
 }

@@ -418,8 +405,7 @@ Status DBImpl::Recover(
    uint64_t* recovered_seq, RecoveryContext* recovery_ctx) {
  mutex_.AssertHeld();

-  bool tmp_is_new_db = false;
-  bool& is_new_db = recovery_ctx ? recovery_ctx->is_new_db_ : tmp_is_new_db;
+  bool is_new_db = false;
  assert(db_lock_ == nullptr);
  std::vector<std::string> files_in_dbname;
  if (!read_only) {
@@ -872,8 +858,7 @@ Status DBImpl::PersistentStatsProcessFormatVersion() {
      if (s.ok()) {
        ColumnFamilyOptions cfo;
        OptimizeForPersistentStats(&cfo);
-        s = CreateColumnFamilyImpl(cfo, kPersistentStatsColumnFamilyName,
-                                   &handle);
+        s = CreateColumnFamily(cfo, kPersistentStatsColumnFamilyName, &handle);
      }
      if (s.ok()) {
        persist_stats_cf_handle_ = static_cast<ColumnFamilyHandleImpl*>(handle);
@@ -926,7 +911,7 @@ Status DBImpl::InitPersistStatsColumnFamily() {
    ColumnFamilyHandle* handle = nullptr;
    ColumnFamilyOptions cfo;
    OptimizeForPersistentStats(&cfo);
-    s = CreateColumnFamilyImpl(cfo, kPersistentStatsColumnFamilyName, &handle);
+    s = CreateColumnFamily(cfo, kPersistentStatsColumnFamilyName, &handle);
    persist_stats_cf_handle_ = static_cast<ColumnFamilyHandleImpl*>(handle);
    mutex_.Lock();
  }
@@ -1251,13 +1236,6 @@ Status DBImpl::RecoverLogFiles(const std::vector<uint64_t>& wal_numbers,
      }

      SequenceNumber sequence = WriteBatchInternal::Sequence(batch_to_use);
-      if (sequence > kMaxSequenceNumber) {
-        reporter.Corruption(
-            record.size(),
-            Status::Corruption("sequence " + std::to_string(sequence) +
-                               " is too large"));
-        continue;
-      }

      if (immutable_db_options_.wal_recovery_mode ==
          WALRecoveryMode::kPointInTimeRecovery) {
@@ -1674,7 +1652,7 @@ Status DBImpl::WriteLevel0TableForRecovery(int job_id, ColumnFamilyData* cfd,
          TableFileCreationReason::kRecovery, 0 /* oldest_key_time */,
          0 /* file_creation_time */, db_id_, db_session_id_,
          0 /* target_file_size */, meta.fd.GetNumber());
-      SeqnoToTimeMapping empty_seqno_to_time_mapping;
+      SeqnoToTimeMapping empty_seqno_time_mapping;
      Version* version = cfd->current();
      version->Ref();
      const ReadOptions read_option(Env::IOActivity::kDBOpen);
@@ -1686,7 +1664,7 @@ Status DBImpl::WriteLevel0TableForRecovery(int job_id, ColumnFamilyData* cfd,
          snapshot_seqs, earliest_write_conflict_snapshot, kMaxSequenceNumber,
          snapshot_checker, paranoid_file_checks, cfd->internal_stats(), &io_s,
          io_tracer_, BlobFileCreationReason::kRecovery,
-          empty_seqno_to_time_mapping, &event_logger_, job_id, Env::IO_HIGH,
+          empty_seqno_time_mapping, &event_logger_, job_id, Env::IO_HIGH,
          nullptr /* table_properties */, write_hint,
          nullptr /*full_history_ts_low*/, &blob_callback_, version,
          &num_input_entries);
@@ -2000,7 +1978,6 @@ Status DBImpl::Open(const DBOptions& db_options, const std::string& dbname,

  impl->wal_in_db_path_ = impl->immutable_db_options_.IsWalDirSameAsDBPath();
  RecoveryContext recovery_ctx;
-  impl->options_mutex_.Lock();
  impl->mutex_.Lock();

  // Handles create_if_missing, error_if_exists
@@ -2082,9 +2059,7 @@ Status DBImpl::Open(const DBOptions& db_options, const std::string& dbname,
          // missing column family, create it
          ColumnFamilyHandle* handle = nullptr;
          impl->mutex_.Unlock();
-          // NOTE: the work normally done in WrapUpCreateColumnFamilies will
-          // be done separately below.
-          s = impl->CreateColumnFamilyImpl(cf.options, cf.name, &handle);
+          s = impl->CreateColumnFamily(cf.options, cf.name, &handle);
          impl->mutex_.Lock();
          if (s.ok()) {
            handles->push_back(handle);
@@ -2135,8 +2110,9 @@ Status DBImpl::Open(const DBOptions& db_options, const std::string& dbname,
  if (s.ok()) {
    // Persist RocksDB Options before scheduling the compaction.
    // The WriteOptionsFile() will release and lock the mutex internally.
-    persist_options_status =
-        impl->WriteOptionsFile(true /*db_mutex_already_held*/);
+    persist_options_status = impl->WriteOptionsFile(
+        false /*need_mutex_lock*/, false /*need_enter_write_thread*/);
+
    *dbptr = impl;
    impl->opened_successfully_ = true;
    impl->DeleteObsoleteFiles();
@@ -2257,10 +2233,10 @@ Status DBImpl::Open(const DBOptions& db_options, const std::string& dbname,
  if (s.ok()) {
    s = impl->StartPeriodicTaskScheduler();
  }
+
  if (s.ok()) {
-    s = impl->RegisterRecordSeqnoTimeWorker(recovery_ctx.is_new_db_);
+    s = impl->RegisterRecordSeqnoTimeWorker();
  }
-  impl->options_mutex_.Unlock();
  if (!s.ok()) {
    for (auto* h : *handles) {
      delete h;
@@ -53,10 +53,6 @@ class DBImplReadOnly : public DBImpl {
                   const WideColumns& /* columns */) override {
    return Status::NotSupported("Not supported operation in read only mode.");
  }
-  Status PutEntity(const WriteOptions& /* options */, const Slice& /* key */,
-                   const AttributeGroups& /* attribute_groups */) override {
-    return Status::NotSupported("Not supported operation in read only mode.");
-  }

  using DBImpl::Merge;
  virtual Status Merge(const WriteOptions& /*options*/,
@@ -136,10 +136,6 @@ class DBImplSecondary : public DBImpl {
                   const WideColumns& /* columns */) override {
    return Status::NotSupported("Not supported operation in secondary mode.");
  }
-  Status PutEntity(const WriteOptions& /* options */, const Slice& /* key */,
-                   const AttributeGroups& /* attribute_groups */) override {
-    return Status::NotSupported("Not supported operation in secondary mode.");
-  }

  using DBImpl::Merge;
  Status Merge(const WriteOptions& /*options*/,
@@ -48,17 +48,6 @@ Status DBImpl::PutEntity(const WriteOptions& options,
  return DB::PutEntity(options, column_family, key, columns);
 }

-Status DBImpl::PutEntity(const WriteOptions& options, const Slice& key,
-                         const AttributeGroups& attribute_groups) {
-  for (const AttributeGroup& ag : attribute_groups) {
-    const Status s = FailIfCfHasTs(ag.column_family());
-    if (!s.ok()) {
-      return s;
-    }
-  }
-  return DB::PutEntity(options, key, attribute_groups);
-}
-
 Status DBImpl::Merge(const WriteOptions& o, ColumnFamilyHandle* column_family,
                     const Slice& key, const Slice& val) {
  const Status s = FailIfCfHasTs(column_family);
@@ -414,6 +403,17 @@ Status DBImpl::WriteImpl(const WriteOptions& write_options,
  IOStatus io_s;
  Status pre_release_cb_status;
  if (status.ok()) {
+    // TODO: this use of operator bool on `tracer_` can avoid unnecessary lock
+    // grabs but does not seem thread-safe.
+    if (tracer_) {
+      InstrumentedMutexLock lock(&trace_mutex_);
+      if (tracer_ && tracer_->IsWriteOrderPreserved()) {
+        for (auto* writer : write_group) {
+          // TODO: maybe handle the tracing status?
+          tracer_->Write(writer->batch).PermitUncheckedError();
+        }
+      }
+    }
    // Rules for when we can update the memtable concurrently
    // 1. supported by memtable
    // 2. Puts are not okay if inplace_update_support
@@ -437,29 +437,15 @@ Status DBImpl::WriteImpl(const WriteOptions& write_options,
        valid_batches += writer->batch_cnt;
        if (writer->ShouldWriteToMemtable()) {
          total_count += WriteBatchInternal::Count(writer->batch);
-          total_byte_size = WriteBatchInternal::AppendedByteSize(
-              total_byte_size, WriteBatchInternal::ByteSize(writer->batch));
          parallel = parallel && !writer->batch->HasMerge();
        }
+        total_byte_size = WriteBatchInternal::AppendedByteSize(
+            total_byte_size, WriteBatchInternal::ByteSize(writer->batch));
        if (writer->pre_release_callback) {
          pre_release_callback_cnt++;
        }
      }
    }
-    // TODO: this use of operator bool on `tracer_` can avoid unnecessary lock
-    // grabs but does not seem thread-safe.
-    if (tracer_) {
-      InstrumentedMutexLock lock(&trace_mutex_);
-      if (tracer_ && tracer_->IsWriteOrderPreserved()) {
-        for (auto* writer : write_group) {
-          if (writer->CallbackFailed()) {
-            continue;
-          }
-          // TODO: maybe handle the tracing status?
-          tracer_->Write(writer->batch).PermitUncheckedError();
-        }
-      }
-    }
    // Note about seq_per_batch_: either disableWAL is set for the entire write
    // group or not. In either case we inc seq for each write batch with no
    // failed callback. This means that there could be a batch with
@@ -720,11 +706,11 @@ Status DBImpl::PipelinedWriteImpl(const WriteOptions& write_options,
          if (writer->ShouldWriteToMemtable()) {
            writer->sequence = next_sequence;
            size_t count = WriteBatchInternal::Count(writer->batch);
-            total_byte_size = WriteBatchInternal::AppendedByteSize(
-                total_byte_size, WriteBatchInternal::ByteSize(writer->batch));
            next_sequence += count;
            total_count += count;
          }
+          total_byte_size = WriteBatchInternal::AppendedByteSize(
+              total_byte_size, WriteBatchInternal::ByteSize(writer->batch));
        }
      }
      if (w.disable_wal) {
@@ -1825,9 +1811,11 @@ uint64_t DBImpl::GetMaxTotalWalSize() const {
 Status DBImpl::DelayWrite(uint64_t num_bytes, WriteThread& write_thread,
                          const WriteOptions& write_options) {
  mutex_.AssertHeld();
-  uint64_t start_time = 0;
+  uint64_t time_delayed = 0;
  bool delayed = false;
  {
+    StopWatch sw(immutable_db_options_.clock, stats_, WRITE_STALL,
+                 Histograms::HISTOGRAM_ENUM_MAX, &time_delayed);
    // To avoid parallel timed delays (bad throttling), only support them
    // on the primary write queue.
    uint64_t delay;
@@ -1839,8 +1827,6 @@ Status DBImpl::DelayWrite(uint64_t num_bytes, WriteThread& write_thread,
      delay = 0;
    }
    TEST_SYNC_POINT("DBImpl::DelayWrite:Start");
-    start_time = immutable_db_options_.clock->NowMicros();
-
    if (delay > 0) {
      if (write_options.no_slowdown) {
        return Status::Incomplete("Write stall");
@@ -1857,7 +1843,7 @@ Status DBImpl::DelayWrite(uint64_t num_bytes, WriteThread& write_thread,
      // (slightly longer because WriteController minimum delay is 1ms, in
      // case of sleep imprecision, rounding, etc.)
      const uint64_t kDelayInterval = 1001;
-      uint64_t stall_end = start_time + delay;
+      uint64_t stall_end = sw.start_time() + delay;
      while (write_controller_.NeedsDelay()) {
        if (immutable_db_options_.clock->NowMicros() >= stall_end) {
          // We already delayed this write `delay` microseconds
@@ -1872,11 +1858,11 @@ Status DBImpl::DelayWrite(uint64_t num_bytes, WriteThread& write_thread,
      write_thread.EndWriteStall();
    }

-    // Don't wait if there's a background error that is not pending recovery
-    // since recovery might never be attempted.
-    while ((error_handler_.GetBGError().ok() ||
-            error_handler_.IsRecoveryInProgress()) &&
-           write_controller_.IsStopped() &&
+    // Don't wait if there's a background error, even if its a soft error. We
+    // might wait here indefinitely as the background compaction may never
+    // finish successfully, resulting in the stall condition lasting
+    // indefinitely
+    while (error_handler_.GetBGError().ok() && write_controller_.IsStopped() &&
           !shutting_down_.load(std::memory_order_relaxed)) {
      if (write_options.no_slowdown) {
        return Status::Incomplete("Write stall");
@@ -1898,11 +1884,9 @@ Status DBImpl::DelayWrite(uint64_t num_bytes, WriteThread& write_thread,
  }
  assert(!delayed || !write_options.no_slowdown);
  if (delayed) {
-    auto time_delayed = immutable_db_options_.clock->NowMicros() - start_time;
    default_cf_internal_stats_->AddDBStats(
        InternalStats::kIntStatsWriteStallMicros, time_delayed);
    RecordTick(stats_, STALL_MICROS, time_delayed);
-    RecordInHistogram(stats_, WRITE_STALL, time_delayed);
  }

  // If DB is not in read-only mode and write_controller is not stopping
@@ -1969,13 +1953,9 @@ Status DBImpl::ThrottleLowPriWritesIfNeeded(const WriteOptions& write_options,
      // a chance to run. Now we guarantee we are still slowly making
      // progress.
      PERF_TIMER_GUARD(write_delay_time);
-      auto data_size = my_batch->GetDataSize();
-      while (data_size > 0) {
-        size_t allowed = write_controller_.low_pri_rate_limiter()->RequestToken(
-            data_size, 0 /* alignment */, Env::IO_HIGH, nullptr /* stats */,
-            RateLimiter::OpType::kWrite);
-        data_size -= allowed;
-      }
+      write_controller_.low_pri_rate_limiter()->Request(
+          my_batch->GetDataSize(), Env::IO_HIGH, nullptr /* stats */,
+          RateLimiter::OpType::kWrite);
    }
  }
  return Status::OK();
@@ -2398,22 +2378,6 @@ Status DB::PutEntity(const WriteOptions& options,
  return Write(options, &batch);
 }

-Status DB::PutEntity(const WriteOptions& options, const Slice& key,
-                     const AttributeGroups& attribute_groups) {
-  ColumnFamilyHandle* default_cf = DefaultColumnFamily();
-  assert(default_cf);
-  const Comparator* const default_cf_ucmp = default_cf->GetComparator();
-  assert(default_cf_ucmp);
-  WriteBatch batch(0 /* reserved_bytes */, 0 /* max_bytes */,
-                   options.protection_bytes_per_key,
-                   default_cf_ucmp->timestamp_size());
-  const Status s = batch.PutEntity(key, attribute_groups);
-  if (!s.ok()) {
-    return s;
-  }
-  return Write(options, &batch);
-}
-
 Status DB::Delete(const WriteOptions& opt, ColumnFamilyHandle* column_family,
                  const Slice& key) {
  WriteBatch batch(0 /* reserved_bytes */, 0 /* max_bytes */,
@@ -83,7 +83,8 @@ DBIter::DBIter(Env* _env, const ReadOptions& read_options,
      cfd_(cfd),
      timestamp_ub_(read_options.timestamp),
      timestamp_lb_(read_options.iter_start_ts),
-      timestamp_size_(timestamp_ub_ ? timestamp_ub_->size() : 0) {
+      timestamp_size_(timestamp_ub_ ? timestamp_ub_->size() : 0),
+      auto_readahead_size_(read_options.auto_readahead_size) {
  RecordTick(statistics_, NO_ITERATOR_CREATED);
  if (pin_thru_lifetime_) {
    pinned_iters_mgr_.StartPinning();
@@ -113,9 +114,6 @@ Status DBIter::GetProperty(std::string prop_name, std::string* prop) {
  } else if (prop_name == "rocksdb.iterator.internal-key") {
    *prop = saved_key_.GetUserKey().ToString();
    return Status::OK();
-  } else if (prop_name == "rocksdb.iterator.write-time") {
-    // TODO(yuzhangyu): implement return the actual write time.
-    return Status::NotSupported("write time property is under construction");
  }
  return Status::InvalidArgument("Unidentified property.");
 }
@@ -394,7 +392,9 @@ bool DBIter::FindNextUserEntryInternal(bool skipping_saved_key,
          case kTypeValue:
          case kTypeBlobIndex:
          case kTypeWideColumnEntity:
-            if (!PrepareValue()) {
+            if (!iter_.PrepareValue()) {
+              assert(!iter_.status().ok());
+              valid_ = false;
              return false;
            }
            if (timestamp_lb_) {
@@ -425,7 +425,9 @@ bool DBIter::FindNextUserEntryInternal(bool skipping_saved_key,
            return true;
            break;
          case kTypeMerge:
-            if (!PrepareValue()) {
+            if (!iter_.PrepareValue()) {
+              assert(!iter_.status().ok());
+              valid_ = false;
              return false;
            }
            saved_key_.SetUserKey(
@@ -570,7 +572,8 @@ bool DBIter::MergeValuesNewToOld() {
      iter_.Next();
      break;
    }
-    if (!PrepareValue()) {
+    if (!iter_.PrepareValue()) {
+      valid_ = false;
      return false;
    }

@@ -741,15 +744,22 @@ bool DBIter::ReverseToBackward() {
  // When current_entry_is_merged_ is true, iter_ may be positioned on the next
  // key, which may not exist or may have prefix different from current.
  // If that's the case, seek to saved_key_.
-  if (current_entry_is_merged_ &&
-      (!expect_total_order_inner_iter() || !iter_.Valid())) {
+  //
+  // In case of auto_readahead_size enabled, index_iter moves forward during
+  // forward scan for block cache lookup and points to different block. If Prev
+  // op is called, it needs to call SeekForPrev to point to right index_iter_ in
+  // BlockBasedTableIterator. This only happens when direction is changed from
+  // forward to backward.
+  if ((current_entry_is_merged_ &&
+       (!expect_total_order_inner_iter() || !iter_.Valid())) ||
+      auto_readahead_size_) {
    IterKey last_key;
    // Using kMaxSequenceNumber and kValueTypeForSeek
    // (not kValueTypeForSeekForPrev) to seek to a key strictly smaller
    // than saved_key_.
    last_key.SetInternalKey(ParsedInternalKey(
        saved_key_.GetUserKey(), kMaxSequenceNumber, kValueTypeForSeek));
-    if (!expect_total_order_inner_iter()) {
+    if (!expect_total_order_inner_iter() || auto_readahead_size_) {
      iter_.SeekForPrev(last_key.GetInternalKey());
    } else {
      // Some iterators may not support SeekForPrev(), so we avoid using it
@@ -896,7 +906,8 @@ bool DBIter::FindValueForCurrentKey() {
      return FindValueForCurrentKeyUsingSeek();
    }

-    if (!PrepareValue()) {
+    if (!iter_.PrepareValue()) {
+      valid_ = false;
      return false;
    }

@@ -1135,7 +1146,8 @@ bool DBIter::FindValueForCurrentKeyUsingSeek() {
    }
    return true;
  }
-  if (!PrepareValue()) {
+  if (!iter_.PrepareValue()) {
+    valid_ = false;
    return false;
  }
  if (timestamp_size_ > 0) {
@@ -1200,7 +1212,8 @@ bool DBIter::FindValueForCurrentKeyUsingSeek() {
        ikey.type == kTypeDeletionWithTimestamp) {
      break;
    }
-    if (!PrepareValue()) {
+    if (!iter_.PrepareValue()) {
+      valid_ = false;
      return false;
    }

@@ -1277,8 +1290,8 @@ bool DBIter::MergeWithNoBaseValue(const Slice& user_key) {
  const Status s = MergeHelper::TimedFullMerge(
      merge_operator_, user_key, MergeHelper::kNoBaseValue,
      merge_context_.GetOperands(), logger_, statistics_, clock_,
-      /* update_num_ops_stats */ true, /* op_failure_scope */ nullptr,
-      &saved_value_, &pinned_value_, &result_type);
+      /* update_num_ops_stats */ true, &saved_value_, &pinned_value_,
+      &result_type, /* op_failure_scope */ nullptr);
  return SetValueAndColumnsFromMergeResult(s, result_type);
 }

@@ -1290,8 +1303,8 @@ bool DBIter::MergeWithPlainBaseValue(const Slice& value,
  const Status s = MergeHelper::TimedFullMerge(
      merge_operator_, user_key, MergeHelper::kPlainBaseValue, value,
      merge_context_.GetOperands(), logger_, statistics_, clock_,
-      /* update_num_ops_stats */ true, /* op_failure_scope */ nullptr,
-      &saved_value_, &pinned_value_, &result_type);
+      /* update_num_ops_stats */ true, &saved_value_, &pinned_value_,
+      &result_type, /* op_failure_scope */ nullptr);
  return SetValueAndColumnsFromMergeResult(s, result_type);
 }

@@ -1303,8 +1316,8 @@ bool DBIter::MergeWithWideColumnBaseValue(const Slice& entity,
  const Status s = MergeHelper::TimedFullMerge(
      merge_operator_, user_key, MergeHelper::kWideBaseValue, entity,
      merge_context_.GetOperands(), logger_, statistics_, clock_,
-      /* update_num_ops_stats */ true, /* op_failure_scope */ nullptr,
-      &saved_value_, &pinned_value_, &result_type);
+      /* update_num_ops_stats */ true, &saved_value_, &pinned_value_,
+      &result_type, /* op_failure_scope */ nullptr);
  return SetValueAndColumnsFromMergeResult(s, result_type);
 }

@@ -328,22 +328,6 @@ class DBIter final : public Iterator {
  bool MergeWithPlainBaseValue(const Slice& value, const Slice& user_key);
  bool MergeWithWideColumnBaseValue(const Slice& entity, const Slice& user_key);

-  bool PrepareValue() {
-    if (!iter_.PrepareValue()) {
-      assert(!iter_.status().ok());
-      valid_ = false;
-      return false;
-    }
-    // ikey_ could change as BlockBasedTableIterator does Block cache
-    // lookup and index_iter_ could point to different block resulting
-    // in ikey_ pointing to wrong key. So ikey_ needs to be updated in
-    // case of Seek/Next calls to point to right key again.
-    if (!ParseKey(&ikey_)) {
-      return false;
-    }
-    return true;
-  }
-
  const SliceTransform* prefix_extractor_;
  Env* const env_;
  SystemClock* clock_;
@@ -418,6 +402,7 @@ class DBIter final : public Iterator {
  const Slice* const timestamp_lb_;
  const size_t timestamp_size_;
  std::string saved_timestamp_;
+  bool auto_readahead_size_;
 };

 // Return a new iterator that converts internal keys (yielded by
@@ -275,7 +275,6 @@ TEST_F(DBIteratorTest, DBIteratorPrevNext) {

    db_iter->Next();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }
  // Test to check the SeekToLast() with iterate_upper_bound not set
  {
@@ -1416,7 +1415,6 @@ TEST_F(DBIteratorTest, DBIterator1) {
  ASSERT_EQ(db_iter->key().ToString(), "b");
  db_iter->Next();
  ASSERT_FALSE(db_iter->Valid());
-  ASSERT_OK(db_iter->status());
 }

 TEST_F(DBIteratorTest, DBIterator2) {
@@ -1530,7 +1528,6 @@ TEST_F(DBIteratorTest, DBIterator5) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1555,7 +1552,6 @@ TEST_F(DBIteratorTest, DBIterator5) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1,merge_2");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1580,7 +1576,6 @@ TEST_F(DBIteratorTest, DBIterator5) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1,merge_2,merge_3");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1605,7 +1600,6 @@ TEST_F(DBIteratorTest, DBIterator5) {
    ASSERT_EQ(db_iter->value().ToString(), "put_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1630,7 +1624,6 @@ TEST_F(DBIteratorTest, DBIterator5) {
    ASSERT_EQ(db_iter->value().ToString(), "put_1,merge_4");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1655,7 +1648,6 @@ TEST_F(DBIteratorTest, DBIterator5) {
    ASSERT_EQ(db_iter->value().ToString(), "put_1,merge_4,merge_5");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1680,7 +1672,6 @@ TEST_F(DBIteratorTest, DBIterator5) {
    ASSERT_EQ(db_iter->value().ToString(), "put_1,merge_4,merge_5,merge_6");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1735,7 +1726,6 @@ TEST_F(DBIteratorTest, DBIterator6) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1760,7 +1750,6 @@ TEST_F(DBIteratorTest, DBIterator6) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1,merge_2");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1785,7 +1774,6 @@ TEST_F(DBIteratorTest, DBIterator6) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1,merge_2,merge_3");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1806,7 +1794,6 @@ TEST_F(DBIteratorTest, DBIterator6) {
        nullptr /* read_callback */));
    db_iter->SeekToLast();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1831,7 +1818,6 @@ TEST_F(DBIteratorTest, DBIterator6) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_4");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1856,7 +1842,6 @@ TEST_F(DBIteratorTest, DBIterator6) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_4,merge_5");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1881,7 +1866,6 @@ TEST_F(DBIteratorTest, DBIterator6) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_4,merge_5,merge_6");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }
 }

@@ -1926,7 +1910,6 @@ TEST_F(DBIteratorTest, DBIterator7) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -1969,7 +1952,6 @@ TEST_F(DBIteratorTest, DBIterator7) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -2012,7 +1994,6 @@ TEST_F(DBIteratorTest, DBIterator7) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -2060,7 +2041,6 @@ TEST_F(DBIteratorTest, DBIterator7) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -2109,7 +2089,6 @@ TEST_F(DBIteratorTest, DBIterator7) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -2152,7 +2131,6 @@ TEST_F(DBIteratorTest, DBIterator7) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -2201,7 +2179,6 @@ TEST_F(DBIteratorTest, DBIterator7) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -2251,7 +2228,6 @@ TEST_F(DBIteratorTest, DBIterator7) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }

  {
@@ -2295,7 +2271,6 @@ TEST_F(DBIteratorTest, DBIterator7) {
    ASSERT_EQ(db_iter->value().ToString(), "merge_1");
    db_iter->Prev();
    ASSERT_TRUE(!db_iter->Valid());
-    ASSERT_OK(db_iter->status());
  }
 }

@@ -2465,7 +2440,6 @@ TEST_F(DBIteratorTest, SeekToLastOccurrenceSeq0) {
  ASSERT_EQ(db_iter->value().ToString(), "2");
  db_iter->Next();
  ASSERT_FALSE(db_iter->Valid());
-  ASSERT_OK(db_iter->status());
 }

 TEST_F(DBIteratorTest, DBIterator11) {
@@ -2495,7 +2469,6 @@ TEST_F(DBIteratorTest, DBIterator11) {
  ASSERT_EQ(db_iter->key().ToString(), "b");
  db_iter->Next();
  ASSERT_FALSE(db_iter->Valid());
-  ASSERT_OK(db_iter->status());
 }

 TEST_F(DBIteratorTest, DBIterator12) {
@@ -2524,7 +2497,6 @@ TEST_F(DBIteratorTest, DBIterator12) {
  ASSERT_EQ(db_iter->value().ToString(), "1");
  db_iter->Prev();
  ASSERT_FALSE(db_iter->Valid());
-  ASSERT_OK(db_iter->status());
 }

 TEST_F(DBIteratorTest, DBIterator13) {
@@ -2663,7 +2635,6 @@ TEST_F(DBIterWithMergeIterTest, InnerMergeIterator1) {
  ASSERT_EQ(db_iter_->value().ToString(), "3");
  db_iter_->Next();
  ASSERT_FALSE(db_iter_->Valid());
-  ASSERT_OK(db_iter_->status());
 }

 TEST_F(DBIterWithMergeIterTest, InnerMergeIterator2) {
@@ -183,7 +183,6 @@ TEST_P(DBIteratorTest, NonBlockingIteration) {
      ASSERT_OK(iter->status());
      count++;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(count, 1);
    delete iter;

@@ -218,7 +217,6 @@ TEST_P(DBIteratorTest, NonBlockingIteration) {
      ASSERT_OK(iter->status());
      count++;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(count, 1);
    ASSERT_EQ(numopen, TestGetTickerCount(options, NO_FILE_OPENS));
    ASSERT_EQ(cache_added, TestGetTickerCount(options, BLOCK_CACHE_ADD));
@@ -872,7 +870,6 @@ TEST_P(DBIteratorTest, IterWithSnapshot) {
      }
    }
    db_->ReleaseSnapshot(snapshot);
-    ASSERT_OK(iter->status());
    delete iter;
  } while (ChangeOptions());
 }
@@ -1217,7 +1214,6 @@ TEST_P(DBIteratorTest, DBIteratorBoundOptimizationTest) {

    iter->Next();
    ASSERT_FALSE(iter->Valid());
-    ASSERT_OK(iter->status());
    ASSERT_EQ(upper_bound_hits, 1);
  }
 }
@@ -1342,7 +1338,6 @@ TEST_P(DBIteratorTest, IndexWithFirstKey) {

    iter->Next();
    ASSERT_FALSE(iter->Valid());
-    ASSERT_OK(iter->status());
    EXPECT_EQ(3, stats->getTickerCount(BLOCK_CACHE_DATA_HIT));
    EXPECT_EQ(7, stats->getTickerCount(BLOCK_CACHE_DATA_MISS));
  }
@@ -1584,7 +1579,6 @@ class DBIteratorTestForPinnedData : public DBIteratorTest {
        ASSERT_EQ("1", prop_value);
        all_keys.push_back(iter->key());
      }
-      ASSERT_OK(iter->status());
      ASSERT_EQ(all_keys.size(), true_data.size());

      // Verify that all keys slices are valid (backward)
@@ -1688,7 +1682,7 @@ TEST_P(DBIteratorTest, PinnedDataIteratorMultipleFiles) {
    ASSERT_EQ(kv.first, data_iter->first);
    ASSERT_EQ(kv.second, data_iter->second);
  }
-  ASSERT_OK(iter->status());
+
  delete iter;
 }

@@ -1734,7 +1728,6 @@ TEST_P(DBIteratorTest, PinnedDataIteratorMergeOperator) {
    ASSERT_EQ("1", prop_value);
    results.emplace_back(iter->key(), iter->value().ToString());
  }
-  ASSERT_OK(iter->status());

  ASSERT_EQ(results.size(), 1000);
  for (size_t i = 0; i < results.size(); i++) {
@@ -1792,7 +1785,6 @@ TEST_P(DBIteratorTest, PinnedDataIteratorReadAfterUpdate) {
    ASSERT_EQ("1", prop_value);
    results.emplace_back(iter->key(), iter->value().ToString());
  }
-  ASSERT_OK(iter->status());

  auto data_iter = true_data.begin();
  for (size_t i = 0; i < results.size(); i++, data_iter++) {
@@ -2087,7 +2079,6 @@ TEST_P(DBIteratorTest, IterPrevKeyCrossingBlocksRandomized) {
      ASSERT_EQ(iter->value().ToString(), data_iter->second);
      data_iter++;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(data_iter, true_data.rend());

    delete iter;
@@ -2145,7 +2136,6 @@ TEST_P(DBIteratorTest, IterPrevKeyCrossingBlocksRandomized) {
      entries_right++;
      data_iter++;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(data_iter, true_data.rend());

    delete iter;
@@ -2185,7 +2175,6 @@ TEST_P(DBIteratorTest, IteratorWithLocalStatistics) {
      total_next++;

      if (!iter->Valid()) {
-        EXPECT_OK(iter->status());
        break;
      }
      total_next_found++;
@@ -2213,7 +2202,6 @@ TEST_P(DBIteratorTest, IteratorWithLocalStatistics) {
      total_prev++;

      if (!iter->Valid()) {
-        EXPECT_OK(iter->status());
        break;
      }
      total_prev_found++;
@@ -2428,7 +2416,6 @@ TEST_P(DBIteratorTest, Refresh) {
  ASSERT_EQ(iter->key().compare(Slice("x")), 0);
  iter->Next();
  ASSERT_FALSE(iter->Valid());
-  ASSERT_OK(iter->status());

  iter.reset();
 }
@@ -2482,32 +2469,32 @@ TEST_P(DBIteratorTest, RefreshWithSnapshot) {
    verify_iter(1, 3);
    // Refresh to same snapshot
    ASSERT_OK(iter->Refresh(snapshot));
-    ASSERT_TRUE(!iter->Valid() && iter->status().ok());
+    ASSERT_TRUE(iter->status().ok() && !iter->Valid());
    iter->Seek(Key(3));
    verify_iter(3, 6);
-    ASSERT_TRUE(!iter->Valid() && iter->status().ok());
+    ASSERT_TRUE(iter->status().ok() && !iter->Valid());

    // Refresh to a newer snapshot
    ASSERT_OK(iter->Refresh(snapshot2));
-    ASSERT_TRUE(!iter->Valid() && iter->status().ok());
+    ASSERT_TRUE(iter->status().ok() && !iter->Valid());
    iter->SeekToFirst();
    verify_iter(0, 4, /*new_key2=*/true);
-    ASSERT_TRUE(!iter->Valid() && iter->status().ok());
+    ASSERT_TRUE(iter->status().ok() && !iter->Valid());

    // Refresh to an older snapshot
    ASSERT_OK(iter->Refresh(snapshot));
-    ASSERT_TRUE(!iter->Valid() && iter->status().ok());
+    ASSERT_TRUE(iter->status().ok() && !iter->Valid());
    iter->Seek(Key(3));
    verify_iter(3, 6);
-    ASSERT_TRUE(!iter->Valid() && iter->status().ok());
+    ASSERT_TRUE(iter->status().ok() && !iter->Valid());

    // Refresh to no snapshot
    ASSERT_OK(iter->Refresh());
-    ASSERT_TRUE(!iter->Valid() && iter->status().ok());
+    ASSERT_TRUE(iter->status().ok() && !iter->Valid());
    iter->Seek(Key(2));
    verify_iter(2, 4, /*new_key2=*/true);
    verify_iter(6, 7);
-    ASSERT_TRUE(!iter->Valid() && iter->status().ok());
+    ASSERT_TRUE(iter->status().ok() && !iter->Valid());

    // Change LSM shape, new SuperVersion is created.
    ASSERT_OK(Flush());
@@ -2612,7 +2599,6 @@ TEST_P(DBIteratorTest, TableFilter) {
    ASSERT_EQ(IterStatus(iter), "f->6");
    iter->Next();
    ASSERT_FALSE(iter->Valid());
-    ASSERT_OK(iter->status());
    ASSERT_TRUE(unseen.empty());
    delete iter;
  }
@@ -2635,7 +2621,6 @@ TEST_P(DBIteratorTest, TableFilter) {
    ASSERT_EQ(IterStatus(iter), "f->6");
    iter->Next();
    ASSERT_FALSE(iter->Valid());
-    ASSERT_OK(iter->status());
    delete iter;
  }
 }
@@ -2720,7 +2705,6 @@ TEST_P(DBIteratorTest, SkipStatistics) {
    ASSERT_OK(iter->status());
    count++;
  }
-  ASSERT_OK(iter->status());
  ASSERT_EQ(count, 3);
  delete iter;
  skip_count += 8;  // Same as above, but in reverse order
@@ -2756,7 +2740,6 @@ TEST_P(DBIteratorTest, SkipStatistics) {
    ASSERT_OK(iter->status());
    count++;
  }
-  ASSERT_OK(iter->status());
  ASSERT_EQ(count, 2);
  delete iter;
  // 3 deletes + 3 original keys + lower sequence of "a"
@@ -3339,7 +3322,6 @@ TEST_F(DBIteratorTest, BackwardIterationOnInplaceUpdateMemtable) {
    for (iter->SeekToLast(); iter->Valid(); iter->Prev()) {
      ++count;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(kNumKeys, count);
  }

@@ -236,7 +236,7 @@ TEST_F(DBTestXactLogIterator, TransactionLogIteratorCorruptedLog) {
    ASSERT_OK(test::TruncateFile(env_, logfile_path,
                                 wal_files.front()->SizeFileBytes() / 2));

-    ASSERT_OK(db_->EnableFileDeletions(/*force=*/false));
+    ASSERT_OK(db_->EnableFileDeletions());

    // Insert a new entry to a new log file
    ASSERT_OK(Put("key1025", DummyString(10)));
@@ -6,12 +6,10 @@
 #include <vector>

 #include "db/db_test_util.h"
-#include "db/dbformat.h"
 #include "db/forward_iterator.h"
 #include "port/stack_trace.h"
 #include "rocksdb/merge_operator.h"
 #include "rocksdb/snapshot.h"
-#include "rocksdb/utilities/debug.h"
 #include "util/random.h"
 #include "utilities/merge_operators.h"
 #include "utilities/merge_operators/string_append/stringappend2.h"
@@ -951,98 +949,6 @@ TEST_P(PerConfigMergeOperatorPinningTest, Randomized) {
  VerifyDBFromMap(true_data);
 }

-TEST_F(DBMergeOperatorTest, MaxSuccessiveMergesBaseValues) {
-  Options options = CurrentOptions();
-  options.create_if_missing = true;
-  options.merge_operator = MergeOperators::CreatePutOperator();
-  options.max_successive_merges = 1;
-  options.env = env_;
-  Reopen(options);
-
-  constexpr char foo[] = "foo";
-  constexpr char bar[] = "bar";
-  constexpr char baz[] = "baz";
-  constexpr char qux[] = "qux";
-  constexpr char corge[] = "corge";
-
-  // No base value
-  {
-    constexpr char key[] = "key1";
-
-    ASSERT_OK(db_->Merge(WriteOptions(), db_->DefaultColumnFamily(), key, foo));
-    ASSERT_OK(db_->Merge(WriteOptions(), db_->DefaultColumnFamily(), key, bar));
-
-    PinnableSlice result;
-    ASSERT_OK(
-        db_->Get(ReadOptions(), db_->DefaultColumnFamily(), key, &result));
-    ASSERT_EQ(result, bar);
-
-    // We expect the second Merge to be converted to a Put because of
-    // max_successive_merges.
-    constexpr size_t max_key_versions = 8;
-    std::vector<KeyVersion> key_versions;
-    ASSERT_OK(GetAllKeyVersions(db_, db_->DefaultColumnFamily(), key, key,
-                                max_key_versions, &key_versions));
-    ASSERT_EQ(key_versions.size(), 2);
-    ASSERT_EQ(key_versions[0].type, kTypeValue);
-    ASSERT_EQ(key_versions[1].type, kTypeMerge);
-  }
-
-  // Plain base value
-  {
-    constexpr char key[] = "key2";
-
-    ASSERT_OK(db_->Put(WriteOptions(), db_->DefaultColumnFamily(), key, foo));
-    ASSERT_OK(db_->Merge(WriteOptions(), db_->DefaultColumnFamily(), key, bar));
-    ASSERT_OK(db_->Merge(WriteOptions(), db_->DefaultColumnFamily(), key, baz));
-
-    PinnableSlice result;
-    ASSERT_OK(
-        db_->Get(ReadOptions(), db_->DefaultColumnFamily(), key, &result));
-    ASSERT_EQ(result, baz);
-
-    // We expect the second Merge to be converted to a Put because of
-    // max_successive_merges.
-    constexpr size_t max_key_versions = 8;
-    std::vector<KeyVersion> key_versions;
-    ASSERT_OK(GetAllKeyVersions(db_, db_->DefaultColumnFamily(), key, key,
-                                max_key_versions, &key_versions));
-    ASSERT_EQ(key_versions.size(), 3);
-    ASSERT_EQ(key_versions[0].type, kTypeValue);
-    ASSERT_EQ(key_versions[1].type, kTypeMerge);
-    ASSERT_EQ(key_versions[2].type, kTypeValue);
-  }
-
-  // Wide-column base value
-  {
-    constexpr char key[] = "key3";
-    const WideColumns columns{{kDefaultWideColumnName, foo}, {bar, baz}};
-
-    ASSERT_OK(db_->PutEntity(WriteOptions(), db_->DefaultColumnFamily(), key,
-                             columns));
-    ASSERT_OK(db_->Merge(WriteOptions(), db_->DefaultColumnFamily(), key, qux));
-    ASSERT_OK(
-        db_->Merge(WriteOptions(), db_->DefaultColumnFamily(), key, corge));
-
-    PinnableWideColumns result;
-    ASSERT_OK(db_->GetEntity(ReadOptions(), db_->DefaultColumnFamily(), key,
-                             &result));
-    const WideColumns expected{{kDefaultWideColumnName, corge}, {bar, baz}};
-    ASSERT_EQ(result.columns(), expected);
-
-    // We expect the second Merge to be converted to a PutEntity because of
-    // max_successive_merges.
-    constexpr size_t max_key_versions = 8;
-    std::vector<KeyVersion> key_versions;
-    ASSERT_OK(GetAllKeyVersions(db_, db_->DefaultColumnFamily(), key, key,
-                                max_key_versions, &key_versions));
-    ASSERT_EQ(key_versions.size(), 3);
-    ASSERT_EQ(key_versions[0].type, kTypeWideColumnEntity);
-    ASSERT_EQ(key_versions[1].type, kTypeMerge);
-    ASSERT_EQ(key_versions[2].type, kTypeWideColumnEntity);
-  }
-}
-
 }  // namespace ROCKSDB_NAMESPACE

 int main(int argc, char** argv) {
@@ -19,8 +19,6 @@
 #include "rocksdb/convenience.h"
 #include "rocksdb/rate_limiter.h"
 #include "rocksdb/stats_history.h"
-#include "rocksdb/utilities/options_util.h"
-#include "test_util/mock_time_env.h"
 #include "test_util/sync_point.h"
 #include "test_util/testutil.h"
 #include "util/random.h"
@@ -742,55 +740,6 @@ TEST_F(DBOptionsTest, SetStatsDumpPeriodSec) {
  Close();
 }

-TEST_F(DBOptionsTest, SetStatsDumpPeriodSecRace) {
-  // This is a mini-stress test looking for inconsistency between the reported
-  // state of the option and the behavior in effect for the DB, after the last
-  // modification to that option (indefinite inconsistency).
-  std::vector<std::thread> threads;
-  for (int i = 0; i < 12; i++) {
-    threads.emplace_back([this, i]() {
-      ASSERT_OK(dbfull()->SetDBOptions(
-          {{"stats_dump_period_sec", i % 2 ? "100" : "0"}}));
-    });
-  }
-
-  for (auto& t : threads) {
-    t.join();
-  }
-
-  bool stats_dump_set = dbfull()->GetDBOptions().stats_dump_period_sec > 0;
-  bool task_enabled = dbfull()->TEST_GetPeriodicTaskScheduler().TEST_HasTask(
-      PeriodicTaskType::kDumpStats);
-
-  ASSERT_EQ(stats_dump_set, task_enabled);
-}
-
-TEST_F(DBOptionsTest, SetOptionsAndFileRace) {
-  // This is a mini-stress test looking for inconsistency between the reported
-  // state of the option and what is persisted in the options file, after the
-  // last modification to that option (indefinite inconsistency).
-  std::vector<std::thread> threads;
-  for (int i = 0; i < 12; i++) {
-    threads.emplace_back([this, i]() {
-      ASSERT_OK(dbfull()->SetOptions({{"ttl", std::to_string(i * 100)}}));
-    });
-  }
-
-  for (auto& t : threads) {
-    t.join();
-  }
-
-  auto setting_in_mem = dbfull()->GetOptions().ttl;
-
-  std::vector<ColumnFamilyDescriptor> cf_descs;
-  DBOptions db_options;
-  ConfigOptions cfg;
-  cfg.env = env_;
-  ASSERT_OK(LoadLatestOptions(cfg, dbname_, &db_options, &cf_descs, nullptr));
-  ASSERT_EQ(cf_descs.size(), 1);
-  ASSERT_EQ(setting_in_mem, cf_descs[0].options.ttl);
-}
-
 TEST_F(DBOptionsTest, SetOptionsStatsPersistPeriodSec) {
  Options options;
  options.create_if_missing = true;
@@ -959,7 +908,6 @@ TEST_F(DBOptionsTest, SetFIFOCompactionOptions) {
  Options options;
  options.env = CurrentOptions().env;
  options.compaction_style = kCompactionStyleFIFO;
-  options.statistics = ROCKSDB_NAMESPACE::CreateDBStatistics();
  options.write_buffer_size = 10 << 10;  // 10KB
  options.arena_block_size = 4096;
  options.compression = kNoCompression;
@@ -993,9 +941,6 @@ TEST_F(DBOptionsTest, SetFIFOCompactionOptions) {
  ASSERT_OK(dbfull()->CompactRange(CompactRangeOptions(), nullptr, nullptr));
  ASSERT_EQ(NumTableFilesAtLevel(0), 10);

-  ASSERT_EQ(options.statistics->getTickerCount(FIFO_TTL_COMPACTIONS), 0);
-  ASSERT_EQ(options.statistics->getTickerCount(FIFO_MAX_SIZE_COMPACTIONS), 0);
-
  // Set ttl to 1 minute. So all files should get deleted.
  ASSERT_OK(dbfull()->SetOptions({{"ttl", "60"}}));
  ASSERT_EQ(dbfull()->GetOptions().ttl, 60);
@@ -1003,10 +948,6 @@ TEST_F(DBOptionsTest, SetFIFOCompactionOptions) {
  ASSERT_OK(dbfull()->TEST_WaitForCompact());
  ASSERT_EQ(NumTableFilesAtLevel(0), 0);

-  ASSERT_GT(options.statistics->getTickerCount(FIFO_TTL_COMPACTIONS), 0);
-  ASSERT_EQ(options.statistics->getTickerCount(FIFO_MAX_SIZE_COMPACTIONS), 0);
-  ASSERT_OK(options.statistics->Reset());
-
  // NOTE: Presumed unnecessary and removed: resetting mock time in env

  // Test dynamically changing compaction_options_fifo.max_table_files_size
@@ -1030,9 +971,6 @@ TEST_F(DBOptionsTest, SetFIFOCompactionOptions) {
  ASSERT_OK(dbfull()->CompactRange(CompactRangeOptions(), nullptr, nullptr));
  ASSERT_EQ(NumTableFilesAtLevel(0), 10);

-  ASSERT_EQ(options.statistics->getTickerCount(FIFO_MAX_SIZE_COMPACTIONS), 0);
-  ASSERT_EQ(options.statistics->getTickerCount(FIFO_TTL_COMPACTIONS), 0);
-
  // Set max_table_files_size to 12 KB. So only 1 file should remain now.
  ASSERT_OK(dbfull()->SetOptions(
      {{"compaction_options_fifo", "{max_table_files_size=12288;}"}}));
@@ -1042,10 +980,6 @@ TEST_F(DBOptionsTest, SetFIFOCompactionOptions) {
  ASSERT_OK(dbfull()->TEST_WaitForCompact());
  ASSERT_EQ(NumTableFilesAtLevel(0), 1);

-  ASSERT_GT(options.statistics->getTickerCount(FIFO_MAX_SIZE_COMPACTIONS), 0);
-  ASSERT_EQ(options.statistics->getTickerCount(FIFO_TTL_COMPACTIONS), 0);
-  ASSERT_OK(options.statistics->Reset());
-
  // Test dynamically changing compaction_options_fifo.allow_compaction
  options.compaction_options_fifo.max_table_files_size = 500 << 10;  // 500KB
  options.ttl = 0;
@@ -1099,184 +1033,6 @@ TEST_F(DBOptionsTest, SetFIFOCompactionOptions) {
  ASSERT_EQ(fifo_temp_opt[1].age, 30000);
 }

-TEST_F(DBOptionsTest, OffpeakTimes) {
-  Options options;
-  options.create_if_missing = true;
-  Random rnd(test::RandomSeed());
-
-  auto verify_invalid = [&]() {
-    Status s = DBImpl::TEST_ValidateOptions(options);
-    ASSERT_NOK(s);
-    ASSERT_TRUE(s.IsInvalidArgument());
-  };
-
-  auto verify_valid = [&]() {
-    Status s = DBImpl::TEST_ValidateOptions(options);
-    ASSERT_OK(s);
-    ASSERT_FALSE(s.IsInvalidArgument());
-  };
-  std::vector<std::string> invalid_cases = {
-      "06:30-",
-      "-23:30",  // Both need to be set
-      "00:00-00:00",
-      "06:30-06:30"  //  Start time cannot be the same as end time
-      "12:30 PM-23:30",
-      "12:01AM-11:00PM",  // Invalid format
-      "01:99-22:00",      // Invalid value for minutes
-      "00:00-24:00",      // 24:00 is an invalid value
-      "6-7",
-      "6:-7",
-      "06:31.42-7:00",
-      "6.31:42-7:00",
-      "6:0-7:",
-      "15:0.2-3:.7",
-      ":00-00:02",
-      "02:00-:00",
-      "random-value",
-      "No:No-Hi:Hi",
-  };
-
-  std::vector<std::string> valid_cases = {
-      "",  // Not enabled. Valid case
-      "06:30-11:30",
-      "06:30-23:30",
-      "13:30-14:30",
-      "00:00-23:59",  // Entire Day
-      "23:30-01:15",  // From 11:30PM to 1:15AM next day. Valid case.
-      "1:0000000000000-2:000000000042",  // Weird, but we can parse the int.
-  };
-
-  for (std::string invalid_case : invalid_cases) {
-    options.daily_offpeak_time_utc = invalid_case;
-    verify_invalid();
-  }
-  for (std::string valid_case : valid_cases) {
-    options.daily_offpeak_time_utc = valid_case;
-    verify_valid();
-  }
-
-  auto verify_offpeak_info = [&](bool expected_is_now_off_peak,
-                                 int expected_seconds_till_next_offpeak_start,
-                                 int now_utc_hour, int now_utc_minute,
-                                 int now_utc_second = 0) {
-    auto mock_clock = std::make_shared<MockSystemClock>(env_->GetSystemClock());
-    // Add some extra random days to current time
-    int days = rnd.Uniform(100);
-    mock_clock->SetCurrentTime(
-        days * OffpeakTimeOption::kSecondsPerDay +
-        now_utc_hour * OffpeakTimeOption::kSecondsPerHour +
-        now_utc_minute * OffpeakTimeOption::kSecondsPerMinute + now_utc_second);
-    Status s = DBImpl::TEST_ValidateOptions(options);
-    ASSERT_OK(s);
-    auto offpeak_option = OffpeakTimeOption(options.daily_offpeak_time_utc);
-    int64_t now;
-    ASSERT_OK(mock_clock.get()->GetCurrentTime(&now));
-    auto offpeak_info = offpeak_option.GetOffpeakTimeInfo(now);
-    ASSERT_EQ(expected_is_now_off_peak, offpeak_info.is_now_offpeak);
-    ASSERT_EQ(expected_seconds_till_next_offpeak_start,
-              offpeak_info.seconds_till_next_offpeak_start);
-  };
-
-  options.daily_offpeak_time_utc = "";
-  verify_offpeak_info(false, 0, 12, 30);
-
-  options.daily_offpeak_time_utc = "06:30-11:30";
-  verify_offpeak_info(false, 1 * OffpeakTimeOption::kSecondsPerHour, 5, 30);
-  verify_offpeak_info(true, 24 * OffpeakTimeOption::kSecondsPerHour, 6, 30);
-  verify_offpeak_info(true, 20 * OffpeakTimeOption::kSecondsPerHour, 10, 30);
-  verify_offpeak_info(true, 19 * OffpeakTimeOption::kSecondsPerHour, 11, 30);
-  verify_offpeak_info(false, 17 * OffpeakTimeOption::kSecondsPerHour, 13, 30);
-
-  options.daily_offpeak_time_utc = "23:30-04:30";
-  verify_offpeak_info(false, 17 * OffpeakTimeOption::kSecondsPerHour, 6, 30);
-  verify_offpeak_info(true, 24 * OffpeakTimeOption::kSecondsPerHour, 23, 30);
-  verify_offpeak_info(true,
-                      23 * OffpeakTimeOption::kSecondsPerHour +
-                          30 * OffpeakTimeOption::kSecondsPerMinute,
-                      0, 0);
-  verify_offpeak_info(true,
-                      22 * OffpeakTimeOption::kSecondsPerHour +
-                          30 * OffpeakTimeOption::kSecondsPerMinute,
-                      1, 0);
-  verify_offpeak_info(true, 19 * OffpeakTimeOption::kSecondsPerHour, 4, 30);
-  verify_offpeak_info(false,
-                      18 * OffpeakTimeOption::kSecondsPerHour +
-                          59 * OffpeakTimeOption::kSecondsPerMinute,
-                      4, 31);
-
-  // Entire day offpeak
-  options.daily_offpeak_time_utc = "00:00-23:59";
-  verify_offpeak_info(true, 24 * OffpeakTimeOption::kSecondsPerHour, 0, 0);
-  verify_offpeak_info(true, 12 * OffpeakTimeOption::kSecondsPerHour, 12, 00);
-  verify_offpeak_info(true, 1 * OffpeakTimeOption::kSecondsPerMinute, 23, 59);
-  verify_offpeak_info(true, 59, 23, 59, 1);
-  verify_offpeak_info(true, 1, 23, 59, 59);
-
-  // Start with a valid option
-  options.daily_offpeak_time_utc = "01:30-04:15";
-  DestroyAndReopen(options);
-  ASSERT_EQ("01:30-04:15", dbfull()->GetDBOptions().daily_offpeak_time_utc);
-
-  int may_schedule_compaction_called = 0;
-  SyncPoint::GetInstance()->SetCallBack(
-      "DBImpl::MaybeScheduleFlushOrCompaction:Start",
-      [&](void*) { may_schedule_compaction_called++; });
-  SyncPoint::GetInstance()->EnableProcessing();
-
-  // Make sure calling SetDBOptions with invalid option does not change the
-  // value nor call MaybeScheduleFlushOrCompaction()
-  for (std::string invalid_case : invalid_cases) {
-    ASSERT_NOK(
-        dbfull()->SetDBOptions({{"daily_offpeak_time_utc", invalid_case}}));
-    ASSERT_EQ("01:30-04:15", dbfull()
-                                 ->GetVersionSet()
-                                 ->offpeak_time_option()
-                                 .daily_offpeak_time_utc);
-    ASSERT_EQ(1 * kSecondInHour + 30 * kSecondInMinute,
-              dbfull()
-                  ->GetVersionSet()
-                  ->offpeak_time_option()
-                  .daily_offpeak_start_time_utc);
-    ASSERT_EQ(4 * kSecondInHour + 15 * kSecondInMinute,
-              dbfull()
-                  ->GetVersionSet()
-                  ->offpeak_time_option()
-                  .daily_offpeak_end_time_utc);
-  }
-  ASSERT_EQ(0, may_schedule_compaction_called);
-
-  // Changing to new valid values should call MaybeScheduleFlushOrCompaction()
-  // and sets the offpeak_time_option in VersionSet
-  int expected_count = 0;
-  for (std::string valid_case : valid_cases) {
-    if (dbfull()
-            ->GetVersionSet()
-            ->offpeak_time_option()
-            .daily_offpeak_time_utc != valid_case) {
-      expected_count++;
-    }
-    ASSERT_OK(dbfull()->SetDBOptions({{"daily_offpeak_time_utc", valid_case}}));
-    ASSERT_EQ(valid_case, dbfull()->GetDBOptions().daily_offpeak_time_utc);
-    ASSERT_EQ(valid_case, dbfull()
-                              ->GetVersionSet()
-                              ->offpeak_time_option()
-                              .daily_offpeak_time_utc);
-  }
-  ASSERT_EQ(expected_count, may_schedule_compaction_called);
-
-  // Changing to the same value should not call MaybeScheduleFlushOrCompaction()
-  ASSERT_OK(
-      dbfull()->SetDBOptions({{"daily_offpeak_time_utc", "06:30-11:30"}}));
-  may_schedule_compaction_called = 0;
-  ASSERT_OK(
-      dbfull()->SetDBOptions({{"daily_offpeak_time_utc", "06:30-11:30"}}));
-  ASSERT_EQ(0, may_schedule_compaction_called);
-
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->DisableProcessing();
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->ClearAllCallBacks();
-  Close();
-}
-
 TEST_F(DBOptionsTest, CompactionReadaheadSizeChange) {
  for (bool use_direct_reads : {true, false}) {
    SpecialEnv env(env_);
@@ -107,12 +107,12 @@ TEST_F(DBPropertiesTest, Empty) {
        dbfull()->GetProperty("rocksdb.is-file-deletions-enabled", &num));
    ASSERT_EQ("0", num);

-    ASSERT_OK(db_->EnableFileDeletions(/*force=*/false));
+    ASSERT_OK(db_->EnableFileDeletions(false));
    ASSERT_TRUE(
        dbfull()->GetProperty("rocksdb.is-file-deletions-enabled", &num));
    ASSERT_EQ("0", num);

-    ASSERT_OK(db_->EnableFileDeletions(/*force=*/true));
+    ASSERT_OK(db_->EnableFileDeletions());
    ASSERT_TRUE(
        dbfull()->GetProperty("rocksdb.is-file-deletions-enabled", &num));
    ASSERT_EQ("1", num);
@@ -1084,14 +1084,12 @@ class CountingUserTblPropCollector : public TablePropertiesCollector {
  const char* Name() const override { return "CountingUserTblPropCollector"; }

  Status Finish(UserCollectedProperties* properties) override {
-    assert(!finish_called_);
    std::string encoded;
    PutVarint32(&encoded, count_);
    *properties = UserCollectedProperties{
        {"CountingUserTblPropCollector", message_},
        {"Count", encoded},
    };
-    finish_called_ = true;
    return Status::OK();
  }

@@ -1103,14 +1101,12 @@ class CountingUserTblPropCollector : public TablePropertiesCollector {
  }

  UserCollectedProperties GetReadableProperties() const override {
-    assert(finish_called_);
    return UserCollectedProperties{};
  }

 private:
  std::string message_ = "Rocksdb";
  uint32_t count_ = 0;
-  bool finish_called_ = false;
 };

 class CountingUserTblPropCollectorFactory
@@ -1744,7 +1740,7 @@ TEST_F(DBPropertiesTest, SstFilesSize) {
  ASSERT_EQ(obsolete_sst_size, sst_size);

  // Let the obsolete files be deleted.
-  ASSERT_OK(db_->EnableFileDeletions(/*force=*/false));
+  ASSERT_OK(db_->EnableFileDeletions());
  ASSERT_TRUE(db_->GetIntProperty(DB::Properties::kObsoleteSstFilesSize,
                                  &obsolete_sst_size));
  ASSERT_EQ(obsolete_sst_size, 0);
@@ -682,7 +682,6 @@ TEST_F(DBRangeDelTest, TableEvictedDuringScan) {
    // soon as its refcount drops to zero.
    bbto.block_cache->EraseUnRefEntries();
  }
-  ASSERT_OK(iter->status());
  ASSERT_EQ(kNum, expected);
  delete iter;
  db_->ReleaseSnapshot(snapshot);
@@ -841,7 +840,6 @@ TEST_F(DBRangeDelTest, IteratorRemovesCoveredKeys) {
      ++expected;
    }
  }
-  ASSERT_OK(iter->status());
  ASSERT_EQ(kNum, expected);
  delete iter;
 }
@@ -910,7 +908,6 @@ TEST_F(DBRangeDelTest, IteratorIgnoresRangeDeletions) {
    std::string key;
    ASSERT_EQ(expected[i], iter->key());
  }
-  ASSERT_OK(iter->status());
  ASSERT_EQ(3, i);
  delete iter;
  db_->ReleaseSnapshot(snapshot);
@@ -1385,7 +1382,6 @@ TEST_F(DBRangeDelTest, UntruncatedTombstoneDoesNotDeleteNewerKey) {
    for (; iter->Valid(); iter->Next()) {
      ++keys_found;
    }
-    EXPECT_OK(iter->status());
    delete iter;
    return keys_found;
  };
@@ -1489,7 +1485,6 @@ TEST_F(DBRangeDelTest, DeletedMergeOperandReappearsIterPrev) {
  for (; iter->Valid(); iter->Prev()) {
    ++keys_found;
  }
-  ASSERT_OK(iter->status());
  delete iter;
  ASSERT_EQ(kNumKeys, keys_found);

@@ -1524,7 +1519,6 @@ TEST_F(DBRangeDelTest, SnapshotPreventsDroppedKeys) {

  iter->Next();
  ASSERT_FALSE(iter->Valid());
-  ASSERT_OK(iter->status());

  delete iter;
  db_->ReleaseSnapshot(snapshot);
@@ -1570,7 +1564,6 @@ TEST_F(DBRangeDelTest, SnapshotPreventsDroppedKeysInImmMemTables) {

  iter->Next();
  ASSERT_FALSE(iter->Valid());
-  ASSERT_OK(iter->status());
 }

 TEST_F(DBRangeDelTest, RangeTombstoneWrittenToMinimalSsts) {
@@ -1985,7 +1978,6 @@ TEST_F(DBRangeDelTest, IteratorRefresh) {
    ASSERT_EQ("key1", iter->key());
    iter->Next();
    ASSERT_FALSE(iter->Valid());
-    ASSERT_OK(iter->status());

    delete iter;
  }
@@ -220,7 +220,6 @@ TEST_P(DBRateLimiterOnReadTest, Iterator) {
      ++expected;
    }
  }
-  ASSERT_OK(iter->status());
  // Reverse scan does not read evenly (one block per iteration) due to
  // descending seqno ordering, so wait until after the loop to check total.
  ASSERT_EQ(expected, options_.rate_limiter->GetTotalRequests(Env::IO_USER));
@@ -240,7 +240,6 @@ TEST_F(DBReadOnlyTestWithTimestamp, IteratorAndGet) {
      get_value_and_check(db_, read_opts, it->key(), it->value(),
                          write_timestamps[i]);
    }
-    ASSERT_OK(it->status());
    size_t expected_count = kMaxKey - start_keys[i] + 1;
    ASSERT_EQ(expected_count, count);

@@ -253,7 +252,6 @@ TEST_F(DBReadOnlyTestWithTimestamp, IteratorAndGet) {
      get_value_and_check(db_, read_opts, it->key(), it->value(),
                          write_timestamps[i]);
    }
-    ASSERT_OK(it->status());
    ASSERT_EQ(static_cast<size_t>(kMaxKey) - start_keys[i] + 1, count);

    // SeekToFirst()/SeekToLast() with lower/upper bounds.
@@ -275,7 +273,6 @@ TEST_F(DBReadOnlyTestWithTimestamp, IteratorAndGet) {
        get_value_and_check(db_, read_opts, it->key(), it->value(),
                            write_timestamps[i]);
      }
-      ASSERT_OK(it->status());
      ASSERT_EQ(r - std::max(l, start_keys[i]), count);

      for (it->SeekToLast(), key = std::min(r, kMaxKey + 1), count = 0;
@@ -285,7 +282,6 @@ TEST_F(DBReadOnlyTestWithTimestamp, IteratorAndGet) {
        get_value_and_check(db_, read_opts, it->key(), it->value(),
                            write_timestamps[i]);
      }
-      ASSERT_OK(it->status());
      l += (kMaxKey / 100);
      r -= (kMaxKey / 100);
    }
@@ -332,7 +328,6 @@ TEST_F(DBReadOnlyTestWithTimestamp, Iterators) {
    CheckIterUserEntry(iters[0], Key1(key), kTypeValue,
                       "value" + std::to_string(key), write_timestamp);
  }
-  ASSERT_OK(iters[0]->status());

  size_t expected_count = kMaxKey - 0 + 1;
  ASSERT_EQ(expected_count, count);
@@ -200,7 +200,6 @@ TEST_F(DBSecondaryTest, ReopenAsSecondary) {
    }
    ++count;
  }
-  ASSERT_OK(iter->status());
  delete iter;
  ASSERT_EQ(3, count);
 }
@@ -535,8 +534,6 @@ TEST_F(DBSecondaryTest, SecondaryCloseFiles) {
    }
    ASSERT_FALSE(iter1->Valid());
    ASSERT_FALSE(iter2->Valid());
-    ASSERT_OK(iter1->status());
-    ASSERT_OK(iter2->status());
  };

  ASSERT_OK(Put("a", "value"));
@@ -809,7 +806,6 @@ TEST_F(DBSecondaryTest, MissingTableFileDuringOpen) {
  for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
    ++count;
  }
-  ASSERT_OK(iter->status());
  ASSERT_EQ(2, count);
  delete iter;
 }
@@ -867,7 +863,6 @@ TEST_F(DBSecondaryTest, MissingTableFile) {
  for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
    ++count;
  }
-  ASSERT_OK(iter->status());
  ASSERT_EQ(2, count);
  delete iter;
 }
@@ -940,7 +935,6 @@ TEST_F(DBSecondaryTest, SwitchManifest) {
      ASSERT_EQ("value_" + std::to_string(kNumFiles - 1),
                iter->value().ToString());
    }
-    EXPECT_OK(iter->status());
  };

  range_scan_db();
@@ -1491,7 +1485,6 @@ TEST_F(DBSecondaryTestWithTimestamp, IteratorAndGet) {
      get_value_and_check(db_, read_opts, it->key(), it->value(),
                          write_timestamps[i]);
    }
-    ASSERT_OK(it->status());
    size_t expected_count = kMaxKey - start_keys[i] + 1;
    ASSERT_EQ(expected_count, count);

@@ -1504,7 +1497,6 @@ TEST_F(DBSecondaryTestWithTimestamp, IteratorAndGet) {
      get_value_and_check(db_, read_opts, it->key(), it->value(),
                          write_timestamps[i]);
    }
-    ASSERT_OK(it->status());
    ASSERT_EQ(static_cast<size_t>(kMaxKey) - start_keys[i] + 1, count);

    // SeekToFirst()/SeekToLast() with lower/upper bounds.
@@ -1526,7 +1518,6 @@ TEST_F(DBSecondaryTestWithTimestamp, IteratorAndGet) {
        get_value_and_check(db_, read_opts, it->key(), it->value(),
                            write_timestamps[i]);
      }
-      ASSERT_OK(it->status());
      ASSERT_EQ(r - std::max(l, start_keys[i]), count);

      for (it->SeekToLast(), key = std::min(r, kMaxKey + 1), count = 0;
@@ -1536,7 +1527,6 @@ TEST_F(DBSecondaryTestWithTimestamp, IteratorAndGet) {
        get_value_and_check(db_, read_opts, it->key(), it->value(),
                            write_timestamps[i]);
      }
-      ASSERT_OK(it->status());
      l += (kMaxKey / 100);
      r -= (kMaxKey / 100);
    }
@@ -1746,7 +1736,6 @@ TEST_F(DBSecondaryTestWithTimestamp, Iterators) {
    CheckIterUserEntry(iters[0], Key1(key), kTypeValue,
                       "value" + std::to_string(key), write_timestamp);
  }
-  ASSERT_OK(iters[0]->status());

  size_t expected_count = kMaxKey - 0 + 1;
  ASSERT_EQ(expected_count, count);
@@ -1538,11 +1538,6 @@ TEST_F(DBSSTTest, OpenDBWithInfiniteMaxOpenFilesSubjectToMemoryLimit) {
 }

 TEST_F(DBSSTTest, GetTotalSstFilesSize) {
-  // FIXME: L0 file and L1+ file also differ in size of `oldest_key_time`.
-  //  L0 file has non-zero `oldest_key_time` while L1+ files have 0.
-  //  The test passes since L1+ file uses current time instead of 0
-  //  as oldest_ancestor_time.
-  //
  // We don't propagate oldest-key-time table property on compaction and
  // just write 0 as default value. This affect the exact table size, since
  // we encode table properties as varint64. Force time to be 0 to work around
@@ -6,11 +6,9 @@
 #include <string>

 #include "db/db_test_util.h"
-#include "db/write_batch_internal.h"
 #include "monitoring/thread_status_util.h"
 #include "port/stack_trace.h"
 #include "rocksdb/statistics.h"
-#include "rocksdb/utilities/transaction_db.h"
 #include "util/random.h"

 namespace ROCKSDB_NAMESPACE {
@@ -285,78 +283,6 @@ TEST_F(DBStatisticsTest, BlockChecksumStats) {
            options.statistics->getTickerCount(BLOCK_CHECKSUM_MISMATCH_COUNT));
 }

-TEST_F(DBStatisticsTest, BytesWrittenStats) {
-  Options options = CurrentOptions();
-  options.statistics = ROCKSDB_NAMESPACE::CreateDBStatistics();
-  options.statistics->set_stats_level(StatsLevel::kExceptHistogramOrTimers);
-  Reopen(options);
-
-  EXPECT_EQ(0, options.statistics->getAndResetTickerCount(WAL_FILE_BYTES));
-  EXPECT_EQ(0, options.statistics->getAndResetTickerCount(BYTES_WRITTEN));
-
-  const int kNumKeysWritten = 100;
-
-  // Scenario 0: Not using transactions.
-  // This will write to WAL and memtable directly.
-  ASSERT_OK(options.statistics->Reset());
-
-  for (int i = 0; i < kNumKeysWritten; ++i) {
-    ASSERT_OK(Put(Key(i), "val"));
-  }
-
-  EXPECT_EQ(options.statistics->getAndResetTickerCount(WAL_FILE_BYTES),
-            options.statistics->getAndResetTickerCount(BYTES_WRITTEN));
-
-  // Scenario 1: Using transactions.
-  // This should not double count BYTES_WRITTEN (issue #12061).
-  for (bool enable_pipelined_write : {false, true}) {
-    ASSERT_OK(options.statistics->Reset());
-
-    // Destroy the DB to recreate as a TransactionDB.
-    Destroy(options, true);
-
-    // Create a TransactionDB.
-    TransactionDB* txn_db = nullptr;
-    TransactionDBOptions txn_db_opts;
-    txn_db_opts.write_policy = TxnDBWritePolicy::WRITE_COMMITTED;
-    options.enable_pipelined_write = enable_pipelined_write;
-    ASSERT_OK(TransactionDB::Open(options, txn_db_opts, dbname_, &txn_db));
-    ASSERT_NE(txn_db, nullptr);
-    db_ = txn_db->GetBaseDB();
-
-    WriteOptions wopts;
-    TransactionOptions txn_opts;
-    Transaction* txn = txn_db->BeginTransaction(wopts, txn_opts, nullptr);
-    ASSERT_NE(txn, nullptr);
-    ASSERT_OK(txn->SetName("txn1"));
-
-    for (int i = 0; i < kNumKeysWritten; ++i) {
-      ASSERT_OK(txn->Put(Key(i), "val"));
-    }
-
-    // Prepare() writes to WAL, but not to memtable. (WriteCommitted)
-    ASSERT_OK(txn->Prepare());
-    EXPECT_NE(0, options.statistics->getTickerCount(WAL_FILE_BYTES));
-    // BYTES_WRITTEN would have been non-zero previously (issue #12061).
-    EXPECT_EQ(0, options.statistics->getTickerCount(BYTES_WRITTEN));
-
-    // Commit() writes to memtable and also a commit marker to WAL.
-    ASSERT_OK(txn->Commit());
-    delete txn;
-
-    // The WAL has an extra header of size `kHeader` written to it,
-    // as we are writing twice to it (first during Prepare, second during
-    // Commit).
-    EXPECT_EQ(options.statistics->getAndResetTickerCount(WAL_FILE_BYTES),
-              options.statistics->getAndResetTickerCount(BYTES_WRITTEN) +
-                  WriteBatchInternal::kHeader);
-
-    // Cleanup
-    db_ = nullptr;
-    delete txn_db;
-  }
-}
-
 }  // namespace ROCKSDB_NAMESPACE

 int main(int argc, char** argv) {
@@ -22,7 +22,6 @@
 #include "table/table_properties_internal.h"
 #include "test_util/testharness.h"
 #include "test_util/testutil.h"
-#include "util/atomic.h"
 #include "util/random.h"


@@ -418,71 +417,6 @@ TEST_F(DBTablePropertiesTest, GetDbIdentifiersProperty) {
  }
 }

-TEST_F(DBTablePropertiesTest, FactoryReturnsNull) {
-  struct JunkTablePropertiesCollector : public TablePropertiesCollector {
-    const char* Name() const override { return "JunkTablePropertiesCollector"; }
-    Status Finish(UserCollectedProperties* properties) override {
-      properties->insert({"Junk", "Junk"});
-      return Status::OK();
-    }
-    UserCollectedProperties GetReadableProperties() const override {
-      return {};
-    }
-  };
-
-  // Alternates between putting a "Junk" property and using `nullptr` to
-  // opt out.
-  static RelaxedAtomic<int> count{0};
-  struct SometimesTablePropertiesCollectorFactory
-      : public TablePropertiesCollectorFactory {
-    const char* Name() const override {
-      return "SometimesTablePropertiesCollectorFactory";
-    }
-    TablePropertiesCollector* CreateTablePropertiesCollector(
-        TablePropertiesCollectorFactory::Context /*context*/) override {
-      if (count.FetchAddRelaxed(1) & 1) {
-        return nullptr;
-      } else {
-        return new JunkTablePropertiesCollector();
-      }
-    }
-  };
-
-  Options options = CurrentOptions();
-  options.table_properties_collector_factories.emplace_back(
-      std::make_shared<SometimesTablePropertiesCollectorFactory>());
-  // For plain table
-  options.prefix_extractor.reset(NewFixedPrefixTransform(4));
-  for (std::shared_ptr<TableFactory> tf :
-       {options.table_factory,
-        std::shared_ptr<TableFactory>(NewPlainTableFactory({}))}) {
-    SCOPED_TRACE("Table factory = " + std::string(tf->Name()));
-    options.table_factory = tf;
-
-    DestroyAndReopen(options);
-
-    ASSERT_OK(Put("key0", "value1"));
-    ASSERT_OK(Flush());
-    ASSERT_OK(Put("key0", "value2"));
-    ASSERT_OK(Flush());
-
-    TablePropertiesCollection props;
-    ASSERT_OK(db_->GetPropertiesOfAllTables(&props));
-    int no_junk_count = 0;
-    int junk_count = 0;
-    for (const auto& item : props) {
-      if (item.second->user_collected_properties.find("Junk") !=
-          item.second->user_collected_properties.end()) {
-        junk_count++;
-      } else {
-        no_junk_count++;
-      }
-    }
-    EXPECT_EQ(1, no_junk_count);
-    EXPECT_EQ(1, junk_count);
-  }
-}
-
 class DBTableHostnamePropertyTest
    : public DBTestBase,
      public ::testing::WithParamInterface<std::tuple<int, std::string>> {
@@ -52,7 +52,6 @@ TEST_P(DBTestTailingIterator, TailingIteratorSingle) {

  iter->Next();
  ASSERT_TRUE(!iter->Valid());
-  ASSERT_OK(iter->status());
 }

 TEST_P(DBTestTailingIterator, TailingIteratorKeepAdding) {
@@ -362,7 +361,7 @@ TEST_P(DBTestTailingIterator, TailingIteratorDeletes) {
    int count = 0;
    for (; iter->Valid(); iter->Next(), ++count)
      ;
-    ASSERT_OK(iter->status());
+
    ASSERT_EQ(count, num_records);
  }
  Close();
@@ -409,7 +408,6 @@ TEST_P(DBTestTailingIterator, TailingIteratorPrefixSeek) {

    iter->Next();
    ASSERT_TRUE(!iter->Valid());
-    ASSERT_OK(iter->status());
  }
  Close();
 }
@@ -127,7 +127,6 @@ TEST_F(DBTest, MockEnvTest) {
    iterator->Next();
  }
  ASSERT_TRUE(!iterator->Valid());
-  ASSERT_OK(iterator->status());
  delete iterator;

  DBImpl* dbi = static_cast_with_check<DBImpl>(db);
@@ -172,7 +171,6 @@ TEST_F(DBTest, MemEnvTest) {
    iterator->Next();
  }
  ASSERT_TRUE(!iterator->Valid());
-  ASSERT_OK(iterator->status());
  delete iterator;

  DBImpl* dbi = static_cast_with_check<DBImpl>(db);
@@ -2985,7 +2983,6 @@ TEST_F(DBTest, GroupCommitTest) {
      itr->Next();
    }
    ASSERT_TRUE(!itr->Valid());
-    ASSERT_OK(itr->status());
    delete itr;

    HistogramData hist_data;
@@ -3514,8 +3511,6 @@ static bool CompareIterators(int step, DB* model, DB* db,
      ok = false;
    }
  }
-  EXPECT_OK(miter->status());
-  EXPECT_OK(dbiter->status());
  (void)count;
  delete miter;
  delete dbiter;
@@ -6013,7 +6008,6 @@ TEST_F(DBTest, MergeTestTime) {
    ASSERT_OK(iter->status());
    ++count;
  }
-  ASSERT_OK(iter->status());

  ASSERT_EQ(1, count);
  ASSERT_EQ(4000000, TestGetTickerCount(options, MERGE_OPERATION_TOTAL_TIME));
@@ -1805,7 +1805,6 @@ TEST_P(CompressionFailuresTest, CompressionFailures) {
      ASSERT_EQ(key_value_written[key], value);
      key_value_written.erase(key);
    }
-    ASSERT_OK(db_iter->status());
    ASSERT_EQ(0, key_value_written.size());
  } else if (compression_failure_type_ == kTestDecompressionFail) {
    ASSERT_EQ(std::string(s.getState()),
@@ -3802,7 +3801,6 @@ TEST_F(DBTest2, MemtableOnlyIterator) {
    count++;
  }
  ASSERT_TRUE(!it->Valid());
-  ASSERT_OK(it->status());
  ASSERT_EQ(2, count);
  delete it;

@@ -3882,26 +3880,16 @@ TEST_F(DBTest2, LowPriWrite) {
  ASSERT_OK(Put("", "", wo));
  ASSERT_EQ(1, rate_limit_count.load());

-  wo.low_pri = true;
-  std::string big_value = std::string(1 * 1024 * 1024, 'x');
-  ASSERT_OK(Put("", big_value, wo));
-  ASSERT_LT(1, rate_limit_count.load());
-  // Reset
-  rate_limit_count = 0;
-  wo.low_pri = false;
-  ASSERT_OK(Put("", big_value, wo));
-  ASSERT_EQ(0, rate_limit_count.load());
-
  TEST_SYNC_POINT("DBTest.LowPriWrite:0");
  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->DisableProcessing();

  ASSERT_OK(dbfull()->TEST_WaitForCompact());
  wo.low_pri = true;
  ASSERT_OK(Put("", "", wo));
-  ASSERT_EQ(0, rate_limit_count.load());
+  ASSERT_EQ(1, rate_limit_count.load());
  wo.low_pri = false;
  ASSERT_OK(Put("", "", wo));
-  ASSERT_EQ(0, rate_limit_count.load());
+  ASSERT_EQ(1, rate_limit_count.load());
 }

 TEST_F(DBTest2, RateLimitedCompactionReads) {
@@ -4135,7 +4123,7 @@ TEST_F(DBTest2, LiveFilesOmitObsoleteFiles) {
    ASSERT_OK(env_->FileExists(LogFileName(dbname_, log_file->LogNumber())));
  }

-  ASSERT_OK(db_->EnableFileDeletions(/*force=*/false));
+  ASSERT_OK(db_->EnableFileDeletions());
  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->DisableProcessing();
 }

@@ -7600,7 +7588,6 @@ TEST_F(DBTest2, BestEffortsRecoveryWithSstUniqueIdVerification) {
      ASSERT_EQ(std::to_string(cnt), it->key());
      ASSERT_EQ(expected_v, it->value());
    }
-    EXPECT_OK(it->status());
    ASSERT_EQ(expected_count, cnt);
  };

@@ -699,7 +699,6 @@ void DBTestBase::Destroy(const Options& options, bool delete_cf_paths) {
 }

 Status DBTestBase::ReadOnlyReopen(const Options& options) {
-  Close();
  MaybeInstallTimeElapseOnlySleep(options);
  return DB::OpenForReadOnly(options, dbname_, &db_);
 }
@@ -943,7 +942,6 @@ std::string DBTestBase::Contents(int cf) {
    EXPECT_EQ(IterStatus(iter), forward[forward.size() - matched - 1]);
    matched++;
  }
-  EXPECT_OK(iter->status());
  EXPECT_EQ(matched, forward.size());

  delete iter;
@@ -1366,7 +1364,6 @@ std::string DBTestBase::IterStatus(Iterator* iter) {
  if (iter->Valid()) {
    result = iter->key().ToString() + "->" + iter->value().ToString();
  } else {
-    EXPECT_OK(iter->status());
    result = "(invalid)";
  }
  return result;
@@ -1585,7 +1582,6 @@ void DBTestBase::VerifyDBFromMap(std::map<std::string, std::string> true_data,
      iter_cnt++;
      total_reads++;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(data_iter, true_data.end())
        << iter_cnt << " / " << true_data.size();
    delete iter;
@@ -1609,7 +1605,6 @@ void DBTestBase::VerifyDBFromMap(std::map<std::string, std::string> true_data,
      iter_cnt++;
      total_reads++;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(data_rev, true_data.rend())
        << iter_cnt << " / " << true_data.size();

@@ -233,7 +233,6 @@ class SpecialEnv : public EnvWrapper {
      size_t GetUniqueId(char* id, size_t max_size) const override {
        return base_->GetUniqueId(id, max_size);
      }
-      uint64_t GetFileSize() final { return base_->GetFileSize(); }
    };
    class ManifestFile : public WritableFile {
     public:
@@ -346,7 +345,6 @@ class SpecialEnv : public EnvWrapper {
      Status Allocate(uint64_t offset, uint64_t len) override {
        return base_->Allocate(offset, len);
      }
-      uint64_t GetFileSize() final { return base_->GetFileSize(); }

     private:
      SpecialEnv* env_;
@@ -7,12 +7,9 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file. See the AUTHORS file for names of contributors.

-#include <string>
-
 #include "db/db_test_util.h"
 #include "port/stack_trace.h"
 #include "rocksdb/utilities/table_properties_collectors.h"
-#include "test_util/mock_time_env.h"
 #include "test_util/sync_point.h"
 #include "test_util/testutil.h"
 #include "util/random.h"
@@ -1472,7 +1469,6 @@ TEST_P(DBTestUniversalCompaction, IncreaseUniversalCompactionNumLevels) {
      keys_in_db.append(iter->key().ToString());
      keys_in_db.push_back(',');
    }
-    EXPECT_OK(iter->status());
    delete iter;

    std::string expected_keys;
@@ -2233,141 +2229,6 @@ TEST_F(DBTestUniversalCompaction2, PeriodicCompaction) {
  ASSERT_EQ(4, output_level);
 }

-TEST_F(DBTestUniversalCompaction2, PeriodicCompactionOffpeak) {
-  constexpr int kSecondsPerDay = 86400;
-  constexpr int kSecondsPerHour = 3600;
-  constexpr int kSecondsPerMinute = 60;
-
-  Options opts = CurrentOptions();
-  opts.compaction_style = kCompactionStyleUniversal;
-  opts.level0_file_num_compaction_trigger = 10;
-  opts.max_open_files = -1;
-  opts.compaction_options_universal.size_ratio = 10;
-  opts.compaction_options_universal.min_merge_width = 2;
-  opts.compaction_options_universal.max_size_amplification_percent = 200;
-  opts.periodic_compaction_seconds = 5 * kSecondsPerDay;  // 5 days
-  opts.num_levels = 5;
-
-  // Just to add some extra random days to current time
-  Random rnd(test::RandomSeed());
-  int days = rnd.Uniform(100);
-
-  int periodic_compactions = 0;
-  int start_level = -1;
-  int output_level = -1;
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->SetCallBack(
-      "UniversalCompactionPicker::PickPeriodicCompaction:Return",
-      [&](void* arg) {
-        Compaction* compaction = reinterpret_cast<Compaction*>(arg);
-        ASSERT_TRUE(arg != nullptr);
-        ASSERT_TRUE(compaction->compaction_reason() ==
-                    CompactionReason::kPeriodicCompaction);
-        start_level = compaction->start_level();
-        output_level = compaction->output_level();
-        periodic_compactions++;
-      });
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->EnableProcessing();
-
-  for (std::string preset_offpeak_time : {"", "00:30-04:30", "10:30-02:30"}) {
-    SCOPED_TRACE("preset_offpeak_time=" + preset_offpeak_time);
-    for (std::string new_offpeak_time : {"", "23:30-02:30"}) {
-      SCOPED_TRACE("new_offpeak_time=" + new_offpeak_time);
-      std::vector<std::pair<int, int>> times_to_test = {
-          {0, 0}, {2, 30}, {3, 15}, {5, 10}, {13, 30}, {23, 30}};
-      for (std::pair<int, int> now : times_to_test) {
-        int now_hour = now.first;
-        int now_minute = now.second;
-        SCOPED_TRACE("now=" + std::to_string(now_hour) + ":" +
-                     std::to_string(now_minute));
-
-        auto mock_clock =
-            std::make_shared<MockSystemClock>(env_->GetSystemClock());
-        auto mock_env = std::make_unique<CompositeEnvWrapper>(env_, mock_clock);
-        opts.env = mock_env.get();
-        mock_clock->SetCurrentTime(days * kSecondsPerDay +
-                                   now_hour * kSecondsPerHour +
-                                   now_minute * kSecondsPerMinute);
-        opts.daily_offpeak_time_utc = preset_offpeak_time;
-        Reopen(opts);
-
-        ASSERT_OK(Put("foo", "bar1"));
-        ASSERT_OK(Flush());
-        ASSERT_EQ(0, periodic_compactions);
-
-        // Move clock forward by 8 hours. There should be no periodic
-        // compaction, yet.
-        mock_clock->MockSleepForSeconds(8 * kSecondsPerHour);
-        ASSERT_OK(Put("foo", "bar2"));
-        ASSERT_OK(Flush());
-        ASSERT_OK(dbfull()->TEST_WaitForCompact());
-        ASSERT_EQ(0, periodic_compactions);
-
-        // Move clock forward by 4 days
-        mock_clock->MockSleepForSeconds(4 * kSecondsPerDay);
-        ASSERT_OK(Put("foo", "bar3"));
-        ASSERT_OK(Flush());
-        ASSERT_OK(dbfull()->TEST_WaitForCompact());
-
-        int64_t mock_now;
-        ASSERT_OK(mock_clock->GetCurrentTime(&mock_now));
-
-        auto offpeak_time_info =
-            dbfull()->GetVersionSet()->offpeak_time_option().GetOffpeakTimeInfo(
-                mock_now);
-        // At this point, the first file is 4 days and 8 hours old.
-        // If it's offpeak now and the file is expected to expire before the
-        // next offpeak starts
-        if (offpeak_time_info.is_now_offpeak &&
-            offpeak_time_info.seconds_till_next_offpeak_start /
-                    kSecondsPerHour >
-                16) {
-          ASSERT_EQ(1, periodic_compactions);
-        } else {
-          ASSERT_EQ(0, periodic_compactions);
-          // Change offpeak option by SetDBOption()
-          if (preset_offpeak_time != new_offpeak_time) {
-            ASSERT_OK(dbfull()->SetDBOptions(
-                {{"daily_offpeak_time_utc", new_offpeak_time}}));
-            ASSERT_OK(Put("foo", "bar4"));
-            ASSERT_OK(Flush());
-            ASSERT_OK(dbfull()->TEST_WaitForCompact());
-            offpeak_time_info = dbfull()
-                                    ->GetVersionSet()
-                                    ->offpeak_time_option()
-                                    .GetOffpeakTimeInfo(mock_now);
-            // if the first file is now eligible to be picked up
-            if (offpeak_time_info.is_now_offpeak &&
-                offpeak_time_info.seconds_till_next_offpeak_start /
-                        kSecondsPerHour >
-                    16) {
-              ASSERT_OK(Put("foo", "bar5"));
-              ASSERT_OK(Flush());
-              ASSERT_OK(dbfull()->TEST_WaitForCompact());
-              ASSERT_EQ(1, periodic_compactions);
-            }
-          }
-
-          // If the file has not been picked up yet (no offpeak set, or offpeak
-          // set but then unset before the file becomes eligible)
-          if (periodic_compactions == 0) {
-            // move clock forward by one more day
-            mock_clock->MockSleepForSeconds(1 * kSecondsPerDay);
-            ASSERT_OK(Put("foo", "bar6"));
-            ASSERT_OK(Flush());
-            ASSERT_OK(dbfull()->TEST_WaitForCompact());
-          }
-        }
-        ASSERT_EQ(1, periodic_compactions);
-        ASSERT_EQ(0, start_level);
-        ASSERT_EQ(4, output_level);
-        Destroy(opts);
-
-        periodic_compactions = 0;
-      }
-    }
-  }
-}
-
 }  // namespace ROCKSDB_NAMESPACE


@@ -1195,7 +1195,7 @@ TEST_F(DBWALTest, DISABLED_FullPurgePreservesLogPendingReuse) {
    ROCKSDB_NAMESPACE::port::Thread thread([&]() {
      TEST_SYNC_POINT(
          "DBWALTest::FullPurgePreservesLogPendingReuse:PreFullPurge");
-      ASSERT_OK(db_->EnableFileDeletions(/*force=*/true));
+      ASSERT_OK(db_->EnableFileDeletions(true));
      TEST_SYNC_POINT(
          "DBWALTest::FullPurgePreservesLogPendingReuse:PostFullPurge");
    });
@@ -1541,9 +1541,7 @@ class RecoveryTestHelper {
        test->dbname_, &db_options, file_options, table_cache.get(),
        &write_buffer_manager, &write_controller,
        /*block_cache_tracer=*/nullptr,
-        /*io_tracer=*/nullptr, /*db_id=*/"", /*db_session_id=*/"",
-        options.daily_offpeak_time_utc,
-        /*error_handler=*/nullptr));
+        /*io_tracer=*/nullptr, /*db_id*/ "", /*db_session_id*/ ""));

    wal_manager.reset(
        new WalManager(db_options, file_options, /*io_tracer=*/nullptr));
@@ -2230,7 +2228,6 @@ TEST_P(DBWALTestWithParamsVaryingRecoveryMode,
      data.push_back(
          std::make_pair(iter->key().ToString(), iter->value().ToString()));
    }
-    EXPECT_OK(iter->status());
    delete iter;
    return data;
  };
@@ -525,7 +525,6 @@ TEST_F(DBBasicTestWithTimestamp, SimpleIterate) {
      CheckIterUserEntry(it.get(), Key1(key), kTypeValue,
                         "value" + std::to_string(i), write_timestamps[i]);
    }
-    ASSERT_OK(it->status());
    ASSERT_EQ(static_cast<size_t>(kMaxKey) - start_keys[i] + 1, count);

    // SeekToFirst()/SeekToLast() with lower/upper bounds.
@@ -545,7 +544,6 @@ TEST_F(DBBasicTestWithTimestamp, SimpleIterate) {
        CheckIterUserEntry(it.get(), Key1(key), kTypeValue,
                           "value" + std::to_string(i), write_timestamps[i]);
      }
-      ASSERT_OK(it->status());
      ASSERT_EQ(r - std::max(l, start_keys[i]), count);

      for (it->SeekToLast(), key = std::min(r, kMaxKey + 1), count = 0;
@@ -553,7 +551,6 @@ TEST_F(DBBasicTestWithTimestamp, SimpleIterate) {
        CheckIterUserEntry(it.get(), Key1(key - 1), kTypeValue,
                           "value" + std::to_string(i), write_timestamps[i]);
      }
-      ASSERT_OK(it->status());
      l += (kMaxKey / 100);
      r -= (kMaxKey / 100);
    }
@@ -736,7 +733,6 @@ TEST_P(DBBasicTestWithTimestampTableOptions, GetAndMultiGet) {
      ASSERT_EQ(it->value(), value_from_get);
      ASSERT_EQ(Timestamp(1, 0), timestamp);
    }
-    ASSERT_OK(it->status());

    // verify MultiGet()
    constexpr uint64_t step = 2;
@@ -1069,7 +1065,6 @@ TEST_F(DBBasicTestWithTimestamp, SimpleForwardIterateLowerTsBound) {
                       write_timestamps[i - 1]);
      }
    }
-    ASSERT_OK(it->status());
    size_t expected_count = kMaxKey + 1;
    ASSERT_EQ(expected_count, count);
  }
@@ -1148,7 +1143,6 @@ TEST_F(DBBasicTestWithTimestamp, BackwardIterateLowerTsBound) {
                       write_timestamps[1]);
      }
    }
-    ASSERT_OK(it->status());
    size_t expected_count = kMaxKey + 1;
    ASSERT_EQ(expected_count, count);
  }
@@ -1179,7 +1173,6 @@ TEST_F(DBBasicTestWithTimestamp, BackwardIterateLowerTsBound) {
      CheckIterEntry(it.get(), Key1(key), kTypeDeletionWithTimestamp, Slice(),
                     write_timestamp);
    }
-    ASSERT_OK(it->status());
    ASSERT_EQ(kMaxKey + 1, count);
  }
  Close();
@@ -1285,7 +1278,6 @@ TEST_F(DBBasicTestWithTimestamp, BackwardIterateLowerTsBound_Reseek) {
      CheckIterEntry(it.get(), "a", kTypeValue, "v" + std::to_string(4 + i),
                     Timestamp(4 + i, 0));
    }
-    ASSERT_OK(it->status());
  }

  Close();
@@ -1646,88 +1638,35 @@ TEST_F(DBBasicTestWithTimestamp, GetWithRowCache) {

  const Snapshot* snap_with_nothing = db_->GetSnapshot();
  ASSERT_OK(db_->Put(write_opts, "foo", ts_early, "bar"));
-  ASSERT_OK(db_->Put(write_opts, "foo2", ts_early, "bar2"));
-  ASSERT_OK(db_->Put(write_opts, "foo3", ts_early, "bar3"));
-
  const Snapshot* snap_with_foo = db_->GetSnapshot();
+
+  // Ensure file has sequence number greater than snapshot_with_foo
+  for (int i = 0; i < 10; i++) {
+    std::string numStr = std::to_string(i);
+    ASSERT_OK(db_->Put(write_opts, numStr, ts_later, numStr));
+  }
  ASSERT_OK(Flush());
+  ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), 0);
+  ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), 0);

  ReadOptions read_opts;
  read_opts.timestamp = &ts_later_slice;

  std::string read_value;
  std::string read_ts;
-  Status s;
+  Status s = db_->Get(read_opts, "foo", &read_value, &read_ts);
+  ASSERT_OK(s);
+  ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), 0);
+  ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), 1);
+  ASSERT_EQ(read_ts, ts_early);

-  int expected_hit_count = 0;
-  int expected_miss_count = 0;
-  ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), expected_hit_count);
-  ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), expected_miss_count);
-
-  {
-    read_opts.timestamp = nullptr;
-    s = db_->Get(read_opts, "foo", &read_value);
-    ASSERT_NOK(s);
-    ASSERT_TRUE(s.IsInvalidArgument());
-  }
-
-  // Mix use of Get
-  {
-    read_opts.timestamp = &ts_later_slice;
-
-    // Use Get without ts first, expect cache entry to store the correct ts
-    s = db_->Get(read_opts, "foo2", &read_value);
-    ASSERT_OK(s);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), expected_hit_count);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS),
-              ++expected_miss_count);
-    ASSERT_EQ(read_value, "bar2");
-
-    s = db_->Get(read_opts, "foo2", &read_value, &read_ts);
-    ASSERT_OK(s);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), ++expected_hit_count);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), expected_miss_count);
-    ASSERT_EQ(read_ts, ts_early);
-    ASSERT_EQ(read_value, "bar2");
-
-    // Use Get with ts first, expect the Get without ts can get correct record
-    s = db_->Get(read_opts, "foo3", &read_value, &read_ts);
-    ASSERT_OK(s);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), expected_hit_count);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS),
-              ++expected_miss_count);
-    ASSERT_EQ(read_ts, ts_early);
-    ASSERT_EQ(read_value, "bar3");
-
-    s = db_->Get(read_opts, "foo3", &read_value);
-    ASSERT_OK(s);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), ++expected_hit_count);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), expected_miss_count);
-    ASSERT_EQ(read_value, "bar3");
-  }
-
-  {
-    // Test with consecutive calls of Get with ts.
-    s = db_->Get(read_opts, "foo", &read_value, &read_ts);
-    ASSERT_OK(s);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), expected_hit_count);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS),
-              ++expected_miss_count);
-    ASSERT_EQ(read_ts, ts_early);
-    ASSERT_EQ(read_value, "bar");
-
-    // Test repeated get on cache entry
-    for (int i = 0; i < 3; i++) {
-      s = db_->Get(read_opts, "foo", &read_value, &read_ts);
-      ASSERT_OK(s);
-      ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT),
-                ++expected_hit_count);
-      ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS),
-                expected_miss_count);
-      ASSERT_EQ(read_ts, ts_early);
-      ASSERT_EQ(read_value, "bar");
-    }
-  }
+  s = db_->Get(read_opts, "foo", &read_value, &read_ts);
+  ASSERT_OK(s);
+  ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), 1);
+  ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), 1);
+  // Row cache is not storing the ts when record is inserted/updated.
+  // To be fixed after enabling ROW_CACHE with timestamp.
+  // ASSERT_EQ(read_ts, ts_early);

  {
    std::string ts_nothing = Timestamp(0, 0);
@@ -1735,43 +1674,41 @@ TEST_F(DBBasicTestWithTimestamp, GetWithRowCache) {
    read_opts.timestamp = &ts_nothing_slice;
    s = db_->Get(read_opts, "foo", &read_value, &read_ts);
    ASSERT_TRUE(s.IsNotFound());
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), expected_hit_count);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS),
-              ++expected_miss_count);
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), 1);
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), 2);
+
+    read_opts.timestamp = &ts_later_slice;
+    s = db_->Get(read_opts, "foo", &read_value, &read_ts);
+    ASSERT_OK(s);
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), 2);
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), 2);
  }

  {
    read_opts.snapshot = snap_with_foo;
-    read_opts.timestamp = &ts_later_slice;
-    s = db_->Get(read_opts, "foo", &read_value, &read_ts);
-    ASSERT_OK(s);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), expected_hit_count);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS),
-              ++expected_miss_count);
-    ASSERT_EQ(read_ts, ts_early);
-    ASSERT_EQ(read_value, "bar");

    s = db_->Get(read_opts, "foo", &read_value, &read_ts);
    ASSERT_OK(s);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), ++expected_hit_count);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), expected_miss_count);
-    ASSERT_EQ(read_ts, ts_early);
-    ASSERT_EQ(read_value, "bar");
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), 2);
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), 3);
+
+    s = db_->Get(read_opts, "foo", &read_value, &read_ts);
+    ASSERT_OK(s);
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), 3);
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), 3);
  }

  {
    read_opts.snapshot = snap_with_nothing;
    s = db_->Get(read_opts, "foo", &read_value, &read_ts);
    ASSERT_TRUE(s.IsNotFound());
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), expected_hit_count);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS),
-              ++expected_miss_count);
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), 3);
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), 4);

    s = db_->Get(read_opts, "foo", &read_value, &read_ts);
    ASSERT_TRUE(s.IsNotFound());
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), expected_hit_count);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS),
-              ++expected_miss_count);
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), 3);
+    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), 5);
  }

  db_->ReleaseSnapshot(snap_with_nothing);
@@ -1779,65 +1716,6 @@ TEST_F(DBBasicTestWithTimestamp, GetWithRowCache) {
  Close();
 }

-TEST_F(DBBasicTestWithTimestamp, GetWithRowCacheMultiSST) {
-  BlockBasedTableOptions table_options;
-  table_options.block_size = 1;
-  Options options = CurrentOptions();
-  options.env = env_;
-  options.create_if_missing = true;
-  options.statistics = ROCKSDB_NAMESPACE::CreateDBStatistics();
-  LRUCacheOptions cache_options;
-  cache_options.capacity = 8192;
-  options.row_cache = cache_options.MakeSharedRowCache();
-
-  const size_t kTimestampSize = Timestamp(0, 0).size();
-  TestComparator test_cmp(kTimestampSize);
-  options.comparator = &test_cmp;
-  options.table_factory.reset(NewBlockBasedTableFactory(table_options));
-  options.merge_operator = MergeOperators::CreateStringAppendTESTOperator();
-  options.disable_auto_compactions = true;
-
-  DestroyAndReopen(options);
-
-  std::string ts_early = Timestamp(1, 0);
-  std::string ts_later = Timestamp(10, 0);
-  Slice ts_later_slice = ts_later;
-
-  ASSERT_OK(db_->Put(WriteOptions(), "foo", ts_early, "v1"));
-  ASSERT_OK(Flush());
-
-  ColumnFamilyHandle* default_cf = db_->DefaultColumnFamily();
-  ASSERT_OK(
-      db_->Merge(WriteOptions(), default_cf, "foo", Timestamp(2, 0), "v2"));
-  ASSERT_OK(
-      db_->Merge(WriteOptions(), default_cf, "foo", Timestamp(3, 0), "v3"));
-  ASSERT_OK(Flush());
-
-  ReadOptions read_opts;
-  read_opts.timestamp = &ts_later_slice;
-
-  std::string read_value;
-  std::string read_ts;
-  Status s;
-
-  {
-    // Since there are two SST files, will trigger the table lookup twice.
-    s = db_->Get(read_opts, "foo", &read_value, &read_ts);
-    ASSERT_OK(s);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), 0);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), 2);
-    ASSERT_EQ(read_ts, Timestamp(3, 0));
-    ASSERT_EQ(read_value, "v1,v2,v3");
-
-    s = db_->Get(read_opts, "foo", &read_value, &read_ts);
-    ASSERT_OK(s);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_HIT), 2);
-    ASSERT_EQ(TestGetTickerCount(options, ROW_CACHE_MISS), 2);
-    ASSERT_EQ(read_ts, Timestamp(3, 0));
-    ASSERT_EQ(read_value, "v1,v2,v3");
-  }
-}
-
 TEST_P(DBBasicTestWithTimestampTableOptions, MultiGetPrefixFilter) {
  Options options = CurrentOptions();
  options.env = env_;
@@ -3267,7 +3145,6 @@ TEST_P(DBBasicTestWithTimestampPrefixSeek, IterateWithPrefix) {
                         "value" + std::to_string(i), write_ts_list[i]);
      iter->Next();
      ASSERT_FALSE(iter->Valid());
-      ASSERT_OK(iter->status());

      // Seek to kMinKey
      iter->Seek(Key1(kMinKey));
@@ -3275,7 +3152,6 @@ TEST_P(DBBasicTestWithTimestampPrefixSeek, IterateWithPrefix) {
                         "value" + std::to_string(i), write_ts_list[i]);
      iter->Prev();
      ASSERT_FALSE(iter->Valid());
-      ASSERT_OK(iter->status());
    }
    const std::vector<uint64_t> targets = {kMinKey, kMinKey + 0x10,
                                           kMinKey + 0x100, kMaxKey};
@@ -3314,7 +3190,6 @@ TEST_P(DBBasicTestWithTimestampPrefixSeek, IterateWithPrefix) {
          ++expected_key;
          it->Next();
        }
-        ASSERT_OK(it->status());
        ASSERT_EQ(expected_ub - targets[j] + 1, count);

        count = 0;
@@ -3333,7 +3208,6 @@ TEST_P(DBBasicTestWithTimestampPrefixSeek, IterateWithPrefix) {
          --expected_key;
          it->Prev();
        }
-        ASSERT_OK(it->status());
        ASSERT_EQ(targets[j] - std::max(expected_lb, kMinKey) + 1, count);
      }
    }
@@ -3439,7 +3313,6 @@ TEST_P(DBBasicTestWithTsIterTombstones, IterWithDelete) {
      ASSERT_EQ(Key1(key), iter->key());
      ASSERT_EQ("value1" + std::to_string(key), iter->value());
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ((kMaxKey - kMinKey + 1) / 2, count);
  }
  Close();
@@ -4059,7 +3932,6 @@ TEST_P(DBBasicTestWithTimestampTableOptions, DeleteRangeBaiscReadAndIterate) {
        ++expected;
      }
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(kNum, expected);

    expected = kNum / 2;
@@ -4067,7 +3939,6 @@ TEST_P(DBBasicTestWithTimestampTableOptions, DeleteRangeBaiscReadAndIterate) {
      ASSERT_EQ(Key1(expected), iter->key());
      ++expected;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(kNum, expected);

    expected = kRangeBegin - 1;
@@ -4075,7 +3946,6 @@ TEST_P(DBBasicTestWithTimestampTableOptions, DeleteRangeBaiscReadAndIterate) {
      ASSERT_EQ(Key1(expected), iter->key());
      --expected;
    }
-    ASSERT_OK(iter->status());
    ASSERT_EQ(-1, expected);

    read_ts = Timestamp(0, 0);
@@ -4357,7 +4227,6 @@ TEST_F(DBBasicTestWithTimestamp, MergeBasic) {
        ASSERT_EQ(value, it->value());
        ASSERT_EQ(write_ts_strs[i], it->timestamp());
      }
-      EXPECT_OK(it->status());
      ASSERT_EQ(kNumOfUniqKeys, key_int_val);

      key_int_val = kNumOfUniqKeys - 1;
@@ -4369,7 +4238,6 @@ TEST_F(DBBasicTestWithTimestamp, MergeBasic) {
        ASSERT_EQ(value, it->value());
        ASSERT_EQ(write_ts_strs[i], it->timestamp());
      }
-      ASSERT_OK(it->status());
      ASSERT_EQ(std::numeric_limits<size_t>::max(), key_int_val);

      value_suffix = value_suffix + "." + std::to_string(i + 1);
@@ -355,7 +355,6 @@ class InternalKeyComparator

  // Same as Compare except that it excludes the value type from comparison
  int CompareKeySeq(const Slice& a, const Slice& b) const;
-  int CompareKeySeq(const ParsedInternalKey& a, const Slice& b) const;

  const Comparator* user_comparator() const {
    return user_comparator_.user_comparator();
@@ -977,26 +976,6 @@ inline int InternalKeyComparator::CompareKeySeq(const Slice& akey,
  return r;
 }

-inline int InternalKeyComparator::CompareKeySeq(const ParsedInternalKey& a,
-                                                const Slice& b) const {
-  // Order by:
-  //    increasing user key (according to user-supplied comparator)
-  //    decreasing sequence number
-  int r = user_comparator_.Compare(a.user_key, ExtractUserKey(b));
-  if (r == 0) {
-    // Shift the number to exclude the last byte which contains the value type
-    const uint64_t anum = a.sequence;
-    const uint64_t bnum =
-        DecodeFixed64(b.data() + b.size() - kNumInternalBytes) >> 8;
-    if (anum > bnum) {
-      r = -1;
-    } else if (anum < bnum) {
-      r = +1;
-    }
-  }
-  return r;
-}
-
 inline int InternalKeyComparator::Compare(const Slice& a,
                                          SequenceNumber a_global_seqno,
                                          const Slice& b,
@@ -575,7 +575,6 @@ TEST_F(DeleteFileTest, DeleteNonDefaultColumnFamily) {
      ASSERT_OK(itr->status());
      ++count;
    }
-    ASSERT_OK(itr->status());
    ASSERT_EQ(count, 1000);
  }

@@ -589,7 +588,6 @@ TEST_F(DeleteFileTest, DeleteNonDefaultColumnFamily) {
      ASSERT_OK(itr->status());
      ++count;
    }
-    ASSERT_OK(itr->status());
    ASSERT_EQ(count, 1000);
  }
 }
@@ -396,6 +396,15 @@ const Status& ErrorHandler::SetBGError(const Status& bg_status,
  ROCKS_LOG_WARN(db_options_.info_log, "Background IO error %s",
                 bg_io_err.ToString().c_str());

+  if (!recovery_disabled_file_deletion_ &&
+      (BackgroundErrorReason::kManifestWrite == reason ||
+       BackgroundErrorReason::kManifestWriteNoWAL == reason)) {
+    // Always returns ok
+    ROCKS_LOG_INFO(db_options_.info_log, "Disabling File Deletions");
+    db_->DisableFileDeletionsWithLock().PermitUncheckedError();
+    recovery_disabled_file_deletion_ = true;
+  }
+
  Status new_bg_io_err = bg_io_err;
  DBRecoverContext context;
  if (bg_io_err.GetScope() != IOStatus::IOErrorScope::kIOErrorScopeFile &&
@@ -496,31 +505,6 @@ const Status& ErrorHandler::SetBGError(const Status& bg_status,
  }
 }

-void ErrorHandler::AddFilesToQuarantine(
-    autovector<const autovector<uint64_t>*> files_to_quarantine) {
-  db_mutex_->AssertHeld();
-  std::ostringstream quarantine_files_oss;
-  bool is_first_one = true;
-  for (const auto* files : files_to_quarantine) {
-    assert(files);
-    for (uint64_t file_number : *files) {
-      files_to_quarantine_.push_back(file_number);
-      quarantine_files_oss << (is_first_one ? "" : ", ") << file_number;
-      is_first_one = false;
-    }
-  }
-  ROCKS_LOG_INFO(db_options_.info_log,
-                 "ErrorHandler: added file numbers %s to quarantine.\n",
-                 quarantine_files_oss.str().c_str());
-}
-
-void ErrorHandler::ClearFilesToQuarantine() {
-  db_mutex_->AssertHeld();
-  files_to_quarantine_.clear();
-  ROCKS_LOG_INFO(db_options_.info_log,
-                 "ErrorHandler: cleared files in quarantine.\n");
-}
-
 Status ErrorHandler::OverrideNoSpaceError(const Status& bg_error,
                                          bool* auto_recovery) {
  if (bg_error.severity() >= Status::Severity::kFatalError) {
@@ -568,18 +552,28 @@ Status ErrorHandler::ClearBGError() {

  // Signal that recovery succeeded
  if (recovery_error_.ok()) {
-    assert(files_to_quarantine_.empty());
    Status old_bg_error = bg_error_;
    // old_bg_error is only for notifying listeners, so may not be checked
    old_bg_error.PermitUncheckedError();
    // Clear and check the recovery IO and BG error
-    is_db_stopped_.store(false, std::memory_order_release);
    bg_error_ = Status::OK();
    recovery_error_ = IOStatus::OK();
    bg_error_.PermitUncheckedError();
    recovery_error_.PermitUncheckedError();
    recovery_in_prog_ = false;
    soft_error_no_bg_work_ = false;
+    if (recovery_disabled_file_deletion_) {
+      recovery_disabled_file_deletion_ = false;
+      int remain_counter = db_->EnableFileDeletionsWithLock();
+      if (remain_counter == 0) {
+        ROCKS_LOG_INFO(db_options_.info_log, "File Deletions Enabled");
+      } else {
+        ROCKS_LOG_WARN(
+            db_options_.info_log,
+            "File Deletions Enable, but not really enabled. Counter: %d",
+            remain_counter);
+      }
+    }
    EventHelpers::NotifyOnErrorRecoveryEnd(db_options_.listeners, old_bg_error,
                                           bg_error_, db_mutex_);
  }
@@ -651,13 +645,6 @@ const Status& ErrorHandler::StartRecoverFromRetryableBGIOError(
  } else if (db_options_.max_bgerror_resume_count <= 0 || recovery_in_prog_) {
    // Auto resume BG error is not enabled, directly return bg_error_.
    return bg_error_;
-  } else if (end_recovery_) {
-    // Can temporarily release db mutex
-    EventHelpers::NotifyOnErrorRecoveryEnd(db_options_.listeners, bg_error_,
-                                           Status::ShutdownInProgress(),
-                                           db_mutex_);
-    db_mutex_->AssertHeld();
-    return bg_error_;
  }
  if (bg_error_stats_ != nullptr) {
    RecordTick(bg_error_stats_.get(), ERROR_HANDLER_AUTORESUME_COUNT);
@@ -677,14 +664,11 @@ const Status& ErrorHandler::StartRecoverFromRetryableBGIOError(
    // wait the previous recover thread to finish and create a new thread
    // to recover from the bg error.
    db_mutex_->Unlock();
-    TEST_SYNC_POINT(
-        "StartRecoverFromRetryableBGIOError:BeforeWaitingForOtherThread");
    old_recovery_thread->join();
-    TEST_SYNC_POINT(
-        "StartRecoverFromRetryableBGIOError:AfterWaitingForOtherThread");
    db_mutex_->Lock();
  }

+  TEST_SYNC_POINT("StartRecoverFromRetryableBGIOError::in_progress");
  recovery_thread_.reset(
      new port::Thread(&ErrorHandler::RecoverFromRetryableBGIOError, this));

@@ -698,7 +682,6 @@ const Status& ErrorHandler::StartRecoverFromRetryableBGIOError(
 // Automatic recover from Retryable BG IO error. Must be called after db
 // mutex is released.
 void ErrorHandler::RecoverFromRetryableBGIOError() {
-  assert(recovery_in_prog_);
  TEST_SYNC_POINT("RecoverFromRetryableBGIOError:BeforeStart");
  TEST_SYNC_POINT("RecoverFromRetryableBGIOError:BeforeStart2");
  InstrumentedMutexLock l(db_mutex_);
@@ -764,12 +747,22 @@ void ErrorHandler::RecoverFromRetryableBGIOError() {
        // recover from the retryable IO error and no other BG errors. Clean
        // the bg_error and notify user.
        TEST_SYNC_POINT("RecoverFromRetryableBGIOError:RecoverSuccess");
+        Status old_bg_error = bg_error_;
+        is_db_stopped_.store(false, std::memory_order_release);
+        bg_error_ = Status::OK();
+        bg_error_.PermitUncheckedError();
+        EventHelpers::NotifyOnErrorRecoveryEnd(
+            db_options_.listeners, old_bg_error, bg_error_, db_mutex_);
        if (bg_error_stats_ != nullptr) {
          RecordTick(bg_error_stats_.get(),
                     ERROR_HANDLER_AUTORESUME_SUCCESS_COUNT);
          RecordInHistogram(bg_error_stats_.get(),
                            ERROR_HANDLER_AUTORESUME_RETRY_COUNT, retry_count);
        }
+        recovery_in_prog_ = false;
+        if (soft_error_no_bg_work_) {
+          soft_error_no_bg_work_ = false;
+        }
        return;
      } else {
        // In this case: 1) recovery_error_ is more serious or not retryable
@@ -826,7 +819,6 @@ void ErrorHandler::EndAutoRecovery() {
    old_recovery_thread->join();
    db_mutex_->Lock();
  }
-  TEST_SYNC_POINT("PostEndAutoRecovery");
  return;
 }

@@ -4,14 +4,11 @@
 //  (found in the LICENSE.Apache file in the root directory).
 #pragma once

-#include <sstream>
-
 #include "monitoring/instrumented_mutex.h"
 #include "options/db_options.h"
 #include "rocksdb/io_status.h"
 #include "rocksdb/listener.h"
 #include "rocksdb/status.h"
-#include "util/autovector.h"

 namespace ROCKSDB_NAMESPACE {

@@ -45,7 +42,8 @@ class ErrorHandler {
        recovery_in_prog_(false),
        soft_error_no_bg_work_(false),
        is_db_stopped_(false),
-        bg_error_stats_(db_options.statistics) {
+        bg_error_stats_(db_options.statistics),
+        recovery_disabled_file_deletion_(false) {
    // Clear the checked flag for uninitialized errors
    bg_error_.PermitUncheckedError();
    recovery_error_.PermitUncheckedError();
@@ -83,16 +81,6 @@ class ErrorHandler {

  void EndAutoRecovery();

-  void AddFilesToQuarantine(
-      autovector<const autovector<uint64_t>*> files_to_quarantine);
-
-  const autovector<uint64_t>& GetFilesToQuarantine() const {
-    db_mutex_->AssertHeld();
-    return files_to_quarantine_;
-  }
-
-  void ClearFilesToQuarantine();
-
 private:
  DBImpl* db_;
  const ImmutableDBOptions& db_options_;
@@ -121,12 +109,9 @@ class ErrorHandler {
  // The pointer of DB statistics.
  std::shared_ptr<Statistics> bg_error_stats_;

-  // During recovery from manifest IO errors, files whose VersionEdits entries
-  // could be in an ambiguous state are quarantined and file deletion refrain
-  // from deleting them. Successful recovery will clear this vector. Files are
-  // added to this vector while DB mutex was locked, this data structure is
-  // unsorted.
-  autovector<uint64_t> files_to_quarantine_;
+  // Tracks whether the recovery has disabled file deletion. This boolean flag
+  // is updated while holding db mutex.
+  bool recovery_disabled_file_deletion_;

  const Status& HandleKnownErrors(const Status& bg_err,
                                  BackgroundErrorReason reason);
@@ -7,15 +7,12 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file. See the AUTHORS file for names of contributors.

-#include <memory>
-
 #include "db/db_test_util.h"
 #include "file/sst_file_manager_impl.h"
 #include "port/stack_trace.h"
 #include "rocksdb/io_status.h"
 #include "rocksdb/sst_file_manager.h"
 #include "test_util/sync_point.h"
-#include "test_util/testharness.h"
 #include "util/random.h"
 #include "utilities/fault_injection_env.h"
 #include "utilities/fault_injection_fs.h"
@@ -155,9 +152,9 @@ class ErrorHandlerFSListener : public EventListener {
  FaultInjectionTestFS* fault_fs_;
 };

-TEST_F(DBErrorHandlingFSTest, FlushWriteError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+TEST_F(DBErrorHandlingFSTest, FLushWriteError) {
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -200,9 +197,9 @@ TEST_F(DBErrorHandlingFSTest, FlushWriteError) {
 // All the NoSpace IOError will be handled as the regular BG Error no matter the
 // retryable flag is set of not. So the auto resume for retryable IO Error will
 // not be triggered. Also, it is mapped as hard error.
-TEST_F(DBErrorHandlingFSTest, FlushWriteNoSpaceError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+TEST_F(DBErrorHandlingFSTest, FLushWriteNoSpaceError) {
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -244,9 +241,9 @@ TEST_F(DBErrorHandlingFSTest, FlushWriteNoSpaceError) {
  Destroy(options);
 }

-TEST_F(DBErrorHandlingFSTest, FlushWriteRetryableError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+TEST_F(DBErrorHandlingFSTest, FLushWriteRetryableError) {
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -318,9 +315,9 @@ TEST_F(DBErrorHandlingFSTest, FlushWriteRetryableError) {
  Destroy(options);
 }

-TEST_F(DBErrorHandlingFSTest, FlushWriteFileScopeError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+TEST_F(DBErrorHandlingFSTest, FLushWriteFileScopeError) {
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -402,9 +399,9 @@ TEST_F(DBErrorHandlingFSTest, FlushWriteFileScopeError) {
  Destroy(options);
 }

-TEST_F(DBErrorHandlingFSTest, FlushWALWriteRetryableError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+TEST_F(DBErrorHandlingFSTest, FLushWALWriteRetryableError) {
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -446,9 +443,9 @@ TEST_F(DBErrorHandlingFSTest, FlushWALWriteRetryableError) {
  Destroy(options);
 }

-TEST_F(DBErrorHandlingFSTest, FlushWALAtomicWriteRetryableError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+TEST_F(DBErrorHandlingFSTest, FLushWALAtomicWriteRetryableError) {
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -492,9 +489,9 @@ TEST_F(DBErrorHandlingFSTest, FlushWALAtomicWriteRetryableError) {
 }

 // The flush error is injected before we finish the table build
-TEST_F(DBErrorHandlingFSTest, FlushWritNoWALRetryableError1) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+TEST_F(DBErrorHandlingFSTest, FLushWritNoWALRetryableError1) {
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -548,9 +545,9 @@ TEST_F(DBErrorHandlingFSTest, FlushWritNoWALRetryableError1) {
 }

 // The retryable IO error is injected before we sync table
-TEST_F(DBErrorHandlingFSTest, FlushWriteNoWALRetryableError2) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+TEST_F(DBErrorHandlingFSTest, FLushWriteNoWALRetryableError2) {
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -592,9 +589,9 @@ TEST_F(DBErrorHandlingFSTest, FlushWriteNoWALRetryableError2) {
 }

 // The retryable IO error is injected before we close the table file
-TEST_F(DBErrorHandlingFSTest, FlushWriteNoWALRetryableError3) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+TEST_F(DBErrorHandlingFSTest, FLushWriteNoWALRetryableError3) {
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -636,8 +633,8 @@ TEST_F(DBErrorHandlingFSTest, FlushWriteNoWALRetryableError3) {
 }

 TEST_F(DBErrorHandlingFSTest, ManifestWriteError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -661,7 +658,6 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteError) {
  SyncPoint::GetInstance()->EnableProcessing();
  s = Flush();
  ASSERT_EQ(s.severity(), ROCKSDB_NAMESPACE::Status::Severity::kHardError);
-  ASSERT_FALSE(dbfull()->TEST_GetFilesToQuarantine().empty());
  SyncPoint::GetInstance()->ClearAllCallBacks();
  SyncPoint::GetInstance()->DisableProcessing();
  fault_fs_->SetFilesystemActive(true);
@@ -670,7 +666,6 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteError) {

  new_manifest = GetManifestNameFromLiveFiles();
  ASSERT_NE(new_manifest, old_manifest);
-  ASSERT_TRUE(dbfull()->TEST_GetFilesToQuarantine().empty());

  Reopen(options);
  ASSERT_EQ("val", Get(Key(0)));
@@ -679,8 +674,8 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteError) {
 }

 TEST_F(DBErrorHandlingFSTest, ManifestWriteRetryableError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -706,7 +701,6 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteRetryableError) {
  SyncPoint::GetInstance()->EnableProcessing();
  s = Flush();
  ASSERT_EQ(s.severity(), ROCKSDB_NAMESPACE::Status::Severity::kSoftError);
-  ASSERT_FALSE(dbfull()->TEST_GetFilesToQuarantine().empty());
  SyncPoint::GetInstance()->ClearAllCallBacks();
  SyncPoint::GetInstance()->DisableProcessing();
  fault_fs_->SetFilesystemActive(true);
@@ -715,7 +709,6 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteRetryableError) {

  new_manifest = GetManifestNameFromLiveFiles();
  ASSERT_NE(new_manifest, old_manifest);
-  ASSERT_TRUE(dbfull()->TEST_GetFilesToQuarantine().empty());

  Reopen(options);
  ASSERT_EQ("val", Get(Key(0)));
@@ -724,8 +717,8 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteRetryableError) {
 }

 TEST_F(DBErrorHandlingFSTest, ManifestWriteFileScopeError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -753,7 +746,6 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteFileScopeError) {
      [&](void*) { fault_fs_->SetFilesystemActive(false, error_msg); });
  SyncPoint::GetInstance()->EnableProcessing();
  s = Flush();
-  ASSERT_FALSE(dbfull()->TEST_GetFilesToQuarantine().empty());
  ASSERT_EQ(s.severity(), ROCKSDB_NAMESPACE::Status::Severity::kSoftError);
  SyncPoint::GetInstance()->ClearAllCallBacks();
  SyncPoint::GetInstance()->DisableProcessing();
@@ -763,7 +755,6 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteFileScopeError) {

  new_manifest = GetManifestNameFromLiveFiles();
  ASSERT_NE(new_manifest, old_manifest);
-  ASSERT_TRUE(dbfull()->TEST_GetFilesToQuarantine().empty());

  Reopen(options);
  ASSERT_EQ("val", Get(Key(0)));
@@ -772,8 +763,8 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteFileScopeError) {
 }

 TEST_F(DBErrorHandlingFSTest, ManifestWriteNoWALRetryableError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -801,7 +792,6 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteNoWALRetryableError) {
  SyncPoint::GetInstance()->EnableProcessing();
  s = Flush();
  ASSERT_EQ(s.severity(), ROCKSDB_NAMESPACE::Status::Severity::kSoftError);
-  ASSERT_FALSE(dbfull()->TEST_GetFilesToQuarantine().empty());
  SyncPoint::GetInstance()->ClearAllCallBacks();
  SyncPoint::GetInstance()->DisableProcessing();
  fault_fs_->SetFilesystemActive(true);
@@ -810,7 +800,6 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteNoWALRetryableError) {

  new_manifest = GetManifestNameFromLiveFiles();
  ASSERT_NE(new_manifest, old_manifest);
-  ASSERT_TRUE(dbfull()->TEST_GetFilesToQuarantine().empty());

  Reopen(options);
  ASSERT_EQ("val", Get(Key(0)));
@@ -819,8 +808,8 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteNoWALRetryableError) {
 }

 TEST_F(DBErrorHandlingFSTest, DoubleManifestWriteError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -844,13 +833,11 @@ TEST_F(DBErrorHandlingFSTest, DoubleManifestWriteError) {
  SyncPoint::GetInstance()->EnableProcessing();
  s = Flush();
  ASSERT_EQ(s.severity(), ROCKSDB_NAMESPACE::Status::Severity::kHardError);
-  ASSERT_FALSE(dbfull()->TEST_GetFilesToQuarantine().empty());
  fault_fs_->SetFilesystemActive(true);

  // This Resume() will attempt to create a new manifest file and fail again
  s = dbfull()->Resume();
  ASSERT_EQ(s.severity(), ROCKSDB_NAMESPACE::Status::Severity::kHardError);
-  ASSERT_FALSE(dbfull()->TEST_GetFilesToQuarantine().empty());
  fault_fs_->SetFilesystemActive(true);
  SyncPoint::GetInstance()->ClearAllCallBacks();
  SyncPoint::GetInstance()->DisableProcessing();
@@ -861,7 +848,6 @@ TEST_F(DBErrorHandlingFSTest, DoubleManifestWriteError) {

  new_manifest = GetManifestNameFromLiveFiles();
  ASSERT_NE(new_manifest, old_manifest);
-  ASSERT_TRUE(dbfull()->TEST_GetFilesToQuarantine().empty());

  Reopen(options);
  ASSERT_EQ("val", Get(Key(0)));
@@ -874,8 +860,8 @@ TEST_F(DBErrorHandlingFSTest, CompactionManifestWriteError) {
    ROCKSDB_GTEST_SKIP("Test requires non-mock environment");
    return;
  }
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -928,7 +914,6 @@ TEST_F(DBErrorHandlingFSTest, CompactionManifestWriteError) {
  fault_fs_->SetFilesystemActive(true);
  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->ClearAllCallBacks();
  TEST_SYNC_POINT("CompactionManifestWriteError:1");
-  ASSERT_FALSE(dbfull()->TEST_GetFilesToQuarantine().empty());
  TEST_SYNC_POINT("CompactionManifestWriteError:2");

  s = dbfull()->TEST_WaitForCompact();
@@ -937,7 +922,6 @@ TEST_F(DBErrorHandlingFSTest, CompactionManifestWriteError) {

  new_manifest = GetManifestNameFromLiveFiles();
  ASSERT_NE(new_manifest, old_manifest);
-  ASSERT_TRUE(dbfull()->TEST_GetFilesToQuarantine().empty());
  Reopen(options);
  ASSERT_EQ("val", Get(Key(0)));
  ASSERT_EQ("val", Get(Key(1)));
@@ -946,8 +930,8 @@ TEST_F(DBErrorHandlingFSTest, CompactionManifestWriteError) {
 }

 TEST_F(DBErrorHandlingFSTest, CompactionManifestWriteRetryableError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -996,7 +980,6 @@ TEST_F(DBErrorHandlingFSTest, CompactionManifestWriteRetryableError) {
  ASSERT_OK(s);

  TEST_SYNC_POINT("CompactionManifestWriteError:0");
-  ASSERT_FALSE(dbfull()->TEST_GetFilesToQuarantine().empty());
  TEST_SYNC_POINT("CompactionManifestWriteError:1");

  s = dbfull()->TEST_WaitForCompact();
@@ -1010,7 +993,6 @@ TEST_F(DBErrorHandlingFSTest, CompactionManifestWriteRetryableError) {

  new_manifest = GetManifestNameFromLiveFiles();
  ASSERT_NE(new_manifest, old_manifest);
-  ASSERT_TRUE(dbfull()->TEST_GetFilesToQuarantine().empty());

  Reopen(options);
  ASSERT_EQ("val", Get(Key(0)));
@@ -1020,8 +1002,8 @@ TEST_F(DBErrorHandlingFSTest, CompactionManifestWriteRetryableError) {
 }

 TEST_F(DBErrorHandlingFSTest, CompactionWriteError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -1062,8 +1044,8 @@ TEST_F(DBErrorHandlingFSTest, CompactionWriteError) {
 }

 TEST_F(DBErrorHandlingFSTest, DISABLED_CompactionWriteRetryableError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -1109,8 +1091,8 @@ TEST_F(DBErrorHandlingFSTest, DISABLED_CompactionWriteRetryableError) {
 }

 TEST_F(DBErrorHandlingFSTest, DISABLED_CompactionWriteFileScopeError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -1201,8 +1183,8 @@ TEST_F(DBErrorHandlingFSTest, AutoRecoverFlushError) {
    ROCKSDB_GTEST_SKIP("Test requires non-mock environment");
    return;
  }
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -1246,8 +1228,8 @@ TEST_F(DBErrorHandlingFSTest, AutoRecoverFlushError) {
 }

 TEST_F(DBErrorHandlingFSTest, FailRecoverFlushError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -1275,8 +1257,8 @@ TEST_F(DBErrorHandlingFSTest, WALWriteError) {
    ROCKSDB_GTEST_SKIP("Test requires non-mock environment");
    return;
  }
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -1348,8 +1330,8 @@ TEST_F(DBErrorHandlingFSTest, WALWriteError) {
 }

 TEST_F(DBErrorHandlingFSTest, WALWriteRetryableError) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -1443,8 +1425,8 @@ TEST_F(DBErrorHandlingFSTest, MultiCFWALWriteError) {
    ROCKSDB_GTEST_SKIP("Test requires non-mock environment");
    return;
  }
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -1775,10 +1757,10 @@ TEST_F(DBErrorHandlingFSTest, MultiDBVariousErrors) {
 // to soft error and trigger auto resume. During auto resume, SwitchMemtable
 // is disabled to avoid small SST tables. Write can still be applied before
 // the bg error is cleaned unless the memtable is full.
-TEST_F(DBErrorHandlingFSTest, FlushWritNoWALRetryableErrorAutoRecover1) {
+TEST_F(DBErrorHandlingFSTest, FLushWritNoWALRetryableErrorAutoRecover1) {
  // Activate the FS before the first resume
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -1799,7 +1781,7 @@ TEST_F(DBErrorHandlingFSTest, FlushWritNoWALRetryableErrorAutoRecover1) {
  ASSERT_OK(Put(Key(1), "val1", wo));
  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->LoadDependency(
      {{"RecoverFromRetryableBGIOError:LoopOut",
-        "FlushWritNoWALRetryableeErrorAutoRecover1:1"}});
+        "FLushWritNoWALRetryableeErrorAutoRecover1:1"}});
  SyncPoint::GetInstance()->SetCallBack(
      "BuildTable:BeforeFinishBuildTable",
      [&](void*) { fault_fs_->SetFilesystemActive(false, error_msg); });
@@ -1808,7 +1790,7 @@ TEST_F(DBErrorHandlingFSTest, FlushWritNoWALRetryableErrorAutoRecover1) {
  s = Flush();
  ASSERT_EQ("val1", Get(Key(1)));
  ASSERT_EQ(s.severity(), ROCKSDB_NAMESPACE::Status::Severity::kSoftError);
-  TEST_SYNC_POINT("FlushWritNoWALRetryableeErrorAutoRecover1:1");
+  TEST_SYNC_POINT("FLushWritNoWALRetryableeErrorAutoRecover1:1");
  ASSERT_EQ("val1", Get(Key(1)));
  ASSERT_EQ("val1", Get(Key(1)));
  SyncPoint::GetInstance()->DisableProcessing();
@@ -1845,94 +1827,10 @@ TEST_F(DBErrorHandlingFSTest, FlushWritNoWALRetryableErrorAutoRecover1) {
  Destroy(options);
 }

-TEST_F(DBErrorHandlingFSTest, MultipleRecoveryThreads) {
-  // This test creates a scenario where second write's recovery can get started
-  // while mutex is released for a short period during
-  // NotifyOnErrorRecoveryEnd() from the first write's recovery. This is to make
-  // sure RecoverFromRetryableBGIOError() from the second write's recovery
-  // thread does not start with recovery_in_prog_ = false;
-
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
-  Options options = GetDefaultOptions();
-  options.env = fault_env_.get();
-  options.create_if_missing = true;
-  options.listeners.emplace_back(listener);
-  options.max_bgerror_resume_count = 100;
-  options.bgerror_resume_retry_interval = 1000000;  // 1 second
-  options.statistics = CreateDBStatistics();
-
-  listener->EnableAutoRecovery(false);
-  DestroyAndReopen(options);
-
-  IOStatus error_msg = IOStatus::IOError("Retryable IO Error");
-  error_msg.SetRetryable(true);
-
-  WriteOptions wo = WriteOptions();
-  wo.disableWAL = true;
-  fault_fs_->SetFilesystemActive(false, error_msg);
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->LoadDependency(
-      {{"NotifyOnErrorRecoveryEnd:MutexUnlocked:1",
-        "MultipleRecoveryThreads:1"},
-       {"MultipleRecoveryThreads:2",
-        "NotifyOnErrorRecoveryEnd:MutexUnlocked:2"},
-       {"StartRecoverFromRetryableBGIOError:BeforeWaitingForOtherThread",
-        "MultipleRecoveryThreads:3"},
-       {"RecoverFromRetryableBGIOError:RecoverSuccess",
-        "MultipleRecoveryThreads:4"},
-       {"MultipleRecoveryThreads:4",
-        "StartRecoverFromRetryableBGIOError:AfterWaitingForOtherThread"}});
-  SyncPoint::GetInstance()->EnableProcessing();
-
-  // First write with read fault injected and recovery will start
-  {
-    ASSERT_OK(Put(Key(1), "val1", wo));
-    Status s = Flush();
-    ASSERT_NOK(s);
-  }
-  // Remove read fault injection so that first recovery can go through
-  fault_fs_->SetFilesystemActive(true);
-
-  // At this point, first recovery is now at NotifyOnErrorRecoveryEnd. Mutex is
-  // released.
-  TEST_SYNC_POINT("MultipleRecoveryThreads:1");
-
-  ROCKSDB_NAMESPACE::port::Thread second_write([&] {
-    // Second write with read fault injected
-    fault_fs_->SetFilesystemActive(false, error_msg);
-    ASSERT_OK(Put(Key(2), "val2", wo));
-    Status s = Flush();
-    ASSERT_NOK(s);
-  });
-  // Second bg thread before waiting for the first thread's recovery thread
-  TEST_SYNC_POINT("MultipleRecoveryThreads:3");
-  // First thread's recovery thread continues
-  TEST_SYNC_POINT("MultipleRecoveryThreads:2");
-  // Wait for the first thread's recovery to finish
-  // (this sets recovery_in_prog_ = false)
-  // And second thread continues and starts recovery thread
-  TEST_SYNC_POINT("MultipleRecoveryThreads:4");
-  second_write.join();
-  // Remove error injection so that second thread recovery can go through
-  fault_fs_->SetFilesystemActive(true);
-
-  // Set up sync point so that we can wait for the recovery thread to finish
-  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->LoadDependency(
-      {{"RecoverFromRetryableBGIOError:RecoverSuccess",
-        "MultipleRecoveryThreads:6"}});
-
-  // Wait for the second thread's recovery to be done
-  TEST_SYNC_POINT("MultipleRecoveryThreads:6");
-
-  SyncPoint::GetInstance()->DisableProcessing();
-  SyncPoint::GetInstance()->ClearAllCallBacks();
-  Destroy(options);
-}
-
-TEST_F(DBErrorHandlingFSTest, FlushWritNoWALRetryableErrorAutoRecover2) {
+TEST_F(DBErrorHandlingFSTest, FLushWritNoWALRetryableErrorAutoRecover2) {
  // Activate the FS before the first resume
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -1990,10 +1888,10 @@ TEST_F(DBErrorHandlingFSTest, FlushWritNoWALRetryableErrorAutoRecover2) {

 // Auto resume fromt the flush retryable IO error. Activate the FS before the
 // first resume. Resume is successful
-TEST_F(DBErrorHandlingFSTest, FlushWritRetryableErrorAutoRecover1) {
+TEST_F(DBErrorHandlingFSTest, FLushWritRetryableErrorAutoRecover1) {
  // Activate the FS before the first resume
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2032,10 +1930,10 @@ TEST_F(DBErrorHandlingFSTest, FlushWritRetryableErrorAutoRecover1) {

 // Auto resume fromt the flush retryable IO error and set the retry limit count.
 // Never activate the FS and auto resume should fail at the end
-TEST_F(DBErrorHandlingFSTest, FlushWritRetryableErrorAutoRecover2) {
+TEST_F(DBErrorHandlingFSTest, FLushWritRetryableErrorAutoRecover2) {
  // Fail all the resume and let user to resume
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2052,18 +1950,18 @@ TEST_F(DBErrorHandlingFSTest, FlushWritRetryableErrorAutoRecover2) {

  ASSERT_OK(Put(Key(1), "val1"));
  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->LoadDependency(
-      {{"FlushWritRetryableeErrorAutoRecover2:0",
+      {{"FLushWritRetryableeErrorAutoRecover2:0",
        "RecoverFromRetryableBGIOError:BeforeStart"},
       {"RecoverFromRetryableBGIOError:LoopOut",
-        "FlushWritRetryableeErrorAutoRecover2:1"}});
+        "FLushWritRetryableeErrorAutoRecover2:1"}});
  SyncPoint::GetInstance()->SetCallBack(
      "BuildTable:BeforeFinishBuildTable",
      [&](void*) { fault_fs_->SetFilesystemActive(false, error_msg); });
  SyncPoint::GetInstance()->EnableProcessing();
  s = Flush();
  ASSERT_EQ(s.severity(), ROCKSDB_NAMESPACE::Status::Severity::kSoftError);
-  TEST_SYNC_POINT("FlushWritRetryableeErrorAutoRecover2:0");
-  TEST_SYNC_POINT("FlushWritRetryableeErrorAutoRecover2:1");
+  TEST_SYNC_POINT("FLushWritRetryableeErrorAutoRecover2:0");
+  TEST_SYNC_POINT("FLushWritRetryableeErrorAutoRecover2:1");
  fault_fs_->SetFilesystemActive(true);
  ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->ClearAllCallBacks();
  SyncPoint::GetInstance()->DisableProcessing();
@@ -2085,8 +1983,8 @@ TEST_F(DBErrorHandlingFSTest, FlushWritRetryableErrorAutoRecover2) {
 // Fail the first resume and let the second resume be successful.
 TEST_F(DBErrorHandlingFSTest, ManifestWriteRetryableErrorAutoRecover) {
  // Fail the first resume and let the second resume be successful
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2138,8 +2036,8 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteRetryableErrorAutoRecover) {

 TEST_F(DBErrorHandlingFSTest, ManifestWriteNoWALRetryableErrorAutoRecover) {
  // Fail the first resume and let the second resume be successful
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2193,8 +2091,8 @@ TEST_F(DBErrorHandlingFSTest, ManifestWriteNoWALRetryableErrorAutoRecover) {

 TEST_F(DBErrorHandlingFSTest,
       CompactionManifestWriteRetryableErrorAutoRecover) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2283,8 +2181,8 @@ TEST_F(DBErrorHandlingFSTest, CompactionWriteRetryableErrorAutoRecover) {
  // compaction, the FS is set to active and compaction is successful, so
  // the test will hit the CompactionJob::FinishCompactionOutputFile1 sync
  // point.
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2337,8 +2235,8 @@ TEST_F(DBErrorHandlingFSTest, CompactionWriteRetryableErrorAutoRecover) {
 }

 TEST_F(DBErrorHandlingFSTest, WALWriteRetryableErrorAutoRecover1) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2440,8 +2338,8 @@ TEST_F(DBErrorHandlingFSTest, WALWriteRetryableErrorAutoRecover1) {

 TEST_F(DBErrorHandlingFSTest, WALWriteRetryableErrorAutoRecover2) {
  // Fail the first recover and try second time.
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2541,10 +2439,10 @@ TEST_F(DBErrorHandlingFSTest, WALWriteRetryableErrorAutoRecover2) {

 // Fail auto resume from a flush retryable error and verify that
 // OnErrorRecoveryEnd listener callback is called
-TEST_F(DBErrorHandlingFSTest, FlushWritRetryableErrorAbortRecovery) {
+TEST_F(DBErrorHandlingFSTest, FLushWritRetryableErrorAbortRecovery) {
  // Activate the FS before the first resume
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2575,59 +2473,6 @@ TEST_F(DBErrorHandlingFSTest, FlushWritRetryableErrorAbortRecovery) {
  Destroy(options);
 }

-TEST_F(DBErrorHandlingFSTest, FlushErrorRecoveryRaceWithDBDestruction) {
-  Options options = GetDefaultOptions();
-  options.env = fault_env_.get();
-  options.create_if_missing = true;
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
-  options.listeners.emplace_back(listener);
-  DestroyAndReopen(options);
-  ASSERT_OK(Put("k1", "val"));
-
-  // Inject retryable flush error
-  bool error_set = false;
-  SyncPoint::GetInstance()->SetCallBack(
-      "BuildTable:BeforeOutputValidation", [&](void*) {
-        if (error_set) {
-          return;
-        }
-        IOStatus st = IOStatus::IOError("Injected");
-        st.SetRetryable(true);
-        fault_fs_->SetFilesystemActive(false, st);
-        error_set = true;
-      });
-
-  port::Thread db_close_thread;
-  SyncPoint::GetInstance()->SetCallBack(
-      "BuildTable:BeforeDeleteFile", [&](void*) {
-        // Clear retryable flush error injection
-        fault_fs_->SetFilesystemActive(true);
-
-        // Coerce race between ending auto recovery in db destruction and flush
-        // error recovery
-        ROCKSDB_NAMESPACE::SyncPoint::GetInstance()->LoadDependency(
-            {{"PostEndAutoRecovery", "FlushJob::WriteLevel0Table"}});
-        db_close_thread = port::Thread([&] { Close(); });
-      });
-  SyncPoint::GetInstance()->EnableProcessing();
-
-  Status s = Flush();
-  ASSERT_NOK(s);
-
-  int placeholder = 1;
-  listener->WaitForRecovery(placeholder);
-  ASSERT_TRUE(listener->new_bg_error().IsShutdownInProgress());
-
-  // Prior to the fix, the db close will crash due to the recovery thread for
-  // flush error is not joined by the time of destruction.
-  db_close_thread.join();
-
-  SyncPoint::GetInstance()->DisableProcessing();
-  SyncPoint::GetInstance()->ClearAllCallBacks();
-  Destroy(options);
-}
-
 TEST_F(DBErrorHandlingFSTest, FlushReadError) {
  std::shared_ptr<ErrorHandlerFSListener> listener =
      std::make_shared<ErrorHandlerFSListener>();
@@ -2835,9 +2680,9 @@ TEST_F(DBErrorHandlingFSTest, CompactionReadRetryableErrorAutoRecover) {
 class DBErrorHandlingFencingTest : public DBErrorHandlingFSTest,
                                   public testing::WithParamInterface<bool> {};

-TEST_P(DBErrorHandlingFencingTest, FlushWriteFenced) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+TEST_P(DBErrorHandlingFencingTest, FLushWriteFenced) {
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2864,8 +2709,8 @@ TEST_P(DBErrorHandlingFencingTest, FlushWriteFenced) {
 }

 TEST_P(DBErrorHandlingFencingTest, ManifestWriteFenced) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2899,8 +2744,8 @@ TEST_P(DBErrorHandlingFencingTest, ManifestWriteFenced) {
 }

 TEST_P(DBErrorHandlingFencingTest, CompactionWriteFenced) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -2940,8 +2785,8 @@ TEST_P(DBErrorHandlingFencingTest, CompactionWriteFenced) {
 }

 TEST_P(DBErrorHandlingFencingTest, WALWriteFenced) {
-  std::shared_ptr<ErrorHandlerFSListener> listener =
-      std::make_shared<ErrorHandlerFSListener>();
+  std::shared_ptr<ErrorHandlerFSListener> listener(
+      new ErrorHandlerFSListener());
  Options options = GetDefaultOptions();
  options.env = fault_env_.get();
  options.create_if_missing = true;
@@ -230,8 +230,6 @@ void EventHelpers::NotifyOnErrorRecoveryEnd(
    db_mutex->AssertHeld();
    // release lock while notifying events
    db_mutex->Unlock();
-    TEST_SYNC_POINT("NotifyOnErrorRecoveryEnd:MutexUnlocked:1");
-    TEST_SYNC_POINT("NotifyOnErrorRecoveryEnd:MutexUnlocked:2");
    for (auto& listener : listeners) {
      BackgroundErrorRecoveryInfo info;
      info.old_bg_error = old_bg_error;
@@ -1548,11 +1548,6 @@ TEST_F(ExternalSSTFileBasicTest, RangeDeletionEndComesBeforeStart) {
 }

 TEST_P(ExternalSSTFileBasicTest, IngestFileWithBadBlockChecksum) {
-  bool verify_checksums_before_ingest = std::get<1>(GetParam());
-  if (!verify_checksums_before_ingest) {
-    ROCKSDB_GTEST_BYPASS("Bypassing test when !verify_checksums_before_ingest");
-    return;
-  }
  bool change_checksum_called = false;
  const auto& change_checksum = [&](void* arg) {
    if (!change_checksum_called) {
@@ -1570,20 +1565,24 @@ TEST_P(ExternalSSTFileBasicTest, IngestFileWithBadBlockChecksum) {
  SyncPoint::GetInstance()->EnableProcessing();
  int file_id = 0;
  bool write_global_seqno = std::get<0>(GetParam());
+  bool verify_checksums_before_ingest = std::get<1>(GetParam());
  do {
    Options options = CurrentOptions();
    DestroyAndReopen(options);
    std::map<std::string, std::string> true_data;
    Status s = GenerateAndAddExternalFile(
        options, {1, 2, 3, 4, 5, 6}, ValueType::kTypeValue, file_id++,
-        write_global_seqno, /*verify_checksums_before_ingest=*/true,
-        &true_data);
-    ASSERT_NOK(s);
+        write_global_seqno, verify_checksums_before_ingest, &true_data);
+    if (verify_checksums_before_ingest) {
+      ASSERT_NOK(s);
+    } else {
+      ASSERT_OK(s);
+    }
    change_checksum_called = false;
  } while (ChangeOptionsForFileIngestionTest());
 }

-TEST_P(ExternalSSTFileBasicTest, IngestFileWithCorruptedDataBlock) {
+TEST_P(ExternalSSTFileBasicTest, IngestFileWithFirstByteTampered) {
  if (!random_rwfile_supported_) {
    ROCKSDB_GTEST_SKIP("Test requires NewRandomRWFile support");
    return;
@@ -1591,21 +1590,15 @@ TEST_P(ExternalSSTFileBasicTest, IngestFileWithCorruptedDataBlock) {
  SyncPoint::GetInstance()->DisableProcessing();
  int file_id = 0;
  EnvOptions env_options;
-  Random rnd(301);
  do {
    Options options = CurrentOptions();
-    options.compression = kNoCompression;
-    BlockBasedTableOptions table_options;
-    table_options.block_size = 4 * 1024;
-    options.table_factory.reset(NewBlockBasedTableFactory(table_options));
    std::string file_path = sst_files_dir_ + std::to_string(file_id++);
    SstFileWriter sst_file_writer(env_options, options);
    Status s = sst_file_writer.Open(file_path);
    ASSERT_OK(s);
-    // This should write more than 2 data blocks.
    for (int i = 0; i != 100; ++i) {
      std::string key = Key(i);
-      std::string value = rnd.RandomString(200);
+      std::string value = Key(i) + std::to_string(0);
      ASSERT_OK(sst_file_writer.Put(key, value));
    }
    ASSERT_OK(sst_file_writer.Finish());
@@ -1616,11 +1609,11 @@ TEST_P(ExternalSSTFileBasicTest, IngestFileWithCorruptedDataBlock) {
      ASSERT_GT(file_size, 8);
      std::unique_ptr<RandomRWFile> rwfile;
      ASSERT_OK(env_->NewRandomRWFile(file_path, &rwfile, EnvOptions()));
-      // Corrupt the second data block.
-      // We need to corrupt a non-first and non-last data block
-      // since we access them to get smallest and largest internal
-      // key in the file in GetIngestedFileInfo().
-      const uint64_t offset = 5000;
+      // Manually corrupt the file
+      // We deterministically corrupt the first byte because we currently
+      // cannot choose a random offset. The reason for this limitation is that
+      // we do not checksum property block at present.
+      const uint64_t offset = 0;
      char scratch[8] = {0};
      Slice buf;
      ASSERT_OK(rwfile->Read(offset, sizeof(scratch), &buf, scratch));
@@ -769,6 +769,8 @@ Status ExternalSstFileIngestionJob::GetIngestedFileInfo(
  std::unique_ptr<InternalIterator> iter(table_reader->NewIterator(
      ro, sv->mutable_cf_options.prefix_extractor.get(), /*arena=*/nullptr,
      /*skip_filters=*/false, TableReaderCaller::kExternalSSTIngestion));
+  std::unique_ptr<InternalIterator> range_del_iter(
+      table_reader->NewRangeTombstoneIterator(ro));

  // Get first (smallest) and last (largest) key from file.
  file_to_ingest->smallest_internal_key =
@@ -790,33 +792,8 @@ Status ExternalSstFileIngestionJob::GetIngestedFileInfo(
    }
    file_to_ingest->smallest_internal_key.SetFrom(key);

-    Slice largest;
-    if (strcmp(cfd_->ioptions()->table_factory->Name(), "PlainTable") == 0) {
-      // PlainTable iterator does not support SeekToLast().
-      largest = iter->key();
-      for (; iter->Valid(); iter->Next()) {
-        if (cfd_->internal_comparator().Compare(iter->key(), largest) > 0) {
-          largest = iter->key();
-        }
-      }
-      if (!iter->status().ok()) {
-        return iter->status();
-      }
-    } else {
-      iter->SeekToLast();
-      if (!iter->Valid()) {
-        if (iter->status().ok()) {
-          // The file contains at least 1 key since iter is valid after
-          // SeekToFirst().
-          return Status::Corruption("Can not find largest key in sst file");
-        } else {
-          return iter->status();
-        }
-      }
-      largest = iter->key();
-    }
-
-    pik_status = ParseInternalKey(largest, &key, allow_data_in_errors);
+    iter->SeekToLast();
+    pik_status = ParseInternalKey(iter->key(), &key, allow_data_in_errors);
    if (!pik_status.ok()) {
      return Status::Corruption("Corrupted key in external file. ",
                                pik_status.getState());
@@ -827,12 +804,8 @@ Status ExternalSstFileIngestionJob::GetIngestedFileInfo(
    file_to_ingest->largest_internal_key.SetFrom(key);

    bounds_set = true;
-  } else if (!iter->status().ok()) {
-    return iter->status();
  }

-  std::unique_ptr<InternalIterator> range_del_iter(
-      table_reader->NewRangeTombstoneIterator(ro));
  // We may need to adjust these key bounds, depending on whether any range
  // deletion tombstones extend past them.
  const Comparator* ucmp = cfd_->internal_comparator().user_comparator();
@@ -2623,7 +2623,6 @@ TEST_P(ExternalSSTFileTest,
      "AfterRead");
  ingest_thread.join();
  for (auto* iter : iters) {
-    ASSERT_OK(iter->status());
    delete iter;
  }
  iters.clear();
@@ -100,7 +100,7 @@ FlushJob::FlushJob(
    Statistics* stats, EventLogger* event_logger, bool measure_io_stats,
    const bool sync_output_directory, const bool write_manifest,
    Env::Priority thread_pri, const std::shared_ptr<IOTracer>& io_tracer,
-    const SeqnoToTimeMapping& seqno_to_time_mapping, const std::string& db_id,
+    const SeqnoToTimeMapping& seqno_time_mapping, const std::string& db_id,
    const std::string& db_session_id, std::string full_history_ts_low,
    BlobFileCompletionCallback* blob_callback)
    : dbname_(dbname),
@@ -136,7 +136,7 @@ FlushJob::FlushJob(
      clock_(db_options_.clock),
      full_history_ts_low_(std::move(full_history_ts_low)),
      blob_callback_(blob_callback),
-      db_impl_seqno_to_time_mapping_(seqno_to_time_mapping) {
+      db_impl_seqno_time_mapping_(seqno_time_mapping) {
  // Update the thread status to indicate flush.
  ReportStartedFlush();
  TEST_SYNC_POINT("FlushJob::FlushJob()");
@@ -851,11 +851,10 @@ Status FlushJob::WriteLevel0Table() {
  Status s;

  SequenceNumber smallest_seqno = mems_.front()->GetEarliestSequenceNumber();
-  if (!db_impl_seqno_to_time_mapping_.Empty()) {
-    // make a local copy, as the seqno_to_time_mapping from db_impl is not
-    // thread safe, which will be used while not holding the db_mutex.
-    seqno_to_time_mapping_ =
-        db_impl_seqno_to_time_mapping_.Copy(smallest_seqno);
+  if (!db_impl_seqno_time_mapping_.Empty()) {
+    // make a local copy, as the seqno_time_mapping from db_impl is not thread
+    // safe, which will be used while not holding the db_mutex.
+    seqno_to_time_mapping_ = db_impl_seqno_time_mapping_.Copy(smallest_seqno);
  }

  std::vector<BlobFileAddition> blob_file_additions;
@@ -210,9 +210,9 @@ class FlushJob {
  const std::string full_history_ts_low_;
  BlobFileCompletionCallback* blob_callback_;

-  // reference to the seqno_to_time_mapping_ in db_impl.h, not safe to read
-  // without db mutex
-  const SeqnoToTimeMapping& db_impl_seqno_to_time_mapping_;
+  // reference to the seqno_time_mapping_ in db_impl.h, not safe to read without
+  // db mutex
+  const SeqnoToTimeMapping& db_impl_seqno_time_mapping_;
  SeqnoToTimeMapping seqno_to_time_mapping_;

  // Keeps track of the newest user-defined timestamp for this flush job if
@@ -127,12 +127,11 @@ class FlushJobTestBase : public testing::Test {
      column_families.emplace_back(cf_name, cf_options_);
    }

-    versions_.reset(new VersionSet(
-        dbname_, &db_options_, env_options_, table_cache_.get(),
-        &write_buffer_manager_, &write_controller_,
-        /*block_cache_tracer=*/nullptr, /*io_tracer=*/nullptr,
-        /*db_id=*/"", /*db_session_id=*/"", /*daily_offpeak_time_utc=*/"",
-        /*error_handler=*/nullptr));
+    versions_.reset(
+        new VersionSet(dbname_, &db_options_, env_options_, table_cache_.get(),
+                       &write_buffer_manager_, &write_controller_,
+                       /*block_cache_tracer=*/nullptr, /*io_tracer=*/nullptr,
+                       /*db_id*/ "", /*db_session_id*/ ""));
    EXPECT_OK(versions_->Recover(column_families, false));
  }

@@ -458,8 +457,7 @@ TEST_F(FlushJobTest, FlushMemtablesMultipleColumnFamilies) {
    // Verify that imm is empty
    ASSERT_EQ(std::numeric_limits<uint64_t>::max(),
              all_cfds[k]->imm()->GetEarliestMemTableID());
-    ASSERT_EQ(0, all_cfds[k]->imm()->GetLatestMemTableID(
-                     false /* for_atomic_flush */));
+    ASSERT_EQ(0, all_cfds[k]->imm()->GetLatestMemTableID());
    ++k;
  }

@@ -186,8 +186,7 @@ Status ImportColumnFamilyJob::Run() {
      cfd_->NumberLevels(), cfd_->ioptions()->compaction_style,
      nullptr /* src_vstorage */, cfd_->ioptions()->force_consistency_checks,
      EpochNumberRequirement::kMightMissing, cfd_->ioptions()->clock,
-      cfd_->GetLatestMutableCFOptions()->bottommost_file_compaction_delay,
-      cfd_->current()->version_set()->offpeak_time_option());
+      cfd_->GetLatestMutableCFOptions()->bottommost_file_compaction_delay);
  Status s;

  for (size_t i = 0; s.ok() && i < files_to_import_.size(); ++i) {
@@ -366,35 +365,9 @@ Status ImportColumnFamilyJob::GetIngestedFileInfo(
    bool bound_set = false;
    if (iter->Valid()) {
      file_to_import->smallest_internal_key.DecodeFrom(iter->key());
-      Slice largest;
-      if (strcmp(cfd_->ioptions()->table_factory->Name(), "PlainTable") == 0) {
-        // PlainTable iterator does not support SeekToLast().
-        largest = iter->key();
-        for (; iter->Valid(); iter->Next()) {
-          if (cfd_->internal_comparator().Compare(iter->key(), largest) > 0) {
-            largest = iter->key();
-          }
-        }
-        if (!iter->status().ok()) {
-          return iter->status();
-        }
-      } else {
-        iter->SeekToLast();
-        if (!iter->Valid()) {
-          if (iter->status().ok()) {
-            // The file contains at least 1 key since iter is valid after
-            // SeekToFirst().
-            return Status::Corruption("Can not find largest key in sst file");
-          } else {
-            return iter->status();
-          }
-        }
-        largest = iter->key();
-      }
-      file_to_import->largest_internal_key.DecodeFrom(largest);
+      iter->SeekToLast();
+      file_to_import->largest_internal_key.DecodeFrom(iter->key());
      bound_set = true;
-    } else if (!iter->status().ok()) {
-      return iter->status();
    }

    std::unique_ptr<InternalIterator> range_del_iter{
@@ -456,4 +429,4 @@ Status ImportColumnFamilyJob::GetIngestedFileInfo(

  return status;
 }
-}  // namespace ROCKSDB_NAMESPACE
+}  // namespace ROCKSDB_NAMESPACE
@@ -326,7 +326,7 @@ TEST_F(ImportColumnFamilyTest, ImportSSTFileWriterFilesWithRangeTombstone) {
  const SstFileMetaData* file_meta = nullptr;
  for (const auto& level_meta : import_cf_meta.levels) {
    if (!level_meta.files.empty()) {
-      file_meta = level_meta.files.data();
+      file_meta = &(level_meta.files[0]);
      break;
    }
  }
@@ -389,7 +389,7 @@ TEST_F(ImportColumnFamilyTest, ImportExportedSSTFromAnotherCF) {
                                              *metadata_ptr_, &import_cfh2_));
  ASSERT_NE(import_cfh2_, nullptr);
  delete metadata_ptr_;
-  metadata_ptr_ = nullptr;
+  metadata_ptr_ = NULL;

  std::string value1, value2;

@@ -15,7 +15,6 @@
 #include "db/column_family.h"
 #include "db/log_writer.h"
 #include "db/version_set.h"
-#include "util/autovector.h"

 namespace ROCKSDB_NAMESPACE {

@@ -171,16 +170,6 @@ struct JobContext {
  // will be reused later
  std::vector<uint64_t> log_recycle_files;

-  // Files quarantined from deletion. This list contains file numbers for files
-  // that are in an ambiguous states. This includes newly generated SST files
-  // and blob files from flush and compaction job whose VersionEdits' persist
-  // state in Manifest are unclear. An old manifest file whose immediately
-  // following new manifest file's CURRENT file creation is in an unclear state.
-  // WAL logs don't have this premature deletion risk since
-  // min_log_number_to_keep is only updated after successful manifest commits.
-  // So this data structure doesn't track log files.
-  autovector<uint64_t> files_to_quarantine;
-
  // a list of manifest files that we need to delete
  std::vector<std::string> manifest_delete_files;