fork of https://github.com/oxigraph/rocksdb and https://github.com/facebook/rocksdb for nextgraph and oxigraph
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
100 lines
3.0 KiB
100 lines
3.0 KiB
// Copyright (c) 2014, Facebook, Inc. All rights reserved.
|
|
// This source code is licensed under the BSD-style license found in the
|
|
// LICENSE file in the root directory of this source tree. An additional grant
|
|
// of patent rights can be found in the PATENTS file in the same directory.
|
|
|
|
#include "table/full_filter_block.h"
|
|
|
|
#include "rocksdb/filter_policy.h"
|
|
#include "port/port.h"
|
|
#include "util/coding.h"
|
|
|
|
namespace rocksdb {
|
|
|
|
FullFilterBlockBuilder::FullFilterBlockBuilder(
|
|
const SliceTransform* prefix_extractor, bool whole_key_filtering,
|
|
FilterBitsBuilder* filter_bits_builder)
|
|
: prefix_extractor_(prefix_extractor),
|
|
whole_key_filtering_(whole_key_filtering),
|
|
num_added_(0) {
|
|
assert(filter_bits_builder != nullptr);
|
|
filter_bits_builder_.reset(filter_bits_builder);
|
|
}
|
|
|
|
void FullFilterBlockBuilder::Add(const Slice& key) {
|
|
if (whole_key_filtering_) {
|
|
AddKey(key);
|
|
}
|
|
if (prefix_extractor_ && prefix_extractor_->InDomain(key)) {
|
|
AddPrefix(key);
|
|
}
|
|
}
|
|
|
|
// Add key to filter if needed
|
|
inline void FullFilterBlockBuilder::AddKey(const Slice& key) {
|
|
filter_bits_builder_->AddKey(key);
|
|
num_added_++;
|
|
}
|
|
|
|
// Add prefix to filter if needed
|
|
inline void FullFilterBlockBuilder::AddPrefix(const Slice& key) {
|
|
Slice prefix = prefix_extractor_->Transform(key);
|
|
filter_bits_builder_->AddKey(prefix);
|
|
num_added_++;
|
|
}
|
|
|
|
Slice FullFilterBlockBuilder::Finish() {
|
|
if (num_added_ != 0) {
|
|
num_added_ = 0;
|
|
return filter_bits_builder_->Finish(&filter_data_);
|
|
}
|
|
return Slice();
|
|
}
|
|
|
|
FullFilterBlockReader::FullFilterBlockReader(
|
|
const SliceTransform* prefix_extractor, bool whole_key_filtering,
|
|
const Slice& contents, FilterBitsReader* filter_bits_reader)
|
|
: prefix_extractor_(prefix_extractor),
|
|
whole_key_filtering_(whole_key_filtering),
|
|
contents_(contents) {
|
|
assert(filter_bits_reader != nullptr);
|
|
filter_bits_reader_.reset(filter_bits_reader);
|
|
}
|
|
|
|
FullFilterBlockReader::FullFilterBlockReader(
|
|
const SliceTransform* prefix_extractor, bool whole_key_filtering,
|
|
BlockContents&& contents, FilterBitsReader* filter_bits_reader)
|
|
: FullFilterBlockReader(prefix_extractor, whole_key_filtering,
|
|
contents.data, filter_bits_reader) {
|
|
block_contents_ = std::move(contents);
|
|
}
|
|
|
|
bool FullFilterBlockReader::KeyMayMatch(const Slice& key,
|
|
uint64_t block_offset) {
|
|
assert(block_offset == kNotValid);
|
|
if (!whole_key_filtering_) {
|
|
return true;
|
|
}
|
|
return MayMatch(key);
|
|
}
|
|
|
|
bool FullFilterBlockReader::PrefixMayMatch(const Slice& prefix,
|
|
uint64_t block_offset) {
|
|
assert(block_offset == kNotValid);
|
|
if (!prefix_extractor_) {
|
|
return true;
|
|
}
|
|
return MayMatch(prefix);
|
|
}
|
|
|
|
bool FullFilterBlockReader::MayMatch(const Slice& entry) {
|
|
if (contents_.size() != 0) {
|
|
return filter_bits_reader_->MayMatch(entry);
|
|
}
|
|
return true; // remain the same with block_based filter
|
|
}
|
|
|
|
size_t FullFilterBlockReader::ApproximateMemoryUsage() const {
|
|
return contents_.size();
|
|
}
|
|
} // namespace rocksdb
|
|
|