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
|
/***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* joris.guisson@gmail.com *
* *
* 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. *
***************************************************************************/
#include <set>
#include <tdesocketaddress.h>
#include <util/log.h>
#include <util/functions.h>
#include <util/sha1hash.h>
#include "peeruploader.h"
#include "peer.h"
#include "chunkmanager.h"
#include "packetwriter.h"
#include "torrent.h"
using namespace KNetwork;
namespace bt
{
PeerUploader::PeerUploader(Peer* peer) : peer(peer)
{
uploaded = 0;
}
PeerUploader::~PeerUploader()
{}
void PeerUploader::addRequest(const Request & r)
{
// Out(SYS_CON|LOG_DEBUG) <<
// TQString("PeerUploader::addRequest %1 %2 %3\n").arg(r.getIndex()).arg(r.getOffset()).arg(r.getLength()) << endl;
// allowed fast chunks go to the front of the queue
requests.append(r);
}
void PeerUploader::removeRequest(const Request & r)
{
// Out(SYS_CON|LOG_DEBUG) <<
// TQString("PeerUploader::removeRequest %1 %2 %3\n").arg(r.getIndex()).arg(r.getOffset()).arg(r.getLength()) << endl;
requests.remove(r);
peer->getPacketWriter().doNotSendPiece(r,peer->getStats().fast_extensions);
}
Uint32 PeerUploader::update(ChunkManager & cman,Uint32 opt_unchoked)
{
Uint32 ret = uploaded;
uploaded = 0;
PacketWriter & pw = peer->getPacketWriter();
// if we have choked the peer do not upload
if (peer->areWeChoked())
return ret;
if (peer->isSnubbed() && !peer->areWeChoked() &&
!cman.completed() && peer->getID() != opt_unchoked)
return ret;
while (requests.count() > 0)
{
Request r = requests.front();
Chunk* c = cman.grabChunk(r.getIndex());
if (c && c->getData())
{
if (!pw.sendChunk(r.getIndex(),r.getOffset(),r.getLength(),c))
{
if (peer->getStats().fast_extensions)
pw.sendReject(r);
}
requests.pop_front();
}
else
{
// remove requests we can't satisfy
Out(SYS_CON|LOG_DEBUG) << "Cannot satisfy request" << endl;
if (peer->getStats().fast_extensions)
pw.sendReject(r);
requests.pop_front();
}
}
return ret;
}
void PeerUploader::clearAllRequests()
{
bool fast_ext = peer->getStats().fast_extensions;
PacketWriter & pw = peer->getPacketWriter();
pw.clearPieces(fast_ext);
if (fast_ext)
{
// reject all requests
// if the peer supports fast extensions,
// choke doesn't mean reject all
TQValueList<Request>::iterator i = requests.begin();
while (i != requests.end())
{
pw.sendReject(*i);
i++;
}
}
requests.clear();
}
Uint32 PeerUploader::getNumRequests() const
{
return requests.count() + peer->getPacketWriter().getNumDataPacketsToWrite();
}
}
|
