DefaultPieceStorageTest.cc 9.2 KB

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