Stochastical (IP) address manager. More...

#include <addrman.h>

Collaboration diagram for CAddrMan:

Public Member Functions
	IMPLEMENT_SERIALIZE (({{LOCK(cs);unsigned char nVersion=0;READWRITE(nVersion);READWRITE(nKey);READWRITE(nNew);READWRITE(nTried);CAddrMan am=const_cast< CAddrMan >(this);if(fWrite){int nUBuckets=ADDRMAN_NEW_BUCKET_COUNT;READWRITE(nUBuckets);std::map< int, int > mapUnkIds;int nIds=0;for(std::map< int, CAddrInfo >::iterator it=am->mapInfo.begin();it!=am->mapInfo.end();it++){if(nIds==nNew) break;mapUnkIds[(it).first]=nIds;CAddrInfo &info=(it).second;if(info.nRefCount){READWRITE(info);nIds++;}}nIds=0;for(std::map< int, CAddrInfo >::iterator it=am->mapInfo.begin();it!=am->mapInfo.end();it++){if(nIds==nTried) break;CAddrInfo &info=(it).second;if(info.fInTried){READWRITE(info);nIds++;}}for(std::vector< std::set< int > >::iterator it=am->vvNew.begin();it!=am->vvNew.end();it++){const std::set< int > &vNew=(it);int nSize=vNew.size();READWRITE(nSize);for(std::set< int >::iterator it2=vNew.begin();it2!=vNew.end();it2++){int nIndex=mapUnkIds[*it2];READWRITE(nIndex);}}}else{int nUBuckets=0;READWRITE(nUBuckets);am->nIdCount=0;am->mapInfo.clear();am->mapAddr.clear();am->vRandom.clear();am->vvTried=std::vector< std::vector< int > >(ADDRMAN_TRIED_BUCKET_COUNT, std::vector< int >(0));am->vvNew=std::vector< std::set< int > >(ADDRMAN_NEW_BUCKET_COUNT, std::set< int >());for(int n=0;n< am->nNew;n++){CAddrInfo &info=am->mapInfo[n];READWRITE(info);am->mapAddr[info]=n;info.nRandomPos=vRandom.size();am->vRandom.push_back(n);if(nUBuckets!=ADDRMAN_NEW_BUCKET_COUNT){am->vvNew[info.GetNewBucket(am->nKey)].insert(n);info.nRefCount++;}}am->nIdCount=am->nNew;int nLost=0;for(int n=0;n< am->nTried;n++){CAddrInfo info;READWRITE(info);std::vector< int > &vTried=am->vvTried[info.GetTriedBucket(am->nKey)];if(vTried.size()< ADDRMAN_TRIED_BUCKET_SIZE){info.nRandomPos=vRandom.size();info.fInTried=true;am->vRandom.push_back(am->nIdCount);am->mapInfo[am->nIdCount]=info;am->mapAddr[info]=am->nIdCount;vTried.push_back(am->nIdCount);am->nIdCount++;}else{nLost++;}}am->nTried-=nLost;for(int b=0;b< nUBuckets;b++){std::set< int > &vNew=am->vvNew[b];int nSize=0;READWRITE(nSize);for(int n=0;n< nSize;n++){int nIndex=0;READWRITE(nIndex);CAddrInfo &info=am->mapInfo[nIndex];if(nUBuckets==ADDRMAN_NEW_BUCKET_COUNT &&info.nRefCount< ADDRMAN_NEW_BUCKETS_PER_ADDRESS){info.nRefCount++;vNew.insert(nIndex);}}}}}});) CAddrMan()

int	size ()

void	Check ()

bool	Add (const CAddress &addr, const CNetAddr &source, int64_t nTimePenalty=0)

bool	Add (const std::vector< CAddress > &vAddr, const CNetAddr &source, int64_t nTimePenalty=0)

void	Good (const CService &addr, int64_t nTime=GetAdjustedTime())

void	Attempt (const CService &addr, int64_t nTime=GetAdjustedTime())

CAddress	Select (int nUnkBias=50)

std::vector< CAddress >	GetAddr ()

void	Connected (const CService &addr, int64_t nTime=GetAdjustedTime())

Protected Member Functions
CAddrInfo *	Find (const CNetAddr &addr, int *pnId=NULL)

CAddrInfo *	Create (const CAddress &addr, const CNetAddr &addrSource, int *pnId=NULL)

void	SwapRandom (unsigned int nRandomPos1, unsigned int nRandomPos2)

int	SelectTried (int nKBucket)

int	ShrinkNew (int nUBucket)

