DefaultPieceStorageTest.cc 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306
  1. #include "DefaultPieceStorage.h"
  2. #include <cppunit/extensions/HelperMacros.h>
  3. #include "DefaultBtContext.h"
  4. #include "Util.h"
  5. #include "Exception.h"
  6. #include "FixedNumberRandomizer.h"
  7. #include "BitfieldManFactory.h"
  8. #include "Piece.h"
  9. #include "Peer.h"
  10. #include "Option.h"
  11. #include "FileEntry.h"
  12. #include "MockBtContext.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<BtContext> btContext;
  32. SharedHandle<Peer> peer;
  33. Option* option;
  34. public:
  35. DefaultPieceStorageTest() {
  36. SharedHandle<FixedNumberRandomizer> randomizer
  37. (new FixedNumberRandomizer());
  38. randomizer->setFixedNumber(0);
  39. BitfieldManFactory::setDefaultRandomizer(randomizer);
  40. }
  41. void setUp() {
  42. btContext.reset(new DefaultBtContext());
  43. btContext->load("test.torrent");
  44. peer.reset(new Peer("192.168.0.1", 6889));
  45. peer->allocateSessionResource(btContext->getPieceLength(),
  46. btContext->getTotalLength());
  47. option = new Option();
  48. }
  49. void tearDown()
  50. {
  51. delete option;
  52. option = 0;
  53. }
  54. void testGetTotalLength();
  55. void testGetMissingPiece();
  56. void testGetMissingPiece_excludedIndexes();
  57. void testGetMissingFastPiece();
  58. void testGetMissingFastPiece_excludedIndexes();
  59. void testHasMissingPiece();
  60. void testCompletePiece();
  61. void testGetPiece();
  62. void testGetPieceInUsedPieces();
  63. void testGetPieceCompletedPiece();
  64. void testCancelPiece();
  65. void testMarkPiecesDone();
  66. void testGetCompletedLength();
  67. };
  68. CPPUNIT_TEST_SUITE_REGISTRATION(DefaultPieceStorageTest);
  69. void DefaultPieceStorageTest::testGetTotalLength() {
  70. DefaultPieceStorage pss(btContext, option);
  71. CPPUNIT_ASSERT_EQUAL((uint64_t)384ULL, pss.getTotalLength());
  72. }
  73. void DefaultPieceStorageTest::testGetMissingPiece() {
  74. DefaultPieceStorage pss(btContext, option, false);
  75. pss.setEndGamePieceNum(0);
  76. peer->setAllBitfield();
  77. SharedHandle<Piece> piece = pss.getMissingPiece(peer);
  78. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),
  79. piece->toString());
  80. piece = pss.getMissingPiece(peer);
  81. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=1, length=128"),
  82. piece->toString());
  83. piece = pss.getMissingPiece(peer);
  84. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  85. piece->toString());
  86. piece = pss.getMissingPiece(peer);
  87. CPPUNIT_ASSERT(piece.isNull());
  88. }
  89. void DefaultPieceStorageTest::testGetMissingPiece_excludedIndexes()
  90. {
  91. DefaultPieceStorage pss(btContext, option, false);
  92. pss.setEndGamePieceNum(0);
  93. peer->setAllBitfield();
  94. std::deque<size_t> excludedIndexes;
  95. excludedIndexes.push_back(1);
  96. SharedHandle<Piece> piece = pss.getMissingPiece(peer, excludedIndexes);
  97. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),
  98. piece->toString());
  99. piece = pss.getMissingPiece(peer, excludedIndexes);
  100. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=2, length=128"),
  101. piece->toString());
  102. piece = pss.getMissingPiece(peer, excludedIndexes);
  103. CPPUNIT_ASSERT(piece.isNull());
  104. }
  105. void DefaultPieceStorageTest::testGetMissingFastPiece() {
  106. DefaultPieceStorage pss(btContext, option, false);
  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(btContext, option, false);
  119. pss.setEndGamePieceNum(0);
  120. peer->setAllBitfield();
  121. peer->setFastExtensionEnabled(true);
  122. peer->addPeerAllowedIndex(1);
  123. peer->addPeerAllowedIndex(2);
  124. std::deque<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(btContext, option);
  133. CPPUNIT_ASSERT(!pss.hasMissingPiece(peer));
  134. peer->setAllBitfield();
  135. CPPUNIT_ASSERT(pss.hasMissingPiece(peer));
  136. }
  137. void DefaultPieceStorageTest::testCompletePiece() {
  138. DefaultPieceStorage pss(btContext, option, false);
  139. pss.setEndGamePieceNum(0);
  140. peer->setAllBitfield();
  141. SharedHandle<Piece> piece = pss.getMissingPiece(peer);
  142. CPPUNIT_ASSERT_EQUAL(std::string("piece: index=0, length=128"),
  143. piece->toString());
  144. CPPUNIT_ASSERT_EQUAL((uint64_t)0ULL, pss.getCompletedLength());
  145. pss.completePiece(piece);
  146. CPPUNIT_ASSERT_EQUAL((uint64_t)128ULL, pss.getCompletedLength());
  147. SharedHandle<Piece> incompletePiece = pss.getMissingPiece(peer);
  148. incompletePiece->completeBlock(0);
  149. CPPUNIT_ASSERT_EQUAL((uint64_t)256ULL, pss.getCompletedLength());
  150. }
  151. void DefaultPieceStorageTest::testGetPiece() {
  152. DefaultPieceStorage pss(btContext, option);
  153. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  154. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  155. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  156. CPPUNIT_ASSERT_EQUAL(false, pieceGot->pieceComplete());
  157. }
  158. void DefaultPieceStorageTest::testGetPieceInUsedPieces() {
  159. DefaultPieceStorage pss(btContext, option);
  160. SharedHandle<Piece> piece = SharedHandle<Piece>(new Piece(0, 128));
  161. piece->completeBlock(0);
  162. pss.addUsedPiece(piece);
  163. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  164. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  165. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  166. CPPUNIT_ASSERT_EQUAL((size_t)1, pieceGot->countCompleteBlock());
  167. }
  168. void DefaultPieceStorageTest::testGetPieceCompletedPiece() {
  169. DefaultPieceStorage pss(btContext, option);
  170. SharedHandle<Piece> piece = SharedHandle<Piece>(new Piece(0, 128));
  171. pss.completePiece(piece);
  172. SharedHandle<Piece> pieceGot = pss.getPiece(0);
  173. CPPUNIT_ASSERT_EQUAL((size_t)0, pieceGot->getIndex());
  174. CPPUNIT_ASSERT_EQUAL((size_t)128, pieceGot->getLength());
  175. CPPUNIT_ASSERT_EQUAL(true, pieceGot->pieceComplete());
  176. }
  177. void DefaultPieceStorageTest::testCancelPiece()
  178. {
  179. size_t pieceLength = 256*1024;
  180. uint64_t totalLength = 32*pieceLength; // <-- make the number of piece greater than END_GAME_PIECE_NUM
  181. std::deque<std::string> uris1;
  182. uris1.push_back("http://localhost/src/file1.txt");
  183. SharedHandle<FileEntry> file1(new FileEntry("src/file1.txt", totalLength, 0 /*, uris1*/));
  184. SharedHandle<MockBtContext> dctx(new MockBtContext());
  185. dctx->setPieceLength(pieceLength);
  186. dctx->setTotalLength(totalLength);
  187. dctx->addFileEntry(file1);
  188. SharedHandle<DefaultPieceStorage> ps(new DefaultPieceStorage(dctx, option));
  189. SharedHandle<Piece> p = ps->getMissingPiece();
  190. p->completeBlock(0);
  191. ps->cancelPiece(p);
  192. SharedHandle<Piece> p2 = ps->getMissingPiece();
  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<MockBtContext> dctx(new MockBtContext());
  200. dctx->setPieceLength(pieceLength);
  201. dctx->setTotalLength(totalLength);
  202. DefaultPieceStorage ps(dctx, option);
  203. ps.markPiecesDone(pieceLength*10+16*1024*2+1);
  204. for(size_t i = 0; i < 10; ++i) {
  205. CPPUNIT_ASSERT(ps.hasPiece(i));
  206. }
  207. for(size_t i = 10; i < (totalLength+pieceLength-1)/pieceLength; ++i) {
  208. CPPUNIT_ASSERT(!ps.hasPiece(i));
  209. }
  210. CPPUNIT_ASSERT_EQUAL((uint64_t)pieceLength*10+16*1024*2, ps.getCompletedLength());
  211. ps.markPiecesDone(totalLength);
  212. for(size_t i = 0; i < (totalLength+pieceLength-1)/pieceLength; ++i) {
  213. CPPUNIT_ASSERT(ps.hasPiece(i));
  214. }
  215. }
  216. void DefaultPieceStorageTest::testGetCompletedLength()
  217. {
  218. SharedHandle<MockBtContext> dctx(new MockBtContext());
  219. dctx->setPieceLength(1024*1024);
  220. dctx->setTotalLength(256*1024*1024);
  221. DefaultPieceStorage ps(dctx, option);
  222. CPPUNIT_ASSERT_EQUAL((size_t)0, ps.getCompletedLength());
  223. ps.markPiecesDone(250*1024*1024);
  224. CPPUNIT_ASSERT_EQUAL((size_t)250*1024*1024, ps.getCompletedLength());
  225. std::deque<SharedHandle<Piece> > inFlightPieces;
  226. for(int i = 0; i < 2; ++i) {
  227. SharedHandle<Piece> p(new Piece(250+i, 1024*1024));
  228. for(int j = 0; j < 32; ++j) {
  229. p->completeBlock(j);
  230. }
  231. inFlightPieces.push_back(p);
  232. CPPUNIT_ASSERT_EQUAL((size_t)512*1024, p->getCompletedLength());
  233. }
  234. ps.addInFlightPiece(inFlightPieces);
  235. CPPUNIT_ASSERT_EQUAL((size_t)251*1024*1024, ps.getCompletedLength());
  236. ps.markPiecesDone(256*1024*1024);
  237. CPPUNIT_ASSERT_EQUAL((size_t)256*1024*1024, ps.getCompletedLength());
  238. }
  239. } // namespace aria2