forked from premiere/premiere-libtorrent
only save pieces in resume data that have actually been checked
This commit is contained in:
parent
a675a749e0
commit
5cf36fd1d6
|
@ -6724,7 +6724,7 @@ namespace libtorrent
|
||||||
// must be ordered in increasing order
|
// must be ordered in increasing order
|
||||||
static const country_entry country_map[] =
|
static const country_entry country_map[] =
|
||||||
{
|
{
|
||||||
{ 4, "AF"}, { 8, "AL"}, { 10, "AQ"}, { 12, "DZ"}, { 16, "AS"}
|
{ 4, "AF"}, { 8, "AL"}, { 10, "AQ"}, { 12, "DZ"}, { 16, "AS"}
|
||||||
, { 20, "AD"}, { 24, "AO"}, { 28, "AG"}, { 31, "AZ"}, { 32, "AR"}
|
, { 20, "AD"}, { 24, "AO"}, { 28, "AG"}, { 31, "AZ"}, { 32, "AR"}
|
||||||
, { 36, "AU"}, { 40, "AT"}, { 44, "BS"}, { 48, "BH"}, { 50, "BD"}
|
, { 36, "AU"}, { 40, "AT"}, { 44, "BS"}, { 48, "BH"}, { 50, "BD"}
|
||||||
, { 51, "AM"}, { 52, "BB"}, { 56, "BE"}, { 60, "BM"}, { 64, "BT"}
|
, { 51, "AM"}, { 52, "BB"}, { 56, "BE"}, { 60, "BM"}, { 64, "BT"}
|
||||||
|
@ -7261,24 +7261,42 @@ namespace libtorrent
|
||||||
// for the piece
|
// for the piece
|
||||||
// bit 0: set if we have the piece
|
// bit 0: set if we have the piece
|
||||||
// bit 1: set if we have verified the piece (in seed mode)
|
// bit 1: set if we have verified the piece (in seed mode)
|
||||||
entry::string_type& pieces = ret["pieces"].string();
|
bool const is_checking = state() == torrent_status::checking_files;
|
||||||
pieces.resize(m_torrent_file->num_pieces());
|
bool const has_checked = state() == torrent_status::downloading
|
||||||
if (!has_picker())
|
|| state() == torrent_status::finished
|
||||||
{
|
|| state() == torrent_status::seeding;
|
||||||
std::memset(&pieces[0], m_have_all, pieces.size());
|
|
||||||
}
|
|
||||||
else if (has_picker())
|
|
||||||
{
|
|
||||||
for (int i = 0, end(pieces.size()); i < end; ++i)
|
|
||||||
pieces[i] = m_picker->have_piece(i) ? 1 : 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (m_seed_mode)
|
// if we are checking, only save the have_pieces bitfield up to the piece
|
||||||
|
// we have actually checked. This allows us to resume the checking when we
|
||||||
|
// load this torrent up again. If we have not completed checking nor is
|
||||||
|
// currently checking, don't save any pieces from the have_pieces
|
||||||
|
// bitfield.
|
||||||
|
int const max_piece
|
||||||
|
= is_checking ? m_num_checked_pieces
|
||||||
|
: has_checked ? m_torrent_file->num_pieces()
|
||||||
|
: 0;
|
||||||
|
|
||||||
|
if (max_piece > 0)
|
||||||
{
|
{
|
||||||
TORRENT_ASSERT(m_verified.size() == pieces.size());
|
entry::string_type& pieces = ret["pieces"].string();
|
||||||
TORRENT_ASSERT(m_verifying.size() == pieces.size());
|
pieces.resize(max_piece);
|
||||||
for (int i = 0, end(pieces.size()); i < end; ++i)
|
if (!has_picker())
|
||||||
pieces[i] |= m_verified[i] ? 2 : 0;
|
{
|
||||||
|
std::memset(&pieces[0], m_have_all, pieces.size());
|
||||||
|
}
|
||||||
|
else if (has_picker())
|
||||||
|
{
|
||||||
|
for (int i = 0, end(pieces.size()); i < end; ++i)
|
||||||
|
pieces[i] = m_picker->have_piece(i) ? 1 : 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (m_seed_mode)
|
||||||
|
{
|
||||||
|
TORRENT_ASSERT(m_verified.size() == pieces.size());
|
||||||
|
TORRENT_ASSERT(m_verifying.size() == pieces.size());
|
||||||
|
for (int i = 0, end(pieces.size()); i < end; ++i)
|
||||||
|
pieces[i] |= m_verified[i] ? 2 : 0;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// write renamed files
|
// write renamed files
|
||||||
|
|
Loading…
Reference in New Issue