mirror of
https://github.com/facebook/rocksdb.git
synced 2026-10-23 08:09:02 +03:00
df90749560
Summary: Pull Request resolved: https://github.com/facebook/rocksdb/pull/15344 Add the internal TableBuilder::TryAdd() contract so RocksDB-owned table builders can distinguish accepted rows, real builder errors, and clean requests to cut the current output table and retry the same row. Add diagnostic reason codes for retryable table boundaries; existing internal table builders inherit a default TryAdd() implementation that forwards to Add(). Translate the public ExternalTableBuilderBase::TryAdd() result in ExternalTableBuilderAdapter so external table implementations can request a file cut while RocksDB compaction uses the internal TableBuilder contract. Teach compaction output writing to honor kRequiresNewTable by closing the current output file, opening a new one through the existing callbacks, and retrying the same key without advancing the input iterator. Split OutputValidator validation into CanAdd() and AddValidated() so validator state is not updated until the key is actually accepted by a table builder. Add a DB compaction test with a custom TableFactory that wraps block-based tables and requests one mid-compaction file cut. The test verifies the cut produces two readable output files and preserves all key/value results. Reviewed By: jaykorean, xingbowang Differential Revision: D123932406 fbshipit-source-id: 9ed82c3782787de192bca15e40bfbf014ef28c15
53 lines
1.9 KiB
C++
53 lines
1.9 KiB
C++
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
|
// This source code is licensed under both the GPLv2 (found in the
|
|
// COPYING file in the root directory) and Apache 2.0 License
|
|
// (found in the LICENSE.Apache file in the root directory).
|
|
//
|
|
#pragma once
|
|
#include "db/dbformat.h"
|
|
#include "rocksdb/slice.h"
|
|
#include "rocksdb/status.h"
|
|
|
|
namespace ROCKSDB_NAMESPACE {
|
|
// A class that validates key/value that is inserted to an SST file.
|
|
// Pass every key/value of the file using OutputValidator::Add()
|
|
// and the class validates key order and optionally calculate a hash
|
|
// of all the key and value.
|
|
class OutputValidator {
|
|
public:
|
|
explicit OutputValidator(const InternalKeyComparator& icmp, bool enable_hash,
|
|
uint64_t precalculated_hash = 0)
|
|
: icmp_(icmp),
|
|
paranoid_hash_(precalculated_hash),
|
|
enable_hash_(enable_hash) {}
|
|
|
|
// Add a key to the KV sequence, and return whether the key follows
|
|
// criteria, e.g. key is ordered.
|
|
Status Add(const Slice& key, const Slice& value);
|
|
|
|
// Add a key that has already been checked with CanAdd().
|
|
void AddValidated(const Slice& key, const Slice& value);
|
|
|
|
// Validate whether Add() would accept this key without updating the
|
|
// validator state.
|
|
Status CanAdd(const Slice& key) const;
|
|
|
|
// Compare result of two key orders are the same. It can be used
|
|
// to compare the keys inserted into a file, and what is read back.
|
|
// Return true if the validation passes.
|
|
bool CompareValidator(const OutputValidator& other_validator) {
|
|
return GetHash() == other_validator.GetHash();
|
|
}
|
|
|
|
// Not (yet) intended to be persisted, so subject to change
|
|
// without notice between releases.
|
|
uint64_t GetHash() const { return paranoid_hash_; }
|
|
|
|
private:
|
|
const InternalKeyComparator& icmp_;
|
|
std::string prev_key_;
|
|
uint64_t paranoid_hash_ = 0;
|
|
bool enable_hash_;
|
|
};
|
|
} // namespace ROCKSDB_NAMESPACE
|