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
|
/*
* Copyright (C) 2001-2009 Jacek Sieka, arnetheduck on gmail point 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include "stdinc.h"
#include "DCPlusPlus.h"
#include "QueueItem.h"
#include "HashManager.h"
#include "Download.h"
#include "File.h"
namespace dcpp {
namespace {
const string TEMP_EXTENSION = ".dctmp";
string getTempName(const string& aFileName, const TTHValue& aRoot) {
string tmp(aFileName);
tmp += "." + aRoot.toBase32();
tmp += TEMP_EXTENSION;
return tmp;
}
}
int QueueItem::countOnlineUsers() const {
int n = 0;
SourceConstIter i = sources.begin();
for(; i != sources.end(); ++i) {
if(i->getUser()->isOnline())
n++;
}
return n;
}
void QueueItem::addSource(const UserPtr& aUser) {
dcassert(!isSource(aUser));
SourceIter i = getBadSource(aUser);
if(i != badSources.end()) {
sources.push_back(*i);
badSources.erase(i);
} else {
sources.push_back(Source(aUser));
}
}
void QueueItem::removeSource(const UserPtr& aUser, int reason) {
SourceIter i = getSource(aUser);
dcassert(i != sources.end());
i->setFlag(reason);
badSources.push_back(*i);
sources.erase(i);
}
const string& QueueItem::getTempTarget() {
if(!isSet(QueueItem::FLAG_USER_LIST) && tempTarget.empty()) {
if(!SETTING(TEMP_DOWNLOAD_DIRECTORY).empty() && (File::getSize(getTarget()) == -1)) {
#ifdef _WIN32
dcpp::StringMap sm;
if(target.length() >= 3 && target[1] == ':' && target[2] == '\\')
sm["targetdrive"] = target.substr(0, 3);
else
sm["targetdrive"] = Util::getPath(Util::PATH_USER_LOCAL).substr(0, 3);
setTempTarget(Util::formatParams(SETTING(TEMP_DOWNLOAD_DIRECTORY), sm, false) + getTempName(getTargetFileName(), getTTH()));
#else //_WIN32
setTempTarget(SETTING(TEMP_DOWNLOAD_DIRECTORY) + getTempName(getTargetFileName(), getTTH()));
#endif //_WIN32
}
}
return tempTarget;
}
namespace {
inline int64_t roundDown(int64_t size, int64_t blockSize) {
return ((size + blockSize / 2) / blockSize) * blockSize;
}
inline int64_t roundUp(int64_t size, int64_t blockSize) {
return ((size + blockSize - 1) / blockSize) * blockSize;
}
}
Segment QueueItem::getNextSegment(int64_t blockSize, int64_t wantedSize) const {
if(getSize() == -1 || blockSize == 0) {
return Segment(0, -1);
}
if(!BOOLSETTING(SEGMENTED_DL)) {
if(!downloads.empty()) {
return Segment(0, 0);
}
int64_t start = 0;
int64_t end = getSize();
if(!done.empty()) {
const Segment& first = *done.begin();
if(first.getStart() > 0) {
end = roundUp(first.getStart(), blockSize);
} else {
start = roundDown(first.getEnd(), blockSize);
if(done.size() > 1) {
const Segment& second = *(++done.begin());
end = roundUp(second.getStart(), blockSize);
}
}
}
return Segment(start, std::min(getSize(), end) - start);
}
double donePart = static_cast<double>(getDownloadedBytes()) / getSize();
// We want smaller blocks at the end of the transfer, squaring gives a nice curve...
int64_t targetSize = wantedSize * std::max(0.25, (1. - (donePart * donePart)));
if(targetSize > blockSize) {
// Round off to nearest block size
targetSize = roundDown(targetSize, blockSize);
} else {
targetSize = blockSize;
}
int64_t start = 0;
int64_t curSize = targetSize;
while(start < getSize()) {
int64_t end = std::min(getSize(), start + curSize);
Segment block(start, end - start);
bool overlaps = false;
for(SegmentConstIter i = done.begin(); !overlaps && i != done.end(); ++i) {
if(curSize <= blockSize) {
int64_t dstart = i->getStart();
int64_t dend = i->getEnd();
// We accept partial overlaps, only consider the block done if it is fully consumed by the done block
if(dstart <= start && dend >= end) {
overlaps = true;
}
} else {
overlaps = block.overlaps(*i);
}
}
for(DownloadList::const_iterator i = downloads.begin(); !overlaps && i !=downloads.end(); ++i) {
overlaps = block.overlaps((*i)->getSegment());
}
if(!overlaps) {
return block;
}
if(curSize > blockSize) {
curSize -= blockSize;
} else {
start = end;
curSize = targetSize;
}
}
return Segment(0, 0);
}
int64_t QueueItem::getDownloadedBytes() const {
int64_t total = 0;
for(SegmentSet::const_iterator i = done.begin(); i != done.end(); ++i) {
total += i->getSize();
}
return total;
}
void QueueItem::addSegment(const Segment& segment) {
done.insert(segment);
// Consolidate segments
if(done.size() == 1)
return;
for(SegmentSet::iterator i = ++done.begin() ; i != done.end(); ) {
SegmentSet::iterator prev = i;
prev--;
if(prev->getEnd() >= i->getStart()) {
Segment big(prev->getStart(), i->getEnd() - prev->getStart());
done.erase(prev);
done.erase(i++);
done.insert(big);
} else {
++i;
}
}
}
}
|
