DefaultPieceStorageTest.cc 9.3 KB

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