forked from catid/tonk
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTonkineseMaps.cpp
More file actions
199 lines (161 loc) · 5.5 KB
/
Copy pathTonkineseMaps.cpp
File metadata and controls
199 lines (161 loc) · 5.5 KB
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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
/** \file
\brief Tonk Implementation: Connection Maps
\copyright Copyright (c) 2017-2018 Christopher A. Taylor. 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 Tonkinese 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 COPYRIGHT HOLDER 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 "TonkineseMaps.h"
namespace tonk {
static logger::Channel ModuleLogger("Maps", MinimumLogLevel);
//------------------------------------------------------------------------------
// ConnectionIdMap
ConnectionIdMap::ConnectionIdMap()
{
// Add a different offset for each socket so that bugs where "my" and "peer"
// ids are swapped can be found more easily.
const uint8_t randomOffset = static_cast<uint8_t>(siamese::GetTimeUsec() % 256);
for (unsigned i = 0; i < 256; ++i) {
BestUnusedIds[i] = (uint8_t)(255 - i + randomOffset);
}
}
bool ConnectionIdMap::InsertAndAssignId(
id_t& idOut,
IConnection* connection)
{
Locker locker(IdLock);
if (BestUnusedCount > 0)
{
idOut = BestUnusedIds[--BestUnusedCount];
const bool success = IdMap.Insert(idOut, connection);
if (!success) {
++BestUnusedCount;
}
//ModuleLogger.Trace("ID ADD ", idOut, " + ", connection, " - ", success);
return success;
}
if (IdMap.GetCount() >= protocol::kConnectionIdCount)
{
TONK_DEBUG_BREAK(); // Should never happen
return false;
}
// Find next unused Id
do
{
++NextId;
if (NextId < 256 || NextId >= protocol::kConnectionIdCount) {
NextId = 256;
}
} while (!IdMap.Insert(NextId, connection));
idOut = NextId;
return true;
}
bool ConnectionIdMap::RemoveAndUnassignId(
id_t id,
IConnection* connection)
{
if (id == TONK_INVALID_ID) {
return false;
}
Locker locker(IdLock);
// If the ID is just one byte:
if (id < 256 && BestUnusedCount < 256) {
// Put it back in the list of one byte IDs
BestUnusedIds[BestUnusedCount++] = (uint8_t)id;
}
bool success = IdMap.Remove(id, connection);
//ModuleLogger.Trace("ID REMOVE ", id, " + ", connection, " - ", success);
return success;
}
//------------------------------------------------------------------------------
// ConnectionAddrMap
IConnection* ConnectionAddrMap::FindByAddr(const UDPAddress& addr)
{
TONK_DEBUG_ASSERT(!addr.address().is_unspecified());
Locker locker(AddressMapLock);
IConnection* connection;
if (addr == RecentAddress) {
connection = RecentConnection;
}
else
{
connection = AddressMap.Find(addr);
if (connection)
{
RecentAddress = addr;
RecentConnection = connection;
}
}
if (connection) {
connection->SelfRefCount.IncrementReferences();
}
return connection;
}
bool ConnectionAddrMap::InsertAddress(
const UDPAddress& addr,
IConnection* connection)
{
if (addr.address().is_unspecified())
{
TONK_DEBUG_BREAK(); // Should never happen
return false;
}
Locker locker(AddressMapLock);
return AddressMap.Insert(addr, connection);
}
bool ConnectionAddrMap::RemoveAddress(
const UDPAddress& addr,
IConnection* connection)
{
if (addr.address().is_unspecified()) {
return false;
}
Locker locker(AddressMapLock);
// Remove from recent list
if (RecentConnection == connection)
{
RecentAddress = UDPAddress();
RecentConnection = nullptr;
}
return AddressMap.Remove(addr, connection);
}
bool ConnectionAddrMap::ChangeAddress(
const UDPAddress& oldAddress,
const UDPAddress& newAddress,
IConnection* connection)
{
Locker locker(AddressMapLock);
// Remove from recent list
if (RecentConnection == connection)
{
RecentAddress = UDPAddress();
RecentConnection = nullptr;
}
if (!oldAddress.address().is_unspecified()) {
AddressMap.Remove(oldAddress, connection);
}
if (!newAddress.address().is_unspecified()) {
return AddressMap.Insert(newAddress, connection);
}
// If new address is unspecified, return true
return true;
}
} // namespace tonk