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

Use the new uptime code. Replace slow, non-monotonic 'time(NULL)' calls

Browse Source 
with fast, almost-always-monotonic 'upTime()' calls.
This commit is contained in:
JoelKatz
2013-02-05 22:31:26 -08:00
parent 8c36646b8c
commit 1808454983
10 changed files with 44 additions and 35 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
src/cpp/ripple/KeyCache.h
View File

@@ -6,11 +6,13 @@
#include <boost/unordered_map.hpp>
#include <boost/thread/mutex.hpp>
extern int upTime();
template <typename c_Key> class KeyCache
{ // Maintains a cache of keys with no associated data
public:
typedef c_Key key_type;
typedef boost::unordered_map<key_type, time_t> map_type;
typedef boost::unordered_map<key_type, int> map_type;
typedef typename map_type::iterator map_iterator;
protected:
@@ -65,7 +67,7 @@ public:
if (it == mCache.end())
return false;
if (refresh)
it->second = time(NULL);
it->second = upTime();
return true;
}
@@ -88,19 +90,19 @@ public:
map_iterator it = mCache.find(key);
if (it != mCache.end())
{
it->second = time(NULL);
it->second = upTime();
return false;
}
mCache.insert(std::make_pair(key, time(NULL)));
mCache.insert(std::make_pair(key, upTime()));
return true;
}
void sweep()
{ // Remove stale entries from the cache
time_t now = time(NULL);
int now = upTime();
boost::mutex::scoped_lock sl(mNCLock);
time_t target;
int target;
if ((mTargetSize == 0) || (mCache.size() <= mTargetSize))
target = now - mTargetAge;
else