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
|
/* <!-- copyright */
/*
* aria2 - The high speed download utility
*
* Copyright (C) 2009 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 --> */
#include "PieceStatMan.h"
#include <algorithm>
#include "SimpleRandomizer.h"
namespace aria2 {
PieceStat::PieceStat(size_t index):_order(0), _index(index), _count(0) {}
void PieceStat::addCount()
{
if(_count < SIZE_MAX) {
++_count;
}
}
void PieceStat::subCount()
{
if(_count > 0) {
--_count;
}
}
class GenPieceStat {
private:
size_t _index;
public:
GenPieceStat():_index(0) {}
SharedHandle<PieceStat> operator()()
{
return SharedHandle<PieceStat>(new PieceStat(_index++));
}
};
PieceStatMan::PieceStatMan(size_t pieceNum, bool randomShuffle):
_pieceStats(pieceNum),
_sortedPieceStatIndexes(pieceNum)
{
std::generate(_pieceStats.begin(), _pieceStats.end(), GenPieceStat());
std::vector<SharedHandle<PieceStat> > sortedPieceStats(_pieceStats);
// we need some randomness in ordering.
if(randomShuffle) {
std::random_shuffle(sortedPieceStats.begin(), sortedPieceStats.end(),
*(SimpleRandomizer::getInstance().get()));
}
{
size_t order = 0;
for(std::vector<SharedHandle<PieceStat> >::iterator i =
sortedPieceStats.begin(); i != sortedPieceStats.end(); ++i) {
_sortedPieceStatIndexes[order] = (*i)->getIndex();
(*i)->setOrder(order++);
}
}
}
class PieceStatRarer {
private:
const std::vector<SharedHandle<PieceStat> >& _pieceStats;
public:
PieceStatRarer(const std::vector<SharedHandle<PieceStat> >& ps):
_pieceStats(ps) {}
bool operator()(size_t lhs, size_t rhs) const
{
return _pieceStats[lhs] < _pieceStats[rhs];
}
};
void PieceStatMan::addPieceStats(const unsigned char* bitfield,
size_t bitfieldLength)
{
size_t index = 0;
for(size_t bi = 0; bi < bitfieldLength; ++bi) {
for(size_t i = 0; i < 8; ++i, ++index) {
unsigned char mask = 128 >> i;
if(bitfield[bi]&mask) {
_pieceStats[index]->addCount();
}
}
}
std::sort(_sortedPieceStatIndexes.begin(), _sortedPieceStatIndexes.end(),
PieceStatRarer(_pieceStats));
}
void PieceStatMan::subtractPieceStats(const unsigned char* bitfield,
size_t bitfieldLength)
{
size_t index = 0;
for(size_t bi = 0; bi < bitfieldLength; ++bi) {
for(size_t i = 0; i < 8; ++i, ++index) {
unsigned char mask = 128 >> i;
if(bitfield[bi]&mask) {
_pieceStats[index]->subCount();
}
}
}
std::sort(_sortedPieceStatIndexes.begin(), _sortedPieceStatIndexes.end(),
PieceStatRarer(_pieceStats));
}
void PieceStatMan::updatePieceStats(const unsigned char* newBitfield,
size_t newBitfieldLength,
const unsigned char* oldBitfield)
{
size_t index = 0;
for(size_t bi = 0; bi < newBitfieldLength; ++bi) {
for(size_t i = 0; i < 8; ++i, ++index) {
unsigned char mask = 128 >> i;
if((newBitfield[bi]&mask) && !(oldBitfield[bi]&mask)) {
_pieceStats[index]->addCount();
} else if(!(newBitfield[bi]&mask) && (oldBitfield[bi]&mask)) {
_pieceStats[index]->subCount();
}
}
}
std::sort(_sortedPieceStatIndexes.begin(), _sortedPieceStatIndexes.end(),
PieceStatRarer(_pieceStats));
}
void PieceStatMan::addPieceStats(size_t index)
{
std::vector<size_t>::iterator cur =
std::lower_bound(_sortedPieceStatIndexes.begin(),
_sortedPieceStatIndexes.end(),
index, PieceStatRarer(_pieceStats));
_pieceStats[index]->addCount();
std::vector<size_t>::iterator to =
std::upper_bound(cur+1, _sortedPieceStatIndexes.end(),
index, PieceStatRarer(_pieceStats));
std::rotate(cur, cur+1, to);
}
} // namespace aria2
|
