489 lines
15 KiB
C++
489 lines
15 KiB
C++
/*
|
|
|
|
Copyright (c) 2008, 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/hasher.hpp"
|
|
#include "libtorrent/alert_types.hpp"
|
|
#include "libtorrent/bencode.hpp"
|
|
#include "libtorrent/thread.hpp"
|
|
#include <boost/tuple/tuple.hpp>
|
|
|
|
#include "test.hpp"
|
|
#include "setup_transfer.hpp"
|
|
|
|
using namespace libtorrent;
|
|
using boost::tuples::ignore;
|
|
|
|
// test the maximum transfer rate
|
|
void test_rate()
|
|
{
|
|
// in case the previous run was terminated
|
|
error_code ec;
|
|
remove_all("./tmp1_transfer", ec);
|
|
remove_all("./tmp2_transfer", ec);
|
|
remove_all("./tmp1_transfer_moved", ec);
|
|
remove_all("./tmp2_transfer_moved", ec);
|
|
|
|
session ses1(fingerprint("LT", 0, 1, 0, 0), std::make_pair(48575, 49000), "0.0.0.0", 0);
|
|
session ses2(fingerprint("LT", 0, 1, 0, 0), std::make_pair(49575, 50000), "0.0.0.0", 0);
|
|
|
|
torrent_handle tor1;
|
|
torrent_handle tor2;
|
|
|
|
create_directory("./tmp1_transfer", ec);
|
|
std::ofstream file("./tmp1_transfer/temporary");
|
|
boost::intrusive_ptr<torrent_info> t = ::create_torrent(&file, 4 * 1024 * 1024, 7);
|
|
file.close();
|
|
|
|
boost::tie(tor1, tor2, ignore) = setup_transfer(&ses1, &ses2, 0
|
|
, true, false, true, "_transfer", 0, &t);
|
|
|
|
ses1.set_alert_mask(alert::all_categories & ~(alert::performance_warning));
|
|
ses2.set_alert_mask(alert::all_categories & ~(alert::performance_warning));
|
|
|
|
ptime start = time_now();
|
|
|
|
for (int i = 0; i < 70; ++i)
|
|
{
|
|
print_alerts(ses1, "ses1");
|
|
print_alerts(ses2, "ses2");
|
|
|
|
torrent_status st1 = tor1.status();
|
|
torrent_status st2 = tor2.status();
|
|
|
|
std::cerr
|
|
<< "up: \033[33m" << st1.upload_payload_rate / 1000000.f << "MB/s "
|
|
<< " down: \033[32m" << st2.download_payload_rate / 1000000.f << "MB/s "
|
|
<< "\033[0m" << int(st2.progress * 100) << "% "
|
|
<< std::endl;
|
|
|
|
if (tor2.is_seed()) break;
|
|
test_sleep(1000);
|
|
}
|
|
|
|
TEST_CHECK(tor2.is_seed());
|
|
|
|
time_duration dt = time_now() - start;
|
|
|
|
std::cerr << "downloaded " << t->total_size() << " bytes "
|
|
"in " << (total_milliseconds(dt) / 1000.f) << " seconds" << std::endl;
|
|
|
|
std::cerr << "average download rate: " << (t->total_size() / (std::max)(total_milliseconds(dt), 1))
|
|
<< " kB/s" << std::endl;
|
|
|
|
}
|
|
|
|
void print_alert(alert const& a)
|
|
{
|
|
std::cout << "ses1 (alert dispatch function): " << a.message() << std::endl;
|
|
}
|
|
|
|
// simulate a full disk
|
|
struct test_storage : storage_interface
|
|
{
|
|
test_storage(file_storage const& fs, std::string const& p, file_pool& fp)
|
|
: m_lower_layer(default_storage_constructor(fs, 0, p, fp))
|
|
, m_written(0)
|
|
, m_limit(16 * 1024 * 2)
|
|
{}
|
|
|
|
virtual bool initialize(bool allocate_files)
|
|
{ return m_lower_layer->initialize(allocate_files); }
|
|
|
|
virtual bool has_any_file()
|
|
{ return m_lower_layer->has_any_file(); }
|
|
|
|
virtual int readv(file::iovec_t const* bufs, int slot, int offset, int num_bufs)
|
|
{ return m_lower_layer->readv(bufs, slot, offset, num_bufs); }
|
|
|
|
virtual int writev(file::iovec_t const* bufs, int slot, int offset, int num_bufs)
|
|
{
|
|
int ret = m_lower_layer->writev(bufs, slot, offset, num_bufs);
|
|
if (ret > 0) m_written += ret;
|
|
if (m_written > m_limit)
|
|
{
|
|
#if BOOST_VERSION == 103500
|
|
set_error("", error_code(boost::system::posix_error::no_space_on_device, get_posix_category()));
|
|
#elif BOOST_VERSION > 103500
|
|
set_error("", error_code(boost::system::errc::no_space_on_device, get_posix_category()));
|
|
#else
|
|
set_error("", error_code(ENOSPC, get_posix_category()));
|
|
#endif
|
|
return -1;
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
virtual size_type physical_offset(int piece_index, int offset)
|
|
{ return m_lower_layer->physical_offset(piece_index, offset); }
|
|
|
|
virtual int read(char* buf, int slot, int offset, int size)
|
|
{ return m_lower_layer->read(buf, slot, offset, size); }
|
|
|
|
virtual int write(const char* buf, int slot, int offset, int size)
|
|
{
|
|
int ret = m_lower_layer->write(buf, slot, offset, size);
|
|
if (ret > 0) m_written += ret;
|
|
if (m_written > m_limit)
|
|
{
|
|
#if BOOST_VERSION == 103500
|
|
set_error("", error_code(boost::system::posix_error::no_space_on_device, get_posix_category()));
|
|
#elif BOOST_VERSION > 103500
|
|
set_error("", error_code(boost::system::errc::no_space_on_device, get_posix_category()));
|
|
#else
|
|
set_error("", error_code(ENOSPC, get_posix_category()));
|
|
#endif
|
|
return -1;
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
virtual int sparse_end(int start) const
|
|
{ return m_lower_layer->sparse_end(start); }
|
|
|
|
virtual bool move_storage(std::string const& save_path)
|
|
{ return m_lower_layer->move_storage(save_path); }
|
|
|
|
virtual bool verify_resume_data(lazy_entry const& rd, error_code& error)
|
|
{ return m_lower_layer->verify_resume_data(rd, error); }
|
|
|
|
virtual bool write_resume_data(entry& rd) const
|
|
{ return m_lower_layer->write_resume_data(rd); }
|
|
|
|
virtual bool move_slot(int src_slot, int dst_slot)
|
|
{ return m_lower_layer->move_slot(src_slot, dst_slot); }
|
|
|
|
virtual bool swap_slots(int slot1, int slot2)
|
|
{ return m_lower_layer->swap_slots(slot1, slot2); }
|
|
|
|
virtual bool swap_slots3(int slot1, int slot2, int slot3)
|
|
{ return m_lower_layer->swap_slots3(slot1, slot2, slot3); }
|
|
|
|
virtual bool release_files() { return m_lower_layer->release_files(); }
|
|
|
|
virtual bool rename_file(int index, std::string const& new_filename)
|
|
{ return m_lower_layer->rename_file(index, new_filename); }
|
|
|
|
virtual bool delete_files() { return m_lower_layer->delete_files(); }
|
|
|
|
virtual ~test_storage() {}
|
|
|
|
boost::scoped_ptr<storage_interface> m_lower_layer;
|
|
int m_written;
|
|
int m_limit;
|
|
};
|
|
|
|
storage_interface* test_storage_constructor(file_storage const& fs
|
|
, file_storage const*, std::string const& path, file_pool& fp)
|
|
{
|
|
return new test_storage(fs, path, fp);
|
|
}
|
|
|
|
void test_transfer(bool test_disk_full = false, bool test_allowed_fast = false)
|
|
{
|
|
// in case the previous run was terminated
|
|
error_code ec;
|
|
remove_all("./tmp1_transfer", ec);
|
|
remove_all("./tmp2_transfer", ec);
|
|
remove_all("./tmp1_transfer_moved", ec);
|
|
remove_all("./tmp2_transfer_moved", ec);
|
|
|
|
session ses1(fingerprint("LT", 0, 1, 0, 0), std::make_pair(48075, 49000), "0.0.0.0", 0);
|
|
session ses2(fingerprint("LT", 0, 1, 0, 0), std::make_pair(49075, 50000), "0.0.0.0", 0);
|
|
|
|
if (test_allowed_fast)
|
|
{
|
|
session_settings sett;
|
|
sett.allowed_fast_set_size = 2000;
|
|
ses1.set_max_uploads(0);
|
|
ses1.set_settings(sett);
|
|
}
|
|
|
|
#ifndef TORRENT_DISABLE_ENCRYPTION
|
|
pe_settings pes;
|
|
pes.out_enc_policy = pe_settings::forced;
|
|
pes.in_enc_policy = pe_settings::forced;
|
|
ses1.set_pe_settings(pes);
|
|
ses2.set_pe_settings(pes);
|
|
#endif
|
|
|
|
torrent_handle tor1;
|
|
torrent_handle tor2;
|
|
|
|
create_directory("./tmp1_transfer", ec);
|
|
std::ofstream file("./tmp1_transfer/temporary");
|
|
boost::intrusive_ptr<torrent_info> t = ::create_torrent(&file, 16 * 1024);
|
|
file.close();
|
|
|
|
add_torrent_params addp(&test_storage_constructor);
|
|
|
|
// test using piece sizes smaller than 16kB
|
|
boost::tie(tor1, tor2, ignore) = setup_transfer(&ses1, &ses2, 0
|
|
, true, false, true, "_transfer", 8 * 1024, &t, false, test_disk_full?&addp:0);
|
|
|
|
session_settings settings = ses1.settings();
|
|
settings.min_reconnect_time = 1;
|
|
ses1.set_settings(settings);
|
|
ses2.set_settings(settings);
|
|
|
|
// set half of the pieces to priority 0
|
|
int num_pieces = tor2.get_torrent_info().num_pieces();
|
|
std::vector<int> priorities(num_pieces, 1);
|
|
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;
|
|
|
|
ses1.set_alert_mask(alert::all_categories & ~alert::progress_notification);
|
|
ses2.set_alert_mask(alert::all_categories & ~alert::progress_notification);
|
|
ses1.set_alert_dispatch(&print_alert);
|
|
|
|
ses2.set_download_rate_limit(tor2.get_torrent_info().piece_length() / 2);
|
|
|
|
// also test to move the storage of the downloader and the uploader
|
|
// to make sure it can handle switching paths
|
|
bool test_move_storage = false;
|
|
|
|
for (int i = 0; i < 30; ++i)
|
|
{
|
|
print_alerts(ses1, "ses1");
|
|
print_alerts(ses2, "ses2");
|
|
|
|
torrent_status st1 = tor1.status();
|
|
torrent_status st2 = tor2.status();
|
|
|
|
std::cerr
|
|
<< "\033[32m" << int(st1.download_payload_rate / 1000.f) << "kB/s "
|
|
<< "\033[33m" << int(st1.upload_payload_rate / 1000.f) << "kB/s "
|
|
<< "\033[0m" << int(st1.progress * 100) << "% "
|
|
<< st1.num_peers
|
|
<< ": "
|
|
<< "\033[32m" << int(st2.download_payload_rate / 1000.f) << "kB/s "
|
|
<< "\033[31m" << int(st2.upload_payload_rate / 1000.f) << "kB/s "
|
|
<< "\033[0m" << int(st2.progress * 100) << "% "
|
|
<< st2.num_peers
|
|
<< " cc: " << st2.connect_candidates
|
|
<< std::endl;
|
|
|
|
if (!test_move_storage && st2.progress > 0.25f)
|
|
{
|
|
test_move_storage = true;
|
|
tor1.move_storage("./tmp1_transfer_moved");
|
|
tor2.move_storage("./tmp2_transfer_moved");
|
|
std::cerr << "moving storage" << std::endl;
|
|
}
|
|
|
|
if (test_disk_full && st2.upload_mode)
|
|
{
|
|
test_disk_full = false;
|
|
((test_storage*)tor2.get_storage_impl())->m_limit = 16 * 1024 * 1024;
|
|
tor2.set_upload_mode(false);
|
|
continue;
|
|
}
|
|
|
|
if (!test_disk_full && tor2.is_finished()) break;
|
|
|
|
TEST_CHECK(st1.state == torrent_status::seeding
|
|
|| st1.state == torrent_status::checking_files);
|
|
TEST_CHECK(st2.state == torrent_status::downloading
|
|
|| (test_disk_full && !st2.error.empty()));
|
|
|
|
test_sleep(1000);
|
|
}
|
|
|
|
TEST_CHECK(!tor2.is_seed());
|
|
TEST_CHECK(tor2.is_finished());
|
|
if (tor2.is_finished())
|
|
std::cerr << "torrent is finished (50% complete)" << std::endl;
|
|
|
|
std::cerr << "force recheck" << std::endl;
|
|
tor2.force_recheck();
|
|
|
|
for (int i = 0; i < 10; ++i)
|
|
{
|
|
test_sleep(1000);
|
|
print_alerts(ses2, "ses2");
|
|
torrent_status st2 = tor2.status();
|
|
std::cerr << "\033[0m" << int(st2.progress * 100) << "% " << std::endl;
|
|
if (st2.state != torrent_status::checking_files) break;
|
|
}
|
|
|
|
std::vector<int> priorities2 = tor2.piece_priorities();
|
|
TEST_CHECK(std::equal(priorities.begin(), priorities.end(), priorities2.begin()));
|
|
|
|
for (int i = 0; i < 5; ++i)
|
|
{
|
|
print_alerts(ses2, "ses2");
|
|
torrent_status st2 = tor2.status();
|
|
std::cerr << "\033[0m" << int(st2.progress * 100) << "% " << std::endl;
|
|
TEST_CHECK(st2.state == torrent_status::finished);
|
|
test_sleep(100);
|
|
}
|
|
|
|
tor2.pause();
|
|
alert const* a = ses2.wait_for_alert(seconds(10));
|
|
while (a)
|
|
{
|
|
std::auto_ptr<alert> holder = ses2.pop_alert();
|
|
std::cerr << "ses2: " << a->message() << std::endl;
|
|
if (dynamic_cast<torrent_paused_alert const*>(a)) break;
|
|
a = ses2.wait_for_alert(seconds(10));
|
|
}
|
|
|
|
std::vector<announce_entry> tr;
|
|
tr.push_back(announce_entry("http://test.com/announce"));
|
|
tor2.replace_trackers(tr);
|
|
tr.clear();
|
|
|
|
tor2.save_resume_data();
|
|
|
|
std::vector<char> resume_data;
|
|
a = ses2.wait_for_alert(seconds(10));
|
|
while (a)
|
|
{
|
|
std::auto_ptr<alert> holder = ses2.pop_alert();
|
|
std::cerr << "ses2: " << a->message() << std::endl;
|
|
if (dynamic_cast<save_resume_data_alert const*>(a))
|
|
{
|
|
bencode(std::back_inserter(resume_data)
|
|
, *dynamic_cast<save_resume_data_alert const*>(a)->resume_data);
|
|
break;
|
|
}
|
|
a = ses2.wait_for_alert(seconds(10));
|
|
}
|
|
|
|
std::cerr << "saved resume data" << std::endl;
|
|
|
|
ses2.remove_torrent(tor2);
|
|
|
|
std::cerr << "removed" << std::endl;
|
|
|
|
test_sleep(100);
|
|
|
|
std::cout << "re-adding" << std::endl;
|
|
add_torrent_params p;
|
|
p.ti = t;
|
|
p.save_path = "./tmp2_transfer_moved";
|
|
p.resume_data = &resume_data;
|
|
tor2 = ses2.add_torrent(p);
|
|
ses2.set_alert_mask(alert::all_categories & ~alert::progress_notification);
|
|
tor2.prioritize_pieces(priorities);
|
|
std::cout << "resetting priorities" << std::endl;
|
|
tor2.resume();
|
|
|
|
tr = tor2.trackers();
|
|
TEST_CHECK(std::find_if(tr.begin(), tr.end()
|
|
, boost::bind(&announce_entry::url, _1) == "http://test.com/announce") != tr.end());
|
|
|
|
test_sleep(100);
|
|
|
|
for (int i = 0; i < 5; ++i)
|
|
{
|
|
print_alerts(ses1, "ses1");
|
|
print_alerts(ses2, "ses2");
|
|
|
|
torrent_status st1 = tor1.status();
|
|
torrent_status st2 = tor2.status();
|
|
|
|
TEST_CHECK(st1.state == torrent_status::seeding);
|
|
TEST_CHECK(st2.state == torrent_status::finished);
|
|
|
|
test_sleep(100);
|
|
}
|
|
|
|
TEST_CHECK(!tor2.is_seed());
|
|
|
|
std::fill(priorities.begin(), priorities.end(), 1);
|
|
tor2.prioritize_pieces(priorities);
|
|
std::cout << "setting priorities to 1" << std::endl;
|
|
|
|
for (int i = 0; i < 130; ++i)
|
|
{
|
|
print_alerts(ses1, "ses1");
|
|
print_alerts(ses2, "ses2");
|
|
|
|
torrent_status st1 = tor1.status();
|
|
torrent_status st2 = tor2.status();
|
|
|
|
std::cerr
|
|
<< "\033[32m" << int(st1.download_payload_rate / 1000.f) << "kB/s "
|
|
<< "\033[33m" << int(st1.upload_payload_rate / 1000.f) << "kB/s "
|
|
<< "\033[0m" << int(st1.progress * 100) << "% "
|
|
<< st1.num_peers
|
|
<< ": "
|
|
<< "\033[32m" << int(st2.download_payload_rate / 1000.f) << "kB/s "
|
|
<< "\033[31m" << int(st2.upload_payload_rate / 1000.f) << "kB/s "
|
|
<< "\033[0m" << int(st2.progress * 100) << "% "
|
|
<< st2.num_peers
|
|
<< " cc: " << st2.connect_candidates
|
|
<< std::endl;
|
|
|
|
if (tor2.is_finished()) break;
|
|
|
|
TEST_CHECK(st1.state == torrent_status::seeding);
|
|
TEST_CHECK(st2.state == torrent_status::downloading);
|
|
|
|
test_sleep(1000);
|
|
}
|
|
|
|
TEST_CHECK(tor2.is_seed());
|
|
}
|
|
|
|
int test_main()
|
|
{
|
|
using namespace libtorrent;
|
|
|
|
#ifdef NDEBUG
|
|
// test rate only makes sense in release mode
|
|
test_rate();
|
|
#endif
|
|
|
|
test_transfer();
|
|
|
|
// test with a (simulated) full disk
|
|
test_transfer(true);
|
|
|
|
// test allowed fast
|
|
test_transfer(false, true);
|
|
|
|
error_code ec;
|
|
remove_all("./tmp1_transfer", ec);
|
|
remove_all("./tmp2_transfer", ec);
|
|
remove_all("./tmp1_transfer_moved", ec);
|
|
remove_all("./tmp2_transfer_moved", ec);
|
|
|
|
return 0;
|
|
}
|
|
|