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
|
/***************************************************************************
* 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. *
***************************************************************************/
#ifndef BTPEERUPLOADER_H
#define BTPEERUPLOADER_H
#include <set>
#include <tqvaluelist.h>
#include "request.h"
namespace bt
{
class Peer;
class ChunkManager;
const Uint32 ALLOWED_FAST_SIZE = 8;
/**
* @author Joris Guisson
* @brief Uploads pieces to a Peer
*
* This class handles the uploading of pieces to a Peer. It keeps
* track of a list of Request objects. All these Requests where sent
* by the Peer. It will upload the pieces to the Peer, making sure
* that the maximum upload rate isn't surpassed.
*/
class PeerUploader
{
Peer* peer;
TQValueList<Request> requests;
Uint32 uploaded;
public:
/**
* Constructor. Set the Peer.
* @param peer The Peer
*/
PeerUploader(Peer* peer);
virtual ~PeerUploader();
/**
* Add a Request to the list of Requests.
* @param r The Request
*/
void addRequest(const Request & r);
/**
* Remove a Request from the list of Requests.
* @param r The Request
*/
void removeRequest(const Request & r);
/**
* Update the PeerUploader. This will check if there are Request, and
* will try to handle them.
* @param cman The ChunkManager
* @param opt_unchoked ID of optimisticly unchoked peer
* @return The number of bytes uploaded
*/
Uint32 update(ChunkManager & cman,Uint32 opt_unchoked);
/// Get the number of requests
Uint32 getNumRequests() const;
void addUploadedBytes(Uint32 bytes) {uploaded += bytes;}
/**
* Clear all pending requests.
*/
void clearAllRequests();
};
}
#endif
|
