13 std::vector<unsigned char> vchKey = GetKey();
14 ss1 << nKey << vchKey;
18 std::vector<unsigned char> vchGroupKey = GetGroup();
27 std::vector<unsigned char> vchGroupKey = GetGroup();
28 std::vector<unsigned char> vchSourceGroupKey = src.
GetGroup();
29 ss1 << nKey << vchGroupKey << vchSourceGroupKey;
40 if (nLastTry && nLastTry >= nNow-60)
43 if (nTime > nNow + 10*60)
62 int64 nSinceLastSeen = nNow - nTime;
63 int64 nSinceLastTry = nNow - nLastTry;
65 if (nSinceLastSeen < 0) nSinceLastSeen = 0;
66 if (nSinceLastTry < 0) nSinceLastTry = 0;
68 fChance *= 600.0 / (600.0 + nSinceLastSeen);
71 if (nSinceLastTry < 60*10)
75 for (
int n=0; n<nAttempts; n++)
83 std::map<CNetAddr, int>::iterator it = mapAddr.find(addr);
84 if (it == mapAddr.end())
88 std::map<int, CAddrInfo>::iterator it2 = mapInfo.find((*it).second);
89 if (it2 != mapInfo.end())
90 return &(*it2).second;
97 mapInfo[nId] =
CAddrInfo(addr, addrSource);
99 mapInfo[nId].nRandomPos = vRandom.size();
100 vRandom.push_back(nId);
103 return &mapInfo[nId];
108 if (nRndPos1 == nRndPos2)
111 assert(nRndPos1 < vRandom.size() && nRndPos2 < vRandom.size());
113 int nId1 = vRandom[nRndPos1];
114 int nId2 = vRandom[nRndPos2];
116 assert(mapInfo.count(nId1) == 1);
117 assert(mapInfo.count(nId2) == 1);
119 mapInfo[nId1].nRandomPos = nRndPos2;
120 mapInfo[nId2].nRandomPos = nRndPos1;
122 vRandom[nRndPos1] = nId2;
123 vRandom[nRndPos2] = nId1;
128 std::vector<int> &vTried = vvTried[nKBucket];
137 int nTemp = vTried[nPos];
138 vTried[nPos] = vTried[i];
140 assert(nOldest == -1 || mapInfo.count(nTemp) == 1);
141 if (nOldest == -1 || mapInfo[nTemp].nLastSuccess < mapInfo[nOldest].nLastSuccess) {
152 assert(nUBucket >= 0 && (
unsigned int)nUBucket < vvNew.size());
153 std::set<int> &vNew = vvNew[nUBucket];
156 for (std::set<int>::iterator it = vNew.begin(); it != vNew.end(); it++)
158 assert(mapInfo.count(*it));
160 if (info.IsTerrible())
162 if (--info.nRefCount == 0)
164 SwapRandom(info.nRandomPos, vRandom.size()-1);
179 for (std::set<int>::iterator it = vNew.begin(); it != vNew.end(); it++)
181 if (nI == n[0] || nI == n[1] || nI == n[2] || nI == n[3])
183 assert(nOldest == -1 || mapInfo.count(*it) == 1);
184 if (nOldest == -1 || mapInfo[*it].nTime < mapInfo[nOldest].nTime)
189 assert(mapInfo.count(nOldest) == 1);
191 if (--info.nRefCount == 0)
193 SwapRandom(info.nRandomPos, vRandom.size()-1);
196 mapInfo.erase(nOldest);
206 assert(vvNew[nOrigin].count(nId) == 1);
209 for (std::vector<std::set<int> >::iterator it = vvNew.begin(); it != vvNew.end(); it++)
211 if ((*it).erase(nId))
220 std::vector<int> &vTried = vvTried[nKBucket];
225 vTried.push_back(nId);
232 int nPos = SelectTried(nKBucket);
235 assert(mapInfo.count(vTried[nPos]) == 1);
236 int nUBucket = mapInfo[vTried[nPos]].GetNewBucket(nKey);
237 std::set<int> &vNew = vvNew[nUBucket];
240 CAddrInfo& infoOld = mapInfo[vTried[nPos]];
249 vNew.insert(vTried[nPos]);
252 vvNew[nOrigin].insert(vTried[nPos]);
292 for (
unsigned int n = 0; n < vvNew.size(); n++)
294 int nB = (n+nRnd) % vvNew.size();
295 std::set<int> &vNew = vvNew[nB];
305 if (nUBucket == -1)
return;
310 MakeTried(info, nId, nUBucket);
326 int64 nUpdateInterval = (fCurrentlyOnline ? 60 * 60 : 24 * 60 * 60);
327 if (addr.
nTime && (!pinfo->
nTime || pinfo->
nTime < addr.
nTime - nUpdateInterval - nTimePenalty))
349 if (nFactor > 1 && (
GetRandInt(nFactor) != 0))
352 pinfo = Create(addr, source, &nId);
360 std::set<int> &vNew = vvNew[nUBucket];
361 if (!vNew.count(nId))
366 vvNew[nUBucket].insert(nId);
395 double nCorTried = sqrt(nTried) * (100.0 - nUnkBias);
396 double nCorNew = sqrt(nNew) * nUnkBias;
397 if ((nCorTried + nCorNew)*
GetRandInt(1<<30)/(1<<30) < nCorTried)
400 double fChanceFactor = 1.0;
404 std::vector<int> &vTried = vvTried[nKBucket];
405 if (vTried.size() == 0)
continue;
407 assert(mapInfo.count(vTried[nPos]) == 1);
409 if (
GetRandInt(1<<30) < fChanceFactor*info.GetChance()*(1<<30))
411 fChanceFactor *= 1.2;
415 double fChanceFactor = 1.0;
419 std::set<int> &vNew = vvNew[nUBucket];
420 if (vNew.size() == 0)
continue;
422 std::set<int>::iterator it = vNew.begin();
425 assert(mapInfo.count(*it) == 1);
427 if (
GetRandInt(1<<30) < fChanceFactor*info.GetChance()*(1<<30))
429 fChanceFactor *= 1.2;
435 int CAddrMan::Check_()
437 std::set<int> setTried;
438 std::map<int, int> mapNew;
440 if (vRandom.size() != nTried + nNew)
return -7;
442 for (std::map<int, CAddrInfo>::iterator it = mapInfo.begin(); it != mapInfo.end(); it++)
457 if (mapAddr[info] != n)
return -5;
463 if (setTried.size() != nTried)
return -9;
464 if (mapNew.size() != nNew)
return -10;
466 for (
int n=0; n<vvTried.size(); n++)
468 std::vector<int> &vTried = vvTried[n];
469 for (std::vector<int>::iterator it = vTried.begin(); it != vTried.end(); it++)
471 if (!setTried.count(*it))
return -11;
476 for (
int n=0; n<vvNew.size(); n++)
478 std::set<int> &vNew = vvNew[n];
479 for (std::set<int>::iterator it = vNew.begin(); it != vNew.end(); it++)
481 if (!mapNew.count(*it))
return -12;
482 if (--mapNew[*it] == 0)
487 if (setTried.size())
return -13;
488 if (mapNew.size())
return -15;
501 for (
int n = 0; n<nNodes; n++)
503 int nRndPos =
GetRandInt(vRandom.size() - n) + n;
504 SwapRandom(n, nRndPos);
505 assert(mapInfo.count(vRandom[n]) == 1);
506 vAddr.push_back(mapInfo[vRandom[n]]);
525 int64 nUpdateInterval = 20 * 60;
526 if (nTime - info.
nTime > nUpdateInterval)
int GetNewBucket(const std::vector< unsigned char > &nKey, const CNetAddr &src) const
bool Add_(const CAddress &addr, const CNetAddr &source, int64 nTimePenalty)
const_iterator begin() const
CAddrInfo * Create(const CAddress &addr, const CNetAddr &addrSource, int *pnId=NULL)
#define ADDRMAN_TRIED_BUCKETS_PER_GROUP
#define ADDRMAN_MIN_FAIL_DAYS
CAddress Select_(int nUnkBias)
#define ADDRMAN_TRIED_ENTRIES_INSPECT_ON_EVICT
Double ended buffer combining vector and stream-like interfaces.
unsigned long long uint64
#define ADDRMAN_TRIED_BUCKET_COUNT
CAddrInfo * Find(const CNetAddr &addr, int *pnId=NULL)
Extended statistics about a CAddress.
int SelectTried(int nKBucket)
A combination of a network address (CNetAddr) and a (TCP) port.
void MakeTried(CAddrInfo &info, int nId, int nOrigin)
A CService with information about it as peer.
double GetChance(int64 nNow=GetAdjustedTime()) const
void SwapRandom(unsigned int nRandomPos1, unsigned int nRandomPos2)
std::string ToString() const
#define ADDRMAN_NEW_BUCKET_SIZE
uint256 Hash(const T1 pbegin, const T1 pend)
void Connected_(const CService &addr, int64 nTime)
int ShrinkNew(int nUBucket)
std::vector< unsigned char > GetGroup() const
#define ADDRMAN_TRIED_BUCKET_SIZE
IP address (IPv6, or IPv4 using mapped IPv6 range (::FFFF:0:0/96))
#define ADDRMAN_GETADDR_MAX
void Good_(const CService &addr, int64 nTime)
bool IsTerrible(int64 nNow=GetAdjustedTime()) const
#define ADDRMAN_NEW_BUCKET_COUNT
int GetTriedBucket(const std::vector< unsigned char > &nKey) const
void GetAddr_(std::vector< CAddress > &vAddr)
void Attempt_(const CService &addr, int64 nTime)
#define ADDRMAN_NEW_BUCKETS_PER_SOURCE_GROUP
#define ADDRMAN_HORIZON_DAYS
#define ADDRMAN_MAX_FAILURES
#define ADDRMAN_GETADDR_MAX_PCT
#define ADDRMAN_NEW_BUCKETS_PER_ADDRESS
const_iterator end() const