transmission/libtransmission/torrent-magnet.cc

411 lines
10 KiB
C++
Raw Normal View History

2009-11-24 02:16:31 +00:00
/*
* This file Copyright (C) 2012-2014 Mnemosyne LLC
2009-11-24 02:16:31 +00:00
*
* It may be used under the GNU GPL versions 2 or 3
* or any future license endorsed by Mnemosyne LLC.
2009-11-24 02:16:31 +00:00
*
*/
#include <algorithm>
#include <climits> /* INT_MAX */
#include <ctime>
#include <string>
#include <string_view>
2009-11-24 02:16:31 +00:00
#include <event2/buffer.h>
2009-11-24 02:16:31 +00:00
#include "transmission.h"
#include "crypto-utils.h" /* tr_sha1() */
2022-01-11 14:28:14 +00:00
#include "error.h"
#include "file.h"
#include "log.h"
#include "magnet-metainfo.h"
#include "resume.h"
2009-11-24 02:16:31 +00:00
#include "torrent-magnet.h"
2022-01-11 14:28:14 +00:00
#include "torrent-metainfo.h"
#include "torrent.h"
#include "tr-assert.h"
2009-11-24 02:16:31 +00:00
#include "utils.h"
#include "variant.h"
#include "web-utils.h"
2009-11-24 02:16:31 +00:00
using namespace std::literals;
#define dbgmsg(tor, ...) tr_logAddDeepNamed(tr_torrentName(tor), __VA_ARGS__)
2009-11-24 02:16:31 +00:00
/***
****
***/
/* don't ask for the same metadata piece more than this often */
static auto constexpr MinRepeatIntervalSecs = int{ 3 };
2009-11-24 02:16:31 +00:00
struct metadata_node
{
time_t requestedAt;
int piece;
2009-11-24 02:16:31 +00:00
};
struct tr_incomplete_metadata
{
char* metadata;
size_t metadata_size;
int pieceCount;
2009-11-24 02:16:31 +00:00
/** sorted from least to most recently requested */
struct metadata_node* piecesNeeded;
int piecesNeededCount;
2009-11-24 02:16:31 +00:00
};
static void incompleteMetadataFree(struct tr_incomplete_metadata* m)
2009-11-24 02:16:31 +00:00
{
tr_free(m->metadata);
tr_free(m->piecesNeeded);
tr_free(m);
2009-11-24 02:16:31 +00:00
}
bool tr_torrentSetMetadataSizeHint(tr_torrent* tor, int64_t size)
2009-11-24 02:16:31 +00:00
{
if (tor->hasMetadata())
{
return false;
}
if (tor->incompleteMetadata != nullptr)
{
return false;
}
int const n = (size <= 0 || size > INT_MAX) ? -1 : size / METADATA_PIECE_SIZE + (size % METADATA_PIECE_SIZE != 0 ? 1 : 0);
dbgmsg(tor, "metadata is %" PRId64 " bytes in %d pieces", size, n);
if (n <= 0)
{
return false;
}
2022-01-17 18:39:50 +00:00
auto* const m = tr_new(struct tr_incomplete_metadata, 1);
if (m == nullptr)
{
return false;
}
m->pieceCount = n;
m->metadata = tr_new(char, size);
m->metadata_size = size;
m->piecesNeededCount = n;
m->piecesNeeded = tr_new(struct metadata_node, n);
if (m->metadata == nullptr || m->piecesNeeded == nullptr)
2009-11-24 02:16:31 +00:00
{
incompleteMetadataFree(m);
return false;
}
2009-11-24 02:16:31 +00:00
for (int i = 0; i < n; ++i)
{
m->piecesNeeded[i].piece = i;
m->piecesNeeded[i].requestedAt = 0;
2009-11-24 02:16:31 +00:00
}
tor->incompleteMetadata = m;
return true;
2009-11-24 02:16:31 +00:00
}
2022-01-17 18:39:50 +00:00
void* tr_torrentGetMetadataPiece(tr_torrent const* tor, int piece, size_t* len)
2009-11-24 02:16:31 +00:00
{
TR_ASSERT(tr_isTorrent(tor));
TR_ASSERT(piece >= 0);
TR_ASSERT(len != nullptr);
2009-11-24 02:16:31 +00:00
if (!tor->hasMetadata())
{
return nullptr;
}
auto const fd = tr_sys_file_open(tor->torrentFile().c_str(), TR_SYS_FILE_READ, 0, nullptr);
if (fd == TR_BAD_SYS_FILE)
2009-11-24 02:16:31 +00:00
{
return nullptr;
}
auto const info_dict_size = tor->infoDictSize();
TR_ASSERT(info_dict_size > 0);
char* ret = nullptr;
if (size_t o = piece * METADATA_PIECE_SIZE; tr_sys_file_seek(fd, tor->infoDictOffset() + o, TR_SEEK_SET, nullptr, nullptr))
{
size_t const l = o + METADATA_PIECE_SIZE <= info_dict_size ? METADATA_PIECE_SIZE : info_dict_size - o;
if (0 < l && l <= METADATA_PIECE_SIZE)
2009-11-24 02:16:31 +00:00
{
2022-01-17 18:39:50 +00:00
auto* buf = tr_new(char, l);
auto n = uint64_t{};
2009-11-24 02:16:31 +00:00
if (tr_sys_file_read(fd, buf, l, &n, nullptr) && n == l)
2009-11-24 02:16:31 +00:00
{
*len = l;
ret = buf;
buf = nullptr;
2009-11-24 02:16:31 +00:00
}
tr_free(buf);
2009-11-24 02:16:31 +00:00
}
}
tr_sys_file_close(fd, nullptr);
2015-05-09 08:37:55 +00:00
TR_ASSERT(ret == nullptr || *len > 0);
return ret;
2009-11-24 02:16:31 +00:00
}
static int getPieceNeededIndex(struct tr_incomplete_metadata const* m, int piece)
{
for (int i = 0; i < m->piecesNeededCount; ++i)
{
if (m->piecesNeeded[i].piece == piece)
{
return i;
}
}
return -1;
}
static int getPieceLength(struct tr_incomplete_metadata const* m, int piece)
{
return piece + 1 == m->pieceCount ? // last piece
m->metadata_size - (piece * METADATA_PIECE_SIZE) :
METADATA_PIECE_SIZE;
}
static void tr_buildMetainfoExceptInfoDict(tr_torrent_metainfo const& tm, tr_variant* top)
{
2022-01-11 14:28:14 +00:00
tr_variantInitDict(top, 6);
if (auto const& val = tm.comment(); !std::empty(val))
{
2022-01-11 14:28:14 +00:00
tr_variantDictAddStr(top, TR_KEY_comment, val);
}
2022-01-11 14:28:14 +00:00
if (auto const& val = tm.source(); !std::empty(val))
{
2022-01-11 14:28:14 +00:00
tr_variantDictAddStr(top, TR_KEY_source, val);
}
2022-01-11 14:28:14 +00:00
if (auto const& val = tm.creator(); !std::empty(val))
{
2022-01-11 14:28:14 +00:00
tr_variantDictAddStr(top, TR_KEY_created_by, val);
}
2022-01-11 14:28:14 +00:00
if (auto const val = tm.dateCreated(); val != 0)
{
tr_variantDictAddInt(top, TR_KEY_creation_date, val);
}
2022-01-11 14:28:14 +00:00
if (auto const& announce_list = tm.announceList(); !std::empty(announce_list))
{
auto const n = std::size(announce_list);
if (n == 1)
{
2022-01-11 14:28:14 +00:00
tr_variantDictAddStr(top, TR_KEY_announce, announce_list.at(0).announce_str.sv());
}
2022-01-11 14:28:14 +00:00
else
{
auto* const announce_list_variant = tr_variantDictAddList(top, TR_KEY_announce_list, n);
tr_variant* tier_variant = nullptr;
auto current_tier = std::optional<tr_tracker_tier_t>{};
for (auto const& tracker : announce_list)
{
if (!current_tier || *current_tier != tracker.tier)
{
tier_variant = tr_variantListAddList(announce_list_variant, n);
}
tr_variantListAddStr(tier_variant, tracker.announce_str.sv());
}
}
}
2022-01-11 14:28:14 +00:00
if (auto const n_webseeds = tm.webseedCount(); n_webseeds > 0)
{
auto* const webseeds_variant = tr_variantDictAddList(top, TR_KEY_url_list, n_webseeds);
for (size_t i = 0; i < n_webseeds; ++i)
{
2022-01-11 14:28:14 +00:00
tr_variantListAddStr(webseeds_variant, tm.webseed(i));
}
}
}
2022-01-17 18:39:50 +00:00
static bool useNewMetainfo(tr_torrent* tor, tr_incomplete_metadata const* m, tr_error** error)
2022-01-11 14:28:14 +00:00
{
2022-01-17 18:39:50 +00:00
// test the info_dict checksum
2022-01-11 14:28:14 +00:00
auto const sha1 = tr_sha1(std::string_view{ m->metadata, m->metadata_size });
2022-01-17 18:39:50 +00:00
if (bool const checksum_passed = sha1 && *sha1 == tor->infoHash(); !checksum_passed)
2022-01-11 14:28:14 +00:00
{
return false;
}
// checksum passed; now try to parse it as benc
auto info_dict_v = tr_variant{};
2022-01-17 18:39:50 +00:00
if (!tr_variantFromBuf(
&info_dict_v,
TR_VARIANT_PARSE_BENC | TR_VARIANT_PARSE_INPLACE,
{ m->metadata, m->metadata_size },
nullptr,
error))
2022-01-11 14:28:14 +00:00
{
return false;
}
2022-01-11 14:28:14 +00:00
// yay we have an info dict. Let's make a .torrent file
auto top_v = tr_variant{};
tr_buildMetainfoExceptInfoDict(tor->metainfo_, &top_v);
2022-01-11 14:28:14 +00:00
tr_variantMergeDicts(tr_variantDictAddDict(&top_v, TR_KEY_info, 0), &info_dict_v);
auto const benc = tr_variantToStr(&top_v, TR_VARIANT_FMT_BENC);
tr_variantFree(&top_v);
tr_variantFree(&info_dict_v);
// does this synthetic .torrent file parse?
auto metainfo = tr_torrent_metainfo{};
if (!metainfo.parseBenc(benc))
2022-01-11 14:28:14 +00:00
{
return false;
}
2022-01-11 14:28:14 +00:00
// save it
auto const filename = tor->makeTorrentFilename();
2022-01-11 14:28:14 +00:00
if (!tr_saveFile(filename, benc, error))
{
return false;
}
2022-01-11 14:28:14 +00:00
// tor should keep this metainfo
metainfo.setTorrentFile(filename);
tor->setMetainfo(metainfo);
2022-01-11 14:28:14 +00:00
return true;
}
static void onHaveAllMetainfo(tr_torrent* tor, tr_incomplete_metadata* m)
{
2022-01-11 14:28:14 +00:00
tr_error* error = nullptr;
if (useNewMetainfo(tor, m, &error))
{
incompleteMetadataFree(tor->incompleteMetadata);
tor->incompleteMetadata = nullptr;
tor->isStopping = true;
tor->magnetVerify = true;
tor->startAfterVerify = !tor->prefetchMagnetMetadata;
tor->markEdited();
}
else /* drat. */
{
int const n = m->pieceCount;
for (int i = 0; i < n; ++i)
{
m->piecesNeeded[i].piece = i;
m->piecesNeeded[i].requestedAt = 0;
}
m->piecesNeededCount = n;
2022-01-11 14:28:14 +00:00
char const* const msg = error != nullptr && error->message != nullptr ? error->message : "unknown error";
dbgmsg(tor, "metadata error: %s. (trying again; %d pieces left)", msg, n);
tr_error_clear(&error);
}
}
void tr_torrentSetMetadataPiece(tr_torrent* tor, int piece, void const* data, int len)
2009-11-24 02:16:31 +00:00
{
TR_ASSERT(tr_isTorrent(tor));
TR_ASSERT(data != nullptr);
TR_ASSERT(len >= 0);
dbgmsg(tor, "got metadata piece %d of %d bytes", piece, len);
2009-11-24 02:16:31 +00:00
// are we set up to download metadata?
tr_incomplete_metadata* const m = tor->incompleteMetadata;
if (m == nullptr)
{
return;
}
2009-11-24 02:16:31 +00:00
// sanity test: is `piece` in range?
if ((piece < 0) || (piece >= m->pieceCount))
{
return;
}
// sanity test: is `len` the right size?
if (getPieceLength(m, piece) != len)
{
return;
}
2009-11-24 02:16:31 +00:00
// do we need this piece?
int const idx = getPieceNeededIndex(m, piece);
if (idx == -1)
{
return;
}
2009-11-24 02:16:31 +00:00
size_t const offset = piece * METADATA_PIECE_SIZE;
std::copy_n(reinterpret_cast<char const*>(data), len, m->metadata + offset);
2009-11-24 02:16:31 +00:00
tr_removeElementFromArray(m->piecesNeeded, idx, sizeof(struct metadata_node), m->piecesNeededCount);
--m->piecesNeededCount;
2009-11-24 02:16:31 +00:00
dbgmsg(tor, "saving metainfo piece %d... %d remain", piece, m->piecesNeededCount);
2009-11-24 02:16:31 +00:00
/* are we done? */
if (m->piecesNeededCount == 0)
2009-11-24 02:16:31 +00:00
{
dbgmsg(tor, "metainfo piece %d was the last one", piece);
onHaveAllMetainfo(tor, m);
2009-11-24 02:16:31 +00:00
}
}
bool tr_torrentGetNextMetadataRequest(tr_torrent* tor, time_t now, int* setme_piece)
2009-11-24 02:16:31 +00:00
{
TR_ASSERT(tr_isTorrent(tor));
2009-11-24 02:16:31 +00:00
bool have_request = false;
struct tr_incomplete_metadata* m = tor->incompleteMetadata;
2009-11-24 02:16:31 +00:00
if (m != nullptr && m->piecesNeededCount > 0 && m->piecesNeeded[0].requestedAt + MinRepeatIntervalSecs < now)
2009-11-24 02:16:31 +00:00
{
int const piece = m->piecesNeeded[0].piece;
tr_removeElementFromArray(m->piecesNeeded, 0, sizeof(struct metadata_node), m->piecesNeededCount);
2009-11-24 02:16:31 +00:00
int i = m->piecesNeededCount - 1;
m->piecesNeeded[i].piece = piece;
m->piecesNeeded[i].requestedAt = now;
2009-11-24 02:16:31 +00:00
dbgmsg(tor, "next piece to request: %d", piece);
*setme_piece = piece;
have_request = true;
2009-11-24 02:16:31 +00:00
}
return have_request;
2009-11-24 02:16:31 +00:00
}
2009-11-24 17:10:40 +00:00
double tr_torrentGetMetadataPercent(tr_torrent const* tor)
2009-11-24 17:10:40 +00:00
{
if (tor->hasMetadata())
{
return 1.0;
}
auto const* const m = tor->incompleteMetadata;
return m == nullptr || m->pieceCount == 0 ? 0.0 : (m->pieceCount - m->piecesNeededCount) / (double)m->pieceCount;
2009-11-24 17:10:40 +00:00
}
char* tr_torrentGetMagnetLink(tr_torrent const* tor)
{
return tr_strvDup(tor->metainfo_.magnet());
}