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
|
/***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* [email protected] *
* *
* 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 <util/timer.h>
#include <util/functions.h>
#include "speed.h"
using namespace bt;
namespace net
{
const Uint64 SPEED_INTERVAL = 5000;
Speed::Speed() : rate(0),bytes(0)
{}
Speed::~Speed()
{}
void Speed::onData(Uint32 b,bt::TimeStamp ts)
{
dlrate.append(tqMakePair(b,ts));
bytes += b;
}
void Speed::update(bt::TimeStamp now)
{
TQValueList<TQPair<Uint32,TimeStamp> >::iterator i = dlrate.begin();
while (i != dlrate.end())
{
TQPair<Uint32,TimeStamp> & p = *i;
if (now - p.second > SPEED_INTERVAL || now < p.second)
{
if (bytes >= p.first) // make sure we don't wrap around
bytes -= p.first; // subtract bytes
else
bytes = 0;
i = dlrate.erase(i);
}
else
{
// seeing that newer entries are appended, they are in the list chronologically
// so once we hit an entry which is in the interval, we can just break out of the loop
// because all following entries will be in the interval
break;
}
}
if (bytes == 0)
{
rate = 0;
}
else
{
// Out() << "bytes = " << bytes << " d = " << d << endl;
rate = (float) bytes / (float)(SPEED_INTERVAL * 0.001);
}
}
}
|