void	MakeTried (CAddrInfo &info, int nId, int nOrigin)

void	Good_ (const CService &addr, int64_t nTime)

bool	Add_ (const CAddress &addr, const CNetAddr &source, int64_t nTimePenalty)

void	Attempt_ (const CService &addr, int64_t nTime)

CAddress	Select_ (int nUnkBias)

void	GetAddr_ (std::vector< CAddress > &vAddr)

void	Connected_ (const CService &addr, int64_t nTime)

Private Attributes
CCriticalSection	cs

std::vector< unsigned char >	nKey

int	nIdCount

std::map< int, CAddrInfo >	mapInfo

std::map< CNetAddr, int >	mapAddr

std::vector< int >	vRandom

int	nTried

std::vector< std::vector< int > >	vvTried

int	nNew

std::vector< std::set< int > >	vvNew

Detailed Description

Stochastical (IP) address manager.

Definition at line 166 of file addrman.h.

Member Function Documentation

bool CAddrMan::Add	(	const CAddress &	addr,
		const CNetAddr &	source,
		int64_t	nTimePenalty = `0`
	)

inline

Definition at line 413 of file addrman.h.

References Add_(), Check(), LOCK, LogPrint(), nNew, nTried, CNetAddr::ToString(), and CService::ToStringIPPort().

Referenced by ProcessMessage(), ThreadDNSAddressSeed(), and ThreadOpenConnections().

Here is the call graph for this function:

Here is the caller graph for this function:

bool CAddrMan::Add	(	const std::vector< CAddress > &	vAddr,
		const CNetAddr &	source,
		int64_t	nTimePenalty = `0`
	)

inline

Definition at line 428 of file addrman.h.

References Add_(), Check(), LOCK, LogPrint(), nNew, nTried, and CNetAddr::ToString().

Here is the call graph for this function:

bool CAddrMan::Add_	(	const CAddress &	addr,
		const CNetAddr &	source,
		int64_t	nTimePenalty
	)

protected

Definition at line 313 of file addrman.cpp.

References ADDRMAN_NEW_BUCKET_SIZE, ADDRMAN_NEW_BUCKETS_PER_ADDRESS, CAddrInfo::fInTried, GetAdjustedTime(), CAddrInfo::GetNewBucket(), GetRandInt(), CNetAddr::IsRoutable(), CAddrInfo::nRefCount, CAddress::nServices, and CAddress::nTime.

Referenced by Add().

Here is the call graph for this function:

Here is the caller graph for this function:

void CAddrMan::Attempt	(	const CService &	addr,
		int64_t	nTime = `GetAdjustedTime()`
	)

inline

Definition at line 455 of file addrman.h.

References Attempt_(), Check(), and LOCK.

Referenced by ConnectNode().

Here is the call graph for this function:

Here is the caller graph for this function:

void CAddrMan::Attempt_	(	const CService &	addr,
		int64_t	nTime
	)

protected

Definition at line 370 of file addrman.cpp.

References CAddrInfo::nAttempts, and CAddress::nLastTry.

Referenced by Attempt().

Here is the caller graph for this function:

void CAddrMan::Check ( )

inline

Definition at line 400 of file addrman.h.

References LOCK, and LogPrintf.

Referenced by Add(), Attempt(), Connected(), GetAddr(), Good(), and Select().

Here is the caller graph for this function:

void CAddrMan::Connected	(	const CService &	addr,
		int64_t	nTime = `GetAdjustedTime()`
	)

inline

Definition at line 493 of file addrman.h.

References Check(), Connected_(), and LOCK.

Referenced by AddressCurrentlyConnected().

Here is the call graph for this function:

Here is the caller graph for this function:

void CAddrMan::Connected_	(	const CService &	addr,
		int64_t	nTime
	)

protected

Definition at line 509 of file addrman.cpp.

References CAddress::nTime.

Referenced by Connected().

Here is the caller graph for this function:

CAddrInfo * CAddrMan::Create	(	const CAddress &	addr,
		const CNetAddr &	addrSource,
		int *	pnId = `NULL`
	)

protected

Definition at line 96 of file addrman.cpp.

CAddrInfo * CAddrMan::Find	(	const CNetAddr &	addr,
		int *	pnId = `NULL`
	)

protected

Definition at line 83 of file addrman.cpp.

std::vector<CAddress> CAddrMan::GetAddr ( )

inline

Definition at line 480 of file addrman.h.

References Check(), GetAddr_(), and LOCK.

Referenced by ProcessMessage().

Here is the call graph for this function:

Here is the caller graph for this function:

