DefaultPieceStorageTest.cc 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226
  1. #include "DefaultPieceStorage.h"
  2. #include "DefaultBtContext.h"
  3. #include "Util.h"
  4. #include "Exception.h"
  5. #include "FixedNumberRandomizer.h"
  6. #include "BitfieldManFactory.h"
  7. #include "Piece.h"
  8. #include "Peer.h"
  9. #include "Option.h"
  10. #include "FileEntry.h"
  11. #include "MockBtContext.h"
  12. #include <cppunit/extensions/HelperMacros.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(testGetMissingFastPiece);
  19. CPPUNIT_TEST(testHasMissingPiece);
  20. CPPUNIT_TEST(testCompletePiece);
  21. CPPUNIT_TEST(testGetPiece);
  22. CPPUNIT_TEST(testGetPieceInUsedPieces);
  23. CPPUNIT_TEST(testGetPieceCompletedPiece);
  24. CPPUNIT_TEST(testCancelPiece);
  25. CPPUNIT_TEST(testMarkPiecesDone);
  26. CPPUNIT_TEST_SUITE_END();
  27. private:
  28. SharedHandle<BtContext> btContext;
  29. SharedHandle<Peer> peer;
  30. Option* option;
  31. public:
  32. DefaultPieceStorageTest() {
  33. SharedHandle<FixedNumberRandomizer> randomizer
  34. (new FixedNumberRandomizer());
  35. randomizer->setFixedNumber(0);
  36. BitfieldManFactory::setDefaultRandomizer(randomizer);
  37. }
  38. void setUp() {
  39. btContext.reset(new DefaultBtContext());
  40. btContext->load("test.torrent");
  41. peer.reset(new Peer("192.168.0.1", 6889));
  42. peer->allocateSessionResource(btContext->getPieceLength(),
  43. btContext->getTotalLength());
  44. option = new Option();
  45. }
  46. void tearDown()
  47. {
  48. delete option;
  49. option = 0;
  50. }
  51. void testGetTotalLength();
  52. void testGetMissingPiece();
  53. void testGetMissingFastPiece();
  54. void testHasMissingPiece();
  55. void testCompletePiece();
  56. void testGetPiece();
  57. void testGetPieceInUsedPieces();
  58. void testGetPieceCompletedPiece();
  59. void testCancelPiece();
  60. void testMarkPiecesDone();
  61. };
  62. CPPUNIT_TEST_SUITE_REGISTRATION(DefaultPieceStorageTest);
  63. void DefaultPieceStorageTest::testGetTotalLength() {
  64. DefaultPieceStorage pss(btContext, option);
  65. CPPUNIT_ASSERT_EQUAL(384ULL, pss.getTotalLength());
  66. }
  67. void DefaultPieceStorageTest::testGetMissingPiece() {
  68. DefaultPieceStorage pss(btContext, option);
  69. pss.setEndGamePieceNum(0);
  70. peer->setAllBitfield();
  71. // TODO the ordering of piece may vary depending on the system, so the test
  72. // may fail.
  73. SharedHandle<Piece> piece = pss.getMissingPiece(peer);
  74. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  75. piece->toString());
  76. piece = pss.getMissingPiece(peer);
  77. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=1, length=128"),
  78. piece->toString());
  79. 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(piece.isNull());
  84. }
  85. void DefaultPieceStorageTest::testGetMissingFastPiece() {
  86. DefaultPieceStorage pss(btContext, option);
  87. pss.setEndGamePieceNum(0);
  88. peer->setAllBitfield();
  89. peer->setFastExtensionEnabled(true);
  90. peer->addPeerAllowedIndex(2);
  91. SharedHandle<Piece> piece = pss.getMissingFastPiece(peer);
  92. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  93. piece->toString());
  94. }
  95. void DefaultPieceStorageTest::testHasMissingPiece() {
  96. DefaultPieceStorage pss(btContext, option);
  97. CPPUNIT_ASSERT(!pss.hasMissingPiece(peer));
  98. peer->setAllBitfield();
  99. CPPUNIT_ASSERT(pss.hasMissingPiece(peer));
  100. }
  101. void DefaultPieceStorageTest::testCompletePiece() {
  102. DefaultPieceStorage pss(btContext, option);
  103. pss.setEndGamePieceNum(0);
  104. peer->setAllBitfield();
  105. // TODO the ordering of piece may vary depending on the system, so the test
  106. // may fail.
  107. SharedHandle<Piece> piece = pss.getMissingPiece(peer);
  108. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  109. piece->toString());
  110. CPPUNIT_ASSERT_EQUAL(0ULL, pss.getCompletedLength());
  111. pss.completePiece(piece);
  112. CPPUNIT_ASSERT_EQUAL(128ULL, pss.getCompletedLength());
  113. SharedHandle<Piece> incompletePiece = pss.getMissingPiece(peer);
  114. incompletePiece->completeBlock(0);
  115. CPPUNIT_ASSERT_EQUAL(256ULL, pss.getCompletedLength());
  116. }
  117. void DefaultPieceStorageTest::testGetPiece() {
  118. DefaultPieceStorage pss(btContext, option);
  119. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  120. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  121. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  122. CPPUNIT_ASSERT_EQUAL(false, pieceGot->pieceComplete());
  123. }
  124. void DefaultPieceStorageTest::testGetPieceInUsedPieces() {
  125. DefaultPieceStorage pss(btContext, option);
  126. SharedHandle<Piece> piece = SharedHandle<Piece>(new Piece(0, 128));
  127. piece->completeBlock(0);
  128. pss.addUsedPiece(piece);
  129. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  130. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  131. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  132. CPPUNIT_ASSERT_EQUAL((size_t)1, pieceGot->countCompleteBlock());
  133. }
  134. void DefaultPieceStorageTest::testGetPieceCompletedPiece() {
  135. DefaultPieceStorage pss(btContext, option);
  136. SharedHandle<Piece> piece = SharedHandle<Piece>(new Piece(0, 128));
  137. pss.completePiece(piece);
  138. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  139. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  140. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  141. CPPUNIT_ASSERT_EQUAL(true, pieceGot->pieceComplete());
  142. }
  143. void DefaultPieceStorageTest::testCancelPiece()
  144. {
  145. size_t pieceLength = 256*1024;
  146. uint64_t totalLength = 32*pieceLength; // <-- make the number of piece greater than END_GAME_PIECE_NUM
  147. std::deque<std::string> uris1;
  148. uris1.push_back("http://localhost/src/file1.txt");
  149. SharedHandle<FileEntry> file1(new FileEntry("src/file1.txt", totalLength, 0 /*, uris1*/));
  150. SharedHandle<MockBtContext> dctx(new MockBtContext());
  151. dctx->setPieceLength(pieceLength);
  152. dctx->setTotalLength(totalLength);
  153. dctx->addFileEntry(file1);
  154. SharedHandle<DefaultPieceStorage> ps(new DefaultPieceStorage(dctx, option));
  155. SharedHandle<Piece> p = ps->getMissingPiece();
  156. p->completeBlock(0);
  157. ps->cancelPiece(p);
  158. SharedHandle<Piece> p2 = ps->getMissingPiece();
  159. CPPUNIT_ASSERT(p2->hasBlock(0));
  160. }
  161. void DefaultPieceStorageTest::testMarkPiecesDone()
  162. {
  163. size_t pieceLength = 256*1024;
  164. uint64_t totalLength = 4*1024*1024;
  165. SharedHandle<MockBtContext> dctx(new MockBtContext());
  166. dctx->setPieceLength(pieceLength);
  167. dctx->setTotalLength(totalLength);
  168. DefaultPieceStorage ps(dctx, option);
  169. ps.markPiecesDone(pieceLength*10+16*1024*2+1);
  170. for(size_t i = 0; i < 10; ++i) {
  171. CPPUNIT_ASSERT(ps.hasPiece(i));
  172. }
  173. for(size_t i = 10; i < (totalLength+pieceLength-1)/pieceLength; ++i) {
  174. CPPUNIT_ASSERT(!ps.hasPiece(i));
  175. }
  176. CPPUNIT_ASSERT_EQUAL((uint64_t)pieceLength*10+16*1024*2, ps.getCompletedLength());
  177. ps.markPiecesDone(totalLength);
  178. for(size_t i = 0; i < (totalLength+pieceLength-1)/pieceLength; ++i) {
  179. CPPUNIT_ASSERT(ps.hasPiece(i));
  180. }
  181. }
  182. } // namespace aria2