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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
/* <!-- 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_TORRENT_MAN_H_
#define _D_TORRENT_MAN_H_
#include "Peer.h"
#include "common.h"
#include "Logger.h"
#include "BitfieldMan.h"
#include "DiskWriter.h"
#include "Piece.h"
#include "Dictionary.h"
#include "Option.h"
#include "FileEntry.h"
#include "DiskAdaptor.h"
#include <deque>
#include <map>
#include <string>
using namespace std;
#define INFO_HASH_LENGTH 20
#define DEFAULT_ANNOUNCE_INTERVAL 300
#define DEFAULT_ANNOUNCE_MIN_INTERVAL 300
#define MAX_PEERS 55
#define MAX_PEER_UPDATE 15
#define MAX_PEER_LIST_SIZE 250
#define END_GAME_PIECE_NUM 20
#define MAX_PEER_ERROR 5
typedef deque<Peer*> Peers;
typedef multimap<int, int> Haves;
typedef deque<Piece> UsedPieces;
typedef deque<int> PieceIndexes;
class TorrentMan {
private:
Peers peers;
BitfieldMan* bitfield;
unsigned char infoHash[INFO_HASH_LENGTH];
deque<string> pieceHashes;
int peerEntryIdCounter;
int cuidCounter;
long long int totalLength;
long long int downloadLength;
long long int uploadLength;
long long int preDownloadLength;
long long int preUploadLength;
int deltaDownloadLength;
int deltaUploadLength;
int fileMode;
string storeDir;
int port;
Haves haves;
UsedPieces usedPieces;
bool setupComplete;
FILE* openSegFile(string segFilename, string mode) const;
void read(FILE* file);
Piece findUsedPiece(int index) const;
void addUsedPiece(const Piece& piece);
void deleteUsedPiece(const Piece& piece);
int deleteUsedPiecesByFillRate(int fillRate, int toDelete);
void reduceUsedPieces(int max);
void readFileEntry(FileEntries& fileEntries, Directory** pTopDir, const Dictionary* infoDic, const string& defaultName);
void setFileFilter(const Strings& filePaths);
public:
int pieceLength;
int pieces;
string peerId;
string announce;
string trackerId;
string name;
int interval;
int minInterval;
int complete;
int incomplete;
int connections;
public:
TorrentMan();
~TorrentMan();
const Logger* logger;
DiskAdaptor* diskAdaptor;
const Option* option;
int getNewCuid() { return ++cuidCounter; }
// TODO do not use this method
void updatePeers(const Peers& peers);
bool addPeer(Peer* peer, bool duplicate = false);
//void updatePeer(const Peer* peer);
const Peers& getPeers() const { return peers; }
Peer* getPeer() const;
bool isPeerAvailable() const;
int deleteOldErrorPeers(int maxNum);
Piece getMissingPiece(const Peer* peer);
void completePiece(const Piece& piece);
void cancelPiece(const Piece& piece);
void updatePiece(const Piece& piece);
void syncPiece(Piece& piece);
bool hasPiece(int index) const;
void initBitfield();
bool isEndGame() const;
bool downloadComplete() const;
void setBitfield(unsigned char* bitfield, int len);
const unsigned char* getBitfield() const {
return bitfield->getBitfield();
}
int getBitfieldLength() const { return bitfield->getBitfieldLength(); }
void setInfoHash(const unsigned char* infoHash) {
memcpy(this->infoHash, infoHash, INFO_HASH_LENGTH);
}
const unsigned char* getInfoHash() const {
return infoHash;
}
void setup(string metaInfoFile, const Strings& targetFilePaths);
string getPieceHash(int index) const;
void advertisePiece(int cuid, int index) {
Haves::value_type vt(cuid, index);
haves.insert(vt);
}
PieceIndexes getAdvertisedPieceIndexes(int myCuid) const {
PieceIndexes indexes;
for(Haves::const_iterator itr = haves.begin(); itr != haves.end(); itr++) {
const Haves::value_type& have = *itr;
if(have.first == myCuid) {
continue;
}
indexes.push_back(have.second);
}
return indexes;
}
void unadvertisePiece(int cuid) {
haves.erase(cuid);
}
long long int getTotalLength() const { return totalLength; }
void setTotalLength(long long int length) { totalLength = length; }
void addDeltaDownloadLength(int length) { deltaDownloadLength += length; }
int getDeltaDownloadLength() const { return deltaDownloadLength; }
void resetDeltaDownloadLength() { deltaDownloadLength = 0; }
void addDeltaUploadLength(int length) { deltaUploadLength += length; }
int getDeltaUploadLength() const { return deltaUploadLength; }
void resetDeltaUploadLength() { deltaUploadLength = 0; }
void addDownloadLength(int deltaLength) { downloadLength += deltaLength; }
long long int getDownloadLength() const { return downloadLength; }
void setDownloadLength(long long int length) { downloadLength = length; }
void addUploadLength(int deltaLength) { uploadLength += deltaLength; }
long long int getUploadLength() const { return uploadLength; }
void setUploadLength(long long int length) { uploadLength = length; }
long long int getSessionDownloadLength() const {
return downloadLength-preDownloadLength;
}
long long int getSessionUploadLength() const {
return uploadLength-preUploadLength;
}
void setFileMode(int mode) {
fileMode = mode;
}
int getFileMode() const {
return fileMode;
}
string getStoreDir() const { return storeDir; }
void setStoreDir(string dir) { storeDir = dir; }
string getSegmentFilePath() const;
bool segmentFileExists() const;
void load();
void save() const;
void remove() const;
void copySingleFile() const;
void splitMultiFile();
void fixFilename();
void deleteTempFile() const;
void setPort(int port) { this->port = port; }
int getPort() const { return port; }
int countUsedPiece() const { return usedPieces.size(); }
int countAdvertisedPiece() const { return haves.size(); }
FileEntries readFileEntryFromMetaInfoFile(const string& metaInfoFile);
string getName() const;
void finishSelectiveDownloadingMode();
bool isSelectiveDownloadingMode() const;
long long int getCompletedLength() const;
long long int getSelectedTotalLength() const;
void onDownloadComplete();
enum FILE_MODE {
SINGLE,
MULTI
};
};
#endif // _D_TORRENT_MAN_H_
|