void CAddrMan::GetAddr_ ( std::vector< CAddress > & vAddr )

protected

Definition at line 493 of file addrman.cpp.

References ADDRMAN_GETADDR_MAX, ADDRMAN_GETADDR_MAX_PCT, and GetRandInt().

Referenced by GetAddr().

Here is the call graph for this function:

Here is the caller graph for this function:

void CAddrMan::Good	(	const CService &	addr,
		int64_t	nTime = `GetAdjustedTime()`
	)

inline

Definition at line 444 of file addrman.h.

References Check(), Good_(), and LOCK.

Referenced by ProcessMessage().

Here is the call graph for this function:

Here is the caller graph for this function:

void CAddrMan::Good_	(	const CService &	addr,
		int64_t	nTime
	)

protected

Definition at line 264 of file addrman.cpp.

References CAddrInfo::fInTried, GetRandInt(), LogPrint(), CAddrInfo::nAttempts, CAddrInfo::nLastSuccess, CAddress::nLastTry, CAddress::nTime, and CService::ToString().

Referenced by Good().

Here is the call graph for this function:

Here is the caller graph for this function:

CAddrMan::IMPLEMENT_SERIALIZE ( ({{LOCK(cs);unsigned char nVersion=0;READWRITE(nVersion);READWRITE(nKey);READWRITE(nNew);READWRITE(nTried);CAddrMan *am=const_cast< CAddrMan * >(this);if(fWrite){int nUBuckets=ADDRMAN_NEW_BUCKET_COUNT;READWRITE(nUBuckets);std::map< int, int > mapUnkIds;int nIds=0;for(std::map< int, CAddrInfo >::iterator it=am->mapInfo.begin();it!=am->mapInfo.end();it++){if(nIds==nNew) break;mapUnkIds[(*it).first]=nIds;CAddrInfo &info=(*it).second;if(info.nRefCount){READWRITE(info);nIds++;}}nIds=0;for(std::map< int, CAddrInfo >::iterator it=am->mapInfo.begin();it!=am->mapInfo.end();it++){if(nIds==nTried) break;CAddrInfo &info=(*it).second;if(info.fInTried){READWRITE(info);nIds++;}}for(std::vector< std::set< int > >::iterator it=am->vvNew.begin();it!=am->vvNew.end();it++){const std::set< int > &vNew=(*it);int nSize=vNew.size();READWRITE(nSize);for(std::set< int >::iterator it2=vNew.begin();it2!=vNew.end();it2++){int nIndex=mapUnkIds[*it2];READWRITE(nIndex);}}}else{int nUBuckets=0;READWRITE(nUBuckets);am->nIdCount=0;am->mapInfo.clear();am->mapAddr.clear();am->vRandom.clear();am->vvTried=std::vector< std::vector< int > >(ADDRMAN_TRIED_BUCKET_COUNT, std::vector< int >(0));am->vvNew=std::vector< std::set< int > >(ADDRMAN_NEW_BUCKET_COUNT, std::set< int >());for(int n=0;n< am->nNew;n++){CAddrInfo &info=am->mapInfo[n];READWRITE(info);am->mapAddr[info]=n;info.nRandomPos=vRandom.size();am->vRandom.push_back(n);if(nUBuckets!=ADDRMAN_NEW_BUCKET_COUNT){am->vvNew[info.GetNewBucket(am->nKey)].insert(n);info.nRefCount++;}}am->nIdCount=am->nNew;int nLost=0;for(int n=0;n< am->nTried;n++){CAddrInfo info;READWRITE(info);std::vector< int > &vTried=am->vvTried[info.GetTriedBucket(am->nKey)];if(vTried.size()< ADDRMAN_TRIED_BUCKET_SIZE){info.nRandomPos=vRandom.size();info.fInTried=true;am->vRandom.push_back(am->nIdCount);am->mapInfo[am->nIdCount]=info;am->mapAddr[info]=am->nIdCount;vTried.push_back(am->nIdCount);am->nIdCount++;}else{nLost++;}}am->nTried-=nLost;for(int b=0;b< nUBuckets;b++){std::set< int > &vNew=am->vvNew[b];int nSize=0;READWRITE(nSize);for(int n=0;n< nSize;n++){int nIndex=0;READWRITE(nIndex);CAddrInfo &info=am->mapInfo[nIndex];if(nUBuckets==ADDRMAN_NEW_BUCKET_COUNT &&info.nRefCount< ADDRMAN_NEW_BUCKETS_PER_ADDRESS){info.nRefCount++;vNew.insert(nIndex);}}}}}}); )