twister dns seeder
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

360 lines
10 KiB

#include <stdint.h>
13 years ago
#include <math.h>
#include <set>
#include <map>
#include <vector>
#include <deque>
#include "netbase.h"
#include "protocol.h"
#include "util.h"
13 years ago
#define MIN_RETRY 1000
13 years ago
#define REQUIRE_VERSION 40000
static inline int GetRequireHeight(const bool testnet = fTestNet)
{
// return testnet ? 0 : 230000;
return 0;
}
std::string static inline ToString(const CService &ip) {
std::string str = ip.ToString();
while (str.size() < 22) str += ' ';
return str;
}
13 years ago
class CAddrStat {
13 years ago
private:
float weight;
13 years ago
float count;
float reliability;
13 years ago
public:
13 years ago
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);
13 years ago
}
13 years ago
IMPLEMENT_SERIALIZE (
READWRITE(weight);
READWRITE(count);
READWRITE(reliability);
)
friend class CAddrInfo;
};
13 years ago
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;
13 years ago
int64 ignoreTill;
CAddrStat stat2H;
CAddrStat stat8H;
CAddrStat stat1D;
CAddrStat stat1W;
CAddrStat stat1M;
13 years ago
int clientVersion;
int blocks;
13 years ago
int total;
int success;
std::string clientSubVersion;
13 years ago
public:
CAddrInfo() : services(0), lastTry(0), ourLastTry(0), ourLastSuccess(0), ignoreTill(0), clientVersion(0), blocks(0), total(0), success(0) {}
13 years ago
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;
13 years ago
if (!(services & NODE_NETWORK)) return false;
if (!ip.IsRoutable()) return false;
if (clientVersion && clientVersion < REQUIRE_VERSION) return false;
if (blocks && blocks < GetRequireHeight()) return false;
13 years ago
if (total <= 3 && success * 2 >= total) return true;
if (stat2H.reliability > 0.85 && stat2H.count > 2) return true;
if (stat8H.reliability > 0.70 && stat8H.count > 4) return true;
if (stat1D.reliability > 0.55 && stat1D.count > 8) return true;
if (stat1W.reliability > 0.45 && stat1W.count > 16) return true;
if (stat1M.reliability > 0.35 && stat1M.count > 32) return true;
13 years ago
return false;
}
int GetBanTime() const {
13 years ago
if (IsGood()) return 0;
if (clientVersion && clientVersion < 31900) { return 604800; }
12 years ago
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; }
13 years ago
return 0;
13 years ago
}
int GetIgnoreTime() const {
13 years ago
if (IsGood()) return 0;
12 years ago
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; }
13 years ago
return 0;
13 years ago
}
13 years ago
13 years ago
void Update(bool good);
13 years ago
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);
}
)
13 years ago
};
class CAddrDbStats {
public:
int nBanned;
int nAvail;
int nTracked;
int nNew;
int nGood;
13 years ago
int nAge;
};
struct CServiceResult {
CService service;
bool fGood;
int nBanTime;
int nHeight;
int nClientV;
std::string strClientV;
int64 ourLastSuccess;
};
13 years ago
// seen nodes
// / \
// (a) banned nodes available nodes--------------
// / | \
// tracked nodes (b) unknown nodes (e) active nodes
13 years ago
// / \
// (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)
13 years ago
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)
13 years ago
int nDirty;
13 years ago
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, int max, const bool *nets); // get a random set of IPs (shared lock only)
13 years ago
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();
13 years ago
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;
}
13 years ago
// serialization code
// format:
// nVersion (0 for now)
13 years ago
// 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);
13 years ago
SHARED_CRITICAL_BLOCK(cs) {
if (fWrite) {
CAddrDb *db = const_cast<CAddrDb*>(this);
13 years ago
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;
13 years ago
int n;
READWRITE(n);
for (int i=0; i<n; i++) {
CAddrInfo info;
READWRITE(info);
13 years ago
if (!info.GetBanTime()) {
int id = db->nId++;
db->idToInfo[id] = info;
db->ipToId[info.ip] = id;
13 years ago
if (info.ourLastTry) {
db->ourId.push_back(id);
if (info.IsGood()) db->goodId.insert(id);
} else {
db->unkId.insert(id);
}
}
}
13 years ago
db->nDirty++;
}
READWRITE(banned);
}
});)
void Add(const CAddress &addr, bool fForce = false) {
13 years ago
CRITICAL_BLOCK(cs)
Add_(addr, fForce);
13 years ago
}
void Add(const std::vector<CAddress> &vAddr, bool fForce = false) {
13 years ago
CRITICAL_BLOCK(cs)
for (int i=0; i<vAddr.size(); i++)
Add_(vAddr[i], fForce);
13 years ago
}
void Good(const CService &addr, int clientVersion, std::string clientSubVersion, int blocks) {
13 years ago
CRITICAL_BLOCK(cs)
Good_(addr, clientVersion, clientSubVersion, blocks);
13 years ago
}
void Skipped(const CService &addr) {
13 years ago
CRITICAL_BLOCK(cs)
Skipped_(addr);
}
void Bad(const CService &addr, int ban = 0) {
13 years ago
CRITICAL_BLOCK(cs)
Bad_(addr, ban);
}
bool Get(CServiceResult &ip, int& wait) {
13 years ago
CRITICAL_BLOCK(cs)
return Get_(ip, wait);
13 years ago
}
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, int max, const bool *nets) {
13 years ago
SHARED_CRITICAL_BLOCK(cs)
GetIPs_(ips, max, nets);
13 years ago
}
};