DefaultPieceStorageTest.cc 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356
  1. #include "DefaultPieceStorage.h"
  2. #include <cppunit/extensions/HelperMacros.h>
  3. #include "util.h"
  4. #include "Exception.h"
  5. #include "Piece.h"
  6. #include "Peer.h"
  7. #include "Option.h"
  8. #include "FileEntry.h"
  9. #include "RarestPieceSelector.h"
  10. #include "InOrderPieceSelector.h"
  11. #include "DownloadContext.h"
  12. #include "bittorrent_helper.h"
  13. #include "DiskAdaptor.h"
  14. #include "DiskWriterFactory.h"
  15. #include "PieceStatMan.h"
  16. #include "prefs.h"
  17. namespace aria2 {
  18. class DefaultPieceStorageTest:public CppUnit::TestFixture {
  19. CPPUNIT_TEST_SUITE(DefaultPieceStorageTest);
  20. CPPUNIT_TEST(testGetTotalLength);
  21. CPPUNIT_TEST(testGetMissingPiece);
  22. CPPUNIT_TEST(testGetMissingPiece_many);
  23. CPPUNIT_TEST(testGetMissingPiece_excludedIndexes);
  24. CPPUNIT_TEST(testGetMissingPiece_manyWithExcludedIndexes);
  25. CPPUNIT_TEST(testGetMissingFastPiece);
  26. CPPUNIT_TEST(testGetMissingFastPiece_excludedIndexes);
  27. CPPUNIT_TEST(testHasMissingPiece);
  28. CPPUNIT_TEST(testCompletePiece);
  29. CPPUNIT_TEST(testGetPiece);
  30. CPPUNIT_TEST(testGetPieceInUsedPieces);
  31. CPPUNIT_TEST(testGetPieceCompletedPiece);
  32. CPPUNIT_TEST(testCancelPiece);
  33. CPPUNIT_TEST(testMarkPiecesDone);
  34. CPPUNIT_TEST(testGetCompletedLength);
  35. CPPUNIT_TEST(testGetNextUsedIndex);
  36. CPPUNIT_TEST_SUITE_END();
  37. private:
  38. SharedHandle<DownloadContext> dctx_;
  39. SharedHandle<Peer> peer;
  40. SharedHandle<Option> option_;
  41. SharedHandle<PieceSelector> pieceSelector_;
  42. public:
  43. void setUp() {
  44. option_.reset(new Option());
  45. option_->put(PREF_DIR, ".");
  46. dctx_.reset(new DownloadContext());
  47. bittorrent::load(A2_TEST_DIR"/test.torrent", dctx_, option_);
  48. peer.reset(new Peer("192.168.0.1", 6889));
  49. peer->allocateSessionResource(dctx_->getPieceLength(),
  50. dctx_->getTotalLength());
  51. pieceSelector_.reset(new InOrderPieceSelector());
  52. }
  53. void testGetTotalLength();
  54. void testGetMissingPiece();
  55. void testGetMissingPiece_many();
  56. void testGetMissingPiece_excludedIndexes();
  57. void testGetMissingPiece_manyWithExcludedIndexes();
  58. void testGetMissingFastPiece();
  59. void testGetMissingFastPiece_excludedIndexes();
  60. void testHasMissingPiece();
  61. void testCompletePiece();
  62. void testGetPiece();
  63. void testGetPieceInUsedPieces();
  64. void testGetPieceCompletedPiece();
  65. void testCancelPiece();
  66. void testMarkPiecesDone();
  67. void testGetCompletedLength();
  68. void testGetNextUsedIndex();
  69. };
  70. CPPUNIT_TEST_SUITE_REGISTRATION(DefaultPieceStorageTest);
  71. void DefaultPieceStorageTest::testGetTotalLength() {
  72. DefaultPieceStorage pss(dctx_, option_.get());
  73. CPPUNIT_ASSERT_EQUAL((uint64_t)384ULL, pss.getTotalLength());
  74. }
  75. void DefaultPieceStorageTest::testGetMissingPiece() {
  76. DefaultPieceStorage pss(dctx_, option_.get());
  77. pss.setPieceSelector(pieceSelector_);
  78. peer->setAllBitfield();
  79. SharedHandle<Piece> piece = pss.getMissingPiece(peer);
  80. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),
  81. piece->toString());
  82. piece = pss.getMissingPiece(peer);
  83. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=1, length=128"),
  84. piece->toString());
  85. piece = pss.getMissingPiece(peer);
  86. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  87. piece->toString());
  88. piece = pss.getMissingPiece(peer);
  89. CPPUNIT_ASSERT(!piece);
  90. }
  91. void DefaultPieceStorageTest::testGetMissingPiece_many() {
  92. DefaultPieceStorage pss(dctx_, option_.get());
  93. pss.setPieceSelector(pieceSelector_);
  94. peer->setAllBitfield();
  95. std::vector<SharedHandle<Piece> > pieces;
  96. pss.getMissingPiece(pieces, 2, peer);
  97. CPPUNIT_ASSERT_EQUAL((size_t)2, pieces.size());
  98. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),
  99. pieces[0]->toString());
  100. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=1, length=128"),
  101. pieces[1]->toString());
  102. pieces.clear();
  103. pss.getMissingPiece(pieces, 2, peer);
  104. CPPUNIT_ASSERT_EQUAL((size_t)1, pieces.size());
  105. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  106. pieces[0]->toString());
  107. }
  108. void DefaultPieceStorageTest::testGetMissingPiece_excludedIndexes()
  109. {
  110. DefaultPieceStorage pss(dctx_, option_.get());
  111. pss.setPieceSelector(pieceSelector_);
  112. pss.setEndGamePieceNum(0);
  113. peer->setAllBitfield();
  114. std::vector<size_t> excludedIndexes;
  115. excludedIndexes.push_back(1);
  116. SharedHandle<Piece> piece = pss.getMissingPiece(peer, excludedIndexes);
  117. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),
  118. piece->toString());
  119. piece = pss.getMissingPiece(peer, excludedIndexes);
  120. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  121. piece->toString());
  122. piece = pss.getMissingPiece(peer, excludedIndexes);
  123. CPPUNIT_ASSERT(!piece);
  124. }
  125. void DefaultPieceStorageTest::testGetMissingPiece_manyWithExcludedIndexes() {
  126. DefaultPieceStorage pss(dctx_, option_.get());
  127. pss.setPieceSelector(pieceSelector_);
  128. peer->setAllBitfield();
  129. std::vector<size_t> excludedIndexes;
  130. excludedIndexes.push_back(1);
  131. std::vector<SharedHandle<Piece> > pieces;
  132. pss.getMissingPiece(pieces, 2, peer, excludedIndexes);
  133. CPPUNIT_ASSERT_EQUAL((size_t)2, pieces.size());
  134. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),
  135. pieces[0]->toString());
  136. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  137. pieces[1]->toString());
  138. pieces.clear();
  139. pss.getMissingPiece(pieces, 2, peer, excludedIndexes);
  140. CPPUNIT_ASSERT(pieces.empty());
  141. }
  142. void DefaultPieceStorageTest::testGetMissingFastPiece() {
  143. DefaultPieceStorage pss(dctx_, option_.get());
  144. pss.setPieceSelector(pieceSelector_);
  145. pss.setEndGamePieceNum(0);
  146. peer->setAllBitfield();
  147. peer->setFastExtensionEnabled(true);
  148. peer->addPeerAllowedIndex(2);
  149. SharedHandle<Piece> piece = pss.getMissingFastPiece(peer);
  150. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  151. piece->toString());
  152. CPPUNIT_ASSERT(!pss.getMissingFastPiece(peer));
  153. }
  154. void DefaultPieceStorageTest::testGetMissingFastPiece_excludedIndexes()
  155. {
  156. DefaultPieceStorage pss(dctx_, option_.get());
  157. pss.setPieceSelector(pieceSelector_);
  158. pss.setEndGamePieceNum(0);
  159. peer->setAllBitfield();
  160. peer->setFastExtensionEnabled(true);
  161. peer->addPeerAllowedIndex(1);
  162. peer->addPeerAllowedIndex(2);
  163. std::vector<size_t> excludedIndexes;
  164. excludedIndexes.push_back(2);
  165. SharedHandle<Piece> piece = pss.getMissingFastPiece(peer, excludedIndexes);
  166. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=1, length=128"),
  167. piece->toString());
  168. CPPUNIT_ASSERT(!pss.getMissingFastPiece(peer, excludedIndexes));
  169. }
  170. void DefaultPieceStorageTest::testHasMissingPiece() {
  171. DefaultPieceStorage pss(dctx_, option_.get());
  172. CPPUNIT_ASSERT(!pss.hasMissingPiece(peer));
  173. peer->setAllBitfield();
  174. CPPUNIT_ASSERT(pss.hasMissingPiece(peer));
  175. }
  176. void DefaultPieceStorageTest::testCompletePiece() {
  177. DefaultPieceStorage pss(dctx_, option_.get());
  178. pss.setPieceSelector(pieceSelector_);
  179. pss.setEndGamePieceNum(0);
  180. peer->setAllBitfield();
  181. SharedHandle<Piece> piece = pss.getMissingPiece(peer);
  182. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),
  183. piece->toString());
  184. CPPUNIT_ASSERT_EQUAL((uint64_t)0ULL, pss.getCompletedLength());
  185. pss.completePiece(piece);
  186. CPPUNIT_ASSERT_EQUAL((uint64_t)128ULL, pss.getCompletedLength());
  187. SharedHandle<Piece> incompletePiece = pss.getMissingPiece(peer);
  188. incompletePiece->completeBlock(0);
  189. CPPUNIT_ASSERT_EQUAL((uint64_t)256ULL, pss.getCompletedLength());
  190. }
  191. void DefaultPieceStorageTest::testGetPiece() {
  192. DefaultPieceStorage pss(dctx_, option_.get());
  193. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  194. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  195. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  196. CPPUNIT_ASSERT_EQUAL(false, pieceGot->pieceComplete());
  197. }
  198. void DefaultPieceStorageTest::testGetPieceInUsedPieces() {
  199. DefaultPieceStorage pss(dctx_, option_.get());
  200. SharedHandle<Piece> piece = SharedHandle<Piece>(new Piece(0, 128));
  201. piece->completeBlock(0);
  202. pss.addUsedPiece(piece);
  203. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  204. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  205. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  206. CPPUNIT_ASSERT_EQUAL((size_t)1, pieceGot->countCompleteBlock());
  207. }
  208. void DefaultPieceStorageTest::testGetPieceCompletedPiece() {
  209. DefaultPieceStorage pss(dctx_, option_.get());
  210. SharedHandle<Piece> piece = SharedHandle<Piece>(new Piece(0, 128));
  211. pss.completePiece(piece);
  212. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  213. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  214. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  215. CPPUNIT_ASSERT_EQUAL(true, pieceGot->pieceComplete());
  216. }
  217. void DefaultPieceStorageTest::testCancelPiece()
  218. {
  219. size_t pieceLength = 256*1024;
  220. uint64_t totalLength = 32*pieceLength; // <-- make the number of piece greater than END_GAME_PIECE_NUM
  221. std::deque<std::string> uris1;
  222. uris1.push_back("http://localhost/src/file1.txt");
  223. SharedHandle<FileEntry> file1(new FileEntry("src/file1.txt", totalLength, 0 /*, uris1*/));
  224. SharedHandle<DownloadContext> dctx
  225. (new DownloadContext(pieceLength, totalLength, "src/file1.txt"));
  226. SharedHandle<DefaultPieceStorage> ps(new DefaultPieceStorage(dctx, option_.get()));
  227. SharedHandle<Piece> p = ps->getMissingPiece(0);
  228. p->completeBlock(0);
  229. ps->cancelPiece(p);
  230. SharedHandle<Piece> p2 = ps->getMissingPiece(0);
  231. CPPUNIT_ASSERT(p2->hasBlock(0));
  232. }
  233. void DefaultPieceStorageTest::testMarkPiecesDone()
  234. {
  235. size_t pieceLength = 256*1024;
  236. uint64_t totalLength = 4*1024*1024;
  237. SharedHandle<DownloadContext> dctx
  238. (new DownloadContext(pieceLength, totalLength));
  239. DefaultPieceStorage ps(dctx, option_.get());
  240. ps.markPiecesDone(pieceLength*10+16*1024*2+1);
  241. for(size_t i = 0; i < 10; ++i) {
  242. CPPUNIT_ASSERT(ps.hasPiece(i));
  243. }
  244. for(size_t i = 10; i < (totalLength+pieceLength-1)/pieceLength; ++i) {
  245. CPPUNIT_ASSERT(!ps.hasPiece(i));
  246. }
  247. CPPUNIT_ASSERT_EQUAL((uint64_t)pieceLength*10+16*1024*2, ps.getCompletedLength());
  248. ps.markPiecesDone(totalLength);
  249. for(size_t i = 0; i < (totalLength+pieceLength-1)/pieceLength; ++i) {
  250. CPPUNIT_ASSERT(ps.hasPiece(i));
  251. }
  252. ps.markPiecesDone(0);
  253. CPPUNIT_ASSERT_EQUAL((uint64_t)0, ps.getCompletedLength());
  254. }
  255. void DefaultPieceStorageTest::testGetCompletedLength()
  256. {
  257. SharedHandle<DownloadContext> dctx
  258. (new DownloadContext(1024*1024, 256*1024*1024));
  259. DefaultPieceStorage ps(dctx, option_.get());
  260. CPPUNIT_ASSERT_EQUAL((uint64_t)0, ps.getCompletedLength());
  261. ps.markPiecesDone(250*1024*1024);
  262. CPPUNIT_ASSERT_EQUAL((uint64_t)250*1024*1024, ps.getCompletedLength());
  263. std::vector<SharedHandle<Piece> > inFlightPieces;
  264. for(int i = 0; i < 2; ++i) {
  265. SharedHandle<Piece> p(new Piece(250+i, 1024*1024));
  266. for(int j = 0; j < 32; ++j) {
  267. p->completeBlock(j);
  268. }
  269. inFlightPieces.push_back(p);
  270. CPPUNIT_ASSERT_EQUAL((size_t)512*1024, p->getCompletedLength());
  271. }
  272. ps.addInFlightPiece(inFlightPieces);
  273. CPPUNIT_ASSERT_EQUAL((uint64_t)251*1024*1024, ps.getCompletedLength());
  274. ps.markPiecesDone(256*1024*1024);
  275. CPPUNIT_ASSERT_EQUAL((uint64_t)256*1024*1024, ps.getCompletedLength());
  276. }
  277. void DefaultPieceStorageTest::testGetNextUsedIndex()
  278. {
  279. DefaultPieceStorage pss(dctx_, option_.get());
  280. CPPUNIT_ASSERT_EQUAL((size_t)3, pss.getNextUsedIndex(0));
  281. SharedHandle<Piece> piece = pss.getMissingPiece(2);
  282. CPPUNIT_ASSERT_EQUAL((size_t)2, pss.getNextUsedIndex(0));
  283. pss.completePiece(piece);
  284. CPPUNIT_ASSERT_EQUAL((size_t)2, pss.getNextUsedIndex(0));
  285. piece = pss.getMissingPiece(0);
  286. CPPUNIT_ASSERT_EQUAL((size_t)2, pss.getNextUsedIndex(0));
  287. }
  288. } // namespace aria2