blob: 4e1e21a2bb591df0bde6dd4d232cd961f910541f (
plain)
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
|
/***************************************************************************
* 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. *
***************************************************************************/
#include <util/log.h>
#include <torrent/globals.h>
#include "taskmanager.h"
#include "nodelookup.h"
#include "dht.h"
using namespace bt;
namespace dht
{
typedef bt::PtrMap<Uint32,Task>::iterator TaskItr;
TaskManager::TaskManager() : next_id(0)
{
tasks.setAutoDelete(true);
}
TaskManager::~TaskManager()
{
queued.setAutoDelete(true);
tasks.clear();
}
void TaskManager::addTask(Task* task)
{
Uint32 id = next_id++;
task->setTaskID(id);
if (task->isQueued())
queued.append(task);
else
tasks.insert(id,task);
}
void TaskManager::removeFinishedTasks(const DHT* dh_table)
{
TQValueList<Uint32> rm;
for (TaskItr i = tasks.begin();i != tasks.end();i++)
{
if (i->second->isFinished())
rm.append(i->first);
}
for (TQValueList<Uint32>::iterator i = rm.begin();i != rm.end();i++)
{
tasks.erase(*i);
}
while (dh_table->canStartTask() && queued.count() > 0)
{
Task* t = queued.first();
queued.removeFirst();
Out(SYS_DHT|LOG_NOTICE) << "DHT: starting queued task" << endl;
t->start();
tasks.insert(t->getTaskID(),t);
}
}
}
|
