mirror of
https://github.com/facebook/rocksdb.git
synced 2024-11-26 07:30:54 +00:00
581442d446
Summary: Using module to calculate hash makes lookup ~8% slower. But it has its benefit: file size is more predictable, more space enffient Test Plan: db_bench Reviewers: igor, yhchiang, sdong Reviewed By: sdong Subscribers: leveldb Differential Revision: https://reviews.facebook.net/D23691
86 lines
2.7 KiB
C++
86 lines
2.7 KiB
C++
// 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.
|
|
//
|
|
// Copyright (c) 2011 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
|
|
#ifndef ROCKSDB_LITE
|
|
#include <string>
|
|
#include <memory>
|
|
#include <utility>
|
|
#include <vector>
|
|
|
|
#include "db/dbformat.h"
|
|
#include "rocksdb/env.h"
|
|
#include "rocksdb/options.h"
|
|
#include "table/table_reader.h"
|
|
|
|
namespace rocksdb {
|
|
|
|
class Arena;
|
|
class TableReader;
|
|
|
|
class CuckooTableReader: public TableReader {
|
|
public:
|
|
CuckooTableReader(
|
|
const ImmutableCFOptions& ioptions,
|
|
std::unique_ptr<RandomAccessFile>&& file,
|
|
uint64_t file_size,
|
|
const Comparator* user_comparator,
|
|
uint64_t (*get_slice_hash)(const Slice&, uint32_t, uint64_t));
|
|
~CuckooTableReader() {}
|
|
|
|
std::shared_ptr<const TableProperties> GetTableProperties() const override {
|
|
return table_props_;
|
|
}
|
|
|
|
Status status() const { return status_; }
|
|
|
|
Status Get(
|
|
const ReadOptions& read_options, const Slice& key, void* handle_context,
|
|
bool (*result_handler)(void* arg, const ParsedInternalKey& k,
|
|
const Slice& v),
|
|
void (*mark_key_may_exist_handler)(void* handle_context) = nullptr)
|
|
override;
|
|
|
|
Iterator* NewIterator(const ReadOptions&, Arena* arena = nullptr) override;
|
|
void Prepare(const Slice& target) override;
|
|
|
|
// Report an approximation of how much memory has been used.
|
|
size_t ApproximateMemoryUsage() const override;
|
|
|
|
// Following methods are not implemented for Cuckoo Table Reader
|
|
uint64_t ApproximateOffsetOf(const Slice& key) override { return 0; }
|
|
void SetupForCompaction() override {}
|
|
// End of methods not implemented.
|
|
|
|
private:
|
|
friend class CuckooTableIterator;
|
|
void LoadAllKeys(std::vector<std::pair<Slice, uint32_t>>* key_to_bucket_id);
|
|
std::unique_ptr<RandomAccessFile> file_;
|
|
Slice file_data_;
|
|
bool is_last_level_;
|
|
bool identity_as_first_hash_;
|
|
bool use_module_hash_;
|
|
std::shared_ptr<const TableProperties> table_props_;
|
|
Status status_;
|
|
uint32_t num_hash_func_;
|
|
std::string unused_key_;
|
|
uint32_t key_length_;
|
|
uint32_t value_length_;
|
|
uint32_t bucket_length_;
|
|
uint32_t cuckoo_block_size_;
|
|
uint32_t cuckoo_block_bytes_minus_one_;
|
|
uint64_t table_size_;
|
|
const Comparator* ucomp_;
|
|
uint64_t (*get_slice_hash_)(const Slice& s, uint32_t index,
|
|
uint64_t max_num_buckets);
|
|
};
|
|
|
|
} // namespace rocksdb
|
|
#endif // ROCKSDB_LITE
|