mirror of
https://github.com/facebook/rocksdb.git
synced 2024-11-26 16:30:56 +00:00
89ab1381f8
Summary: Following files were run through automatic formatter: db/db_impl.cc db/db_impl.h db/db_impl_compaction_flush.cc db/db_impl_debug.cc db/db_impl_files.cc db/db_impl_readonly.h db/db_impl_write.cc db/dbformat.cc db/dbformat.h table/block.cc table/block.h table/block_based_filter_block.cc table/block_based_filter_block.h table/block_based_filter_block_test.cc table/block_based_table_builder.cc table/block_based_table_reader.cc table/block_based_table_reader.h table/block_builder.cc table/block_builder.h table/block_fetcher.cc table/block_prefix_index.cc table/block_prefix_index.h table/block_test.cc table/format.cc table/format.h I could easily run all the files, but I don't want people to feel that I'm doing it for lines of code changes :) Pull Request resolved: https://github.com/facebook/rocksdb/pull/5114 Differential Revision: D14633040 Pulled By: siying fbshipit-source-id: 3f346cb53bf21e8c10704400da548dfce1e89a52
67 lines
2.2 KiB
C++
67 lines
2.2 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 <stdint.h>
|
|
#include "rocksdb/status.h"
|
|
|
|
namespace rocksdb {
|
|
|
|
class Comparator;
|
|
class Iterator;
|
|
class Slice;
|
|
class SliceTransform;
|
|
|
|
// Build a hash-based index to speed up the lookup for "index block".
|
|
// BlockHashIndex accepts a key and, if found, returns its restart index within
|
|
// that index block.
|
|
class BlockPrefixIndex {
|
|
public:
|
|
// Maps a key to a list of data blocks that could potentially contain
|
|
// the key, based on the prefix.
|
|
// Returns the total number of relevant blocks, 0 means the key does
|
|
// not exist.
|
|
uint32_t GetBlocks(const Slice& key, uint32_t** blocks);
|
|
|
|
size_t ApproximateMemoryUsage() const {
|
|
return sizeof(BlockPrefixIndex) +
|
|
(num_block_array_buffer_entries_ + num_buckets_) * sizeof(uint32_t);
|
|
}
|
|
|
|
// Create hash index by reading from the metadata blocks.
|
|
// @params prefixes: a sequence of prefixes.
|
|
// @params prefix_meta: contains the "metadata" to of the prefixes.
|
|
static Status Create(const SliceTransform* hash_key_extractor,
|
|
const Slice& prefixes, const Slice& prefix_meta,
|
|
BlockPrefixIndex** prefix_index);
|
|
|
|
~BlockPrefixIndex() {
|
|
delete[] buckets_;
|
|
delete[] block_array_buffer_;
|
|
}
|
|
|
|
private:
|
|
class Builder;
|
|
friend Builder;
|
|
|
|
BlockPrefixIndex(const SliceTransform* internal_prefix_extractor,
|
|
uint32_t num_buckets, uint32_t* buckets,
|
|
uint32_t num_block_array_buffer_entries,
|
|
uint32_t* block_array_buffer)
|
|
: internal_prefix_extractor_(internal_prefix_extractor),
|
|
num_buckets_(num_buckets),
|
|
num_block_array_buffer_entries_(num_block_array_buffer_entries),
|
|
buckets_(buckets),
|
|
block_array_buffer_(block_array_buffer) {}
|
|
|
|
const SliceTransform* internal_prefix_extractor_;
|
|
uint32_t num_buckets_;
|
|
uint32_t num_block_array_buffer_entries_;
|
|
uint32_t* buckets_;
|
|
uint32_t* block_array_buffer_;
|
|
};
|
|
|
|
} // namespace rocksdb
|