transmission/libtransmission/cache.cc

255 lines
7.1 KiB
C++

// This file Copyright © Mnemosyne LLC.
// It may be used under GPLv2 (SPDX: GPL-2.0-only), GPLv3 (SPDX: GPL-3.0-only),
// or any future license endorsed by Mnemosyne LLC.
// License text can be found in the licenses/ folder.
#include <algorithm>
#include <cerrno> // EINVAL
#include <cstddef>
#include <cstdint> // uint8_t
#include <iterator> // std::distance(), std::next(), std::prev()
#include <memory>
#include <mutex>
#include <numeric> // std::accumulate()
#include <utility> // std::make_pair()
#include <vector>
#include <fmt/core.h>
#include "libtransmission/transmission.h"
#include "libtransmission/cache.h"
#include "libtransmission/inout.h"
#include "libtransmission/log.h"
#include "libtransmission/torrent.h"
#include "libtransmission/torrents.h"
#include "libtransmission/tr-assert.h"
Cache::Key Cache::make_key(tr_torrent const& tor, tr_block_info::Location const loc) noexcept
{
return std::make_pair(tor.id(), loc.block);
}
Cache::CIter Cache::find_span_end(CIter span_begin, CIter end) noexcept
{
static constexpr auto NotAdjacent = [](CacheBlock const& block1, CacheBlock const& block2)
{
return block1.key.first != block2.key.first || block1.key.second + 1 != block2.key.second;
};
auto const span_end = std::adjacent_find(span_begin, end, NotAdjacent);
return span_end == end ? end : std::next(span_end);
}
std::pair<Cache::CIter, Cache::CIter> Cache::find_biggest_span(CIter const begin, CIter const end) noexcept
{
auto biggest_begin = begin;
auto biggest_end = begin;
auto biggest_len = std::distance(biggest_begin, biggest_end);
for (auto span_begin = begin; span_begin < end;)
{
auto span_end = find_span_end(span_begin, end);
auto const len = std::distance(span_begin, span_end);
if (len > biggest_len)
{
biggest_begin = span_begin;
biggest_end = span_end;
biggest_len = len;
}
std::advance(span_begin, len);
}
return { biggest_begin, biggest_end };
}
int Cache::write_contiguous(CIter const begin, CIter const end) const
{
// The most common case without an extra data copy.
auto const* out = std::data(*begin->buf);
auto outlen = std::size(*begin->buf);
// Contiguous area to join more than one block, if any.
auto buf = std::vector<uint8_t>{};
if (end - begin > 1)
{
// copy blocks into contiguous memory
auto const buflen = std::accumulate(
begin,
end,
size_t{},
[](size_t sum, auto const& block) { return sum + std::size(*block.buf); });
buf.resize(buflen);
auto* walk = std::data(buf);
for (auto iter = begin; iter != end; ++iter)
{
TR_ASSERT(begin->key.first == iter->key.first);
TR_ASSERT(begin->key.second + std::distance(begin, iter) == iter->key.second);
walk = std::copy_n(std::data(*iter->buf), std::size(*iter->buf), walk);
}
TR_ASSERT(std::data(buf) + std::size(buf) == walk);
out = std::data(buf);
outlen = std::size(buf);
}
// save it
auto const& [torrent_id, block] = begin->key;
auto* const tor = torrents_.get(torrent_id);
if (tor == nullptr)
{
return EINVAL;
}
auto const loc = tor->block_loc(block);
if (auto const err = tr_ioWrite(*tor, loc, outlen, out); err != 0)
{
return err;
}
++disk_writes_;
disk_write_bytes_ += outlen;
return {};
}
int Cache::set_limit(Memory const max_size)
{
max_blocks_ = get_max_blocks(max_size);
tr_logAddDebug(fmt::format("Maximum cache size set to {} ({} blocks)", max_size.to_string(), max_blocks_));
return cache_trim();
}
Cache::Cache(tr_torrents const& torrents, Memory const max_size)
: torrents_{ torrents }
, max_blocks_{ get_max_blocks(max_size) }
{
}
// ---
int Cache::write_block(tr_torrent_id_t const tor_id, tr_block_index_t const block, std::unique_ptr<BlockData> writeme)
{
if (max_blocks_ == 0U)
{
TR_ASSERT(std::empty(blocks_));
// Bypass cache. This may be helpful for those whose filesystem
// already has a cache layer for the very purpose of this cache
// https://github.com/transmission/transmission/pull/5668
auto* const tor = torrents_.get(tor_id);
return tor == nullptr ? EINVAL : tr_ioWrite(*tor, tor->block_loc(block), std::size(*writeme), std::data(*writeme));
}
auto const key = Key{ tor_id, block };
auto iter = std::lower_bound(std::begin(blocks_), std::end(blocks_), key, CompareCacheBlockByKey);
if (iter == std::end(blocks_) || iter->key != key)
{
iter = blocks_.emplace(iter);
iter->key = key;
}
iter->buf = std::move(writeme);
++cache_writes_;
cache_write_bytes_ += std::size(*iter->buf);
return cache_trim();
}
Cache::CIter Cache::get_block(tr_torrent const& tor, tr_block_info::Location const& loc) noexcept
{
if (auto const [begin, end] = std::equal_range(
std::begin(blocks_),
std::end(blocks_),
make_key(tor, loc),
CompareCacheBlockByKey);
begin < end)
{
return begin;
}
return std::end(blocks_);
}
int Cache::read_block(tr_torrent const& tor, tr_block_info::Location const& loc, size_t len, uint8_t* setme)
{
if (auto const iter = get_block(tor, loc); iter != std::end(blocks_))
{
std::copy_n(std::begin(*iter->buf), len, setme);
return {};
}
return tr_ioRead(tor, loc, len, setme);
}
// ---
int Cache::flush_span(CIter const begin, CIter const end)
{
for (auto span_begin = begin; span_begin < end;)
{
auto const span_end = find_span_end(span_begin, end);
if (auto const err = write_contiguous(span_begin, span_end); err != 0)
{
return err;
}
span_begin = span_end;
}
blocks_.erase(begin, end);
return {};
}
int Cache::flush_file(tr_torrent const& tor, tr_file_index_t const file)
{
auto const tor_id = tor.id();
auto const [block_begin, block_end] = tor.block_span_for_file(file);
return flush_span(
std::lower_bound(std::begin(blocks_), std::end(blocks_), std::make_pair(tor_id, block_begin), CompareCacheBlockByKey),
std::lower_bound(std::begin(blocks_), std::end(blocks_), std::make_pair(tor_id, block_end), CompareCacheBlockByKey));
}
int Cache::flush_torrent(tr_torrent_id_t const tor_id)
{
return flush_span(
std::lower_bound(std::begin(blocks_), std::end(blocks_), std::make_pair(tor_id, 0), CompareCacheBlockByKey),
std::lower_bound(std::begin(blocks_), std::end(blocks_), std::make_pair(tor_id + 1, 0), CompareCacheBlockByKey));
}
int Cache::flush_biggest()
{
auto const [begin, end] = find_biggest_span(std::begin(blocks_), std::end(blocks_));
if (begin == end) // nothing to flush
{
return 0;
}
if (auto const err = write_contiguous(begin, end); err != 0)
{
return err;
}
blocks_.erase(begin, end);
return 0;
}
int Cache::cache_trim()
{
while (std::size(blocks_) > max_blocks_)
{
if (auto const err = flush_biggest(); err != 0)
{
return err;
}
}
return 0;
}