/* 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 "libtorrent/torrent.hpp" #include #include #include #include "test.hpp" #include "setup_transfer.hpp" using namespace libtorrent; namespace lt = libtorrent; void test_running_torrent(boost::shared_ptr info, boost::int64_t file_size) { settings_pack pack; pack.set_int(settings_pack::alert_mask, alert::storage_notification); pack.set_str(settings_pack::listen_interfaces, "0.0.0.0:48130"); pack.set_int(settings_pack::max_retry_port_bind, 10); lt::session ses(pack); std::vector 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); if (ec) { fprintf(stderr, "add_torrent: %s\n", ec.message().c_str()); return; } std::vector ones(info->num_files(), 1); h.prioritize_files(ones); // test_sleep(500); torrent_status st = h.status(); TEST_EQUAL(st.total_wanted, file_size * 3); TEST_EQUAL(st.total_wanted_done, 0); std::vector prio(info->num_files(), 1); prio[0] = 0; h.prioritize_files(prio); st = h.status(); TEST_EQUAL(st.total_wanted, file_size * 2); TEST_EQUAL(st.total_wanted_done, 0); TEST_EQUAL(h.file_priorities().size(), info->num_files()); if (!st.is_seeding) { TEST_EQUAL(h.file_priorities()[0], 0); if (info->num_files() > 1) TEST_EQUAL(h.file_priorities()[1], 1); if (info->num_files() > 2) TEST_EQUAL(h.file_priorities()[2], 1); } if (info->num_files() > 1) { prio[1] = 0; h.prioritize_files(prio); st = h.status(); TEST_EQUAL(st.total_wanted, file_size); TEST_EQUAL(st.total_wanted_done, 0); if (!st.is_seeding) { TEST_EQUAL(h.file_priorities().size(), info->num_files()); TEST_EQUAL(h.file_priorities()[0], 0); if (info->num_files() > 1) TEST_EQUAL(h.file_priorities()[1], 0); if (info->num_files() > 2) TEST_EQUAL(h.file_priorities()[2], 1); } } 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 piece(info->piece_length()); for (int i = 0; i < int(piece.size()); ++i) piece[i] = (i % 26) + 'A'; h.add_piece(0, &piece[0]); // wait until the piece is done writing and hashing // TODO: wait for an alert rather than just waiting 10 seconds. This is kind of silly test_sleep(2000); 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 = wait_for_alert(ses, read_piece_alert::alert_type, "read_piece"); TEST_CHECK(a); read_piece_alert const* rpa = alert_cast(a); TEST_CHECK(rpa); if (rpa) { std::cout << "SUCCEEDED!" << std::endl; TEST_CHECK(memcmp(&piece[0], rpa->buffer.get(), piece.size()) == 0); TEST_CHECK(rpa->size == info->piece_size(0)); TEST_CHECK(rpa->piece == 0); TEST_CHECK(hasher(&piece[0], piece.size()).final() == info->hash_for_piece(0)); } } } int test_main() { /* { remove("test_torrent_dir2/tmp1"); remove("test_torrent_dir2/tmp2"); remove("test_torrent_dir2/tmp3"); file_storage fs; boost::int64_t file_size = 256 * 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, 128 * 1024); t.add_tracker("http://non-existing.com/announce"); std::vector piece(128 * 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 tmp; std::back_insert_iterator > out(tmp); bencode(out, t.generate()); error_code ec; boost::shared_ptr info(boost::make_shared(&tmp[0], tmp.size(), boost::ref(ec), 0)); 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, 128 * 1024, 6); t.add_tracker("http://non-existing.com/announce"); std::vector tmp; std::back_insert_iterator > out(tmp); bencode(out, t.generate()); error_code ec; boost::shared_ptr info(boost::make_shared(&tmp[0], tmp.size(), boost::ref(ec), 0)); test_running_torrent(info, 0); } { // test the initialize_file_progress function to make sure it assigns // the correct number of bytes across the files const int piece_size = 256; file_storage fs; fs.add_file("torrent/1", 0); fs.add_file("torrent/2", 10); fs.add_file("torrent/3", 20); fs.add_file("torrent/4", 30); fs.add_file("torrent/5", 40); fs.add_file("torrent/6", 100000); fs.add_file("torrent/7", 30); fs.set_piece_length(piece_size); fs.set_num_pieces((fs.total_size() + piece_size - 1) / piece_size); for (int idx = 0; idx < fs.num_pieces(); ++idx) { piece_picker picker; picker.init(4, fs.total_size() % 4, fs.num_pieces()); picker.we_have(idx); std::vector fp; initialize_file_progress(fp, picker, fs); boost::uint64_t sum = 0; for (int i = 0; i < fp.size(); ++i) sum += fp[i]; TEST_EQUAL(sum, fs.piece_size(idx)); } } { // test the initialize_file_progress function to make sure it assigns // the correct number of bytes across the files const int piece_size = 256; file_storage fs; fs.add_file("torrent/1", 100000); fs.add_file("torrent/2", 10); fs.set_piece_length(piece_size); fs.set_num_pieces((fs.total_size() + piece_size - 1) / piece_size); for (int idx = 0; idx < fs.num_pieces(); ++idx) { piece_picker picker; picker.init(4, fs.total_size() % 4, fs.num_pieces()); picker.we_have(idx); std::vector fp; initialize_file_progress(fp, picker, fs); boost::uint64_t sum = 0; for (int i = 0; i < fp.size(); ++i) sum += fp[i]; TEST_EQUAL(sum, fs.piece_size(idx)); } } return 0; }