mirror of https://github.com/aria2/aria2
104 lines
3.1 KiB
C++
104 lines
3.1 KiB
C++
/* <!-- 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"
|
|
|
|
Piece::Piece():index(0), length(0), bitfield(0) {}
|
|
|
|
Piece::Piece(int index, int length):index(index), length(length) {
|
|
bitfield =
|
|
BitfieldManFactory::getFactoryInstance()->createBitfieldMan(BLOCK_LENGTH, length);
|
|
}
|
|
|
|
Piece::Piece(const Piece& piece) {
|
|
index = piece.index;
|
|
length = piece.length;
|
|
if(piece.bitfield == 0) {
|
|
bitfield = 0;
|
|
} else {
|
|
bitfield = new BitfieldMan(*piece.bitfield);
|
|
}
|
|
}
|
|
|
|
|
|
void Piece::completeBlock(int 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();
|
|
}
|
|
|
|
void Piece::cancelBlock(int blockIndex) {
|
|
bitfield->unsetUseBit(blockIndex);
|
|
}
|
|
|
|
int Piece::getMissingUnusedBlockIndex() const {
|
|
int blockIndex = bitfield->getFirstMissingUnusedIndex();
|
|
if(blockIndex == -1) {
|
|
return blockIndex;
|
|
}
|
|
bitfield->setUseBit(blockIndex);
|
|
return blockIndex;
|
|
}
|
|
|
|
int Piece::getMissingBlockIndex() const {
|
|
int blockIndex = bitfield->getMissingIndex();
|
|
if(blockIndex == -1) {
|
|
return blockIndex;
|
|
}
|
|
bitfield->setUseBit(blockIndex);
|
|
return blockIndex;
|
|
}
|
|
|
|
BlockIndexes Piece::getAllMissingBlockIndexes() const {
|
|
return bitfield->getAllMissingIndexes();
|
|
}
|
|
|
|
string Piece::toString() const {
|
|
return "piece: index="+Util::itos(index)+", length="+Util::itos(length);
|
|
}
|