mirror of
https://github.com/bitcoin/bitcoin.git
synced 2026-03-02 09:46:14 +00:00
37cc2a2d953c072a236b657bfd7de5167092a47a logging: use util/log.h where possible (stickies-v) bb8e9e7c4c8d70914d0878a0d7c6a1371dae23c0 logging: Move message formatting to util/log.h (stickies-v) 001f0a428e3aa3f46aad373684beb3282bffb2c0 move-only: Move logging macros to util/log.h (stickies-v) 94c0adf4e857f3c58a7ab813eb33b83635101d75 move-onlyish: Move logging levels to util/log.h (stickies-v) 56d113cab0347a768daabccdfd76583e6b272dc4 move-only: move logging categories to logging/categories.h (stickies-v) f5233f7e9827f8dd23414c7fcf49298420f9fc42 move-only: Move SourceLocation to util/log.h (stickies-v) Pull request description: This is a mostly move-only change. It's a small refactoring that allows logging macros to be used by including a simple `util/log.h` header instead of the full `logging.h` logging implementation. Most of the changes here were cherry-picked from #34374. Original motivation for this change was to reduce the size and complexity of #34374 (kernel structured logging PR) and reduce the number of conflicts it causes with other PRs. But this should also make sense as a standalone change to have a clearer separation of concerns between log generation and log handling, and avoid needing to depend on the whole logging framework in call sites that only emit log messages. Recommended to review with `--color-moved=dimmed-zebra --color-moved-ws=ignore-all-space` ACKs for top commit: l0rinc: diff ACK 37cc2a2d953c072a236b657bfd7de5167092a47a stickies-v: re-ACK 37cc2a2d953c072a236b657bfd7de5167092a47a optout21: crACK 37cc2a2d953c072a236b657bfd7de5167092a47a sedited: ACK 37cc2a2d953c072a236b657bfd7de5167092a47a Tree-SHA512: c7a761323ae63f07ad290d4e3766ba1348a132c8cc68a9895fa9ae5c89206599c00646c42ef77223ac757b9d8bfe6c181bead15e7058e4d8966b3bac88a8f950
707 lines
22 KiB
C++
707 lines
22 KiB
C++
// Copyright (c) 2009-2010 Satoshi Nakamoto
|
|
// Copyright (c) 2009-present The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#ifndef BITCOIN_STREAMS_H
|
|
#define BITCOIN_STREAMS_H
|
|
|
|
#include <serialize.h>
|
|
#include <span.h>
|
|
#include <support/allocators/zeroafterfree.h>
|
|
#include <util/check.h>
|
|
#include <util/log.h>
|
|
#include <util/obfuscation.h>
|
|
#include <util/overflow.h>
|
|
#include <util/syserror.h>
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
#include <cstddef>
|
|
#include <cstdint>
|
|
#include <cstdio>
|
|
#include <cstring>
|
|
#include <ios>
|
|
#include <limits>
|
|
#include <optional>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
/* Minimal stream for overwriting and/or appending to an existing byte vector
|
|
*
|
|
* The referenced vector will grow as necessary
|
|
*/
|
|
class VectorWriter
|
|
{
|
|
public:
|
|
/*
|
|
* @param[in] vchDataIn Referenced byte vector to overwrite/append
|
|
* @param[in] nPosIn Starting position. Vector index where writes should start. The vector will initially
|
|
* grow as necessary to max(nPosIn, vec.size()). So to append, use vec.size().
|
|
*/
|
|
VectorWriter(std::vector<unsigned char>& vchDataIn, size_t nPosIn) : vchData{vchDataIn}, nPos{nPosIn}
|
|
{
|
|
if(nPos > vchData.size())
|
|
vchData.resize(nPos);
|
|
}
|
|
/*
|
|
* (other params same as above)
|
|
* @param[in] args A list of items to serialize starting at nPosIn.
|
|
*/
|
|
template <typename... Args>
|
|
VectorWriter(std::vector<unsigned char>& vchDataIn, size_t nPosIn, Args&&... args) : VectorWriter{vchDataIn, nPosIn}
|
|
{
|
|
::SerializeMany(*this, std::forward<Args>(args)...);
|
|
}
|
|
void write(std::span<const std::byte> src)
|
|
{
|
|
assert(nPos <= vchData.size());
|
|
size_t nOverwrite = std::min(src.size(), vchData.size() - nPos);
|
|
if (nOverwrite) {
|
|
memcpy(vchData.data() + nPos, src.data(), nOverwrite);
|
|
}
|
|
if (nOverwrite < src.size()) {
|
|
vchData.insert(vchData.end(), UCharCast(src.data()) + nOverwrite, UCharCast(src.data() + src.size()));
|
|
}
|
|
nPos += src.size();
|
|
}
|
|
template <typename T>
|
|
VectorWriter& operator<<(const T& obj)
|
|
{
|
|
::Serialize(*this, obj);
|
|
return (*this);
|
|
}
|
|
|
|
private:
|
|
std::vector<unsigned char>& vchData;
|
|
size_t nPos;
|
|
};
|
|
|
|
/** Minimal stream for reading from an existing byte array by std::span.
|
|
*/
|
|
class SpanReader
|
|
{
|
|
private:
|
|
std::span<const std::byte> m_data;
|
|
|
|
public:
|
|
/**
|
|
* @param[in] data Referenced byte vector to overwrite/append
|
|
*/
|
|
explicit SpanReader(std::span<const unsigned char> data) : m_data{std::as_bytes(data)} {}
|
|
explicit SpanReader(std::span<const std::byte> data) : m_data{data} {}
|
|
|
|
template<typename T>
|
|
SpanReader& operator>>(T&& obj)
|
|
{
|
|
::Unserialize(*this, obj);
|
|
return (*this);
|
|
}
|
|
|
|
size_t size() const { return m_data.size(); }
|
|
bool empty() const { return m_data.empty(); }
|
|
|
|
void read(std::span<std::byte> dst)
|
|
{
|
|
if (dst.size() == 0) {
|
|
return;
|
|
}
|
|
|
|
// Read from the beginning of the buffer
|
|
if (dst.size() > m_data.size()) {
|
|
throw std::ios_base::failure("SpanReader::read(): end of data");
|
|
}
|
|
memcpy(dst.data(), m_data.data(), dst.size());
|
|
m_data = m_data.subspan(dst.size());
|
|
}
|
|
|
|
void ignore(size_t n)
|
|
{
|
|
if (n > m_data.size()) {
|
|
throw std::ios_base::failure("SpanReader::ignore(): end of data");
|
|
}
|
|
m_data = m_data.subspan(n);
|
|
}
|
|
};
|
|
|
|
/** Double ended buffer combining vector and stream-like interfaces.
|
|
*
|
|
* >> and << read and write unformatted data using the above serialization templates.
|
|
* Fills with data in linear time; some stringstream implementations take N^2 time.
|
|
*/
|
|
class DataStream
|
|
{
|
|
protected:
|
|
using vector_type = SerializeData;
|
|
vector_type vch;
|
|
vector_type::size_type m_read_pos{0};
|
|
|
|
public:
|
|
typedef vector_type::allocator_type allocator_type;
|
|
typedef vector_type::size_type size_type;
|
|
typedef vector_type::difference_type difference_type;
|
|
typedef vector_type::reference reference;
|
|
typedef vector_type::const_reference const_reference;
|
|
typedef vector_type::value_type value_type;
|
|
typedef vector_type::iterator iterator;
|
|
typedef vector_type::const_iterator const_iterator;
|
|
typedef vector_type::reverse_iterator reverse_iterator;
|
|
|
|
explicit DataStream() = default;
|
|
explicit DataStream(std::span<const uint8_t> sp) : DataStream{std::as_bytes(sp)} {}
|
|
explicit DataStream(std::span<const value_type> sp) : vch(sp.data(), sp.data() + sp.size()) {}
|
|
|
|
std::string str() const
|
|
{
|
|
return std::string{UCharCast(data()), UCharCast(data() + size())};
|
|
}
|
|
|
|
|
|
//
|
|
// Vector subset
|
|
//
|
|
const_iterator begin() const { return vch.begin() + m_read_pos; }
|
|
iterator begin() { return vch.begin() + m_read_pos; }
|
|
const_iterator end() const { return vch.end(); }
|
|
iterator end() { return vch.end(); }
|
|
size_type size() const { return vch.size() - m_read_pos; }
|
|
bool empty() const { return vch.size() == m_read_pos; }
|
|
void resize(size_type n, value_type c = value_type{}) { vch.resize(n + m_read_pos, c); }
|
|
void reserve(size_type n) { vch.reserve(n + m_read_pos); }
|
|
const_reference operator[](size_type pos) const { return vch[pos + m_read_pos]; }
|
|
reference operator[](size_type pos) { return vch[pos + m_read_pos]; }
|
|
void clear() { vch.clear(); m_read_pos = 0; }
|
|
value_type* data() { return vch.data() + m_read_pos; }
|
|
const value_type* data() const { return vch.data() + m_read_pos; }
|
|
|
|
inline void Compact()
|
|
{
|
|
vch.erase(vch.begin(), vch.begin() + m_read_pos);
|
|
m_read_pos = 0;
|
|
}
|
|
|
|
bool Rewind(std::optional<size_type> n = std::nullopt)
|
|
{
|
|
// Total rewind if no size is passed
|
|
if (!n) {
|
|
m_read_pos = 0;
|
|
return true;
|
|
}
|
|
// Rewind by n characters if the buffer hasn't been compacted yet
|
|
if (*n > m_read_pos)
|
|
return false;
|
|
m_read_pos -= *n;
|
|
return true;
|
|
}
|
|
|
|
|
|
//
|
|
// Stream subset
|
|
//
|
|
int in_avail() const { return size(); }
|
|
|
|
void read(std::span<value_type> dst)
|
|
{
|
|
if (dst.size() == 0) return;
|
|
|
|
// Read from the beginning of the buffer
|
|
auto next_read_pos{CheckedAdd(m_read_pos, dst.size())};
|
|
if (!next_read_pos.has_value() || next_read_pos.value() > vch.size()) {
|
|
throw std::ios_base::failure("DataStream::read(): end of data");
|
|
}
|
|
memcpy(dst.data(), &vch[m_read_pos], dst.size());
|
|
if (next_read_pos.value() == vch.size()) {
|
|
m_read_pos = 0;
|
|
vch.clear();
|
|
return;
|
|
}
|
|
m_read_pos = next_read_pos.value();
|
|
}
|
|
|
|
void ignore(size_t num_ignore)
|
|
{
|
|
// Ignore from the beginning of the buffer
|
|
auto next_read_pos{CheckedAdd(m_read_pos, num_ignore)};
|
|
if (!next_read_pos.has_value() || next_read_pos.value() > vch.size()) {
|
|
throw std::ios_base::failure("DataStream::ignore(): end of data");
|
|
}
|
|
if (next_read_pos.value() == vch.size()) {
|
|
m_read_pos = 0;
|
|
vch.clear();
|
|
return;
|
|
}
|
|
m_read_pos = next_read_pos.value();
|
|
}
|
|
|
|
void write(std::span<const value_type> src)
|
|
{
|
|
// Write to the end of the buffer
|
|
vch.insert(vch.end(), src.begin(), src.end());
|
|
}
|
|
|
|
template<typename T>
|
|
DataStream& operator<<(const T& obj)
|
|
{
|
|
::Serialize(*this, obj);
|
|
return (*this);
|
|
}
|
|
|
|
template <typename T>
|
|
DataStream& operator>>(T&& obj)
|
|
{
|
|
::Unserialize(*this, obj);
|
|
return (*this);
|
|
}
|
|
|
|
/** Compute total memory usage of this object (own memory + any dynamic memory). */
|
|
size_t GetMemoryUsage() const noexcept;
|
|
};
|
|
|
|
template <typename IStream>
|
|
class BitStreamReader
|
|
{
|
|
private:
|
|
IStream& m_istream;
|
|
|
|
/// Buffered byte read in from the input stream. A new byte is read into the
|
|
/// buffer when m_offset reaches 8.
|
|
uint8_t m_buffer{0};
|
|
|
|
/// Number of high order bits in m_buffer already returned by previous
|
|
/// Read() calls. The next bit to be returned is at this offset from the
|
|
/// most significant bit position.
|
|
int m_offset{8};
|
|
|
|
public:
|
|
explicit BitStreamReader(IStream& istream) : m_istream(istream) {}
|
|
|
|
/** Read the specified number of bits from the stream. The data is returned
|
|
* in the nbits least significant bits of a 64-bit uint.
|
|
*/
|
|
uint64_t Read(int nbits) {
|
|
if (nbits < 0 || nbits > 64) {
|
|
throw std::out_of_range("nbits must be between 0 and 64");
|
|
}
|
|
|
|
uint64_t data = 0;
|
|
while (nbits > 0) {
|
|
if (m_offset == 8) {
|
|
m_istream >> m_buffer;
|
|
m_offset = 0;
|
|
}
|
|
|
|
int bits = std::min(8 - m_offset, nbits);
|
|
data <<= bits;
|
|
data |= static_cast<uint8_t>(m_buffer << m_offset) >> (8 - bits);
|
|
m_offset += bits;
|
|
nbits -= bits;
|
|
}
|
|
return data;
|
|
}
|
|
};
|
|
|
|
template <typename OStream>
|
|
class BitStreamWriter
|
|
{
|
|
private:
|
|
OStream& m_ostream;
|
|
|
|
/// Buffered byte waiting to be written to the output stream. The byte is
|
|
/// written buffer when m_offset reaches 8 or Flush() is called.
|
|
uint8_t m_buffer{0};
|
|
|
|
/// Number of high order bits in m_buffer already written by previous
|
|
/// Write() calls and not yet flushed to the stream. The next bit to be
|
|
/// written to is at this offset from the most significant bit position.
|
|
int m_offset{0};
|
|
|
|
public:
|
|
explicit BitStreamWriter(OStream& ostream) : m_ostream(ostream) {}
|
|
|
|
~BitStreamWriter()
|
|
{
|
|
Flush();
|
|
}
|
|
|
|
/** Write the nbits least significant bits of a 64-bit int to the output
|
|
* stream. Data is buffered until it completes an octet.
|
|
*/
|
|
void Write(uint64_t data, int nbits) {
|
|
if (nbits < 0 || nbits > 64) {
|
|
throw std::out_of_range("nbits must be between 0 and 64");
|
|
}
|
|
|
|
while (nbits > 0) {
|
|
int bits = std::min(8 - m_offset, nbits);
|
|
m_buffer |= (data << (64 - nbits)) >> (64 - 8 + m_offset);
|
|
m_offset += bits;
|
|
nbits -= bits;
|
|
|
|
if (m_offset == 8) {
|
|
Flush();
|
|
}
|
|
}
|
|
}
|
|
|
|
/** Flush any unwritten bits to the output stream, padding with 0's to the
|
|
* next byte boundary.
|
|
*/
|
|
void Flush() {
|
|
if (m_offset == 0) {
|
|
return;
|
|
}
|
|
|
|
m_ostream << m_buffer;
|
|
m_buffer = 0;
|
|
m_offset = 0;
|
|
}
|
|
};
|
|
|
|
/** Non-refcounted RAII wrapper for FILE*
|
|
*
|
|
* Will automatically close the file when it goes out of scope if not null.
|
|
* If you're returning the file pointer, return file.release().
|
|
* If you need to close the file early, use autofile.fclose() instead of fclose(underlying_FILE).
|
|
*
|
|
* @note If the file has been written to, then the caller must close it
|
|
* explicitly with the `fclose()` method, check if it returns an error and treat
|
|
* such an error as if the `write()` method failed. The OS's `fclose(3)` may
|
|
* fail to flush to disk data that has been previously written, rendering the
|
|
* file corrupt.
|
|
*/
|
|
class AutoFile
|
|
{
|
|
protected:
|
|
std::FILE* m_file;
|
|
Obfuscation m_obfuscation;
|
|
std::optional<int64_t> m_position;
|
|
bool m_was_written{false};
|
|
|
|
public:
|
|
explicit AutoFile(std::FILE* file, const Obfuscation& obfuscation = {});
|
|
|
|
~AutoFile()
|
|
{
|
|
if (m_was_written) {
|
|
// Callers that wrote to the file must have closed it explicitly
|
|
// with the fclose() method and checked that the close succeeded.
|
|
// This is because here in the destructor we have no way to signal
|
|
// errors from fclose() which, after write, could mean the file is
|
|
// corrupted and must be handled properly at the call site.
|
|
// Destructors in C++ cannot signal an error to the callers because
|
|
// they do not return a value and are not allowed to throw exceptions.
|
|
Assume(IsNull());
|
|
}
|
|
|
|
if (fclose() != 0) {
|
|
LogError("Failed to close file: %s", SysErrorString(errno));
|
|
}
|
|
}
|
|
|
|
// Disallow copies
|
|
AutoFile(const AutoFile&) = delete;
|
|
AutoFile& operator=(const AutoFile&) = delete;
|
|
|
|
bool feof() const { return std::feof(m_file); }
|
|
|
|
[[nodiscard]] int fclose()
|
|
{
|
|
if (auto rel{release()}) return std::fclose(rel);
|
|
return 0;
|
|
}
|
|
|
|
/** Get wrapped FILE* with transfer of ownership.
|
|
* @note This will invalidate the AutoFile object, and makes it the responsibility of the caller
|
|
* of this function to clean up the returned FILE*.
|
|
*/
|
|
std::FILE* release()
|
|
{
|
|
std::FILE* ret{m_file};
|
|
m_file = nullptr;
|
|
return ret;
|
|
}
|
|
|
|
/** Return true if the wrapped FILE* is nullptr, false otherwise.
|
|
*/
|
|
bool IsNull() const { return m_file == nullptr; }
|
|
|
|
/** Continue with a different XOR key */
|
|
void SetObfuscation(const Obfuscation& obfuscation) { m_obfuscation = obfuscation; }
|
|
|
|
/** Implementation detail, only used internally. */
|
|
std::size_t detail_fread(std::span<std::byte> dst);
|
|
|
|
/** Wrapper around fseek(). Will throw if seeking is not possible. */
|
|
void seek(int64_t offset, int origin);
|
|
|
|
/** Find position within the file. Will throw if unknown. */
|
|
int64_t tell();
|
|
|
|
/** Return the size of the file. Will throw if unknown. */
|
|
int64_t size();
|
|
|
|
/** Wrapper around FileCommit(). */
|
|
bool Commit();
|
|
|
|
/** Wrapper around TruncateFile(). */
|
|
bool Truncate(unsigned size);
|
|
|
|
//! Write a mutable buffer more efficiently than write(), obfuscating the buffer in-place.
|
|
void write_buffer(std::span<std::byte> src);
|
|
|
|
//
|
|
// Stream subset
|
|
//
|
|
void read(std::span<std::byte> dst);
|
|
void ignore(size_t nSize);
|
|
void write(std::span<const std::byte> src);
|
|
|
|
template <typename T>
|
|
AutoFile& operator<<(const T& obj)
|
|
{
|
|
::Serialize(*this, obj);
|
|
return *this;
|
|
}
|
|
|
|
template <typename T>
|
|
AutoFile& operator>>(T&& obj)
|
|
{
|
|
::Unserialize(*this, obj);
|
|
return *this;
|
|
}
|
|
};
|
|
|
|
using DataBuffer = std::vector<std::byte>;
|
|
|
|
/** Wrapper around an AutoFile& that implements a ring buffer to
|
|
* deserialize from. It guarantees the ability to rewind a given number of bytes.
|
|
*
|
|
* Will automatically close the file when it goes out of scope if not null.
|
|
* If you need to close the file early, use file.fclose() instead of fclose(file).
|
|
*/
|
|
class BufferedFile
|
|
{
|
|
private:
|
|
AutoFile& m_src;
|
|
uint64_t nSrcPos{0}; //!< how many bytes have been read from source
|
|
uint64_t m_read_pos{0}; //!< how many bytes have been read from this
|
|
uint64_t nReadLimit; //!< up to which position we're allowed to read
|
|
uint64_t nRewind; //!< how many bytes we guarantee to rewind
|
|
DataBuffer vchBuf;
|
|
|
|
//! read data from the source to fill the buffer
|
|
bool Fill() {
|
|
unsigned int pos = nSrcPos % vchBuf.size();
|
|
unsigned int readNow = vchBuf.size() - pos;
|
|
unsigned int nAvail = vchBuf.size() - (nSrcPos - m_read_pos) - nRewind;
|
|
if (nAvail < readNow)
|
|
readNow = nAvail;
|
|
if (readNow == 0)
|
|
return false;
|
|
size_t nBytes{m_src.detail_fread(std::span{vchBuf}.subspan(pos, readNow))};
|
|
if (nBytes == 0) {
|
|
throw std::ios_base::failure{m_src.feof() ? "BufferedFile::Fill: end of file" : "BufferedFile::Fill: fread failed"};
|
|
}
|
|
nSrcPos += nBytes;
|
|
return true;
|
|
}
|
|
|
|
//! Advance the stream's read pointer (m_read_pos) by up to 'length' bytes,
|
|
//! filling the buffer from the file so that at least one byte is available.
|
|
//! Return a pointer to the available buffer data and the number of bytes
|
|
//! (which may be less than the requested length) that may be accessed
|
|
//! beginning at that pointer.
|
|
std::pair<std::byte*, size_t> AdvanceStream(size_t length)
|
|
{
|
|
assert(m_read_pos <= nSrcPos);
|
|
if (m_read_pos + length > nReadLimit) {
|
|
throw std::ios_base::failure("Attempt to position past buffer limit");
|
|
}
|
|
// If there are no bytes available, read from the file.
|
|
if (m_read_pos == nSrcPos && length > 0) Fill();
|
|
|
|
size_t buffer_offset{static_cast<size_t>(m_read_pos % vchBuf.size())};
|
|
size_t buffer_available{static_cast<size_t>(vchBuf.size() - buffer_offset)};
|
|
size_t bytes_until_source_pos{static_cast<size_t>(nSrcPos - m_read_pos)};
|
|
size_t advance{std::min({length, buffer_available, bytes_until_source_pos})};
|
|
m_read_pos += advance;
|
|
return std::make_pair(&vchBuf[buffer_offset], advance);
|
|
}
|
|
|
|
public:
|
|
BufferedFile(AutoFile& file LIFETIMEBOUND, uint64_t nBufSize, uint64_t nRewindIn)
|
|
: m_src{file}, nReadLimit{std::numeric_limits<uint64_t>::max()}, nRewind{nRewindIn}, vchBuf(nBufSize, std::byte{0})
|
|
{
|
|
if (nRewindIn >= nBufSize)
|
|
throw std::ios_base::failure("Rewind limit must be less than buffer size");
|
|
}
|
|
|
|
//! check whether we're at the end of the source file
|
|
bool eof() const {
|
|
return m_read_pos == nSrcPos && m_src.feof();
|
|
}
|
|
|
|
//! read a number of bytes
|
|
void read(std::span<std::byte> dst)
|
|
{
|
|
while (dst.size() > 0) {
|
|
auto [buffer_pointer, length]{AdvanceStream(dst.size())};
|
|
memcpy(dst.data(), buffer_pointer, length);
|
|
dst = dst.subspan(length);
|
|
}
|
|
}
|
|
|
|
//! Move the read position ahead in the stream to the given position.
|
|
//! Use SetPos() to back up in the stream, not SkipTo().
|
|
void SkipTo(const uint64_t file_pos)
|
|
{
|
|
assert(file_pos >= m_read_pos);
|
|
while (m_read_pos < file_pos) AdvanceStream(file_pos - m_read_pos);
|
|
}
|
|
|
|
//! return the current reading position
|
|
uint64_t GetPos() const {
|
|
return m_read_pos;
|
|
}
|
|
|
|
//! rewind to a given reading position
|
|
bool SetPos(uint64_t nPos) {
|
|
size_t bufsize = vchBuf.size();
|
|
if (nPos + bufsize < nSrcPos) {
|
|
// rewinding too far, rewind as far as possible
|
|
m_read_pos = nSrcPos - bufsize;
|
|
return false;
|
|
}
|
|
if (nPos > nSrcPos) {
|
|
// can't go this far forward, go as far as possible
|
|
m_read_pos = nSrcPos;
|
|
return false;
|
|
}
|
|
m_read_pos = nPos;
|
|
return true;
|
|
}
|
|
|
|
//! prevent reading beyond a certain position
|
|
//! no argument removes the limit
|
|
bool SetLimit(uint64_t nPos = std::numeric_limits<uint64_t>::max()) {
|
|
if (nPos < m_read_pos)
|
|
return false;
|
|
nReadLimit = nPos;
|
|
return true;
|
|
}
|
|
|
|
template<typename T>
|
|
BufferedFile& operator>>(T&& obj) {
|
|
::Unserialize(*this, obj);
|
|
return (*this);
|
|
}
|
|
|
|
//! search for a given byte in the stream, and remain positioned on it
|
|
void FindByte(std::byte byte)
|
|
{
|
|
// For best performance, avoid mod operation within the loop.
|
|
size_t buf_offset{size_t(m_read_pos % uint64_t(vchBuf.size()))};
|
|
while (true) {
|
|
if (m_read_pos == nSrcPos) {
|
|
// No more bytes available; read from the file into the buffer,
|
|
// setting nSrcPos to one beyond the end of the new data.
|
|
// Throws exception if end-of-file reached.
|
|
Fill();
|
|
}
|
|
const size_t len{std::min<size_t>(vchBuf.size() - buf_offset, nSrcPos - m_read_pos)};
|
|
const auto it_start{vchBuf.begin() + buf_offset};
|
|
const auto it_find{std::find(it_start, it_start + len, byte)};
|
|
const size_t inc{size_t(std::distance(it_start, it_find))};
|
|
m_read_pos += inc;
|
|
if (inc < len) break;
|
|
buf_offset += inc;
|
|
if (buf_offset >= vchBuf.size()) buf_offset = 0;
|
|
}
|
|
}
|
|
};
|
|
|
|
/**
|
|
* Wrapper that buffers reads from an underlying stream.
|
|
* Requires underlying stream to support read() and detail_fread() calls
|
|
* to support fixed-size and variable-sized reads, respectively.
|
|
*/
|
|
template <typename S>
|
|
class BufferedReader
|
|
{
|
|
S& m_src;
|
|
DataBuffer m_buf;
|
|
size_t m_buf_pos;
|
|
|
|
public:
|
|
//! Requires stream ownership to prevent leaving the stream at an unexpected position after buffered reads.
|
|
explicit BufferedReader(S&& stream LIFETIMEBOUND, size_t size = 1 << 16)
|
|
requires std::is_rvalue_reference_v<S&&>
|
|
: m_src{stream}, m_buf(size), m_buf_pos{size} {}
|
|
|
|
void read(std::span<std::byte> dst)
|
|
{
|
|
if (const auto available{std::min(dst.size(), m_buf.size() - m_buf_pos)}) {
|
|
std::copy_n(m_buf.begin() + m_buf_pos, available, dst.begin());
|
|
m_buf_pos += available;
|
|
dst = dst.subspan(available);
|
|
}
|
|
if (dst.size()) {
|
|
assert(m_buf_pos == m_buf.size());
|
|
m_src.read(dst);
|
|
|
|
m_buf_pos = 0;
|
|
m_buf.resize(m_src.detail_fread(m_buf));
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
BufferedReader& operator>>(T&& obj)
|
|
{
|
|
Unserialize(*this, obj);
|
|
return *this;
|
|
}
|
|
};
|
|
|
|
/**
|
|
* Wrapper that buffers writes to an underlying stream.
|
|
* Requires underlying stream to support write_buffer() method
|
|
* for efficient buffer flushing and obfuscation.
|
|
*/
|
|
template <typename S>
|
|
class BufferedWriter
|
|
{
|
|
S& m_dst;
|
|
DataBuffer m_buf;
|
|
size_t m_buf_pos{0};
|
|
|
|
public:
|
|
explicit BufferedWriter(S& stream LIFETIMEBOUND, size_t size = 1 << 16) : m_dst{stream}, m_buf(size) {}
|
|
|
|
~BufferedWriter() { flush(); }
|
|
|
|
void flush()
|
|
{
|
|
if (m_buf_pos) m_dst.write_buffer(std::span{m_buf}.first(m_buf_pos));
|
|
m_buf_pos = 0;
|
|
}
|
|
|
|
void write(std::span<const std::byte> src)
|
|
{
|
|
while (const auto available{std::min(src.size(), m_buf.size() - m_buf_pos)}) {
|
|
std::copy_n(src.begin(), available, m_buf.begin() + m_buf_pos);
|
|
m_buf_pos += available;
|
|
if (m_buf_pos == m_buf.size()) flush();
|
|
src = src.subspan(available);
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
BufferedWriter& operator<<(const T& obj)
|
|
{
|
|
Serialize(*this, obj);
|
|
return *this;
|
|
}
|
|
};
|
|
|
|
#endif // BITCOIN_STREAMS_H
|