twisterp2pblockchainnetworkbittorrentmicrobloggingipv6social-networkdhtdecentralizedtwisterarmyp2p-networktwister-servertwister-ipv6twister-core
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
194 lines
6.2 KiB
194 lines
6.2 KiB
/* |
|
|
|
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/time.hpp" |
|
#include "libtorrent/hasher.hpp" |
|
#include "libtorrent/create_torrent.hpp" |
|
#include "libtorrent/alert_types.hpp" |
|
#include "libtorrent/thread.hpp" |
|
#include <boost/tuple/tuple.hpp> |
|
#include <iostream> |
|
|
|
#include "test.hpp" |
|
#include "setup_transfer.hpp" |
|
|
|
using namespace libtorrent; |
|
|
|
void test_running_torrent(boost::intrusive_ptr<torrent_info> info, size_type file_size) |
|
{ |
|
session ses(fingerprint("LT", 0, 1, 0, 0), std::make_pair(48130, 48140), "0.0.0.0", 0); |
|
ses.set_alert_mask(alert::storage_notification); |
|
|
|
std::vector<boost::uint8_t> zeroes; |
|
zeroes.resize(1000, 0); |
|
add_torrent_params p; |
|
p.ti = info; |
|
p.save_path = "."; |
|
|
|
// make sure we correctly handle the case where we pass in |
|
// more values than there are files |
|
p.file_priorities = zeroes; |
|
|
|
error_code ec; |
|
torrent_handle h = ses.add_torrent(p, ec); |
|
|
|
std::vector<int> ones(info->num_files(), 1); |
|
h.prioritize_files(ones); |
|
|
|
test_sleep(500); |
|
torrent_status st = h.status(); |
|
|
|
std::cout << "total_wanted: " << st.total_wanted << " : " << file_size * 3 << std::endl; |
|
TEST_CHECK(st.total_wanted == file_size * 3); |
|
std::cout << "total_wanted_done: " << st.total_wanted_done << " : 0" << std::endl; |
|
TEST_CHECK(st.total_wanted_done == 0); |
|
|
|
std::vector<int> prio(3, 1); |
|
prio[0] = 0; |
|
h.prioritize_files(prio); |
|
std::cout << "prio: " << prio.size() << std::endl; |
|
std::cout << "ret prio: " << h.file_priorities().size() << std::endl; |
|
TEST_CHECK(h.file_priorities().size() == info->num_files()); |
|
|
|
test_sleep(500); |
|
st = h.status(); |
|
|
|
std::cout << "total_wanted: " << st.total_wanted << " : " << file_size * 2 << std::endl; |
|
TEST_CHECK(st.total_wanted == file_size * 2); |
|
std::cout << "total_wanted_done: " << st.total_wanted_done << " : 0" << std::endl; |
|
TEST_CHECK(st.total_wanted_done == 0); |
|
|
|
prio[1] = 0; |
|
h.prioritize_files(prio); |
|
|
|
test_sleep(500); |
|
st = h.status(); |
|
|
|
std::cout << "total_wanted: " << st.total_wanted << " : " << file_size << std::endl; |
|
TEST_CHECK(st.total_wanted == file_size); |
|
std::cout << "total_wanted_done: " << st.total_wanted_done << " : 0" << std::endl; |
|
TEST_CHECK(st.total_wanted_done == 0); |
|
|
|
if (info->num_pieces() > 0) |
|
{ |
|
h.piece_priority(0, 1); |
|
st = h.status(); |
|
TEST_CHECK(st.pieces.size() > 0 && st.pieces[0] == false); |
|
std::vector<char> piece(info->piece_length()); |
|
for (int i = 0; i < int(piece.size()); ++i) |
|
piece[i] = (i % 26) + 'A'; |
|
h.add_piece(0, &piece[0], info->piece_length()); |
|
test_sleep(10000); |
|
st = h.status(); |
|
TEST_CHECK(st.pieces.size() > 0 && st.pieces[0] == true); |
|
|
|
std::cout << "reading piece 0" << std::endl; |
|
h.read_piece(0); |
|
alert const* a = ses.wait_for_alert(seconds(10)); |
|
bool passed = false; |
|
while (a) |
|
{ |
|
std::auto_ptr<alert> al = ses.pop_alert(); |
|
assert(al.get()); |
|
std::cout << " " << al->message() << std::endl; |
|
if (read_piece_alert* rpa = dynamic_cast<read_piece_alert*>(al.get())) |
|
{ |
|
std::cout << "SUCCEEDED!" << std::endl; |
|
passed = true; |
|
TEST_CHECK(memcmp(&piece[0], rpa->buffer.get(), piece.size()) == 0); |
|
TEST_CHECK(rpa->size == info->piece_size(0)); |
|
TEST_CHECK(rpa->piece == 0); |
|
break; |
|
} |
|
a = ses.wait_for_alert(seconds(10)); |
|
TEST_CHECK(a); |
|
} |
|
TEST_CHECK(passed); |
|
} |
|
} |
|
|
|
int test_main() |
|
{ |
|
{ |
|
remove("test_torrent_dir2/tmp1"); |
|
remove("test_torrent_dir2/tmp2"); |
|
remove("test_torrent_dir2/tmp3"); |
|
file_storage fs; |
|
size_type file_size = 1 * 1024 * 1024 * 1024; |
|
fs.add_file("test_torrent_dir2/tmp1", file_size); |
|
fs.add_file("test_torrent_dir2/tmp2", file_size); |
|
fs.add_file("test_torrent_dir2/tmp3", file_size); |
|
libtorrent::create_torrent t(fs, 4 * 1024 * 1024); |
|
t.add_tracker("http://non-existing.com/announce"); |
|
|
|
std::vector<char> piece(4 * 1024 * 1024); |
|
for (int i = 0; i < int(piece.size()); ++i) |
|
piece[i] = (i % 26) + 'A'; |
|
|
|
// calculate the hash for all pieces |
|
sha1_hash ph = hasher(&piece[0], piece.size()).final(); |
|
int num = t.num_pieces(); |
|
TEST_CHECK(t.num_pieces() > 0); |
|
for (int i = 0; i < num; ++i) |
|
t.set_hash(i, ph); |
|
|
|
std::vector<char> tmp; |
|
std::back_insert_iterator<std::vector<char> > out(tmp); |
|
bencode(out, t.generate()); |
|
error_code ec; |
|
boost::intrusive_ptr<torrent_info> info(new torrent_info(&tmp[0], tmp.size(), ec)); |
|
TEST_CHECK(info->num_pieces() > 0); |
|
|
|
test_running_torrent(info, file_size); |
|
} |
|
|
|
{ |
|
file_storage fs; |
|
|
|
fs.add_file("test_torrent_dir2/tmp1", 0); |
|
libtorrent::create_torrent t(fs, 4 * 1024 * 1024); |
|
t.add_tracker("http://non-existing.com/announce"); |
|
|
|
std::vector<char> tmp; |
|
std::back_insert_iterator<std::vector<char> > out(tmp); |
|
bencode(out, t.generate()); |
|
error_code ec; |
|
boost::intrusive_ptr<torrent_info> info(new torrent_info(&tmp[0], tmp.size(), ec)); |
|
test_running_torrent(info, 0); |
|
} |
|
|
|
return 0; |
|
} |
|
|
|
|
|
|