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
|
/*
This file is part of Akregator.
Copyright (C) 2004 Sashmit Bhaduri <[email protected]>
2005 Frank Osterfeld <frank.osterfeld at kdemail.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 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.
As a special exception, permission is given to link this program
with any edition of Qt, and distribute the resulting executable,
without including the source code for Qt in the source distribution.
*/
#include <qvaluelist.h>
#include "akregatorconfig.h"
#include "fetchqueue.h"
#include "feed.h"
#include "treenode.h"
namespace Akregator {
class FetchQueue::FetchQueuePrivate
{
public:
QValueList<Feed*> queuedFeeds;
QValueList<Feed*> fetchingFeeds;
};
FetchQueue::FetchQueue(QObject* parent, const char* name): QObject(parent, name), d(new FetchQueuePrivate) {}
FetchQueue::~FetchQueue()
{
slotAbort();
delete d;
d = 0;
}
void FetchQueue::slotAbort()
{
for (QValueList<Feed*>::Iterator it = d->fetchingFeeds.begin(); it != d->fetchingFeeds.end(); ++it)
{
disconnectFromFeed(*it);
(*it)->slotAbortFetch();
}
d->fetchingFeeds.clear();
for (QValueList<Feed*>::Iterator it = d->queuedFeeds.begin(); it != d->queuedFeeds.end(); ++it)
{
disconnectFromFeed(*it);
}
d->queuedFeeds.clear();
emit signalStopped();
}
void FetchQueue::addFeed(Feed *f)
{
if (!d->queuedFeeds.contains(f) && !d->fetchingFeeds.contains(f))
{
connectToFeed(f);
d->queuedFeeds.append(f);
fetchNextFeed();
}
}
void FetchQueue::fetchNextFeed()
{
if (!d->queuedFeeds.isEmpty() && d->fetchingFeeds.count() < Settings::concurrentFetches())
{
if (d->fetchingFeeds.isEmpty() && d->queuedFeeds.count() == 1)
emit signalStarted();
Feed* f = *(d->queuedFeeds.begin());
d->queuedFeeds.pop_front();
d->fetchingFeeds.append(f);
f->fetch(false);
}
}
void FetchQueue::slotFeedFetched(Feed *f)
{
emit fetched(f);
feedDone(f);
}
void FetchQueue::slotFetchError(Feed *f)
{
emit fetchError(f);
feedDone(f);
}
void FetchQueue::slotFetchAborted(Feed *f)
{
emit fetched(f); // FIXME: better use a signal like signalAborted(Feed*)
feedDone(f);
}
bool FetchQueue::isEmpty() const
{
return d->queuedFeeds.isEmpty() && d->fetchingFeeds.isEmpty();
}
void FetchQueue::feedDone(Feed *f)
{
disconnectFromFeed(f);
d->fetchingFeeds.remove(f);
if (isEmpty())
emit signalStopped();
else
fetchNextFeed();
}
void FetchQueue::connectToFeed(Feed* feed)
{
connect (feed, SIGNAL(fetched(Feed*)), this, SLOT(slotFeedFetched(Feed*)));
connect (feed, SIGNAL(fetchError(Feed*)), this, SLOT(slotFetchError(Feed*)));
connect (feed, SIGNAL(fetchAborted(Feed*)), this, SLOT(slotFetchAborted(Feed*)));
connect (feed, SIGNAL(signalDestroyed(TreeNode*)), this, SLOT(slotNodeDestroyed(TreeNode*)));
}
void FetchQueue::disconnectFromFeed(Feed* feed)
{
disconnect (feed, SIGNAL(fetched(Feed*)), this, SLOT(slotFeedFetched(Feed*)));
disconnect (feed, SIGNAL(fetchError(Feed*)), this, SLOT(slotFetchError(Feed*)));
disconnect (feed, SIGNAL(fetchAborted(Feed*)), this, SLOT(slotFetchAborted(Feed*)));
disconnect (feed, SIGNAL(signalDestroyed(TreeNode*)), this, SLOT(slotNodeDestroyed(TreeNode*)));
}
void FetchQueue::slotNodeDestroyed(TreeNode* node)
{
Feed* feed = dynamic_cast<Feed*> (node);
if (feed)
{
d->fetchingFeeds.remove(feed);
d->queuedFeeds.remove(feed);
}
}
} // namespace Akregator
#include "fetchqueue.moc"
|
