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

First part of fetch acceleration changes. Includes a bugfix that I'll push to master.

Browse Source
This commit is contained in:
JoelKatz
2013-04-21 12:44:21 -07:00
parent b993c6ee32
commit 79ec8e6070
11 changed files with 272 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
src/cpp/ripple/SHAMap.h
View File

@@ -35,7 +35,7 @@ private:
int mDepth;
mutable size_t mHash;
void setHash() const;
void setMHash() const;
protected:
SHAMapNode(int depth, const uint256& id, bool) : mNodeID(id), mDepth(depth), mHash(0) { ; }
@@ -51,7 +51,7 @@ public:
const uint256& getNodeID() const { return mNodeID; }
bool isValid() const { return (mDepth >= 0) && (mDepth < 64); }
bool isRoot() const { return mDepth == 0; }
size_t getHash() const { if (mHash == 0) setHash(); return mHash; }
size_t getMHash() const { if (mHash == 0) setMHash(); return mHash; }
virtual bool isPopulated() const { return false; }
@@ -329,10 +329,33 @@ public:
static SMAddNode invalid() { return SMAddNode(true, false); }
};
class SHAMapIterator
{
friend class SHAMap;
typedef std::pair<SHAMapTreeNode*, int> stack_t;
SHAMap& mMap;
std::stack<stack_t> mStack;
bool mInner, mLeaf, mLock;
public:
SHAMapIterator(SHAMap& map, bool returnInner, bool returnLeaf);
~SHAMapIterator();
bool lock();
bool unlock();
void reset();
SHAMapTreeNode* getNext();
};
extern bool SMANCombine(SMAddNode& existing, const SMAddNode& additional);
class SHAMap : public IS_INSTANCE(SHAMap)
{
friend class SHAMapIterator;
public:
typedef boost::shared_ptr<SHAMap> pointer;
typedef const boost::shared_ptr<SHAMap>& ref;
@@ -341,7 +364,7 @@ public:
typedef std::map<uint256, SHAMapDiffItem> SHAMapDiff;
typedef boost::unordered_map<SHAMapNode, SHAMapTreeNode::pointer> SHADirtyMap;
private:
protected:
uint32 mSeq;
mutable boost::recursive_mutex mLock;
boost::unordered_map<SHAMapNode, SHAMapTreeNode::pointer> mTNByID;
@@ -356,8 +379,6 @@ private:
static KeyCache<uint256> fullBelowCache;
protected:
void dirtyUp(std::stack<SHAMapTreeNode::pointer>& stack, const uint256& target, uint256 prevHash);
std::stack<SHAMapTreeNode::pointer> getStack(const uint256& id, bool include_nonmatching_leaf, bool partialOk);
SHAMapTreeNode::pointer walkTo(const uint256& id, bool modify);
@@ -479,5 +500,8 @@ public:
static void sweep() { fullBelowCache.sweep(); }
};
extern std::list< std::pair<uint256, std::vector<unsigned char> > >
getSyncInfo(SHAMap::pointer have, SHAMap::pointer want, int max);
#endif
// vim:ts=4