| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392 | #include "DefaultPieceStorage.h"#include <cppunit/extensions/HelperMacros.h>#include "util.h"#include "Exception.h"#include "Piece.h"#include "Peer.h"#include "Option.h"#include "FileEntry.h"#include "RarestPieceSelector.h"#include "InorderPieceSelector.h"#include "DownloadContext.h"#include "bittorrent_helper.h"#include "DiskAdaptor.h"#include "DiskWriterFactory.h"#include "PieceStatMan.h"#include "prefs.h"namespace aria2 {class DefaultPieceStorageTest:public CppUnit::TestFixture {  CPPUNIT_TEST_SUITE(DefaultPieceStorageTest);  CPPUNIT_TEST(testGetTotalLength);  CPPUNIT_TEST(testGetMissingPiece);  CPPUNIT_TEST(testGetMissingPiece_many);  CPPUNIT_TEST(testGetMissingPiece_excludedIndexes);  CPPUNIT_TEST(testGetMissingPiece_manyWithExcludedIndexes);  CPPUNIT_TEST(testGetMissingFastPiece);  CPPUNIT_TEST(testGetMissingFastPiece_excludedIndexes);  CPPUNIT_TEST(testHasMissingPiece);  CPPUNIT_TEST(testCompletePiece);  CPPUNIT_TEST(testGetPiece);  CPPUNIT_TEST(testGetPieceInUsedPieces);  CPPUNIT_TEST(testGetPieceCompletedPiece);  CPPUNIT_TEST(testCancelPiece);  CPPUNIT_TEST(testMarkPiecesDone);  CPPUNIT_TEST(testGetCompletedLength);  CPPUNIT_TEST(testGetFilteredCompletedLength);  CPPUNIT_TEST(testGetNextUsedIndex);  CPPUNIT_TEST_SUITE_END();private:  std::shared_ptr<DownloadContext> dctx_;  std::shared_ptr<Peer> peer;  std::shared_ptr<Option> option_;  std::unique_ptr<PieceSelector> pieceSelector_;public:  void setUp() {    option_ = std::make_shared<Option>();    option_->put(PREF_DIR, ".");    dctx_ = std::make_shared<DownloadContext>();    bittorrent::load(A2_TEST_DIR"/test.torrent", dctx_, option_);    peer = std::make_shared<Peer>("192.168.0.1", 6889);    peer->allocateSessionResource(dctx_->getPieceLength(),                                  dctx_->getTotalLength());    pieceSelector_ = make_unique<InorderPieceSelector>();  }  void testGetTotalLength();  void testGetMissingPiece();  void testGetMissingPiece_many();  void testGetMissingPiece_excludedIndexes();  void testGetMissingPiece_manyWithExcludedIndexes();  void testGetMissingFastPiece();  void testGetMissingFastPiece_excludedIndexes();  void testHasMissingPiece();  void testCompletePiece();  void testGetPiece();  void testGetPieceInUsedPieces();  void testGetPieceCompletedPiece();  void testCancelPiece();  void testMarkPiecesDone();  void testGetCompletedLength();  void testGetFilteredCompletedLength();  void testGetNextUsedIndex();};CPPUNIT_TEST_SUITE_REGISTRATION(DefaultPieceStorageTest);void DefaultPieceStorageTest::testGetTotalLength() {  DefaultPieceStorage pss(dctx_, option_.get());  CPPUNIT_ASSERT_EQUAL((int64_t)384LL, pss.getTotalLength());}void DefaultPieceStorageTest::testGetMissingPiece() {  DefaultPieceStorage pss(dctx_, option_.get());  pss.setPieceSelector(std::move(pieceSelector_));  peer->setAllBitfield();  auto piece = pss.getMissingPiece(peer, 1);  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),                       piece->toString());  CPPUNIT_ASSERT(piece->usedBy(1));  piece = pss.getMissingPiece(peer, 1);  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=1, length=128"),                       piece->toString());  piece = pss.getMissingPiece(peer, 1);  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),                       piece->toString());  piece = pss.getMissingPiece(peer, 1);  CPPUNIT_ASSERT(!piece);}void DefaultPieceStorageTest::testGetMissingPiece_many() {  DefaultPieceStorage pss(dctx_, option_.get());  pss.setPieceSelector(std::move(pieceSelector_));  peer->setAllBitfield();  std::vector<std::shared_ptr<Piece>> pieces;  pss.getMissingPiece(pieces, 2, peer, 1);  CPPUNIT_ASSERT_EQUAL((size_t)2, pieces.size());  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),                       pieces[0]->toString());  CPPUNIT_ASSERT(pieces[0]->usedBy(1));  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=1, length=128"),                       pieces[1]->toString());  pieces.clear();  pss.getMissingPiece(pieces, 2, peer, 1);  CPPUNIT_ASSERT_EQUAL((size_t)1, pieces.size());  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),                       pieces[0]->toString());}void DefaultPieceStorageTest::testGetMissingPiece_excludedIndexes(){  DefaultPieceStorage pss(dctx_, option_.get());  pss.setPieceSelector(std::move(pieceSelector_));  pss.setEndGamePieceNum(0);  peer->setAllBitfield();  std::vector<size_t> excludedIndexes;  excludedIndexes.push_back(1);  auto piece = pss.getMissingPiece(peer, excludedIndexes, 1);  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),                       piece->toString());  piece = pss.getMissingPiece(peer, excludedIndexes, 1);  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),                       piece->toString());  piece = pss.getMissingPiece(peer, excludedIndexes, 1);  CPPUNIT_ASSERT(!piece);}void DefaultPieceStorageTest::testGetMissingPiece_manyWithExcludedIndexes() {  DefaultPieceStorage pss(dctx_, option_.get());  pss.setPieceSelector(std::move(pieceSelector_));  peer->setAllBitfield();  std::vector<size_t> excludedIndexes;  excludedIndexes.push_back(1);  std::vector<std::shared_ptr<Piece>> pieces;  pss.getMissingPiece(pieces, 2, peer, excludedIndexes, 1);  CPPUNIT_ASSERT_EQUAL((size_t)2, pieces.size());  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),                       pieces[0]->toString());  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),                       pieces[1]->toString());  pieces.clear();  pss.getMissingPiece(pieces, 2, peer, excludedIndexes, 1);  CPPUNIT_ASSERT(pieces.empty());}void DefaultPieceStorageTest::testGetMissingFastPiece() {  DefaultPieceStorage pss(dctx_, option_.get());  pss.setPieceSelector(std::move(pieceSelector_));  pss.setEndGamePieceNum(0);  peer->setAllBitfield();  peer->setFastExtensionEnabled(true);  peer->addPeerAllowedIndex(2);  auto piece = pss.getMissingFastPiece(peer, 1);  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),                       piece->toString());  CPPUNIT_ASSERT(!pss.getMissingFastPiece(peer, 1));}void DefaultPieceStorageTest::testGetMissingFastPiece_excludedIndexes(){  DefaultPieceStorage pss(dctx_, option_.get());  pss.setPieceSelector(std::move(pieceSelector_));  pss.setEndGamePieceNum(0);  peer->setAllBitfield();  peer->setFastExtensionEnabled(true);  peer->addPeerAllowedIndex(1);  peer->addPeerAllowedIndex(2);  std::vector<size_t> excludedIndexes;  excludedIndexes.push_back(2);  auto piece = pss.getMissingFastPiece(peer, excludedIndexes, 1);  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=1, length=128"),                       piece->toString());  CPPUNIT_ASSERT(!pss.getMissingFastPiece(peer, excludedIndexes, 1));}void DefaultPieceStorageTest::testHasMissingPiece() {  DefaultPieceStorage pss(dctx_, option_.get());  CPPUNIT_ASSERT(!pss.hasMissingPiece(peer));  peer->setAllBitfield();  CPPUNIT_ASSERT(pss.hasMissingPiece(peer));}void DefaultPieceStorageTest::testCompletePiece() {  DefaultPieceStorage pss(dctx_, option_.get());  pss.setPieceSelector(std::move(pieceSelector_));  pss.setEndGamePieceNum(0);  peer->setAllBitfield();  auto piece = pss.getMissingPiece(peer, 1);  CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),                       piece->toString());  CPPUNIT_ASSERT_EQUAL((int64_t)0LL, pss.getCompletedLength());  pss.completePiece(piece);  CPPUNIT_ASSERT_EQUAL((int64_t)128LL, pss.getCompletedLength());  auto incompletePiece = pss.getMissingPiece(peer, 1);  incompletePiece->completeBlock(0);  CPPUNIT_ASSERT_EQUAL((int64_t)256LL, pss.getCompletedLength());}void DefaultPieceStorageTest::testGetPiece() {  DefaultPieceStorage pss(dctx_, option_.get());  auto pieceGot = pss.getPiece(0);  CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());  CPPUNIT_ASSERT_EQUAL(128, pieceGot->getLength());  CPPUNIT_ASSERT_EQUAL(false, pieceGot->pieceComplete());}void DefaultPieceStorageTest::testGetPieceInUsedPieces() {  DefaultPieceStorage pss(dctx_, option_.get());  auto piece = std::make_shared<Piece>(0, 128);  piece->completeBlock(0);  pss.addUsedPiece(piece);  auto  pieceGot = pss.getPiece(0);  CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());  CPPUNIT_ASSERT_EQUAL(128, pieceGot->getLength());  CPPUNIT_ASSERT_EQUAL((size_t)1, pieceGot->countCompleteBlock());}void DefaultPieceStorageTest::testGetPieceCompletedPiece() {  DefaultPieceStorage pss(dctx_, option_.get());  auto piece = std::make_shared<Piece>(0, 128);  pss.completePiece(piece);  auto pieceGot = pss.getPiece(0);  CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());  CPPUNIT_ASSERT_EQUAL(128, pieceGot->getLength());  CPPUNIT_ASSERT_EQUAL(true, pieceGot->pieceComplete());}void DefaultPieceStorageTest::testCancelPiece(){  size_t pieceLength = 256*1024;  int64_t totalLength = 32*pieceLength; // <-- make the number of piece greater than END_GAME_PIECE_NUM  std::deque<std::string> uris1;  uris1.push_back("http://localhost/src/file1.txt");  auto file1 = std::make_shared<FileEntry>("src/file1.txt", totalLength,                                           0 /*, uris1*/);  auto dctx = std::make_shared<DownloadContext>(pieceLength, totalLength,                                                "src/file1.txt");  DefaultPieceStorage ps{dctx, option_.get()};  auto p = ps.getMissingPiece(0, 1);  p->completeBlock(0);  ps.cancelPiece(p, 1);  auto p2 = ps.getMissingPiece(0, 2);  CPPUNIT_ASSERT(p2->hasBlock(0));  CPPUNIT_ASSERT(p2->usedBy(2));  CPPUNIT_ASSERT(!p2->usedBy(1));}void DefaultPieceStorageTest::testMarkPiecesDone(){  size_t pieceLength = 256*1024;  int64_t totalLength = 4*1024*1024;  auto dctx =std::make_shared<DownloadContext>(pieceLength, totalLength);  DefaultPieceStorage ps(dctx, option_.get());  ps.markPiecesDone(pieceLength*10+16*1024*2+1);  for(size_t i = 0; i < 10; ++i) {    CPPUNIT_ASSERT(ps.hasPiece(i));  }  for(size_t i = 10; i < (totalLength+pieceLength-1)/pieceLength; ++i) {    CPPUNIT_ASSERT(!ps.hasPiece(i));  }  CPPUNIT_ASSERT_EQUAL((int64_t)pieceLength*10+16*1024*2,                       ps.getCompletedLength());  ps.markPiecesDone(totalLength);  for(size_t i = 0; i < (totalLength+pieceLength-1)/pieceLength; ++i) {    CPPUNIT_ASSERT(ps.hasPiece(i));  }  ps.markPiecesDone(0);  CPPUNIT_ASSERT_EQUAL((int64_t)0, ps.getCompletedLength());}void DefaultPieceStorageTest::testGetCompletedLength(){  auto dctx = std::make_shared<DownloadContext>(1024*1024, 256*1024*1024);  DefaultPieceStorage ps(dctx, option_.get());  CPPUNIT_ASSERT_EQUAL((int64_t)0, ps.getCompletedLength());  ps.markPiecesDone(250*1024*1024);  CPPUNIT_ASSERT_EQUAL((int64_t)250*1024*1024, ps.getCompletedLength());  std::vector<std::shared_ptr<Piece>> inFlightPieces;  for(int i = 0; i < 2; ++i) {    auto p = std::make_shared<Piece>(250+i, 1024*1024);    for(int j = 0; j < 32; ++j) {      p->completeBlock(j);    }    inFlightPieces.push_back(p);    CPPUNIT_ASSERT_EQUAL(512*1024, p->getCompletedLength());  }  ps.addInFlightPiece(inFlightPieces);  CPPUNIT_ASSERT_EQUAL((int64_t)251*1024*1024, ps.getCompletedLength());  ps.markPiecesDone(256*1024*1024);  CPPUNIT_ASSERT_EQUAL((int64_t)256*1024*1024, ps.getCompletedLength());}void DefaultPieceStorageTest::testGetFilteredCompletedLength(){  const size_t pieceLength = 1024*1024;  auto dctx = std::make_shared<DownloadContext>();  dctx->setPieceLength(pieceLength);  auto files = std::vector<std::shared_ptr<FileEntry>>{    std::make_shared<FileEntry>("foo", 2*pieceLength, 0),    std::make_shared<FileEntry>("bar", 4*pieceLength, 2*pieceLength)  };  files[1]->setRequested(false);  dctx->setFileEntries(std::begin(files), std::end(files));  DefaultPieceStorage ps(dctx, option_.get());  std::vector<std::shared_ptr<Piece>> inflightPieces(2);  inflightPieces[0] = std::make_shared<Piece>(1, pieceLength);  inflightPieces[0]->completeBlock(0);  inflightPieces[1] = std::make_shared<Piece>(2, pieceLength);  inflightPieces[1]->completeBlock(1);  inflightPieces[1]->completeBlock(2);  ps.addInFlightPiece(inflightPieces);  ps.setupFileFilter();  auto piece = ps.getMissingPiece(0, 1);  ps.completePiece(piece);  CPPUNIT_ASSERT_EQUAL((int64_t)pieceLength+16*1024,                       ps.getFilteredCompletedLength());}void DefaultPieceStorageTest::testGetNextUsedIndex(){  DefaultPieceStorage pss(dctx_, option_.get());  CPPUNIT_ASSERT_EQUAL((size_t)3, pss.getNextUsedIndex(0));  auto piece = pss.getMissingPiece(2, 1);  CPPUNIT_ASSERT_EQUAL((size_t)2, pss.getNextUsedIndex(0));  pss.completePiece(piece);  CPPUNIT_ASSERT_EQUAL((size_t)2, pss.getNextUsedIndex(0));  piece = pss.getMissingPiece(0, 1);  CPPUNIT_ASSERT_EQUAL((size_t)2, pss.getNextUsedIndex(0));}} // namespace aria2
 |