forked from sipa/bitcoin-seeder
-
Notifications
You must be signed in to change notification settings - Fork 1
/
db.h
431 lines (388 loc) · 13.1 KB
/
db.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
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
#include <stdint.h>
#include <math.h>
#include <set>
#include <map>
#include <vector>
#include <deque>
#include "netbase.h"
#include "protocol.h"
#include "util.h"
#include <stdlib.h>
#define MIN_RETRY 1000
#define REQUIRE_VERSION 70001
static inline int GetRequireHeight(const bool testnet = fTestNet, const bool regtest = fRegTest)
{
return testnet ? 100000 : (regtest ? 0 :350000);
}
std::string static inline ToString(const CService &ip)
{
std::string str = ip.ToString();
while (str.size() < 22) str += ' ';
return str;
}
class CAddrStat
{
private:
float weight;
float count;
float reliability;
public:
CAddrStat() : weight(0), count(0), reliability(0)
{}
void Update(bool good, int64 age, double tau)
{
double f = exp(-age / tau);
reliability = reliability * f + (good ? (1.0 - f) : 0);
count = count * f + 1;
weight = weight * f + (1.0 - f);
}
IMPLEMENT_SERIALIZE (
READWRITE(weight);
READWRITE(count);
READWRITE(reliability);
)
friend class CAddrInfo;
};
class CAddrReport
{
public:
CService ip;
int clientVersion;
int blocks;
double uptime[5];
std::string clientSubVersion;
int64_t lastSuccess;
bool fGood;
uint64_t services;
};
class CAddrInfo
{
private:
CService ip;
uint64_t services;
int64 lastTry;
int64 ourLastTry;
int64 ourLastSuccess;
int64 ignoreTill;
CAddrStat stat2H;
CAddrStat stat8H;
CAddrStat stat1D;
CAddrStat stat1W;
CAddrStat stat1M;
int clientVersion;
int blocks;
int total;
int success;
std::string clientSubVersion;
public:
CAddrInfo()
: services(0), lastTry(0), ourLastTry(0), ourLastSuccess(0), ignoreTill(0), clientVersion(0), blocks(0), total(0), success(0)
{}
CAddrReport GetReport() const
{
CAddrReport ret;
ret.ip = ip;
ret.clientVersion = clientVersion;
ret.clientSubVersion = clientSubVersion;
ret.blocks = blocks;
ret.uptime[0] = stat2H.reliability;
ret.uptime[1] = stat8H.reliability;
ret.uptime[2] = stat1D.reliability;
ret.uptime[3] = stat1W.reliability;
ret.uptime[4] = stat1M.reliability;
ret.lastSuccess = ourLastSuccess;
ret.fGood = IsGood();
ret.services = services;
return ret;
}
bool IsGood() const
{
if (ip.GetPort() != GetDefaultPort()) return false;
//printf("ip.GetPort: %d\n", ip.GetPort());
if (!(services & NODE_NETWORK)) return false;
//printf("2\n");
if (!ip.IsRoutable()) return false;
//printf("3\n");
if (clientVersion && clientVersion < REQUIRE_VERSION) return false;
//printf("clientVersion: %d\n", clientVersion);
if (blocks && blocks < GetRequireHeight()) return false;
//printf("blocks: %d, GetRequireHeight: %d\n", blocks, GetRequireHeight());
if (total <= 3 && success * 2 >= total) return true;
//printf("total: %d, success: %d\n", total, success);
if (stat2H.reliability > 0.85 && stat2H.count > 2) return true;
//printf("stat2h.reliability %.2f, stat2h.count %.2f\n", stat2H.reliability, stat2H.count);
if (stat8H.reliability > 0.70 && stat8H.count > 4) return true;
//printf("stat8h.reliability %.2f, stat8h.count %.2f\n", stat8H.reliability, stat8H.count);
if (stat1D.reliability > 0.55 && stat1D.count > 8) return true;
//printf("stat1D.reliability %.2f, stat1D.count %.2f\n", stat1D.reliability, stat1D.count);
if (stat1W.reliability > 0.45 && stat1W.count > 16) return true;
//printf("stat1W.reliability %.2f, stat1W.count %.2f\n", stat1W.reliability, stat1W.count);
if (stat1M.reliability > 0.35 && stat1M.count > 32) return true;
//printf("stat1M.reliability %.2f, stat1M.count %.2f\n", stat1M.reliability, stat1M.count);
return false;
}
int GetBanTime() const
{
if (IsGood()) return 0;
if (clientVersion && clientVersion < 31900)
{ return 604800; }
if (stat1M.reliability - stat1M.weight + 1.0 < 0.15 && stat1M.count > 32)
{ return 30 * 86400; }
if (stat1W.reliability - stat1W.weight + 1.0 < 0.10 && stat1W.count > 16)
{ return 7 * 86400; }
if (stat1D.reliability - stat1D.weight + 1.0 < 0.05 && stat1D.count > 8)
{ return 1 * 86400; }
return 0;
}
int GetIgnoreTime() const
{
if (IsGood()) return 0;
if (stat1M.reliability - stat1M.weight + 1.0 < 0.20 && stat1M.count > 2)
{ return 10 * 86400; }
if (stat1W.reliability - stat1W.weight + 1.0 < 0.16 && stat1W.count > 2)
{ return 3 * 86400; }
if (stat1D.reliability - stat1D.weight + 1.0 < 0.12 && stat1D.count > 2)
{ return 8 * 3600; }
if (stat8H.reliability - stat8H.weight + 1.0 < 0.08 && stat8H.count > 2)
{ return 2 * 3600; }
return 0;
}
void Update(bool good);
friend class CAddrDb;
IMPLEMENT_SERIALIZE (
unsigned char version = 4;
READWRITE(version);
READWRITE(ip);
READWRITE(services);
READWRITE(lastTry);
unsigned char tried = ourLastTry != 0;
READWRITE(tried);
if (tried)
{
READWRITE(ourLastTry);
READWRITE(ignoreTill);
READWRITE(stat2H);
READWRITE(stat8H);
READWRITE(stat1D);
READWRITE(stat1W);
if (version >= 1)
READWRITE(stat1M);
else if (!fWrite)
*((CAddrStat *) (&stat1M)) = stat1W;
READWRITE(total);
READWRITE(success);
READWRITE(clientVersion);
if (version >= 2)
READWRITE(clientSubVersion);
if (version >= 3)
READWRITE(blocks);
if (version >= 4)
READWRITE(ourLastSuccess);
}
)
};
class CAddrDbStats
{
public:
int nBanned;
int nAvail;
int nTracked;
int nNew;
int nGood;
int nAge;
};
struct CServiceResult
{
CService service;
bool fGood;
int nBanTime;
int nHeight;
int nClientV;
std::string strClientV;
int64 ourLastSuccess;
};
// seen nodes
// / \
// (a) banned nodes available nodes--------------
// / | \
// tracked nodes (b) unknown nodes (e) active nodes
// / \
// (d) good nodes (c) non-good nodes
class CAddrDb
{
private:
mutable CCriticalSection cs;
int nId; // number of address id's
std::map<int, CAddrInfo> idToInfo; // map address id to address info (b,c,d,e)
std::map<CService, int> ipToId; // map ip to id (b,c,d,e)
std::deque<int> ourId; // sequence of tried nodes, in order we have tried connecting to them (c,d)
std::set<int> unkId; // set of nodes not yet tried (b)
std::set<int> goodId; // set of good nodes (d, good e)
int nDirty;
protected:
// internal routines that assume proper locks are acquired
void Add_(const CAddress &addr, bool force); // add an address
bool Get_(CServiceResult &ip, int &wait); // get an IP to test (must call Good_, Bad_, or Skipped_ on result afterwards)
bool GetMany_(std::vector<CServiceResult> &ips, int max, int &wait);
void Good_(const CService &ip, int clientV, std::string clientSV, int blocks); // mark an IP as good (must have been returned by Get_)
void Bad_(const CService &ip, int ban); // mark an IP as bad (and optionally ban it) (must have been returned by Get_)
void Skipped_(const CService &ip); // mark an IP as skipped (must have been returned by Get_)
int Lookup_(const CService &ip); // look up id of an IP
void GetIPs_(std::set<CNetAddr> &ips, uint64_t requestedFlags, int max, const bool *nets); // get a random set of IPs (shared lock only)
public:
std::map<CService, time_t> banned; // nodes that are banned, with their unban time (a)
void GetStats(CAddrDbStats &stats)
{
SHARED_CRITICAL_BLOCK(cs)
{
stats.nBanned = banned.size();
stats.nAvail = idToInfo.size();
stats.nTracked = ourId.size();
stats.nGood = goodId.size();
stats.nNew = unkId.size();
stats.nAge = time(NULL) - idToInfo[ourId[0]].ourLastTry;
}
}
void ResetIgnores()
{
for (std::map<int, CAddrInfo>::iterator it = idToInfo.begin(); it != idToInfo.end(); it++)
{
(*it).second.ignoreTill = 0;
}
}
std::vector<CAddrReport> GetAll()
{
std::vector<CAddrReport> ret;
SHARED_CRITICAL_BLOCK(cs)
{
for (std::deque<int>::const_iterator it = ourId.begin(); it != ourId.end(); it++)
{
const CAddrInfo &info = idToInfo[*it];
if (info.success > 0)
{
ret.push_back(info.GetReport());
}
}
}
return ret;
}
// serialization code
// format:
// nVersion (0 for now)
// n (number of ips in (b,c,d))
// CAddrInfo[n]
// banned
// acquires a shared lock (this does not suffice for read mode, but we assume that only happens at startup, single-threaded)
// this way, dumping does not interfere with GetIPs_, which is called from the DNS thread
IMPLEMENT_SERIALIZE (({
int nVersion = 0;
READWRITE(nVersion);
SHARED_CRITICAL_BLOCK(cs)
{
if (fWrite)
{
CAddrDb *db = const_cast<CAddrDb *>(this);
int n = ourId.size() + unkId.size();
READWRITE(n);
for (std::deque<int>::const_iterator it = ourId.begin(); it != ourId.end(); it++)
{
std::map<int, CAddrInfo>::iterator ci = db->idToInfo.find(*it);
READWRITE((*ci).second);
}
for (std::set<int>::const_iterator it = unkId.begin(); it != unkId.end(); it++)
{
std::map<int, CAddrInfo>::iterator ci = db->idToInfo.find(*it);
READWRITE((*ci).second);
}
} else
{
CAddrDb *db = const_cast<CAddrDb *>(this);
db->nId = 0;
int n = 0;
READWRITE(n);
for (int i = 0; i < n; i++)
{
CAddrInfo info;
READWRITE(info);
if (!info.GetBanTime())
{
int id = db->nId++;
db->idToInfo[id] = info;
db->ipToId[info.ip] = id;
if (info.ourLastTry)
{
db->ourId.push_back(id);
if (info.IsGood()) db->goodId.insert(id);
} else
{
db->unkId.insert(id);
}
}
}
db->nDirty++;
}
READWRITE(banned);
}
});)
void Add(const CAddress &addr, bool fForce = false)
{
CRITICAL_BLOCK(cs)Add_(addr, fForce);
}
void Add(const std::vector<CAddress> &vAddr, bool fForce = false)
{
CRITICAL_BLOCK(cs)
for (int i = 0; i < vAddr.size(); i++)
Add_(vAddr[i], fForce);
}
// MNEY -- Commented out since they are unused
// void Good(const CService &addr, int clientVersion, std::string clientSubVersion, int blocks)
// {
// CRITICAL_BLOCK(cs)Good_(addr, clientVersion, clientSubVersion, blocks);
// }
// void Skipped(const CService &addr)
// {
// CRITICAL_BLOCK(cs)Skipped_(addr);
// }
// void Bad(const CService &addr, int ban = 0)
// {
// CRITICAL_BLOCK(cs)Bad_(addr, ban);
// }
// bool Get(CServiceResult &ip, int &wait)
// {
// CRITICAL_BLOCK(cs)return Get_(ip, wait);
// }
void GetMany(std::vector<CServiceResult> &ips, int max, int &wait)
{
CRITICAL_BLOCK(cs)
{
while (max > 0)
{
CServiceResult ip = {};
if (!Get_(ip, wait))
return;
ips.push_back(ip);
max--;
}
}
}
void ResultMany(const std::vector<CServiceResult> &ips)
{
CRITICAL_BLOCK(cs)
{
for (int i = 0; i < ips.size(); i++)
{
if (ips[i].fGood)
{
Good_(ips[i].service, ips[i].nClientV, ips[i].strClientV, ips[i].nHeight);
} else
{
Bad_(ips[i].service, ips[i].nBanTime);
}
}
}
}
void GetIPs(std::set<CNetAddr> &ips, uint64_t requestedFlags, int max, const bool *nets)
{
SHARED_CRITICAL_BLOCK(cs)GetIPs_(ips, requestedFlags, max, nets);
}
};