forked from premiere/premiere-libtorrent
119 lines
3.3 KiB
C++
119 lines
3.3 KiB
C++
#include "libtorrent/storage.hpp"
|
|
#include "libtorrent/file_pool.hpp"
|
|
#include "libtorrent/hasher.hpp"
|
|
#include "libtorrent/session.hpp"
|
|
#include "libtorrent/aux_/session_impl.hpp"
|
|
|
|
#include <boost/utility.hpp>
|
|
#include <boost/filesystem/operations.hpp>
|
|
#include <boost/filesystem/convenience.hpp>
|
|
#include <boost/thread/mutex.hpp>
|
|
|
|
#include "test.hpp"
|
|
|
|
using namespace libtorrent;
|
|
using namespace boost::filesystem;
|
|
|
|
int test_main()
|
|
{
|
|
const int piece_size = 16;
|
|
const int half = piece_size / 2;
|
|
torrent_info info;
|
|
info.set_piece_size(piece_size);
|
|
info.add_file("temp_storage/test1.tmp", 17);
|
|
info.add_file("temp_storage/test2.tmp", 612);
|
|
info.add_file("temp_storage/test3.tmp", 0);
|
|
info.add_file("temp_storage/test4.tmp", 0);
|
|
info.add_file("temp_storage/test5.tmp", 1);
|
|
|
|
char piece0[piece_size] =
|
|
{ 6, 6, 6, 6, 6, 6, 6, 6
|
|
, 9, 9, 9, 9, 9, 9, 9, 9};
|
|
|
|
char piece1[piece_size] =
|
|
{ 0, 0, 0, 0, 0, 0, 0, 0
|
|
, 1, 1, 1, 1, 1, 1, 1, 1};
|
|
|
|
char piece2[piece_size] =
|
|
{ 0, 0, 1, 0, 0, 0, 0, 0
|
|
, 1, 1, 1, 1, 1, 1, 1, 1};
|
|
|
|
info.set_hash(0, hasher(piece0, piece_size).final());
|
|
info.set_hash(1, hasher(piece1, piece_size).final());
|
|
info.set_hash(2, hasher(piece2, piece_size).final());
|
|
|
|
info.create_torrent();
|
|
|
|
create_directory(initial_path() / "temp_storage");
|
|
|
|
int num_pieces = (1 + 612 + 17 + piece_size - 1) / piece_size;
|
|
TEST_CHECK(info.num_pieces() == num_pieces);
|
|
|
|
char piece[piece_size];
|
|
|
|
{ // avoid having two storages use the same files
|
|
file_pool fp;
|
|
storage s(info, initial_path(), fp);
|
|
|
|
// write piece 1 (in slot 0)
|
|
s.write(piece1, 0, 0, half);
|
|
s.write(piece1 + half, 0, half, half);
|
|
|
|
// verify piece 1
|
|
TEST_CHECK(s.read(piece, 0, 0, piece_size) == piece_size);
|
|
TEST_CHECK(std::equal(piece, piece + piece_size, piece1));
|
|
|
|
// do the same with piece 0 and 2 (in slot 1 and 2)
|
|
s.write(piece0, 1, 0, piece_size);
|
|
s.write(piece2, 2, 0, piece_size);
|
|
|
|
// verify piece 0 and 2
|
|
TEST_CHECK(s.read(piece, 1, 0, piece_size) == piece_size);
|
|
TEST_CHECK(std::equal(piece, piece + piece_size, piece0));
|
|
|
|
s.read(piece, 2, 0, piece_size);
|
|
TEST_CHECK(std::equal(piece, piece + piece_size, piece2));
|
|
|
|
// make sure the files have the correct size
|
|
TEST_CHECK(file_size(initial_path() / "temp_storage" / "test1.tmp") == 17);
|
|
TEST_CHECK(file_size(initial_path() / "temp_storage" / "test2.tmp") == 31);
|
|
s.release_files();
|
|
}
|
|
|
|
// make sure the piece_manager can identify the pieces
|
|
file_pool fp;
|
|
piece_manager pm(info, initial_path(), fp);
|
|
boost::mutex lock;
|
|
libtorrent::aux::piece_checker_data d;
|
|
|
|
std::vector<bool> pieces;
|
|
num_pieces = 0;
|
|
TEST_CHECK(pm.check_fastresume(d, pieces, num_pieces, true) == false);
|
|
bool finished = false;
|
|
float progress;
|
|
num_pieces = 0;
|
|
while (!finished)
|
|
boost::tie(finished, progress) = pm.check_files(pieces, num_pieces);
|
|
|
|
TEST_CHECK(num_pieces == std::count(pieces.begin(), pieces.end()
|
|
, true));
|
|
|
|
TEST_CHECK(pm.read(piece, 0, 0, piece_size) == piece_size);
|
|
TEST_CHECK(std::equal(piece, piece + piece_size, piece0));
|
|
|
|
TEST_CHECK(pm.read(piece, 1, 0, piece_size) == piece_size);
|
|
TEST_CHECK(std::equal(piece, piece + piece_size, piece1));
|
|
|
|
TEST_CHECK(pm.read(piece, 2, 0, piece_size) == piece_size);
|
|
TEST_CHECK(std::equal(piece, piece + piece_size, piece2));
|
|
pm.release_files();
|
|
|
|
TEST_CHECK(exists("temp_storage/test3.tmp"));
|
|
TEST_CHECK(exists("temp_storage/test4.tmp"));
|
|
|
|
remove_all(initial_path() / "temp_storage");
|
|
|
|
return 0;
|
|
}
|
|
|