DefaultPieceStorageTest.cc 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297
  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(testMarkPiecesDone);
  26. CPPUNIT_TEST_SUITE_END();
  27. private:
  28. BtContextHandle btContext;
  29. PeerHandle 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 = PeerHandle(new Peer("192.168.0.1", 6889,
  41. 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 testGetMissingPiece_fileEntry();
  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((long long int)384,
  66. pss.getTotalLength());
  67. }
  68. void DefaultPieceStorageTest::testGetMissingPiece() {
  69. DefaultPieceStorage pss(btContext, option);
  70. pss.setEndGamePieceNum(0);
  71. peer->setAllBitfield();
  72. PieceHandle piece = pss.getMissingPiece(peer);
  73. CPPUNIT_ASSERT_EQUAL(string("piece: index=0, length=128"),
  74. piece->toString());
  75. piece = pss.getMissingPiece(peer);
  76. CPPUNIT_ASSERT_EQUAL(string("piece: index=1, length=128"),
  77. piece->toString());
  78. piece = pss.getMissingPiece(peer);
  79. CPPUNIT_ASSERT_EQUAL(string("piece: index=2, length=128"),
  80. piece->toString());
  81. piece = pss.getMissingPiece(peer);
  82. CPPUNIT_ASSERT(piece.isNull());
  83. }
  84. void DefaultPieceStorageTest::testGetMissingFastPiece() {
  85. DefaultPieceStorage pss(btContext, option);
  86. pss.setEndGamePieceNum(0);
  87. peer->setAllBitfield();
  88. peer->setFastExtensionEnabled(true);
  89. peer->addFastSetIndex(2);
  90. PieceHandle piece = pss.getMissingFastPiece(peer);
  91. CPPUNIT_ASSERT_EQUAL(string("piece: index=2, length=128"),
  92. piece->toString());
  93. }
  94. void DefaultPieceStorageTest::testHasMissingPiece() {
  95. DefaultPieceStorage pss(btContext, option);
  96. CPPUNIT_ASSERT(!pss.hasMissingPiece(peer));
  97. peer->setAllBitfield();
  98. CPPUNIT_ASSERT(pss.hasMissingPiece(peer));
  99. }
  100. void DefaultPieceStorageTest::testCompletePiece() {
  101. DefaultPieceStorage pss(btContext, option);
  102. pss.setEndGamePieceNum(0);
  103. peer->setAllBitfield();
  104. PieceHandle piece = pss.getMissingPiece(peer);
  105. CPPUNIT_ASSERT_EQUAL(string("piece: index=0, length=128"),
  106. piece->toString());
  107. CPPUNIT_ASSERT_EQUAL((int64_t)0,
  108. pss.getCompletedLength());
  109. pss.completePiece(piece);
  110. CPPUNIT_ASSERT_EQUAL((int64_t)128,
  111. pss.getCompletedLength());
  112. PieceHandle incompletePiece = pss.getMissingPiece(peer);
  113. incompletePiece->completeBlock(0);
  114. CPPUNIT_ASSERT_EQUAL((int64_t)256,
  115. pss.getCompletedLength());
  116. }
  117. void DefaultPieceStorageTest::testGetPiece() {
  118. DefaultPieceStorage pss(btContext, option);
  119. PieceHandle pieceGot = pss.getPiece(0);
  120. CPPUNIT_ASSERT_EQUAL((int32_t)0, pieceGot->getIndex());
  121. CPPUNIT_ASSERT_EQUAL((int32_t)128, pieceGot->getLength());
  122. CPPUNIT_ASSERT_EQUAL(false, pieceGot->pieceComplete());
  123. }
  124. void DefaultPieceStorageTest::testGetPieceInUsedPieces() {
  125. DefaultPieceStorage pss(btContext, option);
  126. PieceHandle piece = PieceHandle(new Piece(0, 128));
  127. piece->completeBlock(0);
  128. pss.addUsedPiece(piece);
  129. PieceHandle pieceGot = pss.getPiece(0);
  130. CPPUNIT_ASSERT_EQUAL((int32_t)0, pieceGot->getIndex());
  131. CPPUNIT_ASSERT_EQUAL((int32_t)128, pieceGot->getLength());
  132. CPPUNIT_ASSERT_EQUAL((int32_t)1, pieceGot->countCompleteBlock());
  133. }
  134. void DefaultPieceStorageTest::testGetPieceCompletedPiece() {
  135. DefaultPieceStorage pss(btContext, option);
  136. PieceHandle piece = PieceHandle(new Piece(0, 128));
  137. pss.completePiece(piece);
  138. PieceHandle pieceGot = pss.getPiece(0);
  139. CPPUNIT_ASSERT_EQUAL((int32_t)0, pieceGot->getIndex());
  140. CPPUNIT_ASSERT_EQUAL((int32_t)128, pieceGot->getLength());
  141. CPPUNIT_ASSERT_EQUAL(true, pieceGot->pieceComplete());
  142. }
  143. void DefaultPieceStorageTest::testGetMissingPiece_fileEntry()
  144. {
  145. // - 32KB
  146. // +--------+
  147. // |11111222|
  148. int32_t pieceLength = 256*1024;
  149. int64_t totalLength = 1*pieceLength;
  150. int32_t blockLength = 16*1024;
  151. Strings uris1;
  152. uris1.push_back("http://localhost/src/file1.txt");
  153. Strings uris2;
  154. uris2.push_back("http://localhost/src/file2.txt");
  155. FileEntryHandle file1 = new FileEntry("src/file1.txt", 150*1024, 0/*, uris1*/);
  156. FileEntryHandle file2 = new FileEntry("src/file2.txt", 106*1024, file1->getLength() /*, uris2*/);
  157. MockBtContextHandle dctx = new MockBtContext();
  158. dctx->setPieceLength(pieceLength);
  159. dctx->setTotalLength(totalLength);
  160. dctx->addFileEntry(file1);
  161. dctx->addFileEntry(file2);
  162. DefaultPieceStorageHandle ps = new DefaultPieceStorage(dctx, option);
  163. PieceHandle p = ps->getMissingPiece(file1);
  164. CPPUNIT_ASSERT(!p.isNull());
  165. CPPUNIT_ASSERT_EQUAL((int32_t)0, p->getIndex());
  166. for(int32_t i = 0; i < 9; ++i) {
  167. p->completeBlock(i);
  168. }
  169. PieceHandle subPiece = new Piece(9, blockLength, 1);
  170. p->addSubPiece(subPiece);
  171. ps->cancelPiece(p);
  172. // Piece index = 0 should be retrieved again because the part of file1 is
  173. // not complete
  174. PieceHandle p2 = ps->getMissingPiece(file1);
  175. CPPUNIT_ASSERT(!p2.isNull());
  176. CPPUNIT_ASSERT_EQUAL((int32_t)0, p2->getIndex());
  177. // Make the part of file1 complete
  178. for(int32_t i = 0; i < 6*1024; ++i) {
  179. p2->getSubPiece(9)->completeBlock(i);
  180. }
  181. ps->cancelPiece(p2);
  182. // Null Piece should be retrieved
  183. CPPUNIT_ASSERT(ps->getMissingPiece(file1).isNull());
  184. // Next, I retrive the piece giving file2
  185. PieceHandle p3 = ps->getMissingPiece(file2);
  186. CPPUNIT_ASSERT(!p3.isNull());
  187. CPPUNIT_ASSERT_EQUAL((int32_t)0, p3->getIndex());
  188. // Make the part of file2 complete
  189. for(int32_t i = 6*1024; i < 16*1024; ++i) {
  190. p3->getSubPiece(9)->completeBlock(i);
  191. }
  192. for(int32_t i = 10; i < 16; ++i) {
  193. p3->completeBlock(i);
  194. }
  195. ps->cancelPiece(p3);
  196. // Null Piece should be retrieved
  197. CPPUNIT_ASSERT(ps->getMissingPiece(file2).isNull());
  198. }
  199. void DefaultPieceStorageTest::testCancelPiece()
  200. {
  201. int32_t pieceLength = 256*1024;
  202. int64_t totalLength = 32*pieceLength; // <-- make the number of piece greater than END_GAME_PIECE_NUM
  203. int32_t blockLength = 16*1024;
  204. Strings uris1;
  205. uris1.push_back("http://localhost/src/file1.txt");
  206. FileEntryHandle file1 = new FileEntry("src/file1.txt", totalLength, 0 /*, uris1*/);
  207. MockBtContextHandle dctx = new MockBtContext();
  208. dctx->setPieceLength(pieceLength);
  209. dctx->setTotalLength(totalLength);
  210. dctx->addFileEntry(file1);
  211. DefaultPieceStorageHandle ps = new DefaultPieceStorage(dctx, option);
  212. PieceHandle p = ps->getMissingPiece(file1);
  213. PieceHandle subPiece = new Piece(0, blockLength, 1);
  214. subPiece->completeBlock(0);
  215. p->addSubPiece(subPiece);
  216. ps->cancelPiece(p);
  217. // See the sub piece is also hibernated...
  218. PieceHandle p2 = ps->getMissingPiece(file1);
  219. CPPUNIT_ASSERT(!p2->getSubPiece(0).isNull());
  220. }
  221. void DefaultPieceStorageTest::testMarkPiecesDone()
  222. {
  223. int32_t pieceLength = 256*1024;
  224. int64_t totalLength = 4*1024*1024;
  225. MockBtContextHandle dctx = new MockBtContext();
  226. dctx->setPieceLength(pieceLength);
  227. dctx->setTotalLength(totalLength);
  228. DefaultPieceStorage ps(dctx, option);
  229. ps.markPiecesDone(pieceLength*10+16*1024*2+1);
  230. for(int32_t i = 0; i < 10; ++i) {
  231. CPPUNIT_ASSERT(ps.hasPiece(i));
  232. }
  233. for(int32_t i = 10; i < (totalLength+pieceLength-1)/pieceLength; ++i) {
  234. CPPUNIT_ASSERT(!ps.hasPiece(i));
  235. }
  236. CPPUNIT_ASSERT_EQUAL((int64_t)pieceLength*10+16*1024*2, ps.getCompletedLength());
  237. ps.markPiecesDone(totalLength);
  238. for(int32_t i = 0; i < (totalLength+pieceLength-1)/pieceLength; ++i) {
  239. CPPUNIT_ASSERT(ps.hasPiece(i));
  240. }
  241. }