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
|
// Copyright 2005-2019 The Mumble Developers. All rights reserved.
// Use of this source code is governed by a BSD-style license
// that can be found in the LICENSE file at the root of the
// Mumble source tree or at <https://www.mumble.info/LICENSE>.
#include "Server.h"
#include "ServerUser.h"
#include "Meta.h"
ServerUser::ServerUser(Server *p, QSslSocket *socket) : Connection(p, socket), User(), s(NULL), leakyBucket(p->iMessageLimit, p->iMessageBurst) {
sState = ServerUser::Connected;
sUdpSocket = INVALID_SOCKET;
memset(&saiUdpAddress, 0, sizeof(saiUdpAddress));
memset(&saiTcpLocalAddress, 0, sizeof(saiTcpLocalAddress));
dUDPPingAvg = dUDPPingVar = 0.0f;
dTCPPingAvg = dTCPPingVar = 0.0f;
uiUDPPackets = uiTCPPackets = 0;
aiUdpFlag = 1;
uiVersion = 0;
bVerified = true;
iLastPermissionCheck = -1;
bOpus = false;
}
ServerUser::operator QString() const {
return QString::fromLatin1("%1:%2(%3)").arg(qsName).arg(uiSession).arg(iId);
}
BandwidthRecord::BandwidthRecord() {
iRecNum = 0;
iSum = 0;
for (int i=0;i<N_BANDWIDTH_SLOTS;i++)
a_iBW[i] = 0;
}
bool BandwidthRecord::addFrame(int size, int maxpersec) {
QMutexLocker ml(&qmMutex);
quint64 elapsed = a_qtWhen[iRecNum].elapsed();
if (elapsed == 0)
return false;
int nsum = iSum-a_iBW[iRecNum]+size;
int bw = static_cast<int>((nsum * 1000000LL) / elapsed);
if (bw > maxpersec)
return false;
a_iBW[iRecNum] = static_cast<unsigned short>(size);
a_qtWhen[iRecNum].restart();
iSum = nsum;
iRecNum++;
if (iRecNum == N_BANDWIDTH_SLOTS)
iRecNum = 0;
return true;
}
int BandwidthRecord::onlineSeconds() const {
QMutexLocker ml(&qmMutex);
return static_cast<int>(tFirst.elapsed() / 1000000LL);
}
int BandwidthRecord::idleSeconds() const {
QMutexLocker ml(&qmMutex);
quint64 iIdle = a_qtWhen[(iRecNum + N_BANDWIDTH_SLOTS - 1) % N_BANDWIDTH_SLOTS].elapsed();
if (tIdleControl.elapsed() < iIdle)
iIdle = tIdleControl.elapsed();
return static_cast<int>(iIdle / 1000000LL);
}
void BandwidthRecord::resetIdleSeconds() {
QMutexLocker ml(&qmMutex);
tIdleControl.restart();
}
int BandwidthRecord::bandwidth() const {
QMutexLocker ml(&qmMutex);
int sum = 0;
quint64 elapsed = 0ULL;
for (int i=1;i<N_BANDWIDTH_SLOTS;++i) {
int idx = (iRecNum + N_BANDWIDTH_SLOTS - i) % N_BANDWIDTH_SLOTS;
quint64 e = a_qtWhen[idx].elapsed();
if (e > 1000000ULL) {
break;
} else {
sum += a_iBW[idx];
elapsed = e;
}
}
if (elapsed < 250000ULL)
return 0;
return static_cast<int>((sum * 1000000ULL) / elapsed);
}
inline static QTime now() {
return QTime::currentTime();
}
inline static int millisecondsBetween(const QTime &start, const QTime &end) {
return start.msecsTo(end);
}
// Rate limiting: burst up to 5, 1 message per sec limit over longer time
LeakyBucket::LeakyBucket(unsigned int tokensPerSec, unsigned int maxTokens) : tokensPerSec(tokensPerSec), maxTokens(maxTokens), currentTokens(0) {
lastUpdate = now();
}
bool LeakyBucket::ratelimit(int tokens) {
// First remove tokens we leaked over time
const QTime tnow = now();
const long ms = millisecondsBetween(lastUpdate, tnow);
const long drainTokens = (ms * tokensPerSec) / 1000;
// Prevent constant starvation due to too many updates
if (drainTokens > 0) {
this->lastUpdate = tnow;
this->currentTokens -= drainTokens;
if (this->currentTokens < 0) {
this->currentTokens = 0;
}
}
// Then try to add tokens
bool limit = this->currentTokens > ((static_cast<long>(maxTokens)) - tokens);
// If the bucket is not overflowed, allow message and add tokens
if (!limit) {
this->currentTokens += tokens;
}
return limit;
}
|
