2019-09-16 19:31:27 +02:00
|
|
|
// 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.
|
|
|
|
|
|
|
|
#pragma once
|
2021-11-11 01:18:27 +01:00
|
|
|
#include <algorithm>
|
2019-09-16 19:31:27 +02:00
|
|
|
#include <atomic>
|
|
|
|
#include <sstream>
|
|
|
|
#include <string>
|
2020-06-29 23:51:57 +02:00
|
|
|
|
2021-11-11 01:18:27 +01:00
|
|
|
#include "file/readahead_file_info.h"
|
2019-09-16 19:31:27 +02:00
|
|
|
#include "port/port.h"
|
|
|
|
#include "rocksdb/env.h"
|
2022-03-21 15:12:43 +01:00
|
|
|
#include "rocksdb/file_system.h"
|
2020-06-29 23:51:57 +02:00
|
|
|
#include "rocksdb/options.h"
|
2019-09-16 19:31:27 +02:00
|
|
|
#include "util/aligned_buffer.h"
|
|
|
|
|
2020-02-20 21:07:53 +01:00
|
|
|
namespace ROCKSDB_NAMESPACE {
|
2019-09-16 19:31:27 +02:00
|
|
|
|
2021-11-11 01:18:27 +01:00
|
|
|
#define DEAFULT_DECREMENT 8 * 1024
|
|
|
|
|
2021-11-20 02:52:42 +01:00
|
|
|
struct IOOptions;
|
|
|
|
class RandomAccessFileReader;
|
|
|
|
|
2022-03-21 15:12:43 +01:00
|
|
|
struct BufferInfo {
|
|
|
|
AlignedBuffer buffer_;
|
|
|
|
uint64_t offset_ = 0;
|
|
|
|
};
|
|
|
|
|
2019-09-16 19:31:27 +02:00
|
|
|
// FilePrefetchBuffer is a smart buffer to store and read data from a file.
|
|
|
|
class FilePrefetchBuffer {
|
|
|
|
public:
|
2021-04-28 21:52:53 +02:00
|
|
|
static const int kMinNumFileReadsToStartAutoReadahead = 2;
|
2021-12-01 07:52:14 +01:00
|
|
|
static const size_t kInitAutoReadaheadSize = 8 * 1024;
|
|
|
|
|
2019-09-16 19:31:27 +02:00
|
|
|
// Constructor.
|
|
|
|
//
|
|
|
|
// All arguments are optional.
|
|
|
|
// readahead_size : the initial readahead size.
|
|
|
|
// max_readahead_size : the maximum readahead size.
|
|
|
|
// If max_readahead_size > readahead_size, the readahead size will be
|
|
|
|
// doubled on every IO until max_readahead_size is hit.
|
|
|
|
// Typically this is set as a multiple of readahead_size.
|
|
|
|
// max_readahead_size should be greater than equal to readahead_size.
|
|
|
|
// enable : controls whether reading from the buffer is enabled.
|
|
|
|
// If false, TryReadFromCache() always return false, and we only take stats
|
|
|
|
// for the minimum offset if track_min_offset = true.
|
|
|
|
// track_min_offset : Track the minimum offset ever read and collect stats on
|
|
|
|
// it. Used for adaptable readahead of the file footer/metadata.
|
2021-04-28 21:52:53 +02:00
|
|
|
// implicit_auto_readahead : Readahead is enabled implicitly by rocksdb after
|
|
|
|
// doing sequential scans for two times.
|
2022-03-21 15:12:43 +01:00
|
|
|
// async_io : When async_io is enabled, if it's implicit_auto_readahead, it
|
|
|
|
// prefetches data asynchronously in second buffer while curr_ is being
|
|
|
|
// consumed.
|
2019-09-16 19:31:27 +02:00
|
|
|
//
|
2021-11-20 02:52:42 +01:00
|
|
|
// Automatic readhead is enabled for a file if readahead_size
|
2019-09-16 19:31:27 +02:00
|
|
|
// and max_readahead_size are passed in.
|
|
|
|
// A user can construct a FilePrefetchBuffer without any arguments, but use
|
|
|
|
// `Prefetch` to load data into the buffer.
|
2021-11-20 02:52:42 +01:00
|
|
|
FilePrefetchBuffer(size_t readahead_size = 0, size_t max_readahead_size = 0,
|
2021-04-28 21:52:53 +02:00
|
|
|
bool enable = true, bool track_min_offset = false,
|
2022-03-21 15:12:43 +01:00
|
|
|
bool implicit_auto_readahead = false,
|
|
|
|
bool async_io = false)
|
|
|
|
: curr_(0),
|
2021-02-18 23:29:36 +01:00
|
|
|
readahead_size_(readahead_size),
|
2019-09-16 19:31:27 +02:00
|
|
|
max_readahead_size_(max_readahead_size),
|
|
|
|
min_offset_read_(port::kMaxSizet),
|
|
|
|
enable_(enable),
|
2021-04-28 21:52:53 +02:00
|
|
|
track_min_offset_(track_min_offset),
|
|
|
|
implicit_auto_readahead_(implicit_auto_readahead),
|
|
|
|
prev_offset_(0),
|
|
|
|
prev_len_(0),
|
2022-03-21 15:12:43 +01:00
|
|
|
num_file_reads_(kMinNumFileReadsToStartAutoReadahead + 1),
|
|
|
|
io_handle_(nullptr),
|
|
|
|
del_fn_(nullptr),
|
|
|
|
async_read_in_progress_(false),
|
|
|
|
async_io_(async_io) {
|
|
|
|
// If async_io_ is enabled, data is asynchronously filled in second buffer
|
|
|
|
// while curr_ is being consumed. If data is overlapping in two buffers,
|
|
|
|
// data is copied to third buffer to return continuous buffer.
|
|
|
|
bufs_.resize(3);
|
|
|
|
}
|
2019-09-16 19:31:27 +02:00
|
|
|
|
|
|
|
// Load data into the buffer from a file.
|
2022-02-17 08:17:03 +01:00
|
|
|
// reader : the file reader.
|
|
|
|
// offset : the file offset to start reading from.
|
|
|
|
// n : the number of bytes to read.
|
|
|
|
// rate_limiter_priority : rate limiting priority, or `Env::IO_TOTAL` to
|
|
|
|
// bypass.
|
2022-03-21 15:12:43 +01:00
|
|
|
// is_async_read : if the data should be prefetched by calling read
|
|
|
|
// asynchronously. It should be set true when called
|
|
|
|
// from TryReadFromCache.
|
2020-06-29 23:51:57 +02:00
|
|
|
Status Prefetch(const IOOptions& opts, RandomAccessFileReader* reader,
|
2022-02-17 08:17:03 +01:00
|
|
|
uint64_t offset, size_t n,
|
|
|
|
Env::IOPriority rate_limiter_priority);
|
2019-09-16 19:31:27 +02:00
|
|
|
|
2022-03-21 15:12:43 +01:00
|
|
|
Status PrefetchAsync(const IOOptions& opts, RandomAccessFileReader* reader,
|
|
|
|
FileSystem* fs, uint64_t offset, size_t length,
|
|
|
|
size_t readahead_size,
|
|
|
|
Env::IOPriority rate_limiter_priority,
|
|
|
|
bool& copy_to_third_buffer);
|
|
|
|
|
2021-11-20 02:52:42 +01:00
|
|
|
// Tries returning the data for a file read from this buffer if that data is
|
2019-09-16 19:31:27 +02:00
|
|
|
// in the buffer.
|
|
|
|
// It handles tracking the minimum read offset if track_min_offset = true.
|
2021-02-18 23:29:36 +01:00
|
|
|
// It also does the exponential readahead when readahead_size is set as part
|
2019-09-16 19:31:27 +02:00
|
|
|
// of the constructor.
|
|
|
|
//
|
2022-02-17 08:17:03 +01:00
|
|
|
// opts : the IO options to use.
|
|
|
|
// reader : the file reader.
|
|
|
|
// offset : the file offset.
|
|
|
|
// n : the number of bytes.
|
|
|
|
// result : output buffer to put the data into.
|
|
|
|
// s : output status.
|
|
|
|
// rate_limiter_priority : rate limiting priority, or `Env::IO_TOTAL` to
|
|
|
|
// bypass.
|
|
|
|
// for_compaction : true if cache read is done for compaction read.
|
2021-11-20 02:52:42 +01:00
|
|
|
bool TryReadFromCache(const IOOptions& opts, RandomAccessFileReader* reader,
|
|
|
|
uint64_t offset, size_t n, Slice* result, Status* s,
|
2022-02-17 08:17:03 +01:00
|
|
|
Env::IOPriority rate_limiter_priority,
|
2021-11-20 02:52:42 +01:00
|
|
|
bool for_compaction = false);
|
2019-09-16 19:31:27 +02:00
|
|
|
|
2022-03-21 15:12:43 +01:00
|
|
|
bool TryReadFromCacheAsync(const IOOptions& opts,
|
|
|
|
RandomAccessFileReader* reader, uint64_t offset,
|
|
|
|
size_t n, Slice* result, Status* status,
|
|
|
|
Env::IOPriority rate_limiter_priority,
|
|
|
|
bool for_compaction /* = false */, FileSystem* fs);
|
|
|
|
|
2019-09-16 19:31:27 +02:00
|
|
|
// The minimum `offset` ever passed to TryReadFromCache(). This will nly be
|
|
|
|
// tracked if track_min_offset = true.
|
|
|
|
size_t min_offset_read() const { return min_offset_read_; }
|
|
|
|
|
2021-12-01 07:52:14 +01:00
|
|
|
// Called in case of implicit auto prefetching.
|
2021-11-11 01:18:27 +01:00
|
|
|
void UpdateReadPattern(const uint64_t& offset, const size_t& len,
|
2022-03-21 15:12:43 +01:00
|
|
|
bool decrease_readaheadsize) {
|
|
|
|
if (decrease_readaheadsize) {
|
2021-11-11 01:18:27 +01:00
|
|
|
// Since this block was eligible for prefetch but it was found in
|
|
|
|
// cache, so check and decrease the readahead_size by 8KB (default)
|
|
|
|
// if eligible.
|
|
|
|
DecreaseReadAheadIfEligible(offset, len);
|
|
|
|
}
|
2021-04-28 21:52:53 +02:00
|
|
|
prev_offset_ = offset;
|
|
|
|
prev_len_ = len;
|
|
|
|
}
|
|
|
|
|
2021-11-11 01:18:27 +01:00
|
|
|
void GetReadaheadState(ReadaheadFileInfo::ReadaheadInfo* readahead_info) {
|
|
|
|
readahead_info->readahead_size = readahead_size_;
|
|
|
|
readahead_info->num_file_reads = num_file_reads_;
|
|
|
|
}
|
|
|
|
|
|
|
|
void DecreaseReadAheadIfEligible(uint64_t offset, size_t size,
|
|
|
|
size_t value = DEAFULT_DECREMENT) {
|
|
|
|
// Decrease the readahead_size if
|
|
|
|
// - its enabled internally by RocksDB (implicit_auto_readahead_) and,
|
|
|
|
// - readahead_size is greater than 0 and,
|
|
|
|
// - this block would have called prefetch API if not found in cache for
|
|
|
|
// which conditions are:
|
|
|
|
// - few/no bytes are in buffer and,
|
|
|
|
// - block is sequential with the previous read and,
|
|
|
|
// - num_file_reads_ + 1 (including this read) >
|
|
|
|
// kMinNumFileReadsToStartAutoReadahead
|
|
|
|
if (implicit_auto_readahead_ && readahead_size_ > 0) {
|
2022-03-21 15:12:43 +01:00
|
|
|
if ((offset + size >
|
|
|
|
bufs_[curr_].offset_ + bufs_[curr_].buffer_.CurrentSize()) &&
|
2021-11-11 01:18:27 +01:00
|
|
|
IsBlockSequential(offset) &&
|
|
|
|
(num_file_reads_ + 1 > kMinNumFileReadsToStartAutoReadahead)) {
|
2021-12-01 07:52:14 +01:00
|
|
|
size_t initial_auto_readahead_size = kInitAutoReadaheadSize;
|
2021-11-11 01:18:27 +01:00
|
|
|
readahead_size_ =
|
2021-12-01 07:52:14 +01:00
|
|
|
std::max(initial_auto_readahead_size,
|
2021-11-11 01:18:27 +01:00
|
|
|
(readahead_size_ >= value ? readahead_size_ - value : 0));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-03-21 15:12:43 +01:00
|
|
|
bool IsEligibleForPrefetch(uint64_t offset, size_t n) {
|
|
|
|
// Prefetch only if this read is sequential otherwise reset readahead_size_
|
|
|
|
// to initial value.
|
|
|
|
if (!IsBlockSequential(offset)) {
|
|
|
|
UpdateReadPattern(offset, n, false /*decrease_readaheadsize*/);
|
|
|
|
ResetValues();
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
num_file_reads_++;
|
|
|
|
if (num_file_reads_ <= kMinNumFileReadsToStartAutoReadahead) {
|
|
|
|
UpdateReadPattern(offset, n, false /*decrease_readaheadsize*/);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Callback function passed to underlying FS in case of asynchronous reads.
|
|
|
|
void PrefetchAsyncCallback(const FSReadRequest& req, void* cb_arg);
|
|
|
|
|
2019-09-16 19:31:27 +02:00
|
|
|
private:
|
2022-03-21 15:12:43 +01:00
|
|
|
// Calculates roundoff offset and length to be prefetched based on alignment
|
|
|
|
// and data present in buffer_. It also allocates new buffer or refit tail if
|
|
|
|
// required.
|
|
|
|
void CalculateOffsetAndLen(size_t alignment, uint64_t offset,
|
|
|
|
size_t roundup_len, size_t index, bool refit_tail,
|
|
|
|
uint64_t& chunk_len);
|
|
|
|
|
|
|
|
Status Read(const IOOptions& opts, RandomAccessFileReader* reader,
|
|
|
|
Env::IOPriority rate_limiter_priority, uint64_t read_len,
|
|
|
|
uint64_t chunk_len, uint64_t rounddown_start, uint32_t index);
|
|
|
|
|
|
|
|
Status ReadAsync(const IOOptions& opts, RandomAccessFileReader* reader,
|
|
|
|
Env::IOPriority rate_limiter_priority, uint64_t read_len,
|
|
|
|
uint64_t chunk_len, uint64_t rounddown_start,
|
|
|
|
uint32_t index);
|
|
|
|
|
|
|
|
// Copy the data from src to third buffer.
|
|
|
|
void CopyDataToBuffer(uint32_t src, uint64_t& offset, size_t& length);
|
|
|
|
|
|
|
|
bool IsBlockSequential(const size_t& offset) {
|
|
|
|
return (prev_len_ == 0 || (prev_offset_ + prev_len_ == offset));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Called in case of implicit auto prefetching.
|
|
|
|
void ResetValues() {
|
|
|
|
num_file_reads_ = 1;
|
|
|
|
readahead_size_ = kInitAutoReadaheadSize;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<BufferInfo> bufs_;
|
|
|
|
// curr_ represents the index for bufs_ indicating which buffer is being
|
|
|
|
// consumed currently.
|
|
|
|
uint32_t curr_;
|
2019-09-16 19:31:27 +02:00
|
|
|
size_t readahead_size_;
|
2021-11-11 01:18:27 +01:00
|
|
|
// FilePrefetchBuffer object won't be created from Iterator flow if
|
|
|
|
// max_readahead_size_ = 0.
|
2019-09-16 19:31:27 +02:00
|
|
|
size_t max_readahead_size_;
|
|
|
|
// The minimum `offset` ever passed to TryReadFromCache().
|
|
|
|
size_t min_offset_read_;
|
|
|
|
// if false, TryReadFromCache() always return false, and we only take stats
|
|
|
|
// for track_min_offset_ if track_min_offset_ = true
|
|
|
|
bool enable_;
|
|
|
|
// If true, track minimum `offset` ever passed to TryReadFromCache(), which
|
|
|
|
// can be fetched from min_offset_read().
|
|
|
|
bool track_min_offset_;
|
2021-04-28 21:52:53 +02:00
|
|
|
|
2021-11-11 01:18:27 +01:00
|
|
|
// implicit_auto_readahead is enabled by rocksdb internally after 2
|
|
|
|
// sequential IOs.
|
2021-04-28 21:52:53 +02:00
|
|
|
bool implicit_auto_readahead_;
|
2021-11-11 01:18:27 +01:00
|
|
|
uint64_t prev_offset_;
|
2021-04-28 21:52:53 +02:00
|
|
|
size_t prev_len_;
|
2021-11-11 01:18:27 +01:00
|
|
|
int64_t num_file_reads_;
|
2022-03-21 15:12:43 +01:00
|
|
|
|
|
|
|
// io_handle_ is allocated and used by underlying file system in case of
|
|
|
|
// asynchronous reads.
|
|
|
|
void* io_handle_;
|
|
|
|
IOHandleDeleter del_fn_;
|
|
|
|
bool async_read_in_progress_;
|
|
|
|
bool async_io_;
|
2019-09-16 19:31:27 +02:00
|
|
|
};
|
2020-02-20 21:07:53 +01:00
|
|
|
} // namespace ROCKSDB_NAMESPACE
|