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
|
/***************************************************************************
* 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 <math.h>
#include <sys/poll.h>
#include <util/functions.h>
#include "socketgroup.h"
#include "downloadthread.h"
#include "socketmonitor.h"
#include "bufferedsocket.h"
using namespace bt;
namespace net
{
Uint32 DownloadThread::dcap = 0;
Uint32 DownloadThread::sleep_time = 3;
DownloadThread::DownloadThread(SocketMonitor* sm) : NetworkThread(sm)
{
}
DownloadThread::~DownloadThread()
{}
void DownloadThread::update()
{
sm->lock();
int num = fillPollVector();
sm->unlock();
int timeout = 10;
if (poll(&fd_vec[0],num,timeout) > 0)
{
sm->lock();
TimeStamp now = bt::Now();
Uint32 num_ready = 0;
SocketMonitor::Itr itr = sm->begin();
while (itr != sm->end())
{
BufferedSocket* s = *itr;
int pi = s->getPollIndex();
if (pi >= 0 && s->ok() && fd_vec[pi].revents & POLLIN)
{
// add to the correct group
Uint32 gid = s->downloadGroupID();
SocketGroup* g = groups.find(gid);
if (!g)
g = groups.find(0);
g->add(s);
num_ready++;
}
itr++;
}
if (num_ready > 0)
doGroups(num_ready,now,dcap);
prev_run_time = now;
sm->unlock();
}
if (dcap > 0 || groups.count() > 0)
msleep(sleep_time);
}
int DownloadThread::fillPollVector()
{
TimeStamp ts = bt::Now();
int i = 0;
// fill the poll vector with all sockets
SocketMonitor::Itr itr = sm->begin();
while (itr != sm->end())
{
BufferedSocket* s = *itr;
if (s && s->ok() && s->fd() > 0)
{
if (fd_vec.size() <= i)
{
// expand pollfd vector if necessary
struct pollfd pfd;
pfd.fd = s->fd();
pfd.revents = 0;
pfd.events = POLLIN;
fd_vec.push_back(pfd);
}
else
{
// use existing slot
struct pollfd & pfd = fd_vec[i];
pfd.fd = s->fd();
pfd.revents = 0;
pfd.events = POLLIN;
}
s->setPollIndex(i);
i++;
s->updateSpeeds(ts);
}
else
{
s->setPollIndex(-1);
}
itr++;
}
return i;
}
void DownloadThread::setSleepTime(Uint32 stime)
{
if (stime >= 1 && stime <= 10)
sleep_time = stime;
}
bool DownloadThread::doGroup(SocketGroup* g,Uint32 & allowance,bt::TimeStamp now)
{
return g->download(allowance,now);
}
}
|
