2013-10-10 19:00:32 +02:00
|
|
|
/*
|
|
|
|
|
|
|
|
Copyright (c) 2008-2013, Arvid Norberg
|
|
|
|
All rights reserved.
|
|
|
|
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
|
|
modification, are permitted provided that the following conditions
|
|
|
|
are met:
|
|
|
|
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
|
|
notice, this list of conditions and the following disclaimer.
|
|
|
|
* Redistributions in binary form must reproduce the above copyright
|
|
|
|
notice, this list of conditions and the following disclaimer in
|
|
|
|
the documentation and/or other materials provided with the distribution.
|
|
|
|
* Neither the name of the author nor the names of its
|
|
|
|
contributors may be used to endorse or promote products derived
|
|
|
|
from this software without specific prior written permission.
|
|
|
|
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
|
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "libtorrent/session.hpp"
|
|
|
|
#include "libtorrent/session_settings.hpp"
|
|
|
|
#include "libtorrent/alert_types.hpp"
|
|
|
|
#include "libtorrent/bencode.hpp"
|
|
|
|
#include "libtorrent/thread.hpp"
|
|
|
|
#include "libtorrent/time.hpp"
|
|
|
|
#include "libtorrent/file.hpp"
|
2015-09-18 06:23:45 +02:00
|
|
|
#include "libtorrent/torrent_info.hpp"
|
2013-10-10 19:00:32 +02:00
|
|
|
#include <boost/tuple/tuple.hpp>
|
|
|
|
#include <boost/bind.hpp>
|
|
|
|
|
|
|
|
#include "test.hpp"
|
|
|
|
#include "setup_transfer.hpp"
|
2016-08-21 18:15:19 +02:00
|
|
|
#include "settings.hpp"
|
2013-10-10 19:00:32 +02:00
|
|
|
#include <fstream>
|
|
|
|
#include <iostream>
|
|
|
|
|
|
|
|
using namespace libtorrent;
|
2014-07-06 21:18:00 +02:00
|
|
|
namespace lt = libtorrent;
|
2013-10-10 19:00:32 +02:00
|
|
|
using boost::tuples::ignore;
|
|
|
|
|
2014-07-06 21:18:00 +02:00
|
|
|
const int mask = alert::all_categories & ~(alert::performance_warning | alert::stats_notification);
|
2013-10-10 19:00:32 +02:00
|
|
|
|
|
|
|
int peer_disconnects = 0;
|
|
|
|
|
2015-04-03 22:15:48 +02:00
|
|
|
bool on_alert(alert const* a)
|
2013-10-10 19:00:32 +02:00
|
|
|
{
|
2015-06-06 18:10:43 +02:00
|
|
|
if (alert_cast<peer_disconnected_alert>(a))
|
2013-10-10 19:00:32 +02:00
|
|
|
++peer_disconnects;
|
|
|
|
else if (alert_cast<peer_error_alert>(a))
|
|
|
|
++peer_disconnects;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2015-06-06 18:10:43 +02:00
|
|
|
void cleanup()
|
2013-10-10 19:00:32 +02:00
|
|
|
{
|
|
|
|
error_code ec;
|
2015-06-06 18:10:43 +02:00
|
|
|
remove_all("tmp1_priorities", ec);
|
|
|
|
remove_all("tmp2_priorities", ec);
|
|
|
|
remove_all("tmp1_priorities_moved", ec);
|
|
|
|
remove_all("tmp2_priorities_moved", ec);
|
|
|
|
}
|
|
|
|
|
|
|
|
void test_transfer(settings_pack const& sett)
|
|
|
|
{
|
2015-08-20 22:11:04 +02:00
|
|
|
// this allows shutting down the sessions in parallel
|
|
|
|
std::vector<session_proxy> sp;
|
|
|
|
|
2015-06-06 18:10:43 +02:00
|
|
|
cleanup();
|
2013-10-10 19:00:32 +02:00
|
|
|
|
2014-07-06 21:18:00 +02:00
|
|
|
settings_pack pack = sett;
|
2014-11-09 12:17:13 +01:00
|
|
|
|
2013-10-10 19:00:32 +02:00
|
|
|
// we need a short reconnect time since we
|
|
|
|
// finish the torrent and then restart it
|
|
|
|
// immediately to complete the second half.
|
|
|
|
// using a reconnect time > 0 will just add
|
|
|
|
// to the time it will take to complete the test
|
2014-07-06 21:18:00 +02:00
|
|
|
pack.set_int(settings_pack::min_reconnect_time, 0);
|
|
|
|
|
|
|
|
pack.set_bool(settings_pack::enable_outgoing_utp, false);
|
|
|
|
pack.set_bool(settings_pack::enable_incoming_utp, false);
|
|
|
|
pack.set_int(settings_pack::alert_mask, mask);
|
|
|
|
|
|
|
|
pack.set_int(settings_pack::out_enc_policy, settings_pack::pe_disabled);
|
|
|
|
pack.set_int(settings_pack::in_enc_policy, settings_pack::pe_disabled);
|
|
|
|
pack.set_bool(settings_pack::allow_multiple_connections_per_ip, false);
|
|
|
|
pack.set_int(settings_pack::unchoke_slots_limit, 8);
|
|
|
|
|
2015-06-07 23:54:08 +02:00
|
|
|
pack.set_bool(settings_pack::enable_upnp, false);
|
|
|
|
pack.set_bool(settings_pack::enable_natpmp, false);
|
|
|
|
pack.set_bool(settings_pack::enable_lsd, false);
|
|
|
|
pack.set_bool(settings_pack::enable_dht, false);
|
|
|
|
|
2015-06-27 22:16:14 +02:00
|
|
|
pack.set_str(settings_pack::listen_interfaces, "0.0.0.0:48075");
|
|
|
|
pack.set_int(settings_pack::alert_mask, mask);
|
|
|
|
|
|
|
|
lt::session ses1(pack);
|
|
|
|
|
|
|
|
pack.set_str(settings_pack::listen_interfaces, "0.0.0.0:49075");
|
|
|
|
pack.set_int(settings_pack::alert_mask, mask);
|
|
|
|
lt::session ses2(pack);
|
2013-10-10 19:00:32 +02:00
|
|
|
|
|
|
|
torrent_handle tor1;
|
|
|
|
torrent_handle tor2;
|
|
|
|
|
2015-06-06 18:10:43 +02:00
|
|
|
error_code ec;
|
2013-10-10 19:00:32 +02:00
|
|
|
create_directory("tmp1_priority", ec);
|
|
|
|
std::ofstream file("tmp1_priority/temporary");
|
2015-09-20 03:06:56 +02:00
|
|
|
boost::shared_ptr<torrent_info> t = ::create_torrent(&file, "temporary", 16 * 1024, 13, false);
|
2013-10-10 19:00:32 +02:00
|
|
|
file.close();
|
|
|
|
|
|
|
|
wait_for_listen(ses1, "ses1");
|
2017-12-03 14:06:00 +01:00
|
|
|
wait_for_listen(ses2, "ses2");
|
2013-10-10 19:00:32 +02:00
|
|
|
|
|
|
|
peer_disconnects = 0;
|
|
|
|
|
|
|
|
// test using piece sizes smaller than 16kB
|
|
|
|
boost::tie(tor1, tor2, ignore) = setup_transfer(&ses1, &ses2, 0
|
|
|
|
, true, false, true, "_priority", 8 * 1024, &t, false, 0);
|
|
|
|
|
|
|
|
int num_pieces = tor2.torrent_file()->num_pieces();
|
|
|
|
std::vector<int> priorities(num_pieces, 1);
|
|
|
|
// set half of the pieces to priority 0
|
|
|
|
std::fill(priorities.begin(), priorities.begin() + (num_pieces / 2), 0);
|
|
|
|
tor2.prioritize_pieces(priorities);
|
|
|
|
std::cerr << "setting priorities: ";
|
|
|
|
std::copy(priorities.begin(), priorities.end(), std::ostream_iterator<int>(std::cerr, ", "));
|
|
|
|
std::cerr << std::endl;
|
|
|
|
|
|
|
|
for (int i = 0; i < 200; ++i)
|
|
|
|
{
|
|
|
|
print_alerts(ses1, "ses1", true, true, true, &on_alert);
|
|
|
|
print_alerts(ses2, "ses2", true, true, true, &on_alert);
|
|
|
|
|
|
|
|
torrent_status st1 = tor1.status();
|
|
|
|
torrent_status st2 = tor2.status();
|
|
|
|
|
|
|
|
if (i % 10 == 0)
|
|
|
|
{
|
|
|
|
print_ses_rate(i / 10.f, &st1, &st2);
|
|
|
|
}
|
|
|
|
|
|
|
|
// st2 is finished when we have downloaded half of the pieces
|
|
|
|
if (st2.is_finished) break;
|
|
|
|
|
|
|
|
if (st2.state != torrent_status::downloading)
|
|
|
|
{
|
2015-08-20 22:11:04 +02:00
|
|
|
static char const* state_str[] =
|
2013-10-10 19:00:32 +02:00
|
|
|
{"checking (q)", "checking", "dl metadata"
|
|
|
|
, "downloading", "finished", "seeding", "allocating", "checking (r)"};
|
|
|
|
std::cerr << "st2 state: " << state_str[st2.state] << std::endl;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CHECK(st1.state == torrent_status::seeding
|
|
|
|
|| st1.state == torrent_status::checking_files);
|
|
|
|
TEST_CHECK(st2.state == torrent_status::downloading
|
|
|
|
|| st2.state == torrent_status::checking_resume_data);
|
|
|
|
|
|
|
|
if (peer_disconnects >= 2) break;
|
|
|
|
|
|
|
|
// if nothing is being transferred after 2 seconds, we're failing the test
|
|
|
|
if (st1.upload_payload_rate == 0 && i > 20) break;
|
|
|
|
|
|
|
|
test_sleep(100);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CHECK(!tor2.status().is_seeding);
|
|
|
|
TEST_CHECK(tor2.status().is_finished);
|
|
|
|
|
|
|
|
if (tor2.status().is_finished)
|
|
|
|
std::cerr << "torrent is finished (50% complete)" << std::endl;
|
|
|
|
else return;
|
|
|
|
|
2013-10-11 10:36:17 +02:00
|
|
|
std::vector<int> priorities2 = tor2.piece_priorities();
|
|
|
|
std::copy(priorities2.begin(), priorities2.end(), std::ostream_iterator<int>(std::cerr, ", "));
|
|
|
|
std::cerr << std::endl;
|
|
|
|
TEST_CHECK(std::equal(priorities.begin(), priorities.end(), priorities2.begin()));
|
|
|
|
|
2013-10-10 19:00:32 +02:00
|
|
|
std::cerr << "force recheck" << std::endl;
|
|
|
|
tor2.force_recheck();
|
|
|
|
|
2013-10-11 10:36:17 +02:00
|
|
|
priorities2 = tor2.piece_priorities();
|
|
|
|
std::copy(priorities2.begin(), priorities2.end(), std::ostream_iterator<int>(std::cerr, ", "));
|
|
|
|
std::cerr << std::endl;
|
|
|
|
TEST_CHECK(std::equal(priorities.begin(), priorities.end(), priorities2.begin()));
|
|
|
|
|
2013-10-10 19:00:32 +02:00
|
|
|
peer_disconnects = 0;
|
|
|
|
|
2014-01-20 21:26:12 +01:00
|
|
|
// when we're done checking, we're likely to be put in downloading state
|
|
|
|
// for a split second before transitioning to finished. This loop waits
|
|
|
|
// for the finished state
|
|
|
|
torrent_status st2;
|
2013-10-10 19:00:32 +02:00
|
|
|
for (int i = 0; i < 50; ++i)
|
|
|
|
{
|
2014-01-20 21:26:12 +01:00
|
|
|
print_alerts(ses1, "ses1", true, true, true, &on_alert);
|
2013-10-10 19:00:32 +02:00
|
|
|
print_alerts(ses2, "ses2", true, true, true, &on_alert);
|
|
|
|
|
2014-01-20 21:26:12 +01:00
|
|
|
st2 = tor2.status();
|
2013-10-10 19:00:32 +02:00
|
|
|
if (i % 10 == 0)
|
|
|
|
{
|
|
|
|
std::cerr << int(st2.progress * 100) << "% " << std::endl;
|
|
|
|
}
|
2014-01-20 21:26:12 +01:00
|
|
|
if (st2.state == torrent_status::finished) break;
|
2013-10-10 19:00:32 +02:00
|
|
|
test_sleep(100);
|
|
|
|
}
|
|
|
|
|
2014-07-21 05:03:59 +02:00
|
|
|
TEST_EQUAL(st2.state, torrent_status::finished);
|
|
|
|
|
|
|
|
if (st2.state != torrent_status::finished)
|
|
|
|
return;
|
|
|
|
|
|
|
|
std::cerr << "recheck complete" << std::endl;
|
2014-01-20 21:26:12 +01:00
|
|
|
|
2013-10-11 10:36:17 +02:00
|
|
|
priorities2 = tor2.piece_priorities();
|
2014-01-20 21:26:12 +01:00
|
|
|
std::copy(priorities2.begin(), priorities2.end(), std::ostream_iterator<int>(std::cerr, ", "));
|
|
|
|
std::cerr << std::endl;
|
2013-10-10 19:00:32 +02:00
|
|
|
TEST_CHECK(std::equal(priorities.begin(), priorities.end(), priorities2.begin()));
|
|
|
|
|
|
|
|
tor2.pause();
|
2014-07-06 21:18:00 +02:00
|
|
|
wait_for_alert(ses2, torrent_paused_alert::alert_type, "ses2");
|
2013-10-10 19:00:32 +02:00
|
|
|
|
2014-07-06 21:18:00 +02:00
|
|
|
fprintf(stderr, "save resume data\n");
|
2013-10-10 19:00:32 +02:00
|
|
|
tor2.save_resume_data();
|
|
|
|
|
|
|
|
std::vector<char> resume_data;
|
2014-07-06 21:18:00 +02:00
|
|
|
|
2015-03-12 05:34:54 +01:00
|
|
|
time_point start = clock_type::now();
|
2015-04-03 22:15:48 +02:00
|
|
|
while (true)
|
2013-10-10 19:00:32 +02:00
|
|
|
{
|
2015-04-06 01:16:01 +02:00
|
|
|
ses2.wait_for_alert(seconds(10));
|
2015-04-03 22:15:48 +02:00
|
|
|
std::vector<alert*> alerts;
|
|
|
|
ses2.pop_alerts(&alerts);
|
|
|
|
if (alerts.empty()) break;
|
|
|
|
for (std::vector<alert*>::iterator i = alerts.begin()
|
|
|
|
, end(alerts.end()); i != end; ++i)
|
2013-10-10 19:00:32 +02:00
|
|
|
{
|
2015-04-03 22:15:48 +02:00
|
|
|
alert* a = *i;
|
|
|
|
std::cerr << "ses2: " << a->message() << std::endl;
|
|
|
|
if (alert_cast<save_resume_data_alert>(a))
|
|
|
|
{
|
|
|
|
bencode(std::back_inserter(resume_data)
|
2013-10-10 19:00:32 +02:00
|
|
|
, *alert_cast<save_resume_data_alert>(a)->resume_data);
|
2015-04-03 22:15:48 +02:00
|
|
|
fprintf(stderr, "saved resume data\n");
|
2015-04-06 01:16:01 +02:00
|
|
|
goto done;
|
2015-04-03 22:15:48 +02:00
|
|
|
}
|
|
|
|
else if (alert_cast<save_resume_data_failed_alert>(a))
|
|
|
|
{
|
|
|
|
fprintf(stderr, "save resume failed\n");
|
2015-04-06 01:16:01 +02:00
|
|
|
goto done;
|
2015-04-03 22:15:48 +02:00
|
|
|
}
|
|
|
|
if (total_seconds(clock_type::now() - start) > 10)
|
2015-04-06 01:16:01 +02:00
|
|
|
goto done;
|
2014-07-06 21:18:00 +02:00
|
|
|
}
|
2013-10-10 19:00:32 +02:00
|
|
|
}
|
2015-04-06 01:16:01 +02:00
|
|
|
done:
|
2015-06-06 18:10:43 +02:00
|
|
|
TEST_CHECK(resume_data.size());
|
2013-10-10 19:00:32 +02:00
|
|
|
|
2015-04-06 01:16:01 +02:00
|
|
|
if (resume_data.empty())
|
|
|
|
return;
|
|
|
|
|
2015-03-16 05:38:28 +01:00
|
|
|
fprintf(stderr, "%s\n", &resume_data[0]);
|
2014-07-21 05:03:59 +02:00
|
|
|
|
2013-10-10 19:00:32 +02:00
|
|
|
ses2.remove_torrent(tor2);
|
|
|
|
|
|
|
|
std::cerr << "removed" << std::endl;
|
|
|
|
|
|
|
|
test_sleep(100);
|
|
|
|
|
|
|
|
std::cout << "re-adding" << std::endl;
|
|
|
|
add_torrent_params p;
|
|
|
|
p.flags &= ~add_torrent_params::flag_paused;
|
|
|
|
p.flags &= ~add_torrent_params::flag_auto_managed;
|
|
|
|
p.ti = t;
|
2013-10-11 10:36:17 +02:00
|
|
|
p.save_path = "tmp2_priority";
|
2013-10-10 19:00:32 +02:00
|
|
|
p.resume_data = resume_data;
|
|
|
|
tor2 = ses2.add_torrent(p, ec);
|
|
|
|
tor2.prioritize_pieces(priorities);
|
|
|
|
std::cout << "resetting priorities" << std::endl;
|
|
|
|
tor2.resume();
|
|
|
|
|
2014-07-06 21:18:00 +02:00
|
|
|
// wait for torrent 2 to settle in back to finished state (it will
|
|
|
|
// start as checking)
|
|
|
|
torrent_status st1;
|
2013-10-10 19:00:32 +02:00
|
|
|
for (int i = 0; i < 5; ++i)
|
|
|
|
{
|
|
|
|
print_alerts(ses1, "ses1", true, true, true, &on_alert);
|
|
|
|
print_alerts(ses2, "ses2", true, true, true, &on_alert);
|
|
|
|
|
2014-07-06 21:18:00 +02:00
|
|
|
st1 = tor1.status();
|
|
|
|
st2 = tor2.status();
|
2013-10-10 19:00:32 +02:00
|
|
|
|
2014-07-06 21:18:00 +02:00
|
|
|
TEST_CHECK(st1.state == torrent_status::seeding);
|
2013-10-10 19:00:32 +02:00
|
|
|
|
|
|
|
if (st2.is_finished) break;
|
|
|
|
|
|
|
|
test_sleep(100);
|
|
|
|
}
|
|
|
|
|
2014-07-06 21:18:00 +02:00
|
|
|
// torrent 2 should not be seeding yet, it should
|
|
|
|
// just be 50% finished
|
|
|
|
TEST_CHECK(!st2.is_seeding);
|
|
|
|
TEST_CHECK(st2.is_finished);
|
2013-10-10 19:00:32 +02:00
|
|
|
|
|
|
|
std::fill(priorities.begin(), priorities.end(), 1);
|
|
|
|
tor2.prioritize_pieces(priorities);
|
|
|
|
std::cout << "setting priorities to 1" << std::endl;
|
|
|
|
TEST_EQUAL(tor2.status().is_finished, false);
|
|
|
|
|
2014-01-20 21:26:12 +01:00
|
|
|
std::copy(priorities.begin(), priorities.end(), std::ostream_iterator<int>(std::cerr, ", "));
|
|
|
|
std::cerr << std::endl;
|
|
|
|
|
2014-01-26 00:04:24 +01:00
|
|
|
// drain alerts
|
|
|
|
print_alerts(ses1, "ses1", true, true, true, &on_alert);
|
|
|
|
print_alerts(ses2, "ses2", true, true, true, &on_alert);
|
|
|
|
|
2013-10-10 19:00:32 +02:00
|
|
|
peer_disconnects = 0;
|
|
|
|
|
2014-01-20 21:26:12 +01:00
|
|
|
// this loop makes sure ses2 reconnects to the peer now that it's
|
|
|
|
// in download mode again. If this fails, the reconnect logic may
|
|
|
|
// not work or be inefficient
|
2014-07-06 21:18:00 +02:00
|
|
|
st1 = tor1.status();
|
2014-01-20 21:26:12 +01:00
|
|
|
st2 = tor2.status();
|
2013-10-10 19:00:32 +02:00
|
|
|
for (int i = 0; i < 130; ++i)
|
|
|
|
{
|
|
|
|
print_alerts(ses1, "ses1", true, true, true, &on_alert);
|
|
|
|
print_alerts(ses2, "ses2", true, true, true, &on_alert);
|
|
|
|
|
2013-10-14 06:37:40 +02:00
|
|
|
st1 = tor1.status();
|
|
|
|
st2 = tor2.status();
|
2013-10-10 19:00:32 +02:00
|
|
|
|
|
|
|
if (i % 10 == 0)
|
|
|
|
print_ses_rate(i / 10.f, &st1, &st2);
|
|
|
|
|
|
|
|
if (st2.is_seeding) break;
|
|
|
|
|
|
|
|
TEST_EQUAL(st1.state, torrent_status::seeding);
|
|
|
|
TEST_EQUAL(st2.state, torrent_status::downloading);
|
|
|
|
|
2013-10-14 06:37:40 +02:00
|
|
|
if (peer_disconnects >= 2)
|
|
|
|
{
|
2014-01-20 21:26:12 +01:00
|
|
|
fprintf(stderr, "too many disconnects (%d), exiting\n", peer_disconnects);
|
2013-10-14 06:37:40 +02:00
|
|
|
break;
|
|
|
|
}
|
2013-10-10 19:00:32 +02:00
|
|
|
|
|
|
|
test_sleep(100);
|
|
|
|
}
|
|
|
|
|
2013-10-21 10:48:53 +02:00
|
|
|
st2 = tor2.status();
|
2014-01-20 21:26:12 +01:00
|
|
|
if (!st2.is_seeding)
|
|
|
|
fprintf(stderr, "ses2 failed to reconnect to ses1!\n");
|
2013-10-14 06:37:40 +02:00
|
|
|
TEST_CHECK(st2.is_seeding);
|
2013-10-10 19:00:32 +02:00
|
|
|
|
2014-11-09 12:17:13 +01:00
|
|
|
sp.push_back(ses1.abort());
|
|
|
|
sp.push_back(ses2.abort());
|
2013-10-10 19:00:32 +02:00
|
|
|
}
|
|
|
|
|
2015-05-30 06:31:23 +02:00
|
|
|
TORRENT_TEST(priority)
|
2013-10-10 19:00:32 +02:00
|
|
|
{
|
|
|
|
using namespace libtorrent;
|
2016-08-21 18:15:19 +02:00
|
|
|
settings_pack p = settings();
|
2014-11-09 12:17:13 +01:00
|
|
|
test_transfer(p);
|
2015-06-06 18:10:43 +02:00
|
|
|
cleanup();
|
2013-10-10 19:00:32 +02:00
|
|
|
}
|
|
|
|
|
2015-08-29 16:21:15 +02:00
|
|
|
// test to set piece and file priority on a torrent that doesn't have metadata
|
|
|
|
// yet
|
|
|
|
TORRENT_TEST(no_metadata_file_prio)
|
|
|
|
{
|
2016-08-21 18:15:19 +02:00
|
|
|
settings_pack pack = settings();
|
2015-08-29 16:21:15 +02:00
|
|
|
lt::session ses(pack);
|
|
|
|
|
|
|
|
add_torrent_params addp;
|
|
|
|
addp.flags &= ~add_torrent_params::flag_paused;
|
|
|
|
addp.flags &= ~add_torrent_params::flag_auto_managed;
|
|
|
|
addp.info_hash = sha1_hash("abababababababababab");
|
|
|
|
addp.save_path = ".";
|
|
|
|
torrent_handle h = ses.add_torrent(addp);
|
|
|
|
|
|
|
|
h.file_priority(0, 0);
|
|
|
|
TEST_EQUAL(h.file_priority(0), 0);
|
|
|
|
h.file_priority(0, 1);
|
|
|
|
TEST_EQUAL(h.file_priority(0), 1);
|
|
|
|
|
|
|
|
ses.remove_torrent(h);
|
|
|
|
}
|
2013-10-10 19:00:32 +02:00
|
|
|
|
2015-08-29 16:21:15 +02:00
|
|
|
TORRENT_TEST(no_metadata_piece_prio)
|
|
|
|
{
|
2016-08-21 18:15:19 +02:00
|
|
|
settings_pack pack = settings();
|
2015-08-29 16:21:15 +02:00
|
|
|
lt::session ses(pack);
|
|
|
|
|
|
|
|
add_torrent_params addp;
|
|
|
|
addp.flags &= ~add_torrent_params::flag_paused;
|
|
|
|
addp.flags &= ~add_torrent_params::flag_auto_managed;
|
|
|
|
addp.info_hash = sha1_hash("abababababababababab");
|
|
|
|
addp.save_path = ".";
|
|
|
|
torrent_handle h = ses.add_torrent(addp);
|
|
|
|
|
|
|
|
// you can't set piece priorities before the metadata has been downloaded
|
|
|
|
h.piece_priority(2, 0);
|
|
|
|
TEST_EQUAL(h.piece_priority(2), 4);
|
|
|
|
h.piece_priority(2, 1);
|
|
|
|
TEST_EQUAL(h.piece_priority(2), 4);
|
|
|
|
|
|
|
|
ses.remove_torrent(h);
|
|
|
|
}
|