|
|
|
@ -1202,22 +1202,14 @@ class CBlockLocator
@@ -1202,22 +1202,14 @@ class CBlockLocator
|
|
|
|
|
protected: |
|
|
|
|
std::vector<uint256> vHave; |
|
|
|
|
public: |
|
|
|
|
|
|
|
|
|
CBlockLocator() |
|
|
|
|
{ |
|
|
|
|
} |
|
|
|
|
CBlockLocator() {} |
|
|
|
|
|
|
|
|
|
explicit CBlockLocator(const CBlockIndex* pindex) |
|
|
|
|
{ |
|
|
|
|
Set(pindex); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
explicit CBlockLocator(uint256 hashBlock) |
|
|
|
|
{ |
|
|
|
|
std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock); |
|
|
|
|
if (mi != mapBlockIndex.end()) |
|
|
|
|
Set((*mi).second); |
|
|
|
|
} |
|
|
|
|
explicit CBlockLocator(uint256 hashBlock); |
|
|
|
|
|
|
|
|
|
CBlockLocator(const std::vector<uint256>& vHaveIn) |
|
|
|
|
{ |
|
|
|
@ -1241,83 +1233,16 @@ public:
@@ -1241,83 +1233,16 @@ public:
|
|
|
|
|
return vHave.empty(); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
void Set(const CBlockIndex* pindex) |
|
|
|
|
{ |
|
|
|
|
vHave.clear(); |
|
|
|
|
int nStep = 1; |
|
|
|
|
while (pindex) |
|
|
|
|
{ |
|
|
|
|
vHave.push_back(pindex->GetBlockHash()); |
|
|
|
|
|
|
|
|
|
// Exponentially larger steps back
|
|
|
|
|
for (int i = 0; pindex && i < nStep; i++) |
|
|
|
|
pindex = pindex->pprev; |
|
|
|
|
if (vHave.size() > 10) |
|
|
|
|
nStep *= 2; |
|
|
|
|
} |
|
|
|
|
vHave.push_back(hashGenesisBlock); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
int GetDistanceBack() |
|
|
|
|
{ |
|
|
|
|
// Retrace how far back it was in the sender's branch
|
|
|
|
|
int nDistance = 0; |
|
|
|
|
int nStep = 1; |
|
|
|
|
BOOST_FOREACH(const uint256& hash, vHave) |
|
|
|
|
{ |
|
|
|
|
std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash); |
|
|
|
|
if (mi != mapBlockIndex.end()) |
|
|
|
|
{ |
|
|
|
|
CBlockIndex* pindex = (*mi).second; |
|
|
|
|
if (pindex->IsInMainChain()) |
|
|
|
|
return nDistance; |
|
|
|
|
} |
|
|
|
|
nDistance += nStep; |
|
|
|
|
if (nDistance > 10) |
|
|
|
|
nStep *= 2; |
|
|
|
|
} |
|
|
|
|
return nDistance; |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
CBlockIndex* GetBlockIndex() |
|
|
|
|
{ |
|
|
|
|
// Find the first block the caller has in the main chain
|
|
|
|
|
BOOST_FOREACH(const uint256& hash, vHave) |
|
|
|
|
{ |
|
|
|
|
std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash); |
|
|
|
|
if (mi != mapBlockIndex.end()) |
|
|
|
|
{ |
|
|
|
|
CBlockIndex* pindex = (*mi).second; |
|
|
|
|
if (pindex->IsInMainChain()) |
|
|
|
|
return pindex; |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
return pindexGenesisBlock; |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
uint256 GetBlockHash() |
|
|
|
|
{ |
|
|
|
|
// Find the first block the caller has in the main chain
|
|
|
|
|
BOOST_FOREACH(const uint256& hash, vHave) |
|
|
|
|
{ |
|
|
|
|
std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash); |
|
|
|
|
if (mi != mapBlockIndex.end()) |
|
|
|
|
{ |
|
|
|
|
CBlockIndex* pindex = (*mi).second; |
|
|
|
|
if (pindex->IsInMainChain()) |
|
|
|
|
return hash; |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
return hashGenesisBlock; |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
int GetHeight() |
|
|
|
|
{ |
|
|
|
|
CBlockIndex* pindex = GetBlockIndex(); |
|
|
|
|
if (!pindex) |
|
|
|
|
return 0; |
|
|
|
|
return pindex->nHeight; |
|
|
|
|
} |
|
|
|
|
/** Given a block initialises the locator to that point in the chain. */ |
|
|
|
|
void Set(const CBlockIndex* pindex); |
|
|
|
|
/** Returns the distance in blocks this locator is from our chain head. */ |
|
|
|
|
int GetDistanceBack(); |
|
|
|
|
/** Returns the first best-chain block the locator contains. */ |
|
|
|
|
CBlockIndex* GetBlockIndex(); |
|
|
|
|
/** Returns the hash of the first best chain block the locator contains. */ |
|
|
|
|
uint256 GetBlockHash(); |
|
|
|
|
/** Returns the height of the first best chain block the locator has. */ |
|
|
|
|
int GetHeight(); |
|
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|