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
|
/***************************************************************************
* 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 BTCHOKER_H
#define BTCHOKER_H
#include <qptrlist.h>
#include <util/constants.h>
#include "peer.h"
namespace kt
{
struct TorrentStats;
}
namespace bt
{
const Uint32 UNDEFINED_ID = 0xFFFFFFFF;
class PeerManager;
class ChunkManager;
typedef int (*PeerCompareFunc)(Peer* a,Peer* b);
class PeerPtrList : public QPtrList<Peer>
{
PeerCompareFunc pcmp;
public:
PeerPtrList(PeerCompareFunc pcmp = NULL);
virtual ~PeerPtrList();
void setCompareFunc(PeerCompareFunc p) {pcmp = p;}
virtual int compareItems(QPtrCollection::Item a, QPtrCollection::Item b);
};
/**
* Base class for all choke algorithms.
*/
class ChokeAlgorithm
{
protected:
Uint32 opt_unchoked_peer_id;
public:
ChokeAlgorithm();
virtual ~ChokeAlgorithm();
/**
* Do the actual choking when we are still downloading.
* @param pman The PeerManager
* @param cman The ChunkManager
* @param stats The torrent stats
*/
virtual void doChokingLeechingState(PeerManager & pman,ChunkManager & cman,const kt::TorrentStats & stats) = 0;
/**
* Do the actual choking when we are seeding
* @param pman The PeerManager
* @param cman The ChunkManager
* @param stats The torrent stats
*/
virtual void doChokingSeedingState(PeerManager & pman,ChunkManager & cman,const kt::TorrentStats & stats) = 0;
/// Get the optimisticly unchoked peer ID
Uint32 getOptimisticlyUnchokedPeerID() const {return opt_unchoked_peer_id;}
};
/**
* @author Joris Guisson
* @brief Handles the choking
*
* This class handles the choking and unchoking of Peer's.
* This class needs to be updated every 10 seconds.
*/
class Choker
{
ChokeAlgorithm* choke;
PeerManager & pman;
ChunkManager & cman;
static Uint32 num_upload_slots;
public:
Choker(PeerManager & pman,ChunkManager & cman);
virtual ~Choker();
/**
* Update which peers are choked or not.
* @param have_all Indicates wether we have the entire file
* @param stats Statistic of the torrent
*/
void update(bool have_all,const kt::TorrentStats & stats);
/// Get the PeerID of the optimisticly unchoked peer.
Uint32 getOptimisticlyUnchokedPeerID() const {return choke->getOptimisticlyUnchokedPeerID();}
/// Set the number of upload slots
static void setNumUploadSlots(Uint32 n) {num_upload_slots = n;}
/// Get the number of upload slots
static Uint32 getNumUploadSlots() {return num_upload_slots;}
};
}
#endif
|
