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
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
|
/* <!-- 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_PEER_H
#define D_PEER_H
#include "common.h"
#include <cassert>
#include <string>
#include <vector>
#include <algorithm>
#include "SharedHandle.h"
#include "TimerA2.h"
#include "BtConstants.h"
#include "PeerStat.h"
#include "a2functional.h"
#include "Command.h"
namespace aria2 {
class PeerSessionResource;
class BtMessageDispatcher;
class Peer {
private:
std::string ipaddr_;
// TCP port of the other end of communication. If incoming_ is
// true, then this port is not a port the peer is listening to and
// we cannot connect to it.
uint16_t port_;
std::string id_;
cuid_t cuid_;
unsigned char peerId_[PEER_ID_LENGTH];
Timer firstContactTime_;
Timer badConditionStartTime_;
bool seeder_;
PeerSessionResource* res_;
// If true, port is assumed not to be a listening port.
bool incoming_;
// If true, this peer is from local network.
bool localPeer_;
// If true, this peer is disconnected gracefully.
bool disconnectedGracefully_;
// Before calling updateSeeder(), make sure that
// allocateSessionResource() is called and res_ is created.
// Otherwise assertion fails.
void updateSeeder();
public:
Peer(std::string ipaddr, uint16_t port, bool incoming = false);
~Peer();
bool operator==(const Peer& p)
{
return id_ == p.id_;
}
bool operator!=(const Peer& p)
{
return !(*this == p);
}
void resetStatus();
const std::string& getIPAddress() const
{
return ipaddr_;
}
uint16_t getPort() const
{
return port_;
}
void setPort(uint16_t port)
{
port_ = port;
}
void usedBy(cuid_t cuid);
cuid_t usedBy() const
{
return cuid_;
}
bool unused() const
{
return cuid_ == 0;
}
// Returns true iff res_ != 0.
bool isActive() const
{
return res_ != 0;
}
void setPeerId(const unsigned char* peerId);
const unsigned char* getPeerId() const
{
return peerId_;
}
bool isSeeder() const
{
return seeder_;
}
const std::string& getID() const
{
return id_;
}
void startBadCondition();
bool isGood() const;
void allocateSessionResource(int32_t pieceLength, off_t totalLength);
void reconfigureSessionResource(int32_t pieceLength, off_t totalLength);
void releaseSessionResource();
const Timer& getFirstContactTime() const
{
return firstContactTime_;
}
void setFirstContactTime(const Timer& time);
const Timer& getBadConditionStartTime() const
{
return badConditionStartTime_;
}
// Before calling following member functions, make sure that
// allocateSessionResource() is called and res_ is created.
// Otherwise assertion fails.
// localhost is choking this peer
bool amChoking() const;
void amChoking(bool b) const;
// localhost is interested in this peer
bool amInterested() const;
void amInterested(bool b) const;
// this peer is choking localhost
bool peerChoking() const;
void peerChoking(bool b) const;
// this peer is interested in localhost
bool peerInterested() const;
void peerInterested(bool b);
// this peer should be choked
bool chokingRequired() const;
void chokingRequired(bool b);
// this peer is eligible for unchoking optionally.
bool optUnchoking() const;
void optUnchoking(bool b);
// this peer is snubbing.
bool snubbing() const;
void snubbing(bool b);
void updateUploadLength(int32_t bytes);
void updateDownloadLength(int32_t bytes);
/**
* Returns the transfer rate from localhost to remote host.
*/
int calculateUploadSpeed();
/**
* Returns the transfer rate from remote host to localhost.
*/
int calculateDownloadSpeed();
/**
* Returns the number of bytes uploaded to the remote host.
*/
off_t getSessionUploadLength() const;
/**
* Returns the number of bytes downloaded from the remote host.
*/
off_t getSessionDownloadLength() const;
void setBitfield(const unsigned char* bitfield, size_t bitfieldLength);
const unsigned char* getBitfield() const;
size_t getBitfieldLength() const;
void setAllBitfield();
/**
* operation = 1: set index-th bit to 1
* operation = 0: set index-th bit to 0
*/
void updateBitfield(size_t index, int operation);
void setFastExtensionEnabled(bool enabled);
bool isFastExtensionEnabled() const;
void addPeerAllowedIndex(size_t index);
bool isInPeerAllowedIndexSet(size_t index) const;
size_t countPeerAllowedIndexSet() const;
const std::vector<size_t>& getPeerAllowedIndexSet() const;
void addAmAllowedIndex(size_t index);
bool isInAmAllowedIndexSet(size_t index) const;
void setExtendedMessagingEnabled(bool enabled);
bool isExtendedMessagingEnabled() const;
void setDHTEnabled(bool enabled);
bool isDHTEnabled() const;
bool shouldBeChoking() const;
bool hasPiece(size_t index) const;
uint8_t getExtensionMessageID(const std::string& name) const;
std::string getExtensionName(uint8_t id) const;
void setExtension(const std::string& name, uint8_t id);
const Timer& getLastDownloadUpdate() const;
const Timer& getLastAmUnchoking() const;
off_t getCompletedLength() const;
bool isIncomingPeer() const
{
return incoming_;
}
void setIncomingPeer(bool incoming);
bool isLocalPeer() const
{
return localPeer_;
}
void setLocalPeer(bool flag)
{
localPeer_ = flag;
}
bool isDisconnectedGracefully() const
{
return disconnectedGracefully_;
}
void setDisconnectedGracefully(bool f)
{
disconnectedGracefully_ = f;
}
void setBtMessageDispatcher(BtMessageDispatcher* dpt);
size_t countOutstandingUpload() const;
};
template<typename InputIterator>
size_t countSeeder(InputIterator first, InputIterator last)
{
return std::count_if(first, last, mem_fun_sh(&Peer::isSeeder));
}
} // namespace aria2
#endif // D_PEER_H
|