| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271 | /* <!-- copyright *//* * aria2 - The high speed download utility * * Copyright (C) 2006 Tatsuhiro Tsujikawa * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA * * In addition, as a special exception, the copyright holders give * permission to link the code of portions of this program with the * OpenSSL library under certain conditions as described in each * individual source file, and distribute linked combinations * including the two. * You must obey the GNU General Public License in all respects * for all of the code used other than OpenSSL.  If you modify * file(s) with this exception, you may extend this exception to your * version of the file(s), but you are not obligated to do so.  If you * do not wish to do so, delete this exception statement from your * version.  If you delete this exception statement from all source * files in the program, then also delete it here. *//* copyright --> */#include "Piece.h"#include "util.h"#include "BitfieldManFactory.h"#include "BitfieldMan.h"#include "A2STR.h"#include "util.h"#include "a2functional.h"#ifdef ENABLE_MESSAGE_DIGEST# include "messageDigest.h"#endif // ENABLE_MESSAGE_DIGESTnamespace aria2 {Piece::Piece():index(0), length(0), _blockLength(BLOCK_LENGTH), bitfield(0)#ifdef ENABLE_MESSAGE_DIGEST              , _nextBegin(0)#endif // ENABLE_MESSAGE_DIGEST{}Piece::Piece(size_t index, size_t length, size_t blockLength):index(index), length(length), _blockLength(blockLength)#ifdef ENABLE_MESSAGE_DIGEST                                                             , _nextBegin(0)#endif // ENABLE_MESSAGE_DIGEST{  bitfield =    BitfieldManFactory::getFactoryInstance()->createBitfieldMan(_blockLength, length);}Piece::Piece(const Piece& piece) {  index = piece.index;  length = piece.length;  _blockLength = piece._blockLength;  if(piece.bitfield == 0) {    bitfield = 0;  } else {    bitfield = new BitfieldMan(*piece.bitfield);  }#ifdef ENABLE_MESSAGE_DIGEST  _nextBegin = piece._nextBegin;  // TODO Is this OK?  _mdctx = piece._mdctx;#endif // ENABLE_MESSAGE_DIGEST}Piece::~Piece(){  delete bitfield;}Piece& Piece::operator=(const Piece& piece){  if(this != &piece) {    index = piece.index;    length = piece.length;    delete bitfield;    if(piece.bitfield) {      bitfield = new BitfieldMan(*piece.bitfield);    } else {      bitfield = 0;    }  }  return *this;}void Piece::completeBlock(size_t blockIndex) {  bitfield->setBit(blockIndex);  bitfield->unsetUseBit(blockIndex);}void Piece::clearAllBlock() {  bitfield->clearAllBit();  bitfield->clearAllUseBit();}void Piece::setAllBlock() {  bitfield->setAllBit();}bool Piece::pieceComplete() const {  return bitfield->isAllBitSet();}size_t Piece::countBlock() const{  return bitfield->countBlock();}size_t Piece::getBlockLength(size_t index) const{  return bitfield->getBlockLength(index);}size_t Piece::getBlockLength() const{  return bitfield->getBlockLength();}const unsigned char* Piece::getBitfield() const{  return bitfield->getBitfield();}size_t Piece::getBitfieldLength() const{  return bitfield->getBitfieldLength();}bool Piece::isBlockUsed(size_t index) const{  return bitfield->isUseBitSet(index);}void Piece::cancelBlock(size_t blockIndex) {  bitfield->unsetUseBit(blockIndex);}size_t Piece::countCompleteBlock() const{  return bitfield->countBlock()-bitfield->countMissingBlock();}size_t Piece::countMissingBlock() const{  return bitfield->countMissingBlock();}bool Piece::hasBlock(size_t blockIndex) const{  return bitfield->isBitSet(blockIndex);}bool Piece::getMissingUnusedBlockIndex(size_t& index) const{  if(bitfield->getFirstMissingUnusedIndex(index)) {    bitfield->setUseBit(index);    return true;  } else {    return false;  }}bool Piece::getMissingBlockIndex(size_t& index) const{  if(bitfield->getMissingIndex(index)) {    bitfield->setUseBit(index);    return true;  } else {    return false;  }}bool Piece::getFirstMissingBlockIndexWithoutLock(size_t& index) const{  return bitfield->getFirstMissingIndex(index);}bool Piece::getAllMissingBlockIndexes(unsigned char* misbitfield, size_t mislen) const{  return bitfield->getAllMissingIndexes(misbitfield, mislen);}std::string Piece::toString() const {  return strconcat("piece: index=", util::itos(index),                   ", length=", util::itos(length));}void Piece::reconfigure(size_t length){  delete bitfield;  this->length = length;  bitfield =    BitfieldManFactory::getFactoryInstance()->createBitfieldMan(_blockLength, length);}void Piece::setBitfield(const unsigned char* bitfield, size_t len){  this->bitfield->setBitfield(bitfield, len);}size_t Piece::getCompletedLength(){  return bitfield->getCompletedLength();}#ifdef ENABLE_MESSAGE_DIGESTvoid Piece::setHashAlgo(const std::string& algo){  _hashAlgo = algo;}bool Piece::updateHash(uint32_t begin, const unsigned char* data, size_t dataLength){  if(_hashAlgo.empty()) {    return false;  }  if(begin == _nextBegin && _nextBegin+dataLength <= length) {    if(_mdctx.isNull()) {      _mdctx.reset(new MessageDigestContext());            _mdctx->trySetAlgo(_hashAlgo);      _mdctx->digestInit();    }    _mdctx->digestUpdate(data, dataLength);    _nextBegin += dataLength;    return true;  } else {    return false;  }}bool Piece::isHashCalculated() const{  return !_mdctx.isNull() && _nextBegin == length;}// TODO should be getHashString()std::string Piece::getHashString(){  if(_mdctx.isNull()) {    return A2STR::NIL;  } else {    return util::toHex(_mdctx->digestFinal());  }}void Piece::destroyHashContext(){  _mdctx.reset();  _nextBegin = 0;}#endif // ENABLE_MESSAGE_DIGEST} // namespace aria2
 |