DefaultPieceStorageTest.cc 6.6 KB

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