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
161
162
163
|
/* Copyright (C) 2005-2010, Thorvald Natvig <thorvald@natvig.com>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
- Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
- Neither the name of the Mumble Developers nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "Net.h"
HostAddress::HostAddress() {
addr[0] = addr[1] = 0ULL;
}
HostAddress::HostAddress(const Q_IPV6ADDR &address) {
memcpy(qip6.c, address.c, 16);
}
HostAddress::HostAddress(const std::string &address) {
if (address.length() != 16)
addr[0] = addr[1] = 0ULL;
else
for (int i=0;i<16;++i)
qip6[i] = address[i];
}
HostAddress::HostAddress(const QByteArray &address) {
if (address.length() != 16)
addr[0] = addr[1] = 0ULL;
else
for (int i=0;i<16;++i)
qip6[i] = address[i];
}
HostAddress::HostAddress(const QHostAddress &address) {
if (address.protocol() == QAbstractSocket::IPv6Protocol) {
const Q_IPV6ADDR &a = address.toIPv6Address();
memcpy(qip6.c, a.c, 16);
} else {
addr[0] = 0ULL;
shorts[4] = 0;
shorts[5] = 0xffff;
hash[3] = htonl(address.toIPv4Address());
}
}
HostAddress::HostAddress(const sockaddr_storage &address) {
if (address.ss_family == AF_INET) {
const struct sockaddr_in *in = reinterpret_cast<const struct sockaddr_in *>(&address);
addr[0] = 0ULL;
shorts[4] = 0;
shorts[5] = 0xffff;
hash[3] = in->sin_addr.s_addr;
} else if (address.ss_family == AF_INET6) {
const struct sockaddr_in6 *in6 = reinterpret_cast<const struct sockaddr_in6 *>(&address);
memcpy(qip6.c, in6->sin6_addr.s6_addr, 16);
} else {
addr[0] = addr[1] = 0ULL;
}
}
bool HostAddress::operator < (const HostAddress &other) const {
return memcmp(qip6.c, other.qip6.c, 16) < 0;
}
bool HostAddress::operator == (const HostAddress &other) const {
return ((addr[0] == other.addr[0]) && (addr[1] == other.addr[1]));
}
bool HostAddress::match(const HostAddress &netmask, int bits) const {
quint64 mask[2];
if (bits == 128) {
mask[0] = mask[1] = 0xffffffffffffffffULL;
} else if (bits > 64) {
mask[0] = 0xffffffffffffffffULL;
mask[1] = SWAP64(~((1ULL << (128-bits)) - 1));
} else {
mask[0] = SWAP64(~((1ULL << (64-bits)) - 1));
mask[1] = 0ULL;
}
return ((addr[0] & mask[0]) == (netmask.addr[0] & mask[0])) && ((addr[1] & mask[1]) == (netmask.addr[1] & mask[1]));
}
std::string HostAddress::toStdString() const {
return std::string(reinterpret_cast<const char *>(qip6.c), 16);
}
bool HostAddress::isV6() const {
return (addr[0] != 0ULL) || (shorts[4] != 0) || (shorts[5] != 0xffff);
}
bool HostAddress::isValid() const {
return (addr[0] != 0ULL) || (addr[1] != 0ULL);
}
QHostAddress HostAddress::toAddress() const {
if (isV6())
return QHostAddress(qip6);
else {
return QHostAddress(ntohl(hash[3]));
}
}
QByteArray HostAddress::toByteArray() const {
return QByteArray(reinterpret_cast<const char *>(qip6.c), 16);
}
quint32 qHash(const HostAddress &ha) {
return (ha.hash[0] ^ ha.hash[1] ^ ha.hash[2] ^ ha.hash[3]);
}
QString HostAddress::toString() const {
if (isV6()) {
if (isValid()) {
QString qs;
qs.sprintf("[%x:%x:%x:%x:%x:%x:%x:%x]", ntohs(shorts[0]), ntohs(shorts[1]), ntohs(shorts[2]), ntohs(shorts[3]), ntohs(shorts[4]), ntohs(shorts[5]), ntohs(shorts[6]), ntohs(shorts[7]));
return qs.replace(QRegExp(QLatin1String("(:0)+")),QLatin1String(":"));
} else {
return QLatin1String("[::]");
}
} else {
return QHostAddress(ntohl(hash[3])).toString();
}
}
bool Ban::isExpired() const {
return (iDuration > 0) && static_cast<int>(iDuration - qdtStart.secsTo(QDateTime::currentDateTime().toUTC())) < 0;
}
bool Ban::operator <(const Ban &other) const {
return haAddress < other.haAddress;
}
bool Ban::operator ==(const Ban &other) const {
return (haAddress == other.haAddress) && (qsUsername == other.qsUsername) && (qsHash == other.qsHash) && (qsReason == other.qsReason) && (qdtStart == other.qdtStart) && (iDuration == other.iDuration);
}
bool Ban::isValid() const {
return haAddress.isValid() && (iMask >= 8) && (iMask <= 128);
}
|
