mirror of
https://github.com/facebook/rocksdb.git
synced 2024-12-01 07:15:51 +00:00
5cb2d09d47
Summary: Summary - Refactor FilePrefetchBuffer code - Implementation: FilePrefetchBuffer maintains a deque of free buffers (free_bufs_) of size num_buffers_ and buffers (bufs_) which contains the prefetched data. Whenever a buffer is consumed or is outdated (w.r.t. to requested offset), that buffer is cleared and returned to free_bufs_. If a buffer is available in free_bufs_, it's moved to bufs_ and is sent for prefetching. num_buffers_ defines how many buffers are maintained that contains prefetched data. If num_buffers_ == 1, it's a sequential read flow. Read API will be called on that one buffer whenever the data is requested and is not in the buffer. If num_buffers_ > 1, then the data is prefetched asynchronosuly in the buffers whenever the data is consumed from the buffers and that buffer is freed. If num_buffers > 1, then requested data can be overlapping between 2 buffers. To return the continuous buffer overlap_bufs_ is used. The requested data is copied from 2 buffers to the overlap_bufs_ and overlap_bufs_ is returned to the caller. - Merged Sync and Async code flow into one in FilePrefetchBuffer. Test Plan - - Crash test passed - Unit tests - Pending - Benchmarks Pull Request resolved: https://github.com/facebook/rocksdb/pull/12097 Reviewed By: ajkr Differential Revision: D51759552 Pulled By: akankshamahajan15 fbshipit-source-id: 69a352945affac2ed22be96048d55863e0168ad5
153 lines
5.7 KiB
C++
153 lines
5.7 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).
|
|
//
|
|
// 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.
|
|
#include "table/block_based/block_prefetcher.h"
|
|
|
|
#include "rocksdb/file_system.h"
|
|
#include "table/block_based/block_based_table_reader.h"
|
|
|
|
namespace ROCKSDB_NAMESPACE {
|
|
void BlockPrefetcher::PrefetchIfNeeded(
|
|
const BlockBasedTable::Rep* rep, const BlockHandle& handle,
|
|
const size_t readahead_size, bool is_for_compaction,
|
|
const bool no_sequential_checking, const ReadOptions& read_options,
|
|
const std::function<void(bool, uint64_t&, uint64_t&)>& readaheadsize_cb,
|
|
bool is_async_io_prefetch) {
|
|
ReadaheadParams readahead_params;
|
|
readahead_params.initial_readahead_size = readahead_size;
|
|
readahead_params.max_readahead_size = readahead_size;
|
|
readahead_params.num_buffers = is_async_io_prefetch ? 2 : 1;
|
|
|
|
const size_t len = BlockBasedTable::BlockSizeWithTrailer(handle);
|
|
const size_t offset = handle.offset();
|
|
if (is_for_compaction) {
|
|
if (!rep->file->use_direct_io() && compaction_readahead_size_ > 0) {
|
|
// If FS supports prefetching (readahead_limit_ will be non zero in that
|
|
// case) and current block exists in prefetch buffer then return.
|
|
if (offset + len <= readahead_limit_) {
|
|
return;
|
|
}
|
|
IOOptions opts;
|
|
Status s = rep->file->PrepareIOOptions(read_options, opts);
|
|
if (!s.ok()) {
|
|
return;
|
|
}
|
|
s = rep->file->Prefetch(opts, offset, len + compaction_readahead_size_);
|
|
if (s.ok()) {
|
|
readahead_limit_ = offset + len + compaction_readahead_size_;
|
|
return;
|
|
} else if (!s.IsNotSupported()) {
|
|
return;
|
|
}
|
|
}
|
|
// If FS prefetch is not supported, fall back to use internal prefetch
|
|
// buffer.
|
|
//
|
|
// num_file_reads is used by FilePrefetchBuffer only when
|
|
// implicit_auto_readahead is set.
|
|
readahead_params.initial_readahead_size = compaction_readahead_size_;
|
|
readahead_params.max_readahead_size = compaction_readahead_size_;
|
|
rep->CreateFilePrefetchBufferIfNotExists(readahead_params,
|
|
&prefetch_buffer_,
|
|
/*readaheadsize_cb=*/nullptr);
|
|
return;
|
|
}
|
|
|
|
// Explicit user requested readahead.
|
|
if (readahead_size > 0) {
|
|
rep->CreateFilePrefetchBufferIfNotExists(
|
|
readahead_params, &prefetch_buffer_, readaheadsize_cb,
|
|
/*usage=*/FilePrefetchBufferUsage::kUserScanPrefetch);
|
|
return;
|
|
}
|
|
|
|
// Implicit readahead.
|
|
|
|
// If max_auto_readahead_size is set to be 0 by user, no data will be
|
|
// prefetched.
|
|
size_t max_auto_readahead_size = rep->table_options.max_auto_readahead_size;
|
|
if (max_auto_readahead_size == 0 || initial_auto_readahead_size_ == 0) {
|
|
return;
|
|
}
|
|
|
|
if (initial_auto_readahead_size_ > max_auto_readahead_size) {
|
|
initial_auto_readahead_size_ = max_auto_readahead_size;
|
|
}
|
|
|
|
readahead_params.initial_readahead_size = initial_auto_readahead_size_;
|
|
readahead_params.max_readahead_size = max_auto_readahead_size;
|
|
readahead_params.implicit_auto_readahead = true;
|
|
readahead_params.num_file_reads_for_auto_readahead =
|
|
rep->table_options.num_file_reads_for_auto_readahead;
|
|
|
|
// In case of no_sequential_checking, it will skip the num_file_reads_ and
|
|
// will always creates the FilePrefetchBuffer.
|
|
if (no_sequential_checking) {
|
|
rep->CreateFilePrefetchBufferIfNotExists(
|
|
readahead_params, &prefetch_buffer_, readaheadsize_cb,
|
|
/*usage=*/FilePrefetchBufferUsage::kUserScanPrefetch);
|
|
return;
|
|
}
|
|
|
|
// If FS supports prefetching (readahead_limit_ will be non zero in that case)
|
|
// and current block exists in prefetch buffer then return.
|
|
if (offset + len <= readahead_limit_) {
|
|
UpdateReadPattern(offset, len);
|
|
return;
|
|
}
|
|
|
|
if (!IsBlockSequential(offset)) {
|
|
UpdateReadPattern(offset, len);
|
|
ResetValues(rep->table_options.initial_auto_readahead_size);
|
|
return;
|
|
}
|
|
UpdateReadPattern(offset, len);
|
|
|
|
// Implicit auto readahead, which will be enabled if the number of reads
|
|
// reached `table_options.num_file_reads_for_auto_readahead` (default: 2) and
|
|
// scans are sequential.
|
|
num_file_reads_++;
|
|
if (num_file_reads_ <= rep->table_options.num_file_reads_for_auto_readahead) {
|
|
return;
|
|
}
|
|
|
|
readahead_params.num_file_reads = num_file_reads_;
|
|
if (rep->file->use_direct_io()) {
|
|
rep->CreateFilePrefetchBufferIfNotExists(
|
|
readahead_params, &prefetch_buffer_, readaheadsize_cb,
|
|
/*usage=*/FilePrefetchBufferUsage::kUserScanPrefetch);
|
|
return;
|
|
}
|
|
|
|
if (readahead_size_ > max_auto_readahead_size) {
|
|
readahead_size_ = max_auto_readahead_size;
|
|
}
|
|
|
|
// If prefetch is not supported, fall back to use internal prefetch buffer.
|
|
IOOptions opts;
|
|
Status s = rep->file->PrepareIOOptions(read_options, opts);
|
|
if (!s.ok()) {
|
|
return;
|
|
}
|
|
s = rep->file->Prefetch(
|
|
opts, handle.offset(),
|
|
BlockBasedTable::BlockSizeWithTrailer(handle) + readahead_size_);
|
|
if (s.IsNotSupported()) {
|
|
rep->CreateFilePrefetchBufferIfNotExists(
|
|
readahead_params, &prefetch_buffer_, readaheadsize_cb,
|
|
/*usage=*/FilePrefetchBufferUsage::kUserScanPrefetch);
|
|
return;
|
|
}
|
|
|
|
readahead_limit_ = offset + len + readahead_size_;
|
|
// Keep exponentially increasing readahead size until
|
|
// max_auto_readahead_size.
|
|
readahead_size_ = std::min(max_auto_readahead_size, readahead_size_ * 2);
|
|
}
|
|
} // namespace ROCKSDB_NAMESPACE
|