ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-11-24 21:15:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

Reformatting using AStyle

Browse Source
This commit is contained in:
Vinnie Falco
2013-06-14 08:45:13 -07:00
parent 36bd8f7173
commit 521e812fc4
294 changed files with 54609 additions and 47598 deletions
Download Patch File Download Diff File Expand all files Collapse all files

175
src/cpp/ripple/ripple_HashRouter.cpp
View File

@@ -1,152 +1,155 @@
DECLARE_INSTANCE(HashRouterEntry);
DECLARE_INSTANCE (HashRouterEntry);
// VFALCO TODO Inline the function definitions
class HashRouter : public IHashRouter
{
public:
explicit HashRouter (int holdTime)
explicit HashRouter (int holdTime)
: mHoldTime (holdTime)
{
}
bool addSuppression(uint256 const& index);
bool addSuppression (uint256 const& index);
bool addSuppressionPeer(uint256 const& index, uint64 peer);
bool addSuppressionPeer(uint256 const& index, uint64 peer, int& flags);
bool addSuppressionFlags(uint256 const& index, int flag);
bool setFlag(uint256 const& index, int flag);
int getFlags(uint256 const& index);
bool addSuppressionPeer (uint256 const& index, uint64 peer);
bool addSuppressionPeer (uint256 const& index, uint64 peer, int& flags);
bool addSuppressionFlags (uint256 const& index, int flag);
bool setFlag (uint256 const& index, int flag);
int getFlags (uint256 const& index);
HashRouterEntry getEntry(uint256 const& );
HashRouterEntry getEntry (uint256 const& );
bool swapSet(uint256 const& index, std::set<uint64>& peers, int flag);
bool swapSet (uint256 const& index, std::set<uint64>& peers, int flag);
private:
boost::mutex mSuppressionMutex;
boost::mutex mSuppressionMutex;
// Stores all suppressed hashes and their expiration time
boost::unordered_map <uint256, HashRouterEntry> mSuppressionMap;
// Stores all suppressed hashes and their expiration time
boost::unordered_map <uint256, HashRouterEntry> mSuppressionMap;
// Stores all expiration times and the hashes indexed for them
std::map< int, std::list<uint256> > mSuppressionTimes;
// Stores all expiration times and the hashes indexed for them
std::map< int, std::list<uint256> > mSuppressionTimes;
int mHoldTime;
int mHoldTime;
HashRouterEntry& findCreateEntry(uint256 const& , bool& created);
HashRouterEntry& findCreateEntry (uint256 const& , bool& created);
};
HashRouterEntry& HashRouter::findCreateEntry(uint256 const& index, bool& created)
HashRouterEntry& HashRouter::findCreateEntry (uint256 const& index, bool& created)
{
boost::unordered_map<uint256, HashRouterEntry>::iterator fit = mSuppressionMap.find(index);
boost::unordered_map<uint256, HashRouterEntry>::iterator fit = mSuppressionMap.find (index);
if (fit != mSuppressionMap.end())
{
created = false;
return fit->second;
}
created = true;
if (fit != mSuppressionMap.end ())
{
created = false;
return fit->second;
}
int now = UptimeTimer::getInstance().getElapsedSeconds ();
int expireTime = now - mHoldTime;
created = true;
// See if any supressions need to be expired
std::map< int, std::list<uint256> >::iterator it = mSuppressionTimes.begin();
if ((it != mSuppressionTimes.end()) && (it->first <= expireTime))
{
BOOST_FOREACH(uint256 const& lit, it->second)
mSuppressionMap.erase(lit);
mSuppressionTimes.erase(it);
}
int now = UptimeTimer::getInstance ().getElapsedSeconds ();
int expireTime = now - mHoldTime;
mSuppressionTimes[now].push_back(index);
return mSuppressionMap.emplace(index, HashRouterEntry ()).first->second;
// See if any supressions need to be expired
std::map< int, std::list<uint256> >::iterator it = mSuppressionTimes.begin ();
if ((it != mSuppressionTimes.end ()) && (it->first <= expireTime))
{
BOOST_FOREACH (uint256 const & lit, it->second)
mSuppressionMap.erase (lit);
mSuppressionTimes.erase (it);
}
mSuppressionTimes[now].push_back (index);
return mSuppressionMap.emplace (index, HashRouterEntry ()).first->second;
}
bool HashRouter::addSuppression(uint256 const& index)
bool HashRouter::addSuppression (uint256 const& index)
{
boost::mutex::scoped_lock sl(mSuppressionMutex);
boost::mutex::scoped_lock sl (mSuppressionMutex);
bool created;
findCreateEntry(index, created);
return created;
bool created;
findCreateEntry (index, created);
return created;
}
HashRouterEntry HashRouter::getEntry(uint256 const& index)
HashRouterEntry HashRouter::getEntry (uint256 const& index)
{
boost::mutex::scoped_lock sl(mSuppressionMutex);
boost::mutex::scoped_lock sl (mSuppressionMutex);
bool created;
return findCreateEntry(index, created);
bool created;
return findCreateEntry (index, created);
}
bool HashRouter::addSuppressionPeer(uint256 const& index, uint64 peer)
bool HashRouter::addSuppressionPeer (uint256 const& index, uint64 peer)
{
boost::mutex::scoped_lock sl(mSuppressionMutex);
boost::mutex::scoped_lock sl (mSuppressionMutex);
bool created;
findCreateEntry(index, created).addPeer(peer);
return created;
bool created;
findCreateEntry (index, created).addPeer (peer);
return created;
}
bool HashRouter::addSuppressionPeer(uint256 const& index, uint64 peer, int& flags)
bool HashRouter::addSuppressionPeer (uint256 const& index, uint64 peer, int& flags)
{
boost::mutex::scoped_lock sl(mSuppressionMutex);
boost::mutex::scoped_lock sl (mSuppressionMutex);
bool created;
HashRouterEntry &s = findCreateEntry(index, created);
s.addPeer(peer);
flags = s.getFlags();
return created;
bool created;
HashRouterEntry& s = findCreateEntry (index, created);
s.addPeer (peer);
flags = s.getFlags ();
return created;
}
int HashRouter::getFlags(uint256 const& index)
int HashRouter::getFlags (uint256 const& index)
{
boost::mutex::scoped_lock sl(mSuppressionMutex);
boost::mutex::scoped_lock sl (mSuppressionMutex);
bool created;
return findCreateEntry(index, created).getFlags();
bool created;
return findCreateEntry (index, created).getFlags ();
}
bool HashRouter::addSuppressionFlags(uint256 const& index, int flag)
bool HashRouter::addSuppressionFlags (uint256 const& index, int flag)
{
boost::mutex::scoped_lock sl(mSuppressionMutex);
boost::mutex::scoped_lock sl (mSuppressionMutex);
bool created;
findCreateEntry(index, created).setFlag(flag);
return created;
bool created;
findCreateEntry (index, created).setFlag (flag);
return created;
}
bool HashRouter::setFlag(uint256 const& index, int flag)
{ // return: true = changed, false = unchanged
assert(flag != 0);
bool HashRouter::setFlag (uint256 const& index, int flag)
{
// return: true = changed, false = unchanged
assert (flag != 0);
boost::mutex::scoped_lock sl(mSuppressionMutex);
boost::mutex::scoped_lock sl (mSuppressionMutex);
bool created;
HashRouterEntry &s = findCreateEntry(index, created);
bool created;
HashRouterEntry& s = findCreateEntry (index, created);
if ((s.getFlags() & flag) == flag)
return false;
if ((s.getFlags () & flag) == flag)
return false;
s.setFlag(flag);
return true;
s.setFlag (flag);
return true;
}
bool HashRouter::swapSet(uint256 const& index, std::set<uint64>& peers, int flag)
bool HashRouter::swapSet (uint256 const& index, std::set<uint64>& peers, int flag)
{
boost::mutex::scoped_lock sl(mSuppressionMutex);
boost::mutex::scoped_lock sl (mSuppressionMutex);
bool created;
HashRouterEntry &s = findCreateEntry(index, created);
bool created;
HashRouterEntry& s = findCreateEntry (index, created);
if ((s.getFlags() & flag) == flag)
return false;
if ((s.getFlags () & flag) == flag)
return false;
s.swapSet(peers);
s.setFlag(flag);
s.swapSet (peers);
s.setFlag (flag);
return true;
return true;
}
IHashRouter* IHashRouter::New (int holdTime)