PieceTest.cc 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106
  1. #include "Piece.h"
  2. #include <string>
  3. #include <cppunit/extensions/HelperMacros.h>
  4. using namespace std;
  5. class PieceTest:public CppUnit::TestFixture {
  6. CPPUNIT_TEST_SUITE(PieceTest);
  7. CPPUNIT_TEST(testCompleteBlock);
  8. CPPUNIT_TEST(testIsRangeComplete);
  9. CPPUNIT_TEST(testIsRangeComplete_subPiece);
  10. CPPUNIT_TEST(testGetCompletedLength);
  11. CPPUNIT_TEST_SUITE_END();
  12. private:
  13. public:
  14. void setUp() {}
  15. void testCompleteBlock();
  16. void testIsRangeComplete();
  17. void testIsRangeComplete_subPiece();
  18. void testGetCompletedLength();
  19. };
  20. CPPUNIT_TEST_SUITE_REGISTRATION( PieceTest );
  21. void PieceTest::testCompleteBlock()
  22. {
  23. int32_t blockLength = 32*1024;
  24. Piece p(0, blockLength*10, blockLength);
  25. // 5 is a block index inside the Piece p.
  26. PieceHandle subPiece = new Piece(5, blockLength, 1);
  27. p.addSubPiece(subPiece);
  28. CPPUNIT_ASSERT(!p.getSubPiece(5).isNull());
  29. // When block is complete, then its associated sub piece must be deleted.
  30. p.completeBlock(5);
  31. CPPUNIT_ASSERT(p.getSubPiece(5).isNull());
  32. }
  33. void PieceTest::testIsRangeComplete()
  34. {
  35. int32_t blockLength = 16*1024;
  36. Piece p(0, blockLength*10, blockLength);
  37. CPPUNIT_ASSERT(!p.isRangeComplete(8*1024, 16*1024));
  38. p.completeBlock(0);
  39. CPPUNIT_ASSERT(!p.isRangeComplete(8*1024, 16*1024));
  40. CPPUNIT_ASSERT(p.isRangeComplete(8*1024, 8*1024));
  41. p.completeBlock(1);
  42. CPPUNIT_ASSERT(p.isRangeComplete(8*1024, 16*1024));
  43. }
  44. void PieceTest::testIsRangeComplete_subPiece()
  45. {
  46. int32_t blockLength = 16*1024;
  47. Piece p(0, blockLength*10, blockLength);
  48. CPPUNIT_ASSERT(!p.isRangeComplete(8*1024, 32*1024));
  49. PieceHandle startSubPiece = new Piece(0, blockLength, 1);
  50. p.addSubPiece(startSubPiece);
  51. PieceHandle endSubPiece = new Piece(2, blockLength, 1);
  52. p.addSubPiece(endSubPiece);
  53. p.completeBlock(1);
  54. CPPUNIT_ASSERT(!p.isRangeComplete(8*1024, 32*1024));
  55. for(int32_t i = 8*1024; i < blockLength; ++i) {
  56. startSubPiece->completeBlock(i);
  57. }
  58. CPPUNIT_ASSERT(!p.isRangeComplete(8*1024, 32*1024));
  59. for(int32_t i = 0; i < 8*1024; ++i) {
  60. endSubPiece->completeBlock(i);
  61. }
  62. CPPUNIT_ASSERT(p.isRangeComplete(8*1024, 32*1024));
  63. }
  64. void PieceTest::testGetCompletedLength()
  65. {
  66. int32_t blockLength = 16*1024;
  67. Piece p(0, blockLength*10, blockLength);
  68. PieceHandle subPiece = new Piece(0, blockLength, 1);
  69. for(int32_t i = 0; i < blockLength-1; ++i) {
  70. subPiece->completeBlock(i);
  71. }
  72. p.addSubPiece(subPiece);
  73. p.completeBlock(1);
  74. p.completeBlock(2);
  75. p.completeBlock(9);
  76. CPPUNIT_ASSERT_EQUAL(blockLength*3+blockLength-1, p.getCompletedLength());
  77. }