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
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
|
/*
* This file is part of the KFTPGrabber project
*
* Copyright (C) 2003-2005 by the KFTPGrabber developers
* Copyright (C) 2003-2005 Jernej Kos <kostko@jweb-network.net>
*
* 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
* is provided AS IS, WITHOUT ANY WARRANTY; without even the implied
* warranty of MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, and
* NON-INFRINGEMENT. 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 Steet, 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.
*/
#include "queueobject.h"
#include "kftpqueue.h"
#include <qtimer.h>
namespace KFTPQueue {
QueueObject::QueueObject(QObject *parent, Type type)
: QObject(parent),
m_aborting(false),
m_status(Stopped),
m_type(type),
m_size(0),
m_actualSize(0),
m_completed(0),
m_resumed(0),
m_speed(0)
{
// Add the transfer
if (hasParentObject())
static_cast<QueueObject*>(parent)->addChildObject(this);
// Connect the delayed execution timer
connect(&m_delayedExecuteTimer, SIGNAL(timeout()), this, SLOT(execute()));
}
QueueObject::~QueueObject()
{
}
void QueueObject::delayedExecute(int msec)
{
/* Execute the transfer with delay - using a QTimer */
if (msec > 1000)
msec = 1000;
if (!m_delayedExecuteTimer.isActive())
m_delayedExecuteTimer.start(msec, true);
}
void QueueObject::execute()
{
}
void QueueObject::addActualSize(filesize_t size)
{
if (size == 0)
return;
m_actualSize += size;
if (hasParentObject())
parentObject()->addActualSize(size);
statisticsUpdated();
}
void QueueObject::addSize(filesize_t size)
{
if (size == 0)
return;
m_size += size;
m_actualSize += size;
if (hasParentObject())
parentObject()->addSize(size);
statisticsUpdated();
}
void QueueObject::addCompleted(filesize_t completed)
{
if (completed == 0)
return;
m_completed += completed;
if (hasParentObject())
parentObject()->addCompleted(completed);
statisticsUpdated();
}
void QueueObject::setSpeed(filesize_t speed)
{
if (speed != 0 && m_speed == speed)
return;
m_speed = speed;
QPtrListIterator<QueueObject> it(m_children);
QueueObject *i;
while ((i = it.current()) != 0) {
++it;
m_speed += i->getSpeed();
}
if (hasParentObject())
parentObject()->setSpeed();
statisticsUpdated();
}
void QueueObject::statisticsUpdated()
{
emit objectUpdated();
}
void QueueObject::abort()
{
}
void QueueObject::addChildObject(QueueObject *object)
{
m_children.append(object);
connect(object, SIGNAL(destroyed(QObject*)), this, SLOT(slotChildDestroyed(QObject*)));
}
void QueueObject::delChildObject(QueueObject *object)
{
m_children.removeRef(object);
}
void QueueObject::slotChildDestroyed(QObject *child)
{
// Remove the transfer
delChildObject(static_cast<QueueObject*>(child));
}
QueueObject *QueueObject::findChildObject(long id)
{
QPtrListIterator<QueueObject> it(m_children);
QueueObject *i;
while ((i = it.current()) != 0) {
++it;
if (i->getId() == id)
return i;
if (i->hasChildren()) {
QueueObject *tmp = i->findChildObject(id);
if (tmp)
return tmp;
}
}
return NULL;
}
void QueueObject::removeMarkedTransfers()
{
QPtrListIterator<QueueObject> it(m_children);
QueueObject *i;
while ((i = it.current()) != 0) {
++it;
if (i->hasChildren())
i->removeMarkedTransfers();
if (i->isTransfer() && static_cast<Transfer*>(i)->isDeleteMarked())
Manager::self()->removeTransfer(static_cast<Transfer*>(i));
}
}
bool QueueObject::canMove()
{
return true;
}
void QueueObject::moveChildUp(QueueObject *child)
{
if (m_children.findRef(child) != -1) {
if (m_children.prev()) {
int prevPos = m_children.at();
m_children.removeRef(child);
m_children.insert(prevPos, child);
}
}
}
void QueueObject::moveChildDown(QueueObject *child)
{
if (m_children.findRef(child) != -1) {
if (m_children.next()) {
int nextPos = m_children.at();
m_children.removeRef(child);
m_children.insert(nextPos, child);
}
}
}
void QueueObject::moveChildTop(QueueObject *child)
{
m_children.removeRef(child);
m_children.prepend(child);
}
void QueueObject::moveChildBottom(QueueObject *child)
{
m_children.removeRef(child);
m_children.append(child);
}
bool QueueObject::canMoveChildUp(QueueObject *child)
{
if (!child->canMove()) return false;
if (m_children.getFirst() == child) return false;
if (m_children.findRef(child) != -1) {
if (m_children.prev() && !m_children.current()->canMove())
return false;
}
return true;
}
bool QueueObject::canMoveChildDown(QueueObject *child)
{
if (!child->canMove()) return false;
if (m_children.getLast() == child) return false;
if (m_children.findRef(child) != -1) {
if (m_children.next() && !m_children.current()->canMove())
return false;
}
return true;
}
}
#include "queueobject.moc"
|