1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
|
/* <!-- 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 --> */
#ifndef _D_PIECE_H_
#define _D_PIECE_H_
#include "BitfieldMan.h"
#include "common.h"
class Piece;
typedef SharedHandle<Piece> PieceHandle;
typedef deque<PieceHandle> Pieces;
class Piece {
private:
int32_t index;
int32_t length;
int32_t _blockLength;
BitfieldMan* bitfield;
Pieces _subPieces;
public:
static const int32_t BLOCK_LENGTH = 16*1024;
Piece();
Piece(int32_t index, int32_t length, int32_t blockLength = BLOCK_LENGTH);
Piece(const Piece& piece);
~Piece() {
delete bitfield;
}
Piece& operator=(const Piece& piece) {
if(this != &piece) {
index = piece.index;
length = piece.length;
if(bitfield != NULL) {
delete bitfield;
}
if(piece.bitfield == NULL) {
bitfield = NULL;
} else {
bitfield = new BitfieldMan(*piece.bitfield);
}
}
return *this;
}
bool operator==(const Piece& piece) const {
return index == piece.index;
}
int32_t getMissingUnusedBlockIndex() const;
int32_t getMissingBlockIndex() const;
BlockIndexes getAllMissingBlockIndexes() const;
void completeBlock(int32_t blockIndex);
void cancelBlock(int32_t blockIndex);
int32_t countCompleteBlock() const {
return bitfield->countBlock()-bitfield->countMissingBlock();
}
bool hasBlock(int32_t blockIndex) const {
return bitfield->isBitSet(blockIndex);
}
/**
* Returns true if all blocks of this piece have been downloaded, otherwise
* returns false.
*/
bool pieceComplete() const;
int32_t countBlock() const { return bitfield->countBlock(); }
int32_t getBlockLength(int32_t index) const {
return bitfield->getBlockLength(index);
}
int32_t getBlockLength() const { return bitfield->getBlockLength(); }
int32_t getIndex() const { return index; }
void setIndex(int32_t index) { this->index = index; }
int32_t getLength() const { return length; }
void setLength(int32_t index) { this->length = length; }
const unsigned char* getBitfield() const { return bitfield->getBitfield(); }
void setBitfield(const unsigned char* bitfield, int32_t len);
int32_t getBitfieldLength() const {
return bitfield->getBitfieldLength();
}
void clearAllBlock();
void setAllBlock();
string toString() const;
bool isBlockUsed(int32_t index) const {
return bitfield->isUseBitSet(index);
}
void addSubPiece(const PieceHandle& subPiece);
PieceHandle getSubPiece(int32_t blockIndex);
void removeSubPiece(int32_t blockIndex);
Pieces::iterator getSubPieceIterator(int32_t blockIndex);
bool isRangeComplete(int32_t offset, int32_t length);
// Calculates completed length, taking into account SubPieces
int32_t getCompletedLength();
/**
* Loses current bitfield state.
*/
void reconfigure(int32_t length);
};
typedef SharedHandle<Piece> PieceHandle;
typedef deque<PieceHandle> Pieces;
#endif // _D_PIECE_H_
|
