mirror of
https://github.com/bitcoin/bitcoin.git
synced 2025-03-05 14:06:27 -05:00
[move-only] Move CAddrInfo to test-only header file
Now that no bitcoind callers require knowledge of the CAddrInfo object, it can be moved into the test-only header file. Review hint: use git diff --color-moved=dimmed-zebra --color-moved-ws=ignore-all-space
This commit is contained in:
parent
7cba9d5618
commit
e3f1ea659c
3 changed files with 73 additions and 72 deletions
|
@ -24,78 +24,6 @@ class AddrManImpl;
|
||||||
/** Default for -checkaddrman */
|
/** Default for -checkaddrman */
|
||||||
static constexpr int32_t DEFAULT_ADDRMAN_CONSISTENCY_CHECKS{0};
|
static constexpr int32_t DEFAULT_ADDRMAN_CONSISTENCY_CHECKS{0};
|
||||||
|
|
||||||
/**
|
|
||||||
* Extended statistics about a CAddress
|
|
||||||
*/
|
|
||||||
class CAddrInfo : public CAddress
|
|
||||||
{
|
|
||||||
public:
|
|
||||||
//! last try whatsoever by us (memory only)
|
|
||||||
int64_t nLastTry{0};
|
|
||||||
|
|
||||||
//! last counted attempt (memory only)
|
|
||||||
int64_t nLastCountAttempt{0};
|
|
||||||
|
|
||||||
private:
|
|
||||||
//! where knowledge about this address first came from
|
|
||||||
CNetAddr source;
|
|
||||||
|
|
||||||
//! last successful connection by us
|
|
||||||
int64_t nLastSuccess{0};
|
|
||||||
|
|
||||||
//! connection attempts since last successful attempt
|
|
||||||
int nAttempts{0};
|
|
||||||
|
|
||||||
//! reference count in new sets (memory only)
|
|
||||||
int nRefCount{0};
|
|
||||||
|
|
||||||
//! in tried set? (memory only)
|
|
||||||
bool fInTried{false};
|
|
||||||
|
|
||||||
//! position in vRandom
|
|
||||||
mutable int nRandomPos{-1};
|
|
||||||
|
|
||||||
friend class AddrManImpl;
|
|
||||||
friend class CAddrManDeterministic;
|
|
||||||
|
|
||||||
public:
|
|
||||||
|
|
||||||
SERIALIZE_METHODS(CAddrInfo, obj)
|
|
||||||
{
|
|
||||||
READWRITEAS(CAddress, obj);
|
|
||||||
READWRITE(obj.source, obj.nLastSuccess, obj.nAttempts);
|
|
||||||
}
|
|
||||||
|
|
||||||
CAddrInfo(const CAddress &addrIn, const CNetAddr &addrSource) : CAddress(addrIn), source(addrSource)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
CAddrInfo() : CAddress(), source()
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Calculate in which "tried" bucket this entry belongs
|
|
||||||
int GetTriedBucket(const uint256 &nKey, const std::vector<bool> &asmap) const;
|
|
||||||
|
|
||||||
//! Calculate in which "new" bucket this entry belongs, given a certain source
|
|
||||||
int GetNewBucket(const uint256 &nKey, const CNetAddr& src, const std::vector<bool> &asmap) const;
|
|
||||||
|
|
||||||
//! Calculate in which "new" bucket this entry belongs, using its default source
|
|
||||||
int GetNewBucket(const uint256 &nKey, const std::vector<bool> &asmap) const
|
|
||||||
{
|
|
||||||
return GetNewBucket(nKey, source, asmap);
|
|
||||||
}
|
|
||||||
|
|
||||||
//! Calculate in which position of a bucket to store this entry.
|
|
||||||
int GetBucketPosition(const uint256 &nKey, bool fNew, int nBucket) const;
|
|
||||||
|
|
||||||
//! Determine whether the statistics about this entry are bad enough so that it can just be deleted
|
|
||||||
bool IsTerrible(int64_t nNow = GetAdjustedTime()) const;
|
|
||||||
|
|
||||||
//! Calculate the relative chance this entry should be given when selecting nodes to connect to
|
|
||||||
double GetChance(int64_t nNow = GetAdjustedTime()) const;
|
|
||||||
};
|
|
||||||
|
|
||||||
/** Stochastic address manager
|
/** Stochastic address manager
|
||||||
*
|
*
|
||||||
* Design goals:
|
* Design goals:
|
||||||
|
|
|
@ -5,6 +5,78 @@
|
||||||
#ifndef BITCOIN_ADDRMAN_IMPL_H
|
#ifndef BITCOIN_ADDRMAN_IMPL_H
|
||||||
#define BITCOIN_ADDRMAN_IMPL_H
|
#define BITCOIN_ADDRMAN_IMPL_H
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Extended statistics about a CAddress
|
||||||
|
*/
|
||||||
|
class CAddrInfo : public CAddress
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
//! last try whatsoever by us (memory only)
|
||||||
|
int64_t nLastTry{0};
|
||||||
|
|
||||||
|
//! last counted attempt (memory only)
|
||||||
|
int64_t nLastCountAttempt{0};
|
||||||
|
|
||||||
|
private:
|
||||||
|
//! where knowledge about this address first came from
|
||||||
|
CNetAddr source;
|
||||||
|
|
||||||
|
//! last successful connection by us
|
||||||
|
int64_t nLastSuccess{0};
|
||||||
|
|
||||||
|
//! connection attempts since last successful attempt
|
||||||
|
int nAttempts{0};
|
||||||
|
|
||||||
|
//! reference count in new sets (memory only)
|
||||||
|
int nRefCount{0};
|
||||||
|
|
||||||
|
//! in tried set? (memory only)
|
||||||
|
bool fInTried{false};
|
||||||
|
|
||||||
|
//! position in vRandom
|
||||||
|
mutable int nRandomPos{-1};
|
||||||
|
|
||||||
|
friend class AddrManImpl;
|
||||||
|
friend class CAddrManDeterministic;
|
||||||
|
|
||||||
|
public:
|
||||||
|
|
||||||
|
SERIALIZE_METHODS(CAddrInfo, obj)
|
||||||
|
{
|
||||||
|
READWRITEAS(CAddress, obj);
|
||||||
|
READWRITE(obj.source, obj.nLastSuccess, obj.nAttempts);
|
||||||
|
}
|
||||||
|
|
||||||
|
CAddrInfo(const CAddress &addrIn, const CNetAddr &addrSource) : CAddress(addrIn), source(addrSource)
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
CAddrInfo() : CAddress(), source()
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
//! Calculate in which "tried" bucket this entry belongs
|
||||||
|
int GetTriedBucket(const uint256 &nKey, const std::vector<bool> &asmap) const;
|
||||||
|
|
||||||
|
//! Calculate in which "new" bucket this entry belongs, given a certain source
|
||||||
|
int GetNewBucket(const uint256 &nKey, const CNetAddr& src, const std::vector<bool> &asmap) const;
|
||||||
|
|
||||||
|
//! Calculate in which "new" bucket this entry belongs, using its default source
|
||||||
|
int GetNewBucket(const uint256 &nKey, const std::vector<bool> &asmap) const
|
||||||
|
{
|
||||||
|
return GetNewBucket(nKey, source, asmap);
|
||||||
|
}
|
||||||
|
|
||||||
|
//! Calculate in which position of a bucket to store this entry.
|
||||||
|
int GetBucketPosition(const uint256 &nKey, bool fNew, int nBucket) const;
|
||||||
|
|
||||||
|
//! Determine whether the statistics about this entry are bad enough so that it can just be deleted
|
||||||
|
bool IsTerrible(int64_t nNow = GetAdjustedTime()) const;
|
||||||
|
|
||||||
|
//! Calculate the relative chance this entry should be given when selecting nodes to connect to
|
||||||
|
double GetChance(int64_t nNow = GetAdjustedTime()) const;
|
||||||
|
};
|
||||||
|
|
||||||
class AddrManImpl
|
class AddrManImpl
|
||||||
{
|
{
|
||||||
public:
|
public:
|
||||||
|
|
|
@ -4,6 +4,7 @@
|
||||||
|
|
||||||
#include <addrdb.h>
|
#include <addrdb.h>
|
||||||
#include <addrman.h>
|
#include <addrman.h>
|
||||||
|
#include <addrman_impl.h>
|
||||||
#include <blockencodings.h>
|
#include <blockencodings.h>
|
||||||
#include <blockfilter.h>
|
#include <blockfilter.h>
|
||||||
#include <chain.h>
|
#include <chain.h>
|
||||||
|
|
Loading…
Add table
Reference in a new issue