/
KadNodeId.h
executable file
·349 lines (300 loc) · 8.85 KB
/
KadNodeId.h
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
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
#ifndef NODEID_H_
#define NODEID_H_
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "KadConfig.h"
#include "XHelpers.h"
#include "XLog.h"
#define bitsof(x) (sizeof(x)*8)
template <unsigned ID_SIZE>
class TKadId
{
/*****************************************************************
* Generators
*****************************************************************/
public:
enum {
SIZE = ID_SIZE,
BIT_SIZE = (ID_SIZE*8)
};
TKadId () {
Clear();
}
explicit TKadId (const char* str) {
Clear();
const char* strBuff = str+strlen(str);
for (int i = SIZE-1; i>=0; i--) {
unsigned u;
if (strBuff-str >= 2 && sscanf(strBuff-2, "%2x", &u) == 1) {
mData[i] = u & 0xFF;
strBuff -= 2;
} else if (strBuff-str >= 2 && sscanf(strBuff-1, "%1x", &u) == 1) {
mData[i] = u & 0xFF;
break;
} else if (strBuff-str == 1 && sscanf(strBuff-1, "%1x", &u) == 1) {
mData[i] = u & 0xFF;
break;
} else {
break;
}
}
}
TKadId (uint64_t num) {
Clear();
// TODO: Byte-order agnostic
uint8_t* numBytes = (uint8_t*)#
for (unsigned i=0; i<SIZE && i<sizeof(num); i++) {
mData[SIZE-1-i] = numBytes[i];
}
}
static TKadId FromHash(const void* data, size_t len);
static TKadId FromHash(const char* str) { return FromHash(str, strlen(str)); }
static TKadId Random() {
XString unique = XString::Format("%d-%d", RandRange(0, 10000), RandRange(0, 10000));
return TKadId::FromHash((char*)unique, unique.Length());
}
static TKadId PowerOfTwo(int power) {
TKadId result;
memset(result.mData, 0, SIZE);
result.SetBit(BIT_SIZE-1 - power);
return result;
}
/*****************************************************************
* Operators
*****************************************************************/
TKadId operator ~() const {
TKadId result;
for (unsigned i = 0; i < SIZE; i++) {
result.mData[i] = static_cast<uint8_t>(~mData[i]);
}
return result;
}
TKadId operator ^(const TKadId &id) const { TKadId result(*this); result ^= id; return result; }
TKadId operator |(const TKadId &id) const { TKadId result(*this); result |= id; return result; }
TKadId operator &(const TKadId &id) const { TKadId result(*this); result &= id; return result; }
TKadId operator +(const TKadId &id) const { return TKadId(*this).Add(id); }
TKadId operator -(const TKadId &id) const { return TKadId(*this).Sub(id); }
TKadId operator *(const TKadId &id) const { return TKadId(*this).Mul(id); }
//TKadId operator /(const TKadId &id) const { return TKadId(*this).Div(id); }
TKadId operator <<(unsigned bits) const { return TKadId(*this).Shl(bits); }
TKadId operator >>(unsigned bits) const { return TKadId(*this).Shr(bits); }
TKadId& operator ^=(const TKadId &id) { for (unsigned i = 0; i < SIZE; i++) { mData[i] ^= id.mData[i]; } return *this; }
TKadId& operator |=(const TKadId &id) { for (unsigned i = 0; i < SIZE; i++) { mData[i] |= id.mData[i]; } return *this; }
TKadId& operator &=(const TKadId &id) { for (unsigned i = 0; i < SIZE; i++) { mData[i] &= id.mData[i]; } return *this; }
TKadId& operator +=(const TKadId &id) { return Add(id); }
TKadId& operator -=(const TKadId &id) { return Sub(id); }
TKadId& operator *=(const TKadId &id) { return Mul(id); }
//TKadId& operator /=(const TKadId &id) { return Div(id); }
TKadId& operator <<=(unsigned bits) { return Shl(bits); }
TKadId& operator >>=(unsigned bits) { return Shr(bits); }
bool operator ==(const TKadId &id) const { return memcmp(mData, id.mData, SIZE) == 0; }
bool operator !=(const TKadId &id) const { return memcmp(mData, id.mData, SIZE) != 0; }
bool operator >=(const TKadId &id) const { return memcmp(mData, id.mData, SIZE) >= 0; }
bool operator <=(const TKadId &id) const { return memcmp(mData, id.mData, SIZE) <= 0; }
bool operator > (const TKadId &id) const { return memcmp(mData, id.mData, SIZE) > 0; }
bool operator < (const TKadId &id) const { return memcmp(mData, id.mData, SIZE) < 0; }
/*****************************************************************
* Methods
*****************************************************************/
TKadId& Add(const TKadId& uValue)
{
if (uValue.IsZero())
return *this;
int16_t iSum = 0;
for (int iIndex=SIZE-1; iIndex>=0; iIndex--)
{
iSum = static_cast<int16_t>(iSum + mData[iIndex] + uValue.mData[iIndex]);
mData[iIndex] = static_cast<uint8_t>(iSum);
iSum = static_cast<int16_t>(iSum >> bitsof(mData[0]));
}
return *this;
}
TKadId& Sub(const TKadId& uValue)
{
if (uValue.IsZero())
return *this;
int16_t iSum = 0;
for (int iIndex=SIZE-1; iIndex>=0; iIndex--)
{
iSum = static_cast<int16_t>(iSum + mData[iIndex] - uValue.mData[iIndex]);
mData[iIndex] = static_cast<uint8_t>(iSum);
iSum = static_cast<int16_t>(iSum >> bitsof(mData[0]));
}
return *this;
}
TKadId& Mul(const TKadId& uValue)
{
TKadId ret;
uint8_t mat[2*SIZE+1][2*SIZE] = { { 0, }, };
int16_t carry = 0;
for (int i=SIZE-1;i>=0;i--) {
for (int j=SIZE-1;j>=0;j--) {
carry = int16_t(carry + mData[i] * uValue.mData[j]);
if (carry < 0x100) {
mat[i][j-(SIZE-1-i)] = uint8_t(carry);
carry = 0;
} else {
mat[i][j-(SIZE-1-i)] = uint8_t(carry % 0x100);
carry = carry / 0x100;
}
}
}
for (int i=1;i<SIZE+1;i++) {
for (int j=SIZE-1;j>=0;j--) {
carry = int16_t(carry + mat[i][j] + mat[i-1][j]);
if (carry < 0x100) {
mat[i][j] = uint8_t(carry);
carry = 0;
} else {
mat[i][j] = uint8_t(carry % 0x100);
carry = carry / 0x100;
}
}
}
for (int i=0;i<SIZE;i++) {
ret.mData[i] = mat[SIZE][i];
}
*this = ret;
return *this;
}
TKadId& Div(const TKadId& uValue)
{
X_FATAL("Not implemented");
return *this;
}
TKadId& Shl(unsigned uBits = 1)
{
if ((uBits == 0) || IsZero()) {
return *this;
}
if (uBits >= BIT_SIZE) {
*this = TKadId();
return *this;
}
TKadId uResult;
uint16_t iShifted = 0;
int iIndexShift = static_cast<int>(uBits / bitsof(iShifted));
unsigned uBitsMod = uBits % bitsof(iShifted);
for (int iIndex=SIZE-1; iIndex>=iIndexShift; iIndex--) {
iShifted = uint16_t(iShifted + (uint16_t(mData[iIndex]) << uBitsMod));
uResult.mData[iIndex-iIndexShift] = uint8_t(iShifted);
iShifted = static_cast<uint16_t>(iShifted >> bitsof(mData[0]));
}
*this = uResult;
return *this;
}
TKadId& Shr(unsigned uBits = 1)
{
X_FATAL("Not implemented");
return *this;
}
bool GetBit(unsigned bit) const {
X_ASSERT(bit < BIT_SIZE);
const int i = bit / 8;
const int shift = 7 - (bit % 8);
return ((mData[i] >> shift) & 1);
}
TKadId& SetBit(unsigned bit, bool val = true) {
X_ASSERT(bit < BIT_SIZE);
const int i = bit / 8;
const int shift = 7 - (bit % 8);
mData[i] |= uint8_t(1 << shift);
if (!val) {
mData[i] ^= uint8_t(1 << shift);
}
return *this;
}
TKadId& SetBits(unsigned bit, unsigned qty, bool val = true) {
for (unsigned i=bit; i<bit+qty; i++) {
SetBit(i, val);
}
return *this;
}
TKadId& SwapBit(unsigned bit)
{
X_ASSERT(bit < BIT_SIZE);
int i = bit / 8;
int shift = 7 - (bit % 8);
if ((mData[i] >> shift) & 1) {
mData[i] |= (1 << shift);
mData[i] ^= (1 << shift);
} else {
mData[i] |= (1 << shift);
}
return *this;
}
void Clear() {
memset(mData, 0, SIZE);
}
bool IsZero() const
{
for (unsigned i = 0; i < SIZE; i++) {
if (mData[i])
return false;
}
return true;
}
// returns n in: 2^n <= distance(n1, n2) < 2^(n+1)
// useful for finding out which bucket a node belongs to
unsigned DistanceTo(const TKadId& id) const
{
for (unsigned i = 0; i < SIZE; ++i) {
if (const uint8_t t = mData[i] ^ id.mData[i]) {
// Found non-matching byte, find exact bit
const unsigned bit = (SIZE - 1 - i) * 8;
for (int b = 7; b >= 0; --b) {
if (t >= (1 << b)) {
return bit + b + 1;
}
}
return bit;
}
}
return 0;
}
// my.Closer(toA than toB)
bool Closer(const TKadId& to, const TKadId& than) const
{
return ((*this) ^ to) < ((*this) ^ than);
}
const uint8_t* Data() const { return mData; }
uint8_t* Data() { return mData; }
XString ToString() const
{
XString result;
#ifdef KADEMLIA_DBG_BIN_ID
for (unsigned i = 0; i < SIZE*8; i++) {
result += GetBit(i)?"1":"0";
}
#else
for (unsigned i = 0; i < SIZE; i++) {
result += XString::Format("%02x", mData[i]);
}
#endif
return result;
}
/*****************************************************************
* Private data
*****************************************************************/
private:
uint8_t mData[SIZE];
};
template <unsigned SIZE>
inline
const XLog::Stream& operator <<(const XLog::Stream& str, const TKadId<SIZE>& v)
{
#ifdef KADEMLIA_DBG_BIN_ID
for (unsigned i = 0; i < SIZE*8; i++) {
str << (v.GetBit(i)?'1':'0');
}
#else
for (unsigned i = 0; i < SIZE; i++) {
str("%02x", v.Data()[i]);
}
#endif
return str;
}
typedef TKadId<KADEMLIA_ID_SIZE> KadId;
#endif /* NODEID_H_ */