ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-12-06 17:27:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

Depth-first travese in semi-random order to make sync more efficient

Browse Source 
from multiple sources.
This commit is contained in:
JoelKatz
2012-05-23 02:16:29 -07:00
parent f8d0269bd6
commit 902c0c3bc4
1 changed files with 11 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
src/SHAMapSync.cpp
View File

@@ -33,19 +33,23 @@ void SHAMap::getMissingNodes(std::vector<SHAMapNode>& nodeIDs, std::vector<uint2
SHAMapTreeNode::pointer node = stack.top();
stack.pop();
for (int i = 0; i < 16; ++i)
if (!node->isEmptyBranch(i))
int base = rand() % 256;
for (int ii = 0; ii < 16; ++ii)
{ // traverse in semi-random order
int branch = (base + ii) % 16;
if (!node->isEmptyBranch(branch))
{
SHAMapTreeNode::pointer desc = getNode(node->getChildNodeID(i), node->getChildHash(i), false);
if (!desc)
SHAMapTreeNode::pointer d = getNode(node->getChildNodeID(branch), node->getChildHash(branch), false);
if (!d)
{
nodeIDs.push_back(node->getChildNodeID(i));
nodeIDs.push_back(node->getChildNodeID(branch));
if (--max <= 0)
return;
}
else if (desc->isInner() && !desc->isFullBelow())
stack.push(desc);
else if (d->isInner() && !d->isFullBelow())
stack.push(d);
}
}
}
}