DefaultPieceStorageTest.cc 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269
  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 "MockBtContext.h"
  11. #include <cppunit/extensions/HelperMacros.h>
  12. using namespace std;
  13. class DefaultPieceStorageTest:public CppUnit::TestFixture {
  14. CPPUNIT_TEST_SUITE(DefaultPieceStorageTest);
  15. CPPUNIT_TEST(testGetTotalLength);
  16. CPPUNIT_TEST(testGetMissingPiece);
  17. CPPUNIT_TEST(testGetMissingFastPiece);
  18. CPPUNIT_TEST(testHasMissingPiece);
  19. CPPUNIT_TEST(testCompletePiece);
  20. CPPUNIT_TEST(testGetPiece);
  21. CPPUNIT_TEST(testGetPieceInUsedPieces);
  22. CPPUNIT_TEST(testGetPieceCompletedPiece);
  23. CPPUNIT_TEST(testGetMissingPiece_fileEntry);
  24. CPPUNIT_TEST(testCancelPiece);
  25. CPPUNIT_TEST_SUITE_END();
  26. private:
  27. BtContextHandle btContext;
  28. PeerHandle peer;
  29. Option* option;
  30. public:
  31. DefaultPieceStorageTest():btContext(0), peer(0) {
  32. FixedNumberRandomizer* randomizer = new FixedNumberRandomizer();
  33. randomizer->setFixedNumber(0);
  34. BitfieldManFactory::setDefaultRandomizer(randomizer);
  35. }
  36. void setUp() {
  37. btContext = new DefaultBtContext();
  38. btContext->load("test.torrent");
  39. peer = PeerHandle(new Peer("192.168.0.1", 6889,
  40. btContext->getPieceLength(),
  41. btContext->getTotalLength()));
  42. option = new Option();
  43. }
  44. void tearDown()
  45. {
  46. delete option;
  47. option = 0;
  48. }
  49. void testGetTotalLength();
  50. void testGetMissingPiece();
  51. void testGetMissingFastPiece();
  52. void testHasMissingPiece();
  53. void testCompletePiece();
  54. void testGetPiece();
  55. void testGetPieceInUsedPieces();
  56. void testGetPieceCompletedPiece();
  57. void testGetMissingPiece_fileEntry();
  58. void testCancelPiece();
  59. };
  60. CPPUNIT_TEST_SUITE_REGISTRATION(DefaultPieceStorageTest);
  61. void DefaultPieceStorageTest::testGetTotalLength() {
  62. DefaultPieceStorage pss(btContext, option);
  63. CPPUNIT_ASSERT_EQUAL((long long int)384,
  64. pss.getTotalLength());
  65. }
  66. void DefaultPieceStorageTest::testGetMissingPiece() {
  67. DefaultPieceStorage pss(btContext, option);
  68. pss.setEndGamePieceNum(0);
  69. peer->setAllBitfield();
  70. PieceHandle piece = pss.getMissingPiece(peer);
  71. CPPUNIT_ASSERT_EQUAL(string("piece: index=0, length=128"),
  72. piece->toString());
  73. piece = pss.getMissingPiece(peer);
  74. CPPUNIT_ASSERT_EQUAL(string("piece: index=1, length=128"),
  75. piece->toString());
  76. piece = pss.getMissingPiece(peer);
  77. CPPUNIT_ASSERT_EQUAL(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->addFastSetIndex(2);
  88. PieceHandle piece = pss.getMissingFastPiece(peer);
  89. CPPUNIT_ASSERT_EQUAL(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. PieceHandle piece = pss.getMissingPiece(peer);
  103. CPPUNIT_ASSERT_EQUAL(string("piece: index=0, length=128"),
  104. piece->toString());
  105. CPPUNIT_ASSERT_EQUAL((int64_t)0,
  106. pss.getCompletedLength());
  107. pss.completePiece(piece);
  108. CPPUNIT_ASSERT_EQUAL((int64_t)128,
  109. pss.getCompletedLength());
  110. PieceHandle incompletePiece = pss.getMissingPiece(peer);
  111. incompletePiece->completeBlock(0);
  112. CPPUNIT_ASSERT_EQUAL((int64_t)256,
  113. pss.getCompletedLength());
  114. }
  115. void DefaultPieceStorageTest::testGetPiece() {
  116. DefaultPieceStorage pss(btContext, option);
  117. PieceHandle pieceGot = pss.getPiece(0);
  118. CPPUNIT_ASSERT_EQUAL((int32_t)0, pieceGot->getIndex());
  119. CPPUNIT_ASSERT_EQUAL((int32_t)128, pieceGot->getLength());
  120. CPPUNIT_ASSERT_EQUAL(false, pieceGot->pieceComplete());
  121. }
  122. void DefaultPieceStorageTest::testGetPieceInUsedPieces() {
  123. DefaultPieceStorage pss(btContext, option);
  124. PieceHandle piece = PieceHandle(new Piece(0, 128));
  125. piece->completeBlock(0);
  126. pss.addUsedPiece(piece);
  127. PieceHandle pieceGot = pss.getPiece(0);
  128. CPPUNIT_ASSERT_EQUAL((int32_t)0, pieceGot->getIndex());
  129. CPPUNIT_ASSERT_EQUAL((int32_t)128, pieceGot->getLength());
  130. CPPUNIT_ASSERT_EQUAL((int32_t)1, pieceGot->countCompleteBlock());
  131. }
  132. void DefaultPieceStorageTest::testGetPieceCompletedPiece() {
  133. DefaultPieceStorage pss(btContext, option);
  134. PieceHandle piece = PieceHandle(new Piece(0, 128));
  135. pss.completePiece(piece);
  136. PieceHandle pieceGot = pss.getPiece(0);
  137. CPPUNIT_ASSERT_EQUAL((int32_t)0, pieceGot->getIndex());
  138. CPPUNIT_ASSERT_EQUAL((int32_t)128, pieceGot->getLength());
  139. CPPUNIT_ASSERT_EQUAL(true, pieceGot->pieceComplete());
  140. }
  141. void DefaultPieceStorageTest::testGetMissingPiece_fileEntry()
  142. {
  143. // - 32KB
  144. // +--------+
  145. // |11111222|
  146. int32_t pieceLength = 256*1024;
  147. int64_t totalLength = 1*pieceLength;
  148. int32_t blockLength = 16*1024;
  149. Strings uris1;
  150. uris1.push_back("http://localhost/src/file1.txt");
  151. Strings uris2;
  152. uris2.push_back("http://localhost/src/file2.txt");
  153. FileEntryHandle file1 = new FileEntry("src/file1.txt", 150*1024, 0/*, uris1*/);
  154. FileEntryHandle file2 = new FileEntry("src/file2.txt", 106*1024, file1->getLength() /*, uris2*/);
  155. MockBtContextHandle dctx = new MockBtContext();
  156. dctx->setPieceLength(pieceLength);
  157. dctx->setTotalLength(totalLength);
  158. dctx->addFileEntry(file1);
  159. dctx->addFileEntry(file2);
  160. DefaultPieceStorageHandle ps = new DefaultPieceStorage(dctx, option);
  161. PieceHandle p = ps->getMissingPiece(file1);
  162. CPPUNIT_ASSERT(!p.isNull());
  163. CPPUNIT_ASSERT_EQUAL((int32_t)0, p->getIndex());
  164. for(int32_t i = 0; i < 9; ++i) {
  165. p->completeBlock(i);
  166. }
  167. PieceHandle subPiece = new Piece(9, blockLength, 1);
  168. p->addSubPiece(subPiece);
  169. ps->cancelPiece(p);
  170. // Piece index = 0 should be retrieved again because the part of file1 is
  171. // not complete
  172. PieceHandle p2 = ps->getMissingPiece(file1);
  173. CPPUNIT_ASSERT(!p2.isNull());
  174. CPPUNIT_ASSERT_EQUAL((int32_t)0, p2->getIndex());
  175. // Make the part of file1 complete
  176. for(int32_t i = 0; i < 6*1024; ++i) {
  177. p2->getSubPiece(9)->completeBlock(i);
  178. }
  179. ps->cancelPiece(p2);
  180. // Null Piece should be retrieved
  181. CPPUNIT_ASSERT(ps->getMissingPiece(file1).isNull());
  182. // Next, I retrive the piece giving file2
  183. PieceHandle p3 = ps->getMissingPiece(file2);
  184. CPPUNIT_ASSERT(!p3.isNull());
  185. CPPUNIT_ASSERT_EQUAL((int32_t)0, p3->getIndex());
  186. // Make the part of file2 complete
  187. for(int32_t i = 6*1024; i < 16*1024; ++i) {
  188. p3->getSubPiece(9)->completeBlock(i);
  189. }
  190. for(int32_t i = 10; i < 16; ++i) {
  191. p3->completeBlock(i);
  192. }
  193. ps->cancelPiece(p3);
  194. // Null Piece should be retrieved
  195. CPPUNIT_ASSERT(ps->getMissingPiece(file2).isNull());
  196. }
  197. void DefaultPieceStorageTest::testCancelPiece()
  198. {
  199. int32_t pieceLength = 256*1024;
  200. int64_t totalLength = 32*pieceLength; // <-- make the number of piece greater than END_GAME_PIECE_NUM
  201. int32_t blockLength = 16*1024;
  202. Strings uris1;
  203. uris1.push_back("http://localhost/src/file1.txt");
  204. FileEntryHandle file1 = new FileEntry("src/file1.txt", totalLength, 0 /*, uris1*/);
  205. MockBtContextHandle dctx = new MockBtContext();
  206. dctx->setPieceLength(pieceLength);
  207. dctx->setTotalLength(totalLength);
  208. dctx->addFileEntry(file1);
  209. DefaultPieceStorageHandle ps = new DefaultPieceStorage(dctx, option);
  210. PieceHandle p = ps->getMissingPiece(file1);
  211. PieceHandle subPiece = new Piece(0, blockLength, 1);
  212. subPiece->completeBlock(0);
  213. p->addSubPiece(subPiece);
  214. ps->cancelPiece(p);
  215. // See the sub piece is also hibernated...
  216. PieceHandle p2 = ps->getMissingPiece(file1);
  217. CPPUNIT_ASSERT(!p2->getSubPiece(0).isNull());
  218. }