109 lines
2.8 KiB
C++
109 lines
2.8 KiB
C++
#include <stdint.h>
|
|
#include <math.h>
|
|
|
|
#include <set>
|
|
#include <map>
|
|
#include <vector>
|
|
#include <deque>
|
|
|
|
#include "netbase.h"
|
|
#include "protocol.h"
|
|
#include "util.h"
|
|
|
|
#define TAU 86400.0
|
|
|
|
class CAddrInfo {
|
|
private:
|
|
CIPPort ip;
|
|
uint64_t services;
|
|
time_t lastTry;
|
|
time_t ourLastTry;
|
|
double reliability;
|
|
double timing;
|
|
double weight;
|
|
double count;
|
|
int total;
|
|
int success;
|
|
public:
|
|
bool IsGood() {
|
|
return (weight > 0.5 & reliability/weight > 0.8 && timing/weight < 86400 && count/weight > 1.0) && ip.GetPort() == 8333;
|
|
}
|
|
bool IsTerrible() {
|
|
return (weight > 0.5 & reliability/weight < 0.2 && timing/weight < 86400 && count/weight > 2.0);
|
|
}
|
|
void Update(bool good) {
|
|
uint32_t now = time(NULL);
|
|
double f = exp(-(now-ourLastTry)/TAU);
|
|
reliability = reliability * f + (good ? (1.0-f) : 0);
|
|
timing = (timing + (now-ourLastTry) * weight) * f;
|
|
count = count * f + 1;
|
|
weight = weight * f + (1.0-f);
|
|
lastTry = now;
|
|
ourLastTry = now;
|
|
total++;
|
|
if (good) success++;
|
|
}
|
|
|
|
friend class CAddrDb;
|
|
};
|
|
|
|
// seen nodes
|
|
// / \
|
|
// (a) banned nodes tracked nodes
|
|
// / \
|
|
// tried nodes (b) unknown nodes
|
|
// / \
|
|
// (d) good nodes (c) non-good nodes
|
|
|
|
class CAddrDb {
|
|
private:
|
|
CCriticalSection cs;
|
|
int nId; // number of address id's
|
|
std::map<int, CAddrInfo> idToInfo; // map address id to address info (b,c,d)
|
|
std::map<CIPPort, int> ipToId; // map ip to id (b,c,d)
|
|
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)
|
|
std::map<CIPPort, time_t> banned; // nodes that are banned, with their unban time (a)
|
|
|
|
protected:
|
|
void Add_(const CAddress &addr);
|
|
void Good_(const CIPPort &ip);
|
|
void Bad_(const CIPPort &ip, int ban);
|
|
void Skipped_(const CIPPort &ip);
|
|
bool Get_(CIPPort &ip);
|
|
int Lookup_(const CIPPort &ip);
|
|
void GetIPs_(std::set<CIP>& ips, int max, bool fOnlyIPv4);
|
|
|
|
public:
|
|
void Add(const CAddress &addr) {
|
|
CRITICAL_BLOCK(cs)
|
|
Add_(addr);
|
|
}
|
|
void Add(const std::vector<CAddress> &vAddr) {
|
|
CRITICAL_BLOCK(cs)
|
|
for (int i=0; i<vAddr.size(); i++)
|
|
Add_(vAddr[i]);
|
|
}
|
|
void Good(const CIPPort &addr) {
|
|
CRITICAL_BLOCK(cs)
|
|
Good_(addr);
|
|
}
|
|
void Skipped(const CIPPort &addr) {
|
|
CRITICAL_BLOCK(cs)
|
|
Skipped_(addr);
|
|
}
|
|
void Bad(const CIPPort &addr, int ban = 0) {
|
|
CRITICAL_BLOCK(cs)
|
|
Bad_(addr, ban);
|
|
}
|
|
bool Get(CIPPort &ip) {
|
|
CRITICAL_BLOCK(cs)
|
|
return Get_(ip);
|
|
}
|
|
void GetIPs(std::set<CIP>& ips, int max, bool fOnlyIPv4 = true) {
|
|
CRITICAL_BLOCK(cs)
|
|
GetIPs_(ips, max, fOnlyIPv4);
|
|
}
|
|
};
|