DefaultPieceStorageTest.cc 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302
  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. namespace aria2 {
  14. class DefaultPieceStorageTest:public CppUnit::TestFixture {
  15. CPPUNIT_TEST_SUITE(DefaultPieceStorageTest);
  16. CPPUNIT_TEST(testGetTotalLength);
  17. CPPUNIT_TEST(testGetMissingPiece);
  18. CPPUNIT_TEST(testGetMissingPiece_excludedIndexes);
  19. CPPUNIT_TEST(testGetMissingFastPiece);
  20. CPPUNIT_TEST(testGetMissingFastPiece_excludedIndexes);
  21. CPPUNIT_TEST(testHasMissingPiece);
  22. CPPUNIT_TEST(testCompletePiece);
  23. CPPUNIT_TEST(testGetPiece);
  24. CPPUNIT_TEST(testGetPieceInUsedPieces);
  25. CPPUNIT_TEST(testGetPieceCompletedPiece);
  26. CPPUNIT_TEST(testCancelPiece);
  27. CPPUNIT_TEST(testMarkPiecesDone);
  28. CPPUNIT_TEST(testGetCompletedLength);
  29. CPPUNIT_TEST_SUITE_END();
  30. private:
  31. SharedHandle<DownloadContext> _dctx;
  32. SharedHandle<Peer> peer;
  33. Option* option;
  34. SharedHandle<PieceSelector> _pieceSelector;
  35. public:
  36. void setUp() {
  37. _dctx.reset(new DownloadContext());
  38. bittorrent::load("test.torrent", _dctx);
  39. peer.reset(new Peer("192.168.0.1", 6889));
  40. peer->allocateSessionResource(_dctx->getPieceLength(),
  41. _dctx->getTotalLength());
  42. option = new Option();
  43. _pieceSelector.reset(new InOrderPieceSelector());
  44. }
  45. void tearDown()
  46. {
  47. delete option;
  48. option = 0;
  49. }
  50. void testGetTotalLength();
  51. void testGetMissingPiece();
  52. void testGetMissingPiece_excludedIndexes();
  53. void testGetMissingFastPiece();
  54. void testGetMissingFastPiece_excludedIndexes();
  55. void testHasMissingPiece();
  56. void testCompletePiece();
  57. void testGetPiece();
  58. void testGetPieceInUsedPieces();
  59. void testGetPieceCompletedPiece();
  60. void testCancelPiece();
  61. void testMarkPiecesDone();
  62. void testGetCompletedLength();
  63. };
  64. CPPUNIT_TEST_SUITE_REGISTRATION(DefaultPieceStorageTest);
  65. void DefaultPieceStorageTest::testGetTotalLength() {
  66. DefaultPieceStorage pss(_dctx, option);
  67. CPPUNIT_ASSERT_EQUAL((uint64_t)384ULL, pss.getTotalLength());
  68. }
  69. void DefaultPieceStorageTest::testGetMissingPiece() {
  70. DefaultPieceStorage pss(_dctx, option);
  71. pss.setPieceSelector(_pieceSelector);
  72. pss.setEndGamePieceNum(0);
  73. peer->setAllBitfield();
  74. SharedHandle<Piece> piece = pss.getMissingPiece(peer);
  75. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),
  76. piece->toString());
  77. piece = pss.getMissingPiece(peer);
  78. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=1, length=128"),
  79. piece->toString());
  80. piece = pss.getMissingPiece(peer);
  81. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  82. piece->toString());
  83. piece = pss.getMissingPiece(peer);
  84. CPPUNIT_ASSERT(piece.isNull());
  85. }
  86. void DefaultPieceStorageTest::testGetMissingPiece_excludedIndexes()
  87. {
  88. DefaultPieceStorage pss(_dctx, option);
  89. pss.setPieceSelector(_pieceSelector);
  90. pss.setEndGamePieceNum(0);
  91. peer->setAllBitfield();
  92. std::vector<size_t> excludedIndexes;
  93. excludedIndexes.push_back(1);
  94. SharedHandle<Piece> piece = pss.getMissingPiece(peer, excludedIndexes);
  95. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),
  96. piece->toString());
  97. piece = pss.getMissingPiece(peer, excludedIndexes);
  98. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  99. piece->toString());
  100. piece = pss.getMissingPiece(peer, excludedIndexes);
  101. CPPUNIT_ASSERT(piece.isNull());
  102. }
  103. void DefaultPieceStorageTest::testGetMissingFastPiece() {
  104. DefaultPieceStorage pss(_dctx, option);
  105. pss.setPieceSelector(_pieceSelector);
  106. pss.setEndGamePieceNum(0);
  107. peer->setAllBitfield();
  108. peer->setFastExtensionEnabled(true);
  109. peer->addPeerAllowedIndex(2);
  110. SharedHandle<Piece> piece = pss.getMissingFastPiece(peer);
  111. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  112. piece->toString());
  113. CPPUNIT_ASSERT(pss.getMissingFastPiece(peer).isNull());
  114. }
  115. void DefaultPieceStorageTest::testGetMissingFastPiece_excludedIndexes()
  116. {
  117. DefaultPieceStorage pss(_dctx, option);
  118. pss.setPieceSelector(_pieceSelector);
  119. pss.setEndGamePieceNum(0);
  120. peer->setAllBitfield();
  121. peer->setFastExtensionEnabled(true);
  122. peer->addPeerAllowedIndex(1);
  123. peer->addPeerAllowedIndex(2);
  124. std::vector<size_t> excludedIndexes;
  125. excludedIndexes.push_back(2);
  126. SharedHandle<Piece> piece = pss.getMissingFastPiece(peer, excludedIndexes);
  127. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=1, length=128"),
  128. piece->toString());
  129. CPPUNIT_ASSERT(pss.getMissingFastPiece(peer, excludedIndexes).isNull());
  130. }
  131. void DefaultPieceStorageTest::testHasMissingPiece() {
  132. DefaultPieceStorage pss(_dctx, option);
  133. CPPUNIT_ASSERT(!pss.hasMissingPiece(peer));
  134. peer->setAllBitfield();
  135. CPPUNIT_ASSERT(pss.hasMissingPiece(peer));
  136. }
  137. void DefaultPieceStorageTest::testCompletePiece() {
  138. DefaultPieceStorage pss(_dctx, option);
  139. pss.setPieceSelector(_pieceSelector);
  140. pss.setEndGamePieceNum(0);
  141. peer->setAllBitfield();
  142. SharedHandle<Piece> piece = pss.getMissingPiece(peer);
  143. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),
  144. piece->toString());
  145. CPPUNIT_ASSERT_EQUAL((uint64_t)0ULL, pss.getCompletedLength());
  146. pss.completePiece(piece);
  147. CPPUNIT_ASSERT_EQUAL((uint64_t)128ULL, pss.getCompletedLength());
  148. SharedHandle<Piece> incompletePiece = pss.getMissingPiece(peer);
  149. incompletePiece->completeBlock(0);
  150. CPPUNIT_ASSERT_EQUAL((uint64_t)256ULL, pss.getCompletedLength());
  151. }
  152. void DefaultPieceStorageTest::testGetPiece() {
  153. DefaultPieceStorage pss(_dctx, option);
  154. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  155. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  156. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  157. CPPUNIT_ASSERT_EQUAL(false, pieceGot->pieceComplete());
  158. }
  159. void DefaultPieceStorageTest::testGetPieceInUsedPieces() {
  160. DefaultPieceStorage pss(_dctx, option);
  161. SharedHandle<Piece> piece = SharedHandle<Piece>(new Piece(0, 128));
  162. piece->completeBlock(0);
  163. pss.addUsedPiece(piece);
  164. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  165. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  166. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  167. CPPUNIT_ASSERT_EQUAL((size_t)1, pieceGot->countCompleteBlock());
  168. }
  169. void DefaultPieceStorageTest::testGetPieceCompletedPiece() {
  170. DefaultPieceStorage pss(_dctx, option);
  171. SharedHandle<Piece> piece = SharedHandle<Piece>(new Piece(0, 128));
  172. pss.completePiece(piece);
  173. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  174. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  175. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  176. CPPUNIT_ASSERT_EQUAL(true, pieceGot->pieceComplete());
  177. }
  178. void DefaultPieceStorageTest::testCancelPiece()
  179. {
  180. size_t pieceLength = 256*1024;
  181. uint64_t totalLength = 32*pieceLength; // <-- make the number of piece greater than END_GAME_PIECE_NUM
  182. std::deque<std::string> uris1;
  183. uris1.push_back("http://localhost/src/file1.txt");
  184. SharedHandle<FileEntry> file1(new FileEntry("src/file1.txt", totalLength, 0 /*, uris1*/));
  185. SharedHandle<DownloadContext> dctx
  186. (new DownloadContext(pieceLength, totalLength, "src/file1.txt"));
  187. SharedHandle<DefaultPieceStorage> ps(new DefaultPieceStorage(dctx, option));
  188. SharedHandle<Piece> p = ps->getMissingPiece(0);
  189. p->completeBlock(0);
  190. ps->cancelPiece(p);
  191. SharedHandle<Piece> p2 = ps->getMissingPiece(0);
  192. CPPUNIT_ASSERT(p2->hasBlock(0));
  193. }
  194. void DefaultPieceStorageTest::testMarkPiecesDone()
  195. {
  196. size_t pieceLength = 256*1024;
  197. uint64_t totalLength = 4*1024*1024;
  198. SharedHandle<DownloadContext> dctx
  199. (new DownloadContext(pieceLength, totalLength));
  200. DefaultPieceStorage ps(dctx, option);
  201. ps.markPiecesDone(pieceLength*10+16*1024*2+1);
  202. for(size_t i = 0; i < 10; ++i) {
  203. CPPUNIT_ASSERT(ps.hasPiece(i));
  204. }
  205. for(size_t i = 10; i < (totalLength+pieceLength-1)/pieceLength; ++i) {
  206. CPPUNIT_ASSERT(!ps.hasPiece(i));
  207. }
  208. CPPUNIT_ASSERT_EQUAL((uint64_t)pieceLength*10+16*1024*2, ps.getCompletedLength());
  209. ps.markPiecesDone(totalLength);
  210. for(size_t i = 0; i < (totalLength+pieceLength-1)/pieceLength; ++i) {
  211. CPPUNIT_ASSERT(ps.hasPiece(i));
  212. }
  213. }
  214. void DefaultPieceStorageTest::testGetCompletedLength()
  215. {
  216. SharedHandle<DownloadContext> dctx
  217. (new DownloadContext(1024*1024, 256*1024*1024));
  218. DefaultPieceStorage ps(dctx, option);
  219. CPPUNIT_ASSERT_EQUAL((uint64_t)0, ps.getCompletedLength());
  220. ps.markPiecesDone(250*1024*1024);
  221. CPPUNIT_ASSERT_EQUAL((uint64_t)250*1024*1024, ps.getCompletedLength());
  222. std::vector<SharedHandle<Piece> > inFlightPieces;
  223. for(int i = 0; i < 2; ++i) {
  224. SharedHandle<Piece> p(new Piece(250+i, 1024*1024));
  225. for(int j = 0; j < 32; ++j) {
  226. p->completeBlock(j);
  227. }
  228. inFlightPieces.push_back(p);
  229. CPPUNIT_ASSERT_EQUAL((size_t)512*1024, p->getCompletedLength());
  230. }
  231. ps.addInFlightPiece(inFlightPieces);
  232. CPPUNIT_ASSERT_EQUAL((uint64_t)251*1024*1024, ps.getCompletedLength());
  233. ps.markPiecesDone(256*1024*1024);
  234. CPPUNIT_ASSERT_EQUAL((uint64_t)256*1024*1024, ps.getCompletedLength());
  235. }
  236. } // namespace aria2