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
|
/* <!-- copyright */
/*
* aria2 - a simple utility for downloading files faster
*
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
/* copyright --> */
#ifndef _D_PIECE_H_
#define _D_PIECE_H_
#include "BitfieldMan.h"
#include "common.h"
#define BLOCK_LENGTH (16*1024)
class Piece {
private:
int index;
int length;
BitfieldMan* bitfield;
public:
Piece():index(0), length(0), bitfield(NULL) {}
Piece(int index, int length):index(index), length(length) {
bitfield = new BitfieldMan(BLOCK_LENGTH, length);
}
Piece(const Piece& piece);
~Piece() {
delete bitfield;
}
Piece& operator=(const Piece& piece);
int getMissingUnusedBlockIndex() const;
BlockIndexes getAllMissingBlockIndexes() const;
void completeBlock(int blockIndex);
void cancelBlock(int blockIndex);
int countCompleteBlock() const {
return bitfield->countBlock()-bitfield->countMissingBlock();
}
bool hasBlock(int blockIndex) const {
return bitfield->isBitSet(blockIndex);
}
bool pieceComplete() const;
int countBlock() const { return bitfield->countBlock(); }
int getBlockLength(int index) const {
return bitfield->getBlockLength(index);
}
int getBlockLength() const { return bitfield->getBlockLength(); }
int getIndex() const { return index; }
void setIndex(int index) { this->index = index; }
int getLength() const { return length; }
void setLength(int index) { this->length = length; }
const unsigned char* getBitfield() const { return bitfield->getBitfield(); }
void setBitfield(const unsigned char* bitfield, int len);
void clearAllBlock();
void setAllBlock();
static Piece nullPiece;
static bool isNull(const Piece& piece) {
return piece.index == 0 && piece.length == 0;
}
};
#endif // _D_PIECE_H_
|
