Piece.h 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168
  1. /* <!-- copyright */
  2. /*
  3. * aria2 - The high speed download utility
  4. *
  5. * Copyright (C) 2006 Tatsuhiro Tsujikawa
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. *
  21. * In addition, as a special exception, the copyright holders give
  22. * permission to link the code of portions of this program with the
  23. * OpenSSL library under certain conditions as described in each
  24. * individual source file, and distribute linked combinations
  25. * including the two.
  26. * You must obey the GNU General Public License in all respects
  27. * for all of the code used other than OpenSSL. If you modify
  28. * file(s) with this exception, you may extend this exception to your
  29. * version of the file(s), but you are not obligated to do so. If you
  30. * do not wish to do so, delete this exception statement from your
  31. * version. If you delete this exception statement from all source
  32. * files in the program, then also delete it here.
  33. */
  34. /* copyright --> */
  35. #ifndef _D_PIECE_H_
  36. #define _D_PIECE_H_
  37. #include "common.h"
  38. #include "SharedHandle.h"
  39. #include <stdint.h>
  40. #include <deque>
  41. #include <string>
  42. namespace aria2 {
  43. class BitfieldMan;
  44. #ifdef ENABLE_MESSAGE_DIGEST
  45. class MessageDigestContext;
  46. #endif // ENABLE_MESSAGE_DIGEST
  47. class Piece {
  48. private:
  49. size_t index;
  50. size_t length;
  51. size_t _blockLength;
  52. BitfieldMan* bitfield;
  53. #ifdef ENABLE_MESSAGE_DIGEST
  54. size_t _nextBegin;
  55. std::string _hashAlgo;
  56. SharedHandle<MessageDigestContext> _mdctx;
  57. #endif // ENABLE_MESSAGE_DIGEST
  58. public:
  59. static const size_t BLOCK_LENGTH = 16*1024;
  60. Piece();
  61. Piece(size_t index, size_t length, size_t blockLength = BLOCK_LENGTH);
  62. Piece(const Piece& piece);
  63. ~Piece();
  64. Piece& operator=(const Piece& piece);
  65. bool operator==(const Piece& piece) const;
  66. bool operator<(const Piece& piece) const;
  67. bool getMissingUnusedBlockIndex(size_t& index) const;
  68. bool getMissingBlockIndex(size_t& index) const;
  69. bool getFirstMissingBlockIndexWithoutLock(size_t& index) const;
  70. bool getAllMissingBlockIndexes(std::deque<size_t>& indexes) const;
  71. void completeBlock(size_t blockIndex);
  72. void cancelBlock(size_t blockIndex);
  73. size_t countCompleteBlock() const;
  74. size_t countMissingBlock() const;
  75. bool hasBlock(size_t blockIndex) const;
  76. /**
  77. * Returns true if all blocks of this piece have been downloaded, otherwise
  78. * returns false.
  79. */
  80. bool pieceComplete() const;
  81. size_t countBlock() const;
  82. size_t getBlockLength(size_t index) const;
  83. size_t getBlockLength() const;
  84. size_t getIndex() const { return index; }
  85. void setIndex(size_t index) { this->index = index; }
  86. size_t getLength() const { return length; }
  87. void setLength(size_t index) { this->length = length; }
  88. const unsigned char* getBitfield() const;
  89. void setBitfield(const unsigned char* bitfield, size_t len);
  90. size_t getBitfieldLength() const;
  91. void clearAllBlock();
  92. void setAllBlock();
  93. std::string toString() const;
  94. bool isBlockUsed(size_t index) const;
  95. // Calculates completed length
  96. size_t getCompletedLength();
  97. #ifdef ENABLE_MESSAGE_DIGEST
  98. void setHashAlgo(const std::string& algo);
  99. // Updates hash value. This function compares begin and private variable
  100. // _nextBegin and only when they are equal, hash is updated eating data and
  101. // returns true. Otherwise returns false.
  102. bool updateHash(uint32_t begin, const unsigned char* data, size_t dataLength);
  103. bool isHashCalculated() const;
  104. // Returns hash value in ASCII hexadecimal form.
  105. // WARN: This function must be called only once.
  106. std::string getHashString();
  107. void destroyHashContext();
  108. #endif // ENABLE_MESSAGE_DIGEST
  109. /**
  110. * Loses current bitfield state.
  111. */
  112. void reconfigure(size_t length);
  113. };
  114. typedef SharedHandle<Piece> PieceHandle;
  115. typedef std::deque<PieceHandle> Pieces;
  116. } // namespace aria2
  117. #endif // _D_PIECE_H_