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.
74 lines
2.8 KiB
74 lines
2.8 KiB
// 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).
|
|
// Copyright (c) 2012 The LevelDB Authors. All rights reserved.
|
|
// 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.
|
|
|
|
#pragma once
|
|
|
|
#include <memory>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
#include "rocksdb/filter_policy.h"
|
|
|
|
namespace rocksdb {
|
|
|
|
class Slice;
|
|
|
|
class FullFilterBitsBuilder : public FilterBitsBuilder {
|
|
public:
|
|
explicit FullFilterBitsBuilder(const size_t bits_per_key,
|
|
const size_t num_probes);
|
|
|
|
~FullFilterBitsBuilder();
|
|
|
|
virtual void AddKey(const Slice& key) override;
|
|
|
|
// Create a filter that for hashes [0, n-1], the filter is allocated here
|
|
// When creating filter, it is ensured that
|
|
// total_bits = num_lines * CACHE_LINE_SIZE * 8
|
|
// dst len is >= 5, 1 for num_probes, 4 for num_lines
|
|
// Then total_bits = (len - 5) * 8, and cache_line_size could be calculated
|
|
// +----------------------------------------------------------------+
|
|
// | filter data with length total_bits/8 |
|
|
// +----------------------------------------------------------------+
|
|
// | |
|
|
// | ... |
|
|
// | |
|
|
// +----------------------------------------------------------------+
|
|
// | ... | num_probes : 1 byte | num_lines : 4 bytes |
|
|
// +----------------------------------------------------------------+
|
|
virtual Slice Finish(std::unique_ptr<const char[]>* buf) override;
|
|
|
|
// Calculate num of entries fit into a space.
|
|
virtual int CalculateNumEntry(const uint32_t space) override;
|
|
|
|
// Calculate space for new filter. This is reverse of CalculateNumEntry.
|
|
uint32_t CalculateSpace(const int num_entry, uint32_t* total_bits,
|
|
uint32_t* num_lines);
|
|
|
|
private:
|
|
friend class FullFilterBlockTest_DuplicateEntries_Test;
|
|
size_t bits_per_key_;
|
|
size_t num_probes_;
|
|
std::vector<uint32_t> hash_entries_;
|
|
|
|
// Get totalbits that optimized for cpu cache line
|
|
uint32_t GetTotalBitsForLocality(uint32_t total_bits);
|
|
|
|
// Reserve space for new filter
|
|
char* ReserveSpace(const int num_entry, uint32_t* total_bits,
|
|
uint32_t* num_lines);
|
|
|
|
// Assuming single threaded access to this function.
|
|
void AddHash(uint32_t h, char* data, uint32_t num_lines, uint32_t total_bits);
|
|
|
|
// No Copy allowed
|
|
FullFilterBitsBuilder(const FullFilterBitsBuilder&);
|
|
void operator=(const FullFilterBitsBuilder&);
|
|
};
|
|
|
|
} // namespace rocksdb
|
|
|